algorithm

Jan 23, 2026

Changes in this version

+ type DiffArray struct

+ func NewDiffArray(arr []int) *DiffArray

+ func (d *DiffArray) IncrementRange(l, r, val int)

+ func (d *DiffArray) ToArray() []int

+ type PriorityItemItf interface

+ GetVal func() T

Nov 6, 2025

Changes in this version

+ func BinarySearch[T any](s []T, cmp func(index int, element T) int) int

+ func GetLargestNItems[T common.Sortable](inputChan <-chan T, topN int) ([]T, error)

+ func GetSmallestNItems[T common.Sortable](inputChan <-chan T, topN int) ([]T, error)

+ func GetTopKItems[T common.Sortable](inputChan <-chan T, topN int, sortOrder common.SortOrder) (result []T, err error)

+ type Deque interface

+ Back func() T

+ Front func() T

+ Len func() int

+ PopBack func() T

+ PopFront func() T

+ PushBack func(T)

+ PushFront func(T)

+ func NewDeque[T any](optfs ...DequeOptFunc) (Deque[T], error)

+ type DequeOptFunc func(*dequeOpt) error

+ func WithDequeCurrentCapacity(size int) DequeOptFunc

+ func WithDequeMinimalCapacity(size int) DequeOptFunc

+ type FIFO struct

+ func NewFIFO() *FIFO

+ func (f *FIFO) Get() any

+ func (f *FIFO) Len() int

+ func (f *FIFO) Put(d any)

+ type PriorityItem struct

+ Name any

+ Val T

+ func (t PriorityItem[T]) GetVal() T

+ type PriorityQ struct

+ func NewPriorityQ[T common.Sortable](order common.SortOrder) *PriorityQ[T]

+ func (pq *PriorityQ[T]) Len() int

+ func (pq *PriorityQ[T]) Peek() PriotiryItemItf[T]

+ func (pq *PriorityQ[T]) Pop() PriotiryItemItf[T]

+ func (pq *PriorityQ[T]) Push(v PriotiryItemItf[T])

+ type PriotiryItemItf interface

+ GetVal func() T

+ type SkipList struct

+ func NewSkiplist[T skiplist.Sortable]() SkipList[T]