@fluidframework/tree 2.0.0-dev-rc.1.0.0.224419

package/lib/util/nestedMap.js

@@ -0,0 +1,224 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is returned.
+ *
+ * @internal
+ */
+export function tryAddToNestedMap(map, key1, key2, value) {
+    let innerMap = map.get(key1);
+    if (innerMap === undefined) {
+        innerMap = new Map();
+        map.set(key1, innerMap);
+    }
+    if (innerMap.has(key2)) {
+        return innerMap.get(key2);
+    }
+    innerMap.set(key2, value);
+    return undefined;
+}
+/**
+ * Copies over all entries from the source map into the destination map.
+ *
+ * @internal
+ */
+export function populateNestedMap(source, destination) {
+    for (const [key1, innerMap] of source) {
+        destination.set(key1, new Map(innerMap));
+    }
+}
+/**
+ * Sets the value at (key1, key2) in map to value.
+ * If there already is a value for (key1, key2), it is replaced with the provided one.
+ *
+ * @internal
+ */
+export function setInNestedMap(map, key1, key2, value) {
+    const innerMap = getOrAddInMap(map, key1, new Map());
+    innerMap.set(key2, value);
+}
+/**
+ * Sets the value at `key` in map to value if not already present.
+ * Returns the value at `key` after setting it.
+ * This is equivalent to a get or default that adds the default to the map.
+ */
+export function getOrAddInMap(map, key, value) {
+    const currentValue = map.get(key);
+    if (currentValue !== undefined) {
+        return currentValue;
+    }
+    map.set(key, value);
+    return value;
+}
+/**
+ * Returns the value at (key1, key2) in map, or undefined if not present.
+ *
+ * @internal
+ */
+export function tryGetFromNestedMap(map, key1, key2) {
+    const innerMap = map.get(key1);
+    if (innerMap === undefined) {
+        return undefined;
+    }
+    return innerMap.get(key2);
+}
+/**
+ * If (key1, key2) is not in the map, add value to the map.
+ * Returns whatever is at (key1, key2) in map (which will be value if it was empty before).
+ *
+ * @internal
+ */
+export function getOrAddInNestedMap(map, key1, key2, value) {
+    const existing = tryAddToNestedMap(map, key1, key2, value);
+    if (existing !== undefined) {
+        return existing;
+    }
+    return value;
+}
+/**
+ * Does not change map.
+ * If (key1, key2) is not in map, returns value.
+ * If (key1, key2) is in map, return its entry.
+ *
+ * @internal
+ */
+export function getOrDefaultInNestedMap(map, key1, key2, value) {
+    const existing = tryGetFromNestedMap(map, key1, key2);
+    if (existing !== undefined) {
+        return existing;
+    }
+    return value;
+}
+/**
+ * Removes the value at (key1, key2) from the map.
+ *
+ * @returns true iff found.
+ *
+ * @internal
+ */
+export function deleteFromNestedMap(map, key1, key2) {
+    const innerMap = map.get(key1);
+    if (innerMap === undefined) {
+        return false;
+    }
+    const deleted = innerMap.delete(key2);
+    if (innerMap.size === 0) {
+        map.delete(key1);
+    }
+    return deleted;
+}
+/**
+ * Converts a nested map to a flat list of triplets.
+ */
+export function nestedMapToFlatList(map) {
+    const list = [];
+    map.forEach((innerMap, key1) => {
+        innerMap.forEach((val, key2) => {
+            list.push([key1, key2, val]);
+        });
+    });
+    return list;
+}
+/**
+ * Builds a nested map from a flat list of triplets.
+ */
+export function nestedMapFromFlatList(list) {
+    const map = new Map();
+    for (const [key1, key2, val] of list) {
+        getOrAddInMap(map, key1, new Map()).set(key2, val);
+    }
+    return map;
+}
+export function forEachInNestedMap(map, delegate) {
+    map.forEach((innerMap, keyFirst) => {
+        innerMap.forEach((val, keySecond) => {
+            delegate(val, keyFirst, keySecond);
+        });
+    });
+}
+/**
+ * Map with two keys; same semantics as NestedMap, but maintains a size count for the entire collection.
+ * Note: undefined is not supported as a value, and will cause incorrect behavior.
+ *
+ * @internal
+ */
+export class SizedNestedMap {
+    constructor() {
+        this.nestedMap = new Map();
+        this.count = 0;
+    }
+    /**
+     * Returns the total number of elements in this nested map.
+     */
+    get size() {
+        return this.count;
+    }
+    /**
+     * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is
+     * returned.
+     */
+    tryGet(key1, key2) {
+        return tryGetFromNestedMap(this.nestedMap, key1, key2);
+    }
+    /**
+     * Does not change map.
+     * If (key1, key2) is not in map, returns value.
+     * If (key1, key2) is in map, return its entry.
+     */
+    getOrDefault(key1, key2, value) {
+        return getOrDefaultInNestedMap(this.nestedMap, key1, key2, value);
+    }
+    /**
+     * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is
+     * returned.
+     */
+    tryAdd(key1, key2, value) {
+        const currentVal = tryAddToNestedMap(this.nestedMap, key1, key2, value);
+        if (currentVal === undefined) {
+            this.count++;
+        }
+        return currentVal;
+    }
+    /**
+     * Sets the value at (key1, key2) in map to value.
+     * If there already is a value for (key1, key2), it is replaced with the provided one.
+     */
+    set(key1, key2, value) {
+        if (this.tryAdd(key1, key2, value) !== undefined) {
+            setInNestedMap(this.nestedMap, key1, key2, value);
+        }
+    }
+    /**
+     * Removes the value at (key1, key2) from the map.
+     * Returns true iff found.
+     */
+    delete(key1, key2) {
+        const deleted = deleteFromNestedMap(this.nestedMap, key1, key2);
+        if (deleted) {
+            this.count--;
+        }
+        return deleted;
+    }
+    /**
+     * Runs the supplied delegate for every (value, key1, key2).
+     */
+    forEach(delegate) {
+        forEachInNestedMap(this.nestedMap, delegate);
+    }
+    /**
+     * Clears the map.
+     */
+    clear() {
+        this.count = 0;
+        this.nestedMap.clear();
+    }
+    values() {
+        return Array.from(this.nestedMap.values()).flatMap((innerMap) => innerMap.values())[0];
+    }
+    [Symbol.iterator]() {
+        return this.nestedMap[Symbol.iterator]();
+    }
+}
+//# sourceMappingURL=nestedMap.js.map

package/lib/util/nestedMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nestedMap.js","sourceRoot":"","sources":["../../src/util/nestedMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAeH;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAChC,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,IAAI,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC7B,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;QACrB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;KACxB;IACD,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QACvB,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;KAC1B;IACD,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC1B,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAChC,MAAoC,EACpC,WAAyC;IAEzC,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,EAAE;QACtC,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;KACzC;AACF,CAAC;AACD;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAC7B,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,EAAe,CAAC,CAAC;IAClE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;AAC3B,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC5B,GAA0B,EAC1B,GAAQ,EACR,KAAY;IAEZ,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,YAAY,KAAK,SAAS,EAAE;QAC/B,OAAO,YAAY,CAAC;KACpB;IACD,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACpB,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAClC,GAAiC,EACjC,IAAU,EACV,IAAU;IAEV,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,SAAS,CAAC;KACjB;IACD,OAAO,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAClC,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAC3D,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,QAAQ,CAAC;KAChB;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACtC,GAAiC,EACjC,IAAU,EACV,IAAU,EACV,KAAY;IAEZ,MAAM,QAAQ,GAAG,mBAAmB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACtD,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,QAAQ,CAAC;KAChB;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,mBAAmB,CAClC,GAAiC,EACjC,IAAU,EACV,IAAU;IAEV,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,QAAQ,KAAK,SAAS,EAAE;QAC3B,OAAO,KAAK,CAAC;KACb;IACD,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE;QACxB,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;KACjB;IACD,OAAO,OAAO,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAClC,GAAiC;IAEjC,MAAM,IAAI,GAA0B,EAAE,CAAC;IACvC,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,IAAI,EAAE,EAAE;QAC9B,QAAQ,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;YAC9B,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CACpC,IAA+C;IAE/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC9C,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE;QACrC,aAAa,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,EAAe,CAAC,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;KAChE;IACD,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,MAAM,UAAU,kBAAkB,CACjC,GAAiC,EACjC,QAAwD;IAExD,GAAG,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;QAClC,QAAQ,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE;YACnC,QAAQ,CAAC,GAAG,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,cAAc;IAA3B;QACkB,cAAS,GAAiC,IAAI,GAAG,EAAE,CAAC;QAC7D,UAAK,GAAG,CAAC,CAAC;IAkFnB,CAAC;IAhFA;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,IAAU,EAAE,IAAU;QACnC,OAAO,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACxD,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,IAAU,EAAE,IAAU,EAAE,KAAY;QACvD,OAAO,uBAAuB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACnE,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,IAAU,EAAE,IAAU,EAAE,KAAY;QACjD,MAAM,UAAU,GAAG,iBAAiB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,IAAI,CAAC,KAAK,EAAE,CAAC;SACb;QACD,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,GAAG,CAAC,IAAU,EAAE,IAAU,EAAE,KAAY;QAC9C,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,SAAS,EAAE;YACjD,cAAc,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;SAClD;IACF,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,IAAU,EAAE,IAAU;QACnC,MAAM,OAAO,GAAG,mBAAmB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAChE,IAAI,OAAO,EAAE;YACZ,IAAI,CAAC,KAAK,EAAE,CAAC;SACb;QACD,OAAO,OAAO,CAAC;IAChB,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,QAAwD;QACtE,kBAAkB,CAAC,IAAI,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACI,KAAK;QACX,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC;IACxB,CAAC;IAEM,MAAM;QACZ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACxF,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IAC1C,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { MapGetSet } from \"./utils\";\n\n/**\n * A dictionary whose values are keyed off of two objects (key1, key2).\n * As it is a nested map, size() will return the number of distinct key1s.\n * If you need constant-time access to the number of values, use SizedNestedMap instead.\n *\n * This code assumes values will not be undefined (keys can be undefined).\n *\n * @internal\n */\nexport type NestedMap<Key1, Key2, Value> = Map<Key1, Map<Key2, Value>>;\n\n/**\n * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is returned.\n *\n * @internal\n */\nexport function tryAddToNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): Value | undefined {\n\tlet innerMap = map.get(key1);\n\tif (innerMap === undefined) {\n\t\tinnerMap = new Map();\n\t\tmap.set(key1, innerMap);\n\t}\n\tif (innerMap.has(key2)) {\n\t\treturn innerMap.get(key2);\n\t}\n\tinnerMap.set(key2, value);\n\treturn undefined;\n}\n\n/**\n * Copies over all entries from the source map into the destination map.\n *\n * @internal\n */\nexport function populateNestedMap<Key1, Key2, Value>(\n\tsource: NestedMap<Key1, Key2, Value>,\n\tdestination: NestedMap<Key1, Key2, Value>,\n): void {\n\tfor (const [key1, innerMap] of source) {\n\t\tdestination.set(key1, new Map(innerMap));\n\t}\n}\n/**\n * Sets the value at (key1, key2) in map to value.\n * If there already is a value for (key1, key2), it is replaced with the provided one.\n *\n * @internal\n */\nexport function setInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): void {\n\tconst innerMap = getOrAddInMap(map, key1, new Map<Key2, Value>());\n\tinnerMap.set(key2, value);\n}\n\n/**\n * Sets the value at `key` in map to value if not already present.\n * Returns the value at `key` after setting it.\n * This is equivalent to a get or default that adds the default to the map.\n */\nexport function getOrAddInMap<Key, Value>(\n\tmap: MapGetSet<Key, Value>,\n\tkey: Key,\n\tvalue: Value,\n): Value {\n\tconst currentValue = map.get(key);\n\tif (currentValue !== undefined) {\n\t\treturn currentValue;\n\t}\n\tmap.set(key, value);\n\treturn value;\n}\n\n/**\n * Returns the value at (key1, key2) in map, or undefined if not present.\n *\n * @internal\n */\nexport function tryGetFromNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n): Value | undefined {\n\tconst innerMap = map.get(key1);\n\tif (innerMap === undefined) {\n\t\treturn undefined;\n\t}\n\treturn innerMap.get(key2);\n}\n\n/**\n * If (key1, key2) is not in the map, add value to the map.\n * Returns whatever is at (key1, key2) in map (which will be value if it was empty before).\n *\n * @internal\n */\nexport function getOrAddInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): Value {\n\tconst existing = tryAddToNestedMap(map, key1, key2, value);\n\tif (existing !== undefined) {\n\t\treturn existing;\n\t}\n\treturn value;\n}\n\n/**\n * Does not change map.\n * If (key1, key2) is not in map, returns value.\n * If (key1, key2) is in map, return its entry.\n *\n * @internal\n */\nexport function getOrDefaultInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n\tvalue: Value,\n): Value {\n\tconst existing = tryGetFromNestedMap(map, key1, key2);\n\tif (existing !== undefined) {\n\t\treturn existing;\n\t}\n\treturn value;\n}\n\n/**\n * Removes the value at (key1, key2) from the map.\n *\n * @returns true iff found.\n *\n * @internal\n */\nexport function deleteFromNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tkey1: Key1,\n\tkey2: Key2,\n): boolean {\n\tconst innerMap = map.get(key1);\n\tif (innerMap === undefined) {\n\t\treturn false;\n\t}\n\tconst deleted = innerMap.delete(key2);\n\tif (innerMap.size === 0) {\n\t\tmap.delete(key1);\n\t}\n\treturn deleted;\n}\n\n/**\n * Converts a nested map to a flat list of triplets.\n */\nexport function nestedMapToFlatList<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n): [Key1, Key2, Value][] {\n\tconst list: [Key1, Key2, Value][] = [];\n\tmap.forEach((innerMap, key1) => {\n\t\tinnerMap.forEach((val, key2) => {\n\t\t\tlist.push([key1, key2, val]);\n\t\t});\n\t});\n\treturn list;\n}\n\n/**\n * Builds a nested map from a flat list of triplets.\n */\nexport function nestedMapFromFlatList<Key1, Key2, Value>(\n\tlist: readonly (readonly [Key1, Key2, Value])[],\n): NestedMap<Key1, Key2, Value> {\n\tconst map = new Map<Key1, Map<Key2, Value>>();\n\tfor (const [key1, key2, val] of list) {\n\t\tgetOrAddInMap(map, key1, new Map<Key2, Value>()).set(key2, val);\n\t}\n\treturn map;\n}\n\nexport function forEachInNestedMap<Key1, Key2, Value>(\n\tmap: NestedMap<Key1, Key2, Value>,\n\tdelegate: (value: Value, key1: Key1, key2: Key2) => void,\n): void {\n\tmap.forEach((innerMap, keyFirst) => {\n\t\tinnerMap.forEach((val, keySecond) => {\n\t\t\tdelegate(val, keyFirst, keySecond);\n\t\t});\n\t});\n}\n\n/**\n * Map with two keys; same semantics as NestedMap, but maintains a size count for the entire collection.\n * Note: undefined is not supported as a value, and will cause incorrect behavior.\n *\n * @internal\n */\nexport class SizedNestedMap<Key1, Key2, Value> {\n\tprivate readonly nestedMap: NestedMap<Key1, Key2, Value> = new Map();\n\tprivate count = 0;\n\n\t/**\n\t * Returns the total number of elements in this nested map.\n\t */\n\tpublic get size(): number {\n\t\treturn this.count;\n\t}\n\n\t/**\n\t * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is\n\t * returned.\n\t */\n\tpublic tryGet(key1: Key1, key2: Key2): Value | undefined {\n\t\treturn tryGetFromNestedMap(this.nestedMap, key1, key2);\n\t}\n\n\t/**\n\t * Does not change map.\n\t * If (key1, key2) is not in map, returns value.\n\t * If (key1, key2) is in map, return its entry.\n\t */\n\tpublic getOrDefault(key1: Key1, key2: Key2, value: Value): Value {\n\t\treturn getOrDefaultInNestedMap(this.nestedMap, key1, key2, value);\n\t}\n\n\t/**\n\t * If (key1, key2) already has a value in the map, it is returned, otherwise value is added under (key1, key2) and undefined is\n\t * returned.\n\t */\n\tpublic tryAdd(key1: Key1, key2: Key2, value: Value): Value | undefined {\n\t\tconst currentVal = tryAddToNestedMap(this.nestedMap, key1, key2, value);\n\t\tif (currentVal === undefined) {\n\t\t\tthis.count++;\n\t\t}\n\t\treturn currentVal;\n\t}\n\n\t/**\n\t * Sets the value at (key1, key2) in map to value.\n\t * If there already is a value for (key1, key2), it is replaced with the provided one.\n\t */\n\tpublic set(key1: Key1, key2: Key2, value: Value): void {\n\t\tif (this.tryAdd(key1, key2, value) !== undefined) {\n\t\t\tsetInNestedMap(this.nestedMap, key1, key2, value);\n\t\t}\n\t}\n\n\t/**\n\t * Removes the value at (key1, key2) from the map.\n\t * Returns true iff found.\n\t */\n\tpublic delete(key1: Key1, key2: Key2): boolean {\n\t\tconst deleted = deleteFromNestedMap(this.nestedMap, key1, key2);\n\t\tif (deleted) {\n\t\t\tthis.count--;\n\t\t}\n\t\treturn deleted;\n\t}\n\n\t/**\n\t * Runs the supplied delegate for every (value, key1, key2).\n\t */\n\tpublic forEach(delegate: (value: Value, key1: Key1, key2: Key2) => void): void {\n\t\tforEachInNestedMap(this.nestedMap, delegate);\n\t}\n\n\t/**\n\t * Clears the map.\n\t */\n\tpublic clear(): void {\n\t\tthis.count = 0;\n\t\tthis.nestedMap.clear();\n\t}\n\n\tpublic values(): IterableIterator<Value> {\n\t\treturn Array.from(this.nestedMap.values()).flatMap((innerMap) => innerMap.values())[0];\n\t}\n\n\tpublic [Symbol.iterator]() {\n\t\treturn this.nestedMap[Symbol.iterator]();\n\t}\n}\n"]}

package/lib/util/nestedSet.d.ts

@@ -0,0 +1,9 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { NestedMap } from "./nestedMap";
+export type NestedSet<Key1, Key2> = NestedMap<Key1, Key2, boolean>;
+export declare function addToNestedSet<Key1, Key2>(set: NestedSet<Key1, Key2>, key1: Key1, key2: Key2): void;
+export declare function nestedSetContains<Key1, Key2>(set: NestedSet<Key1, Key2>, key1: Key1, key2: Key2): boolean;
+//# sourceMappingURL=nestedSet.d.ts.map

package/lib/util/nestedSet.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"nestedSet.d.ts","sourceRoot":"","sources":["../../src/util/nestedSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAA2B,SAAS,EAAkB,MAAM,aAAa,CAAC;AAEjF,MAAM,MAAM,SAAS,CAAC,IAAI,EAAE,IAAI,IAAI,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AAEnE,wBAAgB,cAAc,CAAC,IAAI,EAAE,IAAI,EACxC,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,EAC1B,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,GACR,IAAI,CAEN;AAED,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAC3C,GAAG,EAAE,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,EAC1B,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,GACR,OAAO,CAET"}

package/lib/util/nestedSet.js

@@ -0,0 +1,12 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { getOrDefaultInNestedMap, setInNestedMap } from "./nestedMap";
+export function addToNestedSet(set, key1, key2) {
+    setInNestedMap(set, key1, key2, true);
+}
+export function nestedSetContains(set, key1, key2) {
+    return getOrDefaultInNestedMap(set, key1, key2, false);
+}
+//# sourceMappingURL=nestedSet.js.map

package/lib/util/nestedSet.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nestedSet.js","sourceRoot":"","sources":["../../src/util/nestedSet.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,uBAAuB,EAAa,cAAc,EAAE,MAAM,aAAa,CAAC;AAIjF,MAAM,UAAU,cAAc,CAC7B,GAA0B,EAC1B,IAAU,EACV,IAAU;IAEV,cAAc,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACvC,CAAC;AAED,MAAM,UAAU,iBAAiB,CAChC,GAA0B,EAC1B,IAAU,EACV,IAAU;IAEV,OAAO,uBAAuB,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;AACxD,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { getOrDefaultInNestedMap, NestedMap, setInNestedMap } from \"./nestedMap\";\n\nexport type NestedSet<Key1, Key2> = NestedMap<Key1, Key2, boolean>;\n\nexport function addToNestedSet<Key1, Key2>(\n\tset: NestedSet<Key1, Key2>,\n\tkey1: Key1,\n\tkey2: Key2,\n): void {\n\tsetInNestedMap(set, key1, key2, true);\n}\n\nexport function nestedSetContains<Key1, Key2>(\n\tset: NestedSet<Key1, Key2>,\n\tkey1: Key1,\n\tkey2: Key2,\n): boolean {\n\treturn getOrDefaultInNestedMap(set, key1, key2, false);\n}\n"]}

package/lib/util/offsetList.d.ts

@@ -0,0 +1,22 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export type OffsetList<TContent = Exclude<unknown, number>, TOffset = number> = (TOffset | TContent)[];
+/**
+ * Helper class for constructing an offset list that...
+ *
+ * - Does not insert offsets if there is no content after them
+ *
+ * - Does not insert 0-sized offsets
+ *
+ * - Merges runs of offsets together
+ */
+export declare class OffsetListFactory<TContent> {
+    private offset;
+    readonly list: OffsetList<TContent>;
+    push(...offsetOrContent: (number | TContent)[]): void;
+    pushOffset(offset: number): void;
+    pushContent(content: TContent): void;
+}
+//# sourceMappingURL=offsetList.d.ts.map

package/lib/util/offsetList.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"offsetList.d.ts","sourceRoot":"","sources":["../../src/util/offsetList.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,MAAM,UAAU,CAAC,QAAQ,GAAG,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,MAAM,IAAI,CAC7E,OAAO,GACP,QAAQ,CACV,EAAE,CAAC;AAEJ;;;;;;;;GAQG;AACH,qBAAa,iBAAiB,CAAC,QAAQ;IACtC,OAAO,CAAC,MAAM,CAAK;IACnB,SAAgB,IAAI,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAM;IAEzC,IAAI,CAAC,GAAG,eAAe,EAAE,CAAC,MAAM,GAAG,QAAQ,CAAC,EAAE,GAAG,IAAI;IAUrD,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIhC,WAAW,CAAC,OAAO,EAAE,QAAQ,GAAG,IAAI;CAO3C"}

package/lib/util/offsetList.js

@@ -0,0 +1,40 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * Helper class for constructing an offset list that...
+ *
+ * - Does not insert offsets if there is no content after them
+ *
+ * - Does not insert 0-sized offsets
+ *
+ * - Merges runs of offsets together
+ */
+export class OffsetListFactory {
+    constructor() {
+        this.offset = 0;
+        this.list = [];
+    }
+    push(...offsetOrContent) {
+        for (const item of offsetOrContent) {
+            if (typeof item === "number") {
+                this.pushOffset(item);
+            }
+            else {
+                this.pushContent(item);
+            }
+        }
+    }
+    pushOffset(offset) {
+        this.offset += offset;
+    }
+    pushContent(content) {
+        if (this.offset > 0) {
+            this.list.push(this.offset);
+            this.offset = 0;
+        }
+        this.list.push(content);
+    }
+}
+//# sourceMappingURL=offsetList.js.map

package/lib/util/offsetList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"offsetList.js","sourceRoot":"","sources":["../../src/util/offsetList.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH;;;;;;;;GAQG;AACH,MAAM,OAAO,iBAAiB;IAA9B;QACS,WAAM,GAAG,CAAC,CAAC;QACH,SAAI,GAAyB,EAAE,CAAC;IAuBjD,CAAC;IArBO,IAAI,CAAC,GAAG,eAAsC;QACpD,KAAK,MAAM,IAAI,IAAI,eAAe,EAAE;YACnC,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE;gBAC7B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;aACtB;iBAAM;gBACN,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;aACvB;SACD;IACF,CAAC;IAEM,UAAU,CAAC,MAAc;QAC/B,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC;IACvB,CAAC;IAEM,WAAW,CAAC,OAAiB;QACnC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YACpB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC5B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAChB;QACD,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nexport type OffsetList<TContent = Exclude<unknown, number>, TOffset = number> = (\n\t| TOffset\n\t| TContent\n)[];\n\n/**\n * Helper class for constructing an offset list that...\n *\n * - Does not insert offsets if there is no content after them\n *\n * - Does not insert 0-sized offsets\n *\n * - Merges runs of offsets together\n */\nexport class OffsetListFactory<TContent> {\n\tprivate offset = 0;\n\tpublic readonly list: OffsetList<TContent> = [];\n\n\tpublic push(...offsetOrContent: (number | TContent)[]): void {\n\t\tfor (const item of offsetOrContent) {\n\t\t\tif (typeof item === \"number\") {\n\t\t\t\tthis.pushOffset(item);\n\t\t\t} else {\n\t\t\t\tthis.pushContent(item);\n\t\t\t}\n\t\t}\n\t}\n\n\tpublic pushOffset(offset: number): void {\n\t\tthis.offset += offset;\n\t}\n\n\tpublic pushContent(content: TContent): void {\n\t\tif (this.offset > 0) {\n\t\t\tthis.list.push(this.offset);\n\t\t\tthis.offset = 0;\n\t\t}\n\t\tthis.list.push(content);\n\t}\n}\n"]}

package/lib/util/rangeMap.d.ts

@@ -0,0 +1,40 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * A map keyed on integers allowing reading and writing contiguous ranges of integer keys.
+ */
+export type RangeMap<T> = RangeEntry<T>[];
+export interface RangeEntry<T> {
+    start: number;
+    length: number;
+    value: T;
+}
+/**
+ * The result of a query about a range of keys.
+ *
+ * @internal
+ */
+export interface RangeQueryResult<T> {
+    /**
+     * The value of the first key in the query range.
+     */
+    value: T | undefined;
+    /**
+     * The length of the prefix of the query range which have the same value.
+     * For example, if a RangeMap has the same value for keys 5, 6, and 7,
+     * a query about the range [5, 10] would give a result with length 3.
+     */
+    length: number;
+}
+/**
+ * See comments on `RangeQueryResult`.
+ */
+export declare function getFromRangeMap<T>(map: RangeMap<T>, start: number, length: number): RangeQueryResult<T>;
+export declare function getFirstEntryFromRangeMap<T>(map: RangeMap<T>, start: number, length: number): RangeEntry<T> | undefined;
+/**
+ * Sets the keys from `start` to `start + length - 1` to `value`.
+ */
+export declare function setInRangeMap<T>(map: RangeMap<T>, start: number, length: number, value: T): void;
+//# sourceMappingURL=rangeMap.d.ts.map

package/lib/util/rangeMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"rangeMap.d.ts","sourceRoot":"","sources":["../../src/util/rangeMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AAE1C,MAAM,WAAW,UAAU,CAAC,CAAC;IAC5B,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,CAAC,CAAC;CACT;AAED;;;;GAIG;AACH,MAAM,WAAW,gBAAgB,CAAC,CAAC;IAClC;;OAEG;IACH,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC;IAErB;;;;OAIG;IACH,MAAM,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAChC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,EAChB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,GACZ,gBAAgB,CAAC,CAAC,CAAC,CAgBrB;AAED,wBAAgB,yBAAyB,CAAC,CAAC,EAC1C,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,EAChB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,MAAM,GACZ,UAAU,CAAC,CAAC,CAAC,GAAG,SAAS,CAe3B;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAgEhG"}

package/lib/util/rangeMap.js

@@ -0,0 +1,97 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * See comments on `RangeQueryResult`.
+ */
+export function getFromRangeMap(map, start, length) {
+    for (const range of map) {
+        if (range.start > start) {
+            return { value: undefined, length: Math.min(range.start - start, length) };
+        }
+        const lastRangeKey = range.start + range.length - 1;
+        if (lastRangeKey >= start) {
+            // This range contains `start`.
+            const overlapLength = lastRangeKey - start + 1;
+            return { value: range.value, length: Math.min(overlapLength, length) };
+        }
+    }
+    // There were no entries intersecting the query range, so the entire query range has undefined value.
+    return { value: undefined, length };
+}
+export function getFirstEntryFromRangeMap(map, start, length) {
+    const lastQueryKey = start + length - 1;
+    for (const range of map) {
+        if (range.start > lastQueryKey) {
+            // We've passed the end of the query range.
+            break;
+        }
+        const lastRangeKey = range.start + range.length - 1;
+        if (lastRangeKey >= start) {
+            return range;
+        }
+    }
+    return undefined;
+}
+/**
+ * Sets the keys from `start` to `start + length - 1` to `value`.
+ */
+export function setInRangeMap(map, start, length, value) {
+    const end = start + length - 1;
+    const newEntry = { start, length, value };
+    let iBefore = -1;
+    let iAfter = map.length;
+    for (const [i, entry] of map.entries()) {
+        const entryLastKey = entry.start + entry.length - 1;
+        if (entryLastKey < start) {
+            iBefore = i;
+        }
+        else if (entry.start > end) {
+            iAfter = i;
+            break;
+        }
+    }
+    const numOverlappingEntries = iAfter - iBefore - 1;
+    if (numOverlappingEntries === 0) {
+        map.splice(iAfter, 0, newEntry);
+        return;
+    }
+    const iFirst = iBefore + 1;
+    const firstEntry = map[iFirst];
+    const iLast = iAfter - 1;
+    const lastEntry = map[iLast];
+    const lengthBeforeFirst = start - firstEntry.start;
+    const lastEntryKey = lastEntry.start + lastEntry.length - 1;
+    const lengthAfterLast = lastEntryKey - end;
+    if (lengthBeforeFirst > 0 && lengthAfterLast > 0 && iFirst === iLast) {
+        // The new entry fits in the middle of an existing entry.
+        // We replace the existing entry with:
+        // 1) the portion which comes before `newEntry`
+        // 2) `newEntry`
+        // 3) the portion which comes after `newEntry`
+        map.splice(iFirst, 1, { ...firstEntry, length: lengthBeforeFirst }, newEntry, {
+            ...lastEntry,
+            start: end + 1,
+            length: lengthAfterLast,
+        });
+        return;
+    }
+    if (lengthBeforeFirst > 0) {
+        map[iFirst] = { ...firstEntry, length: lengthBeforeFirst };
+        // The entry at `iFirst` is no longer overlapping with `newEntry`.
+        iBefore = iFirst;
+    }
+    if (lengthAfterLast > 0) {
+        map[iLast] = {
+            ...lastEntry,
+            start: end + 1,
+            length: lengthAfterLast,
+        };
+        // The entry at `iLast` is no longer overlapping with `newEntry`.
+        iAfter = iLast;
+    }
+    const numContainedEntries = iAfter - iBefore - 1;
+    map.splice(iBefore + 1, numContainedEntries, newEntry);
+}
+//# sourceMappingURL=rangeMap.js.map

package/lib/util/rangeMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rangeMap.js","sourceRoot":"","sources":["../../src/util/rangeMap.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAgCH;;GAEG;AACH,MAAM,UAAU,eAAe,CAC9B,GAAgB,EAChB,KAAa,EACb,MAAc;IAEd,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE;QACxB,IAAI,KAAK,CAAC,KAAK,GAAG,KAAK,EAAE;YACxB,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,GAAG,KAAK,EAAE,MAAM,CAAC,EAAE,CAAC;SAC3E;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACpD,IAAI,YAAY,IAAI,KAAK,EAAE;YAC1B,+BAA+B;YAC/B,MAAM,aAAa,GAAG,YAAY,GAAG,KAAK,GAAG,CAAC,CAAC;YAC/C,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,MAAM,CAAC,EAAE,CAAC;SACvE;KACD;IAED,qGAAqG;IACrG,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;AACrC,CAAC;AAED,MAAM,UAAU,yBAAyB,CACxC,GAAgB,EAChB,KAAa,EACb,MAAc;IAEd,MAAM,YAAY,GAAG,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;IACxC,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE;QACxB,IAAI,KAAK,CAAC,KAAK,GAAG,YAAY,EAAE;YAC/B,2CAA2C;YAC3C,MAAM;SACN;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACpD,IAAI,YAAY,IAAI,KAAK,EAAE;YAC1B,OAAO,KAAK,CAAC;SACb;KACD;IAED,OAAO,SAAS,CAAC;AAClB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAI,GAAgB,EAAE,KAAa,EAAE,MAAc,EAAE,KAAQ;IACzF,MAAM,GAAG,GAAG,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAkB,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAEzD,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;IACjB,IAAI,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IACxB,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE;QACvC,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QACpD,IAAI,YAAY,GAAG,KAAK,EAAE;YACzB,OAAO,GAAG,CAAC,CAAC;SACZ;aAAM,IAAI,KAAK,CAAC,KAAK,GAAG,GAAG,EAAE;YAC7B,MAAM,GAAG,CAAC,CAAC;YACX,MAAM;SACN;KACD;IAED,MAAM,qBAAqB,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;IACnD,IAAI,qBAAqB,KAAK,CAAC,EAAE;QAChC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QAChC,OAAO;KACP;IAED,MAAM,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;IAC3B,MAAM,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;IAC/B,MAAM,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC;IACzB,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IAC7B,MAAM,iBAAiB,GAAG,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC;IACnD,MAAM,YAAY,GAAG,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5D,MAAM,eAAe,GAAG,YAAY,GAAG,GAAG,CAAC;IAE3C,IAAI,iBAAiB,GAAG,CAAC,IAAI,eAAe,GAAG,CAAC,IAAI,MAAM,KAAK,KAAK,EAAE;QACrE,yDAAyD;QACzD,sCAAsC;QACtC,+CAA+C;QAC/C,gBAAgB;QAChB,8CAA8C;QAC9C,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,UAAU,EAAE,MAAM,EAAE,iBAAiB,EAAE,EAAE,QAAQ,EAAE;YAC7E,GAAG,SAAS;YACZ,KAAK,EAAE,GAAG,GAAG,CAAC;YACd,MAAM,EAAE,eAAe;SACvB,CAAC,CAAC;QACH,OAAO;KACP;IAED,IAAI,iBAAiB,GAAG,CAAC,EAAE;QAC1B,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,UAAU,EAAE,MAAM,EAAE,iBAAiB,EAAE,CAAC;QAE3D,kEAAkE;QAClE,OAAO,GAAG,MAAM,CAAC;KACjB;IAED,IAAI,eAAe,GAAG,CAAC,EAAE;QACxB,GAAG,CAAC,KAAK,CAAC,GAAG;YACZ,GAAG,SAAS;YACZ,KAAK,EAAE,GAAG,GAAG,CAAC;YACd,MAAM,EAAE,eAAe;SACvB,CAAC;QAEF,iEAAiE;QACjE,MAAM,GAAG,KAAK,CAAC;KACf;IAED,MAAM,mBAAmB,GAAG,MAAM,GAAG,OAAO,GAAG,CAAC,CAAC;IACjD,GAAG,CAAC,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,mBAAmB,EAAE,QAAQ,CAAC,CAAC;AACxD,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/**\n * A map keyed on integers allowing reading and writing contiguous ranges of integer keys.\n */\nexport type RangeMap<T> = RangeEntry<T>[];\n\nexport interface RangeEntry<T> {\n\tstart: number;\n\tlength: number;\n\tvalue: T;\n}\n\n/**\n * The result of a query about a range of keys.\n *\n * @internal\n */\nexport interface RangeQueryResult<T> {\n\t/**\n\t * The value of the first key in the query range.\n\t */\n\tvalue: T | undefined;\n\n\t/**\n\t * The length of the prefix of the query range which have the same value.\n\t * For example, if a RangeMap has the same value for keys 5, 6, and 7,\n\t * a query about the range [5, 10] would give a result with length 3.\n\t */\n\tlength: number;\n}\n\n/**\n * See comments on `RangeQueryResult`.\n */\nexport function getFromRangeMap<T>(\n\tmap: RangeMap<T>,\n\tstart: number,\n\tlength: number,\n): RangeQueryResult<T> {\n\tfor (const range of map) {\n\t\tif (range.start > start) {\n\t\t\treturn { value: undefined, length: Math.min(range.start - start, length) };\n\t\t}\n\n\t\tconst lastRangeKey = range.start + range.length - 1;\n\t\tif (lastRangeKey >= start) {\n\t\t\t// This range contains `start`.\n\t\t\tconst overlapLength = lastRangeKey - start + 1;\n\t\t\treturn { value: range.value, length: Math.min(overlapLength, length) };\n\t\t}\n\t}\n\n\t// There were no entries intersecting the query range, so the entire query range has undefined value.\n\treturn { value: undefined, length };\n}\n\nexport function getFirstEntryFromRangeMap<T>(\n\tmap: RangeMap<T>,\n\tstart: number,\n\tlength: number,\n): RangeEntry<T> | undefined {\n\tconst lastQueryKey = start + length - 1;\n\tfor (const range of map) {\n\t\tif (range.start > lastQueryKey) {\n\t\t\t// We've passed the end of the query range.\n\t\t\tbreak;\n\t\t}\n\n\t\tconst lastRangeKey = range.start + range.length - 1;\n\t\tif (lastRangeKey >= start) {\n\t\t\treturn range;\n\t\t}\n\t}\n\n\treturn undefined;\n}\n\n/**\n * Sets the keys from `start` to `start + length - 1` to `value`.\n */\nexport function setInRangeMap<T>(map: RangeMap<T>, start: number, length: number, value: T): void {\n\tconst end = start + length - 1;\n\tconst newEntry: RangeEntry<T> = { start, length, value };\n\n\tlet iBefore = -1;\n\tlet iAfter = map.length;\n\tfor (const [i, entry] of map.entries()) {\n\t\tconst entryLastKey = entry.start + entry.length - 1;\n\t\tif (entryLastKey < start) {\n\t\t\tiBefore = i;\n\t\t} else if (entry.start > end) {\n\t\t\tiAfter = i;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tconst numOverlappingEntries = iAfter - iBefore - 1;\n\tif (numOverlappingEntries === 0) {\n\t\tmap.splice(iAfter, 0, newEntry);\n\t\treturn;\n\t}\n\n\tconst iFirst = iBefore + 1;\n\tconst firstEntry = map[iFirst];\n\tconst iLast = iAfter - 1;\n\tconst lastEntry = map[iLast];\n\tconst lengthBeforeFirst = start - firstEntry.start;\n\tconst lastEntryKey = lastEntry.start + lastEntry.length - 1;\n\tconst lengthAfterLast = lastEntryKey - end;\n\n\tif (lengthBeforeFirst > 0 && lengthAfterLast > 0 && iFirst === iLast) {\n\t\t// The new entry fits in the middle of an existing entry.\n\t\t// We replace the existing entry with:\n\t\t// 1) the portion which comes before `newEntry`\n\t\t// 2) `newEntry`\n\t\t// 3) the portion which comes after `newEntry`\n\t\tmap.splice(iFirst, 1, { ...firstEntry, length: lengthBeforeFirst }, newEntry, {\n\t\t\t...lastEntry,\n\t\t\tstart: end + 1,\n\t\t\tlength: lengthAfterLast,\n\t\t});\n\t\treturn;\n\t}\n\n\tif (lengthBeforeFirst > 0) {\n\t\tmap[iFirst] = { ...firstEntry, length: lengthBeforeFirst };\n\n\t\t// The entry at `iFirst` is no longer overlapping with `newEntry`.\n\t\tiBefore = iFirst;\n\t}\n\n\tif (lengthAfterLast > 0) {\n\t\tmap[iLast] = {\n\t\t\t...lastEntry,\n\t\t\tstart: end + 1,\n\t\t\tlength: lengthAfterLast,\n\t\t};\n\n\t\t// The entry at `iLast` is no longer overlapping with `newEntry`.\n\t\tiAfter = iLast;\n\t}\n\n\tconst numContainedEntries = iAfter - iBefore - 1;\n\tmap.splice(iBefore + 1, numContainedEntries, newEntry);\n}\n"]}

package/lib/util/referenceCounting.d.ts

@@ -0,0 +1,30 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+export interface ReferenceCounted {
+    referenceAdded(): void;
+    referenceRemoved(): void;
+    /**
+     * @returns true if mutating this object may impact other users of it.
+     *
+     * Implementations can return true if the refcount is 1 OR the content is logically immutable.
+     */
+    isShared(): boolean;
+}
+/**
+ * Base class to assist with implementing ReferenceCounted.
+ */
+export declare abstract class ReferenceCountedBase implements ReferenceCounted {
+    private refCount;
+    protected constructor(refCount?: number);
+    referenceAdded(count?: number): void;
+    referenceRemoved(count?: number): void;
+    isShared(): boolean;
+    isUnreferenced(): boolean;
+    /**
+     * Called when refcount reaches 0.
+     */
+    protected abstract dispose(): void;
+}
+//# sourceMappingURL=referenceCounting.d.ts.map

package/lib/util/referenceCounting.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"referenceCounting.d.ts","sourceRoot":"","sources":["../../src/util/referenceCounting.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,MAAM,WAAW,gBAAgB;IAChC,cAAc,IAAI,IAAI,CAAC;IAEvB,gBAAgB,IAAI,IAAI,CAAC;IAEzB;;;;OAIG;IACH,QAAQ,IAAI,OAAO,CAAC;CACpB;AAED;;GAEG;AACH,8BAAsB,oBAAqB,YAAW,gBAAgB;IAC/C,OAAO,CAAC,QAAQ;IAAtC,SAAS,aAAqB,QAAQ,GAAE,MAAU;IAE3C,cAAc,CAAC,KAAK,SAAI,GAAG,IAAI;IAI/B,gBAAgB,CAAC,KAAK,SAAI,GAAG,IAAI;IAQjC,QAAQ,IAAI,OAAO;IAInB,cAAc,IAAI,OAAO;IAIhC;;OAEG;IACH,SAAS,CAAC,QAAQ,CAAC,OAAO,IAAI,IAAI;CAClC"}

package/lib/util/referenceCounting.js

@@ -0,0 +1,30 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { assert } from "@fluidframework/core-utils";
+/**
+ * Base class to assist with implementing ReferenceCounted.
+ */
+export class ReferenceCountedBase {
+    constructor(refCount = 1) {
+        this.refCount = refCount;
+    }
+    referenceAdded(count = 1) {
+        this.refCount += count;
+    }
+    referenceRemoved(count = 1) {
+        this.refCount -= count;
+        assert(this.refCount >= 0, 0x4c4 /* Negative ref count */);
+        if (this.refCount === 0) {
+            this.dispose();
+        }
+    }
+    isShared() {
+        return this.refCount > 1;
+    }
+    isUnreferenced() {
+        return this.refCount === 0;
+    }
+}
+//# sourceMappingURL=referenceCounting.js.map

package/lib/util/referenceCounting.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"referenceCounting.js","sourceRoot":"","sources":["../../src/util/referenceCounting.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,4BAA4B,CAAC;AAepD;;GAEG;AACH,MAAM,OAAgB,oBAAoB;IACzC,YAA8B,WAAmB,CAAC;QAApB,aAAQ,GAAR,QAAQ,CAAY;IAAG,CAAC;IAE/C,cAAc,CAAC,KAAK,GAAG,CAAC;QAC9B,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;IACxB,CAAC;IAEM,gBAAgB,CAAC,KAAK,GAAG,CAAC;QAChC,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC;QACvB,MAAM,CAAC,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;QAC3D,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,EAAE;YACxB,IAAI,CAAC,OAAO,EAAE,CAAC;SACf;IACF,CAAC;IAEM,QAAQ;QACd,OAAO,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;IAC1B,CAAC;IAEM,cAAc;QACpB,OAAO,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC;IAC5B,CAAC;CAMD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\n\nexport interface ReferenceCounted {\n\treferenceAdded(): void;\n\n\treferenceRemoved(): void;\n\n\t/**\n\t * @returns true if mutating this object may impact other users of it.\n\t *\n\t * Implementations can return true if the refcount is 1 OR the content is logically immutable.\n\t */\n\tisShared(): boolean;\n}\n\n/**\n * Base class to assist with implementing ReferenceCounted.\n */\nexport abstract class ReferenceCountedBase implements ReferenceCounted {\n\tprotected constructor(private refCount: number = 1) {}\n\n\tpublic referenceAdded(count = 1): void {\n\t\tthis.refCount += count;\n\t}\n\n\tpublic referenceRemoved(count = 1): void {\n\t\tthis.refCount -= count;\n\t\tassert(this.refCount >= 0, 0x4c4 /* Negative ref count */);\n\t\tif (this.refCount === 0) {\n\t\t\tthis.dispose();\n\t\t}\n\t}\n\n\tpublic isShared(): boolean {\n\t\treturn this.refCount > 1;\n\t}\n\n\tpublic isUnreferenced(): boolean {\n\t\treturn this.refCount === 0;\n\t}\n\n\t/**\n\t * Called when refcount reaches 0.\n\t */\n\tprotected abstract dispose(): void;\n}\n"]}

package/lib/util/stackyIterator.d.ts

@@ -0,0 +1,20 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * An iterator that supports having items pushed onto it for later iteration.
+ */
+export declare class StackyIterator<T> implements Iterator<T>, Iterable<T> {
+    private readonly list;
+    private readonly stack;
+    private index;
+    constructor(list: readonly T[]);
+    [Symbol.iterator](): Iterator<T>;
+    next(): IteratorResult<T>;
+    get done(): boolean;
+    push(item: T): void;
+    pop(): T | undefined;
+    peek(): T | undefined;
+}
+//# sourceMappingURL=stackyIterator.d.ts.map

package/lib/util/stackyIterator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stackyIterator.d.ts","sourceRoot":"","sources":["../../src/util/stackyIterator.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,qBAAa,cAAc,CAAC,CAAC,CAAE,YAAW,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IACjE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAe;IACpC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAW;IACjC,OAAO,CAAC,KAAK,CAAK;gBAEC,IAAI,EAAE,SAAS,CAAC,EAAE;IAI9B,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC;IAIhC,IAAI,IAAI,cAAc,CAAC,CAAC,CAAC;IAOhC,IAAW,IAAI,IAAI,OAAO,CAEzB;IAEM,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI;IAInB,GAAG,IAAI,CAAC,GAAG,SAAS;IAUpB,IAAI,IAAI,CAAC,GAAG,SAAS;CAM5B"}

package/lib/util/stackyIterator.js

@@ -0,0 +1,45 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/**
+ * An iterator that supports having items pushed onto it for later iteration.
+ */
+export class StackyIterator {
+    constructor(list) {
+        this.stack = [];
+        this.index = 0;
+        this.list = list;
+    }
+    [Symbol.iterator]() {
+        return this;
+    }
+    next() {
+        if (this.done) {
+            return { value: undefined, done: true };
+        }
+        return { value: this.pop() };
+    }
+    get done() {
+        return this.index >= this.list.length && this.stack.length === 0;
+    }
+    push(item) {
+        this.stack.push(item);
+    }
+    pop() {
+        if (this.stack.length > 0) {
+            return this.stack.pop();
+        }
+        if (this.index >= this.list.length) {
+            return undefined;
+        }
+        return this.list[this.index++];
+    }
+    peek() {
+        if (this.stack.length > 0) {
+            return this.stack[this.stack.length - 1];
+        }
+        return this.list[this.index];
+    }
+}
+//# sourceMappingURL=stackyIterator.js.map