JSPM

turf boolean-disjoint module

A union-find data structure for maintaining disjoint sets.

Split a set of valued intervals into disjoint intervals.

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

Utility function for exhaustiveness checking with typed JS (TS or Flow)

Utility function for exhaustiveness checking with TypeScript.

Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set).

Checks if arrays have no value in common.

Javascript Object Extensions

Checks if arrays have no value in common.

Utility function for exhaustiveness checking with typed JS (TS or Flow)

Utility function for exhaustiveness checking with typed JS (TS or Flow)

A lightweight and performant sorted range map and set.

turf boolean-disjoint module

Concatenates two simplicial complexes

Disjoint-set forests for ES6

Checks if arrays have no value in common.

Disjoint continuous ranges

Fixed-size disjoint set data structures for JavaScript

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-set data structures for JavaScript