queue

Sep 1, 2021

Changes in this version

+ type Element interface

+ type Iterator struct

+ func (i *Iterator) Next() *Iterator

+ func (i *Iterator) Value() Element

+ type LinkedQueue struct

+ func NewLinkedQueue() *LinkedQueue

+ func (queue *LinkedQueue) Clear() bool

+ func (queue *LinkedQueue) Exist(e Element) bool

+ func (queue *LinkedQueue) IsEmpty() bool

+ func (queue *LinkedQueue) NewIterator() *Iterator

+ func (queue *LinkedQueue) PeekBack() Element

+ func (queue *LinkedQueue) PeekFront() Element

+ func (queue *LinkedQueue) PollBack() Element

+ func (queue *LinkedQueue) PollFront() Element

+ func (queue *LinkedQueue) PushBack(e Element)

+ func (queue *LinkedQueue) PushFront(e Element)

+ func (queue *LinkedQueue) Remove(e Element) bool

+ func (queue *LinkedQueue) Size() int

+ type Queue interface

+ Clear func() bool

+ Exist func(e Element) bool

+ IsEmpty func() bool

+ NewIterator func() *Iterator

+ PeekBack func() Element

+ PeekFront func() Element

+ PollBack func() Element

+ PollFront func() Element

+ PushBack func(e Element)

+ PushFront func(e Element)

+ Remove func(e Element) bool

+ Size func() int