A union-find data structure for maintaining disjoint sets.
turf boolean-disjoint module
Utility function for exhaustiveness checking with typed JS (TS or Flow)
Split a set of valued intervals into disjoint intervals.
Checks if iterables have no value in common.
Checks if maps have no common keys.
Checks if objects have no common keys.
Checks if sets have no common values.
Checks if arrays have no value in common.
Checks if entries have no common keys.
Checks if lists have no common keys.