set-utilities
High performance set theory - functional utilities which operate on arbitrary input sets.
Found 25 results for disjoint set
High performance set theory - functional utilities which operate on arbitrary input sets.
Split a set of valued intervals into disjoint intervals.
turf boolean-disjoint module
A union-find data structure for maintaining disjoint sets.
An ESnext spec-compliant `Set.prototype.isDisjointFrom` shim/polyfill/replacement that works as far down as ES3
Disjoint-set forests for ES6
Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set).
A lightweight and performant sorted range map and set.
TypeScript library for mathematical set operations with type-safe disjoint unions and compile-time checking - types only
Utility function for exhaustiveness checking with TypeScript.
Javascript Object Extensions
Utility function for exhaustiveness checking with typed JS (TS or Flow)
Checks if arrays have no value in common.
Concatenates two simplicial complexes
Fixed-size disjoint set data structures for JavaScript
Utility function for exhaustiveness checking with typed JS (TS or Flow)
turf boolean-disjoint module
Utility function for exhaustiveness checking with typed JS (TS or Flow)
Disjoint-set data structures for JavaScript
Checks if arrays have no value in common.
Checks if arrays have no value in common.
Checks if arrays have no value in common.
Compare two sets (array of items) and get relationships between them (Disjoint | Intersecting | Subset | Superset | Equal)
Disjoint continuous ranges