@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/dist/id-compressor/AppendOnlySortedMap.js

@@ -0,0 +1,283 @@
+"use strict";
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AppendOnlyDoublySortedMap = exports.AppendOnlySortedMap = void 0;
+/* eslint-disable no-bitwise */
+const Common_1 = require("../Common");
+/**
+ * A map in which entries are always added in key-sorted order.
+ * Supports appending and searching.
+ */
+class AppendOnlySortedMap {
+    /**
+     * @param comparator a comparator for keys
+     */
+    constructor(comparator) {
+        this.comparator = comparator;
+        this.elements = [];
+        this.compareKeys = (search, element) => {
+            return this.comparator(search, element[0]);
+        };
+    }
+    /**
+     * @returns the number of entries in this map
+     */
+    get size() {
+        return this.elements.length;
+    }
+    /**
+     * @returns the min key in the map.
+     */
+    minKey() {
+        var _a;
+        return (_a = this.elements[0]) === null || _a === void 0 ? void 0 : _a[0];
+    }
+    /**
+     * @returns the max key in the map.
+     */
+    maxKey() {
+        var _a;
+        return (_a = this.elements[this.size - 1]) === null || _a === void 0 ? void 0 : _a[0];
+    }
+    /**
+     * @returns an iterable of the entries in the map.
+     */
+    *entries() {
+        for (const entry of this.elements) {
+            yield entry;
+        }
+    }
+    /**
+     * @returns an iterable of the keys in the map.
+     */
+    *keys() {
+        for (const entry of this.elements) {
+            yield entry[0];
+        }
+    }
+    /**
+     * @returns an iterable of the values in the map.
+     */
+    *values() {
+        for (const entry of this.elements) {
+            yield entry[1];
+        }
+    }
+    /**
+     * @returns an iterable of the entries in the map, reversed.
+     */
+    *entriesReversed() {
+        for (let i = this.size - 1; i >= 0; i--) {
+            yield this.elements[i];
+        }
+    }
+    /**
+     * Adds a new key/value pair to the map. `key` must be > to all keys in the map.
+     * @param key the key to add.
+     * @param value the value to add.
+     */
+    append(key, value) {
+        if (this.size !== 0 && this.comparator(key, this.elements[this.size - 1][0]) <= 0) {
+            Common_1.fail('Inserted key must be > all others in the map.');
+        }
+        this.elements.push([key, value]);
+    }
+    /**
+     * @param key the key to lookup.
+     * @returns the value associated with `key` if such an entry exists, and undefined otherwise.
+     */
+    get(key) {
+        var _a;
+        const index = AppendOnlySortedMap.indexOf(this.elements, key, this.compareKeys);
+        return (_a = this.elements[index]) === null || _a === void 0 ? void 0 : _a[1];
+    }
+    /**
+     * @param key the key to lookup.
+     * @returns the entry associated with `key` if such an entry exists, the entry associated with the next lower key if such an entry
+     * exists, and undefined otherwise.
+     */
+    getPairOrNextLower(key) {
+        return this.getPairOrNextLowerBy(key, this.compareKeys);
+    }
+    /**
+     * @param key the key to lookup.
+     * @returns the entry associated with `key` if such an entry exists, the entry associated with the next higher key if such an entry
+     * exists, and undefined otherwise.
+     */
+    getPairOrNextHigher(key) {
+        return this.getPairOrNextHigherBy(key, this.compareKeys);
+    }
+    /**
+     * Compares two `AppendOnlySortedMap`s.
+     */
+    equals(other, compareValues) {
+        if (other === this) {
+            return true;
+        }
+        if (this.size !== other.size) {
+            return false;
+        }
+        for (let i = this.size - 1; i >= 0; i--) {
+            const [keyThis, valueThis] = this.elements[i];
+            const [keyOther, valueOther] = other.elements[i];
+            if (this.comparator(keyThis, keyOther) !== 0) {
+                return false;
+            }
+            if (!compareValues(valueThis, valueOther)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Queries a range of entries.
+     * @param from the key to start the range query at, inclusive.
+     * @param to the key to end the range query at, inclusive.
+     * @returns the range of entries.
+     */
+    *getRange(from, to) {
+        const indexFrom = this.getIndexOfOrNextHigher(from, this.compareKeys);
+        if (indexFrom === undefined) {
+            return;
+        }
+        const indexTo = this.getIndexOfOrNextLower(to, this.compareKeys);
+        if (indexTo === undefined) {
+            return;
+        }
+        for (let i = indexFrom; i <= indexTo; i++) {
+            yield this.elements[i];
+        }
+    }
+    getPairOrNextLowerBy(search, comparator) {
+        const index = this.getIndexOfOrNextLower(search, comparator);
+        if (index === undefined) {
+            return undefined;
+        }
+        return this.elements[index];
+    }
+    getIndexOfOrNextLower(search, comparator) {
+        const { size } = this;
+        if (size === 0) {
+            return undefined;
+        }
+        let index = AppendOnlySortedMap.indexOf(this.elements, search, comparator);
+        if (index < 0) {
+            index ^= AppendOnlySortedMap.failureXor;
+            if (index > 0) {
+                return index - 1;
+            }
+            return undefined;
+        }
+        return index;
+    }
+    getPairOrNextHigherBy(search, comparator) {
+        const index = this.getIndexOfOrNextHigher(search, comparator);
+        if (index === undefined) {
+            return undefined;
+        }
+        return this.elements[index];
+    }
+    getIndexOfOrNextHigher(search, comparator) {
+        const { size } = this;
+        if (size === 0) {
+            return undefined;
+        }
+        let index = AppendOnlySortedMap.indexOf(this.elements, search, comparator);
+        if (index < 0) {
+            index ^= AppendOnlySortedMap.failureXor;
+            if (index < size) {
+                return index;
+            }
+            return undefined;
+        }
+        return index;
+    }
+    /**
+     * Performs a binary search on the sorted array.
+     * @param elements
+     * @param search
+     * @param comparator
+     * @returns the index of `search`, or (if not present) the index it would have been inserted into xor'd with `failureXor`. Note that
+     * negating is not an adequate solution as that could result in -0.
+     */
+    static indexOf(elements, search, comparator) {
+        let low = 0;
+        let high = elements.length;
+        let mid = high >> 1;
+        while (low < high) {
+            const c = comparator(search, elements[mid]);
+            if (c > 0) {
+                low = mid + 1;
+            }
+            else if (c < 0) {
+                high = mid;
+            }
+            else if (c === 0) {
+                return mid;
+            }
+            else {
+                Common_1.fail('Invalid comparator.');
+            }
+            mid = (low + high) >> 1;
+        }
+        return mid ^ AppendOnlySortedMap.failureXor;
+    }
+}
+exports.AppendOnlySortedMap = AppendOnlySortedMap;
+/**
+ * The value xor'd with the result index when a search fails.
+ */
+AppendOnlySortedMap.failureXor = -1;
+/**
+ * A map in which entries are always added in both key-sorted and value-sorted order.
+ * Supports appending and searching.
+ */
+class AppendOnlyDoublySortedMap extends AppendOnlySortedMap {
+    constructor(keyComparator, extractSearchValue, valueComparator) {
+        super(keyComparator);
+        this.extractSearchValue = extractSearchValue;
+        this.valueComparator = valueComparator;
+        this.compareValues = (search, element) => {
+            return this.valueComparator(search, element[1]);
+        };
+    }
+    append(key, value) {
+        if (this.size !== 0 &&
+            this.valueComparator(this.extractSearchValue(value), this.elements[this.size - 1][1]) <= 0) {
+            Common_1.fail('Inserted value must be > all others in the map.');
+        }
+        super.append(key, value);
+    }
+    /**
+     * @param value the value to lookup.
+     * @returns the key associated with `value` if such an entry exists, and undefined otherwise.
+     */
+    getByValue(value) {
+        var _a;
+        const index = AppendOnlySortedMap.indexOf(this.elements, value, this.compareValues);
+        return (_a = this.elements[index]) === null || _a === void 0 ? void 0 : _a[0];
+    }
+    /**
+     * @param searchValue the search value to lookup.
+     * @returns the entry who's value, when run through the extractor provided to the constructor, matches `searchValue`. If no such entry
+     * exists, this method returns the next lower entry as determined by the value comparator provided to the constructor. If no such entry
+     * exists, this method returns undefined.
+     */
+    getPairOrNextLowerByValue(searchValue) {
+        return this.getPairOrNextLowerBy(searchValue, this.compareValues);
+    }
+    /**
+     * @param searchValue the search value to lookup.
+     * @returns the entry who's value, when run through the extractor provided to the constructor, matches `searchValue`. If no such entry
+     * exists, this method returns the next higher entry as determined by the value comparator provided to the constructor. If no such entry
+     * exists, this method returns undefined.
+     */
+    getPairOrNextHigherByValue(searchValue) {
+        return this.getPairOrNextHigherBy(searchValue, this.compareValues);
+    }
+}
+exports.AppendOnlyDoublySortedMap = AppendOnlyDoublySortedMap;
+//# sourceMappingURL=AppendOnlySortedMap.js.map

package/dist/id-compressor/AppendOnlySortedMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AppendOnlySortedMap.js","sourceRoot":"","sources":["../../src/id-compressor/AppendOnlySortedMap.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+BAA+B;AAE/B,sCAAiC;AAEjC;;;GAGG;AACH,MAAa,mBAAmB;IAG/B;;OAEG;IACH,YAAsC,UAAkC;QAAlC,eAAU,GAAV,UAAU,CAAwB;QALrD,aAAQ,GAAa,EAAE,CAAC;QA4E1B,gBAAW,GAAG,CAAC,MAAS,EAAE,OAAwB,EAAU,EAAE;YAC9E,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,CAAC;IAzEyE,CAAC;IAE5E;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED;;OAEG;IACI,MAAM;;QACZ,aAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,0CAAG,CAAC,EAAE;IAC9B,CAAC;IAED;;OAEG;IACI,MAAM;;QACZ,aAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,0CAAG,CAAC,EAAE;IAC1C,CAAC;IAED;;OAEG;IACI,CAAC,OAAO;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,MAAM,KAAK,CAAC;SACZ;IACF,CAAC;IAED;;OAEG;IACI,CAAC,IAAI;QACX,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;SACf;IACF,CAAC;IAED;;OAEG;IACI,CAAC,MAAM;QACb,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;SACf;IACF,CAAC;IAED;;OAEG;IACI,CAAC,eAAe;QACtB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SACvB;IACF,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,GAAM,EAAE,KAAQ;QAC7B,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;YAClF,aAAI,CAAC,+CAA+C,CAAC,CAAC;SACtD;QACD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IAClC,CAAC;IAMD;;;OAGG;IACI,GAAG,CAAC,GAAM;;QAChB,MAAM,KAAK,GAAG,mBAAmB,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAChF,aAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,0CAAG,CAAC,EAAE;IAClC,CAAC;IAED;;;;OAIG;IACI,kBAAkB,CAAC,GAAM;QAC/B,OAAO,IAAI,CAAC,oBAAoB,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACzD,CAAC;IAED;;;;OAIG;IACI,mBAAmB,CAAC,GAAM;QAChC,OAAO,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,KAAgC,EAAE,aAAsC;QACrF,IAAI,KAAK,KAAK,IAAI,EAAE;YACnB,OAAO,IAAI,CAAC;SACZ;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,EAAE;YAC7B,OAAO,KAAK,CAAC;SACb;QAED,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;YACxC,MAAM,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,CAAC,QAAQ,EAAE,UAAU,CAAC,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE;gBAC7C,OAAO,KAAK,CAAC;aACb;YACD,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE;gBAC1C,OAAO,KAAK,CAAC;aACb;SACD;QAED,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;OAKG;IACI,CAAC,QAAQ,CAAC,IAAO,EAAE,EAAK;QAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACtE,IAAI,SAAS,KAAK,SAAS,EAAE;YAC5B,OAAO;SACP;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACjE,IAAI,OAAO,KAAK,SAAS,EAAE;YAC1B,OAAO;SACP;QAED,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;YAC1C,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SACvB;IACF,CAAC;IAES,oBAAoB,CAC7B,MAAS,EACT,UAA2D;QAE3D,MAAM,KAAK,GAAG,IAAI,CAAC,qBAAqB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAC7D,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAEO,qBAAqB,CAC5B,MAAS,EACT,UAA2D;QAE3D,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,IAAI,IAAI,KAAK,CAAC,EAAE;YACf,OAAO,SAAS,CAAC;SACjB;QACD,IAAI,KAAK,GAAG,mBAAmB,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;QAC3E,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,KAAK,IAAI,mBAAmB,CAAC,UAAU,CAAC;YACxC,IAAI,KAAK,GAAG,CAAC,EAAE;gBACd,OAAO,KAAK,GAAG,CAAC,CAAC;aACjB;YACD,OAAO,SAAS,CAAC;SACjB;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAES,qBAAqB,CAC9B,MAAS,EACT,UAA2D;QAE3D,MAAM,KAAK,GAAG,IAAI,CAAC,sBAAsB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAC9D,IAAI,KAAK,KAAK,SAAS,EAAE;YACxB,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IAC7B,CAAC;IAEO,sBAAsB,CAC7B,MAAS,EACT,UAA2D;QAE3D,MAAM,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;QACtB,IAAI,IAAI,KAAK,CAAC,EAAE;YACf,OAAO,SAAS,CAAC;SACjB;QACD,IAAI,KAAK,GAAG,mBAAmB,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;QAC3E,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,KAAK,IAAI,mBAAmB,CAAC,UAAU,CAAC;YACxC,IAAI,KAAK,GAAG,IAAI,EAAE;gBACjB,OAAO,KAAK,CAAC;aACb;YACD,OAAO,SAAS,CAAC;SACjB;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAOD;;;;;;;OAOG;IACI,MAAM,CAAC,OAAO,CACpB,QAAsC,EACtC,MAAS,EACT,UAA2D;QAE3D,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;QAC3B,IAAI,GAAG,GAAG,IAAI,IAAI,CAAC,CAAC;QACpB,OAAO,GAAG,GAAG,IAAI,EAAE;YAClB,MAAM,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,IAAI,CAAC,GAAG,CAAC,EAAE;gBACV,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;aACd;iBAAM,IAAI,CAAC,GAAG,CAAC,EAAE;gBACjB,IAAI,GAAG,GAAG,CAAC;aACX;iBAAM,IAAI,CAAC,KAAK,CAAC,EAAE;gBACnB,OAAO,GAAG,CAAC;aACX;iBAAM;gBACN,aAAI,CAAC,qBAAqB,CAAC,CAAC;aAC5B;YACD,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;SACxB;QACD,OAAO,GAAG,GAAG,mBAAmB,CAAC,UAAU,CAAC;IAC7C,CAAC;;AA7PF,kDA8PC;AApCA;;GAEG;AACoB,8BAAU,GAAG,CAAC,CAAC,CAAC;AAmCxC;;;GAGG;AACH,MAAa,yBAAmC,SAAQ,mBAAyB;IAChF,YACC,aAAqC,EACpB,kBAAmC,EACnC,eAAgD;QAEjE,KAAK,CAAC,aAAa,CAAC,CAAC;QAHJ,uBAAkB,GAAlB,kBAAkB,CAAiB;QACnC,oBAAe,GAAf,eAAe,CAAiC;QAejD,kBAAa,GAAG,CAAC,MAAS,EAAE,OAAwB,EAAU,EAAE;YAChF,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC;IAdF,CAAC;IAEM,MAAM,CAAC,GAAM,EAAE,KAAQ;QAC7B,IACC,IAAI,CAAC,IAAI,KAAK,CAAC;YACf,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EACzF;YACD,aAAI,CAAC,iDAAiD,CAAC,CAAC;SACxD;QACD,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC1B,CAAC;IAMD;;;OAGG;IACI,UAAU,CAAC,KAAQ;;QACzB,MAAM,KAAK,GAAG,mBAAmB,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;QACpF,aAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,0CAAG,CAAC,EAAE;IAClC,CAAC;IAED;;;;;OAKG;IACI,yBAAyB,CAAC,WAAc;QAC9C,OAAO,IAAI,CAAC,oBAAoB,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IACnE,CAAC;IAED;;;;;OAKG;IACI,0BAA0B,CAAC,WAAc;QAC/C,OAAO,IAAI,CAAC,qBAAqB,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;IACpE,CAAC;CACD;AAnDD,8DAmDC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable no-bitwise */\n\nimport { fail } from '../Common';\n\n/**\n * A map in which entries are always added in key-sorted order.\n * Supports appending and searching.\n */\nexport class AppendOnlySortedMap<K, V> {\n\tprotected readonly elements: [K, V][] = [];\n\n\t/**\n\t * @param comparator a comparator for keys\n\t */\n\tpublic constructor(protected readonly comparator: (a: K, b: K) => number) {}\n\n\t/**\n\t * @returns the number of entries in this map\n\t */\n\tpublic get size(): number {\n\t\treturn this.elements.length;\n\t}\n\n\t/**\n\t * @returns the min key in the map.\n\t */\n\tpublic minKey(): K | undefined {\n\t\treturn this.elements[0]?.[0];\n\t}\n\n\t/**\n\t * @returns the max key in the map.\n\t */\n\tpublic maxKey(): K | undefined {\n\t\treturn this.elements[this.size - 1]?.[0];\n\t}\n\n\t/**\n\t * @returns an iterable of the entries in the map.\n\t */\n\tpublic *entries(): IterableIterator<readonly [K, V]> {\n\t\tfor (const entry of this.elements) {\n\t\t\tyield entry;\n\t\t}\n\t}\n\n\t/**\n\t * @returns an iterable of the keys in the map.\n\t */\n\tpublic *keys(): IterableIterator<K> {\n\t\tfor (const entry of this.elements) {\n\t\t\tyield entry[0];\n\t\t}\n\t}\n\n\t/**\n\t * @returns an iterable of the values in the map.\n\t */\n\tpublic *values(): IterableIterator<V> {\n\t\tfor (const entry of this.elements) {\n\t\t\tyield entry[1];\n\t\t}\n\t}\n\n\t/**\n\t * @returns an iterable of the entries in the map, reversed.\n\t */\n\tpublic *entriesReversed(): IterableIterator<readonly [K, V]> {\n\t\tfor (let i = this.size - 1; i >= 0; i--) {\n\t\t\tyield this.elements[i];\n\t\t}\n\t}\n\n\t/**\n\t * Adds a new key/value pair to the map. `key` must be > to all keys in the map.\n\t * @param key the key to add.\n\t * @param value the value to add.\n\t */\n\tpublic append(key: K, value: V): void {\n\t\tif (this.size !== 0 && this.comparator(key, this.elements[this.size - 1][0]) <= 0) {\n\t\t\tfail('Inserted key must be > all others in the map.');\n\t\t}\n\t\tthis.elements.push([key, value]);\n\t}\n\n\tprivate readonly compareKeys = (search: K, element: readonly [K, V]): number => {\n\t\treturn this.comparator(search, element[0]);\n\t};\n\n\t/**\n\t * @param key the key to lookup.\n\t * @returns the value associated with `key` if such an entry exists, and undefined otherwise.\n\t */\n\tpublic get(key: K): V | undefined {\n\t\tconst index = AppendOnlySortedMap.indexOf(this.elements, key, this.compareKeys);\n\t\treturn this.elements[index]?.[1];\n\t}\n\n\t/**\n\t * @param key the key to lookup.\n\t * @returns the entry associated with `key` if such an entry exists, the entry associated with the next lower key if such an entry\n\t * exists, and undefined otherwise.\n\t */\n\tpublic getPairOrNextLower(key: K): readonly [K, V] | undefined {\n\t\treturn this.getPairOrNextLowerBy(key, this.compareKeys);\n\t}\n\n\t/**\n\t * @param key the key to lookup.\n\t * @returns the entry associated with `key` if such an entry exists, the entry associated with the next higher key if such an entry\n\t * exists, and undefined otherwise.\n\t */\n\tpublic getPairOrNextHigher(key: K): readonly [K, V] | undefined {\n\t\treturn this.getPairOrNextHigherBy(key, this.compareKeys);\n\t}\n\n\t/**\n\t * Compares two `AppendOnlySortedMap`s.\n\t */\n\tpublic equals(other: AppendOnlySortedMap<K, V>, compareValues: (a: V, b: V) => boolean): boolean {\n\t\tif (other === this) {\n\t\t\treturn true;\n\t\t}\n\n\t\tif (this.size !== other.size) {\n\t\t\treturn false;\n\t\t}\n\n\t\tfor (let i = this.size - 1; i >= 0; i--) {\n\t\t\tconst [keyThis, valueThis] = this.elements[i];\n\t\t\tconst [keyOther, valueOther] = other.elements[i];\n\t\t\tif (this.comparator(keyThis, keyOther) !== 0) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t\tif (!compareValues(valueThis, valueOther)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\treturn true;\n\t}\n\n\t/**\n\t * Queries a range of entries.\n\t * @param from the key to start the range query at, inclusive.\n\t * @param to the key to end the range query at, inclusive.\n\t * @returns the range of entries.\n\t */\n\tpublic *getRange(from: K, to: K): IterableIterator<readonly [K, V]> {\n\t\tconst indexFrom = this.getIndexOfOrNextHigher(from, this.compareKeys);\n\t\tif (indexFrom === undefined) {\n\t\t\treturn;\n\t\t}\n\n\t\tconst indexTo = this.getIndexOfOrNextLower(to, this.compareKeys);\n\t\tif (indexTo === undefined) {\n\t\t\treturn;\n\t\t}\n\n\t\tfor (let i = indexFrom; i <= indexTo; i++) {\n\t\t\tyield this.elements[i];\n\t\t}\n\t}\n\n\tprotected getPairOrNextLowerBy<T>(\n\t\tsearch: T,\n\t\tcomparator: (search: T, element: readonly [K, V]) => number\n\t): readonly [K, V] | undefined {\n\t\tconst index = this.getIndexOfOrNextLower(search, comparator);\n\t\tif (index === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn this.elements[index];\n\t}\n\n\tprivate getIndexOfOrNextLower<T>(\n\t\tsearch: T,\n\t\tcomparator: (search: T, element: readonly [K, V]) => number\n\t): number | undefined {\n\t\tconst { size } = this;\n\t\tif (size === 0) {\n\t\t\treturn undefined;\n\t\t}\n\t\tlet index = AppendOnlySortedMap.indexOf(this.elements, search, comparator);\n\t\tif (index < 0) {\n\t\t\tindex ^= AppendOnlySortedMap.failureXor;\n\t\t\tif (index > 0) {\n\t\t\t\treturn index - 1;\n\t\t\t}\n\t\t\treturn undefined;\n\t\t}\n\t\treturn index;\n\t}\n\n\tprotected getPairOrNextHigherBy<T>(\n\t\tsearch: T,\n\t\tcomparator: (search: T, element: readonly [K, V]) => number\n\t): readonly [K, V] | undefined {\n\t\tconst index = this.getIndexOfOrNextHigher(search, comparator);\n\t\tif (index === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn this.elements[index];\n\t}\n\n\tprivate getIndexOfOrNextHigher<T>(\n\t\tsearch: T,\n\t\tcomparator: (search: T, element: readonly [K, V]) => number\n\t): number | undefined {\n\t\tconst { size } = this;\n\t\tif (size === 0) {\n\t\t\treturn undefined;\n\t\t}\n\t\tlet index = AppendOnlySortedMap.indexOf(this.elements, search, comparator);\n\t\tif (index < 0) {\n\t\t\tindex ^= AppendOnlySortedMap.failureXor;\n\t\t\tif (index < size) {\n\t\t\t\treturn index;\n\t\t\t}\n\t\t\treturn undefined;\n\t\t}\n\t\treturn index;\n\t}\n\n\t/**\n\t * The value xor'd with the result index when a search fails.\n\t */\n\tpublic static readonly failureXor = -1;\n\n\t/**\n\t * Performs a binary search on the sorted array.\n\t * @param elements\n\t * @param search\n\t * @param comparator\n\t * @returns the index of `search`, or (if not present) the index it would have been inserted into xor'd with `failureXor`. Note that\n\t * negating is not an adequate solution as that could result in -0.\n\t */\n\tpublic static indexOf<T, K, V>(\n\t\telements: readonly (readonly [K, V])[],\n\t\tsearch: T,\n\t\tcomparator: (search: T, element: readonly [K, V]) => number\n\t): number {\n\t\tlet low = 0;\n\t\tlet high = elements.length;\n\t\tlet mid = high >> 1;\n\t\twhile (low < high) {\n\t\t\tconst c = comparator(search, elements[mid]);\n\t\t\tif (c > 0) {\n\t\t\t\tlow = mid + 1;\n\t\t\t} else if (c < 0) {\n\t\t\t\thigh = mid;\n\t\t\t} else if (c === 0) {\n\t\t\t\treturn mid;\n\t\t\t} else {\n\t\t\t\tfail('Invalid comparator.');\n\t\t\t}\n\t\t\tmid = (low + high) >> 1;\n\t\t}\n\t\treturn mid ^ AppendOnlySortedMap.failureXor;\n\t}\n}\n\n/**\n * A map in which entries are always added in both key-sorted and value-sorted order.\n * Supports appending and searching.\n */\nexport class AppendOnlyDoublySortedMap<K, V, S> extends AppendOnlySortedMap<K, V> {\n\tpublic constructor(\n\t\tkeyComparator: (a: K, b: K) => number,\n\t\tprivate readonly extractSearchValue: (value: V) => S,\n\t\tprivate readonly valueComparator: (search: S, value: V) => number\n\t) {\n\t\tsuper(keyComparator);\n\t}\n\n\tpublic append(key: K, value: V): void {\n\t\tif (\n\t\t\tthis.size !== 0 &&\n\t\t\tthis.valueComparator(this.extractSearchValue(value), this.elements[this.size - 1][1]) <= 0\n\t\t) {\n\t\t\tfail('Inserted value must be > all others in the map.');\n\t\t}\n\t\tsuper.append(key, value);\n\t}\n\n\tprivate readonly compareValues = (search: S, element: readonly [K, V]): number => {\n\t\treturn this.valueComparator(search, element[1]);\n\t};\n\n\t/**\n\t * @param value the value to lookup.\n\t * @returns the key associated with `value` if such an entry exists, and undefined otherwise.\n\t */\n\tpublic getByValue(value: S): K | undefined {\n\t\tconst index = AppendOnlySortedMap.indexOf(this.elements, value, this.compareValues);\n\t\treturn this.elements[index]?.[0];\n\t}\n\n\t/**\n\t * @param searchValue the search value to lookup.\n\t * @returns the entry who's value, when run through the extractor provided to the constructor, matches `searchValue`. If no such entry\n\t * exists, this method returns the next lower entry as determined by the value comparator provided to the constructor. If no such entry\n\t * exists, this method returns undefined.\n\t */\n\tpublic getPairOrNextLowerByValue(searchValue: S): readonly [K, V] | undefined {\n\t\treturn this.getPairOrNextLowerBy(searchValue, this.compareValues);\n\t}\n\n\t/**\n\t * @param searchValue the search value to lookup.\n\t * @returns the entry who's value, when run through the extractor provided to the constructor, matches `searchValue`. If no such entry\n\t * exists, this method returns the next higher entry as determined by the value comparator provided to the constructor. If no such entry\n\t * exists, this method returns undefined.\n\t */\n\tpublic getPairOrNextHigherByValue(searchValue: S): readonly [K, V] | undefined {\n\t\treturn this.getPairOrNextHigherBy(searchValue, this.compareValues);\n\t}\n}\n"]}