Documentation
¶
Overview ¶
Package deque implements a simple queue of block hashes.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Queue ¶
type Queue struct {
// contains filtered or unexported fields
}
Queue provides a FIFO queue.
func (*Queue) Pop ¶
func (q *Queue) Pop() flow.Identifier
Pop removes the element from the head of the queue and returns it. If the queue is empty, it returns nil.
func (*Queue) Push ¶
func (q *Queue) Push(elem flow.Identifier)
Push appends the element to the end of the queue.
Source Files
Click to show internal directories.
Click to hide internal directories.