@suptxt/quickset

A fast and performant *Least Frequently Used* (LFU) sorted set implementation for working with reasonably sized integers (unsigned). Trades memory for performance, optimised for frequently updating and counting a relatively small set of integers (integer

countingsort

Sort an array of integers using Counting sort (where you only have integers and the min and max are known)

string-length

Get the real length of a string - by correctly counting astral symbols and ignoring ansi escape codes