Versions in this module Expand all Collapse all v0 v0.2.0 Oct 30, 2024 v0.1.0 Apr 2, 2024 Changes in this version + type Deque struct + func NewDeque[T any](opts ...Option) *Deque[T] + func (dq *Deque[T]) Back() (_ T, ok bool) + func (dq *Deque[T]) Clear() + func (dq *Deque[T]) Dequeue() T + func (dq *Deque[T]) DequeueMany(max int) []T + func (dq *Deque[T]) DequeueManyWithBuffer(max int, buf []T) []T + func (dq *Deque[T]) Dump() []T + func (dq *Deque[T]) Enqueue(v T) + func (dq *Deque[T]) Front() (_ T, ok bool) + func (dq *Deque[T]) Insert(idx int, v T) + func (dq *Deque[T]) IsEmpty() bool + func (dq *Deque[T]) Len() int + func (dq *Deque[T]) Peek(idx int) T + func (dq *Deque[T]) PopBack() T + func (dq *Deque[T]) PopFront() T + func (dq *Deque[T]) PushBack(v T) + func (dq *Deque[T]) PushFront(v T) + func (dq *Deque[T]) Range(f func(i int, v T) bool) + func (dq *Deque[T]) Remove(idx int) + func (dq *Deque[T]) Replace(idx int, v T) + func (dq *Deque[T]) Swap(idx1, idx2 int) + func (dq *Deque[T]) TryDequeue() (_ T, ok bool) + func (dq *Deque[T]) TryPopBack() (_ T, ok bool) + func (dq *Deque[T]) TryPopFront() (_ T, ok bool) + type Option func(*optionHolder) + func WithChunkSize(n int) Option + type Queue struct + func NewQueueWithSize[T any](max int, inChanSize int) *Queue[T] + func NewQueue[T any]() *Queue[T] + func (q *Queue[T]) Clear() + func (q *Queue[T]) Dequeue() T + func (q *Queue[T]) DequeueC() <-chan T + func (q *Queue[T]) Destroy() + func (q *Queue[T]) Enqueue(v T) + func (q *Queue[T]) EnqueueC() chan<- T + func (q *Queue[T]) MaxSize() int + func (q *Queue[T]) Size() int + func (q *Queue[T]) TuneSize(max int)
Go to main page