Versions in this module Expand all Collapse all v0 v0.1.1 Sep 10, 2022 v0.1.0 Sep 10, 2022 Changes in this version + type PriorityQueue struct + func FromPriorityHeap(h *heap.Heap[V]) *PriorityQueue[V] + func NewPriority(cmp structs.CompareFunc[V]) *PriorityQueue[V] + func NewPriorityCap(capacity int, cmp structs.CompareFunc[V]) *PriorityQueue[V] + func (p *PriorityQueue[V]) Clear() + func (p *PriorityQueue[V]) Contains(value V) bool + func (p *PriorityQueue[V]) Dequeue() V + func (p *PriorityQueue[V]) Enqueue(value V) + func (p *PriorityQueue[V]) IsEmpty() bool + func (p *PriorityQueue[V]) Peek() V + func (p *PriorityQueue[V]) Size() int + func (p *PriorityQueue[V]) Values() []V + type Queue struct + func New(eq structs.EqualFunc[V]) *Queue[V] + func NewOrdered() *Queue[V] + func (q *Queue[V]) Clear() + func (q *Queue[V]) Contains(value V) bool + func (q *Queue[V]) Dequeue() V + func (q *Queue[V]) DescendingIterator() structs.Iterator[V] + func (q *Queue[V]) Enqueue(value V) + func (q *Queue[V]) IsEmpty() bool + func (q *Queue[V]) Iterator() structs.Iterator[V] + func (q *Queue[V]) Peek() V + func (q *Queue[V]) Size() int + func (q *Queue[V]) Values() []V
Go to main page