@fluid-experimental/tree 0.58.2002 → 0.58.3000-61081

package/lib/RevisionView.js

@@ -0,0 +1,175 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { copyPropertyIfDefined, fail } from './Common';
+import { Forest } from './Forest';
+import { TreeView } from './TreeView';
+/**
+ * An immutable view of a distributed tree.
+ * @public
+ */
+export class RevisionView extends TreeView {
+    static fromTree(root, idConverterOrExpensiveValidation, expensiveValidation = false) {
+        if (typeof idConverterOrExpensiveValidation === 'object') {
+            const rootId = idConverterOrExpensiveValidation.convertToNodeId(root.identifier);
+            const treeViewNodes = convertTreeNodesToViewNodes(root, (node) => {
+                const identifier = idConverterOrExpensiveValidation.convertToNodeId(node.identifier);
+                const viewNode = {
+                    definition: node.definition,
+                    identifier,
+                };
+                copyPropertyIfDefined(node, viewNode, 'payload');
+                return viewNode;
+            });
+            return new RevisionView(rootId, Forest.create(expensiveValidation).add(treeViewNodes));
+        }
+        else {
+            return new RevisionView(root.identifier, Forest.create(expensiveValidation).add(convertTreeNodesToViewNodes(root, (node) => {
+                const viewNode = {
+                    definition: node.definition,
+                    identifier: node.identifier,
+                };
+                copyPropertyIfDefined(node, viewNode, 'payload');
+                return viewNode;
+            })));
+        }
+    }
+    /** Begin a transaction by generating a mutable `TransactionView` from this view */
+    openForTransaction() {
+        return new TransactionView(this.root, this.forest);
+    }
+    equals(view) {
+        if (!(view instanceof RevisionView)) {
+            return false;
+        }
+        return this.hasEqualForest(view);
+    }
+}
+/**
+ * An view of a distributed tree that is part of an ongoing transaction between `RevisionView`s.
+ * @public
+ */
+export class TransactionView extends TreeView {
+    /** Conclude a transaction by generating an immutable `RevisionView` from this view */
+    close() {
+        return new RevisionView(this.root, this.forest);
+    }
+    /** Inserts all nodes in a NodeSequence into the view */
+    addNodes(sequence) {
+        return new TransactionView(this.root, this.forest.add(sequence));
+    }
+    /** Remove all nodes with the given ids from the view */
+    deleteNodes(nodes) {
+        return new TransactionView(this.root, this.forest.delete(nodes, true));
+    }
+    /**
+     * Parents a set of detached nodes at a specified place.
+     * @param nodesToAttach - the nodes to parent in the specified place. The nodes must already be present in the view.
+     * @param place - the location to insert the nodes.
+     */
+    attachRange(nodesToAttach, place) {
+        const { parent, label } = place.trait;
+        const index = this.findIndexWithinTrait(place);
+        return new TransactionView(this.root, this.forest.attachRangeOfChildren(parent, label, index, nodesToAttach));
+    }
+    /**
+     * Detaches a range of nodes from their parent. The detached nodes remain in the view.
+     * @param rangeToDetach - the range of nodes to detach
+     */
+    detachRange(rangeToDetach) {
+        const { start, end } = rangeToDetach;
+        const { trait: traitLocation } = start;
+        const { parent, label } = traitLocation;
+        const startIndex = this.findIndexWithinTrait(start);
+        const endIndex = this.findIndexWithinTrait(end);
+        const { forest, detached } = this.forest.detachRangeOfChildren(parent, label, startIndex, endIndex);
+        return { view: new TransactionView(this.root, forest), detached };
+    }
+    /**
+     * Sets or overwrites a node's value. The node must exist in this view.
+     * @param nodeId - the id of the node
+     * @param value - the new value
+     */
+    setNodeValue(nodeId, value) {
+        return new TransactionView(this.root, this.forest.setValue(nodeId, value));
+    }
+    equals(view) {
+        if (!(view instanceof TransactionView)) {
+            return false;
+        }
+        return this.hasEqualForest(view);
+    }
+}
+/**
+ * Transform an input tree into a list of {@link TreeViewNode}s.
+ * @param tree - the input tree
+ * @param convert - a conversion function that will run on each node in the input tree to produce the output nodes.
+ * Returning undefined means that conversion for the given node was impossible, at which time the entire tree conversion will be aborted
+ * and return undefined.
+ */
+export function convertTreeNodesToViewNodes(root, convert) {
+    var _a, _b, _c;
+    const convertedRoot = convert(root);
+    if (convertedRoot === undefined || root.traits === undefined) {
+        return undefined;
+    }
+    // `convertedRoot` might be the same as `root`, in which case stash the children of `root` before wiping them from `convertedRoot`
+    const rootTraits = root === convertedRoot ? { traits: root.traits } : root;
+    convertedRoot.traits = new Map();
+    const pendingNodes = [{ childIterator: iterateChildren(rootTraits)[Symbol.iterator](), newNode: convertedRoot }];
+    const resultNodes = [];
+    while (pendingNodes.length > 0) {
+        const { childIterator, newNode } = (_a = pendingNodes[pendingNodes.length - 1]) !== null && _a !== void 0 ? _a : fail('Undefined node');
+        const { value, done } = childIterator.next();
+        if (done === true) {
+            resultNodes.push((_c = (_b = pendingNodes.pop()) === null || _b === void 0 ? void 0 : _b.newNode) !== null && _c !== void 0 ? _c : fail('covertTreeNodesToViewNodes incorrectly coordinated parentage'));
+        }
+        else {
+            const [traitLabel, child] = value;
+            const convertedChild = convert(child);
+            if (convertedChild === undefined) {
+                return undefined;
+            }
+            if (child.traits !== undefined) {
+                const childTraits = child === convertedChild ? { traits: child.traits } : child;
+                convertedChild.traits = new Map();
+                pendingNodes.push({
+                    childIterator: iterateChildren(childTraits)[Symbol.iterator](),
+                    newNode: convertedChild,
+                });
+            }
+            const newTraits = newNode.traits;
+            let newTrait = newTraits.get(traitLabel);
+            if (newTrait === undefined) {
+                newTrait = [];
+                newTraits.set(traitLabel, newTrait);
+            }
+            newTrait.push(convertedChild.identifier);
+        }
+    }
+    return resultNodes;
+}
+/**
+ * Returns an iterable of the supplied node's traits in a stable order.
+ */
+export function* iterateChildren(hasTraits) {
+    if (hasTraits.traits !== undefined) {
+        for (const [label, trait] of Object.entries(hasTraits.traits).sort()) {
+            if (trait !== undefined) {
+                if (isTreeNodeSequence(trait)) {
+                    for (const child of trait) {
+                        yield [label, child];
+                    }
+                }
+                else {
+                    yield [label, trait];
+                }
+            }
+        }
+    }
+}
+function isTreeNodeSequence(sequence) {
+    return Array.isArray(sequence);
+}
+//# sourceMappingURL=RevisionView.js.map

package/lib/RevisionView.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RevisionView.js","sourceRoot":"","sources":["../src/RevisionView.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,qBAAqB,EAAE,IAAI,EAAuB,MAAM,UAAU,CAAC;AAC5E,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAIlC,OAAO,EAAE,QAAQ,EAA8C,MAAM,YAAY,CAAC;AAGlF;;;GAGG;AACH,MAAM,OAAO,YAAa,SAAQ,QAAQ;IAmBlC,MAAM,CAAC,QAAQ,CACrB,IAAO,EACP,gCAA4D,EAC5D,mBAAmB,GAAG,KAAK;QAE3B,IAAI,OAAO,gCAAgC,KAAK,QAAQ,EAAE;YACzD,MAAM,MAAM,GAAG,gCAAgC,CAAC,eAAe,CAAC,IAAI,CAAC,UAA0B,CAAC,CAAC;YAEjG,MAAM,aAAa,GAAG,2BAA2B,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBAChE,MAAM,UAAU,GAAG,gCAAgC,CAAC,eAAe,CAAC,IAAI,CAAC,UAA0B,CAAC,CAAC;gBACrG,MAAM,QAAQ,GAAG;oBAChB,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,UAAU;iBACV,CAAC;gBACF,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;gBACjD,OAAO,QAAQ,CAAC;YACjB,CAAC,CAAC,CAAC;YAEH,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC;SACvF;aAAM;YACN,OAAO,IAAI,YAAY,CACtB,IAAI,CAAC,UAAoB,EACzB,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,GAAG,CACrC,2BAA2B,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,EAAE;gBAC1C,MAAM,QAAQ,GAAG;oBAChB,UAAU,EAAE,IAAI,CAAC,UAAU;oBAC3B,UAAU,EAAE,IAAI,CAAC,UAAoB;iBACrC,CAAC;gBACF,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;gBACjD,OAAO,QAAQ,CAAC;YACjB,CAAC,CAAC,CACF,CACD,CAAC;SACF;IACF,CAAC;IAED,mFAAmF;IAC5E,kBAAkB;QACxB,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IAEM,MAAM,CAAC,IAAc;QAC3B,IAAI,CAAC,CAAC,IAAI,YAAY,YAAY,CAAC,EAAE;YACpC,OAAO,KAAK,CAAC;SACb;QAED,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACD;AAED;;;GAGG;AACH,MAAM,OAAO,eAAgB,SAAQ,QAAQ;IAC5C,sFAAsF;IAC/E,KAAK;QACX,OAAO,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACjD,CAAC;IAED,wDAAwD;IACjD,QAAQ,CAAC,QAAgC;QAC/C,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAClE,CAAC;IAED,wDAAwD;IACjD,WAAW,CAAC,KAAuB;QACzC,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IACxE,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,aAAgC,EAAE,KAAoB;QACxE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC/C,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;IAC/G,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,aAA4B;QAC9C,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC;QACrC,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,KAAK,CAAC;QACvC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,aAAa,CAAC;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAChD,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QACpG,OAAO,EAAE,IAAI,EAAE,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,CAAC;IACnE,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,MAAc,EAAE,KAAc;QACjD,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,MAAM,CAAC,IAAc;QAC3B,IAAI,CAAC,CAAC,IAAI,YAAY,eAAe,CAAC,EAAE;YACvC,OAAO,KAAK,CAAC;SACb;QAED,OAAO,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;CACD;AAwBD;;;;;;GAMG;AACH,MAAM,UAAU,2BAA2B,CAGzC,IAAS,EAAE,OAAwD;;IACpE,MAAM,aAAa,GAAG,OAAO,CAAC,IAAI,CAAkB,CAAC;IACrD,IAAI,aAAa,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE;QAC7D,OAAO,SAAS,CAAC;KACjB;IACD,kIAAkI;IAClI,MAAM,UAAU,GAAI,IAAwB,KAAK,aAAa,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAChG,aAAa,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IACjC,MAAM,YAAY,GAGZ,CAAC,EAAE,aAAa,EAAE,eAAe,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC,CAAC;IAClG,MAAM,WAAW,GAAW,EAAE,CAAC;IAE/B,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE;QAC/B,MAAM,EAAE,aAAa,EAAE,OAAO,EAAE,SAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,mCAAI,IAAI,CAAC,gBAAgB,CAAC,CAAC;QACnG,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,aAAa,CAAC,IAAI,EAAE,CAAC;QAC7C,IAAI,IAAI,KAAK,IAAI,EAAE;YAClB,WAAW,CAAC,IAAI,aACf,YAAY,CAAC,GAAG,EAAE,0CAAE,OAAO,mCAAI,IAAI,CAAC,8DAA8D,CAAC,CACnG,CAAC;SACF;aAAM;YACN,MAAM,CAAC,UAAU,EAAE,KAAK,CAAC,GAAG,KAA0B,CAAC;YACvD,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAS,CAAC;YAC9C,IAAI,cAAc,KAAK,SAAS,EAAE;gBACjC,OAAO,SAAS,CAAC;aACjB;YACD,IAAI,KAAK,CAAC,MAAM,KAAK,SAAS,EAAE;gBAC/B,MAAM,WAAW,GAAI,KAAyB,KAAK,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;gBACpG,cAAgC,CAAC,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;gBACrD,YAAY,CAAC,IAAI,CAAC;oBACjB,aAAa,EAAE,eAAe,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE;oBAC9D,OAAO,EAAE,cAAc;iBACvB,CAAC,CAAC;aACH;YAED,MAAM,SAAS,GAAG,OAAO,CAAC,MAAoC,CAAC;YAC/D,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACzC,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC3B,QAAQ,GAAG,EAAE,CAAC;gBACd,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC;aACpC;YACA,QAAqB,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,CAAC;SACvD;KACD;IAED,OAAO,WAAW,CAAC;AACpB,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,eAAe,CAAI,SAA+B;IAClE,IAAI,SAAS,CAAC,MAAM,KAAK,SAAS,EAAE;QACnC,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;YACrE,IAAI,KAAK,KAAK,SAAS,EAAE;gBACxB,IAAI,kBAAkB,CAAC,KAAK,CAAC,EAAE;oBAC9B,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE;wBAC1B,MAAM,CAAC,KAAmB,EAAE,KAAK,CAAC,CAAC;qBACnC;iBACD;qBAAM;oBACN,MAAM,CAAC,KAAmB,EAAE,KAAK,CAAC,CAAC;iBACnC;aACD;SACD;KACD;AACF,CAAC;AAED,SAAS,kBAAkB,CAAS,QAA2C;IAC9E,OAAO,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;AAChC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { copyPropertyIfDefined, fail, Mutable, MutableMap } from './Common';\nimport { Forest } from './Forest';\nimport { NodeId, StableNodeId, TraitLabel } from './Identifiers';\nimport { NodeIdConverter } from './NodeIdUtilities';\nimport { Payload, TreeNode, TreeNodeSequence } from './persisted-types';\nimport { TreeView, TreeViewNode, TreeViewPlace, TreeViewRange } from './TreeView';\nimport { HasVariadicTraits } from './ChangeTypes';\n\n/**\n * An immutable view of a distributed tree.\n * @public\n */\nexport class RevisionView extends TreeView {\n\t/**\n\t * Constructs a {@link RevisionView} using the supplied tree.\n\t * @param root - the root of the tree to use as the contents of the {@link RevisionView}\n\t * @param expensiveValidation - whether or not to perform additional validation, e.g. to catch errors when testing\n\t */\n\tpublic static fromTree<T extends TreeNode<T, NodeId>>(root: T, expensiveValidation?: boolean): RevisionView;\n\t/**\n\t * Constructs a {@link RevisionView} using the supplied tree.\n\t * @param root - the root of the tree to use as the contents of the `RevisionView`\n\t * @param idConverter - the {@link NodeIdConverter} that will recompress the IDs the in the tree\n\t * @param expensiveValidation - whether or not to perform additional validation, e.g. to catch errors when testing\n\t */\n\tpublic static fromTree<T extends TreeNode<T, StableNodeId>>(\n\t\troot: T,\n\t\tidConverter: NodeIdConverter,\n\t\texpensiveValidation?: boolean\n\t): RevisionView;\n\n\tpublic static fromTree<T extends TreeNode<T, NodeId> | TreeNode<T, StableNodeId>>(\n\t\troot: T,\n\t\tidConverterOrExpensiveValidation?: NodeIdConverter | boolean,\n\t\texpensiveValidation = false\n\t): RevisionView {\n\t\tif (typeof idConverterOrExpensiveValidation === 'object') {\n\t\t\tconst rootId = idConverterOrExpensiveValidation.convertToNodeId(root.identifier as StableNodeId);\n\n\t\t\tconst treeViewNodes = convertTreeNodesToViewNodes(root, (node) => {\n\t\t\t\tconst identifier = idConverterOrExpensiveValidation.convertToNodeId(node.identifier as StableNodeId);\n\t\t\t\tconst viewNode = {\n\t\t\t\t\tdefinition: node.definition,\n\t\t\t\t\tidentifier,\n\t\t\t\t};\n\t\t\t\tcopyPropertyIfDefined(node, viewNode, 'payload');\n\t\t\t\treturn viewNode;\n\t\t\t});\n\n\t\t\treturn new RevisionView(rootId, Forest.create(expensiveValidation).add(treeViewNodes));\n\t\t} else {\n\t\t\treturn new RevisionView(\n\t\t\t\troot.identifier as NodeId,\n\t\t\t\tForest.create(expensiveValidation).add(\n\t\t\t\t\tconvertTreeNodesToViewNodes(root, (node) => {\n\t\t\t\t\t\tconst viewNode = {\n\t\t\t\t\t\t\tdefinition: node.definition,\n\t\t\t\t\t\t\tidentifier: node.identifier as NodeId,\n\t\t\t\t\t\t};\n\t\t\t\t\t\tcopyPropertyIfDefined(node, viewNode, 'payload');\n\t\t\t\t\t\treturn viewNode;\n\t\t\t\t\t})\n\t\t\t\t)\n\t\t\t);\n\t\t}\n\t}\n\n\t/** Begin a transaction by generating a mutable `TransactionView` from this view */\n\tpublic openForTransaction(): TransactionView {\n\t\treturn new TransactionView(this.root, this.forest);\n\t}\n\n\tpublic equals(view: TreeView): boolean {\n\t\tif (!(view instanceof RevisionView)) {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn this.hasEqualForest(view);\n\t}\n}\n\n/**\n * An view of a distributed tree that is part of an ongoing transaction between `RevisionView`s.\n * @public\n */\nexport class TransactionView extends TreeView {\n\t/** Conclude a transaction by generating an immutable `RevisionView` from this view */\n\tpublic close(): RevisionView {\n\t\treturn new RevisionView(this.root, this.forest);\n\t}\n\n\t/** Inserts all nodes in a NodeSequence into the view */\n\tpublic addNodes(sequence: Iterable<TreeViewNode>): TransactionView {\n\t\treturn new TransactionView(this.root, this.forest.add(sequence));\n\t}\n\n\t/** Remove all nodes with the given ids from the view */\n\tpublic deleteNodes(nodes: Iterable<NodeId>): TransactionView {\n\t\treturn new TransactionView(this.root, this.forest.delete(nodes, true));\n\t}\n\n\t/**\n\t * Parents a set of detached nodes at a specified place.\n\t * @param nodesToAttach - the nodes to parent in the specified place. The nodes must already be present in the view.\n\t * @param place - the location to insert the nodes.\n\t */\n\tpublic attachRange(nodesToAttach: readonly NodeId[], place: TreeViewPlace): TransactionView {\n\t\tconst { parent, label } = place.trait;\n\t\tconst index = this.findIndexWithinTrait(place);\n\t\treturn new TransactionView(this.root, this.forest.attachRangeOfChildren(parent, label, index, nodesToAttach));\n\t}\n\n\t/**\n\t * Detaches a range of nodes from their parent. The detached nodes remain in the view.\n\t * @param rangeToDetach - the range of nodes to detach\n\t */\n\tpublic detachRange(rangeToDetach: TreeViewRange): { view: TransactionView; detached: readonly NodeId[] } {\n\t\tconst { start, end } = rangeToDetach;\n\t\tconst { trait: traitLocation } = start;\n\t\tconst { parent, label } = traitLocation;\n\t\tconst startIndex = this.findIndexWithinTrait(start);\n\t\tconst endIndex = this.findIndexWithinTrait(end);\n\t\tconst { forest, detached } = this.forest.detachRangeOfChildren(parent, label, startIndex, endIndex);\n\t\treturn { view: new TransactionView(this.root, forest), detached };\n\t}\n\n\t/**\n\t * Sets or overwrites a node's value. The node must exist in this view.\n\t * @param nodeId - the id of the node\n\t * @param value - the new value\n\t */\n\tpublic setNodeValue(nodeId: NodeId, value: Payload): TransactionView {\n\t\treturn new TransactionView(this.root, this.forest.setValue(nodeId, value));\n\t}\n\n\tpublic equals(view: TreeView): boolean {\n\t\tif (!(view instanceof TransactionView)) {\n\t\t\treturn false;\n\t\t}\n\n\t\treturn this.hasEqualForest(view);\n\t}\n}\n\n/**\n * Transform an input tree into a list of {@link TreeViewNode}s.\n * @param tree - the input tree\n * @param convert - a conversion function that will run on each node in the input tree to produce the output nodes.\n * Returning undefined means that conversion for the given node was impossible, at which time the entire tree conversion will be aborted\n * and return undefined.\n */\nexport function convertTreeNodesToViewNodes<\n\tTIn extends HasVariadicTraits<TIn>,\n\tTOut extends TreeViewNode = TreeViewNode\n>(root: TIn, convert: (node: TIn) => Omit<TOut, 'traits'>): TOut[];\n\n/**\n * Transform an input tree into a list of {@link TreeViewNode}s.\n * @param tree - the input tree\n * @param convert - a conversion function that will run on each node in the input tree to produce the output nodes.\n */\nexport function convertTreeNodesToViewNodes<\n\tTIn extends HasVariadicTraits<TIn>,\n\tTOut extends TreeViewNode = TreeViewNode\n>(root: TIn, convert: (node: TIn) => Omit<TOut, 'traits'> | undefined): TOut[] | undefined;\n\n/**\n * Transform an input tree into a list of {@link TreeViewNode}s.\n * @param tree - the input tree\n * @param convert - a conversion function that will run on each node in the input tree to produce the output nodes.\n * Returning undefined means that conversion for the given node was impossible, at which time the entire tree conversion will be aborted\n * and return undefined.\n */\nexport function convertTreeNodesToViewNodes<\n\tTIn extends HasVariadicTraits<TIn>,\n\tTOut extends TreeViewNode = TreeViewNode\n>(root: TIn, convert: (node: TIn) => Omit<TOut, 'traits'> | undefined): TOut[] | undefined {\n\tconst convertedRoot = convert(root) as Mutable<TOut>;\n\tif (convertedRoot === undefined || root.traits === undefined) {\n\t\treturn undefined;\n\t}\n\t// `convertedRoot` might be the same as `root`, in which case stash the children of `root` before wiping them from `convertedRoot`\n\tconst rootTraits = (root as unknown as TOut) === convertedRoot ? { traits: root.traits } : root;\n\tconvertedRoot.traits = new Map();\n\tconst pendingNodes: {\n\t\tchildIterator: Iterator<[TraitLabel, TIn]>;\n\t\tnewNode: Mutable<TOut>;\n\t}[] = [{ childIterator: iterateChildren(rootTraits)[Symbol.iterator](), newNode: convertedRoot }];\n\tconst resultNodes: TOut[] = [];\n\n\twhile (pendingNodes.length > 0) {\n\t\tconst { childIterator, newNode } = pendingNodes[pendingNodes.length - 1] ?? fail('Undefined node');\n\t\tconst { value, done } = childIterator.next();\n\t\tif (done === true) {\n\t\t\tresultNodes.push(\n\t\t\t\tpendingNodes.pop()?.newNode ?? fail('covertTreeNodesToViewNodes incorrectly coordinated parentage')\n\t\t\t);\n\t\t} else {\n\t\t\tconst [traitLabel, child] = value as [TraitLabel, TIn];\n\t\t\tconst convertedChild = convert(child) as TOut;\n\t\t\tif (convertedChild === undefined) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t\tif (child.traits !== undefined) {\n\t\t\t\tconst childTraits = (child as unknown as TOut) === convertedChild ? { traits: child.traits } : child;\n\t\t\t\t(convertedChild as Mutable<TOut>).traits = new Map();\n\t\t\t\tpendingNodes.push({\n\t\t\t\t\tchildIterator: iterateChildren(childTraits)[Symbol.iterator](),\n\t\t\t\t\tnewNode: convertedChild,\n\t\t\t\t});\n\t\t\t}\n\n\t\t\tconst newTraits = newNode.traits as MutableMap<TOut['traits']>;\n\t\t\tlet newTrait = newTraits.get(traitLabel);\n\t\t\tif (newTrait === undefined) {\n\t\t\t\tnewTrait = [];\n\t\t\t\tnewTraits.set(traitLabel, newTrait);\n\t\t\t}\n\t\t\t(newTrait as NodeId[]).push(convertedChild.identifier);\n\t\t}\n\t}\n\n\treturn resultNodes;\n}\n\n/**\n * Returns an iterable of the supplied node's traits in a stable order.\n */\nexport function* iterateChildren<T>(hasTraits: HasVariadicTraits<T>): Iterable<[TraitLabel, T]> {\n\tif (hasTraits.traits !== undefined) {\n\t\tfor (const [label, trait] of Object.entries(hasTraits.traits).sort()) {\n\t\t\tif (trait !== undefined) {\n\t\t\t\tif (isTreeNodeSequence(trait)) {\n\t\t\t\t\tfor (const child of trait) {\n\t\t\t\t\t\tyield [label as TraitLabel, child];\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tyield [label as TraitLabel, trait];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nfunction isTreeNodeSequence<TChild>(sequence: TreeNodeSequence<TChild> | TChild): sequence is TreeNodeSequence<TChild> {\n\treturn Array.isArray(sequence);\n}\n"]}

package/lib/SerializationUtilities.d.ts

@@ -0,0 +1,36 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { NodeId } from './Identifiers';
+import { NodeIdConverter } from './NodeIdUtilities';
+import { ChangeNode, ChangeNode_0_0_2 } from './persisted-types';
+import { TreeView } from './TreeView';
+/**
+ * Converts this tree view to an equivalent `ChangeNode`.
+ * @param view - the view to convert
+ */
+export declare function getChangeNodeFromView(view: TreeView): ChangeNode;
+/**
+ * Converts a node in this tree view to an equivalent `ChangeNode`.
+ * @param view - the view of the tree that contains the node to convert
+ * @param id - the id of the node to convert
+ * @param lazyTraits - whether or not traits should be populated lazily. If true, the subtrees under each trait will not be read until
+ * the trait is first accessed.
+ */
+export declare function getChangeNodeFromViewNode(view: TreeView, id: NodeId, lazyTraits?: boolean): ChangeNode;
+/**
+ * Converts this tree view to an equivalent `ChangeNode`.
+ * @param view - the view to convert
+ */
+export declare function getChangeNode_0_0_2FromView(view: TreeView, idConverter: NodeIdConverter): ChangeNode_0_0_2;
+/**
+ * Converts a node in this tree view to an equivalent `ChangeNode`.
+ * @param view - the view of the tree that contains the node to convert
+ * @param id - the id of the node to convert
+ * @param lazyTraits - whether or not traits should be populated lazily. If true, the subtrees under each trait will not be read until
+ * the trait is first accessed.
+ * @deprecated Remove by March 2022
+ */
+export declare function getChangeNode_0_0_2FromViewNode(view: TreeView, id: NodeId, idConverter: NodeIdConverter): ChangeNode_0_0_2;
+//# sourceMappingURL=SerializationUtilities.d.ts.map

package/lib/SerializationUtilities.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SerializationUtilities.d.ts","sourceRoot":"","sources":["../src/SerializationUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAc,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAY,MAAM,mBAAmB,CAAC;AAC3E,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,QAAQ,GAAG,UAAU,CAEhE;AAED;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,UAAQ,GAAG,UAAU,CAqBpG;AA8BD;;;GAGG;AACH,wBAAgB,2BAA2B,CAAC,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,eAAe,GAAG,gBAAgB,CAE1G;AAED;;;;;;;GAOG;AACH,wBAAgB,+BAA+B,CAC9C,IAAI,EAAE,QAAQ,EACd,EAAE,EAAE,MAAM,EACV,WAAW,EAAE,eAAe,GAC1B,gBAAgB,CAYlB"}

package/lib/SerializationUtilities.js

@@ -0,0 +1,95 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { copyPropertyIfDefined, memoizeGetter } from './Common';
+/**
+ * Converts this tree view to an equivalent `ChangeNode`.
+ * @param view - the view to convert
+ */
+export function getChangeNodeFromView(view) {
+    return getChangeNodeFromViewNode(view, view.root);
+}
+/**
+ * Converts a node in this tree view to an equivalent `ChangeNode`.
+ * @param view - the view of the tree that contains the node to convert
+ * @param id - the id of the node to convert
+ * @param lazyTraits - whether or not traits should be populated lazily. If true, the subtrees under each trait will not be read until
+ * the trait is first accessed.
+ */
+export function getChangeNodeFromViewNode(view, id, lazyTraits = false) {
+    const node = view.getViewNode(id);
+    const nodeData = {
+        definition: node.definition,
+        identifier: node.identifier,
+    };
+    copyPropertyIfDefined(node, nodeData, 'payload');
+    if (lazyTraits) {
+        return Object.assign(Object.assign({}, nodeData), { get traits() {
+                return memoizeGetter(this, 'traits', makeTraits(view, node.traits, lazyTraits));
+            } });
+    }
+    return Object.assign(Object.assign({}, nodeData), { traits: makeTraits(view, node.traits, lazyTraits) });
+}
+/** Given the traits of a TreeViewNode, return the corresponding traits on a Node */
+function makeTraits(view, traits, lazyTraits = false) {
+    const traitMap = {};
+    for (const [label, trait] of traits.entries()) {
+        if (lazyTraits) {
+            Object.defineProperty(traitMap, label, {
+                get() {
+                    const treeNodeTrait = trait.map((id) => getChangeNodeFromViewNode(view, id, lazyTraits));
+                    return memoizeGetter(this, label, treeNodeTrait);
+                },
+                configurable: true,
+                enumerable: true,
+            });
+        }
+        else {
+            Object.defineProperty(traitMap, label, {
+                value: trait.map((id) => getChangeNodeFromViewNode(view, id, lazyTraits)),
+                enumerable: true,
+            });
+        }
+    }
+    return traitMap;
+}
+/**
+ * Converts this tree view to an equivalent `ChangeNode`.
+ * @param view - the view to convert
+ */
+export function getChangeNode_0_0_2FromView(view, idConverter) {
+    return getChangeNode_0_0_2FromViewNode(view, view.root, idConverter);
+}
+/**
+ * Converts a node in this tree view to an equivalent `ChangeNode`.
+ * @param view - the view of the tree that contains the node to convert
+ * @param id - the id of the node to convert
+ * @param lazyTraits - whether or not traits should be populated lazily. If true, the subtrees under each trait will not be read until
+ * the trait is first accessed.
+ * @deprecated Remove by March 2022
+ */
+export function getChangeNode_0_0_2FromViewNode(view, id, idConverter) {
+    const node = view.getViewNode(id);
+    const nodeData = {
+        definition: node.definition,
+        identifier: idConverter.convertToStableNodeId(node.identifier),
+    };
+    copyPropertyIfDefined(node, nodeData, 'payload');
+    return Object.assign(Object.assign({}, nodeData), { traits: makeTraits_0_0_2(view, node.traits, idConverter) });
+}
+/**
+ * Given the traits of a TreeViewNode, return the corresponding traits on a Node
+ * @deprecated Remove by march 2022
+ */
+function makeTraits_0_0_2(view, traits, idConverter) {
+    const traitMap = {};
+    for (const [label, trait] of traits.entries()) {
+        Object.defineProperty(traitMap, label, {
+            value: trait.map((id) => getChangeNode_0_0_2FromViewNode(view, id, idConverter)),
+            enumerable: true,
+        });
+    }
+    return traitMap;
+}
+//# sourceMappingURL=SerializationUtilities.js.map

package/lib/SerializationUtilities.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SerializationUtilities.js","sourceRoot":"","sources":["../src/SerializationUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAMhE;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CAAC,IAAc;IACnD,OAAO,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;AACnD,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,yBAAyB,CAAC,IAAc,EAAE,EAAU,EAAE,UAAU,GAAG,KAAK;IACvF,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG;QAChB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;KAC3B,CAAC;IACF,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAEjD,IAAI,UAAU,EAAE;QACf,uCACI,QAAQ,KACX,IAAI,MAAM;gBACT,OAAO,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;YACjF,CAAC,IACA;KACF;IAED,uCACI,QAAQ,KACX,MAAM,EAAE,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,IAChD;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,UAAU,CAClB,IAAc,EACd,MAAkD,EAClD,UAAU,GAAG,KAAK;IAElB,MAAM,QAAQ,GAAG,EAAE,CAAC;IACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE;QAC9C,IAAI,UAAU,EAAE;YACf,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE;gBACtC,GAAG;oBACF,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,yBAAyB,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC,CAAC;oBACzF,OAAO,aAAa,CAAC,IAA4B,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;gBAC1E,CAAC;gBACD,YAAY,EAAE,IAAI;gBAClB,UAAU,EAAE,IAAI;aAChB,CAAC,CAAC;SACH;aAAM;YACN,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE;gBACtC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,yBAAyB,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,CAAC,CAAC;gBACzE,UAAU,EAAE,IAAI;aAChB,CAAC,CAAC;SACH;KACD;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,2BAA2B,CAAC,IAAc,EAAE,WAA4B;IACvF,OAAO,+BAA+B,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;AACtE,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,+BAA+B,CAC9C,IAAc,EACd,EAAU,EACV,WAA4B;IAE5B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;IAClC,MAAM,QAAQ,GAAG;QAChB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,UAAU,EAAE,WAAW,CAAC,qBAAqB,CAAC,IAAI,CAAC,UAAU,CAAC;KAC9D,CAAC;IACF,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAEjD,uCACI,QAAQ,KACX,MAAM,EAAE,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,IACvD;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CACxB,IAAc,EACd,MAAkD,EAClD,WAA4B;IAE5B,MAAM,QAAQ,GAAG,EAAE,CAAC;IACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE;QAC9C,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE;YACtC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,+BAA+B,CAAC,IAAI,EAAE,EAAE,EAAE,WAAW,CAAC,CAAC;YAChF,UAAU,EAAE,IAAI;SAChB,CAAC,CAAC;KACH;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { copyPropertyIfDefined, memoizeGetter } from './Common';\nimport { NodeId, TraitLabel } from './Identifiers';\nimport { NodeIdConverter } from './NodeIdUtilities';\nimport { ChangeNode, ChangeNode_0_0_2, TraitMap } from './persisted-types';\nimport { TreeView } from './TreeView';\n\n/**\n * Converts this tree view to an equivalent `ChangeNode`.\n * @param view - the view to convert\n */\nexport function getChangeNodeFromView(view: TreeView): ChangeNode {\n\treturn getChangeNodeFromViewNode(view, view.root);\n}\n\n/**\n * Converts a node in this tree view to an equivalent `ChangeNode`.\n * @param view - the view of the tree that contains the node to convert\n * @param id - the id of the node to convert\n * @param lazyTraits - whether or not traits should be populated lazily. If true, the subtrees under each trait will not be read until\n * the trait is first accessed.\n */\nexport function getChangeNodeFromViewNode(view: TreeView, id: NodeId, lazyTraits = false): ChangeNode {\n\tconst node = view.getViewNode(id);\n\tconst nodeData = {\n\t\tdefinition: node.definition,\n\t\tidentifier: node.identifier,\n\t};\n\tcopyPropertyIfDefined(node, nodeData, 'payload');\n\n\tif (lazyTraits) {\n\t\treturn {\n\t\t\t...nodeData,\n\t\t\tget traits() {\n\t\t\t\treturn memoizeGetter(this, 'traits', makeTraits(view, node.traits, lazyTraits));\n\t\t\t},\n\t\t};\n\t}\n\n\treturn {\n\t\t...nodeData,\n\t\ttraits: makeTraits(view, node.traits, lazyTraits),\n\t};\n}\n\n/** Given the traits of a TreeViewNode, return the corresponding traits on a Node */\nfunction makeTraits(\n\tview: TreeView,\n\ttraits: ReadonlyMap<TraitLabel, readonly NodeId[]>,\n\tlazyTraits = false\n): TraitMap<ChangeNode> {\n\tconst traitMap = {};\n\tfor (const [label, trait] of traits.entries()) {\n\t\tif (lazyTraits) {\n\t\t\tObject.defineProperty(traitMap, label, {\n\t\t\t\tget() {\n\t\t\t\t\tconst treeNodeTrait = trait.map((id) => getChangeNodeFromViewNode(view, id, lazyTraits));\n\t\t\t\t\treturn memoizeGetter(this as TraitMap<ChangeNode>, label, treeNodeTrait);\n\t\t\t\t},\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t});\n\t\t} else {\n\t\t\tObject.defineProperty(traitMap, label, {\n\t\t\t\tvalue: trait.map((id) => getChangeNodeFromViewNode(view, id, lazyTraits)),\n\t\t\t\tenumerable: true,\n\t\t\t});\n\t\t}\n\t}\n\n\treturn traitMap;\n}\n\n/**\n * Converts this tree view to an equivalent `ChangeNode`.\n * @param view - the view to convert\n */\nexport function getChangeNode_0_0_2FromView(view: TreeView, idConverter: NodeIdConverter): ChangeNode_0_0_2 {\n\treturn getChangeNode_0_0_2FromViewNode(view, view.root, idConverter);\n}\n\n/**\n * Converts a node in this tree view to an equivalent `ChangeNode`.\n * @param view - the view of the tree that contains the node to convert\n * @param id - the id of the node to convert\n * @param lazyTraits - whether or not traits should be populated lazily. If true, the subtrees under each trait will not be read until\n * the trait is first accessed.\n * @deprecated Remove by March 2022\n */\nexport function getChangeNode_0_0_2FromViewNode(\n\tview: TreeView,\n\tid: NodeId,\n\tidConverter: NodeIdConverter\n): ChangeNode_0_0_2 {\n\tconst node = view.getViewNode(id);\n\tconst nodeData = {\n\t\tdefinition: node.definition,\n\t\tidentifier: idConverter.convertToStableNodeId(node.identifier),\n\t};\n\tcopyPropertyIfDefined(node, nodeData, 'payload');\n\n\treturn {\n\t\t...nodeData,\n\t\ttraits: makeTraits_0_0_2(view, node.traits, idConverter),\n\t};\n}\n\n/**\n * Given the traits of a TreeViewNode, return the corresponding traits on a Node\n * @deprecated Remove by march 2022\n */\nfunction makeTraits_0_0_2(\n\tview: TreeView,\n\ttraits: ReadonlyMap<TraitLabel, readonly NodeId[]>,\n\tidConverter: NodeIdConverter\n): TraitMap<ChangeNode_0_0_2> {\n\tconst traitMap = {};\n\tfor (const [label, trait] of traits.entries()) {\n\t\tObject.defineProperty(traitMap, label, {\n\t\t\tvalue: trait.map((id) => getChangeNode_0_0_2FromViewNode(view, id, idConverter)),\n\t\t\tenumerable: true,\n\t\t});\n\t}\n\n\treturn traitMap;\n}\n"]}