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

package/lib/test/scalableTestTrees.js

@@ -1,188 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { FieldKinds, FlexFieldSchema, typeNameSymbol, SchemaBuilderBase, } from "../feature-libraries/index.js";
-import { leaf, jsonSchema } from "../domains/index.js";
-import { brand } from "../util/index.js";
-import { moveToDetachedField, rootFieldKey } from "../core/index.js";
-/**
- * Test trees which can be parametrically scaled to any size.
- */
-/**
- * Arbitrary key used when a field key is needed in this file.
- */
-export const localFieldKey = brand("foo");
-const deepBuilder = new SchemaBuilderBase(FieldKinds.required, {
-    scope: "scalable",
-    name: "sharedTree.bench: deep",
-    libraries: [jsonSchema],
-});
-// Test data in "deep" mode: a linked list with a number at the end.
-const linkedListSchema = deepBuilder.objectRecursive("linkedList", {
-    foo: FlexFieldSchema.createUnsafe(FieldKinds.required, [() => linkedListSchema, leaf.number]),
-});
-const wideBuilder = new SchemaBuilderBase(FieldKinds.required, {
-    scope: "scalable",
-    name: "sharedTree.bench: wide",
-    libraries: [jsonSchema],
-});
-export const wideRootSchema = wideBuilder.object("WideRoot", {
-    foo: FlexFieldSchema.create(FieldKinds.sequence, [leaf.number]),
-});
-export const wideSchema = wideBuilder.intoSchema(wideRootSchema);
-export const deepSchema = deepBuilder.intoSchema([linkedListSchema, leaf.number]);
-{
-}
-{
-}
-export function makeJsDeepTree(depth, leafValue) {
-    return depth === 0 ? leafValue : { foo: makeJsDeepTree(depth - 1, leafValue) };
-}
-export function makeDeepContent(depth, leafValue = 1) {
-    // Implicit type conversion is needed here to make this compile.
-    const initialTree = makeJsDeepTree(depth, leafValue);
-    return {
-        initialTree,
-        schema: deepSchema,
-    };
-}
-/**
- *
- * @param numberOfNodes - number of nodes of the tree
- * @param endLeafValue - the value of the end leaf of the tree
- * @returns a tree with specified number of nodes, with the end leaf node set to the endLeafValue
- */
-export function makeWideContentWithEndValue(numberOfNodes, endLeafValue) {
-    // Implicit type conversion is needed here to make this compile.
-    const initialTree = makeJsWideTreeWithEndValue(numberOfNodes, endLeafValue);
-    return {
-        initialTree,
-        schema: wideSchema,
-    };
-}
-/**
- *
- * @param numberOfNodes - number of nodes of the tree
- * @param endLeafValue - the value of the end leaf of the tree
- * @returns a tree with specified number of nodes, with the end leaf node set to the endLeafValue
- */
-export function makeJsWideTreeWithEndValue(numberOfNodes, endLeafValue) {
-    const numbers = [];
-    for (let index = 0; index < numberOfNodes - 1; index++) {
-        numbers.push(index);
-    }
-    numbers.push(endLeafValue);
-    return { foo: numbers };
-}
-export function readDeepTreeAsJSObject(tree) {
-    let currentNode = tree.foo;
-    let depth = 1;
-    let value = 0;
-    while (typeof currentNode !== "number") {
-        currentNode = currentNode.foo;
-        depth += 1;
-    }
-    if (typeof currentNode === "number") {
-        value = currentNode;
-    }
-    return { depth, value };
-}
-export function readWideTreeAsJSObject(tree) {
-    let sum = 0;
-    const nodes = tree.foo;
-    assert(nodes !== undefined);
-    for (const node of nodes) {
-        sum += node;
-    }
-    return { nodesCount: nodes.length, sum };
-}
-export function readWideCursorTree(tree) {
-    let nodesCount = 0;
-    let sum = 0;
-    const readCursor = tree.checkout.forest.allocateCursor();
-    moveToDetachedField(tree.checkout.forest, readCursor);
-    assert(readCursor.firstNode());
-    readCursor.firstField();
-    for (let inNode = readCursor.firstNode(); inNode; inNode = readCursor.nextNode()) {
-        sum += readCursor.value;
-        nodesCount += 1;
-    }
-    readCursor.free();
-    return { nodesCount, sum };
-}
-export function readDeepCursorTree(tree) {
-    let depth = 0;
-    let value = 0;
-    const readCursor = tree.checkout.forest.allocateCursor();
-    moveToDetachedField(tree.checkout.forest, readCursor);
-    assert(readCursor.firstNode());
-    while (readCursor.firstField()) {
-        readCursor.firstNode();
-        depth += 1;
-        value = readCursor.value;
-    }
-    value = readCursor.value;
-    readCursor.free();
-    return { depth, value };
-}
-/**
- * Path to linked list node at provided depth.
- * Depth 1 points to the root node.
- */
-export function deepPath(depth) {
-    assert(depth > 0);
-    let path = {
-        parent: undefined,
-        parentField: rootFieldKey,
-        parentIndex: 0,
-    };
-    for (let i = 0; i < depth - 1; i++) {
-        path = {
-            parent: path,
-            parentField: localFieldKey,
-            parentIndex: 0,
-        };
-    }
-    return path;
-}
-/**
- * Path to linked list node at provided depth.
- * Depth 1 points to the root node.
- */
-export function wideLeafPath(index) {
-    const path = {
-        parent: {
-            parent: undefined,
-            parentField: rootFieldKey,
-            parentIndex: 0,
-        },
-        parentField: localFieldKey,
-        parentIndex: index,
-    };
-    return path;
-}
-export function readWideEditableTree(tree) {
-    let sum = 0;
-    let nodesCount = 0;
-    const root = tree.flexTree;
-    const field = root.content.foo;
-    assert(field.length !== 0);
-    for (const currentNode of field) {
-        sum += currentNode;
-        nodesCount += 1;
-    }
-    return { nodesCount, sum };
-}
-export function readDeepEditableTree(tree) {
-    let depth = 0;
-    let currentNode = tree.flexTree.content;
-    while (currentNode.is(linkedListSchema)) {
-        currentNode = currentNode.foo;
-        depth++;
-    }
-    assert(currentNode.is(leaf.number));
-    return { depth, value: currentNode.value };
-}
-//# sourceMappingURL=scalableTestTrees.js.map

package/lib/test/scalableTestTrees.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"scalableTestTrees.js","sourceRoot":"","sources":["../../src/test/scalableTestTrees.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC1C,OAAO,EACN,UAAU,EAGV,eAAe,EACf,cAAc,EACd,iBAAiB,GACjB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,KAAK,EAAuB,MAAM,kBAAkB,CAAC;AAE9D,OAAO,EAAY,mBAAmB,EAAE,YAAY,EAAU,MAAM,kBAAkB,CAAC;AAEvF;;GAEG;AAEH;;GAEG;AACH,MAAM,CAAC,MAAM,aAAa,GAAa,KAAK,CAAC,KAAK,CAAC,CAAC;AAEpD,MAAM,WAAW,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;IAC9D,KAAK,EAAE,UAAU;IACjB,IAAI,EAAE,wBAAwB;IAC9B,SAAS,EAAE,CAAC,UAAU,CAAC;CACvB,CAAC,CAAC;AAEH,oEAAoE;AACpE,MAAM,gBAAgB,GAAG,WAAW,CAAC,eAAe,CAAC,YAAY,EAAE;IAClE,GAAG,EAAE,eAAe,CAAC,YAAY,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;CAC7F,CAAC,CAAC;AAEH,MAAM,WAAW,GAAG,IAAI,iBAAiB,CAAC,UAAU,CAAC,QAAQ,EAAE;IAC9D,KAAK,EAAE,UAAU;IACjB,IAAI,EAAE,wBAAwB;IAC9B,SAAS,EAAE,CAAC,UAAU,CAAC;CACvB,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,cAAc,GAAG,WAAW,CAAC,MAAM,CAAC,UAAU,EAAE;IAC5D,GAAG,EAAE,eAAe,CAAC,MAAM,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;CAC/D,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;AAEjE,MAAM,CAAC,MAAM,UAAU,GAAG,WAAW,CAAC,UAAU,CAAC,CAAC,gBAAgB,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AAclF;CAGC;AAYD;CAEC;AAED,MAAM,UAAU,cAAc,CAAC,KAAa,EAAE,SAAiB;IAC9D,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,cAAc,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;AAChF,CAAC;AAED,MAAM,UAAU,eAAe,CAC9B,KAAa,EACb,YAAoB,CAAC;IAErB,gEAAgE;IAChE,MAAM,WAAW,GAAoB,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACtE,OAAO;QACN,WAAW;QACX,MAAM,EAAE,UAAU;KAClB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,2BAA2B,CAC1C,aAAqB,EACrB,YAAoB;IAEpB,gEAAgE;IAChE,MAAM,WAAW,GAAoB,0BAA0B,CAAC,aAAa,EAAE,YAAY,CAAC,CAAC;IAC7F,OAAO;QACN,WAAW;QACX,MAAM,EAAE,UAAU;KAClB,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,0BAA0B,CACzC,aAAqB,EACrB,YAAoB;IAEpB,MAAM,OAAO,GAAG,EAAE,CAAC;IACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,aAAa,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE;QACvD,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACpB;IACD,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC3B,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,IAAgB;IACtD,IAAI,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,OAAO,WAAW,KAAK,QAAQ,EAAE;QACvC,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC;QAC9B,KAAK,IAAI,CAAC,CAAC;KACX;IACD,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE;QACpC,KAAK,GAAG,WAAW,CAAC;KACpB;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,IAAgB;IACtD,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC;IACvB,MAAM,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC;IAC5B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACzB,GAAG,IAAI,IAAI,CAAC;KACZ;IACD,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC;AAC1C,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,IAAqD;IAIvF,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IACzD,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACtD,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC;IAC/B,UAAU,CAAC,UAAU,EAAE,CAAC;IACxB,KAAK,IAAI,MAAM,GAAG,UAAU,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,UAAU,CAAC,QAAQ,EAAE,EAAE;QACjF,GAAG,IAAI,UAAU,CAAC,KAAe,CAAC;QAClC,UAAU,IAAI,CAAC,CAAC;KAChB;IACD,UAAU,CAAC,IAAI,EAAE,CAAC;IAClB,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,IAAqD;IAIvF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;IACzD,mBAAmB,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACtD,MAAM,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC;IAC/B,OAAO,UAAU,CAAC,UAAU,EAAE,EAAE;QAC/B,UAAU,CAAC,SAAS,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,CAAC;QACX,KAAK,GAAG,UAAU,CAAC,KAAe,CAAC;KACnC;IACD,KAAK,GAAG,UAAU,CAAC,KAAe,CAAC;IACnC,UAAU,CAAC,IAAI,EAAE,CAAC;IAClB,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa;IACrC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IAClB,IAAI,IAAI,GAAW;QAClB,MAAM,EAAE,SAAS;QACjB,WAAW,EAAE,YAAY;QACzB,WAAW,EAAE,CAAC;KACd,CAAC;IACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QACnC,IAAI,GAAG;YACN,MAAM,EAAE,IAAI;YACZ,WAAW,EAAE,aAAa;YAC1B,WAAW,EAAE,CAAC;SACd,CAAC;KACF;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACzC,MAAM,IAAI,GAAG;QACZ,MAAM,EAAE;YACP,MAAM,EAAE,SAAS;YACjB,WAAW,EAAE,YAAY;YACzB,WAAW,EAAE,CAAC;SACd;QACD,WAAW,EAAE,aAAa;QAC1B,WAAW,EAAE,KAAK;KAClB,CAAC;IACF,OAAO,IAAI,CAAC;AACb,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,IAAqD;IAIzF,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC;IAC/B,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IAC3B,KAAK,MAAM,WAAW,IAAI,KAAK,EAAE;QAChC,GAAG,IAAI,WAAW,CAAC;QACnB,UAAU,IAAI,CAAC,CAAC;KAChB;IACD,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;AAC5B,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,IAAqD;IAIzF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC;IACxC,OAAO,WAAW,CAAC,EAAE,CAAC,gBAAgB,CAAC,EAAE;QACxC,WAAW,GAAG,WAAW,CAAC,GAAG,CAAC;QAC9B,KAAK,EAAE,CAAC;KACR;IACD,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACpC,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,CAAC,KAAK,EAAE,CAAC;AAC5C,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\nimport { strict as assert } from \"assert\";\nimport {\n\tFieldKinds,\n\tInsertableFlexField,\n\tInsertableFlexNode,\n\tFlexFieldSchema,\n\ttypeNameSymbol,\n\tSchemaBuilderBase,\n} from \"../feature-libraries/index.js\";\nimport { leaf, jsonSchema } from \"../domains/index.js\";\nimport { brand, requireAssignableTo } from \"../util/index.js\";\nimport { FlexTreeView, TreeContent } from \"../shared-tree/index.js\";\nimport { FieldKey, moveToDetachedField, rootFieldKey, UpPath } from \"../core/index.js\";\n\n/**\n * Test trees which can be parametrically scaled to any size.\n */\n\n/**\n * Arbitrary key used when a field key is needed in this file.\n */\nexport const localFieldKey: FieldKey = brand(\"foo\");\n\nconst deepBuilder = new SchemaBuilderBase(FieldKinds.required, {\n\tscope: \"scalable\",\n\tname: \"sharedTree.bench: deep\",\n\tlibraries: [jsonSchema],\n});\n\n// Test data in \"deep\" mode: a linked list with a number at the end.\nconst linkedListSchema = deepBuilder.objectRecursive(\"linkedList\", {\n\tfoo: FlexFieldSchema.createUnsafe(FieldKinds.required, [() => linkedListSchema, leaf.number]),\n});\n\nconst wideBuilder = new SchemaBuilderBase(FieldKinds.required, {\n\tscope: \"scalable\",\n\tname: \"sharedTree.bench: wide\",\n\tlibraries: [jsonSchema],\n});\n\nexport const wideRootSchema = wideBuilder.object(\"WideRoot\", {\n\tfoo: FlexFieldSchema.create(FieldKinds.sequence, [leaf.number]),\n});\n\nexport const wideSchema = wideBuilder.intoSchema(wideRootSchema);\n\nexport const deepSchema = deepBuilder.intoSchema([linkedListSchema, leaf.number]);\n\n/**\n * JS object like a deep tree.\n * Compatible with ContextuallyTypedNodeData\n */\nexport interface JSDeepTree {\n\t[typeNameSymbol]?: typeof linkedListSchema.name | undefined;\n\tfoo: JSDeepTree | number;\n}\n\ntype JSDeepTree2 = InsertableFlexNode<typeof linkedListSchema>;\ntype JSDeepTreeRoot2 = InsertableFlexField<typeof deepSchema.rootFieldSchema>;\n\n{\n\ttype _check = requireAssignableTo<JSDeepTree, JSDeepTree2>;\n\ttype _check2 = requireAssignableTo<JSDeepTree | number, JSDeepTreeRoot2>;\n}\n\n/**\n * JS object like a wide tree.\n * Compatible with ContextuallyTypedNodeData\n */\nexport interface JSWideTree {\n\tfoo: number[];\n}\n\ntype JSWideTreeRoot2 = InsertableFlexField<typeof wideSchema.rootFieldSchema>;\n\n{\n\ttype _check2 = requireAssignableTo<JSWideTree, JSWideTreeRoot2>;\n}\n\nexport function makeJsDeepTree(depth: number, leafValue: number): JSDeepTree | number {\n\treturn depth === 0 ? leafValue : { foo: makeJsDeepTree(depth - 1, leafValue) };\n}\n\nexport function makeDeepContent(\n\tdepth: number,\n\tleafValue: number = 1,\n): TreeContent<typeof deepSchema.rootFieldSchema> {\n\t// Implicit type conversion is needed here to make this compile.\n\tconst initialTree: JSDeepTreeRoot2 = makeJsDeepTree(depth, leafValue);\n\treturn {\n\t\tinitialTree,\n\t\tschema: deepSchema,\n\t};\n}\n\n/**\n *\n * @param numberOfNodes - number of nodes of the tree\n * @param endLeafValue - the value of the end leaf of the tree\n * @returns a tree with specified number of nodes, with the end leaf node set to the endLeafValue\n */\nexport function makeWideContentWithEndValue(\n\tnumberOfNodes: number,\n\tendLeafValue: number,\n): TreeContent<typeof wideSchema.rootFieldSchema> {\n\t// Implicit type conversion is needed here to make this compile.\n\tconst initialTree: JSWideTreeRoot2 = makeJsWideTreeWithEndValue(numberOfNodes, endLeafValue);\n\treturn {\n\t\tinitialTree,\n\t\tschema: wideSchema,\n\t};\n}\n\n/**\n *\n * @param numberOfNodes - number of nodes of the tree\n * @param endLeafValue - the value of the end leaf of the tree\n * @returns a tree with specified number of nodes, with the end leaf node set to the endLeafValue\n */\nexport function makeJsWideTreeWithEndValue(\n\tnumberOfNodes: number,\n\tendLeafValue: number,\n): JSWideTree {\n\tconst numbers = [];\n\tfor (let index = 0; index < numberOfNodes - 1; index++) {\n\t\tnumbers.push(index);\n\t}\n\tnumbers.push(endLeafValue);\n\treturn { foo: numbers };\n}\n\nexport function readDeepTreeAsJSObject(tree: JSDeepTree): { depth: number; value: number } {\n\tlet currentNode = tree.foo;\n\tlet depth = 1;\n\tlet value = 0;\n\n\twhile (typeof currentNode !== \"number\") {\n\t\tcurrentNode = currentNode.foo;\n\t\tdepth += 1;\n\t}\n\tif (typeof currentNode === \"number\") {\n\t\tvalue = currentNode;\n\t}\n\treturn { depth, value };\n}\n\nexport function readWideTreeAsJSObject(tree: JSWideTree): { nodesCount: number; sum: number } {\n\tlet sum = 0;\n\n\tconst nodes = tree.foo;\n\tassert(nodes !== undefined);\n\tfor (const node of nodes) {\n\t\tsum += node;\n\t}\n\treturn { nodesCount: nodes.length, sum };\n}\n\nexport function readWideCursorTree(tree: FlexTreeView<typeof wideSchema.rootFieldSchema>): {\n\tnodesCount: number;\n\tsum: number;\n} {\n\tlet nodesCount = 0;\n\tlet sum = 0;\n\tconst readCursor = tree.checkout.forest.allocateCursor();\n\tmoveToDetachedField(tree.checkout.forest, readCursor);\n\tassert(readCursor.firstNode());\n\treadCursor.firstField();\n\tfor (let inNode = readCursor.firstNode(); inNode; inNode = readCursor.nextNode()) {\n\t\tsum += readCursor.value as number;\n\t\tnodesCount += 1;\n\t}\n\treadCursor.free();\n\treturn { nodesCount, sum };\n}\n\nexport function readDeepCursorTree(tree: FlexTreeView<typeof deepSchema.rootFieldSchema>): {\n\tdepth: number;\n\tvalue: number;\n} {\n\tlet depth = 0;\n\tlet value = 0;\n\tconst readCursor = tree.checkout.forest.allocateCursor();\n\tmoveToDetachedField(tree.checkout.forest, readCursor);\n\tassert(readCursor.firstNode());\n\twhile (readCursor.firstField()) {\n\t\treadCursor.firstNode();\n\t\tdepth += 1;\n\t\tvalue = readCursor.value as number;\n\t}\n\tvalue = readCursor.value as number;\n\treadCursor.free();\n\treturn { depth, value };\n}\n\n/**\n * Path to linked list node at provided depth.\n * Depth 1 points to the root node.\n */\nexport function deepPath(depth: number): UpPath {\n\tassert(depth > 0);\n\tlet path: UpPath = {\n\t\tparent: undefined,\n\t\tparentField: rootFieldKey,\n\t\tparentIndex: 0,\n\t};\n\tfor (let i = 0; i < depth - 1; i++) {\n\t\tpath = {\n\t\t\tparent: path,\n\t\t\tparentField: localFieldKey,\n\t\t\tparentIndex: 0,\n\t\t};\n\t}\n\treturn path;\n}\n\n/**\n * Path to linked list node at provided depth.\n * Depth 1 points to the root node.\n */\nexport function wideLeafPath(index: number): UpPath {\n\tconst path = {\n\t\tparent: {\n\t\t\tparent: undefined,\n\t\t\tparentField: rootFieldKey,\n\t\t\tparentIndex: 0,\n\t\t},\n\t\tparentField: localFieldKey,\n\t\tparentIndex: index,\n\t};\n\treturn path;\n}\n\nexport function readWideEditableTree(tree: FlexTreeView<typeof wideSchema.rootFieldSchema>): {\n\tnodesCount: number;\n\tsum: number;\n} {\n\tlet sum = 0;\n\tlet nodesCount = 0;\n\tconst root = tree.flexTree;\n\tconst field = root.content.foo;\n\tassert(field.length !== 0);\n\tfor (const currentNode of field) {\n\t\tsum += currentNode;\n\t\tnodesCount += 1;\n\t}\n\treturn { nodesCount, sum };\n}\n\nexport function readDeepEditableTree(tree: FlexTreeView<typeof deepSchema.rootFieldSchema>): {\n\tdepth: number;\n\tvalue: number;\n} {\n\tlet depth = 0;\n\tlet currentNode = tree.flexTree.content;\n\twhile (currentNode.is(linkedListSchema)) {\n\t\tcurrentNode = currentNode.foo;\n\t\tdepth++;\n\t}\n\tassert(currentNode.is(leaf.number));\n\treturn { depth, value: currentNode.value };\n}\n"]}

package/lib/test/shared-tree/editing.spec.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=editing.spec.d.ts.map

package/lib/test/shared-tree/editing.spec.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"editing.spec.d.ts","sourceRoot":"","sources":["../../../src/test/shared-tree/editing.spec.ts"],"names":[],"mappings":""}