@fluid-experimental/tree 0.58.2002 → 0.59.1000

package/lib/test/AppendOnlySortedMap.tests.js

@@ -0,0 +1,169 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+/* eslint-disable no-bitwise */
+import { expect } from 'chai';
+import { assertNotUndefined, compareFiniteNumbers } from '../Common';
+import { AppendOnlyDoublySortedMap, AppendOnlySortedMap } from '../id-compressor/AppendOnlySortedMap';
+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.';
+        expect(() => map.append(-1, 1)).to.throw(exception);
+        expect(() => map.append(1, 2)).to.not.throw();
+    });
+    it('can get the max key', () => {
+        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);
+        }
+    });
+    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 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 calculate the indexOf a search element', () => {
+        const elements = [
+            [0, 0],
+            [2, 0],
+            [3, 0],
+        ];
+        const comparator = (key, element) => {
+            return compareFiniteNumbers(key, element[0]);
+        };
+        expect(AppendOnlySortedMap.indexOf(elements, 0, comparator)).to.equal(0);
+        expect(AppendOnlySortedMap.indexOf(elements, 2, comparator)).to.equal(1);
+        expect(AppendOnlySortedMap.indexOf(elements, 3, comparator)).to.equal(2);
+        expect(AppendOnlySortedMap.indexOf(elements, -1, comparator)).to.equal(0 ^ AppendOnlySortedMap.failureXor);
+        expect(AppendOnlySortedMap.indexOf(elements, 1, comparator)).to.equal(1 ^ AppendOnlySortedMap.failureXor);
+        expect(AppendOnlySortedMap.indexOf(elements, 10, comparator)).to.equal(3 ^ 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.';
+        expect(() => map.append(1, -1)).to.throw(exception);
+        expect(() => map.append(2, 1)).to.not.throw();
+    });
+    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;
+        });
+    });
+});
+//# sourceMappingURL=AppendOnlySortedMap.tests.js.map

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

@@ -0,0 +1 @@
+{"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,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,MAAM,WAAW,CAAC;AACrE,OAAO,EAAE,yBAAyB,EAAE,mBAAmB,EAAE,MAAM,sCAAsC,CAAC;AAEtG,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,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC9B,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;SACjC;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,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,4CAA4C,EAAE,GAAG,EAAE;QACrD,MAAM,QAAQ,GAAuB;YACpC,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,CAAC,CAAC,EAAE,CAAC,CAAC;SACN,CAAC;QACF,MAAM,UAAU,GAAG,CAAC,GAAW,EAAE,OAAkC,EAAU,EAAE;YAC9E,OAAO,oBAAoB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC;QACF,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzE,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAC3G,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAC1G,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;IAC5G,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,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QACpD,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IAC/C,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;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 { expect } from 'chai';\nimport { assertNotUndefined, compareFiniteNumbers } from '../Common';\nimport { AppendOnlyDoublySortedMap, AppendOnlySortedMap } from '../id-compressor/AppendOnlySortedMap';\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\texpect(() => map.append(-1, 1)).to.throw(exception);\n\t\texpect(() => map.append(1, 2)).to.not.throw();\n\t});\n\n\tit('can get the max key', () => {\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}\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 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 calculate the indexOf a search element', () => {\n\t\tconst elements: [number, number][] = [\n\t\t\t[0, 0],\n\t\t\t[2, 0],\n\t\t\t[3, 0],\n\t\t];\n\t\tconst comparator = (key: number, element: readonly [number, number]): number => {\n\t\t\treturn compareFiniteNumbers(key, element[0]);\n\t\t};\n\t\texpect(AppendOnlySortedMap.indexOf(elements, 0, comparator)).to.equal(0);\n\t\texpect(AppendOnlySortedMap.indexOf(elements, 2, comparator)).to.equal(1);\n\t\texpect(AppendOnlySortedMap.indexOf(elements, 3, comparator)).to.equal(2);\n\t\texpect(AppendOnlySortedMap.indexOf(elements, -1, comparator)).to.equal(0 ^ AppendOnlySortedMap.failureXor);\n\t\texpect(AppendOnlySortedMap.indexOf(elements, 1, comparator)).to.equal(1 ^ AppendOnlySortedMap.failureXor);\n\t\texpect(AppendOnlySortedMap.indexOf(elements, 10, comparator)).to.equal(3 ^ 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\texpect(() => map.append(1, -1)).to.throw(exception);\n\t\texpect(() => map.append(2, 1)).to.not.throw();\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"]}

package/lib/test/{SnapshotUtilities.tests.d.ts → ChangeCompression.tests.d.ts}

@@ -3,4 +3,4 @@
  * Licensed under the MIT License.
  */
 export {};
-//# sourceMappingURL=SnapshotUtilities.tests.d.ts.map
+//# sourceMappingURL=ChangeCompression.tests.d.ts.map

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

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

package/lib/test/ChangeCompression.tests.js

@@ -0,0 +1,145 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { expect } from 'chai';
+import { MutableStringInterner } from '../StringInterner';
+import { ChangeInternal, ChangeTypeInternal, ConstraintEffect, } from '../persisted-types';
+import { ChangeCompressor, compressEdit, decompressEdit } from '../ChangeCompression';
+import { StablePlace, StableRange } from '../ChangeTypes';
+import { newEdit, newEditId } from '../EditUtilities';
+import { InterningTreeCompressor } from '../TreeCompressor';
+import { scopeIdNormalizer } from '../NodeIdUtilities';
+import { convertStableRangeIds } from '../IdConversion';
+import { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities';
+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), Object.assign(Object.assign({}, edit), { changes: [Object.assign(Object.assign({}, 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), Object.assign(Object.assign({}, edit), { changes: [Object.assign(Object.assign({}, 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), Object.assign(Object.assign({}, 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

@@ -0,0 +1 @@
+{"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,mBAAmB,CAAC;AAC1E,OAAO,EAEN,cAAc,EACd,kBAAkB,EAIlB,gBAAgB,GAMhB,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AACtF,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC1D,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,kBAAkB,CAAC;AACtD,OAAO,EAAkB,uBAAuB,EAAE,MAAM,mBAAmB,CAAC;AAC5E,OAAO,EAAkC,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACvF,OAAO,EAAE,qBAAqB,EAAE,MAAM,iBAAiB,CAAC;AACxD,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAK7E,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,kCACzC,IAAI,KACP,OAAO,EAAE,iCAAM,MAAM,KAAE,MAAM,EAAE,qBAAqB,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,IAAG,IAC1G,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,kCACpE,IAAI,KACP,OAAO,EAAE,iCAAM,QAAQ,KAAE,YAAY,EAAE,OAAO,CAAC,kBAAkB,CAAC,EAAE,CAAC,IAAG,IACvE,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,kCACzC,IAAI,KACP,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,IACA,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';\nimport { MutableStringInterner, StringInterner } from '../StringInterner';\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';\nimport { ChangeCompressor, compressEdit, decompressEdit } from '../ChangeCompression';\nimport { StablePlace, StableRange } from '../ChangeTypes';\nimport { newEdit, newEditId } from '../EditUtilities';\nimport { TreeCompressor, InterningTreeCompressor } from '../TreeCompressor';\nimport { ContextualizedNodeIdNormalizer, scopeIdNormalizer } from '../NodeIdUtilities';\nimport { convertStableRangeIds } from '../IdConversion';\nimport { makeNodeIdContext, setUpTestTree } from './utilities/TestUtilities';\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

@@ -2,10 +2,9 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-/// <reference types="mocha" />
-import { SharedTree, Checkout, Change } from '../index';
+import { SharedTree, Checkout } from '../index';
 /**
  * Checkout test suite
  */
-export declare function checkoutTests(suiteName: string, checkoutFactory: (tree: SharedTree) => Promise<Checkout<Change>>): Mocha.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 +1 @@
-{"version":3,"file":"Checkout.tests.d.ts","sourceRoot":"","sources":["../../src/test/Checkout.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;;AAGH,OAAO,EAUN,UAAU,EAEV,QAAQ,EAER,MAAM,EACN,MAAM,UAAU,CAAC;AAYlB;;GAEG;AACH,wBAAgB,aAAa,CAC5B,SAAS,EAAE,MAAM,EACjB,eAAe,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,GAC9D,KAAK,CAAC,KAAK,CAydb"}
+{"version":3,"file":"Checkout.tests.d.ts","sourceRoot":"","sources":["../../src/test/Checkout.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAMN,UAAU,EAEV,QAAQ,EAKR,MAAM,UAAU,CAAC;AAIlB;;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,CAohBN"}