@vuer-ai/vuer-rtc 0.2.2 → 0.2.3

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@vuer-ai/vuer-rtc",
-  "version": "0.2.2",
+  "version": "0.2.3",
   "private": false,
   "type": "module",
   "description": "CRDT-based real-time collaborative data structures",
@@ -27,8 +27,22 @@
     "./hooks": {
       "types": "./dist/hooks.d.ts",
       "import": "./dist/hooks.js"
+    },
+    "./serdes": {
+      "types": "./dist/serdes.d.ts",
+      "import": "./dist/serdes.js"
+    },
+    "./sync": {
+      "types": "./dist/sync/index.d.ts",
+      "import": "./dist/sync/index.js"
     }
   },
+  "scripts": {
+    "build": "tsc",
+    "dev": "tsc --watch",
+    "test": "node --experimental-vm-modules node_modules/jest/bin/jest.js",
+    "test:watch": "node --experimental-vm-modules node_modules/jest/bin/jest.js --watch"
+  },
   "peerDependencies": {
     "react": ">=18.0.0"
   },
@@ -49,11 +63,5 @@
   "dependencies": {
     "@msgpack/msgpack": "^3.1.3",
     "nanoid": "^5.1.6"
-  },
-  "scripts": {
-    "build": "tsc",
-    "dev": "tsc --watch",
-    "test": "node --experimental-vm-modules node_modules/jest/bin/jest.js",
-    "test:watch": "node --experimental-vm-modules node_modules/jest/bin/jest.js --watch"
   }
-}
+}

package/.pytest_cache/README.md

@@ -1,8 +0,0 @@
-# pytest cache directory #
-
-This directory contains data from the pytest's cache plugin,
-which provides the `--lf` and `--ff` options, as well as the `cache` fixture.
-
-**Do not** commit this to version control.
-
-See [the docs](https://docs.pytest.org/en/stable/how-to/cache.html) for more information.

package/dist/crdt/ContentTree.d.ts

@@ -1,102 +0,0 @@
-/**
- * ContentTree - B-tree optimized for CRDT text operations
- *
- * Stores Items in document order with dual-count annotations (visible chars
- * and total items) at each node for O(log n) position lookup and insertion.
- *
- * Follows Seph Gentle's diamond-types content-tree design:
- * - Leaf nodes hold up to MAX_LEAF items
- * - Internal nodes hold up to MAX_INTERNAL children
- * - Each node caches { visChars, totalItems } for its subtree
- * - Parent pointers enable O(log n) ordinal computation
- */
-/** Minimal item interface — tree only needs content + deleted state */
-export interface TreeItem {
-    content: string;
-    isDeleted: boolean;
-}
-export interface Counts {
-    visChars: number;
-    totalItems: number;
-}
-export interface LeafNode {
-    type: 'leaf';
-    items: TreeItem[];
-    counts: Counts;
-    parent: InternalNode | null;
-}
-export interface InternalNode {
-    type: 'internal';
-    children: TreeNode[];
-    childCounts: Counts[];
-    counts: Counts;
-    parent: InternalNode | null;
-}
-export type TreeNode = LeafNode | InternalNode;
-export interface ItemTree {
-    root: TreeNode;
-    _itemLeaf: WeakMap<TreeItem, LeafNode>;
-}
-export interface VisiblePosResult {
-    ordinal: number;
-    item: TreeItem;
-    charOffset: number;
-}
-export declare function createTree(): ItemTree;
-/**
- * Build a balanced tree from a pre-ordered flat array. O(n).
- */
-export declare function bulkLoad(items: TreeItem[]): ItemTree;
-/**
- * Insert an item at the given ordinal position. O(log n).
- */
-export declare function insertAt(tree: ItemTree, ordinal: number, item: TreeItem): void;
-/**
- * Replace one item at the given ordinal with two items (for CRDT span splitting).
- * O(log n).
- */
-export declare function splitAtOrdinal(tree: ItemTree, ordinal: number, leftItem: TreeItem, rightItem: TreeItem): void;
-/**
- * Recalculate tree counts after mutating an item (e.g. marking deleted).
- * Call this AFTER changing the item's state.
- *
- * Recalculates from the containing leaf up to the root. We cannot use
- * in-place decrement because parent.childCounts[i] is the same reference
- * as child.counts — in-place would double-count.
- */
-export declare function recalcCountsFor(tree: ItemTree, item: TreeItem): void;
-/**
- * Get the item at the given ordinal. O(log n).
- */
-export declare function getAt(tree: ItemTree, ordinal: number): TreeItem;
-/**
- * Total visible characters. O(1).
- */
-export declare function totalVisChars(tree: ItemTree): number;
-/**
- * Total items (including deleted). O(1).
- */
-export declare function totalItems(tree: ItemTree): number;
-/**
- * Find an item by visible character position. O(log n).
- * Returns null if position is beyond the end.
- */
-export declare function findByVisiblePos(tree: ItemTree, charPos: number): VisiblePosResult | null;
-/**
- * Compute the ordinal (total-item position) of an item. O(log n).
- * Uses parent pointers to walk up from the containing leaf.
- */
-export declare function computeOrdinal(tree: ItemTree, item: TreeItem): number;
-/**
- * Iterate all items in document order. O(n).
- */
-export declare function iterateAll(tree: ItemTree): Generator<TreeItem>;
-/**
- * Iterate items starting from a given ordinal. O(log n) to seek + O(k) to iterate.
- */
-export declare function iterateFrom(tree: ItemTree, startOrdinal: number): Generator<TreeItem>;
-/**
- * Collect all items into a flat array. O(n).
- */
-export declare function flattenItems(tree: ItemTree): TreeItem[];
-//# sourceMappingURL=ContentTree.d.ts.map

package/dist/crdt/ContentTree.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"ContentTree.d.ts","sourceRoot":"","sources":["../../src/crdt/ContentTree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAMH,uEAAuE;AACvE,MAAM,WAAW,QAAQ;IACvB,OAAO,EAAE,MAAM,CAAC;IAChB,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,MAAM;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;CAC7B;AAED,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,UAAU,CAAC;IACjB,QAAQ,EAAE,QAAQ,EAAE,CAAC;IACrB,WAAW,EAAE,MAAM,EAAE,CAAC;IACtB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,YAAY,GAAG,IAAI,CAAC;CAC7B;AAED,MAAM,MAAM,QAAQ,GAAG,QAAQ,GAAG,YAAY,CAAC;AAE/C,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;CACxC;AAED,MAAM,WAAW,gBAAgB;IAC/B,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,QAAQ,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;CACpB;AAyND,wBAAgB,UAAU,IAAI,QAAQ,CAQrC;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAqDpD;AAMD;;GAEG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAW9E;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,QAAQ,EAClB,SAAS,EAAE,QAAQ,GAClB,IAAI,CAaN;AAED;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,CAKpE;AAMD;;GAEG;AACH,wBAAgB,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,GAAG,QAAQ,CAG/D;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAEpD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,MAAM,CAEjD;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,MAAM,GACd,gBAAgB,GAAG,IAAI,CA4BzB;AAED;;;GAGG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,QAAQ,GAAG,MAAM,CAqBrE;AAMD;;GAEG;AACH,wBAAiB,UAAU,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC,CAE/D;AAYD;;GAEG;AACH,wBAAiB,WAAW,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,GAAG,SAAS,CAAC,QAAQ,CAAC,CAYtF;AAuBD;;GAEG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,CAIvD"}

package/dist/crdt/ContentTree.js

@@ -1,461 +0,0 @@
-/**
- * ContentTree - B-tree optimized for CRDT text operations
- *
- * Stores Items in document order with dual-count annotations (visible chars
- * and total items) at each node for O(log n) position lookup and insertion.
- *
- * Follows Seph Gentle's diamond-types content-tree design:
- * - Leaf nodes hold up to MAX_LEAF items
- * - Internal nodes hold up to MAX_INTERNAL children
- * - Each node caches { visChars, totalItems } for its subtree
- * - Parent pointers enable O(log n) ordinal computation
- */
-// ============================================
-// Constants
-// ============================================
-const MAX_LEAF = 32;
-const MAX_INTERNAL = 16;
-const LEAF_SPLIT = MAX_LEAF >>> 1;
-const INTERNAL_SPLIT = MAX_INTERNAL >>> 1;
-// ============================================
-// Internal helpers
-// ============================================
-function leafCounts(items) {
-    let visChars = 0;
-    for (let i = 0; i < items.length; i++) {
-        if (!items[i].isDeleted)
-            visChars += items[i].content.length;
-    }
-    return { visChars, totalItems: items.length };
-}
-function sumChildCounts(childCounts) {
-    let visChars = 0, totalItems = 0;
-    for (let i = 0; i < childCounts.length; i++) {
-        visChars += childCounts[i].visChars;
-        totalItems += childCounts[i].totalItems;
-    }
-    return { visChars, totalItems };
-}
-/**
- * Find the leaf and local index for a given ordinal (total-item position).
- * Returns the accumulated ordinal prefix for computing the global ordinal.
- */
-function findLeafByOrdinal(node, ordinal) {
-    while (node.type === 'internal') {
-        let remaining = ordinal;
-        let found = false;
-        for (let i = 0; i < node.children.length; i++) {
-            const count = node.childCounts[i].totalItems;
-            if (remaining < count) {
-                node = node.children[i];
-                ordinal = remaining;
-                found = true;
-                break;
-            }
-            remaining -= count;
-        }
-        if (!found) {
-            // Ordinal at the very end — go to last child
-            const internal = node;
-            node = internal.children[internal.children.length - 1];
-            ordinal = node.type === 'leaf' ? node.items.length : node.counts.totalItems;
-        }
-    }
-    return { leaf: node, localIdx: ordinal };
-}
-/**
- * Find the leaf and local index for a given visible char position.
- * Also returns the ordinal (total-item index) for the found item.
- */
-function findLeafByVisiblePos(node, charPos) {
-    let ordinalPrefix = 0;
-    while (node.type === 'internal') {
-        let remaining = charPos;
-        for (let i = 0; i < node.children.length; i++) {
-            const vis = node.childCounts[i].visChars;
-            if (remaining < vis || i === node.children.length - 1) {
-                node = node.children[i];
-                charPos = remaining;
-                break;
-            }
-            remaining -= vis;
-            ordinalPrefix += node.childCounts[i].totalItems;
-        }
-    }
-    return { leaf: node, ordinalPrefix, remainingChars: charPos };
-}
-/**
- * Update counts from a leaf up to the root after a mutation.
- */
-function updateCountsUp(leaf) {
-    leaf.counts = leafCounts(leaf.items);
-    let child = leaf;
-    let parent = leaf.parent;
-    while (parent) {
-        // Find the child index and update its count
-        for (let i = 0; i < parent.children.length; i++) {
-            if (parent.children[i] === child) {
-                parent.childCounts[i] = child.counts;
-                break;
-            }
-        }
-        parent.counts = sumChildCounts(parent.childCounts);
-        child = parent;
-        parent = parent.parent;
-    }
-}
-/**
- * Split a leaf that has exceeded MAX_LEAF items.
- * Returns the new right leaf. The tree is updated via parent insertion.
- */
-function splitLeaf(tree, leaf) {
-    const rightItems = leaf.items.splice(LEAF_SPLIT);
-    const rightLeaf = {
-        type: 'leaf',
-        items: rightItems,
-        counts: leafCounts(rightItems),
-        parent: null, // set below
-    };
-    leaf.counts = leafCounts(leaf.items);
-    // Update _itemLeaf for moved items
-    for (let i = 0; i < rightItems.length; i++) {
-        tree._itemLeaf.set(rightItems[i], rightLeaf);
-    }
-    insertChildAfter(tree, leaf, rightLeaf);
-}
-/**
- * Insert a new child node into its parent (or create a new root).
- */
-function insertChildAfter(tree, leftChild, rightChild) {
-    const parent = leftChild.parent;
-    if (!parent) {
-        // Create new root
-        const newRoot = {
-            type: 'internal',
-            children: [leftChild, rightChild],
-            childCounts: [leftChild.counts, rightChild.counts],
-            counts: { visChars: 0, totalItems: 0 },
-            parent: null,
-        };
-        newRoot.counts = sumChildCounts(newRoot.childCounts);
-        leftChild.parent = newRoot;
-        rightChild.parent = newRoot;
-        tree.root = newRoot;
-        return;
-    }
-    // Find leftChild's index in parent
-    let idx = -1;
-    for (let i = 0; i < parent.children.length; i++) {
-        if (parent.children[i] === leftChild) {
-            idx = i;
-            break;
-        }
-    }
-    // Insert rightChild after leftChild
-    parent.children.splice(idx + 1, 0, rightChild);
-    parent.childCounts.splice(idx + 1, 0, rightChild.counts);
-    rightChild.parent = parent;
-    // Update parent counts
-    parent.childCounts[idx] = leftChild.counts;
-    parent.counts = sumChildCounts(parent.childCounts);
-    // Check overflow
-    if (parent.children.length > MAX_INTERNAL) {
-        splitInternal(tree, parent);
-    }
-    else {
-        // Propagate count changes up
-        let child = parent;
-        let p = parent.parent;
-        while (p) {
-            for (let i = 0; i < p.children.length; i++) {
-                if (p.children[i] === child) {
-                    p.childCounts[i] = child.counts;
-                    break;
-                }
-            }
-            p.counts = sumChildCounts(p.childCounts);
-            child = p;
-            p = p.parent;
-        }
-    }
-}
-/**
- * Split an internal node that has exceeded MAX_INTERNAL children.
- */
-function splitInternal(tree, node) {
-    const rightChildren = node.children.splice(INTERNAL_SPLIT);
-    const rightCounts = node.childCounts.splice(INTERNAL_SPLIT);
-    const rightNode = {
-        type: 'internal',
-        children: rightChildren,
-        childCounts: rightCounts,
-        counts: sumChildCounts(rightCounts),
-        parent: null,
-    };
-    // Update parent pointers for moved children
-    for (let i = 0; i < rightChildren.length; i++) {
-        rightChildren[i].parent = rightNode;
-    }
-    node.counts = sumChildCounts(node.childCounts);
-    insertChildAfter(tree, node, rightNode);
-}
-// ============================================
-// Public API — Creation
-// ============================================
-export function createTree() {
-    const leaf = {
-        type: 'leaf',
-        items: [],
-        counts: { visChars: 0, totalItems: 0 },
-        parent: null,
-    };
-    return { root: leaf, _itemLeaf: new WeakMap() };
-}
-/**
- * Build a balanced tree from a pre-ordered flat array. O(n).
- */
-export function bulkLoad(items) {
-    const tree = { root: null, _itemLeaf: new WeakMap() };
-    if (items.length === 0) {
-        tree.root = { type: 'leaf', items: [], counts: { visChars: 0, totalItems: 0 }, parent: null };
-        return tree;
-    }
-    // Create leaves
-    const leaves = [];
-    for (let i = 0; i < items.length; i += MAX_LEAF) {
-        const chunk = items.slice(i, Math.min(i + MAX_LEAF, items.length));
-        const leaf = {
-            type: 'leaf',
-            items: chunk,
-            counts: leafCounts(chunk),
-            parent: null,
-        };
-        for (let j = 0; j < chunk.length; j++) {
-            tree._itemLeaf.set(chunk[j], leaf);
-        }
-        leaves.push(leaf);
-    }
-    if (leaves.length === 1) {
-        tree.root = leaves[0];
-        return tree;
-    }
-    // Build internal nodes bottom-up
-    let currentLevel = leaves;
-    while (currentLevel.length > 1) {
-        const nextLevel = [];
-        for (let i = 0; i < currentLevel.length; i += MAX_INTERNAL) {
-            const children = currentLevel.slice(i, Math.min(i + MAX_INTERNAL, currentLevel.length));
-            const childCounts = children.map(c => ({ ...c.counts }));
-            const node = {
-                type: 'internal',
-                children,
-                childCounts,
-                counts: sumChildCounts(childCounts),
-                parent: null,
-            };
-            for (let j = 0; j < children.length; j++) {
-                children[j].parent = node;
-            }
-            nextLevel.push(node);
-        }
-        currentLevel = nextLevel;
-    }
-    tree.root = currentLevel[0];
-    return tree;
-}
-// ============================================
-// Public API — Mutation
-// ============================================
-/**
- * Insert an item at the given ordinal position. O(log n).
- */
-export function insertAt(tree, ordinal, item) {
-    const { leaf, localIdx } = findLeafByOrdinal(tree.root, ordinal);
-    leaf.items.splice(localIdx, 0, item);
-    tree._itemLeaf.set(item, leaf);
-    updateCountsUp(leaf);
-    if (leaf.items.length > MAX_LEAF) {
-        splitLeaf(tree, leaf);
-    }
-}
-/**
- * Replace one item at the given ordinal with two items (for CRDT span splitting).
- * O(log n).
- */
-export function splitAtOrdinal(tree, ordinal, leftItem, rightItem) {
-    const { leaf, localIdx } = findLeafByOrdinal(tree.root, ordinal);
-    // Replace with left, insert right after
-    leaf.items.splice(localIdx, 1, leftItem, rightItem);
-    tree._itemLeaf.set(leftItem, leaf);
-    tree._itemLeaf.set(rightItem, leaf);
-    updateCountsUp(leaf);
-    if (leaf.items.length > MAX_LEAF) {
-        splitLeaf(tree, leaf);
-    }
-}
-/**
- * Recalculate tree counts after mutating an item (e.g. marking deleted).
- * Call this AFTER changing the item's state.
- *
- * Recalculates from the containing leaf up to the root. We cannot use
- * in-place decrement because parent.childCounts[i] is the same reference
- * as child.counts — in-place would double-count.
- */
-export function recalcCountsFor(tree, item) {
-    const leaf = tree._itemLeaf.get(item);
-    if (!leaf)
-        return;
-    updateCountsUp(leaf);
-}
-// ============================================
-// Public API — Query
-// ============================================
-/**
- * Get the item at the given ordinal. O(log n).
- */
-export function getAt(tree, ordinal) {
-    const { leaf, localIdx } = findLeafByOrdinal(tree.root, ordinal);
-    return leaf.items[localIdx];
-}
-/**
- * Total visible characters. O(1).
- */
-export function totalVisChars(tree) {
-    return tree.root.counts.visChars;
-}
-/**
- * Total items (including deleted). O(1).
- */
-export function totalItems(tree) {
-    return tree.root.counts.totalItems;
-}
-/**
- * Find an item by visible character position. O(log n).
- * Returns null if position is beyond the end.
- */
-export function findByVisiblePos(tree, charPos) {
-    if (charPos < 0 || tree.root.counts.visChars === 0)
-        return null;
-    const { leaf, ordinalPrefix, remainingChars } = findLeafByVisiblePos(tree.root, charPos);
-    let visPos = remainingChars;
-    for (let i = 0; i < leaf.items.length; i++) {
-        const item = leaf.items[i];
-        if (item.isDeleted)
-            continue;
-        const len = item.content.length;
-        if (visPos < len) {
-            return { ordinal: ordinalPrefix + i, item, charOffset: visPos };
-        }
-        visPos -= len;
-    }
-    // Position at the very end — return last visible item
-    for (let i = leaf.items.length - 1; i >= 0; i--) {
-        if (!leaf.items[i].isDeleted) {
-            return {
-                ordinal: ordinalPrefix + i,
-                item: leaf.items[i],
-                charOffset: leaf.items[i].content.length,
-            };
-        }
-    }
-    return null;
-}
-/**
- * Compute the ordinal (total-item position) of an item. O(log n).
- * Uses parent pointers to walk up from the containing leaf.
- */
-export function computeOrdinal(tree, item) {
-    const leaf = tree._itemLeaf.get(item);
-    if (!leaf)
-        return -1;
-    const localIdx = leaf.items.indexOf(item);
-    if (localIdx === -1)
-        return -1;
-    let ordinal = localIdx;
-    let child = leaf;
-    let parent = child.parent;
-    while (parent) {
-        for (let i = 0; i < parent.children.length; i++) {
-            if (parent.children[i] === child)
-                break;
-            ordinal += parent.childCounts[i].totalItems;
-        }
-        child = parent;
-        parent = parent.parent;
-    }
-    return ordinal;
-}
-// ============================================
-// Public API — Iteration
-// ============================================
-/**
- * Iterate all items in document order. O(n).
- */
-export function* iterateAll(tree) {
-    yield* iterateNode(tree.root);
-}
-function* iterateNode(node) {
-    if (node.type === 'leaf') {
-        yield* node.items;
-    }
-    else {
-        for (let i = 0; i < node.children.length; i++) {
-            yield* iterateNode(node.children[i]);
-        }
-    }
-}
-/**
- * Iterate items starting from a given ordinal. O(log n) to seek + O(k) to iterate.
- */
-export function* iterateFrom(tree, startOrdinal) {
-    if (startOrdinal >= tree.root.counts.totalItems)
-        return;
-    const { leaf, localIdx } = findLeafByOrdinal(tree.root, startOrdinal);
-    // Yield remaining items in this leaf
-    for (let i = localIdx; i < leaf.items.length; i++) {
-        yield leaf.items[i];
-    }
-    // Walk to subsequent leaves via parent chain
-    yield* iterateAfterLeaf(leaf);
-}
-function* iterateAfterLeaf(leaf) {
-    let child = leaf;
-    let parent = child.parent;
-    while (parent) {
-        // Find our index in parent
-        let idx = -1;
-        for (let i = 0; i < parent.children.length; i++) {
-            if (parent.children[i] === child) {
-                idx = i;
-                break;
-            }
-        }
-        // Yield all subsequent siblings' items
-        for (let i = idx + 1; i < parent.children.length; i++) {
-            yield* iterateNode(parent.children[i]);
-        }
-        child = parent;
-        parent = parent.parent;
-    }
-}
-/**
- * Collect all items into a flat array. O(n).
- */
-export function flattenItems(tree) {
-    const result = [];
-    collectItems(tree.root, result);
-    return result;
-}
-function collectItems(node, result) {
-    if (node.type === 'leaf') {
-        for (let i = 0; i < node.items.length; i++) {
-            result.push(node.items[i]);
-        }
-    }
-    else {
-        for (let i = 0; i < node.children.length; i++) {
-            collectItems(node.children[i], result);
-        }
-    }
-}
-//# sourceMappingURL=ContentTree.js.map

package/dist/crdt/ContentTree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ContentTree.js","sourceRoot":"","sources":["../../src/crdt/ContentTree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AA6CH,+CAA+C;AAC/C,YAAY;AACZ,+CAA+C;AAE/C,MAAM,QAAQ,GAAG,EAAE,CAAC;AACpB,MAAM,YAAY,GAAG,EAAE,CAAC;AACxB,MAAM,UAAU,GAAG,QAAQ,KAAK,CAAC,CAAC;AAClC,MAAM,cAAc,GAAG,YAAY,KAAK,CAAC,CAAC;AAE1C,+CAA+C;AAC/C,mBAAmB;AACnB,+CAA+C;AAE/C,SAAS,UAAU,CAAC,KAAiB;IACnC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;YAAE,QAAQ,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC;IAC/D,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC;AAChD,CAAC;AAED,SAAS,cAAc,CAAC,WAAqB;IAC3C,IAAI,QAAQ,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC;IACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,QAAQ,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;QACpC,UAAU,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;IAC1C,CAAC;IACD,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CACxB,IAAc,EACd,OAAe;IAEf,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAChC,IAAI,SAAS,GAAG,OAAO,CAAC;QACxB,IAAI,KAAK,GAAG,KAAK,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YAC7C,IAAI,SAAS,GAAG,KAAK,EAAE,CAAC;gBACtB,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACxB,OAAO,GAAG,SAAS,CAAC;gBACpB,KAAK,GAAG,IAAI,CAAC;gBACb,MAAM;YACR,CAAC;YACD,SAAS,IAAI,KAAK,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,6CAA6C;YAC7C,MAAM,QAAQ,GAAG,IAAoB,CAAC;YACtC,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACvD,OAAO,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;QAC9E,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,CAAC;AAC3C,CAAC;AAED;;;GAGG;AACH,SAAS,oBAAoB,CAC3B,IAAc,EACd,OAAe;IAEf,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,OAAO,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QAChC,IAAI,SAAS,GAAG,OAAO,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;YACzC,IAAI,SAAS,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACxB,OAAO,GAAG,SAAS,CAAC;gBACpB,MAAM;YACR,CAAC;YACD,SAAS,IAAI,GAAG,CAAC;YACjB,aAAa,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAClD,CAAC;IACH,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,aAAa,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC;AAChE,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,IAAc;IACpC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,IAAI,KAAK,GAAa,IAAI,CAAC;IAC3B,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;IACzB,OAAO,MAAM,EAAE,CAAC;QACd,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBACjC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;gBACrC,MAAM;YACR,CAAC;QACH,CAAC;QACD,MAAM,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QACnD,KAAK,GAAG,MAAM,CAAC;QACf,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IACzB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,IAAc,EAAE,IAAc;IAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IACjD,MAAM,SAAS,GAAa;QAC1B,IAAI,EAAE,MAAM;QACZ,KAAK,EAAE,UAAU;QACjB,MAAM,EAAE,UAAU,CAAC,UAAU,CAAC;QAC9B,MAAM,EAAE,IAAI,EAAE,YAAY;KAC3B,CAAC;IACF,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAErC,mCAAmC;IACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IAED,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;AAC1C,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,IAAc,EAAE,SAAmB,EAAE,UAAoB;IACjF,MAAM,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;IAChC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,kBAAkB;QAClB,MAAM,OAAO,GAAiB;YAC5B,IAAI,EAAE,UAAU;YAChB,QAAQ,EAAE,CAAC,SAAS,EAAE,UAAU,CAAC;YACjC,WAAW,EAAE,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC;YAClD,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE;YACtC,MAAM,EAAE,IAAI;SACb,CAAC;QACF,OAAO,CAAC,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACrD,SAAS,CAAC,MAAM,GAAG,OAAO,CAAC;QAC3B,UAAU,CAAC,MAAM,GAAG,OAAO,CAAC;QAC5B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACpB,OAAO;IACT,CAAC;IAED,mCAAmC;IACnC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE,CAAC;YAAC,GAAG,GAAG,CAAC,CAAC;YAAC,MAAM;QAAC,CAAC;IAC3D,CAAC;IAED,oCAAoC;IACpC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,CAAC;IAC/C,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IACzD,UAAU,CAAC,MAAM,GAAG,MAAM,CAAC;IAE3B,uBAAuB;IACvB,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAC3C,MAAM,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IAEnD,iBAAiB;IACjB,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;QAC1C,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC9B,CAAC;SAAM,CAAC;QACN,6BAA6B;QAC7B,IAAI,KAAK,GAAa,MAAM,CAAC;QAC7B,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACtB,OAAO,CAAC,EAAE,CAAC;YACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,IAAI,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;oBAC5B,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;oBAChC,MAAM;gBACR,CAAC;YACH,CAAC;YACD,CAAC,CAAC,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC;YACzC,KAAK,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;QACf,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAc,EAAE,IAAkB;IACvD,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IAC3D,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;IAE5D,MAAM,SAAS,GAAiB;QAC9B,IAAI,EAAE,UAAU;QAChB,QAAQ,EAAE,aAAa;QACvB,WAAW,EAAE,WAAW;QACxB,MAAM,EAAE,cAAc,CAAC,WAAW,CAAC;QACnC,MAAM,EAAE,IAAI;KACb,CAAC;IAEF,4CAA4C;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC9C,aAAa,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,SAAS,CAAC;IACtC,CAAC;IAED,IAAI,CAAC,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IAE/C,gBAAgB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;AAC1C,CAAC;AAED,+CAA+C;AAC/C,wBAAwB;AACxB,+CAA+C;AAE/C,MAAM,UAAU,UAAU;IACxB,MAAM,IAAI,GAAa;QACrB,IAAI,EAAE,MAAM;QACZ,KAAK,EAAE,EAAE;QACT,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE;QACtC,MAAM,EAAE,IAAI;KACb,CAAC;IACF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,OAAO,EAAE,EAAE,CAAC;AAClD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAiB;IACxC,MAAM,IAAI,GAAa,EAAE,IAAI,EAAE,IAA2B,EAAE,SAAS,EAAE,IAAI,OAAO,EAAE,EAAE,CAAC;IAEvF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,QAAQ,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC9F,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gBAAgB;IAChB,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,QAAQ,EAAE,CAAC;QAChD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QACnE,MAAM,IAAI,GAAa;YACrB,IAAI,EAAE,MAAM;YACZ,KAAK,EAAE,KAAK;YACZ,MAAM,EAAE,UAAU,CAAC,KAAK,CAAC;YACzB,MAAM,EAAE,IAAI;SACb,CAAC;QACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACxB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,iCAAiC;IACjC,IAAI,YAAY,GAAe,MAAM,CAAC;IACtC,OAAO,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAmB,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,IAAI,YAAY,EAAE,CAAC;YAC3D,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,YAAY,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;YACxF,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YACzD,MAAM,IAAI,GAAiB;gBACzB,IAAI,EAAE,UAAU;gBAChB,QAAQ;gBACR,WAAW;gBACX,MAAM,EAAE,cAAc,CAAC,WAAW,CAAC;gBACnC,MAAM,EAAE,IAAI;aACb,CAAC;YACF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;YAC5B,CAAC;YACD,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;QACD,YAAY,GAAG,SAAS,CAAC;IAC3B,CAAC;IAED,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;IAC5B,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+CAA+C;AAC/C,wBAAwB;AACxB,+CAA+C;AAE/C;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAc,EAAE,OAAe,EAAE,IAAc;IACtE,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAEjE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAE/B,cAAc,CAAC,IAAI,CAAC,CAAC;IAErB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;QACjC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAc,EACd,OAAe,EACf,QAAkB,EAClB,SAAmB;IAEnB,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAEjE,wCAAwC;IACxC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IACpD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACnC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAEpC,cAAc,CAAC,IAAI,CAAC,CAAC;IAErB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,QAAQ,EAAE,CAAC;QACjC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxB,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAAC,IAAc,EAAE,IAAc;IAC5D,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,CAAC,IAAI;QAAE,OAAO;IAElB,cAAc,CAAC,IAAI,CAAC,CAAC;AACvB,CAAC;AAED,+CAA+C;AAC/C,qBAAqB;AACrB,+CAA+C;AAE/C;;GAEG;AACH,MAAM,UAAU,KAAK,CAAC,IAAc,EAAE,OAAe;IACnD,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACjE,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,IAAc;IAC1C,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;AACnC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,IAAc;IACvC,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;AACrC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAc,EACd,OAAe;IAEf,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhE,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,cAAc,EAAE,GAAG,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAEzF,IAAI,MAAM,GAAG,cAAc,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,IAAI,CAAC,SAAS;YAAE,SAAS;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAChC,IAAI,MAAM,GAAG,GAAG,EAAE,CAAC;YACjB,OAAO,EAAE,OAAO,EAAE,aAAa,GAAG,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;QAClE,CAAC;QACD,MAAM,IAAI,GAAG,CAAC;IAChB,CAAC;IAED,sDAAsD;IACtD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAC7B,OAAO;gBACL,OAAO,EAAE,aAAa,GAAG,CAAC;gBAC1B,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBACnB,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM;aACzC,CAAC;QACJ,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAAC,IAAc,EAAE,IAAc;IAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,CAAC;IAErB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1C,IAAI,QAAQ,KAAK,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IAE/B,IAAI,OAAO,GAAG,QAAQ,CAAC;IACvB,IAAI,KAAK,GAAa,IAAI,CAAC;IAC3B,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE1B,OAAO,MAAM,EAAE,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK;gBAAE,MAAM;YACxC,OAAO,IAAI,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QAC9C,CAAC;QACD,KAAK,GAAG,MAAM,CAAC;QACf,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IACzB,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+CAA+C;AAC/C,yBAAyB;AACzB,+CAA+C;AAE/C;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,UAAU,CAAC,IAAc;IACxC,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC;AAED,QAAQ,CAAC,CAAC,WAAW,CAAC,IAAc;IAClC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACzB,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,KAAK,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,SAAS,CAAC,CAAC,WAAW,CAAC,IAAc,EAAE,YAAoB;IAC/D,IAAI,YAAY,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU;QAAE,OAAO;IAExD,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,iBAAiB,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAEtE,qCAAqC;IACrC,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAClD,MAAM,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,6CAA6C;IAC7C,KAAK,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;AAChC,CAAC;AAED,QAAQ,CAAC,CAAC,gBAAgB,CAAC,IAAc;IACvC,IAAI,KAAK,GAAa,IAAI,CAAC;IAC3B,IAAI,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAE1B,OAAO,MAAM,EAAE,CAAC;QACd,2BAA2B;QAC3B,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,EAAE,CAAC;gBAAC,GAAG,GAAG,CAAC,CAAC;gBAAC,MAAM;YAAC,CAAC;QACvD,CAAC;QAED,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,KAAK,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC;QAED,KAAK,GAAG,MAAM,CAAC;QACf,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;IACzB,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,IAAc;IACzC,MAAM,MAAM,GAAe,EAAE,CAAC;IAC9B,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,YAAY,CAAC,IAAc,EAAE,MAAkB;IACtD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;SAAM,CAAC;QACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;AACH,CAAC"}