queue

May 13, 2025

Changes in this version

type Blocking

+ func (bq *Blocking[T]) MarshalJSON() ([]byte, error)

type Circular

+ func (q *Circular[T]) MarshalJSON() ([]byte, error)

type Linked

+ func (lq *Linked[T]) MarshalJSON() ([]byte, error)

type Priority

+ func (pq *Priority[T]) MarshalJSON() ([]byte, error)

Oct 24, 2023

Changes in this version

+ type Linked struct

+ func NewLinked(elements []T) *Linked[T]

+ func (lq *Linked[T]) Clear() []T

+ func (lq *Linked[T]) Contains(value T) bool

+ func (lq *Linked[T]) Get() (elem T, _ error)

+ func (lq *Linked[T]) IsEmpty() bool

+ func (lq *Linked[T]) Iterator() <-chan T

+ func (lq *Linked[T]) Offer(value T) error

+ func (lq *Linked[T]) Peek() (elem T, _ error)

+ func (lq *Linked[T]) Reset()

+ func (lq *Linked[T]) Size() int

Apr 14, 2023

Changes in this version

+ type Circular struct

+ func NewCircular(givenElems []T, capacity int, opts ...Option) *Circular[T]

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

+ func (q *Circular[T]) Contains(elem T) bool

+ func (q *Circular[T]) Get() (v T, _ error)

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

+ func (q *Circular[T]) Iterator() <-chan T

+ func (q *Circular[T]) Offer(item T) error

+ func (q *Circular[T]) Peek() (v T, _ error)

+ func (q *Circular[T]) Reset()

+ func (q *Circular[T]) Size() int

Mar 22, 2023

Changes in this version

type Blocking

+ func (bq *Blocking[T]) Clear() []T

+ func (bq *Blocking[T]) Contains(elem T) bool

+ func (bq *Blocking[T]) IsEmpty() bool

+ func (bq *Blocking[T]) Iterator() <-chan T

type Priority

+ func (pq *Priority[T]) Clear() []T

+ func (pq *Priority[T]) Contains(a T) bool

+ func (pq *Priority[T]) IsEmpty() bool

+ func (pq *Priority[T]) Iterator() <-chan T

type Queue

+ Clear func() []T

+ Contains func(T) bool

+ IsEmpty func() bool

+ Iterator func() <-chan T

Jan 25, 2023

Changes in this version

type Blocking

+ func (bq *Blocking[T]) GetWait() (v T)

+ func (bq *Blocking[T]) OfferWait(elem T)

+ func (bq *Blocking[T]) PeekWait() T

+ type Lesser interface

+ Less func(other any) bool

+ type Priority struct

+ func NewPriority(elems []T, opts ...Option) *Priority[T]

+ func (pq *Priority[T]) Get() (elem T, _ error)

+ func (pq *Priority[T]) Offer(elem T) error

+ func (pq *Priority[T]) Peek() (elem T, _ error)

+ func (pq *Priority[T]) Reset()

+ func (pq *Priority[T]) Size() int

type Queue

+ Reset func()

+ Size func() int

Jan 13, 2023

Changes in this version

+ var ErrQueueIsFull = errors.New("queue is full")

type Blocking

+ func (q *Blocking[T]) Offer(elem T) error

type Queue

+ Offer func(T) error

+ Take func() T

Jan 12, 2023

Changes in this version

+ var ErrNoElementsAvailable = errors.New("no elements available in the queue")

type Blocking

+ func (q *Blocking[T]) Get() (v T, _ error)

+ func (q *Blocking[T]) Put(elem T)

+ func (q *Blocking[T]) Size() int

+ type Option interface

+ func WithCapacity(capacity int) Option

+ type Queue interface

+ Get func() (T, error)

+ Peek func() T

+ Put func(T)

Jan 8, 2023

Changes in this version

type Blocking

+ func (q *Blocking[T]) Push(elem T)

Sep 11, 2022

Changes in this version

type Blocking

+ func (q *Blocking[T]) Refill(ctx context.Context)

Sep 2, 2022

Changes in this version

type Blocking

+ func (q *Blocking[T]) Peek() T

Sep 1, 2022

Changes in this version

+ type Blocking struct

+ func NewBlocking(elements []T) *Blocking[T]

+ func (q *Blocking[T]) Take(ctx context.Context) (v T)

+ func (q *Blocking[_]) Reset()