@fluid-experimental/tree 0.58.2002 → 0.58.3000-61081

package/lib/test/fuzz/Generators.js

@@ -0,0 +1,420 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import Prando from 'prando';
+import { v5 } from 'uuid';
+import { IsoBuffer } from '@fluidframework/common-utils';
+import { Side, WriteFormat } from '../../persisted-types';
+import { ChangeType, StablePlace, StableRange } from '../../ChangeTypes';
+import { fail } from '../../Common';
+import { rangeFromStableRange } from '../../TreeViewUtilities';
+import { done, } from './Types';
+function uuid(rand) {
+    return v5(rand.nextString(16), '33f960ec-f1e4-4fca-8dcd-223c6647fcc7');
+}
+const defaultJoinConfig = {
+    maximumActiveCollaborators: 10,
+    maximumPassiveCollaborators: 10,
+    writeFormat: [WriteFormat.v0_0_2, WriteFormat.v0_1_1],
+    summarizeHistory: [false],
+};
+function makeJoinGenerator(passedConfig) {
+    const config = Object.assign(Object.assign({}, defaultJoinConfig), passedConfig);
+    return async ({ rand, activeCollaborators, passiveCollaborators }) => {
+        const activeAllowed = activeCollaborators.length < config.maximumActiveCollaborators;
+        const passiveAllowed = passiveCollaborators.length < config.maximumPassiveCollaborators;
+        const isObserver = activeAllowed && passiveAllowed
+            ? rand.nextBoolean()
+            : activeAllowed
+                ? false
+                : passiveAllowed
+                    ? true
+                    : fail('Cannot generate join op when both active and passive collaborators are at the configured limit.');
+        return {
+            type: 'join',
+            summarizeHistory: rand.nextArrayItem(config.summarizeHistory),
+            writeFormat: rand.nextArrayItem(config.writeFormat),
+            isObserver,
+        };
+    };
+}
+async function leaveGenerator({ rand, activeCollaborators, passiveCollaborators }) {
+    const canUsePassive = passiveCollaborators.length > 0;
+    const canUseActive = activeCollaborators.length > 0;
+    const isObserver = canUsePassive && canUseActive
+        ? rand.nextBoolean()
+        : canUsePassive
+            ? true
+            : canUseActive
+                ? false
+                : fail('Cannot generate a leave op when there are no clients.');
+    const index = rand.nextInt(0, (isObserver ? passiveCollaborators : activeCollaborators).length - 1);
+    return { type: 'leave', isObserver, index };
+}
+const defaultInsertConfig = {
+    definitionPoolSize: 20,
+    maxTreeSequenceSize: 3,
+};
+const defaultEditConfig = {
+    maxTreeSize: Number.POSITIVE_INFINITY,
+    insertWeight: 3,
+    insertConfig: defaultInsertConfig,
+    deleteWeight: 1,
+    moveWeight: 1,
+    setPayloadWeight: 1,
+    traitLabelPoolSize: 20,
+};
+const makeEditGenerator = (passedConfig) => {
+    const config = Object.assign(Object.assign({}, defaultEditConfig), passedConfig);
+    const insertConfig = Object.assign(Object.assign({}, defaultInsertConfig), config.insertConfig);
+    const poolRand = new Prando(0);
+    const traitLabelPool = Array.from({ length: config.traitLabelPoolSize }, () => uuid(poolRand));
+    const traitLabelGenerator = ({ rand }) => rand.nextArrayItem(traitLabelPool);
+    const definitionPool = Array.from({ length: insertConfig.definitionPoolSize }, () => uuid(poolRand));
+    const definitionGenerator = ({ rand }) => rand.nextArrayItem(definitionPool);
+    function traitGenerator(state, { view, idList }) {
+        var _a;
+        const id = state.rand.nextArrayItem(idList);
+        return (_a = view.tryGetTraitLocation(id)) !== null && _a !== void 0 ? _a : { parent: id, label: traitLabelGenerator(state) };
+    }
+    function placeGenerator(state, context) {
+        const { rand } = state;
+        const { view, idList } = context;
+        // Note: this gives a 50% chance of adding to a new trait; we may want to tune this at some point
+        if (rand.nextBoolean()) {
+            const parent = rand.nextArrayItem(idList);
+            return StablePlace.atStartOf({ parent, label: traitLabelGenerator(state) });
+        }
+        const traitLocation = traitGenerator(state, context);
+        const trait = view.getTrait(traitLocation);
+        // For a trait of length N, there are 2N + 2valid places: start, before index 1, after index 1, etc.
+        // index === trait.length is treated as either the start or end of the trait.
+        const makeDescriptor = () => ({
+            index: rand.nextInt(0, trait.length),
+            side: rand.nextBoolean() ? Side.Before : Side.After,
+        });
+        const descriptor = makeDescriptor();
+        const placeFromDescriptor = ({ index, side }) => index === trait.length ? { referenceTrait: traitLocation, side } : { referenceSibling: trait[index], side };
+        return placeFromDescriptor(descriptor);
+    }
+    function rangeGenerator(state, context) {
+        const { rand } = state;
+        const { view } = context;
+        const traitLocation = traitGenerator(state, context);
+        const trait = view.getTrait(traitLocation);
+        // For a trait of length N, there are 2N + 2valid places: start, before index 1, after index 1, etc.
+        // index === trait.length is treated as either the start or end of the trait.
+        const makeDescriptor = () => ({
+            index: rand.nextInt(0, trait.length),
+            side: rand.nextBoolean() ? Side.Before : Side.After,
+        });
+        const descriptor1 = makeDescriptor();
+        let descriptor2;
+        do {
+            descriptor2 = makeDescriptor();
+        } while (descriptor1.index === descriptor2.index && descriptor1.side === descriptor2.side);
+        const sortedDescriptors = [descriptor1, descriptor2];
+        sortedDescriptors.sort((a, b) => {
+            if (a.index === b.index && a.side === b.side) {
+                return 0;
+            }
+            if (a.index === trait.length) {
+                if (a.side === Side.After) {
+                    return -1;
+                }
+                return 1;
+            }
+            if (b.index === trait.length) {
+                if (b.side === Side.After) {
+                    return 1;
+                }
+                return -1;
+            }
+            if (a.index < b.index) {
+                return -1;
+            }
+            return a.side === Side.Before ? -1 : 1;
+        });
+        const [startDescriptor, endDescriptor] = sortedDescriptors;
+        const placeFromDescriptor = ({ index, side }) => index === trait.length ? { referenceTrait: traitLocation, side } : { referenceSibling: trait[index], side };
+        const start = placeFromDescriptor(startDescriptor);
+        const end = placeFromDescriptor(endDescriptor);
+        return StableRange.from(start).to(end);
+    }
+    function treeGenerator(state, context) {
+        const { rand } = state;
+        const treeType = rand.nextArrayItem(['leaf', 'stick', 'balanced']);
+        const makeNode = (traits) => ({
+            identifier: context.idGenerator.generateNodeId(),
+            definition: definitionGenerator(state),
+            traits: traits !== null && traits !== void 0 ? traits : {},
+        });
+        switch (treeType) {
+            case 'leaf':
+                return makeNode();
+            case 'stick':
+                return makeNode({
+                    [traitLabelGenerator(state)]: [makeNode({ [traitLabelGenerator(state)]: [makeNode()] })],
+                });
+            case 'balanced':
+                return makeNode({
+                    [traitLabelGenerator(state)]: [makeNode()],
+                    [traitLabelGenerator(state)]: [makeNode()],
+                });
+            default:
+                fail(`Unexpected treeType ${treeType}`);
+        }
+    }
+    async function insertGenerator(state, context) {
+        const { maxTreeSequenceSize } = insertConfig;
+        const id = 1;
+        const { view } = context;
+        const isValidInsertPlace = (destination) => {
+            // Disallow insertion adjacent to the root node.
+            if (destination.referenceSibling === view.root) {
+                return false;
+            }
+            return true;
+        };
+        let destination;
+        do {
+            destination = placeGenerator(state, context);
+        } while (!isValidInsertPlace(destination));
+        return {
+            fuzzType: 'insert',
+            build: {
+                type: ChangeType.Build,
+                destination: id,
+                source: Array.from({ length: state.rand.nextInt(1, maxTreeSequenceSize) }, () => treeGenerator(state, context)),
+            },
+            insert: {
+                type: ChangeType.Insert,
+                destination,
+                source: id,
+            },
+        };
+    }
+    async function deleteGenerator(state, context) {
+        const { view } = context;
+        const isValidDeleteRange = (source) => {
+            // Disallow deletion of the root node.
+            if (source.start.referenceSibling === view.root || source.end.referenceSibling === view.root) {
+                return false;
+            }
+            return true;
+        };
+        let source;
+        do {
+            source = rangeGenerator(state, context);
+        } while (!isValidDeleteRange(source));
+        return {
+            fuzzType: 'delete',
+            type: ChangeType.Detach,
+            source,
+        };
+    }
+    async function moveGenerator(state, context) {
+        const id = 1;
+        const { view } = context;
+        const isValidMoveRange = ({ start, end }, destination) => {
+            var _a, _b, _c, _d;
+            // An ancestor cannot be moved to be a sibling of its descendant.
+            const forbiddenDescendantId = (_c = (_b = (_a = destination.referenceTrait) === null || _a === void 0 ? void 0 : _a.parent) !== null && _b !== void 0 ? _b : destination.referenceSibling) !== null && _c !== void 0 ? _c : fail('Invalid place');
+            const unadjustedStartIndex = view.findIndexWithinTrait(start);
+            const unadjustedEndIndex = view.findIndexWithinTrait(end);
+            const startIndex = unadjustedStartIndex + (start.side === Side.After ? 1 : 0);
+            const endIndex = unadjustedEndIndex + (end.side === Side.After ? 1 : 0);
+            const idsInSource = new Set(view.getTrait(start.trait).slice(startIndex, endIndex));
+            for (let current = forbiddenDescendantId; current !== undefined; current = (_d = view.tryGetParentViewNode(current)) === null || _d === void 0 ? void 0 : _d.identifier) {
+                if (idsInSource.has(current)) {
+                    return false;
+                }
+            }
+            return true;
+        };
+        let source;
+        let destination;
+        do {
+            source = rangeGenerator(state, context);
+            destination = placeGenerator(state, context);
+        } while (!isValidMoveRange(rangeFromStableRange(view, source), destination));
+        return {
+            fuzzType: 'move',
+            detach: {
+                type: ChangeType.Detach,
+                destination: id,
+                source,
+            },
+            insert: {
+                type: ChangeType.Insert,
+                destination,
+                source: id,
+            },
+        };
+    }
+    async function setPayloadGenerator({ rand }, { idList, view, dataStoreRuntime }) {
+        const nodeToModify = rand.nextArrayItem(idList);
+        const getPayloadContents = async (rand) => {
+            if (rand.nextBoolean()) {
+                return rand.nextString(4);
+            }
+            const handle = await dataStoreRuntime.uploadBlob(IsoBuffer.from(rand.nextString(10)));
+            return { blob: handle };
+        };
+        const viewNode = view.getViewNode(nodeToModify);
+        const payload = viewNode.payload !== undefined
+            ? rand.nextBoolean()
+                ? await getPayloadContents(rand)
+                : undefined
+            : undefined;
+        return {
+            fuzzType: 'setPayload',
+            type: ChangeType.SetValue,
+            nodeToModify: rand.nextArrayItem(idList),
+            payload,
+        };
+    }
+    const baseEditGenerator = createWeightedGenerator([
+        [insertGenerator, config.insertWeight, (_, { idList }) => idList.length < config.maxTreeSize],
+        [deleteGenerator, config.deleteWeight, (_, { idList }) => idList.length > 1],
+        [moveGenerator, config.moveWeight, (_, { idList }) => idList.length > 1],
+        [setPayloadGenerator, config.setPayloadWeight],
+    ]);
+    return async (state) => {
+        const { rand, activeCollaborators } = state;
+        const index = rand.nextInt(0, activeCollaborators.length - 1);
+        const { tree } = activeCollaborators[index];
+        const view = tree.currentView;
+        const idList = getIdList(view);
+        const contents = await baseEditGenerator(state, {
+            view,
+            idList,
+            dataStoreRuntime: tree.getRuntime(),
+            idGenerator: tree,
+        });
+        if (contents === done) {
+            return done;
+        }
+        return { type: 'edit', contents, index };
+    };
+};
+const defaultOpConfig = {
+    editConfig: defaultEditConfig,
+    joinConfig: defaultJoinConfig,
+    editWeight: 10,
+    joinWeight: 1,
+    leaveWeight: 1,
+    synchronizeWeight: 1,
+};
+export function makeOpGenerator(passedConfig) {
+    const config = Object.assign(Object.assign({}, defaultOpConfig), passedConfig);
+    const { maximumPassiveCollaborators, maximumActiveCollaborators } = Object.assign(Object.assign({}, defaultJoinConfig), config.joinConfig);
+    const maximumCollaborators = maximumPassiveCollaborators + maximumActiveCollaborators;
+    const collaboratorsMatches = (criteria) => ({ activeCollaborators, passiveCollaborators }) => criteria(activeCollaborators.length + passiveCollaborators.length);
+    const atLeastOneClient = collaboratorsMatches((count) => count > 0);
+    const atLeastOneActiveClient = ({ activeCollaborators }) => activeCollaborators.length > 0;
+    const opWeights = [
+        [makeEditGenerator(config.editConfig), config.editWeight, atLeastOneActiveClient],
+        [
+            makeJoinGenerator(config.joinConfig),
+            config.joinWeight,
+            collaboratorsMatches((count) => count < maximumCollaborators),
+        ],
+        [leaveGenerator, config.leaveWeight, atLeastOneClient],
+        [{ type: 'synchronize' }, config.synchronizeWeight, atLeastOneClient],
+    ];
+    return createWeightedGenerator(opWeights);
+}
+function createWeightedGenerator(weights) {
+    const cumulativeSums = [];
+    let totalWeight = 0;
+    for (const [tOrGenerator, weight, shouldAccept] of weights) {
+        const cumulativeWeight = totalWeight + weight;
+        cumulativeSums.push([tOrGenerator, cumulativeWeight, shouldAccept]);
+        totalWeight = cumulativeWeight;
+    }
+    return async (state, additionalState) => {
+        var _a;
+        const { rand } = state;
+        const sample = () => {
+            const weightSelected = rand.nextInt(1, totalWeight);
+            let opIndex = 0;
+            while (cumulativeSums[opIndex][1] < weightSelected) {
+                opIndex++;
+            }
+            return opIndex;
+        };
+        let index;
+        let shouldAccept;
+        do {
+            index = sample();
+            shouldAccept = cumulativeSums[index][2];
+        } while (!((_a = shouldAccept === null || shouldAccept === void 0 ? void 0 : shouldAccept(state, additionalState)) !== null && _a !== void 0 ? _a : true));
+        const [tOrGenerator] = cumulativeSums[index];
+        return typeof tOrGenerator === 'function'
+            ? tOrGenerator(state, additionalState)
+            : tOrGenerator;
+    };
+}
+function getIdList(tree) {
+    var _a;
+    const allIds = [];
+    const toVisit = [tree.root];
+    while (toVisit.length > 0) {
+        const id = (_a = toVisit.pop()) !== null && _a !== void 0 ? _a : fail();
+        allIds.push(id);
+        const node = tree.getViewNode(id);
+        for (const [_, childIds] of node.traits) {
+            toVisit.push(...childIds);
+        }
+    }
+    return allIds;
+}
+/**
+ * Higher-order generator operator which creates a new generator producing the first `n` elements of `generator`.
+ */
+export function take(n, generator) {
+    let count = 0;
+    return async (state, additionalState) => {
+        if (count < n) {
+            count++;
+            return generator(state, additionalState);
+        }
+        return done;
+    };
+}
+/**
+ * @returns a deterministic generator that always returns the items of `contents` in order.
+ */
+export function generatorFromArray(contents) {
+    let index = -1;
+    return async () => {
+        var _a;
+        if (index < contents.length) {
+            index++;
+            return (_a = contents[index]) !== null && _a !== void 0 ? _a : done;
+        }
+        return done;
+    };
+}
+/**
+ * Higher-order generator operator which exhausts each input generator sequentially before moving on to the next.
+ */
+export function chain(...generators) {
+    let currentIndex = 0;
+    return async (state, additionalState) => {
+        while (currentIndex < generators.length) {
+            const generator = generators[currentIndex];
+            const result = await generator(state, additionalState);
+            if (result !== done) {
+                return result;
+            }
+            else {
+                currentIndex++;
+            }
+        }
+        return done;
+    };
+}
+//# sourceMappingURL=Generators.js.map

package/lib/test/fuzz/Generators.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Generators.js","sourceRoot":"","sources":["../../../src/test/fuzz/Generators.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,MAAM,MAAM,QAAQ,CAAC;AAC5B,OAAO,EAAE,EAAE,EAAE,MAAM,MAAM,CAAC;AAC1B,OAAO,EAAE,SAAS,EAAE,MAAM,8BAA8B,CAAC;AAEzD,OAAO,EAAE,IAAI,EAAY,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,EAAa,UAAU,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAGpF,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AACpC,OAAO,EAAE,oBAAoB,EAAE,MAAM,yBAAyB,CAAC;AAC/D,OAAO,EACN,IAAI,GAcJ,MAAM,SAAS,CAAC;AAEjB,SAAS,IAAI,CAAC,IAAY;IACzB,OAAO,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,sCAAsC,CAAC,CAAC;AACxE,CAAC;AAED,MAAM,iBAAiB,GAAmC;IACzD,0BAA0B,EAAE,EAAE;IAC9B,2BAA2B,EAAE,EAAE;IAC/B,WAAW,EAAE,CAAC,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC;IACrD,gBAAgB,EAAE,CAAC,KAAK,CAAC;CACzB,CAAC;AAEF,SAAS,iBAAiB,CAAC,YAAkC;IAC5D,MAAM,MAAM,mCAAQ,iBAAiB,GAAK,YAAY,CAAE,CAAC;IACzD,OAAO,KAAK,EAAE,EAAE,IAAI,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,EAAE,EAAE;QACpE,MAAM,aAAa,GAAG,mBAAmB,CAAC,MAAM,GAAG,MAAM,CAAC,0BAA0B,CAAC;QACrF,MAAM,cAAc,GAAG,oBAAoB,CAAC,MAAM,GAAG,MAAM,CAAC,2BAA2B,CAAC;QACxF,MAAM,UAAU,GACf,aAAa,IAAI,cAAc;YAC9B,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE;YACpB,CAAC,CAAC,aAAa;gBACf,CAAC,CAAC,KAAK;gBACP,CAAC,CAAC,cAAc;oBAChB,CAAC,CAAC,IAAI;oBACN,CAAC,CAAC,IAAI,CACJ,iGAAiG,CAChG,CAAC;QACN,OAAO;YACN,IAAI,EAAE,MAAM;YACZ,gBAAgB,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,gBAAgB,CAAC;YAC7D,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC;YACnD,UAAU;SACV,CAAC;IACH,CAAC,CAAC;AACH,CAAC;AAED,KAAK,UAAU,cAAc,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAE,oBAAoB,EAAiB;IAC/F,MAAM,aAAa,GAAG,oBAAoB,CAAC,MAAM,GAAG,CAAC,CAAC;IACtD,MAAM,YAAY,GAAG,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC;IACpD,MAAM,UAAU,GACf,aAAa,IAAI,YAAY;QAC5B,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE;QACpB,CAAC,CAAC,aAAa;YACf,CAAC,CAAC,IAAI;YACN,CAAC,CAAC,YAAY;gBACd,CAAC,CAAC,KAAK;gBACP,CAAC,CAAC,IAAI,CAAC,uDAAuD,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,oBAAoB,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpG,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;AAC7C,CAAC;AAED,MAAM,mBAAmB,GAAqC;IAC7D,kBAAkB,EAAE,EAAE;IACtB,mBAAmB,EAAE,CAAC;CACtB,CAAC;AAEF,MAAM,iBAAiB,GAAmC;IACzD,WAAW,EAAE,MAAM,CAAC,iBAAiB;IACrC,YAAY,EAAE,CAAC;IACf,YAAY,EAAE,mBAAmB;IACjC,YAAY,EAAE,CAAC;IACf,UAAU,EAAE,CAAC;IACb,gBAAgB,EAAE,CAAC;IACnB,kBAAkB,EAAE,EAAE;CACtB,CAAC;AAEF,MAAM,iBAAiB,GAAG,CAAC,YAAkC,EAAwC,EAAE;IACtG,MAAM,MAAM,mCAAQ,iBAAiB,GAAK,YAAY,CAAE,CAAC;IACzD,MAAM,YAAY,mCAAQ,mBAAmB,GAAK,MAAM,CAAC,YAAY,CAAE,CAAC;IACxE,MAAM,QAAQ,GAAG,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,kBAAkB,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAe,CAAC,CAAC;IAC7G,MAAM,mBAAmB,GAAG,CAAC,EAAE,IAAI,EAAiB,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;IAE5F,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,YAAY,CAAC,kBAAkB,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAe,CAAC,CAAC;IACnH,MAAM,mBAAmB,GAAG,CAAC,EAAE,IAAI,EAAiB,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,CAAC;IAE5F,SAAS,cAAc,CAAC,KAAoB,EAAE,EAAE,IAAI,EAAE,MAAM,EAAe;;QAC1E,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAC5C,aAAO,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,mCAAI,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC;IAC1F,CAAC;IAED,SAAS,cAAc,CAAC,KAAoB,EAAE,OAAoB;QACjE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;QACvB,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;QACjC,iGAAiG;QACjG,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC1C,OAAO,WAAW,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,mBAAmB,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;SAC5E;QACD,MAAM,aAAa,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAK3C,oGAAoG;QACpG,6EAA6E;QAC7E,MAAM,cAAc,GAAG,GAAe,EAAE,CAAC,CAAC;YACzC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC;YACpC,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK;SACnD,CAAC,CAAC;QACH,MAAM,UAAU,GAAG,cAAc,EAAE,CAAC;QAEpC,MAAM,mBAAmB,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,EAAc,EAAe,EAAE,CACxE,KAAK,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;QAC7G,OAAO,mBAAmB,CAAC,UAAU,CAAC,CAAC;IACxC,CAAC;IAED,SAAS,cAAc,CAAC,KAAoB,EAAE,OAAoB;QACjE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;QACvB,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;QACzB,MAAM,aAAa,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC;QAK3C,oGAAoG;QACpG,6EAA6E;QAC7E,MAAM,cAAc,GAAG,GAAe,EAAE,CAAC,CAAC;YACzC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC;YACpC,IAAI,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK;SACnD,CAAC,CAAC;QACH,MAAM,WAAW,GAAG,cAAc,EAAE,CAAC;QACrC,IAAI,WAAuB,CAAC;QAC5B,GAAG;YACF,WAAW,GAAG,cAAc,EAAE,CAAC;SAC/B,QAAQ,WAAW,CAAC,KAAK,KAAK,WAAW,CAAC,KAAK,IAAI,WAAW,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI,EAAE;QAE3F,MAAM,iBAAiB,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,CAAC;QACrD,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAC/B,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,EAAE;gBAC7C,OAAO,CAAC,CAAC;aACT;YACD,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,MAAM,EAAE;gBAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;oBAC1B,OAAO,CAAC,CAAC,CAAC;iBACV;gBACD,OAAO,CAAC,CAAC;aACT;YACD,IAAI,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,MAAM,EAAE;gBAC7B,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,EAAE;oBAC1B,OAAO,CAAC,CAAC;iBACT;gBACD,OAAO,CAAC,CAAC,CAAC;aACV;YACD,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,EAAE;gBACtB,OAAO,CAAC,CAAC,CAAC;aACV;YACD,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,eAAe,EAAE,aAAa,CAAC,GAAG,iBAAiB,CAAC;QAC3D,MAAM,mBAAmB,GAAG,CAAC,EAAE,KAAK,EAAE,IAAI,EAAc,EAAe,EAAE,CACxE,KAAK,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,gBAAgB,EAAE,KAAK,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC;QAC7G,MAAM,KAAK,GAAG,mBAAmB,CAAC,eAAe,CAAC,CAAC;QACnD,MAAM,GAAG,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;QAC/C,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IACxC,CAAC;IAED,SAAS,aAAa,CAAC,KAAoB,EAAE,OAAoB;QAChE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,MAAM,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC,CAAC;QACnE,MAAM,QAAQ,GAAG,CAAC,MAA4B,EAAa,EAAE,CAAC,CAAC;YAC9D,UAAU,EAAE,OAAO,CAAC,WAAW,CAAC,cAAc,EAAE;YAChD,UAAU,EAAE,mBAAmB,CAAC,KAAK,CAAC;YACtC,MAAM,EAAE,MAAM,aAAN,MAAM,cAAN,MAAM,GAAI,EAAE;SACpB,CAAC,CAAC;QACH,QAAQ,QAAQ,EAAE;YACjB,KAAK,MAAM;gBACV,OAAO,QAAQ,EAAE,CAAC;YACnB,KAAK,OAAO;gBACX,OAAO,QAAQ,CAAC;oBACf,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;iBACxF,CAAC,CAAC;YACJ,KAAK,UAAU;gBACd,OAAO,QAAQ,CAAC;oBACf,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;oBAC1C,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC;iBAC1C,CAAC,CAAC;YACJ;gBACC,IAAI,CAAC,uBAAuB,QAAQ,EAAE,CAAC,CAAC;SACzC;IACF,CAAC;IAED,KAAK,UAAU,eAAe,CAAC,KAAoB,EAAE,OAAoB;QACxE,MAAM,EAAE,mBAAmB,EAAE,GAAG,YAAY,CAAC;QAC7C,MAAM,EAAE,GAAG,CAAuB,CAAC;QACnC,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;QACzB,MAAM,kBAAkB,GAAG,CAAC,WAAwB,EAAW,EAAE;YAChE,gDAAgD;YAChD,IAAI,WAAW,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,EAAE;gBAC/C,OAAO,KAAK,CAAC;aACb;YAED,OAAO,IAAI,CAAC;QACb,CAAC,CAAC;QAEF,IAAI,WAAwB,CAAC;QAC7B,GAAG;YACF,WAAW,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;SAC7C,QAAQ,CAAC,kBAAkB,CAAC,WAAW,CAAC,EAAE;QAE3C,OAAO;YACN,QAAQ,EAAE,QAAQ;YAClB,KAAK,EAAE;gBACN,IAAI,EAAE,UAAU,CAAC,KAAK;gBACtB,WAAW,EAAE,EAAE;gBACf,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,mBAAmB,CAAC,EAAE,EAAE,GAAG,EAAE,CAC/E,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAC7B;aACD;YACD,MAAM,EAAE;gBACP,IAAI,EAAE,UAAU,CAAC,MAAM;gBACvB,WAAW;gBACX,MAAM,EAAE,EAAE;aACV;SACD,CAAC;IACH,CAAC;IAED,KAAK,UAAU,eAAe,CAAC,KAAoB,EAAE,OAAoB;QACxE,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;QACzB,MAAM,kBAAkB,GAAG,CAAC,MAAmB,EAAW,EAAE;YAC3D,sCAAsC;YACtC,IAAI,MAAM,CAAC,KAAK,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,gBAAgB,KAAK,IAAI,CAAC,IAAI,EAAE;gBAC7F,OAAO,KAAK,CAAC;aACb;YAED,OAAO,IAAI,CAAC;QACb,CAAC,CAAC;QAEF,IAAI,MAAmB,CAAC;QACxB,GAAG;YACF,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;SACxC,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,EAAE;QAEtC,OAAO;YACN,QAAQ,EAAE,QAAQ;YAClB,IAAI,EAAE,UAAU,CAAC,MAAM;YACvB,MAAM;SACN,CAAC;IACH,CAAC;IAED,KAAK,UAAU,aAAa,CAAC,KAAoB,EAAE,OAAoB;QACtE,MAAM,EAAE,GAAG,CAAuB,CAAC;QACnC,MAAM,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC;QAEzB,MAAM,gBAAgB,GAAG,CAAC,EAAE,KAAK,EAAE,GAAG,EAAiB,EAAE,WAAwB,EAAW,EAAE;;YAC7F,iEAAiE;YACjE,MAAM,qBAAqB,qBAC1B,WAAW,CAAC,cAAc,0CAAE,MAAM,mCAAI,WAAW,CAAC,gBAAgB,mCAAI,IAAI,CAAC,eAAe,CAAC,CAAC;YAE7F,MAAM,oBAAoB,GAAW,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;YACtE,MAAM,kBAAkB,GAAW,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,CAAC;YAClE,MAAM,UAAU,GAAG,oBAAoB,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9E,MAAM,QAAQ,GAAG,kBAAkB,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAExE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;YACpF,KACC,IAAI,OAAO,GAAuB,qBAAqB,EACvD,OAAO,KAAK,SAAS,EACrB,OAAO,SAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,0CAAE,UAAU,EACvD;gBACD,IAAI,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;oBAC7B,OAAO,KAAK,CAAC;iBACb;aACD;YACD,OAAO,IAAI,CAAC;QACb,CAAC,CAAC;QAEF,IAAI,MAAmB,CAAC;QACxB,IAAI,WAAwB,CAAC;QAC7B,GAAG;YACF,MAAM,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YACxC,WAAW,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;SAC7C,QAAQ,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,WAAW,CAAC,EAAE;QAE7E,OAAO;YACN,QAAQ,EAAE,MAAM;YAChB,MAAM,EAAE;gBACP,IAAI,EAAE,UAAU,CAAC,MAAM;gBACvB,WAAW,EAAE,EAAE;gBACf,MAAM;aACN;YACD,MAAM,EAAE;gBACP,IAAI,EAAE,UAAU,CAAC,MAAM;gBACvB,WAAW;gBACX,MAAM,EAAE,EAAE;aACV;SACD,CAAC;IACH,CAAC;IAED,KAAK,UAAU,mBAAmB,CACjC,EAAE,IAAI,EAAiB,EACvB,EAAE,MAAM,EAAE,IAAI,EAAE,gBAAgB,EAAe;QAE/C,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,kBAAkB,GAAG,KAAK,EAAE,IAAY,EAA6D,EAAE;YAC5G,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE;gBACvB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;aAC1B;YACD,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACtF,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;QACzB,CAAC,CAAC;QAEF,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QAChD,MAAM,OAAO,GACZ,QAAQ,CAAC,OAAO,KAAK,SAAS;YAC7B,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE;gBACnB,CAAC,CAAC,MAAM,kBAAkB,CAAC,IAAI,CAAC;gBAChC,CAAC,CAAC,SAAS;YACZ,CAAC,CAAC,SAAS,CAAC;QACd,OAAO;YACN,QAAQ,EAAE,YAAY;YACtB,IAAI,EAAE,UAAU,CAAC,QAAQ;YACzB,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC;YACxC,OAAO;SACP,CAAC;IACH,CAAC;IAED,MAAM,iBAAiB,GAAG,uBAAuB,CAA0B;QAC1E,CAAC,eAAe,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,WAAW,CAAC;QAC7F,CAAC,eAAe,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5E,CAAC,aAAa,EAAE,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACxE,CAAC,mBAAmB,EAAE,MAAM,CAAC,gBAAgB,CAAC;KAC9C,CAAC,CAAC;IAEH,OAAO,KAAK,EAAE,KAAoB,EAAoC,EAAE;QACvE,MAAM,EAAE,IAAI,EAAE,mBAAmB,EAAE,GAAG,KAAK,CAAC;QAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9D,MAAM,EAAE,IAAI,EAAE,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC;QAC9B,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAAG,MAAM,iBAAiB,CAAC,KAAK,EAAE;YAC/C,IAAI;YACJ,MAAM;YACN,gBAAgB,EAAE,IAAI,CAAC,UAAU,EAAE;YACnC,WAAW,EAAE,IAAI;SACjB,CAAC,CAAC;QACH,IAAI,QAAQ,KAAK,IAAI,EAAE;YACtB,OAAO,IAAI,CAAC;SACZ;QACD,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC1C,CAAC,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,eAAe,GAAwC;IAC5D,UAAU,EAAE,iBAAiB;IAC7B,UAAU,EAAE,iBAAiB;IAC7B,UAAU,EAAE,EAAE;IACd,UAAU,EAAE,CAAC;IACb,WAAW,EAAE,CAAC;IACd,iBAAiB,EAAE,CAAC;CACpB,CAAC;AAEF,MAAM,UAAU,eAAe,CAAC,YAAuC;IACtE,MAAM,MAAM,mCACR,eAAe,GACf,YAAY,CACf,CAAC;IAEF,MAAM,EAAE,2BAA2B,EAAE,0BAA0B,EAAE,mCAAQ,iBAAiB,GAAK,MAAM,CAAC,UAAU,CAAE,CAAC;IACnH,MAAM,oBAAoB,GAAG,2BAA2B,GAAG,0BAA0B,CAAC;IAEtF,MAAM,oBAAoB,GACzB,CAAC,QAAgD,EAAkC,EAAE,CACrF,CAAC,EAAE,mBAAmB,EAAE,oBAAoB,EAAE,EAAE,EAAE,CACjD,QAAQ,CAAC,mBAAmB,CAAC,MAAM,GAAG,oBAAoB,CAAC,MAAM,CAAC,CAAC;IACrE,MAAM,gBAAgB,GAAG,oBAAoB,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACpE,MAAM,sBAAsB,GAAmC,CAAC,EAAE,mBAAmB,EAAE,EAAE,EAAE,CAC1F,mBAAmB,CAAC,MAAM,GAAG,CAAC,CAAC;IAChC,MAAM,SAAS,GAAkC;QAChD,CAAC,iBAAiB,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,MAAM,CAAC,UAAU,EAAE,sBAAsB,CAAC;QACjF;YACC,iBAAiB,CAAC,MAAM,CAAC,UAAU,CAAC;YACpC,MAAM,CAAC,UAAU;YACjB,oBAAoB,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,oBAAoB,CAAC;SAC7D;QACD,CAAC,cAAc,EAAE,MAAM,CAAC,WAAW,EAAE,gBAAgB,CAAC;QACtD,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,EAAE,MAAM,CAAC,iBAAiB,EAAE,gBAAgB,CAAC;KACrE,CAAC;IACF,OAAO,uBAAuB,CAAC,SAAS,CAAC,CAAC;AAC3C,CAAC;AAiBD,SAAS,uBAAuB,CAC/B,OAAqC;IAErC,MAAM,cAAc,GACnB,EAAE,CAAC;IACJ,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,CAAC,YAAY,EAAE,MAAM,EAAE,YAAY,CAAC,IAAI,OAAO,EAAE;QAC3D,MAAM,gBAAgB,GAAG,WAAW,GAAG,MAAM,CAAC;QAC9C,cAAc,CAAC,IAAI,CAAC,CAAC,YAAY,EAAE,gBAAgB,EAAE,YAAY,CAAC,CAAC,CAAC;QACpE,WAAW,GAAG,gBAAgB,CAAC;KAC/B;IAED,OAAO,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,EAAE;;QACvC,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAC;QACvB,MAAM,MAAM,GAAG,GAAG,EAAE;YACnB,MAAM,cAAc,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;YAEpD,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,OAAO,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,cAAc,EAAE;gBACnD,OAAO,EAAE,CAAC;aACV;YAED,OAAO,OAAO,CAAC;QAChB,CAAC,CAAC;QAEF,IAAI,KAAK,CAAC;QACV,IAAI,YAA+D,CAAC;QACpE,GAAG;YACF,KAAK,GAAG,MAAM,EAAE,CAAC;YACjB,YAAY,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;SACxC,QAAQ,CAAC,OAAC,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAG,KAAK,EAAE,eAAe,oCAAK,IAAI,CAAC,EAAE;QAE5D,MAAM,CAAC,YAAY,CAAC,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QAC7C,OAAO,OAAO,YAAY,KAAK,UAAU;YACxC,CAAC,CAAE,YAAoD,CAAC,KAAK,EAAE,eAAe,CAAC;YAC/E,CAAC,CAAE,YAA6B,CAAC;IACnC,CAAC,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,IAAc;;IAChC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;QAC1B,MAAM,EAAE,SAAG,OAAO,CAAC,GAAG,EAAE,mCAAI,IAAI,EAAE,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAChB,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAClC,KAAK,MAAM,CAAC,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE;YACxC,OAAO,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC;SAC1B;KACD;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,IAAI,CACnB,CAAS,EACT,SAA8C;IAE9C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,EAAE;QACvC,IAAI,KAAK,GAAG,CAAC,EAAE;YACd,KAAK,EAAE,CAAC;YACR,OAAO,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;SACzC;QACD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAsB,QAAa;IACpE,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,OAAO,KAAK,IAAI,EAAE;;QACjB,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE;YAC5B,KAAK,EAAE,CAAC;YACR,aAAO,QAAQ,CAAC,KAAK,CAAC,mCAAI,IAAI,CAAC;SAC/B;QACD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CACpB,GAAG,UAAiD;IAEpD,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,OAAO,KAAK,EAAE,KAAK,EAAE,eAAe,EAAE,EAAE;QACvC,OAAO,YAAY,GAAG,UAAU,CAAC,MAAM,EAAE;YACxC,MAAM,SAAS,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;YAC3C,MAAM,MAAM,GAAG,MAAM,SAAS,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC;YACvD,IAAI,MAAM,KAAK,IAAI,EAAE;gBACpB,OAAO,MAAM,CAAC;aACd;iBAAM;gBACN,YAAY,EAAE,CAAC;aACf;SACD;QACD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC","sourcesContent":["/*!\n * Copyright (c) Microsoft Corporation and contributors. All rights reserved.\n * Licensed under the MIT License.\n */\n\nimport Prando from 'prando';\nimport { v5 } from 'uuid';\nimport { IsoBuffer } from '@fluidframework/common-utils';\nimport { IFluidHandle } from '@fluidframework/core-interfaces';\nimport { Side, TraitMap, WriteFormat } from '../../persisted-types';\nimport { BuildNode, ChangeType, StablePlace, StableRange } from '../../ChangeTypes';\nimport { TraitLocation, TreeView, TreeViewRange } from '../../TreeView';\nimport { Definition, DetachedSequenceId, NodeId, TraitLabel } from '../../Identifiers';\nimport { fail } from '../../Common';\nimport { rangeFromStableRange } from '../../TreeViewUtilities';\nimport {\n\tdone,\n\tEditGenerationConfig,\n\tFuzzChange,\n\tFuzzDelete,\n\tFuzzInsert,\n\tFuzzMove,\n\tFuzzTestState,\n\tAsyncGenerator,\n\tInsertGenerationConfig,\n\tJoinGenerationConfig,\n\tOperation,\n\tOperationGenerationConfig,\n\tTreeContext,\n\tTreeLeave,\n} from './Types';\n\nfunction uuid(rand: Prando): string {\n\treturn v5(rand.nextString(16), '33f960ec-f1e4-4fca-8dcd-223c6647fcc7');\n}\n\nconst defaultJoinConfig: Required<JoinGenerationConfig> = {\n\tmaximumActiveCollaborators: 10,\n\tmaximumPassiveCollaborators: 10,\n\twriteFormat: [WriteFormat.v0_0_2, WriteFormat.v0_1_1],\n\tsummarizeHistory: [false],\n};\n\nfunction makeJoinGenerator(passedConfig: JoinGenerationConfig): AsyncGenerator<Operation, undefined> {\n\tconst config = { ...defaultJoinConfig, ...passedConfig };\n\treturn async ({ rand, activeCollaborators, passiveCollaborators }) => {\n\t\tconst activeAllowed = activeCollaborators.length < config.maximumActiveCollaborators;\n\t\tconst passiveAllowed = passiveCollaborators.length < config.maximumPassiveCollaborators;\n\t\tconst isObserver =\n\t\t\tactiveAllowed && passiveAllowed\n\t\t\t\t? rand.nextBoolean()\n\t\t\t\t: activeAllowed\n\t\t\t\t? false\n\t\t\t\t: passiveAllowed\n\t\t\t\t? true\n\t\t\t\t: fail(\n\t\t\t\t\t\t'Cannot generate join op when both active and passive collaborators are at the configured limit.'\n\t\t\t\t  );\n\t\treturn {\n\t\t\ttype: 'join',\n\t\t\tsummarizeHistory: rand.nextArrayItem(config.summarizeHistory),\n\t\t\twriteFormat: rand.nextArrayItem(config.writeFormat),\n\t\t\tisObserver,\n\t\t};\n\t};\n}\n\nasync function leaveGenerator({ rand, activeCollaborators, passiveCollaborators }: FuzzTestState): Promise<TreeLeave> {\n\tconst canUsePassive = passiveCollaborators.length > 0;\n\tconst canUseActive = activeCollaborators.length > 0;\n\tconst isObserver =\n\t\tcanUsePassive && canUseActive\n\t\t\t? rand.nextBoolean()\n\t\t\t: canUsePassive\n\t\t\t? true\n\t\t\t: canUseActive\n\t\t\t? false\n\t\t\t: fail('Cannot generate a leave op when there are no clients.');\n\tconst index = rand.nextInt(0, (isObserver ? passiveCollaborators : activeCollaborators).length - 1);\n\treturn { type: 'leave', isObserver, index };\n}\n\nconst defaultInsertConfig: Required<InsertGenerationConfig> = {\n\tdefinitionPoolSize: 20,\n\tmaxTreeSequenceSize: 3,\n};\n\nconst defaultEditConfig: Required<EditGenerationConfig> = {\n\tmaxTreeSize: Number.POSITIVE_INFINITY,\n\tinsertWeight: 3,\n\tinsertConfig: defaultInsertConfig,\n\tdeleteWeight: 1,\n\tmoveWeight: 1,\n\tsetPayloadWeight: 1,\n\ttraitLabelPoolSize: 20,\n};\n\nconst makeEditGenerator = (passedConfig: EditGenerationConfig): AsyncGenerator<Operation, undefined> => {\n\tconst config = { ...defaultEditConfig, ...passedConfig };\n\tconst insertConfig = { ...defaultInsertConfig, ...config.insertConfig };\n\tconst poolRand = new Prando(0);\n\tconst traitLabelPool = Array.from({ length: config.traitLabelPoolSize }, () => uuid(poolRand) as TraitLabel);\n\tconst traitLabelGenerator = ({ rand }: FuzzTestState) => rand.nextArrayItem(traitLabelPool);\n\n\tconst definitionPool = Array.from({ length: insertConfig.definitionPoolSize }, () => uuid(poolRand) as Definition);\n\tconst definitionGenerator = ({ rand }: FuzzTestState) => rand.nextArrayItem(definitionPool);\n\n\tfunction traitGenerator(state: FuzzTestState, { view, idList }: TreeContext): TraitLocation {\n\t\tconst id = state.rand.nextArrayItem(idList);\n\t\treturn view.tryGetTraitLocation(id) ?? { parent: id, label: traitLabelGenerator(state) };\n\t}\n\n\tfunction placeGenerator(state: FuzzTestState, context: TreeContext): StablePlace {\n\t\tconst { rand } = state;\n\t\tconst { view, idList } = context;\n\t\t// Note: this gives a 50% chance of adding to a new trait; we may want to tune this at some point\n\t\tif (rand.nextBoolean()) {\n\t\t\tconst parent = rand.nextArrayItem(idList);\n\t\t\treturn StablePlace.atStartOf({ parent, label: traitLabelGenerator(state) });\n\t\t}\n\t\tconst traitLocation = traitGenerator(state, context);\n\t\tconst trait = view.getTrait(traitLocation);\n\t\tinterface Descriptor {\n\t\t\tindex: number;\n\t\t\tside: Side;\n\t\t}\n\t\t// For a trait of length N, there are 2N + 2valid places: start, before index 1, after index 1, etc.\n\t\t// index === trait.length is treated as either the start or end of the trait.\n\t\tconst makeDescriptor = (): Descriptor => ({\n\t\t\tindex: rand.nextInt(0, trait.length),\n\t\t\tside: rand.nextBoolean() ? Side.Before : Side.After,\n\t\t});\n\t\tconst descriptor = makeDescriptor();\n\n\t\tconst placeFromDescriptor = ({ index, side }: Descriptor): StablePlace =>\n\t\t\tindex === trait.length ? { referenceTrait: traitLocation, side } : { referenceSibling: trait[index], side };\n\t\treturn placeFromDescriptor(descriptor);\n\t}\n\n\tfunction rangeGenerator(state: FuzzTestState, context: TreeContext): StableRange {\n\t\tconst { rand } = state;\n\t\tconst { view } = context;\n\t\tconst traitLocation = traitGenerator(state, context);\n\t\tconst trait = view.getTrait(traitLocation);\n\t\tinterface Descriptor {\n\t\t\tindex: number;\n\t\t\tside: Side;\n\t\t}\n\t\t// For a trait of length N, there are 2N + 2valid places: start, before index 1, after index 1, etc.\n\t\t// index === trait.length is treated as either the start or end of the trait.\n\t\tconst makeDescriptor = (): Descriptor => ({\n\t\t\tindex: rand.nextInt(0, trait.length),\n\t\t\tside: rand.nextBoolean() ? Side.Before : Side.After,\n\t\t});\n\t\tconst descriptor1 = makeDescriptor();\n\t\tlet descriptor2: Descriptor;\n\t\tdo {\n\t\t\tdescriptor2 = makeDescriptor();\n\t\t} while (descriptor1.index === descriptor2.index && descriptor1.side === descriptor2.side);\n\n\t\tconst sortedDescriptors = [descriptor1, descriptor2];\n\t\tsortedDescriptors.sort((a, b) => {\n\t\t\tif (a.index === b.index && a.side === b.side) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\tif (a.index === trait.length) {\n\t\t\t\tif (a.side === Side.After) {\n\t\t\t\t\treturn -1;\n\t\t\t\t}\n\t\t\t\treturn 1;\n\t\t\t}\n\t\t\tif (b.index === trait.length) {\n\t\t\t\tif (b.side === Side.After) {\n\t\t\t\t\treturn 1;\n\t\t\t\t}\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\tif (a.index < b.index) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\treturn a.side === Side.Before ? -1 : 1;\n\t\t});\n\t\tconst [startDescriptor, endDescriptor] = sortedDescriptors;\n\t\tconst placeFromDescriptor = ({ index, side }: Descriptor): StablePlace =>\n\t\t\tindex === trait.length ? { referenceTrait: traitLocation, side } : { referenceSibling: trait[index], side };\n\t\tconst start = placeFromDescriptor(startDescriptor);\n\t\tconst end = placeFromDescriptor(endDescriptor);\n\t\treturn StableRange.from(start).to(end);\n\t}\n\n\tfunction treeGenerator(state: FuzzTestState, context: TreeContext): BuildNode {\n\t\tconst { rand } = state;\n\t\tconst treeType = rand.nextArrayItem(['leaf', 'stick', 'balanced']);\n\t\tconst makeNode = (traits?: TraitMap<BuildNode>): BuildNode => ({\n\t\t\tidentifier: context.idGenerator.generateNodeId(),\n\t\t\tdefinition: definitionGenerator(state),\n\t\t\ttraits: traits ?? {},\n\t\t});\n\t\tswitch (treeType) {\n\t\t\tcase 'leaf':\n\t\t\t\treturn makeNode();\n\t\t\tcase 'stick':\n\t\t\t\treturn makeNode({\n\t\t\t\t\t[traitLabelGenerator(state)]: [makeNode({ [traitLabelGenerator(state)]: [makeNode()] })],\n\t\t\t\t});\n\t\t\tcase 'balanced':\n\t\t\t\treturn makeNode({\n\t\t\t\t\t[traitLabelGenerator(state)]: [makeNode()],\n\t\t\t\t\t[traitLabelGenerator(state)]: [makeNode()],\n\t\t\t\t});\n\t\t\tdefault:\n\t\t\t\tfail(`Unexpected treeType ${treeType}`);\n\t\t}\n\t}\n\n\tasync function insertGenerator(state: FuzzTestState, context: TreeContext): Promise<FuzzInsert> {\n\t\tconst { maxTreeSequenceSize } = insertConfig;\n\t\tconst id = 1 as DetachedSequenceId;\n\t\tconst { view } = context;\n\t\tconst isValidInsertPlace = (destination: StablePlace): boolean => {\n\t\t\t// Disallow insertion adjacent to the root node.\n\t\t\tif (destination.referenceSibling === view.root) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t};\n\n\t\tlet destination: StablePlace;\n\t\tdo {\n\t\t\tdestination = placeGenerator(state, context);\n\t\t} while (!isValidInsertPlace(destination));\n\n\t\treturn {\n\t\t\tfuzzType: 'insert',\n\t\t\tbuild: {\n\t\t\t\ttype: ChangeType.Build,\n\t\t\t\tdestination: id,\n\t\t\t\tsource: Array.from({ length: state.rand.nextInt(1, maxTreeSequenceSize) }, () =>\n\t\t\t\t\ttreeGenerator(state, context)\n\t\t\t\t),\n\t\t\t},\n\t\t\tinsert: {\n\t\t\t\ttype: ChangeType.Insert,\n\t\t\t\tdestination,\n\t\t\t\tsource: id,\n\t\t\t},\n\t\t};\n\t}\n\n\tasync function deleteGenerator(state: FuzzTestState, context: TreeContext): Promise<FuzzDelete> {\n\t\tconst { view } = context;\n\t\tconst isValidDeleteRange = (source: StableRange): boolean => {\n\t\t\t// Disallow deletion of the root node.\n\t\t\tif (source.start.referenceSibling === view.root || source.end.referenceSibling === view.root) {\n\t\t\t\treturn false;\n\t\t\t}\n\n\t\t\treturn true;\n\t\t};\n\n\t\tlet source: StableRange;\n\t\tdo {\n\t\t\tsource = rangeGenerator(state, context);\n\t\t} while (!isValidDeleteRange(source));\n\n\t\treturn {\n\t\t\tfuzzType: 'delete',\n\t\t\ttype: ChangeType.Detach,\n\t\t\tsource,\n\t\t};\n\t}\n\n\tasync function moveGenerator(state: FuzzTestState, context: TreeContext): Promise<FuzzMove> {\n\t\tconst id = 1 as DetachedSequenceId;\n\t\tconst { view } = context;\n\n\t\tconst isValidMoveRange = ({ start, end }: TreeViewRange, destination: StablePlace): boolean => {\n\t\t\t// An ancestor cannot be moved to be a sibling of its descendant.\n\t\t\tconst forbiddenDescendantId =\n\t\t\t\tdestination.referenceTrait?.parent ?? destination.referenceSibling ?? fail('Invalid place');\n\n\t\t\tconst unadjustedStartIndex: number = view.findIndexWithinTrait(start);\n\t\t\tconst unadjustedEndIndex: number = view.findIndexWithinTrait(end);\n\t\t\tconst startIndex = unadjustedStartIndex + (start.side === Side.After ? 1 : 0);\n\t\t\tconst endIndex = unadjustedEndIndex + (end.side === Side.After ? 1 : 0);\n\n\t\t\tconst idsInSource = new Set(view.getTrait(start.trait).slice(startIndex, endIndex));\n\t\t\tfor (\n\t\t\t\tlet current: NodeId | undefined = forbiddenDescendantId;\n\t\t\t\tcurrent !== undefined;\n\t\t\t\tcurrent = view.tryGetParentViewNode(current)?.identifier\n\t\t\t) {\n\t\t\t\tif (idsInSource.has(current)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn true;\n\t\t};\n\n\t\tlet source: StableRange;\n\t\tlet destination: StablePlace;\n\t\tdo {\n\t\t\tsource = rangeGenerator(state, context);\n\t\t\tdestination = placeGenerator(state, context);\n\t\t} while (!isValidMoveRange(rangeFromStableRange(view, source), destination));\n\n\t\treturn {\n\t\t\tfuzzType: 'move',\n\t\t\tdetach: {\n\t\t\t\ttype: ChangeType.Detach,\n\t\t\t\tdestination: id,\n\t\t\t\tsource,\n\t\t\t},\n\t\t\tinsert: {\n\t\t\t\ttype: ChangeType.Insert,\n\t\t\t\tdestination,\n\t\t\t\tsource: id,\n\t\t\t},\n\t\t};\n\t}\n\n\tasync function setPayloadGenerator(\n\t\t{ rand }: FuzzTestState,\n\t\t{ idList, view, dataStoreRuntime }: TreeContext\n\t): Promise<FuzzChange> {\n\t\tconst nodeToModify = rand.nextArrayItem(idList);\n\t\tconst getPayloadContents = async (rand: Prando): Promise<string | { blob: IFluidHandle<ArrayBufferLike> }> => {\n\t\t\tif (rand.nextBoolean()) {\n\t\t\t\treturn rand.nextString(4);\n\t\t\t}\n\t\t\tconst handle = await dataStoreRuntime.uploadBlob(IsoBuffer.from(rand.nextString(10)));\n\t\t\treturn { blob: handle };\n\t\t};\n\n\t\tconst viewNode = view.getViewNode(nodeToModify);\n\t\tconst payload =\n\t\t\tviewNode.payload !== undefined\n\t\t\t\t? rand.nextBoolean()\n\t\t\t\t\t? await getPayloadContents(rand)\n\t\t\t\t\t: undefined\n\t\t\t\t: undefined;\n\t\treturn {\n\t\t\tfuzzType: 'setPayload',\n\t\t\ttype: ChangeType.SetValue,\n\t\t\tnodeToModify: rand.nextArrayItem(idList),\n\t\t\tpayload,\n\t\t};\n\t}\n\n\tconst baseEditGenerator = createWeightedGenerator<FuzzChange, TreeContext>([\n\t\t[insertGenerator, config.insertWeight, (_, { idList }) => idList.length < config.maxTreeSize],\n\t\t[deleteGenerator, config.deleteWeight, (_, { idList }) => idList.length > 1],\n\t\t[moveGenerator, config.moveWeight, (_, { idList }) => idList.length > 1],\n\t\t[setPayloadGenerator, config.setPayloadWeight],\n\t]);\n\n\treturn async (state: FuzzTestState): Promise<Operation | typeof done> => {\n\t\tconst { rand, activeCollaborators } = state;\n\t\tconst index = rand.nextInt(0, activeCollaborators.length - 1);\n\t\tconst { tree } = activeCollaborators[index];\n\t\tconst view = tree.currentView;\n\t\tconst idList = getIdList(view);\n\t\tconst contents = await baseEditGenerator(state, {\n\t\t\tview,\n\t\t\tidList,\n\t\t\tdataStoreRuntime: tree.getRuntime(),\n\t\t\tidGenerator: tree,\n\t\t});\n\t\tif (contents === done) {\n\t\t\treturn done;\n\t\t}\n\t\treturn { type: 'edit', contents, index };\n\t};\n};\n\nconst defaultOpConfig: Required<OperationGenerationConfig> = {\n\teditConfig: defaultEditConfig,\n\tjoinConfig: defaultJoinConfig,\n\teditWeight: 10,\n\tjoinWeight: 1,\n\tleaveWeight: 1,\n\tsynchronizeWeight: 1,\n};\n\nexport function makeOpGenerator(passedConfig: OperationGenerationConfig): AsyncGenerator<Operation, undefined> {\n\tconst config = {\n\t\t...defaultOpConfig,\n\t\t...passedConfig,\n\t};\n\n\tconst { maximumPassiveCollaborators, maximumActiveCollaborators } = { ...defaultJoinConfig, ...config.joinConfig };\n\tconst maximumCollaborators = maximumPassiveCollaborators + maximumActiveCollaborators;\n\n\tconst collaboratorsMatches =\n\t\t(criteria: (collaboratorCount: number) => boolean): AcceptanceCondition<undefined> =>\n\t\t({ activeCollaborators, passiveCollaborators }) =>\n\t\t\tcriteria(activeCollaborators.length + passiveCollaborators.length);\n\tconst atLeastOneClient = collaboratorsMatches((count) => count > 0);\n\tconst atLeastOneActiveClient: AcceptanceCondition<undefined> = ({ activeCollaborators }) =>\n\t\tactiveCollaborators.length > 0;\n\tconst opWeights: Weights<Operation, undefined> = [\n\t\t[makeEditGenerator(config.editConfig), config.editWeight, atLeastOneActiveClient],\n\t\t[\n\t\t\tmakeJoinGenerator(config.joinConfig),\n\t\t\tconfig.joinWeight,\n\t\t\tcollaboratorsMatches((count) => count < maximumCollaborators),\n\t\t],\n\t\t[leaveGenerator, config.leaveWeight, atLeastOneClient],\n\t\t[{ type: 'synchronize' }, config.synchronizeWeight, atLeastOneClient],\n\t];\n\treturn createWeightedGenerator(opWeights);\n}\n\ntype AcceptanceCondition<TAdditionalState> = (state: FuzzTestState, additionalState: TAdditionalState) => boolean;\n\n/**\n * Array of weighted generators to select from.\n *\n * A generator should only be invoked if the corresponding `AcceptanceCondition` evaluates to true.\n * This is useful in practice to avoid invoking generators for known-to-be invalid actions based on the current state:\n * for example, a \"leave\" op cannot be generated if there are no currently connected clients.\n */\ntype Weights<T, TAdditionalState> = [\n\tT | AsyncGenerator<T, TAdditionalState>,\n\tnumber,\n\tAcceptanceCondition<TAdditionalState>?\n][];\n\nfunction createWeightedGenerator<T, TAdditionalState>(\n\tweights: Weights<T, TAdditionalState>\n): AsyncGenerator<T, TAdditionalState> {\n\tconst cumulativeSums: [T | AsyncGenerator<T, TAdditionalState>, number, AcceptanceCondition<TAdditionalState>?][] =\n\t\t[];\n\tlet totalWeight = 0;\n\tfor (const [tOrGenerator, weight, shouldAccept] of weights) {\n\t\tconst cumulativeWeight = totalWeight + weight;\n\t\tcumulativeSums.push([tOrGenerator, cumulativeWeight, shouldAccept]);\n\t\ttotalWeight = cumulativeWeight;\n\t}\n\n\treturn async (state, additionalState) => {\n\t\tconst { rand } = state;\n\t\tconst sample = () => {\n\t\t\tconst weightSelected = rand.nextInt(1, totalWeight);\n\n\t\t\tlet opIndex = 0;\n\t\t\twhile (cumulativeSums[opIndex][1] < weightSelected) {\n\t\t\t\topIndex++;\n\t\t\t}\n\n\t\t\treturn opIndex;\n\t\t};\n\n\t\tlet index;\n\t\tlet shouldAccept: AcceptanceCondition<TAdditionalState> | undefined;\n\t\tdo {\n\t\t\tindex = sample();\n\t\t\tshouldAccept = cumulativeSums[index][2];\n\t\t} while (!(shouldAccept?.(state, additionalState) ?? true));\n\n\t\tconst [tOrGenerator] = cumulativeSums[index];\n\t\treturn typeof tOrGenerator === 'function'\n\t\t\t? (tOrGenerator as AsyncGenerator<T, TAdditionalState>)(state, additionalState)\n\t\t\t: (tOrGenerator as unknown as T);\n\t};\n}\n\nfunction getIdList(tree: TreeView): NodeId[] {\n\tconst allIds: NodeId[] = [];\n\tconst toVisit: NodeId[] = [tree.root];\n\twhile (toVisit.length > 0) {\n\t\tconst id = toVisit.pop() ?? fail();\n\t\tallIds.push(id);\n\t\tconst node = tree.getViewNode(id);\n\t\tfor (const [_, childIds] of node.traits) {\n\t\t\ttoVisit.push(...childIds);\n\t\t}\n\t}\n\treturn allIds;\n}\n\n/**\n * Higher-order generator operator which creates a new generator producing the first `n` elements of `generator`.\n */\nexport function take<T, TAdditionalState>(\n\tn: number,\n\tgenerator: AsyncGenerator<T, TAdditionalState>\n): AsyncGenerator<T, TAdditionalState> {\n\tlet count = 0;\n\treturn async (state, additionalState) => {\n\t\tif (count < n) {\n\t\t\tcount++;\n\t\t\treturn generator(state, additionalState);\n\t\t}\n\t\treturn done;\n\t};\n}\n\n/**\n * @returns a deterministic generator that always returns the items of `contents` in order.\n */\nexport function generatorFromArray<T, TAdditionalState>(contents: T[]): AsyncGenerator<T, TAdditionalState> {\n\tlet index = -1;\n\treturn async () => {\n\t\tif (index < contents.length) {\n\t\t\tindex++;\n\t\t\treturn contents[index] ?? done;\n\t\t}\n\t\treturn done;\n\t};\n}\n\n/**\n * Higher-order generator operator which exhausts each input generator sequentially before moving on to the next.\n */\nexport function chain<T, TAdditionalState>(\n\t...generators: AsyncGenerator<T, TAdditionalState>[]\n): AsyncGenerator<T, TAdditionalState> {\n\tlet currentIndex = 0;\n\treturn async (state, additionalState) => {\n\t\twhile (currentIndex < generators.length) {\n\t\t\tconst generator = generators[currentIndex];\n\t\t\tconst result = await generator(state, additionalState);\n\t\t\tif (result !== done) {\n\t\t\t\treturn result;\n\t\t\t} else {\n\t\t\t\tcurrentIndex++;\n\t\t\t}\n\t\t}\n\t\treturn done;\n\t};\n}\n"]}

package/lib/test/fuzz/SharedTreeFuzzTests.d.ts

@@ -0,0 +1,20 @@
+/*!
+ * Copyright (c) Microsoft Corporation and contributors. All rights reserved.
+ * Licensed under the MIT License.
+ */
+import { FuzzTestState, AsyncGenerator, Operation } from './Types';
+/**
+ * Performs random actions on a set of clients.
+ * @param generator finite generator for a sequence of Operations to test. The test will run until this generator is exhausted.
+ * @param seed the seed for the random generation of the fuzz actions
+ * @param synchronizeAtEnd if provided, all client will have all operations delivered from the server at the end of the test
+ * @param saveInfo optionally provide an operation number at which a history of all operations will be saved to disk at a given filepath.
+ * This can be useful for debugging why a fuzz test may have failed.
+ */
+export declare function performFuzzActions(generator: AsyncGenerator<Operation, undefined>, seed: number, synchronizeAtEnd?: boolean, saveInfo?: {
+    saveAt?: number;
+    saveOnFailure: boolean;
+    filepath: string;
+}): Promise<Required<FuzzTestState>>;
+export declare function runSharedTreeFuzzTests(title: string): void;
+//# sourceMappingURL=SharedTreeFuzzTests.d.ts.map

package/lib/test/fuzz/SharedTreeFuzzTests.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SharedTreeFuzzTests.d.ts","sourceRoot":"","sources":["../../../src/test/fuzz/SharedTreeFuzzTests.ts"],"names":[],"mappings":"AAAA;;;GAGG;AASH,OAAO,EAAE,aAAa,EAA8B,cAAc,EAAE,SAAS,EAAE,MAAM,SAAS,CAAC;AAS/F;;;;;;;GAOG;AACH,wBAAsB,kBAAkB,CACvC,SAAS,EAAE,cAAc,CAAC,SAAS,EAAE,SAAS,CAAC,EAC/C,IAAI,EAAE,MAAM,EACZ,gBAAgB,GAAE,OAAc,EAChC,QAAQ,CAAC,EAAE;IAAE,MAAM,CAAC,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,OAAO,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,GACtE,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CA8FlC;AAED,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAkI1D"}