@casual-simulation/aux-common 3.2.6 → 3.2.7-alpha.6227012901

package/aux-format-2/AuxWeaveHelpers.js

@@ -1,335 +0,0 @@
-import { AuxOpType, } from './AuxOpTypes';
-import { iterateCausalGroup, first, idEquals, } from '@casual-simulation/causal-trees/core2';
-import { isEqual } from 'lodash';
-import { splice } from '../utils';
-import { convertToString } from '../bots/BotCalculations';
-/**
- * Finds the first weave node that defines a bot with the given ID.
- * @param weave The weave to search through.
- * @param id The bot ID.
- */
-export function findBotNode(weave, id) {
-    return first(findBotNodes(weave, id)) || null;
-}
-/**
- * Finds all of the weave nodes that define a bot with the given ID.
- * @param weave The weave to search through.
- * @param id The bot ID.
- */
-export function* findBotNodes(weave, id) {
-    for (let root of weave.roots) {
-        if (root.atom.value.type === AuxOpType.Bot &&
-            root.atom.value.id === id) {
-            const firstAtom = first(iterateCausalGroup(root));
-            if (!firstAtom || firstAtom.atom.value.type !== AuxOpType.Delete) {
-                yield root;
-            }
-        }
-    }
-}
-/**
- * Finds the weave node that represents the given tag on the given bot node.
- * @param bot The bot node that should be searched.
- * @param tag The tag to find.
- */
-export function findTagNode(bot, tag) {
-    for (let node of iterateCausalGroup(bot)) {
-        if (node.atom.value.type === AuxOpType.Tag &&
-            node.atom.value.name === tag) {
-            return node;
-        }
-    }
-    return null;
-}
-/**
- * Finds the tag mask node for the given bot ID and tag.
- * @param weave The weave.
- * @param botId The ID of the bot.
- * @param tag The tag.
- */
-export function* findTagMaskNodes(weave, botId, tag) {
-    for (let root of weave.roots) {
-        if (root.atom.value.type === AuxOpType.TagMask &&
-            root.atom.value.botId === botId &&
-            root.atom.value.name === tag) {
-            const firstAtom = first(iterateCausalGroup(root));
-            if (!firstAtom || firstAtom.atom.value.type !== AuxOpType.Delete) {
-                yield root;
-            }
-        }
-    }
-}
-/**
- * Finds the first value weave node for the given tag node.
- * @param tag The tag node that should be searched.
- */
-export function findValueNode(tag) {
-    for (let node of iterateCausalGroup(tag)) {
-        if (node.atom.value.type === AuxOpType.Value) {
-            return node;
-        }
-    }
-    return null;
-}
-/**
- * Finds the first value weave node for the given tag node and value.
- * @param tag The tag node that should be searched.
- * @param value The value that should be matched.
- */
-export function findValueNodeByValue(tag, value) {
-    for (let node of iterateCausalGroup(tag)) {
-        if (node.atom.value.type === AuxOpType.Value &&
-            isEqual(node.atom.value.value, value)) {
-            return node;
-        }
-    }
-    return null;
-}
-/**
- * Finds the node and index at which the given edit should happen at.
- * Useful for applying edits to a causal tree.
- * @param value The value node.
- * @param version The last timestamps that were available when the edit was made.
- * @param index The index at which the edit should happen.
- * @param deleteCount The number of characters that get deleted starting at the index.
- */
-export function findEditPosition(value, version, index, deleteCount) {
-    if (value.atom.value.type !== AuxOpType.Value) {
-        throw new Error('Invalid Argument. The weave node must be a value node.');
-    }
-    const children = [value, ...iterateCausalGroup(value)];
-    const filtered = children.filter((c) => {
-        const timestamp = version[c.atom.id.site] || -1;
-        return c.atom.id.timestamp <= timestamp;
-    });
-    const edits = calculateOrderedEdits(filtered);
-    if (edits.length <= 0 && typeof deleteCount === 'undefined') {
-        return {
-            index: 0,
-            node: value,
-        };
-    }
-    if (typeof deleteCount === 'number') {
-        return [
-            ...findMultipleEditPositions(index, deleteCount, edits, 'right'),
-        ];
-    }
-    else {
-        return findSingleEditPosition(index, edits);
-    }
-}
-/**
- * Finds the list of edit positions that an edit at the given index and the given delete count should cover.
- * @param index The index.
- * @param deleteCount The delete count.
- * @param edits The text segments.
- * @param afinity Whether edits that fall directly between two segments should be associated with the left edit or the right edit.
- */
-export function* findMultipleEditPositions(index, deleteCount, edits, afinity) {
-    let count = 0;
-    let remaining = deleteCount;
-    for (let edit of edits) {
-        let reachedStart = afinity === 'left'
-            ? count + edit.text.length >= index
-            : count + edit.text.length > index;
-        if (reachedStart) {
-            const relativeIndex = Math.abs(count - index);
-            const countUntilEnd = edit.text.length - relativeIndex;
-            // TODO: Reconcile the relative index of the edit text and
-            // the index that is needed inside the marked text.
-            let relativeIndexOffset = 0;
-            for (let i = 0, b = 0; i < relativeIndex && b < edit.marked.length;) {
-                let normalChar = edit.text[i];
-                let markedChar = edit.marked[b];
-                if (normalChar === markedChar) {
-                    i += 1;
-                }
-                else {
-                    relativeIndexOffset += 1;
-                }
-                b += 1;
-            }
-            const finalOffset = relativeIndex + relativeIndexOffset;
-            const nodeDeleteCount = Math.min(countUntilEnd, remaining);
-            const textAfter = edit.marked.slice(finalOffset, edit.marked.length);
-            let removedCharacterCount = 0;
-            let deleteCountOffset = 0;
-            let afterIndex = 0;
-            // Count all the deleted characters immediately after
-            // the insert/delete point
-            for (; afterIndex < textAfter.length; afterIndex++) {
-                if (textAfter[afterIndex] === '\0') {
-                    removedCharacterCount += 1;
-                }
-                else {
-                    break;
-                }
-            }
-            // Count all the deleted characters between the start point and end points
-            let extraCharactersIndex = 0;
-            for (; afterIndex < textAfter.length; afterIndex++) {
-                if (extraCharactersIndex >= nodeDeleteCount) {
-                    break;
-                }
-                if (textAfter[afterIndex] === '\0') {
-                    deleteCountOffset += 1;
-                }
-                else {
-                    extraCharactersIndex += 1;
-                }
-            }
-            yield {
-                index: finalOffset + removedCharacterCount + edit.offset,
-                count: nodeDeleteCount + deleteCountOffset,
-                node: edit.node,
-            };
-            remaining -= nodeDeleteCount;
-            count += relativeIndex;
-        }
-        else {
-            count += edit.text.length;
-        }
-        if (remaining <= 0) {
-            break;
-        }
-    }
-}
-/**
- * Finds the single position that an edit at the given index should be added at.
- * @param index The index.
- * @param edits The edits.
- */
-export function findSingleEditPosition(index, edits) {
-    return first(findMultipleEditPositions(index, 1, edits, 'left'));
-}
-/**
- * Calculates the list of ordered edits for the given value node.
- * This iterates each insert op and delete op and returns a list of text segments that have been derived from the value.
- * @param nodes The list of nodes that the edits should be calculated from.
- * @param preserveEmptyEdits Whether to preserve empty edits in the output list.
- */
-export function calculateOrderedEdits(nodes, preserveEmptyEdits = false) {
-    let segments = [];
-    for (let node of nodes) {
-        const atomValue = node.atom.value;
-        if (atomValue.type === AuxOpType.Value) {
-            let text = convertToString(atomValue.value);
-            let segment = {
-                text: text,
-                node: node,
-                offset: 0,
-                totalLength: atomValue.value.length,
-            };
-            segments.push(segment);
-        }
-        else if (atomValue.type === AuxOpType.Insert) {
-            const segment = {
-                text: atomValue.text,
-                node: node,
-                offset: 0,
-                totalLength: atomValue.text.length,
-            };
-            let count = 0;
-            let lastCausalGroupIndex = 0;
-            let isInCausalGroup = false;
-            let lastCauseTime = -1;
-            let added = false;
-            for (let i = 0; i < segments.length; i++) {
-                const lastSegment = segments[i];
-                if (!idEquals(lastSegment.node.atom.id, node.atom.cause)) {
-                    if (isInCausalGroup) {
-                        // We know that we are outside the last causal group
-                        // because every child/grandchild of the cause must have a timestamp
-                        // higher than the cause timestamp.
-                        // So if we run across a segment with a timestamp less than the cause time
-                        // then we are outside the causal group.
-                        if (lastSegment.node.atom.id.timestamp < lastCauseTime) {
-                            isInCausalGroup = false;
-                        }
-                        else {
-                            // if we are still in the causal group, then we can count the current
-                            // index as the last causal group point.
-                            lastCausalGroupIndex = i;
-                        }
-                    }
-                    continue;
-                }
-                isInCausalGroup = true;
-                lastCauseTime = lastSegment.node.atom.id.timestamp;
-                lastCausalGroupIndex = i;
-                if (atomValue.index <= 0) {
-                    segments.splice(i, 0, segment);
-                    added = true;
-                    break;
-                }
-                else if (atomValue.index - count < +lastSegment.text.length) {
-                    const first = {
-                        text: lastSegment.text.slice(0, atomValue.index - count),
-                        node: lastSegment.node,
-                        offset: lastSegment.offset + 0,
-                        totalLength: lastSegment.totalLength,
-                    };
-                    const second = {
-                        text: lastSegment.text.slice(atomValue.index - count),
-                        offset: lastSegment.offset + (atomValue.index - count),
-                        node: lastSegment.node,
-                        totalLength: lastSegment.totalLength,
-                    };
-                    segments.splice(i, 1, first, segment, second);
-                    added = true;
-                    break;
-                }
-                count += lastSegment.text.length;
-            }
-            if (!added) {
-                segments.splice(lastCausalGroupIndex + 1, 0, segment);
-            }
-        }
-        else if (atomValue.type === AuxOpType.Delete) {
-            let lastSegment = segments.find((s) => idEquals(s.node.atom.id, node.atom.cause));
-            if (lastSegment) {
-                for (let i = atomValue.start; i < atomValue.end; i++) {
-                    lastSegment.text = splice(lastSegment.text, i, 1, '\0');
-                }
-            }
-        }
-    }
-    return segments
-        .map((s) => ({
-        text: s.text.replace(/\0/g, ''),
-        marked: s.text,
-        offset: s.offset,
-        node: s.node,
-    }))
-        .filter((s) => preserveEmptyEdits || s.text.length > 0);
-}
-/**
- * Calculates the final text value for the given value node.
- * @param weave The weave.
- * @param value The value node.
- */
-export function calculateFinalEditValue(value) {
-    const children = [value, ...iterateCausalGroup(value)];
-    const edits = calculateOrderedEdits(children);
-    return edits.map((e) => e.text).join('');
-}
-// /**
-//  * Adds the given atom to the weave.
-//  * Returns the new site status, weave result, atom that was added, and status update.
-//  * @param weave The weave.
-//  * @param site The site.
-//  * @param atom The atom.
-//  */
-// export function addAuxAtom<T extends AuxOp>(
-//     weave: Weave<T>,
-//     site: SiteStatus,
-//     atom: Atom<T>
-// ) {
-//     const info = addAtom(weave, site, atom);
-//     const update = reducer(weave, info.result);
-//     return {
-//         ...info,
-//         update,
-//     };
-// }
-//# sourceMappingURL=AuxWeaveHelpers.js.map

package/aux-format-2/AuxWeaveHelpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"AuxWeaveHelpers.js","sourceRoot":"","sources":["AuxWeaveHelpers.ts"],"names":[],"mappings":"AAAA,OAAO,EACH,SAAS,GAQZ,MAAM,cAAc,CAAC;AACtB,OAAO,EAGH,kBAAkB,EAIlB,KAAK,EAEL,QAAQ,GAIX,MAAM,uCAAuC,CAAC;AAC/C,OAAO,EAAE,OAAO,EAAE,MAAM,QAAQ,CAAC;AACjC,OAAO,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClC,OAAO,EAAE,eAAe,EAAY,MAAM,yBAAyB,CAAC;AAEpE;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,KAAmB,EAAE,EAAU;IACvD,OAAO,KAAK,CAAC,YAAY,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC;AAClD,CAAC;AAED;;;;GAIG;AACH,MAAM,SAAS,CAAC,CAAC,YAAY,CACzB,KAAmB,EACnB,EAAU;IAEV,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE;QAC1B,IACI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,GAAG;YACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,EAC3B;YACE,MAAM,SAAS,GAAG,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;YAClD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,MAAM,EAAE;gBAC9D,MAAM,IAAwB,CAAC;aAClC;SACJ;KACJ;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CACvB,GAAqB,EACrB,GAAW;IAEX,KAAK,IAAI,IAAI,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE;QACtC,IACI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,GAAG;YACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,EAC9B;YACE,OAAO,IAAwB,CAAC;SACnC;KACJ;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;;GAKG;AACH,MAAM,SAAS,CAAC,CAAC,gBAAgB,CAC7B,KAAmB,EACnB,KAAa,EACb,GAAW;IAEX,KAAK,IAAI,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE;QAC1B,IACI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,OAAO;YAC1C,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,KAAK;YAC/B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,EAC9B;YACE,MAAM,SAAS,GAAG,KAAK,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;YAClD,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,MAAM,EAAE;gBAC9D,MAAM,IAA4B,CAAC;aACtC;SACJ;KACJ;AACL,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,GAAqB;IAC/C,KAAK,IAAI,IAAI,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE;QACtC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,KAAK,EAAE;YAC1C,OAAO,IAA0B,CAAC;SACrC;KACJ;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,oBAAoB,CAChC,GAAqB,EACrB,KAAU;IAEV,KAAK,IAAI,IAAI,IAAI,kBAAkB,CAAC,GAAG,CAAC,EAAE;QACtC,IACI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,KAAK;YACxC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,EACvC;YACE,OAAO,IAA0B,CAAC;SACrC;KACJ;IAED,OAAO,IAAI,CAAC;AAChB,CAAC;AA8BD;;;;;;;GAOG;AACH,MAAM,UAAU,gBAAgB,CAC5B,KAAuB,EACvB,OAAsB,EACtB,KAAa,EACb,WAAoB;IAEpB,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,KAAK,EAAE;QAC3C,MAAM,IAAI,KAAK,CACX,wDAAwD,CAC3D,CAAC;KACL;IAED,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;IACvD,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACnC,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,OAAO,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,IAAI,SAAS,CAAC;IAC5C,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IAE9C,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,IAAI,OAAO,WAAW,KAAK,WAAW,EAAE;QACzD,OAAO;YACH,KAAK,EAAE,CAAC;YACR,IAAI,EAAE,KAAK;SACd,CAAC;KACL;IAED,IAAI,OAAO,WAAW,KAAK,QAAQ,EAAE;QACjC,OAAO;YACH,GAAG,yBAAyB,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,CAAC;SACnE,CAAC;KACL;SAAM;QACH,OAAO,sBAAsB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;KAC/C;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,SAAS,CAAC,CAAC,yBAAyB,CACtC,KAAa,EACb,WAAmB,EACnB,KAAoB,EACpB,OAAyB;IAEzB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,SAAS,GAAG,WAAW,CAAC;IAC5B,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE;QACpB,IAAI,YAAY,GACZ,OAAO,KAAK,MAAM;YACd,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,KAAK;YACnC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QAC3C,IAAI,YAAY,EAAE;YACd,MAAM,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC;YAC9C,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,aAAa,CAAC;YAEvD,0DAA0D;YAC1D,mDAAmD;YACnD,IAAI,mBAAmB,GAAG,CAAC,CAAC;YAC5B,KACI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAChB,CAAC,GAAG,aAAa,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAE7C;gBACE,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAEhC,IAAI,UAAU,KAAK,UAAU,EAAE;oBAC3B,CAAC,IAAI,CAAC,CAAC;iBACV;qBAAM;oBACH,mBAAmB,IAAI,CAAC,CAAC;iBAC5B;gBAED,CAAC,IAAI,CAAC,CAAC;aACV;YAED,MAAM,WAAW,GAAG,aAAa,GAAG,mBAAmB,CAAC;YAExD,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,SAAS,CAAC,CAAC;YAC3D,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAC/B,WAAW,EACX,IAAI,CAAC,MAAM,CAAC,MAAM,CACrB,CAAC;YAEF,IAAI,qBAAqB,GAAG,CAAC,CAAC;YAC9B,IAAI,iBAAiB,GAAG,CAAC,CAAC;YAE1B,IAAI,UAAU,GAAG,CAAC,CAAC;YAEnB,qDAAqD;YACrD,0BAA0B;YAC1B,OAAO,UAAU,GAAG,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE;gBAChD,IAAI,SAAS,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE;oBAChC,qBAAqB,IAAI,CAAC,CAAC;iBAC9B;qBAAM;oBACH,MAAM;iBACT;aACJ;YAED,0EAA0E;YAC1E,IAAI,oBAAoB,GAAG,CAAC,CAAC;YAC7B,OAAO,UAAU,GAAG,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE;gBAChD,IAAI,oBAAoB,IAAI,eAAe,EAAE;oBACzC,MAAM;iBACT;gBACD,IAAI,SAAS,CAAC,UAAU,CAAC,KAAK,IAAI,EAAE;oBAChC,iBAAiB,IAAI,CAAC,CAAC;iBAC1B;qBAAM;oBACH,oBAAoB,IAAI,CAAC,CAAC;iBAC7B;aACJ;YAED,MAAM;gBACF,KAAK,EAAE,WAAW,GAAG,qBAAqB,GAAG,IAAI,CAAC,MAAM;gBACxD,KAAK,EAAE,eAAe,GAAG,iBAAiB;gBAC1C,IAAI,EAAE,IAAI,CAAC,IAAI;aAClB,CAAC;YAEF,SAAS,IAAI,eAAe,CAAC;YAC7B,KAAK,IAAI,aAAa,CAAC;SAC1B;aAAM;YACH,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;SAC7B;QACD,IAAI,SAAS,IAAI,CAAC,EAAE;YAChB,MAAM;SACT;KACJ;AACL,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa,EAAE,KAAoB;IACtE,OAAO,KAAK,CAAC,yBAAyB,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AACrE,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,qBAAqB,CACjC,KAAyB,EACzB,qBAA8B,KAAK;IAEnC,IAAI,QAAQ,GAAG,EAAuB,CAAC;IAEvC,KAAK,IAAI,IAAI,IAAI,KAAK,EAAE;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;QAClC,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,KAAK,EAAE;YACpC,IAAI,IAAI,GAAG,eAAe,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC5C,IAAI,OAAO,GAAoB;gBAC3B,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,IAA0B;gBAChC,MAAM,EAAE,CAAC;gBACT,WAAW,EAAE,SAAS,CAAC,KAAK,CAAC,MAAM;aACtC,CAAC;YACF,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SAC1B;aAAM,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,MAAM,EAAE;YAC5C,MAAM,OAAO,GAAoB;gBAC7B,IAAI,EAAE,SAAS,CAAC,IAAI;gBACpB,IAAI,EAAE,IAA2B;gBACjC,MAAM,EAAE,CAAC;gBACT,WAAW,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM;aACrC,CAAC;YACF,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,oBAAoB,GAAG,CAAC,CAAC;YAC7B,IAAI,eAAe,GAAG,KAAK,CAAC;YAC5B,IAAI,aAAa,GAAG,CAAC,CAAC,CAAC;YACvB,IAAI,KAAK,GAAG,KAAK,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACtC,MAAM,WAAW,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAEhC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE;oBACtD,IAAI,eAAe,EAAE;wBACjB,oDAAoD;wBACpD,oEAAoE;wBACpE,mCAAmC;wBACnC,0EAA0E;wBAC1E,wCAAwC;wBACxC,IACI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,GAAG,aAAa,EACpD;4BACE,eAAe,GAAG,KAAK,CAAC;yBAC3B;6BAAM;4BACH,qEAAqE;4BACrE,wCAAwC;4BACxC,oBAAoB,GAAG,CAAC,CAAC;yBAC5B;qBACJ;oBACD,SAAS;iBACZ;gBACD,eAAe,GAAG,IAAI,CAAC;gBACvB,aAAa,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC;gBACnD,oBAAoB,GAAG,CAAC,CAAC;gBAEzB,IAAI,SAAS,CAAC,KAAK,IAAI,CAAC,EAAE;oBACtB,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;oBAC/B,KAAK,GAAG,IAAI,CAAC;oBACb,MAAM;iBACT;qBAAM,IAAI,SAAS,CAAC,KAAK,GAAG,KAAK,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE;oBAC3D,MAAM,KAAK,GAAoB;wBAC3B,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CACxB,CAAC,EACD,SAAS,CAAC,KAAK,GAAG,KAAK,CAC1B;wBACD,IAAI,EAAE,WAAW,CAAC,IAAI;wBACtB,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC;wBAC9B,WAAW,EAAE,WAAW,CAAC,WAAW;qBACvC,CAAC;oBACF,MAAM,MAAM,GAAoB;wBAC5B,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;wBACrD,MAAM,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC,SAAS,CAAC,KAAK,GAAG,KAAK,CAAC;wBACtD,IAAI,EAAE,WAAW,CAAC,IAAI;wBACtB,WAAW,EAAE,WAAW,CAAC,WAAW;qBACvC,CAAC;oBAEF,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;oBAC9C,KAAK,GAAG,IAAI,CAAC;oBACb,MAAM;iBACT;gBAED,KAAK,IAAI,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC;aACpC;YACD,IAAI,CAAC,KAAK,EAAE;gBACR,QAAQ,CAAC,MAAM,CAAC,oBAAoB,GAAG,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;aACzD;SACJ;aAAM,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,CAAC,MAAM,EAAE;YAC5C,IAAI,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAClC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAC5C,CAAC;YACF,IAAI,WAAW,EAAE;gBACb,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;oBAClD,WAAW,CAAC,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;iBAC3D;aACJ;SACJ;KACJ;IAED,OAAO,QAAQ;SACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACT,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,EAAE,CAAC,CAAC,IAAI;QACd,MAAM,EAAE,CAAC,CAAC,MAAM;QAChB,IAAI,EAAE,CAAC,CAAC,IAAI;KACf,CAAC,CAAC;SACF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAChE,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CAAC,KAAyB;IAC7D,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC,CAAC;IACvD,MAAM,KAAK,GAAG,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IAC9C,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC7C,CAAC;AA4DD,MAAM;AACN,uCAAuC;AACvC,wFAAwF;AACxF,6BAA6B;AAC7B,2BAA2B;AAC3B,2BAA2B;AAC3B,MAAM;AACN,+CAA+C;AAC/C,uBAAuB;AACvB,wBAAwB;AACxB,oBAAoB;AACpB,MAAM;AACN,+CAA+C;AAC/C,kDAAkD;AAElD,eAAe;AACf,mBAAmB;AACnB,kBAAkB;AAClB,SAAS;AACT,IAAI"}

package/aux-format-2/AuxWeaveReducer.d.ts

@@ -1,37 +0,0 @@
-import { Weave, WeaveNode, WeaveResult, Atom } from '@casual-simulation/causal-trees/core2';
-import { AuxOp, DeleteOp } from './AuxOpTypes';
-import { PartialBotsState } from '../bots/Bot';
-import { TextSegment } from './AuxWeaveHelpers';
-export declare const CERT_ID_NAMESPACE = "a1307e2b-8d80-4945-9792-2cd483c45e24";
-export declare const CERTIFIED_SPACE = "certified";
-/**
- * Calculates the state update needed for the given weave result from the given weave.
- * @param weave The weave.
- * @param result The result from the weave.
- * @param state The object that the updates should be stored in. Use this when batching updates to reduce intermediate object allocations.
- * @param space The space that new bots should use.
- * @param initial Whether this is the initial update for the weave. Used to skip expensive inserts/deletes during the first load.
- */
-export default function reducer(weave: Weave<AuxOp>, result: WeaveResult, state?: PartialBotsState, space?: string, initial?: boolean): PartialBotsState;
-/**
- * Finds all of the points that should be deleted for the given delete op and text segments.
- * @param edits The edits.
- * @param atom The delete atom.
- * @param value The delete op.
- */
-export declare function findDeletePoints(edits: TextSegment[], atom: Atom<DeleteOp>, value: DeleteOp): Generator<{
-    count: number;
-    length: number;
-}, void, unknown>;
-/**
- * Gets the weave nodes needed for a text edit.
- * Returns the bot node, tag node, and value/insert nodes.
- */
-export declare function getTextEditNodes(weave: Weave<AuxOp>, atom: Atom<AuxOp>): {
-    tag: WeaveNode<AuxOp>;
-    bot: WeaveNode<AuxOp>;
-    value: WeaveNode<AuxOp>;
-    values: WeaveNode<AuxOp>[];
-};
-export declare function certificateId(atom: Atom<any>): string;
-//# sourceMappingURL=AuxWeaveReducer.d.ts.map