Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type UnboundedQueue ¶
type UnboundedQueue[T any] interface {
Enqueue(T)
// Returns false if the queue is empty.
Dequeue() (T, bool)
// Returns the oldest element without removing it.
// Returns false if the queue is empty.
PeekHead() (T, bool)
// Returns the newest without removing it.
// Returns false if the queue is empty.
PeekTail() (T, bool)
Len() int
}
An unbounded queue. Not safe for concurrent access.
func NewUnboundedSliceQueue ¶
func NewUnboundedSliceQueue[T any](initSize int) UnboundedQueue[T]
Returns a new unbounded queue with the given initial slice size. Note that the returned queue is always empty -- [initSize] is just a hint to prevent unnecessary resizing.
Source Files
Click to show internal directories.
Click to hide internal directories.