@fluid-experimental/tree 0.58.2001 → 0.59.2000-61729

package/lib/generic/Summary.d.ts

@@ -1,63 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { IFluidHandle } from '@fluidframework/core-interfaces';
-import { IFluidSerializer } from '@fluidframework/shared-object-base';
-import { EditLogSummary, OrderedEditSet } from '../EditLog';
-import { Snapshot } from '../Snapshot';
-import { SharedTreeSummary_0_0_2 } from '../SummaryBackCompatibility';
-import { ChangeNode } from './PersistedTypes';
-/**
- * Format version for summaries that are written.
- * When next changing the format, we should add a new format version variable for the edit-specific summaries and assign it an independent
- * version number.
- */
-export declare const formatVersion = "0.0.2";
-/**
- * Handler for summarizing the tree state.
- * The handler is invoked when saving a summary. It accepts a view of the current state of the tree, the sequenced edits known
- * to the SharedTree, and optional helpers for serializing the edit information.
- * @returns a summary of the supplied state.
- * @internal
- */
-export declare type SharedTreeSummarizer<TChange> = (editLog: OrderedEditSet<TChange>, currentView: Snapshot) => SharedTreeSummaryBase;
-/**
- * The minimal information on a SharedTree summary. Contains the summary format version.
- */
-export interface SharedTreeSummaryBase {
-    /**
-     * Field on summary under which version is stored.
-     */
-    readonly version: string;
-}
-/**
- * The contents of a SharedTree summary: the current tree, and the edits needed to get from `initialTree` to the current tree.
- * @public
- */
-export interface SharedTreeSummary<TChange> extends SharedTreeSummaryBase {
-    readonly currentTree: ChangeNode;
-    /**
-     * Information that can populate an edit log.
-     */
-    readonly editHistory?: EditLogSummary<TChange>;
-}
-/**
- * Serializes a SharedTree summary into a JSON string. This may later be used to initialize a SharedTree's state via `deserialize()`
- * Also replaces handle objects with their serialized form.
- *
- * @param summary - The SharedTree summary to serialize.
- * @param serializer - The serializer required to serialize handles in the summary.
- * @param bind - The object handle required to serialize handles in the summary
- */
-export declare function serialize(summary: SharedTreeSummaryBase, serializer: IFluidSerializer, bind: IFluidHandle): string;
-/**
- * Preserves the full history in the generated summary.
- * @public
- */
-export declare function fullHistorySummarizer<TChange>(editLog: OrderedEditSet<TChange>, currentView: Snapshot): SharedTreeSummary_0_0_2<TChange>;
-/**
- * Generates a summary with format version 0.1.0. This will prefer handles over edits in edit chunks where possible.
- */
-export declare function fullHistorySummarizer_0_1_0<TChange>(editLog: OrderedEditSet<TChange>, currentView: Snapshot): SharedTreeSummary<TChange>;
-//# sourceMappingURL=Summary.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"Summary.d.ts","sourceRoot":"","sources":["../../src/generic/Summary.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,EAAE,gBAAgB,EAAoB,MAAM,oCAAoC,CAAC;AAExF,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AAC5D,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAqB,uBAAuB,EAAE,MAAM,6BAA6B,CAAC;AACzF,OAAO,EAAE,UAAU,EAAQ,MAAM,kBAAkB,CAAC;AAEpD;;;;GAIG;AACH,eAAO,MAAM,aAAa,UAAU,CAAC;AAErC;;;;;;GAMG;AACH,oBAAY,oBAAoB,CAAC,OAAO,IAAI,CAC3C,OAAO,EAAE,cAAc,CAAC,OAAO,CAAC,EAChC,WAAW,EAAE,QAAQ,KACjB,qBAAqB,CAAC;AAE3B;;GAEG;AACH,MAAM,WAAW,qBAAqB;IACrC;;OAEG;IACH,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CACzB;AAED;;;GAGG;AACH,MAAM,WAAW,iBAAiB,CAAC,OAAO,CAAE,SAAQ,qBAAqB;IACxE,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC;IAEjC;;OAEG;IACH,QAAQ,CAAC,WAAW,CAAC,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC;CAC/C;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CAAC,OAAO,EAAE,qBAAqB,EAAE,UAAU,EAAE,gBAAgB,EAAE,IAAI,EAAE,YAAY,GAAG,MAAM,CAElH;AAED;;;GAGG;AACH,wBAAgB,qBAAqB,CAAC,OAAO,EAC5C,OAAO,EAAE,cAAc,CAAC,OAAO,CAAC,EAChC,WAAW,EAAE,QAAQ,GACnB,uBAAuB,CAAC,OAAO,CAAC,CAwBlC;AAED;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAClD,OAAO,EAAE,cAAc,CAAC,OAAO,CAAC,EAChC,WAAW,EAAE,QAAQ,GACnB,iBAAiB,CAAC,OAAO,CAAC,CAM5B"}

package/lib/generic/Summary.js

@@ -1,58 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { serializeHandles } from '@fluidframework/shared-object-base';
-import { assert, assertNotUndefined } from '../Common';
-import { readFormatVersion } from '../SummaryBackCompatibility';
-/**
- * Format version for summaries that are written.
- * When next changing the format, we should add a new format version variable for the edit-specific summaries and assign it an independent
- * version number.
- */
-export const formatVersion = '0.0.2';
-/**
- * Serializes a SharedTree summary into a JSON string. This may later be used to initialize a SharedTree's state via `deserialize()`
- * Also replaces handle objects with their serialized form.
- *
- * @param summary - The SharedTree summary to serialize.
- * @param serializer - The serializer required to serialize handles in the summary.
- * @param bind - The object handle required to serialize handles in the summary
- */
-export function serialize(summary, serializer, bind) {
-    return assertNotUndefined(serializeHandles(summary, serializer, bind));
-}
-/**
- * Preserves the full history in the generated summary.
- * @public
- */
-export function fullHistorySummarizer(editLog, currentView) {
-    const { editChunks, editIds } = editLog.getEditLogSummary();
-    const sequencedEdits = [];
-    let idIndex = 0;
-    editChunks.forEach(({ chunk }) => {
-        assert(Array.isArray(chunk), 'Handles should not be included in the summary until format version 0.1.0 is being written.');
-        chunk.forEach(({ changes }) => {
-            sequencedEdits.push({
-                changes,
-                id: assertNotUndefined(editIds[idIndex++], 'Number of edits should match number of edit IDs.'),
-            });
-        });
-    });
-    return {
-        currentTree: currentView.getChangeNodeTree(),
-        sequencedEdits,
-        version: formatVersion,
-    };
-}
-/**
- * Generates a summary with format version 0.1.0. This will prefer handles over edits in edit chunks where possible.
- */
-export function fullHistorySummarizer_0_1_0(editLog, currentView) {
-    return {
-        currentTree: currentView.getChangeNodeTree(),
-        editHistory: editLog.getEditLogSummary(true),
-        version: readFormatVersion,
-    };
-}
-//# sourceMappingURL=Summary.js.map

package/lib/generic/Summary.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Summary.js","sourceRoot":"","sources":["../../src/generic/Summary.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAoB,gBAAgB,EAAE,MAAM,oCAAoC,CAAC;AACxF,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,WAAW,CAAC;AAGvD,OAAO,EAAE,iBAAiB,EAA2B,MAAM,6BAA6B,CAAC;AAGzF;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,OAAO,CAAC;AAqCrC;;;;;;;GAOG;AACH,MAAM,UAAU,SAAS,CAAC,OAA8B,EAAE,UAA4B,EAAE,IAAkB;IACzG,OAAO,kBAAkB,CAAC,gBAAgB,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC;AACxE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,qBAAqB,CACpC,OAAgC,EAChC,WAAqB;IAErB,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,iBAAiB,EAAE,CAAC;IAE5D,MAAM,cAAc,GAAoB,EAAE,CAAC;IAC3C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,UAAU,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE;QAChC,MAAM,CACL,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EACpB,4FAA4F,CAC5F,CAAC;QAEF,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE;YAC7B,cAAc,CAAC,IAAI,CAAC;gBACnB,OAAO;gBACP,EAAE,EAAE,kBAAkB,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,EAAE,kDAAkD,CAAC;aAC9F,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACN,WAAW,EAAE,WAAW,CAAC,iBAAiB,EAAE;QAC5C,cAAc;QACd,OAAO,EAAE,aAAa;KACtB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,2BAA2B,CAC1C,OAAgC,EAChC,WAAqB;IAErB,OAAO;QACN,WAAW,EAAE,WAAW,CAAC,iBAAiB,EAAE;QAC5C,WAAW,EAAE,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC;QAC5C,OAAO,EAAE,iBAAiB;KAC1B,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { IFluidHandle } from '@fluidframework/core-interfaces';\nimport { IFluidSerializer, serializeHandles } from '@fluidframework/shared-object-base';\nimport { assert, assertNotUndefined } from '../Common';\nimport { EditLogSummary, OrderedEditSet } from '../EditLog';\nimport { Snapshot } from '../Snapshot';\nimport { readFormatVersion, SharedTreeSummary_0_0_2 } from '../SummaryBackCompatibility';\nimport { ChangeNode, Edit } from './PersistedTypes';\n\n/**\n * Format version for summaries that are written.\n * When next changing the format, we should add a new format version variable for the edit-specific summaries and assign it an independent\n * version number.\n */\nexport const formatVersion = '0.0.2';\n\n/**\n * Handler for summarizing the tree state.\n * The handler is invoked when saving a summary. It accepts a view of the current state of the tree, the sequenced edits known\n * to the SharedTree, and optional helpers for serializing the edit information.\n * @returns a summary of the supplied state.\n * @internal\n */\nexport type SharedTreeSummarizer<TChange> = (\n\teditLog: OrderedEditSet<TChange>,\n\tcurrentView: Snapshot\n) => SharedTreeSummaryBase;\n\n/**\n * The minimal information on a SharedTree summary. Contains the summary format version.\n */\nexport interface SharedTreeSummaryBase {\n\t/**\n\t * Field on summary under which version is stored.\n\t */\n\treadonly version: string;\n}\n\n/**\n * The contents of a SharedTree summary: the current tree, and the edits needed to get from `initialTree` to the current tree.\n * @public\n */\nexport interface SharedTreeSummary<TChange> extends SharedTreeSummaryBase {\n\treadonly currentTree: ChangeNode;\n\n\t/**\n\t * Information that can populate an edit log.\n\t */\n\treadonly editHistory?: EditLogSummary<TChange>;\n}\n\n/**\n * Serializes a SharedTree summary into a JSON string. This may later be used to initialize a SharedTree's state via `deserialize()`\n * Also replaces handle objects with their serialized form.\n *\n * @param summary - The SharedTree summary to serialize.\n * @param serializer - The serializer required to serialize handles in the summary.\n * @param bind - The object handle required to serialize handles in the summary\n */\nexport function serialize(summary: SharedTreeSummaryBase, serializer: IFluidSerializer, bind: IFluidHandle): string {\n\treturn assertNotUndefined(serializeHandles(summary, serializer, bind));\n}\n\n/**\n * Preserves the full history in the generated summary.\n * @public\n */\nexport function fullHistorySummarizer<TChange>(\n\teditLog: OrderedEditSet<TChange>,\n\tcurrentView: Snapshot\n): SharedTreeSummary_0_0_2<TChange> {\n\tconst { editChunks, editIds } = editLog.getEditLogSummary();\n\n\tconst sequencedEdits: Edit<TChange>[] = [];\n\tlet idIndex = 0;\n\teditChunks.forEach(({ chunk }) => {\n\t\tassert(\n\t\t\tArray.isArray(chunk),\n\t\t\t'Handles should not be included in the summary until format version 0.1.0 is being written.'\n\t\t);\n\n\t\tchunk.forEach(({ changes }) => {\n\t\t\tsequencedEdits.push({\n\t\t\t\tchanges,\n\t\t\t\tid: assertNotUndefined(editIds[idIndex++], 'Number of edits should match number of edit IDs.'),\n\t\t\t});\n\t\t});\n\t});\n\n\treturn {\n\t\tcurrentTree: currentView.getChangeNodeTree(),\n\t\tsequencedEdits,\n\t\tversion: formatVersion,\n\t};\n}\n\n/**\n * Generates a summary with format version 0.1.0. This will prefer handles over edits in edit chunks where possible.\n */\nexport function fullHistorySummarizer_0_1_0<TChange>(\n\teditLog: OrderedEditSet<TChange>,\n\tcurrentView: Snapshot\n): SharedTreeSummary<TChange> {\n\treturn {\n\t\tcurrentTree: currentView.getChangeNodeTree(),\n\t\teditHistory: editLog.getEditLogSummary(true),\n\t\tversion: readFormatVersion,\n\t};\n}\n"]}

package/lib/generic/index.d.ts

@@ -1,10 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export { EditCommittedHandler, EditCommittedEventArguments, ISharedTreeEvents, GenericSharedTree, SharedTreeEvent, SharedTreeDiagnosticEvent, } from './GenericSharedTree';
-export { Edit, EditWithoutId, EditBase, TraitMap, TreeNodeSequence, Payload, NodeData, TreeNode, ChangeNode, BuildNode, EditStatus, TraitLocation, SharedTreeOpType, } from './PersistedTypes';
-export { newEdit, newEditId } from './GenericEditUtilities';
-export { GenericTransaction, EditingResult, ValidEditingResult } from './GenericTransaction';
-export { SharedTreeSummary, SharedTreeSummaryBase, SharedTreeSummarizer, fullHistorySummarizer, fullHistorySummarizer_0_1_0, formatVersion, serialize, } from './Summary';
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/generic/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EACN,oBAAoB,EACpB,2BAA2B,EAC3B,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,yBAAyB,GACzB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EACN,IAAI,EACJ,aAAa,EACb,QAAQ,EACR,QAAQ,EACR,gBAAgB,EAChB,OAAO,EACP,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,SAAS,EACT,UAAU,EACV,aAAa,EACb,gBAAgB,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAE,aAAa,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC7F,OAAO,EACN,iBAAiB,EACjB,qBAAqB,EACrB,oBAAoB,EACpB,qBAAqB,EACrB,2BAA2B,EAC3B,aAAa,EACb,SAAS,GACT,MAAM,WAAW,CAAC"}

package/lib/generic/index.js

@@ -1,11 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-// API Exports
-export { GenericSharedTree, SharedTreeEvent, SharedTreeDiagnosticEvent, } from './GenericSharedTree';
-export { EditStatus, SharedTreeOpType, } from './PersistedTypes';
-export { newEdit, newEditId } from './GenericEditUtilities';
-export { GenericTransaction } from './GenericTransaction';
-export { fullHistorySummarizer, fullHistorySummarizer_0_1_0, formatVersion, serialize, } from './Summary';
-//# sourceMappingURL=index.js.map

package/lib/generic/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/generic/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,cAAc;AAEd,OAAO,EAIN,iBAAiB,EACjB,eAAe,EACf,yBAAyB,GACzB,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAWN,UAAU,EAEV,gBAAgB,GAChB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EAAE,kBAAkB,EAAqC,MAAM,sBAAsB,CAAC;AAC7F,OAAO,EAIN,qBAAqB,EACrB,2BAA2B,EAC3B,aAAa,EACb,SAAS,GACT,MAAM,WAAW,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 {\n\tEditCommittedHandler,\n\tEditCommittedEventArguments,\n\tISharedTreeEvents,\n\tGenericSharedTree,\n\tSharedTreeEvent,\n\tSharedTreeDiagnosticEvent,\n} from './GenericSharedTree';\nexport {\n\tEdit,\n\tEditWithoutId,\n\tEditBase,\n\tTraitMap,\n\tTreeNodeSequence,\n\tPayload,\n\tNodeData,\n\tTreeNode,\n\tChangeNode,\n\tBuildNode,\n\tEditStatus,\n\tTraitLocation,\n\tSharedTreeOpType,\n} from './PersistedTypes';\nexport { newEdit, newEditId } from './GenericEditUtilities';\nexport { GenericTransaction, EditingResult, ValidEditingResult } from './GenericTransaction';\nexport {\n\tSharedTreeSummary,\n\tSharedTreeSummaryBase,\n\tSharedTreeSummarizer,\n\tfullHistorySummarizer,\n\tfullHistorySummarizer_0_1_0,\n\tformatVersion,\n\tserialize,\n} from './Summary';\n"]}

package/lib/test/Anchors.glassBox.tests.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"Anchors.glassBox.tests.d.ts","sourceRoot":"","sources":["../../src/test/Anchors.glassBox.tests.ts"],"names":[],"mappings":"AAAA;;;GAGG"}

package/lib/test/Anchors.glassBox.tests.js

@@ -1,410 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { expect } from 'chai';
-import { StablePlace, ConstraintEffect } from '../default-edits';
-import { AnchoredChange, PlaceAnchor, PlaceAnchorSemanticsChoice, RangeAnchor, resolveChangeAnchors, findLastOffendingChange, resolveNodeAnchor, resolvePlaceAnchor, resolveRangeAnchor, updateRelativePlaceAnchorForChange, updateRelativePlaceAnchorForPath, } from '../anchored-edits';
-import { assert, fail } from '../Common';
-import { Side, Snapshot } from '../Snapshot';
-import { EditValidationResult } from '../Checkout';
-import { makeEmptyNode, leftTraitLabel, rightTraitLabel } from './utilities/TestUtilities';
-const left = makeEmptyNode('left');
-const priorSibling = makeEmptyNode('prior');
-const nextSibling = makeEmptyNode('next');
-const right = makeEmptyNode('right');
-const parent = Object.assign(Object.assign({}, makeEmptyNode('parent')), { traits: { [leftTraitLabel]: [left], [rightTraitLabel]: [right] } });
-const initialTree = Object.assign(Object.assign({}, makeEmptyNode('root')), { traits: {
-        parentTraitLabel: [parent],
-    } });
-const leftTraitLocation = {
-    parent: parent.identifier,
-    label: leftTraitLabel,
-};
-const startPlace = StablePlace.atStartOf(leftTraitLocation);
-const endPlace = StablePlace.atEndOf(leftTraitLocation);
-const beforePlace = StablePlace.before(left);
-const afterPlace = StablePlace.after(left);
-const startAnchor = PlaceAnchor.atStartOf(leftTraitLocation, PlaceAnchorSemanticsChoice.RelativeToNode);
-const endAnchor = PlaceAnchor.atEndOf(leftTraitLocation, PlaceAnchorSemanticsChoice.RelativeToNode);
-const beforeAnchor = PlaceAnchor.before(left, PlaceAnchorSemanticsChoice.RelativeToNode);
-const afterAnchor = PlaceAnchor.after(left, PlaceAnchorSemanticsChoice.RelativeToNode);
-const mockDetachedSequenceId = 42;
-const mockNodeId = 'mock-node-id';
-const mockPlace = 'mock-place';
-const mockRange = 'mock-range';
-const mockPlaceAnchor = 'mock-place-anchor';
-const mockSnapshot = 'mock-snapshot';
-const mockPath = 'mock-path';
-const mockEvaluatedChange = 'mock-evaluated-change';
-describe('Anchor Glass Box Tests', () => {
-    describe(resolveChangeAnchors.name, () => {
-        const testCases = [
-            {
-                name: 'Insert',
-                input: AnchoredChange.insert(mockDetachedSequenceId, beforeAnchor),
-                expected: AnchoredChange.insert(mockDetachedSequenceId, mockPlace),
-            },
-            {
-                name: 'Detach',
-                input: AnchoredChange.detach(RangeAnchor.only(right), mockDetachedSequenceId),
-                expected: AnchoredChange.detach(mockRange, mockDetachedSequenceId),
-            },
-            {
-                name: 'SetValue (set payload)',
-                input: AnchoredChange.setPayload(left.identifier, 42),
-                expected: AnchoredChange.setPayload(mockNodeId, 42),
-            },
-            {
-                name: 'SetValue (clear payload)',
-                input: AnchoredChange.clearPayload(left.identifier),
-                expected: AnchoredChange.clearPayload(mockNodeId),
-            },
-            {
-                name: 'Constraint',
-                input: AnchoredChange.constraint(RangeAnchor.only(right), ConstraintEffect.ValidRetry),
-                expected: AnchoredChange.constraint(mockRange, ConstraintEffect.ValidRetry),
-            },
-        ];
-        for (const testCase of testCases) {
-            it(`attempts to resolve anchors in ${testCase.name} changes`, () => {
-                const change = testCase.input;
-                const actualHappy = resolveChangeAnchors(change, mockSnapshot, [], {
-                    nodeResolver: () => mockNodeId,
-                    placeResolver: () => mockPlace,
-                    rangeResolver: () => mockRange,
-                });
-                expect(actualHappy).deep.equal(testCase.expected);
-                const actualSad = resolveChangeAnchors(change, mockSnapshot, [], {
-                    nodeResolver: () => undefined,
-                    placeResolver: () => undefined,
-                    rangeResolver: () => undefined,
-                });
-                expect(actualSad).equal(undefined);
-            });
-        }
-        it('throws when given an unsupported change type', () => {
-            const fakeChange = { type: -42 };
-            expect(() => resolveChangeAnchors(fakeChange, mockSnapshot, [])).throws();
-        });
-    });
-    describe(resolveNodeAnchor.name, () => {
-        it('returns the given NodeAnchor as a NodeId if the node exists in the snapshot', () => {
-            const snapshot = Snapshot.fromTree(left);
-            expect(resolveNodeAnchor(left.identifier, snapshot, [])).equals(left.identifier);
-        });
-        it('returns undefined if the node does not exists in the snapshot', () => {
-            const snapshot = Snapshot.fromTree(left);
-            expect(resolveNodeAnchor(mockNodeId, snapshot, [])).equals(undefined);
-        });
-    });
-    describe(resolveRangeAnchor.name, () => {
-        it('returns a range with resolved places when possible', () => {
-            expect(resolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {
-                placeResolver: () => mockPlace,
-                rangeValidator: () => EditValidationResult.Valid,
-            })).deep.equals(RangeAnchor.from(mockPlace).to(mockPlace));
-        });
-        it('returns undefined if either place cannot be resolved', () => {
-            expect(resolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {
-                placeResolver: (place) => (place.side === Side.After ? mockPlace : undefined),
-                rangeValidator: () => EditValidationResult.Valid,
-            })).equals(undefined);
-            expect(resolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {
-                placeResolver: (place) => (place.side === Side.Before ? undefined : mockPlace),
-                rangeValidator: () => EditValidationResult.Valid,
-            })).equals(undefined);
-        });
-        it('returns undefined the resolved places do not make a valid range', () => {
-            expect(resolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {
-                placeResolver: () => mockPlace,
-                rangeValidator: () => EditValidationResult.Malformed,
-            })).equals(undefined);
-            expect(resolveRangeAnchor(RangeAnchor.only(left), mockSnapshot, [], {
-                placeResolver: () => mockPlace,
-                rangeValidator: () => EditValidationResult.Invalid,
-            })).equals(undefined);
-        });
-    });
-    describe(resolvePlaceAnchor.name, () => {
-        it('returns the given anchor when that anchor is valid in the current snapshot', () => {
-            const snapshot = Snapshot.fromTree(initialTree);
-            const testWithPlace = (place) => resolvePlaceAnchor(place, snapshot, []);
-            expect(testWithPlace(startPlace)).contains(startPlace);
-            expect(testWithPlace(endPlace)).contains(endPlace);
-            expect(testWithPlace(beforePlace)).contains(beforePlace);
-            expect(testWithPlace(afterPlace)).contains(afterPlace);
-            expect(testWithPlace(PlaceAnchor.atStartOf(leftTraitLocation))).contains(startPlace);
-            expect(testWithPlace(PlaceAnchor.atEndOf(leftTraitLocation))).contains(endPlace);
-            expect(testWithPlace(PlaceAnchor.before(left))).contains(beforePlace);
-            expect(testWithPlace(PlaceAnchor.after(left))).contains(afterPlace);
-        });
-        it('returns undefined when the anchor is invalid and not updatable', () => {
-            expect(resolvePlaceAnchor(mockPlace, mockSnapshot, [], {
-                placeUpdatorForPath: () => undefined,
-                placeValidator: () => EditValidationResult.Invalid,
-            })).equals(undefined);
-        });
-        it('returns undefined when the anchor is invalid and bound to the node', () => {
-            const resolvePlaceAnchorForInvalidPlace = (place) => resolvePlaceAnchor(place, mockSnapshot, [], {
-                placeUpdatorForPath: () => fail(),
-                placeValidator: () => EditValidationResult.Invalid,
-            });
-            expect(resolvePlaceAnchorForInvalidPlace(startPlace)).equals(undefined);
-            expect(resolvePlaceAnchorForInvalidPlace(endPlace)).equals(undefined);
-            expect(resolvePlaceAnchorForInvalidPlace(beforePlace)).equals(undefined);
-            expect(resolvePlaceAnchorForInvalidPlace(afterPlace)).equals(undefined);
-        });
-        it('returns an updated anchor when the anchor is invalid but updatable to be valid', () => {
-            let updateCountdown = 5;
-            const inputSnapshot = Snapshot.fromTree(initialTree);
-            const inputPlace = PlaceAnchor.after(mockNodeId);
-            const placeUpdatorForPath = (place, path) => {
-                expect(place).equals(inputPlace);
-                expect(path).equals(mockPath);
-                return --updateCountdown ? inputPlace : afterAnchor;
-            };
-            const placeValidator = (snapshot, place) => {
-                expect(snapshot).equals(inputSnapshot);
-                return place === inputPlace ? EditValidationResult.Invalid : EditValidationResult.Valid;
-            };
-            expect(resolvePlaceAnchor(inputPlace, inputSnapshot, mockPath, {
-                placeUpdatorForPath,
-                placeValidator,
-            })).contains(PlaceAnchor.after(left));
-            // Check that it took the expected number of updates
-            expect(updateCountdown).equals(0);
-        });
-        it('returns undefined when the anchor is invalid and updatable to be invalid', () => {
-            let updateCountdown = 5;
-            const inputSnapshot = Snapshot.fromTree(initialTree);
-            const inputPlace = PlaceAnchor.after(mockNodeId);
-            const placeUpdatorForPath = (place, path) => {
-                expect(place).equals(inputPlace);
-                expect(path).equals(mockPath);
-                return --updateCountdown ? inputPlace : undefined;
-            };
-            const placeValidator = (snapshot, place) => {
-                expect(snapshot).equals(inputSnapshot);
-                expect(place).equals(inputPlace);
-                return EditValidationResult.Invalid;
-            };
-            expect(resolvePlaceAnchor(inputPlace, inputSnapshot, mockPath, {
-                placeUpdatorForPath,
-                placeValidator,
-            })).equals(undefined);
-            // Check that it took the expected number of updates
-            expect(updateCountdown).equals(0);
-        });
-        it('throws when given an unsupported choice of anchor semantics', () => {
-            const fakeAnchor = { semantics: -42 };
-            expect(() => resolvePlaceAnchor(fakeAnchor, mockSnapshot, [])).throws();
-        });
-    });
-    describe(updateRelativePlaceAnchorForPath.name, () => {
-        it('does not update anchors for start and end of traits', () => {
-            expect(updateRelativePlaceAnchorForPath(startAnchor, [])).equals(undefined);
-            expect(updateRelativePlaceAnchorForPath(endAnchor, [])).equals(undefined);
-        });
-        it('does not update anchors when the last offending change is not found', () => {
-            expect(updateRelativePlaceAnchorForPath(startAnchor, [], {
-                lastOffendingChangeFinder: () => undefined,
-                placeUpdatorForChange: () => fail(),
-            })).equals(undefined);
-        });
-        it('tries to update anchors when the last offending change is found', () => {
-            expect(updateRelativePlaceAnchorForPath(beforeAnchor, [], {
-                lastOffendingChangeFinder: () => mockEvaluatedChange,
-                placeUpdatorForChange: (place, change) => {
-                    expect(place).equals(beforeAnchor);
-                    expect(change).equals(mockEvaluatedChange);
-                    return mockPlace;
-                },
-            })).equals(mockPlace);
-            expect(updateRelativePlaceAnchorForPath(beforeAnchor, [], {
-                lastOffendingChangeFinder: () => mockEvaluatedChange,
-                placeUpdatorForChange: (place, change) => {
-                    expect(place).equals(beforeAnchor);
-                    expect(change).equals(mockEvaluatedChange);
-                    return undefined;
-                },
-            })).equals(undefined);
-        });
-    });
-    describe(findLastOffendingChange.name, () => {
-        function makeEdit(changes) {
-            assert(changes.length > 0);
-            const steps = changes.map(makeChange);
-            return Object.assign(steps, {
-                before: snapshotBeforeChange(changes[0]),
-                after: steps[steps.length - 1].after,
-            });
-        }
-        function makeChange(change) {
-            return {
-                resolvedChange: change,
-                after: snapshotAfterChange(change),
-            };
-        }
-        function snapshotBeforeChange(change) {
-            return change === stayInvalidChange || change === mendingChange ? invalidSnapshot : validSnapshot;
-        }
-        function snapshotAfterChange(change) {
-            return change === stayValidChange || change === mendingChange ? validSnapshot : invalidSnapshot;
-        }
-        const validSnapshot = 'valid-snapshot';
-        const invalidSnapshot = 'invalid-snapshot';
-        const priorOffendingChange = 'prior-offending-change';
-        const lastOffendingChange = 'last-offending-change';
-        const stayValidChange = 'stay-valid-change';
-        const stayInvalidChange = 'stay-invalid-change';
-        const mendingChange = 'mending-change';
-        const priorOffendingEdit = makeEdit([priorOffendingChange]);
-        const lastOffendingEdit = makeEdit([lastOffendingChange]);
-        const mendingEdit = makeEdit([mendingChange]);
-        const stayValidEdit = makeEdit([stayValidChange]);
-        const stayInvalidEdit = makeEdit([stayInvalidChange]);
-        const testWithPath = (path) => findLastOffendingChange(mockPlaceAnchor, path, {
-            placeValidator: (snapshot) => snapshot === invalidSnapshot
-                ? EditValidationResult.Invalid
-                : snapshot === validSnapshot
-                    ? EditValidationResult.Valid
-                    : fail(),
-        });
-        describe('returns undefined when the place is invalid throughout the path', () => {
-            const testCases = [
-                [],
-                [stayInvalidEdit],
-                [stayInvalidEdit, stayInvalidEdit, stayInvalidEdit],
-                [makeEdit([stayInvalidChange, stayInvalidChange, stayInvalidChange])],
-            ];
-            for (let i = 0; i < testCases.length; ++i) {
-                it(`Test Case ${i}`, () => {
-                    expect(testWithPath(testCases[i])).equals(undefined);
-                });
-            }
-        });
-        describe('returns the last offending change when there is one', () => {
-            const testCases = [
-                [lastOffendingEdit],
-                [lastOffendingEdit, stayInvalidEdit],
-                [stayValidEdit, lastOffendingEdit],
-                [stayValidEdit, lastOffendingEdit, stayInvalidEdit],
-                [stayValidEdit, priorOffendingEdit, stayInvalidEdit, mendingEdit, lastOffendingEdit],
-                [stayValidEdit, priorOffendingEdit, stayInvalidEdit, mendingEdit, lastOffendingEdit, stayInvalidEdit],
-                [priorOffendingEdit, mendingEdit, priorOffendingEdit, mendingEdit, lastOffendingEdit],
-                [makeEdit([stayValidChange, lastOffendingChange])],
-                [makeEdit([lastOffendingChange, stayInvalidChange])],
-                [makeEdit([stayValidChange, lastOffendingChange, stayInvalidChange])],
-                [makeEdit([stayValidChange, priorOffendingChange, mendingChange, lastOffendingChange])],
-                [
-                    makeEdit([
-                        priorOffendingChange,
-                        mendingChange,
-                        priorOffendingChange,
-                        mendingChange,
-                        lastOffendingChange,
-                    ]),
-                ],
-                [stayInvalidEdit, makeEdit([mendingChange, lastOffendingChange])],
-            ];
-            for (let i = 0; i < testCases.length; ++i) {
-                it(`Test Case ${i}`, () => {
-                    const actual = testWithPath(testCases[i]);
-                    expect(actual).deep.equals({
-                        before: validSnapshot,
-                        after: invalidSnapshot,
-                        change: lastOffendingChange,
-                    });
-                });
-            }
-        });
-    });
-    describe(updateRelativePlaceAnchorForChange.name, () => {
-        const afterPrior = PlaceAnchor.after(priorSibling);
-        const beforeNext = PlaceAnchor.before(nextSibling);
-        const rangesInSitu = [
-            {
-                range: RangeAnchor.from(startAnchor).to(beforeNext),
-                trait: [left, nextSibling],
-            },
-            {
-                range: RangeAnchor.from(startAnchor).to(afterAnchor),
-                trait: [left],
-            },
-            {
-                range: RangeAnchor.from(startAnchor).to(endAnchor),
-                trait: [left],
-            },
-            {
-                range: RangeAnchor.from(beforeAnchor).to(beforeNext),
-                trait: [left, nextSibling],
-            },
-            {
-                range: RangeAnchor.from(beforeAnchor).to(afterAnchor),
-                trait: [left],
-            },
-            {
-                range: RangeAnchor.from(beforeAnchor).to(endAnchor),
-                trait: [left],
-            },
-            {
-                range: RangeAnchor.from(afterPrior).to(beforeNext),
-                trait: [priorSibling, left, nextSibling],
-            },
-            {
-                range: RangeAnchor.from(afterPrior).to(afterAnchor),
-                trait: [priorSibling, left],
-            },
-            {
-                range: RangeAnchor.from(afterPrior).to(endAnchor),
-                trait: [priorSibling, left],
-            },
-        ];
-        function evaluateCase(caseIndex, anchor) {
-            const before = Snapshot.fromTree(Object.assign(Object.assign({}, parent), { traits: { [leftTraitLabel]: rangesInSitu[caseIndex].trait } }));
-            const filteredTrait = rangesInSitu[caseIndex].trait.filter((sibling) => sibling !== left);
-            const after = Snapshot.fromTree(Object.assign(Object.assign({}, parent), { traits: filteredTrait.length ? { [leftTraitLabel]: filteredTrait } : {} }));
-            const evaluatedChange = {
-                change: AnchoredChange.detach(rangesInSitu[caseIndex].range),
-                before,
-                after,
-            };
-            return updateRelativePlaceAnchorForChange(anchor, evaluatedChange);
-        }
-        describe('can update before(X) and after(X) when X is detached', () => {
-            for (let i = 0; i < rangesInSitu.length; ++i) {
-                it(`Test Case ${i}`, () => {
-                    const expectedAfter = rangesInSitu[i].trait[0] === priorSibling ? afterPrior : startAnchor;
-                    const expectedBefore = rangesInSitu[i].trait[rangesInSitu[i].trait.length - 1] === nextSibling
-                        ? beforeNext
-                        : endAnchor;
-                    expect(evaluateCase(i, afterAnchor)).deep.equals(expectedAfter);
-                    expect(evaluateCase(i, beforeAnchor)).deep.equals(expectedBefore);
-                });
-            }
-        });
-        describe('does not update anchors for start and end of traits', () => {
-            for (let i = 0; i < rangesInSitu.length; ++i) {
-                it(`Test Case ${i}`, () => {
-                    expect(evaluateCase(i, startAnchor)).equals(undefined);
-                    expect(evaluateCase(i, endAnchor)).equals(undefined);
-                });
-            }
-        });
-        it('does not update anchors when the containing parent is deleted', () => {
-            const before = Snapshot.fromTree(initialTree);
-            const after = Snapshot.fromTree(Object.assign(Object.assign({}, initialTree), { traits: {} }));
-            const evaluatedChange = {
-                change: AnchoredChange.detach(RangeAnchor.only(parent)),
-                before,
-                after,
-            };
-            expect(updateRelativePlaceAnchorForChange(startAnchor, evaluatedChange)).equals(undefined);
-            expect(updateRelativePlaceAnchorForChange(endAnchor, evaluatedChange)).equals(undefined);
-            expect(updateRelativePlaceAnchorForChange(afterAnchor, evaluatedChange)).equals(undefined);
-            expect(updateRelativePlaceAnchorForChange(beforeAnchor, evaluatedChange)).equals(undefined);
-        });
-    });
-});
-//# sourceMappingURL=Anchors.glassBox.tests.js.map