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

package/lib/test/simple-tree/objectFactory.spec.js

@@ -1,210 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-// eslint-disable-next-line import/no-internal-modules
-import { extractFactoryContent } from "../../simple-tree/proxies.js";
-import { SchemaFactory, treeNodeApi as Tree, } from "../../simple-tree/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { getFlexNode } from "../../simple-tree/flexNode.js";
-import { hydrate } from "./utils.js";
-describe("SharedTreeObject factories", () => {
-    const sb = new SchemaFactory("test");
-    const ChildA = sb.object("childA", {
-        content: sb.number,
-    });
-    const ChildB = sb.object("childB", {
-        content: sb.number,
-    });
-    const ChildOptional = sb.object("childOptional", {
-        content: sb.optional(sb.number),
-    });
-    const ChildD = sb.object("childD", {
-        list: sb.array([ChildA, ChildB]),
-        map: sb.map([ChildA, ChildB]),
-    });
-    const ChildC = sb.object("childC", {
-        child: ChildD,
-    });
-    const Schema = sb.object("parent", {
-        child: ChildA,
-        poly: [ChildA, ChildB],
-        list: sb.array(sb.number),
-        map: sb.map(sb.number),
-        optional: sb.optional(ChildOptional),
-        grand: ChildC,
-    });
-    function initialTree() {
-        return {
-            child: new ChildA({ content: 42 }),
-            poly: new ChildB({ content: 42 }),
-            list: [42, 42, 42],
-            map: new Map([
-                ["a", 0],
-                ["b", 1],
-            ]),
-            // TODO: Omit optional field once correctly supported.
-            // https://dev.azure.com/fluidframework/internal/_workitems/edit/6569
-            optional: undefined,
-            grand: {
-                child: {
-                    list: [new ChildA({ content: 42 }), new ChildB({ content: 42 })],
-                    map: new Map([
-                        ["a", new ChildA({ content: 42 })],
-                        ["b", new ChildB({ content: 42 })],
-                    ]),
-                },
-            },
-        };
-    }
-    it("correctly construct objects with content", () => {
-        const root = hydrate(Schema, initialTree());
-        root.child = new ChildA({ content: 43 });
-        assert.equal(root.child.content, 43);
-    });
-    it("construct objects that work in polymorphic fields", () => {
-        const root = hydrate(Schema, initialTree());
-        root.poly = new ChildA({ content: 43 });
-        assert.equal(root.poly.content, 43);
-        root.poly = new ChildB({ content: 44 });
-        assert.equal(root.poly.content, 44);
-    });
-    it("can re-use content objects", () => {
-        const root = hydrate(Schema, initialTree());
-        // The `create` functions stamp the content with a `[typeNameSymbol]`.
-        // This test ensures that they shallow copy the content before doing the stamp.
-        const content = { content: 43 };
-        root.poly = new ChildA(content);
-        content.content = 44;
-        root.poly = new ChildB(content);
-        assert.equal(root.poly.content, 44);
-    });
-    it("don't require optional data to be included", () => {
-        const root = hydrate(Schema, initialTree());
-        assert.equal(root.optional, undefined);
-        root.optional = new ChildOptional({ content: undefined });
-        assert.deepEqual(root.optional, {});
-        assert.equal(root.optional.content, undefined);
-    });
-    it.skip("support nesting inside of a factory", () => {
-        const root = hydrate(Schema, initialTree());
-        root.grand = new ChildC({
-            child: new ChildD({
-                list: [new ChildA({ content: 43 }), new ChildB({ content: 43 })],
-                map: new Map([
-                    ["a", new ChildA({ content: 43 })],
-                    ["b", new ChildB({ content: 43 })],
-                ]),
-            }),
-        });
-        assert.deepEqual(root.grand.child.list, [{ content: 43 }, { content: 43 }]);
-        assert.deepEqual(root.grand.child.map.get("a"), { content: 43 });
-        assert.deepEqual(root.grand.child.map.get("b"), { content: 43 });
-    });
-    it.skip("support nesting inside of a plain javascript object", () => {
-        const root = hydrate(Schema, initialTree());
-        root.grand = new ChildC({
-            child: new ChildD({
-                list: [new ChildA({ content: 43 }), new ChildB({ content: 43 })],
-                map: new Map([
-                    ["a", new ChildA({ content: 43 })],
-                    ["b", new ChildB({ content: 43 })],
-                ]),
-            }),
-        });
-        assert.deepEqual(root.grand.child.list, [{ content: 43 }, { content: 43 }]);
-        assert.deepEqual(root.grand.child.map.get("a"), { content: 43 });
-        assert.deepEqual(root.grand.child.map.get("b"), { content: 43 });
-    });
-    describe("factory content extraction", () => {
-        it("extracts a primitive", () => {
-            assert.equal(extractFactoryContent(42).content, 42);
-        });
-        it("extracts an object", () => {
-            assert.deepEqual(extractFactoryContent(new ChildA({ content: 42 })).content, {
-                content: 42,
-            });
-        });
-        it("extracts an array of primitives", () => {
-            assert.deepEqual(extractFactoryContent([42, 42]).content, [42, 42]);
-        });
-        it("extracts an array of objects", () => {
-            assert.deepEqual(extractFactoryContent([new ChildA({ content: 42 }), new ChildA({ content: 42 })])
-                .content, [{ content: 42 }, { content: 42 }]);
-        });
-        it("extracts an array of maps", () => {
-            assert.deepEqual(extractFactoryContent([new Map([["a", 42]])]).content, [
-                new Map([["a", 42]]),
-            ]);
-        });
-        it("extracts a map of primitives", () => {
-            assert.deepEqual(extractFactoryContent(new Map([["a", 42]])).content, new Map([["a", 42]]));
-        });
-        it("extracts a map of objects", () => {
-            assert.deepEqual(extractFactoryContent(new Map([["a", new ChildA({ content: 42 })]])).content, new Map([["a", { content: 42 }]]));
-        });
-        it("extracts a map of arrays", () => {
-            assert.deepEqual(extractFactoryContent(new Map([["a", [42]]])).content, new Map([["a", [42]]]));
-        });
-        it("extracts an object tree", () => {
-            assert.deepEqual(extractFactoryContent(new ChildC({
-                child: new ChildD({
-                    list: [new ChildA({ content: 42 })],
-                    map: new Map([["a", new ChildA({ content: 42 })]]),
-                }),
-            })).content, {
-                child: { list: [{ content: 42 }], map: new Map([["a", { content: 42 }]]) },
-            });
-        });
-    });
-    it("produce proxies that are hydrated before the tree can be read", () => {
-        // This regression test ensures that proxies can be produced by reading the tree during change events.
-        // Previously, this was not handled correctly because proxies would not be hydrated until after all change
-        // events fired. If a user read the tree during a change event and produced a proxy, that proxy would not
-        // be the same as the one that is about to be hydrated for the same underlying edit node, and thus hydration
-        // would fail because it tried to map an edit node which already had a proxy to a different proxy.
-        const root = hydrate(Schema, initialTree());
-        function readData() {
-            const objectContent = root.child.content;
-            assert(objectContent !== undefined);
-            const listContent = root.grand.child.list[root.grand.child.list.length - 1];
-            assert(listContent !== undefined);
-            const mapContent = root.grand.child.map.get("a");
-            assert(mapContent !== undefined);
-        }
-        getFlexNode(root).on("beforeChange", () => {
-            readData();
-        });
-        Tree.on(root, "afterChange", () => {
-            readData();
-        });
-        const content = { content: 3 };
-        root.child = new ChildA(content);
-        root.grand.child.list.insertAtEnd(new ChildA(content));
-        readData();
-        root.grand.child.map.set("a", new ChildA(content));
-        readData();
-    });
-    it("hydration is not attempted on objects which are not proxies", () => {
-        // This regression test ensures that non-proxy objects inserted into the tree are
-        // not mistakenly "hydrated" as a proxy would be, falsely linking them to the content of the tree.
-        const root = hydrate(Schema, initialTree());
-        const newChild = { content: 43 };
-        // `newChild` is not a proxy, so it should be copied into the tree here but otherwise remain disconnected
-        root.child = new ChildA(newChild);
-        const child = root.child;
-        assert.equal(child.content, 43);
-        // Mutating the tree should have no effect on `newChild`...
-        root.child.content = 44;
-        assert.equal(newChild.content, 43);
-        // ... but it should affect our handle to the child
-        assert.equal(child.content, 44);
-        // Mutating `newChild` should have no effect on the tree...
-        newChild.content = 45;
-        assert.equal(root.child.content, 44);
-        // ... and should have no effect on our handle to the child
-        assert.equal(child.content, 44);
-    });
-});
-//# sourceMappingURL=objectFactory.spec.js.map

package/lib/test/simple-tree/objectFactory.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"objectFactory.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/objectFactory.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,sDAAsD;AACtD,OAAO,EAAE,qBAAqB,EAAE,MAAM,8BAA8B,CAAC;AACrE,OAAO,EACN,aAAa,EACb,WAAW,IAAI,IAAI,GAGnB,MAAM,4BAA4B,CAAC;AAEpC,sDAAsD;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAC5D,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAErC,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;IAC3C,MAAM,EAAE,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;IAErC,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,OAAO,EAAE,EAAE,CAAC,MAAM;KAClB,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,OAAO,EAAE,EAAE,CAAC,MAAM;KAClB,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,EAAE,CAAC,MAAM,CAAC,eAAe,EAAE;QAChD,OAAO,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC;KAC/B,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAChC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAC7B,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,KAAK,EAAE,MAAM;KACb,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,EAAE,CAAC,MAAM,CAAC,QAAQ,EAAE;QAClC,KAAK,EAAE,MAAM;QACb,IAAI,EAAE,CAAC,MAAM,EAAE,MAAM,CAAC;QACtB,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC;QACzB,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,MAAM,CAAC;QACtB,QAAQ,EAAE,EAAE,CAAC,QAAQ,CAAC,aAAa,CAAC;QACpC,KAAK,EAAE,MAAM;KACb,CAAC,CAAC;IAIH,SAAS,WAAW;QACnB,OAAO;YACN,KAAK,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClC,IAAI,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YACjC,IAAI,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC;YAClB,GAAG,EAAE,IAAI,GAAG,CAAC;gBACZ,CAAC,GAAG,EAAE,CAAC,CAAC;gBACR,CAAC,GAAG,EAAE,CAAC,CAAC;aACR,CAAC;YACF,sDAAsD;YACtD,qEAAqE;YACrE,QAAQ,EAAE,SAAS;YACnB,KAAK,EAAE;gBACN,KAAK,EAAE;oBACN,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;oBAChE,GAAG,EAAE,IAAI,GAAG,CAAoB;wBAC/B,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;wBAClC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;qBAClC,CAAC;iBACF;aACD;SACD,CAAC;IACH,CAAC;IAED,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACzC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC5D,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;QACrC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,sEAAsE;QACtE,+EAA+E;QAC/E,MAAM,OAAO,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;QAChC,OAAO,CAAC,OAAO,GAAG,EAAE,CAAC;QACrB,IAAI,CAAC,IAAI,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;QAChC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACrD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,GAAG,IAAI,aAAa,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;QAC1D,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC;YACvB,KAAK,EAAE,IAAI,MAAM,CAAC;gBACjB,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;gBAChE,GAAG,EAAE,IAAI,GAAG,CAAoB;oBAC/B,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;oBAClC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;iBAClC,CAAC;aACF,CAAC;SACF,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACjE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,IAAI,CAAC,qDAAqD,EAAE,GAAG,EAAE;QACnE,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC;YACvB,KAAK,EAAE,IAAI,MAAM,CAAC;gBACjB,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;gBAChE,GAAG,EAAE,IAAI,GAAG,CAAoB;oBAC/B,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;oBAClC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;iBAClC,CAAC;aACF,CAAC;SACF,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;QACjE,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,4BAA4B,EAAE,GAAG,EAAE;QAC3C,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;YAC/B,MAAM,CAAC,KAAK,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7B,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE;gBAC5E,OAAO,EAAE,EAAE;aACX,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC1C,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,SAAS,CACf,qBAAqB,CAAC,CAAC,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;iBAC/E,OAAO,EACT,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAClC,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACpC,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;gBACvE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;aACpB,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACvC,MAAM,CAAC,SAAS,CACf,qBAAqB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EACnD,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CACpB,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACpC,MAAM,CAAC,SAAS,CACf,qBAAqB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAC5E,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CACjC,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YACnC,MAAM,CAAC,SAAS,CACf,qBAAqB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EACrD,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CACtB,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YAClC,MAAM,CAAC,SAAS,CACf,qBAAqB,CACpB,IAAI,MAAM,CAAC;gBACV,KAAK,EAAE,IAAI,MAAM,CAAC;oBACjB,IAAI,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC;oBACnC,GAAG,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;iBAClD,CAAC;aACF,CAAC,CACF,CAAC,OAAO,EACT;gBACC,KAAK,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,GAAG,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;aAC1E,CACD,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACxE,sGAAsG;QACtG,0GAA0G;QAC1G,yGAAyG;QACzG,4GAA4G;QAC5G,kGAAkG;QAClG,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,SAAS,QAAQ;YAChB,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC;YACzC,MAAM,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC;YACpC,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAC5E,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;YAClC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACjD,MAAM,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC;QAClC,CAAC;QACD,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YACzC,QAAQ,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;QACH,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,aAAa,EAAE,GAAG,EAAE;YACjC,QAAQ,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QACvD,QAAQ,EAAE,CAAC;QACX,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC;QACnD,QAAQ,EAAE,CAAC;IACZ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;QACtE,iFAAiF;QACjF,kGAAkG;QAClG,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5C,MAAM,QAAQ,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACjC,yGAAyG;QACzG,IAAI,CAAC,KAAK,GAAG,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAChC,2DAA2D;QAC3D,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC;QACxB,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACnC,mDAAmD;QACnD,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAChC,2DAA2D;QAC3D,QAAQ,CAAC,OAAO,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QACrC,2DAA2D;QAC3D,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;IACjC,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\";\n// eslint-disable-next-line import/no-internal-modules\nimport { extractFactoryContent } from \"../../simple-tree/proxies.js\";\nimport {\n\tSchemaFactory,\n\ttreeNodeApi as Tree,\n\tInsertableTreeFieldFromImplicitField,\n\ttype NodeFromSchema,\n} from \"../../simple-tree/index.js\";\n\n// eslint-disable-next-line import/no-internal-modules\nimport { getFlexNode } from \"../../simple-tree/flexNode.js\";\nimport { hydrate } from \"./utils.js\";\n\ndescribe(\"SharedTreeObject factories\", () => {\n\tconst sb = new SchemaFactory(\"test\");\n\n\tconst ChildA = sb.object(\"childA\", {\n\t\tcontent: sb.number,\n\t});\n\n\tconst ChildB = sb.object(\"childB\", {\n\t\tcontent: sb.number,\n\t});\n\n\tconst ChildOptional = sb.object(\"childOptional\", {\n\t\tcontent: sb.optional(sb.number),\n\t});\n\n\tconst ChildD = sb.object(\"childD\", {\n\t\tlist: sb.array([ChildA, ChildB]),\n\t\tmap: sb.map([ChildA, ChildB]),\n\t});\n\n\tconst ChildC = sb.object(\"childC\", {\n\t\tchild: ChildD,\n\t});\n\n\tconst Schema = sb.object(\"parent\", {\n\t\tchild: ChildA,\n\t\tpoly: [ChildA, ChildB],\n\t\tlist: sb.array(sb.number),\n\t\tmap: sb.map(sb.number),\n\t\toptional: sb.optional(ChildOptional),\n\t\tgrand: ChildC,\n\t});\n\n\ttype ChildAOrB = NodeFromSchema<typeof ChildA> | NodeFromSchema<typeof ChildB>;\n\n\tfunction initialTree(): InsertableTreeFieldFromImplicitField<typeof Schema> {\n\t\treturn {\n\t\t\tchild: new ChildA({ content: 42 }),\n\t\t\tpoly: new ChildB({ content: 42 }),\n\t\t\tlist: [42, 42, 42],\n\t\t\tmap: new Map([\n\t\t\t\t[\"a\", 0],\n\t\t\t\t[\"b\", 1],\n\t\t\t]),\n\t\t\t// TODO: Omit optional field once correctly supported.\n\t\t\t// https://dev.azure.com/fluidframework/internal/_workitems/edit/6569\n\t\t\toptional: undefined,\n\t\t\tgrand: {\n\t\t\t\tchild: {\n\t\t\t\t\tlist: [new ChildA({ content: 42 }), new ChildB({ content: 42 })],\n\t\t\t\t\tmap: new Map<string, ChildAOrB>([\n\t\t\t\t\t\t[\"a\", new ChildA({ content: 42 })],\n\t\t\t\t\t\t[\"b\", new ChildB({ content: 42 })],\n\t\t\t\t\t]),\n\t\t\t\t},\n\t\t\t},\n\t\t};\n\t}\n\n\tit(\"correctly construct objects with content\", () => {\n\t\tconst root = hydrate(Schema, initialTree());\n\t\troot.child = new ChildA({ content: 43 });\n\t\tassert.equal(root.child.content, 43);\n\t});\n\n\tit(\"construct objects that work in polymorphic fields\", () => {\n\t\tconst root = hydrate(Schema, initialTree());\n\t\troot.poly = new ChildA({ content: 43 });\n\t\tassert.equal(root.poly.content, 43);\n\t\troot.poly = new ChildB({ content: 44 });\n\t\tassert.equal(root.poly.content, 44);\n\t});\n\n\tit(\"can re-use content objects\", () => {\n\t\tconst root = hydrate(Schema, initialTree());\n\t\t// The `create` functions stamp the content with a `[typeNameSymbol]`.\n\t\t// This test ensures that they shallow copy the content before doing the stamp.\n\t\tconst content = { content: 43 };\n\t\troot.poly = new ChildA(content);\n\t\tcontent.content = 44;\n\t\troot.poly = new ChildB(content);\n\t\tassert.equal(root.poly.content, 44);\n\t});\n\n\tit(\"don't require optional data to be included\", () => {\n\t\tconst root = hydrate(Schema, initialTree());\n\t\tassert.equal(root.optional, undefined);\n\t\troot.optional = new ChildOptional({ content: undefined });\n\t\tassert.deepEqual(root.optional, {});\n\t\tassert.equal(root.optional.content, undefined);\n\t});\n\n\tit.skip(\"support nesting inside of a factory\", () => {\n\t\tconst root = hydrate(Schema, initialTree());\n\t\troot.grand = new ChildC({\n\t\t\tchild: new ChildD({\n\t\t\t\tlist: [new ChildA({ content: 43 }), new ChildB({ content: 43 })],\n\t\t\t\tmap: new Map<string, ChildAOrB>([\n\t\t\t\t\t[\"a\", new ChildA({ content: 43 })],\n\t\t\t\t\t[\"b\", new ChildB({ content: 43 })],\n\t\t\t\t]),\n\t\t\t}),\n\t\t});\n\t\tassert.deepEqual(root.grand.child.list, [{ content: 43 }, { content: 43 }]);\n\t\tassert.deepEqual(root.grand.child.map.get(\"a\"), { content: 43 });\n\t\tassert.deepEqual(root.grand.child.map.get(\"b\"), { content: 43 });\n\t});\n\n\tit.skip(\"support nesting inside of a plain javascript object\", () => {\n\t\tconst root = hydrate(Schema, initialTree());\n\t\troot.grand = new ChildC({\n\t\t\tchild: new ChildD({\n\t\t\t\tlist: [new ChildA({ content: 43 }), new ChildB({ content: 43 })],\n\t\t\t\tmap: new Map<string, ChildAOrB>([\n\t\t\t\t\t[\"a\", new ChildA({ content: 43 })],\n\t\t\t\t\t[\"b\", new ChildB({ content: 43 })],\n\t\t\t\t]),\n\t\t\t}),\n\t\t});\n\t\tassert.deepEqual(root.grand.child.list, [{ content: 43 }, { content: 43 }]);\n\t\tassert.deepEqual(root.grand.child.map.get(\"a\"), { content: 43 });\n\t\tassert.deepEqual(root.grand.child.map.get(\"b\"), { content: 43 });\n\t});\n\n\tdescribe(\"factory content extraction\", () => {\n\t\tit(\"extracts a primitive\", () => {\n\t\t\tassert.equal(extractFactoryContent(42).content, 42);\n\t\t});\n\t\tit(\"extracts an object\", () => {\n\t\t\tassert.deepEqual(extractFactoryContent(new ChildA({ content: 42 })).content, {\n\t\t\t\tcontent: 42,\n\t\t\t});\n\t\t});\n\t\tit(\"extracts an array of primitives\", () => {\n\t\t\tassert.deepEqual(extractFactoryContent([42, 42]).content, [42, 42]);\n\t\t});\n\t\tit(\"extracts an array of objects\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\textractFactoryContent([new ChildA({ content: 42 }), new ChildA({ content: 42 })])\n\t\t\t\t\t.content,\n\t\t\t\t[{ content: 42 }, { content: 42 }],\n\t\t\t);\n\t\t});\n\t\tit(\"extracts an array of maps\", () => {\n\t\t\tassert.deepEqual(extractFactoryContent([new Map([[\"a\", 42]])]).content, [\n\t\t\t\tnew Map([[\"a\", 42]]),\n\t\t\t]);\n\t\t});\n\t\tit(\"extracts a map of primitives\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\textractFactoryContent(new Map([[\"a\", 42]])).content,\n\t\t\t\tnew Map([[\"a\", 42]]),\n\t\t\t);\n\t\t});\n\t\tit(\"extracts a map of objects\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\textractFactoryContent(new Map([[\"a\", new ChildA({ content: 42 })]])).content,\n\t\t\t\tnew Map([[\"a\", { content: 42 }]]),\n\t\t\t);\n\t\t});\n\t\tit(\"extracts a map of arrays\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\textractFactoryContent(new Map([[\"a\", [42]]])).content,\n\t\t\t\tnew Map([[\"a\", [42]]]),\n\t\t\t);\n\t\t});\n\t\tit(\"extracts an object tree\", () => {\n\t\t\tassert.deepEqual(\n\t\t\t\textractFactoryContent(\n\t\t\t\t\tnew ChildC({\n\t\t\t\t\t\tchild: new ChildD({\n\t\t\t\t\t\t\tlist: [new ChildA({ content: 42 })],\n\t\t\t\t\t\t\tmap: new Map([[\"a\", new ChildA({ content: 42 })]]),\n\t\t\t\t\t\t}),\n\t\t\t\t\t}),\n\t\t\t\t).content,\n\t\t\t\t{\n\t\t\t\t\tchild: { list: [{ content: 42 }], map: new Map([[\"a\", { content: 42 }]]) },\n\t\t\t\t},\n\t\t\t);\n\t\t});\n\t});\n\n\tit(\"produce proxies that are hydrated before the tree can be read\", () => {\n\t\t// This regression test ensures that proxies can be produced by reading the tree during change events.\n\t\t// Previously, this was not handled correctly because proxies would not be hydrated until after all change\n\t\t// events fired. If a user read the tree during a change event and produced a proxy, that proxy would not\n\t\t// be the same as the one that is about to be hydrated for the same underlying edit node, and thus hydration\n\t\t// would fail because it tried to map an edit node which already had a proxy to a different proxy.\n\t\tconst root = hydrate(Schema, initialTree());\n\t\tfunction readData() {\n\t\t\tconst objectContent = root.child.content;\n\t\t\tassert(objectContent !== undefined);\n\t\t\tconst listContent = root.grand.child.list[root.grand.child.list.length - 1];\n\t\t\tassert(listContent !== undefined);\n\t\t\tconst mapContent = root.grand.child.map.get(\"a\");\n\t\t\tassert(mapContent !== undefined);\n\t\t}\n\t\tgetFlexNode(root).on(\"beforeChange\", () => {\n\t\t\treadData();\n\t\t});\n\t\tTree.on(root, \"afterChange\", () => {\n\t\t\treadData();\n\t\t});\n\n\t\tconst content = { content: 3 };\n\t\troot.child = new ChildA(content);\n\t\troot.grand.child.list.insertAtEnd(new ChildA(content));\n\t\treadData();\n\t\troot.grand.child.map.set(\"a\", new ChildA(content));\n\t\treadData();\n\t});\n\n\tit(\"hydration is not attempted on objects which are not proxies\", () => {\n\t\t// This regression test ensures that non-proxy objects inserted into the tree are\n\t\t// not mistakenly \"hydrated\" as a proxy would be, falsely linking them to the content of the tree.\n\t\tconst root = hydrate(Schema, initialTree());\n\t\tconst newChild = { content: 43 };\n\t\t// `newChild` is not a proxy, so it should be copied into the tree here but otherwise remain disconnected\n\t\troot.child = new ChildA(newChild);\n\t\tconst child = root.child;\n\t\tassert.equal(child.content, 43);\n\t\t// Mutating the tree should have no effect on `newChild`...\n\t\troot.child.content = 44;\n\t\tassert.equal(newChild.content, 43);\n\t\t// ... but it should affect our handle to the child\n\t\tassert.equal(child.content, 44);\n\t\t// Mutating `newChild` should have no effect on the tree...\n\t\tnewChild.content = 45;\n\t\tassert.equal(root.child.content, 44);\n\t\t// ... and should have no effect on our handle to the child\n\t\tassert.equal(child.content, 44);\n\t});\n});\n"]}

package/lib/test/simple-tree/primitives.spec.d.ts

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

package/lib/test/simple-tree/primitives.spec.d.ts.map

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

package/lib/test/simple-tree/primitives.spec.js

@@ -1,134 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { SchemaFactory, } from "../../simple-tree/index.js";
-import { hydrate, pretty } from "./utils.js";
-const schemaFactory = new SchemaFactory("Test");
-// Construct a SharedTree with each of the above primitives as the root and then
-// 'deepEquals' compares the proxy with the original primitive value.
-//
-// Also covers the corner case of an empty tree (via optional root) by constructing
-// a tree with an 'undefined' root.
-describe("Primitives", () => {
-    /**
-     * Verifies that that 'value' is preserved when written and read back from a SharedTree
-     * with the given schema.
-     *
-     * @param schema - Schema to use for the test (must include the type of 'value'.)
-     * @param value - The value to be written/read/verified.
-     */
-    function checkExact(schema, value) {
-        it(`initialTree(${pretty(value)}) preserves ${typeof value} ${pretty(value)}`, () => {
-            // Paranoid check that the given value is in fact preserved.
-            assert.deepEqual(value, JSON.parse(JSON.stringify(value)), `Expected ${pretty(value)} to be preserved by JSON.`);
-            const actual = hydrate(schema, value);
-            assert.deepEqual(actual, value, "Readback of initialTree must match expected value.");
-        });
-        // TODO: Consider improving coverage with more variations:
-        // - reading/writting an object field
-        // - reading/writting a list element
-        // - reading/writting a map entry
-        // - optional
-    }
-    /**
-     * Returns the value that JSON.stringify/parse would coerce the given value to.
-     *
-     * Sanity checks that the given value is in fact coerced.
-     *
-     * @param value - The value to be coerced.
-     * @returns The coerced value.
-     */
-    function getCoercedValue(value) {
-        const coercedValue = JSON.parse(JSON.stringify(value));
-        // Paranoid check that the given value is in fact coerced.
-        assert.notDeepEqual(value, coercedValue, "Expected JSON stringify/parse to coerce value.");
-        return coercedValue;
-    }
-    /**
-     * Verifies that that 'value' is coerced when written and read back from a SharedTree
-     * with the given schema.
-     *
-     * @param schema - Schema to use for the test (must include the coerced type of 'value'.)
-     * @param value - The value to be written/read/verified.
-     */
-    function checkCoerced(schema, value) {
-        const coercedValue = getCoercedValue(value);
-        it(`initialTree(${pretty(value)}) is coerced to ${typeof coercedValue} ${coercedValue}`, () => {
-            const actual = hydrate(schema, value);
-            assert.deepEqual(actual, coercedValue, "Readback of initialTree must match expected value.");
-        });
-        // TODO: Consider improving coverage with more variations:
-        // - reading/writting an object field
-        // - reading/writting a list element
-        // - reading/writting a map entry
-        // - optional
-    }
-    /**
-     * Verifies that attempting to write 'value' throws due to the coerced value violating the
-     * given schema.
-     *
-     * @param schema - Schema to use for the test (must include the coerced type of 'value'.)
-     * @param value - The value to be written/read/verified.
-     */
-    function checkThrows(schema, value) {
-        const coercedValue = getCoercedValue(value);
-        it(`initialTree(${pretty(value)}) throws when coercion to ${typeof value}' ${coercedValue}' violates schema.`, () => {
-            assert.throws(() => hydrate(schema, value), `initialTree(${pretty(value)}) must throw when coercion to '${coercedValue}' violates schema.`);
-        });
-        // TODO: Consider improving coverage with more variations:
-        // - reading/writting an object field
-        // - reading/writting a list element
-        // - reading/writting a map entry
-        // - optional
-    }
-    describe("null", () => {
-        const schema = schemaFactory.null;
-        checkExact(schema, null);
-    });
-    describe("boolean", () => {
-        const schema = schemaFactory.boolean;
-        [true, false].forEach((value) => checkExact(schema, value));
-    });
-    describe("number", () => {
-        describe("with schema [_.number]", () => {
-            const schema = schemaFactory.number;
-            // Test a handful of extreme values to sanity check that they round-trip as expected.
-            [
-                -Number.MAX_VALUE,
-                Number.MIN_SAFE_INTEGER,
-                -Number.MIN_VALUE,
-                0,
-                Number.MIN_VALUE,
-                Number.MAX_SAFE_INTEGER,
-                Number.MAX_VALUE,
-            ].forEach((value) => checkExact(schema, value));
-            // JSON coerces non-finite numbers to 'null'.  If 'null' violates schema,
-            // this must throw a TypeError.
-            [-Infinity, NaN, Infinity].forEach((value) => {
-                checkThrows(schema, value);
-            });
-            // JSON coerces -0 to 0.  This succeeds because it does not change the type.
-            [-0].forEach((value) => {
-                checkCoerced(schema, value);
-            });
-        });
-        describe("with schema [_.number, _.null]", () => {
-            // JSON coerces non-finite numbers to 'null'.  This succeeds when 'null' is
-            // permitted by schema.
-            const schema = [schemaFactory.number, schemaFactory.null];
-            [-Infinity, NaN, Infinity].forEach((value) => checkCoerced(schema, value));
-        });
-    });
-    describe("string", () => {
-        const schema = schemaFactory.string;
-        [
-            "",
-            "!~",
-            "比特币",
-            "😂💁🏼‍♂️💁🏼‍💁‍♂", // surrogate pairs with glyph modifiers
-        ].forEach((value) => checkExact(schema, value));
-    });
-});
-//# sourceMappingURL=primitives.spec.js.map

package/lib/test/simple-tree/primitives.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"primitives.spec.js","sourceRoot":"","sources":["../../../src/test/simple-tree/primitives.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAGN,aAAa,GACb,MAAM,4BAA4B,CAAC;AACpC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAE7C,MAAM,aAAa,GAAG,IAAI,aAAa,CAAC,MAAM,CAAC,CAAC;AAEhD,gFAAgF;AAChF,qEAAqE;AACrE,EAAE;AACF,mFAAmF;AACnF,mCAAmC;AACnC,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC3B;;;;;;OAMG;IACH,SAAS,UAAU,CAClB,MAAe,EACf,KAAoD;QAEpD,EAAE,CAAC,eAAe,MAAM,CAAC,KAAK,CAAC,eAAe,OAAO,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE,GAAG,EAAE;YACnF,4DAA4D;YAC5D,MAAM,CAAC,SAAS,CACf,KAAK,EACL,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,EACjC,YAAY,MAAM,CAAC,KAAK,CAAC,2BAA2B,CACpD,CAAC;YAEF,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACtC,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,oDAAoD,CAAC,CAAC;QACvF,CAAC,CAAC,CAAC;QAEH,0DAA0D;QAC1D,qCAAqC;QACrC,oCAAoC;QACpC,iCAAiC;QACjC,aAAa;IACd,CAAC;IAED;;;;;;;OAOG;IACH,SAAS,eAAe,CAAC,KAAU;QAClC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QAEvD,0DAA0D;QAC1D,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,YAAY,EAAE,gDAAgD,CAAC,CAAC;QAE3F,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,SAAS,YAAY,CACpB,MAAe,EACf,KAAoD;QAEpD,MAAM,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAE5C,EAAE,CAAC,eAAe,MAAM,CACvB,KAAK,CACL,mBAAmB,OAAO,YAAY,IAAI,YAAY,EAAE,EAAE,GAAG,EAAE;YAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YACtC,MAAM,CAAC,SAAS,CACf,MAAM,EACN,YAAY,EACZ,oDAAoD,CACpD,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,0DAA0D;QAC1D,qCAAqC;QACrC,oCAAoC;QACpC,iCAAiC;QACjC,aAAa;IACd,CAAC;IAED;;;;;;OAMG;IACH,SAAS,WAAW,CACnB,MAAe,EACf,KAAoD;QAEpD,MAAM,YAAY,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAE5C,EAAE,CAAC,eAAe,MAAM,CACvB,KAAK,CACL,6BAA6B,OAAO,KAAK,KAAK,YAAY,oBAAoB,EAAE,GAAG,EAAE;YACrF,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,EAC5B,eAAe,MAAM,CACpB,KAAK,CACL,kCAAkC,YAAY,oBAAoB,CACnE,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,0DAA0D;QAC1D,qCAAqC;QACrC,oCAAoC;QACpC,iCAAiC;QACjC,aAAa;IACd,CAAC;IAED,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;QACrB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC;QAClC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC1B,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACxB,MAAM,MAAM,GAAG,aAAa,CAAC,OAAO,CAAC;QACrC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACvC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;YAEpC,qFAAqF;YACrF;gBACC,CAAC,MAAM,CAAC,SAAS;gBACjB,MAAM,CAAC,gBAAgB;gBACvB,CAAC,MAAM,CAAC,SAAS;gBACjB,CAAC;gBACD,MAAM,CAAC,SAAS;gBAChB,MAAM,CAAC,gBAAgB;gBACvB,MAAM,CAAC,SAAS;aAChB,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;YAEhD,yEAAyE;YACzE,+BAA+B;YAC/B,CAAC,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBAC5C,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC5B,CAAC,CAAC,CAAC;YAEH,4EAA4E;YAC5E,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;gBACtB,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC7B,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;YAC/C,2EAA2E;YAC3E,uBAAuB;YACvB,MAAM,MAAM,GAAG,CAAC,aAAa,CAAC,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC;YAC1D,CAAC,CAAC,QAAQ,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;QAC5E,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,QAAQ,EAAE,GAAG,EAAE;QACvB,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC;QACpC;YACC,EAAE;YACF,IAAI;YACJ,KAAK;YACL,oBAAoB,EAAE,uCAAuC;SAC7D,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IACjD,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 {\n\tImplicitFieldSchema,\n\tInsertableTreeFieldFromImplicitField,\n\tSchemaFactory,\n} from \"../../simple-tree/index.js\";\nimport { hydrate, pretty } from \"./utils.js\";\n\nconst schemaFactory = new SchemaFactory(\"Test\");\n\n// Construct a SharedTree with each of the above primitives as the root and then\n// 'deepEquals' compares the proxy with the original primitive value.\n//\n// Also covers the corner case of an empty tree (via optional root) by constructing\n// a tree with an 'undefined' root.\ndescribe(\"Primitives\", () => {\n\t/**\n\t * Verifies that that 'value' is preserved when written and read back from a SharedTree\n\t * with the given schema.\n\t *\n\t * @param schema - Schema to use for the test (must include the type of 'value'.)\n\t * @param value - The value to be written/read/verified.\n\t */\n\tfunction checkExact<TSchema extends ImplicitFieldSchema>(\n\t\tschema: TSchema,\n\t\tvalue: InsertableTreeFieldFromImplicitField<TSchema>,\n\t) {\n\t\tit(`initialTree(${pretty(value)}) preserves ${typeof value} ${pretty(value)}`, () => {\n\t\t\t// Paranoid check that the given value is in fact preserved.\n\t\t\tassert.deepEqual(\n\t\t\t\tvalue,\n\t\t\t\tJSON.parse(JSON.stringify(value)),\n\t\t\t\t`Expected ${pretty(value)} to be preserved by JSON.`,\n\t\t\t);\n\n\t\t\tconst actual = hydrate(schema, value);\n\t\t\tassert.deepEqual(actual, value, \"Readback of initialTree must match expected value.\");\n\t\t});\n\n\t\t// TODO: Consider improving coverage with more variations:\n\t\t// - reading/writting an object field\n\t\t// - reading/writting a list element\n\t\t// - reading/writting a map entry\n\t\t// - optional\n\t}\n\n\t/**\n\t * Returns the value that JSON.stringify/parse would coerce the given value to.\n\t *\n\t * Sanity checks that the given value is in fact coerced.\n\t *\n\t * @param value - The value to be coerced.\n\t * @returns The coerced value.\n\t */\n\tfunction getCoercedValue(value: any): unknown {\n\t\tconst coercedValue = JSON.parse(JSON.stringify(value));\n\n\t\t// Paranoid check that the given value is in fact coerced.\n\t\tassert.notDeepEqual(value, coercedValue, \"Expected JSON stringify/parse to coerce value.\");\n\n\t\treturn coercedValue;\n\t}\n\n\t/**\n\t * Verifies that that 'value' is coerced when written and read back from a SharedTree\n\t * with the given schema.\n\t *\n\t * @param schema - Schema to use for the test (must include the coerced type of 'value'.)\n\t * @param value - The value to be written/read/verified.\n\t */\n\tfunction checkCoerced<TSchema extends ImplicitFieldSchema>(\n\t\tschema: TSchema,\n\t\tvalue: InsertableTreeFieldFromImplicitField<TSchema>,\n\t) {\n\t\tconst coercedValue = getCoercedValue(value);\n\n\t\tit(`initialTree(${pretty(\n\t\t\tvalue,\n\t\t)}) is coerced to ${typeof coercedValue} ${coercedValue}`, () => {\n\t\t\tconst actual = hydrate(schema, value);\n\t\t\tassert.deepEqual(\n\t\t\t\tactual,\n\t\t\t\tcoercedValue,\n\t\t\t\t\"Readback of initialTree must match expected value.\",\n\t\t\t);\n\t\t});\n\n\t\t// TODO: Consider improving coverage with more variations:\n\t\t// - reading/writting an object field\n\t\t// - reading/writting a list element\n\t\t// - reading/writting a map entry\n\t\t// - optional\n\t}\n\n\t/**\n\t * Verifies that attempting to write 'value' throws due to the coerced value violating the\n\t * given schema.\n\t *\n\t * @param schema - Schema to use for the test (must include the coerced type of 'value'.)\n\t * @param value - The value to be written/read/verified.\n\t */\n\tfunction checkThrows<TSchema extends ImplicitFieldSchema>(\n\t\tschema: TSchema,\n\t\tvalue: InsertableTreeFieldFromImplicitField<TSchema>,\n\t) {\n\t\tconst coercedValue = getCoercedValue(value);\n\n\t\tit(`initialTree(${pretty(\n\t\t\tvalue,\n\t\t)}) throws when coercion to ${typeof value}' ${coercedValue}' violates schema.`, () => {\n\t\t\tassert.throws(\n\t\t\t\t() => hydrate(schema, value),\n\t\t\t\t`initialTree(${pretty(\n\t\t\t\t\tvalue,\n\t\t\t\t)}) must throw when coercion to '${coercedValue}' violates schema.`,\n\t\t\t);\n\t\t});\n\n\t\t// TODO: Consider improving coverage with more variations:\n\t\t// - reading/writting an object field\n\t\t// - reading/writting a list element\n\t\t// - reading/writting a map entry\n\t\t// - optional\n\t}\n\n\tdescribe(\"null\", () => {\n\t\tconst schema = schemaFactory.null;\n\t\tcheckExact(schema, null);\n\t});\n\n\tdescribe(\"boolean\", () => {\n\t\tconst schema = schemaFactory.boolean;\n\t\t[true, false].forEach((value) => checkExact(schema, value));\n\t});\n\n\tdescribe(\"number\", () => {\n\t\tdescribe(\"with schema [_.number]\", () => {\n\t\t\tconst schema = schemaFactory.number;\n\n\t\t\t// Test a handful of extreme values to sanity check that they round-trip as expected.\n\t\t\t[\n\t\t\t\t-Number.MAX_VALUE,\n\t\t\t\tNumber.MIN_SAFE_INTEGER,\n\t\t\t\t-Number.MIN_VALUE,\n\t\t\t\t0,\n\t\t\t\tNumber.MIN_VALUE,\n\t\t\t\tNumber.MAX_SAFE_INTEGER,\n\t\t\t\tNumber.MAX_VALUE,\n\t\t\t].forEach((value) => checkExact(schema, value));\n\n\t\t\t// JSON coerces non-finite numbers to 'null'.  If 'null' violates schema,\n\t\t\t// this must throw a TypeError.\n\t\t\t[-Infinity, NaN, Infinity].forEach((value) => {\n\t\t\t\tcheckThrows(schema, value);\n\t\t\t});\n\n\t\t\t// JSON coerces -0 to 0.  This succeeds because it does not change the type.\n\t\t\t[-0].forEach((value) => {\n\t\t\t\tcheckCoerced(schema, value);\n\t\t\t});\n\t\t});\n\n\t\tdescribe(\"with schema [_.number, _.null]\", () => {\n\t\t\t// JSON coerces non-finite numbers to 'null'.  This succeeds when 'null' is\n\t\t\t// permitted by schema.\n\t\t\tconst schema = [schemaFactory.number, schemaFactory.null];\n\t\t\t[-Infinity, NaN, Infinity].forEach((value) => checkCoerced(schema, value));\n\t\t});\n\t});\n\n\tdescribe(\"string\", () => {\n\t\tconst schema = schemaFactory.string;\n\t\t[\n\t\t\t\"\", // empty string\n\t\t\t\"!~\", // printable ascii range\n\t\t\t\"比特币\", // non-ascii range\n\t\t\t\"😂💁🏼‍♂️💁🏼‍💁‍♂\", // surrogate pairs with glyph modifiers\n\t\t].forEach((value) => checkExact(schema, value));\n\t});\n});\n"]}

package/lib/test/simple-tree/proxies.spec.d.ts

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

package/lib/test/simple-tree/proxies.spec.d.ts.map

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