@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/lib/Snapshot.js

@@ -1,263 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { assert, copyPropertyIfDefined, fail } from './Common';
-import { getChangeNodeFromSnapshot } from './SnapshotUtilities';
-import { Forest } from './Forest';
-/**
- * Defines a place relative to sibling.
- * The "outside" of a trait is the `undefined` sibling,
- * so After `undefined` is the beginning of the trait, and before `undefined` is the end.
- *
- * For this purpose, traits look like:
- *
- * `{undefined} - {Node 0} - {Node 1} - ... - {Node N} - {undefined}`
- *
- * Each `{value}` in the diagram is a possible sibling, which is either a Node or undefined.
- * Each `-` in the above diagram is a `Place`, and can be describe as being `After` a particular `{sibling}` or `Before` it.
- * This means that `After` `{undefined}` means the same `Place` as before the first node
- * and `Before` `{undefined}` means the `Place` after the last Node.
- *
- * Each place can be specified, (aka 'anchored') in two ways (relative to the sibling before or after):
- * the choice of which way to anchor a place only matters when the kept across an edit, and thus evaluated in multiple contexts where the
- * two place description may no longer evaluate to the same place.
- * @public
- */
-export var Side;
-(function (Side) {
-    Side[Side["Before"] = 0] = "Before";
-    Side[Side["After"] = 1] = "After";
-})(Side || (Side = {}));
-/**
- * An immutable view of a distributed tree.
- * @public
- */
-export class Snapshot {
-    constructor(root, forest) {
-        this.root = root;
-        this.forest = forest;
-    }
-    /**
-     * Constructs a Snapshot using the supplied tree.
-     * @param root - the root of the tree to use as the contents of the `Snapshot`
-     */
-    static fromTree(root, expensiveValidation = false) {
-        function insertNodeRecursive(node, newSnapshotNodes) {
-            const { identifier, definition } = 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 element = node.traits[key];
-                    if (element.length > 0) {
-                        traits.set(key, element.map((n) => insertNodeRecursive(n, newSnapshotNodes)));
-                    }
-                }
-            }
-            const snapshotNode = { identifier, definition, traits };
-            copyPropertyIfDefined(node, snapshotNode, 'payload');
-            assert(!newSnapshotNodes.has(identifier), `duplicate node in tree for snapshot: { identifier: ${identifier}, definition: ${definition}`);
-            newSnapshotNodes.set(snapshotNode.identifier, snapshotNode);
-            return snapshotNode.identifier;
-        }
-        const map = new Map();
-        return new Snapshot(insertNodeRecursive(root, map), Forest.create(expensiveValidation).add(map.values()));
-    }
-    /** Return a tree of JSON-compatible `ChangeNode`s representing the current state of this `Snapshot` */
-    getChangeNodeTree() {
-        return getChangeNodeFromSnapshot(this, this.root);
-    }
-    /**
-     * Returns the number of nodes in this `Snapshot`
-     */
-    get size() {
-        return this.forest.size;
-    }
-    /**
-     * @returns true iff the nodeId exists.
-     */
-    hasNode(id) {
-        return this.forest.tryGet(id) !== undefined;
-    }
-    /**
-     * @returns a `ChangeNode` derived from the `SnapshotNode` in this snapshot with the given `NodeId`.
-     */
-    getChangeNode(id) {
-        return getChangeNodeFromSnapshot(this, id);
-    }
-    /**
-     * @returns the `ChangeNode`s derived from the `SnapshotNode`s in this snapshot with the given `NodeId`s.
-     */
-    getChangeNodes(nodeIds) {
-        return nodeIds.map((id) => this.getChangeNode(id));
-    }
-    /**
-     * Asserts the forest is in a consistent state.
-     */
-    assertConsistent() {
-        this.forest.assertConsistent();
-    }
-    /**
-     * Inserts all nodes in a NodeSequence into the forest.
-     */
-    addNodes(sequence) {
-        return new Snapshot(this.root, this.forest.add(sequence));
-    }
-    /**
-     * Remove all nodes with the given ids from the forest
-     */
-    deleteNodes(nodes) {
-        return new Snapshot(this.root, this.forest.delete(nodes, true));
-    }
-    /**
-     * Parents a set of detached nodes at a specified place.
-     * @param nodesToAttach - the nodes to parent in the specified place. The nodes must already be present in the Snapshot.
-     * @param place - the location to insert the nodes.
-     */
-    attachRange(nodesToAttach, place) {
-        const { parent, label } = place.trait;
-        const index = this.findIndexWithinTrait(place);
-        return new Snapshot(this.root, this.forest.attachRangeOfChildren(parent, label, index, nodesToAttach));
-    }
-    /**
-     * Detaches a range of nodes from their parent. The detached nodes remain in the Snapshot.
-     * @param rangeToDetach - the range of nodes to detach
-     */
-    detachRange(rangeToDetach) {
-        const { start, end } = rangeToDetach;
-        const { trait: traitLocation } = start;
-        const { parent, label } = traitLocation;
-        const startIndex = this.findIndexWithinTrait(start);
-        const endIndex = this.findIndexWithinTrait(end);
-        const { forest, detached } = this.forest.detachRangeOfChildren(parent, label, startIndex, endIndex);
-        return { snapshot: new Snapshot(this.root, forest), detached };
-    }
-    /**
-     * Sets a node's value. The node must exist in this `Snapshot`.
-     * @param nodeId - the id of the node
-     * @param value - the new value
-     */
-    setNodeValue(nodeId, value) {
-        return new Snapshot(this.root, this.forest.setValue(nodeId, value));
-    }
-    /**
-     * @returns the index just after place (which specifies a location between items).
-     * Performance note: this is O(siblings in trait).
-     */
-    findIndexWithinTrait(place) {
-        if (place.sibling === undefined) {
-            return this.getIndexOfSide(place.side, place.trait);
-        }
-        return getIndex(place.side, this.getIndexInTrait(place.sibling));
-    }
-    /**
-     * Returns the node associated with `id` in this `Snapshot`.
-     */
-    getSnapshotNode(id) {
-        return this.forest.get(id);
-    }
-    /**
-     * Returns the label of the trait that a node is under. Returns undefined if the node is not present or if it is the root node.
-     */
-    getTraitLabel(id) {
-        var _a;
-        return (_a = this.forest.tryGetParent(id)) === null || _a === void 0 ? void 0 : _a.traitParent;
-    }
-    /**
-     * Returns the parent of a node. Returns undefined if the node does not exist in the snapshot or if it does not have a parent.
-     */
-    getParentSnapshotNode(id) {
-        const parentInfo = this.forest.tryGetParent(id);
-        if (parentInfo === undefined) {
-            return undefined;
-        }
-        return this.getSnapshotNode(parentInfo.parentId);
-    }
-    /**
-     * @param node - must have a parent.
-     */
-    getTraitLocation(node) {
-        const parentData = this.forest.getParent(node);
-        assert(parentData !== undefined, 'node must have parent');
-        return {
-            parent: parentData.parentId,
-            label: parentData.traitParent,
-        };
-    }
-    /**
-     * @param node - must have a parent.
-     * Performance note: this is O(siblings in trait).
-     */
-    getIndexInTrait(node) {
-        var _a;
-        if (this.traitIndicesCache === undefined) {
-            this.traitIndicesCache = new Map();
-        }
-        else {
-            const cached = this.traitIndicesCache.get(node);
-            if (cached !== undefined) {
-                return cached;
-            }
-        }
-        const parentData = this.forest.getParent(node);
-        const parent = this.forest.get(parentData.parentId);
-        const traitParent = (_a = parent.traits.get(parentData.traitParent)) !== null && _a !== void 0 ? _a : fail('invalid parentData: trait parent not found.');
-        let foundIndex = -1;
-        for (let i = 0; i < traitParent.length; i++) {
-            const nodeInTrait = traitParent[i];
-            const index = i;
-            this.traitIndicesCache.set(nodeInTrait, index);
-            if (nodeInTrait === node) {
-                foundIndex = index;
-            }
-        }
-        return foundIndex !== -1 ? foundIndex : fail('invalidParentData: node not found in specified trait');
-    }
-    /**
-     * Return a trait given its location
-     * @param traitLocation - the location of the trait
-     */
-    getTrait(traitLocation) {
-        var _a;
-        return (_a = this.getSnapshotNode(traitLocation.parent).traits.get(traitLocation.label)) !== null && _a !== void 0 ? _a : [];
-    }
-    getIndexOfSide(side, traitLocation) {
-        return side === Side.After ? 0 : this.getTrait(traitLocation).length;
-    }
-    /** Compares this snapshot to another for equality. */
-    equals(snapshot) {
-        if (this.root !== snapshot.root) {
-            return false;
-        }
-        // TODO:#49100:Perf: make this faster and/or remove use by PrefetchingCheckout.
-        return this.forest.equals(snapshot.forest);
-    }
-    *iterateNodeDescendants(nodeId) {
-        const node = this.getSnapshotNode(nodeId);
-        yield node;
-        for (const trait of node.traits.values()) {
-            for (const childId of trait) {
-                yield* this.iterateNodeDescendants(childId);
-            }
-        }
-    }
-    /**
-     * Calculate the difference between two `Snapshot`s
-     * @param snapshot - the other snapshot to compare to this one
-     * @returns A {@link Delta} which nodes must be changed, added, and removed to get from `this` to `snapshot`.
-     * The snapshots must share a root.
-     */
-    delta(snapshot) {
-        assert(this.root === snapshot.root, 'Delta can only be calculated between snapshots that share a root');
-        return this.forest.delta(snapshot.forest);
-    }
-    [Symbol.iterator]() {
-        return this.iterateNodeDescendants(this.root);
-    }
-}
-function getIndex(side, index) {
-    // eslint-disable-next-line @typescript-eslint/restrict-plus-operands
-    return (side + index);
-}
-//# sourceMappingURL=Snapshot.js.map

package/lib/Snapshot.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Snapshot.js","sourceRoot":"","sources":["../src/Snapshot.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,qBAAqB,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAE/D,OAAO,EAAE,yBAAyB,EAAE,MAAM,qBAAqB,CAAC;AAChE,OAAO,EAAS,MAAM,EAAE,MAAM,UAAU,CAAC;AAwCzC;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAN,IAAY,IAGX;AAHD,WAAY,IAAI;IACf,mCAAU,CAAA;IACV,iCAAS,CAAA;AACV,CAAC,EAHW,IAAI,KAAJ,IAAI,QAGf;AAYD;;;GAGG;AACH,MAAM,OAAO,QAAQ;IA8CpB,YAAoB,IAAY,EAAE,MAAc;QAC/C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACtB,CAAC;IAtCD;;;OAGG;IACI,MAAM,CAAC,QAAQ,CAAC,IAAgB,EAAE,mBAAmB,GAAG,KAAK;QACnE,SAAS,mBAAmB,CAAC,IAAgB,EAAE,gBAA2C;YACzF,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC;YACxC,MAAM,MAAM,GAAuC,IAAI,GAAG,EAAE,CAAC;YAE7D,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,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACjC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;wBACvB,MAAM,CAAC,GAAG,CACT,GAAiB,EACjB,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,CAAC,EAAE,gBAAgB,CAAC,CAAC,CAC5D,CAAC;qBACF;iBACD;aACD;YACD,MAAM,YAAY,GAAiB,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;YACtE,qBAAqB,CAAC,IAAI,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;YACrD,MAAM,CACL,CAAC,gBAAgB,CAAC,GAAG,CAAC,UAAU,CAAC,EACjC,sDAAsD,UAAU,iBAAiB,UAAU,EAAE,CAC7F,CAAC;YACF,gBAAgB,CAAC,GAAG,CAAC,YAAY,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;YAC5D,OAAO,YAAY,CAAC,UAAU,CAAC;QAChC,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,GAAG,EAAwB,CAAC;QAC5C,OAAO,IAAI,QAAQ,CAAC,mBAAmB,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3G,CAAC;IAOD,uGAAuG;IAChG,iBAAiB;QACvB,OAAO,yBAAyB,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,IAAW,IAAI;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,EAAU;QACxB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,SAAS,CAAC;IAC7C,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,EAAU;QAC9B,OAAO,yBAAyB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC5C,CAAC;IAED;;OAEG;IACI,cAAc,CAAC,OAA0B;QAC/C,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACI,gBAAgB;QACtB,IAAI,CAAC,MAAM,CAAC,gBAAgB,EAAE,CAAC;IAChC,CAAC;IAED;;OAEG;IACI,QAAQ,CAAC,QAAgC;QAC/C,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACI,WAAW,CAAC,KAAuB;QACzC,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IACjE,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,aAAgC,EAAE,KAAoB;QACxE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC/C,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC;IACxG,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,aAA4B;QAC9C,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,aAAa,CAAC;QACrC,MAAM,EAAE,KAAK,EAAE,aAAa,EAAE,GAAG,KAAK,CAAC;QACvC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,aAAa,CAAC;QACxC,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAChD,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QACpG,OAAO,EAAE,QAAQ,EAAE,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,QAAQ,EAAE,CAAC;IAChE,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,MAAc,EAAE,KAAc;QACjD,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IACrE,CAAC;IAED;;;OAGG;IACI,oBAAoB,CAAC,KAAoB;QAC/C,IAAI,KAAK,CAAC,OAAO,KAAK,SAAS,EAAE;YAChC,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;SACpD;QACD,OAAO,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IAClE,CAAC;IAED;;OAEG;IACI,eAAe,CAAC,EAAU;QAChC,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAC5B,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,EAAU;;QAC9B,aAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,0CAAE,WAAW,CAAC;IAClD,CAAC;IAED;;OAEG;IACI,qBAAqB,CAAC,EAAU;QACtC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAChD,IAAI,UAAU,KAAK,SAAS,EAAE;YAC7B,OAAO,SAAS,CAAC;SACjB;QACD,OAAO,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC;IAED;;OAEG;IACI,gBAAgB,CAAC,IAAY;QACnC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE,uBAAuB,CAAC,CAAC;QAC1D,OAAO;YACN,MAAM,EAAE,UAAU,CAAC,QAAQ;YAC3B,KAAK,EAAE,UAAU,CAAC,WAAW;SAC7B,CAAC;IACH,CAAC;IAED;;;OAGG;IACI,eAAe,CAAC,IAAY;;QAClC,IAAI,IAAI,CAAC,iBAAiB,KAAK,SAAS,EAAE;YACzC,IAAI,CAAC,iBAAiB,GAAG,IAAI,GAAG,EAAE,CAAC;SACnC;aAAM;YACN,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAChD,IAAI,MAAM,KAAK,SAAS,EAAE;gBACzB,OAAO,MAAM,CAAC;aACd;SACD;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACpD,MAAM,WAAW,SAChB,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,WAAW,CAAC,mCAAI,IAAI,CAAC,6CAA6C,CAAC,CAAC;QAClG,IAAI,UAAU,GAAG,CAAC,CAAmB,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC5C,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,CAAmB,CAAC;YAClC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;YAC/C,IAAI,WAAW,KAAK,IAAI,EAAE;gBACzB,UAAU,GAAG,KAAK,CAAC;aACnB;SACD;QACD,OAAO,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,sDAAsD,CAAC,CAAC;IACtG,CAAC;IAED;;;OAGG;IACI,QAAQ,CAAC,aAA4B;;QAC3C,aAAO,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,aAAa,CAAC,KAAK,CAAC,mCAAI,EAAE,CAAC;IACzF,CAAC;IAEO,cAAc,CAAC,IAAU,EAAE,aAA4B;QAC9D,OAAO,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAgB,CAAC,CAAC,CAAE,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,MAAqB,CAAC;IACtG,CAAC;IAED,sDAAsD;IAC/C,MAAM,CAAC,QAAkB;QAC/B,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE;YAChC,OAAO,KAAK,CAAC;SACb;QAED,+EAA+E;QAC/E,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IAEO,CAAC,sBAAsB,CAAC,MAAc;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC1C,MAAM,IAAI,CAAC;QACX,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE;YACzC,KAAK,MAAM,OAAO,IAAI,KAAK,EAAE;gBAC5B,KAAK,CAAC,CAAC,IAAI,CAAC,sBAAsB,CAAC,OAAO,CAAC,CAAC;aAC5C;SACD;IACF,CAAC;IAED;;;;;OAKG;IACI,KAAK,CAAC,QAAkB;QAC9B,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,kEAAkE,CAAC,CAAC;QACxG,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAEM,CAAC,MAAM,CAAC,QAAQ,CAAC;QACvB,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/C,CAAC;CACD;AAED,SAAS,QAAQ,CAAC,IAAU,EAAE,KAAqB;IAClD,qEAAqE;IACrE,OAAO,CAAC,IAAI,GAAG,KAAK,CAAe,CAAC;AACrC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { assert, copyPropertyIfDefined, fail } from './Common';\nimport { NodeId, TraitLabel } from './Identifiers';\nimport { getChangeNodeFromSnapshot } from './SnapshotUtilities';\nimport { Delta, Forest } from './Forest';\nimport { ChangeNode, NodeData, Payload, TraitLocation } from './generic';\n\n/**\n * An immutable view of a distributed tree node.\n * @public\n */\nexport interface SnapshotNode extends NodeData {\n\treadonly traits: ReadonlyMap<TraitLabel, readonly NodeId[]>;\n}\n\n/**\n * Index of a place within a trait.\n * 0 = before all nodes,\n * 1 = after first node,\n * etc.\n * @public\n */\nexport type PlaceIndex = number & { readonly PlaceIndex: unique symbol };\n\n/**\n * Index of a node within a trait.\n * 0 = first node,\n * 1 = second node,\n * etc.\n * @public\n */\nexport type TraitNodeIndex = number & { readonly TraitNodeIndex: unique symbol };\n\n/**\n * A place within a particular `Snapshot` that is anchored relative to a specific node in the tree, or relative to the outside of the trait.\n * Valid iff 'trait' is valid and, if provided, sibling is in the Location specified by 'trait'.\n * @public\n */\nexport interface SnapshotPlace {\n\treadonly sibling?: NodeId;\n\treadonly side: Side;\n\treadonly trait: TraitLocation;\n}\n\n/**\n * Defines a place relative to sibling.\n * The \"outside\" of a trait is the `undefined` sibling,\n * so After `undefined` is the beginning of the trait, and before `undefined` is the end.\n *\n * For this purpose, traits look like:\n *\n * `{undefined} - {Node 0} - {Node 1} - ... - {Node N} - {undefined}`\n *\n * Each `{value}` in the diagram is a possible sibling, which is either a Node or undefined.\n * Each `-` in the above diagram is a `Place`, and can be describe as being `After` a particular `{sibling}` or `Before` it.\n * This means that `After` `{undefined}` means the same `Place` as before the first node\n * and `Before` `{undefined}` means the `Place` after the last Node.\n *\n * Each place can be specified, (aka 'anchored') in two ways (relative to the sibling before or after):\n * the choice of which way to anchor a place only matters when the kept across an edit, and thus evaluated in multiple contexts where the\n * two place description may no longer evaluate to the same place.\n * @public\n */\nexport enum Side {\n\tBefore = 0,\n\tAfter = 1,\n}\n\n/**\n * Specifies the range of nodes from `start` to `end` within a trait within a particular `Snapshot`.\n * Valid iff start and end are valid and are withing the same trait.\n * @public\n */\nexport interface SnapshotRange {\n\treadonly start: SnapshotPlace;\n\treadonly end: SnapshotPlace;\n}\n\n/**\n * An immutable view of a distributed tree.\n * @public\n */\nexport class Snapshot {\n\tpublic readonly root: NodeId;\n\tprivate readonly forest: Forest;\n\n\t/**\n\t * A cache of node's index within their parent trait.\n\t * Used to avoid redundant linear scans of traits.\n\t * Not shared across snapshots; initialized to empty each time a Snapshot is created.\n\t */\n\tprivate traitIndicesCache?: Map<NodeId, TraitNodeIndex>;\n\n\t/**\n\t * Constructs a Snapshot using the supplied tree.\n\t * @param root - the root of the tree to use as the contents of the `Snapshot`\n\t */\n\tpublic static fromTree(root: ChangeNode, expensiveValidation = false): Snapshot {\n\t\tfunction insertNodeRecursive(node: ChangeNode, newSnapshotNodes: Map<NodeId, SnapshotNode>): NodeId {\n\t\t\tconst { identifier, definition } = node;\n\t\t\tconst traits: Map<TraitLabel, readonly NodeId[]> = new Map();\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 element = node.traits[key];\n\t\t\t\t\tif (element.length > 0) {\n\t\t\t\t\t\ttraits.set(\n\t\t\t\t\t\t\tkey as TraitLabel,\n\t\t\t\t\t\t\telement.map((n) => insertNodeRecursive(n, newSnapshotNodes))\n\t\t\t\t\t\t);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst snapshotNode: SnapshotNode = { identifier, definition, traits };\n\t\t\tcopyPropertyIfDefined(node, snapshotNode, 'payload');\n\t\t\tassert(\n\t\t\t\t!newSnapshotNodes.has(identifier),\n\t\t\t\t`duplicate node in tree for snapshot: { identifier: ${identifier}, definition: ${definition}`\n\t\t\t);\n\t\t\tnewSnapshotNodes.set(snapshotNode.identifier, snapshotNode);\n\t\t\treturn snapshotNode.identifier;\n\t\t}\n\n\t\tconst map = new Map<NodeId, SnapshotNode>();\n\t\treturn new Snapshot(insertNodeRecursive(root, map), Forest.create(expensiveValidation).add(map.values()));\n\t}\n\n\tprivate constructor(root: NodeId, forest: Forest) {\n\t\tthis.root = root;\n\t\tthis.forest = forest;\n\t}\n\n\t/** Return a tree of JSON-compatible `ChangeNode`s representing the current state of this `Snapshot` */\n\tpublic getChangeNodeTree(): ChangeNode {\n\t\treturn getChangeNodeFromSnapshot(this, this.root);\n\t}\n\n\t/**\n\t * Returns the number of nodes in this `Snapshot`\n\t */\n\tpublic get size(): number {\n\t\treturn this.forest.size;\n\t}\n\n\t/**\n\t * @returns true iff the nodeId exists.\n\t */\n\tpublic hasNode(id: NodeId): boolean {\n\t\treturn this.forest.tryGet(id) !== undefined;\n\t}\n\n\t/**\n\t * @returns a `ChangeNode` derived from the `SnapshotNode` in this snapshot with the given `NodeId`.\n\t */\n\tpublic getChangeNode(id: NodeId): ChangeNode {\n\t\treturn getChangeNodeFromSnapshot(this, id);\n\t}\n\n\t/**\n\t * @returns the `ChangeNode`s derived from the `SnapshotNode`s in this snapshot with the given `NodeId`s.\n\t */\n\tpublic getChangeNodes(nodeIds: readonly NodeId[]): ChangeNode[] {\n\t\treturn nodeIds.map((id) => this.getChangeNode(id));\n\t}\n\n\t/**\n\t * Asserts the forest is in a consistent state.\n\t */\n\tpublic assertConsistent(): void {\n\t\tthis.forest.assertConsistent();\n\t}\n\n\t/**\n\t * Inserts all nodes in a NodeSequence into the forest.\n\t */\n\tpublic addNodes(sequence: Iterable<SnapshotNode>): Snapshot {\n\t\treturn new Snapshot(this.root, this.forest.add(sequence));\n\t}\n\n\t/**\n\t * Remove all nodes with the given ids from the forest\n\t */\n\tpublic deleteNodes(nodes: Iterable<NodeId>): Snapshot {\n\t\treturn new Snapshot(this.root, this.forest.delete(nodes, true));\n\t}\n\n\t/**\n\t * Parents a set of detached nodes at a specified place.\n\t * @param nodesToAttach - the nodes to parent in the specified place. The nodes must already be present in the Snapshot.\n\t * @param place - the location to insert the nodes.\n\t */\n\tpublic attachRange(nodesToAttach: readonly NodeId[], place: SnapshotPlace): Snapshot {\n\t\tconst { parent, label } = place.trait;\n\t\tconst index = this.findIndexWithinTrait(place);\n\t\treturn new Snapshot(this.root, this.forest.attachRangeOfChildren(parent, label, index, nodesToAttach));\n\t}\n\n\t/**\n\t * Detaches a range of nodes from their parent. The detached nodes remain in the Snapshot.\n\t * @param rangeToDetach - the range of nodes to detach\n\t */\n\tpublic detachRange(rangeToDetach: SnapshotRange): { snapshot: Snapshot; detached: readonly NodeId[] } {\n\t\tconst { start, end } = rangeToDetach;\n\t\tconst { trait: traitLocation } = start;\n\t\tconst { parent, label } = traitLocation;\n\t\tconst startIndex = this.findIndexWithinTrait(start);\n\t\tconst endIndex = this.findIndexWithinTrait(end);\n\t\tconst { forest, detached } = this.forest.detachRangeOfChildren(parent, label, startIndex, endIndex);\n\t\treturn { snapshot: new Snapshot(this.root, forest), detached };\n\t}\n\n\t/**\n\t * Sets a node's value. The node must exist in this `Snapshot`.\n\t * @param nodeId - the id of the node\n\t * @param value - the new value\n\t */\n\tpublic setNodeValue(nodeId: NodeId, value: Payload): Snapshot {\n\t\treturn new Snapshot(this.root, this.forest.setValue(nodeId, value));\n\t}\n\n\t/**\n\t * @returns the index just after place (which specifies a location between items).\n\t * Performance note: this is O(siblings in trait).\n\t */\n\tpublic findIndexWithinTrait(place: SnapshotPlace): PlaceIndex {\n\t\tif (place.sibling === undefined) {\n\t\t\treturn this.getIndexOfSide(place.side, place.trait);\n\t\t}\n\t\treturn getIndex(place.side, this.getIndexInTrait(place.sibling));\n\t}\n\n\t/**\n\t * Returns the node associated with `id` in this `Snapshot`.\n\t */\n\tpublic getSnapshotNode(id: NodeId): SnapshotNode {\n\t\treturn this.forest.get(id);\n\t}\n\n\t/**\n\t * Returns the label of the trait that a node is under. Returns undefined if the node is not present or if it is the root node.\n\t */\n\tpublic getTraitLabel(id: NodeId): TraitLabel | undefined {\n\t\treturn this.forest.tryGetParent(id)?.traitParent;\n\t}\n\n\t/**\n\t * Returns the parent of a node. Returns undefined if the node does not exist in the snapshot or if it does not have a parent.\n\t */\n\tpublic getParentSnapshotNode(id: NodeId): SnapshotNode | undefined {\n\t\tconst parentInfo = this.forest.tryGetParent(id);\n\t\tif (parentInfo === undefined) {\n\t\t\treturn undefined;\n\t\t}\n\t\treturn this.getSnapshotNode(parentInfo.parentId);\n\t}\n\n\t/**\n\t * @param node - must have a parent.\n\t */\n\tpublic getTraitLocation(node: NodeId): TraitLocation {\n\t\tconst parentData = this.forest.getParent(node);\n\t\tassert(parentData !== undefined, 'node must have parent');\n\t\treturn {\n\t\t\tparent: parentData.parentId,\n\t\t\tlabel: parentData.traitParent,\n\t\t};\n\t}\n\n\t/**\n\t * @param node - must have a parent.\n\t * Performance note: this is O(siblings in trait).\n\t */\n\tpublic getIndexInTrait(node: NodeId): TraitNodeIndex {\n\t\tif (this.traitIndicesCache === undefined) {\n\t\t\tthis.traitIndicesCache = new Map();\n\t\t} else {\n\t\t\tconst cached = this.traitIndicesCache.get(node);\n\t\t\tif (cached !== undefined) {\n\t\t\t\treturn cached;\n\t\t\t}\n\t\t}\n\t\tconst parentData = this.forest.getParent(node);\n\t\tconst parent = this.forest.get(parentData.parentId);\n\t\tconst traitParent =\n\t\t\tparent.traits.get(parentData.traitParent) ?? fail('invalid parentData: trait parent not found.');\n\t\tlet foundIndex = -1 as TraitNodeIndex;\n\t\tfor (let i = 0; i < traitParent.length; i++) {\n\t\t\tconst nodeInTrait = traitParent[i];\n\t\t\tconst index = i as TraitNodeIndex;\n\t\t\tthis.traitIndicesCache.set(nodeInTrait, index);\n\t\t\tif (nodeInTrait === node) {\n\t\t\t\tfoundIndex = index;\n\t\t\t}\n\t\t}\n\t\treturn foundIndex !== -1 ? foundIndex : fail('invalidParentData: node not found in specified trait');\n\t}\n\n\t/**\n\t * Return a trait given its location\n\t * @param traitLocation - the location of the trait\n\t */\n\tpublic getTrait(traitLocation: TraitLocation): readonly NodeId[] {\n\t\treturn this.getSnapshotNode(traitLocation.parent).traits.get(traitLocation.label) ?? [];\n\t}\n\n\tprivate getIndexOfSide(side: Side, traitLocation: TraitLocation): PlaceIndex {\n\t\treturn side === Side.After ? (0 as PlaceIndex) : (this.getTrait(traitLocation).length as PlaceIndex);\n\t}\n\n\t/** Compares this snapshot to another for equality. */\n\tpublic equals(snapshot: Snapshot): boolean {\n\t\tif (this.root !== snapshot.root) {\n\t\t\treturn false;\n\t\t}\n\n\t\t// TODO:#49100:Perf: make this faster and/or remove use by PrefetchingCheckout.\n\t\treturn this.forest.equals(snapshot.forest);\n\t}\n\n\tprivate *iterateNodeDescendants(nodeId: NodeId): IterableIterator<SnapshotNode> {\n\t\tconst node = this.getSnapshotNode(nodeId);\n\t\tyield node;\n\t\tfor (const trait of node.traits.values()) {\n\t\t\tfor (const childId of trait) {\n\t\t\t\tyield* this.iterateNodeDescendants(childId);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Calculate the difference between two `Snapshot`s\n\t * @param snapshot - the other snapshot to compare to this one\n\t * @returns A {@link Delta} which nodes must be changed, added, and removed to get from `this` to `snapshot`.\n\t * The snapshots must share a root.\n\t */\n\tpublic delta(snapshot: Snapshot): Delta<NodeId> {\n\t\tassert(this.root === snapshot.root, 'Delta can only be calculated between snapshots that share a root');\n\t\treturn this.forest.delta(snapshot.forest);\n\t}\n\n\tpublic [Symbol.iterator](): IterableIterator<SnapshotNode> {\n\t\treturn this.iterateNodeDescendants(this.root);\n\t}\n}\n\nfunction getIndex(side: Side, index: TraitNodeIndex): PlaceIndex {\n\t// eslint-disable-next-line @typescript-eslint/restrict-plus-operands\n\treturn (side + index) as PlaceIndex;\n}\n\n/**\n * Contains some redundant information. Use only in computations between edits. Do not store.\n * @public\n */\nexport interface NodeInTrait {\n\treadonly trait: TraitLocation;\n\treadonly index: TraitNodeIndex;\n}\n"]}

package/lib/SnapshotUtilities.d.ts

@@ -1,29 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { NodeId } from './Identifiers';
-import { ChangeNode } from './generic';
-import { Snapshot } from './Snapshot';
-/**
- * Converts a node in a snapshot to an equivalent `ChangeNode`.
- * @param snapshot - the snapshot in which the node exists
- * @param nodeId - the id of the node in the snapshot
- * @param lazyTraits - whether or not traits should be populated lazily.
- * If lazy, the subtrees under each trait will not be read until the trait is first accessed.
- */
-export declare function getChangeNodeFromSnapshot(snapshot: Snapshot, nodeId: NodeId, lazyTraits?: boolean): ChangeNode;
-/**
- * Compares finite numbers to form a strict partial ordering.
- *
- * Handles +/-0 like Map: -0 is equal to +0.
- *
- * Once https://github.com/qwertie/btree-typescript/pull/15 is merged, we can use the version of this function from it.
- */
-export declare function compareFiniteNumbers(a: number, b: number): number;
-/**
- * Compares strings lexically to form a strict partial ordering.
- * Once https://github.com/qwertie/btree-typescript/pull/15 is merged, we can use the version of this function from it.
- */
-export declare function compareStrings(a: string, b: string): number;
-//# sourceMappingURL=SnapshotUtilities.d.ts.map

package/lib/SnapshotUtilities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"SnapshotUtilities.d.ts","sourceRoot":"","sources":["../src/SnapshotUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,MAAM,EAAc,MAAM,eAAe,CAAC;AACnD,OAAO,EAAE,UAAU,EAAY,MAAM,WAAW,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC;;;;;;GAMG;AACH,wBAAgB,yBAAyB,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,UAAQ,GAAG,UAAU,CAqB5G;AAgCD;;;;;;GAMG;AACH,wBAAgB,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAEjE;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAE3D"}

package/lib/SnapshotUtilities.js

@@ -1,67 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { copyPropertyIfDefined, memoizeGetter } from './Common';
-/**
- * Converts a node in a snapshot to an equivalent `ChangeNode`.
- * @param snapshot - the snapshot in which the node exists
- * @param nodeId - the id of the node in the snapshot
- * @param lazyTraits - whether or not traits should be populated lazily.
- * If lazy, the subtrees under each trait will not be read until the trait is first accessed.
- */
-export function getChangeNodeFromSnapshot(snapshot, nodeId, lazyTraits = false) {
-    const node = snapshot.getSnapshotNode(nodeId);
-    const nodeData = {
-        definition: node.definition,
-        identifier: node.identifier,
-    };
-    copyPropertyIfDefined(node, nodeData, 'payload');
-    if (lazyTraits) {
-        return Object.assign(Object.assign({}, nodeData), { get traits() {
-                return memoizeGetter(this, 'traits', makeTraits(snapshot, node.traits, lazyTraits));
-            } });
-    }
-    return Object.assign(Object.assign({}, nodeData), { traits: makeTraits(snapshot, node.traits, lazyTraits) });
-}
-/** Given the traits of a SnapshotNode, return the corresponding traits on a Node */
-function makeTraits(snapshot, traits, lazyTraits = false) {
-    const traitMap = {};
-    for (const [label, trait] of traits.entries()) {
-        if (lazyTraits) {
-            Object.defineProperty(traitMap, label, {
-                get() {
-                    const treeNodeTrait = trait.map((nodeId) => getChangeNodeFromSnapshot(snapshot, nodeId, lazyTraits));
-                    return memoizeGetter(this, label, treeNodeTrait);
-                },
-                configurable: true,
-                enumerable: true,
-            });
-        }
-        else {
-            Object.defineProperty(traitMap, label, {
-                value: trait.map((nodeId) => getChangeNodeFromSnapshot(snapshot, nodeId, lazyTraits)),
-                enumerable: true,
-            });
-        }
-    }
-    return traitMap;
-}
-/**
- * Compares finite numbers to form a strict partial ordering.
- *
- * Handles +/-0 like Map: -0 is equal to +0.
- *
- * Once https://github.com/qwertie/btree-typescript/pull/15 is merged, we can use the version of this function from it.
- */
-export function compareFiniteNumbers(a, b) {
-    return a - b;
-}
-/**
- * Compares strings lexically to form a strict partial ordering.
- * Once https://github.com/qwertie/btree-typescript/pull/15 is merged, we can use the version of this function from it.
- */
-export function compareStrings(a, b) {
-    return a > b ? 1 : a === b ? 0 : -1;
-}
-//# sourceMappingURL=SnapshotUtilities.js.map

package/lib/SnapshotUtilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"SnapshotUtilities.js","sourceRoot":"","sources":["../src/SnapshotUtilities.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,qBAAqB,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AAKhE;;;;;;GAMG;AACH,MAAM,UAAU,yBAAyB,CAAC,QAAkB,EAAE,MAAc,EAAE,UAAU,GAAG,KAAK;IAC/F,MAAM,IAAI,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;IAC9C,MAAM,QAAQ,GAAG;QAChB,UAAU,EAAE,IAAI,CAAC,UAAU;QAC3B,UAAU,EAAE,IAAI,CAAC,UAAU;KAC3B,CAAC;IACF,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IAEjD,IAAI,UAAU,EAAE;QACf,uCACI,QAAQ,KACX,IAAI,MAAM;gBACT,OAAO,aAAa,CAAC,IAAI,EAAE,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;YACrF,CAAC,IACA;KACF;IAED,uCACI,QAAQ,KACX,MAAM,EAAE,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,IACpD;AACH,CAAC;AAED,oFAAoF;AACpF,SAAS,UAAU,CAClB,QAAkB,EAClB,MAAkD,EAClD,UAAU,GAAG,KAAK;IAElB,MAAM,QAAQ,GAAG,EAAE,CAAC;IACpB,KAAK,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,EAAE,EAAE;QAC9C,IAAI,UAAU,EAAE;YACf,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE;gBACtC,GAAG;oBACF,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAC1C,yBAAyB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,CACvD,CAAC;oBACF,OAAO,aAAa,CAAC,IAA4B,EAAE,KAAK,EAAE,aAAa,CAAC,CAAC;gBAC1E,CAAC;gBACD,YAAY,EAAE,IAAI;gBAClB,UAAU,EAAE,IAAI;aAChB,CAAC,CAAC;SACH;aAAM;YACN,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,KAAK,EAAE;gBACtC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,yBAAyB,CAAC,QAAQ,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;gBACrF,UAAU,EAAE,IAAI;aAChB,CAAC,CAAC;SACH;KACD;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,oBAAoB,CAAC,CAAS,EAAE,CAAS;IACxD,OAAO,CAAC,GAAG,CAAC,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,CAAS,EAAE,CAAS;IAClD,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACrC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { copyPropertyIfDefined, memoizeGetter } from './Common';\nimport { NodeId, TraitLabel } from './Identifiers';\nimport { ChangeNode, TraitMap } from './generic';\nimport { Snapshot } from './Snapshot';\n\n/**\n * Converts a node in a snapshot to an equivalent `ChangeNode`.\n * @param snapshot - the snapshot in which the node exists\n * @param nodeId - the id of the node in the snapshot\n * @param lazyTraits - whether or not traits should be populated lazily.\n * If lazy, the subtrees under each trait will not be read until the trait is first accessed.\n */\nexport function getChangeNodeFromSnapshot(snapshot: Snapshot, nodeId: NodeId, lazyTraits = false): ChangeNode {\n\tconst node = snapshot.getSnapshotNode(nodeId);\n\tconst nodeData = {\n\t\tdefinition: node.definition,\n\t\tidentifier: node.identifier,\n\t};\n\tcopyPropertyIfDefined(node, nodeData, 'payload');\n\n\tif (lazyTraits) {\n\t\treturn {\n\t\t\t...nodeData,\n\t\t\tget traits() {\n\t\t\t\treturn memoizeGetter(this, 'traits', makeTraits(snapshot, node.traits, lazyTraits));\n\t\t\t},\n\t\t};\n\t}\n\n\treturn {\n\t\t...nodeData,\n\t\ttraits: makeTraits(snapshot, node.traits, lazyTraits),\n\t};\n}\n\n/** Given the traits of a SnapshotNode, return the corresponding traits on a Node */\nfunction makeTraits(\n\tsnapshot: Snapshot,\n\ttraits: ReadonlyMap<TraitLabel, readonly NodeId[]>,\n\tlazyTraits = false\n): TraitMap<ChangeNode> {\n\tconst traitMap = {};\n\tfor (const [label, trait] of traits.entries()) {\n\t\tif (lazyTraits) {\n\t\t\tObject.defineProperty(traitMap, label, {\n\t\t\t\tget() {\n\t\t\t\t\tconst treeNodeTrait = trait.map((nodeId) =>\n\t\t\t\t\t\tgetChangeNodeFromSnapshot(snapshot, nodeId, lazyTraits)\n\t\t\t\t\t);\n\t\t\t\t\treturn memoizeGetter(this as TraitMap<ChangeNode>, label, treeNodeTrait);\n\t\t\t\t},\n\t\t\t\tconfigurable: true,\n\t\t\t\tenumerable: true,\n\t\t\t});\n\t\t} else {\n\t\t\tObject.defineProperty(traitMap, label, {\n\t\t\t\tvalue: trait.map((nodeId) => getChangeNodeFromSnapshot(snapshot, nodeId, lazyTraits)),\n\t\t\t\tenumerable: true,\n\t\t\t});\n\t\t}\n\t}\n\n\treturn traitMap;\n}\n\n/**\n * Compares finite numbers to form a strict partial ordering.\n *\n * Handles +/-0 like Map: -0 is equal to +0.\n *\n * Once https://github.com/qwertie/btree-typescript/pull/15 is merged, we can use the version of this function from it.\n */\nexport function compareFiniteNumbers(a: number, b: number): number {\n\treturn a - b;\n}\n\n/**\n * Compares strings lexically to form a strict partial ordering.\n * Once https://github.com/qwertie/btree-typescript/pull/15 is merged, we can use the version of this function from it.\n */\nexport function compareStrings(a: string, b: string): number {\n\treturn a > b ? 1 : a === b ? 0 : -1;\n}\n"]}

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

@@ -1,144 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { Snapshot } from '../Snapshot';
-import { Change, StablePlace, StableRange } from '../default-edits';
-import { EditValidationResult } from '../Checkout';
-import { NodeId } from '../Identifiers';
-import { ReconciliationPath } from '../ReconciliationPath';
-import { AnchoredChange, NodeAnchor, PlaceAnchor, RangeAnchor, RelativePlaceAnchor } from './PersistedTypes';
-/**
- * A change and the snapshots that precede and succeed it.
- */
-export interface EvaluatedChange<TChange> {
-    readonly change: TChange;
-    /**
-     * The snapshot before the change was applied.
-     */
-    readonly before: Snapshot;
-    /**
-     * The snapshot after the change was applied.
-     */
-    readonly after: Snapshot;
-}
-/**
- * Object that includes a function for resolving node anchors.
- */
-export interface HasNodeResolver {
-    nodeResolver: (node: NodeAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>) => NodeId | undefined;
-}
-/**
- * Object that includes a function for resolving place anchors.
- */
-export interface HasPlaceResolver {
-    placeResolver: (range: PlaceAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>) => StablePlace | undefined;
-}
-/**
- * Object that includes a function for resolving range anchors.
- */
-export interface HasRangeResolver {
-    rangeResolver: (range: RangeAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>) => StableRange | undefined;
-}
-/**
- * Object that includes a function for validating places.
- */
-export interface HasPlaceValidator {
-    placeValidator: (snapshot: Snapshot, place: StablePlace) => EditValidationResult;
-}
-/**
- * Reconciliates a given `change` in the face of concurrent edits described in a `ReconciliationPath`.
- * @param change - The anchor to reconciliate.
- * @param before - The state to which the `change` would be applied to.
- * @param path - The reconciliation path for the `change`.
- * @returns A `Change` that satisfies the same semantics of the given `change` but whose tree locations are valid in the `before` snapshot.
- *   Undefined if no such change can be produced.
- * @internal
- */
-export declare function resolveChangeAnchors(change: AnchoredChange, before: Snapshot, path: ReconciliationPath<AnchoredChange>): Change | undefined;
-/**
- * For testing purposes only.
- * @internal
- */
-export declare function resolveChangeAnchors(change: AnchoredChange, before: Snapshot, path: ReconciliationPath<AnchoredChange>, dependencies?: HasNodeResolver & HasPlaceResolver & HasRangeResolver): Change | undefined;
-/**
- * Resolves a given `node` anchor in the face of a `ReconciliationPath`.
- * @param node - The anchor to resolve.
- * @param before - The state to which the change that the `node` anchor should be applied to.
- * @param path - The reconciliation path for the change that the `node` is part of.
- * @returns A matching `NodeId` that is valid in the snapshot at the end of the `path`. Undefined if no such node exists.
- * @internal
- */
-export declare function resolveNodeAnchor(node: NodeAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>): NodeId | undefined;
-/**
- * Resolves a given `range` anchor in the face of a `ReconciliationPath`.
- * @param range - The anchor to resolve.
- * @param before - The state to which the change that the `range` anchor should be applied to.
- * @param path - The reconciliation path for the change that the `range` is part of.
- * @returns A matching `StableRange` that is valid in the snapshot at the end of the `path`. Undefined if no such valid range exists.
- * @internal
- */
-export declare function resolveRangeAnchor(range: RangeAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>): StableRange | undefined;
-/**
- * For testing purposes only.
- * @internal
- */
-export declare function resolveRangeAnchor(range: RangeAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>, dependencies?: HasPlaceResolver & {
-    rangeValidator: (snapshot: Snapshot, range: StableRange) => EditValidationResult;
-}): StableRange | undefined;
-/**
- * Resolves a given `place` anchor in the face of a `ReconciliationPath`.
- * @param place - The anchor to resolve.
- * @param before - The state to which the change that the `place` anchor should be applied to.
- * @param path - The reconciliation path for the change that the `place` is part of.
- * @returns A matching `StablePlace` that is valid in the snapshot at the end of the `path`. Undefined if no such valid place exists.
- * @internal
- */
-export declare function resolvePlaceAnchor(place: PlaceAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>): StablePlace | undefined;
-/**
- * For testing purposes only.
- * @internal
- */
-export declare function resolvePlaceAnchor(place: PlaceAnchor, before: Snapshot, path: ReconciliationPath<AnchoredChange>, dependencies?: HasPlaceValidator & {
-    placeUpdatorForPath: (place: RelativePlaceAnchor, path: ReconciliationPath<AnchoredChange>) => PlaceAnchor | undefined;
-}): StablePlace | undefined;
-/**
- * Updates a given `place` anchor in the face of a `ReconciliationPath` that violates its semantics.
- * @param place - The anchor to update. Assumed to be invalid after the latest change.
- * @param path - The sequence of edits that violates the anchor's semantics.
- * @returns A place anchor whose semantics are inline with the given `place`, and valid after the most recent change that made it invalid.
- *   Undefined if those semantics cannot be preserved.
- * @internal
- */
-export declare function updateRelativePlaceAnchorForPath(place: RelativePlaceAnchor, path: ReconciliationPath<AnchoredChange>): PlaceAnchor | undefined;
-/**
- * For testing purposes only.
- * @internal
- */
-export declare function updateRelativePlaceAnchorForPath(place: RelativePlaceAnchor, path: ReconciliationPath<AnchoredChange>, dependencies?: {
-    lastOffendingChangeFinder: (place: RelativePlaceAnchor, path: ReconciliationPath<AnchoredChange>) => EvaluatedChange<AnchoredChange> | undefined;
-    placeUpdatorForChange: (place: RelativePlaceAnchor, change: EvaluatedChange<AnchoredChange>) => PlaceAnchor | undefined;
-}): PlaceAnchor | undefined;
-/**
- * Finds the latest change in the given `path` that last made the given `place` invalid.
- * @param place - A anchor that is invalid in the last snapshot on the path.
- * @param path - The sequence of edits that violates the anchor's semantics.
- * @returns The change that last made the given `place` invalid and the snapshots before and after it. Undefined if `place` was never valid.
- * @internal
- */
-export declare function findLastOffendingChange(place: RelativePlaceAnchor, path: ReconciliationPath<AnchoredChange>): EvaluatedChange<AnchoredChange> | undefined;
-/**
- * For testing purposes only.
- * @internal
- */
-export declare function findLastOffendingChange(place: RelativePlaceAnchor, path: ReconciliationPath<AnchoredChange>, dependencies?: HasPlaceValidator): EvaluatedChange<AnchoredChange> | undefined;
-/**
- * Updates a given `place` anchor in the face of a change that violates its semantics.
- * @param place - The anchor to update.
- * @param change - The change that violates the anchor's semantics.
- * @returns A place anchor that is valid after the given `change` and in line with the original `place`'s semantics.
- *   Undefined if those semantics cannot be preserved.
- * @internal
- */
-export declare function updateRelativePlaceAnchorForChange(place: RelativePlaceAnchor, change: EvaluatedChange<AnchoredChange>): PlaceAnchor | undefined;
-//# sourceMappingURL=AnchorResolution.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"AnchorResolution.d.ts","sourceRoot":"","sources":["../../src/anchored-edits/AnchorResolution.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAQ,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC7C,OAAO,EACN,MAAM,EAGN,WAAW,EACX,WAAW,EAGX,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EAAE,oBAAoB,EAAE,MAAM,aAAa,CAAC;AACnD,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AACxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EACN,cAAc,EACd,UAAU,EACV,WAAW,EAEX,WAAW,EACX,mBAAmB,EACnB,MAAM,kBAAkB,CAAC;AAE1B;;GAEG;AACH,MAAM,WAAW,eAAe,CAAC,OAAO;IACvC,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;IACzB;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC;IAC1B;;OAEG;IACH,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC;CACzB;AAED;;GAEG;AACH,MAAM,WAAW,eAAe;IAC/B,YAAY,EAAE,CAAC,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,KAAK,MAAM,GAAG,SAAS,CAAC;CACnH;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAChC,aAAa,EAAE,CACd,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,KACpC,WAAW,GAAG,SAAS,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,gBAAgB;IAChC,aAAa,EAAE,CACd,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,KACpC,WAAW,GAAG,SAAS,CAAC;CAC7B;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IACjC,cAAc,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,KAAK,oBAAoB,CAAC;CACjF;AAED;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CACnC,MAAM,EAAE,cAAc,EACtB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,GACtC,MAAM,GAAG,SAAS,CAAC;AAEtB;;;GAGG;AACH,wBAAgB,oBAAoB,CACnC,MAAM,EAAE,cAAc,EACtB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,EACxC,YAAY,CAAC,EAAE,eAAe,GAAG,gBAAgB,GAAG,gBAAgB,GAClE,MAAM,GAAG,SAAS,CAAC;AAoCtB;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAChC,IAAI,EAAE,UAAU,EAChB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,GACtC,MAAM,GAAG,SAAS,CAEpB;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CACjC,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,GACtC,WAAW,GAAG,SAAS,CAAC;AAE3B;;;GAGG;AACH,wBAAgB,kBAAkB,CACjC,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,EACxC,YAAY,CAAC,EAAE,gBAAgB,GAAG;IACjC,cAAc,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,KAAK,oBAAoB,CAAC;CACjF,GACC,WAAW,GAAG,SAAS,CAAC;AA8B3B;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CACjC,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,GACtC,WAAW,GAAG,SAAS,CAAC;AAE3B;;;GAGG;AACH,wBAAgB,kBAAkB,CACjC,KAAK,EAAE,WAAW,EAClB,MAAM,EAAE,QAAQ,EAChB,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,EACxC,YAAY,CAAC,EAAE,iBAAiB,GAAG;IAClC,mBAAmB,EAAE,CACpB,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,KACpC,WAAW,GAAG,SAAS,CAAC;CAC7B,GACC,WAAW,GAAG,SAAS,CAAC;AAsC3B;;;;;;;GAOG;AACH,wBAAgB,gCAAgC,CAC/C,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,GACtC,WAAW,GAAG,SAAS,CAAC;AAE3B;;;GAGG;AACH,wBAAgB,gCAAgC,CAC/C,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,EACxC,YAAY,CAAC,EAAE;IACd,yBAAyB,EAAE,CAC1B,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,KACpC,eAAe,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;IACjD,qBAAqB,EAAE,CACtB,KAAK,EAAE,mBAAmB,EAC1B,MAAM,EAAE,eAAe,CAAC,cAAc,CAAC,KACnC,WAAW,GAAG,SAAS,CAAC;CAC7B,GACC,WAAW,GAAG,SAAS,CAAC;AA8B3B;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACtC,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,GACtC,eAAe,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;AAE/C;;;GAGG;AACH,wBAAgB,uBAAuB,CACtC,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,kBAAkB,CAAC,cAAc,CAAC,EACxC,YAAY,CAAC,EAAE,iBAAiB,GAC9B,eAAe,CAAC,cAAc,CAAC,GAAG,SAAS,CAAC;AAoC/C;;;;;;;GAOG;AACH,wBAAgB,kCAAkC,CACjD,KAAK,EAAE,mBAAmB,EAC1B,MAAM,EAAE,eAAe,CAAC,cAAc,CAAC,GACrC,WAAW,GAAG,SAAS,CAAC"}