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

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

@@ -2,30 +2,18 @@
  * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
  * Licensed under the MIT License.
  */
-import { UpPath, PathVisitor } from "../../core/index.js";
-import { FlexTreeNode } from "./flexTreeTypes.js";
+import { PathVisitor, UpPath } from "../../core/index.js";
 /**
  * This file provides an API for working with trees which is type safe even when schema is not known.
  * This means no editing is allowed.
  *
- * Schema aware APIs for working with trees should superset this, while sub-setting EditableTree.
+ * Schema aware APIs for working with trees should superset this, while sub-setting FlexTree.
  *
  * TODO:
- * This API should replace EditableTree as the default public API for tree access.
+ * This API should replace FlexTree as the default public API for tree access.
  * SchemaAware builds on this, adding editing and type safe APIs which can be accessed via SchematizeView.
- * Once this is finished, the unsafe EditableTree types can be removed (or converted to package internal documentation for the proxies).
+ * Once this is finished, the unsafe FlexTree types can be removed (or converted to package internal documentation for the proxies).
  */
-/**
- * An event raised on a {@link FlexTreeNode}.
- *
- * @internal
- */
-export interface TreeEvent {
-    /**
-     * The node of the tree where the listener receiving the event is attached.
-     */
-    readonly target: FlexTreeNode;
-}
 /**
  * A collection of events that can be raised by a {@link FlexTreeNode}.
  * These events are triggered while the internal data structures are being updated.
@@ -36,12 +24,13 @@ export interface TreeEvent {
  * - Include sub-deltas in events.
  * - Add more events.
  * - Have some events (or a way to defer events) until the tree can be read.
+ * - Consider removing this and just using AnchorEvents and simple-tree's events (and extending them as needed).
  *
  * @internal
  */
-export interface EditableTreeEvents {
+export interface FlexTreeNodeEvents {
     /**
-     * Raised when a specific EditableTree node is changing.
+     * Raised when a specific FlexTree node is changing.
      * This includes its fields.
      * @param upPath - the path corresponding to the location of the node being changed, upward.
      */
@@ -55,57 +44,5 @@ export interface EditableTreeEvents {
      * @returns a visitor to traverse the subtree or `void`.
      */
     subtreeChanging(upPath: UpPath): PathVisitor | void;
-    /**
-     * Raised on a node right before a change is applied to one of its fields or the fields of a descendant node.
-     *
-     * @param event - The event object. See {@link TreeEvent} for details.
-     *
-     * @remarks
-     * What exactly qualifies as a change that triggers this event (or {@link EditableTreeEvents.afterChange}) is dependent
-     * on the implementation of SharedTree. In general, these events will fire once for every atomic editing operation
-     * supported by SharedTree; {@link EditableTreeEvents.beforeChange} before the change is applied, and
-     * {@link EditableTreeEvents.afterChange} after it is.
-     *
-     * {@link FieldKinds.sequence} fields present two exceptions:
-     *
-     * The first one is that events will fire separately for each node involved in the operation (when inserting, removing,
-     * or moving more than one node at a time). This means that, for example, when inserting two nodes into a {@link FieldKinds.sequence}
-     * field the following will happen:
-     * - {@link EditableTreeEvents.beforeChange} will fire once before either new node is present in the tree.
-     * - {@link EditableTreeEvents.afterChange} will fire once after the first node is present in the tree, but the second one isn't.
-     * - {@link EditableTreeEvents.beforeChange} will fire once before the second node is present in the tree, but the first one already is.
-     * - {@link EditableTreeEvents.afterChange} will fire once after the second node is present in the tree (so at this point both nodes are).
-     * Something similar applies to removing nodes from a sequence, and moving them to another sequence.
-     *
-     * The second one is that for an operation to move nodes, events will fire *twice* for each node being moved; once
-     * while they are being detached from their source location, and once when they are being attached at the target location.
-     */
-    beforeChange(event: TreeEvent): void;
-    /**
-     * Raised on a node right after a change is applied to one of its fields or the fields of a descendant node.
-     *
-     * @param event - The event object. See {@link TreeEvent} for details.
-     *
-     * @remarks
-     * What exactly qualifies as a change that triggers this event (or {@link EditableTreeEvents.beforeChange}) is dependent
-     * on the implementation of SharedTree. In general, these events will fire once for every atomic editing operation supported
-     * by SharedTree; {@link EditableTreeEvents.beforeChange} before the change is applied, and
-     * {@link EditableTreeEvents.afterChange} after it is.
-     *
-     * {@link FieldKinds.sequence} present two exceptions:
-     *
-     * The first one is that events will fire separately for each node involved in the operation (when inserting, removing,
-     * or moving more than one node at a time). This means that, for example, when inserting two nodes into a {@link FieldKinds.sequence}
-     * field the following will happen:
-     * - {@link EditableTreeEvents.beforeChange} will fire once before either new node is present in the tree.
-     * - {@link EditableTreeEvents.afterChange} will fire once after the first node is present in the tree, but the second one isn't.
-     * - {@link EditableTreeEvents.beforeChange} will fire once before the second node is present in the tree, but the first one already is.
-     * - {@link EditableTreeEvents.afterChange} will fire once after the second node is present in the tree (so at this point both nodes are).
-     * Something similar applies to removing nodes from a sequence, and moving them to another sequence.
-     *
-     * The second one is that for an operation to move nodes, events will fire *twice* for each node being moved; once
-     * while they are being detached from their source location, and once when they are being attached at the target location.
-     */
-    afterChange(event: TreeEvent): void;
 }
 //# sourceMappingURL=treeEvents.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"treeEvents.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/treeEvents.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAElD;;;;;;;;;;GAUG;AAEH;;;;GAIG;AACH,MAAM,WAAW,SAAS;IACzB;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,YAAY,CAAC;CAC9B;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,kBAAkB;IAClC;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAE/B;;;;;;;OAOG;IACH,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CAAC;IAEpD;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,YAAY,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAAC;IAErC;;;;;;;;;;;;;;;;;;;;;;;;OAwBG;IACH,WAAW,CAAC,KAAK,EAAE,SAAS,GAAG,IAAI,CAAC;CACpC"}
+{"version":3,"file":"treeEvents.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/treeEvents.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,WAAW,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAE1D;;;;;;;;;;GAUG;AAEH;;;;;;;;;;;;;GAaG;AACH,MAAM,WAAW,kBAAkB;IAClC;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC;IAE/B;;;;;;;OAOG;IACH,eAAe,CAAC,MAAM,EAAE,MAAM,GAAG,WAAW,GAAG,IAAI,CAAC;CACpD"}

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

@@ -1 +1 @@
-{"version":3,"file":"treeEvents.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/treeEvents.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 { UpPath, PathVisitor } from \"../../core/index.js\";\nimport { FlexTreeNode } from \"./flexTreeTypes.js\";\n\n/**\n * This file provides an API for working with trees which is type safe even when schema is not known.\n * This means no editing is allowed.\n *\n * Schema aware APIs for working with trees should superset this, while sub-setting EditableTree.\n *\n * TODO:\n * This API should replace EditableTree as the default public API for tree access.\n * SchemaAware builds on this, adding editing and type safe APIs which can be accessed via SchematizeView.\n * Once this is finished, the unsafe EditableTree types can be removed (or converted to package internal documentation for the proxies).\n */\n\n/**\n * An event raised on a {@link FlexTreeNode}.\n *\n * @internal\n */\nexport interface TreeEvent {\n\t/**\n\t * The node of the tree where the listener receiving the event is attached.\n\t */\n\treadonly target: FlexTreeNode;\n}\n\n/**\n * A collection of events that can be raised by a {@link FlexTreeNode}.\n * These events are triggered while the internal data structures are being updated.\n * Thus these events must not trigger reading of the anchorSet or forest.\n *\n * TODO:\n * - Design how events should be ordered.\n * - Include sub-deltas in events.\n * - Add more events.\n * - Have some events (or a way to defer events) until the tree can be read.\n *\n * @internal\n */\nexport interface EditableTreeEvents {\n\t/**\n\t * Raised when a specific EditableTree node is changing.\n\t * This includes its fields.\n\t * @param upPath - the path corresponding to the location of the node being changed, upward.\n\t */\n\tchanging(upPath: UpPath): void;\n\n\t/**\n\t * Raised when something in the tree is changing, including this node and its descendants.\n\t * The event can optionally return a {@link PathVisitor} to traverse the subtree\n\t * This event is called on every parent (transitively) when a change is occurring.\n\t * Includes changes to this node itself.\n\t * @param upPath - the path corresponding to the location of the node being changed, upward.\n\t * @returns a visitor to traverse the subtree or `void`.\n\t */\n\tsubtreeChanging(upPath: UpPath): PathVisitor | void;\n\n\t/**\n\t * Raised on a node right before a change is applied to one of its fields or the fields of a descendant node.\n\t *\n\t * @param event - The event object. See {@link TreeEvent} for details.\n\t *\n\t * @remarks\n\t * What exactly qualifies as a change that triggers this event (or {@link EditableTreeEvents.afterChange}) is dependent\n\t * on the implementation of SharedTree. In general, these events will fire once for every atomic editing operation\n\t * supported by SharedTree; {@link EditableTreeEvents.beforeChange} before the change is applied, and\n\t * {@link EditableTreeEvents.afterChange} after it is.\n\t *\n\t * {@link FieldKinds.sequence} fields present two exceptions:\n\t *\n\t * The first one is that events will fire separately for each node involved in the operation (when inserting, removing,\n\t * or moving more than one node at a time). This means that, for example, when inserting two nodes into a {@link FieldKinds.sequence}\n\t * field the following will happen:\n\t * - {@link EditableTreeEvents.beforeChange} will fire once before either new node is present in the tree.\n\t * - {@link EditableTreeEvents.afterChange} will fire once after the first node is present in the tree, but the second one isn't.\n\t * - {@link EditableTreeEvents.beforeChange} will fire once before the second node is present in the tree, but the first one already is.\n\t * - {@link EditableTreeEvents.afterChange} will fire once after the second node is present in the tree (so at this point both nodes are).\n\t * Something similar applies to removing nodes from a sequence, and moving them to another sequence.\n\t *\n\t * The second one is that for an operation to move nodes, events will fire *twice* for each node being moved; once\n\t * while they are being detached from their source location, and once when they are being attached at the target location.\n\t */\n\tbeforeChange(event: TreeEvent): void;\n\n\t/**\n\t * Raised on a node right after a change is applied to one of its fields or the fields of a descendant node.\n\t *\n\t * @param event - The event object. See {@link TreeEvent} for details.\n\t *\n\t * @remarks\n\t * What exactly qualifies as a change that triggers this event (or {@link EditableTreeEvents.beforeChange}) is dependent\n\t * on the implementation of SharedTree. In general, these events will fire once for every atomic editing operation supported\n\t * by SharedTree; {@link EditableTreeEvents.beforeChange} before the change is applied, and\n\t * {@link EditableTreeEvents.afterChange} after it is.\n\t *\n\t * {@link FieldKinds.sequence} present two exceptions:\n\t *\n\t * The first one is that events will fire separately for each node involved in the operation (when inserting, removing,\n\t * or moving more than one node at a time). This means that, for example, when inserting two nodes into a {@link FieldKinds.sequence}\n\t * field the following will happen:\n\t * - {@link EditableTreeEvents.beforeChange} will fire once before either new node is present in the tree.\n\t * - {@link EditableTreeEvents.afterChange} will fire once after the first node is present in the tree, but the second one isn't.\n\t * - {@link EditableTreeEvents.beforeChange} will fire once before the second node is present in the tree, but the first one already is.\n\t * - {@link EditableTreeEvents.afterChange} will fire once after the second node is present in the tree (so at this point both nodes are).\n\t * Something similar applies to removing nodes from a sequence, and moving them to another sequence.\n\t *\n\t * The second one is that for an operation to move nodes, events will fire *twice* for each node being moved; once\n\t * while they are being detached from their source location, and once when they are being attached at the target location.\n\t */\n\tafterChange(event: TreeEvent): void;\n}\n"]}
+{"version":3,"file":"treeEvents.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/treeEvents.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 { PathVisitor, UpPath } from \"../../core/index.js\";\n\n/**\n * This file provides an API for working with trees which is type safe even when schema is not known.\n * This means no editing is allowed.\n *\n * Schema aware APIs for working with trees should superset this, while sub-setting FlexTree.\n *\n * TODO:\n * This API should replace FlexTree as the default public API for tree access.\n * SchemaAware builds on this, adding editing and type safe APIs which can be accessed via SchematizeView.\n * Once this is finished, the unsafe FlexTree types can be removed (or converted to package internal documentation for the proxies).\n */\n\n/**\n * A collection of events that can be raised by a {@link FlexTreeNode}.\n * These events are triggered while the internal data structures are being updated.\n * Thus these events must not trigger reading of the anchorSet or forest.\n *\n * TODO:\n * - Design how events should be ordered.\n * - Include sub-deltas in events.\n * - Add more events.\n * - Have some events (or a way to defer events) until the tree can be read.\n * - Consider removing this and just using AnchorEvents and simple-tree's events (and extending them as needed).\n *\n * @internal\n */\nexport interface FlexTreeNodeEvents {\n\t/**\n\t * Raised when a specific FlexTree node is changing.\n\t * This includes its fields.\n\t * @param upPath - the path corresponding to the location of the node being changed, upward.\n\t */\n\tchanging(upPath: UpPath): void;\n\n\t/**\n\t * Raised when something in the tree is changing, including this node and its descendants.\n\t * The event can optionally return a {@link PathVisitor} to traverse the subtree\n\t * This event is called on every parent (transitively) when a change is occurring.\n\t * Includes changes to this node itself.\n\t * @param upPath - the path corresponding to the location of the node being changed, upward.\n\t * @returns a visitor to traverse the subtree or `void`.\n\t */\n\tsubtreeChanging(upPath: UpPath): PathVisitor | void;\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"unboxed.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/unboxed.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,uBAAuB,EAAgB,MAAM,qBAAqB,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAE3D,OAAO,EACN,gBAAgB,EAChB,eAAe,EACf,kBAAkB,EAElB,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAEN,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,MAAM,oBAAoB,CAAC;AAI5B;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,SAAS,kBAAkB,EAC7D,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,GAC7B,iBAAiB,CAAC,OAAO,CAAC,CAM5B;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,SAAS,gBAAgB,EAC3D,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,EAC9C,MAAM,EAAE,uBAAuB,GAC7B,sBAAsB,CAAC,MAAM,CAAC,CAMhC;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,OAAO,SAAS,eAAe,EAC3D,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,GAC7B,kBAAkB,CAAC,OAAO,CAAC,CAkB7B"}
+{"version":3,"file":"unboxed.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/unboxed.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,uBAAuB,EAAgB,MAAM,qBAAqB,CAAC;AAE5E,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EACN,gBAAgB,EAChB,eAAe,EACf,kBAAkB,EAElB,MAAM,0BAA0B,CAAC;AAElC,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAEN,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,MAAM,oBAAoB,CAAC;AAI5B;;GAEG;AACH,wBAAgB,WAAW,CAAC,OAAO,SAAS,kBAAkB,EAC7D,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,GAC7B,iBAAiB,CAAC,OAAO,CAAC,CAM5B;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,SAAS,gBAAgB,EAC3D,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,eAAe,CAAC,aAAa,EAAE,MAAM,CAAC,EAC9C,MAAM,EAAE,uBAAuB,GAC7B,sBAAsB,CAAC,MAAM,CAAC,CAMhC;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAAC,OAAO,SAAS,eAAe,EAC3D,OAAO,EAAE,OAAO,EAChB,MAAM,EAAE,OAAO,EACf,MAAM,EAAE,uBAAuB,GAC7B,kBAAkB,CAAC,OAAO,CAAC,CAkB7B"}

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

@@ -8,8 +8,8 @@ exports.unboxedField = exports.unboxedUnion = exports.unboxedTree = void 0;
 const index_js_1 = require("../../core/index.js");
 const index_js_2 = require("../default-schema/index.js");
 const index_js_3 = require("../typed-schema/index.js");
-const lazyNode_js_1 = require("./lazyNode.js");
 const lazyField_js_1 = require("./lazyField.js");
+const lazyNode_js_1 = require("./lazyNode.js");
 /**
  * See {@link FlexTreeUnboxNode} for documentation on what unwrapping this performs.
  */

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

@@ -1 +1 @@
-{"version":3,"file":"unboxed.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/unboxed.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kDAA4E;AAE5E,yDAAwD;AACxD,uDAKkC;AAQlC,+CAAyC;AACzC,iDAA2C;AAE3C;;GAEG;AACH,SAAgB,WAAW,CAC1B,OAAgB,EAChB,MAAe,EACf,MAA+B;IAE/B,IAAI,IAAA,uBAAY,EAAC,MAAM,CAAC,EAAE;QACzB,OAAO,MAAM,CAAC,KAAmC,CAAC;KAClD;IAED,OAAO,IAAA,sBAAQ,EAAC,OAAO,EAAE,MAAM,CAA+C,CAAC;AAChF,CAAC;AAVD,kCAUC;AAED;;GAEG;AACH,SAAgB,YAAY,CAC3B,OAAgB,EAChB,MAA8C,EAC9C,MAA+B;IAE/B,MAAM,IAAI,GAAG,MAAM,CAAC,oBAAoB,CAAC;IACzC,IAAI,IAAI,KAAK,SAAS,EAAE;QACvB,OAAO,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAmC,CAAC;KAC5E;IACD,OAAO,IAAA,sBAAQ,EAAC,OAAO,EAAE,MAAM,CAAmC,CAAC;AACpE,CAAC;AAVD,oCAUC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAC3B,OAAgB,EAChB,MAAe,EACf,MAA+B;IAE/B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,IAAI,IAAI,KAAK,qBAAU,CAAC,QAAQ,EAAE;QACjC,OAAO,IAAA,uBAAY,EAAC,MAAM,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAC9C,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CACX,CAAC;KACjC;IACD,IAAI,IAAI,KAAK,qBAAU,CAAC,QAAQ,EAAE;QACjC,IAAI,MAAM,CAAC,cAAc,EAAE,KAAK,CAAC,EAAE;YAClC,OAAO,SAAwC,CAAC;SAChD;QACD,OAAO,IAAA,uBAAY,EAAC,MAAM,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAC9C,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CACX,CAAC;KACjC;IAED,8BAA8B;IAC9B,OAAO,IAAA,wBAAS,EAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAgC,CAAC;AAC1E,CAAC;AAtBD,oCAsBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ITreeSubscriptionCursor, inCursorNode } from \"../../core/index.js\";\nimport { FlexFieldKind } from \"../modular-schema/index.js\";\nimport { FieldKinds } from \"../default-schema/index.js\";\nimport {\n\tFlexAllowedTypes,\n\tFlexFieldSchema,\n\tFlexTreeNodeSchema,\n\tschemaIsLeaf,\n} from \"../typed-schema/index.js\";\nimport { Context } from \"./context.js\";\nimport {\n\tFlexTreeNode,\n\tFlexTreeUnboxField,\n\tFlexTreeUnboxNode,\n\tFlexTreeUnboxNodeUnion,\n} from \"./flexTreeTypes.js\";\nimport { makeTree } from \"./lazyNode.js\";\nimport { makeField } from \"./lazyField.js\";\n\n/**\n * See {@link FlexTreeUnboxNode} for documentation on what unwrapping this performs.\n */\nexport function unboxedTree<TSchema extends FlexTreeNodeSchema>(\n\tcontext: Context,\n\tschema: TSchema,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeUnboxNode<TSchema> {\n\tif (schemaIsLeaf(schema)) {\n\t\treturn cursor.value as FlexTreeUnboxNode<TSchema>;\n\t}\n\n\treturn makeTree(context, cursor) as FlexTreeNode as FlexTreeUnboxNode<TSchema>;\n}\n\n/**\n * See {@link FlexTreeUnboxNodeUnion} for documentation on what unwrapping this performs.\n */\nexport function unboxedUnion<TTypes extends FlexAllowedTypes>(\n\tcontext: Context,\n\tschema: FlexFieldSchema<FlexFieldKind, TTypes>,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeUnboxNodeUnion<TTypes> {\n\tconst type = schema.monomorphicChildType;\n\tif (type !== undefined) {\n\t\treturn unboxedTree(context, type, cursor) as FlexTreeUnboxNodeUnion<TTypes>;\n\t}\n\treturn makeTree(context, cursor) as FlexTreeUnboxNodeUnion<TTypes>;\n}\n\n/**\n * @param context - the common context of the field.\n * @param schema - the TreeFieldStoredSchema of the field.\n * @param cursor - the cursor, which must point to the field being proxified.\n */\nexport function unboxedField<TSchema extends FlexFieldSchema>(\n\tcontext: Context,\n\tschema: TSchema,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeUnboxField<TSchema> {\n\tconst kind = schema.kind;\n\tif (kind === FieldKinds.required) {\n\t\treturn inCursorNode(cursor, 0, (innerCursor) =>\n\t\t\tunboxedUnion(context, schema, innerCursor),\n\t\t) as FlexTreeUnboxField<TSchema>;\n\t}\n\tif (kind === FieldKinds.optional) {\n\t\tif (cursor.getFieldLength() === 0) {\n\t\t\treturn undefined as FlexTreeUnboxField<TSchema>;\n\t\t}\n\t\treturn inCursorNode(cursor, 0, (innerCursor) =>\n\t\t\tunboxedUnion(context, schema, innerCursor),\n\t\t) as FlexTreeUnboxField<TSchema>;\n\t}\n\n\t// TODO: forbidden and nodeKey\n\treturn makeField(context, schema, cursor) as FlexTreeUnboxField<TSchema>;\n}\n"]}
+{"version":3,"file":"unboxed.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/unboxed.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kDAA4E;AAC5E,yDAAwD;AAExD,uDAKkC;AASlC,iDAA2C;AAC3C,+CAAyC;AAEzC;;GAEG;AACH,SAAgB,WAAW,CAC1B,OAAgB,EAChB,MAAe,EACf,MAA+B;IAE/B,IAAI,IAAA,uBAAY,EAAC,MAAM,CAAC,EAAE;QACzB,OAAO,MAAM,CAAC,KAAmC,CAAC;KAClD;IAED,OAAO,IAAA,sBAAQ,EAAC,OAAO,EAAE,MAAM,CAA+C,CAAC;AAChF,CAAC;AAVD,kCAUC;AAED;;GAEG;AACH,SAAgB,YAAY,CAC3B,OAAgB,EAChB,MAA8C,EAC9C,MAA+B;IAE/B,MAAM,IAAI,GAAG,MAAM,CAAC,oBAAoB,CAAC;IACzC,IAAI,IAAI,KAAK,SAAS,EAAE;QACvB,OAAO,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAmC,CAAC;KAC5E;IACD,OAAO,IAAA,sBAAQ,EAAC,OAAO,EAAE,MAAM,CAAmC,CAAC;AACpE,CAAC;AAVD,oCAUC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAC3B,OAAgB,EAChB,MAAe,EACf,MAA+B;IAE/B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;IACzB,IAAI,IAAI,KAAK,qBAAU,CAAC,QAAQ,EAAE;QACjC,OAAO,IAAA,uBAAY,EAAC,MAAM,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAC9C,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CACX,CAAC;KACjC;IACD,IAAI,IAAI,KAAK,qBAAU,CAAC,QAAQ,EAAE;QACjC,IAAI,MAAM,CAAC,cAAc,EAAE,KAAK,CAAC,EAAE;YAClC,OAAO,SAAwC,CAAC;SAChD;QACD,OAAO,IAAA,uBAAY,EAAC,MAAM,EAAE,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAC9C,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CACX,CAAC;KACjC;IAED,8BAA8B;IAC9B,OAAO,IAAA,wBAAS,EAAC,OAAO,EAAE,MAAM,EAAE,MAAM,CAAgC,CAAC;AAC1E,CAAC;AAtBD,oCAsBC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { ITreeSubscriptionCursor, inCursorNode } from \"../../core/index.js\";\nimport { FieldKinds } from \"../default-schema/index.js\";\nimport { FlexFieldKind } from \"../modular-schema/index.js\";\nimport {\n\tFlexAllowedTypes,\n\tFlexFieldSchema,\n\tFlexTreeNodeSchema,\n\tschemaIsLeaf,\n} from \"../typed-schema/index.js\";\n\nimport { Context } from \"./context.js\";\nimport {\n\tFlexTreeNode,\n\tFlexTreeUnboxField,\n\tFlexTreeUnboxNode,\n\tFlexTreeUnboxNodeUnion,\n} from \"./flexTreeTypes.js\";\nimport { makeField } from \"./lazyField.js\";\nimport { makeTree } from \"./lazyNode.js\";\n\n/**\n * See {@link FlexTreeUnboxNode} for documentation on what unwrapping this performs.\n */\nexport function unboxedTree<TSchema extends FlexTreeNodeSchema>(\n\tcontext: Context,\n\tschema: TSchema,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeUnboxNode<TSchema> {\n\tif (schemaIsLeaf(schema)) {\n\t\treturn cursor.value as FlexTreeUnboxNode<TSchema>;\n\t}\n\n\treturn makeTree(context, cursor) as FlexTreeNode as FlexTreeUnboxNode<TSchema>;\n}\n\n/**\n * See {@link FlexTreeUnboxNodeUnion} for documentation on what unwrapping this performs.\n */\nexport function unboxedUnion<TTypes extends FlexAllowedTypes>(\n\tcontext: Context,\n\tschema: FlexFieldSchema<FlexFieldKind, TTypes>,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeUnboxNodeUnion<TTypes> {\n\tconst type = schema.monomorphicChildType;\n\tif (type !== undefined) {\n\t\treturn unboxedTree(context, type, cursor) as FlexTreeUnboxNodeUnion<TTypes>;\n\t}\n\treturn makeTree(context, cursor) as FlexTreeUnboxNodeUnion<TTypes>;\n}\n\n/**\n * @param context - the common context of the field.\n * @param schema - the TreeFieldStoredSchema of the field.\n * @param cursor - the cursor, which must point to the field being proxified.\n */\nexport function unboxedField<TSchema extends FlexFieldSchema>(\n\tcontext: Context,\n\tschema: TSchema,\n\tcursor: ITreeSubscriptionCursor,\n): FlexTreeUnboxField<TSchema> {\n\tconst kind = schema.kind;\n\tif (kind === FieldKinds.required) {\n\t\treturn inCursorNode(cursor, 0, (innerCursor) =>\n\t\t\tunboxedUnion(context, schema, innerCursor),\n\t\t) as FlexTreeUnboxField<TSchema>;\n\t}\n\tif (kind === FieldKinds.optional) {\n\t\tif (cursor.getFieldLength() === 0) {\n\t\t\treturn undefined as FlexTreeUnboxField<TSchema>;\n\t\t}\n\t\treturn inCursorNode(cursor, 0, (innerCursor) =>\n\t\t\tunboxedUnion(context, schema, innerCursor),\n\t\t) as FlexTreeUnboxField<TSchema>;\n\t}\n\n\t// TODO: forbidden and nodeKey\n\treturn makeField(context, schema, cursor) as FlexTreeUnboxField<TSchema>;\n}\n"]}

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

@@ -1 +1 @@
-{"version":3,"file":"utilities.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/utilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,UAAU,EACV,SAAS,EACT,aAAa,EAIb,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD;;;;GAIG;AACH,wBAAgB,2BAA2B,CAAC,aAAa,EAAE,aAAa,GAAG,UAAU,CAEpF;AAED;;;;;;;;;GASG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,GAAG,UAAU,CAkBhG;AAiBD,eAAO,MAAM,iBAAiB,8DAAmC,CAAC;AAElE,MAAM,WAAW,kBAAkB;IAClC,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,aAAa,CAAC;CAC7B"}
+{"version":3,"file":"utilities.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/utilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,UAAU,EACV,SAAS,EACT,aAAa,EAIb,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAChD;;;;GAIG;AACH,wBAAgB,2BAA2B,CAAC,aAAa,EAAE,aAAa,GAAG,UAAU,CAEpF;AAED;;;;;;;;;GASG;AACH,wBAAgB,yBAAyB,CAAC,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,UAAU,GAAG,UAAU,CAkBhG;AAiBD,eAAO,MAAM,iBAAiB,8DAAmC,CAAC;AAElE,MAAM,WAAW,kBAAkB;IAClC,gBAAgB,EAAE,MAAM,CAAC;IACzB,aAAa,EAAE,aAAa,CAAC;CAC7B"}

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

@@ -1 +1 @@
-{"version":3,"file":"utilities.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/utilities.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kDAO6B;AAC7B,yDAAgD;AAChD;;;;GAIG;AACH,SAAgB,2BAA2B,CAAC,aAA4B;IACvE,OAAO,aAAa,KAAK,oBAAS,CAAC,CAAC,CAAC,6BAAU,CAAC,UAAU,CAAC,CAAC,CAAC,6BAAU,CAAC,OAAO,CAAC;AACjF,CAAC;AAFD,kEAEC;AAED;;;;;;;;;GASG;AACH,SAAgB,yBAAyB,CAAC,OAAkB,EAAE,UAAsB;IACnF,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,yBAAiB,CAAC,CAAC;IACtD,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,kGAAkG;QAClG,OAAO,2BAA2B,CACjC,6BAA6B,CAAC,UAAU,EAAE,OAAO,CAAC,gBAAgB,CAAC,CACnE,CAAC;KACF;SAAM;QACN,wFAAwF;QACxF,MAAM,uBAAuB,GAAG,OAAO,CAAC,gBAAgB,CAAC;QACzD,IAAI,KAAK,CAAC,gBAAgB,KAAK,uBAAuB,EAAE;YACvD,OAAO,2BAA2B,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;SACxD;QACD,kHAAkH;QAClH,OAAO,2BAA2B,CACjC,6BAA6B,CAAC,UAAU,EAAE,uBAAuB,CAAC,CAClE,CAAC;KACF;AACF,CAAC;AAlBD,8DAkBC;AAED;;GAEG;AACH,SAAS,6BAA6B,CACrC,UAAsB,EACtB,gBAAwB;IAExB,MAAM,aAAa,GAAG,IAAA,yCAA8B,EAAC,UAAU,CAAC,CAAC;IACjE,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,yBAAiB,EAAE;QACvC,gBAAgB;QAChB,aAAa;KACb,CAAC,CAAC;IACH,OAAO,aAAa,CAAC;AACtB,CAAC;AAEY,QAAA,iBAAiB,GAAG,IAAA,qBAAU,GAAsB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tAnchorNode,\n\tAnchorSet,\n\tDetachedField,\n\tanchorSlot,\n\tgetDetachedFieldContainingPath,\n\trootField,\n} from \"../../core/index.js\";\nimport { TreeStatus } from \"./flexTreeTypes.js\";\n/**\n * Checks the detached field and returns the TreeStatus based on whether or not the detached field is a root field.\n * @param detachedField - the detached field you want to check.\n * @returns the {@link TreeStatus} from the detached field provided.\n */\nexport function treeStatusFromDetachedField(detachedField: DetachedField): TreeStatus {\n\treturn detachedField === rootField ? TreeStatus.InDocument : TreeStatus.Removed;\n}\n\n/**\n * Determines the tree status based on the anchor cache.\n *\n * Checks the anchorNode's cache to get the tree status.\n * If the cache is undefined or stale, it is updated and the treeStatus based on its detachedField is returned.\n *\n * @param anchors - the {@link AnchorSet} to compare your anchorNode cache to.\n * @param anchorNode - the {@link AnchorNode} to get the {@link TreeStatus} of.\n * @returns - the {@link TreeStatus} of the anchorNode provided.\n */\nexport function treeStatusFromAnchorCache(anchors: AnchorSet, anchorNode: AnchorNode): TreeStatus {\n\tconst cache = anchorNode.slots.get(detachedFieldSlot);\n\tif (cache === undefined) {\n\t\t// If the cache is undefined, set the cache and return the treeStatus based on the detached field.\n\t\treturn treeStatusFromDetachedField(\n\t\t\tgetCachedUpdatedDetachedField(anchorNode, anchors.generationNumber),\n\t\t);\n\t} else {\n\t\t// If the cache is up to date, return the treeStatus based on the cached detached field.\n\t\tconst currentGenerationNumber = anchors.generationNumber;\n\t\tif (cache.generationNumber === currentGenerationNumber) {\n\t\t\treturn treeStatusFromDetachedField(cache.detachedField);\n\t\t}\n\t\t// If the cache is not up to date, update the cache and return the treeStatus based on the updated detached field.\n\t\treturn treeStatusFromDetachedField(\n\t\t\tgetCachedUpdatedDetachedField(anchorNode, currentGenerationNumber),\n\t\t);\n\t}\n}\n\n/**\n * Updates the anchorNode cache with the provided generation number, and returns its detachedField.\n */\nfunction getCachedUpdatedDetachedField(\n\tanchorNode: AnchorNode,\n\tgenerationNumber: number,\n): DetachedField {\n\tconst detachedField = getDetachedFieldContainingPath(anchorNode);\n\tanchorNode.slots.set(detachedFieldSlot, {\n\t\tgenerationNumber,\n\t\tdetachedField,\n\t});\n\treturn detachedField;\n}\n\nexport const detachedFieldSlot = anchorSlot<DetachedFieldCache>();\n\nexport interface DetachedFieldCache {\n\tgenerationNumber: number;\n\tdetachedField: DetachedField;\n}\n"]}
+{"version":3,"file":"utilities.js","sourceRoot":"","sources":["../../../src/feature-libraries/flex-tree/utilities.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kDAO6B;AAE7B,yDAAgD;AAChD;;;;GAIG;AACH,SAAgB,2BAA2B,CAAC,aAA4B;IACvE,OAAO,aAAa,KAAK,oBAAS,CAAC,CAAC,CAAC,6BAAU,CAAC,UAAU,CAAC,CAAC,CAAC,6BAAU,CAAC,OAAO,CAAC;AACjF,CAAC;AAFD,kEAEC;AAED;;;;;;;;;GASG;AACH,SAAgB,yBAAyB,CAAC,OAAkB,EAAE,UAAsB;IACnF,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,yBAAiB,CAAC,CAAC;IACtD,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,kGAAkG;QAClG,OAAO,2BAA2B,CACjC,6BAA6B,CAAC,UAAU,EAAE,OAAO,CAAC,gBAAgB,CAAC,CACnE,CAAC;KACF;SAAM;QACN,wFAAwF;QACxF,MAAM,uBAAuB,GAAG,OAAO,CAAC,gBAAgB,CAAC;QACzD,IAAI,KAAK,CAAC,gBAAgB,KAAK,uBAAuB,EAAE;YACvD,OAAO,2BAA2B,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;SACxD;QACD,kHAAkH;QAClH,OAAO,2BAA2B,CACjC,6BAA6B,CAAC,UAAU,EAAE,uBAAuB,CAAC,CAClE,CAAC;KACF;AACF,CAAC;AAlBD,8DAkBC;AAED;;GAEG;AACH,SAAS,6BAA6B,CACrC,UAAsB,EACtB,gBAAwB;IAExB,MAAM,aAAa,GAAG,IAAA,yCAA8B,EAAC,UAAU,CAAC,CAAC;IACjE,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,yBAAiB,EAAE;QACvC,gBAAgB;QAChB,aAAa;KACb,CAAC,CAAC;IACH,OAAO,aAAa,CAAC;AACtB,CAAC;AAEY,QAAA,iBAAiB,GAAG,IAAA,qBAAU,GAAsB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tAnchorNode,\n\tAnchorSet,\n\tDetachedField,\n\tanchorSlot,\n\tgetDetachedFieldContainingPath,\n\trootField,\n} from \"../../core/index.js\";\n\nimport { TreeStatus } from \"./flexTreeTypes.js\";\n/**\n * Checks the detached field and returns the TreeStatus based on whether or not the detached field is a root field.\n * @param detachedField - the detached field you want to check.\n * @returns the {@link TreeStatus} from the detached field provided.\n */\nexport function treeStatusFromDetachedField(detachedField: DetachedField): TreeStatus {\n\treturn detachedField === rootField ? TreeStatus.InDocument : TreeStatus.Removed;\n}\n\n/**\n * Determines the tree status based on the anchor cache.\n *\n * Checks the anchorNode's cache to get the tree status.\n * If the cache is undefined or stale, it is updated and the treeStatus based on its detachedField is returned.\n *\n * @param anchors - the {@link AnchorSet} to compare your anchorNode cache to.\n * @param anchorNode - the {@link AnchorNode} to get the {@link TreeStatus} of.\n * @returns - the {@link TreeStatus} of the anchorNode provided.\n */\nexport function treeStatusFromAnchorCache(anchors: AnchorSet, anchorNode: AnchorNode): TreeStatus {\n\tconst cache = anchorNode.slots.get(detachedFieldSlot);\n\tif (cache === undefined) {\n\t\t// If the cache is undefined, set the cache and return the treeStatus based on the detached field.\n\t\treturn treeStatusFromDetachedField(\n\t\t\tgetCachedUpdatedDetachedField(anchorNode, anchors.generationNumber),\n\t\t);\n\t} else {\n\t\t// If the cache is up to date, return the treeStatus based on the cached detached field.\n\t\tconst currentGenerationNumber = anchors.generationNumber;\n\t\tif (cache.generationNumber === currentGenerationNumber) {\n\t\t\treturn treeStatusFromDetachedField(cache.detachedField);\n\t\t}\n\t\t// If the cache is not up to date, update the cache and return the treeStatus based on the updated detached field.\n\t\treturn treeStatusFromDetachedField(\n\t\t\tgetCachedUpdatedDetachedField(anchorNode, currentGenerationNumber),\n\t\t);\n\t}\n}\n\n/**\n * Updates the anchorNode cache with the provided generation number, and returns its detachedField.\n */\nfunction getCachedUpdatedDetachedField(\n\tanchorNode: AnchorNode,\n\tgenerationNumber: number,\n): DetachedField {\n\tconst detachedField = getDetachedFieldContainingPath(anchorNode);\n\tanchorNode.slots.set(detachedFieldSlot, {\n\t\tgenerationNumber,\n\t\tdetachedField,\n\t});\n\treturn detachedField;\n}\n\nexport const detachedFieldSlot = anchorSlot<DetachedFieldCache>();\n\nexport interface DetachedFieldCache {\n\tgenerationNumber: number;\n\tdetachedField: DetachedField;\n}\n"]}

package/dist/feature-libraries/forest-summary/codec.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/codec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,aAAa,EAAE,UAAU,EAA+B,MAAM,sBAAsB,CAAC;AAC9F,OAAO,EAAE,QAAQ,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAC;AACxF,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,EAAE,sBAAsB,CAAC,CAAC;AACrE,MAAM,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,yBAAyB,CAAC,CAAC;AAE1F,wBAAgB,yBAAyB,CACxC,OAAO,EAAE,aAAa,EACtB,eAAe,EAAE,eAAe,GAC9B,WAAW,CAsBb"}
+{"version":3,"file":"codec.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/codec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,aAAa,EAAE,UAAU,EAA+B,MAAM,sBAAsB,CAAC;AAC9F,OAAO,EAAE,QAAQ,EAAE,sBAAsB,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAC;AAExF,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAErC;;GAEG;AACH,MAAM,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,EAAE,sBAAsB,CAAC,CAAC;AACrE,MAAM,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,yBAAyB,CAAC,CAAC;AAE1F,wBAAgB,yBAAyB,CACxC,OAAO,EAAE,aAAa,EACtB,eAAe,EAAE,eAAe,GAC9B,WAAW,CAsBb"}

package/dist/feature-libraries/forest-summary/codec.js

@@ -5,7 +5,7 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.makeForestSummarizerCodec = void 0;
-const core_utils_1 = require("@fluidframework/core-utils");
+const internal_1 = require("@fluidframework/core-utils/internal");
 const index_js_1 = require("../../codec/index.js");
 const format_js_1 = require("./format.js");
 function makeForestSummarizerCodec(options, fieldBatchCodec) {
@@ -23,7 +23,7 @@ function makeForestSummarizerCodec(options, fieldBatchCodec) {
         decode: (data, context) => {
             const out = new Map();
             const fields = inner.decode(data.fields, context);
-            (0, core_utils_1.assert)(data.keys.length === fields.length, 0x891 /* mismatched lengths */);
+            (0, internal_1.assert)(data.keys.length === fields.length, 0x891 /* mismatched lengths */);
             for (let index = 0; index < fields.length; index++) {
                 out.set(data.keys[index], fields[index]);
             }

package/dist/feature-libraries/forest-summary/codec.js.map

@@ -1 +1 @@
-{"version":3,"file":"codec.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/codec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,2DAAoD;AACpD,mDAA8F;AAG9F,2CAAqC;AAQrC,SAAgB,yBAAyB,CACxC,OAAsB,EACtB,eAAgC;IAEhC,MAAM,KAAK,GAAG,eAAe,CAAC;IAC9B,OAAO,IAAA,sCAA2B,EAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,kBAAM,EAAE;QACjE,MAAM,EAAE,CAAC,IAAc,EAAE,OAAkC,EAAU,EAAE;YACtE,MAAM,IAAI,GAAe,EAAE,CAAC;YAC5B,MAAM,MAAM,GAA6B,EAAE,CAAC;YAC5C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;gBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACnB;YACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;QACpE,CAAC;QACD,MAAM,EAAE,CAAC,IAAY,EAAE,OAAkC,EAAY,EAAE;YACtE,MAAM,GAAG,GAA0C,IAAI,GAAG,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAClD,IAAA,mBAAM,EAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;YAC3E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;gBACnD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;aACzC;YACD,OAAO,GAAG,CAAC;QACZ,CAAC;KACD,CAAC,CAAC;AACJ,CAAC;AAzBD,8DAyBC","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 { ICodecOptions, IJsonCodec, makeVersionedValidatedCodec } from \"../../codec/index.js\";\nimport { FieldKey, ITreeCursorSynchronous } from \"../../core/index.js\";\nimport { FieldBatchCodec, FieldBatchEncodingContext } from \"../chunked-forest/index.js\";\nimport { Format } from \"./format.js\";\n\n/**\n * Uses field cursors\n */\nexport type FieldSet = ReadonlyMap<FieldKey, ITreeCursorSynchronous>;\nexport type ForestCodec = IJsonCodec<FieldSet, Format, Format, FieldBatchEncodingContext>;\n\nexport function makeForestSummarizerCodec(\n\toptions: ICodecOptions,\n\tfieldBatchCodec: FieldBatchCodec,\n): ForestCodec {\n\tconst inner = fieldBatchCodec;\n\treturn makeVersionedValidatedCodec(options, new Set([1]), Format, {\n\t\tencode: (data: FieldSet, context: FieldBatchEncodingContext): Format => {\n\t\t\tconst keys: FieldKey[] = [];\n\t\t\tconst fields: ITreeCursorSynchronous[] = [];\n\t\t\tfor (const [key, value] of data) {\n\t\t\t\tkeys.push(key);\n\t\t\t\tfields.push(value);\n\t\t\t}\n\t\t\treturn { keys, fields: inner.encode(fields, context), version: 1 };\n\t\t},\n\t\tdecode: (data: Format, context: FieldBatchEncodingContext): FieldSet => {\n\t\t\tconst out: Map<FieldKey, ITreeCursorSynchronous> = new Map();\n\t\t\tconst fields = inner.decode(data.fields, context);\n\t\t\tassert(data.keys.length === fields.length, 0x891 /* mismatched lengths */);\n\t\t\tfor (let index = 0; index < fields.length; index++) {\n\t\t\t\tout.set(data.keys[index], fields[index]);\n\t\t\t}\n\t\t\treturn out;\n\t\t},\n\t});\n}\n"]}
+{"version":3,"file":"codec.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/codec.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,kEAA6D;AAE7D,mDAA8F;AAI9F,2CAAqC;AAQrC,SAAgB,yBAAyB,CACxC,OAAsB,EACtB,eAAgC;IAEhC,MAAM,KAAK,GAAG,eAAe,CAAC;IAC9B,OAAO,IAAA,sCAA2B,EAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,kBAAM,EAAE;QACjE,MAAM,EAAE,CAAC,IAAc,EAAE,OAAkC,EAAU,EAAE;YACtE,MAAM,IAAI,GAAe,EAAE,CAAC;YAC5B,MAAM,MAAM,GAA6B,EAAE,CAAC;YAC5C,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE;gBAChC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACnB;YACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;QACpE,CAAC;QACD,MAAM,EAAE,CAAC,IAAY,EAAE,OAAkC,EAAY,EAAE;YACtE,MAAM,GAAG,GAA0C,IAAI,GAAG,EAAE,CAAC;YAC7D,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAClD,IAAA,iBAAM,EAAC,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,wBAAwB,CAAC,CAAC;YAC3E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE;gBACnD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;aACzC;YACD,OAAO,GAAG,CAAC;QACZ,CAAC;KACD,CAAC,CAAC;AACJ,CAAC;AAzBD,8DAyBC","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 { ICodecOptions, IJsonCodec, makeVersionedValidatedCodec } from \"../../codec/index.js\";\nimport { FieldKey, ITreeCursorSynchronous } from \"../../core/index.js\";\nimport { FieldBatchCodec, FieldBatchEncodingContext } from \"../chunked-forest/index.js\";\n\nimport { Format } from \"./format.js\";\n\n/**\n * Uses field cursors\n */\nexport type FieldSet = ReadonlyMap<FieldKey, ITreeCursorSynchronous>;\nexport type ForestCodec = IJsonCodec<FieldSet, Format, Format, FieldBatchEncodingContext>;\n\nexport function makeForestSummarizerCodec(\n\toptions: ICodecOptions,\n\tfieldBatchCodec: FieldBatchCodec,\n): ForestCodec {\n\tconst inner = fieldBatchCodec;\n\treturn makeVersionedValidatedCodec(options, new Set([1]), Format, {\n\t\tencode: (data: FieldSet, context: FieldBatchEncodingContext): Format => {\n\t\t\tconst keys: FieldKey[] = [];\n\t\t\tconst fields: ITreeCursorSynchronous[] = [];\n\t\t\tfor (const [key, value] of data) {\n\t\t\t\tkeys.push(key);\n\t\t\t\tfields.push(value);\n\t\t\t}\n\t\t\treturn { keys, fields: inner.encode(fields, context), version: 1 };\n\t\t},\n\t\tdecode: (data: Format, context: FieldBatchEncodingContext): FieldSet => {\n\t\t\tconst out: Map<FieldKey, ITreeCursorSynchronous> = new Map();\n\t\t\tconst fields = inner.decode(data.fields, context);\n\t\t\tassert(data.keys.length === fields.length, 0x891 /* mismatched lengths */);\n\t\t\tfor (let index = 0; index < fields.length; index++) {\n\t\t\t\tout.set(data.keys[index], fields[index]);\n\t\t\t}\n\t\t\treturn out;\n\t\t},\n\t});\n}\n"]}

package/dist/feature-libraries/forest-summary/forestSummarizer.d.ts

@@ -3,11 +3,11 @@
  * Licensed under the MIT License.
  */
 import { IChannelStorageService } from "@fluidframework/datastore-definitions";
-import { ITelemetryContext, ISummaryTreeWithStats, IGarbageCollectionData } from "@fluidframework/runtime-definitions";
+import { IGarbageCollectionData, ISummaryTreeWithStats, ITelemetryContext } from "@fluidframework/runtime-definitions";
+import { ICodecOptions } from "../../codec/index.js";
 import { IEditableForest, RevisionTagCodec } from "../../core/index.js";
 import { Summarizable, SummaryElementParser, SummaryElementStringifier } from "../../shared-tree-core/index.js";
-import { ICodecOptions } from "../../codec/index.js";
-import { FieldBatchEncodingContext, FieldBatchCodec } from "../chunked-forest/index.js";
+import { FieldBatchCodec, FieldBatchEncodingContext } from "../chunked-forest/index.js";
 /**
  * Provides methods for summarizing and loading a forest.
  */

package/dist/feature-libraries/forest-summary/forestSummarizer.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"forestSummarizer.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/forestSummarizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,sBAAsB,EAAE,MAAM,uCAAuC,CAAC;AAC/E,OAAO,EACN,iBAAiB,EACjB,qBAAqB,EACrB,sBAAsB,EACtB,MAAM,qCAAqC,CAAC;AAG7C,OAAO,EAMN,eAAe,EAKf,gBAAgB,EAEhB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACN,YAAY,EACZ,oBAAoB,EACpB,yBAAyB,EACzB,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,aAAa,EAAiB,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAAE,yBAAyB,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAUxF;;GAEG;AACH,qBAAa,gBAAiB,YAAW,YAAY;IASnD,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IAEjC,OAAO,CAAC,QAAQ,CAAC,cAAc;IAXhC,SAAgB,GAAG,YAAY;IAE/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAc;IAEpC;;OAEG;gBAEe,MAAM,EAAE,eAAe,EACvB,gBAAgB,EAAE,gBAAgB,EACnD,eAAe,EAAE,eAAe,EACf,cAAc,EAAE,yBAAyB,EAC1D,OAAO,GAAE,aAAgD;IAK1D;;;;;;OAMG;IACH,OAAO,CAAC,aAAa;IAsBd,gBAAgB,CACtB,SAAS,EAAE,yBAAyB,EACpC,QAAQ,CAAC,EAAE,OAAO,EAClB,UAAU,CAAC,EAAE,OAAO,EACpB,gBAAgB,CAAC,EAAE,iBAAiB,GAClC,qBAAqB;IAIX,SAAS,CACrB,SAAS,EAAE,yBAAyB,EACpC,QAAQ,CAAC,EAAE,OAAO,EAClB,UAAU,CAAC,EAAE,OAAO,EACpB,gBAAgB,CAAC,EAAE,iBAAiB,GAClC,OAAO,CAAC,qBAAqB,CAAC;IAI1B,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,sBAAsB;IAU7C,IAAI,CAChB,QAAQ,EAAE,sBAAsB,EAChC,KAAK,EAAE,oBAAoB,GACzB,OAAO,CAAC,IAAI,CAAC;CAuChB"}
+{"version":3,"file":"forestSummarizer.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/forestSummarizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,sBAAsB,EAAE,MAAM,uCAAuC,CAAC;AAC/E,OAAO,EACN,sBAAsB,EACtB,qBAAqB,EACrB,iBAAiB,EACjB,MAAM,qCAAqC,CAAC;AAG7C,OAAO,EAAE,aAAa,EAAiB,MAAM,sBAAsB,CAAC;AACpE,OAAO,EAIN,eAAe,EAGf,gBAAgB,EAMhB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACN,YAAY,EACZ,oBAAoB,EACpB,yBAAyB,EACzB,MAAM,iCAAiC,CAAC;AAIzC,OAAO,EAAE,eAAe,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAC;AASxF;;GAEG;AACH,qBAAa,gBAAiB,YAAW,YAAY;IASnD,OAAO,CAAC,QAAQ,CAAC,MAAM;IACvB,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IAEjC,OAAO,CAAC,QAAQ,CAAC,cAAc;IAXhC,SAAgB,GAAG,YAAY;IAE/B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAc;IAEpC;;OAEG;gBAEe,MAAM,EAAE,eAAe,EACvB,gBAAgB,EAAE,gBAAgB,EACnD,eAAe,EAAE,eAAe,EACf,cAAc,EAAE,yBAAyB,EAC1D,OAAO,GAAE,aAAgD;IAK1D;;;;;;OAMG;IACH,OAAO,CAAC,aAAa;IAsBd,gBAAgB,CACtB,SAAS,EAAE,yBAAyB,EACpC,QAAQ,CAAC,EAAE,OAAO,EAClB,UAAU,CAAC,EAAE,OAAO,EACpB,gBAAgB,CAAC,EAAE,iBAAiB,GAClC,qBAAqB;IAIX,SAAS,CACrB,SAAS,EAAE,yBAAyB,EACpC,QAAQ,CAAC,EAAE,OAAO,EAClB,UAAU,CAAC,EAAE,OAAO,EACpB,gBAAgB,CAAC,EAAE,iBAAiB,GAClC,OAAO,CAAC,qBAAqB,CAAC;IAI1B,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,sBAAsB;IAU7C,IAAI,CAChB,QAAQ,EAAE,sBAAsB,EAChC,KAAK,EAAE,oBAAoB,GACzB,OAAO,CAAC,IAAI,CAAC;CAuChB"}

package/dist/feature-libraries/forest-summary/forestSummarizer.js

@@ -6,11 +6,11 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ForestSummarizer = void 0;
 const client_utils_1 = require("@fluid-internal/client-utils");
-const shared_object_base_1 = require("@fluidframework/shared-object-base");
-const core_utils_1 = require("@fluidframework/core-utils");
-const index_js_1 = require("../../core/index.js");
-const index_js_2 = require("../../util/index.js");
-const index_js_3 = require("../../codec/index.js");
+const internal_1 = require("@fluidframework/core-utils/internal");
+const internal_2 = require("@fluidframework/shared-object-base/internal");
+const index_js_1 = require("../../codec/index.js");
+const index_js_2 = require("../../core/index.js");
+const index_js_3 = require("../../util/index.js");
 // eslint-disable-next-line import/no-internal-modules
 const chunkTree_js_1 = require("../chunked-forest/chunkTree.js");
 const codec_js_1 = require("./codec.js");
@@ -25,7 +25,7 @@ class ForestSummarizer {
     /**
      * @param encoderContext - The schema if provided here must be mutated by the caller to keep it up to date.
      */
-    constructor(forest, revisionTagCodec, fieldBatchCodec, encoderContext, options = { jsonValidator: index_js_3.noopValidator }) {
+    constructor(forest, revisionTagCodec, fieldBatchCodec, encoderContext, options = { jsonValidator: index_js_1.noopValidator }) {
         this.forest = forest;
         this.revisionTagCodec = revisionTagCodec;
         this.encoderContext = encoderContext;
@@ -43,10 +43,10 @@ class ForestSummarizer {
         const rootCursor = this.forest.getCursorAboveDetachedFields();
         const fieldMap = new Map();
         // TODO: Encode all detached fields in one operation for better performance and compression
-        (0, index_js_1.forEachField)(rootCursor, (cursor) => {
+        (0, index_js_2.forEachField)(rootCursor, (cursor) => {
             const key = cursor.getFieldKey();
             const innerCursor = this.forest.allocateCursor();
-            (0, core_utils_1.assert)(this.forest.tryMoveCursorToField({ fieldKey: key, parent: undefined }, innerCursor) === 1 /* TreeNavigationResult.Ok */, 0x892 /* failed to navigate to field */);
+            (0, internal_1.assert)(this.forest.tryMoveCursorToField({ fieldKey: key, parent: undefined }, innerCursor) === 1 /* TreeNavigationResult.Ok */, 0x892 /* failed to navigate to field */);
             fieldMap.set(key, innerCursor);
         });
         const encoded = this.codec.encode(fieldMap, this.encoderContext);
@@ -54,10 +54,10 @@ class ForestSummarizer {
         return stringify(encoded);
     }
     getAttachSummary(stringify, fullTree, trackState, telemetryContext) {
-        return (0, shared_object_base_1.createSingleBlobSummary)(treeBlobKey, this.getTreeString(stringify));
+        return (0, internal_2.createSingleBlobSummary)(treeBlobKey, this.getTreeString(stringify));
     }
     async summarize(stringify, fullTree, trackState, telemetryContext) {
-        return (0, shared_object_base_1.createSingleBlobSummary)(treeBlobKey, this.getTreeString(stringify));
+        return (0, internal_2.createSingleBlobSummary)(treeBlobKey, this.getTreeString(stringify));
     }
     getGCData(fullGC) {
         // TODO: Properly implement garbage collection. Right now, garbage collection is performed automatically
@@ -75,12 +75,12 @@ class ForestSummarizer {
             // TODO: this code is parsing data without an optional validator, this should be defined in a typebox schema as part of the
             // forest summary format.
             const fields = this.codec.decode(parse(treeBufferString), this.encoderContext);
-            const allocator = (0, index_js_2.idAllocatorFromMaxId)();
+            const allocator = (0, index_js_3.idAllocatorFromMaxId)();
             const fieldChanges = [];
             const build = [];
             for (const [fieldKey, field] of fields) {
                 const chunked = (0, chunkTree_js_1.chunkField)(field, chunkTree_js_1.defaultChunkPolicy);
-                const nodeCursors = chunked.flatMap((chunk) => (0, index_js_1.mapCursorField)(chunk.cursor(), (cursor) => cursor.fork()));
+                const nodeCursors = chunked.flatMap((chunk) => (0, index_js_2.mapCursorField)(chunk.cursor(), (cursor) => cursor.fork()));
                 const buildId = { minor: allocator.allocate(nodeCursors.length) };
                 build.push({
                     id: buildId,
@@ -93,8 +93,8 @@ class ForestSummarizer {
                     },
                 ]);
             }
-            (0, core_utils_1.assert)(this.forest.isEmpty, 0x797 /* forest must be empty */);
-            (0, index_js_1.applyDelta)({ build, fields: new Map(fieldChanges) }, this.forest, (0, index_js_1.makeDetachedFieldIndex)("init", this.revisionTagCodec));
+            (0, internal_1.assert)(this.forest.isEmpty, 0x797 /* forest must be empty */);
+            (0, index_js_2.applyDelta)({ build, fields: new Map(fieldChanges) }, this.forest, (0, index_js_2.makeDetachedFieldIndex)("init", this.revisionTagCodec));
         }
     }
 }

package/dist/feature-libraries/forest-summary/forestSummarizer.js.map

@@ -1 +1 @@
-{"version":3,"file":"forestSummarizer.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/forestSummarizer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAA8D;AAO9D,2EAA6E;AAC7E,2DAAoD;AACpD,kDAa6B;AAM7B,kDAA2D;AAC3D,mDAAoE;AAEpE,sDAAsD;AACtD,iEAAgF;AAEhF,yCAAoE;AACpE;;GAEG;AACH,MAAM,WAAW,GAAG,YAAY,CAAC;AAEjC;;GAEG;AACH,MAAa,gBAAgB;IAK5B;;OAEG;IACH,YACkB,MAAuB,EACvB,gBAAkC,EACnD,eAAgC,EACf,cAAyC,EAC1D,UAAyB,EAAE,aAAa,EAAE,wBAAa,EAAE;QAJxC,WAAM,GAAN,MAAM,CAAiB;QACvB,qBAAgB,GAAhB,gBAAgB,CAAkB;QAElC,mBAAc,GAAd,cAAc,CAA2B;QAX3C,QAAG,GAAG,QAAQ,CAAC;QAc9B,IAAI,CAAC,KAAK,GAAG,IAAA,oCAAyB,EAAC,OAAO,EAAE,eAAe,CAAC,CAAC;IAClE,CAAC;IAED;;;;;;OAMG;IACK,aAAa,CAAC,SAAoC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,4BAA4B,EAAE,CAAC;QAC9D,MAAM,QAAQ,GAAoE,IAAI,GAAG,EAAE,CAAC;QAC5F,2FAA2F;QAC3F,IAAA,uBAAY,EAAC,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE;YACnC,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACjC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YACjD,IAAA,mBAAM,EACL,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAC/B,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,EACpC,WAAW,CACX,oCAA4B,EAC7B,KAAK,CAAC,iCAAiC,CACvC,CAAC;YACF,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,WAA+D,CAAC,CAAC;QACpF,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAEjE,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1C,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAEM,gBAAgB,CACtB,SAAoC,EACpC,QAAkB,EAClB,UAAoB,EACpB,gBAAoC;QAEpC,OAAO,IAAA,4CAAuB,EAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,KAAK,CAAC,SAAS,CACrB,SAAoC,EACpC,QAAkB,EAClB,UAAoB,EACpB,gBAAoC;QAEpC,OAAO,IAAA,4CAAuB,EAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,SAAS,CAAC,MAAgB;QAChC,wGAAwG;QACxG,0GAA0G;QAC1G,2GAA2G;QAC3G,QAAQ;QACR,OAAO;YACN,OAAO,EAAE,EAAE;SACX,CAAC;IACH,CAAC;IAEM,KAAK,CAAC,IAAI,CAChB,QAAgC,EAChC,KAA2B;QAE3B,IAAI,MAAM,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE;YACzC,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACxD,MAAM,gBAAgB,GAAG,IAAA,6BAAc,EAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YAC5D,2HAA2H;YAC3H,yBAAyB;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC/B,KAAK,CAAC,gBAAgB,CAAW,EACjC,IAAI,CAAC,cAAc,CACnB,CAAC;YACF,MAAM,SAAS,GAAG,IAAA,+BAAoB,GAAE,CAAC;YACzC,MAAM,YAAY,GAAoC,EAAE,CAAC;YACzD,MAAM,KAAK,GAA6B,EAAE,CAAC;YAC3C,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE;gBACvC,MAAM,OAAO,GAAG,IAAA,yBAAU,EAAC,KAAK,EAAE,iCAAkB,CAAC,CAAC;gBACtD,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7C,IAAA,yBAAc,EAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CACzD,CAAC;gBACF,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClE,KAAK,CAAC,IAAI,CAAC;oBACV,EAAE,EAAE,OAAO;oBACX,KAAK,EAAE,WAAW;iBAClB,CAAC,CAAC;gBACH,YAAY,CAAC,IAAI,CAAC;oBACjB,QAAQ;oBACR;wBACC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;qBACvD;iBACD,CAAC,CAAC;aACH;YAED,IAAA,mBAAM,EAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;YAC9D,IAAA,qBAAU,EACT,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,YAAY,CAAC,EAAE,EACxC,IAAI,CAAC,MAAM,EACX,IAAA,iCAAsB,EAAC,MAAM,EAAE,IAAI,CAAC,gBAAgB,CAAC,CACrD,CAAC;SACF;IACF,CAAC;CACD;AArHD,4CAqHC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { bufferToString } from \"@fluid-internal/client-utils\";\nimport { IChannelStorageService } from \"@fluidframework/datastore-definitions\";\nimport {\n\tITelemetryContext,\n\tISummaryTreeWithStats,\n\tIGarbageCollectionData,\n} from \"@fluidframework/runtime-definitions\";\nimport { createSingleBlobSummary } from \"@fluidframework/shared-object-base\";\nimport { assert } from \"@fluidframework/core-utils\";\nimport {\n\tapplyDelta,\n\tDeltaDetachedNodeBuild,\n\tDeltaFieldChanges,\n\tFieldKey,\n\tforEachField,\n\tIEditableForest,\n\tITreeCursorSynchronous,\n\tITreeSubscriptionCursor,\n\tmakeDetachedFieldIndex,\n\tmapCursorField,\n\tRevisionTagCodec,\n\tTreeNavigationResult,\n} from \"../../core/index.js\";\nimport {\n\tSummarizable,\n\tSummaryElementParser,\n\tSummaryElementStringifier,\n} from \"../../shared-tree-core/index.js\";\nimport { idAllocatorFromMaxId } from \"../../util/index.js\";\nimport { ICodecOptions, noopValidator } from \"../../codec/index.js\";\nimport { FieldBatchEncodingContext, FieldBatchCodec } from \"../chunked-forest/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { chunkField, defaultChunkPolicy } from \"../chunked-forest/chunkTree.js\";\nimport { Format } from \"./format.js\";\nimport { ForestCodec, makeForestSummarizerCodec } from \"./codec.js\";\n/**\n * The storage key for the blob in the summary containing tree data\n */\nconst treeBlobKey = \"ForestTree\";\n\n/**\n * Provides methods for summarizing and loading a forest.\n */\nexport class ForestSummarizer implements Summarizable {\n\tpublic readonly key = \"Forest\";\n\n\tprivate readonly codec: ForestCodec;\n\n\t/**\n\t * @param encoderContext - The schema if provided here must be mutated by the caller to keep it up to date.\n\t */\n\tpublic constructor(\n\t\tprivate readonly forest: IEditableForest,\n\t\tprivate readonly revisionTagCodec: RevisionTagCodec,\n\t\tfieldBatchCodec: FieldBatchCodec,\n\t\tprivate readonly encoderContext: FieldBatchEncodingContext,\n\t\toptions: ICodecOptions = { jsonValidator: noopValidator },\n\t) {\n\t\tthis.codec = makeForestSummarizerCodec(options, fieldBatchCodec);\n\t}\n\n\t/**\n\t * Synchronous monolithic summarization of tree content.\n\t *\n\t * TODO: when perf matters, this should be replaced with a chunked async version using a binary format.\n\t *\n\t * @returns a snapshot of the forest's tree as a string.\n\t */\n\tprivate getTreeString(stringify: SummaryElementStringifier): string {\n\t\tconst rootCursor = this.forest.getCursorAboveDetachedFields();\n\t\tconst fieldMap: Map<FieldKey, ITreeCursorSynchronous & ITreeSubscriptionCursor> = new Map();\n\t\t// TODO: Encode all detached fields in one operation for better performance and compression\n\t\tforEachField(rootCursor, (cursor) => {\n\t\t\tconst key = cursor.getFieldKey();\n\t\t\tconst innerCursor = this.forest.allocateCursor();\n\t\t\tassert(\n\t\t\t\tthis.forest.tryMoveCursorToField(\n\t\t\t\t\t{ fieldKey: key, parent: undefined },\n\t\t\t\t\tinnerCursor,\n\t\t\t\t) === TreeNavigationResult.Ok,\n\t\t\t\t0x892 /* failed to navigate to field */,\n\t\t\t);\n\t\t\tfieldMap.set(key, innerCursor as ITreeCursorSynchronous & ITreeSubscriptionCursor);\n\t\t});\n\t\tconst encoded = this.codec.encode(fieldMap, this.encoderContext);\n\n\t\tfieldMap.forEach((value) => value.free());\n\t\treturn stringify(encoded);\n\t}\n\n\tpublic getAttachSummary(\n\t\tstringify: SummaryElementStringifier,\n\t\tfullTree?: boolean,\n\t\ttrackState?: boolean,\n\t\ttelemetryContext?: ITelemetryContext,\n\t): ISummaryTreeWithStats {\n\t\treturn createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));\n\t}\n\n\tpublic async summarize(\n\t\tstringify: SummaryElementStringifier,\n\t\tfullTree?: boolean,\n\t\ttrackState?: boolean,\n\t\ttelemetryContext?: ITelemetryContext,\n\t): Promise<ISummaryTreeWithStats> {\n\t\treturn createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));\n\t}\n\n\tpublic getGCData(fullGC?: boolean): IGarbageCollectionData {\n\t\t// TODO: Properly implement garbage collection. Right now, garbage collection is performed automatically\n\t\t// by the code in SharedObject (from which SharedTreeCore extends). The `runtime.uploadBlob` API delegates\n\t\t// to the `BlobManager`, which automatically populates the summary with ISummaryAttachment entries for each\n\t\t// blob.\n\t\treturn {\n\t\t\tgcNodes: {},\n\t\t};\n\t}\n\n\tpublic async load(\n\t\tservices: IChannelStorageService,\n\t\tparse: SummaryElementParser,\n\t): Promise<void> {\n\t\tif (await services.contains(treeBlobKey)) {\n\t\t\tconst treeBuffer = await services.readBlob(treeBlobKey);\n\t\t\tconst treeBufferString = bufferToString(treeBuffer, \"utf8\");\n\t\t\t// TODO: this code is parsing data without an optional validator, this should be defined in a typebox schema as part of the\n\t\t\t// forest summary format.\n\t\t\tconst fields = this.codec.decode(\n\t\t\t\tparse(treeBufferString) as Format,\n\t\t\t\tthis.encoderContext,\n\t\t\t);\n\t\t\tconst allocator = idAllocatorFromMaxId();\n\t\t\tconst fieldChanges: [FieldKey, DeltaFieldChanges][] = [];\n\t\t\tconst build: DeltaDetachedNodeBuild[] = [];\n\t\t\tfor (const [fieldKey, field] of fields) {\n\t\t\t\tconst chunked = chunkField(field, defaultChunkPolicy);\n\t\t\t\tconst nodeCursors = chunked.flatMap((chunk) =>\n\t\t\t\t\tmapCursorField(chunk.cursor(), (cursor) => cursor.fork()),\n\t\t\t\t);\n\t\t\t\tconst buildId = { minor: allocator.allocate(nodeCursors.length) };\n\t\t\t\tbuild.push({\n\t\t\t\t\tid: buildId,\n\t\t\t\t\ttrees: nodeCursors,\n\t\t\t\t});\n\t\t\t\tfieldChanges.push([\n\t\t\t\t\tfieldKey,\n\t\t\t\t\t{\n\t\t\t\t\t\tlocal: [{ count: nodeCursors.length, attach: buildId }],\n\t\t\t\t\t},\n\t\t\t\t]);\n\t\t\t}\n\n\t\t\tassert(this.forest.isEmpty, 0x797 /* forest must be empty */);\n\t\t\tapplyDelta(\n\t\t\t\t{ build, fields: new Map(fieldChanges) },\n\t\t\t\tthis.forest,\n\t\t\t\tmakeDetachedFieldIndex(\"init\", this.revisionTagCodec),\n\t\t\t);\n\t\t}\n\t}\n}\n"]}
+{"version":3,"file":"forestSummarizer.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/forestSummarizer.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+DAA8D;AAC9D,kEAA6D;AAO7D,0EAAsF;AAEtF,mDAAoE;AACpE,kDAa6B;AAM7B,kDAA2D;AAC3D,sDAAsD;AACtD,iEAAgF;AAGhF,yCAAoE;AAEpE;;GAEG;AACH,MAAM,WAAW,GAAG,YAAY,CAAC;AAEjC;;GAEG;AACH,MAAa,gBAAgB;IAK5B;;OAEG;IACH,YACkB,MAAuB,EACvB,gBAAkC,EACnD,eAAgC,EACf,cAAyC,EAC1D,UAAyB,EAAE,aAAa,EAAE,wBAAa,EAAE;QAJxC,WAAM,GAAN,MAAM,CAAiB;QACvB,qBAAgB,GAAhB,gBAAgB,CAAkB;QAElC,mBAAc,GAAd,cAAc,CAA2B;QAX3C,QAAG,GAAG,QAAQ,CAAC;QAc9B,IAAI,CAAC,KAAK,GAAG,IAAA,oCAAyB,EAAC,OAAO,EAAE,eAAe,CAAC,CAAC;IAClE,CAAC;IAED;;;;;;OAMG;IACK,aAAa,CAAC,SAAoC;QACzD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,4BAA4B,EAAE,CAAC;QAC9D,MAAM,QAAQ,GAAoE,IAAI,GAAG,EAAE,CAAC;QAC5F,2FAA2F;QAC3F,IAAA,uBAAY,EAAC,UAAU,EAAE,CAAC,MAAM,EAAE,EAAE;YACnC,MAAM,GAAG,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;YACjC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,cAAc,EAAE,CAAC;YACjD,IAAA,iBAAM,EACL,IAAI,CAAC,MAAM,CAAC,oBAAoB,CAC/B,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,EACpC,WAAW,CACX,oCAA4B,EAC7B,KAAK,CAAC,iCAAiC,CACvC,CAAC;YACF,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,WAA+D,CAAC,CAAC;QACpF,CAAC,CAAC,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;QAEjE,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QAC1C,OAAO,SAAS,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAEM,gBAAgB,CACtB,SAAoC,EACpC,QAAkB,EAClB,UAAoB,EACpB,gBAAoC;QAEpC,OAAO,IAAA,kCAAuB,EAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,KAAK,CAAC,SAAS,CACrB,SAAoC,EACpC,QAAkB,EAClB,UAAoB,EACpB,gBAAoC;QAEpC,OAAO,IAAA,kCAAuB,EAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,SAAS,CAAC,MAAgB;QAChC,wGAAwG;QACxG,0GAA0G;QAC1G,2GAA2G;QAC3G,QAAQ;QACR,OAAO;YACN,OAAO,EAAE,EAAE;SACX,CAAC;IACH,CAAC;IAEM,KAAK,CAAC,IAAI,CAChB,QAAgC,EAChC,KAA2B;QAE3B,IAAI,MAAM,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE;YACzC,MAAM,UAAU,GAAG,MAAM,QAAQ,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACxD,MAAM,gBAAgB,GAAG,IAAA,6BAAc,EAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YAC5D,2HAA2H;YAC3H,yBAAyB;YACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAC/B,KAAK,CAAC,gBAAgB,CAAW,EACjC,IAAI,CAAC,cAAc,CACnB,CAAC;YACF,MAAM,SAAS,GAAG,IAAA,+BAAoB,GAAE,CAAC;YACzC,MAAM,YAAY,GAAoC,EAAE,CAAC;YACzD,MAAM,KAAK,GAA6B,EAAE,CAAC;YAC3C,KAAK,MAAM,CAAC,QAAQ,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE;gBACvC,MAAM,OAAO,GAAG,IAAA,yBAAU,EAAC,KAAK,EAAE,iCAAkB,CAAC,CAAC;gBACtD,MAAM,WAAW,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAC7C,IAAA,yBAAc,EAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CACzD,CAAC;gBACF,MAAM,OAAO,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;gBAClE,KAAK,CAAC,IAAI,CAAC;oBACV,EAAE,EAAE,OAAO;oBACX,KAAK,EAAE,WAAW;iBAClB,CAAC,CAAC;gBACH,YAAY,CAAC,IAAI,CAAC;oBACjB,QAAQ;oBACR;wBACC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;qBACvD;iBACD,CAAC,CAAC;aACH;YAED,IAAA,iBAAM,EAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,0BAA0B,CAAC,CAAC;YAC9D,IAAA,qBAAU,EACT,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,GAAG,CAAC,YAAY,CAAC,EAAE,EACxC,IAAI,CAAC,MAAM,EACX,IAAA,iCAAsB,EAAC,MAAM,EAAE,IAAI,CAAC,gBAAgB,CAAC,CACrD,CAAC;SACF;IACF,CAAC;CACD;AArHD,4CAqHC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { bufferToString } from \"@fluid-internal/client-utils\";\nimport { assert } from \"@fluidframework/core-utils/internal\";\nimport { IChannelStorageService } from \"@fluidframework/datastore-definitions\";\nimport {\n\tIGarbageCollectionData,\n\tISummaryTreeWithStats,\n\tITelemetryContext,\n} from \"@fluidframework/runtime-definitions\";\nimport { createSingleBlobSummary } from \"@fluidframework/shared-object-base/internal\";\n\nimport { ICodecOptions, noopValidator } from \"../../codec/index.js\";\nimport {\n\tDeltaDetachedNodeBuild,\n\tDeltaFieldChanges,\n\tFieldKey,\n\tIEditableForest,\n\tITreeCursorSynchronous,\n\tITreeSubscriptionCursor,\n\tRevisionTagCodec,\n\tTreeNavigationResult,\n\tapplyDelta,\n\tforEachField,\n\tmakeDetachedFieldIndex,\n\tmapCursorField,\n} from \"../../core/index.js\";\nimport {\n\tSummarizable,\n\tSummaryElementParser,\n\tSummaryElementStringifier,\n} from \"../../shared-tree-core/index.js\";\nimport { idAllocatorFromMaxId } from \"../../util/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { chunkField, defaultChunkPolicy } from \"../chunked-forest/chunkTree.js\";\nimport { FieldBatchCodec, FieldBatchEncodingContext } from \"../chunked-forest/index.js\";\n\nimport { ForestCodec, makeForestSummarizerCodec } from \"./codec.js\";\nimport { Format } from \"./format.js\";\n/**\n * The storage key for the blob in the summary containing tree data\n */\nconst treeBlobKey = \"ForestTree\";\n\n/**\n * Provides methods for summarizing and loading a forest.\n */\nexport class ForestSummarizer implements Summarizable {\n\tpublic readonly key = \"Forest\";\n\n\tprivate readonly codec: ForestCodec;\n\n\t/**\n\t * @param encoderContext - The schema if provided here must be mutated by the caller to keep it up to date.\n\t */\n\tpublic constructor(\n\t\tprivate readonly forest: IEditableForest,\n\t\tprivate readonly revisionTagCodec: RevisionTagCodec,\n\t\tfieldBatchCodec: FieldBatchCodec,\n\t\tprivate readonly encoderContext: FieldBatchEncodingContext,\n\t\toptions: ICodecOptions = { jsonValidator: noopValidator },\n\t) {\n\t\tthis.codec = makeForestSummarizerCodec(options, fieldBatchCodec);\n\t}\n\n\t/**\n\t * Synchronous monolithic summarization of tree content.\n\t *\n\t * TODO: when perf matters, this should be replaced with a chunked async version using a binary format.\n\t *\n\t * @returns a snapshot of the forest's tree as a string.\n\t */\n\tprivate getTreeString(stringify: SummaryElementStringifier): string {\n\t\tconst rootCursor = this.forest.getCursorAboveDetachedFields();\n\t\tconst fieldMap: Map<FieldKey, ITreeCursorSynchronous & ITreeSubscriptionCursor> = new Map();\n\t\t// TODO: Encode all detached fields in one operation for better performance and compression\n\t\tforEachField(rootCursor, (cursor) => {\n\t\t\tconst key = cursor.getFieldKey();\n\t\t\tconst innerCursor = this.forest.allocateCursor();\n\t\t\tassert(\n\t\t\t\tthis.forest.tryMoveCursorToField(\n\t\t\t\t\t{ fieldKey: key, parent: undefined },\n\t\t\t\t\tinnerCursor,\n\t\t\t\t) === TreeNavigationResult.Ok,\n\t\t\t\t0x892 /* failed to navigate to field */,\n\t\t\t);\n\t\t\tfieldMap.set(key, innerCursor as ITreeCursorSynchronous & ITreeSubscriptionCursor);\n\t\t});\n\t\tconst encoded = this.codec.encode(fieldMap, this.encoderContext);\n\n\t\tfieldMap.forEach((value) => value.free());\n\t\treturn stringify(encoded);\n\t}\n\n\tpublic getAttachSummary(\n\t\tstringify: SummaryElementStringifier,\n\t\tfullTree?: boolean,\n\t\ttrackState?: boolean,\n\t\ttelemetryContext?: ITelemetryContext,\n\t): ISummaryTreeWithStats {\n\t\treturn createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));\n\t}\n\n\tpublic async summarize(\n\t\tstringify: SummaryElementStringifier,\n\t\tfullTree?: boolean,\n\t\ttrackState?: boolean,\n\t\ttelemetryContext?: ITelemetryContext,\n\t): Promise<ISummaryTreeWithStats> {\n\t\treturn createSingleBlobSummary(treeBlobKey, this.getTreeString(stringify));\n\t}\n\n\tpublic getGCData(fullGC?: boolean): IGarbageCollectionData {\n\t\t// TODO: Properly implement garbage collection. Right now, garbage collection is performed automatically\n\t\t// by the code in SharedObject (from which SharedTreeCore extends). The `runtime.uploadBlob` API delegates\n\t\t// to the `BlobManager`, which automatically populates the summary with ISummaryAttachment entries for each\n\t\t// blob.\n\t\treturn {\n\t\t\tgcNodes: {},\n\t\t};\n\t}\n\n\tpublic async load(\n\t\tservices: IChannelStorageService,\n\t\tparse: SummaryElementParser,\n\t): Promise<void> {\n\t\tif (await services.contains(treeBlobKey)) {\n\t\t\tconst treeBuffer = await services.readBlob(treeBlobKey);\n\t\t\tconst treeBufferString = bufferToString(treeBuffer, \"utf8\");\n\t\t\t// TODO: this code is parsing data without an optional validator, this should be defined in a typebox schema as part of the\n\t\t\t// forest summary format.\n\t\t\tconst fields = this.codec.decode(\n\t\t\t\tparse(treeBufferString) as Format,\n\t\t\t\tthis.encoderContext,\n\t\t\t);\n\t\t\tconst allocator = idAllocatorFromMaxId();\n\t\t\tconst fieldChanges: [FieldKey, DeltaFieldChanges][] = [];\n\t\t\tconst build: DeltaDetachedNodeBuild[] = [];\n\t\t\tfor (const [fieldKey, field] of fields) {\n\t\t\t\tconst chunked = chunkField(field, defaultChunkPolicy);\n\t\t\t\tconst nodeCursors = chunked.flatMap((chunk) =>\n\t\t\t\t\tmapCursorField(chunk.cursor(), (cursor) => cursor.fork()),\n\t\t\t\t);\n\t\t\t\tconst buildId = { minor: allocator.allocate(nodeCursors.length) };\n\t\t\t\tbuild.push({\n\t\t\t\t\tid: buildId,\n\t\t\t\t\ttrees: nodeCursors,\n\t\t\t\t});\n\t\t\t\tfieldChanges.push([\n\t\t\t\t\tfieldKey,\n\t\t\t\t\t{\n\t\t\t\t\t\tlocal: [{ count: nodeCursors.length, attach: buildId }],\n\t\t\t\t\t},\n\t\t\t\t]);\n\t\t\t}\n\n\t\t\tassert(this.forest.isEmpty, 0x797 /* forest must be empty */);\n\t\t\tapplyDelta(\n\t\t\t\t{ build, fields: new Map(fieldChanges) },\n\t\t\t\tthis.forest,\n\t\t\t\tmakeDetachedFieldIndex(\"init\", this.revisionTagCodec),\n\t\t\t);\n\t\t}\n\t}\n}\n"]}

package/dist/feature-libraries/forest-summary/format.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/format.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAQ,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAGnD,eAAO,MAAM,OAAO,IAAM,CAAC;AAE3B,eAAO,MAAM,MAAM;;;;;;EAOlB,CAAC;AAEF,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC"}
+{"version":3,"file":"format.d.ts","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/format.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAQ,MAAM,mBAAmB,CAAC;AAGjD,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,eAAO,MAAM,OAAO,IAAM,CAAC;AAE3B,eAAO,MAAM,MAAM;;;;;;EAOlB,CAAC;AAEF,MAAM,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,MAAM,CAAC,CAAC"}

package/dist/feature-libraries/forest-summary/format.js

@@ -6,12 +6,12 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Format = exports.version = void 0;
 const typebox_1 = require("@sinclair/typebox");
-const index_js_1 = require("../../core/index.js");
-const index_js_2 = require("../../codec/index.js");
+const index_js_1 = require("../../codec/index.js");
+const index_js_2 = require("../../core/index.js");
 exports.version = 1.0;
 exports.Format = typebox_1.Type.Object({
     version: typebox_1.Type.Literal(exports.version),
-    keys: typebox_1.Type.Array(index_js_1.schemaFormat.FieldKeySchema),
-    fields: index_js_2.Versioned,
+    keys: typebox_1.Type.Array(index_js_2.schemaFormat.FieldKeySchema),
+    fields: index_js_1.Versioned,
 }, { additionalProperties: false });
 //# sourceMappingURL=format.js.map

package/dist/feature-libraries/forest-summary/format.js.map

@@ -1 +1 @@
-{"version":3,"file":"format.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/format.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+CAAiD;AACjD,kDAAmD;AACnD,mDAAiD;AAEpC,QAAA,OAAO,GAAG,GAAG,CAAC;AAEd,QAAA,MAAM,GAAG,cAAI,CAAC,MAAM,CAChC;IACC,OAAO,EAAE,cAAI,CAAC,OAAO,CAAC,eAAO,CAAC;IAC9B,IAAI,EAAE,cAAI,CAAC,KAAK,CAAC,uBAAY,CAAC,cAAc,CAAC;IAC7C,MAAM,EAAE,oBAAS;CACjB,EACD,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAC/B,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Static, Type } from \"@sinclair/typebox\";\nimport { schemaFormat } from \"../../core/index.js\";\nimport { Versioned } from \"../../codec/index.js\";\n\nexport const version = 1.0;\n\nexport const Format = Type.Object(\n\t{\n\t\tversion: Type.Literal(version),\n\t\tkeys: Type.Array(schemaFormat.FieldKeySchema),\n\t\tfields: Versioned,\n\t},\n\t{ additionalProperties: false },\n);\n\nexport type Format = Static<typeof Format>;\n"]}
+{"version":3,"file":"format.js","sourceRoot":"","sources":["../../../src/feature-libraries/forest-summary/format.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAEH,+CAAiD;AAEjD,mDAAiD;AACjD,kDAAmD;AAEtC,QAAA,OAAO,GAAG,GAAG,CAAC;AAEd,QAAA,MAAM,GAAG,cAAI,CAAC,MAAM,CAChC;IACC,OAAO,EAAE,cAAI,CAAC,OAAO,CAAC,eAAO,CAAC;IAC9B,IAAI,EAAE,cAAI,CAAC,KAAK,CAAC,uBAAY,CAAC,cAAc,CAAC;IAC7C,MAAM,EAAE,oBAAS;CACjB,EACD,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAC/B,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Static, Type } from \"@sinclair/typebox\";\n\nimport { Versioned } from \"../../codec/index.js\";\nimport { schemaFormat } from \"../../core/index.js\";\n\nexport const version = 1.0;\n\nexport const Format = Type.Object(\n\t{\n\t\tversion: Type.Literal(version),\n\t\tkeys: Type.Array(schemaFormat.FieldKeySchema),\n\t\tfields: Versioned,\n\t},\n\t{ additionalProperties: false },\n);\n\nexport type Format = Static<typeof Format>;\n"]}

package/dist/feature-libraries/index.d.ts

@@ -3,8 +3,8 @@
  * Licensed under the MIT License.
  */
 export { createDataBinderBuffering, createDataBinderDirect, createDataBinderInvalidating, createBinderOptions, createFlushableBinderOptions, DataBinder, BinderOptions, Flushable, FlushableBinderOptions, FlushableDataBinder, MatchPolicy, SubtreePolicy, BindSyntaxTree, indexSymbol, BindPolicy, BindTree, BindTreeDefault, DownPath, BindPath, PathStep, BindingType, BindingContextType, BindingContext, VisitorBindingContext, RemoveBindingContext, InsertBindingContext, BatchBindingContext, InvalidationBindingContext, OperationBinderEvents, InvalidationBinderEvents, CompareFunction, BinderEventsCompare, AnchorsCompare, toDownPath, comparePipeline, compileSyntaxTree, } from "./editableTreeBinder.js";
-export { typeNameSymbol, valueSymbol, isTreeValue, ContextuallyTypedNodeDataObject, ContextuallyTypedNodeData, MarkedArrayLike, isContextuallyTypedNodeDataObject, getFieldKind, ArrayLikeMut, cursorFromContextualData, cursorsFromContextualData, ContextuallyTypedFieldData, cursorForTypedData, cursorForTypedTreeData, cursorsForTypedFieldData, normalizeNewFieldContent, NewFieldContent, getPossibleTypes, getAllowedTypes, } from "./contextuallyTyped.js";
-export { allowsValue, assertAllowedValue, isFluidHandle } from "./valueUtilities.js";
+export { typeNameSymbol, valueSymbol, ContextuallyTypedNodeDataObject, ContextuallyTypedNodeData, MarkedArrayLike, isContextuallyTypedNodeDataObject, getFieldKind, ArrayLikeMut, cursorFromContextualData, cursorsFromContextualData, ContextuallyTypedFieldData, cursorForTypedData, cursorForTypedTreeData, cursorsForTypedFieldData, normalizeNewFieldContent, NewFieldContent, getPossibleTypes, getAllowedTypes, } from "./contextuallyTyped.js";
+export { allowsValue, assertAllowedValue, isFluidHandle, isTreeValue } from "./valueUtilities.js";
 export { FieldGenerator, TreeDataContext } from "./fieldGenerator.js";
 export { ForestSummarizer } from "./forest-summary/index.js";
 export { cursorForMapTreeField, cursorForMapTreeNode, mapTreeFromCursor } from "./mapTreeCursor.js";
@@ -15,21 +15,20 @@ export { stackTreeNodeCursor, CursorAdapter, prefixPath, prefixFieldPath, Cursor
 export { cursorForJsonableTreeNode, cursorForJsonableTreeField, jsonableTreeFromCursor, jsonableTreeFromFieldCursor, jsonableTreeFromForest, } from "./treeTextCursor.js";
 import * as SequenceField from "./sequence-field/index.js";
 export { SequenceField };
-export { isNeverField, ModularEditBuilder, FieldEditDescription as EditDescription, FieldChangeHandler, FieldChangeRebaser, FieldEditor, NodeChangeset, FieldChangeMap, FieldChange, FieldChangeset, ToDelta, ModularChangeset, NodeChangeComposer, NodeChangeInverter, NodeChangeRebaser, CrossFieldManager, CrossFieldTarget, FlexFieldKind, FullSchemaPolicy, allowsRepoSuperset, GenericChangeset, genericFieldKind, HasFieldChanges, NodeExistsConstraint, NodeExistenceState, FieldKindWithEditor, ModularChangeFamily, makeV0Codec, RelevantRemovedRootsFromChild, EncodedModularChangeset, } from "./modular-schema/index.js";
-export { Multiplicity } from "./multiplicity.js";
-export { FlexTreeNodeSchema, FlexAllowedTypes, FlexFieldSchema, FlexTreeSchema, Any, SchemaLibraryData, LazyTreeNodeSchema, ViewSchema, SchemaLintConfiguration, FlexFieldNodeSchema, LeafNodeSchema, FlexMapNodeSchema, FlexObjectNodeSchema, schemaIsFieldNode, schemaIsLeaf, schemaIsMap, schemaIsObjectNode, Unenforced, AllowedTypeSet, markEager, FlexMapFieldSchema, SchemaCollection, TreeNodeSchemaBase, FlexListToUnion, LazyItem, isLazy, NormalizeObjectNodeFields, NormalizeField as NormalizeFieldSchema, FlexObjectNodeFields, intoStoredSchema, intoStoredSchemaCollection, ArrayToUnion, ExtractItemType, NormalizeLazyItem, FlexList, } from "./typed-schema/index.js";
+export { isNeverField, ModularEditBuilder, FieldEditDescription as EditDescription, FieldChangeHandler, FieldChangeRebaser, FieldEditor, FieldChangeMap, FieldChange, FieldChangeset, ToDelta, ModularChangeset, makeModularChangeCodecFamily, NodeChangeComposer, NodeChangeInverter, NodeChangeRebaser, NodeChangePruner, CrossFieldManager, CrossFieldTarget, FlexFieldKind, FullSchemaPolicy, allowsRepoSuperset, GenericChangeset, genericFieldKind, HasFieldChanges, NodeExistsConstraint, NodeExistenceState, FieldKindWithEditor, ModularChangeFamily, RelevantRemovedRootsFromChild, EncodedModularChangeset, NodeId, FieldChangeEncodingContext, FieldKindConfiguration, FieldKindConfigurationEntry, } from "./modular-schema/index.js";
+export { FlexTreeNodeSchema, FlexAllowedTypes, FlexFieldSchema, FlexTreeSchema, Any, SchemaLibraryData, LazyTreeNodeSchema, ViewSchema, SchemaLintConfiguration, FlexFieldNodeSchema, LeafNodeSchema, FlexMapNodeSchema, FlexObjectNodeSchema, schemaIsFieldNode, schemaIsLeaf, schemaIsMap, schemaIsObjectNode, Unenforced, AllowedTypeSet, markEager, FlexMapFieldSchema, SchemaCollection, TreeNodeSchemaBase, FlexListToUnion, LazyItem, isLazy, NormalizeObjectNodeFields, NormalizeField as NormalizeFieldSchema, FlexObjectNodeFields, intoStoredSchema, intoStoredSchemaCollection, ExtractItemType, NormalizeLazyItem, FlexList, } from "./typed-schema/index.js";
 export { SchemaBuilderBase, SchemaLibrary, FlexImplicitFieldSchema, NormalizeField, FlexImplicitAllowedTypes, NormalizeAllowedTypes, SchemaBuilderOptions, normalizeAllowedTypes, normalizeField, } from "./schemaBuilderBase.js";
 export { SchemaBuilderInternal } from "./schemaBuilder.js";
 export { mapRootChanges } from "./deltaUtils.js";
-export { TreeChunk, chunkTree, chunkFieldSingle, buildChunkedForest, defaultChunkPolicy, FieldBatch, FieldBatchCodec, makeTreeChunker, makeFieldBatchCodec, FieldBatchEncodingContext, SchemaAndPolicy, } from "./chunked-forest/index.js";
+export { TreeChunk, chunkTree, chunkFieldSingle, buildChunkedForest, defaultChunkPolicy, FieldBatch, FieldBatchCodec, makeTreeChunker, makeFieldBatchCodec, FieldBatchEncodingContext, } from "./chunked-forest/index.js";
 export { compareLocalNodeKeys, LocalNodeKey, createNodeKeyManager, createMockNodeKeyManager, StableNodeKey, NodeKeyIndex, NodeKeyManager, nodeKeyFieldKey, nodeKeyTreeIdentifier, } from "./node-key/index.js";
-export { FieldKinds, Required, Optional, Sequence, NodeKeyFieldKind, Forbidden, DefaultChangeset, DefaultChangeFamily, DefaultEditBuilder, IDefaultEditBuilder, ValueFieldEditBuilder, OptionalFieldEditBuilder, SequenceFieldEditBuilder, defaultSchemaPolicy, fieldKinds, intoDelta, relevantRemovedRoots, } from "./default-schema/index.js";
-export { AssignableFieldKinds, FlexTreeFieldNode, FlexibleFieldContent, FlexibleNodeContent, FlexTreeLeafNode, FlexTreeMapNode, FlexTreeOptionalField, FlexTreeRequiredField, FlexTreeSequenceField, Skip, FlexTreeObjectNode, FlexTreeObjectNodeTyped, FlexTreeContext, FlexTreeTypedField, FlexTreeTypedNode, FlexTreeTypedNodeUnion, FlexTreeEntity, FlexTreeField, FlexTreeNode, getTreeContext, CheckTypesOverlap, TreeStatus, Context, TreeEvent, EditableTreeEvents, FlexTreeUnknownUnboxed, onNextChange, isFlexTreeNode, FlexTreeTypedFieldInner, FlexTreeUnboxFieldInner, FlexTreeObjectNodeFields, FlexTreeUnboxField, FlexTreeUnboxNode, FlexTreeUnboxNodeUnion, FlexTreeNodeKeyField, IsArrayOfOne, FlexibleNodeSubSequence, flexTreeMarker, FlexTreeEntityKind, NodeKeys, PropertyNameFromFieldKey, ReservedObjectNodeFieldPropertyNames, ReservedObjectNodeFieldPropertyNamePrefixes, reservedObjectNodeFieldPropertyNames, reservedObjectNodeFieldPropertyNamePrefixes, FlexTreeObjectNodeFieldsInner, assertFlexTreeEntityNotFreed, } from "./flex-tree/index.js";
+export { FieldKinds, Required, Optional, Sequence, NodeKeyFieldKind, Identifier, Forbidden, DefaultChangeset, DefaultChangeFamily, DefaultEditBuilder, IDefaultEditBuilder, ValueFieldEditBuilder, OptionalFieldEditBuilder, SequenceFieldEditBuilder, defaultSchemaPolicy, fieldKinds, fieldKindConfigurations, intoDelta, relevantRemovedRoots, } from "./default-schema/index.js";
+export { AssignableFieldKinds, FlexTreeFieldNode, FlexibleFieldContent, FlexibleNodeContent, FlexTreeLeafNode, FlexTreeMapNode, FlexTreeOptionalField, FlexTreeRequiredField, FlexTreeSequenceField, Skip, FlexTreeObjectNode, FlexTreeObjectNodeTyped, FlexTreeContext, FlexTreeTypedField, FlexTreeTypedNode, FlexTreeTypedNodeUnion, FlexTreeEntity, FlexTreeField, FlexTreeNode, getTreeContext, CheckTypesOverlap, TreeStatus, Context, FlexTreeNodeEvents, FlexTreeUnknownUnboxed, isFlexTreeNode, ContextSlot, FlexTreeTypedFieldInner, FlexTreeUnboxFieldInner, FlexTreeObjectNodeFields, FlexTreeUnboxField, FlexTreeUnboxNode, FlexTreeUnboxNodeUnion, FlexTreeNodeKeyField, IsArrayOfOne, FlexibleNodeSubSequence, flexTreeMarker, FlexTreeEntityKind, NodeKeys, PropertyNameFromFieldKey, ReservedObjectNodeFieldPropertyNames, ReservedObjectNodeFieldPropertyNamePrefixes, reservedObjectNodeFieldPropertyNames, reservedObjectNodeFieldPropertyNamePrefixes, FlexTreeObjectNodeFieldsInner, assertFlexTreeEntityNotFreed, flexTreeSlot, } from "./flex-tree/index.js";
 export { treeSchemaFromStoredSchema } from "./storedToViewSchema.js";
 export { TreeCompressionStrategy } from "./treeCompressionUtils.js";
 export { valueSchemaAllows } from "./valueUtilities.js";
 export { InsertableFlexNode, InsertableFlexField, AllowedTypesToFlexInsertableTree, ApplyMultiplicity, CollectOptions, TypedFields, UnbrandedName, EmptyObject, } from "./schema-aware/index.js";
 export { DetachedFieldIndexSummarizer } from "./detachedFieldIndexSummarizer.js";
-export { SchemaChange, makeSchemaChangeCodec, EncodedSchemaChange } from "./schema-edits/index.js";
+export { SchemaChange, makeSchemaChangeCodecs, EncodedSchemaChange } from "./schema-edits/index.js";
 export { makeMitigatedChangeFamily } from "./mitigatedChangeFamily.js";
 //# sourceMappingURL=index.d.ts.map

package/dist/feature-libraries/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,EAC5B,mBAAmB,EACnB,4BAA4B,EAC5B,UAAU,EACV,aAAa,EACb,SAAS,EACT,sBAAsB,EACtB,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,cAAc,EACd,WAAW,EACX,UAAU,EACV,QAAQ,EACR,eAAe,EACf,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,WAAW,EACX,kBAAkB,EAClB,cAAc,EACd,qBAAqB,EACrB,oBAAoB,EACpB,oBAAoB,EACpB,mBAAmB,EACnB,0BAA0B,EAC1B,qBAAqB,EACrB,wBAAwB,EACxB,eAAe,EACf,mBAAmB,EACnB,cAAc,EACd,UAAU,EACV,eAAe,EACf,iBAAiB,GACjB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACN,cAAc,EACd,WAAW,EACX,WAAW,EACX,+BAA+B,EAC/B,yBAAyB,EACzB,eAAe,EACf,iCAAiC,EACjC,YAAY,EACZ,YAAY,EACZ,wBAAwB,EACxB,yBAAyB,EACzB,0BAA0B,EAC1B,kBAAkB,EAClB,sBAAsB,EACtB,wBAAwB,EACxB,wBAAwB,EACxB,eAAe,EACf,gBAAgB,EAChB,eAAe,GACf,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,WAAW,EAAE,kBAAkB,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAErF,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAEtE,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACpG,OAAO,EAAE,wBAAwB,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAClF,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC9F,OAAO,EACN,mBAAmB,EACnB,aAAa,EACb,UAAU,EACV,eAAe,EACf,cAAc,EACd,oBAAoB,GACpB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACN,yBAAyB,EACzB,0BAA0B,EAC1B,sBAAsB,EACtB,2BAA2B,EAC3B,sBAAsB,GACtB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,CAAC;AAEzB,OAAO,EACN,YAAY,EACZ,kBAAkB,EAClB,oBAAoB,IAAI,eAAe,EACvC,kBAAkB,EAClB,kBAAkB,EAClB,WAAW,EACX,aAAa,EACb,cAAc,EACd,WAAW,EACX,cAAc,EACd,OAAO,EACP,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,gBAAgB,EAChB,aAAa,EACb,gBAAgB,EAChB,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,EAChB,eAAe,EACf,oBAAoB,EACpB,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,WAAW,EACX,6BAA6B,EAC7B,uBAAuB,GACvB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAC;AAEjD,OAAO,EACN,kBAAkB,EAClB,gBAAgB,EAChB,eAAe,EACf,cAAc,EACd,GAAG,EACH,iBAAiB,EACjB,kBAAkB,EAClB,UAAU,EACV,uBAAuB,EACvB,mBAAmB,EACnB,cAAc,EACd,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,kBAAkB,EAClB,UAAU,EACV,cAAc,EACd,SAAS,EACT,kBAAkB,EAClB,gBAAgB,EAChB,kBAAkB,EAClB,eAAe,EACf,QAAQ,EACR,MAAM,EACN,yBAAyB,EACzB,cAAc,IAAI,oBAAoB,EACtC,oBAAoB,EACpB,gBAAgB,EAChB,0BAA0B,EAC1B,YAAY,EACZ,eAAe,EACf,iBAAiB,EACjB,QAAQ,GACR,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACN,iBAAiB,EACjB,aAAa,EACb,uBAAuB,EACvB,cAAc,EACd,wBAAwB,EACxB,qBAAqB,EACrB,oBAAoB,EACpB,qBAAqB,EACrB,cAAc,GACd,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAE3D,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEjD,OAAO,EACN,SAAS,EACT,SAAS,EACT,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,EAClB,UAAU,EACV,eAAe,EACf,eAAe,EACf,mBAAmB,EACnB,yBAAyB,EACzB,eAAe,GACf,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACN,oBAAoB,EACpB,YAAY,EACZ,oBAAoB,EACpB,wBAAwB,EACxB,aAAa,EACb,YAAY,EACZ,cAAc,EACd,eAAe,EACf,qBAAqB,GACrB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EACN,UAAU,EACV,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,gBAAgB,EAChB,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,kBAAkB,EAClB,mBAAmB,EACnB,qBAAqB,EACrB,wBAAwB,EACxB,wBAAwB,EACxB,mBAAmB,EACnB,UAAU,EACV,SAAS,EACT,oBAAoB,GACpB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACN,oBAAoB,EACpB,iBAAiB,EACjB,oBAAoB,EACpB,mBAAmB,EACnB,gBAAgB,EAChB,eAAe,EACf,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,EACrB,IAAI,EACJ,kBAAkB,EAClB,uBAAuB,EACvB,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,cAAc,EACd,iBAAiB,EACjB,UAAU,EACV,OAAO,EACP,SAAS,EACT,kBAAkB,EAClB,sBAAsB,EACtB,YAAY,EACZ,cAAc,EAGd,uBAAuB,EACvB,uBAAuB,EACvB,wBAAwB,EACxB,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,oBAAoB,EACpB,YAAY,EACZ,uBAAuB,EACvB,cAAc,EACd,kBAAkB,EAClB,QAAQ,EACR,wBAAwB,EACxB,oCAAoC,EACpC,2CAA2C,EAC3C,oCAAoC,EACpC,2CAA2C,EAC3C,6BAA6B,EAC7B,4BAA4B,GAC5B,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,0BAA0B,EAAE,MAAM,yBAAyB,CAAC;AAErE,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD,OAAO,EACN,kBAAkB,EAClB,mBAAmB,EACnB,gCAAgC,EAChC,iBAAiB,EAGjB,cAAc,EACd,WAAW,EACX,aAAa,EACb,WAAW,GACX,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EAAE,4BAA4B,EAAE,MAAM,mCAAmC,CAAC;AAEjF,OAAO,EAAE,YAAY,EAAE,qBAAqB,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAEnG,OAAO,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/feature-libraries/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,yBAAyB,EACzB,sBAAsB,EACtB,4BAA4B,EAC5B,mBAAmB,EACnB,4BAA4B,EAC5B,UAAU,EACV,aAAa,EACb,SAAS,EACT,sBAAsB,EACtB,mBAAmB,EACnB,WAAW,EACX,aAAa,EACb,cAAc,EACd,WAAW,EACX,UAAU,EACV,QAAQ,EACR,eAAe,EACf,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,WAAW,EACX,kBAAkB,EAClB,cAAc,EACd,qBAAqB,EACrB,oBAAoB,EACpB,oBAAoB,EACpB,mBAAmB,EACnB,0BAA0B,EAC1B,qBAAqB,EACrB,wBAAwB,EACxB,eAAe,EACf,mBAAmB,EACnB,cAAc,EACd,UAAU,EACV,eAAe,EACf,iBAAiB,GACjB,MAAM,yBAAyB,CAAC;AACjC,OAAO,EACN,cAAc,EACd,WAAW,EACX,+BAA+B,EAC/B,yBAAyB,EACzB,eAAe,EACf,iCAAiC,EACjC,YAAY,EACZ,YAAY,EACZ,wBAAwB,EACxB,yBAAyB,EACzB,0BAA0B,EAC1B,kBAAkB,EAClB,sBAAsB,EACtB,wBAAwB,EACxB,wBAAwB,EACxB,eAAe,EACf,gBAAgB,EAChB,eAAe,GACf,MAAM,wBAAwB,CAAC;AAEhC,OAAO,EAAE,WAAW,EAAE,kBAAkB,EAAE,aAAa,EAAE,WAAW,EAAE,MAAM,qBAAqB,CAAC;AAElG,OAAO,EAAE,cAAc,EAAE,eAAe,EAAE,MAAM,qBAAqB,CAAC;AAEtE,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAC7D,OAAO,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AACpG,OAAO,EAAE,wBAAwB,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAClF,OAAO,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAC;AAC9F,OAAO,EACN,mBAAmB,EACnB,aAAa,EACb,UAAU,EACV,eAAe,EACf,cAAc,EACd,oBAAoB,GACpB,MAAM,sBAAsB,CAAC;AAC9B,OAAO,EACN,yBAAyB,EACzB,0BAA0B,EAC1B,sBAAsB,EACtB,2BAA2B,EAC3B,sBAAsB,GACtB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,CAAC;AAEzB,OAAO,EACN,YAAY,EACZ,kBAAkB,EAClB,oBAAoB,IAAI,eAAe,EACvC,kBAAkB,EAClB,kBAAkB,EAClB,WAAW,EACX,cAAc,EACd,WAAW,EACX,cAAc,EACd,OAAO,EACP,gBAAgB,EAChB,4BAA4B,EAC5B,kBAAkB,EAClB,kBAAkB,EAClB,iBAAiB,EACjB,gBAAgB,EAChB,iBAAiB,EACjB,gBAAgB,EAChB,aAAa,EACb,gBAAgB,EAChB,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,EAChB,eAAe,EACf,oBAAoB,EACpB,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,6BAA6B,EAC7B,uBAAuB,EACvB,MAAM,EACN,0BAA0B,EAC1B,sBAAsB,EACtB,2BAA2B,GAC3B,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACN,kBAAkB,EAClB,gBAAgB,EAChB,eAAe,EACf,cAAc,EACd,GAAG,EACH,iBAAiB,EACjB,kBAAkB,EAClB,UAAU,EACV,uBAAuB,EACvB,mBAAmB,EACnB,cAAc,EACd,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,EACjB,YAAY,EACZ,WAAW,EACX,kBAAkB,EAClB,UAAU,EACV,cAAc,EACd,SAAS,EACT,kBAAkB,EAClB,gBAAgB,EAChB,kBAAkB,EAClB,eAAe,EACf,QAAQ,EACR,MAAM,EACN,yBAAyB,EACzB,cAAc,IAAI,oBAAoB,EACtC,oBAAoB,EACpB,gBAAgB,EAChB,0BAA0B,EAC1B,eAAe,EACf,iBAAiB,EACjB,QAAQ,GACR,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EACN,iBAAiB,EACjB,aAAa,EACb,uBAAuB,EACvB,cAAc,EACd,wBAAwB,EACxB,qBAAqB,EACrB,oBAAoB,EACpB,qBAAqB,EACrB,cAAc,GACd,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,qBAAqB,EAAE,MAAM,oBAAoB,CAAC;AAE3D,OAAO,EAAE,cAAc,EAAE,MAAM,iBAAiB,CAAC;AAEjD,OAAO,EACN,SAAS,EACT,SAAS,EACT,gBAAgB,EAChB,kBAAkB,EAClB,kBAAkB,EAClB,UAAU,EACV,eAAe,EACf,eAAe,EACf,mBAAmB,EACnB,yBAAyB,GACzB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACN,oBAAoB,EACpB,YAAY,EACZ,oBAAoB,EACpB,wBAAwB,EACxB,aAAa,EACb,YAAY,EACZ,cAAc,EACd,eAAe,EACf,qBAAqB,GACrB,MAAM,qBAAqB,CAAC;AAE7B,OAAO,EACN,UAAU,EACV,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,gBAAgB,EAChB,UAAU,EACV,SAAS,EACT,gBAAgB,EAChB,mBAAmB,EACnB,kBAAkB,EAClB,mBAAmB,EACnB,qBAAqB,EACrB,wBAAwB,EACxB,wBAAwB,EACxB,mBAAmB,EACnB,UAAU,EACV,uBAAuB,EACvB,SAAS,EACT,oBAAoB,GACpB,MAAM,2BAA2B,CAAC;AAEnC,OAAO,EACN,oBAAoB,EACpB,iBAAiB,EACjB,oBAAoB,EACpB,mBAAmB,EACnB,gBAAgB,EAChB,eAAe,EACf,qBAAqB,EACrB,qBAAqB,EACrB,qBAAqB,EACrB,IAAI,EACJ,kBAAkB,EAClB,uBAAuB,EACvB,eAAe,EACf,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,cAAc,EACd,iBAAiB,EACjB,UAAU,EACV,OAAO,EACP,kBAAkB,EAClB,sBAAsB,EACtB,cAAc,EACd,WAAW,EAGX,uBAAuB,EACvB,uBAAuB,EACvB,wBAAwB,EACxB,kBAAkB,EAClB,iBAAiB,EACjB,sBAAsB,EACtB,oBAAoB,EACpB,YAAY,EACZ,uBAAuB,EACvB,cAAc,EACd,kBAAkB,EAClB,QAAQ,EACR,wBAAwB,EACxB,oCAAoC,EACpC,2CAA2C,EAC3C,oCAAoC,EACpC,2CAA2C,EAC3C,6BAA6B,EAC7B,4BAA4B,EAC5B,YAAY,GACZ,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EAAE,0BAA0B,EAAE,MAAM,yBAAyB,CAAC;AAErE,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAEpE,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD,OAAO,EACN,kBAAkB,EAClB,mBAAmB,EACnB,gCAAgC,EAChC,iBAAiB,EAGjB,cAAc,EACd,WAAW,EACX,aAAa,EACb,WAAW,GACX,MAAM,yBAAyB,CAAC;AAEjC,OAAO,EAAE,4BAA4B,EAAE,MAAM,mCAAmC,CAAC;AAEjF,OAAO,EAAE,YAAY,EAAE,sBAAsB,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC;AAEpG,OAAO,EAAE,yBAAyB,EAAE,MAAM,4BAA4B,CAAC"}