data-structure-typed 1.21.3 → 1.31.0

package/dist/data-structures/priority-queue/priority-queue.js

@@ -1,93 +1,94 @@
 "use strict";
+var __assign = (this && this.__assign) || function () {
+    __assign = Object.assign || function(t) {
+        for (var s, i = 1, n = arguments.length; i < n; i++) {
+            s = arguments[i];
+            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
+                t[p] = s[p];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.PriorityQueue = void 0;
-class PriorityQueue {
-    /**
-     * The constructor initializes a priority queue with the given options, including an array of nodes and a comparator
-     * function.
-     * @param options - The `options` parameter is an object that contains the following properties:
-     */
-    constructor(options) {
+var PriorityQueue = (function () {
+    function PriorityQueue(options) {
         this._nodes = [];
-        this._comparator = (a, b) => {
-            const aKey = a, bKey = b;
+        this._comparator = function (a, b) {
+            var aKey = a, bKey = b;
             return aKey - bKey;
         };
-        const { nodes, comparator, isFix = true } = options;
+        var nodes = options.nodes, comparator = options.comparator, _a = options.isFix, isFix = _a === void 0 ? true : _a;
         this._comparator = comparator;
         if (nodes && Array.isArray(nodes) && nodes.length > 0) {
-            // TODO support distinct
-            this._nodes = [...nodes];
+            this._nodes = __spreadArray([], __read(nodes), false);
             isFix && this._fix();
         }
     }
-    get nodes() {
-        return this._nodes;
-    }
-    get size() {
-        return this.nodes.length;
-    }
-    /**
-     * The `heapify` function creates a new PriorityQueue instance and fixes the heap property.
-     * @param options - The "options" parameter is an object that contains the configuration options for the PriorityQueue.
-     * It can include properties such as "comparator" which specifies the comparison function used to order the elements in
-     * the priority queue, and "initialValues" which is an array of initial values to be added to the priority
-     * @returns a new instance of the PriorityQueue class after performing the heapify operation on it.
-     */
-    static heapify(options) {
-        const heap = new PriorityQueue(options);
+    Object.defineProperty(PriorityQueue.prototype, "nodes", {
+        get: function () {
+            return this._nodes;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(PriorityQueue.prototype, "size", {
+        get: function () {
+            return this.nodes.length;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    PriorityQueue.heapify = function (options) {
+        var heap = new PriorityQueue(options);
         heap._fix();
         return heap;
-    }
-    /**
-     * The function checks if a priority queue is valid by creating a new priority queue with a fix option and then calling
-     * the isValid method.
-     * @param options - An object containing options for creating a priority queue. The options object should have the
-     * following properties:
-     * @returns the result of calling the `isValid()` method on a new instance of the `PriorityQueue` class.
-     */
-    static isPriorityQueueified(options) {
-        return new PriorityQueue(Object.assign(Object.assign({}, options), { isFix: false })).isValid();
-    }
-    /**
-     * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
-     */
-    getNodes() {
+    };
+    PriorityQueue.isPriorityQueueified = function (options) {
+        return new PriorityQueue(__assign(__assign({}, options), { isFix: false })).isValid();
+    };
+    PriorityQueue.prototype.getNodes = function () {
         return this._nodes;
-    }
-    /**
-     * The "add" function adds a node to the heap and ensures that the heap property is maintained.
-     * @param {T} node - The parameter "node" is of type T, which means it can be any data type. It represents the node
-     * that needs to be added to the heap.
-     */
-    add(node) {
+    };
+    PriorityQueue.prototype.add = function (node) {
         this.nodes.push(node);
         this._heapifyUp(this.size - 1);
-    }
-    /**
-     * The "has" function checks if a given node is present in the list of nodes.
-     * @param {T} node - The parameter `node` is of type `T`, which means it can be any type. It represents the node that
-     * we want to check if it exists in the `nodes` array.
-     * @returns a boolean value indicating whether the given node is included in the array of nodes.
-     */
-    has(node) {
+    };
+    PriorityQueue.prototype.has = function (node) {
         return this.nodes.includes(node);
-    }
-    /**
-     * The `peek` function returns the first element of the `nodes` array if it exists, otherwise it returns `null`.
-     * @returns The `peek()` function is returning the first element (`T`) of the `nodes` array if the `size` is not zero.
-     * Otherwise, it returns `null`.
-     */
-    peek() {
+    };
+    PriorityQueue.prototype.peek = function () {
         return this.size ? this.nodes[0] : null;
-    }
-    /**
-     * The `poll` function removes and returns the top element from a heap data structure.
-     * @returns The `poll()` method returns a value of type `T` or `null`.
-     */
-    poll() {
+    };
+    PriorityQueue.prototype.poll = function () {
         var _a, _b;
-        let res = null;
+        var res = null;
         if (this.size > 1) {
             this._swap(0, this.nodes.length - 1);
             res = (_a = this.nodes.pop()) !== null && _a !== void 0 ? _a : null;
@@ -97,56 +98,30 @@ class PriorityQueue {
             res = (_b = this.nodes.pop()) !== null && _b !== void 0 ? _b : null;
         }
         return res;
-    }
-    /**
-     * The `leaf` function returns the last element in the `nodes` array or `null` if the array is empty.
-     * @returns The method `leaf()` is returning the last element (`T`) in the `nodes` array if it exists. If the array is
-     * empty or the last element is `null`, then it returns `null`.
-     */
-    leaf() {
+    };
+    PriorityQueue.prototype.leaf = function () {
         var _a;
         return (_a = this.nodes[this.size - 1]) !== null && _a !== void 0 ? _a : null;
-    }
-    /**
-     * The function checks if the size of an object is equal to zero and returns a boolean value indicating whether the
-     * object is empty or not.
-     * @returns The method `isEmpty()` is returning a boolean value indicating whether the size of the object is equal to
-     * 0.
-     */
-    isEmpty() {
+    };
+    PriorityQueue.prototype.isEmpty = function () {
         return this.size === 0;
-    }
-    /**
-     * The clear function clears the nodes array.
-     */
-    clear() {
+    };
+    PriorityQueue.prototype.clear = function () {
         this._setNodes([]);
-    }
-    /**
-     * The toArray function returns an array containing all the elements in the nodes property.
-     * @returns An array of type T, which is the elements of the nodes property.
-     */
-    toArray() {
-        return [...this.nodes];
-    }
-    /**
-     * The `clone` function returns a new instance of the `PriorityQueue` class with the same nodes and comparator as the
-     * original instance.
-     * @returns The `clone()` method is returning a new instance of the `PriorityQueue` class with the same `nodes` and
-     * `comparator` properties as the original instance.
-     */
-    clone() {
-        return new PriorityQueue({ nodes: this.nodes, comparator: this._comparator });
-    }
-    // --- start additional methods ---
-    /**
-     * The `isValid` function recursively checks if a binary tree satisfies a certain condition.
-     * @returns The function `isValid()` returns a boolean value.
-     */
-    isValid() {
-        for (let i = 0; i < this.nodes.length; i++) {
-            const leftChildIndex = this._getLeft(i);
-            const rightChildIndex = this._getRight(i);
+    };
+    PriorityQueue.prototype.toArray = function () {
+        return __spreadArray([], __read(this.nodes), false);
+    };
+    PriorityQueue.prototype.clone = function () {
+        return new PriorityQueue({
+            nodes: this.nodes,
+            comparator: this._comparator
+        });
+    };
+    PriorityQueue.prototype.isValid = function () {
+        for (var i = 0; i < this.nodes.length; i++) {
+            var leftChildIndex = this._getLeft(i);
+            var rightChildIndex = this._getRight(i);
             if (this._isValidIndex(leftChildIndex) && !this._compare(leftChildIndex, i)) {
                 return false;
             }
@@ -155,124 +130,70 @@ class PriorityQueue {
             }
         }
         return true;
-    }
-    /**
-     * O(n log n), In scenarios with smaller data sizes, heap sort is generally expected to be slower than QuickSort or MergeSort.
-     */
-    /**
-     * The function sorts the elements in a data structure and returns them in an array.
-     * Plan to support sorting of duplicate elements.
-     * @returns The `sort()` method is returning an array of type `T[]`.
-     */
-    sort() {
-        const visitedNode = [];
+    };
+    PriorityQueue.prototype.sort = function () {
+        var visitedNode = [];
         while (this.size !== 0) {
-            const top = this.poll();
-            if (top)
-                visitedNode.push(top);
+            var top_1 = this.poll();
+            if (top_1)
+                visitedNode.push(top_1);
         }
         return visitedNode;
-    }
-    /**
-     * The DFS function performs a depth-first search traversal on a binary tree and returns an array of visited nodes
-     * based on the specified traversal order.
-     * @param {PriorityQueueDFSOrderPattern} dfsMode - The dfsMode parameter is a string that specifies the order in which
-     * the nodes should be visited during the Depth-First Search (DFS) traversal. It can have one of the following values:
-     * @returns an array of type `(T | null)[]`.
-     */
-    DFS(dfsMode) {
-        const visitedNode = [];
-        const traverse = (cur) => {
+    };
+    PriorityQueue.prototype.DFS = function (dfsMode) {
+        var _this = this;
+        var visitedNode = [];
+        var traverse = function (cur) {
             var _a, _b, _c;
-            const leftChildIndex = this._getLeft(cur);
-            const rightChildIndex = this._getRight(cur);
+            var leftChildIndex = _this._getLeft(cur);
+            var rightChildIndex = _this._getRight(cur);
             switch (dfsMode) {
                 case 'in':
-                    this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
-                    visitedNode.push((_a = this.nodes[cur]) !== null && _a !== void 0 ? _a : null);
-                    this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
+                    _this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
+                    visitedNode.push((_a = _this.nodes[cur]) !== null && _a !== void 0 ? _a : null);
+                    _this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
                     break;
                 case 'pre':
-                    visitedNode.push((_b = this.nodes[cur]) !== null && _b !== void 0 ? _b : null);
-                    this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
-                    this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
+                    visitedNode.push((_b = _this.nodes[cur]) !== null && _b !== void 0 ? _b : null);
+                    _this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
+                    _this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
                     break;
                 case 'post':
-                    this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
-                    this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
-                    visitedNode.push((_c = this.nodes[cur]) !== null && _c !== void 0 ? _c : null);
+                    _this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
+                    _this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
+                    visitedNode.push((_c = _this.nodes[cur]) !== null && _c !== void 0 ? _c : null);
                     break;
             }
         };
         this._isValidIndex(0) && traverse(0);
         return visitedNode;
-    }
-    _setNodes(value) {
+    };
+    PriorityQueue.prototype._setNodes = function (value) {
         this._nodes = value;
-    }
-    /**
-     * The function compares two numbers using a custom comparator function.
-     * @param {number} a - The parameter "a" is a number that represents the index of a node in an array.
-     * @param {number} b - The parameter "b" is a number.
-     * @returns the result of the comparison between the elements at indices `a` and `b` in the `nodes` array. The
-     * comparison is done using the `_comparator` function, and if the result is greater than 0, `true` is returned,
-     * indicating that the element at index `a` is greater than the element at index `b`.
-     */
-    _compare(a, b) {
+    };
+    PriorityQueue.prototype._compare = function (a, b) {
         return this._comparator(this.nodes[a], this.nodes[b]) > 0;
-    }
-    /**
-     * The function swaps two elements in an array.
-     * @param {number} a - The parameter "a" is a number that represents the index of an element in an array.
-     * @param {number} b - The parameter "b" is a number.
-     */
-    _swap(a, b) {
-        const temp = this.nodes[a];
+    };
+    PriorityQueue.prototype._swap = function (a, b) {
+        var temp = this.nodes[a];
         this.nodes[a] = this.nodes[b];
         this.nodes[b] = temp;
-    }
-    /**
-     * The function checks if a given index is valid within an array.
-     * @param {number} index - The parameter "index" is of type number and represents the index value that needs to be
-     * checked for validity.
-     * @returns A boolean value indicating whether the given index is valid or not.
-     */
-    _isValidIndex(index) {
+    };
+    PriorityQueue.prototype._isValidIndex = function (index) {
         return index > -1 && index < this.nodes.length;
-    }
-    /**
-     * The function returns the index of the parent node given the index of a child node in a binary tree.
-     * @param {number} child - The "child" parameter is a number representing the index of a child node in a binary tree.
-     * @returns the parent of the given child node.
-     */
-    _getParent(child) {
+    };
+    PriorityQueue.prototype._getParent = function (child) {
         return Math.floor((child - 1) / 2);
-    }
-    /**
-     * The function returns the index of the left child node in a binary tree given the index of its parent node.
-     * @param {number} parent - The parameter "parent" is a number that represents the index of a node in a binary tree.
-     * @returns the left child of a given parent node in a binary tree.
-     */
-    _getLeft(parent) {
-        return (2 * parent) + 1;
-    }
-    /**
-     * The function returns the index of the right child node in a binary tree given the index of its parent node.
-     * @param {number} parent - The parameter "parent" is a number that represents the index of a node in a binary tree.
-     * @returns the right child of a given parent node in a binary tree.
-     */
-    _getRight(parent) {
-        return (2 * parent) + 2;
-    }
-    /**
-     * The function returns the index of the smallest child node of a given parent node.
-     * @param {number} parent - The parent parameter is a number that represents the index of the parent node in a binary
-     * tree.
-     * @returns the minimum value between the parent node and its left and right child nodes.
-     */
-    _getComparedChild(parent) {
-        let min = parent;
-        const left = this._getLeft(parent), right = this._getRight(parent);
+    };
+    PriorityQueue.prototype._getLeft = function (parent) {
+        return 2 * parent + 1;
+    };
+    PriorityQueue.prototype._getRight = function (parent) {
+        return 2 * parent + 2;
+    };
+    PriorityQueue.prototype._getComparedChild = function (parent) {
+        var min = parent;
+        var left = this._getLeft(parent), right = this._getRight(parent);
         if (left < this.size && this._compare(min, left)) {
             min = left;
         }
@@ -280,39 +201,27 @@ class PriorityQueue {
             min = right;
         }
         return min;
-    }
-    /**
-     * The function `_heapifyUp` is used to maintain the heap property by moving an element up the heap until it is in the
-     * correct position.
-     * @param {number} start - The start parameter is the index of the element that needs to be moved up in the heap.
-     */
-    _heapifyUp(start) {
+    };
+    PriorityQueue.prototype._heapifyUp = function (start) {
         while (start > 0 && this._compare(this._getParent(start), start)) {
-            const parent = this._getParent(start);
-            this._swap(start, parent);
-            start = parent;
+            var parent_1 = this._getParent(start);
+            this._swap(start, parent_1);
+            start = parent_1;
         }
-    }
-    /**
-     * The function performs a heapify operation by comparing and swapping elements in a binary heap.
-     * @param {number} start - The start parameter is the index of the element in the heap from where the heapifyDown
-     * operation should start.
-     */
-    _heapifyDown(start) {
-        let min = this._getComparedChild(start);
+    };
+    PriorityQueue.prototype._heapifyDown = function (start) {
+        var min = this._getComparedChild(start);
         while (this._compare(start, min)) {
             this._swap(min, start);
             start = min;
             min = this._getComparedChild(start);
         }
-    }
-    /**
-     * The _fix function performs a heapify operation on the elements of the heap starting from the middle and moving
-     * towards the root.
-     */
-    _fix() {
-        for (let i = Math.floor(this.size / 2); i > -1; i--)
+    };
+    PriorityQueue.prototype._fix = function () {
+        for (var i = Math.floor(this.size / 2); i > -1; i--)
             this._heapifyDown(i);
-    }
-}
+    };
+    return PriorityQueue;
+}());
 exports.PriorityQueue = PriorityQueue;
+//# sourceMappingURL=priority-queue.js.map

package/dist/data-structures/priority-queue/priority-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../../src/data-structures/priority-queue/priority-queue.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AASA;IAME,uBAAY,OAAgC;QAWlC,WAAM,GAAQ,EAAE,CAAC;QAkNR,gBAAW,GAA+B,UAAC,CAAI,EAAE,CAAI;YACtE,IAAM,IAAI,GAAG,CAAsB,EACjC,IAAI,GAAG,CAAsB,CAAC;YAChC,OAAO,IAAI,GAAG,IAAI,CAAC;QACrB,CAAC,CAAC;QAhOQ,IAAA,KAAK,GAA+B,OAAO,MAAtC,EAAE,UAAU,GAAmB,OAAO,WAA1B,EAAE,KAAiB,OAAO,MAAZ,EAAZ,KAAK,mBAAG,IAAI,KAAA,CAAa;QACpD,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAE9B,IAAI,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;YAErD,IAAI,CAAC,MAAM,4BAAO,KAAK,SAAC,CAAC;YACzB,KAAK,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;SACtB;IACH,CAAC;IAID,sBAAI,gCAAK;aAAT;YACE,OAAO,IAAI,CAAC,MAAM,CAAC;QACrB,CAAC;;;OAAA;IAED,sBAAI,+BAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;QAC3B,CAAC;;;OAAA;IASM,qBAAO,GAAd,UAAkB,OAAgC;QAChD,IAAM,IAAI,GAAG,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,IAAI,CAAC;IACd,CAAC;IASM,kCAAoB,GAA3B,UAA+B,OAA+C;QAC5E,OAAO,IAAI,aAAa,uBAAM,OAAO,KAAE,KAAK,EAAE,KAAK,IAAG,CAAC,OAAO,EAAE,CAAC;IACnE,CAAC;IAKD,gCAAQ,GAAR;QACE,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAOD,2BAAG,GAAH,UAAI,IAAO;QACT,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;IACjC,CAAC;IAQD,2BAAG,GAAH,UAAI,IAAO;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC;IAOD,4BAAI,GAAJ;QACE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1C,CAAC;IAMD,4BAAI,GAAJ;;QACE,IAAI,GAAG,GAAa,IAAI,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE;YACjB,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACrC,GAAG,GAAG,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;SACtB;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;YAC1B,GAAG,GAAG,MAAA,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC;SAChC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAOD,4BAAI,GAAJ;;QACE,OAAO,MAAA,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,mCAAI,IAAI,CAAC;IAC3C,CAAC;IAQD,+BAAO,GAAP;QACE,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC;IACzB,CAAC;IAKD,6BAAK,GAAL;QACE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;IACrB,CAAC;IAMD,+BAAO,GAAP;QACE,gCAAW,IAAI,CAAC,KAAK,UAAE;IACzB,CAAC;IAQD,6BAAK,GAAL;QACE,OAAO,IAAI,aAAa,CAAI;YAC1B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,UAAU,EAAE,IAAI,CAAC,WAAW;SAC7B,CAAC,CAAC;IACL,CAAC;IAOD,+BAAO,GAAP;QACE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC1C,IAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACxC,IAAM,eAAe,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;YAC1C,IAAI,IAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,EAAE;gBAC3E,OAAO,KAAK,CAAC;aACd;YACD,IAAI,IAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,eAAe,EAAE,CAAC,CAAC,EAAE;gBAC7E,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAWD,4BAAI,GAAJ;QACE,IAAM,WAAW,GAAQ,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,IAAI,KAAK,CAAC,EAAE;YACtB,IAAM,KAAG,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACxB,IAAI,KAAG;gBAAE,WAAW,CAAC,IAAI,CAAC,KAAG,CAAC,CAAC;SAChC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IASD,2BAAG,GAAH,UAAI,OAAqC;QAAzC,iBA2BC;QA1BC,IAAM,WAAW,GAAiB,EAAE,CAAC;QAErC,IAAM,QAAQ,GAAG,UAAC,GAAW;;YAC3B,IAAM,cAAc,GAAG,KAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC1C,IAAM,eAAe,GAAG,KAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YAC5C,QAAQ,OAAO,EAAE;gBACf,KAAK,IAAI;oBACP,KAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC;oBAC/D,WAAW,CAAC,IAAI,CAAC,MAAA,KAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mCAAI,IAAI,CAAC,CAAC;oBAC1C,KAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC;oBACjE,MAAM;gBACR,KAAK,KAAK;oBACR,WAAW,CAAC,IAAI,CAAC,MAAA,KAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mCAAI,IAAI,CAAC,CAAC;oBAC1C,KAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC;oBAC/D,KAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC;oBACjE,MAAM;gBACR,KAAK,MAAM;oBACT,KAAI,CAAC,aAAa,CAAC,cAAc,CAAC,IAAI,QAAQ,CAAC,cAAc,CAAC,CAAC;oBAC/D,KAAI,CAAC,aAAa,CAAC,eAAe,CAAC,IAAI,QAAQ,CAAC,eAAe,CAAC,CAAC;oBACjE,WAAW,CAAC,IAAI,CAAC,MAAA,KAAI,CAAC,KAAK,CAAC,GAAG,CAAC,mCAAI,IAAI,CAAC,CAAC;oBAC1C,MAAM;aACT;QACH,CAAC,CAAC;QAEF,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;QACrC,OAAO,WAAW,CAAC;IACrB,CAAC;IAES,iCAAS,GAAnB,UAAoB,KAAU;QAC5B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAgBS,gCAAQ,GAAlB,UAAmB,CAAS,EAAE,CAAS;QACrC,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAC5D,CAAC;IAOS,6BAAK,GAAf,UAAgB,CAAS,EAAE,CAAS;QAClC,IAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACvB,CAAC;IAQS,qCAAa,GAAvB,UAAwB,KAAa;QACnC,OAAO,KAAK,GAAG,CAAC,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IACjD,CAAC;IAOS,kCAAU,GAApB,UAAqB,KAAa;QAChC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACrC,CAAC;IAOS,gCAAQ,GAAlB,UAAmB,MAAc;QAC/B,OAAO,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAOS,iCAAS,GAAnB,UAAoB,MAAc;QAChC,OAAO,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC;IACxB,CAAC;IAQS,yCAAiB,GAA3B,UAA4B,MAAc;QACxC,IAAI,GAAG,GAAG,MAAM,CAAC;QACjB,IAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,EAChC,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAEjC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;YAChD,GAAG,GAAG,IAAI,CAAC;SACZ;QACD,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,EAAE;YAClD,GAAG,GAAG,KAAK,CAAC;SACb;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAOS,kCAAU,GAApB,UAAqB,KAAa;QAChC,OAAO,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE;YAChE,IAAM,QAAM,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,QAAM,CAAC,CAAC;YAC1B,KAAK,GAAG,QAAM,CAAC;SAChB;IACH,CAAC;IAOS,oCAAY,GAAtB,UAAuB,KAAa;QAClC,IAAI,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE;YAChC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACvB,KAAK,GAAG,GAAG,CAAC;YACZ,GAAG,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;SACrC;IACH,CAAC;IAMS,4BAAI,GAAd;QACE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAGH,oBAAC;AAAD,CAAC,AA7VD,IA6VC;AA7VY,sCAAa"}