@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/lib/default-edits/SharedTree.js

@@ -1,100 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { fullHistorySummarizer, GenericSharedTree } from '../generic';
-import { Delete, Insert, Move, StableRange } from './PersistedTypes';
-import { SharedTreeFactory, SharedTreeFactoryNoHistory } from './Factory';
-import * as HistoryEditFactory from './HistoryEditFactory';
-import { Transaction } from './Transaction';
-import { noHistorySummarizer } from './Summary';
-/**
- * Wrapper around a `SharedTree` which provides ergonomic imperative editing functionality. All methods apply changes in their own edit.
- *
- * @example
- * // The following two lines of code are equivalent:
- * tree.applyEdit(...Insert.create([newNode], StablePlace.before(existingNode)));
- * tree.editor.insert(newNode, StablePlace.before(existingNode))
- * @public
- */
-export class SharedTreeEditor {
-    constructor(tree) {
-        this.tree = tree;
-    }
-    insert(nodeOrNodes, destination) {
-        return this.tree.applyEdit(...Insert.create(Array.isArray(nodeOrNodes) ? nodeOrNodes : [nodeOrNodes], destination));
-    }
-    move(source, destination) {
-        if (!this.isStableRange(source)) {
-            return this.tree.applyEdit(...Move.create(StableRange.only(source), destination));
-        }
-        return this.tree.applyEdit(...Move.create(source, destination));
-    }
-    delete(target) {
-        if (!this.isStableRange(target)) {
-            return this.tree.applyEdit(Delete.create(StableRange.only(target)));
-        }
-        return this.tree.applyEdit(Delete.create(target));
-    }
-    /**
-     * Reverts a previous edit.
-     * @param edit - the edit to revert
-     * @param view - the revision to which the edit is applied (not the output of applying edit: it's the one just before that)
-     */
-    revert(edit, view) {
-        return this.tree.applyEdit(...HistoryEditFactory.revert(edit.changes, view));
-    }
-    isStableRange(source) {
-        return source.start !== undefined && source.end !== undefined;
-    }
-}
-/**
- * A distributed tree.
- * @public
- * @sealed
- */
-export class SharedTree extends GenericSharedTree {
-    /**
-     * Create a new SharedTreeFactory.
-     * @param runtime - The runtime the SharedTree will be associated with
-     * @param id - Unique ID for the SharedTree
-     * @param expensiveValidation - enable expensive asserts
-     * @param summarizeHistory - Determines if the history is included in summaries.
-     */
-    constructor(runtime, id, expensiveValidation = false, summarizeHistory = true) {
-        super(runtime, id, Transaction.factory, SharedTreeFactory.Attributes, expensiveValidation, summarizeHistory);
-    }
-    /**
-     * Create a new SharedTree. It will contain the default value (see initialTree).
-     */
-    static create(runtime, id) {
-        return runtime.createChannel(id, SharedTreeFactory.Type);
-    }
-    /**
-     * Get a factory for SharedTree to register with the data store.
-     * @param historySummarizing - determines how history is summarized by the returned `SharedTree`.
-     * @returns A factory that creates `SharedTree`s and loads them from storage.
-     */
-    static getFactory(summarizeHistory = true) {
-        return summarizeHistory ? new SharedTreeFactory() : new SharedTreeFactoryNoHistory();
-    }
-    /**
-     * Returns a `SharedTreeEditor` for editing this tree in an imperative fashion. All edits are performed on the current tree view.
-     */
-    get editor() {
-        if (!this._editor) {
-            this._editor = new SharedTreeEditor(this);
-        }
-        return this._editor;
-    }
-    /**
-     * {@inheritDoc GenericSharedTree.generateSummary}
-     */
-    generateSummary(editLog) {
-        if (!this.summarizeHistory) {
-            return noHistorySummarizer(editLog, this.currentView);
-        }
-        return fullHistorySummarizer(editLog, this.currentView);
-    }
-}
-//# sourceMappingURL=SharedTree.js.map

package/lib/default-edits/SharedTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SharedTree.js","sourceRoot":"","sources":["../../src/default-edits/SharedTree.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAAmB,qBAAqB,EAAE,iBAAiB,EAAmC,MAAM,YAAY,CAAC;AAExH,OAAO,EAAU,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,EAAe,MAAM,kBAAkB,CAAC;AAC1F,OAAO,EAAE,iBAAiB,EAAE,0BAA0B,EAAE,MAAM,WAAW,CAAC;AAC1E,OAAO,KAAK,kBAAkB,MAAM,sBAAsB,CAAC;AAC3D,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAEhD;;;;;;;;GAQG;AACH,MAAM,OAAO,gBAAgB;IAG5B,YAAmB,IAAgB;QAClC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAcM,MAAM,CAAC,WAAoC,EAAE,WAAwB;QAC3E,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CACzB,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,EAAE,WAAW,CAAC,CACvF,CAAC;IACH,CAAC;IAoBM,IAAI,CAAC,MAAuC,EAAE,WAAwB;QAC5E,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE;YAChC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;SAClF;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC;IACjE,CAAC;IAiBM,MAAM,CAAC,MAAuC;QACpD,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,EAAE;YAChC,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;SACpE;QAED,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,IAAkB,EAAE,IAAc;QAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9E,CAAC;IAEO,aAAa,CAAC,MAAuC;QAC5D,OAAQ,MAAsB,CAAC,KAAK,KAAK,SAAS,IAAK,MAAsB,CAAC,GAAG,KAAK,SAAS,CAAC;IACjG,CAAC;CACD;AAED;;;;GAIG;AACH,MAAM,OAAO,UAAW,SAAQ,iBAAyB;IAiBxD;;;;;;OAMG;IACH,YACC,OAA+B,EAC/B,EAAU,EACV,mBAAmB,GAAG,KAAK,EAC3B,gBAAgB,GAAG,IAAI;QAEvB,KAAK,CAAC,OAAO,EAAE,EAAE,EAAE,WAAW,CAAC,OAAO,EAAE,iBAAiB,CAAC,UAAU,EAAE,mBAAmB,EAAE,gBAAgB,CAAC,CAAC;IAC9G,CAAC;IA9BD;;OAEG;IACI,MAAM,CAAC,MAAM,CAAC,OAA+B,EAAE,EAAW;QAChE,OAAO,OAAO,CAAC,aAAa,CAAC,EAAE,EAAE,iBAAiB,CAAC,IAAI,CAAe,CAAC;IACxE,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,UAAU,CAAC,gBAAgB,GAAG,IAAI;QAC/C,OAAO,gBAAgB,CAAC,CAAC,CAAC,IAAI,iBAAiB,EAAE,CAAC,CAAC,CAAC,IAAI,0BAA0B,EAAE,CAAC;IACtF,CAAC;IAoBD;;OAEG;IACH,IAAW,MAAM;QAChB,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;YAClB,IAAI,CAAC,OAAO,GAAG,IAAI,gBAAgB,CAAC,IAAI,CAAC,CAAC;SAC1C;QAED,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED;;OAEG;IACO,eAAe,CAAC,OAA+B;QACxD,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE;YAC3B,OAAO,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;SACtD;QACD,OAAO,qBAAqB,CAAC,OAAO,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACzD,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { IFluidDataStoreRuntime } from '@fluidframework/datastore-definitions';\nimport { EditId, NodeId } from '../Identifiers';\nimport { Snapshot } from '../Snapshot';\nimport { Edit, BuildNode, fullHistorySummarizer, GenericSharedTree, NodeData, SharedTreeSummaryBase } from '../generic';\nimport { OrderedEditSet } from '../EditLog';\nimport { Change, Delete, Insert, Move, StableRange, StablePlace } from './PersistedTypes';\nimport { SharedTreeFactory, SharedTreeFactoryNoHistory } from './Factory';\nimport * as HistoryEditFactory from './HistoryEditFactory';\nimport { Transaction } from './Transaction';\nimport { noHistorySummarizer } from './Summary';\n\n/**\n * Wrapper around a `SharedTree` which provides ergonomic imperative editing functionality. All methods apply changes in their own edit.\n *\n * @example\n * // The following two lines of code are equivalent:\n * tree.applyEdit(...Insert.create([newNode], StablePlace.before(existingNode)));\n * tree.editor.insert(newNode, StablePlace.before(existingNode))\n * @public\n */\nexport class SharedTreeEditor {\n\tprivate readonly tree: SharedTree;\n\n\tpublic constructor(tree: SharedTree) {\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 - StablePlace at which the insert should take place.\n\t */\n\tpublic insert(node: BuildNode, destination: StablePlace): EditId;\n\t/**\n\t * Inserts nodes at a location.\n\t * @param nodes - Nodes to insert.\n\t * @param destination - StablePlace at which the insert should take place.\n\t */\n\tpublic insert(nodes: BuildNode[], destination: StablePlace): EditId;\n\tpublic insert(nodeOrNodes: BuildNode | BuildNode[], destination: StablePlace): EditId {\n\t\treturn this.tree.applyEdit(\n\t\t\t...Insert.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 - StablePlace to which the node should be moved.\n\t */\n\tpublic move(source: NodeData, destination: StablePlace): EditId;\n\t/**\n\t * Moves a node to a specified location.\n\t * @param source - Node to move.\n\t * @param destination - StablePlace to which the node should be moved.\n\t */\n\tpublic move(source: NodeId, destination: StablePlace): 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 - StablePlace to which the portion of the trait should be moved.\n\t */\n\tpublic move(source: StableRange, destination: StablePlace): EditId;\n\tpublic move(source: NodeData | NodeId | StableRange, destination: StablePlace): EditId {\n\t\tif (!this.isStableRange(source)) {\n\t\t\treturn this.tree.applyEdit(...Move.create(StableRange.only(source), destination));\n\t\t}\n\n\t\treturn this.tree.applyEdit(...Move.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: NodeId): EditId;\n\t/**\n\t * Deletes a portion of a trait.\n\t * @param target - Range of nodes to delete, specified as a `StableRange`\n\t */\n\tpublic delete(target: StableRange): EditId;\n\tpublic delete(target: NodeData | NodeId | StableRange): EditId {\n\t\tif (!this.isStableRange(target)) {\n\t\t\treturn this.tree.applyEdit(Delete.create(StableRange.only(target)));\n\t\t}\n\n\t\treturn this.tree.applyEdit(Delete.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<Change>, view: Snapshot): EditId {\n\t\treturn this.tree.applyEdit(...HistoryEditFactory.revert(edit.changes, view));\n\t}\n\n\tprivate isStableRange(source: NodeData | NodeId | StableRange): source is StableRange {\n\t\treturn (source as StableRange).start !== undefined && (source as StableRange).end !== undefined;\n\t}\n}\n\n/**\n * A distributed tree.\n * @public\n * @sealed\n */\nexport class SharedTree extends GenericSharedTree<Change> {\n\t/**\n\t * Create a new SharedTree. It will contain the default value (see initialTree).\n\t */\n\tpublic static create(runtime: IFluidDataStoreRuntime, id?: string): SharedTree {\n\t\treturn runtime.createChannel(id, SharedTreeFactory.Type) as SharedTree;\n\t}\n\n\t/**\n\t * Get a factory for SharedTree to register with the data store.\n\t * @param historySummarizing - determines how history is summarized by the returned `SharedTree`.\n\t * @returns A factory that creates `SharedTree`s and loads them from storage.\n\t */\n\tpublic static getFactory(summarizeHistory = true): SharedTreeFactory {\n\t\treturn summarizeHistory ? new SharedTreeFactory() : new SharedTreeFactoryNoHistory();\n\t}\n\n\t/**\n\t * Create a new SharedTreeFactory.\n\t * @param runtime - The runtime the SharedTree will be associated with\n\t * @param id - Unique ID for the SharedTree\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(runtime, id, Transaction.factory, SharedTreeFactory.Attributes, expensiveValidation, summarizeHistory);\n\t}\n\n\tprivate _editor: SharedTreeEditor | 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(): SharedTreeEditor {\n\t\tif (!this._editor) {\n\t\t\tthis._editor = new SharedTreeEditor(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<Change>): SharedTreeSummaryBase {\n\t\tif (!this.summarizeHistory) {\n\t\t\treturn noHistorySummarizer(editLog, this.currentView);\n\t\t}\n\t\treturn fullHistorySummarizer(editLog, this.currentView);\n\t}\n}\n"]}

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

@@ -1,15 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { OrderedEditSet } from '../EditLog';
-import { Snapshot } from '../Snapshot';
-import { SharedTreeSummary_0_0_2 } from '../SummaryBackCompatibility';
-import { Change } from './PersistedTypes';
-/**
- * Does not preserve (persist) history at all.
- * Instead, the history returned in the summary will contain a single change that creates a revision identical to the supplied view.
- * @public
- */
-export declare function noHistorySummarizer(_editLog: OrderedEditSet<Change>, currentView: Snapshot): SharedTreeSummary_0_0_2<Change>;
-//# sourceMappingURL=Summary.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Summary.d.ts","sourceRoot":"","sources":["../../src/default-edits/Summary.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,OAAO,EAAE,uBAAuB,EAAE,MAAM,6BAA6B,CAAC;AAEtE,OAAO,EAAE,MAAM,EAAE,MAAM,kBAAkB,CAAC;AAG1C;;;;GAIG;AACH,wBAAgB,mBAAmB,CAClC,QAAQ,EAAE,cAAc,CAAC,MAAM,CAAC,EAChC,WAAW,EAAE,QAAQ,GACnB,uBAAuB,CAAC,MAAM,CAAC,CAoBjC"}

package/lib/default-edits/Summary.js

@@ -1,31 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { assert } from '../Common';
-import { initialTree } from '../InitialTree';
-import { formatVersion, newEdit } from '../generic';
-import { setTrait } from './EditUtilities';
-/**
- * Does not preserve (persist) history at all.
- * Instead, the history returned in the summary will contain a single change that creates a revision identical to the supplied view.
- * @public
- */
-export function noHistorySummarizer(_editLog, currentView) {
-    const currentTree = currentView.getChangeNodeTree();
-    const rootId = currentTree.identifier;
-    const changes = [];
-    // Generate a set of changes to set the root node's children to that of the root in the currentTree
-    Object.entries(currentTree.traits).forEach(([label, children]) => {
-        changes.push(...setTrait({ parent: rootId, label: label }, children));
-    });
-    assert(currentTree.payload === undefined, 'setValue not yet supported.');
-    assert(currentTree.identifier === initialTree.identifier && currentTree.definition === initialTree.definition, 'root definition and identifier should be immutable.');
-    const edit = newEdit(changes);
-    return {
-        currentTree,
-        sequencedEdits: [{ id: edit.id, changes: edit.changes }],
-        version: formatVersion,
-    };
-}
-//# sourceMappingURL=Summary.js.map

package/lib/default-edits/Summary.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Summary.js","sourceRoot":"","sources":["../../src/default-edits/Summary.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,WAAW,CAAC;AAGnC,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAE7C,OAAO,EAAE,aAAa,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAEpD,OAAO,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAE3C;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CAClC,QAAgC,EAChC,WAAqB;IAErB,MAAM,WAAW,GAAG,WAAW,CAAC,iBAAiB,EAAE,CAAC;IACpD,MAAM,MAAM,GAAG,WAAW,CAAC,UAAU,CAAC;IACtC,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,mGAAmG;IACnG,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,EAAE;QAChE,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAmB,EAAE,EAAE,QAAQ,CAAC,CAAC,CAAC;IACrF,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,WAAW,CAAC,OAAO,KAAK,SAAS,EAAE,6BAA6B,CAAC,CAAC;IACzE,MAAM,CACL,WAAW,CAAC,UAAU,KAAK,WAAW,CAAC,UAAU,IAAI,WAAW,CAAC,UAAU,KAAK,WAAW,CAAC,UAAU,EACtG,qDAAqD,CACrD,CAAC;IACF,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;IAE9B,OAAO;QACN,WAAW;QACX,cAAc,EAAE,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC;QACxD,OAAO,EAAE,aAAa;KACtB,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { TraitLabel } from '../Identifiers';\nimport { assert } from '../Common';\nimport { OrderedEditSet } from '../EditLog';\nimport { Snapshot } from '../Snapshot';\nimport { initialTree } from '../InitialTree';\nimport { SharedTreeSummary_0_0_2 } from '../SummaryBackCompatibility';\nimport { formatVersion, newEdit } from '../generic';\nimport { Change } from './PersistedTypes';\nimport { setTrait } from './EditUtilities';\n\n/**\n * Does not preserve (persist) history at all.\n * Instead, the history returned in the summary will contain a single change that creates a revision identical to the supplied view.\n * @public\n */\nexport function noHistorySummarizer(\n\t_editLog: OrderedEditSet<Change>,\n\tcurrentView: Snapshot\n): SharedTreeSummary_0_0_2<Change> {\n\tconst currentTree = currentView.getChangeNodeTree();\n\tconst rootId = currentTree.identifier;\n\tconst changes: Change[] = [];\n\t// Generate a set of changes to set the root node's children to that of the root in the currentTree\n\tObject.entries(currentTree.traits).forEach(([label, children]) => {\n\t\tchanges.push(...setTrait({ parent: rootId, label: label as TraitLabel }, children));\n\t});\n\tassert(currentTree.payload === undefined, 'setValue not yet supported.');\n\tassert(\n\t\tcurrentTree.identifier === initialTree.identifier && currentTree.definition === initialTree.definition,\n\t\t'root definition and identifier should be immutable.'\n\t);\n\tconst edit = newEdit(changes);\n\n\treturn {\n\t\tcurrentTree,\n\t\tsequencedEdits: [{ id: edit.id, changes: edit.changes }],\n\t\tversion: formatVersion,\n\t};\n}\n"]}

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

@@ -1,41 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { NodeId, DetachedSequenceId } from '../Identifiers';
-import { GenericTransaction, BuildNode, EditStatus } from '../generic';
-import { Snapshot, SnapshotNode } from '../Snapshot';
-import { Change } 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 Transaction extends GenericTransaction<Change> {
-    protected readonly detached: Map<DetachedSequenceId, readonly NodeId[]>;
-    static factory(snapshot: Snapshot): Transaction;
-    protected validateOnClose(): EditStatus;
-    protected dispatchChange(change: Change): EditStatus;
-    private applyBuild;
-    private applyInsert;
-    private applyDetach;
-    private applyConstraint;
-    private applySetValue;
-    /**
-     * Generates snapshot nodes from the supplied edit nodes.
-     * Invokes onCreateNode for each new snapshot node, and halts creation early if it returns true.
-     * Invokes onInvalidDetachedId and halts early for any invalid detached IDs referenced in the edit node sequence.
-     * @returns all the top-level node IDs in `sequence` (both from nodes and from detached sequences).
-     */
-    protected createSnapshotNodesForTree(sequence: Iterable<BuildNode>, onCreateNode: (id: NodeId, node: SnapshotNode) => boolean, onInvalidDetachedId: () => void): NodeId[] | undefined;
-    private getDetachedNodeIds;
-}
-//# sourceMappingURL=Transaction.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Transaction.d.ts","sourceRoot":"","sources":["../../src/default-edits/Transaction.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAc,MAAM,gBAAgB,CAAC;AACxE,OAAO,EAAE,kBAAkB,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAErD,OAAO,EAAS,MAAM,EAAsE,MAAM,kBAAkB,CAAC;AAUrH;;;;;;;;;;;;GAYG;AACH,qBAAa,WAAY,SAAQ,kBAAkB,CAAC,MAAM,CAAC;IAC1D,SAAS,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,kBAAkB,EAAE,SAAS,MAAM,EAAE,CAAC,CAAa;WAEtE,OAAO,CAAC,QAAQ,EAAE,QAAQ,GAAG,WAAW;IAItD,SAAS,CAAC,eAAe,IAAI,UAAU;IAKvC,SAAS,CAAC,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG,UAAU;IAiBpD,OAAO,CAAC,UAAU;IAyClB,OAAO,CAAC,WAAW;IAgBnB,OAAO,CAAC,WAAW;IAwBnB,OAAO,CAAC,eAAe;IA8BvB,OAAO,CAAC,aAAa;IASrB;;;;;OAKG;IACH,SAAS,CAAC,0BAA0B,CACnC,QAAQ,EAAE,QAAQ,CAAC,SAAS,CAAC,EAC7B,YAAY,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,YAAY,KAAK,OAAO,EACzD,mBAAmB,EAAE,MAAM,IAAI,GAC7B,MAAM,EAAE,GAAG,SAAS;IAuDvB,OAAO,CAAC,kBAAkB;CAc1B"}

package/lib/default-edits/Transaction.js

@@ -1,221 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { assert, assertNotUndefined, copyPropertyIfDefined, fail } from '../Common';
-import { GenericTransaction, EditStatus } from '../generic';
-import { EditValidationResult } from '../Checkout';
-import { ChangeType, ConstraintEffect } from './PersistedTypes';
-import { detachRange, insertIntoTrait, rangeFromStableRange, validateStablePlace, validateStableRange, isDetachedSequenceId, } from './EditUtilities';
-/**
- * A mutable transaction for applying sequences of changes to a Snapshot.
- * Allows viewing the intermediate states.
- *
- * Contains necessary state to apply changes within an edit to a Snapshot.
- *
- * May have any number of changes applied to make up the edit.
- * Use `close` to complete the transaction, returning the array of changes and an EditingResult showing the
- * results of applying the changes as an Edit to the initial Snapshot (passed to the constructor).
- *
- * No data outside the Transaction is modified by Transaction:
- * the results from `close` must be used to actually submit an `Edit`.
- */
-export class Transaction extends GenericTransaction {
-    constructor() {
-        super(...arguments);
-        this.detached = new Map();
-    }
-    static factory(snapshot) {
-        return new Transaction(snapshot);
-    }
-    validateOnClose() {
-        // Making the policy choice that storing a detached sequences in an edit but not using it is an error.
-        return this.detached.size !== 0 ? EditStatus.Malformed : EditStatus.Applied;
-    }
-    dispatchChange(change) {
-        switch (change.type) {
-            case ChangeType.Build:
-                return this.applyBuild(change);
-            case ChangeType.Insert:
-                return this.applyInsert(change);
-            case ChangeType.Detach:
-                return this.applyDetach(change);
-            case ChangeType.Constraint:
-                return this.applyConstraint(change);
-            case ChangeType.SetValue:
-                return this.applySetValue(change);
-            default:
-                return fail('Attempted to apply unsupported change');
-        }
-    }
-    applyBuild(change) {
-        if (this.detached.has(change.destination)) {
-            return EditStatus.Malformed;
-        }
-        let idAlreadyPresent = false;
-        let duplicateIdInBuild = false;
-        const map = new Map();
-        let detachedSequenceNotFound = false;
-        const newIds = this.createSnapshotNodesForTree(change.source, (id, snapshotNode) => {
-            if (map.has(id)) {
-                duplicateIdInBuild = true;
-                return true;
-            }
-            if (this.view.hasNode(id)) {
-                idAlreadyPresent = true;
-                return true;
-            }
-            map.set(id, snapshotNode);
-            return false;
-        }, () => {
-            detachedSequenceNotFound = true;
-        });
-        if (detachedSequenceNotFound || duplicateIdInBuild) {
-            return EditStatus.Malformed;
-        }
-        if (idAlreadyPresent) {
-            return EditStatus.Invalid;
-        }
-        const view = this.view.addNodes(map.values());
-        this._view = view;
-        this.detached.set(change.destination, assertNotUndefined(newIds));
-        return EditStatus.Applied;
-    }
-    applyInsert(change) {
-        const source = this.detached.get(change.source);
-        if (source === undefined) {
-            return EditStatus.Malformed;
-        }
-        const destinationChangeResult = validateStablePlace(this.view, change.destination);
-        if (destinationChangeResult !== EditValidationResult.Valid) {
-            return destinationChangeResult === EditValidationResult.Invalid ? EditStatus.Invalid : EditStatus.Malformed;
-        }
-        this.detached.delete(change.source);
-        this._view = insertIntoTrait(this.view, source, change.destination);
-        return EditStatus.Applied;
-    }
-    applyDetach(change) {
-        const sourceChangeResult = validateStableRange(this.view, change.source);
-        if (sourceChangeResult !== EditValidationResult.Valid) {
-            return sourceChangeResult === EditValidationResult.Invalid ? EditStatus.Invalid : EditStatus.Malformed;
-        }
-        const result = detachRange(this.view, change.source);
-        let modifiedView = result.snapshot;
-        const { detached } = result;
-        // Store or dispose detached
-        if (change.destination !== undefined) {
-            if (this.detached.has(change.destination)) {
-                return EditStatus.Malformed;
-            }
-            this.detached.set(change.destination, detached);
-        }
-        else {
-            modifiedView = modifiedView.deleteNodes(detached);
-        }
-        this._view = modifiedView;
-        return EditStatus.Applied;
-    }
-    applyConstraint(change) {
-        // TODO: Implement identityHash and contentHash
-        assert(change.identityHash === undefined, 'identityHash constraint is not implemented');
-        assert(change.contentHash === undefined, 'contentHash constraint is not implemented');
-        const sourceChangeResult = validateStableRange(this.view, change.toConstrain);
-        const onViolation = change.effect === ConstraintEffect.ValidRetry ? EditStatus.Applied : EditStatus.Invalid;
-        if (sourceChangeResult !== EditValidationResult.Valid) {
-            return sourceChangeResult === EditValidationResult.Invalid ? onViolation : EditStatus.Malformed;
-        }
-        const { start, end } = rangeFromStableRange(this.view, change.toConstrain);
-        const startIndex = this.view.findIndexWithinTrait(start);
-        const endIndex = this.view.findIndexWithinTrait(end);
-        if (change.length !== undefined && change.length !== endIndex - startIndex) {
-            return onViolation;
-        }
-        if (change.parentNode !== undefined && change.parentNode !== end.trait.parent) {
-            return onViolation;
-        }
-        if (change.label !== undefined && change.label !== end.trait.label) {
-            return onViolation;
-        }
-        return EditStatus.Applied;
-    }
-    applySetValue(change) {
-        if (!this.view.hasNode(change.nodeToModify)) {
-            return EditStatus.Invalid;
-        }
-        this._view = this.view.setNodeValue(change.nodeToModify, change.payload);
-        return EditStatus.Applied;
-    }
-    /**
-     * Generates snapshot nodes from the supplied edit nodes.
-     * Invokes onCreateNode for each new snapshot node, and halts creation early if it returns true.
-     * Invokes onInvalidDetachedId and halts early for any invalid detached IDs referenced in the edit node sequence.
-     * @returns all the top-level node IDs in `sequence` (both from nodes and from detached sequences).
-     */
-    createSnapshotNodesForTree(sequence, onCreateNode, onInvalidDetachedId) {
-        const topLevelIds = [];
-        const unprocessed = [];
-        for (const buildNode of sequence) {
-            if (isDetachedSequenceId(buildNode)) {
-                const detachedIds = this.getDetachedNodeIds(buildNode, onInvalidDetachedId);
-                if (detachedIds === undefined) {
-                    return undefined;
-                }
-                topLevelIds.push(...detachedIds);
-            }
-            else {
-                unprocessed.push(buildNode);
-                topLevelIds.push(buildNode.identifier);
-            }
-        }
-        while (unprocessed.length > 0) {
-            const node = unprocessed.pop();
-            assert(node !== undefined && !isDetachedSequenceId(node));
-            const traits = new Map();
-            // eslint-disable-next-line no-restricted-syntax
-            for (const key in node.traits) {
-                if (Object.prototype.hasOwnProperty.call(node.traits, key)) {
-                    const children = node.traits[key];
-                    if (children.length > 0) {
-                        const childIds = [];
-                        for (const child of children) {
-                            if (isDetachedSequenceId(child)) {
-                                const detachedIds = this.getDetachedNodeIds(child, onInvalidDetachedId);
-                                if (detachedIds === undefined) {
-                                    return undefined;
-                                }
-                                childIds.push(...detachedIds);
-                            }
-                            else {
-                                childIds.push(child.identifier);
-                                unprocessed.push(child);
-                            }
-                        }
-                        traits.set(key, childIds);
-                    }
-                }
-            }
-            const newNode = {
-                identifier: node.identifier,
-                definition: node.definition,
-                traits,
-            };
-            copyPropertyIfDefined(node, newNode, 'payload');
-            if (onCreateNode(newNode.identifier, newNode)) {
-                return undefined;
-            }
-        }
-        return topLevelIds;
-    }
-    getDetachedNodeIds(detachedId, onInvalidDetachedId) {
-        // Retrieve the detached sequence from the void.
-        const detachedNodeIds = this.detached.get(detachedId);
-        if (detachedNodeIds === undefined) {
-            onInvalidDetachedId();
-            return undefined;
-        }
-        // Since we have retrieved the sequence, remove it from the void to prevent a second tree from multi-parenting it later
-        this.detached.delete(detachedId);
-        return detachedNodeIds;
-    }
-}
-//# sourceMappingURL=Transaction.js.map

package/lib/default-edits/Transaction.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Transaction.js","sourceRoot":"","sources":["../../src/default-edits/Transaction.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,qBAAqB,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEpF,OAAO,EAAE,kBAAkB,EAAa,UAAU,EAAE,MAAM,YAAY,CAAC;AAEvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAiB,UAAU,EAAc,gBAAgB,EAA4B,MAAM,kBAAkB,CAAC;AACrH,OAAO,EACN,WAAW,EACX,eAAe,EACf,oBAAoB,EACpB,mBAAmB,EACnB,mBAAmB,EACnB,oBAAoB,GACpB,MAAM,iBAAiB,CAAC;AAEzB;;;;;;;;;;;;GAYG;AACH,MAAM,OAAO,WAAY,SAAQ,kBAA0B;IAA3D;;QACoB,aAAQ,GAA+C,IAAI,GAAG,EAAE,CAAC;IAmOrF,CAAC;IAjOO,MAAM,CAAC,OAAO,CAAC,QAAkB;QACvC,OAAO,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC;IAES,eAAe;QACxB,sGAAsG;QACtG,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC;IAC7E,CAAC;IAES,cAAc,CAAC,MAAc;QACtC,QAAQ,MAAM,CAAC,IAAI,EAAE;YACpB,KAAK,UAAU,CAAC,KAAK;gBACpB,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;YAChC,KAAK,UAAU,CAAC,MAAM;gBACrB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACjC,KAAK,UAAU,CAAC,MAAM;gBACrB,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YACjC,KAAK,UAAU,CAAC,UAAU;gBACzB,OAAO,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YACrC,KAAK,UAAU,CAAC,QAAQ;gBACvB,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YACnC;gBACC,OAAO,IAAI,CAAC,uCAAuC,CAAC,CAAC;SACtD;IACF,CAAC;IAEO,UAAU,CAAC,MAAa;QAC/B,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE;YAC1C,OAAO,UAAU,CAAC,SAAS,CAAC;SAC5B;QAED,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAC7B,IAAI,kBAAkB,GAAG,KAAK,CAAC;QAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAwB,CAAC;QAC5C,IAAI,wBAAwB,GAAG,KAAK,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,0BAA0B,CAC7C,MAAM,CAAC,MAAM,EACb,CAAC,EAAE,EAAE,YAAY,EAAE,EAAE;YACpB,IAAI,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAChB,kBAAkB,GAAG,IAAI,CAAC;gBAC1B,OAAO,IAAI,CAAC;aACZ;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;gBAC1B,gBAAgB,GAAG,IAAI,CAAC;gBACxB,OAAO,IAAI,CAAC;aACZ;YACD,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,YAAY,CAAC,CAAC;YAC1B,OAAO,KAAK,CAAC;QACd,CAAC,EACD,GAAG,EAAE;YACJ,wBAAwB,GAAG,IAAI,CAAC;QACjC,CAAC,CACD,CAAC;QAEF,IAAI,wBAAwB,IAAI,kBAAkB,EAAE;YACnD,OAAO,UAAU,CAAC,SAAS,CAAC;SAC5B;QACD,IAAI,gBAAgB,EAAE;YACrB,OAAO,UAAU,CAAC,OAAO,CAAC;SAC1B;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,OAAO,UAAU,CAAC,OAAO,CAAC;IAC3B,CAAC;IAEO,WAAW,CAAC,MAAc;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,MAAM,KAAK,SAAS,EAAE;YACzB,OAAO,UAAU,CAAC,SAAS,CAAC;SAC5B;QAED,MAAM,uBAAuB,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;QACnF,IAAI,uBAAuB,KAAK,oBAAoB,CAAC,KAAK,EAAE;YAC3D,OAAO,uBAAuB,KAAK,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;SAC5G;QAED,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;QACpE,OAAO,UAAU,CAAC,OAAO,CAAC;IAC3B,CAAC;IAEO,WAAW,CAAC,MAAc;QACjC,MAAM,kBAAkB,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACzE,IAAI,kBAAkB,KAAK,oBAAoB,CAAC,KAAK,EAAE;YACtD,OAAO,kBAAkB,KAAK,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;SACvG;QAED,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,YAAY,GAAG,MAAM,CAAC,QAAQ,CAAC;QACnC,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC;QAE5B,4BAA4B;QAC5B,IAAI,MAAM,CAAC,WAAW,KAAK,SAAS,EAAE;YACrC,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,EAAE;gBAC1C,OAAO,UAAU,CAAC,SAAS,CAAC;aAC5B;YACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;SAChD;aAAM;YACN,YAAY,GAAG,YAAY,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;SAClD;QAED,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC;QAC1B,OAAO,UAAU,CAAC,OAAO,CAAC;IAC3B,CAAC;IAEO,eAAe,CAAC,MAAkB;QACzC,+CAA+C;QAC/C,MAAM,CAAC,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE,4CAA4C,CAAC,CAAC;QACxF,MAAM,CAAC,MAAM,CAAC,WAAW,KAAK,SAAS,EAAE,2CAA2C,CAAC,CAAC;QAEtF,MAAM,kBAAkB,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;QAC9E,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,KAAK,gBAAgB,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC;QAC5G,IAAI,kBAAkB,KAAK,oBAAoB,CAAC,KAAK,EAAE;YACtD,OAAO,kBAAkB,KAAK,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC;SAChG;QAED,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC;QAC3E,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAErD,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,GAAG,UAAU,EAAE;YAC3E,OAAO,WAAW,CAAC;SACnB;QAED,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,IAAI,MAAM,CAAC,UAAU,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE;YAC9E,OAAO,WAAW,CAAC;SACnB;QAED,IAAI,MAAM,CAAC,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE;YACnE,OAAO,WAAW,CAAC;SACnB;QAED,OAAO,UAAU,CAAC,OAAO,CAAC;IAC3B,CAAC;IAEO,aAAa,CAAC,MAAgB;QACrC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE;YAC5C,OAAO,UAAU,CAAC,OAAO,CAAC;SAC1B;QAED,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,YAAY,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QACzE,OAAO,UAAU,CAAC,OAAO,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACO,0BAA0B,CACnC,QAA6B,EAC7B,YAAyD,EACzD,mBAA+B;QAE/B,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,MAAM,WAAW,GAAgB,EAAE,CAAC;QACpC,KAAK,MAAM,SAAS,IAAI,QAAQ,EAAE;YACjC,IAAI,oBAAoB,CAAC,SAAS,CAAC,EAAE;gBACpC,MAAM,WAAW,GAAG,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,mBAAmB,CAAC,CAAC;gBAC5E,IAAI,WAAW,KAAK,SAAS,EAAE;oBAC9B,OAAO,SAAS,CAAC;iBACjB;gBACD,WAAW,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;aACjC;iBAAM;gBACN,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC5B,WAAW,CAAC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;aACvC;SACD;QACD,OAAO,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE;YAC9B,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;YAC/B,MAAM,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiC,CAAC;YAExD,gDAAgD;YAChD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE;gBAC9B,IAAI,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;oBAC3D,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBAClC,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE;wBACxB,MAAM,QAAQ,GAAa,EAAE,CAAC;wBAC9B,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE;4BAC7B,IAAI,oBAAoB,CAAC,KAAK,CAAC,EAAE;gCAChC,MAAM,WAAW,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,mBAAmB,CAAC,CAAC;gCACxE,IAAI,WAAW,KAAK,SAAS,EAAE;oCAC9B,OAAO,SAAS,CAAC;iCACjB;gCACD,QAAQ,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;6BAC9B;iCAAM;gCACN,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gCAChC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;6BACxB;yBACD;wBACD,MAAM,CAAC,GAAG,CAAC,GAAiB,EAAE,QAAQ,CAAC,CAAC;qBACxC;iBACD;aACD;YACD,MAAM,OAAO,GAAiB;gBAC7B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;gBAC3B,MAAM;aACN,CAAC;YACF,qBAAqB,CAAC,IAAI,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;YAChD,IAAI,YAAY,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE;gBAC9C,OAAO,SAAS,CAAC;aACjB;SACD;QACD,OAAO,WAAW,CAAC;IACpB,CAAC;IAEO,kBAAkB,CACzB,UAA8B,EAC9B,mBAA+B;QAE/B,gDAAgD;QAChD,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,eAAe,KAAK,SAAS,EAAE;YAClC,mBAAmB,EAAE,CAAC;YACtB,OAAO,SAAS,CAAC;SACjB;QACD,uHAAuH;QACvH,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACjC,OAAO,eAAe,CAAC;IACxB,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, assertNotUndefined, copyPropertyIfDefined, fail } from '../Common';\nimport { NodeId, DetachedSequenceId, TraitLabel } from '../Identifiers';\nimport { GenericTransaction, BuildNode, EditStatus } from '../generic';\nimport { Snapshot, SnapshotNode } from '../Snapshot';\nimport { EditValidationResult } from '../Checkout';\nimport { Build, Change, ChangeType, Constraint, ConstraintEffect, Detach, Insert, SetValue } from './PersistedTypes';\nimport {\n\tdetachRange,\n\tinsertIntoTrait,\n\trangeFromStableRange,\n\tvalidateStablePlace,\n\tvalidateStableRange,\n\tisDetachedSequenceId,\n} from './EditUtilities';\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 Transaction extends GenericTransaction<Change> {\n\tprotected readonly detached: Map<DetachedSequenceId, readonly NodeId[]> = new Map();\n\n\tpublic static factory(snapshot: Snapshot): Transaction {\n\t\treturn new Transaction(snapshot);\n\t}\n\n\tprotected validateOnClose(): EditStatus {\n\t\t// Making the policy choice that storing a detached sequences in an edit but not using it is an error.\n\t\treturn this.detached.size !== 0 ? EditStatus.Malformed : EditStatus.Applied;\n\t}\n\n\tprotected dispatchChange(change: Change): EditStatus {\n\t\tswitch (change.type) {\n\t\t\tcase ChangeType.Build:\n\t\t\t\treturn this.applyBuild(change);\n\t\t\tcase ChangeType.Insert:\n\t\t\t\treturn this.applyInsert(change);\n\t\t\tcase ChangeType.Detach:\n\t\t\t\treturn this.applyDetach(change);\n\t\t\tcase ChangeType.Constraint:\n\t\t\t\treturn this.applyConstraint(change);\n\t\t\tcase ChangeType.SetValue:\n\t\t\t\treturn this.applySetValue(change);\n\t\t\tdefault:\n\t\t\t\treturn fail('Attempted to apply unsupported change');\n\t\t}\n\t}\n\n\tprivate applyBuild(change: Build): EditStatus {\n\t\tif (this.detached.has(change.destination)) {\n\t\t\treturn EditStatus.Malformed;\n\t\t}\n\n\t\tlet idAlreadyPresent = false;\n\t\tlet duplicateIdInBuild = false;\n\t\tconst map = new Map<NodeId, SnapshotNode>();\n\t\tlet detachedSequenceNotFound = false;\n\t\tconst newIds = this.createSnapshotNodesForTree(\n\t\t\tchange.source,\n\t\t\t(id, snapshotNode) => {\n\t\t\t\tif (map.has(id)) {\n\t\t\t\t\tduplicateIdInBuild = true;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tif (this.view.hasNode(id)) {\n\t\t\t\t\tidAlreadyPresent = true;\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t\tmap.set(id, snapshotNode);\n\t\t\t\treturn false;\n\t\t\t},\n\t\t\t() => {\n\t\t\t\tdetachedSequenceNotFound = true;\n\t\t\t}\n\t\t);\n\n\t\tif (detachedSequenceNotFound || duplicateIdInBuild) {\n\t\t\treturn EditStatus.Malformed;\n\t\t}\n\t\tif (idAlreadyPresent) {\n\t\t\treturn EditStatus.Invalid;\n\t\t}\n\n\t\tconst view = this.view.addNodes(map.values());\n\t\tthis._view = view;\n\t\tthis.detached.set(change.destination, assertNotUndefined(newIds));\n\t\treturn EditStatus.Applied;\n\t}\n\n\tprivate applyInsert(change: Insert): EditStatus {\n\t\tconst source = this.detached.get(change.source);\n\t\tif (source === undefined) {\n\t\t\treturn EditStatus.Malformed;\n\t\t}\n\n\t\tconst destinationChangeResult = validateStablePlace(this.view, change.destination);\n\t\tif (destinationChangeResult !== EditValidationResult.Valid) {\n\t\t\treturn destinationChangeResult === EditValidationResult.Invalid ? EditStatus.Invalid : EditStatus.Malformed;\n\t\t}\n\n\t\tthis.detached.delete(change.source);\n\t\tthis._view = insertIntoTrait(this.view, source, change.destination);\n\t\treturn EditStatus.Applied;\n\t}\n\n\tprivate applyDetach(change: Detach): EditStatus {\n\t\tconst sourceChangeResult = validateStableRange(this.view, change.source);\n\t\tif (sourceChangeResult !== EditValidationResult.Valid) {\n\t\t\treturn sourceChangeResult === EditValidationResult.Invalid ? EditStatus.Invalid : EditStatus.Malformed;\n\t\t}\n\n\t\tconst result = detachRange(this.view, change.source);\n\t\tlet modifiedView = result.snapshot;\n\t\tconst { detached } = result;\n\n\t\t// Store or dispose detached\n\t\tif (change.destination !== undefined) {\n\t\t\tif (this.detached.has(change.destination)) {\n\t\t\t\treturn EditStatus.Malformed;\n\t\t\t}\n\t\t\tthis.detached.set(change.destination, detached);\n\t\t} else {\n\t\t\tmodifiedView = modifiedView.deleteNodes(detached);\n\t\t}\n\n\t\tthis._view = modifiedView;\n\t\treturn EditStatus.Applied;\n\t}\n\n\tprivate applyConstraint(change: Constraint): EditStatus {\n\t\t// TODO: Implement identityHash and contentHash\n\t\tassert(change.identityHash === undefined, 'identityHash constraint is not implemented');\n\t\tassert(change.contentHash === undefined, 'contentHash constraint is not implemented');\n\n\t\tconst sourceChangeResult = validateStableRange(this.view, change.toConstrain);\n\t\tconst onViolation = change.effect === ConstraintEffect.ValidRetry ? EditStatus.Applied : EditStatus.Invalid;\n\t\tif (sourceChangeResult !== EditValidationResult.Valid) {\n\t\t\treturn sourceChangeResult === EditValidationResult.Invalid ? onViolation : EditStatus.Malformed;\n\t\t}\n\n\t\tconst { start, end } = rangeFromStableRange(this.view, change.toConstrain);\n\t\tconst startIndex = this.view.findIndexWithinTrait(start);\n\t\tconst endIndex = this.view.findIndexWithinTrait(end);\n\n\t\tif (change.length !== undefined && change.length !== endIndex - startIndex) {\n\t\t\treturn onViolation;\n\t\t}\n\n\t\tif (change.parentNode !== undefined && change.parentNode !== end.trait.parent) {\n\t\t\treturn onViolation;\n\t\t}\n\n\t\tif (change.label !== undefined && change.label !== end.trait.label) {\n\t\t\treturn onViolation;\n\t\t}\n\n\t\treturn EditStatus.Applied;\n\t}\n\n\tprivate applySetValue(change: SetValue): EditStatus {\n\t\tif (!this.view.hasNode(change.nodeToModify)) {\n\t\t\treturn EditStatus.Invalid;\n\t\t}\n\n\t\tthis._view = this.view.setNodeValue(change.nodeToModify, change.payload);\n\t\treturn EditStatus.Applied;\n\t}\n\n\t/**\n\t * Generates snapshot nodes from the supplied edit nodes.\n\t * Invokes onCreateNode for each new snapshot node, and halts creation early if it returns true.\n\t * Invokes onInvalidDetachedId and halts early for any invalid detached IDs referenced in the edit node sequence.\n\t * @returns all the top-level node IDs in `sequence` (both from nodes and from detached sequences).\n\t */\n\tprotected createSnapshotNodesForTree(\n\t\tsequence: Iterable<BuildNode>,\n\t\tonCreateNode: (id: NodeId, node: SnapshotNode) => boolean,\n\t\tonInvalidDetachedId: () => void\n\t): NodeId[] | undefined {\n\t\tconst topLevelIds: NodeId[] = [];\n\t\tconst unprocessed: BuildNode[] = [];\n\t\tfor (const buildNode of sequence) {\n\t\t\tif (isDetachedSequenceId(buildNode)) {\n\t\t\t\tconst detachedIds = this.getDetachedNodeIds(buildNode, onInvalidDetachedId);\n\t\t\t\tif (detachedIds === undefined) {\n\t\t\t\t\treturn undefined;\n\t\t\t\t}\n\t\t\t\ttopLevelIds.push(...detachedIds);\n\t\t\t} else {\n\t\t\t\tunprocessed.push(buildNode);\n\t\t\t\ttopLevelIds.push(buildNode.identifier);\n\t\t\t}\n\t\t}\n\t\twhile (unprocessed.length > 0) {\n\t\t\tconst node = unprocessed.pop();\n\t\t\tassert(node !== undefined && !isDetachedSequenceId(node));\n\t\t\tconst traits = new Map<TraitLabel, readonly NodeId[]>();\n\n\t\t\t// eslint-disable-next-line no-restricted-syntax\n\t\t\tfor (const key in node.traits) {\n\t\t\t\tif (Object.prototype.hasOwnProperty.call(node.traits, key)) {\n\t\t\t\t\tconst children = node.traits[key];\n\t\t\t\t\tif (children.length > 0) {\n\t\t\t\t\t\tconst childIds: NodeId[] = [];\n\t\t\t\t\t\tfor (const child of children) {\n\t\t\t\t\t\t\tif (isDetachedSequenceId(child)) {\n\t\t\t\t\t\t\t\tconst detachedIds = this.getDetachedNodeIds(child, onInvalidDetachedId);\n\t\t\t\t\t\t\t\tif (detachedIds === undefined) {\n\t\t\t\t\t\t\t\t\treturn undefined;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tchildIds.push(...detachedIds);\n\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\tchildIds.push(child.identifier);\n\t\t\t\t\t\t\t\tunprocessed.push(child);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\ttraits.set(key as TraitLabel, childIds);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst newNode: SnapshotNode = {\n\t\t\t\tidentifier: node.identifier,\n\t\t\t\tdefinition: node.definition,\n\t\t\t\ttraits,\n\t\t\t};\n\t\t\tcopyPropertyIfDefined(node, newNode, 'payload');\n\t\t\tif (onCreateNode(newNode.identifier, newNode)) {\n\t\t\t\treturn undefined;\n\t\t\t}\n\t\t}\n\t\treturn topLevelIds;\n\t}\n\n\tprivate getDetachedNodeIds(\n\t\tdetachedId: DetachedSequenceId,\n\t\tonInvalidDetachedId: () => void\n\t): readonly NodeId[] | undefined {\n\t\t// Retrieve the detached sequence from the void.\n\t\tconst detachedNodeIds = this.detached.get(detachedId);\n\t\tif (detachedNodeIds === undefined) {\n\t\t\tonInvalidDetachedId();\n\t\t\treturn undefined;\n\t\t}\n\t\t// Since we have retrieved the sequence, remove it from the void to prevent a second tree from multi-parenting it later\n\t\tthis.detached.delete(detachedId);\n\t\treturn detachedNodeIds;\n\t}\n}\n"]}

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

@@ -1 +0,0 @@
-{"version":3,"file":"UndoRedoHandler.d.ts","sourceRoot":"","sources":["../../src/default-edits/UndoRedoHandler.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAExC,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAK1C,MAAM,WAAW,WAAW;IAC3B,MAAM,QAAG;IACT,OAAO,QAAG;CACV;AAED,MAAM,WAAW,aAAa;IAC7B,sBAAsB,CAAC,UAAU,EAAE,WAAW,OAAE;CAChD;AAED;;;GAGG;AACH,qBAAa,yBAAyB;IACzB,OAAO,CAAC,QAAQ,CAAC,YAAY;gBAAZ,YAAY,EAAE,aAAa;IAEjD,UAAU,CAAC,IAAI,EAAE,UAAU;IAG3B,UAAU,CAAC,IAAI,EAAE,UAAU;IAIlC,OAAO,CAAC,QAAQ,CAAC,gBAAgB,CAc/B;CACF;AAED;;GAEG;AACH,qBAAa,oBAAqB,YAAW,WAAW;IAC3C,OAAO,CAAC,MAAM;IAAU,OAAO,CAAC,QAAQ,CAAC,IAAI;gBAArC,MAAM,EAAE,MAAM,EAAmB,IAAI,EAAE,UAAU;IAE9D,MAAM;IASN,OAAO;CAGd"}

package/lib/default-edits/UndoRedoHandler.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"UndoRedoHandler.js","sourceRoot":"","sources":["../../src/default-edits/UndoRedoHandler.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAE/C,OAAO,EAA+B,eAAe,EAAE,MAAM,YAAY,CAAC;AAe1E;;;GAGG;AACH,MAAM,OAAO,yBAAyB;IACrC,YAA6B,YAA2B;QAA3B,iBAAY,GAAZ,YAAY,CAAe;QASvC,qBAAgB,GAAG,CAAC,cAAuD,EAAE,EAAE;YAC/F,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,CAAC;YAE/C,IAAI,KAAK,EAAE;gBACV,IAAI,CAAC,YAAY,CAAC,sBAAsB,CACvC,IAAI,oBAAoB,CACvB,MAAM,EACN,kBAAkB,CACjB,IAAI,EACJ,sGAAsG,CACtG,CACD,CACD,CAAC;aACF;QACF,CAAC,CAAC;IAvByD,CAAC;IAErD,UAAU,CAAC,IAAgB;QACjC,IAAI,CAAC,EAAE,CAAC,eAAe,CAAC,aAAa,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAC/D,CAAC;IACM,UAAU,CAAC,IAAgB;QACjC,IAAI,CAAC,GAAG,CAAC,eAAe,CAAC,aAAa,EAAE,IAAI,CAAC,gBAAgB,CAAC,CAAC;IAChE,CAAC;CAiBD;AAED;;GAEG;AACH,MAAM,OAAO,oBAAoB;IAChC,YAAoB,MAAc,EAAmB,IAAgB;QAAjD,WAAM,GAAN,MAAM,CAAQ;QAAmB,SAAI,GAAJ,IAAI,CAAY;IAAG,CAAC;IAElE,MAAM;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QAChE,MAAM,cAAc,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAE3E,+DAA+D;QAC/D,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IAC7D,CAAC;IAEM,OAAO;QACb,OAAO;IACR,CAAC;CACD","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assertNotUndefined } from '../Common';\nimport { EditId } from '../Identifiers';\nimport { EditCommittedEventArguments, SharedTreeEvent } from '../generic';\nimport { SharedTree } from './SharedTree';\n\n// TODO: We temporarily duplicate these contracts from 'framework/undo-redo' to unblock development\n//       while we decide on the correct layering for undo.\n\nexport interface IRevertible {\n\trevert();\n\tdiscard();\n}\n\nexport interface IUndoConsumer {\n\tpushToCurrentOperation(revertible: IRevertible);\n}\n\n/**\n * A shared tree undo redo handler that will add revertible local tree changes to the provided\n * undo redo stack manager\n */\nexport class SharedTreeUndoRedoHandler {\n\tconstructor(private readonly stackManager: IUndoConsumer) {}\n\n\tpublic attachTree(tree: SharedTree) {\n\t\ttree.on(SharedTreeEvent.EditCommitted, this.treeDeltaHandler);\n\t}\n\tpublic detachTree(tree: SharedTree) {\n\t\ttree.off(SharedTreeEvent.EditCommitted, this.treeDeltaHandler);\n\t}\n\n\tprivate readonly treeDeltaHandler = (eventArguments: EditCommittedEventArguments<SharedTree>) => {\n\t\tconst { editId, local, tree } = eventArguments;\n\n\t\tif (local) {\n\t\t\tthis.stackManager.pushToCurrentOperation(\n\t\t\t\tnew SharedTreeRevertible(\n\t\t\t\t\teditId,\n\t\t\t\t\tassertNotUndefined(\n\t\t\t\t\t\ttree,\n\t\t\t\t\t\t'An edit committed event for a revertible edit should include the target SharedTree in its arguments.'\n\t\t\t\t\t)\n\t\t\t\t)\n\t\t\t);\n\t\t}\n\t};\n}\n\n/**\n * Tracks a change on a shared tree and allows reverting it\n */\nexport class SharedTreeRevertible implements IRevertible {\n\tconstructor(private editId: EditId, private readonly tree: SharedTree) {}\n\n\tpublic revert() {\n\t\tconst editIndex = this.tree.edits.getIndexOfId(this.editId);\n\t\tconst edit = this.tree.edits.getEditInSessionAtIndex(editIndex);\n\t\tconst snapshotBefore = this.tree.logViewer.getSnapshotInSession(editIndex);\n\n\t\t// Apply the revert edit and set it as the new revertible edit.\n\t\tthis.editId = this.tree.editor.revert(edit, snapshotBefore);\n\t}\n\n\tpublic discard() {\n\t\treturn;\n\t}\n}\n"]}

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

@@ -1,13 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { SharedTree, SharedTreeEditor } from './SharedTree';
-export { ChangeType, Change, Build, Insert, Detach, SetValue, Constraint, ConstraintEffect, Delete, Move, StablePlace, StableRange, getNodeId, } from './PersistedTypes';
-export * from './Factory';
-export * from './HistoryEditFactory';
-export * from './EditUtilities';
-export { Transaction } from './Transaction';
-export { noHistorySummarizer } from './Summary';
-export { SharedTreeUndoRedoHandler } from './UndoRedoHandler';
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/default-edits/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC5D,OAAO,EACN,UAAU,EACV,MAAM,EACN,KAAK,EACL,MAAM,EACN,MAAM,EACN,QAAQ,EACR,UAAU,EACV,gBAAgB,EAChB,MAAM,EACN,IAAI,EACJ,WAAW,EACX,WAAW,EACX,SAAS,GACT,MAAM,kBAAkB,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,iBAAiB,CAAC;AAChC,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAChD,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC"}

package/lib/default-edits/index.js

@@ -1,14 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// API Exports
-export { SharedTree, SharedTreeEditor } from './SharedTree';
-export { ChangeType, Change, Insert, ConstraintEffect, Delete, Move, StablePlace, StableRange, getNodeId, } from './PersistedTypes';
-export * from './Factory';
-export * from './HistoryEditFactory';
-export * from './EditUtilities';
-export { Transaction } from './Transaction';
-export { noHistorySummarizer } from './Summary';
-export { SharedTreeUndoRedoHandler } from './UndoRedoHandler';
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/default-edits/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc;AAEd,OAAO,EAAE,UAAU,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AAC5D,OAAO,EACN,UAAU,EACV,MAAM,EAEN,MAAM,EAIN,gBAAgB,EAChB,MAAM,EACN,IAAI,EACJ,WAAW,EACX,WAAW,EACX,SAAS,GACT,MAAM,kBAAkB,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,sBAAsB,CAAC;AACrC,cAAc,iBAAiB,CAAC;AAChC,OAAO,EAAE,WAAW,EAAE,MAAM,eAAe,CAAC;AAC5C,OAAO,EAAE,mBAAmB,EAAE,MAAM,WAAW,CAAC;AAChD,OAAO,EAAE,yBAAyB,EAAE,MAAM,mBAAmB,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\n// API Exports\n\nexport { SharedTree, SharedTreeEditor } from './SharedTree';\nexport {\n\tChangeType,\n\tChange,\n\tBuild,\n\tInsert,\n\tDetach,\n\tSetValue,\n\tConstraint,\n\tConstraintEffect,\n\tDelete,\n\tMove,\n\tStablePlace,\n\tStableRange,\n\tgetNodeId,\n} from './PersistedTypes';\nexport * from './Factory';\nexport * from './HistoryEditFactory';\nexport * from './EditUtilities';\nexport { Transaction } from './Transaction';\nexport { noHistorySummarizer } from './Summary';\nexport { SharedTreeUndoRedoHandler } from './UndoRedoHandler';\n"]}

package/lib/generic/GenericEditUtilities.d.ts

@@ -1,26 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { EditId } from '../Identifiers';
-import { Edit, TraitLocation } from './PersistedTypes';
-/**
- * Functions for constructing and comparing Edits.
- */
-/**
- * Returns true if the provided Edits have equivalent properties.
- */
-export declare function compareEdits(editIdA: EditId, editIdB: EditId): boolean;
-/**
- * Check if two TraitLocations are equal.
- */
-export declare function compareTraits(traitA: TraitLocation, traitB: TraitLocation): boolean;
-/**
- * Generates a new edit object from the supplied changes.
- */
-export declare function newEdit<TEdit>(changes: readonly TEdit[]): Edit<TEdit>;
-/**
- * Generates a new edit object from the supplied changes.
- */
-export declare function newEditId(): EditId;
-//# sourceMappingURL=GenericEditUtilities.d.ts.map

package/lib/generic/GenericEditUtilities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"GenericEditUtilities.d.ts","sourceRoot":"","sources":["../../src/generic/GenericEditUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,MAAM,kBAAkB,CAAC;AAEvD;;GAEG;AAEH;;GAEG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAItE;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,aAAa,EAAE,MAAM,EAAE,aAAa,GAAG,OAAO,CAMnF;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,CAErE;AAED;;GAEG;AACH,wBAAgB,SAAS,IAAI,MAAM,CAElC"}

package/lib/generic/GenericEditUtilities.js

@@ -1,38 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { v4 as uuidv4 } from 'uuid';
-/**
- * Functions for constructing and comparing Edits.
- */
-/**
- * Returns true if the provided Edits have equivalent properties.
- */
-export function compareEdits(editIdA, editIdB) {
-    // TODO #45414: We should also be deep comparing the list of changes in the edit. This is not straightforward.
-    // We can use our edit validation code when we write it since it will need to do deep walks of the changes.
-    return editIdA === editIdB;
-}
-/**
- * Check if two TraitLocations are equal.
- */
-export function compareTraits(traitA, traitB) {
-    if (traitA.label !== traitB.label || traitA.parent !== traitB.parent) {
-        return false;
-    }
-    return true;
-}
-/**
- * Generates a new edit object from the supplied changes.
- */
-export function newEdit(changes) {
-    return { id: newEditId(), changes };
-}
-/**
- * Generates a new edit object from the supplied changes.
- */
-export function newEditId() {
-    return uuidv4();
-}
-//# sourceMappingURL=GenericEditUtilities.js.map

package/lib/generic/GenericEditUtilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"GenericEditUtilities.js","sourceRoot":"","sources":["../../src/generic/GenericEditUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,EAAE,IAAI,MAAM,EAAE,MAAM,MAAM,CAAC;AAIpC;;GAEG;AAEH;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe,EAAE,OAAe;IAC5D,8GAA8G;IAC9G,2GAA2G;IAC3G,OAAO,OAAO,KAAK,OAAO,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,MAAqB,EAAE,MAAqB;IACzE,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;;GAEG;AACH,MAAM,UAAU,OAAO,CAAQ,OAAyB;IACvD,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,CAAC;AACrC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS;IACxB,OAAO,MAAM,EAAY,CAAC;AAC3B,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { v4 as uuidv4 } from 'uuid';\nimport { EditId } from '../Identifiers';\nimport { Edit, TraitLocation } from './PersistedTypes';\n\n/**\n * Functions for constructing and comparing Edits.\n */\n\n/**\n * Returns true if the provided Edits have equivalent properties.\n */\nexport function compareEdits(editIdA: EditId, editIdB: EditId): boolean {\n\t// TODO #45414: We should also be deep comparing the list of changes in the edit. This is not straightforward.\n\t// We can use our edit validation code when we write it since it will need to do deep walks of the changes.\n\treturn editIdA === editIdB;\n}\n\n/**\n * Check if two TraitLocations are equal.\n */\nexport function 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 * Generates a new edit object from the supplied changes.\n */\nexport function newEdit<TEdit>(changes: readonly TEdit[]): Edit<TEdit> {\n\treturn { id: newEditId(), changes };\n}\n\n/**\n * Generates a new edit object from the supplied changes.\n */\nexport function newEditId(): EditId {\n\treturn uuidv4() as EditId;\n}\n"]}