Versions in this module Expand all Collapse all v1 v1.0.2 Dec 20, 2023 v1.0.1 Dec 19, 2023 Changes in this version + type LazyQueue struct + func NewLazyQueue[P constraints.Ordered, V any](setIndex SetIndexCallback[V], priority PriorityCallback[P, V], ...) *LazyQueue[P, V] + func (q *LazyQueue[P, V]) Empty() bool + func (q *LazyQueue[P, V]) MultiPop(callback func(data V, priority P) bool) + func (q *LazyQueue[P, V]) Pop() (V, P) + func (q *LazyQueue[P, V]) PopItem() V + func (q *LazyQueue[P, V]) Push(data V) + func (q *LazyQueue[P, V]) Refresh() + func (q *LazyQueue[P, V]) Remove(index int) V + func (q *LazyQueue[P, V]) Reset() + func (q *LazyQueue[P, V]) Size() int + func (q *LazyQueue[P, V]) Update(index int) + type MaxPriorityCallback func(data V, until mclock.AbsTime) P + type PriorityCallback func(data V) P + type Prque struct + func New[P constraints.Ordered, V any](setIndex SetIndexCallback[V]) *Prque[P, V] + func (p *Prque[P, V]) Empty() bool + func (p *Prque[P, V]) Peek() (V, P) + func (p *Prque[P, V]) Pop() (V, P) + func (p *Prque[P, V]) PopItem() V + func (p *Prque[P, V]) Push(data V, priority P) + func (p *Prque[P, V]) Remove(i int) V + func (p *Prque[P, V]) Reset() + func (p *Prque[P, V]) Size() int + type SetIndexCallback func(data V, index int)
Go to main page