data-structure-typed 2.1.0 → 2.1.2

package/dist/esm/data-structures/binary-tree/tree-counter.js

@@ -1,412 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Pablo Zeng
- * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-import { RedBlackTree, RedBlackTreeNode } from './red-black-tree';
-/**
- * RB-tree node with an extra 'count' field; keeps parent/child links.
- * @remarks Time O(1), Space O(1)
- * @template K
- * @template V
- */
-export class TreeCounterNode extends RedBlackTreeNode {
-    parent = undefined;
-    /**
-     * Create a tree counter node.
-     * @remarks Time O(1), Space O(1)
-     * @param key - Key of the node.
-     * @param [value] - Value associated with the key (ignored in map mode).
-     * @param [count] - Initial count for this node (default 1).
-     * @param color - Initial color ('RED' or 'BLACK').
-     * @returns New TreeCounterNode instance.
-     */
-    constructor(key, value, count = 1, color = 'BLACK') {
-        super(key, value, color);
-        this.count = count;
-    }
-    _left = undefined;
-    /**
-     * Get the left child pointer.
-     * @remarks Time O(1), Space O(1)
-     * @returns Left child node, or null/undefined.
-     */
-    get left() {
-        return this._left;
-    }
-    /**
-     * Set the left child and update its parent pointer.
-     * @remarks Time O(1), Space O(1)
-     * @param v - New left child node, or null/undefined.
-     * @returns void
-     */
-    set left(v) {
-        if (v) {
-            v.parent = this;
-        }
-        this._left = v;
-    }
-    _right = undefined;
-    /**
-     * Get the right child pointer.
-     * @remarks Time O(1), Space O(1)
-     * @returns Right child node, or null/undefined.
-     */
-    get right() {
-        return this._right;
-    }
-    /**
-     * Set the right child and update its parent pointer.
-     * @remarks Time O(1), Space O(1)
-     * @param v - New right child node, or null/undefined.
-     * @returns void
-     */
-    set right(v) {
-        if (v) {
-            v.parent = this;
-        }
-        this._right = v;
-    }
-}
-/**
- * Red-Black Tree–based counter map (key → value with per-node count). Supports O(log N) updates and map-like mode.
- * @remarks Time O(1), Space O(1)
- * @template K
- * @template V
- * @template R
- */
-export class TreeCounter extends RedBlackTree {
-    /**
-     * Create a TreeCounter and optionally bulk-insert items.
-     * @remarks Time O(N log N), Space O(N)
-     * @param [keysNodesEntriesOrRaws] - Iterable of keys/nodes/entries/raw items to insert.
-     * @param [options] - Options for TreeCounter (comparator, reverse, map mode).
-     * @returns New TreeCounter instance.
-     */
-    constructor(keysNodesEntriesOrRaws = [], options) {
-        super([], options);
-        if (keysNodesEntriesOrRaws)
-            this.addMany(keysNodesEntriesOrRaws);
-    }
-    _count = 0;
-    /**
-     * Get the total aggregate count across all nodes.
-     * @remarks Time O(1), Space O(1)
-     * @returns Total count.
-     */
-    get count() {
-        return this._count;
-    }
-    /**
-     * Compute the total count by traversing the tree (sums node.count).
-     * @remarks Time O(N), Space O(H)
-     * @returns Total count recomputed from nodes.
-     */
-    getComputedCount() {
-        let sum = 0;
-        this.dfs(node => (sum += node ? node.count : 0));
-        return sum;
-    }
-    _createNode(key, value, color = 'BLACK', count) {
-        return new TreeCounterNode(key, this._isMapMode ? undefined : value, count, color);
-    }
-    /**
-     * Type guard: check whether the input is a TreeCounterNode.
-     * @remarks Time O(1), Space O(1)
-     * @returns True if the value is a TreeCounterNode.
-     */
-    isNode(keyNodeOrEntry) {
-        return keyNodeOrEntry instanceof TreeCounterNode;
-    }
-    /**
-     * Insert or increment a node and update aggregate count.
-     * @remarks Time O(log N), Space O(1)
-     * @param keyNodeOrEntry - Key, node, or [key, value] entry to insert.
-     * @param [value] - Value when a bare key is provided (ignored in map mode).
-     * @param [count] - How much to increase the node's count (default 1).
-     * @returns True if inserted/updated; false if ignored.
-     */
-    add(keyNodeOrEntry, value, count = 1) {
-        const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value, count);
-        const orgCount = newNode?.count || 0;
-        const isSuccessAdded = super.add(newNode, newValue);
-        if (isSuccessAdded) {
-            this._count += orgCount;
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-    /**
-     * Delete a node (or decrement its count) and rebalance if needed.
-     * @remarks Time O(log N), Space O(1)
-     * @param keyNodeOrEntry - Key, node, or [key, value] entry identifying the node.
-     * @param [ignoreCount] - If true, remove the node regardless of its count.
-     * @returns Array of deletion results including deleted node and a rebalance hint when present.
-     */
-    delete(keyNodeOrEntry, ignoreCount = false) {
-        if (keyNodeOrEntry === null)
-            return [];
-        const results = [];
-        let nodeToDelete;
-        if (this._isPredicate(keyNodeOrEntry))
-            nodeToDelete = this.getNode(keyNodeOrEntry);
-        else
-            nodeToDelete = this.isRealNode(keyNodeOrEntry) ? keyNodeOrEntry : this.getNode(keyNodeOrEntry);
-        if (!nodeToDelete) {
-            return results;
-        }
-        let originalColor = nodeToDelete.color;
-        let replacementNode;
-        if (!this.isRealNode(nodeToDelete.left)) {
-            if (nodeToDelete.right !== null)
-                replacementNode = nodeToDelete.right;
-            if (ignoreCount || nodeToDelete.count <= 1) {
-                if (nodeToDelete.right !== null) {
-                    this._transplant(nodeToDelete, nodeToDelete.right);
-                    this._count -= nodeToDelete.count;
-                }
-            }
-            else {
-                nodeToDelete.count--;
-                this._count--;
-                results.push({ deleted: nodeToDelete, needBalanced: undefined });
-                return results;
-            }
-        }
-        else if (!this.isRealNode(nodeToDelete.right)) {
-            replacementNode = nodeToDelete.left;
-            if (ignoreCount || nodeToDelete.count <= 1) {
-                this._transplant(nodeToDelete, nodeToDelete.left);
-                this._count -= nodeToDelete.count;
-            }
-            else {
-                nodeToDelete.count--;
-                this._count--;
-                results.push({ deleted: nodeToDelete, needBalanced: undefined });
-                return results;
-            }
-        }
-        else {
-            const successor = this.getLeftMost(node => node, nodeToDelete.right);
-            if (successor) {
-                originalColor = successor.color;
-                if (successor.right !== null)
-                    replacementNode = successor.right;
-                if (successor.parent === nodeToDelete) {
-                    if (this.isRealNode(replacementNode)) {
-                        replacementNode.parent = successor;
-                    }
-                }
-                else {
-                    if (ignoreCount || nodeToDelete.count <= 1) {
-                        if (successor.right !== null) {
-                            this._transplant(successor, successor.right);
-                            this._count -= nodeToDelete.count;
-                        }
-                    }
-                    else {
-                        nodeToDelete.count--;
-                        this._count--;
-                        results.push({ deleted: nodeToDelete, needBalanced: undefined });
-                        return results;
-                    }
-                    successor.right = nodeToDelete.right;
-                    if (this.isRealNode(successor.right)) {
-                        successor.right.parent = successor;
-                    }
-                }
-                if (ignoreCount || nodeToDelete.count <= 1) {
-                    this._transplant(nodeToDelete, successor);
-                    this._count -= nodeToDelete.count;
-                }
-                else {
-                    nodeToDelete.count--;
-                    this._count--;
-                    results.push({ deleted: nodeToDelete, needBalanced: undefined });
-                    return results;
-                }
-                successor.left = nodeToDelete.left;
-                if (this.isRealNode(successor.left)) {
-                    successor.left.parent = successor;
-                }
-                successor.color = nodeToDelete.color;
-            }
-        }
-        this._size--;
-        if (originalColor === 'BLACK') {
-            this._deleteFixup(replacementNode);
-        }
-        results.push({ deleted: nodeToDelete, needBalanced: undefined });
-        return results;
-    }
-    /**
-     * Remove all nodes and reset aggregate counters.
-     * @remarks Time O(N), Space O(1)
-     * @returns void
-     */
-    clear() {
-        super.clear();
-        this._count = 0;
-    }
-    /**
-     * Rebuild the tree into a perfectly balanced form using in-order nodes.
-     * @remarks Time O(N), Space O(N)
-     * @param [iterationType] - Traversal style to use when constructing the balanced tree.
-     * @returns True if rebalancing succeeded (tree not empty).
-     */
-    perfectlyBalance(iterationType = this.iterationType) {
-        const nodes = this.dfs(node => node, 'IN', false, this._root, iterationType);
-        const n = nodes.length;
-        if (n < 1)
-            return false;
-        let total = 0;
-        for (const nd of nodes)
-            total += nd ? nd.count : 0;
-        this._clearNodes();
-        const build = (l, r, parent) => {
-            if (l > r)
-                return undefined;
-            const m = l + ((r - l) >> 1);
-            const root = nodes[m];
-            const leftChild = build(l, m - 1, root);
-            const rightChild = build(m + 1, r, root);
-            root.left = leftChild;
-            root.right = rightChild;
-            root.parent = parent;
-            return root;
-        };
-        const newRoot = build(0, n - 1, undefined);
-        this._setRoot(newRoot);
-        this._size = n;
-        this._count = total;
-        return true;
-    }
-    /**
-     * Create a new TreeCounter by mapping each [key, value] entry.
-     * @remarks Time O(N log N), Space O(N)
-     * @template MK
-     * @template MV
-     * @template MR
-     * @param callback - Function mapping (key, value, index, tree) → [newKey, newValue].
-     * @param [options] - Options for the output tree.
-     * @param [thisArg] - Value for `this` inside the callback.
-     * @returns A new TreeCounter with mapped entries.
-     */
-    map(callback, options, thisArg) {
-        const out = this._createLike([], options);
-        let index = 0;
-        for (const [key, value] of this) {
-            out.add(callback.call(thisArg, key, value, index++, this));
-        }
-        return out;
-    }
-    /**
-     * Deep copy this tree, preserving map mode and aggregate counts.
-     * @remarks Time O(N), Space O(N)
-     * @returns A deep copy of this tree.
-     */
-    clone() {
-        const out = this._createInstance();
-        this._clone(out);
-        out._count = this._count;
-        return out;
-    }
-    /**
-     * (Protected) Create an empty instance of the same concrete class.
-     * @remarks Time O(1), Space O(1)
-     * @template TK
-     * @template TV
-     * @template TR
-     * @param [options] - Optional constructor options for the like-kind instance.
-     * @returns An empty like-kind instance.
-     */
-    _createInstance(options) {
-        const Ctor = this.constructor;
-        return new Ctor([], { ...this._snapshotOptions(), ...(options ?? {}) });
-    }
-    /**
-     * (Protected) Create a like-kind instance and seed it from an iterable.
-     * @remarks Time O(N log N), Space O(N)
-     * @template TK
-     * @template TV
-     * @template TR
-     * @param iter - Iterable used to seed the new tree.
-     * @param [options] - Options merged with the current snapshot.
-     * @returns A like-kind TreeCounter built from the iterable.
-     */
-    _createLike(iter = [], options) {
-        const Ctor = this.constructor;
-        return new Ctor(iter, {
-            ...this._snapshotOptions(),
-            ...(options ?? {})
-        });
-    }
-    /**
-     * (Protected) Normalize input into a node plus its effective value and count.
-     * @remarks Time O(1), Space O(1)
-     * @param keyNodeOrEntry - Key, node, or [key, value] entry.
-     * @param [value] - Value used when a bare key is provided.
-     * @param [count] - Count increment to apply (default 1).
-     * @returns Tuple [node, value] where node may be undefined.
-     */
-    _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value, count = 1) {
-        if (keyNodeOrEntry === undefined || keyNodeOrEntry === null)
-            return [undefined, undefined];
-        if (this.isNode(keyNodeOrEntry))
-            return [keyNodeOrEntry, value];
-        if (this.isEntry(keyNodeOrEntry)) {
-            const [key, entryValue] = keyNodeOrEntry;
-            if (key === undefined || key === null)
-                return [undefined, undefined];
-            const finalValue = value ?? entryValue;
-            return [this._createNode(key, finalValue, 'BLACK', count), finalValue];
-        }
-        return [this._createNode(keyNodeOrEntry, value, 'BLACK', count), value];
-    }
-    /**
-     * (Protected) Swap keys/values/counters between the source and destination nodes.
-     * @remarks Time O(1), Space O(1)
-     * @param srcNode - Source node (or key) whose properties will be moved.
-     * @param destNode - Destination node (or key) to receive properties.
-     * @returns Destination node after swap, or undefined.
-     */
-    _swapProperties(srcNode, destNode) {
-        srcNode = this.ensureNode(srcNode);
-        destNode = this.ensureNode(destNode);
-        if (srcNode && destNode) {
-            const { key, value, count, color } = destNode;
-            const tempNode = this._createNode(key, value, color, count);
-            if (tempNode) {
-                tempNode.color = color;
-                destNode.key = srcNode.key;
-                if (!this._isMapMode)
-                    destNode.value = srcNode.value;
-                destNode.count = srcNode.count;
-                destNode.color = srcNode.color;
-                srcNode.key = tempNode.key;
-                if (!this._isMapMode)
-                    srcNode.value = tempNode.value;
-                srcNode.count = tempNode.count;
-                srcNode.color = tempNode.color;
-            }
-            return destNode;
-        }
-        return undefined;
-    }
-    /**
-     * (Protected) Replace one node by another and adjust counters accordingly.
-     * @remarks Time O(1), Space O(1)
-     * @param oldNode - Node being replaced.
-     * @param newNode - Replacement node.
-     * @returns The new node after replacement.
-     */
-    _replaceNode(oldNode, newNode) {
-        newNode.count = oldNode.count + newNode.count;
-        return super._replaceNode(oldNode, newNode);
-    }
-}
-//# sourceMappingURL=tree-counter.js.map

package/dist/esm/data-structures/binary-tree/tree-counter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree-counter.js","sourceRoot":"","sources":["../../../../src/data-structures/binary-tree/tree-counter.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAeH,OAAO,EAAE,YAAY,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AAElE;;;;;GAKG;AACH,MAAM,OAAO,eAAkC,SAAQ,gBAAsB;IAClE,MAAM,GAA2B,SAAS,CAAC;IAEpD;;;;;;;;OAQG;IACH,YAAY,GAAM,EAAE,KAAS,EAAE,KAAK,GAAG,CAAC,EAAE,QAAmB,OAAO;QAClE,KAAK,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAEQ,KAAK,GAA8C,SAAS,CAAC;IAEtE;;;;OAIG;IACH,IAAa,IAAI;QACf,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACH,IAAa,IAAI,CAAC,CAA2C;QAC3D,IAAI,CAAC,EAAE,CAAC;YACN,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;IACjB,CAAC;IAEQ,MAAM,GAA8C,SAAS,CAAC;IAEvE;;;;OAIG;IACH,IAAa,KAAK;QAChB,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;;;OAKG;IACH,IAAa,KAAK,CAAC,CAA2C;QAC5D,IAAI,CAAC,EAAE,CAAC;YACN,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,OAAO,WACX,SAAQ,YAAqB;IAG7B;;;;;;OAMG;IACH,YACE,yBAEI,EAAE,EACN,OAAqC;QAErC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QACnB,IAAI,sBAAsB;YAAE,IAAI,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC;IACnE,CAAC;IAES,MAAM,GAAG,CAAC,CAAC;IAErB;;;;OAIG;IAEH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAED;;;;OAIG;IAEH,gBAAgB;QACd,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACjD,OAAO,GAAG,CAAC;IACb,CAAC;IAEQ,WAAW,CAAC,GAAM,EAAE,KAAS,EAAE,QAAmB,OAAO,EAAE,KAAc;QAChF,OAAO,IAAI,eAAe,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAA0B,CAAC;IAC9G,CAAC;IAED;;;;OAIG;IAEM,MAAM,CACb,cAAoG;QAEpG,OAAO,cAAc,YAAY,eAAe,CAAC;IACnD,CAAC;IAED;;;;;;;OAOG;IACM,GAAG,CACV,cAAoG,EACpG,KAAS,EACT,KAAK,GAAG,CAAC;QAET,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,GAAG,IAAI,CAAC,kCAAkC,CAAC,cAAc,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAClG,MAAM,QAAQ,GAAG,OAAO,EAAE,KAAK,IAAI,CAAC,CAAC;QACrC,MAAM,cAAc,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;QACpD,IAAI,cAAc,EAAE,CAAC;YACnB,IAAI,CAAC,MAAM,IAAI,QAAQ,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACM,MAAM,CACb,cAAoG,EACpG,WAAW,GAAG,KAAK;QAEnB,IAAI,cAAc,KAAK,IAAI;YAAE,OAAO,EAAE,CAAC;QAEvC,MAAM,OAAO,GAAoD,EAAE,CAAC;QAEpE,IAAI,YAA4C,CAAC;QACjD,IAAI,IAAI,CAAC,YAAY,CAAC,cAAc,CAAC;YAAE,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;;YAC9E,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;QACpG,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO,OAAO,CAAC;QACjB,CAAC;QAED,IAAI,aAAa,GAAG,YAAY,CAAC,KAAK,CAAC;QACvC,IAAI,eAAkD,CAAC;QAEvD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,IAAI,YAAY,CAAC,KAAK,KAAK,IAAI;gBAAE,eAAe,GAAG,YAAY,CAAC,KAAK,CAAC;YACtE,IAAI,WAAW,IAAI,YAAY,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;gBAC3C,IAAI,YAAY,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;oBAChC,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;oBACnD,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC;gBACpC,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,KAAK,EAAE,CAAC;gBACrB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC;gBACjE,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,eAAe,GAAG,YAAY,CAAC,IAAI,CAAC;YACpC,IAAI,WAAW,IAAI,YAAY,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;gBAC3C,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;gBAClD,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC;YACpC,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,KAAK,EAAE,CAAC;gBACrB,IAAI,CAAC,MAAM,EAAE,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC;gBACjE,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC;YACrE,IAAI,SAAS,EAAE,CAAC;gBACd,aAAa,GAAG,SAAS,CAAC,KAAK,CAAC;gBAChC,IAAI,SAAS,CAAC,KAAK,KAAK,IAAI;oBAAE,eAAe,GAAG,SAAS,CAAC,KAAK,CAAC;gBAChE,IAAI,SAAS,CAAC,MAAM,KAAK,YAAY,EAAE,CAAC;oBACtC,IAAI,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,EAAE,CAAC;wBACrC,eAAe,CAAC,MAAM,GAAG,SAAS,CAAC;oBACrC,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,IAAI,WAAW,IAAI,YAAY,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;wBAC3C,IAAI,SAAS,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;4BAC7B,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,CAAC,CAAC;4BAC7C,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC;wBACpC,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,YAAY,CAAC,KAAK,EAAE,CAAC;wBACrB,IAAI,CAAC,MAAM,EAAE,CAAC;wBACd,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC;wBACjE,OAAO,OAAO,CAAC;oBACjB,CAAC;oBACD,SAAS,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC;oBACrC,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;wBACrC,SAAS,CAAC,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC;oBACrC,CAAC;gBACH,CAAC;gBACD,IAAI,WAAW,IAAI,YAAY,CAAC,KAAK,IAAI,CAAC,EAAE,CAAC;oBAC3C,IAAI,CAAC,WAAW,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;oBAC1C,IAAI,CAAC,MAAM,IAAI,YAAY,CAAC,KAAK,CAAC;gBACpC,CAAC;qBAAM,CAAC;oBACN,YAAY,CAAC,KAAK,EAAE,CAAC;oBACrB,IAAI,CAAC,MAAM,EAAE,CAAC;oBACd,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC;oBACjE,OAAO,OAAO,CAAC;gBACjB,CAAC;gBACD,SAAS,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC;gBACnC,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;oBACpC,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACpC,CAAC;gBACD,SAAS,CAAC,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC;YACvC,CAAC;QACH,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,aAAa,KAAK,OAAO,EAAE,CAAC;YAC9B,IAAI,CAAC,YAAY,CAAC,eAAe,CAAC,CAAC;QACrC,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,EAAE,CAAC,CAAC;QAEjE,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACM,KAAK;QACZ,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAClB,CAAC;IAED;;;;;OAKG;IACM,gBAAgB,CAAC,gBAA+B,IAAI,CAAC,aAAa;QACzE,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;QAC7E,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QAExB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,EAAE,IAAI,KAAK;YAAE,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAEnD,IAAI,CAAC,WAAW,EAAE,CAAC;QAEnB,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,MAA8B,EAAqC,EAAE;YACxG,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,SAAS,CAAC;YAC5B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAA2B,CAAC;YAChD,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,UAAU,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;YACzC,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;YACtB,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC;YACxB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;YACrB,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;;OAUG;IACM,GAAG,CACV,QAAmD,EACnD,OAAgD,EAChD,OAAiB;QAEjB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAa,EAAE,EAAE,OAAO,CAAC,CAAC;QAEtD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,IAAI,EAAE,CAAC;YAChC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;OAIG;IACM,KAAK;QACZ,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,EAAW,CAAC;QAC5C,IAAI,CAAC,MAAM,CAAC,GAAqB,CAAC,CAAC;QAClC,GAAW,CAAC,MAAM,GAAI,IAAY,CAAC,MAAM,CAAC;QAC3C,OAAO,GAAsB,CAAC;IAChC,CAAC;IAED;;;;;;;;OAQG;IACgB,eAAe,CAChC,OAAyC;QAEzC,MAAM,IAAI,GAAG,IAAI,CAAC,WAGT,CAAC;QACV,OAAO,IAAI,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,gBAAgB,EAAc,EAAE,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,CAAoB,CAAC;IACzG,CAAC;IAED;;;;;;;;;OASG;IACgB,WAAW,CAC5B,OAAyG,EAAE,EAC3G,OAAyC;QAEzC,MAAM,IAAI,GAAG,IAAI,CAAC,WAGU,CAAC;QAC7B,OAAO,IAAI,IAAI,CAAC,IAAqC,EAAE;YACrD,GAAG,IAAI,CAAC,gBAAgB,EAAc;YACtC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC;SACnB,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;OAOG;IACgB,kCAAkC,CACnD,cAAoG,EACpG,KAAS,EACT,KAAK,GAAG,CAAC;QAET,IAAI,cAAc,KAAK,SAAS,IAAI,cAAc,KAAK,IAAI;YAAE,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAE3F,IAAI,IAAI,CAAC,MAAM,CAAC,cAAc,CAAC;YAAE,OAAO,CAAC,cAAc,EAAE,KAAK,CAAC,CAAC;QAEhE,IAAI,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,EAAE,CAAC;YACjC,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,GAAG,cAAc,CAAC;YACzC,IAAI,GAAG,KAAK,SAAS,IAAI,GAAG,KAAK,IAAI;gBAAE,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACrE,MAAM,UAAU,GAAG,KAAK,IAAI,UAAU,CAAC;YACvC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,UAAU,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,UAAU,CAAC,CAAC;QACzE,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAC;IAC1E,CAAC;IAED;;;;;;OAMG;IACgB,eAAe,CAChC,OAAmD,EACnD,QAAoD;QAEpD,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACnC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,QAAQ,CAAC;YAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAC5D,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC;gBAEvB,QAAQ,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,UAAU;oBAAE,QAAQ,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;gBACrD,QAAQ,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;gBAC/B,QAAQ,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;gBAE/B,OAAO,CAAC,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC;gBAC3B,IAAI,CAAC,IAAI,CAAC,UAAU;oBAAE,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;gBACrD,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;gBAC/B,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC;YACjC,CAAC;YAED,OAAO,QAAQ,CAAC;QAClB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;OAMG;IAEgB,YAAY,CAC7B,OAA8B,EAC9B,OAA8B;QAE9B,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9C,OAAO,KAAK,CAAC,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;CACF"}