@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/lib/anchored-edits/PersistedTypes.js

@@ -1,128 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { Side } from '../Snapshot';
-import { Change, Insert, Move, StableRange, getNodeId, } from '../default-edits';
-// Note: Documentation of this constant is merged with documentation of the `AnchoredChange` interface.
-/**
- * @public
- */
-export const AnchoredChange = {
-    build: Change.build,
-    insert: Change.insert,
-    detach: Change.detach,
-    setPayload: Change.setPayload,
-    clearPayload: Change.clearPayload,
-    constraint: Change.constraint,
-};
-/**
- * Helper for creating a `Delete` edit.
- * @public
- */
-export const AnchoredDelete = {
-    /**
-     * @returns an AnchoredChange that deletes the supplied part of the tree.
-     */
-    create: (rangeAnchor) => AnchoredChange.detach(rangeAnchor),
-};
-/**
- * Helper for creating an `Insert` edit.
- * @public
- */
-export const AnchoredInsert = {
-    /**
-     * @returns an AnchoredChange that inserts 'nodes' into the specified location in the tree.
-     */
-    create: Insert.create,
-};
-/**
- * Helper for creating a `Move` edit.
- * @public
- */
-export const AnchoredMove = {
-    /**
-     * @returns an AnchoredChange that moves the specified content to a new location in the tree.
-     */
-    create: Move.create,
-};
-/**
- * Indicates one of the predefined alternatives for the semantics of a place in a tree.
- */
-export var PlaceAnchorSemanticsChoice;
-(function (PlaceAnchorSemanticsChoice) {
-    /**
-     * The resulting `PlaceAnchor` is valid iff the referenced sibling or parent node with the given ID exists in the snapshot on which the
-     * change is applied.
-     */
-    PlaceAnchorSemanticsChoice[PlaceAnchorSemanticsChoice["BoundToNode"] = 0] = "BoundToNode";
-    /**
-     * The resulting `PlaceAnchor` is interpreted as relative to the siblings in the trait (or the parent in the case of start and end).
-     * If the sibling referenced in the `PlaceAnchor` is moved, the anchor moves with it.
-     * If the sibling referenced in the `PlaceAnchor` is deleted, the anchor is interpreted as relative to the next remaining sibling.
-     * If no siblings remain on the side of interest (before the referenced sibling for "After" places and after the referenced sibling
-     *   for "Before" places) then the anchor is interpreted relative to the containing parent/trait (the start of the trait for "After"
-     *   places and the end of the trait for "Before" places).
-     * If no siblings and no parent remains, the anchor is invalid.
-     */
-    PlaceAnchorSemanticsChoice[PlaceAnchorSemanticsChoice["RelativeToNode"] = 1] = "RelativeToNode";
-    // Future work:
-    // RelativeToRank = 2,
-})(PlaceAnchorSemanticsChoice || (PlaceAnchorSemanticsChoice = {}));
-/**
- * The remainder of this file consists of ergonomic factory methods for persisted types, or common combinations thereof (e.g. "Move" as a
- * combination of a "Detach" change and an "Insert" change).
- *
- * None of these helpers are persisted in documents, and therefore changes to their semantics need only follow standard semantic versioning
- * practices.
- */
-// Note: Documentation of this constant is merged with documentation of the `PlaceAnchor` interface.
-/**
- * @public
- */
-export const PlaceAnchor = {
-    /**
-     * @returns The location directly before `node`.
-     */
-    before: (node, semantics = PlaceAnchorSemanticsChoice.RelativeToNode) => ({
-        side: Side.Before,
-        referenceSibling: getNodeId(node),
-        semantics,
-    }),
-    /**
-     * @returns The location directly after `node`.
-     */
-    after: (node, semantics = PlaceAnchorSemanticsChoice.RelativeToNode) => ({ side: Side.After, referenceSibling: getNodeId(node), semantics }),
-    /**
-     * @returns The location at the start of `trait`.
-     */
-    atStartOf: (trait, semantics = PlaceAnchorSemanticsChoice.RelativeToNode) => ({ side: Side.After, referenceTrait: trait, semantics }),
-    /**
-     * @returns The location at the end of `trait`.
-     */
-    atEndOf: (trait, semantics = PlaceAnchorSemanticsChoice.RelativeToNode) => ({ side: Side.Before, referenceTrait: trait, semantics }),
-};
-// Note: Documentation of this constant is merged with documentation of the `RangeAnchor` interface.
-/**
- * @public
- */
-export const RangeAnchor = {
-    /**
-     * Factory for producing a `RangeAnchor` from a start `StablePlace` to an end `StablePlace`.
-     * @example
-     * RangeAnchor.from(StablePlace.before(startNode)).to(StablePlace.after(endNode))
-     */
-    from: StableRange.from,
-    /**
-     * @returns a `RangeAnchor` which contains only the provided `node`.
-     * Both the start and end `PlaceAnchor` objects used to anchor this `RangeAnchor` are in terms of the passed in node.
-     */
-    only: (node, semantics = PlaceAnchorSemanticsChoice.RelativeToNode) => ({ start: PlaceAnchor.before(node, semantics), end: PlaceAnchor.after(node, semantics) }),
-    /**
-     * @returns a `RangeAnchor` which contains everything in the trait.
-     * This is anchored using the provided `trait`, and is independent of the actual contents of the trait:
-     * it does not use sibling anchoring.
-     */
-    all: StableRange.all,
-};
-//# sourceMappingURL=PersistedTypes.js.map

package/lib/anchored-edits/PersistedTypes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"PersistedTypes.js","sourceRoot":"","sources":["../../src/anchored-edits/PersistedTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAQH,OAAO,EAAE,IAAI,EAAE,MAAM,aAAa,CAAC;AAEnC,OAAO,EAEN,MAAM,EAGN,MAAM,EACN,IAAI,EAGJ,WAAW,EAEX,SAAS,GACT,MAAM,kBAAkB,CAAC;AA4F1B,uGAAuG;AACvG;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC7B,KAAK,EAAE,MAAM,CAAC,KAAK;IACnB,MAAM,EAAE,MAAM,CAAC,MAAkF;IACjG,MAAM,EAAE,MAAM,CAAC,MAAmF;IAClG,UAAU,EAAE,MAAM,CAAC,UAA8E;IACjG,YAAY,EAAE,MAAM,CAAC,YAA8D;IACnF,UAAU,EAAE,MAAM,CAAC,UAQI;CACvB,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC7B;;OAEG;IACH,MAAM,EAAE,CAAC,WAAwB,EAAkB,EAAE,CAAC,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC;CACxF,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG;IAC7B;;OAEG;IACH,MAAM,EAAE,MAAM,CAAC,MAA4F;CAC3G,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG;IAC3B;;OAEG;IACH,MAAM,EAAE,IAAI,CAAC,MAA6E;CAC1F,CAAC;AAEF;;GAEG;AACH,MAAM,CAAN,IAAY,0BAkBX;AAlBD,WAAY,0BAA0B;IACrC;;;OAGG;IACH,yFAAe,CAAA;IACf;;;;;;;;OAQG;IACH,+FAAkB,CAAA;IAClB,eAAe;IACf,sBAAsB;AACvB,CAAC,EAlBW,0BAA0B,KAA1B,0BAA0B,QAkBrC;AA6CD;;;;;;GAMG;AAEH,oGAAoG;AACpG;;GAEG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG;IAC1B;;OAEG;IACH,MAAM,EAAE,CACP,IAAuB,EACvB,YAAwC,0BAA0B,CAAC,cAAc,EACnE,EAAE,CAAC,CAAC;QAClB,IAAI,EAAE,IAAI,CAAC,MAAM;QACjB,gBAAgB,EAAE,SAAS,CAAC,IAAI,CAAC;QACjC,SAAS;KACT,CAAC;IACF;;OAEG;IACH,KAAK,EAAE,CACN,IAAuB,EACvB,YAAwC,0BAA0B,CAAC,cAAc,EACnE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,gBAAgB,EAAE,SAAS,CAAC,IAAI,CAAC,EAAE,SAAS,EAAE,CAAC;IACtF;;OAEG;IACH,SAAS,EAAE,CACV,KAAoB,EACpB,YAAwC,0BAA0B,CAAC,cAAc,EACnE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;IAC1E;;OAEG;IACH,OAAO,EAAE,CACR,KAAoB,EACpB,YAAwC,0BAA0B,CAAC,cAAc,EACnE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,cAAc,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;CAC3E,CAAC;AAEF,oGAAoG;AACpG;;GAEG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG;IAC1B;;;;OAIG;IACH,IAAI,EAAE,WAAW,CAAC,IAAyE;IAC3F;;;OAGG;IACH,IAAI,EAAE,CACL,IAA2B,EAC3B,YAAwC,0BAA0B,CAAC,cAAc,EACnE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,GAAG,EAAE,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,CAAC;IAC3G;;;;OAIG;IACH,GAAG,EAAE,WAAW,CAAC,GAA4C;CAC7D,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n// All types imported into this file inherit the requirements documented below.\n// These imports are ok because they consist only of type aliases for primitive types,\n// and thus have no impact on serialization as long as the primitive type they are an alias for does not change.\n// This does mean that the various UuidString types must remain strings, and must never change the format unless the process for changing\n// persisted types (as documented below) is followed.\nimport { DetachedSequenceId, NodeId, TraitLabel, UuidString } from '../Identifiers';\nimport { Side } from '../Snapshot';\nimport { EditBase, BuildNode, NodeData, Payload, TraitLocation, TreeNodeSequence } from '../generic';\nimport {\n\tBuild,\n\tChange,\n\tConstraintEffect,\n\tDetach,\n\tInsert,\n\tMove,\n\tSetValue,\n\tStablePlace,\n\tStableRange,\n\tConstraint,\n\tgetNodeId,\n} from '../default-edits';\n\n/**\n * Types for Edits in Fluid Ops and Fluid summaries.\n *\n * Types describing locations in the tree are stable in the presence of other concurrent edits.\n *\n * All types are compatible with Fluid Serializable.\n *\n * These types can only be modified in ways that are both backwards and forwards compatible since they\n * are used in edits, and thus are persisted (using Fluid serialization).\n *\n * This means these types cannot be changed in any way that impacts their Fluid serialization\n * except through a very careful process:\n *\n * 1. The planned change must support all old data, and maintain the exact semantics of it.\n * This means that the change is pretty much limited to adding optional fields,\n * or making required fields optional.\n * 2. Support for the new format must be deployed to all users (This means all applications using SharedTree must do this),\n * and this deployment must be confirmed to be stable and will not be rolled back.\n * 3. Usage of the new format may start.\n *\n * Support for the old format can NEVER be removed: it must be maintained indefinably or old documents will break.\n * Because this process puts requirements on applications using shared tree,\n * step 3 should only ever be done in a Major version update,\n * and must be explicitly called out in the release notes\n * stating which versions of SharedTree are supported for documents modified by the new version.\n */\n\n/**\n * The information included in an anchored edit.\n * @public\n */\nexport type AnchoredEditBase = EditBase<AnchoredChange>;\n\n/**\n * A change that composes an Edit.\n *\n * `Change` objects can be conveniently constructed with the helper methods exported on a constant of the same name.\n * @example\n * Change.insert(sourceId, destination)\n * @public\n */\nexport type AnchoredChange = AnchoredInsert | AnchoredDetach | Build | AnchoredSetValue | AnchoredConstraint;\n\n/**\n * Inserts a sequence of nodes at the specified destination.\n * The source can be constructed either by a Build (used to insert new nodes) or a Detach (amounts to a \"move\" operation).\n * @public\n */\nexport interface AnchoredInsert extends Insert {\n\treadonly destination: PlaceAnchor;\n}\n\n/**\n * Removes a sequence of nodes from the tree.\n * If a destination is specified, the detached sequence is associated with that ID and held for possible reuse\n * by later changes in this same Edit (such as by an Insert).\n * A Detach without a destination is a deletion of the specified sequence, as is a Detach with a destination that is not used later.\n * @public\n */\nexport interface AnchoredDetach extends Detach {\n\treadonly source: RangeAnchor;\n}\n\n/**\n * Modifies the payload of a node.\n * @public\n */\nexport interface AnchoredSetValue extends SetValue {\n\treadonly nodeToModify: NodeAnchor;\n}\n\n/**\n * A set of constraints on the validity of an Edit.\n * A Constraint is used to detect when an Edit, due to other concurrent edits, may have unintended effects or merge in\n * non-semantic ways. It is processed in order like any other Change in an Edit. It can cause an edit to fail if the\n * various constraints are not met at the time of evaluation (ex: the parentNode has changed due to concurrent editing).\n * Does not modify the document.\n * @public\n */\nexport interface AnchoredConstraint extends Constraint {\n\t/**\n\t * Selects a sequence of nodes which will be checked against the constraints specified by the optional fields.\n\t * If `toConstrain` is invalid, it will be treated like a constraint being unmet.\n\t * Depending on `effect` this may or may not make the Edit invalid.\n\t *\n\t * When a constraint is not met, the effects is specified by `effect`.\n\t */\n\treadonly toConstrain: RangeAnchor;\n}\n\n// Note: Documentation of this constant is merged with documentation of the `AnchoredChange` interface.\n/**\n * @public\n */\nexport const AnchoredChange = {\n\tbuild: Change.build,\n\tinsert: Change.insert as (source: DetachedSequenceId, destination: PlaceAnchor) => AnchoredInsert,\n\tdetach: Change.detach as (source: RangeAnchor, destination?: DetachedSequenceId) => AnchoredDetach,\n\tsetPayload: Change.setPayload as (nodeToModify: NodeAnchor, payload: Payload) => AnchoredSetValue,\n\tclearPayload: Change.clearPayload as (nodeToModify: NodeAnchor) => AnchoredSetValue,\n\tconstraint: Change.constraint as (\n\t\ttoConstrain: RangeAnchor,\n\t\teffect: ConstraintEffect,\n\t\tidentityHash?: UuidString,\n\t\tlength?: number,\n\t\tcontentHash?: UuidString,\n\t\tparentNode?: NodeId,\n\t\tlabel?: TraitLabel\n\t) => AnchoredConstraint,\n};\n\n/**\n * Helper for creating a `Delete` edit.\n * @public\n */\nexport const AnchoredDelete = {\n\t/**\n\t * @returns an AnchoredChange that deletes the supplied part of the tree.\n\t */\n\tcreate: (rangeAnchor: RangeAnchor): AnchoredChange => AnchoredChange.detach(rangeAnchor),\n};\n\n/**\n * Helper for creating an `Insert` edit.\n * @public\n */\nexport const AnchoredInsert = {\n\t/**\n\t * @returns an AnchoredChange that inserts 'nodes' into the specified location in the tree.\n\t */\n\tcreate: Insert.create as (nodes: TreeNodeSequence<BuildNode>, destination: PlaceAnchor) => AnchoredChange[],\n};\n\n/**\n * Helper for creating a `Move` edit.\n * @public\n */\nexport const AnchoredMove = {\n\t/**\n\t * @returns an AnchoredChange that moves the specified content to a new location in the tree.\n\t */\n\tcreate: Move.create as (source: RangeAnchor, destination: PlaceAnchor) => AnchoredChange[],\n};\n\n/**\n * Indicates one of the predefined alternatives for the semantics of a place in a tree.\n */\nexport enum PlaceAnchorSemanticsChoice {\n\t/**\n\t * The resulting `PlaceAnchor` is valid iff the referenced sibling or parent node with the given ID exists in the snapshot on which the\n\t * change is applied.\n\t */\n\tBoundToNode = 0,\n\t/**\n\t * The resulting `PlaceAnchor` is interpreted as relative to the siblings in the trait (or the parent in the case of start and end).\n\t * If the sibling referenced in the `PlaceAnchor` is moved, the anchor moves with it.\n\t * If the sibling referenced in the `PlaceAnchor` is deleted, the anchor is interpreted as relative to the next remaining sibling.\n\t * If no siblings remain on the side of interest (before the referenced sibling for \"After\" places and after the referenced sibling\n\t *   for \"Before\" places) then the anchor is interpreted relative to the containing parent/trait (the start of the trait for \"After\"\n\t *   places and the end of the trait for \"Before\" places).\n\t * If no siblings and no parent remains, the anchor is invalid.\n\t */\n\tRelativeToNode = 1,\n\t// Future work:\n\t// RelativeToRank = 2,\n}\n\n/**\n * A location in a trait with associated merge semantics.\n * See also `StablePlace`.\n * `PlaceAnchor`. objects can be conveniently constructed with the helper methods exported on a constant of the same name.\n * @example\n * PlaceAnchor.before(node)\n * PlaceAnchor.atStartOf(trait)\n * @public\n */\nexport interface PlaceAnchor extends StablePlace {\n\t/**\n\t * The choice of semantics for the place.\n\t * No value is equivalent to PlaceAnchorSemanticsChoice.BoundToNode.\n\t */\n\treadonly semantics?: PlaceAnchorSemanticsChoice;\n}\n\nexport type RelativePlaceAnchor = PlaceAnchor & { semantic: PlaceAnchorSemanticsChoice.RelativeToNode };\n\n/**\n * Specifies the range of nodes from `start` to `end` within a trait.\n * See also `StableRange`.\n * Valid iff start and end are valid and are within the same trait and the start does not occur after the end in the trait.\n *\n * `RangeAnchor`s are currently resolved by resolving their constituent places and checking the validity of the resulting range.\n * This may lead to the range becoming invalid (i.e., cannot be resolved) despite there being reasonable ways to salvage it.\n * For example the range [After(B), Before(D)] in the trait [A, B, C, D] would be made invalid by a change that moves B after D.\n * A reasonable resolution would be to resolve the range to [After(A), Before(D)]. The current implementation will instead treat\n * the range as invalid.\n * Future improvements may offer more a resilient resolution strategy for ranges.\n *\n * `RangeAnchor` objects can be conveniently constructed with the helper methods exported on a constant of the same name.\n * @example\n * RangeAnchor.from(PlaceAnchor.before(startNode)).to(PlaceAnchor.after(endNode))\n * @public\n */\nexport interface RangeAnchor extends StableRange {\n\treadonly start: PlaceAnchor;\n\treadonly end: PlaceAnchor;\n}\n\nexport type NodeAnchor = NodeId;\n\n/**\n * The remainder of this file consists of ergonomic factory methods for persisted types, or common combinations thereof (e.g. \"Move\" as a\n * combination of a \"Detach\" change and an \"Insert\" change).\n *\n * None of these helpers are persisted in documents, and therefore changes to their semantics need only follow standard semantic versioning\n * practices.\n */\n\n// Note: Documentation of this constant is merged with documentation of the `PlaceAnchor` interface.\n/**\n * @public\n */\nexport const PlaceAnchor = {\n\t/**\n\t * @returns The location directly before `node`.\n\t */\n\tbefore: (\n\t\tnode: NodeData | NodeId,\n\t\tsemantics: PlaceAnchorSemanticsChoice = PlaceAnchorSemanticsChoice.RelativeToNode\n\t): PlaceAnchor => ({\n\t\tside: Side.Before,\n\t\treferenceSibling: getNodeId(node),\n\t\tsemantics,\n\t}),\n\t/**\n\t * @returns The location directly after `node`.\n\t */\n\tafter: (\n\t\tnode: NodeData | NodeId,\n\t\tsemantics: PlaceAnchorSemanticsChoice = PlaceAnchorSemanticsChoice.RelativeToNode\n\t): PlaceAnchor => ({ side: Side.After, referenceSibling: getNodeId(node), semantics }),\n\t/**\n\t * @returns The location at the start of `trait`.\n\t */\n\tatStartOf: (\n\t\ttrait: TraitLocation,\n\t\tsemantics: PlaceAnchorSemanticsChoice = PlaceAnchorSemanticsChoice.RelativeToNode\n\t): PlaceAnchor => ({ side: Side.After, referenceTrait: trait, semantics }),\n\t/**\n\t * @returns The location at the end of `trait`.\n\t */\n\tatEndOf: (\n\t\ttrait: TraitLocation,\n\t\tsemantics: PlaceAnchorSemanticsChoice = PlaceAnchorSemanticsChoice.RelativeToNode\n\t): PlaceAnchor => ({ side: Side.Before, referenceTrait: trait, semantics }),\n};\n\n// Note: Documentation of this constant is merged with documentation of the `RangeAnchor` interface.\n/**\n * @public\n */\nexport const RangeAnchor = {\n\t/**\n\t * Factory for producing a `RangeAnchor` from a start `StablePlace` to an end `StablePlace`.\n\t * @example\n\t * RangeAnchor.from(StablePlace.before(startNode)).to(StablePlace.after(endNode))\n\t */\n\tfrom: StableRange.from as (start: PlaceAnchor) => { to: (end: PlaceAnchor) => RangeAnchor },\n\t/**\n\t * @returns a `RangeAnchor` which contains only the provided `node`.\n\t * Both the start and end `PlaceAnchor` objects used to anchor this `RangeAnchor` are in terms of the passed in node.\n\t */\n\tonly: (\n\t\tnode: NodeData | NodeAnchor,\n\t\tsemantics: PlaceAnchorSemanticsChoice = PlaceAnchorSemanticsChoice.RelativeToNode\n\t): RangeAnchor => ({ start: PlaceAnchor.before(node, semantics), end: PlaceAnchor.after(node, semantics) }),\n\t/**\n\t * @returns a `RangeAnchor` which contains everything in the trait.\n\t * This is anchored using the provided `trait`, and is independent of the actual contents of the trait:\n\t * it does not use sibling anchoring.\n\t */\n\tall: StableRange.all as (trait: TraitLocation) => RangeAnchor,\n};\n"]}

package/lib/anchored-edits/SharedTreeWithAnchors.d.ts

@@ -1,120 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IFluidDataStoreRuntime } from '@fluidframework/datastore-definitions';
-import { EditId } from '../Identifiers';
-import { Snapshot } from '../Snapshot';
-import { Edit, BuildNode, GenericSharedTree, NodeData, SharedTreeSummaryBase } from '../generic';
-import { OrderedEditSet } from '../EditLog';
-import { AnchoredChange, RangeAnchor, PlaceAnchor, NodeAnchor } from './PersistedTypes';
-import { SharedTreeWithAnchorsFactory } from './Factory';
-/**
- * Wrapper around a `SharedTreeWithAnchorsEditor` which provides ergonomic imperative editing functionality. All methods apply changes in
- * their own edit.
- *
- * @example
- * // The following two lines of code are equivalent:
- * tree.applyEdit(...AnchoredInsert.create([newNode], PlaceAnchor.before(existingNode)));
- * tree.editor.insert(newNode, PlaceAnchor.before(existingNode))
- * @public
- */
-export declare class SharedTreeWithAnchorsEditor {
-    private readonly tree;
-    constructor(tree: SharedTreeWithAnchors);
-    /**
-     * Inserts a node at a location.
-     * @param node - Node to insert.
-     * @param destination - PlaceAnchor at which the insert should take place.
-     */
-    insert(node: BuildNode, destination: PlaceAnchor): EditId;
-    /**
-     * Inserts nodes at a location.
-     * @param nodes - Nodes to insert.
-     * @param destination - PlaceAnchor at which the insert should take place.
-     */
-    insert(nodes: BuildNode[], destination: PlaceAnchor): EditId;
-    /**
-     * Moves a node to a specified location.
-     * @param source - Node to move.
-     * @param destination - PlaceAnchor to which the node should be moved.
-     */
-    move(source: NodeData, destination: PlaceAnchor): EditId;
-    /**
-     * Moves a node to a specified location.
-     * @param source - Node to move.
-     * @param destination - PlaceAnchor to which the node should be moved.
-     */
-    move(source: NodeAnchor, destination: PlaceAnchor): EditId;
-    /**
-     * Moves a part of a trait to a specified location.
-     * @param source - Portion of a trait to move.
-     * @param destination - PlaceAnchor to which the portion of the trait should be moved.
-     */
-    move(source: RangeAnchor, destination: PlaceAnchor): EditId;
-    /**
-     * Deletes a node.
-     * @param target - Node to delete
-     */
-    delete(target: NodeData): EditId;
-    /**
-     * Deletes a node.
-     * @param target - Node to delete
-     */
-    delete(target: NodeAnchor): EditId;
-    /**
-     * Deletes a portion of a trait.
-     * @param target - Range of nodes to delete, specified as a `RangeAnchor`
-     */
-    delete(target: RangeAnchor): EditId;
-    /**
-     * Reverts a previous edit.
-     * @param edit - the edit to revert
-     * @param view - the revision to which the edit is applied (not the output of applying edit: it's the one just before that)
-     */
-    revert(edit: Edit<AnchoredChange>, view: Snapshot): EditId;
-    applyChanges(changes: readonly AnchoredChange[]): EditId;
-    private isRange;
-}
-/**
- * A distributed tree.
- *
- * Does not currently guarantee convergence among nodes. This is due to the fact that the current summary information is insufficient to
- * ensure that all nodes have access to all the relevant data for the application of a given edit. For example, if edit was sequenced after
- * a given summary but references an edit before that summary then nodes that do not have that earlier edit's information in memory will not
- * have the full context for the application of the change. This currently leads to a "best effort" application which takes into account
- * whatever data is available. Remedying this is tracked by #57176.
- *
- * @public
- * @sealed
- */
-export declare class SharedTreeWithAnchors extends GenericSharedTree<AnchoredChange> {
-    /**
-     * Create a new SharedTreeWithAnchors. It will contain the default value (see initialTree).
-     */
-    static create(runtime: IFluidDataStoreRuntime, id?: string): SharedTreeWithAnchors;
-    /**
-     * Get a factory for SharedTreeWithAnchors to register with the data store.
-     * @param historySummarizing - determines how history is summarized by the returned `SharedTreeWithAnchors`.
-     * @returns A factory that creates `SharedTreeWithAnchors`s and loads them from storage.
-     */
-    static getFactory(summarizeHistory?: boolean): SharedTreeWithAnchorsFactory;
-    /**
-     * Create a new SharedTreeFactory.
-     * @param runtime - The runtime the SharedTreeWithAnchors will be associated with
-     * @param id - Unique ID for the SharedTreeWithAnchors
-     * @param expensiveValidation - enable expensive asserts
-     * @param summarizeHistory - Determines if the history is included in summaries.
-     */
-    constructor(runtime: IFluidDataStoreRuntime, id: string, expensiveValidation?: boolean, summarizeHistory?: boolean);
-    private _editor;
-    /**
-     * Returns a `SharedTreeEditor` for editing this tree in an imperative fashion. All edits are performed on the current tree view.
-     */
-    get editor(): SharedTreeWithAnchorsEditor;
-    /**
-     * {@inheritDoc GenericSharedTree.generateSummary}
-     */
-    protected generateSummary(editLog: OrderedEditSet<AnchoredChange>): SharedTreeSummaryBase;
-}
-//# sourceMappingURL=SharedTreeWithAnchors.d.ts.map

package/lib/anchored-edits/SharedTreeWithAnchors.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SharedTreeWithAnchors.d.ts","sourceRoot":"","sources":["../../src/anchored-edits/SharedTreeWithAnchors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,sBAAsB,EAAE,MAAM,uCAAuC,CAAC;AAC/E,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAyB,iBAAiB,EAAE,QAAQ,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAC;AACxH,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAE5C,OAAO,EACN,cAAc,EAId,WAAW,EACX,WAAW,EACX,UAAU,EACV,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,4BAA4B,EAAyC,MAAM,WAAW,CAAC;AAGhG;;;;;;;;;GASG;AACH,qBAAa,2BAA2B;IACvC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAwB;gBAE1B,IAAI,EAAE,qBAAqB;IAI9C;;;;OAIG;IACI,MAAM,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,WAAW,GAAG,MAAM;IAChE;;;;OAIG;IACI,MAAM,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,WAAW,EAAE,WAAW,GAAG,MAAM;IAOnE;;;;OAIG;IACI,IAAI,CAAC,MAAM,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,GAAG,MAAM;IAC/D;;;;OAIG;IACI,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,WAAW,GAAG,MAAM;IACjE;;;;OAIG;IACI,IAAI,CAAC,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,WAAW,GAAG,MAAM;IASlE;;;OAGG;IACI,MAAM,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM;IACvC;;;OAGG;IACI,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM;IACzC;;;OAGG;IACI,MAAM,CAAC,MAAM,EAAE,WAAW,GAAG,MAAM;IAS1C;;;;OAIG;IACI,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,cAAc,CAAC,EAAE,IAAI,EAAE,QAAQ,GAAG,MAAM;IAI1D,YAAY,CAAC,OAAO,EAAE,SAAS,cAAc,EAAE,GAAG,MAAM;IAI/D,OAAO,CAAC,OAAO;CAGf;AAED;;;;;;;;;;;GAWG;AACH,qBAAa,qBAAsB,SAAQ,iBAAiB,CAAC,cAAc,CAAC;IAC3E;;OAEG;WACW,MAAM,CAAC,OAAO,EAAE,sBAAsB,EAAE,EAAE,CAAC,EAAE,MAAM,GAAG,qBAAqB;IAIzF;;;;OAIG;WACW,UAAU,CAAC,gBAAgB,UAAO,GAAG,4BAA4B;IAI/E;;;;;;OAMG;gBAEF,OAAO,EAAE,sBAAsB,EAC/B,EAAE,EAAE,MAAM,EACV,mBAAmB,UAAQ,EAC3B,gBAAgB,UAAO;IAYxB,OAAO,CAAC,OAAO,CAA0C;IAEzD;;OAEG;IACH,IAAW,MAAM,IAAI,2BAA2B,CAM/C;IAED;;OAEG;IACH,SAAS,CAAC,eAAe,CAAC,OAAO,EAAE,cAAc,CAAC,cAAc,CAAC,GAAG,qBAAqB;CAMzF"}

package/lib/anchored-edits/SharedTreeWithAnchors.js

@@ -1,110 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { fullHistorySummarizer, GenericSharedTree } from '../generic';
-import { noHistorySummarizer, revert } from '../default-edits';
-import { AnchoredDelete, AnchoredInsert, AnchoredMove, RangeAnchor, } from './PersistedTypes';
-import { SharedTreeWithAnchorsFactory, SharedTreeWithAnchorsFactoryNoHistory } from './Factory';
-import { TransactionWithAnchors } from './TransactionWithAnchors';
-/**
- * Wrapper around a `SharedTreeWithAnchorsEditor` which provides ergonomic imperative editing functionality. All methods apply changes in
- * their own edit.
- *
- * @example
- * // The following two lines of code are equivalent:
- * tree.applyEdit(...AnchoredInsert.create([newNode], PlaceAnchor.before(existingNode)));
- * tree.editor.insert(newNode, PlaceAnchor.before(existingNode))
- * @public
- */
-export class SharedTreeWithAnchorsEditor {
-    constructor(tree) {
-        this.tree = tree;
-    }
-    insert(nodeOrNodes, destination) {
-        return this.tree.applyEdit(...AnchoredInsert.create(Array.isArray(nodeOrNodes) ? nodeOrNodes : [nodeOrNodes], destination));
-    }
-    move(source, destination) {
-        if (!this.isRange(source)) {
-            return this.tree.applyEdit(...AnchoredMove.create(RangeAnchor.only(source), destination));
-        }
-        return this.tree.applyEdit(...AnchoredMove.create(source, destination));
-    }
-    delete(target) {
-        if (!this.isRange(target)) {
-            return this.tree.applyEdit(AnchoredDelete.create(RangeAnchor.only(target)));
-        }
-        return this.tree.applyEdit(AnchoredDelete.create(target));
-    }
-    /**
-     * Reverts a previous edit.
-     * @param edit - the edit to revert
-     * @param view - the revision to which the edit is applied (not the output of applying edit: it's the one just before that)
-     */
-    revert(edit, view) {
-        return this.tree.applyEdit(...revert(edit.changes, view));
-    }
-    applyChanges(changes) {
-        return this.tree.applyEdit(...changes);
-    }
-    isRange(source) {
-        return source.start !== undefined && source.end !== undefined;
-    }
-}
-/**
- * A distributed tree.
- *
- * Does not currently guarantee convergence among nodes. This is due to the fact that the current summary information is insufficient to
- * ensure that all nodes have access to all the relevant data for the application of a given edit. For example, if edit was sequenced after
- * a given summary but references an edit before that summary then nodes that do not have that earlier edit's information in memory will not
- * have the full context for the application of the change. This currently leads to a "best effort" application which takes into account
- * whatever data is available. Remedying this is tracked by #57176.
- *
- * @public
- * @sealed
- */
-export class SharedTreeWithAnchors extends GenericSharedTree {
-    /**
-     * Create a new SharedTreeFactory.
-     * @param runtime - The runtime the SharedTreeWithAnchors will be associated with
-     * @param id - Unique ID for the SharedTreeWithAnchors
-     * @param expensiveValidation - enable expensive asserts
-     * @param summarizeHistory - Determines if the history is included in summaries.
-     */
-    constructor(runtime, id, expensiveValidation = false, summarizeHistory = true) {
-        super(runtime, id, TransactionWithAnchors.factory, SharedTreeWithAnchorsFactory.Attributes, expensiveValidation, summarizeHistory);
-    }
-    /**
-     * Create a new SharedTreeWithAnchors. It will contain the default value (see initialTree).
-     */
-    static create(runtime, id) {
-        return runtime.createChannel(id, SharedTreeWithAnchorsFactory.Type);
-    }
-    /**
-     * Get a factory for SharedTreeWithAnchors to register with the data store.
-     * @param historySummarizing - determines how history is summarized by the returned `SharedTreeWithAnchors`.
-     * @returns A factory that creates `SharedTreeWithAnchors`s and loads them from storage.
-     */
-    static getFactory(summarizeHistory = true) {
-        return summarizeHistory ? new SharedTreeWithAnchorsFactory() : new SharedTreeWithAnchorsFactoryNoHistory();
-    }
-    /**
-     * Returns a `SharedTreeEditor` for editing this tree in an imperative fashion. All edits are performed on the current tree view.
-     */
-    get editor() {
-        if (!this._editor) {
-            this._editor = new SharedTreeWithAnchorsEditor(this);
-        }
-        return this._editor;
-    }
-    /**
-     * {@inheritDoc GenericSharedTree.generateSummary}
-     */
-    generateSummary(editLog) {
-        if (!this.summarizeHistory) {
-            return noHistorySummarizer(editLog, this.currentView);
-        }
-        return fullHistorySummarizer(editLog, this.currentView);
-    }
-}
-//# sourceMappingURL=SharedTreeWithAnchors.js.map

package/lib/anchored-edits/SharedTreeWithAnchors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SharedTreeWithAnchors.js","sourceRoot":"","sources":["../../src/anchored-edits/SharedTreeWithAnchors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAmB,qBAAqB,EAAE,iBAAiB,EAAmC,MAAM,YAAY,CAAC;AAExH,OAAO,EAAE,mBAAmB,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAC/D,OAAO,EAEN,cAAc,EACd,cAAc,EACd,YAAY,EACZ,WAAW,GAGX,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,4BAA4B,EAAE,qCAAqC,EAAE,MAAM,WAAW,CAAC;AAChG,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;;;;GASG;AACH,MAAM,OAAO,2BAA2B;IAGvC,YAAmB,IAA2B;QAC7C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAcM,MAAM,CAAC,WAAoC,EAAE,WAAwB;QAC3E,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CACzB,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC,CAC/F,CAAC;IACH,CAAC;IAoBM,IAAI,CAAC,MAA2C,EAAE,WAAwB;QAChF,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;SAC1F;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,YAAY,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;IACzE,CAAC;IAiBM,MAAM,CAAC,MAA2C;QACxD,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;YAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAC5E;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,IAA0B,EAAE,IAAc;QACvD,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;IAC3D,CAAC;IAEM,YAAY,CAAC,OAAkC;QACrD,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,CAAC;IACxC,CAAC;IAEO,OAAO,CAAC,MAA2C;QAC1D,OAAQ,MAAsB,CAAC,KAAK,KAAK,SAAS,IAAK,MAAsB,CAAC,GAAG,KAAK,SAAS,CAAC;IACjG,CAAC;CACD;AAED;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,qBAAsB,SAAQ,iBAAiC;IAiB3E;;;;;;OAMG;IACH,YACC,OAA+B,EAC/B,EAAU,EACV,mBAAmB,GAAG,KAAK,EAC3B,gBAAgB,GAAG,IAAI;QAEvB,KAAK,CACJ,OAAO,EACP,EAAE,EACF,sBAAsB,CAAC,OAAO,EAC9B,4BAA4B,CAAC,UAAU,EACvC,mBAAmB,EACnB,gBAAgB,CAChB,CAAC;IACH,CAAC;IArCD;;OAEG;IACI,MAAM,CAAC,MAAM,CAAC,OAA+B,EAAE,EAAW;QAChE,OAAO,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,4BAA4B,CAAC,IAAI,CAA0B,CAAC;IAC9F,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,UAAU,CAAC,gBAAgB,GAAG,IAAI;QAC/C,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,4BAA4B,EAAE,CAAC,CAAC,CAAC,IAAI,qCAAqC,EAAE,CAAC;IAC5G,CAAC;IA2BD;;OAEG;IACH,IAAW,MAAM;QAChB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAClB,IAAI,CAAC,OAAO,GAAG,IAAI,2BAA2B,CAAC,IAAI,CAAC,CAAC;SACrD;QAED,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;OAEG;IACO,eAAe,CAAC,OAAuC;QAChE,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE;YAC3B,OAAO,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;SACtD;QACD,OAAO,qBAAqB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACzD,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { IFluidDataStoreRuntime } from '@fluidframework/datastore-definitions';\nimport { EditId } from '../Identifiers';\nimport { Snapshot } from '../Snapshot';\nimport { Edit, BuildNode, fullHistorySummarizer, GenericSharedTree, NodeData, SharedTreeSummaryBase } from '../generic';\nimport { OrderedEditSet } from '../EditLog';\nimport { noHistorySummarizer, revert } from '../default-edits';\nimport {\n\tAnchoredChange,\n\tAnchoredDelete,\n\tAnchoredInsert,\n\tAnchoredMove,\n\tRangeAnchor,\n\tPlaceAnchor,\n\tNodeAnchor,\n} from './PersistedTypes';\nimport { SharedTreeWithAnchorsFactory, SharedTreeWithAnchorsFactoryNoHistory } from './Factory';\nimport { TransactionWithAnchors } from './TransactionWithAnchors';\n\n/**\n * Wrapper around a `SharedTreeWithAnchorsEditor` which provides ergonomic imperative editing functionality. All methods apply changes in\n * their own edit.\n *\n * @example\n * // The following two lines of code are equivalent:\n * tree.applyEdit(...AnchoredInsert.create([newNode], PlaceAnchor.before(existingNode)));\n * tree.editor.insert(newNode, PlaceAnchor.before(existingNode))\n * @public\n */\nexport class SharedTreeWithAnchorsEditor {\n\tprivate readonly tree: SharedTreeWithAnchors;\n\n\tpublic constructor(tree: SharedTreeWithAnchors) {\n\t\tthis.tree = tree;\n\t}\n\n\t/**\n\t * Inserts a node at a location.\n\t * @param node - Node to insert.\n\t * @param destination - PlaceAnchor at which the insert should take place.\n\t */\n\tpublic insert(node: BuildNode, destination: PlaceAnchor): EditId;\n\t/**\n\t * Inserts nodes at a location.\n\t * @param nodes - Nodes to insert.\n\t * @param destination - PlaceAnchor at which the insert should take place.\n\t */\n\tpublic insert(nodes: BuildNode[], destination: PlaceAnchor): EditId;\n\tpublic insert(nodeOrNodes: BuildNode | BuildNode[], destination: PlaceAnchor): EditId {\n\t\treturn this.tree.applyEdit(\n\t\t\t...AnchoredInsert.create(Array.isArray(nodeOrNodes) ? nodeOrNodes : [nodeOrNodes], destination)\n\t\t);\n\t}\n\n\t/**\n\t * Moves a node to a specified location.\n\t * @param source - Node to move.\n\t * @param destination - PlaceAnchor to which the node should be moved.\n\t */\n\tpublic move(source: NodeData, destination: PlaceAnchor): EditId;\n\t/**\n\t * Moves a node to a specified location.\n\t * @param source - Node to move.\n\t * @param destination - PlaceAnchor to which the node should be moved.\n\t */\n\tpublic move(source: NodeAnchor, destination: PlaceAnchor): EditId;\n\t/**\n\t * Moves a part of a trait to a specified location.\n\t * @param source - Portion of a trait to move.\n\t * @param destination - PlaceAnchor to which the portion of the trait should be moved.\n\t */\n\tpublic move(source: RangeAnchor, destination: PlaceAnchor): EditId;\n\tpublic move(source: NodeData | NodeAnchor | RangeAnchor, destination: PlaceAnchor): EditId {\n\t\tif (!this.isRange(source)) {\n\t\t\treturn this.tree.applyEdit(...AnchoredMove.create(RangeAnchor.only(source), destination));\n\t\t}\n\n\t\treturn this.tree.applyEdit(...AnchoredMove.create(source, destination));\n\t}\n\n\t/**\n\t * Deletes a node.\n\t * @param target - Node to delete\n\t */\n\tpublic delete(target: NodeData): EditId;\n\t/**\n\t * Deletes a node.\n\t * @param target - Node to delete\n\t */\n\tpublic delete(target: NodeAnchor): EditId;\n\t/**\n\t * Deletes a portion of a trait.\n\t * @param target - Range of nodes to delete, specified as a `RangeAnchor`\n\t */\n\tpublic delete(target: RangeAnchor): EditId;\n\tpublic delete(target: NodeData | NodeAnchor | RangeAnchor): EditId {\n\t\tif (!this.isRange(target)) {\n\t\t\treturn this.tree.applyEdit(AnchoredDelete.create(RangeAnchor.only(target)));\n\t\t}\n\n\t\treturn this.tree.applyEdit(AnchoredDelete.create(target));\n\t}\n\n\t/**\n\t * Reverts a previous edit.\n\t * @param edit - the edit to revert\n\t * @param view - the revision to which the edit is applied (not the output of applying edit: it's the one just before that)\n\t */\n\tpublic revert(edit: Edit<AnchoredChange>, view: Snapshot): EditId {\n\t\treturn this.tree.applyEdit(...revert(edit.changes, view));\n\t}\n\n\tpublic applyChanges(changes: readonly AnchoredChange[]): EditId {\n\t\treturn this.tree.applyEdit(...changes);\n\t}\n\n\tprivate isRange(source: NodeData | NodeAnchor | RangeAnchor): source is RangeAnchor {\n\t\treturn (source as RangeAnchor).start !== undefined && (source as RangeAnchor).end !== undefined;\n\t}\n}\n\n/**\n * A distributed tree.\n *\n * Does not currently guarantee convergence among nodes. This is due to the fact that the current summary information is insufficient to\n * ensure that all nodes have access to all the relevant data for the application of a given edit. For example, if edit was sequenced after\n * a given summary but references an edit before that summary then nodes that do not have that earlier edit's information in memory will not\n * have the full context for the application of the change. This currently leads to a \"best effort\" application which takes into account\n * whatever data is available. Remedying this is tracked by #57176.\n *\n * @public\n * @sealed\n */\nexport class SharedTreeWithAnchors extends GenericSharedTree<AnchoredChange> {\n\t/**\n\t * Create a new SharedTreeWithAnchors. It will contain the default value (see initialTree).\n\t */\n\tpublic static create(runtime: IFluidDataStoreRuntime, id?: string): SharedTreeWithAnchors {\n\t\treturn runtime.createChannel(id, SharedTreeWithAnchorsFactory.Type) as SharedTreeWithAnchors;\n\t}\n\n\t/**\n\t * Get a factory for SharedTreeWithAnchors to register with the data store.\n\t * @param historySummarizing - determines how history is summarized by the returned `SharedTreeWithAnchors`.\n\t * @returns A factory that creates `SharedTreeWithAnchors`s and loads them from storage.\n\t */\n\tpublic static getFactory(summarizeHistory = true): SharedTreeWithAnchorsFactory {\n\t\treturn summarizeHistory ? new SharedTreeWithAnchorsFactory() : new SharedTreeWithAnchorsFactoryNoHistory();\n\t}\n\n\t/**\n\t * Create a new SharedTreeFactory.\n\t * @param runtime - The runtime the SharedTreeWithAnchors will be associated with\n\t * @param id - Unique ID for the SharedTreeWithAnchors\n\t * @param expensiveValidation - enable expensive asserts\n\t * @param summarizeHistory - Determines if the history is included in summaries.\n\t */\n\tpublic constructor(\n\t\truntime: IFluidDataStoreRuntime,\n\t\tid: string,\n\t\texpensiveValidation = false,\n\t\tsummarizeHistory = true\n\t) {\n\t\tsuper(\n\t\t\truntime,\n\t\t\tid,\n\t\t\tTransactionWithAnchors.factory,\n\t\t\tSharedTreeWithAnchorsFactory.Attributes,\n\t\t\texpensiveValidation,\n\t\t\tsummarizeHistory\n\t\t);\n\t}\n\n\tprivate _editor: SharedTreeWithAnchorsEditor | undefined;\n\n\t/**\n\t * Returns a `SharedTreeEditor` for editing this tree in an imperative fashion. All edits are performed on the current tree view.\n\t */\n\tpublic get editor(): SharedTreeWithAnchorsEditor {\n\t\tif (!this._editor) {\n\t\t\tthis._editor = new SharedTreeWithAnchorsEditor(this);\n\t\t}\n\n\t\treturn this._editor;\n\t}\n\n\t/**\n\t * {@inheritDoc GenericSharedTree.generateSummary}\n\t */\n\tprotected generateSummary(editLog: OrderedEditSet<AnchoredChange>): SharedTreeSummaryBase {\n\t\tif (!this.summarizeHistory) {\n\t\t\treturn noHistorySummarizer(editLog, this.currentView);\n\t\t}\n\t\treturn fullHistorySummarizer(editLog, this.currentView);\n\t}\n}\n"]}

package/lib/anchored-edits/TransactionWithAnchors.d.ts

@@ -1,28 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { NodeId, DetachedSequenceId } from '../Identifiers';
-import { Snapshot } from '../Snapshot';
-import { ReconciliationPath } from '../ReconciliationPath';
-import { Transaction } from '../default-edits';
-import { AnchoredChange } from './PersistedTypes';
-/**
- * A mutable transaction for applying sequences of changes to a Snapshot.
- * Allows viewing the intermediate states.
- *
- * Contains necessary state to apply changes within an edit to a Snapshot.
- *
- * May have any number of changes applied to make up the edit.
- * Use `close` to complete the transaction, returning the array of changes and an EditingResult showing the
- * results of applying the changes as an Edit to the initial Snapshot (passed to the constructor).
- *
- * No data outside the Transaction is modified by Transaction:
- * the results from `close` must be used to actually submit an `Edit`.
- */
-export declare class TransactionWithAnchors extends Transaction {
-    protected readonly detached: Map<DetachedSequenceId, readonly NodeId[]>;
-    static factory(snapshot: Snapshot): TransactionWithAnchors;
-    protected tryResolveChange(change: AnchoredChange, path: ReconciliationPath<AnchoredChange>): AnchoredChange | undefined;
-}
-//# sourceMappingURL=TransactionWithAnchors.d.ts.map

package/lib/anchored-edits/TransactionWithAnchors.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"TransactionWithAnchors.d.ts","sourceRoot":"","sources":["../../src/anchored-edits/TransactionWithAnchors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAGlD;;;;;;;;;;;;GAYG;AACH,qBAAa,sBAAuB,SAAQ,WAAW;IACtD,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,kBAAkB,EAAE,SAAS,MAAM,EAAE,CAAC,CAAa;WAEtE,OAAO,CAAC,QAAQ,EAAE,QAAQ,GAAG,sBAAsB;IAIjE,SAAS,CAAC,gBAAgB,CACzB,MAAM,EAAE,cAAc,EACtB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,GACtC,cAAc,GAAG,SAAS;CAG7B"}

package/lib/anchored-edits/TransactionWithAnchors.js

@@ -1,32 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { Transaction } from '../default-edits';
-import { resolveChangeAnchors } from './AnchorResolution';
-/**
- * A mutable transaction for applying sequences of changes to a Snapshot.
- * Allows viewing the intermediate states.
- *
- * Contains necessary state to apply changes within an edit to a Snapshot.
- *
- * May have any number of changes applied to make up the edit.
- * Use `close` to complete the transaction, returning the array of changes and an EditingResult showing the
- * results of applying the changes as an Edit to the initial Snapshot (passed to the constructor).
- *
- * No data outside the Transaction is modified by Transaction:
- * the results from `close` must be used to actually submit an `Edit`.
- */
-export class TransactionWithAnchors extends Transaction {
-    constructor() {
-        super(...arguments);
-        this.detached = new Map();
-    }
-    static factory(snapshot) {
-        return new TransactionWithAnchors(snapshot);
-    }
-    tryResolveChange(change, path) {
-        return resolveChangeAnchors(change, this.view, path);
-    }
-}
-//# sourceMappingURL=TransactionWithAnchors.js.map

package/lib/anchored-edits/TransactionWithAnchors.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"TransactionWithAnchors.js","sourceRoot":"","sources":["../../src/anchored-edits/TransactionWithAnchors.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAE/C,OAAO,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAE1D;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,sBAAuB,SAAQ,WAAW;IAAvD;;QACoB,aAAQ,GAA+C,IAAI,GAAG,EAAE,CAAC;IAYrF,CAAC;IAVO,MAAM,CAAC,OAAO,CAAC,QAAkB;QACvC,OAAO,IAAI,sBAAsB,CAAC,QAAQ,CAAC,CAAC;IAC7C,CAAC;IAES,gBAAgB,CACzB,MAAsB,EACtB,IAAwC;QAExC,OAAO,oBAAoB,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACtD,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { NodeId, DetachedSequenceId } from '../Identifiers';\nimport { Snapshot } from '../Snapshot';\nimport { ReconciliationPath } from '../ReconciliationPath';\nimport { Transaction } from '../default-edits';\nimport { AnchoredChange } from './PersistedTypes';\nimport { resolveChangeAnchors } from './AnchorResolution';\n\n/**\n * A mutable transaction for applying sequences of changes to a Snapshot.\n * Allows viewing the intermediate states.\n *\n * Contains necessary state to apply changes within an edit to a Snapshot.\n *\n * May have any number of changes applied to make up the edit.\n * Use `close` to complete the transaction, returning the array of changes and an EditingResult showing the\n * results of applying the changes as an Edit to the initial Snapshot (passed to the constructor).\n *\n * No data outside the Transaction is modified by Transaction:\n * the results from `close` must be used to actually submit an `Edit`.\n */\nexport class TransactionWithAnchors extends Transaction {\n\tprotected readonly detached: Map<DetachedSequenceId, readonly NodeId[]> = new Map();\n\n\tpublic static factory(snapshot: Snapshot): TransactionWithAnchors {\n\t\treturn new TransactionWithAnchors(snapshot);\n\t}\n\n\tprotected tryResolveChange(\n\t\tchange: AnchoredChange,\n\t\tpath: ReconciliationPath<AnchoredChange>\n\t): AnchoredChange | undefined {\n\t\treturn resolveChangeAnchors(change, this.view, path);\n\t}\n}\n"]}

package/lib/anchored-edits/index.d.ts

@@ -1,10 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { SharedTreeWithAnchors, SharedTreeWithAnchorsEditor } from './SharedTreeWithAnchors';
-export * from './PersistedTypes';
-export * from './Factory';
-export { TransactionWithAnchors } from './TransactionWithAnchors';
-export { resolveChangeAnchors, findLastOffendingChange, resolveNodeAnchor, resolvePlaceAnchor, resolveRangeAnchor, updateRelativePlaceAnchorForChange, updateRelativePlaceAnchorForPath, EvaluatedChange, } from './AnchorResolution';
-//# sourceMappingURL=index.d.ts.map

package/lib/anchored-edits/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/anchored-edits/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,qBAAqB,EAAE,2BAA2B,EAAE,MAAM,yBAAyB,CAAC;AAC7F,cAAc,kBAAkB,CAAC;AACjC,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EACN,oBAAoB,EACpB,uBAAuB,EACvB,iBAAiB,EACjB,kBAAkB,EAClB,kBAAkB,EAClB,kCAAkC,EAClC,gCAAgC,EAChC,eAAe,GACf,MAAM,oBAAoB,CAAC"}

package/lib/anchored-edits/index.js

@@ -1,11 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// API Exports
-export { SharedTreeWithAnchors, SharedTreeWithAnchorsEditor } from './SharedTreeWithAnchors';
-export * from './PersistedTypes';
-export * from './Factory';
-export { TransactionWithAnchors } from './TransactionWithAnchors';
-export { resolveChangeAnchors, findLastOffendingChange, resolveNodeAnchor, resolvePlaceAnchor, resolveRangeAnchor, updateRelativePlaceAnchorForChange, updateRelativePlaceAnchorForPath, } from './AnchorResolution';
-//# sourceMappingURL=index.js.map

package/lib/anchored-edits/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/anchored-edits/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc;AAEd,OAAO,EAAE,qBAAqB,EAAE,2BAA2B,EAAE,MAAM,yBAAyB,CAAC;AAC7F,cAAc,kBAAkB,CAAC;AACjC,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EACN,oBAAoB,EACpB,uBAAuB,EACvB,iBAAiB,EACjB,kBAAkB,EAClB,kBAAkB,EAClB,kCAAkC,EAClC,gCAAgC,GAEhC,MAAM,oBAAoB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n// API Exports\n\nexport { SharedTreeWithAnchors, SharedTreeWithAnchorsEditor } from './SharedTreeWithAnchors';\nexport * from './PersistedTypes';\nexport * from './Factory';\nexport { TransactionWithAnchors } from './TransactionWithAnchors';\nexport {\n\tresolveChangeAnchors,\n\tfindLastOffendingChange,\n\tresolveNodeAnchor,\n\tresolvePlaceAnchor,\n\tresolveRangeAnchor,\n\tupdateRelativePlaceAnchorForChange,\n\tupdateRelativePlaceAnchorForPath,\n\tEvaluatedChange,\n} from './AnchorResolution';\n"]}

package/lib/default-edits/EditUtilities.d.ts

@@ -1,57 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { DetachedSequenceId, NodeId } from '../Identifiers';
-import { Snapshot, SnapshotPlace, SnapshotRange } from '../Snapshot';
-import { EditValidationResult } from '../Checkout';
-import { BuildNode, TraitLocation, TreeNodeSequence } from '../generic';
-import { Change, StablePlace, StableRange } from './PersistedTypes';
-/**
- * Functions for constructing edits.
- */
-/**
- * Create a sequence of changes that resets the contents of `trait`.
- * @public
- */
-export declare function setTrait(trait: TraitLocation, nodes: TreeNodeSequence<BuildNode>): readonly Change[];
-/**
- * Check the validity of the given `StablePlace`
- * @param snapshot - the `Snapshot` within which to validate the given place
- * @param place - the `StablePlace` to check
- */
-export declare function validateStablePlace(snapshot: Snapshot, place: StablePlace): EditValidationResult;
-/**
- * Check the validity of the given `StableRange`
- * @param snapshot - the `Snapshot` within which to validate the given range
- * @param range - the `StableRange` to check
- */
-export declare function validateStableRange(snapshot: Snapshot, range: StableRange): EditValidationResult;
-/**
- * Express the given `StableRange` as a `Range`
- */
-export declare function rangeFromStableRange(snapshot: Snapshot, range: StableRange): SnapshotRange;
-/**
- * Express the given `StablePlace` as a `Place`
- */
-export declare function placeFromStablePlace(snapshot: Snapshot, stablePlace: StablePlace): SnapshotPlace;
-/**
- * Parents a set of nodes in a specified location within a trait.
- * @param nodesToInsert - the nodes to parent in the specified place. The nodes must already be present in the Snapshot.
- * @param placeToInsert - the location to insert the nodes.
- */
-export declare function insertIntoTrait(snapshot: Snapshot, nodesToInsert: readonly NodeId[], placeToInsert: StablePlace): Snapshot;
-/**
- * Detaches a range of nodes from their parent. The detached nodes remain in the Snapshot.
- * @param rangeToDetach - the range of nodes to detach
- */
-export declare function detachRange(snapshot: Snapshot, rangeToDetach: StableRange): {
-    snapshot: Snapshot;
-    detached: readonly NodeId[];
-};
-/**
- * Determine if an BuildNode is a DetachedSequenceId.
- * @internal
- */
-export declare function isDetachedSequenceId(node: BuildNode): node is DetachedSequenceId;
-//# sourceMappingURL=EditUtilities.d.ts.map

package/lib/default-edits/EditUtilities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"EditUtilities.d.ts","sourceRoot":"","sources":["../../src/default-edits/EditUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAErE,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,SAAS,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACxE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAEpE;;GAEG;AAEH;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,gBAAgB,CAAC,SAAS,CAAC,GAAG,SAAS,MAAM,EAAE,CAKpG;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,GAAG,oBAAoB,CAmChG;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,GAAG,oBAAoB,CAkChG;AAuCD;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,GAAG,aAAa,CAO1F;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAAC,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,GAAG,aAAa,CAchG;AAaD;;;;GAIG;AACH,wBAAgB,eAAe,CAC9B,QAAQ,EAAE,QAAQ,EAClB,aAAa,EAAE,SAAS,MAAM,EAAE,EAChC,aAAa,EAAE,WAAW,GACxB,QAAQ,CAEV;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAC1B,QAAQ,EAAE,QAAQ,EAClB,aAAa,EAAE,WAAW,GACxB;IAAE,QAAQ,EAAE,QAAQ,CAAC;IAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAA;CAAE,CAErD;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI,IAAI,kBAAkB,CAEhF"}