@fluidframework/tree 2.0.0-rc.2.0.2 → 2.0.0-rc.3.0.0

package/lib/test/testChange.d.ts

@@ -1,90 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { ChangeFamily, ChangeRebaser, TaggedChange, AnchorSet, ChangeFamilyEditor, DeltaFieldMap, DeltaRoot, ChangeFamilyCodec, ChangeEncodingContext } from "../core/index.js";
-import { IJsonCodec } from "../codec/index.js";
-import { JsonCompatibleReadOnly, RecursiveReadonly } from "../util/index.js";
-export interface NonEmptyTestChange {
-    /**
-     * Identifies the document state that the change should apply to.
-     * Represented as the concatenation of all previous intentions.
-     */
-    inputContext: number[];
-    /**
-     * Identifies the document state brought about by applying the change to the document.
-     * Represented as the concatenation of all previous intentions and the intentions in this change.
-     */
-    outputContext: number[];
-    /**
-     * Identifies the editing intentions included in the change.
-     * Editing intentions can be thought of as user actions, where each user action is unique.
-     * Editing intentions can be inverted (represented negative number of the same magnitude) but are
-     * otherwise unchanged by rebasing.
-     */
-    intentions: number[];
-}
-export interface EmptyTestChange {
-    intentions: [];
-}
-export type TestChange = NonEmptyTestChange | EmptyTestChange;
-declare function mint(inputContext: readonly number[], intention: number | number[]): NonEmptyTestChange;
-declare function compose(change1: TestChange | undefined, change2: TestChange | undefined, verify?: boolean): TestChange;
-declare function composeList(changes: TestChange[], verify?: boolean): TestChange;
-declare function invert(change: TestChange): TestChange;
-declare function rebase(change: TestChange | undefined, over: TestChange | undefined): TestChange | undefined;
-declare function checkChangeList(changes: readonly RecursiveReadonly<TestChange>[], intentions: number[]): void;
-declare function toDelta({ change }: TaggedChange<TestChange>): DeltaFieldMap;
-export interface AnchorRebaseData {
-    rebases: RecursiveReadonly<NonEmptyTestChange>[];
-    intentions: number[];
-}
-export declare const TestChange: {
-    emptyChange: EmptyTestChange;
-    mint: typeof mint;
-    compose: typeof compose;
-    composeList: typeof composeList;
-    invert: typeof invert;
-    rebase: typeof rebase;
-    checkChangeList: typeof checkChangeList;
-    toDelta: typeof toDelta;
-    isEmpty: typeof isEmpty;
-    codec: IJsonCodec<TestChange, JsonCompatibleReadOnly, JsonCompatibleReadOnly, ChangeEncodingContext> & ChangeFamilyCodec<TestChange>;
-};
-export declare class TestChangeRebaser implements ChangeRebaser<TestChange> {
-    compose(changes: TaggedChange<TestChange>[]): TestChange;
-    invert(change: TaggedChange<TestChange>): TestChange;
-    rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange;
-}
-export declare class UnrebasableTestChangeRebaser extends TestChangeRebaser {
-    rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange;
-}
-export declare class NoOpChangeRebaser extends TestChangeRebaser {
-    rebasedCount: number;
-    invertedCount: number;
-    composedCount: number;
-    rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange;
-    invert(change: TaggedChange<TestChange>): TestChange;
-    compose(changes: TaggedChange<TestChange>[]): TestChange;
-}
-export declare class ConstrainedTestChangeRebaser extends TestChangeRebaser {
-    private readonly constraint;
-    constructor(constraint: (change: TestChange, over: TaggedChange<TestChange>) => boolean);
-    rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange;
-}
-export declare class TestAnchorSet extends AnchorSet implements AnchorRebaseData {
-    rebases: RecursiveReadonly<NonEmptyTestChange>[];
-    intentions: number[];
-}
-export type TestChangeFamily = ChangeFamily<ChangeFamilyEditor, TestChange>;
-/**
- * This is a hack to encode arbitrary information (the intentions) into a Delta
- * The resulting Delta does not represent a concrete change to a document tree.
- * It is instead used as composite value in deep comparisons that verify that `EditManager` calls
- * `ChangeFamily.intoDelta` with the expected change.
- */
-export declare function asDelta(intentions: number[]): DeltaRoot;
-export declare function testChangeFamilyFactory(rebaser?: ChangeRebaser<TestChange>): ChangeFamily<ChangeFamilyEditor, TestChange>;
-export declare function isEmpty(change: TestChange): boolean;
-export {};
-//# sourceMappingURL=testChange.d.ts.map

package/lib/test/testChange.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"testChange.d.ts","sourceRoot":"","sources":["../../src/test/testChange.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EACN,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,SAAS,EACT,kBAAkB,EAGlB,aAAa,EACb,SAAS,EACT,iBAAiB,EACjB,qBAAqB,EACrB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,UAAU,EAAmB,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAAE,sBAAsB,EAAE,iBAAiB,EAAS,MAAM,kBAAkB,CAAC;AAGpF,MAAM,WAAW,kBAAkB;IAClC;;;OAGG;IACH,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB;;;OAGG;IACH,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB;;;;;OAKG;IACH,UAAU,EAAE,MAAM,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,eAAe;IAC/B,UAAU,EAAE,EAAE,CAAC;CACf;AAED,MAAM,MAAM,UAAU,GAAG,kBAAkB,GAAG,eAAe,CAAC;AAQ9D,iBAAS,IAAI,CAAC,YAAY,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM,EAAE,GAAG,kBAAkB,CAO/F;AAoBD,iBAAS,OAAO,CACf,OAAO,EAAE,UAAU,GAAG,SAAS,EAC/B,OAAO,EAAE,UAAU,GAAG,SAAS,EAC/B,MAAM,GAAE,OAAc,GACpB,UAAU,CAEZ;AAED,iBAAS,WAAW,CAAC,OAAO,EAAE,UAAU,EAAE,EAAE,MAAM,GAAE,OAAc,GAAG,UAAU,CAuB9E;AAYD,iBAAS,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,UAAU,CAS9C;AAED,iBAAS,MAAM,CACd,MAAM,EAAE,UAAU,GAAG,SAAS,EAC9B,IAAI,EAAE,UAAU,GAAG,SAAS,GAC1B,UAAU,GAAG,SAAS,CAsBxB;AAED,iBAAS,eAAe,CACvB,OAAO,EAAE,SAAS,iBAAiB,CAAC,UAAU,CAAC,EAAE,EACjD,UAAU,EAAE,MAAM,EAAE,GAClB,IAAI,CAeN;AAED,iBAAS,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,aAAa,CAYpE;AAED,MAAM,WAAW,gBAAgB;IAChC,OAAO,EAAE,iBAAiB,CAAC,kBAAkB,CAAC,EAAE,CAAC;IACjD,UAAU,EAAE,MAAM,EAAE,CAAC;CACrB;AAcD,eAAO,MAAM,UAAU;;;;;;;;;;;CAWtB,CAAC;AAGF,qBAAa,iBAAkB,YAAW,aAAa,CAAC,UAAU,CAAC;IAC3D,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,GAAG,UAAU;IAIxD,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU;IAIpD,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU;CAG7E;AAED,qBAAa,4BAA6B,SAAQ,iBAAiB;IAClD,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU;CAGtF;AAED,qBAAa,iBAAkB,SAAQ,iBAAiB;IAChD,YAAY,SAAK;IACjB,aAAa,SAAK;IAClB,aAAa,SAAK;IAET,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU;IAKtE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU;IAKpD,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,UAAU,CAAC,EAAE,GAAG,UAAU;CAIxE;AAED,qBAAa,4BAA6B,SAAQ,iBAAiB;IAEjE,OAAO,CAAC,QAAQ,CAAC,UAAU;gBAAV,UAAU,EAAE,CAC5B,MAAM,EAAE,UAAU,EAClB,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,KAC1B,OAAO;IAKG,MAAM,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,CAAC,UAAU,CAAC,GAAG,UAAU;CAItF;AAED,qBAAa,aAAc,SAAQ,SAAU,YAAW,gBAAgB;IAChE,OAAO,EAAE,iBAAiB,CAAC,kBAAkB,CAAC,EAAE,CAAM;IACtD,UAAU,EAAE,MAAM,EAAE,CAAM;CACjC;AAED,MAAM,MAAM,gBAAgB,GAAG,YAAY,CAAC,kBAAkB,EAAE,UAAU,CAAC,CAAC;AAI5E;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,UAAU,EAAE,MAAM,EAAE,GAAG,SAAS,CAMvD;AAED,wBAAgB,uBAAuB,CACtC,OAAO,CAAC,EAAE,aAAa,CAAC,UAAU,CAAC,GACjC,YAAY,CAAC,kBAAkB,EAAE,UAAU,CAAC,CAU9C;AAED,wBAAgB,OAAO,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO,CAEnD"}

package/lib/test/testChange.js

@@ -1,234 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { fail, strict as assert } from "assert";
-import { AnchorSet, emptyDelta, } from "../core/index.js";
-import { makeCodecFamily } from "../codec/index.js";
-import { brand } from "../util/index.js";
-import { deepFreeze } from "./utils.js";
-function isNonEmptyChange(change) {
-    return "inputContext" in change;
-}
-function mint(inputContext, intention) {
-    const intentions = Array.isArray(intention) ? intention : [intention];
-    return {
-        inputContext: composeIntentions([], inputContext),
-        intentions,
-        outputContext: composeIntentions(inputContext, intentions),
-    };
-}
-function composeIntentions(base, extras) {
-    const composed = [...base];
-    let last = composed[composed.length - 1];
-    for (const extra of extras) {
-        // Check wether we are composing intentions that cancel each other out.
-        // This helps us ensure that we always represent sequences of intentions
-        // in the same canonical form.
-        if (last === -extra) {
-            composed.pop();
-            last = composed[composed.length - 1];
-        }
-        else {
-            composed.push(extra);
-            last = extra;
-        }
-    }
-    return composed;
-}
-function compose(change1, change2, verify = true) {
-    return composeList(getArrayWithoutUndefined([change1, change2]), verify);
-}
-function composeList(changes, verify = true) {
-    let inputContext;
-    let outputContext;
-    let intentions = [];
-    for (const change of changes) {
-        if (isNonEmptyChange(change)) {
-            inputContext ?? (inputContext = change.inputContext);
-            if (verify && outputContext !== undefined) {
-                // The input context should match the output context of the previous change.
-                assert.deepEqual(change.inputContext, outputContext);
-            }
-            outputContext = composeIntentions(outputContext ?? inputContext, change.intentions);
-            intentions = composeIntentions(intentions, change.intentions);
-        }
-    }
-    if (inputContext !== undefined) {
-        return {
-            inputContext,
-            intentions,
-            outputContext: outputContext ?? fail(),
-        };
-    }
-    return emptyChange;
-}
-function getArrayWithoutUndefined(array) {
-    const result = [];
-    for (const item of array) {
-        if (item !== undefined) {
-            result.push(item);
-        }
-    }
-    return result;
-}
-function invert(change) {
-    if (isNonEmptyChange(change)) {
-        return {
-            inputContext: change.outputContext,
-            outputContext: change.inputContext,
-            intentions: change.intentions.map((i) => -i).reverse(),
-        };
-    }
-    return emptyChange;
-}
-function rebase(change, over) {
-    if (change === undefined) {
-        return undefined;
-    }
-    if (over === undefined) {
-        return change;
-    }
-    if (isNonEmptyChange(change)) {
-        if (isNonEmptyChange(over)) {
-            // Rebasing should only occur between two changes with the same input context
-            assert.deepEqual(change.inputContext, over.inputContext);
-            return {
-                inputContext: over.outputContext,
-                outputContext: composeIntentions(over.outputContext, change.intentions),
-                intentions: change.intentions,
-            };
-        }
-        return change;
-    }
-    return TestChange.emptyChange;
-}
-function checkChangeList(changes, intentions) {
-    const filtered = changes.filter(isNonEmptyChange);
-    let intentionsSeen = [];
-    let index = 0;
-    for (const change of filtered) {
-        intentionsSeen = composeIntentions(intentionsSeen, change.intentions);
-        if (index > 0) {
-            const prev = filtered[index - 1];
-            // The current change should apply to the context brought about by the previous change
-            assert.deepEqual(change.inputContext, prev.outputContext);
-        }
-        ++index;
-    }
-    // All expected intentions were present
-    assert.deepEqual(intentionsSeen, intentions);
-}
-function toDelta({ change }) {
-    if (change.intentions.length > 0) {
-        return new Map([
-            [
-                // We represent the intentions as a list if node offsets in some imaginary field "testIntentions".
-                // This is purely for the sake of testing.
-                brand("testIntentions"),
-                { local: change.intentions.map((i) => ({ count: i })) },
-            ],
-        ]);
-    }
-    return new Map();
-}
-const emptyChange = { intentions: [] };
-const codec = {
-    encode: (x) => x,
-    decode: (x) => x,
-};
-export const TestChange = {
-    emptyChange,
-    mint,
-    compose,
-    composeList,
-    invert,
-    rebase,
-    checkChangeList,
-    toDelta,
-    isEmpty,
-    codec,
-};
-deepFreeze(TestChange);
-export class TestChangeRebaser {
-    compose(changes) {
-        return composeList(changes.map((c) => c.change));
-    }
-    invert(change) {
-        return invert(change.change);
-    }
-    rebase(change, over) {
-        return rebase(change, over.change) ?? { intentions: [] };
-    }
-}
-export class UnrebasableTestChangeRebaser extends TestChangeRebaser {
-    rebase(change, over) {
-        assert.fail("Unexpected call to rebase");
-    }
-}
-export class NoOpChangeRebaser extends TestChangeRebaser {
-    constructor() {
-        super(...arguments);
-        this.rebasedCount = 0;
-        this.invertedCount = 0;
-        this.composedCount = 0;
-    }
-    rebase(change, over) {
-        this.rebasedCount += 1;
-        return change;
-    }
-    invert(change) {
-        this.invertedCount += 1;
-        return change.change;
-    }
-    compose(changes) {
-        this.composedCount += changes.length;
-        return changes.length === 0 ? emptyChange : changes[0].change;
-    }
-}
-export class ConstrainedTestChangeRebaser extends TestChangeRebaser {
-    constructor(constraint) {
-        super();
-        this.constraint = constraint;
-    }
-    rebase(change, over) {
-        assert(this.constraint(change, over));
-        return super.rebase(change, over);
-    }
-}
-export class TestAnchorSet extends AnchorSet {
-    constructor() {
-        super(...arguments);
-        this.rebases = [];
-        this.intentions = [];
-    }
-}
-const rootKey = brand("root");
-/**
- * This is a hack to encode arbitrary information (the intentions) into a Delta
- * The resulting Delta does not represent a concrete change to a document tree.
- * It is instead used as composite value in deep comparisons that verify that `EditManager` calls
- * `ChangeFamily.intoDelta` with the expected change.
- */
-export function asDelta(intentions) {
-    return intentions.length === 0
-        ? emptyDelta
-        : {
-            fields: new Map([[rootKey, { local: intentions.map((i) => ({ count: i })) }]]),
-        };
-}
-export function testChangeFamilyFactory(rebaser) {
-    const family = {
-        rebaser: rebaser ?? new TestChangeRebaser(),
-        codecs: makeCodecFamily([[0, TestChange.codec]]),
-        buildEditor: () => ({
-            enterTransaction: () => assert.fail("Unexpected edit"),
-            exitTransaction: () => assert.fail("Unexpected edit"),
-        }),
-    };
-    return family;
-}
-export function isEmpty(change) {
-    return change.intentions.length === 0;
-}
-//# sourceMappingURL=testChange.js.map

package/lib/test/testChange.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"testChange.js","sourceRoot":"","sources":["../../src/test/testChange.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChD,OAAO,EAIN,SAAS,EAGT,UAAU,GAKV,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAc,eAAe,EAAE,MAAM,mBAAmB,CAAC;AAChE,OAAO,EAA6C,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACpF,OAAO,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AA4BxC,SAAS,gBAAgB,CACxB,MAAqC;IAErC,OAAO,cAAc,IAAI,MAAM,CAAC;AACjC,CAAC;AAED,SAAS,IAAI,CAAC,YAA+B,EAAE,SAA4B;IAC1E,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACtE,OAAO;QACN,YAAY,EAAE,iBAAiB,CAAC,EAAE,EAAE,YAAY,CAAC;QACjD,UAAU;QACV,aAAa,EAAE,iBAAiB,CAAC,YAAY,EAAE,UAAU,CAAC;KAC1D,CAAC;AACH,CAAC;AAED,SAAS,iBAAiB,CAAC,IAAuB,EAAE,MAAyB;IAC5E,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;IAC3B,IAAI,IAAI,GAAuB,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC7D,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;QAC3B,uEAAuE;QACvE,wEAAwE;QACxE,8BAA8B;QAC9B,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE;YACpB,QAAQ,CAAC,GAAG,EAAE,CAAC;YACf,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;SACrC;aAAM;YACN,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,IAAI,GAAG,KAAK,CAAC;SACb;KACD;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,OAAO,CACf,OAA+B,EAC/B,OAA+B,EAC/B,SAAkB,IAAI;IAEtB,OAAO,WAAW,CAAC,wBAAwB,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,WAAW,CAAC,OAAqB,EAAE,SAAkB,IAAI;IACjE,IAAI,YAAkC,CAAC;IACvC,IAAI,aAAmC,CAAC;IACxC,IAAI,UAAU,GAAa,EAAE,CAAC;IAC9B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC7B,IAAI,gBAAgB,CAAC,MAAM,CAAC,EAAE;YAC7B,YAAY,KAAZ,YAAY,GAAK,MAAM,CAAC,YAAY,EAAC;YACrC,IAAI,MAAM,IAAI,aAAa,KAAK,SAAS,EAAE;gBAC1C,4EAA4E;gBAC5E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;aACrD;YACD,aAAa,GAAG,iBAAiB,CAAC,aAAa,IAAI,YAAY,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;YACpF,UAAU,GAAG,iBAAiB,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;SAC9D;KACD;IACD,IAAI,YAAY,KAAK,SAAS,EAAE;QAC/B,OAAO;YACN,YAAY;YACZ,UAAU;YACV,aAAa,EAAE,aAAa,IAAI,IAAI,EAAE;SACtC,CAAC;KACF;IACD,OAAO,WAAW,CAAC;AACpB,CAAC;AAED,SAAS,wBAAwB,CAAI,KAAwB;IAC5D,MAAM,MAAM,GAAQ,EAAE,CAAC;IACvB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;QACzB,IAAI,IAAI,KAAK,SAAS,EAAE;YACvB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAClB;KACD;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,MAAM,CAAC,MAAkB;IACjC,IAAI,gBAAgB,CAAC,MAAM,CAAC,EAAE;QAC7B,OAAO;YACN,YAAY,EAAE,MAAM,CAAC,aAAa;YAClC,aAAa,EAAE,MAAM,CAAC,YAAY;YAClC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE;SACtD,CAAC;KACF;IACD,OAAO,WAAW,CAAC;AACpB,CAAC;AAED,SAAS,MAAM,CACd,MAA8B,EAC9B,IAA4B;IAE5B,IAAI,MAAM,KAAK,SAAS,EAAE;QACzB,OAAO,SAAS,CAAC;KACjB;IAED,IAAI,IAAI,KAAK,SAAS,EAAE;QACvB,OAAO,MAAM,CAAC;KACd;IAED,IAAI,gBAAgB,CAAC,MAAM,CAAC,EAAE;QAC7B,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3B,6EAA6E;YAC7E,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YACzD,OAAO;gBACN,YAAY,EAAE,IAAI,CAAC,aAAa;gBAChC,aAAa,EAAE,iBAAiB,CAAC,IAAI,CAAC,aAAa,EAAE,MAAM,CAAC,UAAU,CAAC;gBACvE,UAAU,EAAE,MAAM,CAAC,UAAU;aAC7B,CAAC;SACF;QACD,OAAO,MAAM,CAAC;KACd;IACD,OAAO,UAAU,CAAC,WAAW,CAAC;AAC/B,CAAC;AAED,SAAS,eAAe,CACvB,OAAiD,EACjD,UAAoB;IAEpB,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;IAClD,IAAI,cAAc,GAAa,EAAE,CAAC;IAClC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE;QAC9B,cAAc,GAAG,iBAAiB,CAAC,cAAc,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;QACtE,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YACjC,sFAAsF;YACtF,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;SAC1D;QACD,EAAE,KAAK,CAAC;KACR;IACD,uCAAuC;IACvC,MAAM,CAAC,SAAS,CAAC,cAAc,EAAE,UAAU,CAAC,CAAC;AAC9C,CAAC;AAED,SAAS,OAAO,CAAC,EAAE,MAAM,EAA4B;IACpD,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;QACjC,OAAO,IAAI,GAAG,CAAC;YACd;gBACC,kGAAkG;gBAClG,0CAA0C;gBAC1C,KAAK,CAAC,gBAAgB,CAAC;gBACvB,EAAE,KAAK,EAAE,MAAM,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE;aACvD;SACD,CAAC,CAAC;KACH;IACD,OAAO,IAAI,GAAG,EAAE,CAAC;AAClB,CAAC;AAOD,MAAM,WAAW,GAAe,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;AACnD,MAAM,KAAK,GAMsB;IAChC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAsC;IACrD,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAA0B;CACzC,CAAC;AAEF,MAAM,CAAC,MAAM,UAAU,GAAG;IACzB,WAAW;IACX,IAAI;IACJ,OAAO;IACP,WAAW;IACX,MAAM;IACN,MAAM;IACN,eAAe;IACf,OAAO;IACP,OAAO;IACP,KAAK;CACL,CAAC;AACF,UAAU,CAAC,UAAU,CAAC,CAAC;AAEvB,MAAM,OAAO,iBAAiB;IACtB,OAAO,CAAC,OAAmC;QACjD,OAAO,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAClD,CAAC;IAEM,MAAM,CAAC,MAAgC;QAC7C,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;IAEM,MAAM,CAAC,MAAkB,EAAE,IAA8B;QAC/D,OAAO,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;IAC1D,CAAC;CACD;AAED,MAAM,OAAO,4BAA6B,SAAQ,iBAAiB;IAClD,MAAM,CAAC,MAAkB,EAAE,IAA8B;QACxE,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC1C,CAAC;CACD;AAED,MAAM,OAAO,iBAAkB,SAAQ,iBAAiB;IAAxD;;QACQ,iBAAY,GAAG,CAAC,CAAC;QACjB,kBAAa,GAAG,CAAC,CAAC;QAClB,kBAAa,GAAG,CAAC,CAAC;IAgB1B,CAAC;IAdgB,MAAM,CAAC,MAAkB,EAAE,IAA8B;QACxE,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;QACvB,OAAO,MAAM,CAAC;IACf,CAAC;IAEe,MAAM,CAAC,MAAgC;QACtD,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC;QACxB,OAAO,MAAM,CAAC,MAAM,CAAC;IACtB,CAAC;IAEe,OAAO,CAAC,OAAmC;QAC1D,IAAI,CAAC,aAAa,IAAI,OAAO,CAAC,MAAM,CAAC;QACrC,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC/D,CAAC;CACD;AAED,MAAM,OAAO,4BAA6B,SAAQ,iBAAiB;IAClE,YACkB,UAGL;QAEZ,KAAK,EAAE,CAAC;QALS,eAAU,GAAV,UAAU,CAGf;IAGb,CAAC;IAEe,MAAM,CAAC,MAAkB,EAAE,IAA8B;QACxE,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;CACD;AAED,MAAM,OAAO,aAAc,SAAQ,SAAS;IAA5C;;QACQ,YAAO,GAA4C,EAAE,CAAC;QACtD,eAAU,GAAa,EAAE,CAAC;IAClC,CAAC;CAAA;AAID,MAAM,OAAO,GAAa,KAAK,CAAC,MAAM,CAAC,CAAC;AAExC;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAC,UAAoB;IAC3C,OAAO,UAAU,CAAC,MAAM,KAAK,CAAC;QAC7B,CAAC,CAAC,UAAU;QACZ,CAAC,CAAC;YACA,MAAM,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC7E,CAAC;AACN,CAAC;AAED,MAAM,UAAU,uBAAuB,CACtC,OAAmC;IAEnC,MAAM,MAAM,GAAG;QACd,OAAO,EAAE,OAAO,IAAI,IAAI,iBAAiB,EAAE;QAC3C,MAAM,EAAE,eAAe,CAAoC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC;QACnF,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;YACnB,gBAAgB,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC;YACtD,eAAe,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC;SACrD,CAAC;KACF,CAAC;IACF,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,MAAkB;IACzC,OAAO,MAAM,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,CAAC;AACvC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { fail, strict as assert } from \"assert\";\nimport {\n\tChangeFamily,\n\tChangeRebaser,\n\tTaggedChange,\n\tAnchorSet,\n\tChangeFamilyEditor,\n\tFieldKey,\n\temptyDelta,\n\tDeltaFieldMap,\n\tDeltaRoot,\n\tChangeFamilyCodec,\n\tChangeEncodingContext,\n} from \"../core/index.js\";\nimport { IJsonCodec, makeCodecFamily } from \"../codec/index.js\";\nimport { JsonCompatibleReadOnly, RecursiveReadonly, brand } from \"../util/index.js\";\nimport { deepFreeze } from \"./utils.js\";\n\nexport interface NonEmptyTestChange {\n\t/**\n\t * Identifies the document state that the change should apply to.\n\t * Represented as the concatenation of all previous intentions.\n\t */\n\tinputContext: number[];\n\t/**\n\t * Identifies the document state brought about by applying the change to the document.\n\t * Represented as the concatenation of all previous intentions and the intentions in this change.\n\t */\n\toutputContext: number[];\n\t/**\n\t * Identifies the editing intentions included in the change.\n\t * Editing intentions can be thought of as user actions, where each user action is unique.\n\t * Editing intentions can be inverted (represented negative number of the same magnitude) but are\n\t * otherwise unchanged by rebasing.\n\t */\n\tintentions: number[];\n}\n\nexport interface EmptyTestChange {\n\tintentions: [];\n}\n\nexport type TestChange = NonEmptyTestChange | EmptyTestChange;\n\nfunction isNonEmptyChange(\n\tchange: RecursiveReadonly<TestChange>,\n): change is RecursiveReadonly<NonEmptyTestChange> {\n\treturn \"inputContext\" in change;\n}\n\nfunction mint(inputContext: readonly number[], intention: number | number[]): NonEmptyTestChange {\n\tconst intentions = Array.isArray(intention) ? intention : [intention];\n\treturn {\n\t\tinputContext: composeIntentions([], inputContext),\n\t\tintentions,\n\t\toutputContext: composeIntentions(inputContext, intentions),\n\t};\n}\n\nfunction composeIntentions(base: readonly number[], extras: readonly number[]): number[] {\n\tconst composed = [...base];\n\tlet last: number | undefined = composed[composed.length - 1];\n\tfor (const extra of extras) {\n\t\t// Check wether we are composing intentions that cancel each other out.\n\t\t// This helps us ensure that we always represent sequences of intentions\n\t\t// in the same canonical form.\n\t\tif (last === -extra) {\n\t\t\tcomposed.pop();\n\t\t\tlast = composed[composed.length - 1];\n\t\t} else {\n\t\t\tcomposed.push(extra);\n\t\t\tlast = extra;\n\t\t}\n\t}\n\treturn composed;\n}\n\nfunction compose(\n\tchange1: TestChange | undefined,\n\tchange2: TestChange | undefined,\n\tverify: boolean = true,\n): TestChange {\n\treturn composeList(getArrayWithoutUndefined([change1, change2]), verify);\n}\n\nfunction composeList(changes: TestChange[], verify: boolean = true): TestChange {\n\tlet inputContext: number[] | undefined;\n\tlet outputContext: number[] | undefined;\n\tlet intentions: number[] = [];\n\tfor (const change of changes) {\n\t\tif (isNonEmptyChange(change)) {\n\t\t\tinputContext ??= change.inputContext;\n\t\t\tif (verify && outputContext !== undefined) {\n\t\t\t\t// The input context should match the output context of the previous change.\n\t\t\t\tassert.deepEqual(change.inputContext, outputContext);\n\t\t\t}\n\t\t\toutputContext = composeIntentions(outputContext ?? inputContext, change.intentions);\n\t\t\tintentions = composeIntentions(intentions, change.intentions);\n\t\t}\n\t}\n\tif (inputContext !== undefined) {\n\t\treturn {\n\t\t\tinputContext,\n\t\t\tintentions,\n\t\t\toutputContext: outputContext ?? fail(),\n\t\t};\n\t}\n\treturn emptyChange;\n}\n\nfunction getArrayWithoutUndefined<T>(array: (T | undefined)[]): T[] {\n\tconst result: T[] = [];\n\tfor (const item of array) {\n\t\tif (item !== undefined) {\n\t\t\tresult.push(item);\n\t\t}\n\t}\n\treturn result;\n}\n\nfunction invert(change: TestChange): TestChange {\n\tif (isNonEmptyChange(change)) {\n\t\treturn {\n\t\t\tinputContext: change.outputContext,\n\t\t\toutputContext: change.inputContext,\n\t\t\tintentions: change.intentions.map((i) => -i).reverse(),\n\t\t};\n\t}\n\treturn emptyChange;\n}\n\nfunction rebase(\n\tchange: TestChange | undefined,\n\tover: TestChange | undefined,\n): TestChange | undefined {\n\tif (change === undefined) {\n\t\treturn undefined;\n\t}\n\n\tif (over === undefined) {\n\t\treturn change;\n\t}\n\n\tif (isNonEmptyChange(change)) {\n\t\tif (isNonEmptyChange(over)) {\n\t\t\t// Rebasing should only occur between two changes with the same input context\n\t\t\tassert.deepEqual(change.inputContext, over.inputContext);\n\t\t\treturn {\n\t\t\t\tinputContext: over.outputContext,\n\t\t\t\toutputContext: composeIntentions(over.outputContext, change.intentions),\n\t\t\t\tintentions: change.intentions,\n\t\t\t};\n\t\t}\n\t\treturn change;\n\t}\n\treturn TestChange.emptyChange;\n}\n\nfunction checkChangeList(\n\tchanges: readonly RecursiveReadonly<TestChange>[],\n\tintentions: number[],\n): void {\n\tconst filtered = changes.filter(isNonEmptyChange);\n\tlet intentionsSeen: number[] = [];\n\tlet index = 0;\n\tfor (const change of filtered) {\n\t\tintentionsSeen = composeIntentions(intentionsSeen, change.intentions);\n\t\tif (index > 0) {\n\t\t\tconst prev = filtered[index - 1];\n\t\t\t// The current change should apply to the context brought about by the previous change\n\t\t\tassert.deepEqual(change.inputContext, prev.outputContext);\n\t\t}\n\t\t++index;\n\t}\n\t// All expected intentions were present\n\tassert.deepEqual(intentionsSeen, intentions);\n}\n\nfunction toDelta({ change }: TaggedChange<TestChange>): DeltaFieldMap {\n\tif (change.intentions.length > 0) {\n\t\treturn new Map([\n\t\t\t[\n\t\t\t\t// We represent the intentions as a list if node offsets in some imaginary field \"testIntentions\".\n\t\t\t\t// This is purely for the sake of testing.\n\t\t\t\tbrand(\"testIntentions\"),\n\t\t\t\t{ local: change.intentions.map((i) => ({ count: i })) },\n\t\t\t],\n\t\t]);\n\t}\n\treturn new Map();\n}\n\nexport interface AnchorRebaseData {\n\trebases: RecursiveReadonly<NonEmptyTestChange>[];\n\tintentions: number[];\n}\n\nconst emptyChange: TestChange = { intentions: [] };\nconst codec: IJsonCodec<\n\tTestChange,\n\tJsonCompatibleReadOnly,\n\tJsonCompatibleReadOnly,\n\tChangeEncodingContext\n> &\n\tChangeFamilyCodec<TestChange> = {\n\tencode: (x) => x as unknown as JsonCompatibleReadOnly,\n\tdecode: (x) => x as unknown as TestChange,\n};\n\nexport const TestChange = {\n\temptyChange,\n\tmint,\n\tcompose,\n\tcomposeList,\n\tinvert,\n\trebase,\n\tcheckChangeList,\n\ttoDelta,\n\tisEmpty,\n\tcodec,\n};\ndeepFreeze(TestChange);\n\nexport class TestChangeRebaser implements ChangeRebaser<TestChange> {\n\tpublic compose(changes: TaggedChange<TestChange>[]): TestChange {\n\t\treturn composeList(changes.map((c) => c.change));\n\t}\n\n\tpublic invert(change: TaggedChange<TestChange>): TestChange {\n\t\treturn invert(change.change);\n\t}\n\n\tpublic rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange {\n\t\treturn rebase(change, over.change) ?? { intentions: [] };\n\t}\n}\n\nexport class UnrebasableTestChangeRebaser extends TestChangeRebaser {\n\tpublic override rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange {\n\t\tassert.fail(\"Unexpected call to rebase\");\n\t}\n}\n\nexport class NoOpChangeRebaser extends TestChangeRebaser {\n\tpublic rebasedCount = 0;\n\tpublic invertedCount = 0;\n\tpublic composedCount = 0;\n\n\tpublic override rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange {\n\t\tthis.rebasedCount += 1;\n\t\treturn change;\n\t}\n\n\tpublic override invert(change: TaggedChange<TestChange>): TestChange {\n\t\tthis.invertedCount += 1;\n\t\treturn change.change;\n\t}\n\n\tpublic override compose(changes: TaggedChange<TestChange>[]): TestChange {\n\t\tthis.composedCount += changes.length;\n\t\treturn changes.length === 0 ? emptyChange : changes[0].change;\n\t}\n}\n\nexport class ConstrainedTestChangeRebaser extends TestChangeRebaser {\n\tpublic constructor(\n\t\tprivate readonly constraint: (\n\t\t\tchange: TestChange,\n\t\t\tover: TaggedChange<TestChange>,\n\t\t) => boolean,\n\t) {\n\t\tsuper();\n\t}\n\n\tpublic override rebase(change: TestChange, over: TaggedChange<TestChange>): TestChange {\n\t\tassert(this.constraint(change, over));\n\t\treturn super.rebase(change, over);\n\t}\n}\n\nexport class TestAnchorSet extends AnchorSet implements AnchorRebaseData {\n\tpublic rebases: RecursiveReadonly<NonEmptyTestChange>[] = [];\n\tpublic intentions: number[] = [];\n}\n\nexport type TestChangeFamily = ChangeFamily<ChangeFamilyEditor, TestChange>;\n\nconst rootKey: FieldKey = brand(\"root\");\n\n/**\n * This is a hack to encode arbitrary information (the intentions) into a Delta\n * The resulting Delta does not represent a concrete change to a document tree.\n * It is instead used as composite value in deep comparisons that verify that `EditManager` calls\n * `ChangeFamily.intoDelta` with the expected change.\n */\nexport function asDelta(intentions: number[]): DeltaRoot {\n\treturn intentions.length === 0\n\t\t? emptyDelta\n\t\t: {\n\t\t\t\tfields: new Map([[rootKey, { local: intentions.map((i) => ({ count: i })) }]]),\n\t\t  };\n}\n\nexport function testChangeFamilyFactory(\n\trebaser?: ChangeRebaser<TestChange>,\n): ChangeFamily<ChangeFamilyEditor, TestChange> {\n\tconst family = {\n\t\trebaser: rebaser ?? new TestChangeRebaser(),\n\t\tcodecs: makeCodecFamily<TestChange, ChangeEncodingContext>([[0, TestChange.codec]]),\n\t\tbuildEditor: () => ({\n\t\t\tenterTransaction: () => assert.fail(\"Unexpected edit\"),\n\t\t\texitTransaction: () => assert.fail(\"Unexpected edit\"),\n\t\t}),\n\t};\n\treturn family;\n}\n\nexport function isEmpty(change: TestChange): boolean {\n\treturn change.intentions.length === 0;\n}\n"]}

package/lib/test/testChange.spec.d.ts

@@ -1,6 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-export {};
-//# sourceMappingURL=testChange.spec.d.ts.map

package/lib/test/testChange.spec.d.ts.map

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

package/lib/test/testChange.spec.js

@@ -1,113 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict as assert } from "assert";
-import { makeAnonChange, tagChange, } from "../core/index.js";
-import { brand } from "../util/index.js";
-import { TestChange } from "./testChange.js";
-import { runExhaustiveComposeRebaseSuite } from "./rebaserAxiomaticTests.js";
-import { deepFreeze, mintRevisionTag } from "./utils.js";
-describe("TestChange", () => {
-    it("can be composed", () => {
-        const change1 = TestChange.mint([0, 1], 2);
-        const change2 = TestChange.mint([0, 1, 2], 3);
-        const composed = TestChange.compose(change1, change2);
-        const expected = TestChange.mint([0, 1], [2, 3]);
-        assert.deepEqual(composed, expected);
-    });
-    it("can be composed without verification", () => {
-        const change1 = TestChange.mint([0], 1);
-        const change2 = TestChange.mint([2], 3);
-        const composed = TestChange.compose(change1, change2, false);
-        const expected = TestChange.mint([0], [1, 3]);
-        assert.deepEqual(composed, expected);
-    });
-    it("composition of inverses leads to normalized form", () => {
-        const change1 = TestChange.mint([0], [1, 2]);
-        const change2 = TestChange.mint([0, 1, 2], [-2, -1, 3]);
-        const composed = TestChange.compose(change1, change2);
-        const expected = TestChange.mint([0], [3]);
-        assert.deepEqual(composed, expected);
-    });
-    it("can be inverted", () => {
-        const change1 = TestChange.mint([0, 1], 2);
-        const inverted = TestChange.invert(change1);
-        const expected = TestChange.mint([0, 1, 2], -2);
-        assert.deepEqual(inverted, expected);
-    });
-    it("can be rebased", () => {
-        const change1 = TestChange.mint([0], 1);
-        const change2 = TestChange.mint([0], 2);
-        const rebased = TestChange.rebase(change2, change1);
-        const expected = TestChange.mint([0, 1], 2);
-        assert.deepEqual(rebased, expected);
-    });
-    it("can be represented as a delta", () => {
-        const change1 = TestChange.mint([0, 1], [2, 3]);
-        const tag = mintRevisionTag();
-        const delta = TestChange.toDelta(tagChange(change1, tag));
-        const field = brand("testIntentions");
-        const expected = new Map([
-            [
-                field,
-                {
-                    local: [{ count: 2 }, { count: 3 }],
-                },
-            ],
-        ]);
-        assert.deepEqual(delta, expected);
-        assert.deepEqual(TestChange.toDelta(makeAnonChange(TestChange.mint([0, 1], []))), new Map());
-    });
-    it("can be encoded in JSON", () => {
-        const codec = TestChange.codec;
-        const empty = TestChange.emptyChange;
-        const context = { originatorId: "session1" };
-        const normal = TestChange.mint([0, 1], [2, 3]);
-        assert.deepEqual(empty, codec.decode(codec.encode(empty, context), context));
-        assert.deepEqual(normal, codec.decode(codec.encode(normal, context), context));
-    });
-    function rebaseComposed(metadata, change, ...baseChanges) {
-        baseChanges.forEach((base) => deepFreeze(base));
-        deepFreeze(change);
-        const composed = TestChange.composeList(baseChanges.map((c) => c.change));
-        const rebaseResult = TestChange.rebase(change, composed);
-        assert(rebaseResult !== undefined, "Shouldn't get undefined.");
-        return rebaseResult;
-    }
-    /**
-     * See {@link ChildStateGenerator}
-     */
-    const generateChildStates = function* (state, tagFromIntention, mintIntention) {
-        const context = state.content;
-        const intention = mintIntention();
-        const change = TestChange.mint(context, intention);
-        yield {
-            content: change.outputContext,
-            mostRecentEdit: {
-                changeset: tagChange(change, tagFromIntention(intention)),
-                description: JSON.stringify(intention),
-                intention,
-            },
-            parent: state,
-        };
-    };
-    describe("Rebaser Axioms", () => {
-        describe("Exhaustive suite", () => {
-            runExhaustiveComposeRebaseSuite([{ content: [] }], generateChildStates, {
-                rebase: (change, base) => {
-                    return TestChange.rebase(change, base.change) ?? TestChange.emptyChange;
-                },
-                compose: (change1, change2) => {
-                    return TestChange.compose(change1.change, change2.change);
-                },
-                invert: (change) => {
-                    return TestChange.invert(change.change);
-                },
-                rebaseComposed,
-                createEmpty: () => TestChange.emptyChange,
-            }, { numberOfEditsToRebase: 4, numberOfEditsToRebaseOver: 4 });
-        });
-    });
-});
-//# sourceMappingURL=testChange.spec.js.map

package/lib/test/testChange.spec.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"testChange.spec.js","sourceRoot":"","sources":["../../src/test/testChange.spec.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,IAAI,MAAM,EAAE,MAAM,QAAQ,CAAC;AAE1C,OAAO,EACN,cAAc,EAEd,SAAS,GAKT,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAE,UAAU,EAAE,MAAM,iBAAiB,CAAC;AAE7C,OAAO,EAAE,+BAA+B,EAAE,MAAM,4BAA4B,CAAC;AAC7E,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAEzD,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC/C,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QAE7D,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;QAC3D,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAEtD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;QAC1B,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAE5C,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;QACzB,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAEpD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,MAAM,CAAC,SAAS,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACxC,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,MAAM,GAAG,GAAG,eAAe,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;QAC1D,MAAM,KAAK,GAAa,KAAK,CAAC,gBAAgB,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC;YACxB;gBACC,KAAK;gBACL;oBACC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;iBACnC;aACD;SACD,CAAC,CAAC;QAEH,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAClC,MAAM,CAAC,SAAS,CACf,UAAU,CAAC,OAAO,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAC/D,IAAI,GAAG,EAAE,CACT,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;QACjC,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC;QAC/B,MAAM,KAAK,GAAG,UAAU,CAAC,WAAW,CAAC;QACrC,MAAM,OAAO,GAA0B,EAAE,YAAY,EAAE,UAAuB,EAAE,CAAC;QACjF,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/C,MAAM,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;QAC7E,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IAChF,CAAC,CAAC,CAAC;IAIH,SAAS,cAAc,CACtB,QAAgC,EAChC,MAAkB,EAClB,GAAG,WAAuC;QAE1C,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,UAAU,CAAC,MAAM,CAAC,CAAC;QAEnB,MAAM,QAAQ,GAAG,UAAU,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1E,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QACzD,MAAM,CAAC,YAAY,KAAK,SAAS,EAAE,0BAA0B,CAAC,CAAC;QAC/D,OAAO,YAAY,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,MAAM,mBAAmB,GAA8C,QAAQ,CAAC,EAC/E,KAA0B,EAC1B,gBAAoD,EACpD,aAA2B;QAE3B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC;QAC9B,MAAM,SAAS,GAAG,aAAa,EAAE,CAAC;QAClC,MAAM,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACnD,MAAM;YACL,OAAO,EAAE,MAAM,CAAC,aAAa;YAC7B,cAAc,EAAE;gBACf,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,gBAAgB,CAAC,SAAS,CAAC,CAAC;gBACzD,WAAW,EAAE,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC;gBACtC,SAAS;aACT;YACD,MAAM,EAAE,KAAK;SACb,CAAC;IACH,CAAC,CAAC;IAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC/B,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;YACjC,+BAA+B,CAC9B,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EACjB,mBAAmB,EACnB;gBACC,MAAM,EAAE,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;oBACxB,OAAO,UAAU,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,UAAU,CAAC,WAAW,CAAC;gBACzE,CAAC;gBACD,OAAO,EAAE,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE;oBAC7B,OAAO,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC3D,CAAC;gBACD,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE;oBAClB,OAAO,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACzC,CAAC;gBACD,cAAc;gBACd,WAAW,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,WAAW;aACzC,EACD,EAAE,qBAAqB,EAAE,CAAC,EAAE,yBAAyB,EAAE,CAAC,EAAE,CAC1D,CAAC;QACH,CAAC,CAAC,CAAC;IACJ,CAAC,CAAC,CAAC;AACJ,CAAC,CAAC,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict as assert } from \"assert\";\nimport { SessionId } from \"@fluidframework/id-compressor\";\nimport {\n\tmakeAnonChange,\n\tFieldKey,\n\ttagChange,\n\tRevisionTag,\n\tTaggedChange,\n\tRevisionMetadataSource,\n\tChangeEncodingContext,\n} from \"../core/index.js\";\nimport { brand } from \"../util/index.js\";\nimport { TestChange } from \"./testChange.js\";\nimport { ChildStateGenerator, FieldStateTree } from \"./exhaustiveRebaserUtils.js\";\nimport { runExhaustiveComposeRebaseSuite } from \"./rebaserAxiomaticTests.js\";\nimport { deepFreeze, mintRevisionTag } from \"./utils.js\";\n\ndescribe(\"TestChange\", () => {\n\tit(\"can be composed\", () => {\n\t\tconst change1 = TestChange.mint([0, 1], 2);\n\t\tconst change2 = TestChange.mint([0, 1, 2], 3);\n\t\tconst composed = TestChange.compose(change1, change2);\n\n\t\tconst expected = TestChange.mint([0, 1], [2, 3]);\n\t\tassert.deepEqual(composed, expected);\n\t});\n\n\tit(\"can be composed without verification\", () => {\n\t\tconst change1 = TestChange.mint([0], 1);\n\t\tconst change2 = TestChange.mint([2], 3);\n\t\tconst composed = TestChange.compose(change1, change2, false);\n\n\t\tconst expected = TestChange.mint([0], [1, 3]);\n\t\tassert.deepEqual(composed, expected);\n\t});\n\n\tit(\"composition of inverses leads to normalized form\", () => {\n\t\tconst change1 = TestChange.mint([0], [1, 2]);\n\t\tconst change2 = TestChange.mint([0, 1, 2], [-2, -1, 3]);\n\t\tconst composed = TestChange.compose(change1, change2);\n\n\t\tconst expected = TestChange.mint([0], [3]);\n\t\tassert.deepEqual(composed, expected);\n\t});\n\n\tit(\"can be inverted\", () => {\n\t\tconst change1 = TestChange.mint([0, 1], 2);\n\t\tconst inverted = TestChange.invert(change1);\n\n\t\tconst expected = TestChange.mint([0, 1, 2], -2);\n\t\tassert.deepEqual(inverted, expected);\n\t});\n\n\tit(\"can be rebased\", () => {\n\t\tconst change1 = TestChange.mint([0], 1);\n\t\tconst change2 = TestChange.mint([0], 2);\n\t\tconst rebased = TestChange.rebase(change2, change1);\n\n\t\tconst expected = TestChange.mint([0, 1], 2);\n\t\tassert.deepEqual(rebased, expected);\n\t});\n\n\tit(\"can be represented as a delta\", () => {\n\t\tconst change1 = TestChange.mint([0, 1], [2, 3]);\n\t\tconst tag = mintRevisionTag();\n\t\tconst delta = TestChange.toDelta(tagChange(change1, tag));\n\t\tconst field: FieldKey = brand(\"testIntentions\");\n\t\tconst expected = new Map([\n\t\t\t[\n\t\t\t\tfield,\n\t\t\t\t{\n\t\t\t\t\tlocal: [{ count: 2 }, { count: 3 }],\n\t\t\t\t},\n\t\t\t],\n\t\t]);\n\n\t\tassert.deepEqual(delta, expected);\n\t\tassert.deepEqual(\n\t\t\tTestChange.toDelta(makeAnonChange(TestChange.mint([0, 1], []))),\n\t\t\tnew Map(),\n\t\t);\n\t});\n\n\tit(\"can be encoded in JSON\", () => {\n\t\tconst codec = TestChange.codec;\n\t\tconst empty = TestChange.emptyChange;\n\t\tconst context: ChangeEncodingContext = { originatorId: \"session1\" as SessionId };\n\t\tconst normal = TestChange.mint([0, 1], [2, 3]);\n\t\tassert.deepEqual(empty, codec.decode(codec.encode(empty, context), context));\n\t\tassert.deepEqual(normal, codec.decode(codec.encode(normal, context), context));\n\t});\n\n\ttype TestChangeTestState = FieldStateTree<number[], TestChange>;\n\n\tfunction rebaseComposed(\n\t\tmetadata: RevisionMetadataSource,\n\t\tchange: TestChange,\n\t\t...baseChanges: TaggedChange<TestChange>[]\n\t): TestChange {\n\t\tbaseChanges.forEach((base) => deepFreeze(base));\n\t\tdeepFreeze(change);\n\n\t\tconst composed = TestChange.composeList(baseChanges.map((c) => c.change));\n\t\tconst rebaseResult = TestChange.rebase(change, composed);\n\t\tassert(rebaseResult !== undefined, \"Shouldn't get undefined.\");\n\t\treturn rebaseResult;\n\t}\n\n\t/**\n\t * See {@link ChildStateGenerator}\n\t */\n\tconst generateChildStates: ChildStateGenerator<number[], TestChange> = function* (\n\t\tstate: TestChangeTestState,\n\t\ttagFromIntention: (intention: number) => RevisionTag,\n\t\tmintIntention: () => number,\n\t): Iterable<TestChangeTestState> {\n\t\tconst context = state.content;\n\t\tconst intention = mintIntention();\n\t\tconst change = TestChange.mint(context, intention);\n\t\tyield {\n\t\t\tcontent: change.outputContext,\n\t\t\tmostRecentEdit: {\n\t\t\t\tchangeset: tagChange(change, tagFromIntention(intention)),\n\t\t\t\tdescription: JSON.stringify(intention),\n\t\t\t\tintention,\n\t\t\t},\n\t\t\tparent: state,\n\t\t};\n\t};\n\n\tdescribe(\"Rebaser Axioms\", () => {\n\t\tdescribe(\"Exhaustive suite\", () => {\n\t\t\trunExhaustiveComposeRebaseSuite(\n\t\t\t\t[{ content: [] }],\n\t\t\t\tgenerateChildStates,\n\t\t\t\t{\n\t\t\t\t\trebase: (change, base) => {\n\t\t\t\t\t\treturn TestChange.rebase(change, base.change) ?? TestChange.emptyChange;\n\t\t\t\t\t},\n\t\t\t\t\tcompose: (change1, change2) => {\n\t\t\t\t\t\treturn TestChange.compose(change1.change, change2.change);\n\t\t\t\t\t},\n\t\t\t\t\tinvert: (change) => {\n\t\t\t\t\t\treturn TestChange.invert(change.change);\n\t\t\t\t\t},\n\t\t\t\t\trebaseComposed,\n\t\t\t\t\tcreateEmpty: () => TestChange.emptyChange,\n\t\t\t\t},\n\t\t\t\t{ numberOfEditsToRebase: 4, numberOfEditsToRebaseOver: 4 },\n\t\t\t);\n\t\t});\n\t});\n});\n"]}

package/lib/test/testTrees.d.ts

@@ -1,56 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { JsonableTree } from "../core/index.js";
-import { FlexFieldSchema, FullSchemaPolicy, SchemaLibrary, FlexTreeSchema } from "../feature-libraries/index.js";
-import { TreeContent } from "../shared-tree/index.js";
-interface TestTree {
-    readonly name: string;
-    readonly schemaData: FlexTreeSchema;
-    readonly policy: FullSchemaPolicy;
-    readonly treeFactory: () => JsonableTree[];
-}
-export declare function treeContentFromTestTree(test: TestTree): TreeContent;
-export declare const minimal: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.minimal", {}>;
-export declare const hasMinimalValueField: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.hasMinimalValueField", {
-    readonly field: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.minimal", {}>]>;
-}>;
-export declare const hasNumericValueField: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.hasNumericValueField", {
-    readonly field: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>;
-export declare const hasPolymorphicValueField: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.hasPolymorphicValueField", {
-    readonly field: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>, import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.minimal", {}>]>;
-}>;
-export declare const hasAnyValueField: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.hasAnyValueField", {
-    readonly field: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly ["Any"]>;
-}>;
-export declare const hasOptionalField: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.hasOptionalField", {
-    readonly field: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>;
-export declare const allTheFields: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.allTheFields", {
-    readonly optional: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-    readonly valueField: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-    readonly sequence: FlexFieldSchema<import("../feature-libraries/index.js").Sequence, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>;
-export declare const anyFields: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.anyFields", {
-    readonly optional: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly ["Any"]>;
-    readonly valueField: FlexFieldSchema<import("../feature-libraries/index.js").Required, readonly ["Any"]>;
-    readonly sequence: FlexFieldSchema<import("../feature-libraries/index.js").Sequence, readonly ["Any"]>;
-}>;
-export declare const escapedFieldProperties: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.escapedFieldProperties", {
-    readonly value: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-    readonly set: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-    readonly setValue: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-    readonly field: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>;
-}>;
-export declare const numericMap: import("../feature-libraries/index.js").FlexMapNodeSchema<"test.numericMap", FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [import("../feature-libraries/index.js").LeafNodeSchema<"com.fluidframework.leaf.number", import("../core/index.js").ValueSchema.Number>]>>;
-export declare const anyMap: import("../feature-libraries/index.js").FlexMapNodeSchema<"test.anyMap", FlexFieldSchema<import("../feature-libraries/index.js").Sequence, readonly ["Any"]>>;
-export declare const recursiveType: import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.recursiveType", {
-    readonly field: FlexFieldSchema<import("../feature-libraries/index.js").Optional, readonly [() => import("../feature-libraries/index.js").FlexObjectNodeSchema<"test.recursiveType", any>]>;
-}>;
-export declare const library: SchemaLibrary;
-export declare const storedLibrary: import("../core/index.js").StoredSchemaCollection;
-export declare const testTrees: readonly TestTree[];
-export {};
-//# sourceMappingURL=testTrees.d.ts.map

package/lib/test/testTrees.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"testTrees.d.ts","sourceRoot":"","sources":["../../src/test/testTrees.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAKH,OAAO,EAA0B,YAAY,EAAE,MAAM,kBAAkB,CAAC;AACxE,OAAO,EAGN,eAAe,EACf,gBAAgB,EAEhB,aAAa,EAEb,cAAc,EAWd,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAGtD,UAAU,QAAQ;IACjB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,UAAU,EAAE,cAAc,CAAC;IACpC,QAAQ,CAAC,MAAM,EAAE,gBAAgB,CAAC;IAClC,QAAQ,CAAC,WAAW,EAAE,MAAM,YAAY,EAAE,CAAC;CAC3C;AAgDD,wBAAgB,uBAAuB,CAAC,IAAI,EAAE,QAAQ,GAAG,WAAW,CAQnE;AAMD,eAAO,MAAM,OAAO,kFAAgC,CAAC;AACrD,eAAO,MAAM,oBAAoB;;EAE/B,CAAC;AACH,eAAO,MAAM,oBAAoB;;EAE/B,CAAC;AACH,eAAO,MAAM,wBAAwB;;EAEnC,CAAC;AACH,eAAO,MAAM,gBAAgB;;EAE3B,CAAC;AACH,eAAO,MAAM,gBAAgB;;EAE3B,CAAC;AACH,eAAO,MAAM,YAAY;;;;EAIvB,CAAC;AACH,eAAO,MAAM,SAAS;;;;EAIpB,CAAC;AACH,eAAO,MAAM,sBAAsB;;;;;EAKjC,CAAC;AAEH,eAAO,MAAM,UAAU,qSAGtB,CAAC;AAIF,eAAO,MAAM,MAAM,+JAA4E,CAAC;AAEhG,eAAO,MAAM,aAAa;;EAExB,CAAC;AAEH,eAAO,MAAM,OAAO,eAAwB,CAAC;AAC7C,eAAO,MAAM,aAAa,mDAAsC,CAAC;AAEjE,eAAO,MAAM,SAAS,EAAE,SAAS,QAAQ,EA4FxC,CAAC"}