@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/dist/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,wCAAwH;AAExH,oDAA+D;AAC/D,qDAQ0B;AAC1B,uCAAgG;AAChG,qEAAkE;AAElE;;;;;;;;;GASG;AACH,MAAa,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,+BAAc,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,6BAAY,CAAC,MAAM,CAAC,4BAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;SAC1F;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,6BAAY,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,+BAAc,CAAC,MAAM,CAAC,4BAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SAC5E;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,+BAAc,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,sBAAM,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;AA1FD,kEA0FC;AAED;;;;;;;;;;;GAWG;AACH,MAAa,qBAAsB,SAAQ,2BAAiC;IAiB3E;;;;;;OAMG;IACH,YACC,OAA+B,EAC/B,EAAU,EACV,mBAAmB,GAAG,KAAK,EAC3B,gBAAgB,GAAG,IAAI;QAEvB,KAAK,CACJ,OAAO,EACP,EAAE,EACF,+CAAsB,CAAC,OAAO,EAC9B,sCAA4B,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,sCAA4B,CAAC,IAAI,CAA0B,CAAC;IAC9F,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,UAAU,CAAC,gBAAgB,GAAG,IAAI;QAC/C,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,sCAA4B,EAAE,CAAC,CAAC,CAAC,IAAI,+CAAqC,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,mCAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;SACtD;QACD,OAAO,+BAAqB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACzD,CAAC;CACD;AA9DD,sDA8DC","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/dist/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/dist/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/dist/anchored-edits/TransactionWithAnchors.js

@@ -1,36 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TransactionWithAnchors = void 0;
-const default_edits_1 = require("../default-edits");
-const AnchorResolution_1 = require("./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`.
- */
-class TransactionWithAnchors extends default_edits_1.Transaction {
-    constructor() {
-        super(...arguments);
-        this.detached = new Map();
-    }
-    static factory(snapshot) {
-        return new TransactionWithAnchors(snapshot);
-    }
-    tryResolveChange(change, path) {
-        return AnchorResolution_1.resolveChangeAnchors(change, this.view, path);
-    }
-}
-exports.TransactionWithAnchors = TransactionWithAnchors;
-//# sourceMappingURL=TransactionWithAnchors.js.map

package/dist/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,oDAA+C;AAE/C,yDAA0D;AAE1D;;;;;;;;;;;;GAYG;AACH,MAAa,sBAAuB,SAAQ,2BAAW;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,uCAAoB,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACtD,CAAC;CACD;AAbD,wDAaC","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/dist/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/dist/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/dist/anchored-edits/index.js

@@ -1,34 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __exportStar = (this && this.__exportStar) || function(m, exports) {
-    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.updateRelativePlaceAnchorForPath = exports.updateRelativePlaceAnchorForChange = exports.resolveRangeAnchor = exports.resolvePlaceAnchor = exports.resolveNodeAnchor = exports.findLastOffendingChange = exports.resolveChangeAnchors = exports.TransactionWithAnchors = exports.SharedTreeWithAnchorsEditor = exports.SharedTreeWithAnchors = void 0;
-// API Exports
-var SharedTreeWithAnchors_1 = require("./SharedTreeWithAnchors");
-Object.defineProperty(exports, "SharedTreeWithAnchors", { enumerable: true, get: function () { return SharedTreeWithAnchors_1.SharedTreeWithAnchors; } });
-Object.defineProperty(exports, "SharedTreeWithAnchorsEditor", { enumerable: true, get: function () { return SharedTreeWithAnchors_1.SharedTreeWithAnchorsEditor; } });
-__exportStar(require("./PersistedTypes"), exports);
-__exportStar(require("./Factory"), exports);
-var TransactionWithAnchors_1 = require("./TransactionWithAnchors");
-Object.defineProperty(exports, "TransactionWithAnchors", { enumerable: true, get: function () { return TransactionWithAnchors_1.TransactionWithAnchors; } });
-var AnchorResolution_1 = require("./AnchorResolution");
-Object.defineProperty(exports, "resolveChangeAnchors", { enumerable: true, get: function () { return AnchorResolution_1.resolveChangeAnchors; } });
-Object.defineProperty(exports, "findLastOffendingChange", { enumerable: true, get: function () { return AnchorResolution_1.findLastOffendingChange; } });
-Object.defineProperty(exports, "resolveNodeAnchor", { enumerable: true, get: function () { return AnchorResolution_1.resolveNodeAnchor; } });
-Object.defineProperty(exports, "resolvePlaceAnchor", { enumerable: true, get: function () { return AnchorResolution_1.resolvePlaceAnchor; } });
-Object.defineProperty(exports, "resolveRangeAnchor", { enumerable: true, get: function () { return AnchorResolution_1.resolveRangeAnchor; } });
-Object.defineProperty(exports, "updateRelativePlaceAnchorForChange", { enumerable: true, get: function () { return AnchorResolution_1.updateRelativePlaceAnchorForChange; } });
-Object.defineProperty(exports, "updateRelativePlaceAnchorForPath", { enumerable: true, get: function () { return AnchorResolution_1.updateRelativePlaceAnchorForPath; } });
-//# sourceMappingURL=index.js.map

package/dist/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,iEAA6F;AAApF,8HAAA,qBAAqB,OAAA;AAAE,oIAAA,2BAA2B,OAAA;AAC3D,mDAAiC;AACjC,4CAA0B;AAC1B,mEAAkE;AAAzD,gIAAA,sBAAsB,OAAA;AAC/B,uDAS4B;AAR3B,wHAAA,oBAAoB,OAAA;AACpB,2HAAA,uBAAuB,OAAA;AACvB,qHAAA,iBAAiB,OAAA;AACjB,sHAAA,kBAAkB,OAAA;AAClB,sHAAA,kBAAkB,OAAA;AAClB,sIAAA,kCAAkC,OAAA;AAClC,oIAAA,gCAAgC,OAAA","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/dist/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/dist/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"}

package/dist/default-edits/EditUtilities.js

@@ -1,192 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.isDetachedSequenceId = exports.detachRange = exports.insertIntoTrait = exports.placeFromStablePlace = exports.rangeFromStableRange = exports.validateStableRange = exports.validateStablePlace = exports.setTrait = void 0;
-const Common_1 = require("../Common");
-const Checkout_1 = require("../Checkout");
-const PersistedTypes_1 = require("./PersistedTypes");
-/**
- * Functions for constructing edits.
- */
-/**
- * Create a sequence of changes that resets the contents of `trait`.
- * @public
- */
-function setTrait(trait, nodes) {
-    const id = 0;
-    const traitContents = PersistedTypes_1.StableRange.all(trait);
-    return [PersistedTypes_1.Change.detach(traitContents), PersistedTypes_1.Change.build(nodes, id), PersistedTypes_1.Change.insert(id, traitContents.start)];
-}
-exports.setTrait = setTrait;
-/**
- * Check the validity of the given `StablePlace`
- * @param snapshot - the `Snapshot` within which to validate the given place
- * @param place - the `StablePlace` to check
- */
-function validateStablePlace(snapshot, place) {
-    /* A StablePlace is valid if the following conditions are met:
-     *     1. A sibling or trait is defined.
-     *     2. If a sibling is defined, both it and its parent exist in the `Snapshot`.
-     *     3. If a trait is defined, its parent node exists in the `Snapshot`.
-     *     4. If a sibling and a trait location are both specified, the sibling needs to actually be in that trait.
-     */
-    const { referenceSibling, referenceTrait } = place;
-    // A well-formed `StablePlace` specifies exactly one of `referenceSibling` and `referenceTrait`.
-    if ((referenceSibling === undefined && referenceTrait === undefined) ||
-        (referenceSibling !== undefined && referenceTrait !== undefined)) {
-        return Checkout_1.EditValidationResult.Malformed;
-    }
-    if (referenceSibling !== undefined) {
-        if (!snapshot.hasNode(referenceSibling)) {
-            return Checkout_1.EditValidationResult.Invalid;
-        }
-        // Detached nodes and the root are invalid anchors.
-        if (snapshot.getTraitLabel(referenceSibling) === undefined) {
-            return Checkout_1.EditValidationResult.Invalid;
-        }
-        return Checkout_1.EditValidationResult.Valid;
-    }
-    if (!snapshot.hasNode(Common_1.assertNotUndefined(referenceTrait).parent)) {
-        return Checkout_1.EditValidationResult.Invalid;
-    }
-    return Checkout_1.EditValidationResult.Valid;
-}
-exports.validateStablePlace = validateStablePlace;
-/**
- * Check the validity of the given `StableRange`
- * @param snapshot - the `Snapshot` within which to validate the given range
- * @param range - the `StableRange` to check
- */
-function validateStableRange(snapshot, range) {
-    /* A StableRange is valid if the following conditions are met:
-     *     1. Its start and end places are valid.
-     *     2. Its start and end places are within the same trait.
-     *     3. Its start place is before its end place.
-     */
-    const { start, end } = range;
-    const startValidationResult = validateStablePlace(snapshot, start);
-    if (startValidationResult !== Checkout_1.EditValidationResult.Valid) {
-        return startValidationResult;
-    }
-    const endValidationResult = validateStablePlace(snapshot, end);
-    if (endValidationResult !== Checkout_1.EditValidationResult.Valid) {
-        return endValidationResult;
-    }
-    const startTraitLocation = start.referenceTrait || snapshot.getTraitLocation(Common_1.assertNotUndefined(start.referenceSibling));
-    const endTraitLocation = end.referenceTrait || snapshot.getTraitLocation(Common_1.assertNotUndefined(end.referenceSibling));
-    if (!compareTraits(startTraitLocation, endTraitLocation)) {
-        return Checkout_1.EditValidationResult.Invalid;
-    }
-    const { start: startPlace, end: endPlace } = rangeFromStableRange(snapshot, range);
-    const startIndex = snapshot.findIndexWithinTrait(startPlace);
-    const endIndex = snapshot.findIndexWithinTrait(endPlace);
-    if (startIndex > endIndex) {
-        return Checkout_1.EditValidationResult.Invalid;
-    }
-    return Checkout_1.EditValidationResult.Valid;
-}
-exports.validateStableRange = validateStableRange;
-/**
- * @param snapshot - the `Snapshot` within which to retrieve the trait location
- * @param range - must be well formed and valid
- */
-function getTraitLocationOfRange(snapshot, range) {
-    var _a, _b, _c;
-    const referenceTrait = (_a = range.start.referenceTrait) !== null && _a !== void 0 ? _a : range.end.referenceTrait;
-    if (referenceTrait) {
-        return referenceTrait;
-    }
-    const sibling = (_c = (_b = range.start.referenceSibling) !== null && _b !== void 0 ? _b : range.end.referenceSibling) !== null && _c !== void 0 ? _c : Common_1.fail('malformed range does not indicate trait');
-    return snapshot.getTraitLocation(sibling);
-}
-/**
- * Describes the side of a range.
- */
-var SideOfRange;
-(function (SideOfRange) {
-    /**
-     * The start of the range
-     */
-    SideOfRange[SideOfRange["Start"] = 0] = "Start";
-    /**
-     * The end of the range
-     */
-    SideOfRange[SideOfRange["End"] = 1] = "End";
-})(SideOfRange || (SideOfRange = {}));
-function sideOfRange(range, sideOfRange, trait) {
-    const siblingRelative = sideOfRange === SideOfRange.Start ? range.start : range.end;
-    return {
-        trait,
-        side: siblingRelative.side,
-        sibling: siblingRelative.referenceSibling,
-    };
-}
-/**
- * Express the given `StableRange` as a `Range`
- */
-function rangeFromStableRange(snapshot, range) {
-    const location = getTraitLocationOfRange(snapshot, range);
-    // This can be optimized for better constant factors.
-    return {
-        start: sideOfRange(range, SideOfRange.Start, location),
-        end: sideOfRange(range, SideOfRange.End, location),
-    };
-}
-exports.rangeFromStableRange = rangeFromStableRange;
-/**
- * Express the given `StablePlace` as a `Place`
- */
-function placeFromStablePlace(snapshot, stablePlace) {
-    const { side } = stablePlace;
-    if (stablePlace.referenceSibling === undefined) {
-        Common_1.assert(stablePlace.referenceTrait !== undefined);
-        return {
-            trait: stablePlace.referenceTrait,
-            side,
-        };
-    }
-    return {
-        trait: snapshot.getTraitLocation(stablePlace.referenceSibling),
-        side: stablePlace.side,
-        sibling: stablePlace.referenceSibling,
-    };
-}
-exports.placeFromStablePlace = placeFromStablePlace;
-/**
- * Check if two TraitLocations are equal.
- */
-function compareTraits(traitA, traitB) {
-    if (traitA.label !== traitB.label || traitA.parent !== traitB.parent) {
-        return false;
-    }
-    return true;
-}
-/**
- * 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.
- */
-function insertIntoTrait(snapshot, nodesToInsert, placeToInsert) {
-    return snapshot.attachRange(nodesToInsert, placeFromStablePlace(snapshot, placeToInsert));
-}
-exports.insertIntoTrait = insertIntoTrait;
-/**
- * Detaches a range of nodes from their parent. The detached nodes remain in the Snapshot.
- * @param rangeToDetach - the range of nodes to detach
- */
-function detachRange(snapshot, rangeToDetach) {
-    return snapshot.detachRange(rangeFromStableRange(snapshot, rangeToDetach));
-}
-exports.detachRange = detachRange;
-/**
- * Determine if an BuildNode is a DetachedSequenceId.
- * @internal
- */
-function isDetachedSequenceId(node) {
-    return typeof node !== 'object';
-}
-exports.isDetachedSequenceId = isDetachedSequenceId;
-//# sourceMappingURL=EditUtilities.js.map

package/dist/default-edits/EditUtilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"EditUtilities.js","sourceRoot":"","sources":["../../src/default-edits/EditUtilities.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AAIH,sCAA6D;AAC7D,0CAAmD;AAEnD,qDAAoE;AAEpE;;GAEG;AAEH;;;GAGG;AACH,SAAgB,QAAQ,CAAC,KAAoB,EAAE,KAAkC;IAChF,MAAM,EAAE,GAAG,CAAuB,CAAC;IACnC,MAAM,aAAa,GAAG,4BAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAE7C,OAAO,CAAC,uBAAM,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,uBAAM,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,uBAAM,CAAC,MAAM,CAAC,EAAE,EAAE,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;AACxG,CAAC;AALD,4BAKC;AAED;;;;GAIG;AACH,SAAgB,mBAAmB,CAAC,QAAkB,EAAE,KAAkB;IACzE;;;;;OAKG;IACH,MAAM,EAAE,gBAAgB,EAAE,cAAc,EAAE,GAAG,KAAK,CAAC;IAEnD,gGAAgG;IAChG,IACC,CAAC,gBAAgB,KAAK,SAAS,IAAI,cAAc,KAAK,SAAS,CAAC;QAChE,CAAC,gBAAgB,KAAK,SAAS,IAAI,cAAc,KAAK,SAAS,CAAC,EAC/D;QACD,OAAO,+BAAoB,CAAC,SAAS,CAAC;KACtC;IAED,IAAI,gBAAgB,KAAK,SAAS,EAAE;QACnC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE;YACxC,OAAO,+BAAoB,CAAC,OAAO,CAAC;SACpC;QAED,mDAAmD;QACnD,IAAI,QAAQ,CAAC,aAAa,CAAC,gBAAgB,CAAC,KAAK,SAAS,EAAE;YAC3D,OAAO,+BAAoB,CAAC,OAAO,CAAC;SACpC;QAED,OAAO,+BAAoB,CAAC,KAAK,CAAC;KAClC;IAED,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,2BAAkB,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC,EAAE;QACjE,OAAO,+BAAoB,CAAC,OAAO,CAAC;KACpC;IAED,OAAO,+BAAoB,CAAC,KAAK,CAAC;AACnC,CAAC;AAnCD,kDAmCC;AAED;;;;GAIG;AACH,SAAgB,mBAAmB,CAAC,QAAkB,EAAE,KAAkB;IACzE;;;;OAIG;IACH,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,KAAK,CAAC;IAE7B,MAAM,qBAAqB,GAAG,mBAAmB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnE,IAAI,qBAAqB,KAAK,+BAAoB,CAAC,KAAK,EAAE;QACzD,OAAO,qBAAqB,CAAC;KAC7B;IAED,MAAM,mBAAmB,GAAG,mBAAmB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;IAC/D,IAAI,mBAAmB,KAAK,+BAAoB,CAAC,KAAK,EAAE;QACvD,OAAO,mBAAmB,CAAC;KAC3B;IAED,MAAM,kBAAkB,GACvB,KAAK,CAAC,cAAc,IAAI,QAAQ,CAAC,gBAAgB,CAAC,2BAAkB,CAAC,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC;IAC/F,MAAM,gBAAgB,GAAG,GAAG,CAAC,cAAc,IAAI,QAAQ,CAAC,gBAAgB,CAAC,2BAAkB,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACnH,IAAI,CAAC,aAAa,CAAC,kBAAkB,EAAE,gBAAgB,CAAC,EAAE;QACzD,OAAO,+BAAoB,CAAC,OAAO,CAAC;KACpC;IAED,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,EAAE,QAAQ,EAAE,GAAG,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACnF,MAAM,UAAU,GAAG,QAAQ,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAAG,QAAQ,CAAC,oBAAoB,CAAC,QAAQ,CAAC,CAAC;IAEzD,IAAI,UAAU,GAAG,QAAQ,EAAE;QAC1B,OAAO,+BAAoB,CAAC,OAAO,CAAC;KACpC;IAED,OAAO,+BAAoB,CAAC,KAAK,CAAC;AACnC,CAAC;AAlCD,kDAkCC;AAED;;;GAGG;AACH,SAAS,uBAAuB,CAAC,QAAkB,EAAE,KAAkB;;IACtE,MAAM,cAAc,SAAG,KAAK,CAAC,KAAK,CAAC,cAAc,mCAAI,KAAK,CAAC,GAAG,CAAC,cAAc,CAAC;IAC9E,IAAI,cAAc,EAAE;QACnB,OAAO,cAAc,CAAC;KACtB;IACD,MAAM,OAAO,eACZ,KAAK,CAAC,KAAK,CAAC,gBAAgB,mCAAI,KAAK,CAAC,GAAG,CAAC,gBAAgB,mCAAI,aAAI,CAAC,yCAAyC,CAAC,CAAC;IAC/G,OAAO,QAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,IAAK,WASJ;AATD,WAAK,WAAW;IACf;;OAEG;IACH,+CAAS,CAAA;IACT;;OAEG;IACH,2CAAO,CAAA;AACR,CAAC,EATI,WAAW,KAAX,WAAW,QASf;AAED,SAAS,WAAW,CAAC,KAAkB,EAAE,WAAwB,EAAE,KAAoB;IACtF,MAAM,eAAe,GAAG,WAAW,KAAK,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IACpF,OAAO;QACN,KAAK;QACL,IAAI,EAAE,eAAe,CAAC,IAAI;QAC1B,OAAO,EAAE,eAAe,CAAC,gBAAgB;KACzC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAgB,oBAAoB,CAAC,QAAkB,EAAE,KAAkB;IAC1E,MAAM,QAAQ,GAAG,uBAAuB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC1D,qDAAqD;IACrD,OAAO;QACN,KAAK,EAAE,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,KAAK,EAAE,QAAQ,CAAC;QACtD,GAAG,EAAE,WAAW,CAAC,KAAK,EAAE,WAAW,CAAC,GAAG,EAAE,QAAQ,CAAC;KAClD,CAAC;AACH,CAAC;AAPD,oDAOC;AAED;;GAEG;AACH,SAAgB,oBAAoB,CAAC,QAAkB,EAAE,WAAwB;IAChF,MAAM,EAAE,IAAI,EAAE,GAAG,WAAW,CAAC;IAC7B,IAAI,WAAW,CAAC,gBAAgB,KAAK,SAAS,EAAE;QAC/C,eAAM,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,CAAC,CAAC;QACjD,OAAO;YACN,KAAK,EAAE,WAAW,CAAC,cAAc;YACjC,IAAI;SACJ,CAAC;KACF;IACD,OAAO;QACN,KAAK,EAAE,QAAQ,CAAC,gBAAgB,CAAC,WAAW,CAAC,gBAAgB,CAAC;QAC9D,IAAI,EAAE,WAAW,CAAC,IAAI;QACtB,OAAO,EAAE,WAAW,CAAC,gBAAgB;KACrC,CAAC;AACH,CAAC;AAdD,oDAcC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,MAAqB,EAAE,MAAqB;IAClE,IAAI,MAAM,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE;QACrE,OAAO,KAAK,CAAC;KACb;IAED,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAgB,eAAe,CAC9B,QAAkB,EAClB,aAAgC,EAChC,aAA0B;IAE1B,OAAO,QAAQ,CAAC,WAAW,CAAC,aAAa,EAAE,oBAAoB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC;AAC3F,CAAC;AAND,0CAMC;AAED;;;GAGG;AACH,SAAgB,WAAW,CAC1B,QAAkB,EAClB,aAA0B;IAE1B,OAAO,QAAQ,CAAC,WAAW,CAAC,oBAAoB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC,CAAC;AAC5E,CAAC;AALD,kCAKC;AAED;;;GAGG;AACH,SAAgB,oBAAoB,CAAC,IAAe;IACnD,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC;AACjC,CAAC;AAFD,oDAEC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { DetachedSequenceId, NodeId } from '../Identifiers';\nimport { Snapshot, SnapshotPlace, SnapshotRange } from '../Snapshot';\nimport { assert, assertNotUndefined, fail } from '../Common';\nimport { EditValidationResult } from '../Checkout';\nimport { BuildNode, TraitLocation, TreeNodeSequence } from '../generic';\nimport { Change, StablePlace, StableRange } from './PersistedTypes';\n\n/**\n * Functions for constructing edits.\n */\n\n/**\n * Create a sequence of changes that resets the contents of `trait`.\n * @public\n */\nexport function setTrait(trait: TraitLocation, nodes: TreeNodeSequence<BuildNode>): readonly Change[] {\n\tconst id = 0 as DetachedSequenceId;\n\tconst traitContents = StableRange.all(trait);\n\n\treturn [Change.detach(traitContents), Change.build(nodes, id), Change.insert(id, traitContents.start)];\n}\n\n/**\n * Check the validity of the given `StablePlace`\n * @param snapshot - the `Snapshot` within which to validate the given place\n * @param place - the `StablePlace` to check\n */\nexport function validateStablePlace(snapshot: Snapshot, place: StablePlace): EditValidationResult {\n\t/* A StablePlace is valid if the following conditions are met:\n\t *     1. A sibling or trait is defined.\n\t *     2. If a sibling is defined, both it and its parent exist in the `Snapshot`.\n\t *     3. If a trait is defined, its parent node exists in the `Snapshot`.\n\t *     4. If a sibling and a trait location are both specified, the sibling needs to actually be in that trait.\n\t */\n\tconst { referenceSibling, referenceTrait } = place;\n\n\t// A well-formed `StablePlace` specifies exactly one of `referenceSibling` and `referenceTrait`.\n\tif (\n\t\t(referenceSibling === undefined && referenceTrait === undefined) ||\n\t\t(referenceSibling !== undefined && referenceTrait !== undefined)\n\t) {\n\t\treturn EditValidationResult.Malformed;\n\t}\n\n\tif (referenceSibling !== undefined) {\n\t\tif (!snapshot.hasNode(referenceSibling)) {\n\t\t\treturn EditValidationResult.Invalid;\n\t\t}\n\n\t\t// Detached nodes and the root are invalid anchors.\n\t\tif (snapshot.getTraitLabel(referenceSibling) === undefined) {\n\t\t\treturn EditValidationResult.Invalid;\n\t\t}\n\n\t\treturn EditValidationResult.Valid;\n\t}\n\n\tif (!snapshot.hasNode(assertNotUndefined(referenceTrait).parent)) {\n\t\treturn EditValidationResult.Invalid;\n\t}\n\n\treturn EditValidationResult.Valid;\n}\n\n/**\n * Check the validity of the given `StableRange`\n * @param snapshot - the `Snapshot` within which to validate the given range\n * @param range - the `StableRange` to check\n */\nexport function validateStableRange(snapshot: Snapshot, range: StableRange): EditValidationResult {\n\t/* A StableRange is valid if the following conditions are met:\n\t *     1. Its start and end places are valid.\n\t *     2. Its start and end places are within the same trait.\n\t *     3. Its start place is before its end place.\n\t */\n\tconst { start, end } = range;\n\n\tconst startValidationResult = validateStablePlace(snapshot, start);\n\tif (startValidationResult !== EditValidationResult.Valid) {\n\t\treturn startValidationResult;\n\t}\n\n\tconst endValidationResult = validateStablePlace(snapshot, end);\n\tif (endValidationResult !== EditValidationResult.Valid) {\n\t\treturn endValidationResult;\n\t}\n\n\tconst startTraitLocation =\n\t\tstart.referenceTrait || snapshot.getTraitLocation(assertNotUndefined(start.referenceSibling));\n\tconst endTraitLocation = end.referenceTrait || snapshot.getTraitLocation(assertNotUndefined(end.referenceSibling));\n\tif (!compareTraits(startTraitLocation, endTraitLocation)) {\n\t\treturn EditValidationResult.Invalid;\n\t}\n\n\tconst { start: startPlace, end: endPlace } = rangeFromStableRange(snapshot, range);\n\tconst startIndex = snapshot.findIndexWithinTrait(startPlace);\n\tconst endIndex = snapshot.findIndexWithinTrait(endPlace);\n\n\tif (startIndex > endIndex) {\n\t\treturn EditValidationResult.Invalid;\n\t}\n\n\treturn EditValidationResult.Valid;\n}\n\n/**\n * @param snapshot - the `Snapshot` within which to retrieve the trait location\n * @param range - must be well formed and valid\n */\nfunction getTraitLocationOfRange(snapshot: Snapshot, range: StableRange): TraitLocation {\n\tconst referenceTrait = range.start.referenceTrait ?? range.end.referenceTrait;\n\tif (referenceTrait) {\n\t\treturn referenceTrait;\n\t}\n\tconst sibling =\n\t\trange.start.referenceSibling ?? range.end.referenceSibling ?? fail('malformed range does not indicate trait');\n\treturn snapshot.getTraitLocation(sibling);\n}\n\n/**\n * Describes the side of a range.\n */\nenum SideOfRange {\n\t/**\n\t * The start of the range\n\t */\n\tStart = 0,\n\t/**\n\t * The end of the range\n\t */\n\tEnd = 1,\n}\n\nfunction sideOfRange(range: StableRange, sideOfRange: SideOfRange, trait: TraitLocation): SnapshotPlace {\n\tconst siblingRelative = sideOfRange === SideOfRange.Start ? range.start : range.end;\n\treturn {\n\t\ttrait,\n\t\tside: siblingRelative.side,\n\t\tsibling: siblingRelative.referenceSibling,\n\t};\n}\n\n/**\n * Express the given `StableRange` as a `Range`\n */\nexport function rangeFromStableRange(snapshot: Snapshot, range: StableRange): SnapshotRange {\n\tconst location = getTraitLocationOfRange(snapshot, range);\n\t// This can be optimized for better constant factors.\n\treturn {\n\t\tstart: sideOfRange(range, SideOfRange.Start, location),\n\t\tend: sideOfRange(range, SideOfRange.End, location),\n\t};\n}\n\n/**\n * Express the given `StablePlace` as a `Place`\n */\nexport function placeFromStablePlace(snapshot: Snapshot, stablePlace: StablePlace): SnapshotPlace {\n\tconst { side } = stablePlace;\n\tif (stablePlace.referenceSibling === undefined) {\n\t\tassert(stablePlace.referenceTrait !== undefined);\n\t\treturn {\n\t\t\ttrait: stablePlace.referenceTrait,\n\t\t\tside,\n\t\t};\n\t}\n\treturn {\n\t\ttrait: snapshot.getTraitLocation(stablePlace.referenceSibling),\n\t\tside: stablePlace.side,\n\t\tsibling: stablePlace.referenceSibling,\n\t};\n}\n\n/**\n * Check if two TraitLocations are equal.\n */\nfunction compareTraits(traitA: TraitLocation, traitB: TraitLocation): boolean {\n\tif (traitA.label !== traitB.label || traitA.parent !== traitB.parent) {\n\t\treturn false;\n\t}\n\n\treturn true;\n}\n\n/**\n * Parents a set of nodes in a specified location within a trait.\n * @param nodesToInsert - the nodes to parent in the specified place. The nodes must already be present in the Snapshot.\n * @param placeToInsert - the location to insert the nodes.\n */\nexport function insertIntoTrait(\n\tsnapshot: Snapshot,\n\tnodesToInsert: readonly NodeId[],\n\tplaceToInsert: StablePlace\n): Snapshot {\n\treturn snapshot.attachRange(nodesToInsert, placeFromStablePlace(snapshot, placeToInsert));\n}\n\n/**\n * Detaches a range of nodes from their parent. The detached nodes remain in the Snapshot.\n * @param rangeToDetach - the range of nodes to detach\n */\nexport function detachRange(\n\tsnapshot: Snapshot,\n\trangeToDetach: StableRange\n): { snapshot: Snapshot; detached: readonly NodeId[] } {\n\treturn snapshot.detachRange(rangeFromStableRange(snapshot, rangeToDetach));\n}\n\n/**\n * Determine if an BuildNode is a DetachedSequenceId.\n * @internal\n */\nexport function isDetachedSequenceId(node: BuildNode): node is DetachedSequenceId {\n\treturn typeof node !== 'object';\n}\n"]}

package/dist/default-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 { SharedTree } from './SharedTree';
-/**
- * Factory for SharedTree.
- * Includes history in the summary.
- * @public
- */
-export declare class SharedTreeFactory 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): SharedTree;
-    /**
-     * 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 SharedTree.
- * 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 SharedTreeFactoryNoHistory extends SharedTreeFactory {
-    protected includeHistoryInSummary(): boolean;
-}
-//# sourceMappingURL=Factory.d.ts.map

package/dist/default-edits/Factory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Factory.d.ts","sourceRoot":"","sources":["../../src/default-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,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;GAIG;AACH,qBAAa,iBAAkB,YAAW,eAAe;IACxD;;OAEG;IACH,OAAc,IAAI,SAAgB;IAElC;;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,UAAU;IAMrG;;;OAGG;IACH,SAAS,CAAC,uBAAuB,IAAI,OAAO;CAG5C;AAED;;;;;;GAMG;AACH,qBAAa,0BAA2B,SAAQ,iBAAiB;IAChE,SAAS,CAAC,uBAAuB,IAAI,OAAO;CAG5C"}

package/dist/default-edits/Factory.js

@@ -1,79 +0,0 @@
-"use strict";
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SharedTreeFactoryNoHistory = exports.SharedTreeFactory = void 0;
-const SharedTree_1 = require("./SharedTree");
-/**
- * Factory for SharedTree.
- * Includes history in the summary.
- * @public
- */
-class SharedTreeFactory {
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory."type"}
-     */
-    get type() {
-        return SharedTreeFactory.Type;
-    }
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}
-     */
-    get attributes() {
-        return SharedTreeFactory.Attributes;
-    }
-    /**
-     * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.load}
-     */
-    async load(runtime, id, services, _channelAttributes) {
-        const sharedTree = new SharedTree_1.SharedTree(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 SharedTree_1.SharedTree(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;
-    }
-}
-exports.SharedTreeFactory = SharedTreeFactory;
-/**
- * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory."type"}
- */
-SharedTreeFactory.Type = 'SharedTree';
-/**
- * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}
- */
-SharedTreeFactory.Attributes = {
-    type: SharedTreeFactory.Type,
-    snapshotFormatVersion: '0.1',
-    packageVersion: '0.1',
-};
-/**
- * Factory for SharedTree.
- * 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
- */
-class SharedTreeFactoryNoHistory extends SharedTreeFactory {
-    includeHistoryInSummary() {
-        return false;
-    }
-}
-exports.SharedTreeFactoryNoHistory = SharedTreeFactoryNoHistory;
-//# sourceMappingURL=Factory.js.map

package/dist/default-edits/Factory.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Factory.js","sourceRoot":"","sources":["../../src/default-edits/Factory.ts"],"names":[],"mappings":";AAAA;;;GAGG;;;AASH,6CAA0C;AAE1C;;;;GAIG;AACH,MAAa,iBAAiB;IAe7B;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,iBAAiB,CAAC,IAAI,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,IAAW,UAAU;QACpB,OAAO,iBAAiB,CAAC,UAAU,CAAC;IACrC,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,IAAI,CAChB,OAA+B,EAC/B,EAAU,EACV,QAA0B,EAC1B,kBAAgD;QAEhD,MAAM,UAAU,GAAG,IAAI,uBAAU,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;QAC/C,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,uBAAU,CAAC,OAAO,EAAE,EAAE,EAAE,mBAAmB,EAAE,IAAI,CAAC,uBAAuB,EAAE,CAAC,CAAC;QACpG,UAAU,CAAC,eAAe,EAAE,CAAC;QAC7B,OAAO,UAAU,CAAC;IACnB,CAAC;IAED;;;OAGG;IACO,uBAAuB;QAChC,OAAO,IAAI,CAAC;IACb,CAAC;;AA5DF,8CA6DC;AA5DA;;GAEG;AACW,sBAAI,GAAG,YAAY,CAAC;AAElC;;GAEG;AACW,4BAAU,GAAuB;IAC9C,IAAI,EAAE,iBAAiB,CAAC,IAAI;IAC5B,qBAAqB,EAAE,KAAK;IAC5B,cAAc,EAAE,KAAK;CACrB,CAAC;AAkDH;;;;;;GAMG;AACH,MAAa,0BAA2B,SAAQ,iBAAiB;IACtD,uBAAuB;QAChC,OAAO,KAAK,CAAC;IACd,CAAC;CACD;AAJD,gEAIC","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 { SharedTree } from './SharedTree';\n\n/**\n * Factory for SharedTree.\n * Includes history in the summary.\n * @public\n */\nexport class SharedTreeFactory implements IChannelFactory {\n\t/**\n\t * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.\"type\"}\n\t */\n\tpublic static Type = 'SharedTree';\n\n\t/**\n\t * {@inheritDoc @fluidframework/shared-object-base#ISharedObjectFactory.attributes}\n\t */\n\tpublic static Attributes: IChannelAttributes = {\n\t\ttype: SharedTreeFactory.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 SharedTreeFactory.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 SharedTreeFactory.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 SharedTree(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): SharedTree {\n\t\tconst sharedTree = new SharedTree(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 SharedTree.\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 SharedTreeFactoryNoHistory extends SharedTreeFactory {\n\tprotected includeHistoryInSummary(): boolean {\n\t\treturn false;\n\t}\n}\n"]}

package/dist/default-edits/HistoryEditFactory.d.ts

@@ -1,19 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { Snapshot } from '../Snapshot';
-import { Change } from './PersistedTypes';
-/**
- * Given a sequence of changes, produces an inverse sequence of changes, i.e. the minimal changes required to revert the given changes
- * @param changes - the changes for which to produce an inverse.
- * @param before - a snapshot of the tree state before `changes` are/were applied - used as a basis for generating the inverse.
- * @returns a sequence of changes _r_ that will produce `before` if applied to a snapshot _A_, where _A_ is the result of
- * applying `changes` to `before`. Applying _r_ to snapshots other than _A_ is legal but may cause the changes to fail to apply or may
- * not be a true semantic inverse.
- *
- * TODO: what should this do if `changes` fails to apply to `before`?
- * @public
- */
-export declare function revert(changes: readonly Change[], before: Snapshot): Change[];
-//# sourceMappingURL=HistoryEditFactory.d.ts.map

package/dist/default-edits/HistoryEditFactory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"HistoryEditFactory.d.ts","sourceRoot":"","sources":["../../src/default-edits/HistoryEditFactory.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,QAAQ,EAAQ,MAAM,aAAa,CAAC;AAE7C,OAAO,EAAE,MAAM,EAAkE,MAAM,kBAAkB,CAAC;AAI1G;;;;;;;;;;GAUG;AACH,wBAAgB,MAAM,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,EAAE,MAAM,EAAE,QAAQ,GAAG,MAAM,EAAE,CA4E7E"}