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

package/lib/test/feature-libraries/flex-tree/unboxed.spec.js

@@ -1,197 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-/* eslint-disable import/no-internal-modules */
-import { strict as assert } from "node:assert";
-import { rootFieldKey, } from "../../../core/index.js";
-import { SchemaBuilder, leaf, leaf as leafDomain } from "../../../domains/index.js";
-import { Any, FieldKinds, FlexFieldSchema, } from "../../../feature-libraries/index.js";
-import { unboxedField, unboxedTree, unboxedUnion, } from "../../../feature-libraries/flex-tree/unboxed.js";
-import { contextWithContentReadonly } from "./utils.js";
-const rootFieldAnchor = { parent: undefined, fieldKey: rootFieldKey };
-/**
- * Creates a cursor from the provided `context` and moves it to the provided `anchor`.
- */
-function initializeCursor(context, anchor) {
-    const cursor = context.forest.allocateCursor();
-    assert.equal(context.forest.tryMoveCursorToField(anchor, cursor), 1 /* TreeNavigationResult.Ok */);
-    return cursor;
-}
-/**
- * Initializes a test tree, context, and cursor, and moves the cursor to the tree's root.
- *
- * @returns The initialized context and cursor.
- */
-function initializeTreeWithContent(treeContent) {
-    const context = contextWithContentReadonly(treeContent);
-    const cursor = initializeCursor(context, rootFieldAnchor);
-    return {
-        context,
-        cursor,
-    };
-}
-describe("unboxedField", () => {
-    describe("Optional field", () => {
-        it("No value", () => {
-            const builder = new SchemaBuilder({ scope: "test" });
-            const fieldSchema = SchemaBuilder.optional(leafDomain.number);
-            const schema = builder.intoSchema(fieldSchema);
-            const { context, cursor } = initializeTreeWithContent({
-                schema,
-                initialTree: undefined,
-            });
-            assert.equal(unboxedField(context, fieldSchema, cursor), undefined);
-        });
-        it("With value (leaf)", () => {
-            const builder = new SchemaBuilder({ scope: "test" });
-            const fieldSchema = SchemaBuilder.optional(leafDomain.number);
-            const schema = builder.intoSchema(fieldSchema);
-            const { context, cursor } = initializeTreeWithContent({
-                schema,
-                initialTree: 42,
-            });
-            assert.equal(unboxedField(context, fieldSchema, cursor), 42);
-        });
-    });
-    it("Required field (object)", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const objectSchema = builder.objectRecursive("object", {
-            name: SchemaBuilder.required(leafDomain.string),
-            child: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => objectSchema]),
-        });
-        const fieldSchema = SchemaBuilder.optional(objectSchema);
-        const schema = builder.intoSchema(fieldSchema);
-        const initialTree = {
-            name: "Foo",
-            child: {
-                name: "Bar",
-                child: undefined,
-            },
-        };
-        const { context, cursor } = initializeTreeWithContent({ schema, initialTree });
-        const unboxed = unboxedField(context, fieldSchema, cursor);
-        assert(unboxed !== undefined);
-        assert.equal(unboxed.schema, objectSchema);
-        assert.equal(unboxed.name, "Foo");
-        const unboxedChild = unboxed.child;
-        assert(unboxedChild !== undefined);
-        assert.equal(unboxedChild.schema, objectSchema);
-        assert.equal(unboxedChild.name, "Bar");
-        assert.equal(unboxedChild.child, undefined);
-    });
-    it("Sequence field", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const fieldSchema = SchemaBuilder.sequence(leafDomain.string);
-        const schema = builder.intoSchema(fieldSchema);
-        const { context, cursor } = initializeTreeWithContent({
-            schema,
-            initialTree: ["Hello", "world"],
-        });
-        const unboxed = unboxedField(context, fieldSchema, cursor);
-        assert.deepEqual([...unboxed], ["Hello", "world"]);
-    });
-    it("Schema: Any", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const fieldSchema = SchemaBuilder.optional(Any);
-        const schema = builder.intoSchema(fieldSchema);
-        const { context, cursor } = initializeTreeWithContent({ schema, initialTree: 42 });
-        // Type is not known based on schema, so node will not be unboxed.
-        const unboxed = unboxedField(context, fieldSchema, cursor);
-        assert(unboxed !== undefined);
-        assert.equal(unboxed.schema, leaf.number);
-        assert.equal(unboxed.value, 42);
-    });
-});
-describe("unboxedTree", () => {
-    it("Leaf", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const schema = builder.intoSchema(leafDomain.string);
-        const { context, cursor } = initializeTreeWithContent({
-            schema,
-            initialTree: "Hello world",
-        });
-        cursor.enterNode(0); // Root node field has 1 node; move into it
-        assert.equal(unboxedTree(context, leafDomain.string, cursor), "Hello world");
-    });
-    it("Map", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const mapSchema = builder.map("map", builder.optional(leafDomain.string));
-        const rootSchema = SchemaBuilder.optional(mapSchema);
-        const schema = builder.intoSchema(rootSchema);
-        const { context, cursor } = initializeTreeWithContent({
-            schema,
-            initialTree: {
-                foo: "Hello",
-                bar: "world",
-            },
-        });
-        cursor.enterNode(0); // Root node field has 1 node; move into it
-        const unboxed = unboxedTree(context, mapSchema, cursor);
-        assert.equal(unboxed.size, 2);
-        assert.equal(unboxed.get("foo"), "Hello");
-        assert.equal(unboxed.get("bar"), "world");
-    });
-    it("ObjectNode", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const objectSchema = builder.objectRecursive("object", {
-            name: SchemaBuilder.required(leafDomain.string),
-            child: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => objectSchema]),
-        });
-        const rootSchema = builder.optional(objectSchema);
-        const schema = builder.intoSchema(rootSchema);
-        const initialTree = {
-            name: "Foo",
-            child: {
-                name: "Bar",
-                child: undefined,
-            },
-        };
-        const { context, cursor } = initializeTreeWithContent({ schema, initialTree });
-        cursor.enterNode(0); // Root node field has 1 node; move into it
-        const unboxed = unboxedTree(context, objectSchema, cursor);
-        assert.equal(unboxed.name, "Foo");
-        assert(unboxed.child !== undefined);
-        assert.equal(unboxed.child.name, "Bar");
-        assert.equal(unboxed.child.child, undefined);
-    });
-});
-describe("unboxedUnion", () => {
-    it("Any", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const fieldSchema = SchemaBuilder.optional(Any);
-        const schema = builder.intoSchema(fieldSchema);
-        const { context, cursor } = initializeTreeWithContent({ schema, initialTree: 42 });
-        cursor.enterNode(0); // Root node field has 1 node; move into it
-        // Type is not known based on schema, so node will not be unboxed.
-        const unboxed = unboxedUnion(context, fieldSchema, cursor);
-        assert.equal(unboxed.schema, leaf.number);
-        assert.equal(unboxed.value, 42);
-    });
-    it("Single type", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const fieldSchema = SchemaBuilder.required(leafDomain.boolean);
-        const schema = builder.intoSchema(fieldSchema);
-        const { context, cursor } = initializeTreeWithContent({
-            schema,
-            initialTree: false,
-        });
-        cursor.enterNode(0); // Root node field has 1 node; move into it
-        assert.equal(unboxedUnion(context, fieldSchema, cursor), false);
-    });
-    it("Multi-type", () => {
-        const builder = new SchemaBuilder({ scope: "test" });
-        const fieldSchema = SchemaBuilder.optional([leafDomain.string, leafDomain.handle]);
-        const schema = builder.intoSchema(fieldSchema);
-        const { context, cursor } = initializeTreeWithContent({
-            schema,
-            initialTree: "Hello world",
-        });
-        cursor.enterNode(0); // Root node field has 1 node; move into it
-        // Type is not known based on schema, so node will not be unboxed.
-        const unboxed = unboxedUnion(context, fieldSchema, cursor);
-        assert.equal(unboxed.schema, leaf.string);
-        assert.equal(unboxed.value, "Hello world");
-    });
-});
-//# sourceMappingURL=unboxed.spec.js.map

package/lib/test/feature-libraries/flex-tree/unboxed.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"unboxed.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/flex-tree/unboxed.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,+CAA+C;AAE/C,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAE/C,OAAO,EAIN,YAAY,GACZ,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACpF,OAAO,EAEN,GAAG,EAEH,UAAU,EACV,eAAe,GACf,MAAM,qCAAqC,CAAC;AAE7C,OAAO,EACN,YAAY,EACZ,WAAW,EACX,YAAY,GACZ,MAAM,iDAAiD,CAAC;AAEzD,OAAO,EAAE,0BAA0B,EAAE,MAAM,YAAY,CAAC;AAExD,MAAM,eAAe,GAAgB,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;AAEnF;;GAEG;AACH,SAAS,gBAAgB,CAAC,OAAgB,EAAE,MAAmB;IAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAE/C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,kCAA0B,CAAC;IAC3F,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,yBAAyB,CACjC,WAAwB;IAKxB,MAAM,OAAO,GAAG,0BAA0B,CAAC,WAAW,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;IAE1D,OAAO;QACN,OAAO;QACP,MAAM;KACN,CAAC;AACH,CAAC;AAED,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC/B,EAAE,CAAC,UAAU,EAAE,GAAG,EAAE;YACnB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAE/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC;gBACrD,MAAM;gBACN,WAAW,EAAE,SAAS;aACtB,CAAC,CAAC;YAEH,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,SAAS,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;YAC5B,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;YACrD,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAE/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC;gBACrD,MAAM;gBACN,WAAW,EAAE,EAAE;aACf,CAAC,CAAC;YAEH,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9D,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;QAClC,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,YAAY,GAAG,OAAO,CAAC,eAAe,CAAC,QAAQ,EAAE;YACtD,IAAI,EAAE,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC;YAC/C,KAAK,EAAE,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;SAC9E,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAE/C,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,KAAK;YACX,KAAK,EAAE;gBACN,IAAI,EAAE,KAAK;gBACX,KAAK,EAAE,SAAS;aAChB;SACD,CAAC;QAEF,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAE/E,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAC3C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAElC,MAAM,YAAY,GAAG,OAAO,CAAC,KAAK,CAAC;QACnC,MAAM,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC;QACnC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QAChD,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9D,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAE/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC;YACrD,MAAM;YACN,WAAW,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;SAC/B,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QAE3D,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACtB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAE/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;QAEnF,kEAAkE;QAClE,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3D,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE;QACf,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAErD,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC;YACrD,MAAM;YACN,WAAW,EAAE,aAAa;SAC1B,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,2CAA2C;QAEhE,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,UAAU,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;QACd,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1E,MAAM,UAAU,GAAG,aAAa,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAE9C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC;YACrD,MAAM;YACN,WAAW,EAAE;gBACZ,GAAG,EAAE,OAAO;gBACZ,GAAG,EAAE,OAAO;aACZ;SACD,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,2CAA2C;QAEhE,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;QACxD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,OAAO,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACrB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,YAAY,GAAG,OAAO,CAAC,eAAe,CAAC,QAAQ,EAAE;YACtD,IAAI,EAAE,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC;YAC/C,KAAK,EAAE,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;SAC9E,CAAC,CAAC;QACH,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAE9C,MAAM,WAAW,GAAG;YACnB,IAAI,EAAE,KAAK;YACX,KAAK,EAAE;gBACN,IAAI,EAAE,KAAK;gBACX,KAAK,EAAE,SAAS;aAChB;SACD,CAAC;QAEF,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC;QAC/E,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,2CAA2C;QAEhE,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,EAAE,YAAY,EAAE,MAAM,CAAC,CAAC;QAE3D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAClC,MAAM,CAAC,OAAO,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC7B,EAAE,CAAC,KAAK,EAAE,GAAG,EAAE;QACd,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAE/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC,EAAE,MAAM,EAAE,WAAW,EAAE,EAAE,EAAE,CAAC,CAAC;QACnF,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,2CAA2C;QAEhE,kEAAkE;QAClE,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;QACtB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QAC/D,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAE/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC;YACrD,MAAM;YACN,WAAW,EAAE,KAAK;SAClB,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,2CAA2C;QAEhE,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,YAAY,EAAE,GAAG,EAAE;QACrB,MAAM,OAAO,GAAG,IAAI,aAAa,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QACrD,MAAM,WAAW,GAAG,aAAa,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;QACnF,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAE/C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,yBAAyB,CAAC;YACrD,MAAM;YACN,WAAW,EAAE,aAAa;SAC1B,CAAC,CAAC;QACH,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,2CAA2C;QAEhE,kEAAkE;QAClE,MAAM,OAAO,GAAG,YAAY,CAAC,OAAO,EAAE,WAAW,EAAE,MAAM,CAAC,CAAC;QAC3D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n/* eslint-disable import/no-internal-modules */\n\nimport { strict as assert } from \"node:assert\";\n\nimport {\n\tFieldAnchor,\n\tITreeSubscriptionCursor,\n\tTreeNavigationResult,\n\trootFieldKey,\n} from \"../../../core/index.js\";\nimport { SchemaBuilder, leaf, leaf as leafDomain } from \"../../../domains/index.js\";\nimport {\n\tFlexAllowedTypes,\n\tAny,\n\tFlexFieldKind,\n\tFieldKinds,\n\tFlexFieldSchema,\n} from \"../../../feature-libraries/index.js\";\nimport { Context } from \"../../../feature-libraries/flex-tree/context.js\";\nimport {\n\tunboxedField,\n\tunboxedTree,\n\tunboxedUnion,\n} from \"../../../feature-libraries/flex-tree/unboxed.js\";\nimport { type TreeContent } from \"../../../shared-tree/index.js\";\nimport { contextWithContentReadonly } from \"./utils.js\";\n\nconst rootFieldAnchor: FieldAnchor = { parent: undefined, fieldKey: rootFieldKey };\n\n/**\n * Creates a cursor from the provided `context` and moves it to the provided `anchor`.\n */\nfunction initializeCursor(context: Context, anchor: FieldAnchor): ITreeSubscriptionCursor {\n\tconst cursor = context.forest.allocateCursor();\n\n\tassert.equal(context.forest.tryMoveCursorToField(anchor, cursor), TreeNavigationResult.Ok);\n\treturn cursor;\n}\n\n/**\n * Initializes a test tree, context, and cursor, and moves the cursor to the tree's root.\n *\n * @returns The initialized context and cursor.\n */\nfunction initializeTreeWithContent<Kind extends FlexFieldKind, Types extends FlexAllowedTypes>(\n\ttreeContent: TreeContent,\n): {\n\tcontext: Context;\n\tcursor: ITreeSubscriptionCursor;\n} {\n\tconst context = contextWithContentReadonly(treeContent);\n\tconst cursor = initializeCursor(context, rootFieldAnchor);\n\n\treturn {\n\t\tcontext,\n\t\tcursor,\n\t};\n}\n\ndescribe(\"unboxedField\", () => {\n\tdescribe(\"Optional field\", () => {\n\t\tit(\"No value\", () => {\n\t\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\t\tconst fieldSchema = SchemaBuilder.optional(leafDomain.number);\n\t\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\t\tconst { context, cursor } = initializeTreeWithContent({\n\t\t\t\tschema,\n\t\t\t\tinitialTree: undefined,\n\t\t\t});\n\n\t\t\tassert.equal(unboxedField(context, fieldSchema, cursor), undefined);\n\t\t});\n\n\t\tit(\"With value (leaf)\", () => {\n\t\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\t\tconst fieldSchema = SchemaBuilder.optional(leafDomain.number);\n\t\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\t\tconst { context, cursor } = initializeTreeWithContent({\n\t\t\t\tschema,\n\t\t\t\tinitialTree: 42,\n\t\t\t});\n\n\t\t\tassert.equal(unboxedField(context, fieldSchema, cursor), 42);\n\t\t});\n\t});\n\n\tit(\"Required field (object)\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst objectSchema = builder.objectRecursive(\"object\", {\n\t\t\tname: SchemaBuilder.required(leafDomain.string),\n\t\t\tchild: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => objectSchema]),\n\t\t});\n\t\tconst fieldSchema = SchemaBuilder.optional(objectSchema);\n\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\tconst initialTree = {\n\t\t\tname: \"Foo\",\n\t\t\tchild: {\n\t\t\t\tname: \"Bar\",\n\t\t\t\tchild: undefined,\n\t\t\t},\n\t\t};\n\n\t\tconst { context, cursor } = initializeTreeWithContent({ schema, initialTree });\n\n\t\tconst unboxed = unboxedField(context, fieldSchema, cursor);\n\t\tassert(unboxed !== undefined);\n\t\tassert.equal(unboxed.schema, objectSchema);\n\t\tassert.equal(unboxed.name, \"Foo\");\n\n\t\tconst unboxedChild = unboxed.child;\n\t\tassert(unboxedChild !== undefined);\n\t\tassert.equal(unboxedChild.schema, objectSchema);\n\t\tassert.equal(unboxedChild.name, \"Bar\");\n\t\tassert.equal(unboxedChild.child, undefined);\n\t});\n\n\tit(\"Sequence field\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst fieldSchema = SchemaBuilder.sequence(leafDomain.string);\n\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\tconst { context, cursor } = initializeTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: [\"Hello\", \"world\"],\n\t\t});\n\n\t\tconst unboxed = unboxedField(context, fieldSchema, cursor);\n\n\t\tassert.deepEqual([...unboxed], [\"Hello\", \"world\"]);\n\t});\n\n\tit(\"Schema: Any\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst fieldSchema = SchemaBuilder.optional(Any);\n\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\tconst { context, cursor } = initializeTreeWithContent({ schema, initialTree: 42 });\n\n\t\t// Type is not known based on schema, so node will not be unboxed.\n\t\tconst unboxed = unboxedField(context, fieldSchema, cursor);\n\t\tassert(unboxed !== undefined);\n\t\tassert.equal(unboxed.schema, leaf.number);\n\t\tassert.equal(unboxed.value, 42);\n\t});\n});\n\ndescribe(\"unboxedTree\", () => {\n\tit(\"Leaf\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst schema = builder.intoSchema(leafDomain.string);\n\n\t\tconst { context, cursor } = initializeTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: \"Hello world\",\n\t\t});\n\t\tcursor.enterNode(0); // Root node field has 1 node; move into it\n\n\t\tassert.equal(unboxedTree(context, leafDomain.string, cursor), \"Hello world\");\n\t});\n\n\tit(\"Map\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst mapSchema = builder.map(\"map\", builder.optional(leafDomain.string));\n\t\tconst rootSchema = SchemaBuilder.optional(mapSchema);\n\t\tconst schema = builder.intoSchema(rootSchema);\n\n\t\tconst { context, cursor } = initializeTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: {\n\t\t\t\tfoo: \"Hello\",\n\t\t\t\tbar: \"world\",\n\t\t\t},\n\t\t});\n\t\tcursor.enterNode(0); // Root node field has 1 node; move into it\n\n\t\tconst unboxed = unboxedTree(context, mapSchema, cursor);\n\t\tassert.equal(unboxed.size, 2);\n\t\tassert.equal(unboxed.get(\"foo\"), \"Hello\");\n\t\tassert.equal(unboxed.get(\"bar\"), \"world\");\n\t});\n\n\tit(\"ObjectNode\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst objectSchema = builder.objectRecursive(\"object\", {\n\t\t\tname: SchemaBuilder.required(leafDomain.string),\n\t\t\tchild: FlexFieldSchema.createUnsafe(FieldKinds.optional, [() => objectSchema]),\n\t\t});\n\t\tconst rootSchema = builder.optional(objectSchema);\n\t\tconst schema = builder.intoSchema(rootSchema);\n\n\t\tconst initialTree = {\n\t\t\tname: \"Foo\",\n\t\t\tchild: {\n\t\t\t\tname: \"Bar\",\n\t\t\t\tchild: undefined,\n\t\t\t},\n\t\t};\n\n\t\tconst { context, cursor } = initializeTreeWithContent({ schema, initialTree });\n\t\tcursor.enterNode(0); // Root node field has 1 node; move into it\n\n\t\tconst unboxed = unboxedTree(context, objectSchema, cursor);\n\n\t\tassert.equal(unboxed.name, \"Foo\");\n\t\tassert(unboxed.child !== undefined);\n\t\tassert.equal(unboxed.child.name, \"Bar\");\n\t\tassert.equal(unboxed.child.child, undefined);\n\t});\n});\n\ndescribe(\"unboxedUnion\", () => {\n\tit(\"Any\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst fieldSchema = SchemaBuilder.optional(Any);\n\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\tconst { context, cursor } = initializeTreeWithContent({ schema, initialTree: 42 });\n\t\tcursor.enterNode(0); // Root node field has 1 node; move into it\n\n\t\t// Type is not known based on schema, so node will not be unboxed.\n\t\tconst unboxed = unboxedUnion(context, fieldSchema, cursor);\n\t\tassert.equal(unboxed.schema, leaf.number);\n\t\tassert.equal(unboxed.value, 42);\n\t});\n\n\tit(\"Single type\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst fieldSchema = SchemaBuilder.required(leafDomain.boolean);\n\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\tconst { context, cursor } = initializeTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: false,\n\t\t});\n\t\tcursor.enterNode(0); // Root node field has 1 node; move into it\n\n\t\tassert.equal(unboxedUnion(context, fieldSchema, cursor), false);\n\t});\n\n\tit(\"Multi-type\", () => {\n\t\tconst builder = new SchemaBuilder({ scope: \"test\" });\n\t\tconst fieldSchema = SchemaBuilder.optional([leafDomain.string, leafDomain.handle]);\n\t\tconst schema = builder.intoSchema(fieldSchema);\n\n\t\tconst { context, cursor } = initializeTreeWithContent({\n\t\t\tschema,\n\t\t\tinitialTree: \"Hello world\",\n\t\t});\n\t\tcursor.enterNode(0); // Root node field has 1 node; move into it\n\n\t\t// Type is not known based on schema, so node will not be unboxed.\n\t\tconst unboxed = unboxedUnion(context, fieldSchema, cursor);\n\t\tassert.equal(unboxed.schema, leaf.string);\n\t\tassert.equal(unboxed.value, \"Hello world\");\n\t});\n});\n"]}

package/lib/test/feature-libraries/flex-tree/utilities.spec.d.ts

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

package/lib/test/feature-libraries/flex-tree/utilities.spec.d.ts.map

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

package/lib/test/feature-libraries/flex-tree/utilities.spec.js

@@ -1,109 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { TreeStatus } from "../../../feature-libraries/index.js";
-import { AnchorSet, rootFieldKey, keyAsDetachedField } from "../../../core/index.js";
-import { brand } from "../../../util/index.js";
-import { detachedFieldSlot, treeStatusFromAnchorCache, treeStatusFromDetachedField,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/flex-tree/utilities.js";
-import { applyTestDelta } from "../../utils.js";
-describe("flex-tree utilities", () => {
-    describe("treeStatusFromAnchorCache", () => {
-        it("root detachedField returns TreeStatus.InDocument", () => {
-            const anchors = new AnchorSet();
-            assert(anchors.generationNumber === 0);
-            const anchor0 = anchors.track({
-                parent: undefined,
-                parentField: rootFieldKey,
-                parentIndex: 0,
-            });
-            const anchorNode0 = anchors.locate(anchor0);
-            assert(anchorNode0 !== undefined);
-            // Checks that treeStatusFromAnchorCache returns the correct TreeStatus.
-            assert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.InDocument);
-        });
-        it("non-root detachedField returns TreeStatus.Removed", () => {
-            const anchors = new AnchorSet();
-            assert(anchors.generationNumber === 0);
-            const testFieldKey = brand("testFieldKey");
-            const anchor0 = anchors.track({
-                parent: undefined,
-                parentField: testFieldKey,
-                parentIndex: 0,
-            });
-            const anchorNode0 = anchors.locate(anchor0);
-            assert(anchorNode0 !== undefined);
-            // Checks that treeStatusFromAnchorCache returns the correct TreeStatus.
-            assert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.Removed);
-        });
-        it("uses cached field only when cache is not stale", () => {
-            const anchors = new AnchorSet();
-            assert(anchors.generationNumber === 0);
-            const anchor0 = anchors.track({
-                parent: undefined,
-                parentField: rootFieldKey,
-                parentIndex: 0,
-            });
-            const anchorNode0 = anchors.locate(anchor0);
-            assert(anchorNode0 !== undefined);
-            // Checks that treeStatus is TreeStatus.InDocument
-            assert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.InDocument);
-            // Manually set cache to a non-root detachedField to check if it's being used.
-            const testFieldKey = brand("testFieldKey");
-            anchorNode0.slots.set(detachedFieldSlot, {
-                generationNumber: 0,
-                detachedField: keyAsDetachedField(testFieldKey),
-            });
-            assert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.Removed);
-            // Applies a dummy delta to increment anchorSet generationNumber.
-            applyTestDelta(new Map([]), anchors);
-            // Checks that the treeStatus is no longer being read from stale cache.
-            assert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.InDocument);
-        });
-        it("correctly sets and updates cache", () => {
-            const anchors = new AnchorSet();
-            assert(anchors.generationNumber === 0);
-            const anchor0 = anchors.track({
-                parent: undefined,
-                parentField: rootFieldKey,
-                parentIndex: 0,
-            });
-            const anchorNode0 = anchors.locate(anchor0);
-            assert(anchorNode0 !== undefined);
-            // Checks that the initial cache is undefined.
-            assert(anchorNode0.slots.get(detachedFieldSlot) === undefined);
-            const expectedCache = {
-                generationNumber: 0,
-                detachedField: keyAsDetachedField(rootFieldKey),
-            };
-            // Checks that the cache is updated to the expected value after calling treeStatusFromAnchorCache.
-            treeStatusFromAnchorCache(anchors, anchorNode0);
-            assert.deepEqual(anchorNode0.slots.get(detachedFieldSlot), expectedCache);
-            // Applies a dummy delta to increment anchorSet generationNumber.
-            applyTestDelta(new Map([]), anchors);
-            // Checks that the cache generationNumber is mismatched with anchorSet generationNumber.
-            assert.notEqual(anchorNode0.slots.get(detachedFieldSlot)?.generationNumber, anchors.generationNumber);
-            const expectedUpdatedCache = {
-                generationNumber: 1,
-                detachedField: keyAsDetachedField(rootFieldKey),
-            };
-            // Calls treeStatusFromAnchorCache and checks if cache is updated.
-            treeStatusFromAnchorCache(anchors, anchorNode0);
-            assert.deepEqual(anchorNode0.slots.get(detachedFieldSlot), expectedUpdatedCache);
-        });
-    });
-    describe("treeStatusFromDetachedField", () => {
-        it("returns TreeStatus.InDocument for root detachedField", () => {
-            assert(treeStatusFromDetachedField(keyAsDetachedField(rootFieldKey)) ===
-                TreeStatus.InDocument);
-        });
-        it("returns TreeStatus.Removed for non-root detachedField", () => {
-            assert(treeStatusFromDetachedField(keyAsDetachedField(brand("testKey"))) ===
-                TreeStatus.Removed);
-        });
-    });
-});
-//# sourceMappingURL=utilities.spec.js.map

package/lib/test/feature-libraries/flex-tree/utilities.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"utilities.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/flex-tree/utilities.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,UAAU,EAAE,MAAM,qCAAqC,CAAC;AACjE,OAAO,EAAY,SAAS,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAC/F,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EACN,iBAAiB,EACjB,yBAAyB,EACzB,2BAA2B;AAC3B,sDAAsD;EACtD,MAAM,mDAAmD,CAAC;AAC3D,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACpC,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QAC1C,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YAC3D,MAAM,OAAO,GAAG,IAAI,SAAS,EAAE,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,gBAAgB,KAAK,CAAC,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;gBAC7B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,YAAY;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;YAElC,wEAAwE;YACxE,MAAM,CAAC,yBAAyB,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,UAAU,CAAC,UAAU,CAAC,CAAC;QACnF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YAC5D,MAAM,OAAO,GAAG,IAAI,SAAS,EAAE,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,gBAAgB,KAAK,CAAC,CAAC,CAAC;YACvC,MAAM,YAAY,GAAa,KAAK,CAAC,cAAc,CAAC,CAAC;YACrD,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;gBAC7B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,YAAY;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;YAElC,wEAAwE;YACxE,MAAM,CAAC,yBAAyB,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;YACzD,MAAM,OAAO,GAAG,IAAI,SAAS,EAAE,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,gBAAgB,KAAK,CAAC,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;gBAC7B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,YAAY;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;YAElC,kDAAkD;YAClD,MAAM,CAAC,yBAAyB,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,UAAU,CAAC,UAAU,CAAC,CAAC;YAElF,8EAA8E;YAC9E,MAAM,YAAY,GAAa,KAAK,CAAC,cAAc,CAAC,CAAC;YACrD,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,EAAE;gBACxC,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,kBAAkB,CAAC,YAAY,CAAC;aAC/C,CAAC,CAAC;YACH,MAAM,CAAC,yBAAyB,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,UAAU,CAAC,OAAO,CAAC,CAAC;YAE/E,iEAAiE;YACjE,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YACrC,uEAAuE;YACvE,MAAM,CAAC,yBAAyB,CAAC,OAAO,EAAE,WAAW,CAAC,KAAK,UAAU,CAAC,UAAU,CAAC,CAAC;QACnF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC3C,MAAM,OAAO,GAAG,IAAI,SAAS,EAAE,CAAC;YAChC,MAAM,CAAC,OAAO,CAAC,gBAAgB,KAAK,CAAC,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC;gBAC7B,MAAM,EAAE,SAAS;gBACjB,WAAW,EAAE,YAAY;gBACzB,WAAW,EAAE,CAAC;aACd,CAAC,CAAC;YACH,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC;YAElC,8CAA8C;YAC9C,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,KAAK,SAAS,CAAC,CAAC;YAE/D,MAAM,aAAa,GAAG;gBACrB,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,kBAAkB,CAAC,YAAY,CAAC;aAC/C,CAAC;YAEF,kGAAkG;YAClG,yBAAyB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAChD,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,aAAa,CAAC,CAAC;YAE1E,iEAAiE;YACjE,cAAc,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;YAErC,wFAAwF;YACxF,MAAM,CAAC,QAAQ,CACd,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,gBAAgB,EAC1D,OAAO,CAAC,gBAAgB,CACxB,CAAC;YAEF,MAAM,oBAAoB,GAAG;gBAC5B,gBAAgB,EAAE,CAAC;gBACnB,aAAa,EAAE,kBAAkB,CAAC,YAAY,CAAC;aAC/C,CAAC;YACF,kEAAkE;YAClE,yBAAyB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;YAChD,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,KAAK,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,oBAAoB,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,6BAA6B,EAAE,GAAG,EAAE;QAC5C,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC/D,MAAM,CACL,2BAA2B,CAAC,kBAAkB,CAAC,YAAY,CAAC,CAAC;gBAC5D,UAAU,CAAC,UAAU,CACtB,CAAC;QACH,CAAC,CAAC,CAAC;QACH,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAChE,MAAM,CACL,2BAA2B,CAAC,kBAAkB,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;gBAChE,UAAU,CAAC,OAAO,CACnB,CAAC;QACH,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 { strict as assert } from \"assert\";\nimport { TreeStatus } from \"../../../feature-libraries/index.js\";\nimport { FieldKey, AnchorSet, rootFieldKey, keyAsDetachedField } from \"../../../core/index.js\";\nimport { brand } from \"../../../util/index.js\";\nimport {\n\tdetachedFieldSlot,\n\ttreeStatusFromAnchorCache,\n\ttreeStatusFromDetachedField,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/flex-tree/utilities.js\";\nimport { applyTestDelta } from \"../../utils.js\";\n\ndescribe(\"flex-tree utilities\", () => {\n\tdescribe(\"treeStatusFromAnchorCache\", () => {\n\t\tit(\"root detachedField returns TreeStatus.InDocument\", () => {\n\t\t\tconst anchors = new AnchorSet();\n\t\t\tassert(anchors.generationNumber === 0);\n\t\t\tconst anchor0 = anchors.track({\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: rootFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t});\n\t\t\tconst anchorNode0 = anchors.locate(anchor0);\n\t\t\tassert(anchorNode0 !== undefined);\n\n\t\t\t// Checks that treeStatusFromAnchorCache returns the correct TreeStatus.\n\t\t\tassert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.InDocument);\n\t\t});\n\n\t\tit(\"non-root detachedField returns TreeStatus.Removed\", () => {\n\t\t\tconst anchors = new AnchorSet();\n\t\t\tassert(anchors.generationNumber === 0);\n\t\t\tconst testFieldKey: FieldKey = brand(\"testFieldKey\");\n\t\t\tconst anchor0 = anchors.track({\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: testFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t});\n\t\t\tconst anchorNode0 = anchors.locate(anchor0);\n\t\t\tassert(anchorNode0 !== undefined);\n\n\t\t\t// Checks that treeStatusFromAnchorCache returns the correct TreeStatus.\n\t\t\tassert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.Removed);\n\t\t});\n\n\t\tit(\"uses cached field only when cache is not stale\", () => {\n\t\t\tconst anchors = new AnchorSet();\n\t\t\tassert(anchors.generationNumber === 0);\n\t\t\tconst anchor0 = anchors.track({\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: rootFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t});\n\t\t\tconst anchorNode0 = anchors.locate(anchor0);\n\t\t\tassert(anchorNode0 !== undefined);\n\n\t\t\t// Checks that treeStatus is TreeStatus.InDocument\n\t\t\tassert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.InDocument);\n\n\t\t\t// Manually set cache to a non-root detachedField to check if it's being used.\n\t\t\tconst testFieldKey: FieldKey = brand(\"testFieldKey\");\n\t\t\tanchorNode0.slots.set(detachedFieldSlot, {\n\t\t\t\tgenerationNumber: 0,\n\t\t\t\tdetachedField: keyAsDetachedField(testFieldKey),\n\t\t\t});\n\t\t\tassert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.Removed);\n\n\t\t\t// Applies a dummy delta to increment anchorSet generationNumber.\n\t\t\tapplyTestDelta(new Map([]), anchors);\n\t\t\t// Checks that the treeStatus is no longer being read from stale cache.\n\t\t\tassert(treeStatusFromAnchorCache(anchors, anchorNode0) === TreeStatus.InDocument);\n\t\t});\n\n\t\tit(\"correctly sets and updates cache\", () => {\n\t\t\tconst anchors = new AnchorSet();\n\t\t\tassert(anchors.generationNumber === 0);\n\t\t\tconst anchor0 = anchors.track({\n\t\t\t\tparent: undefined,\n\t\t\t\tparentField: rootFieldKey,\n\t\t\t\tparentIndex: 0,\n\t\t\t});\n\t\t\tconst anchorNode0 = anchors.locate(anchor0);\n\t\t\tassert(anchorNode0 !== undefined);\n\n\t\t\t// Checks that the initial cache is undefined.\n\t\t\tassert(anchorNode0.slots.get(detachedFieldSlot) === undefined);\n\n\t\t\tconst expectedCache = {\n\t\t\t\tgenerationNumber: 0,\n\t\t\t\tdetachedField: keyAsDetachedField(rootFieldKey),\n\t\t\t};\n\n\t\t\t// Checks that the cache is updated to the expected value after calling treeStatusFromAnchorCache.\n\t\t\ttreeStatusFromAnchorCache(anchors, anchorNode0);\n\t\t\tassert.deepEqual(anchorNode0.slots.get(detachedFieldSlot), expectedCache);\n\n\t\t\t// Applies a dummy delta to increment anchorSet generationNumber.\n\t\t\tapplyTestDelta(new Map([]), anchors);\n\n\t\t\t// Checks that the cache generationNumber is mismatched with anchorSet generationNumber.\n\t\t\tassert.notEqual(\n\t\t\t\tanchorNode0.slots.get(detachedFieldSlot)?.generationNumber,\n\t\t\t\tanchors.generationNumber,\n\t\t\t);\n\n\t\t\tconst expectedUpdatedCache = {\n\t\t\t\tgenerationNumber: 1,\n\t\t\t\tdetachedField: keyAsDetachedField(rootFieldKey),\n\t\t\t};\n\t\t\t// Calls treeStatusFromAnchorCache and checks if cache is updated.\n\t\t\ttreeStatusFromAnchorCache(anchors, anchorNode0);\n\t\t\tassert.deepEqual(anchorNode0.slots.get(detachedFieldSlot), expectedUpdatedCache);\n\t\t});\n\t});\n\n\tdescribe(\"treeStatusFromDetachedField\", () => {\n\t\tit(\"returns TreeStatus.InDocument for root detachedField\", () => {\n\t\t\tassert(\n\t\t\t\ttreeStatusFromDetachedField(keyAsDetachedField(rootFieldKey)) ===\n\t\t\t\t\tTreeStatus.InDocument,\n\t\t\t);\n\t\t});\n\t\tit(\"returns TreeStatus.Removed for non-root detachedField\", () => {\n\t\t\tassert(\n\t\t\t\ttreeStatusFromDetachedField(keyAsDetachedField(brand(\"testKey\"))) ===\n\t\t\t\t\tTreeStatus.Removed,\n\t\t\t);\n\t\t});\n\t});\n});\n"]}

package/lib/test/feature-libraries/flex-tree/utils.d.ts

@@ -1,32 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { FlexTreeSchema, FlexAllowedTypes, FlexFieldKind } from "../../../feature-libraries/index.js";
-import { Context } from "../../../feature-libraries/flex-tree/context.js";
-import { FieldAnchor, IEditableForest, ITreeSubscriptionCursor } from "../../../core/index.js";
-import { TreeContent } from "../../../shared-tree/index.js";
-export declare function getReadonlyContext(forest: IEditableForest, schema: FlexTreeSchema): Context;
-/**
- * Creates a context and its backing forest from the provided `content`.
- *
- * For creating mutable views use {@link viewWithContent}, but prefer this when possible as it has fewer dependencies and simpler setup.
- *
- * @returns The created context.
- */
-export declare function contextWithContentReadonly(content: TreeContent): Context;
-/**
- * Creates a cursor from the provided `context` and moves it to the provided `anchor`.
- */
-export declare function initializeCursor(context: Context, anchor: FieldAnchor): ITreeSubscriptionCursor;
-export declare const rootFieldAnchor: FieldAnchor;
-/**
- * Initializes a readonly test tree, context, and cursor, and moves the cursor to the tree's root.
- *
- * @returns The initialized context and cursor.
- */
-export declare function readonlyTreeWithContent<Kind extends FlexFieldKind, Types extends FlexAllowedTypes>(treeContent: TreeContent): {
-    context: Context;
-    cursor: ITreeSubscriptionCursor;
-};
-//# sourceMappingURL=utils.d.ts.map

package/lib/test/feature-libraries/flex-tree/utils.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../../../src/test/feature-libraries/flex-tree/utils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAEN,cAAc,EAGd,gBAAgB,EAChB,aAAa,EACb,MAAM,qCAAqC,CAAC;AAE7C,OAAO,EAAE,OAAO,EAAkB,MAAM,iDAAiD,CAAC;AAC1F,OAAO,EACN,WAAW,EACX,eAAe,EACf,uBAAuB,EAGvB,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,WAAW,EAAE,MAAM,+BAA+B,CAAC;AAI5D,wBAAgB,kBAAkB,CAAC,MAAM,EAAE,eAAe,EAAE,MAAM,EAAE,cAAc,GAAG,OAAO,CAU3F;AAED;;;;;;GAMG;AACH,wBAAgB,0BAA0B,CAAC,OAAO,EAAE,WAAW,GAAG,OAAO,CAGxE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,GAAG,uBAAuB,CAI/F;AAED,eAAO,MAAM,eAAe,EAAE,WAA2D,CAAC;AAE1F;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,IAAI,SAAS,aAAa,EAAE,KAAK,SAAS,gBAAgB,EACjG,WAAW,EAAE,WAAW,GACtB;IACF,OAAO,EAAE,OAAO,CAAC;IACjB,MAAM,EAAE,uBAAuB,CAAC;CAChC,CAQA"}

package/lib/test/feature-libraries/flex-tree/utils.js

@@ -1,50 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "node:assert";
-import { createMockNodeKeyManager, nodeKeyFieldKey, } from "../../../feature-libraries/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { getTreeContext } from "../../../feature-libraries/flex-tree/context.js";
-import { rootFieldKey, } from "../../../core/index.js";
-import { forestWithContent } from "../../utils.js";
-import { brand } from "../../../util/index.js";
-export function getReadonlyContext(forest, schema) {
-    // This will error if someone tries to call mutation methods on it
-    const dummyEditor = {};
-    return getTreeContext(schema, forest, dummyEditor, createMockNodeKeyManager(), brand(nodeKeyFieldKey));
-}
-/**
- * Creates a context and its backing forest from the provided `content`.
- *
- * For creating mutable views use {@link viewWithContent}, but prefer this when possible as it has fewer dependencies and simpler setup.
- *
- * @returns The created context.
- */
-export function contextWithContentReadonly(content) {
-    const forest = forestWithContent(content);
-    return getReadonlyContext(forest, content.schema);
-}
-/**
- * Creates a cursor from the provided `context` and moves it to the provided `anchor`.
- */
-export function initializeCursor(context, anchor) {
-    const cursor = context.forest.allocateCursor();
-    assert.equal(context.forest.tryMoveCursorToField(anchor, cursor), 1 /* TreeNavigationResult.Ok */);
-    return cursor;
-}
-export const rootFieldAnchor = { parent: undefined, fieldKey: rootFieldKey };
-/**
- * Initializes a readonly test tree, context, and cursor, and moves the cursor to the tree's root.
- *
- * @returns The initialized context and cursor.
- */
-export function readonlyTreeWithContent(treeContent) {
-    const context = contextWithContentReadonly(treeContent);
-    const cursor = initializeCursor(context, rootFieldAnchor);
-    return {
-        context,
-        cursor,
-    };
-}
-//# sourceMappingURL=utils.js.map

package/lib/test/feature-libraries/flex-tree/utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/flex-tree/utils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,aAAa,CAAC;AAC/C,OAAO,EAGN,wBAAwB,EACxB,eAAe,GAGf,MAAM,qCAAqC,CAAC;AAC7C,sDAAsD;AACtD,OAAO,EAAW,cAAc,EAAE,MAAM,iDAAiD,CAAC;AAC1F,OAAO,EAKN,YAAY,GACZ,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,iBAAiB,EAAE,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,MAAM,UAAU,kBAAkB,CAAC,MAAuB,EAAE,MAAsB;IACjF,kEAAkE;IAClE,MAAM,WAAW,GAAG,EAAmC,CAAC;IACxD,OAAO,cAAc,CACpB,MAAM,EACN,MAAM,EACN,WAAW,EACX,wBAAwB,EAAE,EAC1B,KAAK,CAAC,eAAe,CAAC,CACtB,CAAC;AACH,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,0BAA0B,CAAC,OAAoB;IAC9D,MAAM,MAAM,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IAC1C,OAAO,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAgB,EAAE,MAAmB;IACrE,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IAC/C,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,kCAA0B,CAAC;IAC3F,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,CAAC,MAAM,eAAe,GAAgB,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,CAAC;AAE1F;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CACtC,WAAwB;IAKxB,MAAM,OAAO,GAAG,0BAA0B,CAAC,WAAW,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,EAAE,eAAe,CAAC,CAAC;IAE1D,OAAO;QACN,OAAO;QACP,MAAM;KACN,CAAC;AACH,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 \"node:assert\";\nimport {\n\tDefaultEditBuilder,\n\tFlexTreeSchema,\n\tcreateMockNodeKeyManager,\n\tnodeKeyFieldKey,\n\tFlexAllowedTypes,\n\tFlexFieldKind,\n} from \"../../../feature-libraries/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { Context, getTreeContext } from \"../../../feature-libraries/flex-tree/context.js\";\nimport {\n\tFieldAnchor,\n\tIEditableForest,\n\tITreeSubscriptionCursor,\n\tTreeNavigationResult,\n\trootFieldKey,\n} from \"../../../core/index.js\";\nimport { TreeContent } from \"../../../shared-tree/index.js\";\nimport { forestWithContent } from \"../../utils.js\";\nimport { brand } from \"../../../util/index.js\";\n\nexport function getReadonlyContext(forest: IEditableForest, schema: FlexTreeSchema): Context {\n\t// This will error if someone tries to call mutation methods on it\n\tconst dummyEditor = {} as unknown as DefaultEditBuilder;\n\treturn getTreeContext(\n\t\tschema,\n\t\tforest,\n\t\tdummyEditor,\n\t\tcreateMockNodeKeyManager(),\n\t\tbrand(nodeKeyFieldKey),\n\t);\n}\n\n/**\n * Creates a context and its backing forest from the provided `content`.\n *\n * For creating mutable views use {@link viewWithContent}, but prefer this when possible as it has fewer dependencies and simpler setup.\n *\n * @returns The created context.\n */\nexport function contextWithContentReadonly(content: TreeContent): Context {\n\tconst forest = forestWithContent(content);\n\treturn getReadonlyContext(forest, content.schema);\n}\n\n/**\n * Creates a cursor from the provided `context` and moves it to the provided `anchor`.\n */\nexport function initializeCursor(context: Context, anchor: FieldAnchor): ITreeSubscriptionCursor {\n\tconst cursor = context.forest.allocateCursor();\n\tassert.equal(context.forest.tryMoveCursorToField(anchor, cursor), TreeNavigationResult.Ok);\n\treturn cursor;\n}\n\nexport const rootFieldAnchor: FieldAnchor = { parent: undefined, fieldKey: rootFieldKey };\n\n/**\n * Initializes a readonly test tree, context, and cursor, and moves the cursor to the tree's root.\n *\n * @returns The initialized context and cursor.\n */\nexport function readonlyTreeWithContent<Kind extends FlexFieldKind, Types extends FlexAllowedTypes>(\n\ttreeContent: TreeContent,\n): {\n\tcontext: Context;\n\tcursor: ITreeSubscriptionCursor;\n} {\n\tconst context = contextWithContentReadonly(treeContent);\n\tconst cursor = initializeCursor(context, rootFieldAnchor);\n\n\treturn {\n\t\tcontext,\n\t\tcursor,\n\t};\n}\n"]}

package/lib/test/feature-libraries/forest-summary/forestSummarizerCodec.spec.d.ts

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

package/lib/test/feature-libraries/forest-summary/forestSummarizerCodec.spec.d.ts.map

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

package/lib/test/feature-libraries/forest-summary/forestSummarizerCodec.spec.js

@@ -1,115 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { validateAssertionError } from "@fluidframework/test-runtime-utils";
-import { rootFieldKey } from "../../../core/index.js";
-import { TreeCompressionStrategy, cursorForJsonableTreeField, makeFieldBatchCodec, } from "../../../feature-libraries/index.js";
-import { makeForestSummarizerCodec,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/forest-summary/codec.js";
-import { emptySchema } from "../../cursorTestSuite.js";
-// eslint-disable-next-line import/no-internal-modules
-import { version } from "../../../feature-libraries/forest-summary/format.js";
-import { chunkField, defaultChunkPolicy,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/chunked-forest/chunkTree.js";
-import { brand } from "../../../util/index.js";
-import { typeboxValidator } from "../../../external-utilities/index.js";
-const codecOptions = { jsonValidator: typeboxValidator };
-const fieldBatchCodec = makeFieldBatchCodec(codecOptions);
-const context = {
-    encodeType: TreeCompressionStrategy.Uncompressed,
-};
-const codec = makeForestSummarizerCodec(codecOptions, fieldBatchCodec);
-const testFieldChunks = chunkField(cursorForJsonableTreeField([{ type: emptySchema.name }]), defaultChunkPolicy);
-assert(testFieldChunks.length === 1);
-const testFieldChunk = testFieldChunks[0];
-const malformedData = [
-    [
-        "additional piece of data in entry",
-        new Map([[rootFieldKey, [testFieldChunk.cursor(), "additional data"]]]),
-    ],
-    ["incorrect data type", ["incorrect data type"]],
-];
-const validData = [
-    [
-        "no entry",
-        new Map(),
-        {
-            version,
-            keys: [],
-            fields: fieldBatchCodec.encode([], context),
-        },
-    ],
-    [
-        "single entry",
-        new Map([[rootFieldKey, testFieldChunk.cursor()]]),
-        {
-            version,
-            keys: [rootFieldKey],
-            fields: fieldBatchCodec.encode([testFieldChunk.cursor()], context),
-        },
-    ],
-    [
-        "multiple entries",
-        new Map([
-            [rootFieldKey, testFieldChunk.cursor()],
-            [brand("X"), testFieldChunk.cursor()],
-        ]),
-        undefined,
-    ],
-];
-describe("ForestSummarizerCodec", () => {
-    describe("encodes and decodes valid data.", () => {
-        for (const [name, data, expected] of validData) {
-            it(name, () => {
-                const encodedData = codec.encode(data, context);
-                if (expected !== undefined) {
-                    assert.deepEqual(encodedData, expected);
-                }
-                const decodedData = codec.decode(encodedData, context);
-                assert.deepEqual(decodedData, data);
-            });
-        }
-    });
-    describe("throws on receiving malformed data during encode.", () => {
-        for (const [name, data] of malformedData) {
-            it(name, () => {
-                assert.throws(() => codec.encode(data, context), "malformed data");
-            });
-        }
-    });
-    describe("throws on receiving malformed data during decode.", () => {
-        it("invalid version", () => {
-            assert.throws(() => codec.decode({
-                version: 2.0,
-                fields: { version: 1 },
-                keys: [],
-            }, context), (e) => validateAssertionError(e, "version being decoded is not supported"));
-        });
-        it("invalid nested version", () => {
-            assert.throws(() => codec.decode({
-                version: 1.0,
-                fields: { version: 2 },
-                keys: [],
-            }, context), (e) => validateAssertionError(e, "version being decoded is not supported"));
-        });
-        it("missing fields", () => {
-            assert.throws(() => codec.decode({
-                version: 1.0,
-                keys: [],
-            }, context), (e) => validateAssertionError(e, "Encoded schema should validate"));
-        });
-        it("extra field", () => {
-            assert.throws(() => codec.decode({
-                version: 1.0,
-                fields: { version: 1 },
-                keys: [],
-                wrong: 5,
-            }, context), (e) => validateAssertionError(e, "Encoded schema should validate"));
-        });
-    });
-});
-//# sourceMappingURL=forestSummarizerCodec.spec.js.map

package/lib/test/feature-libraries/forest-summary/forestSummarizerCodec.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"forestSummarizerCodec.spec.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/forest-summary/forestSummarizerCodec.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EAAE,sBAAsB,EAAE,MAAM,oCAAoC,CAAC;AAC5E,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EACN,uBAAuB,EACvB,0BAA0B,EAC1B,mBAAmB,GACnB,MAAM,qCAAqC,CAAC;AAE7C,OAAO,EAEN,yBAAyB;AACzB,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,sDAAsD;AACtD,OAAO,EAAU,OAAO,EAAE,MAAM,qDAAqD,CAAC;AAGtF,OAAO,EACN,UAAU,EACV,kBAAkB;AAClB,sDAAsD;EACtD,MAAM,wDAAwD,CAAC;AAChE,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,sCAAsC,CAAC;AAExE,MAAM,YAAY,GAAkB,EAAE,aAAa,EAAE,gBAAgB,EAAE,CAAC;AACxE,MAAM,eAAe,GAAG,mBAAmB,CAAC,YAAY,CAAC,CAAC;AAC1D,MAAM,OAAO,GAAG;IACf,UAAU,EAAE,uBAAuB,CAAC,YAAY;CAChD,CAAC;AAEF,MAAM,KAAK,GAAG,yBAAyB,CAAC,YAAY,EAAE,eAAe,CAAC,CAAC;AAEvE,MAAM,eAAe,GAAgB,UAAU,CAC9C,0BAA0B,CAAC,CAAC,EAAE,IAAI,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,EACxD,kBAAkB,CAClB,CAAC;AACF,MAAM,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;AACrC,MAAM,cAAc,GAAc,eAAe,CAAC,CAAC,CAAC,CAAC;AAErD,MAAM,aAAa,GAAoB;IACtC;QACC,mCAAmC;QACnC,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,CAAC,cAAc,CAAC,MAAM,EAAE,EAAE,iBAAiB,CAAC,CAAC,CAAC,CAAC;KACvE;IACD,CAAC,qBAAqB,EAAE,CAAC,qBAAqB,CAAC,CAAC;CAChD,CAAC;AACF,MAAM,SAAS,GAA6C;IAC3D;QACC,UAAU;QACV,IAAI,GAAG,EAAE;QACT;YACC,OAAO;YACP,IAAI,EAAE,EAAE;YACR,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,EAAE,EAAE,OAAO,CAAC;SAC3C;KACD;IACD;QACC,cAAc;QACd,IAAI,GAAG,CAAC,CAAC,CAAC,YAAY,EAAE,cAAc,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAClD;YACC,OAAO;YACP,IAAI,EAAE,CAAC,YAAY,CAAC;YACpB,MAAM,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,CAAC;SAClE;KACD;IACD;QACC,kBAAkB;QAClB,IAAI,GAAG,CAAC;YACP,CAAC,YAAY,EAAE,cAAc,CAAC,MAAM,EAAE,CAAC;YACvC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,MAAM,EAAE,CAAC;SACrC,CAAC;QACF,SAAS;KACT;CACD,CAAC;AAEF,QAAQ,CAAC,uBAAuB,EAAE,GAAG,EAAE;IACtC,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;QAChD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,SAAS,EAAE;YAC/C,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;gBAChD,IAAI,QAAQ,KAAK,SAAS,EAAE;oBAC3B,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;iBACxC;gBAED,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;gBACvD,MAAM,CAAC,SAAS,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;YACrC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAClE,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,aAAa,EAAE;YACzC,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE;gBACb,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAA2B,EAAE,OAAO,CAAC,EACxD,gBAAgB,CAChB,CAAC;YACH,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAClE,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YAC1B,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CACJ,KAAK,CAAC,MAAM,CACX;gBACC,OAAO,EAAE,GAAoB;gBAC7B,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE;gBACtB,IAAI,EAAE,EAAE;aACR,EACD,OAAO,CACP,EACF,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,wCAAwC,CAAC,CACjF,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YACjC,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CACJ,KAAK,CAAC,MAAM,CACX;gBACC,OAAO,EAAE,GAAG;gBACZ,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE;gBACtB,IAAI,EAAE,EAAE;aACR,EACD,OAAO,CACP,EACF,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,wCAAwC,CAAC,CACjF,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzB,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CACJ,KAAK,CAAC,MAAM,CACX;gBACC,OAAO,EAAE,GAAG;gBACZ,IAAI,EAAE,EAAE;aACa,EACtB,OAAO,CACP,EACF,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,gCAAgC,CAAC,CACzE,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACtB,MAAM,CAAC,MAAM,CACZ,GAAG,EAAE,CACJ,KAAK,CAAC,MAAM,CACX;gBACC,OAAO,EAAE,GAAG;gBACZ,MAAM,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE;gBACtB,IAAI,EAAE,EAAE;gBACR,KAAK,EAAE,CAAC;aACa,EACtB,OAAO,CACP,EACF,CAAC,CAAQ,EAAE,EAAE,CAAC,sBAAsB,CAAC,CAAC,EAAE,gCAAgC,CAAC,CACzE,CAAC;QACH,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 { strict as assert } from \"assert\";\nimport { validateAssertionError } from \"@fluidframework/test-runtime-utils\";\nimport { rootFieldKey } from \"../../../core/index.js\";\nimport {\n\tTreeCompressionStrategy,\n\tcursorForJsonableTreeField,\n\tmakeFieldBatchCodec,\n} from \"../../../feature-libraries/index.js\";\n\nimport {\n\tFieldSet,\n\tmakeForestSummarizerCodec,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/forest-summary/codec.js\";\nimport { emptySchema } from \"../../cursorTestSuite.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { Format, version } from \"../../../feature-libraries/forest-summary/format.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { TreeChunk } from \"../../../feature-libraries/chunked-forest/index.js\";\nimport {\n\tchunkField,\n\tdefaultChunkPolicy,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/chunked-forest/chunkTree.js\";\nimport { brand } from \"../../../util/index.js\";\nimport { ICodecOptions } from \"../../../codec/index.js\";\nimport { typeboxValidator } from \"../../../external-utilities/index.js\";\n\nconst codecOptions: ICodecOptions = { jsonValidator: typeboxValidator };\nconst fieldBatchCodec = makeFieldBatchCodec(codecOptions);\nconst context = {\n\tencodeType: TreeCompressionStrategy.Uncompressed,\n};\n\nconst codec = makeForestSummarizerCodec(codecOptions, fieldBatchCodec);\n\nconst testFieldChunks: TreeChunk[] = chunkField(\n\tcursorForJsonableTreeField([{ type: emptySchema.name }]),\n\tdefaultChunkPolicy,\n);\nassert(testFieldChunks.length === 1);\nconst testFieldChunk: TreeChunk = testFieldChunks[0];\n\nconst malformedData: [string, any][] = [\n\t[\n\t\t\"additional piece of data in entry\",\n\t\tnew Map([[rootFieldKey, [testFieldChunk.cursor(), \"additional data\"]]]),\n\t],\n\t[\"incorrect data type\", [\"incorrect data type\"]],\n];\nconst validData: [string, FieldSet, Format | undefined][] = [\n\t[\n\t\t\"no entry\",\n\t\tnew Map(),\n\t\t{\n\t\t\tversion,\n\t\t\tkeys: [],\n\t\t\tfields: fieldBatchCodec.encode([], context),\n\t\t},\n\t],\n\t[\n\t\t\"single entry\",\n\t\tnew Map([[rootFieldKey, testFieldChunk.cursor()]]),\n\t\t{\n\t\t\tversion,\n\t\t\tkeys: [rootFieldKey],\n\t\t\tfields: fieldBatchCodec.encode([testFieldChunk.cursor()], context),\n\t\t},\n\t],\n\t[\n\t\t\"multiple entries\",\n\t\tnew Map([\n\t\t\t[rootFieldKey, testFieldChunk.cursor()],\n\t\t\t[brand(\"X\"), testFieldChunk.cursor()],\n\t\t]),\n\t\tundefined,\n\t],\n];\n\ndescribe(\"ForestSummarizerCodec\", () => {\n\tdescribe(\"encodes and decodes valid data.\", () => {\n\t\tfor (const [name, data, expected] of validData) {\n\t\t\tit(name, () => {\n\t\t\t\tconst encodedData = codec.encode(data, context);\n\t\t\t\tif (expected !== undefined) {\n\t\t\t\t\tassert.deepEqual(encodedData, expected);\n\t\t\t\t}\n\n\t\t\t\tconst decodedData = codec.decode(encodedData, context);\n\t\t\t\tassert.deepEqual(decodedData, data);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"throws on receiving malformed data during encode.\", () => {\n\t\tfor (const [name, data] of malformedData) {\n\t\t\tit(name, () => {\n\t\t\t\tassert.throws(\n\t\t\t\t\t() => codec.encode(data as unknown as FieldSet, context),\n\t\t\t\t\t\"malformed data\",\n\t\t\t\t);\n\t\t\t});\n\t\t}\n\t});\n\n\tdescribe(\"throws on receiving malformed data during decode.\", () => {\n\t\tit(\"invalid version\", () => {\n\t\t\tassert.throws(\n\t\t\t\t() =>\n\t\t\t\t\tcodec.decode(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tversion: 2.0 as number as 1.0,\n\t\t\t\t\t\t\tfields: { version: 1 },\n\t\t\t\t\t\t\tkeys: [],\n\t\t\t\t\t\t},\n\t\t\t\t\t\tcontext,\n\t\t\t\t\t),\n\t\t\t\t(e: Error) => validateAssertionError(e, \"version being decoded is not supported\"),\n\t\t\t);\n\t\t});\n\n\t\tit(\"invalid nested version\", () => {\n\t\t\tassert.throws(\n\t\t\t\t() =>\n\t\t\t\t\tcodec.decode(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tversion: 1.0,\n\t\t\t\t\t\t\tfields: { version: 2 },\n\t\t\t\t\t\t\tkeys: [],\n\t\t\t\t\t\t},\n\t\t\t\t\t\tcontext,\n\t\t\t\t\t),\n\t\t\t\t(e: Error) => validateAssertionError(e, \"version being decoded is not supported\"),\n\t\t\t);\n\t\t});\n\n\t\tit(\"missing fields\", () => {\n\t\t\tassert.throws(\n\t\t\t\t() =>\n\t\t\t\t\tcodec.decode(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tversion: 1.0,\n\t\t\t\t\t\t\tkeys: [],\n\t\t\t\t\t\t} as unknown as Format,\n\t\t\t\t\t\tcontext,\n\t\t\t\t\t),\n\t\t\t\t(e: Error) => validateAssertionError(e, \"Encoded schema should validate\"),\n\t\t\t);\n\t\t});\n\n\t\tit(\"extra field\", () => {\n\t\t\tassert.throws(\n\t\t\t\t() =>\n\t\t\t\t\tcodec.decode(\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tversion: 1.0,\n\t\t\t\t\t\t\tfields: { version: 1 },\n\t\t\t\t\t\t\tkeys: [],\n\t\t\t\t\t\t\twrong: 5,\n\t\t\t\t\t\t} as unknown as Format,\n\t\t\t\t\t\tcontext,\n\t\t\t\t\t),\n\t\t\t\t(e: Error) => validateAssertionError(e, \"Encoded schema should validate\"),\n\t\t\t);\n\t\t});\n\t});\n});\n"]}

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

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

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

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