A union-find data structure for maintaining disjoint sets.
For algebra of finite sets. It inherits ECMAScripts native Set.
Utility function for exhaustiveness checking with typed JS (TS or Flow)
Checks if arrays have no value in common.
Gives a set with values from all lists.
A set is a collection of unique values.
Compare two sets (array of items) and get relationships between them (Disjoint | Intersecting | Subset | Superset | Equal)
Gives a set with values in all lists.
Checks if value is a set.
Gives a set excluding values in lists.