Bucket

May 27, 2024

Changes in this version

+ func KeepIfBuckets[T any](buckets map[int]*Bucket[T], f slext.PredicateFilter[T]) map[int]*Bucket[T]

+ func MakeBuckets[T any](elems []T, f func(T) int) map[int]*Bucket[T]

+ func SortBuckets[T any](buckets map[int]*Bucket[T], f SortFunc[T])

+ func ViewTopNBuckets[T any](buckets map[int]*Bucket[T], n int) map[int]*Bucket[T]

+ type Bucket struct

+ func NewBucket[T any](elements []T) *Bucket[T]

+ func (b *Bucket[T]) Add(element T)

+ func (b *Bucket[T]) GetSize() int

+ func (b *Bucket[T]) InsertionSort(f SortFunc[T])

+ func (b *Bucket[T]) Iterator() ui.Iterater[T]

+ func (b *Bucket[T]) Limit(n int) *Bucket[T]

+ func (b *Bucket[T]) LinearKeep(f us.PredicateFilter[T])

+ type SortFunc func(b1, b2 T) bool