@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/lib/anchored-edits/AnchorResolution.js

@@ -1,152 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { Side } from '../Snapshot';
-import { ChangeType, placeFromStablePlace, validateStablePlace, validateStableRange, } from '../default-edits';
-import { assert, assertNotUndefined, fail } from '../Common';
-import { EditValidationResult } from '../Checkout';
-import { PlaceAnchorSemanticsChoice, } from './PersistedTypes';
-export function resolveChangeAnchors(change, before, path, { nodeResolver, placeResolver, rangeResolver } = {
-    nodeResolver: resolveNodeAnchor,
-    placeResolver: resolvePlaceAnchor,
-    rangeResolver: resolveRangeAnchor,
-}) {
-    switch (change.type) {
-        case ChangeType.Build:
-            return change;
-        case ChangeType.Insert: {
-            const destination = placeResolver(change.destination, before, path);
-            return destination !== undefined ? Object.assign(Object.assign({}, change), { destination }) : undefined;
-        }
-        case ChangeType.Detach: {
-            const source = rangeResolver(change.source, before, path);
-            return source !== undefined ? Object.assign(Object.assign({}, change), { source }) : undefined;
-        }
-        case ChangeType.Constraint: {
-            const toConstrain = rangeResolver(change.toConstrain, before, path);
-            return toConstrain !== undefined ? Object.assign(Object.assign({}, change), { toConstrain }) : undefined;
-        }
-        case ChangeType.SetValue: {
-            const nodeToModify = nodeResolver(change.nodeToModify, before, path);
-            return nodeToModify !== undefined ? Object.assign(Object.assign({}, change), { nodeToModify }) : undefined;
-        }
-        default:
-            return fail('Attempted to reconciliate unsupported change');
-    }
-}
-/**
- * Resolves a given `node` anchor in the face of a `ReconciliationPath`.
- * @param node - The anchor to resolve.
- * @param before - The state to which the change that the `node` anchor should be applied to.
- * @param path - The reconciliation path for the change that the `node` is part of.
- * @returns A matching `NodeId` that is valid in the snapshot at the end of the `path`. Undefined if no such node exists.
- * @internal
- */
-export function resolveNodeAnchor(node, before, path) {
-    return before.hasNode(node) ? node : undefined;
-}
-export function resolveRangeAnchor(range, before, path, { placeResolver, rangeValidator, } = {
-    placeResolver: resolvePlaceAnchor,
-    rangeValidator: validateStableRange,
-}) {
-    const start = placeResolver(range.start, before, path);
-    if (start !== undefined) {
-        const end = placeResolver(range.end, before, path);
-        if (end !== undefined) {
-            const resolvedRange = {
-                start,
-                end,
-            };
-            return rangeValidator(before, resolvedRange) === EditValidationResult.Valid ? resolvedRange : undefined;
-        }
-    }
-    return undefined;
-}
-export function resolvePlaceAnchor(place, before, path, { placeValidator, placeUpdatorForPath, } = {
-    placeValidator: validateStablePlace,
-    placeUpdatorForPath: updateRelativePlaceAnchorForPath,
-}) {
-    let newPlace = place;
-    while (newPlace !== undefined && placeValidator(before, newPlace) !== EditValidationResult.Valid) {
-        switch (newPlace.semantics) {
-            case PlaceAnchorSemanticsChoice.RelativeToNode: {
-                newPlace = placeUpdatorForPath(newPlace, path);
-                break;
-            }
-            case PlaceAnchorSemanticsChoice.BoundToNode:
-            case undefined:
-                // There's nothing we can do to fix this place
-                newPlace = undefined;
-                break;
-            default:
-                fail('Unsupported choice of PlaceAnchorSemanticsChoice');
-        }
-    }
-    return newPlace;
-}
-export function updateRelativePlaceAnchorForPath(place, path, { lastOffendingChangeFinder, placeUpdatorForChange, } = {
-    lastOffendingChangeFinder: findLastOffendingChange,
-    placeUpdatorForChange: updateRelativePlaceAnchorForChange,
-}) {
-    if (place.referenceSibling === undefined) {
-        // Start and end places cannot be updated.
-        return undefined;
-    }
-    const lastOffendingChange = lastOffendingChangeFinder(place, path);
-    return lastOffendingChange === undefined ? undefined : placeUpdatorForChange(place, lastOffendingChange);
-}
-export function findLastOffendingChange(place, path, { placeValidator } = {
-    placeValidator: validateStablePlace,
-}) {
-    let followingChange;
-    for (let editIndex = path.length - 1; editIndex >= 0; --editIndex) {
-        const edit = path[editIndex];
-        for (let changeIndex = edit.length - 1; changeIndex >= 0; --changeIndex) {
-            const change = edit[changeIndex];
-            const placeStatusAfterChange = placeValidator(change.after, place);
-            if (placeStatusAfterChange === EditValidationResult.Valid) {
-                return Object.assign({ before: change.after }, assertNotUndefined(followingChange, 'The last change should not make the place valid'));
-            }
-            followingChange = {
-                change: change.resolvedChange,
-                after: change.after,
-            };
-        }
-    }
-    return path.length > 0 && placeValidator(path[0].before, place) === EditValidationResult.Valid
-        ? Object.assign({ before: path[0].before }, assertNotUndefined(followingChange, 'The last change should not make the place valid')) : // The place was never valid
-        undefined;
-}
-export function updateRelativePlaceAnchorForChange(place, { change, before }) {
-    if (place.referenceSibling === undefined) {
-        // A start or end place cannot be further updated
-        return undefined;
-    }
-    assert(change.type === ChangeType.Detach, 'A PlaceAnchor can only be made invalid by a detach change');
-    const targetPlace = placeFromStablePlace(before, place);
-    const startPlace = placeFromStablePlace(before, change.source.start);
-    const endPlace = placeFromStablePlace(before, change.source.end);
-    if (targetPlace.trait.parent !== startPlace.trait.parent) {
-        // The target place was detached indirectly by detaching its parent.
-        // The anchor cannot recover.
-        return undefined;
-    }
-    let newIndex;
-    if (targetPlace.side === Side.After) {
-        newIndex = before.findIndexWithinTrait(startPlace) - 1;
-    }
-    if (targetPlace.side === Side.Before) {
-        newIndex = before.findIndexWithinTrait(endPlace);
-    }
-    const referenceTrait = targetPlace.trait;
-    const parentNode = before.getSnapshotNode(referenceTrait.parent);
-    const traits = new Map(parentNode.traits);
-    const trait = assertNotUndefined(traits.get(referenceTrait.label), 'The trait must have been populated before the deletion');
-    const referenceSibling = trait[newIndex];
-    if (referenceSibling === undefined) {
-        return { referenceTrait, side: place.side, semantics: place.semantics };
-    }
-    return { referenceSibling, side: place.side, semantics: place.semantics };
-}
-//# sourceMappingURL=AnchorResolution.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"AnchorResolution.js","sourceRoot":"","sources":["../../src/anchored-edits/AnchorResolution.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAY,MAAM,aAAa,CAAC;AAC7C,OAAO,EAEN,UAAU,EACV,oBAAoB,EAGpB,mBAAmB,EACnB,mBAAmB,GACnB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAC7D,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AAGnD,OAAO,EAIN,0BAA0B,GAG1B,MAAM,kBAAkB,CAAC;AA+E1B,MAAM,UAAU,oBAAoB,CACnC,MAAsB,EACtB,MAAgB,EAChB,IAAwC,EACxC,EAAE,YAAY,EAAE,aAAa,EAAE,aAAa,KAA4D;IACvG,YAAY,EAAE,iBAAiB;IAC/B,aAAa,EAAE,kBAAkB;IACjC,aAAa,EAAE,kBAAkB;CACjC;IAED,QAAQ,MAAM,CAAC,IAAI,EAAE;QACpB,KAAK,UAAU,CAAC,KAAK;YACpB,OAAO,MAAM,CAAC;QACf,KAAK,UAAU,CAAC,MAAM,CAAC,CAAC;YACvB,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YACpE,OAAO,WAAW,KAAK,SAAS,CAAC,CAAC,iCAAM,MAAM,KAAE,WAAW,IAAG,CAAC,CAAC,SAAS,CAAC;SAC1E;QACD,KAAK,UAAU,CAAC,MAAM,CAAC,CAAC;YACvB,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YAC1D,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,iCAAM,MAAM,KAAE,MAAM,IAAG,CAAC,CAAC,SAAS,CAAC;SAChE;QACD,KAAK,UAAU,CAAC,UAAU,CAAC,CAAC;YAC3B,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YACpE,OAAO,WAAW,KAAK,SAAS,CAAC,CAAC,iCAAM,MAAM,KAAE,WAAW,IAAG,CAAC,CAAC,SAAS,CAAC;SAC1E;QACD,KAAK,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzB,MAAM,YAAY,GAAG,YAAY,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;YACrE,OAAO,YAAY,KAAK,SAAS,CAAC,CAAC,iCAAM,MAAM,KAAE,YAAY,IAAG,CAAC,CAAC,SAAS,CAAC;SAC5E;QACD;YACC,OAAO,IAAI,CAAC,8CAA8C,CAAC,CAAC;KAC7D;AACF,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAChC,IAAgB,EAChB,MAAgB,EAChB,IAAwC;IAExC,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AAChD,CAAC;AA6BD,MAAM,UAAU,kBAAkB,CACjC,KAAkB,EAClB,MAAgB,EAChB,IAAwC,EACxC,EACC,aAAa,EACb,cAAc,MAGX;IACH,aAAa,EAAE,kBAAkB;IACjC,cAAc,EAAE,mBAAmB;CACnC;IAED,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IACvD,IAAI,KAAK,KAAK,SAAS,EAAE;QACxB,MAAM,GAAG,GAAG,aAAa,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;QACnD,IAAI,GAAG,KAAK,SAAS,EAAE;YACtB,MAAM,aAAa,GAAG;gBACrB,KAAK;gBACL,GAAG;aACH,CAAC;YACF,OAAO,cAAc,CAAC,MAAM,EAAE,aAAa,CAAC,KAAK,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC;SACxG;KACD;IACD,OAAO,SAAS,CAAC;AAClB,CAAC;AAgCD,MAAM,UAAU,kBAAkB,CACjC,KAAkB,EAClB,MAAgB,EAChB,IAAwC,EACxC,EACC,cAAc,EACd,mBAAmB,MAMhB;IACH,cAAc,EAAE,mBAAmB;IACnC,mBAAmB,EAAE,gCAAgC;CACrD;IAED,IAAI,QAAQ,GAA4B,KAAK,CAAC;IAC9C,OAAO,QAAQ,KAAK,SAAS,IAAI,cAAc,CAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,oBAAoB,CAAC,KAAK,EAAE;QACjG,QAAQ,QAAQ,CAAC,SAAS,EAAE;YAC3B,KAAK,0BAA0B,CAAC,cAAc,CAAC,CAAC;gBAC/C,QAAQ,GAAG,mBAAmB,CAAC,QAA+B,EAAE,IAAI,CAAC,CAAC;gBACtE,MAAM;aACN;YACD,KAAK,0BAA0B,CAAC,WAAW,CAAC;YAC5C,KAAK,SAAS;gBACb,8CAA8C;gBAC9C,QAAQ,GAAG,SAAS,CAAC;gBACrB,MAAM;YACP;gBACC,IAAI,CAAC,kDAAkD,CAAC,CAAC;SAC1D;KACD;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAkCD,MAAM,UAAU,gCAAgC,CAC/C,KAA0B,EAC1B,IAAwC,EACxC,EACC,yBAAyB,EACzB,qBAAqB,MAUlB;IACH,yBAAyB,EAAE,uBAAuB;IAClD,qBAAqB,EAAE,kCAAkC;CACzD;IAED,IAAI,KAAK,CAAC,gBAAgB,KAAK,SAAS,EAAE;QACzC,0CAA0C;QAC1C,OAAO,SAAS,CAAC;KACjB;IACD,MAAM,mBAAmB,GAAG,yBAAyB,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACnE,OAAO,mBAAmB,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,qBAAqB,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;AAC1G,CAAC;AAwBD,MAAM,UAAU,uBAAuB,CACtC,KAA0B,EAC1B,IAAwC,EACxC,EAAE,cAAc,KAAwB;IACvC,cAAc,EAAE,mBAAmB;CACnC;IAED,IAAI,eAAwE,CAAC;IAC7E,KAAK,IAAI,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,SAAS,IAAI,CAAC,EAAE,EAAE,SAAS,EAAE;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;QAC7B,KAAK,IAAI,WAAW,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,WAAW,IAAI,CAAC,EAAE,EAAE,WAAW,EAAE;YACxE,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,MAAM,sBAAsB,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACnE,IAAI,sBAAsB,KAAK,oBAAoB,CAAC,KAAK,EAAE;gBAC1D,uBACC,MAAM,EAAE,MAAM,CAAC,KAAK,IACjB,kBAAkB,CAAC,eAAe,EAAE,iDAAiD,CAAC,EACxF;aACF;YACD,eAAe,GAAG;gBACjB,MAAM,EAAE,MAAM,CAAC,cAAc;gBAC7B,KAAK,EAAE,MAAM,CAAC,KAAK;aACnB,CAAC;SACF;KACD;IACD,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,oBAAoB,CAAC,KAAK;QAC7F,CAAC,iBACC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,IACnB,kBAAkB,CAAC,eAAe,EAAE,iDAAiD,CAAC,EAE3F,CAAC,CAAC,4BAA4B;QAC5B,SAAS,CAAC;AACd,CAAC;AAeD,MAAM,UAAU,kCAAkC,CACjD,KAA0B,EAC1B,EAAE,MAAM,EAAE,MAAM,EAAmC;IAEnD,IAAI,KAAK,CAAC,gBAAgB,KAAK,SAAS,EAAE;QACzC,iDAAiD;QACjD,OAAO,SAAS,CAAC;KACjB;IACD,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,MAAM,EAAE,2DAA2D,CAAC,CAAC;IACvG,MAAM,WAAW,GAAG,oBAAoB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IACxD,MAAM,UAAU,GAAG,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACrE,MAAM,QAAQ,GAAG,oBAAoB,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACjE,IAAI,WAAW,CAAC,KAAK,CAAC,MAAM,KAAK,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE;QACzD,oEAAoE;QACpE,6BAA6B;QAC7B,OAAO,SAAS,CAAC;KACjB;IACD,IAAI,QAAQ,CAAC;IACb,IAAI,WAAW,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;QACpC,QAAQ,GAAG,MAAM,CAAC,oBAAoB,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;KACvD;IACD,IAAI,WAAW,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,EAAE;QACrC,QAAQ,GAAG,MAAM,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;KACjD;IACD,MAAM,cAAc,GAAG,WAAW,CAAC,KAAK,CAAC;IACzC,MAAM,UAAU,GAAG,MAAM,CAAC,eAAe,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IACjE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,kBAAkB,CAC/B,MAAM,CAAC,GAAG,CAAC,cAAc,CAAC,KAAK,CAAC,EAChC,wDAAwD,CACxD,CAAC;IACF,MAAM,gBAAgB,GAAG,KAAK,CAAC,QAAQ,CAAC,CAAC;IACzC,IAAI,gBAAgB,KAAK,SAAS,EAAE;QACnC,OAAO,EAAE,cAAc,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC;KACxE;IACD,OAAO,EAAE,gBAAgB,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC;AAC3E,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { Side, Snapshot } from '../Snapshot';\nimport {\n\tChange,\n\tChangeType,\n\tplaceFromStablePlace,\n\tStablePlace,\n\tStableRange,\n\tvalidateStablePlace,\n\tvalidateStableRange,\n} from '../default-edits';\nimport { assert, assertNotUndefined, fail } from '../Common';\nimport { EditValidationResult } from '../Checkout';\nimport { NodeId } from '../Identifiers';\nimport { ReconciliationPath } from '../ReconciliationPath';\nimport {\n\tAnchoredChange,\n\tNodeAnchor,\n\tPlaceAnchor,\n\tPlaceAnchorSemanticsChoice,\n\tRangeAnchor,\n\tRelativePlaceAnchor,\n} from './PersistedTypes';\n\n/**\n * A change and the snapshots that precede and succeed it.\n */\nexport interface EvaluatedChange<TChange> {\n\treadonly change: TChange;\n\t/**\n\t * The snapshot before the change was applied.\n\t */\n\treadonly before: Snapshot;\n\t/**\n\t * The snapshot after the change was applied.\n\t */\n\treadonly after: Snapshot;\n}\n\n/**\n * Object that includes a function for resolving node anchors.\n */\nexport interface HasNodeResolver {\n\tnodeResolver: (node: NodeAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>) => NodeId | undefined;\n}\n\n/**\n * Object that includes a function for resolving place anchors.\n */\nexport interface HasPlaceResolver {\n\tplaceResolver: (\n\t\trange: PlaceAnchor,\n\t\tbefore: Snapshot,\n\t\tpath: ReconciliationPath<AnchoredChange>\n\t) => StablePlace | undefined;\n}\n\n/**\n * Object that includes a function for resolving range anchors.\n */\nexport interface HasRangeResolver {\n\trangeResolver: (\n\t\trange: RangeAnchor,\n\t\tbefore: Snapshot,\n\t\tpath: ReconciliationPath<AnchoredChange>\n\t) => StableRange | undefined;\n}\n\n/**\n * Object that includes a function for validating places.\n */\nexport interface HasPlaceValidator {\n\tplaceValidator: (snapshot: Snapshot, place: StablePlace) => EditValidationResult;\n}\n\n/**\n * Reconciliates a given `change` in the face of concurrent edits described in a `ReconciliationPath`.\n * @param change - The anchor to reconciliate.\n * @param before - The state to which the `change` would be applied to.\n * @param path - The reconciliation path for the `change`.\n * @returns A `Change` that satisfies the same semantics of the given `change` but whose tree locations are valid in the `before` snapshot.\n *   Undefined if no such change can be produced.\n * @internal\n */\nexport function resolveChangeAnchors(\n\tchange: AnchoredChange,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>\n): Change | undefined;\n\n/**\n * For testing purposes only.\n * @internal\n */\nexport function resolveChangeAnchors(\n\tchange: AnchoredChange,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>,\n\tdependencies?: HasNodeResolver & HasPlaceResolver & HasRangeResolver\n): Change | undefined;\n\nexport function resolveChangeAnchors(\n\tchange: AnchoredChange,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>,\n\t{ nodeResolver, placeResolver, rangeResolver }: HasNodeResolver & HasPlaceResolver & HasRangeResolver = {\n\t\tnodeResolver: resolveNodeAnchor,\n\t\tplaceResolver: resolvePlaceAnchor,\n\t\trangeResolver: resolveRangeAnchor,\n\t}\n): Change | undefined {\n\tswitch (change.type) {\n\t\tcase ChangeType.Build:\n\t\t\treturn change;\n\t\tcase ChangeType.Insert: {\n\t\t\tconst destination = placeResolver(change.destination, before, path);\n\t\t\treturn destination !== undefined ? { ...change, destination } : undefined;\n\t\t}\n\t\tcase ChangeType.Detach: {\n\t\t\tconst source = rangeResolver(change.source, before, path);\n\t\t\treturn source !== undefined ? { ...change, source } : undefined;\n\t\t}\n\t\tcase ChangeType.Constraint: {\n\t\t\tconst toConstrain = rangeResolver(change.toConstrain, before, path);\n\t\t\treturn toConstrain !== undefined ? { ...change, toConstrain } : undefined;\n\t\t}\n\t\tcase ChangeType.SetValue: {\n\t\t\tconst nodeToModify = nodeResolver(change.nodeToModify, before, path);\n\t\t\treturn nodeToModify !== undefined ? { ...change, nodeToModify } : undefined;\n\t\t}\n\t\tdefault:\n\t\t\treturn fail('Attempted to reconciliate unsupported change');\n\t}\n}\n\n/**\n * Resolves a given `node` anchor in the face of a `ReconciliationPath`.\n * @param node - The anchor to resolve.\n * @param before - The state to which the change that the `node` anchor should be applied to.\n * @param path - The reconciliation path for the change that the `node` is part of.\n * @returns A matching `NodeId` that is valid in the snapshot at the end of the `path`. Undefined if no such node exists.\n * @internal\n */\nexport function resolveNodeAnchor(\n\tnode: NodeAnchor,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>\n): NodeId | undefined {\n\treturn before.hasNode(node) ? node : undefined;\n}\n\n/**\n * Resolves a given `range` anchor in the face of a `ReconciliationPath`.\n * @param range - The anchor to resolve.\n * @param before - The state to which the change that the `range` anchor should be applied to.\n * @param path - The reconciliation path for the change that the `range` is part of.\n * @returns A matching `StableRange` that is valid in the snapshot at the end of the `path`. Undefined if no such valid range exists.\n * @internal\n */\nexport function resolveRangeAnchor(\n\trange: RangeAnchor,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>\n): StableRange | undefined;\n\n/**\n * For testing purposes only.\n * @internal\n */\nexport function resolveRangeAnchor(\n\trange: RangeAnchor,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>,\n\tdependencies?: HasPlaceResolver & {\n\t\trangeValidator: (snapshot: Snapshot, range: StableRange) => EditValidationResult;\n\t}\n): StableRange | undefined;\n\nexport function resolveRangeAnchor(\n\trange: RangeAnchor,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>,\n\t{\n\t\tplaceResolver,\n\t\trangeValidator,\n\t}: HasPlaceResolver & {\n\t\trangeValidator: (snapshot: Snapshot, range: StableRange) => EditValidationResult;\n\t} = {\n\t\tplaceResolver: resolvePlaceAnchor,\n\t\trangeValidator: validateStableRange,\n\t}\n): StableRange | undefined {\n\tconst start = placeResolver(range.start, before, path);\n\tif (start !== undefined) {\n\t\tconst end = placeResolver(range.end, before, path);\n\t\tif (end !== undefined) {\n\t\t\tconst resolvedRange = {\n\t\t\t\tstart,\n\t\t\t\tend,\n\t\t\t};\n\t\t\treturn rangeValidator(before, resolvedRange) === EditValidationResult.Valid ? resolvedRange : undefined;\n\t\t}\n\t}\n\treturn undefined;\n}\n\n/**\n * Resolves a given `place` anchor in the face of a `ReconciliationPath`.\n * @param place - The anchor to resolve.\n * @param before - The state to which the change that the `place` anchor should be applied to.\n * @param path - The reconciliation path for the change that the `place` is part of.\n * @returns A matching `StablePlace` that is valid in the snapshot at the end of the `path`. Undefined if no such valid place exists.\n * @internal\n */\nexport function resolvePlaceAnchor(\n\tplace: PlaceAnchor,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>\n): StablePlace | undefined;\n\n/**\n * For testing purposes only.\n * @internal\n */\nexport function resolvePlaceAnchor(\n\tplace: PlaceAnchor,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>,\n\tdependencies?: HasPlaceValidator & {\n\t\tplaceUpdatorForPath: (\n\t\t\tplace: RelativePlaceAnchor,\n\t\t\tpath: ReconciliationPath<AnchoredChange>\n\t\t) => PlaceAnchor | undefined;\n\t}\n): StablePlace | undefined;\n\nexport function resolvePlaceAnchor(\n\tplace: PlaceAnchor,\n\tbefore: Snapshot,\n\tpath: ReconciliationPath<AnchoredChange>,\n\t{\n\t\tplaceValidator,\n\t\tplaceUpdatorForPath,\n\t}: HasPlaceValidator & {\n\t\tplaceUpdatorForPath: (\n\t\t\tplace: RelativePlaceAnchor,\n\t\t\tpath: ReconciliationPath<AnchoredChange>\n\t\t) => PlaceAnchor | undefined;\n\t} = {\n\t\tplaceValidator: validateStablePlace,\n\t\tplaceUpdatorForPath: updateRelativePlaceAnchorForPath,\n\t}\n): StablePlace | undefined {\n\tlet newPlace: PlaceAnchor | undefined = place;\n\twhile (newPlace !== undefined && placeValidator(before, newPlace) !== EditValidationResult.Valid) {\n\t\tswitch (newPlace.semantics) {\n\t\t\tcase PlaceAnchorSemanticsChoice.RelativeToNode: {\n\t\t\t\tnewPlace = placeUpdatorForPath(newPlace as RelativePlaceAnchor, path);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase PlaceAnchorSemanticsChoice.BoundToNode:\n\t\t\tcase undefined:\n\t\t\t\t// There's nothing we can do to fix this place\n\t\t\t\tnewPlace = undefined;\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tfail('Unsupported choice of PlaceAnchorSemanticsChoice');\n\t\t}\n\t}\n\treturn newPlace;\n}\n\n/**\n * Updates a given `place` anchor in the face of a `ReconciliationPath` that violates its semantics.\n * @param place - The anchor to update. Assumed to be invalid after the latest change.\n * @param path - The sequence of edits that violates the anchor's semantics.\n * @returns A place anchor whose semantics are inline with the given `place`, and valid after the most recent change that made it invalid.\n *   Undefined if those semantics cannot be preserved.\n * @internal\n */\nexport function updateRelativePlaceAnchorForPath(\n\tplace: RelativePlaceAnchor,\n\tpath: ReconciliationPath<AnchoredChange>\n): PlaceAnchor | undefined;\n\n/**\n * For testing purposes only.\n * @internal\n */\nexport function updateRelativePlaceAnchorForPath(\n\tplace: RelativePlaceAnchor,\n\tpath: ReconciliationPath<AnchoredChange>,\n\tdependencies?: {\n\t\tlastOffendingChangeFinder: (\n\t\t\tplace: RelativePlaceAnchor,\n\t\t\tpath: ReconciliationPath<AnchoredChange>\n\t\t) => EvaluatedChange<AnchoredChange> | undefined;\n\t\tplaceUpdatorForChange: (\n\t\t\tplace: RelativePlaceAnchor,\n\t\t\tchange: EvaluatedChange<AnchoredChange>\n\t\t) => PlaceAnchor | undefined;\n\t}\n): PlaceAnchor | undefined;\n\nexport function updateRelativePlaceAnchorForPath(\n\tplace: RelativePlaceAnchor,\n\tpath: ReconciliationPath<AnchoredChange>,\n\t{\n\t\tlastOffendingChangeFinder,\n\t\tplaceUpdatorForChange,\n\t}: {\n\t\tlastOffendingChangeFinder: (\n\t\t\tplace: RelativePlaceAnchor,\n\t\t\tpath: ReconciliationPath<AnchoredChange>\n\t\t) => EvaluatedChange<AnchoredChange> | undefined;\n\t\tplaceUpdatorForChange: (\n\t\t\tplace: RelativePlaceAnchor,\n\t\t\tchange: EvaluatedChange<AnchoredChange>\n\t\t) => PlaceAnchor | undefined;\n\t} = {\n\t\tlastOffendingChangeFinder: findLastOffendingChange,\n\t\tplaceUpdatorForChange: updateRelativePlaceAnchorForChange,\n\t}\n): PlaceAnchor | undefined {\n\tif (place.referenceSibling === undefined) {\n\t\t// Start and end places cannot be updated.\n\t\treturn undefined;\n\t}\n\tconst lastOffendingChange = lastOffendingChangeFinder(place, path);\n\treturn lastOffendingChange === undefined ? undefined : placeUpdatorForChange(place, lastOffendingChange);\n}\n\n/**\n * Finds the latest change in the given `path` that last made the given `place` invalid.\n * @param place - A anchor that is invalid in the last snapshot on the path.\n * @param path - The sequence of edits that violates the anchor's semantics.\n * @returns The change that last made the given `place` invalid and the snapshots before and after it. Undefined if `place` was never valid.\n * @internal\n */\nexport function findLastOffendingChange(\n\tplace: RelativePlaceAnchor,\n\tpath: ReconciliationPath<AnchoredChange>\n): EvaluatedChange<AnchoredChange> | undefined;\n\n/**\n * For testing purposes only.\n * @internal\n */\nexport function findLastOffendingChange(\n\tplace: RelativePlaceAnchor,\n\tpath: ReconciliationPath<AnchoredChange>,\n\tdependencies?: HasPlaceValidator\n): EvaluatedChange<AnchoredChange> | undefined;\n\nexport function findLastOffendingChange(\n\tplace: RelativePlaceAnchor,\n\tpath: ReconciliationPath<AnchoredChange>,\n\t{ placeValidator }: HasPlaceValidator = {\n\t\tplaceValidator: validateStablePlace,\n\t}\n): EvaluatedChange<AnchoredChange> | undefined {\n\tlet followingChange: { change: AnchoredChange; after: Snapshot } | undefined;\n\tfor (let editIndex = path.length - 1; editIndex >= 0; --editIndex) {\n\t\tconst edit = path[editIndex];\n\t\tfor (let changeIndex = edit.length - 1; changeIndex >= 0; --changeIndex) {\n\t\t\tconst change = edit[changeIndex];\n\t\t\tconst placeStatusAfterChange = placeValidator(change.after, place);\n\t\t\tif (placeStatusAfterChange === EditValidationResult.Valid) {\n\t\t\t\treturn {\n\t\t\t\t\tbefore: change.after,\n\t\t\t\t\t...assertNotUndefined(followingChange, 'The last change should not make the place valid'),\n\t\t\t\t};\n\t\t\t}\n\t\t\tfollowingChange = {\n\t\t\t\tchange: change.resolvedChange,\n\t\t\t\tafter: change.after,\n\t\t\t};\n\t\t}\n\t}\n\treturn path.length > 0 && placeValidator(path[0].before, place) === EditValidationResult.Valid\n\t\t? {\n\t\t\t\tbefore: path[0].before,\n\t\t\t\t...assertNotUndefined(followingChange, 'The last change should not make the place valid'),\n\t\t  }\n\t\t: // The place was never valid\n\t\t  undefined;\n}\n\n/**\n * Updates a given `place` anchor in the face of a change that violates its semantics.\n * @param place - The anchor to update.\n * @param change - The change that violates the anchor's semantics.\n * @returns A place anchor that is valid after the given `change` and in line with the original `place`'s semantics.\n *   Undefined if those semantics cannot be preserved.\n * @internal\n */\nexport function updateRelativePlaceAnchorForChange(\n\tplace: RelativePlaceAnchor,\n\tchange: EvaluatedChange<AnchoredChange>\n): PlaceAnchor | undefined;\n\nexport function updateRelativePlaceAnchorForChange(\n\tplace: RelativePlaceAnchor,\n\t{ change, before }: EvaluatedChange<AnchoredChange>\n): PlaceAnchor | undefined {\n\tif (place.referenceSibling === undefined) {\n\t\t// A start or end place cannot be further updated\n\t\treturn undefined;\n\t}\n\tassert(change.type === ChangeType.Detach, 'A PlaceAnchor can only be made invalid by a detach change');\n\tconst targetPlace = placeFromStablePlace(before, place);\n\tconst startPlace = placeFromStablePlace(before, change.source.start);\n\tconst endPlace = placeFromStablePlace(before, change.source.end);\n\tif (targetPlace.trait.parent !== startPlace.trait.parent) {\n\t\t// The target place was detached indirectly by detaching its parent.\n\t\t// The anchor cannot recover.\n\t\treturn undefined;\n\t}\n\tlet newIndex;\n\tif (targetPlace.side === Side.After) {\n\t\tnewIndex = before.findIndexWithinTrait(startPlace) - 1;\n\t}\n\tif (targetPlace.side === Side.Before) {\n\t\tnewIndex = before.findIndexWithinTrait(endPlace);\n\t}\n\tconst referenceTrait = targetPlace.trait;\n\tconst parentNode = before.getSnapshotNode(referenceTrait.parent);\n\tconst traits = new Map(parentNode.traits);\n\tconst trait = assertNotUndefined(\n\t\ttraits.get(referenceTrait.label),\n\t\t'The trait must have been populated before the deletion'\n\t);\n\tconst referenceSibling = trait[newIndex];\n\tif (referenceSibling === undefined) {\n\t\treturn { referenceTrait, side: place.side, semantics: place.semantics };\n\t}\n\treturn { referenceSibling, side: place.side, semantics: place.semantics };\n}\n"]}

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

@@ -1,56 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IChannelAttributes, IFluidDataStoreRuntime, IChannelServices, IChannelFactory } from '@fluidframework/datastore-definitions';
-import { ISharedObject } from '@fluidframework/shared-object-base';
-import { SharedTreeWithAnchors } from './SharedTreeWithAnchors';
-/**
- * Factory for SharedTreeWithAnchors.
- * Includes history in the summary.
- * @public
- */
-export declare class SharedTreeWithAnchorsFactory implements IChannelFactory {
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory."type"}
-     */
-    static Type: string;
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}
-     */
-    static Attributes: IChannelAttributes;
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory."type"}
-     */
-    get type(): string;
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}
-     */
-    get attributes(): IChannelAttributes;
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.load}
-     */
-    load(runtime: IFluidDataStoreRuntime, id: string, services: IChannelServices, _channelAttributes: Readonly<IChannelAttributes>): Promise<ISharedObject>;
-    /**
-     * Create a new SharedTree.
-     * @param runtime - data store runtime that owns the new SharedTree
-     * @param id - optional name for the SharedTree
-     */
-    create(runtime: IFluidDataStoreRuntime, id: string, expensiveValidation?: boolean): SharedTreeWithAnchors;
-    /**
-     * Determines how the SharedTree will summarize the history.
-     * This is a workaround for lacking the ability to construct DDSs with custom parameters.
-     */
-    protected includeHistoryInSummary(): boolean;
-}
-/**
- * Factory for SharedTreeWithAnchors.
- * Does not include the history in the summary.
- * This is a workaround for lacking the ability to construct DDSs with custom parameters.
- * TODO:#54918: Clean up when DDS parameterization is supported.
- * @public
- */
-export declare class SharedTreeWithAnchorsFactoryNoHistory extends SharedTreeWithAnchorsFactory {
-    protected includeHistoryInSummary(): boolean;
-}
-//# sourceMappingURL=Factory.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Factory.d.ts","sourceRoot":"","sources":["../../src/anchored-edits/Factory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EACN,kBAAkB,EAClB,sBAAsB,EACtB,gBAAgB,EAChB,eAAe,EACf,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,oCAAoC,CAAC;AACnE,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAEhE;;;;GAIG;AACH,qBAAa,4BAA6B,YAAW,eAAe;IACnE;;OAEG;IACH,OAAc,IAAI,SAA2B;IAE7C;;OAEG;IACH,OAAc,UAAU,EAAE,kBAAkB,CAI1C;IAEF;;OAEG;IACH,IAAW,IAAI,IAAI,MAAM,CAExB;IAED;;OAEG;IACH,IAAW,UAAU,IAAI,kBAAkB,CAE1C;IAED;;OAEG;IACU,IAAI,CAChB,OAAO,EAAE,sBAAsB,EAC/B,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE,gBAAgB,EAC1B,kBAAkB,EAAE,QAAQ,CAAC,kBAAkB,CAAC,GAC9C,OAAO,CAAC,aAAa,CAAC;IAMzB;;;;OAIG;IACI,MAAM,CAAC,OAAO,EAAE,sBAAsB,EAAE,EAAE,EAAE,MAAM,EAAE,mBAAmB,CAAC,EAAE,OAAO,GAAG,qBAAqB;IAMhH;;;OAGG;IACH,SAAS,CAAC,uBAAuB,IAAI,OAAO;CAG5C;AAED;;;;;;GAMG;AACH,qBAAa,qCAAsC,SAAQ,4BAA4B;IACtF,SAAS,CAAC,uBAAuB,IAAI,OAAO;CAG5C"}

package/lib/anchored-edits/Factory.js

@@ -1,74 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { SharedTreeWithAnchors } from './SharedTreeWithAnchors';
-/**
- * Factory for SharedTreeWithAnchors.
- * Includes history in the summary.
- * @public
- */
-export class SharedTreeWithAnchorsFactory {
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory."type"}
-     */
-    get type() {
-        return SharedTreeWithAnchorsFactory.Type;
-    }
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}
-     */
-    get attributes() {
-        return SharedTreeWithAnchorsFactory.Attributes;
-    }
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.load}
-     */
-    async load(runtime, id, services, _channelAttributes) {
-        const sharedTree = new SharedTreeWithAnchors(runtime, id);
-        await sharedTree.load(services);
-        return sharedTree;
-    }
-    /**
-     * Create a new SharedTree.
-     * @param runtime - data store runtime that owns the new SharedTree
-     * @param id - optional name for the SharedTree
-     */
-    create(runtime, id, expensiveValidation) {
-        const sharedTree = new SharedTreeWithAnchors(runtime, id, expensiveValidation, this.includeHistoryInSummary());
-        sharedTree.initializeLocal();
-        return sharedTree;
-    }
-    /**
-     * Determines how the SharedTree will summarize the history.
-     * This is a workaround for lacking the ability to construct DDSs with custom parameters.
-     */
-    includeHistoryInSummary() {
-        return true;
-    }
-}
-/**
- * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory."type"}
- */
-SharedTreeWithAnchorsFactory.Type = 'SharedTreeWithAnchors';
-/**
- * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}
- */
-SharedTreeWithAnchorsFactory.Attributes = {
-    type: SharedTreeWithAnchorsFactory.Type,
-    snapshotFormatVersion: '0.1',
-    packageVersion: '0.1',
-};
-/**
- * Factory for SharedTreeWithAnchors.
- * Does not include the history in the summary.
- * This is a workaround for lacking the ability to construct DDSs with custom parameters.
- * TODO:#54918: Clean up when DDS parameterization is supported.
- * @public
- */
-export class SharedTreeWithAnchorsFactoryNoHistory extends SharedTreeWithAnchorsFactory {
-    includeHistoryInSummary() {
-        return false;
-    }
-}
-//# sourceMappingURL=Factory.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Factory.js","sourceRoot":"","sources":["../../src/anchored-edits/Factory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAEhE;;;;GAIG;AACH,MAAM,OAAO,4BAA4B;IAexC;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,4BAA4B,CAAC,IAAI,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,IAAW,UAAU;QACpB,OAAO,4BAA4B,CAAC,UAAU,CAAC;IAChD,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI,CAChB,OAA+B,EAC/B,EAAU,EACV,QAA0B,EAC1B,kBAAgD;QAEhD,MAAM,UAAU,GAAG,IAAI,qBAAqB,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC1D,MAAM,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChC,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,OAA+B,EAAE,EAAU,EAAE,mBAA6B;QACvF,MAAM,UAAU,GAAG,IAAI,qBAAqB,CAAC,OAAO,EAAE,EAAE,EAAE,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAC/G,UAAU,CAAC,eAAe,EAAE,CAAC;QAC7B,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;OAGG;IACO,uBAAuB;QAChC,OAAO,IAAI,CAAC;IACb,CAAC;;AA3DD;;GAEG;AACW,iCAAI,GAAG,uBAAuB,CAAC;AAE7C;;GAEG;AACW,uCAAU,GAAuB;IAC9C,IAAI,EAAE,4BAA4B,CAAC,IAAI;IACvC,qBAAqB,EAAE,KAAK;IAC5B,cAAc,EAAE,KAAK;CACrB,CAAC;AAkDH;;;;;;GAMG;AACH,MAAM,OAAO,qCAAsC,SAAQ,4BAA4B;IAC5E,uBAAuB;QAChC,OAAO,KAAK,CAAC;IACd,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport {\n\tIChannelAttributes,\n\tIFluidDataStoreRuntime,\n\tIChannelServices,\n\tIChannelFactory,\n} from '@fluidframework/datastore-definitions';\nimport { ISharedObject } from '@fluidframework/shared-object-base';\nimport { SharedTreeWithAnchors } from './SharedTreeWithAnchors';\n\n/**\n * Factory for SharedTreeWithAnchors.\n * Includes history in the summary.\n * @public\n */\nexport class SharedTreeWithAnchorsFactory implements IChannelFactory {\n\t/**\n\t * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.\"type\"}\n\t */\n\tpublic static Type = 'SharedTreeWithAnchors';\n\n\t/**\n\t * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}\n\t */\n\tpublic static Attributes: IChannelAttributes = {\n\t\ttype: SharedTreeWithAnchorsFactory.Type,\n\t\tsnapshotFormatVersion: '0.1',\n\t\tpackageVersion: '0.1',\n\t};\n\n\t/**\n\t * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.\"type\"}\n\t */\n\tpublic get type(): string {\n\t\treturn SharedTreeWithAnchorsFactory.Type;\n\t}\n\n\t/**\n\t * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}\n\t */\n\tpublic get attributes(): IChannelAttributes {\n\t\treturn SharedTreeWithAnchorsFactory.Attributes;\n\t}\n\n\t/**\n\t * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.load}\n\t */\n\tpublic async load(\n\t\truntime: IFluidDataStoreRuntime,\n\t\tid: string,\n\t\tservices: IChannelServices,\n\t\t_channelAttributes: Readonly<IChannelAttributes>\n\t): Promise<ISharedObject> {\n\t\tconst sharedTree = new SharedTreeWithAnchors(runtime, id);\n\t\tawait sharedTree.load(services);\n\t\treturn sharedTree;\n\t}\n\n\t/**\n\t * Create a new SharedTree.\n\t * @param runtime - data store runtime that owns the new SharedTree\n\t * @param id - optional name for the SharedTree\n\t */\n\tpublic create(runtime: IFluidDataStoreRuntime, id: string, expensiveValidation?: boolean): SharedTreeWithAnchors {\n\t\tconst sharedTree = new SharedTreeWithAnchors(runtime, id, expensiveValidation, this.includeHistoryInSummary());\n\t\tsharedTree.initializeLocal();\n\t\treturn sharedTree;\n\t}\n\n\t/**\n\t * Determines how the SharedTree will summarize the history.\n\t * This is a workaround for lacking the ability to construct DDSs with custom parameters.\n\t */\n\tprotected includeHistoryInSummary(): boolean {\n\t\treturn true;\n\t}\n}\n\n/**\n * Factory for SharedTreeWithAnchors.\n * Does not include the history in the summary.\n * This is a workaround for lacking the ability to construct DDSs with custom parameters.\n * TODO:#54918: Clean up when DDS parameterization is supported.\n * @public\n */\nexport class SharedTreeWithAnchorsFactoryNoHistory extends SharedTreeWithAnchorsFactory {\n\tprotected includeHistoryInSummary(): boolean {\n\t\treturn false;\n\t}\n}\n"]}

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

@@ -1,245 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { DetachedSequenceId, NodeId, TraitLabel, UuidString } from '../Identifiers';
-import { EditBase, BuildNode, NodeData, Payload, TraitLocation, TreeNodeSequence } from '../generic';
-import { Build, ConstraintEffect, Detach, Insert, SetValue, StablePlace, StableRange, Constraint } from '../default-edits';
-/**
- * Types for Edits in Fluid Ops and Fluid summaries.
- *
- * Types describing locations in the tree are stable in the presence of other concurrent edits.
- *
- * All types are compatible with Fluid Serializable.
- *
- * These types can only be modified in ways that are both backwards and forwards compatible since they
- * are used in edits, and thus are persisted (using Fluid serialization).
- *
- * This means these types cannot be changed in any way that impacts their Fluid serialization
- * except through a very careful process:
- *
- * 1. The planned change must support all old data, and maintain the exact semantics of it.
- * This means that the change is pretty much limited to adding optional fields,
- * or making required fields optional.
- * 2. Support for the new format must be deployed to all users (This means all applications using SharedTree must do this),
- * and this deployment must be confirmed to be stable and will not be rolled back.
- * 3. Usage of the new format may start.
- *
- * Support for the old format can NEVER be removed: it must be maintained indefinably or old documents will break.
- * Because this process puts requirements on applications using shared tree,
- * step 3 should only ever be done in a Major version update,
- * and must be explicitly called out in the release notes
- * stating which versions of SharedTree are supported for documents modified by the new version.
- */
-/**
- * The information included in an anchored edit.
- * @public
- */
-export declare type AnchoredEditBase = EditBase<AnchoredChange>;
-/**
- * A change that composes an Edit.
- *
- * `Change` objects can be conveniently constructed with the helper methods exported on a constant of the same name.
- * @example
- * Change.insert(sourceId, destination)
- * @public
- */
-export declare type AnchoredChange = AnchoredInsert | AnchoredDetach | Build | AnchoredSetValue | AnchoredConstraint;
-/**
- * Inserts a sequence of nodes at the specified destination.
- * The source can be constructed either by a Build (used to insert new nodes) or a Detach (amounts to a "move" operation).
- * @public
- */
-export interface AnchoredInsert extends Insert {
-    readonly destination: PlaceAnchor;
-}
-/**
- * Removes a sequence of nodes from the tree.
- * If a destination is specified, the detached sequence is associated with that ID and held for possible reuse
- * by later changes in this same Edit (such as by an Insert).
- * A Detach without a destination is a deletion of the specified sequence, as is a Detach with a destination that is not used later.
- * @public
- */
-export interface AnchoredDetach extends Detach {
-    readonly source: RangeAnchor;
-}
-/**
- * Modifies the payload of a node.
- * @public
- */
-export interface AnchoredSetValue extends SetValue {
-    readonly nodeToModify: NodeAnchor;
-}
-/**
- * A set of constraints on the validity of an Edit.
- * A Constraint is used to detect when an Edit, due to other concurrent edits, may have unintended effects or merge in
- * non-semantic ways. It is processed in order like any other Change in an Edit. It can cause an edit to fail if the
- * various constraints are not met at the time of evaluation (ex: the parentNode has changed due to concurrent editing).
- * Does not modify the document.
- * @public
- */
-export interface AnchoredConstraint extends Constraint {
-    /**
-     * Selects a sequence of nodes which will be checked against the constraints specified by the optional fields.
-     * If `toConstrain` is invalid, it will be treated like a constraint being unmet.
-     * Depending on `effect` this may or may not make the Edit invalid.
-     *
-     * When a constraint is not met, the effects is specified by `effect`.
-     */
-    readonly toConstrain: RangeAnchor;
-}
-/**
- * @public
- */
-export declare const AnchoredChange: {
-    build: (source: TreeNodeSequence<BuildNode>, destination: DetachedSequenceId) => Build;
-    insert: (source: DetachedSequenceId, destination: PlaceAnchor) => AnchoredInsert;
-    detach: (source: RangeAnchor, destination?: DetachedSequenceId | undefined) => AnchoredDetach;
-    setPayload: (nodeToModify: NodeAnchor, payload: Payload) => AnchoredSetValue;
-    clearPayload: (nodeToModify: NodeAnchor) => AnchoredSetValue;
-    constraint: (toConstrain: RangeAnchor, effect: ConstraintEffect, identityHash?: UuidString | undefined, length?: number | undefined, contentHash?: UuidString | undefined, parentNode?: NodeId | undefined, label?: TraitLabel | undefined) => AnchoredConstraint;
-};
-/**
- * Helper for creating a `Delete` edit.
- * @public
- */
-export declare const AnchoredDelete: {
-    /**
-     * @returns an AnchoredChange that deletes the supplied part of the tree.
-     */
-    create: (rangeAnchor: RangeAnchor) => AnchoredChange;
-};
-/**
- * Helper for creating an `Insert` edit.
- * @public
- */
-export declare const AnchoredInsert: {
-    /**
-     * @returns an AnchoredChange that inserts 'nodes' into the specified location in the tree.
-     */
-    create: (nodes: TreeNodeSequence<BuildNode>, destination: PlaceAnchor) => AnchoredChange[];
-};
-/**
- * Helper for creating a `Move` edit.
- * @public
- */
-export declare const AnchoredMove: {
-    /**
-     * @returns an AnchoredChange that moves the specified content to a new location in the tree.
-     */
-    create: (source: RangeAnchor, destination: PlaceAnchor) => AnchoredChange[];
-};
-/**
- * Indicates one of the predefined alternatives for the semantics of a place in a tree.
- */
-export declare enum 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.
-     */
-    BoundToNode = 0,
-    /**
-     * 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.
-     */
-    RelativeToNode = 1
-}
-/**
- * A location in a trait with associated merge semantics.
- * See also `StablePlace`.
- * `PlaceAnchor`. objects can be conveniently constructed with the helper methods exported on a constant of the same name.
- * @example
- * PlaceAnchor.before(node)
- * PlaceAnchor.atStartOf(trait)
- * @public
- */
-export interface PlaceAnchor extends StablePlace {
-    /**
-     * The choice of semantics for the place.
-     * No value is equivalent to PlaceAnchorSemanticsChoice.BoundToNode.
-     */
-    readonly semantics?: PlaceAnchorSemanticsChoice;
-}
-export declare type RelativePlaceAnchor = PlaceAnchor & {
-    semantic: PlaceAnchorSemanticsChoice.RelativeToNode;
-};
-/**
- * Specifies the range of nodes from `start` to `end` within a trait.
- * See also `StableRange`.
- * 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.
- *
- * `RangeAnchor`s are currently resolved by resolving their constituent places and checking the validity of the resulting range.
- * This may lead to the range becoming invalid (i.e., cannot be resolved) despite there being reasonable ways to salvage it.
- * 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.
- * A reasonable resolution would be to resolve the range to [After(A), Before(D)]. The current implementation will instead treat
- * the range as invalid.
- * Future improvements may offer more a resilient resolution strategy for ranges.
- *
- * `RangeAnchor` objects can be conveniently constructed with the helper methods exported on a constant of the same name.
- * @example
- * RangeAnchor.from(PlaceAnchor.before(startNode)).to(PlaceAnchor.after(endNode))
- * @public
- */
-export interface RangeAnchor extends StableRange {
-    readonly start: PlaceAnchor;
-    readonly end: PlaceAnchor;
-}
-export declare type NodeAnchor = NodeId;
-/**
- * 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.
- */
-/**
- * @public
- */
-export declare const PlaceAnchor: {
-    /**
-     * @returns The location directly before `node`.
-     */
-    before: (node: NodeData | NodeId, semantics?: PlaceAnchorSemanticsChoice) => PlaceAnchor;
-    /**
-     * @returns The location directly after `node`.
-     */
-    after: (node: NodeData | NodeId, semantics?: PlaceAnchorSemanticsChoice) => PlaceAnchor;
-    /**
-     * @returns The location at the start of `trait`.
-     */
-    atStartOf: (trait: TraitLocation, semantics?: PlaceAnchorSemanticsChoice) => PlaceAnchor;
-    /**
-     * @returns The location at the end of `trait`.
-     */
-    atEndOf: (trait: TraitLocation, semantics?: PlaceAnchorSemanticsChoice) => PlaceAnchor;
-};
-/**
- * @public
- */
-export declare 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: (start: PlaceAnchor) => {
-        to: (end: PlaceAnchor) => RangeAnchor;
-    };
-    /**
-     * @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: NodeData | NodeAnchor, semantics?: PlaceAnchorSemanticsChoice) => RangeAnchor;
-    /**
-     * @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: (trait: TraitLocation) => RangeAnchor;
-};
-//# sourceMappingURL=PersistedTypes.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"PersistedTypes.d.ts","sourceRoot":"","sources":["../../src/anchored-edits/PersistedTypes.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAOH,OAAO,EAAE,kBAAkB,EAAE,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAEpF,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,aAAa,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACrG,OAAO,EACN,KAAK,EAEL,gBAAgB,EAChB,MAAM,EACN,MAAM,EAEN,QAAQ,EACR,WAAW,EACX,WAAW,EACX,UAAU,EAEV,MAAM,kBAAkB,CAAC;AAE1B;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AAEH;;;GAGG;AACH,oBAAY,gBAAgB,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;AAExD;;;;;;;GAOG;AACH,oBAAY,cAAc,GAAG,cAAc,GAAG,cAAc,GAAG,KAAK,GAAG,gBAAgB,GAAG,kBAAkB,CAAC;AAE7G;;;;GAIG;AACH,MAAM,WAAW,cAAe,SAAQ,MAAM;IAC7C,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;CAClC;AAED;;;;;;GAMG;AACH,MAAM,WAAW,cAAe,SAAQ,MAAM;IAC7C,QAAQ,CAAC,MAAM,EAAE,WAAW,CAAC;CAC7B;AAED;;;GAGG;AACH,MAAM,WAAW,gBAAiB,SAAQ,QAAQ;IACjD,QAAQ,CAAC,YAAY,EAAE,UAAU,CAAC;CAClC;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,kBAAmB,SAAQ,UAAU;IACrD;;;;;;OAMG;IACH,QAAQ,CAAC,WAAW,EAAE,WAAW,CAAC;CAClC;AAGD;;GAEG;AACH,eAAO,MAAM,cAAc;;qBAEQ,kBAAkB,eAAe,WAAW,KAAK,cAAc;qBAC/D,WAAW,mDAAuC,cAAc;+BAClD,UAAU,WAAW,OAAO,KAAK,gBAAgB;iCAC7C,UAAU,KAAK,gBAAgB;8BAErE,WAAW,UAChB,gBAAgB,gLAMpB,kBAAkB;CACvB,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,cAAc;IAC1B;;OAEG;0BACmB,WAAW,KAAG,cAAc;CAClD,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,cAAc;IAC1B;;OAEG;oBAC8B,iBAAiB,SAAS,CAAC,eAAe,WAAW,KAAK,cAAc,EAAE;CAC3G,CAAC;AAEF;;;GAGG;AACH,eAAO,MAAM,YAAY;IACxB;;OAEG;qBAC6B,WAAW,eAAe,WAAW,KAAK,cAAc,EAAE;CAC1F,CAAC;AAEF;;GAEG;AACH,oBAAY,0BAA0B;IACrC;;;OAGG;IACH,WAAW,IAAI;IACf;;;;;;;;OAQG;IACH,cAAc,IAAI;CAGlB;AAED;;;;;;;;GAQG;AACH,MAAM,WAAW,WAAY,SAAQ,WAAW;IAC/C;;;OAGG;IACH,QAAQ,CAAC,SAAS,CAAC,EAAE,0BAA0B,CAAC;CAChD;AAED,oBAAY,mBAAmB,GAAG,WAAW,GAAG;IAAE,QAAQ,EAAE,0BAA0B,CAAC,cAAc,CAAA;CAAE,CAAC;AAExG;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,WAAW,WAAY,SAAQ,WAAW;IAC/C,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,GAAG,EAAE,WAAW,CAAC;CAC1B;AAED,oBAAY,UAAU,GAAG,MAAM,CAAC;AAEhC;;;;;;GAMG;AAGH;;GAEG;AACH,eAAO,MAAM,WAAW;IACvB;;OAEG;mBAEI,QAAQ,GAAG,MAAM,cACZ,0BAA0B,KACnC,WAAW;IAKd;;OAEG;kBAEI,QAAQ,GAAG,MAAM,cACZ,0BAA0B,KACnC,WAAW;IACd;;OAEG;uBAEK,aAAa,cACT,0BAA0B,KACnC,WAAW;IACd;;OAEG;qBAEK,aAAa,cACT,0BAA0B,KACnC,WAAW;CACd,CAAC;AAGF;;GAEG;AACH,eAAO,MAAM,WAAW;IACvB;;;;OAIG;kBAC+B,WAAW;kBAAiB,WAAW,KAAK,WAAW;;IACzF;;;OAGG;iBAEI,QAAQ,GAAG,UAAU,cAChB,0BAA0B,KACnC,WAAW;IACd;;;;OAIG;iBAC6B,aAAa,KAAK,WAAW;CAC7D,CAAC"}