assumendaet
1.4.0 • Published 2 years ago
A lightweight and performant sorted range map and set.
Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set).
High performance set theory - functional utilities which operate on arbitrary input sets.
An ESnext spec-compliant `Set.prototype.isDisjointFrom` shim/polyfill/replacement that works as far down as ES3
Disjoint-set data structures for JavaScript