queue

Dec 19, 2025

Changes in this version

+ type ChanQueue struct

+ func (q *ChanQueue[T]) Clear()

+ func (q *ChanQueue[T]) Dequeue() (element T, ok bool)

+ func (q *ChanQueue[T]) Enqueue(values ...T)

+ func (q *ChanQueue[T]) EnqueueSequence(seq iter.Seq[T])

+ func (q *ChanQueue[T]) IsEmpty() bool

+ func (q *ChanQueue[T]) Len() int

+ func (q *ChanQueue[T]) Peek() (element T, ok bool)

+ func (q *ChanQueue[T]) Values() iter.Seq[T]

+ type IQueue interface

+ Clear func()

+ Dequeue func() (element T, ok bool)

+ Enqueue func(value ...T)

+ EnqueueSequence func(value iter.Seq[T])

+ IsEmpty func() bool

+ Len func() int

+ Peek func() (element T, ok bool)

+ Values func() iter.Seq[T]

+ func NewChannelQueue[T any](capacity int) (IQueue[T], error)

+ func NewQueue[T any]() IQueue[T]

+ func NewThreadSafeQueue[T any]() IQueue[T]

+ type Queue struct

+ func (s *Queue[T]) Clear()

+ func (s *Queue[T]) Dequeue() (element T, ok bool)

+ func (s *Queue[T]) Enqueue(value ...T)

+ func (s *Queue[T]) EnqueueSequence(seq iter.Seq[T])

+ func (s *Queue[T]) IsEmpty() bool

+ func (s *Queue[T]) Len() int

+ func (s *Queue[T]) Peek() (element T, ok bool)

+ func (s *Queue[T]) Values() iter.Seq[T]

+ type SafeQueue struct

+ func (q *SafeQueue[T]) Clear()

+ func (q *SafeQueue[T]) Dequeue() (T, bool)

+ func (q *SafeQueue[T]) Enqueue(value ...T)

+ func (q *SafeQueue[T]) EnqueueSequence(seq iter.Seq[T])

+ func (q *SafeQueue[T]) IsEmpty() bool

+ func (q *SafeQueue[T]) Len() int

+ func (q *SafeQueue[T]) Peek() (T, bool)

+ func (q *SafeQueue[T]) Values() iter.Seq[T]