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

package/dist/feature-libraries/flex-tree/lazyEntity.js

@@ -16,24 +16,19 @@ var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (
 };
 var _LazyEntity_lazyCursor;
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.LazyEntity = exports.assertFlexTreeEntityNotFreed = exports.anchorSymbol = exports.cursorSymbol = exports.forgetAnchorSymbol = exports.tryMoveCursorToAnchorSymbol = exports.isFreedSymbol = exports.prepareForEditSymbol = exports.makePrivatePropertyNotEnumerable = void 0;
-const core_utils_1 = require("@fluidframework/core-utils");
+exports.LazyEntity = exports.assertFlexTreeEntityNotFreed = exports.anchorSymbol = exports.cursorSymbol = exports.forgetAnchorSymbol = exports.tryMoveCursorToAnchorSymbol = exports.isFreedSymbol = exports.prepareForEditSymbol = void 0;
+const internal_1 = require("@fluidframework/core-utils/internal");
 const index_js_1 = require("../../core/index.js");
 const index_js_2 = require("../../util/index.js");
 const flexTreeTypes_js_1 = require("./flexTreeTypes.js");
-/**
- * Like {@link makePropertyNotEnumerable}, but less type safe so it works on private properties.
- */
-function makePrivatePropertyNotEnumerable(target, key) {
-    (0, core_utils_1.assert)(Object.getOwnPropertyDescriptor(target, key)?.enumerable === true, 0x777 /* missing property or not enumerable */);
-    Object.defineProperty(target, key, { enumerable: false });
-}
-exports.makePrivatePropertyNotEnumerable = makePrivatePropertyNotEnumerable;
 exports.prepareForEditSymbol = Symbol("prepareForEdit");
 exports.isFreedSymbol = Symbol("isFreed");
 exports.tryMoveCursorToAnchorSymbol = Symbol("tryMoveCursorToAnchor");
 exports.forgetAnchorSymbol = Symbol("forgetAnchor");
 exports.cursorSymbol = Symbol("cursor");
+/**
+ * Symbol used to access the (generic) anchor of a {@link LazyEntity}.
+ */
 exports.anchorSymbol = Symbol("anchor");
 /**
  * Assert `entity` is not deleted.
@@ -42,8 +37,8 @@ exports.anchorSymbol = Symbol("anchor");
  * TODO: provide a non implementation dependent way to leverage this optimization.
  */
 function assertFlexTreeEntityNotFreed(entity) {
-    (0, core_utils_1.assert)(entity instanceof LazyEntity, 0x8c9 /* unexpected implementation */);
-    (0, core_utils_1.assert)(!entity[exports.isFreedSymbol](), 0x8ca /* Use after free */);
+    (0, internal_1.assert)(entity instanceof LazyEntity, 0x8c9 /* unexpected implementation */);
+    (0, internal_1.assert)(!entity[exports.isFreedSymbol](), 0x8ca /* Use after free */);
 }
 exports.assertFlexTreeEntityNotFreed = assertFlexTreeEntityNotFreed;
 /**
@@ -62,7 +57,7 @@ class LazyEntity {
     [(_LazyEntity_lazyCursor = new WeakMap(), index_js_2.disposeSymbol)]() {
         __classPrivateFieldGet(this, _LazyEntity_lazyCursor, "f").free();
         this.context.withCursors.delete(this);
-        this[exports.forgetAnchorSymbol](this[exports.anchorSymbol]);
+        this[exports.forgetAnchorSymbol]();
         this.context.withAnchors.delete(this);
     }
     [exports.prepareForEditSymbol]() {
@@ -74,10 +69,10 @@ class LazyEntity {
     }
     get [exports.cursorSymbol]() {
         if (__classPrivateFieldGet(this, _LazyEntity_lazyCursor, "f").state !== index_js_1.ITreeSubscriptionCursorState.Current) {
-            (0, core_utils_1.assert)(__classPrivateFieldGet(this, _LazyEntity_lazyCursor, "f").state === index_js_1.ITreeSubscriptionCursorState.Cleared, 0x778 /* Unset cursor should be in cleared state */);
-            (0, core_utils_1.assert)(this[exports.anchorSymbol] !== undefined, 0x779 /* EditableTree should have an anchor if it does not have a cursor */);
-            const result = this[exports.tryMoveCursorToAnchorSymbol](this[exports.anchorSymbol], __classPrivateFieldGet(this, _LazyEntity_lazyCursor, "f"));
-            (0, core_utils_1.assert)(result === 1 /* TreeNavigationResult.Ok */, 0x77a /* It is invalid to access an EditableTree node which no longer exists */);
+            (0, internal_1.assert)(__classPrivateFieldGet(this, _LazyEntity_lazyCursor, "f").state === index_js_1.ITreeSubscriptionCursorState.Cleared, 0x778 /* Unset cursor should be in cleared state */);
+            (0, internal_1.assert)(this[exports.anchorSymbol] !== undefined, 0x779 /* FlexTree should have an anchor if it does not have a cursor */);
+            const result = this[exports.tryMoveCursorToAnchorSymbol](__classPrivateFieldGet(this, _LazyEntity_lazyCursor, "f"));
+            (0, internal_1.assert)(result === 1 /* TreeNavigationResult.Ok */, 0x77a /* It is invalid to access a FlexTree node which no longer exists */);
             this.context.withCursors.add(this);
         }
         return __classPrivateFieldGet(this, _LazyEntity_lazyCursor, "f");

package/dist/feature-libraries/flex-tree/lazyEntity.js.map

@@ -1 +1 @@
-{"version":3,"file":"lazyEntity.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyEntity.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;AAEH,2DAAoD;AACpD,kDAI6B;AAC7B,kDAAiE;AAEjE,yDAAoG;AAEpG;;GAEG;AACH,SAAgB,gCAAgC,CAC/C,MAAc,EACd,GAA6B;IAE7B,IAAA,mBAAM,EACL,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,UAAU,KAAK,IAAI,EACjE,KAAK,CAAC,wCAAwC,CAC9C,CAAC;IACF,MAAM,CAAC,cAAc,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC,CAAC;AAC3D,CAAC;AATD,4EASC;AAEY,QAAA,oBAAoB,GAAG,MAAM,CAAC,gBAAgB,CAAC,CAAC;AAChD,QAAA,aAAa,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;AAClC,QAAA,2BAA2B,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC;AAC9D,QAAA,kBAAkB,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;AAC5C,QAAA,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;AAChC,QAAA,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;AAE7C;;;;;GAKG;AACH,SAAgB,4BAA4B,CAAC,MAAsB;IAClE,IAAA,mBAAM,EAAC,MAAM,YAAY,UAAU,EAAE,KAAK,CAAC,+BAA+B,CAAC,CAAC;IAC5E,IAAA,mBAAM,EAAC,CAAC,MAAM,CAAC,qBAAa,CAAC,EAAE,EAAE,KAAK,CAAC,oBAAoB,CAAC,CAAC;AAC9D,CAAC;AAHD,oEAGC;AAED;;GAEG;AACH,MAAsB,UAAU;IAM/B,YACiB,OAAgB,EAChB,MAAe,EAC/B,MAA+B,EAC/B,MAAe;QAHC,YAAO,GAAP,OAAO,CAAS;QAChB,WAAM,GAAN,MAAM,CAAS;QALvB,yCAAqC;QAS7C,IAAI,CAAC,oBAAY,CAAC,GAAG,MAAM,CAAC;QAC5B,uBAAA,IAAI,0BAAe,MAAM,CAAC,IAAI,EAAE,MAAA,CAAC;QACjC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAOM,0CAAC,wBAAa,EAAC;QACrB,uBAAA,IAAI,8BAAY,CAAC,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,0BAAkB,CAAC,CAAC,IAAI,CAAC,oBAAY,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAEM,CAAC,4BAAoB,CAAC;QAC5B,uBAAA,IAAI,8BAAY,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAEM,CAAC,qBAAa,CAAC;QACrB,OAAO,uBAAA,IAAI,8BAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,KAAK,CAAC;IACtE,CAAC;IAED,IAAW,CAAC,oBAAY,CAAC;QACxB,IAAI,uBAAA,IAAI,8BAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,OAAO,EAAE;YACpE,IAAA,mBAAM,EACL,uBAAA,IAAI,8BAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,OAAO,EAC/D,KAAK,CAAC,6CAA6C,CACnD,CAAC;YACF,IAAA,mBAAM,EACL,IAAI,CAAC,oBAAY,CAAC,KAAK,SAAS,EAChC,KAAK,CAAC,qEAAqE,CAC3E,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,CAAC,mCAA2B,CAAC,CAAC,IAAI,CAAC,oBAAY,CAAC,EAAE,uBAAA,IAAI,8BAAY,CAAC,CAAC;YACvF,IAAA,mBAAM,EACL,MAAM,oCAA4B,EAClC,KAAK,CAAC,yEAAyE,CAC/E,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;SACnC;QACD,OAAO,uBAAA,IAAI,8BAAY,CAAC;IACzB,CAAC;CAWD;AApED,gCAoEC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport {\n\tTreeNavigationResult,\n\tITreeSubscriptionCursor,\n\tITreeSubscriptionCursorState,\n} from \"../../core/index.js\";\nimport { disposeSymbol, IDisposable } from \"../../util/index.js\";\nimport { Context } from \"./context.js\";\nimport { FlexTreeEntity, FlexTreeEntityKind, TreeStatus, flexTreeMarker } from \"./flexTreeTypes.js\";\n\n/**\n * Like {@link makePropertyNotEnumerable}, but less type safe so it works on private properties.\n */\nexport function makePrivatePropertyNotEnumerable(\n\ttarget: object,\n\tkey: string | symbol | number,\n): void {\n\tassert(\n\t\tObject.getOwnPropertyDescriptor(target, key)?.enumerable === true,\n\t\t0x777 /* missing property or not enumerable */,\n\t);\n\tObject.defineProperty(target, key, { enumerable: false });\n}\n\nexport const prepareForEditSymbol = Symbol(\"prepareForEdit\");\nexport const isFreedSymbol = Symbol(\"isFreed\");\nexport const tryMoveCursorToAnchorSymbol = Symbol(\"tryMoveCursorToAnchor\");\nexport const forgetAnchorSymbol = Symbol(\"forgetAnchor\");\nexport const cursorSymbol = Symbol(\"cursor\");\nexport const anchorSymbol = Symbol(\"anchor\");\n\n/**\n * Assert `entity` is not deleted.\n * @privateRemarks\n * This can be faster than getting the tree status and checking that since that can require computing removed vs deleted.\n * TODO: provide a non implementation dependent way to leverage this optimization.\n */\nexport function assertFlexTreeEntityNotFreed(entity: FlexTreeEntity): void {\n\tassert(entity instanceof LazyEntity, 0x8c9 /* unexpected implementation */);\n\tassert(!entity[isFreedSymbol](), 0x8ca /* Use after free */);\n}\n\n/**\n * This is a base class for lazy (cursor based) UntypedEntity implementations, which uniformly handles cursors and anchors.\n */\nexport abstract class LazyEntity<TSchema = unknown, TAnchor = unknown>\n\timplements FlexTreeEntity<TSchema>, IDisposable\n{\n\treadonly #lazyCursor: ITreeSubscriptionCursor;\n\tpublic readonly [anchorSymbol]: TAnchor;\n\n\tprotected constructor(\n\t\tpublic readonly context: Context,\n\t\tpublic readonly schema: TSchema,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tanchor: TAnchor,\n\t) {\n\t\tthis[anchorSymbol] = anchor;\n\t\tthis.#lazyCursor = cursor.fork();\n\t\tcontext.withCursors.add(this);\n\t\tthis.context.withAnchors.add(this);\n\t}\n\n\tpublic abstract boxedIterator(): IterableIterator<FlexTreeEntity>;\n\tpublic abstract get [flexTreeMarker](): FlexTreeEntityKind;\n\n\tpublic abstract treeStatus(): TreeStatus;\n\n\tpublic [disposeSymbol](): void {\n\t\tthis.#lazyCursor.free();\n\t\tthis.context.withCursors.delete(this);\n\t\tthis[forgetAnchorSymbol](this[anchorSymbol]);\n\t\tthis.context.withAnchors.delete(this);\n\t}\n\n\tpublic [prepareForEditSymbol](): void {\n\t\tthis.#lazyCursor.clear();\n\t\tthis.context.withCursors.delete(this);\n\t}\n\n\tpublic [isFreedSymbol](): boolean {\n\t\treturn this.#lazyCursor.state === ITreeSubscriptionCursorState.Freed;\n\t}\n\n\tpublic get [cursorSymbol](): ITreeSubscriptionCursor {\n\t\tif (this.#lazyCursor.state !== ITreeSubscriptionCursorState.Current) {\n\t\t\tassert(\n\t\t\t\tthis.#lazyCursor.state === ITreeSubscriptionCursorState.Cleared,\n\t\t\t\t0x778 /* Unset cursor should be in cleared state */,\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tthis[anchorSymbol] !== undefined,\n\t\t\t\t0x779 /* EditableTree should have an anchor if it does not have a cursor */,\n\t\t\t);\n\t\t\tconst result = this[tryMoveCursorToAnchorSymbol](this[anchorSymbol], this.#lazyCursor);\n\t\t\tassert(\n\t\t\t\tresult === TreeNavigationResult.Ok,\n\t\t\t\t0x77a /* It is invalid to access an EditableTree node which no longer exists */,\n\t\t\t);\n\t\t\tthis.context.withCursors.add(this);\n\t\t}\n\t\treturn this.#lazyCursor;\n\t}\n\n\tprotected abstract [tryMoveCursorToAnchorSymbol](\n\t\tanchor: TAnchor,\n\t\tcursor: ITreeSubscriptionCursor,\n\t): TreeNavigationResult;\n\n\t/**\n\t * Called when disposing of this target, iff it has an anchor.\n\t */\n\tprotected abstract [forgetAnchorSymbol](anchor: TAnchor): void;\n}\n\n/**\n * Prevent Entities from inheriting members from Object.prototype including:\n * '__defineGetter__', '__defineSetter__', '__lookupGetter__', '__lookupSetter__', '__proto__',\n * 'hasOwnProperty', 'isPrototypeOf', 'valueOf', 'propertyIsEnumerable', 'toLocaleString' and 'toString'.\n *\n * This opens up more options for field names on struct nodes.\n */\nObject.setPrototypeOf(LazyEntity.prototype, null);\n"]}
+{"version":3,"file":"lazyEntity.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyEntity.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;;;;;;;;;;;;;AAEH,kEAA6D;AAE7D,kDAI6B;AAC7B,kDAAiE;AAGjE,yDAAoG;AAEvF,QAAA,oBAAoB,GAAG,MAAM,CAAC,gBAAgB,CAAC,CAAC;AAChD,QAAA,aAAa,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;AAClC,QAAA,2BAA2B,GAAG,MAAM,CAAC,uBAAuB,CAAC,CAAC;AAC9D,QAAA,kBAAkB,GAAG,MAAM,CAAC,cAAc,CAAC,CAAC;AAC5C,QAAA,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;AAC7C;;GAEG;AACU,QAAA,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;AAE7C;;;;;GAKG;AACH,SAAgB,4BAA4B,CAAC,MAAsB;IAClE,IAAA,iBAAM,EAAC,MAAM,YAAY,UAAU,EAAE,KAAK,CAAC,+BAA+B,CAAC,CAAC;IAC5E,IAAA,iBAAM,EAAC,CAAC,MAAM,CAAC,qBAAa,CAAC,EAAE,EAAE,KAAK,CAAC,oBAAoB,CAAC,CAAC;AAC9D,CAAC;AAHD,oEAGC;AAED;;GAEG;AACH,MAAsB,UAAU;IAM/B,YACiB,OAAgB,EAChB,MAAe,EAC/B,MAA+B,EAC/B,MAAe;QAHC,YAAO,GAAP,OAAO,CAAS;QAChB,WAAM,GAAN,MAAM,CAAS;QALvB,yCAAqC;QAS7C,IAAI,CAAC,oBAAY,CAAC,GAAG,MAAM,CAAC;QAC5B,uBAAA,IAAI,0BAAe,MAAM,CAAC,IAAI,EAAE,MAAA,CAAC;QACjC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAOM,0CAAC,wBAAa,EAAC;QACrB,uBAAA,IAAI,8BAAY,CAAC,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,0BAAkB,CAAC,EAAE,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAEM,CAAC,4BAAoB,CAAC;QAC5B,uBAAA,IAAI,8BAAY,CAAC,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAEM,CAAC,qBAAa,CAAC;QACrB,OAAO,uBAAA,IAAI,8BAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,KAAK,CAAC;IACtE,CAAC;IAED,IAAW,CAAC,oBAAY,CAAC;QACxB,IAAI,uBAAA,IAAI,8BAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,OAAO,EAAE;YACpE,IAAA,iBAAM,EACL,uBAAA,IAAI,8BAAY,CAAC,KAAK,KAAK,uCAA4B,CAAC,OAAO,EAC/D,KAAK,CAAC,6CAA6C,CACnD,CAAC;YACF,IAAA,iBAAM,EACL,IAAI,CAAC,oBAAY,CAAC,KAAK,SAAS,EAChC,KAAK,CAAC,iEAAiE,CACvE,CAAC;YACF,MAAM,MAAM,GAAG,IAAI,CAAC,mCAA2B,CAAC,CAAC,uBAAA,IAAI,8BAAY,CAAC,CAAC;YACnE,IAAA,iBAAM,EACL,MAAM,oCAA4B,EAClC,KAAK,CAAC,oEAAoE,CAC1E,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;SACnC;QACD,OAAO,uBAAA,IAAI,8BAAY,CAAC;IACzB,CAAC;CAUD;AAnED,gCAmEC;AAED;;;;;;GAMG;AACH,MAAM,CAAC,cAAc,CAAC,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\n\nimport {\n\tITreeSubscriptionCursor,\n\tITreeSubscriptionCursorState,\n\tTreeNavigationResult,\n} from \"../../core/index.js\";\nimport { IDisposable, disposeSymbol } from \"../../util/index.js\";\n\nimport { Context } from \"./context.js\";\nimport { FlexTreeEntity, FlexTreeEntityKind, TreeStatus, flexTreeMarker } from \"./flexTreeTypes.js\";\n\nexport const prepareForEditSymbol = Symbol(\"prepareForEdit\");\nexport const isFreedSymbol = Symbol(\"isFreed\");\nexport const tryMoveCursorToAnchorSymbol = Symbol(\"tryMoveCursorToAnchor\");\nexport const forgetAnchorSymbol = Symbol(\"forgetAnchor\");\nexport const cursorSymbol = Symbol(\"cursor\");\n/**\n * Symbol used to access the (generic) anchor of a {@link LazyEntity}.\n */\nexport const anchorSymbol = Symbol(\"anchor\");\n\n/**\n * Assert `entity` is not deleted.\n * @privateRemarks\n * This can be faster than getting the tree status and checking that since that can require computing removed vs deleted.\n * TODO: provide a non implementation dependent way to leverage this optimization.\n */\nexport function assertFlexTreeEntityNotFreed(entity: FlexTreeEntity): void {\n\tassert(entity instanceof LazyEntity, 0x8c9 /* unexpected implementation */);\n\tassert(!entity[isFreedSymbol](), 0x8ca /* Use after free */);\n}\n\n/**\n * This is a base class for lazy (cursor based) UntypedEntity implementations, which uniformly handles cursors and anchors.\n */\nexport abstract class LazyEntity<TSchema = unknown, TAnchor = unknown>\n\timplements FlexTreeEntity<TSchema>, IDisposable\n{\n\treadonly #lazyCursor: ITreeSubscriptionCursor;\n\tpublic readonly [anchorSymbol]: TAnchor;\n\n\tprotected constructor(\n\t\tpublic readonly context: Context,\n\t\tpublic readonly schema: TSchema,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tanchor: TAnchor,\n\t) {\n\t\tthis[anchorSymbol] = anchor;\n\t\tthis.#lazyCursor = cursor.fork();\n\t\tcontext.withCursors.add(this);\n\t\tthis.context.withAnchors.add(this);\n\t}\n\n\tpublic abstract boxedIterator(): IterableIterator<FlexTreeEntity>;\n\tpublic abstract get [flexTreeMarker](): FlexTreeEntityKind;\n\n\tpublic abstract treeStatus(): TreeStatus;\n\n\tpublic [disposeSymbol](): void {\n\t\tthis.#lazyCursor.free();\n\t\tthis.context.withCursors.delete(this);\n\t\tthis[forgetAnchorSymbol]();\n\t\tthis.context.withAnchors.delete(this);\n\t}\n\n\tpublic [prepareForEditSymbol](): void {\n\t\tthis.#lazyCursor.clear();\n\t\tthis.context.withCursors.delete(this);\n\t}\n\n\tpublic [isFreedSymbol](): boolean {\n\t\treturn this.#lazyCursor.state === ITreeSubscriptionCursorState.Freed;\n\t}\n\n\tpublic get [cursorSymbol](): ITreeSubscriptionCursor {\n\t\tif (this.#lazyCursor.state !== ITreeSubscriptionCursorState.Current) {\n\t\t\tassert(\n\t\t\t\tthis.#lazyCursor.state === ITreeSubscriptionCursorState.Cleared,\n\t\t\t\t0x778 /* Unset cursor should be in cleared state */,\n\t\t\t);\n\t\t\tassert(\n\t\t\t\tthis[anchorSymbol] !== undefined,\n\t\t\t\t0x779 /* FlexTree should have an anchor if it does not have a cursor */,\n\t\t\t);\n\t\t\tconst result = this[tryMoveCursorToAnchorSymbol](this.#lazyCursor);\n\t\t\tassert(\n\t\t\t\tresult === TreeNavigationResult.Ok,\n\t\t\t\t0x77a /* It is invalid to access a FlexTree node which no longer exists */,\n\t\t\t);\n\t\t\tthis.context.withCursors.add(this);\n\t\t}\n\t\treturn this.#lazyCursor;\n\t}\n\n\tprotected abstract [tryMoveCursorToAnchorSymbol](\n\t\tcursor: ITreeSubscriptionCursor,\n\t): TreeNavigationResult;\n\n\t/**\n\t * Called when disposing of this target, iff it has an anchor.\n\t */\n\tprotected abstract [forgetAnchorSymbol](): void;\n}\n\n/**\n * Prevent Entities from inheriting members from Object.prototype including:\n * '__defineGetter__', '__defineSetter__', '__lookupGetter__', '__lookupSetter__', '__proto__',\n * 'hasOwnProperty', 'isPrototypeOf', 'valueOf', 'propertyIsEnumerable', 'toLocaleString' and 'toString'.\n *\n * This opens up more options for field names on struct nodes.\n */\nObject.setPrototypeOf(LazyEntity.prototype, null);\n"]}

package/dist/feature-libraries/flex-tree/lazyField.d.ts

@@ -2,13 +2,13 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { FieldKey, TreeNavigationResult, ITreeSubscriptionCursor, FieldAnchor, FieldUpPath } from "../../core/index.js";
-import { FlexFieldKind } from "../modular-schema/index.js";
+import { FieldAnchor, FieldKey, FieldUpPath, ITreeSubscriptionCursor, TreeNavigationResult } from "../../core/index.js";
 import { FieldKinds } from "../default-schema/index.js";
-import { FlexAllowedTypes, FlexFieldSchema } from "../typed-schema/index.js";
+import { FlexFieldKind } from "../modular-schema/index.js";
 import { LocalNodeKey, StableNodeKey } from "../node-key/index.js";
+import { FlexAllowedTypes, FlexFieldSchema } from "../typed-schema/index.js";
 import { Context } from "./context.js";
-import { FlexibleNodeContent, FlexTreeOptionalField, FlexTreeSequenceField, FlexTreeTypedField, FlexTreeTypedNodeUnion, FlexTreeUnboxNodeUnion, FlexTreeField, FlexTreeNode, FlexTreeRequiredField, TreeStatus, FlexTreeNodeKeyField, FlexibleNodeSubSequence, FlexTreeEntityKind, flexTreeMarker } from "./flexTreeTypes.js";
+import { FlexTreeEntityKind, FlexTreeField, FlexTreeNode, FlexTreeNodeKeyField, FlexTreeOptionalField, FlexTreeRequiredField, FlexTreeSequenceField, FlexTreeTypedField, FlexTreeTypedNodeUnion, FlexTreeUnboxNodeUnion, FlexibleNodeContent, FlexibleNodeSubSequence, TreeStatus, flexTreeMarker } from "./flexTreeTypes.js";
 import { LazyEntity, forgetAnchorSymbol, tryMoveCursorToAnchorSymbol } from "./lazyEntity.js";
 export declare function makeField(context: Context, schema: FlexFieldSchema, cursor: ITreeSubscriptionCursor): FlexTreeField;
 /**
@@ -18,12 +18,17 @@ export declare function makeField(context: Context, schema: FlexFieldSchema, cur
 export declare abstract class LazyField<TKind extends FlexFieldKind, TTypes extends FlexAllowedTypes> extends LazyEntity<FlexFieldSchema<TKind, TTypes>, FieldAnchor> implements FlexTreeField {
     get [flexTreeMarker](): FlexTreeEntityKind.Field;
     readonly key: FieldKey;
+    /**
+     * If this field ends its lifetime before the Anchor does, this needs to be invoked to avoid a double free
+     * if/when the Anchor is destroyed.
+     */
+    private readonly offAfterDestroy?;
     constructor(context: Context, schema: FlexFieldSchema<TKind, TTypes>, cursor: ITreeSubscriptionCursor, fieldAnchor: FieldAnchor);
     is<TSchema extends FlexFieldSchema>(schema: TSchema): this is FlexTreeTypedField<TSchema>;
     isSameAs(other: FlexTreeField): boolean;
     get parent(): FlexTreeNode | undefined;
-    protected [tryMoveCursorToAnchorSymbol](anchor: FieldAnchor, cursor: ITreeSubscriptionCursor): TreeNavigationResult;
-    protected [forgetAnchorSymbol](anchor: FieldAnchor): void;
+    protected [tryMoveCursorToAnchorSymbol](cursor: ITreeSubscriptionCursor): TreeNavigationResult;
+    protected [forgetAnchorSymbol](): void;
     get length(): number;
     atIndex(index: number): FlexTreeUnboxNodeUnion<TTypes>;
     boxedAt(index: number): FlexTreeTypedNodeUnion<TTypes> | undefined;
@@ -63,13 +68,22 @@ export declare class LazySequence<TTypes extends FlexAllowedTypes> extends LazyF
     moveRangeToIndex(index: number, sourceStart: number, sourceEnd: number, source: FlexTreeSequenceField<FlexAllowedTypes>): void;
     private _moveRangeToIndex;
 }
-export declare class LazyValueField<TTypes extends FlexAllowedTypes> extends LazyField<typeof FieldKinds.required, TTypes> implements FlexTreeRequiredField<TTypes> {
+export declare class ReadonlyLazyValueField<TTypes extends FlexAllowedTypes> extends LazyField<typeof FieldKinds.required, TTypes> implements FlexTreeRequiredField<TTypes> {
+    constructor(context: Context, schema: FlexFieldSchema<typeof FieldKinds.required, TTypes>, cursor: ITreeSubscriptionCursor, fieldAnchor: FieldAnchor);
+    get content(): FlexTreeUnboxNodeUnion<TTypes>;
+    set content(newContent: FlexibleNodeContent<TTypes>);
+    get boxedContent(): FlexTreeTypedNodeUnion<TTypes>;
+}
+export declare class LazyValueField<TTypes extends FlexAllowedTypes> extends ReadonlyLazyValueField<TTypes> implements FlexTreeRequiredField<TTypes> {
     constructor(context: Context, schema: FlexFieldSchema<typeof FieldKinds.required, TTypes>, cursor: ITreeSubscriptionCursor, fieldAnchor: FieldAnchor);
     private valueFieldEditor;
     get content(): FlexTreeUnboxNodeUnion<TTypes>;
     set content(newContent: FlexibleNodeContent<TTypes>);
     get boxedContent(): FlexTreeTypedNodeUnion<TTypes>;
 }
+export declare class LazyIdentifierField<TTypes extends FlexAllowedTypes> extends ReadonlyLazyValueField<TTypes> implements FlexTreeRequiredField<TTypes> {
+    constructor(context: Context, schema: FlexFieldSchema<typeof FieldKinds.required, TTypes>, cursor: ITreeSubscriptionCursor, fieldAnchor: FieldAnchor);
+}
 export declare class LazyOptionalField<TTypes extends FlexAllowedTypes> extends LazyField<typeof FieldKinds.optional, TTypes> implements FlexTreeOptionalField<TTypes> {
     constructor(context: Context, schema: FlexFieldSchema<typeof FieldKinds.optional, TTypes>, cursor: ITreeSubscriptionCursor, fieldAnchor: FieldAnchor);
     private optionalEditor;

package/dist/feature-libraries/flex-tree/lazyField.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"lazyField.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyField.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EACN,QAAQ,EACR,oBAAoB,EACpB,uBAAuB,EAEvB,WAAW,EAEX,WAAW,EAKX,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAG3D,OAAO,EACN,UAAU,EAIV,MAAM,4BAA4B,CAAC;AAQpC,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC7E,OAAO,EAAE,YAAY,EAAE,aAAa,EAAyB,MAAM,sBAAsB,CAAC;AAE1F,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EACN,mBAAmB,EACnB,qBAAqB,EACrB,qBAAqB,EACrB,kBAAkB,EAClB,sBAAsB,EACtB,sBAAsB,EACtB,aAAa,EACb,YAAY,EACZ,qBAAqB,EACrB,UAAU,EACV,oBAAoB,EACpB,uBAAuB,EACvB,kBAAkB,EAClB,cAAc,EACd,MAAM,oBAAoB,CAAC;AAE5B,OAAO,EACN,UAAU,EAGV,kBAAkB,EAElB,2BAA2B,EAC3B,MAAM,iBAAiB,CAAC;AA4BzB,wBAAgB,SAAS,CACxB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,EACvB,MAAM,EAAE,uBAAuB,GAC7B,aAAa,CAqBf;AAED;;;GAGG;AACH,8BAAsB,SAAS,CAAC,KAAK,SAAS,aAAa,EAAE,MAAM,SAAS,gBAAgB,CAC3F,SAAQ,UAAU,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,WAAW,CAC9D,YAAW,aAAa;IAExB,IAAW,CAAC,cAAc,CAAC,IAAI,kBAAkB,CAAC,KAAK,CAEtD;IACD,SAAgB,GAAG,EAAE,QAAQ,CAAC;gBAG7B,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,EACtC,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAOlB,EAAE,CAAC,OAAO,SAAS,eAAe,EACxC,MAAM,EAAE,OAAO,GACb,IAAI,IAAI,kBAAkB,CAAC,OAAO,CAAC;IAS/B,QAAQ,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAQ9C,IAAW,MAAM,IAAI,YAAY,GAAG,SAAS,CAU5C;cAEkB,CAAC,2BAA2B,CAAC,CAC/C,MAAM,EAAE,WAAW,EACnB,MAAM,EAAE,uBAAuB,GAC7B,oBAAoB;cAIJ,CAAC,kBAAkB,CAAC,CAAC,MAAM,EAAE,WAAW,GAAG,IAAI;IAKlE,IAAW,MAAM,IAAI,MAAM,CAE1B;IAEM,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC;IAMtD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS;IAYlE,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,sBAAsB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE;IAIpF,QAAQ,CAAC,CAAC,EAChB,UAAU,EAAE,CAAC,KAAK,EAAE,sBAAsB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GACrE,CAAC,EAAE;IAIC,aAAa,IAAI,gBAAgB,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAOjE,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAMrE,UAAU,IAAI,UAAU;IAiBxB,YAAY,IAAI,WAAW;IAIlC;;;OAGG;IACI,sBAAsB,IAAI,WAAW;CAO5C;AAED,qBAAa,YAAY,CAAC,MAAM,SAAS,gBAAgB,CACxD,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CACpD,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKlB,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS;IAWpE,IAAW,OAAO,IAAI,SAAS,sBAAsB,CAAC,MAAM,CAAC,EAAE,CAE9D;IAED,OAAO,CAAC,cAAc;IAMf,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,GAAG,IAAI;IAcrE,aAAa,CAAC,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,GAAG,IAAI;IAI3D,WAAW,CAAC,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,GAAG,IAAI;IAIzD,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAK7B,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI;IAS/C,WAAW,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IACtC,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAAG,IAAI;IAOvF,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IACpC,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAAG,IAAI;IAIrF,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI;IACrD,WAAW,CACjB,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IASA,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAC9D,gBAAgB,CACtB,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IASA,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAC5D,cAAc,CACpB,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IASA,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAC7E,gBAAgB,CACtB,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IAUP,OAAO,CAAC,iBAAiB;CAmCzB;AAED,qBAAa,cAAc,CAAC,MAAM,SAAS,gBAAgB,CAC1D,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CACpD,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKzB,OAAO,CAAC,gBAAgB;IAMxB,IAAW,OAAO,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAEnD;IAED,IAAW,OAAO,CAAC,UAAU,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAOzD;IAED,IAAW,YAAY,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAExD;CACD;AAED,qBAAa,iBAAiB,CAAC,MAAM,SAAS,gBAAgB,CAC7D,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CACpD,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKzB,OAAO,CAAC,cAAc;IAMtB,IAAW,OAAO,IAAI,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS,CAE/D;IAED,IAAW,OAAO,CAAC,UAAU,EAAE,mBAAmB,CAAC,MAAM,CAAC,GAAG,SAAS,EAarE;IAED,IAAW,YAAY,IAAI,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS,CAEpE;CACD;AAED,qBAAa,gBAAgB,CAAC,MAAM,SAAS,gBAAgB,CAC5D,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,OAAO,EAAE,MAAM,CACnD,YAAW,oBAAoB;gBAG9B,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,OAAO,EAAE,MAAM,CAAC,EAC1D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKzB,IAAW,YAAY,IAAI,YAAY,CAItC;IAED,IAAW,aAAa,IAAI,aAAa,CAQxC;CACD;AAED,qBAAa,kBAAkB,CAAC,MAAM,SAAS,gBAAgB,CAAE,SAAQ,SAAS,CACjF,OAAO,UAAU,CAAC,SAAS,EAC3B,MAAM,CACN;CAAG"}
+{"version":3,"file":"lazyField.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyField.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAEN,WAAW,EACX,QAAQ,EACR,WAAW,EAEX,uBAAuB,EACvB,oBAAoB,EAKpB,MAAM,qBAAqB,CAAC;AAU7B,OAAO,EACN,UAAU,EAIV,MAAM,4BAA4B,CAAC;AAEpC,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAE,YAAY,EAAE,aAAa,EAAyB,MAAM,sBAAsB,CAAC;AAC1F,OAAO,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAE7E,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EACN,kBAAkB,EAClB,aAAa,EACb,YAAY,EACZ,oBAAoB,EACpB,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,EACrB,kBAAkB,EAClB,sBAAsB,EACtB,sBAAsB,EACtB,mBAAmB,EACnB,uBAAuB,EACvB,UAAU,EACV,cAAc,EACd,MAAM,oBAAoB,CAAC;AAC5B,OAAO,EACN,UAAU,EAGV,kBAAkB,EAElB,2BAA2B,EAC3B,MAAM,iBAAiB,CAAC;AA6BzB,wBAAgB,SAAS,CACxB,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,EACvB,MAAM,EAAE,uBAAuB,GAC7B,aAAa,CAUf;AAED;;;GAGG;AACH,8BAAsB,SAAS,CAAC,KAAK,SAAS,aAAa,EAAE,MAAM,SAAS,gBAAgB,CAC3F,SAAQ,UAAU,CAAC,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,EAAE,WAAW,CAC9D,YAAW,aAAa;IAExB,IAAW,CAAC,cAAc,CAAC,IAAI,kBAAkB,CAAC,KAAK,CAEtD;IACD,SAAgB,GAAG,EAAE,QAAQ,CAAC;IAE9B;;;OAGG;IACH,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAa;gBAG7C,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,KAAK,EAAE,MAAM,CAAC,EACtC,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAiBlB,EAAE,CAAC,OAAO,SAAS,eAAe,EACxC,MAAM,EAAE,OAAO,GACb,IAAI,IAAI,kBAAkB,CAAC,OAAO,CAAC;IAS/B,QAAQ,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAQ9C,IAAW,MAAM,IAAI,YAAY,GAAG,SAAS,CAU5C;cAEkB,CAAC,2BAA2B,CAAC,CAC/C,MAAM,EAAE,uBAAuB,GAC7B,oBAAoB;cAIJ,CAAC,kBAAkB,CAAC,IAAI,IAAI;IAM/C,IAAW,MAAM,IAAI,MAAM,CAE1B;IAEM,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC;IAMtD,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS;IAYlE,GAAG,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,KAAK,EAAE,sBAAsB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GAAG,CAAC,EAAE;IAIpF,QAAQ,CAAC,CAAC,EAChB,UAAU,EAAE,CAAC,KAAK,EAAE,sBAAsB,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,CAAC,GACrE,CAAC,EAAE;IAIC,aAAa,IAAI,gBAAgB,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAOjE,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;IAMrE,UAAU,IAAI,UAAU;IAiBxB,YAAY,IAAI,WAAW;IAIlC;;;OAGG;IACI,sBAAsB,IAAI,WAAW;CAO5C;AAED,qBAAa,YAAY,CAAC,MAAM,SAAS,gBAAgB,CACxD,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CACpD,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKlB,EAAE,CAAC,KAAK,EAAE,MAAM,GAAG,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS;IAWpE,IAAW,OAAO,IAAI,SAAS,sBAAsB,CAAC,MAAM,CAAC,EAAE,CAE9D;IAED,OAAO,CAAC,cAAc;IAMf,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,GAAG,IAAI;IAcrE,aAAa,CAAC,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,GAAG,IAAI;IAI3D,WAAW,CAAC,KAAK,EAAE,uBAAuB,CAAC,MAAM,CAAC,GAAG,IAAI;IAIzD,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAK7B,WAAW,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI;IAS/C,WAAW,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IACtC,WAAW,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAAG,IAAI;IAOvF,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI;IACpC,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAAG,IAAI;IAIrF,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI;IACrD,WAAW,CACjB,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IASA,gBAAgB,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAC9D,gBAAgB,CACtB,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IASA,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAC5D,cAAc,CACpB,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IASA,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,IAAI;IAC7E,gBAAgB,CACtB,KAAK,EAAE,MAAM,EACb,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,qBAAqB,CAAC,gBAAgB,CAAC,GAC7C,IAAI;IAUP,OAAO,CAAC,iBAAiB;CAmCzB;AAED,qBAAa,sBAAsB,CAAC,MAAM,SAAS,gBAAgB,CAClE,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CACpD,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKzB,IAAW,OAAO,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAEnD;IAED,IAAW,OAAO,CAAC,UAAU,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAEzD;IAED,IAAW,YAAY,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAExD;CACD;AAED,qBAAa,cAAc,CAAC,MAAM,SAAS,gBAAgB,CAC1D,SAAQ,sBAAsB,CAAC,MAAM,CACrC,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKzB,OAAO,CAAC,gBAAgB;IAMxB,IAAoB,OAAO,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAE5D;IAED,IAAoB,OAAO,CAAC,UAAU,EAAE,mBAAmB,CAAC,MAAM,CAAC,EAOlE;IAED,IAAoB,YAAY,IAAI,sBAAsB,CAAC,MAAM,CAAC,CAEjE;CACD;AAED,qBAAa,mBAAmB,CAAC,MAAM,SAAS,gBAAgB,CAC/D,SAAQ,sBAAsB,CAAC,MAAM,CACrC,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;CAIzB;AAED,qBAAa,iBAAiB,CAAC,MAAM,SAAS,gBAAgB,CAC7D,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CACpD,YAAW,qBAAqB,CAAC,MAAM,CAAC;gBAGvC,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,QAAQ,EAAE,MAAM,CAAC,EAC3D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKzB,OAAO,CAAC,cAAc;IAMtB,IAAW,OAAO,IAAI,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS,CAE/D;IAED,IAAW,OAAO,CAAC,UAAU,EAAE,mBAAmB,CAAC,MAAM,CAAC,GAAG,SAAS,EAarE;IAED,IAAW,YAAY,IAAI,sBAAsB,CAAC,MAAM,CAAC,GAAG,SAAS,CAEpE;CACD;AAED,qBAAa,gBAAgB,CAAC,MAAM,SAAS,gBAAgB,CAC5D,SAAQ,SAAS,CAAC,OAAO,UAAU,CAAC,OAAO,EAAE,MAAM,CACnD,YAAW,oBAAoB;gBAG9B,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,OAAO,UAAU,CAAC,OAAO,EAAE,MAAM,CAAC,EAC1D,MAAM,EAAE,uBAAuB,EAC/B,WAAW,EAAE,WAAW;IAKzB,IAAW,YAAY,IAAI,YAAY,CAItC;IAED,IAAW,aAAa,IAAI,aAAa,CAQxC;CACD;AAED,qBAAa,kBAAkB,CAAC,MAAM,SAAS,gBAAgB,CAAE,SAAQ,SAAS,CACjF,OAAO,UAAU,CAAC,SAAS,EAC3B,MAAM,CACN;CAAG"}

package/dist/feature-libraries/flex-tree/lazyField.js

@@ -4,18 +4,18 @@
  * Licensed under the MIT License.
  */
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.LazyForbiddenField = exports.LazyNodeKeyField = exports.LazyOptionalField = exports.LazyValueField = exports.LazySequence = exports.LazyField = exports.makeField = void 0;
-const core_utils_1 = require("@fluidframework/core-utils");
+exports.LazyForbiddenField = exports.LazyNodeKeyField = exports.LazyOptionalField = exports.LazyIdentifierField = exports.LazyValueField = exports.ReadonlyLazyValueField = exports.LazySequence = exports.LazyField = exports.makeField = void 0;
+const internal_1 = require("@fluidframework/core-utils/internal");
 const index_js_1 = require("../../core/index.js");
+const index_js_2 = require("../../util/index.js");
 // TODO: stop depending on contextuallyTyped
 const contextuallyTyped_js_1 = require("../contextuallyTyped.js");
-const index_js_2 = require("../default-schema/index.js");
-const index_js_3 = require("../../util/index.js");
-const index_js_4 = require("../node-key/index.js");
+const index_js_3 = require("../default-schema/index.js");
 const mapTreeCursor_js_1 = require("../mapTreeCursor.js");
+const index_js_4 = require("../node-key/index.js");
 const flexTreeTypes_js_1 = require("./flexTreeTypes.js");
-const lazyNode_js_1 = require("./lazyNode.js");
 const lazyEntity_js_1 = require("./lazyEntity.js");
+const lazyNode_js_1 = require("./lazyNode.js");
 const unboxed_js_1 = require("./unboxed.js");
 const utilities_js_1 = require("./utilities.js");
 /**
@@ -43,16 +43,7 @@ function indexForAt(index, length) {
 }
 function makeField(context, schema, cursor) {
     const fieldAnchor = cursor.buildFieldAnchor();
-    const field = new (kindToClass.get(schema.kind) ?? (0, index_js_3.fail)("missing field implementation"))(context, schema, cursor, fieldAnchor);
-    // Fields currently live as long as their parent does.
-    // For root fields, this means forever, but other cases can be cleaned up when their parent anchor is deleted.
-    if (fieldAnchor.parent !== undefined) {
-        const anchorNode = context.forest.anchors.locate(fieldAnchor.parent) ??
-            (0, index_js_3.fail)("parent anchor node should always exist since field is under a node");
-        anchorNode.on("afterDestroy", () => {
-            field[index_js_3.disposeSymbol]();
-        });
-    }
+    const field = new (kindToClass.get(schema.kind) ?? (0, index_js_2.fail)("missing field implementation"))(context, schema, cursor, fieldAnchor);
     return field;
 }
 exports.makeField = makeField;
@@ -66,15 +57,24 @@ class LazyField extends lazyEntity_js_1.LazyEntity {
     }
     constructor(context, schema, cursor, fieldAnchor) {
         super(context, schema, cursor, fieldAnchor);
-        (0, core_utils_1.assert)(cursor.mode === 1 /* CursorLocationType.Fields */, 0x77b /* must be in fields mode */);
+        (0, internal_1.assert)(cursor.mode === 1 /* CursorLocationType.Fields */, 0x77b /* must be in fields mode */);
         this.key = cursor.getFieldKey();
+        // Fields currently live as long as their parent does.
+        // For root fields, this means forever, but other cases can be cleaned up when their parent anchor is deleted.
+        if (fieldAnchor.parent !== undefined) {
+            const anchorNode = context.forest.anchors.locate(fieldAnchor.parent) ??
+                (0, index_js_2.fail)("parent anchor node should always exist since field is under a node");
+            this.offAfterDestroy = anchorNode.on("afterDestroy", () => {
+                this[index_js_2.disposeSymbol]();
+            });
+        }
     }
     is(schema) {
-        (0, core_utils_1.assert)(this.context.schema.policy.fieldKinds.get(schema.kind.identifier) === schema.kind, 0x77c /* Narrowing must be done to a kind that exists in this context */);
+        (0, internal_1.assert)(this.context.schema.policy.fieldKinds.get(schema.kind.identifier) === schema.kind, 0x77c /* Narrowing must be done to a kind that exists in this context */);
         return this.schema.equals(schema);
     }
     isSameAs(other) {
-        (0, core_utils_1.assert)(other.context === this.context, 0x77d /* Content from different editable trees should not be used together */);
+        (0, internal_1.assert)(other.context === this.context, 0x77d /* Content from different flex trees should not be used together */);
         return this.key === other.key && this.parent === other.parent;
     }
     get parent() {
@@ -87,13 +87,14 @@ class LazyField extends lazyEntity_js_1.LazyEntity {
         cursor.enterField(this.key);
         return output;
     }
-    [lazyEntity_js_1.tryMoveCursorToAnchorSymbol](anchor, cursor) {
-        return this.context.forest.tryMoveCursorToField(anchor, cursor);
+    [lazyEntity_js_1.tryMoveCursorToAnchorSymbol](cursor) {
+        return this.context.forest.tryMoveCursorToField(this[lazyEntity_js_1.anchorSymbol], cursor);
     }
-    [lazyEntity_js_1.forgetAnchorSymbol](anchor) {
-        if (anchor.parent === undefined)
+    [lazyEntity_js_1.forgetAnchorSymbol]() {
+        this.offAfterDestroy?.();
+        if (this[lazyEntity_js_1.anchorSymbol].parent === undefined)
             return;
-        this.context.forest.anchors.forget(anchor.parent);
+        this.context.forest.anchors.forget(this[lazyEntity_js_1.anchorSymbol].parent);
     }
     get length() {
         return this[lazyEntity_js_1.cursorSymbol].getFieldLength();
@@ -132,7 +133,7 @@ class LazyField extends lazyEntity_js_1.LazyEntity {
         }
         const parentAnchorNode = this.context.forest.anchors.locate(parentAnchor);
         // As the "parentAnchor === undefined" case is handled above, parentAnchorNode should exist.
-        (0, core_utils_1.assert)(parentAnchorNode !== undefined, 0x77e /* parentAnchorNode must exist. */);
+        (0, internal_1.assert)(parentAnchorNode !== undefined, 0x77e /* parentAnchorNode must exist. */);
         return (0, utilities_js_1.treeStatusFromAnchorCache)(this.context.forest.anchors, parentAnchorNode);
     }
     getFieldPath() {
@@ -143,7 +144,7 @@ class LazyField extends lazyEntity_js_1.LazyEntity {
      * This path is not valid to hold onto across edits: this must be recalled for each edit.
      */
     getFieldPathForEditing() {
-        (0, core_utils_1.assert)(this.treeStatus() === flexTreeTypes_js_1.TreeStatus.InDocument, 0x77f /* Editing only allowed on fields with TreeStatus.InDocument status */);
+        (0, internal_1.assert)(this.treeStatus() === flexTreeTypes_js_1.TreeStatus.InDocument, 0x77f /* Editing only allowed on fields with TreeStatus.InDocument status */);
         return this.getFieldPath();
     }
 }
@@ -168,7 +169,7 @@ class LazySequence extends LazyField {
         return fieldEditor;
     }
     insertAt(index, value) {
-        (0, index_js_3.assertValidIndex)(index, this, true);
+        (0, index_js_2.assertValidIndex)(index, this, true);
         const content = (0, index_js_1.isCursor)(value)
             ? prepareFieldCursorForInsert(value)
             : (0, mapTreeCursor_js_1.cursorForMapTreeField)(Array.from(value, (item) => (0, contextuallyTyped_js_1.applyTypesFromContext)(this.context, this.schema.allowedTypeSet, item)));
@@ -190,7 +191,7 @@ class LazySequence extends LazyField {
         const { length } = this;
         const removeStart = start ?? 0;
         const removeEnd = Math.min(length, end ?? length);
-        (0, index_js_3.assertValidRangeIndices)(removeStart, removeEnd, this);
+        (0, index_js_2.assertValidRangeIndices)(removeStart, removeEnd, this);
         fieldEditor.remove(removeStart, removeEnd - removeStart);
     }
     moveToStart(sourceIndex, source) {
@@ -214,25 +215,40 @@ class LazySequence extends LazyField {
     _moveRangeToIndex(index, sourceStart, sourceEnd, source) {
         const sourceField = source !== undefined ? (this.isSameAs(source) ? this : source) : this;
         // TODO: determine support for move across different sequence types
-        (0, core_utils_1.assert)(sourceField instanceof LazySequence, 0x7b1 /* Unsupported sequence implementation. */);
-        (0, index_js_3.assertValidRangeIndices)(sourceStart, sourceEnd, sourceField);
+        (0, internal_1.assert)(sourceField instanceof LazySequence, 0x7b1 /* Unsupported sequence implementation. */);
+        (0, index_js_2.assertValidRangeIndices)(sourceStart, sourceEnd, sourceField);
         if (this.schema.types !== undefined && sourceField !== this) {
             for (let i = sourceStart; i < sourceEnd; i++) {
-                const sourceNode = sourceField.boxedAt(sourceStart) ?? (0, index_js_3.fail)("impossible out of bounds index");
+                const sourceNode = sourceField.boxedAt(sourceStart) ?? (0, index_js_2.fail)("impossible out of bounds index");
                 if (!this.schema.types.has(sourceNode.schema.name)) {
                     throw new Error("Type in source sequence is not allowed in destination.");
                 }
             }
         }
         const movedCount = sourceEnd - sourceStart;
-        (0, index_js_3.assertValidIndex)(index, this, true);
+        (0, index_js_2.assertValidIndex)(index, this, true);
         const sourceFieldPath = sourceField.getFieldPath();
         const destinationFieldPath = this.getFieldPath();
         this.context.editor.move(sourceFieldPath, sourceStart, movedCount, destinationFieldPath, index);
     }
 }
 exports.LazySequence = LazySequence;
-class LazyValueField extends LazyField {
+class ReadonlyLazyValueField extends LazyField {
+    constructor(context, schema, cursor, fieldAnchor) {
+        super(context, schema, cursor, fieldAnchor);
+    }
+    get content() {
+        return this.atIndex(0);
+    }
+    set content(newContent) {
+        (0, index_js_2.fail)("cannot set content in readonly field");
+    }
+    get boxedContent() {
+        return this.boxedAt(0) ?? (0, index_js_2.fail)("value node must have 1 item");
+    }
+}
+exports.ReadonlyLazyValueField = ReadonlyLazyValueField;
+class LazyValueField extends ReadonlyLazyValueField {
     constructor(context, schema, cursor, fieldAnchor) {
         super(context, schema, cursor, fieldAnchor);
     }
@@ -249,14 +265,20 @@ class LazyValueField extends LazyField {
             ? prepareNodeCursorForInsert(newContent)
             : [(0, contextuallyTyped_js_1.cursorFromContextualData)(this.context, this.schema.allowedTypeSet, newContent)];
         const fieldEditor = this.valueFieldEditor();
-        (0, core_utils_1.assert)(content.length === 1, 0x780 /* value field content should normalize to one item */);
+        (0, internal_1.assert)(content.length === 1, 0x780 /* value field content should normalize to one item */);
         fieldEditor.set(content[0]);
     }
     get boxedContent() {
-        return this.boxedAt(0) ?? (0, index_js_3.fail)("value node must have 1 item");
+        return this.boxedAt(0) ?? (0, index_js_2.fail)("value node must have 1 item");
     }
 }
 exports.LazyValueField = LazyValueField;
+class LazyIdentifierField extends ReadonlyLazyValueField {
+    constructor(context, schema, cursor, fieldAnchor) {
+        super(context, schema, cursor, fieldAnchor);
+    }
+}
+exports.LazyIdentifierField = LazyIdentifierField;
 class LazyOptionalField extends LazyField {
     constructor(context, schema, cursor, fieldAnchor) {
         super(context, schema, cursor, fieldAnchor);
@@ -276,7 +298,7 @@ class LazyOptionalField extends LazyField {
                 ? prepareNodeCursorForInsert(newContent)
                 : [(0, contextuallyTyped_js_1.cursorFromContextualData)(this.context, this.schema.allowedTypeSet, newContent)];
         const fieldEditor = this.optionalEditor();
-        (0, core_utils_1.assert)(content.length <= 1, 0x781 /* optional field content should normalize at most one item */);
+        (0, internal_1.assert)(content.length <= 1, 0x781 /* optional field content should normalize at most one item */);
         fieldEditor.set(content.length === 0 ? undefined : content[0], this.length === 0);
     }
     get boxedContent() {
@@ -296,11 +318,11 @@ class LazyNodeKeyField extends LazyField {
     get stableNodeKey() {
         const cursor = this[lazyEntity_js_1.cursorSymbol];
         cursor.enterNode(0);
-        (0, core_utils_1.assert)(cursor.type === index_js_4.nodeKeyTreeIdentifier, 0x7b2 /* invalid node key type */);
+        (0, internal_1.assert)(cursor.type === index_js_4.nodeKeyTreeIdentifier, 0x7b2 /* invalid node key type */);
         const stableKey = cursor.value;
-        (0, core_utils_1.assert)(typeof stableKey === "string", 0x7b3 /* invalid node key type */);
+        (0, internal_1.assert)(typeof stableKey === "string", 0x7b3 /* invalid node key type */);
         cursor.exitNode();
-        return (0, index_js_3.brand)(stableKey);
+        return (0, index_js_2.brand)(stableKey);
     }
 }
 exports.LazyNodeKeyField = LazyNodeKeyField;
@@ -308,11 +330,12 @@ class LazyForbiddenField extends LazyField {
 }
 exports.LazyForbiddenField = LazyForbiddenField;
 const builderList = [
-    [index_js_2.FieldKinds.forbidden, LazyForbiddenField],
-    [index_js_2.FieldKinds.nodeKey, LazyNodeKeyField],
-    [index_js_2.FieldKinds.optional, LazyOptionalField],
-    [index_js_2.FieldKinds.sequence, LazySequence],
-    [index_js_2.FieldKinds.required, LazyValueField],
+    [index_js_3.FieldKinds.forbidden, LazyForbiddenField],
+    [index_js_3.FieldKinds.nodeKey, LazyNodeKeyField],
+    [index_js_3.FieldKinds.optional, LazyOptionalField],
+    [index_js_3.FieldKinds.sequence, LazySequence],
+    [index_js_3.FieldKinds.required, LazyValueField],
+    [index_js_3.FieldKinds.identifier, LazyIdentifierField],
 ];
 const kindToClass = new Map(builderList);
 /**
@@ -320,7 +343,7 @@ const kindToClass = new Map(builderList);
  */
 function prepareFieldCursorForInsert(cursor) {
     // TODO: optionally validate content against schema.
-    (0, core_utils_1.assert)(cursor.mode === 1 /* CursorLocationType.Fields */, 0x8cb /* should be in fields mode */);
+    (0, internal_1.assert)(cursor.mode === 1 /* CursorLocationType.Fields */, 0x8cb /* should be in fields mode */);
     return cursor;
 }
 /**
@@ -328,7 +351,7 @@ function prepareFieldCursorForInsert(cursor) {
  */
 function prepareNodeCursorForInsert(cursor) {
     // TODO: optionally validate content against schema.
-    (0, core_utils_1.assert)(cursor.mode === 0 /* CursorLocationType.Nodes */, 0x805 /* should be in nodes mode */);
+    (0, internal_1.assert)(cursor.mode === 0 /* CursorLocationType.Nodes */, 0x805 /* should be in nodes mode */);
     return [cursor];
 }
 //# sourceMappingURL=lazyField.js.map

package/dist/feature-libraries/flex-tree/lazyField.js.map

@@ -1 +1 @@
-{"version":3,"file":"lazyField.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyField.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AAEpD,kDAY6B;AAE7B,4CAA4C;AAC5C,kEAA0F;AAC1F,yDAKoC;AACpC,kDAM6B;AAE7B,mDAA0F;AAC1F,0DAA4D;AAE5D,yDAe4B;AAC5B,+CAAyC;AACzC,mDAOyB;AACzB,6CAA4C;AAC5C,iDAAwF;AAExF;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,KAAa,EAAE,MAAc;IAChD,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,KAAK,CAAC,UAAU,CAAC,EAAE;QACtB,UAAU,GAAG,CAAC,CAAC;KACf;IACD,IAAI,UAAU,GAAG,CAAC,MAAM,IAAI,UAAU,IAAI,MAAM,EAAE;QACjD,OAAO,SAAS,CAAC;KACjB;IACD,IAAI,UAAU,GAAG,CAAC,EAAE;QACnB,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;KACjC;IACD,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,SAAgB,SAAS,CACxB,OAAgB,EAChB,MAAuB,EACvB,MAA+B;IAE/B,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;IAE9C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAA,eAAI,EAAC,8BAA8B,CAAC,CAAC,CACvF,OAAO,EACP,MAAM,EACN,MAAM,EACN,WAAW,CACX,CAAC;IAEF,sDAAsD;IACtD,8GAA8G;IAC9G,IAAI,WAAW,CAAC,MAAM,KAAK,SAAS,EAAE;QACrC,MAAM,UAAU,GACf,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;YACjD,IAAA,eAAI,EAAC,oEAAoE,CAAC,CAAC;QAC5E,UAAU,CAAC,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;YAClC,KAAK,CAAC,wBAAa,CAAC,EAAE,CAAC;QACxB,CAAC,CAAC,CAAC;KACH;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAzBD,8BAyBC;AAED;;;GAGG;AACH,MAAsB,SACrB,SAAQ,0BAAuD;IAG/D,IAAW,CAAC,iCAAc,CAAC;QAC1B,OAAO,qCAAkB,CAAC,KAAK,CAAC;IACjC,CAAC;IAGD,YACC,OAAgB,EAChB,MAAsC,EACtC,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAC5C,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACtF,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;IACjC,CAAC;IAEM,EAAE,CACR,MAAe;QAEf,IAAA,mBAAM,EACL,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,MAAM,CAAC,IAAI,EACjF,KAAK,CAAC,kEAAkE,CACxE,CAAC;QAEF,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAEM,QAAQ,CAAC,KAAoB;QACnC,IAAA,mBAAM,EACL,KAAK,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAC9B,KAAK,CAAC,uEAAuE,CAC7E,CAAC;QACF,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;IAC/D,CAAC;IAED,IAAW,MAAM;QAChB,IAAI,IAAI,CAAC,4BAAY,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE;YAC5C,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,4BAAY,CAAC,CAAC;QAClC,MAAM,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,IAAA,sBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IACf,CAAC;IAEkB,CAAC,2CAA2B,CAAC,CAC/C,MAAmB,EACnB,MAA+B;QAE/B,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IAEkB,CAAC,kCAAkB,CAAC,CAAC,MAAmB;QAC1D,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO;QACxC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IAED,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,4BAAY,CAAC,CAAC,cAAc,EAAE,CAAC;IAC5C,CAAC;IAEM,OAAO,CAAC,KAAa;QAC3B,OAAO,IAAA,uBAAY,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,EAAE,CACzD,IAAA,yBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IAEM,OAAO,CAAC,KAAa;QAC3B,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAA,uBAAY,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC9D,IAAA,sBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CACe,CAAC;IAChD,CAAC;IAEM,GAAG,CAAI,UAAuE;QACpF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;IAEM,QAAQ,CACd,UAAuE;QAEvE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,UAAU,CAAC,CAAC;IACrD,CAAC;IAEM,aAAa;QACnB,OAAO,IAAA,6BAAkB,EACxB,IAAI,CAAC,4BAAY,CAAC,EAClB,CAAC,MAAM,EAAE,EAAE,CAAC,IAAA,sBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAA8C,CACvF,CAAC;IACH,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAA,6BAAkB,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CACxD,IAAA,yBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IAEM,UAAU;QAChB,IAAI,IAAI,CAAC,6BAAa,CAAC,EAAE,EAAE;YAC1B,OAAO,6BAAU,CAAC,OAAO,CAAC;SAC1B;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,4BAAY,CAAC,CAAC;QACvC,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC;QACxC,2DAA2D;QAC3D,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,IAAA,0CAA2B,EAAC,IAAA,6BAAkB,EAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;SAC7E;QACD,MAAM,gBAAgB,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE1E,4FAA4F;QAC5F,IAAA,mBAAM,EAAC,gBAAgB,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACjF,OAAO,IAAA,wCAAyB,EAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;IACjF,CAAC;IAEM,YAAY;QAClB,OAAO,IAAI,CAAC,4BAAY,CAAC,CAAC,YAAY,EAAE,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACI,sBAAsB;QAC5B,IAAA,mBAAM,EACL,IAAI,CAAC,UAAU,EAAE,KAAK,6BAAU,CAAC,UAAU,EAC3C,KAAK,CAAC,sEAAsE,CAC5E,CAAC;QACF,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC;IAC5B,CAAC;CACD;AA5ID,8BA4IC;AAED,MAAa,YACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAEM,EAAE,CAAC,KAAa;QACtB,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAA,uBAAY,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC9D,IAAA,yBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IACD,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAEO,cAAc;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,WAAW,CAAC;IACpB,CAAC;IAEM,QAAQ,CAAC,KAAa,EAAE,KAAsC;QACpE,IAAA,2BAAgB,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,OAAO,GAA2B,IAAA,mBAAQ,EAAC,KAAK,CAAC;YACtD,CAAC,CAAC,2BAA2B,CAAC,KAAK,CAAC;YACpC,CAAC,CAAC,IAAA,wCAAqB,EACrB,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAC1B,IAAA,4CAAqB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,CACrE,CACA,CAAC;QAEL,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,aAAa,CAAC,KAAsC;QAC1D,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;IAEM,WAAW,CAAC,KAAsC;QACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAEM,QAAQ,CAAC,KAAa;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAEM,WAAW,CAAC,KAAc,EAAE,GAAY;QAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QACxB,MAAM,WAAW,GAAG,KAAK,IAAI,CAAC,CAAC;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,CAAC;QAClD,IAAA,kCAAuB,EAAC,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACtD,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,GAAG,WAAW,CAAC,CAAC;IAC1D,CAAC;IAIM,WAAW,CACjB,WAAmB,EACnB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IAGM,SAAS,CAAC,WAAmB,EAAE,MAAgD;QACrF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3E,CAAC;IAOM,WAAW,CACjB,KAAa,EACb,WAAmB,EACnB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC;IAQM,gBAAgB,CACtB,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IAQM,cAAc,CACpB,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC;IASM,gBAAgB,CACtB,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IAC/D,CAAC;IAEO,iBAAiB,CACxB,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,MAAM,WAAW,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE1F,mEAAmE;QACnE,IAAA,mBAAM,EACL,WAAW,YAAY,YAAY,EACnC,KAAK,CAAC,0CAA0C,CAChD,CAAC;QACF,IAAA,kCAAuB,EAAC,WAAW,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,WAAW,KAAK,IAAI,EAAE;YAC5D,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;gBAC7C,MAAM,UAAU,GACf,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,IAAA,eAAI,EAAC,gCAAgC,CAAC,CAAC;gBAC5E,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;oBACnD,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;iBAC1E;aACD;SACD;QACD,MAAM,UAAU,GAAG,SAAS,GAAG,WAAW,CAAC;QAC3C,IAAA,2BAAgB,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,eAAe,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;QACnD,MAAM,oBAAoB,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACjD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CACvB,eAAe,EACf,WAAW,EACX,UAAU,EACV,oBAAoB,EACpB,KAAK,CACL,CAAC;IACH,CAAC;CACD;AAhLD,oCAgLC;AAED,MAAa,cACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAEO,gBAAgB;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC9D,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,IAAW,OAAO,CAAC,UAAuC;QACzD,MAAM,OAAO,GAA6B,IAAA,mBAAQ,EAAC,UAAU,CAAC;YAC7D,CAAC,CAAC,0BAA0B,CAAC,UAAU,CAAC;YACxC,CAAC,CAAC,CAAC,IAAA,+CAAwB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC5C,IAAA,mBAAM,EAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC3F,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAA,eAAI,EAAC,6BAA6B,CAAC,CAAC;IAC/D,CAAC;CACD;AAnCD,wCAmCC;AAED,MAAa,iBACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAEO,cAAc;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,IAAW,OAAO,CAAC,UAAmD;QACrE,MAAM,OAAO,GACZ,UAAU,KAAK,SAAS;YACvB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,IAAA,mBAAQ,EAAC,UAAU,CAAC;gBACtB,CAAC,CAAC,0BAA0B,CAAC,UAAU,CAAC;gBACxC,CAAC,CAAC,CAAC,IAAA,+CAAwB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC;QACrF,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,IAAA,mBAAM,EACL,OAAO,CAAC,MAAM,IAAI,CAAC,EACnB,KAAK,CAAC,8DAA8D,CACpE,CAAC;QACF,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IACnF,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;CACD;AAzCD,8CAyCC;AAED,MAAa,gBACZ,SAAQ,SAA4C;IAGpD,YACC,OAAgB,EAChB,MAA0D,EAC1D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAED,IAAW,YAAY;QACtB,mFAAmF;QACnF,uEAAuE;QACvE,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC3D,CAAC;IAED,IAAW,aAAa;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,4BAAY,CAAC,CAAC;QAClC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,KAAK,gCAAqB,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACjF,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC;QAC/B,IAAA,mBAAM,EAAC,OAAO,SAAS,KAAK,QAAQ,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACzE,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClB,OAAO,IAAA,gBAAK,EAAC,SAAqB,CAAC,CAAC;IACrC,CAAC;CACD;AA5BD,4CA4BC;AAED,MAAa,kBAAoD,SAAQ,SAGxE;CAAG;AAHJ,gDAGI;AASJ,MAAM,WAAW,GAA+B;IAC/C,CAAC,qBAAU,CAAC,SAAS,EAAE,kBAAkB,CAAC;IAC1C,CAAC,qBAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC;IACtC,CAAC,qBAAU,CAAC,QAAQ,EAAE,iBAAiB,CAAC;IACxC,CAAC,qBAAU,CAAC,QAAQ,EAAE,YAAY,CAAC;IACnC,CAAC,qBAAU,CAAC,QAAQ,EAAE,cAAc,CAAC;CACrC,CAAC;AAEF,MAAM,WAAW,GAAwC,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;AAE9E;;GAEG;AACH,SAAS,2BAA2B,CAAC,MAA8B;IAClE,oDAAoD;IAEpD,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACxF,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,0BAA0B,CAAC,MAA8B;IACjE,oDAAoD;IAEpD,IAAA,mBAAM,EAAC,MAAM,CAAC,IAAI,qCAA6B,EAAE,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACtF,OAAO,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils\";\nimport { StableId } from \"@fluidframework/id-compressor\";\nimport {\n\tFieldKey,\n\tTreeNavigationResult,\n\tITreeSubscriptionCursor,\n\tCursorLocationType,\n\tFieldAnchor,\n\tinCursorNode,\n\tFieldUpPath,\n\tkeyAsDetachedField,\n\titerateCursorField,\n\tisCursor,\n\tITreeCursorSynchronous,\n} from \"../../core/index.js\";\nimport { FlexFieldKind } from \"../modular-schema/index.js\";\n// TODO: stop depending on contextuallyTyped\nimport { applyTypesFromContext, cursorFromContextualData } from \"../contextuallyTyped.js\";\nimport {\n\tFieldKinds,\n\tOptionalFieldEditBuilder,\n\tSequenceFieldEditBuilder,\n\tValueFieldEditBuilder,\n} from \"../default-schema/index.js\";\nimport {\n\tassertValidIndex,\n\tassertValidRangeIndices,\n\tbrand,\n\tdisposeSymbol,\n\tfail,\n} from \"../../util/index.js\";\nimport { FlexAllowedTypes, FlexFieldSchema } from \"../typed-schema/index.js\";\nimport { LocalNodeKey, StableNodeKey, nodeKeyTreeIdentifier } from \"../node-key/index.js\";\nimport { cursorForMapTreeField } from \"../mapTreeCursor.js\";\nimport { Context } from \"./context.js\";\nimport {\n\tFlexibleNodeContent,\n\tFlexTreeOptionalField,\n\tFlexTreeSequenceField,\n\tFlexTreeTypedField,\n\tFlexTreeTypedNodeUnion,\n\tFlexTreeUnboxNodeUnion,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeRequiredField,\n\tTreeStatus,\n\tFlexTreeNodeKeyField,\n\tFlexibleNodeSubSequence,\n\tFlexTreeEntityKind,\n\tflexTreeMarker,\n} from \"./flexTreeTypes.js\";\nimport { makeTree } from \"./lazyNode.js\";\nimport {\n\tLazyEntity,\n\tanchorSymbol,\n\tcursorSymbol,\n\tforgetAnchorSymbol,\n\tisFreedSymbol,\n\ttryMoveCursorToAnchorSymbol,\n} from \"./lazyEntity.js\";\nimport { unboxedUnion } from \"./unboxed.js\";\nimport { treeStatusFromAnchorCache, treeStatusFromDetachedField } from \"./utilities.js\";\n\n/**\n * Indexing for {@link LazyField.at} and {@link LazyField.boxedAt} supports the\n * usage of negative indices, which regular indexing using `[` and `]` does not.\n *\n * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at\n * for additional context on the semantics.\n *\n * @returns A positive index that can be used in regular indexing. Returns\n * undefined if that index would be out-of-bounds.\n */\nfunction indexForAt(index: number, length: number): number | undefined {\n\tlet finalIndex = Math.trunc(+index);\n\tif (isNaN(finalIndex)) {\n\t\tfinalIndex = 0;\n\t}\n\tif (finalIndex < -length || finalIndex >= length) {\n\t\treturn undefined;\n\t}\n\tif (finalIndex < 0) {\n\t\tfinalIndex = finalIndex + length;\n\t}\n\treturn finalIndex;\n}\n\nexport function makeField(\n\tcontext: Context,\n\tschema: FlexFieldSchema,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeField {\n\tconst fieldAnchor = cursor.buildFieldAnchor();\n\n\tconst field = new (kindToClass.get(schema.kind) ?? fail(\"missing field implementation\"))(\n\t\tcontext,\n\t\tschema,\n\t\tcursor,\n\t\tfieldAnchor,\n\t);\n\n\t// Fields currently live as long as their parent does.\n\t// For root fields, this means forever, but other cases can be cleaned up when their parent anchor is deleted.\n\tif (fieldAnchor.parent !== undefined) {\n\t\tconst anchorNode =\n\t\t\tcontext.forest.anchors.locate(fieldAnchor.parent) ??\n\t\t\tfail(\"parent anchor node should always exist since field is under a node\");\n\t\tanchorNode.on(\"afterDestroy\", () => {\n\t\t\tfield[disposeSymbol]();\n\t\t});\n\t}\n\treturn field;\n}\n\n/**\n * A Proxy target, which together with a `fieldProxyHandler` implements a basic access to\n * the nodes of {@link EditableField} by means of the cursors.\n */\nexport abstract class LazyField<TKind extends FlexFieldKind, TTypes extends FlexAllowedTypes>\n\textends LazyEntity<FlexFieldSchema<TKind, TTypes>, FieldAnchor>\n\timplements FlexTreeField\n{\n\tpublic get [flexTreeMarker](): FlexTreeEntityKind.Field {\n\t\treturn FlexTreeEntityKind.Field;\n\t}\n\tpublic readonly key: FieldKey;\n\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<TKind, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t\tassert(cursor.mode === CursorLocationType.Fields, 0x77b /* must be in fields mode */);\n\t\tthis.key = cursor.getFieldKey();\n\t}\n\n\tpublic is<TSchema extends FlexFieldSchema>(\n\t\tschema: TSchema,\n\t): this is FlexTreeTypedField<TSchema> {\n\t\tassert(\n\t\t\tthis.context.schema.policy.fieldKinds.get(schema.kind.identifier) === schema.kind,\n\t\t\t0x77c /* Narrowing must be done to a kind that exists in this context */,\n\t\t);\n\n\t\treturn this.schema.equals(schema);\n\t}\n\n\tpublic isSameAs(other: FlexTreeField): boolean {\n\t\tassert(\n\t\t\tother.context === this.context,\n\t\t\t0x77d /* Content from different editable trees should not be used together */,\n\t\t);\n\t\treturn this.key === other.key && this.parent === other.parent;\n\t}\n\n\tpublic get parent(): FlexTreeNode | undefined {\n\t\tif (this[anchorSymbol].parent === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst cursor = this[cursorSymbol];\n\t\tcursor.exitField();\n\t\tconst output = makeTree(this.context, cursor);\n\t\tcursor.enterField(this.key);\n\t\treturn output;\n\t}\n\n\tprotected override [tryMoveCursorToAnchorSymbol](\n\t\tanchor: FieldAnchor,\n\t\tcursor: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\treturn this.context.forest.tryMoveCursorToField(anchor, cursor);\n\t}\n\n\tprotected override [forgetAnchorSymbol](anchor: FieldAnchor): void {\n\t\tif (anchor.parent === undefined) return;\n\t\tthis.context.forest.anchors.forget(anchor.parent);\n\t}\n\n\tpublic get length(): number {\n\t\treturn this[cursorSymbol].getFieldLength();\n\t}\n\n\tpublic atIndex(index: number): FlexTreeUnboxNodeUnion<TTypes> {\n\t\treturn inCursorNode(this[cursorSymbol], index, (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\n\tpublic boxedAt(index: number): FlexTreeTypedNodeUnion<TTypes> | undefined {\n\t\tconst finalIndex = indexForAt(index, this.length);\n\n\t\tif (finalIndex === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn inCursorNode(this[cursorSymbol], finalIndex, (cursor) =>\n\t\t\tmakeTree(this.context, cursor),\n\t\t) as unknown as FlexTreeTypedNodeUnion<TTypes>;\n\t}\n\n\tpublic map<U>(callbackfn: (value: FlexTreeUnboxNodeUnion<TTypes>, index: number) => U): U[] {\n\t\treturn Array.from(this, callbackfn);\n\t}\n\n\tpublic mapBoxed<U>(\n\t\tcallbackfn: (value: FlexTreeTypedNodeUnion<TTypes>, index: number) => U,\n\t): U[] {\n\t\treturn Array.from(this.boxedIterator(), callbackfn);\n\t}\n\n\tpublic boxedIterator(): IterableIterator<FlexTreeTypedNodeUnion<TTypes>> {\n\t\treturn iterateCursorField(\n\t\t\tthis[cursorSymbol],\n\t\t\t(cursor) => makeTree(this.context, cursor) as unknown as FlexTreeTypedNodeUnion<TTypes>,\n\t\t);\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<FlexTreeUnboxNodeUnion<TTypes>> {\n\t\treturn iterateCursorField(this[cursorSymbol], (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\n\tpublic treeStatus(): TreeStatus {\n\t\tif (this[isFreedSymbol]()) {\n\t\t\treturn TreeStatus.Deleted;\n\t\t}\n\t\tconst fieldAnchor = this[anchorSymbol];\n\t\tconst parentAnchor = fieldAnchor.parent;\n\t\t// If the parentAnchor is undefined it is a detached field.\n\t\tif (parentAnchor === undefined) {\n\t\t\treturn treeStatusFromDetachedField(keyAsDetachedField(fieldAnchor.fieldKey));\n\t\t}\n\t\tconst parentAnchorNode = this.context.forest.anchors.locate(parentAnchor);\n\n\t\t// As the \"parentAnchor === undefined\" case is handled above, parentAnchorNode should exist.\n\t\tassert(parentAnchorNode !== undefined, 0x77e /* parentAnchorNode must exist. */);\n\t\treturn treeStatusFromAnchorCache(this.context.forest.anchors, parentAnchorNode);\n\t}\n\n\tpublic getFieldPath(): FieldUpPath {\n\t\treturn this[cursorSymbol].getFieldPath();\n\t}\n\n\t/**\n\t * Returns the path to this field to use for editing. Throws iff this path is not {@link TreeStatus#InDocument}.\n\t * This path is not valid to hold onto across edits: this must be recalled for each edit.\n\t */\n\tpublic getFieldPathForEditing(): FieldUpPath {\n\t\tassert(\n\t\t\tthis.treeStatus() === TreeStatus.InDocument,\n\t\t\t0x77f /* Editing only allowed on fields with TreeStatus.InDocument status */,\n\t\t);\n\t\treturn this.getFieldPath();\n\t}\n}\n\nexport class LazySequence<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.sequence, TTypes>\n\timplements FlexTreeSequenceField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.sequence, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tpublic at(index: number): FlexTreeUnboxNodeUnion<TTypes> | undefined {\n\t\tconst finalIndex = indexForAt(index, this.length);\n\n\t\tif (finalIndex === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn inCursorNode(this[cursorSymbol], finalIndex, (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\tpublic get asArray(): readonly FlexTreeUnboxNodeUnion<TTypes>[] {\n\t\treturn this.map((x) => x);\n\t}\n\n\tprivate sequenceEditor(): SequenceFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.sequenceField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic insertAt(index: number, value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tassertValidIndex(index, this, true);\n\t\tconst content: ITreeCursorSynchronous = isCursor(value)\n\t\t\t? prepareFieldCursorForInsert(value)\n\t\t\t: cursorForMapTreeField(\n\t\t\t\t\tArray.from(value, (item) =>\n\t\t\t\t\t\tapplyTypesFromContext(this.context, this.schema.allowedTypeSet, item),\n\t\t\t\t\t),\n\t\t\t  );\n\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tfieldEditor.insert(index, content);\n\t}\n\n\tpublic insertAtStart(value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tthis.insertAt(0, value);\n\t}\n\n\tpublic insertAtEnd(value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tthis.insertAt(this.length, value);\n\t}\n\n\tpublic removeAt(index: number): void {\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tfieldEditor.remove(index, 1);\n\t}\n\n\tpublic removeRange(start?: number, end?: number): void {\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tconst { length } = this;\n\t\tconst removeStart = start ?? 0;\n\t\tconst removeEnd = Math.min(length, end ?? length);\n\t\tassertValidRangeIndices(removeStart, removeEnd, this);\n\t\tfieldEditor.remove(removeStart, removeEnd - removeStart);\n\t}\n\n\tpublic moveToStart(sourceIndex: number): void;\n\tpublic moveToStart(sourceIndex: number, source: FlexTreeSequenceField<FlexAllowedTypes>): void;\n\tpublic moveToStart(\n\t\tsourceIndex: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(0, sourceIndex, sourceIndex + 1, source);\n\t}\n\tpublic moveToEnd(sourceIndex: number): void;\n\tpublic moveToEnd(sourceIndex: number, source: FlexTreeSequenceField<FlexAllowedTypes>): void;\n\tpublic moveToEnd(sourceIndex: number, source?: FlexTreeSequenceField<FlexAllowedTypes>): void {\n\t\tthis._moveRangeToIndex(this.length, sourceIndex, sourceIndex + 1, source);\n\t}\n\tpublic moveToIndex(index: number, sourceIndex: number): void;\n\tpublic moveToIndex(\n\t\tindex: number,\n\t\tsourceIndex: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveToIndex(\n\t\tindex: number,\n\t\tsourceIndex: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(index, sourceIndex, sourceIndex + 1, source);\n\t}\n\n\tpublic moveRangeToStart(sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToStart(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveRangeToStart(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(0, sourceStart, sourceEnd, source);\n\t}\n\n\tpublic moveRangeToEnd(sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToEnd(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveRangeToEnd(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(this.length, sourceStart, sourceEnd, source);\n\t}\n\n\tpublic moveRangeToIndex(index: number, sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(index, sourceStart, sourceEnd, source);\n\t}\n\n\tprivate _moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tconst sourceField = source !== undefined ? (this.isSameAs(source) ? this : source) : this;\n\n\t\t// TODO: determine support for move across different sequence types\n\t\tassert(\n\t\t\tsourceField instanceof LazySequence,\n\t\t\t0x7b1 /* Unsupported sequence implementation. */,\n\t\t);\n\t\tassertValidRangeIndices(sourceStart, sourceEnd, sourceField);\n\t\tif (this.schema.types !== undefined && sourceField !== this) {\n\t\t\tfor (let i = sourceStart; i < sourceEnd; i++) {\n\t\t\t\tconst sourceNode =\n\t\t\t\t\tsourceField.boxedAt(sourceStart) ?? fail(\"impossible out of bounds index\");\n\t\t\t\tif (!this.schema.types.has(sourceNode.schema.name)) {\n\t\t\t\t\tthrow new Error(\"Type in source sequence is not allowed in destination.\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst movedCount = sourceEnd - sourceStart;\n\t\tassertValidIndex(index, this, true);\n\t\tconst sourceFieldPath = sourceField.getFieldPath();\n\t\tconst destinationFieldPath = this.getFieldPath();\n\t\tthis.context.editor.move(\n\t\t\tsourceFieldPath,\n\t\t\tsourceStart,\n\t\t\tmovedCount,\n\t\t\tdestinationFieldPath,\n\t\t\tindex,\n\t\t);\n\t}\n}\n\nexport class LazyValueField<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.required, TTypes>\n\timplements FlexTreeRequiredField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.required, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tprivate valueFieldEditor(): ValueFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.valueField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic get content(): FlexTreeUnboxNodeUnion<TTypes> {\n\t\treturn this.atIndex(0);\n\t}\n\n\tpublic set content(newContent: FlexibleNodeContent<TTypes>) {\n\t\tconst content: ITreeCursorSynchronous[] = isCursor(newContent)\n\t\t\t? prepareNodeCursorForInsert(newContent)\n\t\t\t: [cursorFromContextualData(this.context, this.schema.allowedTypeSet, newContent)];\n\t\tconst fieldEditor = this.valueFieldEditor();\n\t\tassert(content.length === 1, 0x780 /* value field content should normalize to one item */);\n\t\tfieldEditor.set(content[0]);\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedNodeUnion<TTypes> {\n\t\treturn this.boxedAt(0) ?? fail(\"value node must have 1 item\");\n\t}\n}\n\nexport class LazyOptionalField<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.optional, TTypes>\n\timplements FlexTreeOptionalField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.optional, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tprivate optionalEditor(): OptionalFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.optionalField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic get content(): FlexTreeUnboxNodeUnion<TTypes> | undefined {\n\t\treturn this.length === 0 ? undefined : this.atIndex(0);\n\t}\n\n\tpublic set content(newContent: FlexibleNodeContent<TTypes> | undefined) {\n\t\tconst content: ITreeCursorSynchronous[] =\n\t\t\tnewContent === undefined\n\t\t\t\t? []\n\t\t\t\t: isCursor(newContent)\n\t\t\t\t? prepareNodeCursorForInsert(newContent)\n\t\t\t\t: [cursorFromContextualData(this.context, this.schema.allowedTypeSet, newContent)];\n\t\tconst fieldEditor = this.optionalEditor();\n\t\tassert(\n\t\t\tcontent.length <= 1,\n\t\t\t0x781 /* optional field content should normalize at most one item */,\n\t\t);\n\t\tfieldEditor.set(content.length === 0 ? undefined : content[0], this.length === 0);\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedNodeUnion<TTypes> | undefined {\n\t\treturn this.length === 0 ? undefined : this.boxedAt(0);\n\t}\n}\n\nexport class LazyNodeKeyField<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.nodeKey, TTypes>\n\timplements FlexTreeNodeKeyField\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.nodeKey, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tpublic get localNodeKey(): LocalNodeKey {\n\t\t// TODO: Optimize this to be a fast path that gets a LocalNodeKey directly from the\n\t\t// forest rather than getting the StableNodeKey and the compressing it.\n\t\treturn this.context.nodeKeys.localize(this.stableNodeKey);\n\t}\n\n\tpublic get stableNodeKey(): StableNodeKey {\n\t\tconst cursor = this[cursorSymbol];\n\t\tcursor.enterNode(0);\n\t\tassert(cursor.type === nodeKeyTreeIdentifier, 0x7b2 /* invalid node key type */);\n\t\tconst stableKey = cursor.value;\n\t\tassert(typeof stableKey === \"string\", 0x7b3 /* invalid node key type */);\n\t\tcursor.exitNode();\n\t\treturn brand(stableKey as StableId);\n\t}\n}\n\nexport class LazyForbiddenField<TTypes extends FlexAllowedTypes> extends LazyField<\n\ttypeof FieldKinds.forbidden,\n\tTTypes\n> {}\n\ntype Builder = new <TTypes extends FlexAllowedTypes>(\n\tcontext: Context,\n\tschema: FlexFieldSchema<any, TTypes>,\n\tcursor: ITreeSubscriptionCursor,\n\tfieldAnchor: FieldAnchor,\n) => LazyField<any, TTypes>;\n\nconst builderList: [FlexFieldKind, Builder][] = [\n\t[FieldKinds.forbidden, LazyForbiddenField],\n\t[FieldKinds.nodeKey, LazyNodeKeyField],\n\t[FieldKinds.optional, LazyOptionalField],\n\t[FieldKinds.sequence, LazySequence],\n\t[FieldKinds.required, LazyValueField],\n];\n\nconst kindToClass: ReadonlyMap<FlexFieldKind, Builder> = new Map(builderList);\n\n/**\n * Prepare a fields cursor (holding a sequence of nodes) for inserting.\n */\nfunction prepareFieldCursorForInsert(cursor: ITreeCursorSynchronous): ITreeCursorSynchronous {\n\t// TODO: optionally validate content against schema.\n\n\tassert(cursor.mode === CursorLocationType.Fields, 0x8cb /* should be in fields mode */);\n\treturn cursor;\n}\n\n/**\n * Prepare a node cursor (holding a single node) for inserting.\n */\nfunction prepareNodeCursorForInsert(cursor: ITreeCursorSynchronous): ITreeCursorSynchronous[] {\n\t// TODO: optionally validate content against schema.\n\n\tassert(cursor.mode === CursorLocationType.Nodes, 0x805 /* should be in nodes mode */);\n\treturn [cursor];\n}\n"]}
+{"version":3,"file":"lazyField.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/lazyField.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAG7D,kDAY6B;AAC7B,kDAM6B;AAC7B,4CAA4C;AAC5C,kEAA0F;AAC1F,yDAKoC;AACpC,0DAA4D;AAE5D,mDAA0F;AAI1F,yDAe4B;AAC5B,mDAOyB;AACzB,+CAAyC;AACzC,6CAA4C;AAC5C,iDAAwF;AAExF;;;;;;;;;GASG;AACH,SAAS,UAAU,CAAC,KAAa,EAAE,MAAc;IAChD,IAAI,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;IACpC,IAAI,KAAK,CAAC,UAAU,CAAC,EAAE;QACtB,UAAU,GAAG,CAAC,CAAC;KACf;IACD,IAAI,UAAU,GAAG,CAAC,MAAM,IAAI,UAAU,IAAI,MAAM,EAAE;QACjD,OAAO,SAAS,CAAC;KACjB;IACD,IAAI,UAAU,GAAG,CAAC,EAAE;QACnB,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;KACjC;IACD,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,SAAgB,SAAS,CACxB,OAAgB,EAChB,MAAuB,EACvB,MAA+B;IAE/B,MAAM,WAAW,GAAG,MAAM,CAAC,gBAAgB,EAAE,CAAC;IAE9C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,IAAA,eAAI,EAAC,8BAA8B,CAAC,CAAC,CACvF,OAAO,EACP,MAAM,EACN,MAAM,EACN,WAAW,CACX,CAAC;IACF,OAAO,KAAK,CAAC;AACd,CAAC;AAdD,8BAcC;AAED;;;GAGG;AACH,MAAsB,SACrB,SAAQ,0BAAuD;IAG/D,IAAW,CAAC,iCAAc,CAAC;QAC1B,OAAO,qCAAkB,CAAC,KAAK,CAAC;IACjC,CAAC;IASD,YACC,OAAgB,EAChB,MAAsC,EACtC,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;QAC5C,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,4BAA4B,CAAC,CAAC;QACtF,IAAI,CAAC,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QAChC,sDAAsD;QACtD,8GAA8G;QAC9G,IAAI,WAAW,CAAC,MAAM,KAAK,SAAS,EAAE;YACrC,MAAM,UAAU,GACf,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC;gBACjD,IAAA,eAAI,EAAC,oEAAoE,CAAC,CAAC;YAC5E,IAAI,CAAC,eAAe,GAAG,UAAU,CAAC,EAAE,CAAC,cAAc,EAAE,GAAG,EAAE;gBACzD,IAAI,CAAC,wBAAa,CAAC,EAAE,CAAC;YACvB,CAAC,CAAC,CAAC;SACH;IACF,CAAC;IAEM,EAAE,CACR,MAAe;QAEf,IAAA,iBAAM,EACL,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,MAAM,CAAC,IAAI,EACjF,KAAK,CAAC,kEAAkE,CACxE,CAAC;QAEF,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC;IAEM,QAAQ,CAAC,KAAoB;QACnC,IAAA,iBAAM,EACL,KAAK,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO,EAC9B,KAAK,CAAC,mEAAmE,CACzE,CAAC;QACF,OAAO,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,IAAI,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;IAC/D,CAAC;IAED,IAAW,MAAM;QAChB,IAAI,IAAI,CAAC,4BAAY,CAAC,CAAC,MAAM,KAAK,SAAS,EAAE;YAC5C,OAAO,SAAS,CAAC;SACjB;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,4BAAY,CAAC,CAAC;QAClC,MAAM,CAAC,SAAS,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,IAAA,sBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC9C,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,MAAM,CAAC;IACf,CAAC;IAEkB,CAAC,2CAA2B,CAAC,CAC/C,MAA+B;QAE/B,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,MAAM,CAAC,CAAC;IAC7E,CAAC;IAEkB,CAAC,kCAAkB,CAAC;QACtC,IAAI,CAAC,eAAe,EAAE,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,4BAAY,CAAC,CAAC,MAAM,KAAK,SAAS;YAAE,OAAO;QACpD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,4BAAY,CAAC,CAAC,MAAM,CAAC,CAAC;IAC/D,CAAC;IAED,IAAW,MAAM;QAChB,OAAO,IAAI,CAAC,4BAAY,CAAC,CAAC,cAAc,EAAE,CAAC;IAC5C,CAAC;IAEM,OAAO,CAAC,KAAa;QAC3B,OAAO,IAAA,uBAAY,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,EAAE,EAAE,CACzD,IAAA,yBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IAEM,OAAO,CAAC,KAAa;QAC3B,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAA,uBAAY,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC9D,IAAA,sBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CACe,CAAC;IAChD,CAAC;IAEM,GAAG,CAAI,UAAuE;QACpF,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IACrC,CAAC;IAEM,QAAQ,CACd,UAAuE;QAEvE,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,UAAU,CAAC,CAAC;IACrD,CAAC;IAEM,aAAa;QACnB,OAAO,IAAA,6BAAkB,EACxB,IAAI,CAAC,4BAAY,CAAC,EAClB,CAAC,MAAM,EAAE,EAAE,CAAC,IAAA,sBAAQ,EAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAA8C,CACvF,CAAC;IACH,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAA,6BAAkB,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,CACxD,IAAA,yBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IAEM,UAAU;QAChB,IAAI,IAAI,CAAC,6BAAa,CAAC,EAAE,EAAE;YAC1B,OAAO,6BAAU,CAAC,OAAO,CAAC;SAC1B;QACD,MAAM,WAAW,GAAG,IAAI,CAAC,4BAAY,CAAC,CAAC;QACvC,MAAM,YAAY,GAAG,WAAW,CAAC,MAAM,CAAC;QACxC,2DAA2D;QAC3D,IAAI,YAAY,KAAK,SAAS,EAAE;YAC/B,OAAO,IAAA,0CAA2B,EAAC,IAAA,6BAAkB,EAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,CAAC;SAC7E;QACD,MAAM,gBAAgB,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAE1E,4FAA4F;QAC5F,IAAA,iBAAM,EAAC,gBAAgB,KAAK,SAAS,EAAE,KAAK,CAAC,kCAAkC,CAAC,CAAC;QACjF,OAAO,IAAA,wCAAyB,EAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;IACjF,CAAC;IAEM,YAAY;QAClB,OAAO,IAAI,CAAC,4BAAY,CAAC,CAAC,YAAY,EAAE,CAAC;IAC1C,CAAC;IAED;;;OAGG;IACI,sBAAsB;QAC5B,IAAA,iBAAM,EACL,IAAI,CAAC,UAAU,EAAE,KAAK,6BAAU,CAAC,UAAU,EAC3C,KAAK,CAAC,sEAAsE,CAC5E,CAAC;QACF,OAAO,IAAI,CAAC,YAAY,EAAE,CAAC;IAC5B,CAAC;CACD;AA5JD,8BA4JC;AAED,MAAa,YACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAEM,EAAE,CAAC,KAAa;QACtB,MAAM,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,SAAS,CAAC;SACjB;QAED,OAAO,IAAA,uBAAY,EAAC,IAAI,CAAC,4BAAY,CAAC,EAAE,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE,CAC9D,IAAA,yBAAY,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAC/C,CAAC;IACH,CAAC;IACD,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC3B,CAAC;IAEO,cAAc;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,WAAW,CAAC;IACpB,CAAC;IAEM,QAAQ,CAAC,KAAa,EAAE,KAAsC;QACpE,IAAA,2BAAgB,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,OAAO,GAA2B,IAAA,mBAAQ,EAAC,KAAK,CAAC;YACtD,CAAC,CAAC,2BAA2B,CAAC,KAAK,CAAC;YACpC,CAAC,CAAC,IAAA,wCAAqB,EACrB,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAC1B,IAAA,4CAAqB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,CACrE,CACA,CAAC;QAEL,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;IAEM,aAAa,CAAC,KAAsC;QAC1D,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;IAEM,WAAW,CAAC,KAAsC;QACxD,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACnC,CAAC;IAEM,QAAQ,CAAC,KAAa;QAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,WAAW,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAC9B,CAAC;IAEM,WAAW,CAAC,KAAc,EAAE,GAAY;QAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC;QACxB,MAAM,WAAW,GAAG,KAAK,IAAI,CAAC,CAAC;QAC/B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,CAAC;QAClD,IAAA,kCAAuB,EAAC,WAAW,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACtD,WAAW,CAAC,MAAM,CAAC,WAAW,EAAE,SAAS,GAAG,WAAW,CAAC,CAAC;IAC1D,CAAC;IAIM,WAAW,CACjB,WAAmB,EACnB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACjE,CAAC;IAGM,SAAS,CAAC,WAAmB,EAAE,MAAgD;QACrF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IAC3E,CAAC;IAOM,WAAW,CACjB,KAAa,EACb,WAAmB,EACnB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,WAAW,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC;IAQM,gBAAgB,CACtB,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IAC3D,CAAC;IAQM,cAAc,CACpB,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACrE,CAAC;IASM,gBAAgB,CACtB,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IAC/D,CAAC;IAEO,iBAAiB,CACxB,KAAa,EACb,WAAmB,EACnB,SAAiB,EACjB,MAAgD;QAEhD,MAAM,WAAW,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE1F,mEAAmE;QACnE,IAAA,iBAAM,EACL,WAAW,YAAY,YAAY,EACnC,KAAK,CAAC,0CAA0C,CAChD,CAAC;QACF,IAAA,kCAAuB,EAAC,WAAW,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAC7D,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,WAAW,KAAK,IAAI,EAAE;YAC5D,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE;gBAC7C,MAAM,UAAU,GACf,WAAW,CAAC,OAAO,CAAC,WAAW,CAAC,IAAI,IAAA,eAAI,EAAC,gCAAgC,CAAC,CAAC;gBAC5E,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE;oBACnD,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;iBAC1E;aACD;SACD;QACD,MAAM,UAAU,GAAG,SAAS,GAAG,WAAW,CAAC;QAC3C,IAAA,2BAAgB,EAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QACpC,MAAM,eAAe,GAAG,WAAW,CAAC,YAAY,EAAE,CAAC;QACnD,MAAM,oBAAoB,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;QACjD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CACvB,eAAe,EACf,WAAW,EACX,UAAU,EACV,oBAAoB,EACpB,KAAK,CACL,CAAC;IACH,CAAC;CACD;AAhLD,oCAgLC;AAED,MAAa,sBACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,IAAW,OAAO,CAAC,UAAuC;QACzD,IAAA,eAAI,EAAC,sCAAsC,CAAC,CAAC;IAC9C,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAA,eAAI,EAAC,6BAA6B,CAAC,CAAC;IAC/D,CAAC;CACD;AAxBD,wDAwBC;AAED,MAAa,cACZ,SAAQ,sBAA8B;IAGtC,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAEO,gBAAgB;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC9D,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,IAAoB,OAAO;QAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,IAAoB,OAAO,CAAC,UAAuC;QAClE,MAAM,OAAO,GAA6B,IAAA,mBAAQ,EAAC,UAAU,CAAC;YAC7D,CAAC,CAAC,0BAA0B,CAAC,UAAU,CAAC;YACxC,CAAC,CAAC,CAAC,IAAA,+CAAwB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC;QACpF,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;QAC5C,IAAA,iBAAM,EAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC3F,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED,IAAoB,YAAY;QAC/B,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,IAAA,eAAI,EAAC,6BAA6B,CAAC,CAAC;IAC/D,CAAC;CACD;AAnCD,wCAmCC;AAED,MAAa,mBACZ,SAAQ,sBAA8B;IAGtC,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;CACD;AAZD,kDAYC;AAED,MAAa,iBACZ,SAAQ,SAA6C;IAGrD,YACC,OAAgB,EAChB,MAA2D,EAC3D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAEO,cAAc;QACrB,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,EAAE,CAAC;QAChD,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACjE,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,IAAW,OAAO;QACjB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,IAAW,OAAO,CAAC,UAAmD;QACrE,MAAM,OAAO,GACZ,UAAU,KAAK,SAAS;YACvB,CAAC,CAAC,EAAE;YACJ,CAAC,CAAC,IAAA,mBAAQ,EAAC,UAAU,CAAC;gBACtB,CAAC,CAAC,0BAA0B,CAAC,UAAU,CAAC;gBACxC,CAAC,CAAC,CAAC,IAAA,+CAAwB,EAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC,CAAC;QACrF,MAAM,WAAW,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAC1C,IAAA,iBAAM,EACL,OAAO,CAAC,MAAM,IAAI,CAAC,EACnB,KAAK,CAAC,8DAA8D,CACpE,CAAC;QACF,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;IACnF,CAAC;IAED,IAAW,YAAY;QACtB,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;CACD;AAzCD,8CAyCC;AAED,MAAa,gBACZ,SAAQ,SAA4C;IAGpD,YACC,OAAgB,EAChB,MAA0D,EAC1D,MAA+B,EAC/B,WAAwB;QAExB,KAAK,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;IAC7C,CAAC;IAED,IAAW,YAAY;QACtB,mFAAmF;QACnF,uEAAuE;QACvE,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;IAC3D,CAAC;IAED,IAAW,aAAa;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,4BAAY,CAAC,CAAC;QAClC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QACpB,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,KAAK,gCAAqB,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACjF,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC;QAC/B,IAAA,iBAAM,EAAC,OAAO,SAAS,KAAK,QAAQ,EAAE,KAAK,CAAC,2BAA2B,CAAC,CAAC;QACzE,MAAM,CAAC,QAAQ,EAAE,CAAC;QAClB,OAAO,IAAA,gBAAK,EAAC,SAAqB,CAAC,CAAC;IACrC,CAAC;CACD;AA5BD,4CA4BC;AAED,MAAa,kBAAoD,SAAQ,SAGxE;CAAG;AAHJ,gDAGI;AASJ,MAAM,WAAW,GAA+B;IAC/C,CAAC,qBAAU,CAAC,SAAS,EAAE,kBAAkB,CAAC;IAC1C,CAAC,qBAAU,CAAC,OAAO,EAAE,gBAAgB,CAAC;IACtC,CAAC,qBAAU,CAAC,QAAQ,EAAE,iBAAiB,CAAC;IACxC,CAAC,qBAAU,CAAC,QAAQ,EAAE,YAAY,CAAC;IACnC,CAAC,qBAAU,CAAC,QAAQ,EAAE,cAAc,CAAC;IACrC,CAAC,qBAAU,CAAC,UAAU,EAAE,mBAAmB,CAAC;CAC5C,CAAC;AAEF,MAAM,WAAW,GAAwC,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;AAE9E;;GAEG;AACH,SAAS,2BAA2B,CAAC,MAA8B;IAClE,oDAAoD;IAEpD,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,sCAA8B,EAAE,KAAK,CAAC,8BAA8B,CAAC,CAAC;IACxF,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,0BAA0B,CAAC,MAA8B;IACjE,oDAAoD;IAEpD,IAAA,iBAAM,EAAC,MAAM,CAAC,IAAI,qCAA6B,EAAE,KAAK,CAAC,6BAA6B,CAAC,CAAC;IACtF,OAAO,CAAC,MAAM,CAAC,CAAC;AACjB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert } from \"@fluidframework/core-utils/internal\";\nimport { StableId } from \"@fluidframework/id-compressor\";\n\nimport {\n\tCursorLocationType,\n\tFieldAnchor,\n\tFieldKey,\n\tFieldUpPath,\n\tITreeCursorSynchronous,\n\tITreeSubscriptionCursor,\n\tTreeNavigationResult,\n\tinCursorNode,\n\tisCursor,\n\titerateCursorField,\n\tkeyAsDetachedField,\n} from \"../../core/index.js\";\nimport {\n\tassertValidIndex,\n\tassertValidRangeIndices,\n\tbrand,\n\tdisposeSymbol,\n\tfail,\n} from \"../../util/index.js\";\n// TODO: stop depending on contextuallyTyped\nimport { applyTypesFromContext, cursorFromContextualData } from \"../contextuallyTyped.js\";\nimport {\n\tFieldKinds,\n\tOptionalFieldEditBuilder,\n\tSequenceFieldEditBuilder,\n\tValueFieldEditBuilder,\n} from \"../default-schema/index.js\";\nimport { cursorForMapTreeField } from \"../mapTreeCursor.js\";\nimport { FlexFieldKind } from \"../modular-schema/index.js\";\nimport { LocalNodeKey, StableNodeKey, nodeKeyTreeIdentifier } from \"../node-key/index.js\";\nimport { FlexAllowedTypes, FlexFieldSchema } from \"../typed-schema/index.js\";\n\nimport { Context } from \"./context.js\";\nimport {\n\tFlexTreeEntityKind,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeNodeKeyField,\n\tFlexTreeOptionalField,\n\tFlexTreeRequiredField,\n\tFlexTreeSequenceField,\n\tFlexTreeTypedField,\n\tFlexTreeTypedNodeUnion,\n\tFlexTreeUnboxNodeUnion,\n\tFlexibleNodeContent,\n\tFlexibleNodeSubSequence,\n\tTreeStatus,\n\tflexTreeMarker,\n} from \"./flexTreeTypes.js\";\nimport {\n\tLazyEntity,\n\tanchorSymbol,\n\tcursorSymbol,\n\tforgetAnchorSymbol,\n\tisFreedSymbol,\n\ttryMoveCursorToAnchorSymbol,\n} from \"./lazyEntity.js\";\nimport { makeTree } from \"./lazyNode.js\";\nimport { unboxedUnion } from \"./unboxed.js\";\nimport { treeStatusFromAnchorCache, treeStatusFromDetachedField } from \"./utilities.js\";\n\n/**\n * Indexing for {@link LazyField.at} and {@link LazyField.boxedAt} supports the\n * usage of negative indices, which regular indexing using `[` and `]` does not.\n *\n * See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at\n * for additional context on the semantics.\n *\n * @returns A positive index that can be used in regular indexing. Returns\n * undefined if that index would be out-of-bounds.\n */\nfunction indexForAt(index: number, length: number): number | undefined {\n\tlet finalIndex = Math.trunc(+index);\n\tif (isNaN(finalIndex)) {\n\t\tfinalIndex = 0;\n\t}\n\tif (finalIndex < -length || finalIndex >= length) {\n\t\treturn undefined;\n\t}\n\tif (finalIndex < 0) {\n\t\tfinalIndex = finalIndex + length;\n\t}\n\treturn finalIndex;\n}\n\nexport function makeField(\n\tcontext: Context,\n\tschema: FlexFieldSchema,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeField {\n\tconst fieldAnchor = cursor.buildFieldAnchor();\n\n\tconst field = new (kindToClass.get(schema.kind) ?? fail(\"missing field implementation\"))(\n\t\tcontext,\n\t\tschema,\n\t\tcursor,\n\t\tfieldAnchor,\n\t);\n\treturn field;\n}\n\n/**\n * A Proxy target, which together with a `fieldProxyHandler` implements a basic access to\n * the nodes of {@link EditableField} by means of the cursors.\n */\nexport abstract class LazyField<TKind extends FlexFieldKind, TTypes extends FlexAllowedTypes>\n\textends LazyEntity<FlexFieldSchema<TKind, TTypes>, FieldAnchor>\n\timplements FlexTreeField\n{\n\tpublic get [flexTreeMarker](): FlexTreeEntityKind.Field {\n\t\treturn FlexTreeEntityKind.Field;\n\t}\n\tpublic readonly key: FieldKey;\n\n\t/**\n\t * If this field ends its lifetime before the Anchor does, this needs to be invoked to avoid a double free\n\t * if/when the Anchor is destroyed.\n\t */\n\tprivate readonly offAfterDestroy?: () => void;\n\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<TKind, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t\tassert(cursor.mode === CursorLocationType.Fields, 0x77b /* must be in fields mode */);\n\t\tthis.key = cursor.getFieldKey();\n\t\t// Fields currently live as long as their parent does.\n\t\t// For root fields, this means forever, but other cases can be cleaned up when their parent anchor is deleted.\n\t\tif (fieldAnchor.parent !== undefined) {\n\t\t\tconst anchorNode =\n\t\t\t\tcontext.forest.anchors.locate(fieldAnchor.parent) ??\n\t\t\t\tfail(\"parent anchor node should always exist since field is under a node\");\n\t\t\tthis.offAfterDestroy = anchorNode.on(\"afterDestroy\", () => {\n\t\t\t\tthis[disposeSymbol]();\n\t\t\t});\n\t\t}\n\t}\n\n\tpublic is<TSchema extends FlexFieldSchema>(\n\t\tschema: TSchema,\n\t): this is FlexTreeTypedField<TSchema> {\n\t\tassert(\n\t\t\tthis.context.schema.policy.fieldKinds.get(schema.kind.identifier) === schema.kind,\n\t\t\t0x77c /* Narrowing must be done to a kind that exists in this context */,\n\t\t);\n\n\t\treturn this.schema.equals(schema);\n\t}\n\n\tpublic isSameAs(other: FlexTreeField): boolean {\n\t\tassert(\n\t\t\tother.context === this.context,\n\t\t\t0x77d /* Content from different flex trees should not be used together */,\n\t\t);\n\t\treturn this.key === other.key && this.parent === other.parent;\n\t}\n\n\tpublic get parent(): FlexTreeNode | undefined {\n\t\tif (this[anchorSymbol].parent === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\tconst cursor = this[cursorSymbol];\n\t\tcursor.exitField();\n\t\tconst output = makeTree(this.context, cursor);\n\t\tcursor.enterField(this.key);\n\t\treturn output;\n\t}\n\n\tprotected override [tryMoveCursorToAnchorSymbol](\n\t\tcursor: ITreeSubscriptionCursor,\n\t): TreeNavigationResult {\n\t\treturn this.context.forest.tryMoveCursorToField(this[anchorSymbol], cursor);\n\t}\n\n\tprotected override [forgetAnchorSymbol](): void {\n\t\tthis.offAfterDestroy?.();\n\t\tif (this[anchorSymbol].parent === undefined) return;\n\t\tthis.context.forest.anchors.forget(this[anchorSymbol].parent);\n\t}\n\n\tpublic get length(): number {\n\t\treturn this[cursorSymbol].getFieldLength();\n\t}\n\n\tpublic atIndex(index: number): FlexTreeUnboxNodeUnion<TTypes> {\n\t\treturn inCursorNode(this[cursorSymbol], index, (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\n\tpublic boxedAt(index: number): FlexTreeTypedNodeUnion<TTypes> | undefined {\n\t\tconst finalIndex = indexForAt(index, this.length);\n\n\t\tif (finalIndex === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn inCursorNode(this[cursorSymbol], finalIndex, (cursor) =>\n\t\t\tmakeTree(this.context, cursor),\n\t\t) as unknown as FlexTreeTypedNodeUnion<TTypes>;\n\t}\n\n\tpublic map<U>(callbackfn: (value: FlexTreeUnboxNodeUnion<TTypes>, index: number) => U): U[] {\n\t\treturn Array.from(this, callbackfn);\n\t}\n\n\tpublic mapBoxed<U>(\n\t\tcallbackfn: (value: FlexTreeTypedNodeUnion<TTypes>, index: number) => U,\n\t): U[] {\n\t\treturn Array.from(this.boxedIterator(), callbackfn);\n\t}\n\n\tpublic boxedIterator(): IterableIterator<FlexTreeTypedNodeUnion<TTypes>> {\n\t\treturn iterateCursorField(\n\t\t\tthis[cursorSymbol],\n\t\t\t(cursor) => makeTree(this.context, cursor) as unknown as FlexTreeTypedNodeUnion<TTypes>,\n\t\t);\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<FlexTreeUnboxNodeUnion<TTypes>> {\n\t\treturn iterateCursorField(this[cursorSymbol], (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\n\tpublic treeStatus(): TreeStatus {\n\t\tif (this[isFreedSymbol]()) {\n\t\t\treturn TreeStatus.Deleted;\n\t\t}\n\t\tconst fieldAnchor = this[anchorSymbol];\n\t\tconst parentAnchor = fieldAnchor.parent;\n\t\t// If the parentAnchor is undefined it is a detached field.\n\t\tif (parentAnchor === undefined) {\n\t\t\treturn treeStatusFromDetachedField(keyAsDetachedField(fieldAnchor.fieldKey));\n\t\t}\n\t\tconst parentAnchorNode = this.context.forest.anchors.locate(parentAnchor);\n\n\t\t// As the \"parentAnchor === undefined\" case is handled above, parentAnchorNode should exist.\n\t\tassert(parentAnchorNode !== undefined, 0x77e /* parentAnchorNode must exist. */);\n\t\treturn treeStatusFromAnchorCache(this.context.forest.anchors, parentAnchorNode);\n\t}\n\n\tpublic getFieldPath(): FieldUpPath {\n\t\treturn this[cursorSymbol].getFieldPath();\n\t}\n\n\t/**\n\t * Returns the path to this field to use for editing. Throws iff this path is not {@link TreeStatus#InDocument}.\n\t * This path is not valid to hold onto across edits: this must be recalled for each edit.\n\t */\n\tpublic getFieldPathForEditing(): FieldUpPath {\n\t\tassert(\n\t\t\tthis.treeStatus() === TreeStatus.InDocument,\n\t\t\t0x77f /* Editing only allowed on fields with TreeStatus.InDocument status */,\n\t\t);\n\t\treturn this.getFieldPath();\n\t}\n}\n\nexport class LazySequence<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.sequence, TTypes>\n\timplements FlexTreeSequenceField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.sequence, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tpublic at(index: number): FlexTreeUnboxNodeUnion<TTypes> | undefined {\n\t\tconst finalIndex = indexForAt(index, this.length);\n\n\t\tif (finalIndex === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn inCursorNode(this[cursorSymbol], finalIndex, (cursor) =>\n\t\t\tunboxedUnion(this.context, this.schema, cursor),\n\t\t);\n\t}\n\tpublic get asArray(): readonly FlexTreeUnboxNodeUnion<TTypes>[] {\n\t\treturn this.map((x) => x);\n\t}\n\n\tprivate sequenceEditor(): SequenceFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.sequenceField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic insertAt(index: number, value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tassertValidIndex(index, this, true);\n\t\tconst content: ITreeCursorSynchronous = isCursor(value)\n\t\t\t? prepareFieldCursorForInsert(value)\n\t\t\t: cursorForMapTreeField(\n\t\t\t\t\tArray.from(value, (item) =>\n\t\t\t\t\t\tapplyTypesFromContext(this.context, this.schema.allowedTypeSet, item),\n\t\t\t\t\t),\n\t\t\t  );\n\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tfieldEditor.insert(index, content);\n\t}\n\n\tpublic insertAtStart(value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tthis.insertAt(0, value);\n\t}\n\n\tpublic insertAtEnd(value: FlexibleNodeSubSequence<TTypes>): void {\n\t\tthis.insertAt(this.length, value);\n\t}\n\n\tpublic removeAt(index: number): void {\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tfieldEditor.remove(index, 1);\n\t}\n\n\tpublic removeRange(start?: number, end?: number): void {\n\t\tconst fieldEditor = this.sequenceEditor();\n\t\tconst { length } = this;\n\t\tconst removeStart = start ?? 0;\n\t\tconst removeEnd = Math.min(length, end ?? length);\n\t\tassertValidRangeIndices(removeStart, removeEnd, this);\n\t\tfieldEditor.remove(removeStart, removeEnd - removeStart);\n\t}\n\n\tpublic moveToStart(sourceIndex: number): void;\n\tpublic moveToStart(sourceIndex: number, source: FlexTreeSequenceField<FlexAllowedTypes>): void;\n\tpublic moveToStart(\n\t\tsourceIndex: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(0, sourceIndex, sourceIndex + 1, source);\n\t}\n\tpublic moveToEnd(sourceIndex: number): void;\n\tpublic moveToEnd(sourceIndex: number, source: FlexTreeSequenceField<FlexAllowedTypes>): void;\n\tpublic moveToEnd(sourceIndex: number, source?: FlexTreeSequenceField<FlexAllowedTypes>): void {\n\t\tthis._moveRangeToIndex(this.length, sourceIndex, sourceIndex + 1, source);\n\t}\n\tpublic moveToIndex(index: number, sourceIndex: number): void;\n\tpublic moveToIndex(\n\t\tindex: number,\n\t\tsourceIndex: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveToIndex(\n\t\tindex: number,\n\t\tsourceIndex: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(index, sourceIndex, sourceIndex + 1, source);\n\t}\n\n\tpublic moveRangeToStart(sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToStart(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveRangeToStart(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(0, sourceStart, sourceEnd, source);\n\t}\n\n\tpublic moveRangeToEnd(sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToEnd(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveRangeToEnd(\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(this.length, sourceStart, sourceEnd, source);\n\t}\n\n\tpublic moveRangeToIndex(index: number, sourceStart: number, sourceEnd: number): void;\n\tpublic moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void;\n\tpublic moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tthis._moveRangeToIndex(index, sourceStart, sourceEnd, source);\n\t}\n\n\tprivate _moveRangeToIndex(\n\t\tindex: number,\n\t\tsourceStart: number,\n\t\tsourceEnd: number,\n\t\tsource?: FlexTreeSequenceField<FlexAllowedTypes>,\n\t): void {\n\t\tconst sourceField = source !== undefined ? (this.isSameAs(source) ? this : source) : this;\n\n\t\t// TODO: determine support for move across different sequence types\n\t\tassert(\n\t\t\tsourceField instanceof LazySequence,\n\t\t\t0x7b1 /* Unsupported sequence implementation. */,\n\t\t);\n\t\tassertValidRangeIndices(sourceStart, sourceEnd, sourceField);\n\t\tif (this.schema.types !== undefined && sourceField !== this) {\n\t\t\tfor (let i = sourceStart; i < sourceEnd; i++) {\n\t\t\t\tconst sourceNode =\n\t\t\t\t\tsourceField.boxedAt(sourceStart) ?? fail(\"impossible out of bounds index\");\n\t\t\t\tif (!this.schema.types.has(sourceNode.schema.name)) {\n\t\t\t\t\tthrow new Error(\"Type in source sequence is not allowed in destination.\");\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst movedCount = sourceEnd - sourceStart;\n\t\tassertValidIndex(index, this, true);\n\t\tconst sourceFieldPath = sourceField.getFieldPath();\n\t\tconst destinationFieldPath = this.getFieldPath();\n\t\tthis.context.editor.move(\n\t\t\tsourceFieldPath,\n\t\t\tsourceStart,\n\t\t\tmovedCount,\n\t\t\tdestinationFieldPath,\n\t\t\tindex,\n\t\t);\n\t}\n}\n\nexport class ReadonlyLazyValueField<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.required, TTypes>\n\timplements FlexTreeRequiredField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.required, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tpublic get content(): FlexTreeUnboxNodeUnion<TTypes> {\n\t\treturn this.atIndex(0);\n\t}\n\n\tpublic set content(newContent: FlexibleNodeContent<TTypes>) {\n\t\tfail(\"cannot set content in readonly field\");\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedNodeUnion<TTypes> {\n\t\treturn this.boxedAt(0) ?? fail(\"value node must have 1 item\");\n\t}\n}\n\nexport class LazyValueField<TTypes extends FlexAllowedTypes>\n\textends ReadonlyLazyValueField<TTypes>\n\timplements FlexTreeRequiredField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.required, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tprivate valueFieldEditor(): ValueFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.valueField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic override get content(): FlexTreeUnboxNodeUnion<TTypes> {\n\t\treturn this.atIndex(0);\n\t}\n\n\tpublic override set content(newContent: FlexibleNodeContent<TTypes>) {\n\t\tconst content: ITreeCursorSynchronous[] = isCursor(newContent)\n\t\t\t? prepareNodeCursorForInsert(newContent)\n\t\t\t: [cursorFromContextualData(this.context, this.schema.allowedTypeSet, newContent)];\n\t\tconst fieldEditor = this.valueFieldEditor();\n\t\tassert(content.length === 1, 0x780 /* value field content should normalize to one item */);\n\t\tfieldEditor.set(content[0]);\n\t}\n\n\tpublic override get boxedContent(): FlexTreeTypedNodeUnion<TTypes> {\n\t\treturn this.boxedAt(0) ?? fail(\"value node must have 1 item\");\n\t}\n}\n\nexport class LazyIdentifierField<TTypes extends FlexAllowedTypes>\n\textends ReadonlyLazyValueField<TTypes>\n\timplements FlexTreeRequiredField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.required, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n}\n\nexport class LazyOptionalField<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.optional, TTypes>\n\timplements FlexTreeOptionalField<TTypes>\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.optional, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tprivate optionalEditor(): OptionalFieldEditBuilder {\n\t\tconst fieldPath = this.getFieldPathForEditing();\n\t\tconst fieldEditor = this.context.editor.optionalField(fieldPath);\n\t\treturn fieldEditor;\n\t}\n\n\tpublic get content(): FlexTreeUnboxNodeUnion<TTypes> | undefined {\n\t\treturn this.length === 0 ? undefined : this.atIndex(0);\n\t}\n\n\tpublic set content(newContent: FlexibleNodeContent<TTypes> | undefined) {\n\t\tconst content: ITreeCursorSynchronous[] =\n\t\t\tnewContent === undefined\n\t\t\t\t? []\n\t\t\t\t: isCursor(newContent)\n\t\t\t\t? prepareNodeCursorForInsert(newContent)\n\t\t\t\t: [cursorFromContextualData(this.context, this.schema.allowedTypeSet, newContent)];\n\t\tconst fieldEditor = this.optionalEditor();\n\t\tassert(\n\t\t\tcontent.length <= 1,\n\t\t\t0x781 /* optional field content should normalize at most one item */,\n\t\t);\n\t\tfieldEditor.set(content.length === 0 ? undefined : content[0], this.length === 0);\n\t}\n\n\tpublic get boxedContent(): FlexTreeTypedNodeUnion<TTypes> | undefined {\n\t\treturn this.length === 0 ? undefined : this.boxedAt(0);\n\t}\n}\n\nexport class LazyNodeKeyField<TTypes extends FlexAllowedTypes>\n\textends LazyField<typeof FieldKinds.nodeKey, TTypes>\n\timplements FlexTreeNodeKeyField\n{\n\tpublic constructor(\n\t\tcontext: Context,\n\t\tschema: FlexFieldSchema<typeof FieldKinds.nodeKey, TTypes>,\n\t\tcursor: ITreeSubscriptionCursor,\n\t\tfieldAnchor: FieldAnchor,\n\t) {\n\t\tsuper(context, schema, cursor, fieldAnchor);\n\t}\n\n\tpublic get localNodeKey(): LocalNodeKey {\n\t\t// TODO: Optimize this to be a fast path that gets a LocalNodeKey directly from the\n\t\t// forest rather than getting the StableNodeKey and the compressing it.\n\t\treturn this.context.nodeKeys.localize(this.stableNodeKey);\n\t}\n\n\tpublic get stableNodeKey(): StableNodeKey {\n\t\tconst cursor = this[cursorSymbol];\n\t\tcursor.enterNode(0);\n\t\tassert(cursor.type === nodeKeyTreeIdentifier, 0x7b2 /* invalid node key type */);\n\t\tconst stableKey = cursor.value;\n\t\tassert(typeof stableKey === \"string\", 0x7b3 /* invalid node key type */);\n\t\tcursor.exitNode();\n\t\treturn brand(stableKey as StableId);\n\t}\n}\n\nexport class LazyForbiddenField<TTypes extends FlexAllowedTypes> extends LazyField<\n\ttypeof FieldKinds.forbidden,\n\tTTypes\n> {}\n\ntype Builder = new <TTypes extends FlexAllowedTypes>(\n\tcontext: Context,\n\tschema: FlexFieldSchema<any, TTypes>,\n\tcursor: ITreeSubscriptionCursor,\n\tfieldAnchor: FieldAnchor,\n) => LazyField<any, TTypes>;\n\nconst builderList: [FlexFieldKind, Builder][] = [\n\t[FieldKinds.forbidden, LazyForbiddenField],\n\t[FieldKinds.nodeKey, LazyNodeKeyField],\n\t[FieldKinds.optional, LazyOptionalField],\n\t[FieldKinds.sequence, LazySequence],\n\t[FieldKinds.required, LazyValueField],\n\t[FieldKinds.identifier, LazyIdentifierField],\n];\n\nconst kindToClass: ReadonlyMap<FlexFieldKind, Builder> = new Map(builderList);\n\n/**\n * Prepare a fields cursor (holding a sequence of nodes) for inserting.\n */\nfunction prepareFieldCursorForInsert(cursor: ITreeCursorSynchronous): ITreeCursorSynchronous {\n\t// TODO: optionally validate content against schema.\n\n\tassert(cursor.mode === CursorLocationType.Fields, 0x8cb /* should be in fields mode */);\n\treturn cursor;\n}\n\n/**\n * Prepare a node cursor (holding a single node) for inserting.\n */\nfunction prepareNodeCursorForInsert(cursor: ITreeCursorSynchronous): ITreeCursorSynchronous[] {\n\t// TODO: optionally validate content against schema.\n\n\tassert(cursor.mode === CursorLocationType.Nodes, 0x805 /* should be in nodes mode */);\n\treturn [cursor];\n}\n"]}