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

package/lib/test/feature-libraries/sequence-field/utils.js

@@ -1,535 +0,0 @@
-/*!
- * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
- * Licensed under the MIT License.
- */
-import { strict } from "assert";
-import { assert, unreachableCase } from "@fluidframework/core-utils";
-import { SequenceField as SF } from "../../../feature-libraries/index.js";
-import { makeAnonChange, revisionMetadataSourceFromInfo, tagChange, } from "../../../core/index.js";
-import { TestChange } from "../../testChange.js";
-import { assertFieldChangesEqual, deepFreeze, defaultRevInfosFromChanges, defaultRevisionMetadataFromChanges, } from "../../utils.js";
-import { brand, fail, fakeIdAllocator, getOrAddEmptyToMap, idAllocatorFromMaxId, } from "../../../util/index.js";
-import { areInputCellsEmpty, cloneMark, getInputLength, isActiveReattach, isAttachAndDetachEffect, isDetach, isNewAttach, isTombstone, markEmptiesCells, splitMark,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/sequence-field/utils.js";
-import { CellOrderingMethod, sequenceConfig,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/sequence-field/config.js";
-import { MarkListFactory,
-// eslint-disable-next-line import/no-internal-modules
- } from "../../../feature-libraries/sequence-field/index.js";
-// eslint-disable-next-line import/no-internal-modules
-import { rebaseRevisionMetadataFromInfo } from "../../../feature-libraries/modular-schema/modularChangeFamily.js";
-export function assertChangesetsEqual(actual, expected) {
-    const updatedExpected = purgeUnusedCellOrderingInfo(expected);
-    strict.deepEqual(actual, updatedExpected);
-}
-export function purgeUnusedCellOrderingInfo(change) {
-    switch (sequenceConfig.cellOrdering) {
-        case CellOrderingMethod.Tombstone:
-            return withoutLineage(change);
-        case CellOrderingMethod.Lineage:
-            return withoutTombstones(change);
-        default:
-            unreachableCase(sequenceConfig.cellOrdering);
-    }
-}
-export function skipOnLineageMethod(config, title, fn) {
-    if (config.cellOrdering === CellOrderingMethod.Lineage) {
-        it.skip(title, fn);
-    }
-    else {
-        it(title, fn);
-    }
-}
-export function onlyOnLineageMethod(config, title, fn) {
-    if (config.cellOrdering === CellOrderingMethod.Lineage) {
-        it(title, fn);
-    }
-    else {
-        it.skip(title, fn);
-    }
-}
-export function skipOnTombstoneMethod(config, title, fn) {
-    if (config.cellOrdering === CellOrderingMethod.Tombstone) {
-        it.skip(title, fn);
-    }
-    else {
-        it(title, fn);
-    }
-}
-export function onlyOnTombstoneMethod(config, title, fn) {
-    if (config.cellOrdering === CellOrderingMethod.Tombstone) {
-        it(title, fn);
-    }
-    else {
-        it.skip(title, fn);
-    }
-}
-export function describeForBothConfigs(title, fn) {
-    describe(title, () => {
-        for (const method of [CellOrderingMethod.Tombstone, CellOrderingMethod.Lineage]) {
-            describe(`${method}-based cell ordering`, () => {
-                withOrderingMethod(method, fn);
-            });
-        }
-    });
-}
-export function withOrderingMethod(method, fn) {
-    const priorMethod = sequenceConfig.cellOrdering;
-    const mutableConfig = sequenceConfig;
-    mutableConfig.cellOrdering = method;
-    try {
-        // It's important that return a new object here rather `sequenceConfig` because `fn` may keep a reference to it
-        // (e.g., a lambda's closure) while it may be mutated between the time that reference it taken and the time the
-        // config is read.
-        // Most notably, this is the case when using `describeForBothConfigs` which mutates `sequenceConfig` but does
-        // not run the tests within it immediately.
-        fn({ ...sequenceConfig });
-    }
-    finally {
-        mutableConfig.cellOrdering = priorMethod;
-    }
-}
-export function composeNoVerify(changes, revInfos) {
-    return composeI(changes, (change1, change2) => TestChange.compose(change1, change2, false), revInfos);
-}
-export function compose(changes, revInfos, childComposer) {
-    return composeI(changes, childComposer ?? TestChange.compose, revInfos);
-}
-export function prune(change, childPruner) {
-    return SF.sequenceFieldChangeRebaser.prune(change, childPruner ?? ((child) => (TestChange.isEmpty(child) ? undefined : child)));
-}
-export function shallowCompose(changes, revInfos) {
-    return composeI(changes, (child1, child2) => {
-        assert(child1 === undefined || child2 === undefined, "Should only have one child to compose");
-        return child1 ?? child2 ?? fail("One of the children should be defined");
-    }, revInfos);
-}
-function composeI(changes, composer, revInfos) {
-    const updatedChanges = changes.map(({ change, revision, rollbackOf }) => ({
-        change: purgeUnusedCellOrderingInfo(change),
-        revision,
-        rollbackOf,
-    }));
-    const idAllocator = continuingAllocator(updatedChanges);
-    const metadata = revInfos !== undefined
-        ? Array.isArray(revInfos)
-            ? revisionMetadataSourceFromInfo(revInfos)
-            : revInfos
-        : defaultRevisionMetadataFromChanges(updatedChanges);
-    let composed = [];
-    for (const change of updatedChanges) {
-        composed = composePair(makeAnonChange(composed), change, composer, metadata, idAllocator);
-    }
-    return composed;
-}
-function composePair(change1, change2, composer, metadata, idAllocator) {
-    const moveEffects = SF.newCrossFieldTable();
-    let composed = SF.compose(change1, change2, composer, idAllocator, moveEffects, metadata);
-    if (moveEffects.isInvalidated) {
-        resetCrossFieldTable(moveEffects);
-        composed = SF.compose(change1, change2, composer, idAllocator, moveEffects, metadata);
-    }
-    return composed;
-}
-export function rebase(change, base, config = {}) {
-    const cleanChange = purgeUnusedCellOrderingInfo(change);
-    const cleanBase = { ...base, change: purgeUnusedCellOrderingInfo(base.change) };
-    deepFreeze(cleanChange);
-    deepFreeze(cleanBase);
-    const metadata = config.metadata ??
-        rebaseRevisionMetadataFromInfo(defaultRevInfosFromChanges([cleanBase, makeAnonChange(cleanChange)]), [cleanBase.revision]);
-    const childRebaser = config.childRebaser ?? TestChange.rebase;
-    const moveEffects = SF.newCrossFieldTable();
-    const idAllocator = idAllocatorFromMaxId(getMaxId(cleanChange, cleanBase.change));
-    let rebasedChange = SF.rebase(cleanChange, cleanBase, childRebaser, idAllocator, moveEffects, metadata);
-    if (moveEffects.isInvalidated) {
-        moveEffects.reset();
-        rebasedChange = SF.rebase(cleanChange, cleanBase, childRebaser, idAllocator, moveEffects, metadata);
-    }
-    return rebasedChange;
-}
-export function rebaseTagged(change, baseChange) {
-    return rebaseOverChanges(change, [baseChange]);
-}
-export function rebaseOverChanges(change, baseChanges, revInfos) {
-    let currChange = change;
-    const revisionInfo = revInfos ?? defaultRevInfosFromChanges(baseChanges);
-    for (const base of baseChanges) {
-        currChange = tagChange(rebase(currChange.change, base, {
-            metadata: rebaseRevisionMetadataFromInfo(revisionInfo, [base.revision]),
-        }), currChange.revision);
-    }
-    return currChange;
-}
-export function rebaseOverComposition(change, base, metadata) {
-    return rebase(change, makeAnonChange(base), { metadata });
-}
-function resetCrossFieldTable(table) {
-    table.isInvalidated = false;
-    table.srcQueries.clear();
-    table.dstQueries.clear();
-}
-export function invert(change) {
-    const cleanChange = { ...change, change: purgeUnusedCellOrderingInfo(change.change) };
-    deepFreeze(cleanChange);
-    const table = SF.newCrossFieldTable();
-    const revisionMetadata = defaultRevisionMetadataFromChanges([cleanChange]);
-    let inverted = SF.invert(cleanChange, TestChange.invert, true, 
-    // Sequence fields should not generate IDs during invert
-    fakeIdAllocator, table, revisionMetadata);
-    if (table.isInvalidated) {
-        table.isInvalidated = false;
-        table.srcQueries.clear();
-        table.dstQueries.clear();
-        inverted = SF.invert(cleanChange, TestChange.invert, true, 
-        // Sequence fields should not generate IDs during invert
-        fakeIdAllocator, table, revisionMetadata);
-    }
-    return inverted;
-}
-export function checkDeltaEquality(actual, expected) {
-    assertFieldChangesEqual(toDelta(actual), toDelta(expected));
-}
-export function toDelta(change, revision) {
-    deepFreeze(change);
-    return SF.sequenceFieldToDelta(tagChange(change, revision), (childChange) => TestChange.toDelta(tagChange(childChange, revision)));
-}
-export function getMaxId(...changes) {
-    let max;
-    for (const change of changes) {
-        for (const mark of change) {
-            if (SF.isMoveMark(mark)) {
-                max = max === undefined ? mark.id : brand(Math.max(max, mark.id));
-            }
-        }
-    }
-    return max;
-}
-export function getMaxIdTagged(changes) {
-    return getMaxId(...changes.map((c) => c.change));
-}
-export function continuingAllocator(changes) {
-    return idAllocatorFromMaxId(getMaxIdTagged(changes));
-}
-export function withoutLineage(changeset) {
-    const factory = new SF.MarkListFactory();
-    for (const mark of changeset) {
-        const cloned = SF.cloneMark(mark);
-        if (cloned.cellId !== undefined) {
-            delete cloned.cellId.lineage;
-            delete cloned.cellId.adjacentCells;
-        }
-        if (isDetach(cloned) || isAttachAndDetachEffect(cloned)) {
-            const detach = isAttachAndDetachEffect(cloned) ? cloned.detach : cloned;
-            if (detach.idOverride !== undefined) {
-                delete detach.idOverride.id.lineage;
-                delete detach.idOverride.id.adjacentCells;
-            }
-        }
-        factory.push(cloned);
-    }
-    return factory.list;
-}
-export function withoutTombstones(changeset) {
-    const factory = new SF.MarkListFactory();
-    for (const mark of changeset) {
-        if (!isTombstone(mark)) {
-            factory.push(mark);
-        }
-    }
-    return factory.list;
-}
-export function withNormalizedLineage(changeset) {
-    const factory = new SF.MarkListFactory();
-    for (const mark of changeset) {
-        if (mark.cellId?.lineage === undefined) {
-            factory.push(mark);
-        }
-        else {
-            const cloned = SF.cloneMark(mark);
-            assert(cloned.cellId?.lineage !== undefined, "Cloned should have lineage");
-            cloned.cellId.lineage = normalizedLineage(cloned.cellId.lineage);
-            factory.push(cloned);
-        }
-    }
-    return factory.list;
-}
-function normalizedLineage(lineage) {
-    const normalized = lineage.flatMap((event) => {
-        const events = [];
-        for (let i = 0; i < event.count; i++) {
-            const id = brand(event.id + i);
-            const offset = i <= event.offset ? 0 : 1;
-            events.push({ revision: event.revision, count: 1, id, offset });
-        }
-        return events;
-    });
-    normalized.sort((a, b) => {
-        const cmpRevision = cmp(a.revision, b.revision);
-        if (cmpRevision !== 0) {
-            return cmpRevision;
-        }
-        return cmp(a.id, b.id);
-    });
-    return normalized;
-}
-function cmp(a, b) {
-    if (a === b) {
-        return 0;
-    }
-    return a > b ? 1 : -1;
-}
-/**
- * Keeps track of the different ways detached nodes may be referred to.
- * Allows updating changesets so they refer to a detached node by the details
- * of the last detach that affected them.
- *
- * WARNING: this code consumes O(N) space and time for marks that affect N nodes.
- * This is code is currently meant for usage in tests.
- * It should be tested and made more efficient before production use.
- */
-export class DetachedNodeTracker {
-    constructor() {
-        // Maps the index for a node to its last characterization as a reattached node.
-        this.nodes = new Map();
-        this.equivalences = [];
-    }
-    /**
-     * Updates the internals of this instance to account for `change` having been applied.
-     * @param change - The change that is being applied. Not mutated.
-     * Must be applicable (i.e., `isApplicable(change)` must be true).
-     */
-    apply(change) {
-        let index = 0;
-        for (const mark of change.change) {
-            const inputLength = getInputLength(mark);
-            if (markEmptiesCells(mark)) {
-                assert(isDetach(mark), 0x70d /* Only detach marks should empty cells */);
-                const newNodes = new Map();
-                const after = index + inputLength;
-                for (const [k, v] of this.nodes) {
-                    if (k >= index) {
-                        if (k >= after) {
-                            newNodes.set(k - inputLength, v);
-                        }
-                        else {
-                            // The node is removed
-                            this.equivalences.push({
-                                old: v,
-                                new: {
-                                    revision: change.rollbackOf ??
-                                        mark.revision ??
-                                        change.revision ??
-                                        fail("Unable to track detached nodes"),
-                                    localId: brand(mark.id + (k - index)),
-                                },
-                            });
-                        }
-                    }
-                    else {
-                        newNodes.set(k, v);
-                    }
-                }
-                this.nodes = newNodes;
-            }
-            index += inputLength;
-        }
-        index = 0;
-        for (const mark of change.change) {
-            const inputLength = getInputLength(mark);
-            if (isActiveReattach(mark)) {
-                const newNodes = new Map();
-                for (const [k, v] of this.nodes) {
-                    if (k >= index) {
-                        newNodes.set(k + inputLength, v);
-                    }
-                    else {
-                        newNodes.set(k, v);
-                    }
-                }
-                const detachEvent = mark.cellId ?? fail("Unable to track detached nodes");
-                for (let i = 0; i < mark.count; ++i) {
-                    newNodes.set(index + i, {
-                        revision: detachEvent.revision,
-                        localId: brand(detachEvent.localId + i),
-                    });
-                }
-                this.nodes = newNodes;
-            }
-            if (!markEmptiesCells(mark)) {
-                index += inputLength;
-            }
-        }
-    }
-    /**
-     * Checks whether the given `change` is applicable based on previous changes.
-     * @param change - The change to verify the applicability of. Not mutated.
-     * @returns false iff `change`'s description of detached nodes is inconsistent with that of changes applied
-     * earlier. Returns true otherwise.
-     */
-    isApplicable(change) {
-        for (const mark of change) {
-            if (isActiveReattach(mark)) {
-                const detachEvent = mark.cellId ?? fail("Unable to track detached nodes");
-                const revision = detachEvent.revision;
-                for (let i = 0; i < mark.count; ++i) {
-                    const localId = brand(detachEvent.localId + i);
-                    const original = { revision, localId };
-                    const updated = this.getUpdatedDetach(original);
-                    for (const detached of this.nodes.values()) {
-                        if (updated.revision === detached.revision &&
-                            updated.localId === detached.localId) {
-                            // The new change is attempting to reattach nodes in a location that has already been
-                            // filled by a prior reattach.
-                            return false;
-                        }
-                    }
-                }
-            }
-        }
-        return true;
-    }
-    /**
-     * Creates an updated representation of the given `change` so that it refers to detached nodes using the revision
-     * that last detached them.
-     * @param change - The change to update. Not mutated.
-     * Must be applicable (i.e., `isApplicable(change)` must be true).
-     * @param genId - An ID allocator that produces ID unique within this changeset.
-     * @returns A change equivalent to `change` that refers to detached nodes using the revision that last detached
-     * them. May reuse parts of the input `change` structure.
-     */
-    update(change) {
-        const factory = new MarkListFactory();
-        for (const mark of change.change) {
-            const cloned = cloneMark(mark);
-            if (areInputCellsEmpty(cloned) && !isNewAttach(cloned)) {
-                let remainder = cloned;
-                while (remainder.count > 1) {
-                    const [head, tail] = splitMark(remainder, 1);
-                    this.updateMark(head);
-                    factory.push(head);
-                    remainder = tail;
-                }
-                this.updateMark(remainder);
-                factory.push(remainder);
-            }
-            else {
-                factory.push(cloned);
-            }
-        }
-        return {
-            ...change,
-            change: factory.list,
-        };
-    }
-    updateMark(mark) {
-        const detachEvent = mark.cellId;
-        const original = { revision: detachEvent.revision, localId: detachEvent.localId };
-        const updated = this.getUpdatedDetach(original);
-        if (updated.revision !== original.revision || updated.localId !== original.localId) {
-            mark.cellId = { ...updated };
-        }
-    }
-    getUpdatedDetach(detach) {
-        let curr = detach;
-        for (const eq of this.equivalences) {
-            if (curr.revision === eq.old.revision && curr.localId === eq.old.localId) {
-                curr = eq.new;
-            }
-        }
-        return curr;
-    }
-}
-/**
- * Checks whether `branch` changeset is consistent with a `target` changeset that is may be rebased over.
- *
- * WARNING: this code consumes O(N) space and time for marks that affect N nodes.
- * This is code is currently meant for usage in tests.
- * It should be tested and made more efficient before production use.
- *
- * @param branch - The changeset that would be rebased over `target`.
- * @param target - The changeset that `branch` would be rebased over.
- * @returns false iff `branch`'s description of detached nodes is inconsistent with that of `target`.
- * Returns true otherwise.
- */
-export function areRebasable(branch, target) {
-    const indexToReattach = new Map();
-    const reattachToIndex = new Map();
-    let index = 0;
-    for (const mark of branch) {
-        if (isActiveReattach(mark)) {
-            const list = getOrAddEmptyToMap(indexToReattach, index);
-            for (let i = 0; i < mark.count; ++i) {
-                const detachEvent = mark.cellId ?? fail("Unable to track detached nodes");
-                const entry = {
-                    ...detachEvent,
-                    localId: brand(detachEvent.localId + i),
-                };
-                const key = `${entry.revision}|${entry.localId}`;
-                assert(!reattachToIndex.has(key), 0x506 /* First changeset as inconsistent characterization of detached nodes */);
-                list.push(key);
-                reattachToIndex.set(key, index);
-            }
-        }
-        index += getInputLength(mark);
-    }
-    index = 0;
-    let listIndex = 0;
-    for (const mark of target) {
-        if (isActiveReattach(mark)) {
-            const list = getOrAddEmptyToMap(indexToReattach, index);
-            for (let i = 0; i < mark.count; ++i) {
-                const detachEvent = mark.cellId ?? fail("Unable to track detached nodes");
-                const entry = {
-                    ...detachEvent,
-                    localId: brand(detachEvent.localId + i),
-                };
-                const key = `${entry.revision}|${entry.localId}`;
-                const indexInA = reattachToIndex.get(key);
-                if (indexInA !== undefined && indexInA !== index) {
-                    // change b tries to reattach the same content as change a but in a different location
-                    return false;
-                }
-                if (list.includes(key)) {
-                    while (list[listIndex] !== undefined && list[listIndex] !== key) {
-                        ++listIndex;
-                    }
-                    if (list.slice(0, listIndex).includes(key)) {
-                        // change b tries to reattach the same content as change a but in a different order
-                        return false;
-                    }
-                }
-            }
-        }
-        const inputLength = getInputLength(mark);
-        if (inputLength > 0) {
-            listIndex = 0;
-        }
-        index += inputLength;
-    }
-    return true;
-}
-/**
- * Checks whether sequential changesets are consistent.
- *
- * WARNING: this code consumes O(N) space and time for marks that affect N nodes.
- * This is code is currently meant for usage in tests.
- * It should be tested and made more efficient before production use.
- *
- * @param changes - The changesets that would be composed together.
- * @returns false iff the changesets in `changes` are inconsistent/incompatible in their description of detached nodes.
- * Returns true otherwise.
- */
-export function areComposable(changes) {
-    const tracker = new DetachedNodeTracker();
-    for (const change of changes) {
-        if (!tracker.isApplicable(change.change)) {
-            return false;
-        }
-        tracker.apply(change);
-    }
-    return true;
-}
-//# sourceMappingURL=utils.js.map

package/lib/test/feature-libraries/sequence-field/utils.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../../src/test/feature-libraries/sequence-field/utils.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAChC,OAAO,EAAE,MAAM,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AACrE,OAAO,EAAE,aAAa,IAAI,EAAE,EAAE,MAAM,qCAAqC,CAAC;AAC1E,OAAO,EAON,cAAc,EACd,8BAA8B,EAC9B,SAAS,GACT,MAAM,wBAAwB,CAAC;AAChC,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AACjD,OAAO,EACN,uBAAuB,EACvB,UAAU,EACV,0BAA0B,EAC1B,kCAAkC,GAClC,MAAM,gBAAgB,CAAC;AACxB,OAAO,EACN,KAAK,EACL,IAAI,EACJ,eAAe,EACf,kBAAkB,EAElB,oBAAoB,GAEpB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACN,kBAAkB,EAClB,SAAS,EACT,cAAc,EACd,gBAAgB,EAChB,uBAAuB,EACvB,QAAQ,EACR,WAAW,EACX,WAAW,EACX,gBAAgB,EAChB,SAAS;AACT,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAC5D,OAAO,EACN,kBAAkB,EAElB,cAAc;AACd,sDAAsD;EACtD,MAAM,qDAAqD,CAAC;AAC7D,OAAO,EAIN,eAAe;AACf,sDAAsD;EACtD,MAAM,oDAAoD,CAAC;AAG5D,sDAAsD;AACtD,OAAO,EAAE,8BAA8B,EAAE,MAAM,kEAAkE,CAAC;AAGlH,MAAM,UAAU,qBAAqB,CAAI,MAAuB,EAAE,QAAyB;IAC1F,MAAM,eAAe,GAAG,2BAA2B,CAAC,QAAQ,CAAC,CAAC;IAC9D,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,eAAe,CAAC,CAAC;AAC3C,CAAC;AAED,MAAM,UAAU,2BAA2B,CAAI,MAAuB;IACrE,QAAQ,cAAc,CAAC,YAAY,EAAE;QACpC,KAAK,kBAAkB,CAAC,SAAS;YAChC,OAAO,cAAc,CAAC,MAAM,CAAC,CAAC;QAC/B,KAAK,kBAAkB,CAAC,OAAO;YAC9B,OAAO,iBAAiB,CAAC,MAAM,CAAC,CAAC;QAClC;YACC,eAAe,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;KAC9C;AACF,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAsB,EAAE,KAAa,EAAE,EAAc;IACxF,IAAI,MAAM,CAAC,YAAY,KAAK,kBAAkB,CAAC,OAAO,EAAE;QACvD,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACnB;SAAM;QACN,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACd;AACF,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAsB,EAAE,KAAa,EAAE,EAAc;IACxF,IAAI,MAAM,CAAC,YAAY,KAAK,kBAAkB,CAAC,OAAO,EAAE;QACvD,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACd;SAAM;QACN,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACnB;AACF,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAAsB,EAAE,KAAa,EAAE,EAAc;IAC1F,IAAI,MAAM,CAAC,YAAY,KAAK,kBAAkB,CAAC,SAAS,EAAE;QACzD,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACnB;SAAM;QACN,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACd;AACF,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAC,MAAsB,EAAE,KAAa,EAAE,EAAc;IAC1F,IAAI,MAAM,CAAC,YAAY,KAAK,kBAAkB,CAAC,SAAS,EAAE;QACzD,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACd;SAAM;QACN,EAAE,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;KACnB;AACF,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,KAAa,EAAE,EAAoC;IACzF,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE;QACpB,KAAK,MAAM,MAAM,IAAI,CAAC,kBAAkB,CAAC,SAAS,EAAE,kBAAkB,CAAC,OAAO,CAAC,EAAE;YAChF,QAAQ,CAAC,GAAG,MAAM,sBAAsB,EAAE,GAAG,EAAE;gBAC9C,kBAAkB,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAChC,CAAC,CAAC,CAAC;SACH;IACF,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,kBAAkB,CACjC,MAA0B,EAC1B,EAAoC;IAEpC,MAAM,WAAW,GAAG,cAAc,CAAC,YAAY,CAAC;IAChD,MAAM,aAAa,GAAG,cAAyC,CAAC;IAChE,aAAa,CAAC,YAAY,GAAG,MAAM,CAAC;IACpC,IAAI;QACH,+GAA+G;QAC/G,+GAA+G;QAC/G,kBAAkB;QAClB,6GAA6G;QAC7G,2CAA2C;QAC3C,EAAE,CAAC,EAAE,GAAG,cAAc,EAAE,CAAC,CAAC;KAC1B;YAAS;QACT,aAAa,CAAC,YAAY,GAAG,WAAW,CAAC;KACzC;AACF,CAAC;AAED,MAAM,UAAU,eAAe,CAC9B,OAAsC,EACtC,QAAyB;IAEzB,OAAO,QAAQ,CACd,OAAO,EACP,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,EACjE,QAAQ,CACR,CAAC;AACH,CAAC;AAED,MAAM,UAAU,OAAO,CACtB,OAAsC,EACtC,QAAkD,EAClD,aAGe;IAEf,OAAO,QAAQ,CAAC,OAAO,EAAE,aAAa,IAAI,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AACzE,CAAC;AAED,MAAM,UAAU,KAAK,CACpB,MAAqB,EACrB,WAA2D;IAE3D,OAAO,EAAE,CAAC,0BAA0B,CAAC,KAAK,CACzC,MAAM,EACN,WAAW,IAAI,CAAC,CAAC,KAAiB,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CACvF,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAC7B,OAAwC,EACxC,QAAyB;IAEzB,OAAO,QAAQ,CACd,OAAO,EACP,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE;QAClB,MAAM,CACL,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAC5C,uCAAuC,CACvC,CAAC;QACF,OAAO,MAAM,IAAI,MAAM,IAAI,IAAI,CAAC,uCAAuC,CAAC,CAAC;IAC1E,CAAC,EACD,QAAQ,CACR,CAAC;AACH,CAAC;AAED,SAAS,QAAQ,CAChB,OAAwC,EACxC,QAA+D,EAC/D,QAAkD;IAElD,MAAM,cAAc,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;QACzE,MAAM,EAAE,2BAA2B,CAAC,MAAM,CAAC;QAC3C,QAAQ;QACR,UAAU;KACV,CAAC,CAAC,CAAC;IACJ,MAAM,WAAW,GAAG,mBAAmB,CAAC,cAAc,CAAC,CAAC;IACxD,MAAM,QAAQ,GACb,QAAQ,KAAK,SAAS;QACrB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;YACxB,CAAC,CAAC,8BAA8B,CAAC,QAAQ,CAAC;YAC1C,CAAC,CAAC,QAAQ;QACX,CAAC,CAAC,kCAAkC,CAAC,cAAc,CAAC,CAAC;IAEvD,IAAI,QAAQ,GAAoB,EAAE,CAAC;IACnC,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE;QACpC,QAAQ,GAAG,WAAW,CAAC,cAAc,CAAC,QAAQ,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAC;KAC1F;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,SAAS,WAAW,CACnB,OAAsC,EACtC,OAAsC,EACtC,QAA+D,EAC/D,QAAgC,EAChC,WAAwB;IAExB,MAAM,WAAW,GAAG,EAAE,CAAC,kBAAkB,EAAE,CAAC;IAC5C,IAAI,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;IAE1F,IAAI,WAAW,CAAC,aAAa,EAAE;QAC9B,oBAAoB,CAAC,WAAW,CAAC,CAAC;QAClC,QAAQ,GAAG,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;KACtF;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAUD,MAAM,UAAU,MAAM,CACrB,MAAqB,EACrB,IAAiC,EACjC,SAAuB,EAAE;IAEzB,MAAM,WAAW,GAAG,2BAA2B,CAAC,MAAM,CAAC,CAAC;IACxD,MAAM,SAAS,GAAG,EAAE,GAAG,IAAI,EAAE,MAAM,EAAE,2BAA2B,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;IAChF,UAAU,CAAC,WAAW,CAAC,CAAC;IACxB,UAAU,CAAC,SAAS,CAAC,CAAC;IAEtB,MAAM,QAAQ,GACb,MAAM,CAAC,QAAQ;QACf,8BAA8B,CAC7B,0BAA0B,CAAC,CAAC,SAAS,EAAE,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,EACpE,CAAC,SAAS,CAAC,QAAQ,CAAC,CACpB,CAAC;IAEH,MAAM,YAAY,GAAG,MAAM,CAAC,YAAY,IAAI,UAAU,CAAC,MAAM,CAAC;IAE9D,MAAM,WAAW,GAAG,EAAE,CAAC,kBAAkB,EAAE,CAAC;IAC5C,MAAM,WAAW,GAAG,oBAAoB,CAAC,QAAQ,CAAC,WAAW,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC;IAClF,IAAI,aAAa,GAAG,EAAE,CAAC,MAAM,CAC5B,WAAW,EACX,SAAS,EACT,YAAY,EACZ,WAAW,EACX,WAAW,EACX,QAAQ,CACR,CAAC;IACF,IAAI,WAAW,CAAC,aAAa,EAAE;QAC9B,WAAW,CAAC,KAAK,EAAE,CAAC;QACpB,aAAa,GAAG,EAAE,CAAC,MAAM,CACxB,WAAW,EACX,SAAS,EACT,YAAY,EACZ,WAAW,EACX,WAAW,EACX,QAAQ,CACR,CAAC;KACF;IACD,OAAO,aAAa,CAAC;AACtB,CAAC;AAED,MAAM,UAAU,YAAY,CAC3B,MAAmC,EACnC,UAAuC;IAEvC,OAAO,iBAAiB,CAAC,MAAM,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,iBAAiB,CAChC,MAAmC,EACnC,WAA0C,EAC1C,QAAyB;IAEzB,IAAI,UAAU,GAAG,MAAM,CAAC;IACxB,MAAM,YAAY,GAAG,QAAQ,IAAI,0BAA0B,CAAC,WAAW,CAAC,CAAC;IACzE,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE;QAC/B,UAAU,GAAG,SAAS,CACrB,MAAM,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE;YAC/B,QAAQ,EAAE,8BAA8B,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;SACvE,CAAC,EACF,UAAU,CAAC,QAAQ,CACnB,CAAC;KACF;IAED,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,MAAM,UAAU,qBAAqB,CACpC,MAAqB,EACrB,IAAmB,EACnB,QAAgC;IAEhC,OAAO,MAAM,CAAC,MAAM,EAAE,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;AAC3D,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAyB;IACtD,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC;IAC5B,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;IACzB,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,MAAmC;IACzD,MAAM,WAAW,GAAG,EAAE,GAAG,MAAM,EAAE,MAAM,EAAE,2BAA2B,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;IACtF,UAAU,CAAC,WAAW,CAAC,CAAC;IACxB,MAAM,KAAK,GAAG,EAAE,CAAC,kBAAkB,EAAE,CAAC;IACtC,MAAM,gBAAgB,GAAG,kCAAkC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IAC3E,IAAI,QAAQ,GAAG,EAAE,CAAC,MAAM,CACvB,WAAW,EACX,UAAU,CAAC,MAAM,EACjB,IAAI;IACJ,wDAAwD;IACxD,eAAe,EACf,KAAK,EACL,gBAAgB,CAChB,CAAC;IAEF,IAAI,KAAK,CAAC,aAAa,EAAE;QACxB,KAAK,CAAC,aAAa,GAAG,KAAK,CAAC;QAC5B,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;QACzB,QAAQ,GAAG,EAAE,CAAC,MAAM,CACnB,WAAW,EACX,UAAU,CAAC,MAAM,EACjB,IAAI;QACJ,wDAAwD;QACxD,eAAe,EACf,KAAK,EACL,gBAAgB,CAChB,CAAC;KACF;IAED,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,MAAqB,EAAE,QAAuB;IAChF,uBAAuB,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,MAAqB,EAAE,QAAsB;IACpE,UAAU,CAAC,MAAM,CAAC,CAAC;IACnB,OAAO,EAAE,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC,WAAW,EAAE,EAAE,CAC3E,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC,CACpD,CAAC;AACH,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,GAAG,OAAgC;IAC3D,IAAI,GAAiC,CAAC;IACtC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC7B,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YAC1B,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;gBACxB,GAAG,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAClE;SACD;KACD;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,MAAM,UAAU,cAAc,CAC7B,OAA8C;IAE9C,OAAO,QAAQ,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,OAA8C;IACjF,OAAO,oBAAoB,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC;AACtD,CAAC;AAED,MAAM,UAAU,cAAc,CAAI,SAA0B;IAC3D,MAAM,OAAO,GAAG,IAAI,EAAE,CAAC,eAAe,EAAK,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;QAC7B,MAAM,MAAM,GAAG,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,MAAM,CAAC,MAAM,KAAK,SAAS,EAAE;YAChC,OAAO,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;YAC7B,OAAO,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC;SACnC;QACD,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,uBAAuB,CAAC,MAAM,CAAC,EAAE;YACxD,MAAM,MAAM,GAAG,uBAAuB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC;YACxE,IAAI,MAAM,CAAC,UAAU,KAAK,SAAS,EAAE;gBACpC,OAAO,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,CAAC;gBACpC,OAAO,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,aAAa,CAAC;aAC1C;SACD;QACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KACrB;IAED,OAAO,OAAO,CAAC,IAAI,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAI,SAA0B;IAC9D,MAAM,OAAO,GAAG,IAAI,EAAE,CAAC,eAAe,EAAK,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;QAC7B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE;YACvB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACnB;KACD;IAED,OAAO,OAAO,CAAC,IAAI,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,qBAAqB,CAAI,SAA0B;IAClE,MAAM,OAAO,GAAG,IAAI,EAAE,CAAC,eAAe,EAAK,CAAC;IAC5C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE;QAC7B,IAAI,IAAI,CAAC,MAAM,EAAE,OAAO,KAAK,SAAS,EAAE;YACvC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACnB;aAAM;YACN,MAAM,MAAM,GAAG,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;YAClC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,KAAK,SAAS,EAAE,4BAA4B,CAAC,CAAC;YAC3E,MAAM,CAAC,MAAM,CAAC,OAAO,GAAG,iBAAiB,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACjE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SACrB;KACD;IAED,OAAO,OAAO,CAAC,IAAI,CAAC;AACrB,CAAC;AAED,SAAS,iBAAiB,CAAC,OAA0B;IACpD,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC5C,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE;YACrC,MAAM,EAAE,GAAqB,KAAK,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACjD,MAAM,MAAM,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC;SAChE;QAED,OAAO,MAAM,CAAC;IACf,CAAC,CAAC,CAAC;IAEH,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACxB,MAAM,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,WAAW,KAAK,CAAC,EAAE;YACtB,OAAO,WAAW,CAAC;SACnB;QAED,OAAO,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,SAAS,GAAG,CAAC,CAAM,EAAE,CAAM;IAC1B,IAAI,CAAC,KAAK,CAAC,EAAE;QACZ,OAAO,CAAC,CAAC;KACT;IAED,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACvB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,OAAO,mBAAmB;IAK/B;QAJA,+EAA+E;QACvE,UAAK,GAAwB,IAAI,GAAG,EAAE,CAAC;QAC9B,iBAAY,GAAmC,EAAE,CAAC;IAE7C,CAAC;IAEvB;;;;OAIG;IACI,KAAK,CAAC,MAAwC;QACpD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE;YACjC,MAAM,WAAW,GAAW,cAAc,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;gBAC3B,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,0CAA0C,CAAC,CAAC;gBACzE,MAAM,QAAQ,GAAwB,IAAI,GAAG,EAAE,CAAC;gBAChD,MAAM,KAAK,GAAG,KAAK,GAAG,WAAW,CAAC;gBAClC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;oBAChC,IAAI,CAAC,IAAI,KAAK,EAAE;wBACf,IAAI,CAAC,IAAI,KAAK,EAAE;4BACf,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE,CAAC,CAAC,CAAC;yBACjC;6BAAM;4BACN,sBAAsB;4BACtB,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;gCACtB,GAAG,EAAE,CAAC;gCACN,GAAG,EAAE;oCACJ,QAAQ,EACP,MAAM,CAAC,UAAU;wCACjB,IAAI,CAAC,QAAQ;wCACb,MAAM,CAAC,QAAQ;wCACf,IAAI,CAAC,gCAAgC,CAAC;oCACvC,OAAO,EAAE,KAAK,CAAE,IAAI,CAAC,EAAa,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;iCACjD;6BACD,CAAC,CAAC;yBACH;qBACD;yBAAM;wBACN,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;qBACnB;iBACD;gBACD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;aACtB;YACD,KAAK,IAAI,WAAW,CAAC;SACrB;QACD,KAAK,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE;YACjC,MAAM,WAAW,GAAW,cAAc,CAAC,IAAI,CAAC,CAAC;YACjD,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;gBAC3B,MAAM,QAAQ,GAAwB,IAAI,GAAG,EAAE,CAAC;gBAChD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;oBAChC,IAAI,CAAC,IAAI,KAAK,EAAE;wBACf,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,WAAW,EAAE,CAAC,CAAC,CAAC;qBACjC;yBAAM;wBACN,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;qBACnB;iBACD;gBACD,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;oBACpC,QAAQ,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE;wBACvB,QAAQ,EAAE,WAAW,CAAC,QAAQ;wBAC9B,OAAO,EAAE,KAAK,CAAE,WAAW,CAAC,OAAkB,GAAG,CAAC,CAAC;qBACnD,CAAC,CAAC;iBACH;gBACD,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC;aACtB;YACD,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE;gBAC5B,KAAK,IAAI,WAAW,CAAC;aACrB;SACD;IACF,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,MAA0B;QAC7C,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;YAC1B,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;gBAC3B,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC1E,MAAM,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC;gBACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;oBACpC,MAAM,OAAO,GAAG,KAAK,CAAoB,WAAW,CAAC,OAAkB,GAAG,CAAC,CAAC,CAAC;oBAC7E,MAAM,QAAQ,GAAW,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;oBAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;oBAChD,KAAK,MAAM,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE;wBAC3C,IACC,OAAO,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ;4BACtC,OAAO,CAAC,OAAO,KAAK,QAAQ,CAAC,OAAO,EACnC;4BACD,qFAAqF;4BACrF,8BAA8B;4BAC9B,OAAO,KAAK,CAAC;yBACb;qBACD;iBACD;aACD;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAI,MAAkC;QAClD,MAAM,OAAO,GAAG,IAAI,eAAe,EAAK,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,MAAM,EAAE;YACjC,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE;gBACvD,IAAI,SAAS,GAAG,MAAM,CAAC;gBACvB,OAAO,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE;oBAC3B,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;oBAC7C,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACtB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACnB,SAAS,GAAG,IAAI,CAAC;iBACjB;gBACD,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;gBAC3B,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aACxB;iBAAM;gBACN,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aACrB;SACD;QAED,OAAO;YACN,GAAG,MAAM;YACT,MAAM,EAAE,OAAO,CAAC,IAAI;SACpB,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,IAAsC;QACxD,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC;QAChC,MAAM,QAAQ,GAAG,EAAE,QAAQ,EAAE,WAAW,CAAC,QAAQ,EAAE,OAAO,EAAE,WAAW,CAAC,OAAO,EAAE,CAAC;QAClF,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,OAAO,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ,IAAI,OAAO,CAAC,OAAO,KAAK,QAAQ,CAAC,OAAO,EAAE;YACnF,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,OAAO,EAAE,CAAC;SAC7B;IACF,CAAC;IAEO,gBAAgB,CAAC,MAAc;QACtC,IAAI,IAAI,GAAG,MAAM,CAAC;QAClB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,YAAY,EAAE;YACnC,IAAI,IAAI,CAAC,QAAQ,KAAK,EAAE,CAAC,GAAG,CAAC,QAAQ,IAAI,IAAI,CAAC,OAAO,KAAK,EAAE,CAAC,GAAG,CAAC,OAAO,EAAE;gBACzE,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC;aACd;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC;CACD;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,YAAY,CAAC,MAA0B,EAAE,MAA0B;IAClF,MAAM,eAAe,GAA0B,IAAI,GAAG,EAAE,CAAC;IACzD,MAAM,eAAe,GAAwB,IAAI,GAAG,EAAE,CAAC;IACvD,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;QAC1B,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3B,MAAM,IAAI,GAAG,kBAAkB,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;YACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;gBACpC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC1E,MAAM,KAAK,GAAW;oBACrB,GAAG,WAAW;oBACd,OAAO,EAAE,KAAK,CAAE,WAAW,CAAC,OAAkB,GAAG,CAAC,CAAC;iBACnD,CAAC;gBACF,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACjD,MAAM,CACL,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,EACzB,KAAK,CAAC,wEAAwE,CAC9E,CAAC;gBACF,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACf,eAAe,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;aAChC;SACD;QACD,KAAK,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC;KAC9B;IACD,KAAK,GAAG,CAAC,CAAC;IACV,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE;QAC1B,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE;YAC3B,MAAM,IAAI,GAAG,kBAAkB,CAAC,eAAe,EAAE,KAAK,CAAC,CAAC;YACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE;gBACpC,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,gCAAgC,CAAC,CAAC;gBAC1E,MAAM,KAAK,GAAW;oBACrB,GAAG,WAAW;oBACd,OAAO,EAAE,KAAK,CAAE,WAAW,CAAC,OAAkB,GAAG,CAAC,CAAC;iBACnD,CAAC;gBACF,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,QAAQ,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACjD,MAAM,QAAQ,GAAG,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC1C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,KAAK,EAAE;oBACjD,sFAAsF;oBACtF,OAAO,KAAK,CAAC;iBACb;gBACD,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;oBACvB,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,EAAE;wBAChE,EAAE,SAAS,CAAC;qBACZ;oBACD,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;wBAC3C,mFAAmF;wBACnF,OAAO,KAAK,CAAC;qBACb;iBACD;aACD;SACD;QACD,MAAM,WAAW,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACzC,IAAI,WAAW,GAAG,CAAC,EAAE;YACpB,SAAS,GAAG,CAAC,CAAC;SACd;QACD,KAAK,IAAI,WAAW,CAAC;KACrB;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,aAAa,CAAC,OAA2C;IACxE,MAAM,OAAO,GAAG,IAAI,mBAAmB,EAAE,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;QAC7B,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE;YACzC,OAAO,KAAK,CAAC;SACb;QACD,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;KACtB;IACD,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport { strict } from \"assert\";\nimport { assert, unreachableCase } from \"@fluidframework/core-utils\";\nimport { SequenceField as SF } from \"../../../feature-libraries/index.js\";\nimport {\n\tChangesetLocalId,\n\tDeltaFieldChanges,\n\tRevisionInfo,\n\tRevisionMetadataSource,\n\tRevisionTag,\n\tTaggedChange,\n\tmakeAnonChange,\n\trevisionMetadataSourceFromInfo,\n\ttagChange,\n} from \"../../../core/index.js\";\nimport { TestChange } from \"../../testChange.js\";\nimport {\n\tassertFieldChangesEqual,\n\tdeepFreeze,\n\tdefaultRevInfosFromChanges,\n\tdefaultRevisionMetadataFromChanges,\n} from \"../../utils.js\";\nimport {\n\tbrand,\n\tfail,\n\tfakeIdAllocator,\n\tgetOrAddEmptyToMap,\n\tIdAllocator,\n\tidAllocatorFromMaxId,\n\tMutable,\n} from \"../../../util/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { RebaseRevisionMetadata } from \"../../../feature-libraries/modular-schema/index.js\";\nimport {\n\tareInputCellsEmpty,\n\tcloneMark,\n\tgetInputLength,\n\tisActiveReattach,\n\tisAttachAndDetachEffect,\n\tisDetach,\n\tisNewAttach,\n\tisTombstone,\n\tmarkEmptiesCells,\n\tsplitMark,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/sequence-field/utils.js\";\nimport {\n\tCellOrderingMethod,\n\tSequenceConfig,\n\tsequenceConfig,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/sequence-field/config.js\";\nimport {\n\tCellId,\n\tChangeset,\n\tHasMarkFields,\n\tMarkListFactory,\n\t// eslint-disable-next-line import/no-internal-modules\n} from \"../../../feature-libraries/sequence-field/index.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { DetachedCellMark } from \"../../../feature-libraries/sequence-field/helperTypes.js\";\n// eslint-disable-next-line import/no-internal-modules\nimport { rebaseRevisionMetadataFromInfo } from \"../../../feature-libraries/modular-schema/modularChangeFamily.js\";\nimport { TestChangeset } from \"./testEdits.js\";\n\nexport function assertChangesetsEqual<T>(actual: SF.Changeset<T>, expected: SF.Changeset<T>): void {\n\tconst updatedExpected = purgeUnusedCellOrderingInfo(expected);\n\tstrict.deepEqual(actual, updatedExpected);\n}\n\nexport function purgeUnusedCellOrderingInfo<T>(change: SF.Changeset<T>): SF.Changeset<T> {\n\tswitch (sequenceConfig.cellOrdering) {\n\t\tcase CellOrderingMethod.Tombstone:\n\t\t\treturn withoutLineage(change);\n\t\tcase CellOrderingMethod.Lineage:\n\t\t\treturn withoutTombstones(change);\n\t\tdefault:\n\t\t\tunreachableCase(sequenceConfig.cellOrdering);\n\t}\n}\n\nexport function skipOnLineageMethod(config: SequenceConfig, title: string, fn: () => void): void {\n\tif (config.cellOrdering === CellOrderingMethod.Lineage) {\n\t\tit.skip(title, fn);\n\t} else {\n\t\tit(title, fn);\n\t}\n}\n\nexport function onlyOnLineageMethod(config: SequenceConfig, title: string, fn: () => void): void {\n\tif (config.cellOrdering === CellOrderingMethod.Lineage) {\n\t\tit(title, fn);\n\t} else {\n\t\tit.skip(title, fn);\n\t}\n}\n\nexport function skipOnTombstoneMethod(config: SequenceConfig, title: string, fn: () => void): void {\n\tif (config.cellOrdering === CellOrderingMethod.Tombstone) {\n\t\tit.skip(title, fn);\n\t} else {\n\t\tit(title, fn);\n\t}\n}\n\nexport function onlyOnTombstoneMethod(config: SequenceConfig, title: string, fn: () => void): void {\n\tif (config.cellOrdering === CellOrderingMethod.Tombstone) {\n\t\tit(title, fn);\n\t} else {\n\t\tit.skip(title, fn);\n\t}\n}\n\nexport function describeForBothConfigs(title: string, fn: (config: SequenceConfig) => void): void {\n\tdescribe(title, () => {\n\t\tfor (const method of [CellOrderingMethod.Tombstone, CellOrderingMethod.Lineage]) {\n\t\t\tdescribe(`${method}-based cell ordering`, () => {\n\t\t\t\twithOrderingMethod(method, fn);\n\t\t\t});\n\t\t}\n\t});\n}\n\nexport function withOrderingMethod(\n\tmethod: CellOrderingMethod,\n\tfn: (config: SequenceConfig) => void,\n) {\n\tconst priorMethod = sequenceConfig.cellOrdering;\n\tconst mutableConfig = sequenceConfig as Mutable<SequenceConfig>;\n\tmutableConfig.cellOrdering = method;\n\ttry {\n\t\t// It's important that return a new object here rather `sequenceConfig` because `fn` may keep a reference to it\n\t\t// (e.g., a lambda's closure) while it may be mutated between the time that reference it taken and the time the\n\t\t// config is read.\n\t\t// Most notably, this is the case when using `describeForBothConfigs` which mutates `sequenceConfig` but does\n\t\t// not run the tests within it immediately.\n\t\tfn({ ...sequenceConfig });\n\t} finally {\n\t\tmutableConfig.cellOrdering = priorMethod;\n\t}\n}\n\nexport function composeNoVerify(\n\tchanges: TaggedChange<TestChangeset>[],\n\trevInfos?: RevisionInfo[],\n): TestChangeset {\n\treturn composeI(\n\t\tchanges,\n\t\t(change1, change2) => TestChange.compose(change1, change2, false),\n\t\trevInfos,\n\t);\n}\n\nexport function compose(\n\tchanges: TaggedChange<TestChangeset>[],\n\trevInfos?: RevisionInfo[] | RevisionMetadataSource,\n\tchildComposer?: (\n\t\tchange1: TestChange | undefined,\n\t\tchange2: TestChange | undefined,\n\t) => TestChange,\n): TestChangeset {\n\treturn composeI(changes, childComposer ?? TestChange.compose, revInfos);\n}\n\nexport function prune(\n\tchange: TestChangeset,\n\tchildPruner?: (child: TestChange) => TestChange | undefined,\n): TestChangeset {\n\treturn SF.sequenceFieldChangeRebaser.prune(\n\t\tchange,\n\t\tchildPruner ?? ((child: TestChange) => (TestChange.isEmpty(child) ? undefined : child)),\n\t);\n}\n\nexport function shallowCompose<T>(\n\tchanges: TaggedChange<SF.Changeset<T>>[],\n\trevInfos?: RevisionInfo[],\n): SF.Changeset<T> {\n\treturn composeI(\n\t\tchanges,\n\t\t(child1, child2) => {\n\t\t\tassert(\n\t\t\t\tchild1 === undefined || child2 === undefined,\n\t\t\t\t\"Should only have one child to compose\",\n\t\t\t);\n\t\t\treturn child1 ?? child2 ?? fail(\"One of the children should be defined\");\n\t\t},\n\t\trevInfos,\n\t);\n}\n\nfunction composeI<T>(\n\tchanges: TaggedChange<SF.Changeset<T>>[],\n\tcomposer: (change1: T | undefined, change2: T | undefined) => T,\n\trevInfos?: RevisionInfo[] | RevisionMetadataSource,\n): SF.Changeset<T> {\n\tconst updatedChanges = changes.map(({ change, revision, rollbackOf }) => ({\n\t\tchange: purgeUnusedCellOrderingInfo(change),\n\t\trevision,\n\t\trollbackOf,\n\t}));\n\tconst idAllocator = continuingAllocator(updatedChanges);\n\tconst metadata =\n\t\trevInfos !== undefined\n\t\t\t? Array.isArray(revInfos)\n\t\t\t\t? revisionMetadataSourceFromInfo(revInfos)\n\t\t\t\t: revInfos\n\t\t\t: defaultRevisionMetadataFromChanges(updatedChanges);\n\n\tlet composed: SF.Changeset<T> = [];\n\tfor (const change of updatedChanges) {\n\t\tcomposed = composePair(makeAnonChange(composed), change, composer, metadata, idAllocator);\n\t}\n\n\treturn composed;\n}\n\nfunction composePair<T>(\n\tchange1: TaggedChange<SF.Changeset<T>>,\n\tchange2: TaggedChange<SF.Changeset<T>>,\n\tcomposer: (change1: T | undefined, change2: T | undefined) => T,\n\tmetadata: RevisionMetadataSource,\n\tidAllocator: IdAllocator,\n): SF.Changeset<T> {\n\tconst moveEffects = SF.newCrossFieldTable();\n\tlet composed = SF.compose(change1, change2, composer, idAllocator, moveEffects, metadata);\n\n\tif (moveEffects.isInvalidated) {\n\t\tresetCrossFieldTable(moveEffects);\n\t\tcomposed = SF.compose(change1, change2, composer, idAllocator, moveEffects, metadata);\n\t}\n\treturn composed;\n}\n\nexport interface RebaseConfig {\n\treadonly metadata?: RebaseRevisionMetadata;\n\treadonly childRebaser?: (\n\t\tchild: TestChange | undefined,\n\t\tbase: TestChange | undefined,\n\t) => TestChange | undefined;\n}\n\nexport function rebase(\n\tchange: TestChangeset,\n\tbase: TaggedChange<TestChangeset>,\n\tconfig: RebaseConfig = {},\n): TestChangeset {\n\tconst cleanChange = purgeUnusedCellOrderingInfo(change);\n\tconst cleanBase = { ...base, change: purgeUnusedCellOrderingInfo(base.change) };\n\tdeepFreeze(cleanChange);\n\tdeepFreeze(cleanBase);\n\n\tconst metadata =\n\t\tconfig.metadata ??\n\t\trebaseRevisionMetadataFromInfo(\n\t\t\tdefaultRevInfosFromChanges([cleanBase, makeAnonChange(cleanChange)]),\n\t\t\t[cleanBase.revision],\n\t\t);\n\n\tconst childRebaser = config.childRebaser ?? TestChange.rebase;\n\n\tconst moveEffects = SF.newCrossFieldTable();\n\tconst idAllocator = idAllocatorFromMaxId(getMaxId(cleanChange, cleanBase.change));\n\tlet rebasedChange = SF.rebase(\n\t\tcleanChange,\n\t\tcleanBase,\n\t\tchildRebaser,\n\t\tidAllocator,\n\t\tmoveEffects,\n\t\tmetadata,\n\t);\n\tif (moveEffects.isInvalidated) {\n\t\tmoveEffects.reset();\n\t\trebasedChange = SF.rebase(\n\t\t\tcleanChange,\n\t\t\tcleanBase,\n\t\t\tchildRebaser,\n\t\t\tidAllocator,\n\t\t\tmoveEffects,\n\t\t\tmetadata,\n\t\t);\n\t}\n\treturn rebasedChange;\n}\n\nexport function rebaseTagged(\n\tchange: TaggedChange<TestChangeset>,\n\tbaseChange: TaggedChange<TestChangeset>,\n): TaggedChange<TestChangeset> {\n\treturn rebaseOverChanges(change, [baseChange]);\n}\n\nexport function rebaseOverChanges(\n\tchange: TaggedChange<TestChangeset>,\n\tbaseChanges: TaggedChange<TestChangeset>[],\n\trevInfos?: RevisionInfo[],\n): TaggedChange<TestChangeset> {\n\tlet currChange = change;\n\tconst revisionInfo = revInfos ?? defaultRevInfosFromChanges(baseChanges);\n\tfor (const base of baseChanges) {\n\t\tcurrChange = tagChange(\n\t\t\trebase(currChange.change, base, {\n\t\t\t\tmetadata: rebaseRevisionMetadataFromInfo(revisionInfo, [base.revision]),\n\t\t\t}),\n\t\t\tcurrChange.revision,\n\t\t);\n\t}\n\n\treturn currChange;\n}\n\nexport function rebaseOverComposition(\n\tchange: TestChangeset,\n\tbase: TestChangeset,\n\tmetadata: RebaseRevisionMetadata,\n): TestChangeset {\n\treturn rebase(change, makeAnonChange(base), { metadata });\n}\n\nfunction resetCrossFieldTable(table: SF.CrossFieldTable) {\n\ttable.isInvalidated = false;\n\ttable.srcQueries.clear();\n\ttable.dstQueries.clear();\n}\n\nexport function invert(change: TaggedChange<TestChangeset>): TestChangeset {\n\tconst cleanChange = { ...change, change: purgeUnusedCellOrderingInfo(change.change) };\n\tdeepFreeze(cleanChange);\n\tconst table = SF.newCrossFieldTable();\n\tconst revisionMetadata = defaultRevisionMetadataFromChanges([cleanChange]);\n\tlet inverted = SF.invert(\n\t\tcleanChange,\n\t\tTestChange.invert,\n\t\ttrue,\n\t\t// Sequence fields should not generate IDs during invert\n\t\tfakeIdAllocator,\n\t\ttable,\n\t\trevisionMetadata,\n\t);\n\n\tif (table.isInvalidated) {\n\t\ttable.isInvalidated = false;\n\t\ttable.srcQueries.clear();\n\t\ttable.dstQueries.clear();\n\t\tinverted = SF.invert(\n\t\t\tcleanChange,\n\t\t\tTestChange.invert,\n\t\t\ttrue,\n\t\t\t// Sequence fields should not generate IDs during invert\n\t\t\tfakeIdAllocator,\n\t\t\ttable,\n\t\t\trevisionMetadata,\n\t\t);\n\t}\n\n\treturn inverted;\n}\n\nexport function checkDeltaEquality(actual: TestChangeset, expected: TestChangeset) {\n\tassertFieldChangesEqual(toDelta(actual), toDelta(expected));\n}\n\nexport function toDelta(change: TestChangeset, revision?: RevisionTag): DeltaFieldChanges {\n\tdeepFreeze(change);\n\treturn SF.sequenceFieldToDelta(tagChange(change, revision), (childChange) =>\n\t\tTestChange.toDelta(tagChange(childChange, revision)),\n\t);\n}\n\nexport function getMaxId(...changes: SF.Changeset<unknown>[]): ChangesetLocalId | undefined {\n\tlet max: ChangesetLocalId | undefined;\n\tfor (const change of changes) {\n\t\tfor (const mark of change) {\n\t\t\tif (SF.isMoveMark(mark)) {\n\t\t\t\tmax = max === undefined ? mark.id : brand(Math.max(max, mark.id));\n\t\t\t}\n\t\t}\n\t}\n\n\treturn max;\n}\n\nexport function getMaxIdTagged(\n\tchanges: TaggedChange<SF.Changeset<unknown>>[],\n): ChangesetLocalId | undefined {\n\treturn getMaxId(...changes.map((c) => c.change));\n}\n\nexport function continuingAllocator(changes: TaggedChange<SF.Changeset<unknown>>[]): IdAllocator {\n\treturn idAllocatorFromMaxId(getMaxIdTagged(changes));\n}\n\nexport function withoutLineage<T>(changeset: SF.Changeset<T>): SF.Changeset<T> {\n\tconst factory = new SF.MarkListFactory<T>();\n\tfor (const mark of changeset) {\n\t\tconst cloned = SF.cloneMark(mark);\n\t\tif (cloned.cellId !== undefined) {\n\t\t\tdelete cloned.cellId.lineage;\n\t\t\tdelete cloned.cellId.adjacentCells;\n\t\t}\n\t\tif (isDetach(cloned) || isAttachAndDetachEffect(cloned)) {\n\t\t\tconst detach = isAttachAndDetachEffect(cloned) ? cloned.detach : cloned;\n\t\t\tif (detach.idOverride !== undefined) {\n\t\t\t\tdelete detach.idOverride.id.lineage;\n\t\t\t\tdelete detach.idOverride.id.adjacentCells;\n\t\t\t}\n\t\t}\n\t\tfactory.push(cloned);\n\t}\n\n\treturn factory.list;\n}\n\nexport function withoutTombstones<T>(changeset: SF.Changeset<T>): SF.Changeset<T> {\n\tconst factory = new SF.MarkListFactory<T>();\n\tfor (const mark of changeset) {\n\t\tif (!isTombstone(mark)) {\n\t\t\tfactory.push(mark);\n\t\t}\n\t}\n\n\treturn factory.list;\n}\n\nexport function withNormalizedLineage<T>(changeset: SF.Changeset<T>): SF.Changeset<T> {\n\tconst factory = new SF.MarkListFactory<T>();\n\tfor (const mark of changeset) {\n\t\tif (mark.cellId?.lineage === undefined) {\n\t\t\tfactory.push(mark);\n\t\t} else {\n\t\t\tconst cloned = SF.cloneMark(mark);\n\t\t\tassert(cloned.cellId?.lineage !== undefined, \"Cloned should have lineage\");\n\t\t\tcloned.cellId.lineage = normalizedLineage(cloned.cellId.lineage);\n\t\t\tfactory.push(cloned);\n\t\t}\n\t}\n\n\treturn factory.list;\n}\n\nfunction normalizedLineage(lineage: SF.LineageEvent[]): SF.LineageEvent[] {\n\tconst normalized = lineage.flatMap((event) => {\n\t\tconst events: SF.LineageEvent[] = [];\n\t\tfor (let i = 0; i < event.count; i++) {\n\t\t\tconst id: ChangesetLocalId = brand(event.id + i);\n\t\t\tconst offset = i <= event.offset ? 0 : 1;\n\t\t\tevents.push({ revision: event.revision, count: 1, id, offset });\n\t\t}\n\n\t\treturn events;\n\t});\n\n\tnormalized.sort((a, b) => {\n\t\tconst cmpRevision = cmp(a.revision, b.revision);\n\t\tif (cmpRevision !== 0) {\n\t\t\treturn cmpRevision;\n\t\t}\n\n\t\treturn cmp(a.id, b.id);\n\t});\n\n\treturn normalized;\n}\n\nfunction cmp(a: any, b: any): number {\n\tif (a === b) {\n\t\treturn 0;\n\t}\n\n\treturn a > b ? 1 : -1;\n}\n\n/**\n * Keeps track of the different ways detached nodes may be referred to.\n * Allows updating changesets so they refer to a detached node by the details\n * of the last detach that affected them.\n *\n * WARNING: this code consumes O(N) space and time for marks that affect N nodes.\n * This is code is currently meant for usage in tests.\n * It should be tested and made more efficient before production use.\n */\nexport class DetachedNodeTracker {\n\t// Maps the index for a node to its last characterization as a reattached node.\n\tprivate nodes: Map<number, CellId> = new Map();\n\tprivate readonly equivalences: { old: CellId; new: CellId }[] = [];\n\n\tpublic constructor() {}\n\n\t/**\n\t * Updates the internals of this instance to account for `change` having been applied.\n\t * @param change - The change that is being applied. Not mutated.\n\t * Must be applicable (i.e., `isApplicable(change)` must be true).\n\t */\n\tpublic apply(change: TaggedChange<Changeset<unknown>>): void {\n\t\tlet index = 0;\n\t\tfor (const mark of change.change) {\n\t\t\tconst inputLength: number = getInputLength(mark);\n\t\t\tif (markEmptiesCells(mark)) {\n\t\t\t\tassert(isDetach(mark), 0x70d /* Only detach marks should empty cells */);\n\t\t\t\tconst newNodes: Map<number, CellId> = new Map();\n\t\t\t\tconst after = index + inputLength;\n\t\t\t\tfor (const [k, v] of this.nodes) {\n\t\t\t\t\tif (k >= index) {\n\t\t\t\t\t\tif (k >= after) {\n\t\t\t\t\t\t\tnewNodes.set(k - inputLength, v);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t// The node is removed\n\t\t\t\t\t\t\tthis.equivalences.push({\n\t\t\t\t\t\t\t\told: v,\n\t\t\t\t\t\t\t\tnew: {\n\t\t\t\t\t\t\t\t\trevision:\n\t\t\t\t\t\t\t\t\t\tchange.rollbackOf ??\n\t\t\t\t\t\t\t\t\t\tmark.revision ??\n\t\t\t\t\t\t\t\t\t\tchange.revision ??\n\t\t\t\t\t\t\t\t\t\tfail(\"Unable to track detached nodes\"),\n\t\t\t\t\t\t\t\t\tlocalId: brand((mark.id as number) + (k - index)),\n\t\t\t\t\t\t\t\t},\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnewNodes.set(k, v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tthis.nodes = newNodes;\n\t\t\t}\n\t\t\tindex += inputLength;\n\t\t}\n\t\tindex = 0;\n\t\tfor (const mark of change.change) {\n\t\t\tconst inputLength: number = getInputLength(mark);\n\t\t\tif (isActiveReattach(mark)) {\n\t\t\t\tconst newNodes: Map<number, CellId> = new Map();\n\t\t\t\tfor (const [k, v] of this.nodes) {\n\t\t\t\t\tif (k >= index) {\n\t\t\t\t\t\tnewNodes.set(k + inputLength, v);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tnewNodes.set(k, v);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tconst detachEvent = mark.cellId ?? fail(\"Unable to track detached nodes\");\n\t\t\t\tfor (let i = 0; i < mark.count; ++i) {\n\t\t\t\t\tnewNodes.set(index + i, {\n\t\t\t\t\t\trevision: detachEvent.revision,\n\t\t\t\t\t\tlocalId: brand((detachEvent.localId as number) + i),\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\tthis.nodes = newNodes;\n\t\t\t}\n\t\t\tif (!markEmptiesCells(mark)) {\n\t\t\t\tindex += inputLength;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Checks whether the given `change` is applicable based on previous changes.\n\t * @param change - The change to verify the applicability of. Not mutated.\n\t * @returns false iff `change`'s description of detached nodes is inconsistent with that of changes applied\n\t * earlier. Returns true otherwise.\n\t */\n\tpublic isApplicable(change: Changeset<unknown>): boolean {\n\t\tfor (const mark of change) {\n\t\t\tif (isActiveReattach(mark)) {\n\t\t\t\tconst detachEvent = mark.cellId ?? fail(\"Unable to track detached nodes\");\n\t\t\t\tconst revision = detachEvent.revision;\n\t\t\t\tfor (let i = 0; i < mark.count; ++i) {\n\t\t\t\t\tconst localId = brand<ChangesetLocalId>((detachEvent.localId as number) + i);\n\t\t\t\t\tconst original: CellId = { revision, localId };\n\t\t\t\t\tconst updated = this.getUpdatedDetach(original);\n\t\t\t\t\tfor (const detached of this.nodes.values()) {\n\t\t\t\t\t\tif (\n\t\t\t\t\t\t\tupdated.revision === detached.revision &&\n\t\t\t\t\t\t\tupdated.localId === detached.localId\n\t\t\t\t\t\t) {\n\t\t\t\t\t\t\t// The new change is attempting to reattach nodes in a location that has already been\n\t\t\t\t\t\t\t// filled by a prior reattach.\n\t\t\t\t\t\t\treturn false;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n\n\t/**\n\t * Creates an updated representation of the given `change` so that it refers to detached nodes using the revision\n\t * that last detached them.\n\t * @param change - The change to update. Not mutated.\n\t * Must be applicable (i.e., `isApplicable(change)` must be true).\n\t * @param genId - An ID allocator that produces ID unique within this changeset.\n\t * @returns A change equivalent to `change` that refers to detached nodes using the revision that last detached\n\t * them. May reuse parts of the input `change` structure.\n\t */\n\tpublic update<T>(change: TaggedChange<Changeset<T>>): TaggedChange<Changeset<T>> {\n\t\tconst factory = new MarkListFactory<T>();\n\t\tfor (const mark of change.change) {\n\t\t\tconst cloned = cloneMark(mark);\n\t\t\tif (areInputCellsEmpty(cloned) && !isNewAttach(cloned)) {\n\t\t\t\tlet remainder = cloned;\n\t\t\t\twhile (remainder.count > 1) {\n\t\t\t\t\tconst [head, tail] = splitMark(remainder, 1);\n\t\t\t\t\tthis.updateMark(head);\n\t\t\t\t\tfactory.push(head);\n\t\t\t\t\tremainder = tail;\n\t\t\t\t}\n\t\t\t\tthis.updateMark(remainder);\n\t\t\t\tfactory.push(remainder);\n\t\t\t} else {\n\t\t\t\tfactory.push(cloned);\n\t\t\t}\n\t\t}\n\n\t\treturn {\n\t\t\t...change,\n\t\t\tchange: factory.list,\n\t\t};\n\t}\n\n\tprivate updateMark(mark: HasMarkFields & DetachedCellMark): void {\n\t\tconst detachEvent = mark.cellId;\n\t\tconst original = { revision: detachEvent.revision, localId: detachEvent.localId };\n\t\tconst updated = this.getUpdatedDetach(original);\n\t\tif (updated.revision !== original.revision || updated.localId !== original.localId) {\n\t\t\tmark.cellId = { ...updated };\n\t\t}\n\t}\n\n\tprivate getUpdatedDetach(detach: CellId): CellId {\n\t\tlet curr = detach;\n\t\tfor (const eq of this.equivalences) {\n\t\t\tif (curr.revision === eq.old.revision && curr.localId === eq.old.localId) {\n\t\t\t\tcurr = eq.new;\n\t\t\t}\n\t\t}\n\t\treturn curr;\n\t}\n}\n\n/**\n * Checks whether `branch` changeset is consistent with a `target` changeset that is may be rebased over.\n *\n * WARNING: this code consumes O(N) space and time for marks that affect N nodes.\n * This is code is currently meant for usage in tests.\n * It should be tested and made more efficient before production use.\n *\n * @param branch - The changeset that would be rebased over `target`.\n * @param target - The changeset that `branch` would be rebased over.\n * @returns false iff `branch`'s description of detached nodes is inconsistent with that of `target`.\n * Returns true otherwise.\n */\nexport function areRebasable(branch: Changeset<unknown>, target: Changeset<unknown>): boolean {\n\tconst indexToReattach: Map<number, string[]> = new Map();\n\tconst reattachToIndex: Map<string, number> = new Map();\n\tlet index = 0;\n\tfor (const mark of branch) {\n\t\tif (isActiveReattach(mark)) {\n\t\t\tconst list = getOrAddEmptyToMap(indexToReattach, index);\n\t\t\tfor (let i = 0; i < mark.count; ++i) {\n\t\t\t\tconst detachEvent = mark.cellId ?? fail(\"Unable to track detached nodes\");\n\t\t\t\tconst entry: CellId = {\n\t\t\t\t\t...detachEvent,\n\t\t\t\t\tlocalId: brand((detachEvent.localId as number) + i),\n\t\t\t\t};\n\t\t\t\tconst key = `${entry.revision}|${entry.localId}`;\n\t\t\t\tassert(\n\t\t\t\t\t!reattachToIndex.has(key),\n\t\t\t\t\t0x506 /* First changeset as inconsistent characterization of detached nodes */,\n\t\t\t\t);\n\t\t\t\tlist.push(key);\n\t\t\t\treattachToIndex.set(key, index);\n\t\t\t}\n\t\t}\n\t\tindex += getInputLength(mark);\n\t}\n\tindex = 0;\n\tlet listIndex = 0;\n\tfor (const mark of target) {\n\t\tif (isActiveReattach(mark)) {\n\t\t\tconst list = getOrAddEmptyToMap(indexToReattach, index);\n\t\t\tfor (let i = 0; i < mark.count; ++i) {\n\t\t\t\tconst detachEvent = mark.cellId ?? fail(\"Unable to track detached nodes\");\n\t\t\t\tconst entry: CellId = {\n\t\t\t\t\t...detachEvent,\n\t\t\t\t\tlocalId: brand((detachEvent.localId as number) + i),\n\t\t\t\t};\n\t\t\t\tconst key = `${entry.revision}|${entry.localId}`;\n\t\t\t\tconst indexInA = reattachToIndex.get(key);\n\t\t\t\tif (indexInA !== undefined && indexInA !== index) {\n\t\t\t\t\t// change b tries to reattach the same content as change a but in a different location\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t\tif (list.includes(key)) {\n\t\t\t\t\twhile (list[listIndex] !== undefined && list[listIndex] !== key) {\n\t\t\t\t\t\t++listIndex;\n\t\t\t\t\t}\n\t\t\t\t\tif (list.slice(0, listIndex).includes(key)) {\n\t\t\t\t\t\t// change b tries to reattach the same content as change a but in a different order\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst inputLength = getInputLength(mark);\n\t\tif (inputLength > 0) {\n\t\t\tlistIndex = 0;\n\t\t}\n\t\tindex += inputLength;\n\t}\n\treturn true;\n}\n\n/**\n * Checks whether sequential changesets are consistent.\n *\n * WARNING: this code consumes O(N) space and time for marks that affect N nodes.\n * This is code is currently meant for usage in tests.\n * It should be tested and made more efficient before production use.\n *\n * @param changes - The changesets that would be composed together.\n * @returns false iff the changesets in `changes` are inconsistent/incompatible in their description of detached nodes.\n * Returns true otherwise.\n */\nexport function areComposable(changes: TaggedChange<Changeset<unknown>>[]): boolean {\n\tconst tracker = new DetachedNodeTracker();\n\tfor (const change of changes) {\n\t\tif (!tracker.isApplicable(change.change)) {\n\t\t\treturn false;\n\t\t}\n\t\ttracker.apply(change);\n\t}\n\treturn true;\n}\n"]}

package/lib/test/feature-libraries/storedToViewSchema.spec.d.ts

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

package/lib/test/feature-libraries/storedToViewSchema.spec.d.ts.map

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