utils

func (*DefaultLogger) Debug ¶

func (d *DefaultLogger) Debug(msg string, args ...any)

func (*DefaultLogger) Error ¶

func (d *DefaultLogger) Error(msg string, args ...any)

func (*DefaultLogger) Info ¶

func (d *DefaultLogger) Info(msg string, args ...any)

func (*DefaultLogger) Warn ¶

func (d *DefaultLogger) Warn(msg string, args ...any)

func (*FDQueue[S, E]) Close ¶

func (q *FDQueue[S, E]) Close() error

func (*FDQueue[S, E]) Drain ¶

func (q *FDQueue[S, E]) Drain(recs S) error

func (*FDQueue[S, E]) Feed ¶

func (q *FDQueue[S, E]) Feed() (recs S, err error)

func (Heap[T]) Fix ¶

func (h Heap[T]) Fix(i int)

Fix re-establishes the heap ordering after the element at index i has changed its value. Changing the value of the element at index i and then calling Fix is equivalent to, but less expensive than, calling Remove(h, i) followed by a Push of the new value. The complexity is O(log n) where n = h.Len().

func (*Heap[T]) Len ¶

func (h *Heap[T]) Len() int

func (*Heap[T]) Pop ¶

func (h *Heap[T]) Pop() (min T)

Pop removes and returns the minimum element (according to Less) from the heap. The complexity is O(log n) where n = h.Len(). Pop is equivalent to Remove(h, 0).

func (*Heap[T]) Push ¶

func (h *Heap[T]) Push(x T)

Push pushes the element x onto the heap. The complexity is O(log n) where n = h.Len().

func (*Heap[T]) Remove ¶

func (h *Heap[T]) Remove(i int) T

Remove removes and returns the element at index i from the heap. The complexity is O(log n) where n = h.Len().