@fluidframework/matrix 2.0.0-dev.5.2.0.169897 → 2.0.0-dev.6.4.0.191258

package/lib/bspSet.js

@@ -1,402 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { __assign } from "tslib";
-export const pair = (left, right) => [left, right];
-// using this polyfill, because `Object.assign` is not supported in IE.
-const ObjectAssign = __assign;
-export var SetKind;
-(function (SetKind) {
-    SetKind[SetKind["Dense"] = 0] = "Dense";
-    SetKind[SetKind["Empty"] = 1] = "Empty";
-})(SetKind || (SetKind = {}));
-export const dense = SetKind.Dense;
-export const empty = SetKind.Empty;
-export const cacheKeySplitting = (splitFunction, top, maxDepth = 10) => (key) => {
-    if (key.split !== undefined) {
-        return key.split;
-    }
-    const split = splitFunction(key);
-    const depth = key === top ? 0 : key.depth;
-    if (depth !== undefined && depth < maxDepth) {
-        key.split = split;
-        split[0][0].depth = depth + 1;
-        split[1][0].depth = depth + 1;
-    }
-    return split;
-};
-export function fromUntyped(setOperations, root) {
-    if (root === empty || root === dense) {
-        return root;
-    }
-    return { setOperations, root };
-}
-const sparse = (left, right, pathKey, key, isExact) => ({ key, pathKey, left, right, isExact });
-function fromKey(pathKey, key, isExact) {
-    if (isExact) {
-        return sparse(undefined, undefined, pathKey, key, true);
-    }
-    return sparse(undefined, undefined, pathKey, key, false);
-}
-export function lazy(setOperations, pathKey, key) {
-    if (!setOperations.meets(pathKey, key)) {
-        return empty;
-    }
-    const cmp = setOperations.compare(pathKey, key);
-    if (cmp !== undefined) {
-        if (cmp <= 0) {
-            return dense;
-        }
-        return fromKey(pathKey, key, true);
-    }
-    // this is not exactly necessary, but increases the amount of exact nodes and thus we can often
-    // prune earlier.
-    // Also, having intersect always work guarantees exact nodes, thus allowing for more efficient
-    // storage and computation.
-    const newKey = setOperations.intersect(pathKey, key);
-    if (newKey !== undefined) {
-        return fromKey(pathKey, newKey, true);
-    }
-    return fromKey(pathKey, key, false);
-}
-export function createFromKey(uncachedSetOperations) {
-    const setOperations = Object.assign(Object.assign({}, uncachedSetOperations), { split: cacheKeySplitting(uncachedSetOperations.split, uncachedSetOperations.top) });
-    return (key) => fromUntyped(setOperations, lazy(setOperations, setOperations.top, key));
-}
-function unionExact(setOperations, left, right) {
-    const { pathKey, key: leftKey } = left;
-    const { key: rightKey } = right;
-    const cmp = setOperations.compare(leftKey, rightKey);
-    if (cmp !== undefined) {
-        return cmp < 0 ? right : left;
-    }
-    const combinedKey = setOperations.union(leftKey, rightKey);
-    if (combinedKey !== undefined) {
-        const combinedCmp = setOperations.compare(combinedKey, pathKey);
-        if (combinedCmp !== undefined && combinedCmp === 0) {
-            return dense;
-        }
-        return fromKey(pathKey, combinedKey, true);
-    }
-    return undefined;
-}
-/** This is an local combination, not a proper union. We use it to have simpler code elsewhere */
-function combineChildren(left, right) {
-    if (left === empty) {
-        if (right === empty) {
-            return empty;
-        }
-        return sparse(left, right, undefined, undefined, false);
-    }
-    if (right === empty) {
-        return sparse(left, right, undefined, undefined, false);
-    }
-    if (left === dense) {
-        if (right === dense) {
-            return dense;
-        }
-        return sparse(left, right, undefined, undefined, false);
-    }
-    return sparse(left, right, undefined, undefined, false);
-}
-function materialize(setOperations, set) {
-    if (set.left !== undefined) {
-        return set;
-    }
-    const [[left], [right]] = setOperations.split(set.pathKey);
-    const lChild = lazy(setOperations, left, set.key);
-    const rChild = lazy(setOperations, right, set.key);
-    const res = combineChildren(lChild, rChild);
-    if (res === empty || res === dense) {
-        throw new Error("incorrect set operations implementation");
-    }
-    // first check, that res actually has the desired type
-    const typeCheck = res;
-    const setAlias = set;
-    return ObjectAssign(setAlias, {
-        left: typeCheck.left,
-        right: typeCheck.right,
-    });
-}
-export function unionUntyped(setOperations, left, right) {
-    if (right === empty) {
-        return left;
-    }
-    if (right === dense) {
-        return right;
-    }
-    if (left === empty) {
-        return right;
-    }
-    if (left === dense) {
-        return left;
-    }
-    if (left.isExact && right.isExact) {
-        const res = unionExact(setOperations, left, right);
-        if (res !== undefined) {
-            return res;
-        }
-    }
-    const newLeft = materialize(setOperations, left);
-    const newRight = materialize(setOperations, right);
-    const lChild = unionUntyped(setOperations, newLeft.left, newRight.left);
-    const rChild = unionUntyped(setOperations, newLeft.right, newRight.right);
-    return combineChildren(lChild, rChild);
-}
-export function union(left, right) {
-    if (right === empty) {
-        return left;
-    }
-    if (right === dense) {
-        return right;
-    }
-    if (left === empty) {
-        return right;
-    }
-    if (left === dense) {
-        return left;
-    }
-    return fromUntyped(left.setOperations, unionUntyped(left.setOperations, left.root, right.root));
-}
-function intersectExact(setOperations, left, right) {
-    const { pathKey, key: leftKey } = left;
-    const { key: rightKey } = right;
-    if (!setOperations.meets(leftKey, rightKey)) {
-        return empty;
-    }
-    const cmp = setOperations.compare(leftKey, rightKey);
-    if (cmp !== undefined) {
-        return cmp < 0 ? left : right;
-    }
-    const combinedKey = setOperations.intersect(leftKey, rightKey);
-    if (combinedKey !== undefined) {
-        return fromKey(pathKey, combinedKey, true);
-    }
-    return undefined;
-}
-export function intersectUntyped(setOperations, left, right) {
-    if (left === empty) {
-        return left;
-    }
-    if (right === empty) {
-        return right;
-    }
-    if (left === dense) {
-        return right;
-    }
-    if (right === dense) {
-        return left;
-    }
-    if (left.isExact && right.isExact) {
-        const res = intersectExact(setOperations, left, right);
-        if (res !== undefined) {
-            return res;
-        }
-    }
-    const newLeft = materialize(setOperations, left);
-    const newRight = materialize(setOperations, right);
-    const lChild = intersectUntyped(setOperations, newLeft.left, newRight.left);
-    const rChild = intersectUntyped(setOperations, newLeft.right, newRight.right);
-    return combineChildren(lChild, rChild);
-}
-export function intersect(left, right) {
-    if (left === empty) {
-        return left;
-    }
-    if (right === empty) {
-        return right;
-    }
-    if (left === dense) {
-        return right;
-    }
-    if (right === dense) {
-        return left;
-    }
-    return fromUntyped(left.setOperations, intersectUntyped(left.setOperations, left.root, right.root));
-}
-export function meetsUntyped(setOperations, left, right) {
-    if (left === empty || right === empty) {
-        return false;
-    }
-    if (left === dense || right === dense) {
-        return true;
-    }
-    if (left.isExact && right.isExact) {
-        return setOperations.meets(left.key, right.key);
-    }
-    const newLeft = materialize(setOperations, left);
-    const newRight = materialize(setOperations, right);
-    return (meetsUntyped(setOperations, newLeft.left, newRight.left) ||
-        meetsUntyped(setOperations, newLeft.right, newRight.right));
-}
-export function meets(left, right) {
-    if (left === empty || right === empty) {
-        return false;
-    }
-    if (left === dense || right === dense) {
-        return true;
-    }
-    return meetsUntyped(left.setOperations, left.root, right.root);
-}
-function exceptExact(setOperations, left, right) {
-    const { pathKey, key: leftKey } = left;
-    const { key: rightKey } = right;
-    if (!setOperations.meets(leftKey, rightKey)) {
-        return left;
-    }
-    const combinedKey = setOperations.except(leftKey, rightKey);
-    if (combinedKey !== undefined) {
-        return fromKey(pathKey, combinedKey, true);
-    }
-    return undefined;
-}
-export function exceptUntyped(setOperations, left, right) {
-    if (left === empty) {
-        return left;
-    }
-    if (right === empty) {
-        return left;
-    }
-    if (right === dense) {
-        return empty;
-    }
-    if (left === dense) {
-        const newRight_inner = materialize(setOperations, right);
-        const lChild_inner = exceptUntyped(setOperations, dense, newRight_inner.left);
-        const rChild_inner = exceptUntyped(setOperations, dense, newRight_inner.right);
-        return combineChildren(lChild_inner, rChild_inner);
-    }
-    if (left.isExact && right.isExact) {
-        const res = exceptExact(setOperations, left, right);
-        if (res !== undefined) {
-            return res;
-        }
-    }
-    const newLeft = materialize(setOperations, left);
-    const newRight = materialize(setOperations, right);
-    const lChild = exceptUntyped(setOperations, newLeft.left, newRight.left);
-    const rChild = exceptUntyped(setOperations, newLeft.right, newRight.right);
-    return combineChildren(lChild, rChild);
-}
-export function except(left, right) {
-    if (left === empty) {
-        return left;
-    }
-    if (right === empty) {
-        return left;
-    }
-    if (right === dense) {
-        return empty;
-    }
-    if (left === dense) {
-        return fromUntyped(right.setOperations, exceptUntyped(right.setOperations, left, right.root));
-    }
-    return fromUntyped(left.setOperations, exceptUntyped(left.setOperations, left.root, right.root));
-}
-const compareExact = (setOperations, left, right) => setOperations.compare(left.key, right.key);
-export function combineCmp(left, right) {
-    if (left === undefined || right === undefined) {
-        return undefined;
-    }
-    if (left === 0) {
-        return right;
-    }
-    if (right === 0) {
-        return left;
-    }
-    return left === right ? left : undefined;
-}
-export function compareUntyped(setOperations, left, right) {
-    if (left === right) {
-        return 0;
-    }
-    if (left === empty) {
-        return -1;
-    }
-    if (right === empty) {
-        return 1;
-    }
-    if (left === dense) {
-        if (right === dense) {
-            return 0;
-        }
-        return 1;
-    }
-    if (right === dense) {
-        return -1;
-    }
-    if (left.isExact && right.isExact) {
-        return compareExact(setOperations, left, right);
-    }
-    const newLeft = materialize(setOperations, left);
-    const newRight = materialize(setOperations, right);
-    const lCmp = compareUntyped(setOperations, newLeft.left, newRight.left);
-    if (lCmp === undefined) {
-        return undefined;
-    }
-    const rCmp = compareUntyped(setOperations, newLeft.right, newRight.right);
-    if (rCmp === undefined) {
-        return undefined;
-    }
-    return combineCmp(lCmp, rCmp);
-}
-export function compare(left, right) {
-    if (left === right) {
-        return 0;
-    }
-    if (left === empty) {
-        return -1;
-    }
-    if (right === empty) {
-        return 1;
-    }
-    if (left === dense) {
-        if (right === dense) {
-            return 0;
-        }
-        return 1;
-    }
-    if (right === dense) {
-        return -1;
-    }
-    return compareUntyped(left.setOperations, left.root, right.root);
-}
-export const symmetricDiff = (left, right) => union(except(left, right), except(right, left));
-export const complement = (set) => except(dense, set);
-function getNodeCountUntyped(set) {
-    if (set === undefined || set === empty || set === dense) {
-        return 0;
-    }
-    return getNodeCountUntyped(set.left) + getNodeCountUntyped(set.right) + 1;
-}
-export function getNodeCount(set) {
-    if (set === empty || set === dense) {
-        return 0;
-    }
-    return getNodeCountUntyped(set.root);
-}
-function forEachKeyUntyped(setOperations, set, f) {
-    function loop(pathKey, set_inner) {
-        if (set_inner === empty) {
-            return true;
-        }
-        if (set_inner === dense) {
-            return f(pathKey);
-        }
-        if (set_inner.isExact) {
-            return f(set_inner.key);
-        }
-        const newSet = materialize(setOperations, set_inner);
-        const [[left], [right]] = setOperations.split(pathKey);
-        return loop(left, newSet.left) && loop(right, newSet.right);
-    }
-    return loop(setOperations.top, set);
-}
-export function forEachKey(set, f) {
-    if (set === empty) {
-        return true;
-    }
-    return forEachKeyUntyped(set.setOperations, set.root, f);
-}
-//# sourceMappingURL=bspSet.js.map

package/lib/bspSet.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bspSet.js","sourceRoot":"","sources":["../src/bspSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,OAAO,CAAC;AAIjC,MAAM,CAAC,MAAM,IAAI,GAAG,CAAW,IAAO,EAAE,KAAQ,EAAc,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAE/E,uEAAuE;AACvE,MAAM,YAAY,GAAyB,QAAQ,CAAC;AAEpD,MAAM,CAAN,IAAY,OAGX;AAHD,WAAY,OAAO;IAClB,uCAAK,CAAA;IACL,uCAAK,CAAA;AACN,CAAC,EAHW,OAAO,KAAP,OAAO,QAGlB;AAsBD,MAAM,CAAC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;AACnC,MAAM,CAAC,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;AAuGnC,MAAM,CAAC,MAAM,iBAAiB,GAC7B,CACC,aAA0E,EAC1E,GAAmB,EACnB,WAAmB,EAAE,EACpB,EAAE,CACJ,CAAC,GAAmB,EAAE,EAAE;IACvB,IAAI,GAAG,CAAC,KAAK,KAAK,SAAS,EAAE;QAC5B,OAAO,GAAG,CAAC,KAAK,CAAC;KACjB;IAED,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;IACjC,MAAM,KAAK,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;IAC1C,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,QAAQ,EAAE;QAC5C,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;QAClB,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;QAC9B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;KAC9B;IAED,OAAO,KAAK,CAAC;AACd,CAAC,CAAC;AAEH,MAAM,UAAU,WAAW,CAC1B,aAAqC,EACrC,IAAwB;IAExB,IAAI,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE;QACrC,OAAO,IAAI,CAAC;KACZ;IACD,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,MAAM,MAAM,GAAG,CACd,IAAU,EACV,KAAY,EACZ,OAAY,EACZ,GAAQ,EACR,OAAc,EACb,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;AAE9C,SAAS,OAAO,CAAM,OAAY,EAAE,GAAQ,EAAE,OAAgB;IAC7D,IAAI,OAAO,EAAE;QACZ,OAAO,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,EAAE,IAAa,CAAC,CAAC;KACjE;IAED,OAAO,MAAM,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,EAAE,KAAc,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,IAAI,CACnB,aAAqC,EACrC,OAAY,EACZ,GAAQ;IAER,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE;QACvC,OAAO,KAAK,CAAC;KACb;IACD,MAAM,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAChD,IAAI,GAAG,KAAK,SAAS,EAAE;QACtB,IAAI,GAAG,IAAI,CAAC,EAAE;YACb,OAAO,KAAK,CAAC;SACb;QAED,OAAO,OAAO,CAAC,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;KACnC;IAED,+FAA+F;IAC/F,iBAAiB;IACjB,8FAA8F;IAC9F,2BAA2B;IAC3B,MAAM,MAAM,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;IAErD,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,OAAO,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;KACtC;IAED,OAAO,OAAO,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AACrC,CAAC;AAED,MAAM,UAAU,aAAa,CAC5B,qBAA6C;IAE7C,MAAM,aAAa,mCACf,qBAAqB,KACxB,KAAK,EAAE,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,EAAE,qBAAqB,CAAC,GAAG,CAAC,GAChF,CAAC;IACF,OAAO,CAAC,GAAQ,EAAE,EAAE,CAAC,WAAW,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC9F,CAAC;AAED,SAAS,UAAU,CAClB,aAAqC,EACrC,IAAwC,EACxC,KAAyC;IAEzC,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACvC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAEhC,MAAM,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACrD,IAAI,GAAG,KAAK,SAAS,EAAE;QACtB,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;KAC9B;IAED,MAAM,WAAW,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC3D,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,MAAM,WAAW,GAAG,aAAa,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QAChE,IAAI,WAAW,KAAK,SAAS,IAAI,WAAW,KAAK,CAAC,EAAE;YACnD,OAAO,KAAK,CAAC;SACb;QACD,OAAO,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;KAC3C;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,iGAAiG;AACjG,SAAS,eAAe,CACvB,IAAwB,EACxB,KAAyB;IAEzB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,IAAI,KAAK,KAAK,KAAK,EAAE;YACpB,OAAO,KAAK,CAAC;SACb;QAED,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAc,CAAC,CAAC;KACjE;IAED,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAc,CAAC,CAAC;KACjE;IAED,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,IAAI,KAAK,KAAK,KAAK,EAAE;YACpB,OAAO,KAAK,CAAC;SACb;QACD,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAc,CAAC,CAAC;KACjE;IAED,OAAO,MAAM,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,EAAE,KAAc,CAAC,CAAC;AAClE,CAAC;AAED,SAAS,WAAW,CACnB,aAAqC,EACrC,GAAuB;IAEvB,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,EAAE;QAC3B,OAAO,GAAG,CAAC;KACX;IAED,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAClD,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;IAEnD,MAAM,GAAG,GAAG,eAAe,CAAM,MAAM,EAAE,MAAM,CAAC,CAAC;IAEjD,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,EAAE;QACnC,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;KAC3D;IAED,sDAAsD;IACtD,MAAM,SAAS,GAAqB,GAAG,CAAC;IAExC,MAAM,QAAQ,GAAuB,GAAG,CAAC;IACzC,OAAO,YAAY,CAAC,QAAQ,EAAE;QAC7B,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,KAAK,EAAE,SAAS,CAAC,KAAK;KACtB,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,YAAY,CAC3B,aAAqC,EACrC,IAAwB,EACxB,KAAyB;IAEzB,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IAED,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE;QAClC,MAAM,GAAG,GAAG,UAAU,CAAU,aAAa,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,OAAO,GAAG,CAAC;SACX;KACD;IAED,MAAM,OAAO,GAAG,WAAW,CAAU,aAAa,EAAE,IAAI,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,WAAW,CAAU,aAAa,EAAE,KAAK,CAAC,CAAC;IAE5D,MAAM,MAAM,GAAG,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACxE,MAAM,MAAM,GAAG,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE1E,OAAO,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,KAAK,CACpB,IAAqB,EACrB,KAAsB;IAEtB,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IAED,OAAO,WAAW,CACjB,IAAI,CAAC,aAAa,EAClB,YAAY,CAAU,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAChE,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACtB,aAAqC,EACrC,IAAwC,EACxC,KAAyC;IAEzC,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACvC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAEhC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE;QAC5C,OAAO,KAAK,CAAC;KACb;IAED,MAAM,GAAG,GAAG,aAAa,CAAC,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACrD,IAAI,GAAG,KAAK,SAAS,EAAE;QACtB,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;KAC9B;IAED,MAAM,WAAW,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC/D,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;KAC3C;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,gBAAgB,CAC/B,aAAqC,EACrC,IAAwB,EACxB,KAAyB;IAEzB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IAED,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE;QAClC,MAAM,GAAG,GAAG,cAAc,CAAU,aAAa,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAChE,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,OAAO,GAAG,CAAC;SACX;KACD;IAED,MAAM,OAAO,GAAG,WAAW,CAAU,aAAa,EAAE,IAAI,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,WAAW,CAAU,aAAa,EAAE,KAAK,CAAC,CAAC;IAE5D,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC5E,MAAM,MAAM,GAAG,gBAAgB,CAAC,aAAa,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE9E,OAAO,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,SAAS,CACxB,IAAqB,EACrB,KAAsB;IAEtB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IAED,OAAO,WAAW,CACjB,IAAI,CAAC,aAAa,EAClB,gBAAgB,CAAU,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CACpE,CAAC;AACH,CAAC;AAED,MAAM,UAAU,YAAY,CAC3B,aAAqC,EACrC,IAAwB,EACxB,KAAyB;IAEzB,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;QACtC,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;QACtC,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE;QAClC,OAAO,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;KAChD;IAED,MAAM,OAAO,GAAG,WAAW,CAAU,aAAa,EAAE,IAAI,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,WAAW,CAAU,aAAa,EAAE,KAAK,CAAC,CAAC;IAE5D,OAAO,CACN,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC;QACxD,YAAY,CAAC,aAAa,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAC1D,CAAC;AACH,CAAC;AAED,MAAM,UAAU,KAAK,CACpB,IAAqB,EACrB,KAAsB;IAEtB,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;QACtC,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAAE;QACtC,OAAO,IAAI,CAAC;KACZ;IACD,OAAO,YAAY,CAAU,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;AACzE,CAAC;AAED,SAAS,WAAW,CACnB,aAAqC,EACrC,IAAwC,EACxC,KAAoB;IAEpB,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACvC,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,KAAK,CAAC;IAEhC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE;QAC5C,OAAO,IAAI,CAAC;KACZ;IAED,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC5D,IAAI,WAAW,KAAK,SAAS,EAAE;QAC9B,OAAO,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC;KAC3C;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED,MAAM,UAAU,aAAa,CAC5B,aAAqC,EACrC,IAAwB,EACxB,KAAyB;IAEzB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,MAAM,cAAc,GAAG,WAAW,CAAU,aAAa,EAAE,KAAK,CAAC,CAAC;QAClE,MAAM,YAAY,GAAG,aAAa,CAAC,aAAa,EAAE,KAAK,EAAE,cAAc,CAAC,IAAI,CAAC,CAAC;QAC9E,MAAM,YAAY,GAAG,aAAa,CAAC,aAAa,EAAE,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC,CAAC;QAC/E,OAAO,eAAe,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;KACnD;IACD,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE;QAClC,MAAM,GAAG,GAAG,WAAW,CAAU,aAAa,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7D,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,OAAO,GAAG,CAAC;SACX;KACD;IACD,MAAM,OAAO,GAAG,WAAW,CAAU,aAAa,EAAE,IAAI,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,WAAW,CAAU,aAAa,EAAE,KAAK,CAAC,CAAC;IAE5D,MAAM,MAAM,GAAG,aAAa,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACzE,MAAM,MAAM,GAAG,aAAa,CAAC,aAAa,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE3E,OAAO,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,MAAM,UAAU,MAAM,CACrB,IAAqB,EACrB,KAAsB;IAEtB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,IAAI,CAAC;KACZ;IACD,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,KAAK,CAAC;KACb;IACD,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,WAAW,CACjB,KAAK,CAAC,aAAa,EACnB,aAAa,CAAU,KAAK,CAAC,aAAa,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAC7D,CAAC;KACF;IAED,OAAO,WAAW,CACjB,IAAI,CAAC,aAAa,EAClB,aAAa,CAAU,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CACjE,CAAC;AACH,CAAC;AAED,MAAM,YAAY,GAAG,CACpB,aAAqC,EACrC,IAAmB,EACnB,KAAoB,EACnB,EAAE,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;AAEhD,MAAM,UAAU,UAAU,CAAC,IAA4B,EAAE,KAA6B;IACrF,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE;QAC9C,OAAO,SAAS,CAAC;KACjB;IACD,IAAI,IAAI,KAAK,CAAC,EAAE;QACf,OAAO,KAAK,CAAC;KACb;IACD,IAAI,KAAK,KAAK,CAAC,EAAE;QAChB,OAAO,IAAI,CAAC;KACZ;IACD,OAAO,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AAC1C,CAAC;AAED,MAAM,UAAU,cAAc,CAC7B,aAAqC,EACrC,IAAwB,EACxB,KAAyB;IAEzB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,IAAI,KAAK,KAAK,KAAK,EAAE;YACpB,OAAO,CAAC,CAAC;SACT;QAED,OAAO,CAAC,CAAC;KACT;IAED,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,IAAI,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,OAAO,EAAE;QAClC,OAAO,YAAY,CAAC,aAAa,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;KAChD;IAED,MAAM,OAAO,GAAG,WAAW,CAAU,aAAa,EAAE,IAAI,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,WAAW,CAAU,aAAa,EAAE,KAAK,CAAC,CAAC;IAC5D,MAAM,IAAI,GAAG,cAAc,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;IACxE,IAAI,IAAI,KAAK,SAAS,EAAE;QACvB,OAAO,SAAS,CAAC;KACjB;IAED,MAAM,IAAI,GAAG,cAAc,CAAC,aAAa,EAAE,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;IAE1E,IAAI,IAAI,KAAK,SAAS,EAAE;QACvB,OAAO,SAAS,CAAC;KACjB;IAED,OAAO,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED,MAAM,UAAU,OAAO,CACtB,IAAqB,EACrB,KAAsB;IAEtB,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,CAAC,CAAC;KACT;IAED,IAAI,IAAI,KAAK,KAAK,EAAE;QACnB,IAAI,KAAK,KAAK,KAAK,EAAE;YACpB,OAAO,CAAC,CAAC;SACT;QAED,OAAO,CAAC,CAAC;KACT;IAED,IAAI,KAAK,KAAK,KAAK,EAAE;QACpB,OAAO,CAAC,CAAC,CAAC;KACV;IAED,OAAO,cAAc,CAAU,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;AAC3E,CAAC;AAED,MAAM,CAAC,MAAM,aAAa,GAAG,CAC5B,IAAqB,EACrB,KAAsB,EACrB,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;AAErD,MAAM,CAAC,MAAM,UAAU,GAAG,CAAgC,GAAoB,EAAE,EAAE,CACjF,MAAM,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAEpB,SAAS,mBAAmB,CAAI,GAAiC;IAChE,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,EAAE;QACxD,OAAO,CAAC,CAAC;KACT;IAED,OAAO,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;AAC3E,CAAC;AAED,MAAM,UAAU,YAAY,CAAgC,GAAoB;IAC/E,IAAI,GAAG,KAAK,KAAK,IAAI,GAAG,KAAK,KAAK,EAAE;QACnC,OAAO,CAAC,CAAC;KACT;IACD,OAAO,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED,SAAS,iBAAiB,CACzB,aAAqC,EACrC,GAAuB,EACvB,CAAwB;IAExB,SAAS,IAAI,CAAC,OAAY,EAAE,SAA6B;QACxD,IAAI,SAAS,KAAK,KAAK,EAAE;YACxB,OAAO,IAAI,CAAC;SACZ;QACD,IAAI,SAAS,KAAK,KAAK,EAAE;YACxB,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC;SAClB;QACD,IAAI,SAAS,CAAC,OAAO,EAAE;YACtB,OAAO,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;SACxB;QAED,MAAM,MAAM,GAAG,WAAW,CAAU,aAAa,EAAE,SAAS,CAAC,CAAC;QAC9D,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AACrC,CAAC;AAED,MAAM,UAAU,UAAU,CACzB,GAA4B,EAC5B,CAAwB;IAExB,IAAI,GAAG,KAAK,KAAK,EAAE;QAClB,OAAO,IAAI,CAAC;KACZ;IACD,OAAO,iBAAiB,CAAC,GAAG,CAAC,aAAa,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AAC1D,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { __assign } from \"tslib\";\n/** An interface for representing a readonly pair */\nexport type Pair<S, T = S> = readonly [S, T];\n\nexport const pair = <S, T = S>(left: S, right: T): Pair<S, T> => [left, right];\n\n// using this polyfill, because `Object.assign` is not supported in IE.\nconst ObjectAssign: typeof Object.assign = __assign;\n\nexport enum SetKind {\n\tDense,\n\tEmpty,\n}\n\ninterface TreeNode<Left, Right> {\n\treadonly left: Left;\n\treadonly right: Right;\n}\n\ninterface KeyNode<Key, Exact> {\n\treadonly key: Key;\n\treadonly pathKey: Key;\n\treadonly isExact: Exact;\n}\n\nexport type Empty = SetKind.Empty;\n\n/** The term *Dense* means that a given subset contains all the elements of its particular\n * bounds. E.g. the whole set would be dense w.r.t. the bounds of the whole space. Or\n * if a set represents an interval [a, b), then it would be dense, if there are no holes in it,\n * i.e. the set is represented exactly using the current bounds.\n */\nexport type Dense = SetKind.Dense;\n\nexport const dense = SetKind.Dense;\nexport const empty = SetKind.Empty;\n\ntype KeyUnexact<Key> = KeyNode<Key, false>;\n\n/** In the BSP-set, each node carries with it implicit bounds just by the position in the tree.\n * Furthermore, it can carry around a key. The key can either be an approximation, i.e. an upper bound\n * or it can be *exact*. Exact means, that the whole set can be exactly represented in terms of just the key.\n *\n * One might wonder, why we don't prune the tree at this point. This has to do with the fact that we are\n * representing arbitrary sets and so even though one of two sets could be represented exactly the other\n * might not be able to yet. In this case we need to unfold the key by splitting further. In order to avoid\n * excessive splitting and pruning, we just carry around the key but allow the tree to also be materialized, on-demand.\n */\ntype KeyExact<Key> = KeyNode<Key, true>;\n\ntype KeyUndefined = KeyNode<undefined, false>;\ntype KeyDefined<Key> = KeyUnexact<Key> | KeyExact<Key>;\n\ntype BalancePropertyHelper<Key, Left, Right> = TreeNode<\n\tUntypedSparse<Key> | Left,\n\tUntypedSparse<Key> | Right\n>;\n\ntype TreeDefined<Key> =\n\t| BalancePropertyHelper<Key, Empty, Dense>\n\t| BalancePropertyHelper<Key, Dense, Empty>;\ntype TreeUndefined = TreeNode<undefined, undefined>;\n\ntype KeyDefinednessProperty<Key> = KeyDefined<Key> | KeyUndefined;\n\nexport type UntypedSparse<Key> =\n\t| (KeyDefinednessProperty<Key> & TreeDefined<Key>)\n\t| (KeyDefined<Key> & TreeUndefined);\n/** The term *untyped* refers to the tree representation of a BSP set. Because BSP set trees are only compared in terms\n * of their structure, we need to ensure that cuts occur at the same exact points across all possible sets. This is\n * enforced by the fact, that at construction time, we attach an `Id` to each BSP set and only allow operations to\n * occur on sets with the same `Id`.\n *\n * The BSP set becomes *untyped*, when we drop that `Id`; now it is possible to operate on sets that are incompatible.\n * Doing this, however, allows us to store the set operations only once per set as opposed to carrying them around with\n * every node.\n */\nexport type UntypedBspSet<Key> = Empty | Dense | UntypedSparse<Key>;\n\n/** A set is considred *sparse*, if we know that w.r.t. to it's bounds it is neither empty, nor dense. */\ninterface Sparse<Key extends Cachable<Key>, Id> {\n\tsetOperations: SetOperations<Key, Id>;\n\troot: UntypedSparse<Key>;\n}\nexport type BspSet<Key extends Cachable<Key>, Id> = Empty | Dense | Sparse<Key, Id>;\n\nexport interface KeyCache<T> {\n\tdepth?: number;\n\tsplit?: Pair<Pair<CachedKey<T>, number>>;\n}\nexport type CachedKey<T> = T & KeyCache<T>;\nexport type Cachable<T> = Disjoint<keyof T, keyof KeyCache<T>>;\n\nexport type Disjoint<T, U> = [T, U] extends [Exclude<T, U>, Exclude<U, T>] ? any : never;\nexport type RequireAtLeastOne<T> = {\n\t[K in keyof T]-?: Required<Pick<T, K>> & Partial<Pick<T, Exclude<keyof T, K>>>;\n}[keyof T];\n\n/** This is a concrete set operations implementation, tagged with an arbitrary id. */\nexport interface SetOperations<Key extends Cachable<Key>, Id> {\n\t/** Id here is just a phantom type, so that we can associate the various set instances together */\n\treadonly id: Id;\n\n\t/** Split the key into two. This will only be called when the current key is incomparable with an element.\n\t * E.g. this would never be called if the key is already a 1x1 rectangle. */\n\treadonly split: (key: CachedKey<Key>) => Pair<Pair<CachedKey<Key>, number>>;\n\n\t/** Tells, if a given key can be split further */\n\treadonly canSplit: (key: CachedKey<Key>) => boolean;\n\n\t/** Tells if two keys overlap at all. */\n\treadonly meets: (key1: Key, key2: Key) => boolean;\n\n\t/** Intersect the keys, if it is possible to exactly respresent their intersection.\n\t * An implementation is never required to compute the intersection as this is just an optimization.\n\t * Precondition: It is guaranteed that the keys meet and that they are incomparable.\n\t */\n\treadonly intersect: (key1: Key, key2: Key) => Key | undefined;\n\n\t/** Unions the keys, if it is possible to exactly represent their union.\n\t * An implementation is never required to compute the union as this is just an optimization.\n\t * Precondition: It is guaranteed that the keys are incomparable.\n\t */\n\treadonly union: (key1: Key, key2: Key) => Key | undefined;\n\n\t/** Computes the set difference between two keys, if it is possible to exactly represent their set difference.\n\t * An implementation is never required to compute the difference as this is just an optimization.\n\t * Precondition: It is guaranteed that the keys meet.\n\t */\n\treadonly except: (key1: Key, key2: Key) => Key | undefined;\n\n\t/** Compare two keys */\n\treadonly compare: (key1: Key, key2: Key) => -1 | 0 | 1 | undefined;\n\n\t/** The top element of the set. */\n\treadonly top: Key;\n}\n\nexport const cacheKeySplitting =\n\t<Key>(\n\t\tsplitFunction: (key: CachedKey<Key>) => Pair<Pair<CachedKey<Key>, number>>,\n\t\ttop: CachedKey<Key>,\n\t\tmaxDepth: number = 10,\n\t) =>\n\t(key: CachedKey<Key>) => {\n\t\tif (key.split !== undefined) {\n\t\t\treturn key.split;\n\t\t}\n\n\t\tconst split = splitFunction(key);\n\t\tconst depth = key === top ? 0 : key.depth;\n\t\tif (depth !== undefined && depth < maxDepth) {\n\t\t\tkey.split = split;\n\t\t\tsplit[0][0].depth = depth + 1;\n\t\t\tsplit[1][0].depth = depth + 1;\n\t\t}\n\n\t\treturn split;\n\t};\n\nexport function fromUntyped<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\troot: UntypedBspSet<Key>,\n): BspSet<Key, Id> {\n\tif (root === empty || root === dense) {\n\t\treturn root;\n\t}\n\treturn { setOperations, root };\n}\n\nconst sparse = <Key, Exact, Left, Right>(\n\tleft: Left,\n\tright: Right,\n\tpathKey: Key,\n\tkey: Key,\n\tisExact: Exact,\n) => ({ key, pathKey, left, right, isExact });\n\nfunction fromKey<Key>(pathKey: Key, key: Key, isExact: boolean): UntypedSparse<Key> {\n\tif (isExact) {\n\t\treturn sparse(undefined, undefined, pathKey, key, true as const);\n\t}\n\n\treturn sparse(undefined, undefined, pathKey, key, false as const);\n}\n\nexport function lazy<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tpathKey: Key,\n\tkey: Key,\n): UntypedBspSet<Key> {\n\tif (!setOperations.meets(pathKey, key)) {\n\t\treturn empty;\n\t}\n\tconst cmp = setOperations.compare(pathKey, key);\n\tif (cmp !== undefined) {\n\t\tif (cmp <= 0) {\n\t\t\treturn dense;\n\t\t}\n\n\t\treturn fromKey(pathKey, key, true);\n\t}\n\n\t// this is not exactly necessary, but increases the amount of exact nodes and thus we can often\n\t// prune earlier.\n\t// Also, having intersect always work guarantees exact nodes, thus allowing for more efficient\n\t// storage and computation.\n\tconst newKey = setOperations.intersect(pathKey, key);\n\n\tif (newKey !== undefined) {\n\t\treturn fromKey(pathKey, newKey, true);\n\t}\n\n\treturn fromKey(pathKey, key, false);\n}\n\nexport function createFromKey<Key extends Cachable<Key>, Id>(\n\tuncachedSetOperations: SetOperations<Key, Id>,\n) {\n\tconst setOperations = {\n\t\t...uncachedSetOperations,\n\t\tsplit: cacheKeySplitting(uncachedSetOperations.split, uncachedSetOperations.top),\n\t};\n\treturn (key: Key) => fromUntyped(setOperations, lazy(setOperations, setOperations.top, key));\n}\n\nfunction unionExact<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedBspSet<Key> & KeyExact<Key>,\n\tright: UntypedBspSet<Key> & KeyExact<Key>,\n) {\n\tconst { pathKey, key: leftKey } = left;\n\tconst { key: rightKey } = right;\n\n\tconst cmp = setOperations.compare(leftKey, rightKey);\n\tif (cmp !== undefined) {\n\t\treturn cmp < 0 ? right : left;\n\t}\n\n\tconst combinedKey = setOperations.union(leftKey, rightKey);\n\tif (combinedKey !== undefined) {\n\t\tconst combinedCmp = setOperations.compare(combinedKey, pathKey);\n\t\tif (combinedCmp !== undefined && combinedCmp === 0) {\n\t\t\treturn dense;\n\t\t}\n\t\treturn fromKey(pathKey, combinedKey, true);\n\t}\n\treturn undefined;\n}\n\n/** This is an local combination, not a proper union. We use it to have simpler code elsewhere */\nfunction combineChildren<Key>(\n\tleft: UntypedBspSet<Key>,\n\tright: UntypedBspSet<Key>,\n): Empty | Dense | (UntypedSparse<Key> & TreeDefined<Key>) {\n\tif (left === empty) {\n\t\tif (right === empty) {\n\t\t\treturn empty;\n\t\t}\n\n\t\treturn sparse(left, right, undefined, undefined, false as const);\n\t}\n\n\tif (right === empty) {\n\t\treturn sparse(left, right, undefined, undefined, false as const);\n\t}\n\n\tif (left === dense) {\n\t\tif (right === dense) {\n\t\t\treturn dense;\n\t\t}\n\t\treturn sparse(left, right, undefined, undefined, false as const);\n\t}\n\n\treturn sparse(left, right, undefined, undefined, false as const);\n}\n\nfunction materialize<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tset: UntypedSparse<Key>,\n): UntypedSparse<Key> & TreeDefined<Key> {\n\tif (set.left !== undefined) {\n\t\treturn set;\n\t}\n\n\tconst [[left], [right]] = setOperations.split(set.pathKey);\n\tconst lChild = lazy(setOperations, left, set.key);\n\tconst rChild = lazy(setOperations, right, set.key);\n\n\tconst res = combineChildren<Key>(lChild, rChild);\n\n\tif (res === empty || res === dense) {\n\t\tthrow new Error(\"incorrect set operations implementation\");\n\t}\n\n\t// first check, that res actually has the desired type\n\tconst typeCheck: TreeDefined<Key> = res;\n\n\tconst setAlias: UntypedSparse<Key> = set;\n\treturn ObjectAssign(setAlias, {\n\t\tleft: typeCheck.left,\n\t\tright: typeCheck.right,\n\t});\n}\n\nexport function unionUntyped<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedBspSet<Key>,\n\tright: UntypedBspSet<Key>,\n): UntypedBspSet<Key> {\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn right;\n\t}\n\tif (left === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn left;\n\t}\n\n\tif (left.isExact && right.isExact) {\n\t\tconst res = unionExact<Key, Id>(setOperations, left, right);\n\t\tif (res !== undefined) {\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tconst newLeft = materialize<Key, Id>(setOperations, left);\n\tconst newRight = materialize<Key, Id>(setOperations, right);\n\n\tconst lChild = unionUntyped(setOperations, newLeft.left, newRight.left);\n\tconst rChild = unionUntyped(setOperations, newLeft.right, newRight.right);\n\n\treturn combineChildren(lChild, rChild);\n}\n\nexport function union<Key extends Cachable<Key>, Id>(\n\tleft: BspSet<Key, Id>,\n\tright: BspSet<Key, Id>,\n): BspSet<Key, Id> {\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn right;\n\t}\n\tif (left === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn left;\n\t}\n\n\treturn fromUntyped(\n\t\tleft.setOperations,\n\t\tunionUntyped<Key, Id>(left.setOperations, left.root, right.root),\n\t);\n}\n\nfunction intersectExact<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedBspSet<Key> & KeyExact<Key>,\n\tright: UntypedBspSet<Key> & KeyExact<Key>,\n) {\n\tconst { pathKey, key: leftKey } = left;\n\tconst { key: rightKey } = right;\n\n\tif (!setOperations.meets(leftKey, rightKey)) {\n\t\treturn empty;\n\t}\n\n\tconst cmp = setOperations.compare(leftKey, rightKey);\n\tif (cmp !== undefined) {\n\t\treturn cmp < 0 ? left : right;\n\t}\n\n\tconst combinedKey = setOperations.intersect(leftKey, rightKey);\n\tif (combinedKey !== undefined) {\n\t\treturn fromKey(pathKey, combinedKey, true);\n\t}\n\n\treturn undefined;\n}\n\nexport function intersectUntyped<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedBspSet<Key>,\n\tright: UntypedBspSet<Key>,\n): UntypedBspSet<Key> {\n\tif (left === empty) {\n\t\treturn left;\n\t}\n\tif (right === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn right;\n\t}\n\tif (right === dense) {\n\t\treturn left;\n\t}\n\n\tif (left.isExact && right.isExact) {\n\t\tconst res = intersectExact<Key, Id>(setOperations, left, right);\n\t\tif (res !== undefined) {\n\t\t\treturn res;\n\t\t}\n\t}\n\n\tconst newLeft = materialize<Key, Id>(setOperations, left);\n\tconst newRight = materialize<Key, Id>(setOperations, right);\n\n\tconst lChild = intersectUntyped(setOperations, newLeft.left, newRight.left);\n\tconst rChild = intersectUntyped(setOperations, newLeft.right, newRight.right);\n\n\treturn combineChildren(lChild, rChild);\n}\n\nexport function intersect<Key extends Cachable<Key>, Id>(\n\tleft: BspSet<Key, Id>,\n\tright: BspSet<Key, Id>,\n): BspSet<Key, Id> {\n\tif (left === empty) {\n\t\treturn left;\n\t}\n\tif (right === empty) {\n\t\treturn right;\n\t}\n\tif (left === dense) {\n\t\treturn right;\n\t}\n\tif (right === dense) {\n\t\treturn left;\n\t}\n\n\treturn fromUntyped(\n\t\tleft.setOperations,\n\t\tintersectUntyped<Key, Id>(left.setOperations, left.root, right.root),\n\t);\n}\n\nexport function meetsUntyped<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedBspSet<Key>,\n\tright: UntypedBspSet<Key>,\n): boolean {\n\tif (left === empty || right === empty) {\n\t\treturn false;\n\t}\n\tif (left === dense || right === dense) {\n\t\treturn true;\n\t}\n\tif (left.isExact && right.isExact) {\n\t\treturn setOperations.meets(left.key, right.key);\n\t}\n\n\tconst newLeft = materialize<Key, Id>(setOperations, left);\n\tconst newRight = materialize<Key, Id>(setOperations, right);\n\n\treturn (\n\t\tmeetsUntyped(setOperations, newLeft.left, newRight.left) ||\n\t\tmeetsUntyped(setOperations, newLeft.right, newRight.right)\n\t);\n}\n\nexport function meets<Key extends Cachable<Key>, Id>(\n\tleft: BspSet<Key, Id>,\n\tright: BspSet<Key, Id>,\n): boolean {\n\tif (left === empty || right === empty) {\n\t\treturn false;\n\t}\n\tif (left === dense || right === dense) {\n\t\treturn true;\n\t}\n\treturn meetsUntyped<Key, Id>(left.setOperations, left.root, right.root);\n}\n\nfunction exceptExact<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedSparse<Key> & KeyExact<Key>,\n\tright: KeyExact<Key>,\n) {\n\tconst { pathKey, key: leftKey } = left;\n\tconst { key: rightKey } = right;\n\n\tif (!setOperations.meets(leftKey, rightKey)) {\n\t\treturn left;\n\t}\n\n\tconst combinedKey = setOperations.except(leftKey, rightKey);\n\tif (combinedKey !== undefined) {\n\t\treturn fromKey(pathKey, combinedKey, true);\n\t}\n\n\treturn undefined;\n}\n\nexport function exceptUntyped<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedBspSet<Key>,\n\tright: UntypedBspSet<Key>,\n): UntypedBspSet<Key> {\n\tif (left === empty) {\n\t\treturn left;\n\t}\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn empty;\n\t}\n\tif (left === dense) {\n\t\tconst newRight_inner = materialize<Key, Id>(setOperations, right);\n\t\tconst lChild_inner = exceptUntyped(setOperations, dense, newRight_inner.left);\n\t\tconst rChild_inner = exceptUntyped(setOperations, dense, newRight_inner.right);\n\t\treturn combineChildren(lChild_inner, rChild_inner);\n\t}\n\tif (left.isExact && right.isExact) {\n\t\tconst res = exceptExact<Key, Id>(setOperations, left, right);\n\t\tif (res !== undefined) {\n\t\t\treturn res;\n\t\t}\n\t}\n\tconst newLeft = materialize<Key, Id>(setOperations, left);\n\tconst newRight = materialize<Key, Id>(setOperations, right);\n\n\tconst lChild = exceptUntyped(setOperations, newLeft.left, newRight.left);\n\tconst rChild = exceptUntyped(setOperations, newLeft.right, newRight.right);\n\n\treturn combineChildren(lChild, rChild);\n}\n\nexport function except<Key extends Cachable<Key>, Id>(\n\tleft: BspSet<Key, Id>,\n\tright: BspSet<Key, Id>,\n): BspSet<Key, Id> {\n\tif (left === empty) {\n\t\treturn left;\n\t}\n\tif (right === empty) {\n\t\treturn left;\n\t}\n\tif (right === dense) {\n\t\treturn empty;\n\t}\n\tif (left === dense) {\n\t\treturn fromUntyped(\n\t\t\tright.setOperations,\n\t\t\texceptUntyped<Key, Id>(right.setOperations, left, right.root),\n\t\t);\n\t}\n\n\treturn fromUntyped(\n\t\tleft.setOperations,\n\t\texceptUntyped<Key, Id>(left.setOperations, left.root, right.root),\n\t);\n}\n\nconst compareExact = <Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: KeyExact<Key>,\n\tright: KeyExact<Key>,\n) => setOperations.compare(left.key, right.key);\n\nexport function combineCmp(left: -1 | 0 | 1 | undefined, right: -1 | 0 | 1 | undefined) {\n\tif (left === undefined || right === undefined) {\n\t\treturn undefined;\n\t}\n\tif (left === 0) {\n\t\treturn right;\n\t}\n\tif (right === 0) {\n\t\treturn left;\n\t}\n\treturn left === right ? left : undefined;\n}\n\nexport function compareUntyped<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tleft: UntypedBspSet<Key>,\n\tright: UntypedBspSet<Key>,\n): -1 | 0 | 1 | undefined {\n\tif (left === right) {\n\t\treturn 0;\n\t}\n\n\tif (left === empty) {\n\t\treturn -1;\n\t}\n\n\tif (right === empty) {\n\t\treturn 1;\n\t}\n\n\tif (left === dense) {\n\t\tif (right === dense) {\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn 1;\n\t}\n\n\tif (right === dense) {\n\t\treturn -1;\n\t}\n\n\tif (left.isExact && right.isExact) {\n\t\treturn compareExact(setOperations, left, right);\n\t}\n\n\tconst newLeft = materialize<Key, Id>(setOperations, left);\n\tconst newRight = materialize<Key, Id>(setOperations, right);\n\tconst lCmp = compareUntyped(setOperations, newLeft.left, newRight.left);\n\tif (lCmp === undefined) {\n\t\treturn undefined;\n\t}\n\n\tconst rCmp = compareUntyped(setOperations, newLeft.right, newRight.right);\n\n\tif (rCmp === undefined) {\n\t\treturn undefined;\n\t}\n\n\treturn combineCmp(lCmp, rCmp);\n}\n\nexport function compare<Key extends Cachable<Key>, Id>(\n\tleft: BspSet<Key, Id>,\n\tright: BspSet<Key, Id>,\n) {\n\tif (left === right) {\n\t\treturn 0;\n\t}\n\n\tif (left === empty) {\n\t\treturn -1;\n\t}\n\n\tif (right === empty) {\n\t\treturn 1;\n\t}\n\n\tif (left === dense) {\n\t\tif (right === dense) {\n\t\t\treturn 0;\n\t\t}\n\n\t\treturn 1;\n\t}\n\n\tif (right === dense) {\n\t\treturn -1;\n\t}\n\n\treturn compareUntyped<Key, Id>(left.setOperations, left.root, right.root);\n}\n\nexport const symmetricDiff = <Key extends Cachable<Key>, Id>(\n\tleft: BspSet<Key, Id>,\n\tright: BspSet<Key, Id>,\n) => union(except(left, right), except(right, left));\n\nexport const complement = <Key extends Cachable<Key>, Id>(set: BspSet<Key, Id>) =>\n\texcept(dense, set);\n\nfunction getNodeCountUntyped<T>(set: UntypedBspSet<T> | undefined): number {\n\tif (set === undefined || set === empty || set === dense) {\n\t\treturn 0;\n\t}\n\n\treturn getNodeCountUntyped(set.left) + getNodeCountUntyped(set.right) + 1;\n}\n\nexport function getNodeCount<Key extends Cachable<Key>, Id>(set: BspSet<Key, Id>) {\n\tif (set === empty || set === dense) {\n\t\treturn 0;\n\t}\n\treturn getNodeCountUntyped(set.root);\n}\n\nfunction forEachKeyUntyped<Key extends Cachable<Key>, Id>(\n\tsetOperations: SetOperations<Key, Id>,\n\tset: UntypedBspSet<Key>,\n\tf: (key: Key) => boolean,\n): boolean {\n\tfunction loop(pathKey: Key, set_inner: UntypedBspSet<Key>): boolean {\n\t\tif (set_inner === empty) {\n\t\t\treturn true;\n\t\t}\n\t\tif (set_inner === dense) {\n\t\t\treturn f(pathKey);\n\t\t}\n\t\tif (set_inner.isExact) {\n\t\t\treturn f(set_inner.key);\n\t\t}\n\n\t\tconst newSet = materialize<Key, Id>(setOperations, set_inner);\n\t\tconst [[left], [right]] = setOperations.split(pathKey);\n\t\treturn loop(left, newSet.left) && loop(right, newSet.right);\n\t}\n\n\treturn loop(setOperations.top, set);\n}\n\nexport function forEachKey<Key extends Cachable<Key>, Id>(\n\tset: Empty | Sparse<Key, Id>,\n\tf: (key: Key) => boolean,\n): boolean {\n\tif (set === empty) {\n\t\treturn true;\n\t}\n\treturn forEachKeyUntyped(set.setOperations, set.root, f);\n}\n"]}

package/lib/productSet.d.ts

@@ -1,61 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { BspSet, Empty, Dense, SetOperations, UntypedSparse } from "./bspSet";
-declare type Restrict<T, Props extends (keyof T)[]> = {
-    [Prop in Props[number]]: T[Prop];
-};
-export declare type Product<T> = {
-    readonly [dim in keyof T]: T[dim] extends BspSet<infer _TKey, infer _TId> ? T[dim] : never;
-};
-declare type UntypedProduct<T> = {
-    readonly [dim in keyof T]?: T[dim] extends BspSet<infer TKey, infer _TId> ? UntypedSparse<TKey> : never;
-};
-declare type ProductOperations<T> = {
-    readonly [dim in keyof T]: T[dim] extends BspSet<infer TKey, infer TId> ? SetOperations<TKey, TId> : never;
-};
-/** Given a cartesian product, a subspace is a subset of said space, such that it is also a cartesian product
- * and all the dimensions form subsets of the original cartesian product.
- *
- * This is a generalized notion of something like hyper-rectangles. Examples include:
- * - Rectangles
- * - Individual cells in a grid
- * - Rectangular ranges with missing rows and/or columns
- *
- * For the actual definition and properties, please read the document about *Operations on Cartesian Products*.
- */
-interface Subspace<T> {
-    readonly isSubspace: true;
-    readonly bounds: UntypedProduct<T>;
-}
-interface Union<T> {
-    readonly isSubspace: false;
-    readonly left: UntypedSparseProduct<T>;
-    readonly right: UntypedSparseProduct<T>;
-    readonly bounds: UntypedProduct<T>;
-    readonly subspaceCount: number;
-}
-declare type UntypedSparseProduct<T> = Subspace<T> | Union<T>;
-interface SparseProduct<T> {
-    readonly productOperations: ProductOperations<T>;
-    readonly root: UntypedSparseProduct<T>;
-}
-export declare type ProductSet<T> = Empty | Dense | SparseProduct<T>;
-export declare const createFromProduct: <T>(product: Product<T>) => ProductSet<T>;
-declare type Compatible<T, U> = {
-    [dim in keyof T & keyof U]: T[dim];
-};
-export declare function project<T, Props extends (keyof T)[]>(set: ProductSet<T>, ...dims: Props): ProductSet<Restrict<T, Props>>;
-export declare function unionProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(left: ProductSet<T>, right: ProductSet<U>): ProductSet<T & U>;
-export declare function intersectProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(left: ProductSet<T>, right: ProductSet<U>): ProductSet<T & U>;
-export declare function exceptProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(left: ProductSet<T>, right: ProductSet<U>): ProductSet<T & U>;
-export declare function compareProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(left: ProductSet<T>, right: ProductSet<U>): 0 | 1 | -1 | undefined;
-export declare function meetsProduct<T extends Compatible<U, T>, U extends Compatible<T, U>>(left: ProductSet<T>, right: ProductSet<U>): boolean;
-export declare const complementProduct: <T>(set: ProductSet<T>) => ProductSet<Compatible<T, unknown> & T>;
-export declare const symmetricDiffProduct: <T>(left: ProductSet<T>, right: ProductSet<T>) => ProductSet<T>;
-export declare function getSubspaces<T>(set: ProductSet<T>): UntypedProduct<T>[];
-export declare function forEachProduct<T, Props extends (keyof T)[]>(set: ProductSet<T>, f: (product: Product<Restrict<T, Props>>) => boolean, ...dims: Props): boolean;
-export declare function getSubspaceCount<T>(set: ProductSet<T>): number;
-export {};
-//# sourceMappingURL=productSet.d.ts.map

package/lib/productSet.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"productSet.d.ts","sourceRoot":"","sources":["../src/productSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,MAAM,EAGN,KAAK,EACL,KAAK,EAEL,aAAa,EAQb,aAAa,EAIb,MAAM,UAAU,CAAC;AAElB,aAAK,QAAQ,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI;KAAG,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;CAAE,CAAC;AAEnF,oBAAY,OAAO,CAAC,CAAC,IAAI;IACxB,QAAQ,EAAE,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,MAAM,CAAC,MAAM,KAAK,EAAE,MAAM,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK;CAC1F,CAAC;AAEF,aAAK,cAAc,CAAC,CAAC,IAAI;IACxB,QAAQ,EAAE,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,SAAS,MAAM,CAAC,MAAM,IAAI,EAAE,MAAM,IAAI,CAAC,GACtE,aAAa,CAAC,IAAI,CAAC,GACnB,KAAK;CACR,CAAC;AAIF,aAAK,iBAAiB,CAAC,CAAC,IAAI;IAC3B,QAAQ,EAAE,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,SAAS,MAAM,CAAC,MAAM,IAAI,EAAE,MAAM,GAAG,CAAC,GACpE,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,GACxB,KAAK;CACR,CAAC;AAEF;;;;;;;;;GASG;AACH,UAAU,QAAQ,CAAC,CAAC;IACnB,QAAQ,CAAC,UAAU,EAAE,IAAI,CAAC;IAE1B,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;CACnC;AAQD,UAAU,KAAK,CAAC,CAAC;IAChB,QAAQ,CAAC,UAAU,EAAE,KAAK,CAAC;IAE3B,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACvC,QAAQ,CAAC,KAAK,EAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC;IACxC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;IACnC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;CAC/B;AAED,aAAK,oBAAoB,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AAEtD,UAAU,aAAa,CAAC,CAAC;IACxB,QAAQ,CAAC,iBAAiB,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;IACjD,QAAQ,CAAC,IAAI,EAAE,oBAAoB,CAAC,CAAC,CAAC,CAAC;CACvC;AAmFD,oBAAY,UAAU,CAAC,CAAC,IAAI,KAAK,GAAG,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;AA0G7D,eAAO,MAAM,iBAAiB,2CAA4B,CAAC;AAE3D,aAAK,UAAU,CAAC,CAAC,EAAE,CAAC,IAAI;KAAG,GAAG,IAAI,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC;CAAE,CAAC;AAyJ/D,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EACnD,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAClB,GAAG,IAAI,EAAE,KAAK,GACZ,UAAU,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAUhC;AA0LD,wBAAgB,YAAY,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAClF,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAClB,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAwBnB;AAiCD,wBAAgB,gBAAgB,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EACtF,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAClB,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAyBnB;AAwFD,wBAAgB,aAAa,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EACnF,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,GAClB,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAkCnB;AAiDD,wBAAgB,cAAc,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EACpF,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,0BA4BpB;AAmDD,wBAAgB,YAAY,CAAC,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,SAAS,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC,EAClF,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,UAAU,CAAC,CAAC,CAAC,WAWpB;AAED,eAAO,MAAM,iBAAiB,mEAAuD,CAAC;AAEtF,eAAO,MAAM,oBAAoB,iEACoC,CAAC;AAEtE,wBAAgB,YAAY,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,uBAiBjD;AAED,wBAAgB,cAAc,CAAC,CAAC,EAAE,KAAK,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,EAC1D,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,EAClB,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK,OAAO,EACpD,GAAG,IAAI,EAAE,KAAK,GACZ,OAAO,CAmBT;AAED,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC,UAKrD"}