@fluid-experimental/tree 2.0.0-rc.2.0.1 → 2.0.0-rc.3.0.0

package/lib/test/AppendOnlySortedMap.perf.tests.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=AppendOnlySortedMap.perf.tests.d.ts.map

package/lib/test/AppendOnlySortedMap.perf.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"AppendOnlySortedMap.perf.tests.d.ts","sourceRoot":"","sources":["../../src/test/AppendOnlySortedMap.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/AppendOnlySortedMap.perf.tests.js

@@ -1,49 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
-import { makeRandom } from '@fluid-private/stochastic-test-utils';
-import { compareFiniteNumbers } from '../Common.js';
-import { AppendOnlySortedMap } from '../id-compressor/AppendOnlySortedMap.js';
-function runAppendOnlyMapPerfTests(mapBuilder) {
-    const type = BenchmarkType.Measurement;
-    let map;
-    let rand;
-    const keyChoices = [];
-    let localChoice = 0;
-    const before = () => {
-        rand = makeRandom(42);
-        map = mapBuilder();
-        let curKey = 0;
-        for (let i = 0; i < 100000; i++) {
-            map.append(curKey, rand.integer(0, Number.MAX_SAFE_INTEGER));
-            curKey += rand.integer(1, 10);
-        }
-        const keys = [...map.keys()];
-        for (let i = 0; i < map.size; i++) {
-            keyChoices.push(keys[rand.integer(0, map.size - 1)]);
-        }
-        localChoice = 0;
-    };
-    benchmark({
-        type,
-        title: `lookup a key`,
-        before,
-        benchmarkFn: () => {
-            map.get(keyChoices[localChoice++ % keyChoices.length]);
-        },
-    });
-    benchmark({
-        type,
-        title: `lookup a pair or lower`,
-        before,
-        benchmarkFn: () => {
-            map.getPairOrNextLower(keyChoices[localChoice++ % keyChoices.length]);
-        },
-    });
-}
-describe('AppendOnlySortedMap Perf', () => {
-    runAppendOnlyMapPerfTests(() => new AppendOnlySortedMap(compareFiniteNumbers));
-});
-//# sourceMappingURL=AppendOnlySortedMap.perf.tests.js.map

package/lib/test/AppendOnlySortedMap.perf.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"AppendOnlySortedMap.perf.tests.js","sourceRoot":"","sources":["../../src/test/AppendOnlySortedMap.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAW,UAAU,EAAE,MAAM,sCAAsC,CAAC;AAC3E,OAAO,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AAE9E,SAAS,yBAAyB,CAAC,UAAqD;IACvF,MAAM,IAAI,GAAG,aAAa,CAAC,WAAW,CAAC;IACvC,IAAI,GAAwC,CAAC;IAC7C,IAAI,IAAa,CAAC;IAClB,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,MAAM,MAAM,GAAG,GAAG,EAAE;QACnB,IAAI,GAAG,UAAU,CAAC,EAAE,CAAC,CAAC;QACtB,GAAG,GAAG,UAAU,EAAE,CAAC;QACnB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE;YAChC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC;YAC7D,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;SAC9B;QACD,MAAM,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YAClC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SACrD;QACD,WAAW,GAAG,CAAC,CAAC;IACjB,CAAC,CAAC;IAEF,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,cAAc;QACrB,MAAM;QACN,WAAW,EAAE,GAAG,EAAE;YACjB,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACxD,CAAC;KACD,CAAC,CAAC;IAEH,SAAS,CAAC;QACT,IAAI;QACJ,KAAK,EAAE,wBAAwB;QAC/B,MAAM;QACN,WAAW,EAAE,GAAG,EAAE;YACjB,GAAG,CAAC,kBAAkB,CAAC,UAAU,CAAC,WAAW,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACvE,CAAC;KACD,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACzC,yBAAyB,CAAC,GAAG,EAAE,CAAC,IAAI,mBAAmB,CAAC,oBAAoB,CAAC,CAAC,CAAC;AAChF,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { IRandom, makeRandom } from '@fluid-private/stochastic-test-utils';\nimport { compareFiniteNumbers } from '../Common.js';\nimport { AppendOnlySortedMap } from '../id-compressor/AppendOnlySortedMap.js';\n\nfunction runAppendOnlyMapPerfTests(mapBuilder: () => AppendOnlySortedMap<number, number>) {\n\tconst type = BenchmarkType.Measurement;\n\tlet map: AppendOnlySortedMap<number, number>;\n\tlet rand: IRandom;\n\tconst keyChoices: number[] = [];\n\tlet localChoice = 0;\n\tconst before = () => {\n\t\trand = makeRandom(42);\n\t\tmap = mapBuilder();\n\t\tlet curKey = 0;\n\t\tfor (let i = 0; i < 100000; i++) {\n\t\t\tmap.append(curKey, rand.integer(0, Number.MAX_SAFE_INTEGER));\n\t\t\tcurKey += rand.integer(1, 10);\n\t\t}\n\t\tconst keys = [...map.keys()];\n\t\tfor (let i = 0; i < map.size; i++) {\n\t\t\tkeyChoices.push(keys[rand.integer(0, map.size - 1)]);\n\t\t}\n\t\tlocalChoice = 0;\n\t};\n\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `lookup a key`,\n\t\tbefore,\n\t\tbenchmarkFn: () => {\n\t\t\tmap.get(keyChoices[localChoice++ % keyChoices.length]);\n\t\t},\n\t});\n\n\tbenchmark({\n\t\ttype,\n\t\ttitle: `lookup a pair or lower`,\n\t\tbefore,\n\t\tbenchmarkFn: () => {\n\t\t\tmap.getPairOrNextLower(keyChoices[localChoice++ % keyChoices.length]);\n\t\t},\n\t});\n}\n\ndescribe('AppendOnlySortedMap Perf', () => {\n\trunAppendOnlyMapPerfTests(() => new AppendOnlySortedMap(compareFiniteNumbers));\n});\n"]}

package/lib/test/AppendOnlySortedMap.tests.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=AppendOnlySortedMap.tests.d.ts.map

package/lib/test/AppendOnlySortedMap.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"AppendOnlySortedMap.tests.d.ts","sourceRoot":"","sources":["../../src/test/AppendOnlySortedMap.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/AppendOnlySortedMap.tests.js

@@ -1,213 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/* eslint-disable no-bitwise */
-import { strict as assert } from 'assert';
-import { expect } from 'chai';
-import { validateAssertionError } from '@fluidframework/test-runtime-utils';
-import { assertNotUndefined, compareFiniteNumbers } from '../Common.js';
-import { AppendOnlyDoublySortedMap, AppendOnlySortedMap } from '../id-compressor/AppendOnlySortedMap.js';
-function runAppendOnlyMapTests(mapBuilder) {
-    it('detects out-of-order keys', () => {
-        const map = mapBuilder();
-        map.append(0, 0);
-        const exception = 'Inserted key must be > all others in the map.';
-        assert.throws(() => map.append(-1, 1), (e) => validateAssertionError(e, exception));
-        map.append(1, 2);
-    });
-    it('can get the min and max keys', () => {
-        const map = mapBuilder();
-        const elementCount = 10;
-        expect(map.maxKey()).to.be.undefined;
-        for (let i = 0; i < elementCount; i++) {
-            map.append(i, i);
-            expect(map.maxKey()).to.equal(i);
-            expect(map.minKey()).to.equal(0);
-        }
-    });
-    it('can get the first and last pairs', () => {
-        const map = mapBuilder();
-        const elementCount = 10;
-        expect(map.first()).to.be.undefined;
-        expect(map.last()).to.be.undefined;
-        for (let i = 0; i < elementCount; i++) {
-            map.append(i, i);
-            expect(map.last()).to.deep.equal([i, i]);
-            expect(map.first()).to.deep.equal([0, 0]);
-        }
-    });
-    it('can get values', () => {
-        const map = mapBuilder();
-        const elementCount = 10;
-        for (let i = 0; i < elementCount; i++) {
-            map.append(i, i);
-        }
-        expect(map.get(-1)).to.be.undefined;
-        expect(map.get(10)).to.be.undefined;
-        for (let i = 0; i < elementCount; i++) {
-            expect(map.get(i)).to.equal(i);
-        }
-    });
-    it('can get pairs by index', () => {
-        const map = mapBuilder();
-        const elementCount = 10;
-        for (let i = 0; i < elementCount; i++) {
-            map.append(i * 10, i);
-        }
-        expect(map.getAtIndex(-1)).to.be.undefined;
-        expect(map.getAtIndex(10)).to.be.undefined;
-        for (let i = 0; i < elementCount; i++) {
-            expect(map.getAtIndex(i)).to.deep.equal([i * 10, i]);
-        }
-    });
-    it('can get an entry or next lower by key', () => {
-        [99, 100].forEach((elementCount) => {
-            const map = mapBuilder();
-            for (let i = 0; i < elementCount; i++) {
-                map.append(i * 2, i * 2);
-            }
-            expect(map.getPairOrNextLower(-1)).to.be.undefined;
-            for (let i = 0; i < map.size; i++) {
-                expect(map.getPairOrNextLower(i * 2)).to.deep.equal([i * 2, i * 2]);
-                expect(map.getPairOrNextLower(i * 2 + 1)).to.deep.equal([i * 2, i * 2]);
-            }
-            const maxKey = assertNotUndefined(map.maxKey());
-            expect(map.getPairOrNextLower(maxKey + 1)).to.deep.equal([maxKey, maxKey]);
-        });
-    });
-    it('can get an entry or next higher by key', () => {
-        [99, 100].forEach((elementCount) => {
-            const map = mapBuilder();
-            for (let i = 0; i < elementCount; i++) {
-                map.append(i * 2, i * 2);
-            }
-            const minKey = assertNotUndefined(map.minKey());
-            expect(map.getPairOrNextHigher(minKey - 1)).to.deep.equal([minKey, minKey]);
-            for (let i = 0; i < map.size - 1; i++) {
-                expect(map.getPairOrNextHigher(i * 2)).to.deep.equal([i * 2, i * 2]);
-                expect(map.getPairOrNextHigher(i * 2 + 1)).to.deep.equal([i * 2 + 2, i * 2 + 2]);
-            }
-            expect(map.getPairOrNextHigher(map.size * 2 + 1)).to.be.undefined;
-        });
-    });
-    it('knows how big it is', () => {
-        const map = mapBuilder();
-        const elementCount = 10;
-        for (let i = 0; i < elementCount; i++) {
-            expect(map.size).to.equal(i);
-            map.append(i, i);
-        }
-        expect(map.size).to.equal(elementCount);
-    });
-    it('can enumerate its keys and values', () => {
-        const map = mapBuilder();
-        const elementCount = 10;
-        const keys = [];
-        const values = [];
-        for (let i = 0; i < elementCount; i++) {
-            const key = i;
-            const value = i * 2;
-            map.append(key, value);
-            keys.push(key);
-            values.push(value);
-        }
-        expect([...map.keys()]).to.deep.equal(keys);
-        expect([...map.values()]).to.deep.equal(values);
-    });
-    it('can calculate the indexOf a search element', () => {
-        const elements = [0, 0, 2, 0, 3, 0];
-        const comparator = (search, key, value) => {
-            return compareFiniteNumbers(search, key);
-        };
-        expect(AppendOnlySortedMap.keyIndexOf(elements, 0, comparator)).to.equal(0);
-        expect(AppendOnlySortedMap.keyIndexOf(elements, 2, comparator)).to.equal(2);
-        expect(AppendOnlySortedMap.keyIndexOf(elements, 3, comparator)).to.equal(4);
-        expect(AppendOnlySortedMap.keyIndexOf(elements, -1, comparator)).to.equal(0 ^ AppendOnlySortedMap.failureXor);
-        expect(AppendOnlySortedMap.keyIndexOf(elements, 1, comparator)).to.equal(2 ^ AppendOnlySortedMap.failureXor);
-        expect(AppendOnlySortedMap.keyIndexOf(elements, 10, comparator)).to.equal(6 ^ AppendOnlySortedMap.failureXor);
-    });
-    describe('can perform range queries', () => {
-        const map = mapBuilder();
-        const elementCount = 10;
-        for (let i = 0; i < elementCount; i++) {
-            map.append(i * 2, i * 2);
-        }
-        const maxKey = assertNotUndefined(map.maxKey());
-        it('on empty ranges', () => {
-            expect([...map.getRange(1, -1)]).to.deep.equal([]);
-            expect([...map.getRange(maxKey + 1, maxKey + 1)]).to.deep.equal([]);
-        });
-        it('on ranges of size 1', () => {
-            expect([...map.getRange(0, 0)]).to.deep.equal([[0, 0]]);
-            expect([...map.getRange(1, 1)]).to.deep.equal([]);
-            expect([...map.getRange(-1, -1)]).to.deep.equal([]);
-        });
-        it('on non-empty ranges', () => {
-            expect([...map.getRange(0, 1)]).to.deep.equal([[0, 0]]);
-            expect([...map.getRange(0, 2)]).to.deep.equal([
-                [0, 0],
-                [2, 2],
-            ]);
-            expect([...map.getRange(1, 5)]).to.deep.equal([
-                [2, 2],
-                [4, 4],
-            ]);
-            const allEntries = [...map.entries()];
-            expect([...map.getRange(0, maxKey)]).to.deep.equal(allEntries);
-            expect([...map.getRange(-maxKey, maxKey)]).to.deep.equal(allEntries);
-            expect([...map.getRange(0, 2 * maxKey)]).to.deep.equal(allEntries);
-            expect([...map.getRange(-maxKey, 2 * maxKey)]).to.deep.equal(allEntries);
-        });
-    });
-}
-describe('AppendOnlySortedMap', () => {
-    runAppendOnlyMapTests(() => new AppendOnlySortedMap(compareFiniteNumbers));
-});
-describe('AppendOnlyDoublySortedMap', () => {
-    const mapBuilder = () => new AppendOnlyDoublySortedMap(compareFiniteNumbers, (value) => value, compareFiniteNumbers);
-    runAppendOnlyMapTests(mapBuilder);
-    it('detects out-of-order values', () => {
-        const map = mapBuilder();
-        map.append(0, 0);
-        const exception = 'Inserted value must be > all others in the map.';
-        assert.throws(() => map.append(1, -1), (e) => validateAssertionError(e, exception));
-        map.append(2, 1);
-    });
-    it('can get an entry or next lower by value', () => {
-        [99, 100].forEach((elementCount) => {
-            const map = mapBuilder();
-            for (let i = 0; i < elementCount; i++) {
-                map.append(i - elementCount, i * 2);
-            }
-            expect(map.getPairOrNextLowerByValue(-1)).to.be.undefined;
-            for (let i = 1; i < elementCount; i++) {
-                expect(map.getPairOrNextLowerByValue(i * 2)).to.deep.equal([i - elementCount, i * 2]);
-                expect(map.getPairOrNextLowerByValue(i * 2 + 1)).to.deep.equal([i - elementCount, i * 2]);
-            }
-        });
-    });
-    it('can get an entry or next higher by value', () => {
-        [99, 100].forEach((elementCount) => {
-            const map = mapBuilder();
-            for (let i = 0; i < elementCount; i++) {
-                map.append(i - elementCount, i * 2);
-            }
-            for (let i = 0; i < elementCount - 1; i++) {
-                expect(map.getPairOrNextHigherByValue(i * 2)).to.deep.equal([i - elementCount, i * 2]);
-                expect(map.getPairOrNextHigherByValue(i * 2 + 1)).to.deep.equal([i - elementCount + 1, i * 2 + 2]);
-            }
-            const maxValue = (elementCount - 1) * 2;
-            expect(map.getPairOrNextHigherByValue(maxValue)).to.deep.equal([-1, maxValue]);
-            expect(map.getPairOrNextHigherByValue(maxValue + 1)).to.be.undefined;
-        });
-    });
-    it('validity assertion detects out-of-order keys', () => {
-        const map = new AppendOnlyDoublySortedMap((a, b) => compareFiniteNumbers(a[0], b[0]), (value) => value[0], compareFiniteNumbers);
-        map.append([0], [0]);
-        map.append([1], [1]);
-        assertNotUndefined(map.get([1]))[0] = -1; // mutate value
-        assert.throws(() => map.assertValid(), (e) => validateAssertionError(e, 'Values in map must be sorted.'));
-    });
-});
-//# sourceMappingURL=AppendOnlySortedMap.tests.js.map

package/lib/test/AppendOnlySortedMap.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"AppendOnlySortedMap.tests.js","sourceRoot":"","sources":["../../src/test/AppendOnlySortedMap.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+BAA+B;AAE/B,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,cAAc,CAAC;AACxE,OAAO,EAAE,yBAAyB,EAAE,mBAAmB,EAAE,MAAM,yCAAyC,CAAC;AAEzG,SAAS,qBAAqB,CAAC,UAAqD;IACnF,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACpC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,MAAM,SAAS,GAAG,+CAA+C,CAAC;QAClE,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EACvB,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,SAAS,CAAC,CAClD,CAAC;QACF,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACvC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SACjC;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC3C,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SAC1C;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACjB;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;SAC/B;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACjC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;SACtB;QACD,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QAC3C,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;SACrD;IACF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAChD,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE;YAClC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACtC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;aACzB;YACD,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YACnD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;gBAClC,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACpE,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACxE;YACD,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE;YAClC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACtC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;aACzB;YACD,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;YAChD,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;YAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACrE,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACjF;YACD,MAAM,CAAC,GAAG,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACnE,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7B,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SACjB;QACD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC5C,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,GAAG,GAAG,CAAC,CAAC;YACd,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;YACpB,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACnB;QACD,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACrD,MAAM,QAAQ,GAAa,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,UAAU,GAAG,CAAC,MAAc,EAAE,GAAW,EAAE,KAAa,EAAU,EAAE;YACzE,OAAO,oBAAoB,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC1C,CAAC,CAAC;QACF,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAC9G,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAC7G,MAAM,CAAC,mBAAmB,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAC/G,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QAC1C,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,MAAM,YAAY,GAAG,EAAE,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;YACtC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SACzB;QACD,MAAM,MAAM,GAAG,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAEhD,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAClD,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9B,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACxD,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC7C,CAAC,CAAC,EAAE,CAAC,CAAC;gBACN,CAAC,CAAC,EAAE,CAAC,CAAC;aACN,CAAC,CAAC;YACH,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC7C,CAAC,CAAC,EAAE,CAAC,CAAC;gBACN,CAAC,CAAC,EAAE,CAAC,CAAC;aACN,CAAC,CAAC;YACH,MAAM,UAAU,GAAG,CAAC,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC,CAAC;YACtC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC/D,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACrE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACnE,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACpC,qBAAqB,CAAC,GAAG,EAAE,CAAC,IAAI,mBAAmB,CAAC,oBAAoB,CAAC,CAAC,CAAC;AAC5E,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IAC1C,MAAM,UAAU,GAAG,GAAG,EAAE,CACvB,IAAI,yBAAyB,CAC5B,oBAAoB,EACpB,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,EAChB,oBAAoB,CACpB,CAAC;IACH,qBAAqB,CAAC,UAAU,CAAC,CAAC;IAElC,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;QACzB,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,MAAM,SAAS,GAAG,iDAAiD,CAAC;QACpE,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EACvB,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,SAAS,CAAC,CAClD,CAAC;QACF,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE;YAClC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACtC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;aACpC;YACD,MAAM,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;YAC1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACtF,MAAM,CAAC,GAAG,CAAC,yBAAyB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aAC1F;QACF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,YAAY,EAAE,EAAE;YAClC,MAAM,GAAG,GAAG,UAAU,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,EAAE,CAAC,EAAE,EAAE;gBACtC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;aACpC;YACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1C,MAAM,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvF,MAAM,CAAC,GAAG,CAAC,0BAA0B,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,YAAY,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;aACnG;YACD,MAAM,QAAQ,GAAG,CAAC,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;YAC/E,MAAM,CAAC,GAAG,CAAC,0BAA0B,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACtE,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACvD,MAAM,GAAG,GAAG,IAAI,yBAAyB,CACxC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAC1C,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EACnB,oBAAoB,CACpB,CAAC;QACF,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,kBAAkB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,eAAe;QACzD,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,GAAG,CAAC,WAAW,EAAE,EACvB,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,+BAA+B,CAAC,CACxE,CAAC;IACH,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","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 { strict as assert } from 'assert';\nimport { expect } from 'chai';\nimport { validateAssertionError } from '@fluidframework/test-runtime-utils';\nimport { assertNotUndefined, compareFiniteNumbers } from '../Common.js';\nimport { AppendOnlyDoublySortedMap, AppendOnlySortedMap } from '../id-compressor/AppendOnlySortedMap.js';\n\nfunction runAppendOnlyMapTests(mapBuilder: () => AppendOnlySortedMap<number, number>) {\n\tit('detects out-of-order keys', () => {\n\t\tconst map = mapBuilder();\n\t\tmap.append(0, 0);\n\t\tconst exception = 'Inserted key must be > all others in the map.';\n\t\tassert.throws(\n\t\t\t() => map.append(-1, 1),\n\t\t\t(e: Error) => validateAssertionError(e, exception)\n\t\t);\n\t\tmap.append(1, 2);\n\t});\n\n\tit('can get the min and max keys', () => {\n\t\tconst map = mapBuilder();\n\t\tconst elementCount = 10;\n\t\texpect(map.maxKey()).to.be.undefined;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\tmap.append(i, i);\n\t\t\texpect(map.maxKey()).to.equal(i);\n\t\t\texpect(map.minKey()).to.equal(0);\n\t\t}\n\t});\n\n\tit('can get the first and last pairs', () => {\n\t\tconst map = mapBuilder();\n\t\tconst elementCount = 10;\n\t\texpect(map.first()).to.be.undefined;\n\t\texpect(map.last()).to.be.undefined;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\tmap.append(i, i);\n\t\t\texpect(map.last()).to.deep.equal([i, i]);\n\t\t\texpect(map.first()).to.deep.equal([0, 0]);\n\t\t}\n\t});\n\n\tit('can get values', () => {\n\t\tconst map = mapBuilder();\n\t\tconst elementCount = 10;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\tmap.append(i, i);\n\t\t}\n\t\texpect(map.get(-1)).to.be.undefined;\n\t\texpect(map.get(10)).to.be.undefined;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\texpect(map.get(i)).to.equal(i);\n\t\t}\n\t});\n\n\tit('can get pairs by index', () => {\n\t\tconst map = mapBuilder();\n\t\tconst elementCount = 10;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\tmap.append(i * 10, i);\n\t\t}\n\t\texpect(map.getAtIndex(-1)).to.be.undefined;\n\t\texpect(map.getAtIndex(10)).to.be.undefined;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\texpect(map.getAtIndex(i)).to.deep.equal([i * 10, i]);\n\t\t}\n\t});\n\n\tit('can get an entry or next lower by key', () => {\n\t\t[99, 100].forEach((elementCount) => {\n\t\t\tconst map = mapBuilder();\n\t\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\t\tmap.append(i * 2, i * 2);\n\t\t\t}\n\t\t\texpect(map.getPairOrNextLower(-1)).to.be.undefined;\n\t\t\tfor (let i = 0; i < map.size; i++) {\n\t\t\t\texpect(map.getPairOrNextLower(i * 2)).to.deep.equal([i * 2, i * 2]);\n\t\t\t\texpect(map.getPairOrNextLower(i * 2 + 1)).to.deep.equal([i * 2, i * 2]);\n\t\t\t}\n\t\t\tconst maxKey = assertNotUndefined(map.maxKey());\n\t\t\texpect(map.getPairOrNextLower(maxKey + 1)).to.deep.equal([maxKey, maxKey]);\n\t\t});\n\t});\n\n\tit('can get an entry or next higher by key', () => {\n\t\t[99, 100].forEach((elementCount) => {\n\t\t\tconst map = mapBuilder();\n\t\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\t\tmap.append(i * 2, i * 2);\n\t\t\t}\n\t\t\tconst minKey = assertNotUndefined(map.minKey());\n\t\t\texpect(map.getPairOrNextHigher(minKey - 1)).to.deep.equal([minKey, minKey]);\n\t\t\tfor (let i = 0; i < map.size - 1; i++) {\n\t\t\t\texpect(map.getPairOrNextHigher(i * 2)).to.deep.equal([i * 2, i * 2]);\n\t\t\t\texpect(map.getPairOrNextHigher(i * 2 + 1)).to.deep.equal([i * 2 + 2, i * 2 + 2]);\n\t\t\t}\n\t\t\texpect(map.getPairOrNextHigher(map.size * 2 + 1)).to.be.undefined;\n\t\t});\n\t});\n\n\tit('knows how big it is', () => {\n\t\tconst map = mapBuilder();\n\t\tconst elementCount = 10;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\texpect(map.size).to.equal(i);\n\t\t\tmap.append(i, i);\n\t\t}\n\t\texpect(map.size).to.equal(elementCount);\n\t});\n\n\tit('can enumerate its keys and values', () => {\n\t\tconst map = mapBuilder();\n\t\tconst elementCount = 10;\n\t\tconst keys: number[] = [];\n\t\tconst values: number[] = [];\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\tconst key = i;\n\t\t\tconst value = i * 2;\n\t\t\tmap.append(key, value);\n\t\t\tkeys.push(key);\n\t\t\tvalues.push(value);\n\t\t}\n\t\texpect([...map.keys()]).to.deep.equal(keys);\n\t\texpect([...map.values()]).to.deep.equal(values);\n\t});\n\n\tit('can calculate the indexOf a search element', () => {\n\t\tconst elements: number[] = [0, 0, 2, 0, 3, 0];\n\t\tconst comparator = (search: number, key: number, value: number): number => {\n\t\t\treturn compareFiniteNumbers(search, key);\n\t\t};\n\t\texpect(AppendOnlySortedMap.keyIndexOf(elements, 0, comparator)).to.equal(0);\n\t\texpect(AppendOnlySortedMap.keyIndexOf(elements, 2, comparator)).to.equal(2);\n\t\texpect(AppendOnlySortedMap.keyIndexOf(elements, 3, comparator)).to.equal(4);\n\t\texpect(AppendOnlySortedMap.keyIndexOf(elements, -1, comparator)).to.equal(0 ^ AppendOnlySortedMap.failureXor);\n\t\texpect(AppendOnlySortedMap.keyIndexOf(elements, 1, comparator)).to.equal(2 ^ AppendOnlySortedMap.failureXor);\n\t\texpect(AppendOnlySortedMap.keyIndexOf(elements, 10, comparator)).to.equal(6 ^ AppendOnlySortedMap.failureXor);\n\t});\n\n\tdescribe('can perform range queries', () => {\n\t\tconst map = mapBuilder();\n\t\tconst elementCount = 10;\n\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\tmap.append(i * 2, i * 2);\n\t\t}\n\t\tconst maxKey = assertNotUndefined(map.maxKey());\n\n\t\tit('on empty ranges', () => {\n\t\t\texpect([...map.getRange(1, -1)]).to.deep.equal([]);\n\t\t\texpect([...map.getRange(maxKey + 1, maxKey + 1)]).to.deep.equal([]);\n\t\t});\n\n\t\tit('on ranges of size 1', () => {\n\t\t\texpect([...map.getRange(0, 0)]).to.deep.equal([[0, 0]]);\n\t\t\texpect([...map.getRange(1, 1)]).to.deep.equal([]);\n\t\t\texpect([...map.getRange(-1, -1)]).to.deep.equal([]);\n\t\t});\n\n\t\tit('on non-empty ranges', () => {\n\t\t\texpect([...map.getRange(0, 1)]).to.deep.equal([[0, 0]]);\n\t\t\texpect([...map.getRange(0, 2)]).to.deep.equal([\n\t\t\t\t[0, 0],\n\t\t\t\t[2, 2],\n\t\t\t]);\n\t\t\texpect([...map.getRange(1, 5)]).to.deep.equal([\n\t\t\t\t[2, 2],\n\t\t\t\t[4, 4],\n\t\t\t]);\n\t\t\tconst allEntries = [...map.entries()];\n\t\t\texpect([...map.getRange(0, maxKey)]).to.deep.equal(allEntries);\n\t\t\texpect([...map.getRange(-maxKey, maxKey)]).to.deep.equal(allEntries);\n\t\t\texpect([...map.getRange(0, 2 * maxKey)]).to.deep.equal(allEntries);\n\t\t\texpect([...map.getRange(-maxKey, 2 * maxKey)]).to.deep.equal(allEntries);\n\t\t});\n\t});\n}\n\ndescribe('AppendOnlySortedMap', () => {\n\trunAppendOnlyMapTests(() => new AppendOnlySortedMap(compareFiniteNumbers));\n});\n\ndescribe('AppendOnlyDoublySortedMap', () => {\n\tconst mapBuilder = () =>\n\t\tnew AppendOnlyDoublySortedMap<number, number, number>(\n\t\t\tcompareFiniteNumbers,\n\t\t\t(value) => value,\n\t\t\tcompareFiniteNumbers\n\t\t);\n\trunAppendOnlyMapTests(mapBuilder);\n\n\tit('detects out-of-order values', () => {\n\t\tconst map = mapBuilder();\n\t\tmap.append(0, 0);\n\t\tconst exception = 'Inserted value must be > all others in the map.';\n\t\tassert.throws(\n\t\t\t() => map.append(1, -1),\n\t\t\t(e: Error) => validateAssertionError(e, exception)\n\t\t);\n\t\tmap.append(2, 1);\n\t});\n\n\tit('can get an entry or next lower by value', () => {\n\t\t[99, 100].forEach((elementCount) => {\n\t\t\tconst map = mapBuilder();\n\t\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\t\tmap.append(i - elementCount, i * 2);\n\t\t\t}\n\t\t\texpect(map.getPairOrNextLowerByValue(-1)).to.be.undefined;\n\t\t\tfor (let i = 1; i < elementCount; i++) {\n\t\t\t\texpect(map.getPairOrNextLowerByValue(i * 2)).to.deep.equal([i - elementCount, i * 2]);\n\t\t\t\texpect(map.getPairOrNextLowerByValue(i * 2 + 1)).to.deep.equal([i - elementCount, i * 2]);\n\t\t\t}\n\t\t});\n\t});\n\n\tit('can get an entry or next higher by value', () => {\n\t\t[99, 100].forEach((elementCount) => {\n\t\t\tconst map = mapBuilder();\n\t\t\tfor (let i = 0; i < elementCount; i++) {\n\t\t\t\tmap.append(i - elementCount, i * 2);\n\t\t\t}\n\t\t\tfor (let i = 0; i < elementCount - 1; i++) {\n\t\t\t\texpect(map.getPairOrNextHigherByValue(i * 2)).to.deep.equal([i - elementCount, i * 2]);\n\t\t\t\texpect(map.getPairOrNextHigherByValue(i * 2 + 1)).to.deep.equal([i - elementCount + 1, i * 2 + 2]);\n\t\t\t}\n\t\t\tconst maxValue = (elementCount - 1) * 2;\n\t\t\texpect(map.getPairOrNextHigherByValue(maxValue)).to.deep.equal([-1, maxValue]);\n\t\t\texpect(map.getPairOrNextHigherByValue(maxValue + 1)).to.be.undefined;\n\t\t});\n\t});\n\n\tit('validity assertion detects out-of-order keys', () => {\n\t\tconst map = new AppendOnlyDoublySortedMap<[number], [number], number>(\n\t\t\t(a, b) => compareFiniteNumbers(a[0], b[0]),\n\t\t\t(value) => value[0],\n\t\t\tcompareFiniteNumbers\n\t\t);\n\t\tmap.append([0], [0]);\n\t\tmap.append([1], [1]);\n\t\tassertNotUndefined(map.get([1]))[0] = -1; // mutate value\n\t\tassert.throws(\n\t\t\t() => map.assertValid(),\n\t\t\t(e: Error) => validateAssertionError(e, 'Values in map must be sorted.')\n\t\t);\n\t});\n});\n"]}

package/lib/test/ChangeCompression.tests.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=ChangeCompression.tests.d.ts.map

package/lib/test/ChangeCompression.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ChangeCompression.tests.d.ts","sourceRoot":"","sources":["../../src/test/ChangeCompression.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/ChangeCompression.tests.js

@@ -1,154 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { MutableStringInterner } from '../StringInterner.js';
-import { ChangeInternal, ChangeTypeInternal, ConstraintEffect, } from '../persisted-types/index.js';
-import { ChangeCompressor, compressEdit, decompressEdit } from '../ChangeCompression.js';
-import { StablePlace, StableRange } from '../ChangeTypes.js';
-import { newEdit, newEditId } from '../EditUtilities.js';
-import { InterningTreeCompressor } from '../TreeCompressor.js';
-import { scopeIdNormalizer } from '../NodeIdUtilities.js';
-import { convertStableRangeIds } from '../IdConversion.js';
-import { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities.js';
-class TestTreeCompressor {
-    constructor(treeCompressor = new InterningTreeCompressor()) {
-        this.treeCompressor = treeCompressor;
-        this.compressTreeCalls = [];
-        this.decompressTreeCalls = [];
-    }
-    compress(node, interner, idNormalizer) {
-        this.compressTreeCalls.push(node);
-        return this.treeCompressor.compress(node, interner, idNormalizer);
-    }
-    decompress(node, interner, idNormalizer) {
-        this.decompressTreeCalls.push(node);
-        return this.treeCompressor.decompress(node, interner, idNormalizer);
-    }
-}
-describe('ChangeCompression', () => {
-    const treeCompressor = new TestTreeCompressor();
-    beforeEach(() => {
-        treeCompressor.compressTreeCalls.length = 0;
-        treeCompressor.decompressTreeCalls.length = 0;
-    });
-    const compressor = new ChangeCompressor(treeCompressor);
-    /**
-     * Verifies an edit can round-trip through compression/decompression. Optionally also asserts the compressed state
-     * matches some expected state.
-     *
-     * The mocked treeCompressor above is used for tree-level compression, so that tests can assert tree compression is invoked
-     * without taking a dependency on its implementation.
-     */
-    function testCompression(edit, idNormalizer, compressed) {
-        const interner = new MutableStringInterner();
-        const compressedEdit = compressEdit(compressor, interner, idNormalizer, edit);
-        if (compressed !== undefined) {
-            expect(compressedEdit).to.deep.equal(compressed);
-        }
-        const buildChanges = edit.changes.filter((change) => change.type === ChangeTypeInternal.Build);
-        let treeIndex = 0;
-        for (const buildChange of buildChanges) {
-            for (const tree of buildChange.source) {
-                const treeParam = treeCompressor.compressTreeCalls[treeIndex];
-                expect(treeParam).to.equal(tree);
-                treeIndex++;
-            }
-        }
-        expect(treeIndex).to.equal(treeCompressor.compressTreeCalls.length);
-        expect(treeCompressor.decompressTreeCalls.length).to.equal(0);
-        const internedStrings = interner.getSerializable();
-        const newInterner = new MutableStringInterner(internedStrings);
-        const decompressedEdit = decompressEdit(compressor, newInterner, idNormalizer, compressedEdit);
-        const compressedBuildChanges = compressedEdit.changes.filter((change) => change.type === ChangeTypeInternal.CompressedBuild);
-        treeIndex = 0;
-        for (const buildChange of compressedBuildChanges) {
-            for (const tree of buildChange.source) {
-                const treeParam = treeCompressor.decompressTreeCalls[treeIndex];
-                expect(treeParam).to.equal(tree);
-                treeIndex++;
-            }
-        }
-        expect(treeIndex).to.equal(treeCompressor.decompressTreeCalls.length);
-        expect(decompressedEdit).to.deep.equal(edit);
-    }
-    it('Compresses the BuildNodes of an edit with Build Changes', () => {
-        const tree = setUpTestTree();
-        const edit = newEdit(ChangeInternal.insertTree([tree.toChangeNode()], StablePlace.after(tree.left)));
-        const expectedCompressedEdit = {
-            id: edit.id,
-            changes: [
-                {
-                    destination: 0,
-                    source: [
-                        new InterningTreeCompressor().compress(tree, new MutableStringInterner(), scopeIdNormalizer(tree)),
-                    ],
-                    type: ChangeTypeInternal.CompressedBuild,
-                },
-                {
-                    destination: { side: 1, referenceSibling: tree.normalizeToOpSpace(tree.left.identifier) },
-                    source: 0,
-                    type: ChangeTypeInternal.Insert,
-                },
-            ],
-        };
-        testCompression(edit, scopeIdNormalizer(tree), expectedCompressedEdit);
-    });
-    it('compresses id references in Detach changes to op space', () => {
-        const tree = setUpTestTree();
-        const detach = {
-            destination: 0,
-            source: StableRange.only(tree),
-            type: ChangeTypeInternal.Detach,
-        };
-        const edit = {
-            id: newEditId(),
-            changes: [detach],
-        };
-        testCompression(edit, scopeIdNormalizer(tree), {
-            ...edit,
-            changes: [{ ...detach, source: convertStableRangeIds(detach.source, (id) => tree.normalizeToOpSpace(id)) }],
-        });
-    });
-    it('compresses id references in SetValue changes to op space', () => {
-        const context = makeNodeIdContext();
-        const id = context.generateNodeId();
-        const setValue = {
-            nodeToModify: id,
-            payload: 5,
-            type: ChangeTypeInternal.SetValue,
-        };
-        const edit = {
-            id: newEditId(),
-            changes: [setValue],
-        };
-        testCompression(edit, scopeIdNormalizer(context, context.localSessionId), {
-            ...edit,
-            changes: [{ ...setValue, nodeToModify: context.normalizeToOpSpace(id) }],
-        });
-    });
-    it('compresses id references in Constraint changes to op space', () => {
-        const tree = setUpTestTree();
-        const constraint = {
-            toConstrain: StableRange.only(tree),
-            effect: ConstraintEffect.InvalidAndDiscard,
-            type: ChangeTypeInternal.Constraint,
-        };
-        const edit = {
-            id: newEditId(),
-            changes: [constraint],
-        };
-        testCompression(edit, scopeIdNormalizer(tree), {
-            ...edit,
-            changes: [
-                {
-                    type: constraint.type,
-                    effect: constraint.effect,
-                    toConstrain: convertStableRangeIds(constraint.toConstrain, (id) => tree.normalizeToOpSpace(id)),
-                },
-            ],
-        });
-    });
-});
-//# sourceMappingURL=ChangeCompression.tests.js.map

package/lib/test/ChangeCompression.tests.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ChangeCompression.tests.js","sourceRoot":"","sources":["../../src/test/ChangeCompression.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAE9B,OAAO,EAAE,qBAAqB,EAAkB,MAAM,sBAAsB,CAAC;AAC7E,OAAO,EAEN,cAAc,EACd,kBAAkB,EAIlB,gBAAgB,GAMhB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzF,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAC7D,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AACzD,OAAO,EAAkB,uBAAuB,EAAE,MAAM,sBAAsB,CAAC;AAC/E,OAAO,EAAkC,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1F,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAC3D,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAKhF,MAAM,kBAAkB;IAIvB,YAAoC,iBAAiB,IAAI,uBAAuB,EAAgB;QAA5D,mBAAc,GAAd,cAAc,CAA8C;QAHzF,sBAAiB,GAAoC,EAAE,CAAC;QACxD,wBAAmB,GAA6D,EAAE,CAAC;IAES,CAAC;IAE7F,QAAQ,CACd,IAAmC,EACnC,QAAwB,EACxB,YAAiD;QAEjD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,cAAc,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACnE,CAAC;IAEM,UAAU,CAChB,IAAkD,EAClD,QAAwB,EACxB,YAAiD;QAEjD,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC;IACrE,CAAC;CACD;AAED,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IAClC,MAAM,cAAc,GAAG,IAAI,kBAAkB,EAAE,CAAC;IAEhD,UAAU,CAAC,GAAG,EAAE;QACf,cAAc,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,cAAc,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAG,IAAI,gBAAgB,CAAC,cAAc,CAAC,CAAC;IAExD;;;;;;OAMG;IACH,SAAS,eAAe,CACvB,IAA0B,EAC1B,YAA2D,EAC3D,UAAuC;QAEvC,MAAM,QAAQ,GAAG,IAAI,qBAAqB,EAAE,CAAC;QAC7C,MAAM,cAAc,GAAG,YAAY,CAAC,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;QAC9E,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,MAAM,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;SACjD;QAED,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CACvC,CAAC,MAAsB,EAA2B,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,kBAAkB,CAAC,KAAK,CAC7F,CAAC;QACF,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,KAAK,MAAM,WAAW,IAAI,YAAY,EAAE;YACvC,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,MAAM,EAAE;gBACtC,MAAM,SAAS,GAAG,cAAc,CAAC,iBAAiB,CAAC,SAAS,CAAC,CAAC;gBAC9D,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACjC,SAAS,EAAE,CAAC;aACZ;SACD;QACD,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAEpE,MAAM,CAAC,cAAc,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAE9D,MAAM,eAAe,GAAG,QAAQ,CAAC,eAAe,EAAE,CAAC;QACnD,MAAM,WAAW,GAAG,IAAI,qBAAqB,CAAC,eAAe,CAAC,CAAC;QAC/D,MAAM,gBAAgB,GAAG,cAAc,CAAC,UAAU,EAAE,WAAW,EAAE,YAAY,EAAE,cAAc,CAAC,CAAC;QAE/F,MAAM,sBAAsB,GAAG,cAAc,CAAC,OAAO,CAAC,MAAM,CAC3D,CAAC,MAAM,EAAoD,EAAE,CAC5D,MAAM,CAAC,IAAI,KAAK,kBAAkB,CAAC,eAAe,CACnD,CAAC;QAEF,SAAS,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,WAAW,IAAI,sBAAsB,EAAE;YACjD,KAAK,MAAM,IAAI,IAAI,WAAW,CAAC,MAAM,EAAE;gBACtC,MAAM,SAAS,GAAG,cAAc,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;gBAChE,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACjC,SAAS,EAAE,CAAC;aACZ;SACD;QACD,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACtE,MAAM,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9C,CAAC;IAED,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QAClE,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrG,MAAM,sBAAsB,GAA+B;YAC1D,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,OAAO,EAAE;gBACR;oBACC,WAAW,EAAE,CAAuB;oBACpC,MAAM,EAAE;wBACP,IAAI,uBAAuB,EAAE,CAAC,QAAQ,CACrC,IAAI,EACJ,IAAI,qBAAqB,EAAE,EAC3B,iBAAiB,CAAC,IAAI,CAAC,CACvB;qBACD;oBACD,IAAI,EAAE,kBAAkB,CAAC,eAAe;iBACxC;gBACD;oBACC,WAAW,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,gBAAgB,EAAE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;oBACzF,MAAM,EAAE,CAAuB;oBAC/B,IAAI,EAAE,kBAAkB,CAAC,MAAM;iBAC/B;aACD;SACD,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE,sBAAsB,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QACjE,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAmB;YAC9B,WAAW,EAAE,CAAuB;YACpC,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9B,IAAI,EAAE,kBAAkB,CAAC,MAAM;SAC/B,CAAC;QACF,MAAM,IAAI,GAAyB;YAClC,EAAE,EAAE,SAAS,EAAE;YACf,OAAO,EAAE,CAAC,MAAM,CAAC;SACjB,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE;YAC9C,GAAG,IAAI;YACP,OAAO,EAAE,CAAC,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,qBAAqB,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;SAC3G,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0DAA0D,EAAE,GAAG,EAAE;QACnE,MAAM,OAAO,GAAG,iBAAiB,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAqB;YAClC,YAAY,EAAE,EAAE;YAChB,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,kBAAkB,CAAC,QAAQ;SACjC,CAAC;QACF,MAAM,IAAI,GAAyB;YAClC,EAAE,EAAE,SAAS,EAAE;YACf,OAAO,EAAE,CAAC,QAAQ,CAAC;SACnB,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,OAAO,EAAE,OAAO,CAAC,cAAc,CAAC,EAAE;YACzE,GAAG,IAAI;YACP,OAAO,EAAE,CAAC,EAAE,GAAG,QAAQ,EAAE,YAAY,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC;SACxE,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACrE,MAAM,IAAI,GAAG,aAAa,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAuB;YACtC,WAAW,EAAE,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;YACnC,MAAM,EAAE,gBAAgB,CAAC,iBAAiB;YAC1C,IAAI,EAAE,kBAAkB,CAAC,UAAU;SACnC,CAAC;QACF,MAAM,IAAI,GAAyB;YAClC,EAAE,EAAE,SAAS,EAAE;YACf,OAAO,EAAE,CAAC,UAAU,CAAC;SACrB,CAAC;QACF,eAAe,CAAC,IAAI,EAAE,iBAAiB,CAAC,IAAI,CAAC,EAAE;YAC9C,GAAG,IAAI;YACP,OAAO,EAAE;gBACR;oBACC,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,MAAM,EAAE,UAAU,CAAC,MAAM;oBACzB,WAAW,EAAE,qBAAqB,CAAC,UAAU,CAAC,WAAW,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;iBAC/F;aACD;SACD,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { expect } from 'chai';\nimport { DetachedSequenceId, OpSpaceNodeId } from '../Identifiers.js';\nimport { MutableStringInterner, StringInterner } from '../StringInterner.js';\nimport {\n\tBuildInternal,\n\tChangeInternal,\n\tChangeTypeInternal,\n\tCompressedBuildInternal,\n\tCompressedChangeInternal,\n\tCompressedPlaceholderTree,\n\tConstraintEffect,\n\tConstraintInternal,\n\tDetachInternal,\n\tEdit,\n\tPlaceholderTree,\n\tSetValueInternal,\n} from '../persisted-types/index.js';\nimport { ChangeCompressor, compressEdit, decompressEdit } from '../ChangeCompression.js';\nimport { StablePlace, StableRange } from '../ChangeTypes.js';\nimport { newEdit, newEditId } from '../EditUtilities.js';\nimport { TreeCompressor, InterningTreeCompressor } from '../TreeCompressor.js';\nimport { ContextualizedNodeIdNormalizer, scopeIdNormalizer } from '../NodeIdUtilities.js';\nimport { convertStableRangeIds } from '../IdConversion.js';\nimport { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities.js';\n\n// CompressedChange type for this test suite. It aligns with CompressedChangeInternal but doesn't actually compress trees.\ntype TestCompressedChange = CompressedChangeInternal<OpSpaceNodeId>;\n\nclass TestTreeCompressor<TPlaceholder extends DetachedSequenceId | never> implements TreeCompressor<TPlaceholder> {\n\tpublic compressTreeCalls: PlaceholderTree<TPlaceholder>[] = [];\n\tpublic decompressTreeCalls: CompressedPlaceholderTree<OpSpaceNodeId, TPlaceholder>[] = [];\n\n\tpublic constructor(private readonly treeCompressor = new InterningTreeCompressor<TPlaceholder>()) {}\n\n\tpublic compress<TId extends OpSpaceNodeId>(\n\t\tnode: PlaceholderTree<TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): CompressedPlaceholderTree<TId, TPlaceholder> {\n\t\tthis.compressTreeCalls.push(node);\n\t\treturn this.treeCompressor.compress(node, interner, idNormalizer);\n\t}\n\n\tpublic decompress<TId extends OpSpaceNodeId>(\n\t\tnode: CompressedPlaceholderTree<TId, TPlaceholder>,\n\t\tinterner: StringInterner,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<TId>\n\t): PlaceholderTree<TPlaceholder> {\n\t\tthis.decompressTreeCalls.push(node);\n\t\treturn this.treeCompressor.decompress(node, interner, idNormalizer);\n\t}\n}\n\ndescribe('ChangeCompression', () => {\n\tconst treeCompressor = new TestTreeCompressor();\n\n\tbeforeEach(() => {\n\t\ttreeCompressor.compressTreeCalls.length = 0;\n\t\ttreeCompressor.decompressTreeCalls.length = 0;\n\t});\n\n\tconst compressor = new ChangeCompressor(treeCompressor);\n\n\t/**\n\t * Verifies an edit can round-trip through compression/decompression. Optionally also asserts the compressed state\n\t * matches some expected state.\n\t *\n\t * The mocked treeCompressor above is used for tree-level compression, so that tests can assert tree compression is invoked\n\t * without taking a dependency on its implementation.\n\t */\n\tfunction testCompression(\n\t\tedit: Edit<ChangeInternal>,\n\t\tidNormalizer: ContextualizedNodeIdNormalizer<OpSpaceNodeId>,\n\t\tcompressed?: Edit<TestCompressedChange>\n\t): void {\n\t\tconst interner = new MutableStringInterner();\n\t\tconst compressedEdit = compressEdit(compressor, interner, idNormalizer, edit);\n\t\tif (compressed !== undefined) {\n\t\t\texpect(compressedEdit).to.deep.equal(compressed);\n\t\t}\n\n\t\tconst buildChanges = edit.changes.filter<BuildInternal>(\n\t\t\t(change: ChangeInternal): change is BuildInternal => change.type === ChangeTypeInternal.Build\n\t\t);\n\t\tlet treeIndex = 0;\n\t\tfor (const buildChange of buildChanges) {\n\t\t\tfor (const tree of buildChange.source) {\n\t\t\t\tconst treeParam = treeCompressor.compressTreeCalls[treeIndex];\n\t\t\t\texpect(treeParam).to.equal(tree);\n\t\t\t\ttreeIndex++;\n\t\t\t}\n\t\t}\n\t\texpect(treeIndex).to.equal(treeCompressor.compressTreeCalls.length);\n\n\t\texpect(treeCompressor.decompressTreeCalls.length).to.equal(0);\n\n\t\tconst internedStrings = interner.getSerializable();\n\t\tconst newInterner = new MutableStringInterner(internedStrings);\n\t\tconst decompressedEdit = decompressEdit(compressor, newInterner, idNormalizer, compressedEdit);\n\n\t\tconst compressedBuildChanges = compressedEdit.changes.filter<CompressedBuildInternal<OpSpaceNodeId>>(\n\t\t\t(change): change is CompressedBuildInternal<OpSpaceNodeId> =>\n\t\t\t\tchange.type === ChangeTypeInternal.CompressedBuild\n\t\t);\n\n\t\ttreeIndex = 0;\n\t\tfor (const buildChange of compressedBuildChanges) {\n\t\t\tfor (const tree of buildChange.source) {\n\t\t\t\tconst treeParam = treeCompressor.decompressTreeCalls[treeIndex];\n\t\t\t\texpect(treeParam).to.equal(tree);\n\t\t\t\ttreeIndex++;\n\t\t\t}\n\t\t}\n\t\texpect(treeIndex).to.equal(treeCompressor.decompressTreeCalls.length);\n\t\texpect(decompressedEdit).to.deep.equal(edit);\n\t}\n\n\tit('Compresses the BuildNodes of an edit with Build Changes', () => {\n\t\tconst tree = setUpTestTree();\n\t\tconst edit = newEdit(ChangeInternal.insertTree([tree.toChangeNode()], StablePlace.after(tree.left)));\n\t\tconst expectedCompressedEdit: Edit<TestCompressedChange> = {\n\t\t\tid: edit.id,\n\t\t\tchanges: [\n\t\t\t\t{\n\t\t\t\t\tdestination: 0 as DetachedSequenceId,\n\t\t\t\t\tsource: [\n\t\t\t\t\t\tnew InterningTreeCompressor().compress(\n\t\t\t\t\t\t\ttree,\n\t\t\t\t\t\t\tnew MutableStringInterner(),\n\t\t\t\t\t\t\tscopeIdNormalizer(tree)\n\t\t\t\t\t\t),\n\t\t\t\t\t],\n\t\t\t\t\ttype: ChangeTypeInternal.CompressedBuild,\n\t\t\t\t},\n\t\t\t\t{\n\t\t\t\t\tdestination: { side: 1, referenceSibling: tree.normalizeToOpSpace(tree.left.identifier) },\n\t\t\t\t\tsource: 0 as DetachedSequenceId,\n\t\t\t\t\ttype: ChangeTypeInternal.Insert,\n\t\t\t\t},\n\t\t\t],\n\t\t};\n\t\ttestCompression(edit, scopeIdNormalizer(tree), expectedCompressedEdit);\n\t});\n\n\tit('compresses id references in Detach changes to op space', () => {\n\t\tconst tree = setUpTestTree();\n\t\tconst detach: DetachInternal = {\n\t\t\tdestination: 0 as DetachedSequenceId,\n\t\t\tsource: StableRange.only(tree),\n\t\t\ttype: ChangeTypeInternal.Detach,\n\t\t};\n\t\tconst edit: Edit<ChangeInternal> = {\n\t\t\tid: newEditId(),\n\t\t\tchanges: [detach],\n\t\t};\n\t\ttestCompression(edit, scopeIdNormalizer(tree), {\n\t\t\t...edit,\n\t\t\tchanges: [{ ...detach, source: convertStableRangeIds(detach.source, (id) => tree.normalizeToOpSpace(id)) }],\n\t\t});\n\t});\n\n\tit('compresses id references in SetValue changes to op space', () => {\n\t\tconst context = makeNodeIdContext();\n\t\tconst id = context.generateNodeId();\n\t\tconst setValue: SetValueInternal = {\n\t\t\tnodeToModify: id,\n\t\t\tpayload: 5,\n\t\t\ttype: ChangeTypeInternal.SetValue,\n\t\t};\n\t\tconst edit: Edit<ChangeInternal> = {\n\t\t\tid: newEditId(),\n\t\t\tchanges: [setValue],\n\t\t};\n\t\ttestCompression(edit, scopeIdNormalizer(context, context.localSessionId), {\n\t\t\t...edit,\n\t\t\tchanges: [{ ...setValue, nodeToModify: context.normalizeToOpSpace(id) }],\n\t\t});\n\t});\n\n\tit('compresses id references in Constraint changes to op space', () => {\n\t\tconst tree = setUpTestTree();\n\t\tconst constraint: ConstraintInternal = {\n\t\t\ttoConstrain: StableRange.only(tree),\n\t\t\teffect: ConstraintEffect.InvalidAndDiscard,\n\t\t\ttype: ChangeTypeInternal.Constraint,\n\t\t};\n\t\tconst edit: Edit<ChangeInternal> = {\n\t\t\tid: newEditId(),\n\t\t\tchanges: [constraint],\n\t\t};\n\t\ttestCompression(edit, scopeIdNormalizer(tree), {\n\t\t\t...edit,\n\t\t\tchanges: [\n\t\t\t\t{\n\t\t\t\t\ttype: constraint.type,\n\t\t\t\t\teffect: constraint.effect,\n\t\t\t\t\ttoConstrain: convertStableRangeIds(constraint.toConstrain, (id) => tree.normalizeToOpSpace(id)),\n\t\t\t\t},\n\t\t\t],\n\t\t});\n\t});\n});\n"]}

package/lib/test/Checkout.tests.d.ts

@@ -1,10 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { SharedTree, Checkout } from '../index.js';
-/**
- * Checkout test suite
- */
-export declare function checkoutTests(checkoutName: string, checkoutFactory: (tree: SharedTree) => Promise<Checkout>, additionalTests?: () => void): void;
-//# sourceMappingURL=Checkout.tests.d.ts.map

package/lib/test/Checkout.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Checkout.tests.d.ts","sourceRoot":"","sources":["../../src/test/Checkout.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAMH,OAAO,EAMN,UAAU,EAEV,QAAQ,EAKR,MAAM,aAAa,CAAC;AAIrB;;GAEG;AACH,wBAAgB,aAAa,CAC5B,YAAY,EAAE,MAAM,EACpB,eAAe,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAAC,QAAQ,CAAC,EACxD,eAAe,CAAC,EAAE,MAAM,IAAI,GAC1B,IAAI,CAwkBN"}