@httpx/lru
LruCache implementations with O(1) complexity
non-replacement-random-item-sampler
An efficient random item sampler that ensures O(1) sampling complexity, and equal selection probability for all items across cycles. Each cycle ensures unique, non-repeating item selections, with each item sampled only once per cycle. Upon cycle completio
effi-find
Creates a function to choose an Item from a list in O(1)
@pranavpatel.ca/algo-kombin
KombiN is a library for bijectively mapping all ordered pairs from two finite sets into a single linear index. It orders pairs by ascending weight (sum of indices) using a three-region zig-zag algorithm, enabling O(1) bidirectional lookups between pairs a
