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

package/dist/feature-libraries/modular-schema/modularChangeTypes.d.ts

@@ -2,7 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { ChangeAtomIdMap, ChangesetLocalId, FieldKey, FieldKindIdentifier, RevisionInfo, RevisionTag } from "../../core/index.js";
+import { ChangeAtomId, ChangeAtomIdMap, ChangesetLocalId, FieldKey, FieldKindIdentifier, RevisionInfo, RevisionTag } from "../../core/index.js";
 import { Brand } from "../../util/index.js";
 import { TreeChunk } from "../chunked-forest/index.js";
 /**
@@ -13,15 +13,16 @@ export interface ModularChangeset extends HasFieldChanges {
      * The numerically highest `ChangesetLocalId` used in this changeset.
      * If undefined then this changeset contains no IDs.
      */
-    maxId?: ChangesetLocalId;
+    readonly maxId?: ChangesetLocalId;
     /**
      * The revisions included in this changeset, ordered temporally (oldest to newest).
      * Undefined for anonymous changesets.
      * Should never be empty.
      */
     readonly revisions?: readonly RevisionInfo[];
-    fieldChanges: FieldChangeMap;
-    constraintViolationCount?: number;
+    readonly fieldChanges: FieldChangeMap;
+    readonly nodeChanges: ChangeAtomIdMap<NodeChangeset>;
+    readonly constraintViolationCount?: number;
     readonly builds?: ChangeAtomIdMap<TreeChunk>;
     readonly destroys?: ChangeAtomIdMap<number>;
     readonly refreshers?: ChangeAtomIdMap<TreeChunk>;
@@ -39,6 +40,7 @@ export interface NodeExistsConstraint {
 export interface NodeChangeset extends HasFieldChanges {
     nodeExistsConstraint?: NodeExistsConstraint;
 }
+export type NodeId = ChangeAtomId;
 /**
  * @internal
  */

package/dist/feature-libraries/modular-schema/modularChangeTypes.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"modularChangeTypes.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,eAAe,EACf,gBAAgB,EAChB,QAAQ,EACR,mBAAmB,EACnB,YAAY,EACZ,WAAW,EACX,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAEvD;;GAEG;AACH,MAAM,WAAW,gBAAiB,SAAQ,eAAe;IACxD;;;OAGG;IACH,KAAK,CAAC,EAAE,gBAAgB,CAAC;IACzB;;;;OAIG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,YAAY,EAAE,CAAC;IAC7C,YAAY,EAAE,cAAc,CAAC;IAC7B,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAClC,QAAQ,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC;IAC7C,QAAQ,CAAC,QAAQ,CAAC,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;IAC5C,QAAQ,CAAC,UAAU,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC;CACjD;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACpC,QAAQ,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAc,SAAQ,eAAe;IACrD,oBAAoB,CAAC,EAAE,oBAAoB,CAAC;CAC5C;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,YAAY,CAAC,EAAE,cAAc,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAExD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,SAAS,EAAE,mBAAmB,CAAC;IAE/B;;;;;;OAMG;IACH,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,MAAM,EAAE,cAAc,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,KAAK,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC"}
+{"version":3,"file":"modularChangeTypes.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,YAAY,EACZ,eAAe,EACf,gBAAgB,EAChB,QAAQ,EACR,mBAAmB,EACnB,YAAY,EACZ,WAAW,EACX,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAEvD;;GAEG;AACH,MAAM,WAAW,gBAAiB,SAAQ,eAAe;IACxD;;;OAGG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,gBAAgB,CAAC;IAClC;;;;OAIG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,SAAS,YAAY,EAAE,CAAC;IAC7C,QAAQ,CAAC,YAAY,EAAE,cAAc,CAAC;IACtC,QAAQ,CAAC,WAAW,EAAE,eAAe,CAAC,aAAa,CAAC,CAAC;IACrD,QAAQ,CAAC,wBAAwB,CAAC,EAAE,MAAM,CAAC;IAC3C,QAAQ,CAAC,MAAM,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC;IAC7C,QAAQ,CAAC,QAAQ,CAAC,EAAE,eAAe,CAAC,MAAM,CAAC,CAAC;IAC5C,QAAQ,CAAC,UAAU,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC,CAAC;CACjD;AAED;;GAEG;AACH,MAAM,WAAW,oBAAoB;IACpC,QAAQ,EAAE,OAAO,CAAC;CAClB;AAED;;;GAGG;AACH,MAAM,WAAW,aAAc,SAAQ,eAAe;IACrD,oBAAoB,CAAC,EAAE,oBAAoB,CAAC;CAC5C;AAED,MAAM,MAAM,MAAM,GAAG,YAAY,CAAC;AAElC;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,YAAY,CAAC,EAAE,cAAc,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;AAExD;;GAEG;AACH,MAAM,WAAW,WAAW;IAC3B,SAAS,EAAE,mBAAmB,CAAC;IAE/B;;;;;;OAMG;IACH,QAAQ,CAAC,EAAE,WAAW,CAAC;IACvB,MAAM,EAAE,cAAc,CAAC;CACvB;AAED;;GAEG;AACH,MAAM,MAAM,cAAc,GAAG,KAAK,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC"}

package/dist/feature-libraries/modular-schema/modularChangeTypes.js.map

@@ -1 +1 @@
-{"version":3,"file":"modularChangeTypes.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeTypes.ts"],"names":[],"mappings":";AAAA;;;GAGG","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tChangeAtomIdMap,\n\tChangesetLocalId,\n\tFieldKey,\n\tFieldKindIdentifier,\n\tRevisionInfo,\n\tRevisionTag,\n} from \"../../core/index.js\";\nimport { Brand } from \"../../util/index.js\";\nimport { TreeChunk } from \"../chunked-forest/index.js\";\n\n/**\n * @internal\n */\nexport interface ModularChangeset extends HasFieldChanges {\n\t/**\n\t * The numerically highest `ChangesetLocalId` used in this changeset.\n\t * If undefined then this changeset contains no IDs.\n\t */\n\tmaxId?: ChangesetLocalId;\n\t/**\n\t * The revisions included in this changeset, ordered temporally (oldest to newest).\n\t * Undefined for anonymous changesets.\n\t * Should never be empty.\n\t */\n\treadonly revisions?: readonly RevisionInfo[];\n\tfieldChanges: FieldChangeMap;\n\tconstraintViolationCount?: number;\n\treadonly builds?: ChangeAtomIdMap<TreeChunk>;\n\treadonly destroys?: ChangeAtomIdMap<number>;\n\treadonly refreshers?: ChangeAtomIdMap<TreeChunk>;\n}\n\n/**\n * @internal\n */\nexport interface NodeExistsConstraint {\n\tviolated: boolean;\n}\n\n/**\n * Changeset for a subtree rooted at a specific node.\n * @internal\n */\nexport interface NodeChangeset extends HasFieldChanges {\n\tnodeExistsConstraint?: NodeExistsConstraint;\n}\n\n/**\n * @internal\n */\nexport interface HasFieldChanges {\n\tfieldChanges?: FieldChangeMap;\n}\n\n/**\n * @internal\n */\nexport type FieldChangeMap = Map<FieldKey, FieldChange>;\n\n/**\n * @internal\n */\nexport interface FieldChange {\n\tfieldKind: FieldKindIdentifier;\n\n\t/**\n\t * If defined, `change` is part of the specified revision.\n\t * Undefined in the following cases:\n\t * A) A revision is specified on an ancestor of this `FieldChange`, in which case `change` is part of that revision.\n\t * B) `change` is composed of multiple revisions.\n\t * C) `change` is part of an anonymous revision.\n\t */\n\trevision?: RevisionTag;\n\tchange: FieldChangeset;\n}\n\n/**\n * @internal\n */\nexport type FieldChangeset = Brand<unknown, \"FieldChangeset\">;\n"]}
+{"version":3,"file":"modularChangeTypes.js","sourceRoot":"","sources":["../../../src/feature-libraries/modular-schema/modularChangeTypes.ts"],"names":[],"mappings":";AAAA;;;GAGG","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tChangeAtomId,\n\tChangeAtomIdMap,\n\tChangesetLocalId,\n\tFieldKey,\n\tFieldKindIdentifier,\n\tRevisionInfo,\n\tRevisionTag,\n} from \"../../core/index.js\";\nimport { Brand } from \"../../util/index.js\";\nimport { TreeChunk } from \"../chunked-forest/index.js\";\n\n/**\n * @internal\n */\nexport interface ModularChangeset extends HasFieldChanges {\n\t/**\n\t * The numerically highest `ChangesetLocalId` used in this changeset.\n\t * If undefined then this changeset contains no IDs.\n\t */\n\treadonly maxId?: ChangesetLocalId;\n\t/**\n\t * The revisions included in this changeset, ordered temporally (oldest to newest).\n\t * Undefined for anonymous changesets.\n\t * Should never be empty.\n\t */\n\treadonly revisions?: readonly RevisionInfo[];\n\treadonly fieldChanges: FieldChangeMap;\n\treadonly nodeChanges: ChangeAtomIdMap<NodeChangeset>;\n\treadonly constraintViolationCount?: number;\n\treadonly builds?: ChangeAtomIdMap<TreeChunk>;\n\treadonly destroys?: ChangeAtomIdMap<number>;\n\treadonly refreshers?: ChangeAtomIdMap<TreeChunk>;\n}\n\n/**\n * @internal\n */\nexport interface NodeExistsConstraint {\n\tviolated: boolean;\n}\n\n/**\n * Changeset for a subtree rooted at a specific node.\n * @internal\n */\nexport interface NodeChangeset extends HasFieldChanges {\n\tnodeExistsConstraint?: NodeExistsConstraint;\n}\n\nexport type NodeId = ChangeAtomId;\n\n/**\n * @internal\n */\nexport interface HasFieldChanges {\n\tfieldChanges?: FieldChangeMap;\n}\n\n/**\n * @internal\n */\nexport type FieldChangeMap = Map<FieldKey, FieldChange>;\n\n/**\n * @internal\n */\nexport interface FieldChange {\n\tfieldKind: FieldKindIdentifier;\n\n\t/**\n\t * If defined, `change` is part of the specified revision.\n\t * Undefined in the following cases:\n\t * A) A revision is specified on an ancestor of this `FieldChange`, in which case `change` is part of that revision.\n\t * B) `change` is composed of multiple revisions.\n\t * C) `change` is part of an anonymous revision.\n\t */\n\trevision?: RevisionTag;\n\tchange: FieldChangeset;\n}\n\n/**\n * @internal\n */\nexport type FieldChangeset = Brand<unknown, \"FieldChangeset\">;\n"]}

package/dist/feature-libraries/node-key/nodeKey.d.ts

@@ -3,8 +3,8 @@
  * Licensed under the MIT License.
  */
 import { SessionSpaceCompressedId, StableId } from "@fluidframework/id-compressor";
-import { Brand, Opaque } from "../../util/index.js";
 import { TreeNodeSchemaIdentifier } from "../../core/index.js";
+import { Brand, Opaque } from "../../util/index.js";
 /**
  * A key which uniquely identifies a node in the tree within this session.
  * @remarks {@link LocalNodeKey}s must not be serialized and stored as data without first being converted into a {@link StableNodeKey}.

package/dist/feature-libraries/node-key/nodeKey.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"nodeKey.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKey.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,wBAAwB,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AACnF,OAAO,EAAE,KAAK,EAAE,MAAM,EAAS,MAAM,qBAAqB,CAAC;AAC3D,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAE/D;;;;;;;;GAQG;AACH,MAAM,WAAW,YAAa,SAAQ,MAAM,CAAC,KAAK,CAAC,wBAAwB,EAAE,gBAAgB,CAAC,CAAC;CAAG;AAElG;;;;;GAKG;AACH,MAAM,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;AAE/D;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAEjF;AAED;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,aAAa,CAAC;AAE1C;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,wBAEnC,CAAC"}
+{"version":3,"file":"nodeKey.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKey.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,wBAAwB,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEnF,OAAO,EAAE,wBAAwB,EAAE,MAAM,qBAAqB,CAAC;AAC/D,OAAO,EAAE,KAAK,EAAE,MAAM,EAAS,MAAM,qBAAqB,CAAC;AAE3D;;;;;;;;GAQG;AACH,MAAM,WAAW,YAAa,SAAQ,MAAM,CAAC,KAAK,CAAC,wBAAwB,EAAE,gBAAgB,CAAC,CAAC;CAAG;AAElG;;;;;GAKG;AACH,MAAM,MAAM,aAAa,GAAG,KAAK,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;AAE/D;;;;;;;GAOG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,EAAE,YAAY,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAEjF;AAED;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,aAAa,CAAC;AAE1C;;;;;GAKG;AACH,eAAO,MAAM,qBAAqB,EAAE,wBAEnC,CAAC"}

package/dist/feature-libraries/node-key/nodeKey.js.map

@@ -1 +1 @@
-{"version":3,"file":"nodeKey.js","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKey.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAGH,kDAA2D;AAsB3D;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAC,CAAe,EAAE,CAAe;IACpE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAFD,oDAEC;AAED;;;;;;GAMG;AACU,QAAA,eAAe,GAAG,UAAU,CAAC;AAE1C;;;;;GAKG;AACU,QAAA,qBAAqB,GAA6B,IAAA,gBAAK,EACnE,oCAAoC,CACpC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { SessionSpaceCompressedId, StableId } from \"@fluidframework/id-compressor\";\nimport { Brand, Opaque, brand } from \"../../util/index.js\";\nimport { TreeNodeSchemaIdentifier } from \"../../core/index.js\";\n\n/**\n * A key which uniquely identifies a node in the tree within this session.\n * @remarks {@link LocalNodeKey}s must not be serialized and stored as data without first being converted into a {@link StableNodeKey}.\n * They are local to the current session and equivalent nodes in another session will not necessarily have the same {@link LocalNodeKey}.\n * However, they are otherwise preferential to use over {@link StableNodeKey}s as they are much smaller.\n * For example, they are more efficient than {@link StableNodeKey}s when used as keys in a map.\n * {@link LocalNodeKey}s may be compared or equated via {@link compareLocalNodeKeys}.\n * @internal\n */\nexport interface LocalNodeKey extends Opaque<Brand<SessionSpaceCompressedId, \"Local Node Key\">> {}\n\n/**\n * A UUID which identifies a node in the tree.\n * This key is universally unique and stable forever; therefore it is safe to persist as data in a SharedTree or other DDS/database.\n * When not persisted or serialized, it is preferable to use a {@link LocalNodeKey} instead for better performance.\n * @internal\n */\nexport type StableNodeKey = Brand<StableId, \"Stable Node Key\">;\n\n/**\n * Compares two {@link LocalNodeKey}s.\n * All {@link LocalNodeKey}s retrieved from a single SharedTree client can be totally ordered using this comparator.\n * @param a - the first key to compare\n * @param b - the second key to compare\n * @returns `0` if `a` and `b` are the same key, otherwise `-1` if `a` is ordered before `b` or `1` if `a` is ordered after `b`.\n * @internal\n */\nexport function compareLocalNodeKeys(a: LocalNodeKey, b: LocalNodeKey): -1 | 0 | 1 {\n\treturn a === b ? 0 : a > b ? 1 : -1;\n}\n\n/**\n * The key for the special field for {@link LocalNodeKey}s,\n * which allows nodes to be given keys that can be used to find the nodes via the node key index.\n * @internal\n * @privateRemarks TODO: Come up with a unified and collision-resistant naming schema for fields defined by the system.\n * For now, we'll use `__` to reduce the change of collision, since this is what other internal properties use in Fluid.\n */\nexport const nodeKeyFieldKey = \"__n_id__\";\n\n/**\n * The TreeNodeSchemaIdentifier for node keys.\n * @internal\n * @privateRemarks TODO: Come up with a unified and collision-resistant naming schema for types defined by the system.\n * For now, we'll use `__` to reduce the change of collision, since this is what other internal properties use in Fluid.\n */\nexport const nodeKeyTreeIdentifier: TreeNodeSchemaIdentifier = brand(\n\t\"com.fluidframework.nodeKey.NodeKey\",\n);\n"]}
+{"version":3,"file":"nodeKey.js","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKey.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAKH,kDAA2D;AAqB3D;;;;;;;GAOG;AACH,SAAgB,oBAAoB,CAAC,CAAe,EAAE,CAAe;IACpE,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC;AAFD,oDAEC;AAED;;;;;;GAMG;AACU,QAAA,eAAe,GAAG,UAAU,CAAC;AAE1C;;;;;GAKG;AACU,QAAA,qBAAqB,GAA6B,IAAA,gBAAK,EACnE,oCAAoC,CACpC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { SessionSpaceCompressedId, StableId } from \"@fluidframework/id-compressor\";\n\nimport { TreeNodeSchemaIdentifier } from \"../../core/index.js\";\nimport { Brand, Opaque, brand } from \"../../util/index.js\";\n\n/**\n * A key which uniquely identifies a node in the tree within this session.\n * @remarks {@link LocalNodeKey}s must not be serialized and stored as data without first being converted into a {@link StableNodeKey}.\n * They are local to the current session and equivalent nodes in another session will not necessarily have the same {@link LocalNodeKey}.\n * However, they are otherwise preferential to use over {@link StableNodeKey}s as they are much smaller.\n * For example, they are more efficient than {@link StableNodeKey}s when used as keys in a map.\n * {@link LocalNodeKey}s may be compared or equated via {@link compareLocalNodeKeys}.\n * @internal\n */\nexport interface LocalNodeKey extends Opaque<Brand<SessionSpaceCompressedId, \"Local Node Key\">> {}\n\n/**\n * A UUID which identifies a node in the tree.\n * This key is universally unique and stable forever; therefore it is safe to persist as data in a SharedTree or other DDS/database.\n * When not persisted or serialized, it is preferable to use a {@link LocalNodeKey} instead for better performance.\n * @internal\n */\nexport type StableNodeKey = Brand<StableId, \"Stable Node Key\">;\n\n/**\n * Compares two {@link LocalNodeKey}s.\n * All {@link LocalNodeKey}s retrieved from a single SharedTree client can be totally ordered using this comparator.\n * @param a - the first key to compare\n * @param b - the second key to compare\n * @returns `0` if `a` and `b` are the same key, otherwise `-1` if `a` is ordered before `b` or `1` if `a` is ordered after `b`.\n * @internal\n */\nexport function compareLocalNodeKeys(a: LocalNodeKey, b: LocalNodeKey): -1 | 0 | 1 {\n\treturn a === b ? 0 : a > b ? 1 : -1;\n}\n\n/**\n * The key for the special field for {@link LocalNodeKey}s,\n * which allows nodes to be given keys that can be used to find the nodes via the node key index.\n * @internal\n * @privateRemarks TODO: Come up with a unified and collision-resistant naming schema for fields defined by the system.\n * For now, we'll use `__` to reduce the change of collision, since this is what other internal properties use in Fluid.\n */\nexport const nodeKeyFieldKey = \"__n_id__\";\n\n/**\n * The TreeNodeSchemaIdentifier for node keys.\n * @internal\n * @privateRemarks TODO: Come up with a unified and collision-resistant naming schema for types defined by the system.\n * For now, we'll use `__` to reduce the change of collision, since this is what other internal properties use in Fluid.\n */\nexport const nodeKeyTreeIdentifier: TreeNodeSchemaIdentifier = brand(\n\t\"com.fluidframework.nodeKey.NodeKey\",\n);\n"]}

package/dist/feature-libraries/node-key/nodeKeyIndex.d.ts

@@ -3,7 +3,7 @@
  * Licensed under the MIT License.
  */
 import { FieldKey } from "../../core/index.js";
-import { FlexTreeObjectNode, FlexTreeContext } from "../flex-tree/index.js";
+import { FlexTreeContext, FlexTreeObjectNode } from "../flex-tree/index.js";
 import { FlexTreeSchema } from "../typed-schema/index.js";
 import { LocalNodeKey } from "./nodeKey.js";
 /**
@@ -20,7 +20,7 @@ export declare class NodeKeyIndex implements ReadonlyMap<LocalNodeKey, FlexTreeO
     /**
      * Search the tree for all nodes with keys, and record them in this index for lookup.
      * This should be called each time the tree changes; each call to scan forgets all existing keys.
-     * @param context - the editable tree context in which to search for node keys
+     * @param context - the flex tree context in which to search for node keys
      */
     scanKeys(context: FlexTreeContext): void;
     /**

package/dist/feature-libraries/node-key/nodeKeyIndex.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"nodeKeyIndex.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyIndex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,QAAQ,EAAe,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EACN,kBAAkB,EAClB,eAAe,EAGf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,cAAc,EAAsC,MAAM,0BAA0B,CAAC;AAC9F,OAAO,EAAE,YAAY,EAAyB,MAAM,cAAc,CAAC;AAEnE;;GAEG;AACH,qBAAa,YAAa,YAAW,WAAW,CAAC,YAAY,EAAE,kBAAkB,CAAC;aAKhE,QAAQ,EAAE,QAAQ;IAHnC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwC;gBAG7C,QAAQ,EAAE,QAAQ,EAClC,IAAI,GAAE,QAAQ,CAAC,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAAM;IAKxD;;OAEG;WACW,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO;IASnE;;;;OAIG;IAEI,QAAQ,CAAC,OAAO,EAAE,eAAe,GAAG,IAAI;IAa/C;;OAEG;IACI,KAAK,CAAC,OAAO,EAAE,eAAe,GAAG,YAAY;IAO7C,OAAO,CACb,UAAU,EAAE,CACX,KAAK,EAAE,kBAAkB,EACzB,GAAG,EAAE,YAAY,EACjB,GAAG,EAAE,WAAW,CAAC,YAAY,EAAE,kBAAkB,CAAC,KAC9C,IAAI,EACT,OAAO,CAAC,EAAE,GAAG,GACX,IAAI;IAGA,GAAG,CAAC,GAAG,EAAE,YAAY,GAAG,kBAAkB,GAAG,SAAS;IAGtD,GAAG,CAAC,GAAG,EAAE,YAAY,GAAG,OAAO;IAGtC,IAAW,IAAI,IAAI,MAAM,CAExB;IACM,OAAO,IAAI,gBAAgB,CAAC,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAAC;IAG/D,IAAI,IAAI,gBAAgB,CAAC,YAAY,CAAC;IAGtC,MAAM,IAAI,gBAAgB,CAAC,kBAAkB,CAAC;IAG9C,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAAC;IAKhF,OAAO,CAAE,QAAQ;IAYjB,OAAO,CAAE,eAAe;CAOxB"}
+{"version":3,"file":"nodeKeyIndex.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyIndex.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,QAAQ,EAAe,MAAM,qBAAqB,CAAC;AAC5D,OAAO,EACN,eAAe,EAGf,kBAAkB,EAClB,MAAM,uBAAuB,CAAC;AAC/B,OAAO,EAAE,cAAc,EAAsC,MAAM,0BAA0B,CAAC;AAE9F,OAAO,EAAE,YAAY,EAAyB,MAAM,cAAc,CAAC;AAEnE;;GAEG;AACH,qBAAa,YAAa,YAAW,WAAW,CAAC,YAAY,EAAE,kBAAkB,CAAC;aAKhE,QAAQ,EAAE,QAAQ;IAHnC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAwC;gBAG7C,QAAQ,EAAE,QAAQ,EAClC,IAAI,GAAE,QAAQ,CAAC,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAAM;IAKxD;;OAEG;WACW,oBAAoB,CAAC,MAAM,EAAE,cAAc,GAAG,OAAO;IASnE;;;;OAIG;IAEI,QAAQ,CAAC,OAAO,EAAE,eAAe,GAAG,IAAI;IAa/C;;OAEG;IACI,KAAK,CAAC,OAAO,EAAE,eAAe,GAAG,YAAY;IAO7C,OAAO,CACb,UAAU,EAAE,CACX,KAAK,EAAE,kBAAkB,EACzB,GAAG,EAAE,YAAY,EACjB,GAAG,EAAE,WAAW,CAAC,YAAY,EAAE,kBAAkB,CAAC,KAC9C,IAAI,EACT,OAAO,CAAC,EAAE,GAAG,GACX,IAAI;IAGA,GAAG,CAAC,GAAG,EAAE,YAAY,GAAG,kBAAkB,GAAG,SAAS;IAGtD,GAAG,CAAC,GAAG,EAAE,YAAY,GAAG,OAAO;IAGtC,IAAW,IAAI,IAAI,MAAM,CAExB;IACM,OAAO,IAAI,gBAAgB,CAAC,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAAC;IAG/D,IAAI,IAAI,gBAAgB,CAAC,YAAY,CAAC;IAGtC,MAAM,IAAI,gBAAgB,CAAC,kBAAkB,CAAC;IAG9C,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,gBAAgB,CAAC,CAAC,YAAY,EAAE,kBAAkB,CAAC,CAAC;IAKhF,OAAO,CAAE,QAAQ;IAYjB,OAAO,CAAE,eAAe;CAOxB"}

package/dist/feature-libraries/node-key/nodeKeyIndex.js

@@ -5,7 +5,7 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.NodeKeyIndex = void 0;
-const core_utils_1 = require("@fluidframework/core-utils");
+const internal_1 = require("@fluidframework/core-utils/internal");
 const index_js_1 = require("../../core/index.js");
 const index_js_2 = require("../typed-schema/index.js");
 const nodeKey_js_1 = require("./nodeKey.js");
@@ -31,7 +31,7 @@ class NodeKeyIndex {
     /**
      * Search the tree for all nodes with keys, and record them in this index for lookup.
      * This should be called each time the tree changes; each call to scan forgets all existing keys.
-     * @param context - the editable tree context in which to search for node keys
+     * @param context - the flex tree context in which to search for node keys
      */
     // TODO: This can be optimized by responding to deltas/changes to the tree, rather than rescanning the whole tree every time
     scanKeys(context) {
@@ -41,7 +41,7 @@ class NodeKeyIndex {
                 // TODO:
                 // This invariant (that there is only one node with a given key) is not enforced by tree, so it should not assert.
                 // Multiple nodes (including deleted ones), might occur with the same key.
-                (0, core_utils_1.assert)(!this.nodes.has(id), 0x6e1 /* Encountered duplicate node key */);
+                (0, internal_1.assert)(!this.nodes.has(id), 0x6e1 /* Encountered duplicate node key */);
                 this.nodes.set(id, node);
             }
         }

package/dist/feature-libraries/node-key/nodeKeyIndex.js.map

@@ -1 +1 @@
-{"version":3,"file":"nodeKeyIndex.js","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyIndex.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,kDAA4D;AAO5D,uDAA8F;AAC9F,6CAAmE;AAEnE;;GAEG;AACH,MAAa,YAAY;IAIxB,YACiB,QAAkB,EAClC,OAAqD,EAAE;QADvC,aAAQ,GAAR,QAAQ,CAAU;QAGlC,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAsB;QACxD,gGAAgG;QAChG,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,kCAAqB,CAAC,CAAC;QAChE,IAAI,CAAC,CAAC,UAAU,YAAY,yBAAc,CAAC,EAAE;YAC5C,OAAO,KAAK,CAAC;SACb;QACD,OAAO,UAAU,CAAC,SAAS,KAAK,sBAAW,CAAC,MAAM,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACH,4HAA4H;IACrH,QAAQ,CAAC,OAAwB;QACvC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,YAAY,CAAC,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACtD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC5D,QAAQ;gBACR,kHAAkH;gBAClH,0EAA0E;gBAC1E,IAAA,mBAAM,EAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;gBACxE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;aACzB;SACD;IACF,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,OAAwB;QACpC,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnD,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC7B,OAAO,UAAU,CAAC;IACnB,CAAC;IAED,gCAAgC;IACzB,OAAO,CACb,UAIS,EACT,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IACM,GAAG,CAAC,GAAiB;QAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IACM,GAAG,CAAC,GAAiB;QAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACxB,CAAC;IACM,OAAO;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IACM,IAAI;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC1B,CAAC;IACM,MAAM;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IACM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACtC,CAAC;IACD,mCAAmC;IAE3B,CAAC,QAAQ,CAAC,IAAkB;QACnC,IAAI,IAAA,6BAAkB,EAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACpC,MAAM,GAAG,GAAI,IAA2B,CAAC,YAAY,CAAC;YACtD,IAAI,GAAG,KAAK,SAAS,EAAE;gBACtB,MAAM,CAAC,GAAG,EAAE,IAA0B,CAAC,CAAC;aACxC;SACD;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE;YACrC,KAAK,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;SAC/B;IACF,CAAC;IAEO,CAAC,eAAe,CACvB,CAAgB;QAEhB,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,aAAa,EAAE,EAAE;YACtC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;SAC5B;IACF,CAAC;CACD;AAxGD,oCAwGC","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 { FieldKey, ValueSchema } from \"../../core/index.js\";\nimport {\n\tFlexTreeObjectNode,\n\tFlexTreeContext,\n\tFlexTreeField,\n\tFlexTreeNode,\n} from \"../flex-tree/index.js\";\nimport { FlexTreeSchema, LeafNodeSchema, schemaIsObjectNode } from \"../typed-schema/index.js\";\nimport { LocalNodeKey, nodeKeyTreeIdentifier } from \"./nodeKey.js\";\n\n/**\n * The node key index records nodes with {@link LocalNodeKey}s and allows them to be looked up by key.\n */\nexport class NodeKeyIndex implements ReadonlyMap<LocalNodeKey, FlexTreeObjectNode> {\n\t// TODO: The data structure that holds the nodes can likely be optimized to better support cloning\n\tprivate readonly nodes: Map<LocalNodeKey, FlexTreeObjectNode>;\n\n\tpublic constructor(\n\t\tpublic readonly fieldKey: FieldKey,\n\t\tkeys: Iterable<[LocalNodeKey, FlexTreeObjectNode]> = [],\n\t) {\n\t\tthis.nodes = new Map(keys);\n\t}\n\n\t/**\n\t * Returns true if the given schema contains the node key type, otherwise false\n\t */\n\tpublic static hasNodeKeyTreeSchema(schema: FlexTreeSchema): boolean {\n\t\t// TODO: make TreeStoredSchema contain ViewSchema and compare by reference to nodeKeyTreeSchema.\n\t\tconst treeSchema = schema.nodeSchema.get(nodeKeyTreeIdentifier);\n\t\tif (!(treeSchema instanceof LeafNodeSchema)) {\n\t\t\treturn false;\n\t\t}\n\t\treturn treeSchema.leafValue === ValueSchema.String;\n\t}\n\n\t/**\n\t * Search the tree for all nodes with keys, and record them in this index for lookup.\n\t * This should be called each time the tree changes; each call to scan forgets all existing keys.\n\t * @param context - the editable tree context in which to search for node keys\n\t */\n\t// TODO: This can be optimized by responding to deltas/changes to the tree, rather than rescanning the whole tree every time\n\tpublic scanKeys(context: FlexTreeContext): void {\n\t\tthis.nodes.clear();\n\t\tif (NodeKeyIndex.hasNodeKeyTreeSchema(context.schema)) {\n\t\t\tfor (const [id, node] of this.findKeysInField(context.root)) {\n\t\t\t\t// TODO:\n\t\t\t\t// This invariant (that there is only one node with a given key) is not enforced by tree, so it should not assert.\n\t\t\t\t// Multiple nodes (including deleted ones), might occur with the same key.\n\t\t\t\tassert(!this.nodes.has(id), 0x6e1 /* Encountered duplicate node key */);\n\t\t\t\tthis.nodes.set(id, node);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Create a copy of this index which can be mutated without affecting this one.\n\t */\n\tpublic clone(context: FlexTreeContext): NodeKeyIndex {\n\t\tconst indexClone = new NodeKeyIndex(this.fieldKey);\n\t\tindexClone.scanKeys(context);\n\t\treturn indexClone;\n\t}\n\n\t// #region ReadonlyMap interface\n\tpublic forEach(\n\t\tcallbackfn: (\n\t\t\tvalue: FlexTreeObjectNode,\n\t\t\tkey: LocalNodeKey,\n\t\t\tmap: ReadonlyMap<LocalNodeKey, FlexTreeObjectNode>,\n\t\t) => void,\n\t\tthisArg?: any,\n\t): void {\n\t\treturn this.nodes.forEach(callbackfn, thisArg);\n\t}\n\tpublic get(key: LocalNodeKey): FlexTreeObjectNode | undefined {\n\t\treturn this.nodes.get(key);\n\t}\n\tpublic has(key: LocalNodeKey): boolean {\n\t\treturn this.nodes.has(key);\n\t}\n\tpublic get size(): number {\n\t\treturn this.nodes.size;\n\t}\n\tpublic entries(): IterableIterator<[LocalNodeKey, FlexTreeObjectNode]> {\n\t\treturn this.nodes.entries();\n\t}\n\tpublic keys(): IterableIterator<LocalNodeKey> {\n\t\treturn this.nodes.keys();\n\t}\n\tpublic values(): IterableIterator<FlexTreeObjectNode> {\n\t\treturn this.nodes.values();\n\t}\n\tpublic [Symbol.iterator](): IterableIterator<[LocalNodeKey, FlexTreeObjectNode]> {\n\t\treturn this.nodes[Symbol.iterator]();\n\t}\n\t// #endregion ReadonlyMap interface\n\n\tprivate *findKeys(node: FlexTreeNode): Iterable<[key: LocalNodeKey, node: FlexTreeObjectNode]> {\n\t\tif (schemaIsObjectNode(node.schema)) {\n\t\t\tconst key = (node as FlexTreeObjectNode).localNodeKey;\n\t\t\tif (key !== undefined) {\n\t\t\t\tyield [key, node as FlexTreeObjectNode];\n\t\t\t}\n\t\t}\n\t\tfor (const f of node.boxedIterator()) {\n\t\t\tyield* this.findKeysInField(f);\n\t\t}\n\t}\n\n\tprivate *findKeysInField(\n\t\tf: FlexTreeField,\n\t): Iterable<[key: LocalNodeKey, node: FlexTreeObjectNode]> {\n\t\tfor (const child of f.boxedIterator()) {\n\t\t\tyield* this.findKeys(child);\n\t\t}\n\t}\n}\n"]}
+{"version":3,"file":"nodeKeyIndex.js","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyIndex.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAE7D,kDAA4D;AAO5D,uDAA8F;AAE9F,6CAAmE;AAEnE;;GAEG;AACH,MAAa,YAAY;IAIxB,YACiB,QAAkB,EAClC,OAAqD,EAAE;QADvC,aAAQ,GAAR,QAAQ,CAAU;QAGlC,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAsB;QACxD,gGAAgG;QAChG,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,kCAAqB,CAAC,CAAC;QAChE,IAAI,CAAC,CAAC,UAAU,YAAY,yBAAc,CAAC,EAAE;YAC5C,OAAO,KAAK,CAAC;SACb;QACD,OAAO,UAAU,CAAC,SAAS,KAAK,sBAAW,CAAC,MAAM,CAAC;IACpD,CAAC;IAED;;;;OAIG;IACH,4HAA4H;IACrH,QAAQ,CAAC,OAAwB;QACvC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,YAAY,CAAC,oBAAoB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YACtD,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBAC5D,QAAQ;gBACR,kHAAkH;gBAClH,0EAA0E;gBAC1E,IAAA,iBAAM,EAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,oCAAoC,CAAC,CAAC;gBACxE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;aACzB;SACD;IACF,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,OAAwB;QACpC,MAAM,UAAU,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnD,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC7B,OAAO,UAAU,CAAC;IACnB,CAAC;IAED,gCAAgC;IACzB,OAAO,CACb,UAIS,EACT,OAAa;QAEb,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IACM,GAAG,CAAC,GAAiB;QAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IACM,GAAG,CAAC,GAAiB;QAC3B,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACxB,CAAC;IACM,OAAO;QACb,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;IAC7B,CAAC;IACM,IAAI;QACV,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC1B,CAAC;IACM,MAAM;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IACM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACtC,CAAC;IACD,mCAAmC;IAE3B,CAAC,QAAQ,CAAC,IAAkB;QACnC,IAAI,IAAA,6BAAkB,EAAC,IAAI,CAAC,MAAM,CAAC,EAAE;YACpC,MAAM,GAAG,GAAI,IAA2B,CAAC,YAAY,CAAC;YACtD,IAAI,GAAG,KAAK,SAAS,EAAE;gBACtB,MAAM,CAAC,GAAG,EAAE,IAA0B,CAAC,CAAC;aACxC;SACD;QACD,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,EAAE;YACrC,KAAK,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;SAC/B;IACF,CAAC;IAEO,CAAC,eAAe,CACvB,CAAgB;QAEhB,KAAK,MAAM,KAAK,IAAI,CAAC,CAAC,aAAa,EAAE,EAAE;YACtC,KAAK,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;SAC5B;IACF,CAAC;CACD;AAxGD,oCAwGC","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 { FieldKey, ValueSchema } from \"../../core/index.js\";\nimport {\n\tFlexTreeContext,\n\tFlexTreeField,\n\tFlexTreeNode,\n\tFlexTreeObjectNode,\n} from \"../flex-tree/index.js\";\nimport { FlexTreeSchema, LeafNodeSchema, schemaIsObjectNode } from \"../typed-schema/index.js\";\n\nimport { LocalNodeKey, nodeKeyTreeIdentifier } from \"./nodeKey.js\";\n\n/**\n * The node key index records nodes with {@link LocalNodeKey}s and allows them to be looked up by key.\n */\nexport class NodeKeyIndex implements ReadonlyMap<LocalNodeKey, FlexTreeObjectNode> {\n\t// TODO: The data structure that holds the nodes can likely be optimized to better support cloning\n\tprivate readonly nodes: Map<LocalNodeKey, FlexTreeObjectNode>;\n\n\tpublic constructor(\n\t\tpublic readonly fieldKey: FieldKey,\n\t\tkeys: Iterable<[LocalNodeKey, FlexTreeObjectNode]> = [],\n\t) {\n\t\tthis.nodes = new Map(keys);\n\t}\n\n\t/**\n\t * Returns true if the given schema contains the node key type, otherwise false\n\t */\n\tpublic static hasNodeKeyTreeSchema(schema: FlexTreeSchema): boolean {\n\t\t// TODO: make TreeStoredSchema contain ViewSchema and compare by reference to nodeKeyTreeSchema.\n\t\tconst treeSchema = schema.nodeSchema.get(nodeKeyTreeIdentifier);\n\t\tif (!(treeSchema instanceof LeafNodeSchema)) {\n\t\t\treturn false;\n\t\t}\n\t\treturn treeSchema.leafValue === ValueSchema.String;\n\t}\n\n\t/**\n\t * Search the tree for all nodes with keys, and record them in this index for lookup.\n\t * This should be called each time the tree changes; each call to scan forgets all existing keys.\n\t * @param context - the flex tree context in which to search for node keys\n\t */\n\t// TODO: This can be optimized by responding to deltas/changes to the tree, rather than rescanning the whole tree every time\n\tpublic scanKeys(context: FlexTreeContext): void {\n\t\tthis.nodes.clear();\n\t\tif (NodeKeyIndex.hasNodeKeyTreeSchema(context.schema)) {\n\t\t\tfor (const [id, node] of this.findKeysInField(context.root)) {\n\t\t\t\t// TODO:\n\t\t\t\t// This invariant (that there is only one node with a given key) is not enforced by tree, so it should not assert.\n\t\t\t\t// Multiple nodes (including deleted ones), might occur with the same key.\n\t\t\t\tassert(!this.nodes.has(id), 0x6e1 /* Encountered duplicate node key */);\n\t\t\t\tthis.nodes.set(id, node);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Create a copy of this index which can be mutated without affecting this one.\n\t */\n\tpublic clone(context: FlexTreeContext): NodeKeyIndex {\n\t\tconst indexClone = new NodeKeyIndex(this.fieldKey);\n\t\tindexClone.scanKeys(context);\n\t\treturn indexClone;\n\t}\n\n\t// #region ReadonlyMap interface\n\tpublic forEach(\n\t\tcallbackfn: (\n\t\t\tvalue: FlexTreeObjectNode,\n\t\t\tkey: LocalNodeKey,\n\t\t\tmap: ReadonlyMap<LocalNodeKey, FlexTreeObjectNode>,\n\t\t) => void,\n\t\tthisArg?: any,\n\t): void {\n\t\treturn this.nodes.forEach(callbackfn, thisArg);\n\t}\n\tpublic get(key: LocalNodeKey): FlexTreeObjectNode | undefined {\n\t\treturn this.nodes.get(key);\n\t}\n\tpublic has(key: LocalNodeKey): boolean {\n\t\treturn this.nodes.has(key);\n\t}\n\tpublic get size(): number {\n\t\treturn this.nodes.size;\n\t}\n\tpublic entries(): IterableIterator<[LocalNodeKey, FlexTreeObjectNode]> {\n\t\treturn this.nodes.entries();\n\t}\n\tpublic keys(): IterableIterator<LocalNodeKey> {\n\t\treturn this.nodes.keys();\n\t}\n\tpublic values(): IterableIterator<FlexTreeObjectNode> {\n\t\treturn this.nodes.values();\n\t}\n\tpublic [Symbol.iterator](): IterableIterator<[LocalNodeKey, FlexTreeObjectNode]> {\n\t\treturn this.nodes[Symbol.iterator]();\n\t}\n\t// #endregion ReadonlyMap interface\n\n\tprivate *findKeys(node: FlexTreeNode): Iterable<[key: LocalNodeKey, node: FlexTreeObjectNode]> {\n\t\tif (schemaIsObjectNode(node.schema)) {\n\t\t\tconst key = (node as FlexTreeObjectNode).localNodeKey;\n\t\t\tif (key !== undefined) {\n\t\t\t\tyield [key, node as FlexTreeObjectNode];\n\t\t\t}\n\t\t}\n\t\tfor (const f of node.boxedIterator()) {\n\t\t\tyield* this.findKeysInField(f);\n\t\t}\n\t}\n\n\tprivate *findKeysInField(\n\t\tf: FlexTreeField,\n\t): Iterable<[key: LocalNodeKey, node: FlexTreeObjectNode]> {\n\t\tfor (const child of f.boxedIterator()) {\n\t\t\tyield* this.findKeys(child);\n\t\t}\n\t}\n}\n"]}

package/dist/feature-libraries/node-key/nodeKeyManager.d.ts

@@ -2,8 +2,8 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { IIdCompressor } from "@fluidframework/id-compressor";
-import { StableNodeKey, LocalNodeKey } from "./nodeKey.js";
+import { IIdCompressor } from "@fluidframework/id-compressor/internal";
+import { LocalNodeKey, StableNodeKey } from "./nodeKey.js";
 /**
  * An object which handles the generation of node keys as well as conversion between their two types ({@link StableNodeKey} and {@link LocalNodeKey}).
  */

package/dist/feature-libraries/node-key/nodeKeyManager.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"nodeKeyManager.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAEN,aAAa,EAGb,MAAM,+BAA+B,CAAC;AAEvC,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,cAAc;IAC9B;;OAEG;IACH,oBAAoB,IAAI,YAAY,CAAC;IAErC;;OAEG;IACH,eAAe,CAAC,GAAG,EAAE,aAAa,GAAG,YAAY,CAAC;IAElD;;OAEG;IACH,gBAAgB,CAAC,GAAG,EAAE,YAAY,GAAG,aAAa,CAAC;CACnD;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,YAAY,CAAC,EAAE,aAAa,GAAG,SAAS,GAAG,cAAc,CA6B7F;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,IAAI,cAAc,CAEzD"}
+{"version":3,"file":"nodeKeyManager.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyManager.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,aAAa,EAIb,MAAM,wCAAwC,CAAC;AAIhD,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAE3D;;GAEG;AACH,MAAM,WAAW,cAAc;IAC9B;;OAEG;IACH,oBAAoB,IAAI,YAAY,CAAC;IAErC;;OAEG;IACH,eAAe,CAAC,GAAG,EAAE,aAAa,GAAG,YAAY,CAAC;IAElD;;OAEG;IACH,gBAAgB,CAAC,GAAG,EAAE,YAAY,GAAG,aAAa,CAAC;CACnD;AAED;;;;GAIG;AACH,wBAAgB,oBAAoB,CAAC,YAAY,CAAC,EAAE,aAAa,GAAG,SAAS,GAAG,cAAc,CA6B7F;AAED;;;;GAIG;AACH,wBAAgB,wBAAwB,IAAI,cAAc,CAEzD"}

package/dist/feature-libraries/node-key/nodeKeyManager.js

@@ -5,8 +5,8 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.createMockNodeKeyManager = exports.createNodeKeyManager = void 0;
-const core_utils_1 = require("@fluidframework/core-utils");
-const id_compressor_1 = require("@fluidframework/id-compressor");
+const internal_1 = require("@fluidframework/core-utils/internal");
+const internal_2 = require("@fluidframework/id-compressor/internal");
 const index_js_1 = require("../../util/index.js");
 /**
  * Creates a {@link NodeKeyManager} from the given {@link IIdCompressor}.
@@ -16,18 +16,18 @@ const index_js_1 = require("../../util/index.js");
 function createNodeKeyManager(idCompressor) {
     return {
         generateLocalNodeKey: () => {
-            (0, core_utils_1.assert)(idCompressor !== undefined, 0x6e4 /* Runtime IdCompressor must be available to generate local node keys */);
+            (0, internal_1.assert)(idCompressor !== undefined, 0x6e4 /* Runtime IdCompressor must be available to generate local node keys */);
             return (0, index_js_1.brand)(idCompressor.generateCompressedId());
         },
         localizeNodeKey: (key) => {
-            (0, core_utils_1.assert)(idCompressor !== undefined, 0x6e5 /* Runtime IdCompressor must be available to convert node keys */);
+            (0, internal_1.assert)(idCompressor !== undefined, 0x6e5 /* Runtime IdCompressor must be available to convert node keys */);
             return (0, index_js_1.brand)(idCompressor.recompress(key));
         },
         stabilizeNodeKey: (key) => {
-            (0, core_utils_1.assert)(idCompressor !== undefined, 0x6e6 /* Runtime IdCompressor must be available to convert node keys */);
+            (0, internal_1.assert)(idCompressor !== undefined, 0x6e6 /* Runtime IdCompressor must be available to convert node keys */);
             return (0, index_js_1.brand)(
             // TODO: The assert below is required for type safety but is maybe slow
-            (0, id_compressor_1.assertIsStableId)(idCompressor.decompress((0, index_js_1.extractFromOpaque)(key))));
+            (0, internal_2.assertIsStableId)(idCompressor.decompress((0, index_js_1.extractFromOpaque)(key))));
         },
     };
 }
@@ -58,9 +58,9 @@ class MockNodeKeyManager {
         return (0, index_js_1.brand)(this.createMockStableId((0, index_js_1.extractFromOpaque)(key)));
     }
     createMockStableId(offset) {
-        (0, core_utils_1.assert)(offset >= 0, 0x6e7 /* UUID offset may not be negative */);
-        (0, core_utils_1.assert)(offset < 281474976710656, 0x6e8 /* UUID offset must be at most 16^12 */);
-        return (0, id_compressor_1.assertIsStableId)(`a110ca7e-add1-4000-8000-${Math.round(offset).toString(16).padStart(12, "0")}`);
+        (0, internal_1.assert)(offset >= 0, 0x6e7 /* UUID offset may not be negative */);
+        (0, internal_1.assert)(offset < 281474976710656, 0x6e8 /* UUID offset must be at most 16^12 */);
+        return (0, internal_2.assertIsStableId)(`a110ca7e-add1-4000-8000-${Math.round(offset).toString(16).padStart(12, "0")}`);
     }
 }
 //# sourceMappingURL=nodeKeyManager.js.map

package/dist/feature-libraries/node-key/nodeKeyManager.js.map

@@ -1 +1 @@
-{"version":3,"file":"nodeKeyManager.js","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyManager.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,iEAKuC;AACvC,kDAA+D;AAuB/D;;;;GAIG;AACH,SAAgB,oBAAoB,CAAC,YAAwC;IAC5E,OAAO;QACN,oBAAoB,EAAE,GAAG,EAAE;YAC1B,IAAA,mBAAM,EACL,YAAY,KAAK,SAAS,EAC1B,KAAK,CAAC,wEAAwE,CAC9E,CAAC;YACF,OAAO,IAAA,gBAAK,EAAC,YAAY,CAAC,oBAAoB,EAAE,CAAC,CAAC;QACnD,CAAC;QAED,eAAe,EAAE,CAAC,GAAkB,EAAE,EAAE;YACvC,IAAA,mBAAM,EACL,YAAY,KAAK,SAAS,EAC1B,KAAK,CAAC,iEAAiE,CACvE,CAAC;YACF,OAAO,IAAA,gBAAK,EAAC,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,CAAC;QAED,gBAAgB,EAAE,CAAC,GAAiB,EAAE,EAAE;YACvC,IAAA,mBAAM,EACL,YAAY,KAAK,SAAS,EAC1B,KAAK,CAAC,iEAAiE,CACvE,CAAC;YACF,OAAO,IAAA,gBAAK;YACX,uEAAuE;YACvE,IAAA,gCAAgB,EAAC,YAAY,CAAC,UAAU,CAAC,IAAA,4BAAiB,EAAC,GAAG,CAAC,CAAC,CAAC,CACjE,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC;AA7BD,oDA6BC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB;IACvC,OAAO,IAAI,kBAAkB,EAAE,CAAC;AACjC,CAAC;AAFD,4DAEC;AAED,MAAM,kBAAkB;IAAxB;QACS,UAAK,GAAG,CAAC,CAAC;IAyBnB,CAAC;IAvBO,qBAAqB;QAC3B,OAAO,IAAA,gBAAK,EAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAEM,oBAAoB;QAC1B,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAC3D,CAAC;IAEM,eAAe,CAAC,GAAkB;QACxC,OAAO,IAAA,gBAAK,EAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,CAA6B,CAAC,CAAC;IAClF,CAAC;IAEM,gBAAgB,CAAC,GAAiB;QACxC,OAAO,IAAA,gBAAK,EAAC,IAAI,CAAC,kBAAkB,CAAC,IAAA,4BAAiB,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAEO,kBAAkB,CAAC,MAAc;QACxC,IAAA,mBAAM,EAAC,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACjE,IAAA,mBAAM,EAAC,MAAM,GAAG,eAAmB,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACpF,OAAO,IAAA,gCAAgB,EACtB,2BAA2B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAC9E,CAAC;IACH,CAAC;CACD","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\tassertIsStableId,\n\tIIdCompressor,\n\tSessionSpaceCompressedId,\n\tStableId,\n} from \"@fluidframework/id-compressor\";\nimport { brand, extractFromOpaque } from \"../../util/index.js\";\nimport { StableNodeKey, LocalNodeKey } from \"./nodeKey.js\";\n\n/**\n * An object which handles the generation of node keys as well as conversion between their two types ({@link StableNodeKey} and {@link LocalNodeKey}).\n */\nexport interface NodeKeyManager {\n\t/**\n\t * Generate a {@link StableNodeKey}.\n\t */\n\tgenerateLocalNodeKey(): LocalNodeKey;\n\n\t/**\n\t * Convert the given {@link StableNodeKey} into its {@link LocalNodeKey} form.\n\t */\n\tlocalizeNodeKey(key: StableNodeKey): LocalNodeKey;\n\n\t/**\n\t * Convert the given {@link LocalNodeKey} into its {@link StableNodeKey} form.\n\t */\n\tstabilizeNodeKey(key: LocalNodeKey): StableNodeKey;\n}\n\n/**\n * Creates a {@link NodeKeyManager} from the given {@link IIdCompressor}.\n * @param idCompressor - the compressor to use for key generation, compression, and decompression.\n * If undefined, then attempts to generate or convert keys will throw an error.\n */\nexport function createNodeKeyManager(idCompressor?: IIdCompressor | undefined): NodeKeyManager {\n\treturn {\n\t\tgenerateLocalNodeKey: () => {\n\t\t\tassert(\n\t\t\t\tidCompressor !== undefined,\n\t\t\t\t0x6e4 /* Runtime IdCompressor must be available to generate local node keys */,\n\t\t\t);\n\t\t\treturn brand(idCompressor.generateCompressedId());\n\t\t},\n\n\t\tlocalizeNodeKey: (key: StableNodeKey) => {\n\t\t\tassert(\n\t\t\t\tidCompressor !== undefined,\n\t\t\t\t0x6e5 /* Runtime IdCompressor must be available to convert node keys */,\n\t\t\t);\n\t\t\treturn brand(idCompressor.recompress(key));\n\t\t},\n\n\t\tstabilizeNodeKey: (key: LocalNodeKey) => {\n\t\t\tassert(\n\t\t\t\tidCompressor !== undefined,\n\t\t\t\t0x6e6 /* Runtime IdCompressor must be available to convert node keys */,\n\t\t\t);\n\t\t\treturn brand(\n\t\t\t\t// TODO: The assert below is required for type safety but is maybe slow\n\t\t\t\tassertIsStableId(idCompressor.decompress(extractFromOpaque(key))),\n\t\t\t);\n\t\t},\n\t};\n}\n\n/**\n * Create a {@link NodeKeyManager} that generates deterministic {@link StableNodeKey}s and {@link LocalNodeKey}s.\n * @remarks This is useful for test environments because it will always yield the same keys in the same order.\n * It should not be used for production environments for the same reason; the {@link StableNodeKey}s are not universally unique.\n */\nexport function createMockNodeKeyManager(): NodeKeyManager {\n\treturn new MockNodeKeyManager();\n}\n\nclass MockNodeKeyManager implements NodeKeyManager {\n\tprivate count = 0;\n\n\tpublic generateStableNodeKey(): StableNodeKey {\n\t\treturn brand(this.createMockStableId(this.count++));\n\t}\n\n\tpublic generateLocalNodeKey(): LocalNodeKey {\n\t\treturn this.localizeNodeKey(this.generateStableNodeKey());\n\t}\n\n\tpublic localizeNodeKey(key: StableNodeKey): LocalNodeKey {\n\t\treturn brand(Number.parseInt(key.substring(30), 16) as SessionSpaceCompressedId);\n\t}\n\n\tpublic stabilizeNodeKey(key: LocalNodeKey): StableNodeKey {\n\t\treturn brand(this.createMockStableId(extractFromOpaque(key)));\n\t}\n\n\tprivate createMockStableId(offset: number): StableId {\n\t\tassert(offset >= 0, 0x6e7 /* UUID offset may not be negative */);\n\t\tassert(offset < 281_474_976_710_656, 0x6e8 /* UUID offset must be at most 16^12 */);\n\t\treturn assertIsStableId(\n\t\t\t`a110ca7e-add1-4000-8000-${Math.round(offset).toString(16).padStart(12, \"0\")}`,\n\t\t);\n\t}\n}\n"]}
+{"version":3,"file":"nodeKeyManager.js","sourceRoot":"","sources":["../../../src/feature-libraries/node-key/nodeKeyManager.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAC7D,qEAKgD;AAEhD,kDAA+D;AAwB/D;;;;GAIG;AACH,SAAgB,oBAAoB,CAAC,YAAwC;IAC5E,OAAO;QACN,oBAAoB,EAAE,GAAG,EAAE;YAC1B,IAAA,iBAAM,EACL,YAAY,KAAK,SAAS,EAC1B,KAAK,CAAC,wEAAwE,CAC9E,CAAC;YACF,OAAO,IAAA,gBAAK,EAAC,YAAY,CAAC,oBAAoB,EAAE,CAAC,CAAC;QACnD,CAAC;QAED,eAAe,EAAE,CAAC,GAAkB,EAAE,EAAE;YACvC,IAAA,iBAAM,EACL,YAAY,KAAK,SAAS,EAC1B,KAAK,CAAC,iEAAiE,CACvE,CAAC;YACF,OAAO,IAAA,gBAAK,EAAC,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,CAAC;QAED,gBAAgB,EAAE,CAAC,GAAiB,EAAE,EAAE;YACvC,IAAA,iBAAM,EACL,YAAY,KAAK,SAAS,EAC1B,KAAK,CAAC,iEAAiE,CACvE,CAAC;YACF,OAAO,IAAA,gBAAK;YACX,uEAAuE;YACvE,IAAA,2BAAgB,EAAC,YAAY,CAAC,UAAU,CAAC,IAAA,4BAAiB,EAAC,GAAG,CAAC,CAAC,CAAC,CACjE,CAAC;QACH,CAAC;KACD,CAAC;AACH,CAAC;AA7BD,oDA6BC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB;IACvC,OAAO,IAAI,kBAAkB,EAAE,CAAC;AACjC,CAAC;AAFD,4DAEC;AAED,MAAM,kBAAkB;IAAxB;QACS,UAAK,GAAG,CAAC,CAAC;IAyBnB,CAAC;IAvBO,qBAAqB;QAC3B,OAAO,IAAA,gBAAK,EAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAEM,oBAAoB;QAC1B,OAAO,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;IAC3D,CAAC;IAEM,eAAe,CAAC,GAAkB;QACxC,OAAO,IAAA,gBAAK,EAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,EAAE,CAA6B,CAAC,CAAC;IAClF,CAAC;IAEM,gBAAgB,CAAC,GAAiB;QACxC,OAAO,IAAA,gBAAK,EAAC,IAAI,CAAC,kBAAkB,CAAC,IAAA,4BAAiB,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/D,CAAC;IAEO,kBAAkB,CAAC,MAAc;QACxC,IAAA,iBAAM,EAAC,MAAM,IAAI,CAAC,EAAE,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACjE,IAAA,iBAAM,EAAC,MAAM,GAAG,eAAmB,EAAE,KAAK,CAAC,uCAAuC,CAAC,CAAC;QACpF,OAAO,IAAA,2BAAgB,EACtB,2BAA2B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,CAC9E,CAAC;IACH,CAAC;CACD","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 {\n\tIIdCompressor,\n\tSessionSpaceCompressedId,\n\tStableId,\n\tassertIsStableId,\n} from \"@fluidframework/id-compressor/internal\";\n\nimport { brand, extractFromOpaque } from \"../../util/index.js\";\n\nimport { LocalNodeKey, StableNodeKey } from \"./nodeKey.js\";\n\n/**\n * An object which handles the generation of node keys as well as conversion between their two types ({@link StableNodeKey} and {@link LocalNodeKey}).\n */\nexport interface NodeKeyManager {\n\t/**\n\t * Generate a {@link StableNodeKey}.\n\t */\n\tgenerateLocalNodeKey(): LocalNodeKey;\n\n\t/**\n\t * Convert the given {@link StableNodeKey} into its {@link LocalNodeKey} form.\n\t */\n\tlocalizeNodeKey(key: StableNodeKey): LocalNodeKey;\n\n\t/**\n\t * Convert the given {@link LocalNodeKey} into its {@link StableNodeKey} form.\n\t */\n\tstabilizeNodeKey(key: LocalNodeKey): StableNodeKey;\n}\n\n/**\n * Creates a {@link NodeKeyManager} from the given {@link IIdCompressor}.\n * @param idCompressor - the compressor to use for key generation, compression, and decompression.\n * If undefined, then attempts to generate or convert keys will throw an error.\n */\nexport function createNodeKeyManager(idCompressor?: IIdCompressor | undefined): NodeKeyManager {\n\treturn {\n\t\tgenerateLocalNodeKey: () => {\n\t\t\tassert(\n\t\t\t\tidCompressor !== undefined,\n\t\t\t\t0x6e4 /* Runtime IdCompressor must be available to generate local node keys */,\n\t\t\t);\n\t\t\treturn brand(idCompressor.generateCompressedId());\n\t\t},\n\n\t\tlocalizeNodeKey: (key: StableNodeKey) => {\n\t\t\tassert(\n\t\t\t\tidCompressor !== undefined,\n\t\t\t\t0x6e5 /* Runtime IdCompressor must be available to convert node keys */,\n\t\t\t);\n\t\t\treturn brand(idCompressor.recompress(key));\n\t\t},\n\n\t\tstabilizeNodeKey: (key: LocalNodeKey) => {\n\t\t\tassert(\n\t\t\t\tidCompressor !== undefined,\n\t\t\t\t0x6e6 /* Runtime IdCompressor must be available to convert node keys */,\n\t\t\t);\n\t\t\treturn brand(\n\t\t\t\t// TODO: The assert below is required for type safety but is maybe slow\n\t\t\t\tassertIsStableId(idCompressor.decompress(extractFromOpaque(key))),\n\t\t\t);\n\t\t},\n\t};\n}\n\n/**\n * Create a {@link NodeKeyManager} that generates deterministic {@link StableNodeKey}s and {@link LocalNodeKey}s.\n * @remarks This is useful for test environments because it will always yield the same keys in the same order.\n * It should not be used for production environments for the same reason; the {@link StableNodeKey}s are not universally unique.\n */\nexport function createMockNodeKeyManager(): NodeKeyManager {\n\treturn new MockNodeKeyManager();\n}\n\nclass MockNodeKeyManager implements NodeKeyManager {\n\tprivate count = 0;\n\n\tpublic generateStableNodeKey(): StableNodeKey {\n\t\treturn brand(this.createMockStableId(this.count++));\n\t}\n\n\tpublic generateLocalNodeKey(): LocalNodeKey {\n\t\treturn this.localizeNodeKey(this.generateStableNodeKey());\n\t}\n\n\tpublic localizeNodeKey(key: StableNodeKey): LocalNodeKey {\n\t\treturn brand(Number.parseInt(key.substring(30), 16) as SessionSpaceCompressedId);\n\t}\n\n\tpublic stabilizeNodeKey(key: LocalNodeKey): StableNodeKey {\n\t\treturn brand(this.createMockStableId(extractFromOpaque(key)));\n\t}\n\n\tprivate createMockStableId(offset: number): StableId {\n\t\tassert(offset >= 0, 0x6e7 /* UUID offset may not be negative */);\n\t\tassert(offset < 281_474_976_710_656, 0x6e8 /* UUID offset must be at most 16^12 */);\n\t\treturn assertIsStableId(\n\t\t\t`a110ca7e-add1-4000-8000-${Math.round(offset).toString(16).padStart(12, \"0\")}`,\n\t\t);\n\t}\n}\n"]}

package/dist/feature-libraries/object-forest/objectForest.d.ts

@@ -2,7 +2,7 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { ITreeSubscriptionCursor, IEditableForest, ITreeSubscriptionCursorState, TreeNavigationResult, TreeStoredSchemaSubscription, FieldKey, DetachedField, AnchorSet, UpPath, Anchor, CursorLocationType, TreeNodeSchemaIdentifier, MapTree, FieldAnchor, FieldUpPath, ForestEvents, PathRootPrefix, DeltaVisitor, Value, ITreeCursorSynchronous } from "../../core/index.js";
+import { Anchor, AnchorSet, CursorLocationType, DeltaVisitor, DetachedField, FieldAnchor, FieldKey, FieldUpPath, ForestEvents, IEditableForest, ITreeCursorSynchronous, ITreeSubscriptionCursor, ITreeSubscriptionCursorState, MapTree, PathRootPrefix, TreeNavigationResult, TreeNodeSchemaIdentifier, TreeStoredSchemaSubscription, UpPath, Value } from "../../core/index.js";
 import { CursorWithNode, SynchronousCursor } from "../treeCursorUtils.js";
 /**
  * Reference implementation of IEditableForest.

package/dist/feature-libraries/object-forest/objectForest.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"objectForest.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/object-forest/objectForest.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,uBAAuB,EACvB,eAAe,EACf,4BAA4B,EAC5B,oBAAoB,EACpB,4BAA4B,EAC5B,QAAQ,EACR,aAAa,EACb,SAAS,EACT,MAAM,EACN,MAAM,EAEN,kBAAkB,EAClB,wBAAwB,EACxB,OAAO,EAEP,WAAW,EACX,WAAW,EACX,YAAY,EACZ,cAAc,EACd,YAAY,EAGZ,KAAK,EACL,sBAAsB,EAGtB,MAAM,qBAAqB,CAAC;AAQ7B,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAW1E;;;;;GAKG;AACH,qBAAa,YAAa,YAAW,eAAe;aAUhB,OAAO,EAAE,SAAS;IATrD,OAAO,CAAC,aAAa,CAAC,CAAe;IAErC,SAAgB,KAAK,EAAE,OAAO,CAAc;IAG5C,SAAgB,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAExD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAiC;gBAErB,OAAO,GAAE,SAA2B;IAEvE,IAAW,OAAO,IAAI,OAAO,CAE5B;IAEM,EAAE,CAAC,CAAC,SAAS,MAAM,YAAY,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI;IAIrF,KAAK,CAAC,CAAC,EAAE,4BAA4B,EAAE,OAAO,EAAE,SAAS,GAAG,YAAY;IAcxE,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIlC,cAAc,IAAI,YAAY;IAkIrC,OAAO,CAAC,SAAS,CAAK;IACf,gBAAgB,IAAI,aAAa;IAMxC,OAAO,CAAC,GAAG;IAKX,OAAO,CAAC,kBAAkB;IAO1B,OAAO,CAAC,MAAM;IAIP,cAAc,IAAI,MAAM;IAIxB,mBAAmB,CACzB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAShB,oBAAoB,CAC1B,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAahB,gBAAgB,CACtB,WAAW,EAAE,MAAM,GAAG,SAAS,EAC/B,YAAY,EAAE,uBAAuB,GACnC,IAAI;IA8BA,4BAA4B,IAAI,sBAAsB;CAG7D;AAID;;GAEG;AACH,cAAM,MAAO,SAAQ,iBAAkB,YAAW,uBAAuB;aAQvD,MAAM,EAAE,YAAY;IACpC,OAAO,CAAC,WAAW,CAAC;IARd,KAAK,EAAE,4BAA4B,CAAC;IAE3C;;;OAGG;gBAEc,MAAM,EAAE,YAAY,EAC5B,WAAW,CAAC,qCAAyB;IAWvC,gBAAgB,IAAI,WAAW;IAM/B,YAAY,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,WAAW;IAIzD,IAAW,IAAI,IAAI,kBAAkB,CAGpC;IAEM,SAAS,IAAI,OAAO;IAIpB,SAAS,IAAI,IAAI;IAIR,iBAAiB,IAAI,OAAO;IAIrC,WAAW,IAAI,QAAQ;IAIvB,cAAc,IAAI,MAAM;IAIxB,SAAS,IAAI,OAAO;IAIpB,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI;IAInC,OAAO,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,MAAM;IAI/C,IAAW,UAAU,IAAI,MAAM,CAG9B;IACD,IAAW,UAAU,IAAI,MAAM,CAG9B;IACD,IAAW,WAAW,IAAI,MAAM,CAG/B;IACM,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIlC,QAAQ,IAAI,OAAO;IAInB,QAAQ,IAAI,IAAI;IAIhB,UAAU,IAAI,OAAO;IAIrB,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IAItC,IAAW,IAAI,IAAI,wBAAwB,CAG1C;IACD,IAAW,KAAK,IAAI,KAAK,CAGxB;IAGM,KAAK,IAAI,IAAI;IAUpB;;;OAGG;IACI,2BAA2B,IAAI,IAAI;IAWnC,OAAO,IAAI,OAAO;IAKlB,SAAS,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC;IAUhC,IAAI,IAAI,uBAAuB;IAK/B,IAAI,IAAI,IAAI;IASZ,WAAW,IAAI,MAAM;CAO5B;AAKD;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,CAAC,EAAE,SAAS,GAAG,YAAY,CAE7D"}
+{"version":3,"file":"objectForest.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/object-forest/objectForest.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EACN,MAAM,EACN,SAAS,EACT,kBAAkB,EAClB,YAAY,EACZ,aAAa,EACb,WAAW,EACX,QAAQ,EACR,WAAW,EACX,YAAY,EACZ,eAAe,EAEf,sBAAsB,EACtB,uBAAuB,EACvB,4BAA4B,EAC5B,OAAO,EACP,cAAc,EAId,oBAAoB,EACpB,wBAAwB,EACxB,4BAA4B,EAC5B,MAAM,EACN,KAAK,EAGL,MAAM,qBAAqB,CAAC;AAU7B,OAAO,EAAE,cAAc,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAS1E;;;;;GAKG;AACH,qBAAa,YAAa,YAAW,eAAe;aAUhB,OAAO,EAAE,SAAS;IATrD,OAAO,CAAC,aAAa,CAAC,CAAe;IAErC,SAAgB,KAAK,EAAE,OAAO,CAAc;IAG5C,SAAgB,cAAc,EAAE,GAAG,CAAC,MAAM,CAAC,CAAa;IAExD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAiC;gBAErB,OAAO,GAAE,SAA2B;IAEvE,IAAW,OAAO,IAAI,OAAO,CAE5B;IAEM,EAAE,CAAC,CAAC,SAAS,MAAM,YAAY,EAAE,SAAS,EAAE,CAAC,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI;IAIrF,KAAK,CAAC,CAAC,EAAE,4BAA4B,EAAE,OAAO,EAAE,SAAS,GAAG,YAAY;IAcxE,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI;IAIlC,cAAc,IAAI,YAAY;IAmIrC,OAAO,CAAC,SAAS,CAAK;IACf,gBAAgB,IAAI,aAAa;IAMxC,OAAO,CAAC,GAAG;IAKX,OAAO,CAAC,kBAAkB;IAO1B,OAAO,CAAC,MAAM;IAIP,cAAc,IAAI,MAAM;IAIxB,mBAAmB,CACzB,WAAW,EAAE,MAAM,EACnB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAShB,oBAAoB,CAC1B,WAAW,EAAE,WAAW,EACxB,YAAY,EAAE,uBAAuB,GACnC,oBAAoB;IAahB,gBAAgB,CACtB,WAAW,EAAE,MAAM,GAAG,SAAS,EAC/B,YAAY,EAAE,uBAAuB,GACnC,IAAI;IA8BA,4BAA4B,IAAI,sBAAsB;CAG7D;AAID;;GAEG;AACH,cAAM,MAAO,SAAQ,iBAAkB,YAAW,uBAAuB;aAQvD,MAAM,EAAE,YAAY;IACpC,OAAO,CAAC,WAAW,CAAC;IARd,KAAK,EAAE,4BAA4B,CAAC;IAE3C;;;OAGG;gBAEc,MAAM,EAAE,YAAY,EAC5B,WAAW,CAAC,qCAAyB;IAWvC,gBAAgB,IAAI,WAAW;IAM/B,YAAY,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,WAAW;IAIzD,IAAW,IAAI,IAAI,kBAAkB,CAGpC;IAEM,SAAS,IAAI,OAAO;IAIpB,SAAS,IAAI,IAAI;IAIR,iBAAiB,IAAI,OAAO;IAIrC,WAAW,IAAI,QAAQ;IAIvB,cAAc,IAAI,MAAM;IAIxB,SAAS,IAAI,OAAO;IAIpB,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI;IAInC,OAAO,CAAC,MAAM,CAAC,EAAE,cAAc,GAAG,MAAM;IAI/C,IAAW,UAAU,IAAI,MAAM,CAG9B;IACD,IAAW,UAAU,IAAI,MAAM,CAG9B;IACD,IAAW,WAAW,IAAI,MAAM,CAG/B;IACM,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO;IAIlC,QAAQ,IAAI,OAAO;IAInB,QAAQ,IAAI,IAAI;IAIhB,UAAU,IAAI,OAAO;IAIrB,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,IAAI;IAItC,IAAW,IAAI,IAAI,wBAAwB,CAG1C;IACD,IAAW,KAAK,IAAI,KAAK,CAGxB;IAGM,KAAK,IAAI,IAAI;IAUpB;;;OAGG;IACI,2BAA2B,IAAI,IAAI;IAWnC,OAAO,IAAI,OAAO;IAKlB,SAAS,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC;IAUhC,IAAI,IAAI,uBAAuB;IAK/B,IAAI,IAAI,IAAI;IASZ,WAAW,IAAI,MAAM;CAO5B;AAKD;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,CAAC,EAAE,SAAS,GAAG,YAAY,CAE7D"}

package/dist/feature-libraries/object-forest/objectForest.js

@@ -5,12 +5,12 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.buildForest = exports.ObjectForest = void 0;
-const core_utils_1 = require("@fluidframework/core-utils");
+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 treeCursorUtils_js_1 = require("../treeCursorUtils.js");
+const index_js_2 = require("../../events/index.js");
+const index_js_3 = require("../../util/index.js");
 const mapTreeCursor_js_1 = require("../mapTreeCursor.js");
-const index_js_3 = require("../../events/index.js");
+const treeCursorUtils_js_1 = require("../treeCursorUtils.js");
 function makeRoot() {
     return {
         type: index_js_1.aboveRootPlaceholder,
@@ -29,7 +29,7 @@ class ObjectForest {
         this.roots = makeRoot();
         // All cursors that are in the "Current" state. Must be empty when editing.
         this.currentCursors = new Set();
-        this.events = (0, index_js_3.createEmitter)();
+        this.events = (0, index_js_2.createEmitter)();
         this.nextRange = 0;
     }
     get isEmpty() {
@@ -52,9 +52,9 @@ class ObjectForest {
         this.anchors.forget(anchor);
     }
     acquireVisitor() {
-        (0, core_utils_1.assert)(this.activeVisitor === undefined, 0x76c /* Must release existing visitor before acquiring another */);
+        (0, internal_1.assert)(this.activeVisitor === undefined, 0x76c /* Must release existing visitor before acquiring another */);
         this.events.emit("beforeChange");
-        (0, core_utils_1.assert)(this.currentCursors.size === 0, 0x374 /* No cursors can be current when modifying forest */);
+        (0, internal_1.assert)(this.currentCursors.size === 0, 0x374 /* No cursors can be current when modifying forest */);
         // Note: This code uses cursors, however it also modifies the tree.
         // In general this is not safe, but this code happens to only modify the tree below the current cursor location,
         // which happens to work.
@@ -67,7 +67,7 @@ class ObjectForest {
             cursor,
             free() {
                 this.cursor.free();
-                (0, core_utils_1.assert)(this.forest.activeVisitor !== undefined, 0x76d /* Multiple free calls for same visitor */);
+                (0, internal_1.assert)(this.forest.activeVisitor !== undefined, 0x76d /* Multiple free calls for same visitor */);
                 this.forest.activeVisitor = undefined;
                 this.forest.events.emit("afterChange");
             },
@@ -76,6 +76,7 @@ class ObjectForest {
             },
             create(content, destination) {
                 this.forest.add(content, destination);
+                this.forest.events.emit("afterRootFieldCreated", destination);
             },
             attach(source, count, destination) {
                 this.attachEdit(source, count, destination);
@@ -92,17 +93,17 @@ class ObjectForest {
              * @param destination - The index in the current field at which to attach the content.
              */
             attachEdit(source, count, destination) {
-                (0, index_js_2.assertNonNegativeSafeInteger)(count);
+                (0, index_js_3.assertNonNegativeSafeInteger)(count);
                 if (count === 0) {
                     return;
                 }
                 const [parent, key] = cursor.getParent();
-                (0, core_utils_1.assert)(parent !== this.forest.roots || key !== source, 0x7b6 /* Attach source field must be different from current field */);
+                (0, internal_1.assert)(parent !== this.forest.roots || key !== source, 0x7b6 /* Attach source field must be different from current field */);
                 const currentField = (0, index_js_1.getMapTreeField)(parent, key, true);
-                (0, index_js_2.assertValidIndex)(destination, currentField, true);
+                (0, index_js_3.assertValidIndex)(destination, currentField, true);
                 const sourceField = (0, index_js_1.getMapTreeField)(this.forest.roots, source, false);
-                (0, core_utils_1.assert)(sourceField !== undefined, 0x7b7 /* Attach source field must exist */);
-                (0, core_utils_1.assert)(sourceField.length === count, 0x7b8 /* Attach must consume all nodes in source field */);
+                (0, internal_1.assert)(sourceField !== undefined, 0x7b7 /* Attach source field must exist */);
+                (0, internal_1.assert)(sourceField.length === count, 0x7b8 /* Attach must consume all nodes in source field */);
                 // TODO: this will fail for very large insertions due to argument limits.
                 currentField.splice(destination, 0, ...sourceField);
                 this.forest.delete(source);
@@ -116,11 +117,11 @@ class ObjectForest {
              */
             detachEdit(source, destination) {
                 const [parent, key] = cursor.getParent();
-                (0, core_utils_1.assert)(destination === undefined ||
+                (0, internal_1.assert)(destination === undefined ||
                     parent !== this.forest.roots ||
                     key !== destination, 0x7b9 /* Detach destination field must be different from current field */);
                 const currentField = (0, index_js_1.getMapTreeField)(parent, key, true);
-                (0, index_js_2.assertValidRange)(source, currentField);
+                (0, index_js_3.assertValidRange)(source, currentField);
                 const content = currentField.splice(source.start, source.end - source.start);
                 if (destination !== undefined) {
                     this.forest.addFieldAsDetached(content, destination);
@@ -132,7 +133,7 @@ class ObjectForest {
                 }
             },
             replace(newContentSource, range, oldContentDestination) {
-                (0, core_utils_1.assert)(newContentSource !== oldContentDestination, 0x7ba /* Replace detached source field and detached destination field must be different */);
+                (0, internal_1.assert)(newContentSource !== oldContentDestination, 0x7ba /* Replace detached source field and detached destination field must be different */);
                 this.detachEdit(range, oldContentDestination);
                 this.attachEdit(newContentSource, range.end - range.start, range.start);
             },
@@ -153,7 +154,7 @@ class ObjectForest {
         return visitor;
     }
     newDetachedField() {
-        const range = (0, index_js_2.brand)(String(this.nextRange));
+        const range = (0, index_js_3.brand)(String(this.nextRange));
         this.nextRange += 1;
         return range;
     }
@@ -162,7 +163,7 @@ class ObjectForest {
         this.addFieldAsDetached(field, key);
     }
     addFieldAsDetached(field, key) {
-        (0, core_utils_1.assert)(!this.roots.fields.has(key), 0x370 /* new range must not already exist */);
+        (0, internal_1.assert)(!this.roots.fields.has(key), 0x370 /* new range must not already exist */);
         if (field.length > 0) {
             this.roots.fields.set(key, field);
         }
@@ -195,8 +196,8 @@ class ObjectForest {
         return 1 /* TreeNavigationResult.Ok */;
     }
     moveCursorToPath(destination, cursorToMove) {
-        (0, core_utils_1.assert)(cursorToMove instanceof Cursor, 0x337 /* ObjectForest must only be given its own Cursor type */);
-        (0, core_utils_1.assert)(cursorToMove.forest === this, 0x338 /* ObjectForest must only be given its own Cursor */);
+        (0, internal_1.assert)(cursorToMove instanceof Cursor, 0x337 /* ObjectForest must only be given its own Cursor type */);
+        (0, internal_1.assert)(cursorToMove.forest === this, 0x338 /* ObjectForest must only be given its own Cursor */);
         const indexStack = [];
         const keyStack = [];
         let path = destination;
@@ -245,88 +246,88 @@ class Cursor extends treeCursorUtils_js_1.SynchronousCursor {
         return { parent: anchor, fieldKey: path.field };
     }
     getFieldPath(prefix) {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x45f /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x45f /* Cursor must be current to be used */);
         return this.innerCursor.getFieldPath(prefix);
     }
     get mode() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x42e /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x42e /* Cursor must be current to be used */);
         return this.innerCursor.mode;
     }
     nextField() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x42f /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x42f /* Cursor must be current to be used */);
         return this.innerCursor.nextField();
     }
     exitField() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x430 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x430 /* Cursor must be current to be used */);
         return this.innerCursor.exitField();
     }
     skipPendingFields() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x431 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x431 /* Cursor must be current to be used */);
         return this.innerCursor.skipPendingFields();
     }
     getFieldKey() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x432 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x432 /* Cursor must be current to be used */);
         return this.innerCursor.getFieldKey();
     }
     getFieldLength() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x433 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x433 /* Cursor must be current to be used */);
         return this.innerCursor.getFieldLength();
     }
     firstNode() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x434 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x434 /* Cursor must be current to be used */);
         return this.innerCursor.firstNode();
     }
     enterNode(childIndex) {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x435 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x435 /* Cursor must be current to be used */);
         return this.innerCursor.enterNode(childIndex);
     }
     getPath(prefix) {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x436 /* Cursor must be current to be used */);
-        return this.innerCursor.getPath(prefix) ?? (0, index_js_2.fail)("no path when at root");
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x436 /* Cursor must be current to be used */);
+        return this.innerCursor.getPath(prefix) ?? (0, index_js_3.fail)("no path when at root");
     }
     get fieldIndex() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x437 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x437 /* Cursor must be current to be used */);
         return this.innerCursor.fieldIndex;
     }
     get chunkStart() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x438 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x438 /* Cursor must be current to be used */);
         return this.innerCursor.chunkStart;
     }
     get chunkLength() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x439 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x439 /* Cursor must be current to be used */);
         return this.innerCursor.chunkLength;
     }
     seekNodes(offset) {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43a /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x43a /* Cursor must be current to be used */);
         return this.innerCursor.seekNodes(offset);
     }
     nextNode() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43b /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x43b /* Cursor must be current to be used */);
         return this.innerCursor.nextNode();
     }
     exitNode() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43c /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x43c /* Cursor must be current to be used */);
         return this.innerCursor.exitNode();
     }
     firstField() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43d /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x43d /* Cursor must be current to be used */);
         return this.innerCursor.firstField();
     }
     enterField(key) {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43e /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x43e /* Cursor must be current to be used */);
         return this.innerCursor.enterField(key);
     }
     get type() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x43f /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x43f /* Cursor must be current to be used */);
         return this.innerCursor.type;
     }
     get value() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x440 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x440 /* Cursor must be current to be used */);
         return this.innerCursor.value;
     }
     // TODO: tests for clear when not at root.
     clear() {
-        (0, core_utils_1.assert)(this.state !== index_js_1.ITreeSubscriptionCursorState.Freed, 0x33b /* Cursor must not be freed */);
+        (0, internal_1.assert)(this.state !== index_js_1.ITreeSubscriptionCursorState.Freed, 0x33b /* Cursor must not be freed */);
         this.state = index_js_1.ITreeSubscriptionCursorState.Cleared;
         this.innerCursor = undefined;
         this.forest.currentCursors.delete(this);
@@ -336,18 +337,18 @@ class Cursor extends treeCursorUtils_js_1.SynchronousCursor {
      * Can be used when cleared (but not freed).
      */
     setToAboveDetachedSequences() {
-        (0, core_utils_1.assert)(this.state !== index_js_1.ITreeSubscriptionCursorState.Freed, 0x33c /* Cursor must not be freed */);
+        (0, internal_1.assert)(this.state !== index_js_1.ITreeSubscriptionCursorState.Freed, 0x33c /* Cursor must not be freed */);
         this.clear();
         this.state = index_js_1.ITreeSubscriptionCursorState.Current;
         this.innerCursor = (0, mapTreeCursor_js_1.cursorForMapTreeNode)(this.forest.roots);
         this.forest.currentCursors.add(this);
     }
     getNode() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x33e /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x33e /* Cursor must be current to be used */);
         return this.innerCursor.getNode();
     }
     getParent() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x441 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x441 /* Cursor must be current to be used */);
         // This could be optimized to skip moving it accessing internals of cursor.
         const key = this.innerCursor.getFieldKey();
         this.innerCursor.exitField();
@@ -356,16 +357,16 @@ class Cursor extends treeCursorUtils_js_1.SynchronousCursor {
         return [node, key];
     }
     fork() {
-        (0, core_utils_1.assert)(this.innerCursor !== undefined, 0x460 /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.innerCursor !== undefined, 0x460 /* Cursor must be current to be used */);
         return new Cursor(this.forest, this.innerCursor.fork());
     }
     free() {
-        (0, core_utils_1.assert)(this.state !== index_js_1.ITreeSubscriptionCursorState.Freed, 0x33f /* Cursor must not be double freed */);
+        (0, internal_1.assert)(this.state !== index_js_1.ITreeSubscriptionCursorState.Freed, 0x33f /* Cursor must not be double freed */);
         this.forest.currentCursors.delete(this);
         this.state = index_js_1.ITreeSubscriptionCursorState.Freed;
     }
     buildAnchor() {
-        (0, core_utils_1.assert)(this.state === index_js_1.ITreeSubscriptionCursorState.Current, 0x37a /* Cursor must be current to be used */);
+        (0, internal_1.assert)(this.state === index_js_1.ITreeSubscriptionCursorState.Current, 0x37a /* Cursor must be current to be used */);
         return this.forest.anchors.track(this.getPath());
     }
 }