@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/lib/test/feature-libraries/mapTreeCursor.spec.js

@@ -1,8 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { mapTreeFromCursor, cursorForMapTreeNode } from "../../feature-libraries/index.js";
-import { testGeneralPurposeTreeCursor } from "../cursorTestSuite.js";
-testGeneralPurposeTreeCursor("mapTreeCursor", cursorForMapTreeNode, mapTreeFromCursor);
-//# sourceMappingURL=mapTreeCursor.spec.js.map

package/lib/test/feature-libraries/mapTreeCursor.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mapTreeCursor.spec.js","sourceRoot":"","sources":["../../../src/test/feature-libraries/mapTreeCursor.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,iBAAiB,EAAE,oBAAoB,EAAE,MAAM,kCAAkC,CAAC;AAC3F,OAAO,EAAE,4BAA4B,EAAE,MAAM,uBAAuB,CAAC;AAErE,4BAA4B,CAAC,eAAe,EAAE,oBAAoB,EAAE,iBAAiB,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { mapTreeFromCursor, cursorForMapTreeNode } from \"../../feature-libraries/index.js\";\nimport { testGeneralPurposeTreeCursor } from \"../cursorTestSuite.js\";\n\ntestGeneralPurposeTreeCursor(\"mapTreeCursor\", cursorForMapTreeNode, mapTreeFromCursor);\n"]}

package/lib/test/feature-libraries/memoizedIdRangeAllocator.spec.d.ts

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

package/lib/test/feature-libraries/memoizedIdRangeAllocator.spec.d.ts.map

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

package/lib/test/feature-libraries/memoizedIdRangeAllocator.spec.js

@@ -1,80 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { MemoizedIdRangeAllocator } from "../../feature-libraries/index.js";
-import { brand } from "../../util/index.js";
-import { mintRevisionTag } from "../utils.js";
-const tag1 = mintRevisionTag();
-const tag2 = mintRevisionTag();
-describe("MemoizedIdRangeAllocator", () => {
-    it("Allocates unique IDs given unique inputs", () => {
-        const allocator = MemoizedIdRangeAllocator.fromNextId();
-        const id0 = allocator.allocate(tag1, brand(0), 1);
-        const id12 = allocator.allocate(tag1, brand(1), 2);
-        const id3 = allocator.allocate(tag2, brand(0), 1);
-        assert.deepEqual(id0, [{ first: 0, count: 1 }]);
-        assert.deepEqual(id12, [{ first: 1, count: 2 }]);
-        assert.deepEqual(id3, [{ first: 3, count: 1 }]);
-    });
-    it("Returns the same IDs given the same inputs", () => {
-        const allocator = MemoizedIdRangeAllocator.fromNextId();
-        const fst_id0 = allocator.allocate(tag1, brand(0), 1);
-        const fst_id12 = allocator.allocate(tag1, brand(1), 2);
-        const fst_id3 = allocator.allocate(tag2, brand(0), 1);
-        const snd_id0 = allocator.allocate(tag1, brand(0), 1);
-        const snd_id12 = allocator.allocate(tag1, brand(1), 2);
-        const snd_id3 = allocator.allocate(tag2, brand(0), 1);
-        assert.deepEqual(fst_id0, snd_id0);
-        assert.deepEqual(fst_id12, snd_id12);
-        assert.deepEqual(fst_id3, snd_id3);
-    });
-    it("Handles subset range overlaps", () => {
-        const allocator = MemoizedIdRangeAllocator.fromNextId(1);
-        const id123456 = allocator.allocate(tag1, brand(1), 6);
-        assert.deepEqual(id123456, [{ first: 1, count: 6 }]);
-        const id23 = allocator.allocate(tag1, brand(2), 2);
-        const expected = [{ first: 2, count: 2 }];
-        assert.deepEqual(id23, expected);
-    });
-    it("Handles superset range overlaps", () => {
-        const allocator = MemoizedIdRangeAllocator.fromNextId(1);
-        const id23 = allocator.allocate(tag1, brand(2), 2);
-        assert.deepEqual(id23, [{ first: 1, count: 2 }]);
-        const id123456 = allocator.allocate(tag1, brand(1), 6);
-        const expected = [
-            { first: 3, count: 1 },
-            { first: 1, count: 2 },
-            { first: 4, count: 3 },
-        ];
-        assert.deepEqual(id123456, expected);
-    });
-    it("Can extend an existing range when valid", () => {
-        const allocator = MemoizedIdRangeAllocator.fromNextId(1);
-        const id1 = allocator.allocate(tag1, brand(1), 1);
-        assert.deepEqual(id1, [{ first: 1, count: 1 }]);
-        const id123 = allocator.allocate(tag1, brand(1), 3);
-        assert.deepEqual(id123, [{ first: 1, count: 3 }]);
-        const id4 = allocator.allocate(tag2, brand(1), 1);
-        assert.deepEqual(id4, [{ first: 4, count: 1 }]);
-        const id1234 = allocator.allocate(tag1, brand(1), 4);
-        assert.deepEqual(id1234, [
-            { first: 1, count: 3 },
-            { first: 5, count: 1 },
-        ]);
-    });
-    it("can mint ID ranges with only a count", () => {
-        const allocator = MemoizedIdRangeAllocator.fromNextId(1);
-        const id1 = allocator.mint(1);
-        const expectedId1 = brand(1);
-        assert.deepEqual(id1, expectedId1);
-        const id234 = allocator.mint(3);
-        const expectedId234 = brand(2);
-        assert.deepEqual(id234, expectedId234);
-        const id5 = allocator.mint(1);
-        const expectedId5 = brand(5);
-        assert.deepEqual(id5, expectedId5);
-    });
-});
-//# sourceMappingURL=memoizedIdRangeAllocator.spec.js.map

package/lib/test/feature-libraries/memoizedIdRangeAllocator.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"memoizedIdRangeAllocator.spec.js","sourceRoot":"","sources":["../../../src/test/feature-libraries/memoizedIdRangeAllocator.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,wBAAwB,EAAE,MAAM,kCAAkC,CAAC;AAE5E,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAE9C,MAAM,IAAI,GAAgB,eAAe,EAAE,CAAC;AAC5C,MAAM,IAAI,GAAgB,eAAe,EAAE,CAAC;AAE5C,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACzC,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,EAAE,CAAC;QACxD,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACrD,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,EAAE,CAAC;QACxD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACnC,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrC,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC1C,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAC1C,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnD,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjD,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG;YAChB,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YACtB,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YACtB,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;SACtB,CAAC;QACF,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QAClD,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,GAAG,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE;YACxB,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;YACtB,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE;SACtB,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,MAAM,SAAS,GAAG,wBAAwB,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,WAAW,GAAqB,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,aAAa,GAAqB,KAAK,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,WAAW,GAAqB,KAAK,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IACpC,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 { strict as assert } from \"assert\";\nimport { MemoizedIdRangeAllocator } from \"../../feature-libraries/index.js\";\nimport { ChangesetLocalId, RevisionTag } from \"../../core/index.js\";\nimport { brand } from \"../../util/index.js\";\nimport { mintRevisionTag } from \"../utils.js\";\n\nconst tag1: RevisionTag = mintRevisionTag();\nconst tag2: RevisionTag = mintRevisionTag();\n\ndescribe(\"MemoizedIdRangeAllocator\", () => {\n\tit(\"Allocates unique IDs given unique inputs\", () => {\n\t\tconst allocator = MemoizedIdRangeAllocator.fromNextId();\n\t\tconst id0 = allocator.allocate(tag1, brand(0), 1);\n\t\tconst id12 = allocator.allocate(tag1, brand(1), 2);\n\t\tconst id3 = allocator.allocate(tag2, brand(0), 1);\n\t\tassert.deepEqual(id0, [{ first: 0, count: 1 }]);\n\t\tassert.deepEqual(id12, [{ first: 1, count: 2 }]);\n\t\tassert.deepEqual(id3, [{ first: 3, count: 1 }]);\n\t});\n\n\tit(\"Returns the same IDs given the same inputs\", () => {\n\t\tconst allocator = MemoizedIdRangeAllocator.fromNextId();\n\t\tconst fst_id0 = allocator.allocate(tag1, brand(0), 1);\n\t\tconst fst_id12 = allocator.allocate(tag1, brand(1), 2);\n\t\tconst fst_id3 = allocator.allocate(tag2, brand(0), 1);\n\t\tconst snd_id0 = allocator.allocate(tag1, brand(0), 1);\n\t\tconst snd_id12 = allocator.allocate(tag1, brand(1), 2);\n\t\tconst snd_id3 = allocator.allocate(tag2, brand(0), 1);\n\t\tassert.deepEqual(fst_id0, snd_id0);\n\t\tassert.deepEqual(fst_id12, snd_id12);\n\t\tassert.deepEqual(fst_id3, snd_id3);\n\t});\n\n\tit(\"Handles subset range overlaps\", () => {\n\t\tconst allocator = MemoizedIdRangeAllocator.fromNextId(1);\n\t\tconst id123456 = allocator.allocate(tag1, brand(1), 6);\n\t\tassert.deepEqual(id123456, [{ first: 1, count: 6 }]);\n\t\tconst id23 = allocator.allocate(tag1, brand(2), 2);\n\t\tconst expected = [{ first: 2, count: 2 }];\n\t\tassert.deepEqual(id23, expected);\n\t});\n\n\tit(\"Handles superset range overlaps\", () => {\n\t\tconst allocator = MemoizedIdRangeAllocator.fromNextId(1);\n\t\tconst id23 = allocator.allocate(tag1, brand(2), 2);\n\t\tassert.deepEqual(id23, [{ first: 1, count: 2 }]);\n\t\tconst id123456 = allocator.allocate(tag1, brand(1), 6);\n\t\tconst expected = [\n\t\t\t{ first: 3, count: 1 },\n\t\t\t{ first: 1, count: 2 },\n\t\t\t{ first: 4, count: 3 },\n\t\t];\n\t\tassert.deepEqual(id123456, expected);\n\t});\n\n\tit(\"Can extend an existing range when valid\", () => {\n\t\tconst allocator = MemoizedIdRangeAllocator.fromNextId(1);\n\t\tconst id1 = allocator.allocate(tag1, brand(1), 1);\n\t\tassert.deepEqual(id1, [{ first: 1, count: 1 }]);\n\t\tconst id123 = allocator.allocate(tag1, brand(1), 3);\n\t\tassert.deepEqual(id123, [{ first: 1, count: 3 }]);\n\t\tconst id4 = allocator.allocate(tag2, brand(1), 1);\n\t\tassert.deepEqual(id4, [{ first: 4, count: 1 }]);\n\t\tconst id1234 = allocator.allocate(tag1, brand(1), 4);\n\t\tassert.deepEqual(id1234, [\n\t\t\t{ first: 1, count: 3 },\n\t\t\t{ first: 5, count: 1 },\n\t\t]);\n\t});\n\n\tit(\"can mint ID ranges with only a count\", () => {\n\t\tconst allocator = MemoizedIdRangeAllocator.fromNextId(1);\n\t\tconst id1 = allocator.mint(1);\n\t\tconst expectedId1: ChangesetLocalId = brand(1);\n\t\tassert.deepEqual(id1, expectedId1);\n\t\tconst id234 = allocator.mint(3);\n\t\tconst expectedId234: ChangesetLocalId = brand(2);\n\t\tassert.deepEqual(id234, expectedId234);\n\t\tconst id5 = allocator.mint(1);\n\t\tconst expectedId5: ChangesetLocalId = brand(5);\n\t\tassert.deepEqual(id5, expectedId5);\n\t});\n});\n"]}

package/lib/test/feature-libraries/mitigatedChangeFamily.spec.d.ts

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

package/lib/test/feature-libraries/mitigatedChangeFamily.spec.d.ts.map

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

package/lib/test/feature-libraries/mitigatedChangeFamily.spec.js

@@ -1,96 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { makeMitigatedChangeFamily } from "../../feature-libraries/index.js";
-const fallback = "Fallback";
-const arg1 = "arg1";
-const arg2 = "arg2";
-const arg3 = "arg3";
-const throwingFamily = {
-    buildEditor: (changeReceiver) => {
-        assert.equal(changeReceiver, arg1);
-        throw new Error("buildEditor");
-    },
-    rebaser: {
-        compose: (changes) => {
-            assert.equal(changes, arg1);
-            throw new Error("compose");
-        },
-        invert: (change, isRollback) => {
-            assert.equal(change, arg1);
-            assert.equal(isRollback, arg2);
-            throw new Error("invert");
-        },
-        rebase: (change, over) => {
-            assert.equal(change, arg1);
-            assert.equal(over, arg2);
-            throw new Error("rebase");
-        },
-    },
-    codecs: {},
-};
-const returningFamily = {
-    buildEditor: (changeReceiver) => {
-        assert.equal(changeReceiver, arg1);
-        return "buildEditor";
-    },
-    rebaser: {
-        compose: (changes) => {
-            assert.equal(changes, arg1);
-            return "compose";
-        },
-        invert: (change, isRollback) => {
-            assert.equal(change, arg1);
-            assert.equal(isRollback, arg2);
-            return "invert";
-        },
-        rebase: (change, over) => {
-            assert.equal(change, arg1);
-            assert.equal(over, arg2);
-            return "rebase";
-        },
-    },
-    codecs: {},
-};
-const errorLog = [];
-const mitigatedThrowingFamily = makeMitigatedChangeFamily(throwingFamily, fallback, (error) => errorLog.push(error.message));
-const mitigatedReturningFamily = makeMitigatedChangeFamily(returningFamily, fallback, () => assert.fail("Unexpected onError call"));
-const mitigatedReturningRebaser = mitigatedReturningFamily.rebaser;
-const mitigatedThrowingRebaser = mitigatedThrowingFamily.rebaser;
-const returningRebaser = returningFamily.rebaser;
-describe("makeMitigatedChangeFamily", () => {
-    it("does not interfere so long as nothing is thrown", () => {
-        assert.equal(mitigatedReturningFamily.buildEditor(arg1), returningFamily.buildEditor(arg1));
-        assert.equal(mitigatedReturningRebaser.rebase(arg1, arg2, arg3), returningRebaser.rebase(arg1, arg2, arg3));
-        assert.equal(mitigatedReturningRebaser.invert(arg1, arg2), returningRebaser.invert(arg1, arg2));
-        assert.equal(mitigatedReturningRebaser.compose(arg1), returningRebaser.compose(arg1));
-    });
-    describe("catches errors from", () => {
-        it("rebase", () => {
-            errorLog.length = 0;
-            assert.equal(mitigatedThrowingRebaser.rebase(arg1, arg2, arg3), fallback);
-            assert.deepEqual(errorLog, ["rebase"]);
-        });
-        it("invert", () => {
-            errorLog.length = 0;
-            assert.equal(mitigatedThrowingRebaser.invert(arg1, arg2), fallback);
-            assert.deepEqual(errorLog, ["invert"]);
-        });
-        it("compose", () => {
-            errorLog.length = 0;
-            assert.equal(mitigatedThrowingRebaser.compose(arg1), fallback);
-            assert.deepEqual(errorLog, ["compose"]);
-        });
-    });
-    it("does not catch errors from buildEditor", () => {
-        errorLog.length = 0;
-        assert.throws(() => mitigatedThrowingFamily.buildEditor(arg1), new Error("buildEditor"));
-        assert.deepEqual(errorLog, []);
-    });
-    it("does affect codecs", () => {
-        assert.equal(mitigatedReturningFamily.codecs, returningFamily.codecs);
-    });
-});
-//# sourceMappingURL=mitigatedChangeFamily.spec.js.map

package/lib/test/feature-libraries/mitigatedChangeFamily.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mitigatedChangeFamily.spec.js","sourceRoot":"","sources":["../../../src/test/feature-libraries/mitigatedChangeFamily.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EAAE,yBAAyB,EAAE,MAAM,kCAAkC,CAAC;AAE7E,MAAM,QAAQ,GAAG,UAAU,CAAC;AAC5B,MAAM,IAAI,GAAQ,MAAM,CAAC;AACzB,MAAM,IAAI,GAAQ,MAAM,CAAC;AACzB,MAAM,IAAI,GAAQ,MAAM,CAAC;AAEzB,MAAM,cAAc,GAA6C;IAChE,WAAW,EAAE,CAAC,cAAwC,EAAsB,EAAE;QAC7E,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACnC,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,EAAE;QACR,OAAO,EAAE,CAAC,OAA+B,EAAU,EAAE;YACpD,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,EAAE,CAAC,MAA4B,EAAE,UAAmB,EAAU,EAAE;YACrE,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;QACD,MAAM,EAAE,CAAC,MAAc,EAAE,IAA0B,EAAU,EAAE;YAC9D,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACzB,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC3B,CAAC;KACD;IACD,MAAM,EAAE,EAAS;CACjB,CAAC;AACF,MAAM,eAAe,GAA6C;IACjE,WAAW,EAAE,CAAC,cAAwC,EAAsB,EAAE;QAC7E,MAAM,CAAC,KAAK,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;QACnC,OAAO,aAA8C,CAAC;IACvD,CAAC;IACD,OAAO,EAAE;QACR,OAAO,EAAE,CAAC,OAA+B,EAAU,EAAE;YACpD,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YAC5B,OAAO,SAAS,CAAC;QAClB,CAAC;QACD,MAAM,EAAE,CAAC,MAA4B,EAAE,UAAmB,EAAU,EAAE;YACrE,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;YAC/B,OAAO,QAAQ,CAAC;QACjB,CAAC;QACD,MAAM,EAAE,CAAC,MAAc,EAAE,IAA0B,EAAU,EAAE;YAC9D,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACzB,OAAO,QAAQ,CAAC;QACjB,CAAC;KACD;IACD,MAAM,EAAE,EAAS;CACjB,CAAC;AAEF,MAAM,QAAQ,GAAc,EAAE,CAAC;AAC/B,MAAM,uBAAuB,GAAG,yBAAyB,CAAC,cAAc,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,EAAE,CAC7F,QAAQ,CAAC,IAAI,CAAE,KAAe,CAAC,OAAO,CAAC,CACvC,CAAC;AACF,MAAM,wBAAwB,GAAG,yBAAyB,CAAC,eAAe,EAAE,QAAQ,EAAE,GAAG,EAAE,CAC1F,MAAM,CAAC,IAAI,CAAC,yBAAyB,CAAC,CACtC,CAAC;AACF,MAAM,yBAAyB,GAAG,wBAAwB,CAAC,OAAO,CAAC;AACnE,MAAM,wBAAwB,GAAG,uBAAuB,CAAC,OAAO,CAAC;AACjE,MAAM,gBAAgB,GAAG,eAAe,CAAC,OAAO,CAAC;AAEjD,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;IAC1C,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QAC1D,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,eAAe,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5F,MAAM,CAAC,KAAK,CACX,yBAAyB,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAClD,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CACzC,CAAC;QACF,MAAM,CAAC,KAAK,CACX,yBAAyB,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,EAC5C,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CACnC,CAAC;QACF,MAAM,CAAC,KAAK,CAAC,yBAAyB,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,gBAAgB,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;IACvF,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACpC,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;YACjB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC1E,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,QAAQ,EAAE,GAAG,EAAE;YACjB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;YACpE,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,SAAS,EAAE,GAAG,EAAE;YAClB,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YACpB,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC/D,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QACjD,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACpB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,uBAAuB,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;QACzF,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC7B,MAAM,CAAC,KAAK,CAAC,wBAAwB,CAAC,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;IACvE,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 { strict as assert } from \"assert\";\nimport { ChangeFamily, ChangeFamilyEditor, TaggedChange } from \"../../core/index.js\";\nimport { makeMitigatedChangeFamily } from \"../../feature-libraries/index.js\";\n\nconst fallback = \"Fallback\";\nconst arg1: any = \"arg1\";\nconst arg2: any = \"arg2\";\nconst arg3: any = \"arg3\";\n\nconst throwingFamily: ChangeFamily<ChangeFamilyEditor, string> = {\n\tbuildEditor: (changeReceiver: (change: string) => void): ChangeFamilyEditor => {\n\t\tassert.equal(changeReceiver, arg1);\n\t\tthrow new Error(\"buildEditor\");\n\t},\n\trebaser: {\n\t\tcompose: (changes: TaggedChange<string>[]): string => {\n\t\t\tassert.equal(changes, arg1);\n\t\t\tthrow new Error(\"compose\");\n\t\t},\n\t\tinvert: (change: TaggedChange<string>, isRollback: boolean): string => {\n\t\t\tassert.equal(change, arg1);\n\t\t\tassert.equal(isRollback, arg2);\n\t\t\tthrow new Error(\"invert\");\n\t\t},\n\t\trebase: (change: string, over: TaggedChange<string>): string => {\n\t\t\tassert.equal(change, arg1);\n\t\t\tassert.equal(over, arg2);\n\t\t\tthrow new Error(\"rebase\");\n\t\t},\n\t},\n\tcodecs: {} as any,\n};\nconst returningFamily: ChangeFamily<ChangeFamilyEditor, string> = {\n\tbuildEditor: (changeReceiver: (change: string) => void): ChangeFamilyEditor => {\n\t\tassert.equal(changeReceiver, arg1);\n\t\treturn \"buildEditor\" as unknown as ChangeFamilyEditor;\n\t},\n\trebaser: {\n\t\tcompose: (changes: TaggedChange<string>[]): string => {\n\t\t\tassert.equal(changes, arg1);\n\t\t\treturn \"compose\";\n\t\t},\n\t\tinvert: (change: TaggedChange<string>, isRollback: boolean): string => {\n\t\t\tassert.equal(change, arg1);\n\t\t\tassert.equal(isRollback, arg2);\n\t\t\treturn \"invert\";\n\t\t},\n\t\trebase: (change: string, over: TaggedChange<string>): string => {\n\t\t\tassert.equal(change, arg1);\n\t\t\tassert.equal(over, arg2);\n\t\t\treturn \"rebase\";\n\t\t},\n\t},\n\tcodecs: {} as any,\n};\n\nconst errorLog: unknown[] = [];\nconst mitigatedThrowingFamily = makeMitigatedChangeFamily(throwingFamily, fallback, (error) =>\n\terrorLog.push((error as Error).message),\n);\nconst mitigatedReturningFamily = makeMitigatedChangeFamily(returningFamily, fallback, () =>\n\tassert.fail(\"Unexpected onError call\"),\n);\nconst mitigatedReturningRebaser = mitigatedReturningFamily.rebaser;\nconst mitigatedThrowingRebaser = mitigatedThrowingFamily.rebaser;\nconst returningRebaser = returningFamily.rebaser;\n\ndescribe(\"makeMitigatedChangeFamily\", () => {\n\tit(\"does not interfere so long as nothing is thrown\", () => {\n\t\tassert.equal(mitigatedReturningFamily.buildEditor(arg1), returningFamily.buildEditor(arg1));\n\t\tassert.equal(\n\t\t\tmitigatedReturningRebaser.rebase(arg1, arg2, arg3),\n\t\t\treturningRebaser.rebase(arg1, arg2, arg3),\n\t\t);\n\t\tassert.equal(\n\t\t\tmitigatedReturningRebaser.invert(arg1, arg2),\n\t\t\treturningRebaser.invert(arg1, arg2),\n\t\t);\n\t\tassert.equal(mitigatedReturningRebaser.compose(arg1), returningRebaser.compose(arg1));\n\t});\n\tdescribe(\"catches errors from\", () => {\n\t\tit(\"rebase\", () => {\n\t\t\terrorLog.length = 0;\n\t\t\tassert.equal(mitigatedThrowingRebaser.rebase(arg1, arg2, arg3), fallback);\n\t\t\tassert.deepEqual(errorLog, [\"rebase\"]);\n\t\t});\n\t\tit(\"invert\", () => {\n\t\t\terrorLog.length = 0;\n\t\t\tassert.equal(mitigatedThrowingRebaser.invert(arg1, arg2), fallback);\n\t\t\tassert.deepEqual(errorLog, [\"invert\"]);\n\t\t});\n\t\tit(\"compose\", () => {\n\t\t\terrorLog.length = 0;\n\t\t\tassert.equal(mitigatedThrowingRebaser.compose(arg1), fallback);\n\t\t\tassert.deepEqual(errorLog, [\"compose\"]);\n\t\t});\n\t});\n\tit(\"does not catch errors from buildEditor\", () => {\n\t\terrorLog.length = 0;\n\t\tassert.throws(() => mitigatedThrowingFamily.buildEditor(arg1), new Error(\"buildEditor\"));\n\t\tassert.deepEqual(errorLog, []);\n\t});\n\tit(\"does affect codecs\", () => {\n\t\tassert.equal(mitigatedReturningFamily.codecs, returningFamily.codecs);\n\t});\n});\n"]}

package/lib/test/feature-libraries/modular-schema/basicRebasers.d.ts

@@ -1,44 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FieldChangeRebaser, FieldKindWithEditor } from "../../../feature-libraries/modular-schema/index.js";
-import { ChangeEncodingContext, DeltaFieldChanges } from "../../../core/index.js";
-import { Multiplicity } from "../../../feature-libraries/index.js";
-/**
- * Picks the last value written.
- *
- * TODO: it seems impossible for this to obey the desired axioms.
- * Specifically inverse needs to cancel, restoring the value from the previous change which was discarded.
- */
-export declare function lastWriteWinsRebaser<TChange>(data: {
-    noop: TChange;
-    invert: (changes: TChange) => TChange;
-}): FieldChangeRebaser<TChange>;
-export interface Replacement<T> {
-    old: T;
-    new: T;
-}
-export type ReplaceOp<T> = Replacement<T> | 0;
-/**
- * Picks the last value written.
- *
- * Consistent if used on valid paths with correct old states.
- */
-export declare function replaceRebaser<T>(): FieldChangeRebaser<ReplaceOp<T>>;
-export type ValueChangeset = ReplaceOp<number>;
-export declare const valueHandler: {
-    rebaser: FieldChangeRebaser<ReplaceOp<number>>;
-    codecsFactory: () => import("../../../codec/codec.js").ICodecFamily<ValueChangeset, ChangeEncodingContext>;
-    editor: {
-        buildChildChange: (index: number, change: import("../../../feature-libraries/index.js").NodeChangeset) => never;
-    };
-    intoDelta: ({ change, revision }: import("../../../core/index.js").TaggedChange<ValueChangeset>) => DeltaFieldChanges;
-    relevantRemovedRoots: (change: import("../../../core/index.js").TaggedChange<ValueChangeset>) => never[];
-    isEmpty: (change: ValueChangeset) => boolean;
-    createEmpty: () => 0;
-};
-export declare const valueField: FieldKindWithEditor<{
-    buildChildChange: (index: number, change: import("../../../feature-libraries/index.js").NodeChangeset) => never;
-}, Multiplicity.Single, "Value">;
-//# sourceMappingURL=basicRebasers.d.ts.map

package/lib/test/feature-libraries/modular-schema/basicRebasers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"basicRebasers.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/basicRebasers.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAEN,kBAAkB,EAClB,mBAAmB,EAGnB,MAAM,oDAAoD,CAAC;AAG5D,OAAO,EACN,qBAAqB,EACrB,iBAAiB,EAEjB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AAGnE;;;;;GAKG;AACH,wBAAgB,oBAAoB,CAAC,OAAO,EAAE,IAAI,EAAE;IACnD,IAAI,EAAE,OAAO,CAAC;IACd,MAAM,EAAE,CAAC,OAAO,EAAE,OAAO,KAAK,OAAO,CAAC;CACtC,GAAG,kBAAkB,CAAC,OAAO,CAAC,CAI9B;AAED,MAAM,WAAW,WAAW,CAAC,CAAC;IAC7B,GAAG,EAAE,CAAC,CAAC;IACP,GAAG,EAAE,CAAC,CAAC;CACP;AAED,MAAM,MAAM,SAAS,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAE9C;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,CAAC,KAAK,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAwBpE;AAED,MAAM,MAAM,cAAc,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;AAE/C,eAAO,MAAM,YAAY;;;;;;wGAQW,iBAAiB;;;;CAeP,CAAC;AAE/C,eAAO,MAAM,UAAU;;gCAMtB,CAAC"}

package/lib/test/feature-libraries/modular-schema/basicRebasers.js

@@ -1,77 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { Type } from "@sinclair/typebox";
-import { FieldKindWithEditor, referenceFreeFieldChangeRebaser,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/modular-schema/index.js";
-import { fail } from "../../../util/index.js";
-import { makeCodecFamily } from "../../../codec/index.js";
-import { makeDetachedNodeId, } from "../../../core/index.js";
-import { Multiplicity } from "../../../feature-libraries/index.js";
-import { makeValueCodec } from "../../codec/index.js";
-/**
- * Picks the last value written.
- *
- * TODO: it seems impossible for this to obey the desired axioms.
- * Specifically inverse needs to cancel, restoring the value from the previous change which was discarded.
- */
-export function lastWriteWinsRebaser(data) {
-    const compose = (_change1, change2) => change2;
-    const rebase = (change, _over) => change;
-    return referenceFreeFieldChangeRebaser({ ...data, compose, rebase });
-}
-/**
- * Picks the last value written.
- *
- * Consistent if used on valid paths with correct old states.
- */
-export function replaceRebaser() {
-    return referenceFreeFieldChangeRebaser({
-        rebase: (change, over) => {
-            if (change === 0) {
-                return 0;
-            }
-            if (over === 0) {
-                return change;
-            }
-            return { old: over.new, new: change.new };
-        },
-        compose: (change1, change2) => {
-            if (change1 === 0) {
-                return change2;
-            }
-            else if (change2 === 0) {
-                return change1;
-            }
-            return { old: change1.old, new: change2.new };
-        },
-        invert: (changes) => {
-            return changes === 0 ? 0 : { old: changes.new, new: changes.old };
-        },
-    });
-}
-export const valueHandler = {
-    rebaser: replaceRebaser(),
-    codecsFactory: () => makeCodecFamily([
-        [0, makeValueCodec(Type.Any())],
-    ]),
-    editor: { buildChildChange: (index, change) => fail("Child changes not supported") },
-    intoDelta: ({ change, revision }) => {
-        const delta = {};
-        if (change !== 0) {
-            // We use the new and old numbers as the node ids.
-            // These would have no real meaning to a delta consumer, but these delta are only used for testing.
-            const detach = makeDetachedNodeId(revision, change.old);
-            const attach = makeDetachedNodeId(revision, change.new);
-            delta.local = [{ count: 1, attach, detach }];
-        }
-        return delta;
-    },
-    relevantRemovedRoots: (change) => [],
-    isEmpty: (change) => change === 0,
-    createEmpty: () => 0,
-};
-export const valueField = new FieldKindWithEditor("Value", Multiplicity.Single, valueHandler, (a, b) => false, new Set());
-//# sourceMappingURL=basicRebasers.js.map

package/lib/test/feature-libraries/modular-schema/basicRebasers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"basicRebasers.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/basicRebasers.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAW,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAGN,mBAAmB,EACnB,+BAA+B;AAC/B,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAW,IAAI,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC1D,OAAO,EAGN,kBAAkB,GAClB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,YAAY,EAAE,MAAM,qCAAqC,CAAC;AACnE,OAAO,EAAE,cAAc,EAAE,MAAM,sBAAsB,CAAC;AAEtD;;;;;GAKG;AACH,MAAM,UAAU,oBAAoB,CAAU,IAG7C;IACA,MAAM,OAAO,GAAG,CAAC,QAAiB,EAAE,OAAgB,EAAE,EAAE,CAAC,OAAO,CAAC;IACjE,MAAM,MAAM,GAAG,CAAC,MAAe,EAAE,KAAc,EAAE,EAAE,CAAC,MAAM,CAAC;IAC3D,OAAO,+BAA+B,CAAC,EAAE,GAAG,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;AACtE,CAAC;AASD;;;;GAIG;AACH,MAAM,UAAU,cAAc;IAC7B,OAAO,+BAA+B,CAAC;QACtC,MAAM,EAAE,CAAC,MAAoB,EAAE,IAAkB,EAAE,EAAE;YACpD,IAAI,MAAM,KAAK,CAAC,EAAE;gBACjB,OAAO,CAAC,CAAC;aACT;YACD,IAAI,IAAI,KAAK,CAAC,EAAE;gBACf,OAAO,MAAM,CAAC;aACd;YACD,OAAO,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC;QAC3C,CAAC;QACD,OAAO,EAAE,CAAC,OAAqB,EAAE,OAAqB,EAAE,EAAE;YACzD,IAAI,OAAO,KAAK,CAAC,EAAE;gBAClB,OAAO,OAAO,CAAC;aACf;iBAAM,IAAI,OAAO,KAAK,CAAC,EAAE;gBACzB,OAAO,OAAO,CAAC;aACf;YAED,OAAO,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QAC/C,CAAC;QACD,MAAM,EAAE,CAAC,OAAqB,EAAE,EAAE;YACjC,OAAO,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,GAAG,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;QACnE,CAAC;KACD,CAAC,CAAC;AACJ,CAAC;AAID,MAAM,CAAC,MAAM,YAAY,GAAG;IAC3B,OAAO,EAAE,cAAc,EAAE;IACzB,aAAa,EAAE,GAAG,EAAE,CACnB,eAAe,CAAC;QACf,CAAC,CAAC,EAAE,cAAc,CAAiD,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;KAC/E,CAAC;IACH,MAAM,EAAE,EAAE,gBAAgB,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,6BAA6B,CAAC,EAAE;IAEpF,SAAS,EAAE,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAqB,EAAE;QACtD,MAAM,KAAK,GAA+B,EAAE,CAAC;QAC7C,IAAI,MAAM,KAAK,CAAC,EAAE;YACjB,kDAAkD;YAClD,mGAAmG;YACnG,MAAM,MAAM,GAAG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;YACxD,MAAM,MAAM,GAAG,kBAAkB,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC;YACxD,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;SAC7C;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,oBAAoB,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;IACpC,OAAO,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,KAAK,CAAC;IACjC,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;CACyB,CAAC;AAE/C,MAAM,CAAC,MAAM,UAAU,GAAG,IAAI,mBAAmB,CAChD,OAAO,EACP,YAAY,CAAC,MAAM,EACnB,YAAY,EACZ,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,EACf,IAAI,GAAG,EAAE,CACT,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { TUnsafe, Type } from \"@sinclair/typebox\";\nimport {\n\tFieldChangeHandler,\n\tFieldChangeRebaser,\n\tFieldKindWithEditor,\n\treferenceFreeFieldChangeRebaser,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/modular-schema/index.js\";\nimport { Mutable, fail } from \"../../../util/index.js\";\nimport { makeCodecFamily } from \"../../../codec/index.js\";\nimport {\n\tChangeEncodingContext,\n\tDeltaFieldChanges,\n\tmakeDetachedNodeId,\n} from \"../../../core/index.js\";\nimport { Multiplicity } from \"../../../feature-libraries/index.js\";\nimport { makeValueCodec } from \"../../codec/index.js\";\n\n/**\n * Picks the last value written.\n *\n * TODO: it seems impossible for this to obey the desired axioms.\n * Specifically inverse needs to cancel, restoring the value from the previous change which was discarded.\n */\nexport function lastWriteWinsRebaser<TChange>(data: {\n\tnoop: TChange;\n\tinvert: (changes: TChange) => TChange;\n}): FieldChangeRebaser<TChange> {\n\tconst compose = (_change1: TChange, change2: TChange) => change2;\n\tconst rebase = (change: TChange, _over: TChange) => change;\n\treturn referenceFreeFieldChangeRebaser({ ...data, compose, rebase });\n}\n\nexport interface Replacement<T> {\n\told: T;\n\tnew: T;\n}\n\nexport type ReplaceOp<T> = Replacement<T> | 0;\n\n/**\n * Picks the last value written.\n *\n * Consistent if used on valid paths with correct old states.\n */\nexport function replaceRebaser<T>(): FieldChangeRebaser<ReplaceOp<T>> {\n\treturn referenceFreeFieldChangeRebaser({\n\t\trebase: (change: ReplaceOp<T>, over: ReplaceOp<T>) => {\n\t\t\tif (change === 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (over === 0) {\n\t\t\t\treturn change;\n\t\t\t}\n\t\t\treturn { old: over.new, new: change.new };\n\t\t},\n\t\tcompose: (change1: ReplaceOp<T>, change2: ReplaceOp<T>) => {\n\t\t\tif (change1 === 0) {\n\t\t\t\treturn change2;\n\t\t\t} else if (change2 === 0) {\n\t\t\t\treturn change1;\n\t\t\t}\n\n\t\t\treturn { old: change1.old, new: change2.new };\n\t\t},\n\t\tinvert: (changes: ReplaceOp<T>) => {\n\t\t\treturn changes === 0 ? 0 : { old: changes.new, new: changes.old };\n\t\t},\n\t});\n}\n\nexport type ValueChangeset = ReplaceOp<number>;\n\nexport const valueHandler = {\n\trebaser: replaceRebaser(),\n\tcodecsFactory: () =>\n\t\tmakeCodecFamily([\n\t\t\t[0, makeValueCodec<TUnsafe<ValueChangeset>, ChangeEncodingContext>(Type.Any())],\n\t\t]),\n\teditor: { buildChildChange: (index, change) => fail(\"Child changes not supported\") },\n\n\tintoDelta: ({ change, revision }): DeltaFieldChanges => {\n\t\tconst delta: Mutable<DeltaFieldChanges> = {};\n\t\tif (change !== 0) {\n\t\t\t// We use the new and old numbers as the node ids.\n\t\t\t// These would have no real meaning to a delta consumer, but these delta are only used for testing.\n\t\t\tconst detach = makeDetachedNodeId(revision, change.old);\n\t\t\tconst attach = makeDetachedNodeId(revision, change.new);\n\t\t\tdelta.local = [{ count: 1, attach, detach }];\n\t\t}\n\t\treturn delta;\n\t},\n\n\trelevantRemovedRoots: (change) => [],\n\tisEmpty: (change) => change === 0,\n\tcreateEmpty: () => 0,\n} satisfies FieldChangeHandler<ValueChangeset>;\n\nexport const valueField = new FieldKindWithEditor(\n\t\"Value\",\n\tMultiplicity.Single,\n\tvalueHandler,\n\t(a, b) => false,\n\tnew Set(),\n);\n"]}

package/lib/test/feature-libraries/modular-schema/comparison.spec.d.ts

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

package/lib/test/feature-libraries/modular-schema/comparison.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"comparison.spec.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/modular-schema/comparison.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG"}