@eturino/key-set

key-set

KeySet with 4 classes to represent concepts of All, None, Some, and AllExceptSome, the last 2 with a sorted uniq list of keys, and all with intersection calculations.

(TypeScript port of https://github.com/eturino/ruby_key_set)

Library bootstrapped using typescript-starter.

Installation

yarn add @eturino/key-set or npm install @eturino/key-set.

Usage

We have 4 classes:

• KeySetAll
• KeySetNone
• KeySetSome
• KeySetAllExceptSome

Creation: all(), none(), some([...]) and allExceptSome([...])

Build your KeySets using the build functions

import { all, none, some, allExceptSome } from "@eturino/key-set"

all(); // => returns a new instance of KeySetAll
none(); // => returns a new instance of KeySetNone

some([1, 3, 2, 3]); // returns a new instance of KeySetSome with keys [1, 2, 3] (sorted, unique)
some([]); // returns a new instance of KeySetNone

allExceptSome([1, 3, 2, 3]); // returns a new instance of KeySetAllExceptSome with keys [1, 2, 3] (sorted, unique)
allExceptSome([]); // returnsa  new instance of KeySetAll

representsXXX()

all KeySet expose 4 methods representXXX(). Each class return false for all except their own.

• representsAll(): KeySetAll returns true
• representsNone(): KeySetNone returns true
• representsSome(): KeySetSome returns true
• representsAllExceptSome(): KeySetAllExceptSome returns true

clone()

all KeySet has a clone() method, which will return a new instance of the same class that represents the same KeySet.

If the KeySet is KeySetSome or KeySetAllExceptSome, they will have an array with the same keys.

const newKeySet = keySet.invert();

isEqual(other)

all KeySet has an isEqual(other) method that returns true if the other keySet is of the same class and represents the same KeySet.

If the KeySet is KeySetSome or KeySetAllExceptSome, they will have to have an array with the same keys.

if (keySet.isEqual(otherKeySet))

invert()

all KeySet has an invert() method that returns an instance of the opposite class, which represents the complementary KeySet.

• KeySetAll <- -> KeySetNone
• KeySetSome <- -> KeySetAllExceptSome

const complementaryKeySet = keySet.invert();

remove(other)

returns a new KeySet with the difference between ThisSet - OtherSet (A - B)

const diffKeySet = keySet.remove(other);

intersect(other)

returns a new KeySet with the intersection of both Sets (A ∩ B), representing the elements present in both sets

const diffKeySet = keySet.intersect(other);

Util functions

The lib also exports the 2 util functions used in the code

• uniqueArray(list): returns another array with unique items
  • adapted from https://medium.com/@jakubsynowiec/unique-array-values-in-javascript-7c932682766c (credit to Jakub Synowiec)
• arraysEqual(a, b): returns true if the 2 arrays have the same keys
  • adapted from https://stackoverflow.com/questions/3115982/how-to-check-if-two-arrays-are-equal-with-javascript (credit to enyo)