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

package/lib/test/Common.tests.js

@@ -1,102 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { filter, find, getOrCreate, identity, map, memoizeGetter, reduce, unwrapRestOrArray, } from '../Common.js';
-describe('Common', () => {
-    it('function memoizeGetter() correctly memoizes', () => {
-        let x = 0;
-        const getAndInc = () => x++;
-        const obj = {
-            get getUncached() {
-                return getAndInc();
-            },
-            get getCached() {
-                return memoizeGetter(this, 'getCached', getAndInc());
-            },
-        };
-        expect(obj.getUncached).to.equal(0);
-        expect(obj.getUncached).to.equal(1);
-        expect(obj.getCached).to.equal(2);
-        expect(obj.getCached).to.equal(2); // Cached, no increment
-    });
-    it('identity function returns its input', () => {
-        const inputs = [42, 'test', true];
-        for (const input of inputs) {
-            expect(identity(input)).to.equal(input);
-        }
-    });
-    describe('getOrCreate', () => {
-        it('returns existing values', () => {
-            const map = new Map();
-            const key = 42;
-            const value = 'test';
-            map.set(key, value);
-            expect(getOrCreate(map, key, () => expect.fail('should not call value creator for existing values'))).to.equal(value);
-        });
-        it('inserts new values', () => {
-            const map = new Map();
-            const key = 42;
-            const value = 'test';
-            expect(getOrCreate(map, key, () => value)).to.equal(value);
-            expect(map.get(key)).to.equal(value);
-        });
-    });
-    it('maps iterables correctly', () => {
-        const inputs = [0, 1, 2, 3];
-        const mapper = (n) => n * 2;
-        expect([...map(inputs, mapper)]).to.deep.equal(inputs.map(mapper));
-    });
-    it('filters iterables correctly', () => {
-        const inputs = [0, 1, 2, 3];
-        const predicate = (n) => n < 2;
-        expect([...filter(inputs, predicate)]).to.deep.equal(inputs.filter(predicate));
-    });
-    describe('reduces iterables', () => {
-        const reducer = (p, c) => p + c;
-        it('that are empty', () => {
-            const inputs = [];
-            expect(reduce(inputs, reducer)).to.be.undefined;
-        });
-        it('that have a single element', () => {
-            const inputs = [42];
-            expect(reduce(inputs, reducer)).to.equal(inputs.reduce(reducer));
-        });
-        it('with no initial value', () => {
-            const inputs = [0, 1, 2, 3];
-            expect(reduce(inputs, reducer)).to.equal(inputs.reduce(reducer));
-        });
-        it('with an initial value', () => {
-            const inputs = [0, 1, 2, 3];
-            expect(reduce(inputs, reducer, 42)).to.equal(inputs.reduce(reducer, 42));
-        });
-    });
-    it('finds elements in iterables', () => {
-        const inputs = [0, 1, 2, 3];
-        const predicateFind = (n) => n >= 2;
-        expect(find(inputs, predicateFind)).to.equal(inputs.find(predicateFind));
-        const predicateNever = (n) => n < 0;
-        expect(find(inputs, predicateNever)).to.equal(inputs.find(predicateNever));
-    });
-    describe('unwrapRestOrArray', () => {
-        function testUnwrap(...params) {
-            return unwrapRestOrArray(params);
-        }
-        it('unwraps array arguments', () => {
-            const input = [0, 1, 2, 3];
-            const result = testUnwrap(input);
-            expect(result).to.equal(input);
-        });
-        it('does not unwrap rest arguments', () => {
-            const input = [0, 1, 2, 3];
-            const spreadResult = testUnwrap(...input);
-            const restResult = testUnwrap(0, 1, 2, 3);
-            expect(Array.isArray(spreadResult)).to.equal(true);
-            expect(Array.isArray(restResult)).to.equal(true);
-            expect(spreadResult.length).to.equal(input.length);
-            expect(restResult.length).to.equal(input.length);
-        });
-    });
-});
-//# sourceMappingURL=Common.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Common.tests.js","sourceRoot":"","sources":["../../src/test/Common.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EACN,MAAM,EACN,IAAI,EACJ,WAAW,EACX,QAAQ,EACR,GAAG,EACH,aAAa,EACb,MAAM,EAEN,iBAAiB,GACjB,MAAM,cAAc,CAAC;AAEtB,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;IACvB,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACtD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG;YACX,IAAI,WAAW;gBACd,OAAO,SAAS,EAAE,CAAC;YACpB,CAAC;YACD,IAAI,SAAS;gBACZ,OAAO,aAAa,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,CAAC;YACtD,CAAC;SACD,CAAC;QAEF,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB;IAC3D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC9C,MAAM,MAAM,GAAG,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;YAC3B,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;SACxC;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;YACtC,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,MAAM,CAAC;YACrB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACpB,MAAM,CACL,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,mDAAmD,CAAC,CAAC,CAC7F,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACnB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;YACtC,MAAM,GAAG,GAAG,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,MAAM,CAAC;YACrB,MAAM,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3D,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QACnC,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IACpE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAEhD,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,MAAM,GAAa,EAAE,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACrC,MAAM,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC;YACpB,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QAClE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAChC,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACtC,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5B,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;QACzE,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAC5E,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAClC,SAAS,UAAU,CAAC,GAAG,MAA2B;YACjD,OAAO,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAClC,CAAC;QACD,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACzC,MAAM,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC3B,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,KAAK,CAAC,CAAC;YAC1C,MAAM,UAAU,GAAG,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACnD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACnD,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClD,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\nimport { expect } from 'chai';\nimport {\n\tfilter,\n\tfind,\n\tgetOrCreate,\n\tidentity,\n\tmap,\n\tmemoizeGetter,\n\treduce,\n\tRestOrArray,\n\tunwrapRestOrArray,\n} from '../Common.js';\n\ndescribe('Common', () => {\n\tit('function memoizeGetter() correctly memoizes', () => {\n\t\tlet x = 0;\n\t\tconst getAndInc = () => x++;\n\t\tconst obj = {\n\t\t\tget getUncached(): number {\n\t\t\t\treturn getAndInc();\n\t\t\t},\n\t\t\tget getCached(): number {\n\t\t\t\treturn memoizeGetter(this, 'getCached', getAndInc());\n\t\t\t},\n\t\t};\n\n\t\texpect(obj.getUncached).to.equal(0);\n\t\texpect(obj.getUncached).to.equal(1);\n\t\texpect(obj.getCached).to.equal(2);\n\t\texpect(obj.getCached).to.equal(2); // Cached, no increment\n\t});\n\n\tit('identity function returns its input', () => {\n\t\tconst inputs = [42, 'test', true];\n\t\tfor (const input of inputs) {\n\t\t\texpect(identity(input)).to.equal(input);\n\t\t}\n\t});\n\n\tdescribe('getOrCreate', () => {\n\t\tit('returns existing values', () => {\n\t\t\tconst map = new Map<number, string>();\n\t\t\tconst key = 42;\n\t\t\tconst value = 'test';\n\t\t\tmap.set(key, value);\n\t\t\texpect(\n\t\t\t\tgetOrCreate(map, key, () => expect.fail('should not call value creator for existing values'))\n\t\t\t).to.equal(value);\n\t\t});\n\n\t\tit('inserts new values', () => {\n\t\t\tconst map = new Map<number, string>();\n\t\t\tconst key = 42;\n\t\t\tconst value = 'test';\n\t\t\texpect(getOrCreate(map, key, () => value)).to.equal(value);\n\t\t\texpect(map.get(key)).to.equal(value);\n\t\t});\n\t});\n\n\tit('maps iterables correctly', () => {\n\t\tconst inputs = [0, 1, 2, 3];\n\t\tconst mapper = (n: number) => n * 2;\n\t\texpect([...map(inputs, mapper)]).to.deep.equal(inputs.map(mapper));\n\t});\n\n\tit('filters iterables correctly', () => {\n\t\tconst inputs = [0, 1, 2, 3];\n\t\tconst predicate = (n: number) => n < 2;\n\t\texpect([...filter(inputs, predicate)]).to.deep.equal(inputs.filter(predicate));\n\t});\n\n\tdescribe('reduces iterables', () => {\n\t\tconst reducer = (p: number, c: number) => p + c;\n\n\t\tit('that are empty', () => {\n\t\t\tconst inputs: number[] = [];\n\t\t\texpect(reduce(inputs, reducer)).to.be.undefined;\n\t\t});\n\n\t\tit('that have a single element', () => {\n\t\t\tconst inputs = [42];\n\t\t\texpect(reduce(inputs, reducer)).to.equal(inputs.reduce(reducer));\n\t\t});\n\n\t\tit('with no initial value', () => {\n\t\t\tconst inputs = [0, 1, 2, 3];\n\t\t\texpect(reduce(inputs, reducer)).to.equal(inputs.reduce(reducer));\n\t\t});\n\n\t\tit('with an initial value', () => {\n\t\t\tconst inputs = [0, 1, 2, 3];\n\t\t\texpect(reduce(inputs, reducer, 42)).to.equal(inputs.reduce(reducer, 42));\n\t\t});\n\t});\n\n\tit('finds elements in iterables', () => {\n\t\tconst inputs = [0, 1, 2, 3];\n\t\tconst predicateFind = (n: number) => n >= 2;\n\t\texpect(find(inputs, predicateFind)).to.equal(inputs.find(predicateFind));\n\t\tconst predicateNever = (n: number) => n < 0;\n\t\texpect(find(inputs, predicateNever)).to.equal(inputs.find(predicateNever));\n\t});\n\n\tdescribe('unwrapRestOrArray', () => {\n\t\tfunction testUnwrap(...params: RestOrArray<number>): readonly number[] {\n\t\t\treturn unwrapRestOrArray(params);\n\t\t}\n\t\tit('unwraps array arguments', () => {\n\t\t\tconst input = [0, 1, 2, 3];\n\t\t\tconst result = testUnwrap(input);\n\t\t\texpect(result).to.equal(input);\n\t\t});\n\t\tit('does not unwrap rest arguments', () => {\n\t\t\tconst input = [0, 1, 2, 3];\n\t\t\tconst spreadResult = testUnwrap(...input);\n\t\t\tconst restResult = testUnwrap(0, 1, 2, 3);\n\t\t\texpect(Array.isArray(spreadResult)).to.equal(true);\n\t\t\texpect(Array.isArray(restResult)).to.equal(true);\n\t\t\texpect(spreadResult.length).to.equal(input.length);\n\t\t\texpect(restResult.length).to.equal(input.length);\n\t\t});\n\t});\n});\n"]}

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

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

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

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

package/lib/test/EagerCheckout.tests.js

@@ -1,20 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { Change, StableRange } from '../ChangeTypes.js';
-import { EagerCheckout } from '../EagerCheckout.js';
-import { checkoutTests } from './Checkout.tests.js';
-import { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities.js';
-checkoutTests('EagerCheckout', async (tree) => Promise.resolve(new EagerCheckout(tree)), () => {
-    it('updates eagerly', () => {
-        const { tree } = setUpTestSharedTree();
-        const testTree = setUpTestTree(tree);
-        const checkout = new EagerCheckout(tree);
-        expect(tree.currentView.equals(checkout.currentView)).to.be.true;
-        tree.applyEdit(Change.delete(StableRange.only(testTree.left)));
-        expect(tree.currentView.equals(checkout.currentView)).to.be.true;
-    });
-});
-//# sourceMappingURL=EagerCheckout.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"EagerCheckout.tests.js","sourceRoot":"","sources":["../../src/test/EagerCheckout.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAElF,aAAa,CACZ,eAAe,EACf,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC,EACxD,GAAG,EAAE;IACJ,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,EAAE,CAAC;QACvC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,QAAQ,GAAG,IAAI,aAAa,CAAC,IAAI,CAAC,CAAC;QAEzC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;QACjE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/D,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAClE,CAAC,CAAC,CAAC;AACJ,CAAC,CACD,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 { Change, StableRange } from '../ChangeTypes.js';\nimport { EagerCheckout } from '../EagerCheckout.js';\nimport { checkoutTests } from './Checkout.tests.js';\nimport { setUpTestSharedTree, setUpTestTree } from './utilities/TestUtilities.js';\n\ncheckoutTests(\n\t'EagerCheckout',\n\tasync (tree) => Promise.resolve(new EagerCheckout(tree)),\n\t() => {\n\t\tit('updates eagerly', () => {\n\t\t\tconst { tree } = setUpTestSharedTree();\n\t\t\tconst testTree = setUpTestTree(tree);\n\t\t\tconst checkout = new EagerCheckout(tree);\n\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.true;\n\t\t\ttree.applyEdit(Change.delete(StableRange.only(testTree.left)));\n\t\t\texpect(tree.currentView.equals(checkout.currentView)).to.be.true;\n\t\t});\n\t}\n);\n"]}

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

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

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

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

package/lib/test/Edit.tests.js

@@ -1,60 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { deepCompareNodes } from '../EditUtilities.js';
-import { refreshTestTree } from './utilities/TestUtilities.js';
-// TODO #45414: Re-enable when compareEdits compares the actual changes instead of just the edit IDs.
-// 			    Commented out instead of skipped to avoid linting errors.
-// describe('compareSequencedEdits', () => {
-// 	it('correctly compares two equal sequenced edits', () => {
-// 		const node = makeTestNode();
-// 		const editId = '75dd0d7d-ea87-40cf-8860-dc2b9d827597' as EditId;
-// 		const editA: Edit = {
-// 			changes: [Change.delete(StableRange.only(node))],
-// 		};
-// 		const sequencedEditB: Edit = {
-// 			changes: [Change.delete(StableRange.only(node))],
-// 		};
-// 		expect(compareEdits(editA, sequencedEditB)).to.be.true;
-// 	});
-// 	it('correctly compares two non-equal sequenced edits', () => {
-// 		const node = makeTestNode();
-// 		const nodeDestination = makeTestNode();
-// 		const sequencedEditA: Edit = {
-// 			changes: [Change.delete(StableRange.only(node))],
-// 			id: '7366efae-f96a-4f5d-9c6c-eea62ac6dffb' as EditId,
-// 		};
-// 		const sequencedEditB: Edit = {
-// 			changes: [...Change.move(StableRange.only(node), StablePlace.before(nodeDestination))],
-// 			id: '57cb9fa9-9d1d-49eb-919a-5636ed55a65a' as EditId,
-// 		};
-// 		expect(compareEdits(sequencedEditA, sequencedEditB)).to.be.false;
-// 	});
-// });
-describe('deepCompareNodes', () => {
-    const testTree = refreshTestTree();
-    it('correctly compares two empty nodes', () => {
-        const nodeId = testTree.generateNodeId();
-        expect(deepCompareNodes(testTree.buildLeaf(nodeId), testTree.buildLeaf(nodeId))).to.be.true;
-    });
-    it('correctly compares two deeply equal nodes', () => {
-        const otherTree = {
-            definition: testTree.definition,
-            identifier: testTree.identifier,
-            traits: {
-                left: [{ definition: testTree.left.definition, identifier: testTree.left.identifier, traits: {} }],
-                right: [{ definition: testTree.right.definition, identifier: testTree.right.identifier, traits: {} }],
-            },
-        };
-        expect(deepCompareNodes(testTree, otherTree)).to.be.true;
-    });
-    it('returns false for unequal nodes', () => {
-        expect(deepCompareNodes(testTree.buildLeaf(testTree.generateNodeId()), testTree.buildLeaf(testTree.generateNodeId()))).to.be.false;
-        expect(deepCompareNodes(testTree.buildLeaf(testTree.identifier), testTree)).to.be.false;
-        expect(deepCompareNodes(testTree.buildLeaf(testTree.identifier), testTree)).to.be.false;
-        expect(deepCompareNodes(testTree, testTree.buildLeaf(testTree.identifier))).to.be.false;
-    });
-});
-//# sourceMappingURL=Edit.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Edit.tests.js","sourceRoot":"","sources":["../../src/test/Edit.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAC;AAC9B,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AAEvD,OAAO,EAAE,eAAe,EAAE,MAAM,8BAA8B,CAAC;AAE/D,qGAAqG;AACrG,mEAAmE;AACnE,4CAA4C;AAC5C,8DAA8D;AAC9D,iCAAiC;AACjC,qEAAqE;AACrE,0BAA0B;AAC1B,uDAAuD;AACvD,OAAO;AAEP,mCAAmC;AACnC,uDAAuD;AACvD,OAAO;AAEP,4DAA4D;AAC5D,OAAO;AAEP,kEAAkE;AAClE,iCAAiC;AACjC,4CAA4C;AAE5C,mCAAmC;AACnC,uDAAuD;AACvD,2DAA2D;AAC3D,OAAO;AAEP,mCAAmC;AACnC,6FAA6F;AAC7F,2DAA2D;AAC3D,OAAO;AAEP,sEAAsE;AACtE,OAAO;AACP,MAAM;AAEN,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IACjC,MAAM,QAAQ,GAAG,eAAe,EAAE,CAAC;IAEnC,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,CAAC,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAC7F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACpD,MAAM,SAAS,GAAe;YAC7B,UAAU,EAAE,QAAQ,CAAC,UAAU;YAC/B,UAAU,EAAE,QAAQ,CAAC,UAAU;YAC/B,MAAM,EAAE;gBACP,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;gBAClG,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC;aACrG;SACD,CAAC;QACF,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC1C,MAAM,CACL,gBAAgB,CACf,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,EAC7C,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAC7C,CACD,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACd,MAAM,CAAC,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACxF,MAAM,CAAC,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACxF,MAAM,CAAC,gBAAgB,CAAC,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;IACzF,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 { deepCompareNodes } from '../EditUtilities.js';\nimport { ChangeNode } from '../persisted-types/index.js';\nimport { refreshTestTree } from './utilities/TestUtilities.js';\n\n// TODO #45414: Re-enable when compareEdits compares the actual changes instead of just the edit IDs.\n// \t\t\t    Commented out instead of skipped to avoid linting errors.\n// describe('compareSequencedEdits', () => {\n// \tit('correctly compares two equal sequenced edits', () => {\n// \t\tconst node = makeTestNode();\n// \t\tconst editId = '75dd0d7d-ea87-40cf-8860-dc2b9d827597' as EditId;\n// \t\tconst editA: Edit = {\n// \t\t\tchanges: [Change.delete(StableRange.only(node))],\n// \t\t};\n\n// \t\tconst sequencedEditB: Edit = {\n// \t\t\tchanges: [Change.delete(StableRange.only(node))],\n// \t\t};\n\n// \t\texpect(compareEdits(editA, sequencedEditB)).to.be.true;\n// \t});\n\n// \tit('correctly compares two non-equal sequenced edits', () => {\n// \t\tconst node = makeTestNode();\n// \t\tconst nodeDestination = makeTestNode();\n\n// \t\tconst sequencedEditA: Edit = {\n// \t\t\tchanges: [Change.delete(StableRange.only(node))],\n// \t\t\tid: '7366efae-f96a-4f5d-9c6c-eea62ac6dffb' as EditId,\n// \t\t};\n\n// \t\tconst sequencedEditB: Edit = {\n// \t\t\tchanges: [...Change.move(StableRange.only(node), StablePlace.before(nodeDestination))],\n// \t\t\tid: '57cb9fa9-9d1d-49eb-919a-5636ed55a65a' as EditId,\n// \t\t};\n\n// \t\texpect(compareEdits(sequencedEditA, sequencedEditB)).to.be.false;\n// \t});\n// });\n\ndescribe('deepCompareNodes', () => {\n\tconst testTree = refreshTestTree();\n\n\tit('correctly compares two empty nodes', () => {\n\t\tconst nodeId = testTree.generateNodeId();\n\t\texpect(deepCompareNodes(testTree.buildLeaf(nodeId), testTree.buildLeaf(nodeId))).to.be.true;\n\t});\n\n\tit('correctly compares two deeply equal nodes', () => {\n\t\tconst otherTree: ChangeNode = {\n\t\t\tdefinition: testTree.definition,\n\t\t\tidentifier: testTree.identifier,\n\t\t\ttraits: {\n\t\t\t\tleft: [{ definition: testTree.left.definition, identifier: testTree.left.identifier, traits: {} }],\n\t\t\t\tright: [{ definition: testTree.right.definition, identifier: testTree.right.identifier, traits: {} }],\n\t\t\t},\n\t\t};\n\t\texpect(deepCompareNodes(testTree, otherTree)).to.be.true;\n\t});\n\n\tit('returns false for unequal nodes', () => {\n\t\texpect(\n\t\t\tdeepCompareNodes(\n\t\t\t\ttestTree.buildLeaf(testTree.generateNodeId()),\n\t\t\t\ttestTree.buildLeaf(testTree.generateNodeId())\n\t\t\t)\n\t\t).to.be.false;\n\t\texpect(deepCompareNodes(testTree.buildLeaf(testTree.identifier), testTree)).to.be.false;\n\t\texpect(deepCompareNodes(testTree.buildLeaf(testTree.identifier), testTree)).to.be.false;\n\t\texpect(deepCompareNodes(testTree, testTree.buildLeaf(testTree.identifier))).to.be.false;\n\t});\n});\n"]}

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

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

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

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

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

@@ -1,41 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { benchmark, BenchmarkType } from '@fluid-tools/benchmark';
-import { Change, StablePlace } from '../ChangeTypes.js';
-import { EditLog } from '../EditLog.js';
-import { newEdit } from '../EditUtilities.js';
-import { setUpTestTree } from './utilities/TestUtilities.js';
-describe('EditLog Perf', () => {
-    const insertNumbers = [10, 50, 100, 500, 1000];
-    insertNumbers.forEach((numberOfInserts) => {
-        const edits = [];
-        const testTree = setUpTestTree();
-        for (let i = 0; i < numberOfInserts; i++) {
-            edits.push(newEdit(Change.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.traitLocation))));
-        }
-        benchmark({
-            type: BenchmarkType.Measurement,
-            title: `process ${numberOfInserts} sequenced inserts`,
-            benchmarkFn: () => {
-                const log = new EditLog();
-                edits.forEach((edit) => {
-                    log.addSequencedEdit(edit, { sequenceNumber: 1, referenceSequenceNumber: 0 });
-                });
-            },
-        });
-        const targetEditLogSize = Math.floor(numberOfInserts / 4);
-        benchmark({
-            type: BenchmarkType.Measurement,
-            title: `process ${numberOfInserts} sequenced inserts with a target edit log size of ${targetEditLogSize}`,
-            benchmarkFn: () => {
-                const log = new EditLog(undefined, undefined, undefined, targetEditLogSize);
-                edits.forEach((edit) => {
-                    log.addSequencedEdit(edit, { sequenceNumber: 1, referenceSequenceNumber: 0 });
-                });
-            },
-        });
-    });
-});
-//# sourceMappingURL=EditLog.perf.tests.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"EditLog.perf.tests.js","sourceRoot":"","sources":["../../src/test/EditLog.perf.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAClE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAC;AACxC,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAE7D,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,MAAM,aAAa,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;IAE/C,aAAa,CAAC,OAAO,CAAC,CAAC,eAAe,EAAE,EAAE;QACzC,MAAM,KAAK,GAAmB,EAAE,CAAC;QAEjC,MAAM,QAAQ,GAAG,aAAa,EAAE,CAAC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,EAAE,CAAC,EAAE,EAAE;YACzC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,SAAS,EAAE,EAAE,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;SAC1G;QAED,SAAS,CAAC;YACT,IAAI,EAAE,aAAa,CAAC,WAAW;YAC/B,KAAK,EAAE,WAAW,eAAe,oBAAoB;YACrD,WAAW,EAAE,GAAG,EAAE;gBACjB,MAAM,GAAG,GAAG,IAAI,OAAO,EAAE,CAAC;gBAE1B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBACtB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC/E,CAAC,CAAC,CAAC;YACJ,CAAC;SACD,CAAC,CAAC;QAEH,MAAM,iBAAiB,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;QAC1D,SAAS,CAAC;YACT,IAAI,EAAE,aAAa,CAAC,WAAW;YAC/B,KAAK,EAAE,WAAW,eAAe,qDAAqD,iBAAiB,EAAE;YACzG,WAAW,EAAE,GAAG,EAAE;gBACjB,MAAM,GAAG,GAAG,IAAI,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE,iBAAiB,CAAC,CAAC;gBAE5E,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBACtB,GAAG,CAAC,gBAAgB,CAAC,IAAI,EAAE,EAAE,cAAc,EAAE,CAAC,EAAE,uBAAuB,EAAE,CAAC,EAAE,CAAC,CAAC;gBAC/E,CAAC,CAAC,CAAC;YACJ,CAAC;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 { benchmark, BenchmarkType } from '@fluid-tools/benchmark';\nimport { Change, StablePlace } from '../ChangeTypes.js';\nimport { EditLog } from '../EditLog.js';\nimport { newEdit } from '../EditUtilities.js';\nimport { Edit } from '../persisted-types/index.js';\nimport { setUpTestTree } from './utilities/TestUtilities.js';\n\ndescribe('EditLog Perf', () => {\n\tconst insertNumbers = [10, 50, 100, 500, 1000];\n\n\tinsertNumbers.forEach((numberOfInserts) => {\n\t\tconst edits: Edit<Change>[] = [];\n\n\t\tconst testTree = setUpTestTree();\n\t\tfor (let i = 0; i < numberOfInserts; i++) {\n\t\t\tedits.push(newEdit(Change.insertTree(testTree.buildLeaf(), StablePlace.atEndOf(testTree.traitLocation))));\n\t\t}\n\n\t\tbenchmark({\n\t\t\ttype: BenchmarkType.Measurement,\n\t\t\ttitle: `process ${numberOfInserts} sequenced inserts`,\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tconst log = new EditLog();\n\n\t\t\t\tedits.forEach((edit) => {\n\t\t\t\t\tlog.addSequencedEdit(edit, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\n\t\tconst targetEditLogSize = Math.floor(numberOfInserts / 4);\n\t\tbenchmark({\n\t\t\ttype: BenchmarkType.Measurement,\n\t\t\ttitle: `process ${numberOfInserts} sequenced inserts with a target edit log size of ${targetEditLogSize}`,\n\t\t\tbenchmarkFn: () => {\n\t\t\t\tconst log = new EditLog(undefined, undefined, undefined, targetEditLogSize);\n\n\t\t\t\tedits.forEach((edit) => {\n\t\t\t\t\tlog.addSequencedEdit(edit, { sequenceNumber: 1, referenceSequenceNumber: 0 });\n\t\t\t\t});\n\t\t\t},\n\t\t});\n\t});\n});\n"]}

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

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

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

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