npm - data-structure-typed - Versions diffs - 1.21.0 → 1.21.2 - Mend

data-structure-typed 1.21.0 → 1.21.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (6) hide show

package/README.md +78 -75
package/dist/bundle.js +2 -0
package/dist/bundle.js.LICENSE.txt +13 -0
package/package.json +27 -22
package/tsconfig.json +6 -6
package/webpack.config.js +27 -0

package/README.md CHANGED Viewed

@@ -11,17 +11,45 @@ DFS, DFSIterative, BFS, morris, Bellman-Ford Algorithm, Dijkstra's Algorithm, Fl
 By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultiset), you can seamlessly inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the optimal approach to data structure design.
 # How
+## install
 ### npm
 ```bash
 npm install data-structure-typed
 ```
-## install
 ### yarn
 ```bash
 yarn add data-structure-typed
 ```
+### cdn
+```html
+<script src="https://cdn.jsdelivr.net/npm/data-structure-typed/dist/bundle.js"></script>
+```
+```javascript
+const {AVLTree, AVLTreeNode, BST, Trie, DirectedGraph, DirectedVertex, TreeMultiset} = dataStructureTyped;
+const {MinHeap, SinglyLinkedList, DirectedVertex, Stack} = dataStructureTyped;
+```
+![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/dfs-pre-order.webp?raw=true)
+![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/test-avl-tree.webp?raw=true)
+![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/map-graph.webp?raw=true)
+![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/test-graphs.webp?raw=true)
+![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/cut-off-trees-for-golf.webp?raw=true)
+![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/parenthesis-check.webp?raw=true)
+## API docs & Examples
+[API Docs](https://data-structure-typed-docs.vercel.app)
+[Live Examples](https://data-structure-typed-examples.vercel.app)
+[//]: # (<a href="https://data-structure-typed-examples.vercel.app" target="_blank">Live Examples</a>)
+<a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a>
 ### Binary Search Tree (BST) snippet
@@ -163,7 +191,6 @@ import {UndirectedGraph} from 'data-structure-typed';
     Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D']
 ```
 ## Data Structures
 <table>
 <thead>
 <tr>
@@ -355,30 +382,52 @@ import {UndirectedGraph} from 'data-structure-typed';
 </tbody>
 </table>
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/dfs-pre-order.webp?raw=true)
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/map-graph.webp?raw=true)
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/test-graphs.webp?raw=true)
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/cut-off-trees-for-golf.webp?raw=true)
-![](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/examples/parenthesis-check.webp?raw=true)
-## API docs & Examples
-[API Docs](https://data-structure-typed-docs.vercel.app)
-[Live Examples](https://data-structure-typed-examples.vercel.app)
-<a href="https://data-structure-typed-examples.vercel.app" target="_blank">Live Examples</a>
-[//]: # ([Examples Repository]&#40;https://github.com/zrwusa/data-structure-typed-examples&#41;)
-<a href="https://github.com/zrwusa/data-structure-typed-examples" target="_blank">Examples Repository</a>
+## API docs
+<ul>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTree.html" rel="nofollow"><span>AVLTree</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/AVLTreeNode.html" rel="nofollow"><span>AVLTreeNode</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractEdge.html" rel="nofollow"><span>AbstractEdge</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractGraph.html" rel="nofollow"><span>AbstractGraph</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/AbstractVertex.html" rel="nofollow"><span>AbstractVertex</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/ArrayDeque.html" rel="nofollow"><span>ArrayDeque</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/BST.html" rel="nofollow"><span>BST</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/BSTNode.html" rel="nofollow"><span>BSTNode</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryIndexedTree.html" rel="nofollow"><span>BinaryIndexedTree</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTree.html" rel="nofollow"><span>BinaryTree</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/BinaryTreeNode.html" rel="nofollow"><span>BinaryTreeNode</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Character.html" rel="nofollow"><span>Character</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateMap.html" rel="nofollow"><span>CoordinateMap</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/CoordinateSet.html" rel="nofollow"><span>CoordinateSet</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Deque.html" rel="nofollow"><span>Deque</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedEdge.html" rel="nofollow"><span>DirectedEdge</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedGraph.html" rel="nofollow"><span>DirectedGraph</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/DirectedVertex.html" rel="nofollow"><span>DirectedVertex</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedList.html" rel="nofollow"><span>DoublyLinkedList</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/DoublyLinkedListNode.html" rel="nofollow"><span>DoublyLinkedListNode</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Heap.html" rel="nofollow"><span>Heap</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Matrix2D.html" rel="nofollow"><span>Matrix2D</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/MatrixNTI2D.html" rel="nofollow"><span>MatrixNTI2D</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/MaxHeap.html" rel="nofollow"><span>MaxHeap</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/MaxPriorityQueue.html" rel="nofollow"><span>MaxPriorityQueue</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/MinHeap.html" rel="nofollow"><span>MinHeap</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/MinPriorityQueue.html" rel="nofollow"><span>MinPriorityQueue</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Navigator.html" rel="nofollow"><span>Navigator</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/ObjectDeque.html" rel="nofollow"><span>ObjectDeque</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/PriorityQueue.html" rel="nofollow"><span>PriorityQueue</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Queue.html" rel="nofollow"><span>Queue</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTree.html" rel="nofollow"><span>SegmentTree</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/SegmentTreeNode.html" rel="nofollow"><span>SegmentTreeNode</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedList.html" rel="nofollow"><span>SinglyLinkedList</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/SinglyLinkedListNode.html" rel="nofollow"><span>SinglyLinkedListNode</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Stack.html" rel="nofollow"><span>Stack</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/TreeMultiSet.html" rel="nofollow"><span>TreeMultiSet</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Trie.html" rel="nofollow"><span>Trie</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/TrieNode.html" rel="nofollow"><span>TrieNode</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedEdge.html" rel="nofollow"><span>UndirectedEdge</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedGraph.html" rel="nofollow"><span>UndirectedGraph</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/UndirectedVertex.html" rel="nofollow"><span>UndirectedVertex</span></a></li>
+<li><a href="https://data-structure-typed-docs.vercel.app/classes/Vector2D.html" rel="nofollow"><span>Vector2D</span></a></li>
+</ul>
 # Why
@@ -645,54 +694,8 @@ import {UndirectedGraph} from 'data-structure-typed';
 </tbody>
 </table>
-![overview diagram](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/overview-diagram-of-data-structures.png)
-![complexities](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/complexities-diff.jpg)
-![complexities of data structures](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/data-structure-complexities.jpg)
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/binary-tree/bst-rotation.gif&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/binary-tree/avl-tree-inserting.gif&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan.webp&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-list.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-list-pros-cons.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-matrix.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/adjacency-matrix-pros-cons.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/dfs-can-do.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/edge-list.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/edge-list-pros-cons.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/max-flow.jpg&#41;)
-[//]: # ()
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/mst.jpg&#41;)
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan-articulation-point-bridge.png&#41;)
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan-complicate-simple.png&#41;)
-[//]: # (![]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/graph/tarjan-strongly-connected-component.png&#41;)
+[//]: # (![overview diagram]&#40;https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/overview-diagram-of-data-structures.png?raw=true&#41;)
+![complexities](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/complexities-diff.jpg?raw=true)
+![complexities of data structures](https://github.com/zrwusa/assets/blob/master/images/data-structure-typed/assets/data-structure-complexities.jpg?raw=true)

package/dist/bundle.js ADDED Viewed

	@@ -0,0 +1,2 @@
1	+ /! For license information please see bundle.js.LICENSE.txt /
2	+ (()=>{"use strict";var e={1925:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.AaTree=void 0,t.AaTree=class{}},6279:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.AbstractBinaryTree=t.AbstractBinaryTreeNode=void 0;const r=s(5928),i=s(9011);class n{constructor(e,t){this._height=0,this._id=e,this._val=t}get id(){return this._id}set id(e){this._id=e}get val(){return this._val}set val(e){this._val=e}get left(){return this._left}set left(e){e&&(e.parent=this),this._left=e}get right(){return this._right}set right(e){e&&(e.parent=this),this._right=e}get parent(){return this._parent}set parent(e){this._parent=e}get height(){return this._height}set height(e){this._height=e}get familyPosition(){const e=this;return e.parent?e.parent.left===e?e.left\|\|e.right?i.FamilyPosition.ROOT_LEFT:i.FamilyPosition.LEFT:e.parent.right===e?e.left\|\|e.right?i.FamilyPosition.ROOT_RIGHT:i.FamilyPosition.RIGHT:i.FamilyPosition.MAL_NODE:e.left\|\|e.right?i.FamilyPosition.ROOT:i.FamilyPosition.ISOLATED}}t.AbstractBinaryTreeNode=n,t.AbstractBinaryTree=class{constructor(e){if(this._root=null,this._size=0,this._loopType=i.LoopType.ITERATIVE,this._visitedId=[],this._visitedVal=[],this._visitedNode=[],this._visitedLeftSum=[],void 0!==e){const{loopType:t=i.LoopType.ITERATIVE}=e;this._loopType=t}this.clear()}get root(){return this._root}get size(){return this._size}get loopType(){return this._loopType}get visitedId(){return this._visitedId}get visitedVal(){return this._visitedVal}get visitedNode(){return this._visitedNode}get visitedLeftSum(){return this._visitedLeftSum}swapLocation(e,t){const{id:s,val:r,height:i}=t,n=this.createNode(s,r);return n&&(n.height=i,t.id=e.id,t.val=e.val,t.height=e.height,e.id=n.id,e.val=n.val,e.height=n.height),t}clear(){this._root=null,this._size=0,this._clearResults()}isEmpty(){return 0===this.size}add(e,t){let s,r;if(null===e)r=null;else if("number"==typeof e)r=this.createNode(e,t);else{if(!(e instanceof n))return;r=e}const i=e?this.get(e,"id"):void 0;return this.root?i?(i.val=t,s=i):s=((e,t)=>{const s=[e];for(;s.length>0;){const e=s.shift();if(!e)return;{if(t&&e.id===t.id)return;const r=this._addTo(t,e);if(void 0!==r)return r;e.left&&s.push(e.left),e.right&&s.push(e.right)}}})(this.root,r):(this._setRoot(r),null!==r?this._setSize(1):this._setSize(0),s=this.root),s}addMany(e,t){var s;const r=[],i=new Map;for(const t of e)i.set(t,(null!==(s=i.get(t))&&void 0!==s?s:0)+1);for(let s=0;s<e.length;s++){const o=e[s];if(i.has(o)){if(o instanceof n){r.push(this.add(o.id,o.val));continue}if(null===o){r.push(this.add(null));continue}const e=null==t?void 0:t[s];r.push(this.add(o,e)),i.delete(o)}}return r}fill(e,t){return this.clear(),e.length===this.addMany(e,t).length}remove(e,t){const s=[];if(!this.root)return s;const r="number"==typeof e?this.get(e):e;if(!r)return s;const n=(null==r?void 0:r.parent)?r.parent:null;let o=null,a=r;if(r.left){const e=r.left?this.getRightMost(r.left):null;if(e){const t=e.parent;a=this.swapLocation(r,e),t&&(t.right===e?t.right=e.left:t.left=e.left,o=t)}}else if(n){const{familyPosition:e}=r;e===i.FamilyPosition.LEFT\|\|e===i.FamilyPosition.ROOT_LEFT?n.left=r.right:e!==i.FamilyPosition.RIGHT&&e!==i.FamilyPosition.ROOT_RIGHT\|\|(n.right=r.right),o=n}else void 0!==r.right&&this._setRoot(r.right);return this._setSize(this.size-1),s.push({deleted:a,needBalanced:o}),s}getDepth(e){"number"==typeof e&&(e=this.get(e,"id"));let t=0;for(;null==e?void 0:e.parent;)t++,e=e.parent;return t}getHeight(e){if("number"==typeof(e=null!=e?e:this.root)&&(e=this.get(e,"id")),!e)return-1;if(this._loopType===i.LoopType.RECURSIVE){const t=e=>{if(!e)return-1;const s=t(e.left),r=t(e.right);return Math.max(s,r)+1};return t(e)}{if(!e)return-1;const t=[{node:e,depth:0}];let s=0;for(;t.length>0;){const{node:e,depth:r}=t.pop();e.left&&t.push({node:e.left,depth:r+1}),e.right&&t.push({node:e.right,depth:r+1}),s=Math.max(s,r)}return s}}getMinHeight(e){var t,s,r;if(!(e=e\|\|this.root))return-1;if(this._loopType===i.LoopType.RECURSIVE){const t=e=>{if(!e)return 0;if(!e.left&&!e.right)return 0;const s=t(e.left),r=t(e.right);return Math.min(s,r)+1};return t(e)}{const i=[];let n=e,o=null;const a=new Map;for(;i.length>0\|\|n;)if(n)i.push(n),n=n.left;else if(n=i[i.length-1],n.right&&o!==n.right)n=n.right;else if(n=i.pop(),n){const e=n.left&&null!==(t=a.get(n.left))&&void 0!==t?t:-1,r=n.right&&null!==(s=a.get(n.right))&&void 0!==s?s:-1;a.set(n,1+Math.min(e,r)),o=n,n=null}return null!==(r=a.get(e))&&void 0!==r?r:-1}}isPerfectlyBalanced(e){return this.getMinHeight(e)+1>=this.getHeight(e)}getNodes(e,t,s){if(!this.root)return[];t=null!=t?t:"id";const r=[];if(this.loopType===i.LoopType.RECURSIVE){const i=n=>{this._pushByPropertyNameStopOrNot(n,r,e,t,s)\|\|(n.left\|\|n.right)&&(n.left&&i(n.left),n.right&&i(n.right))};i(this.root)}else{const i=[this.root];for(;i.length>0;){const n=i.shift();if(n){if(this._pushByPropertyNameStopOrNot(n,r,e,t,s))return r;n.left&&i.push(n.left),n.right&&i.push(n.right)}}}return r}has(e,t){return t=null!=t?t:"id",this.getNodes(e,t).length>0}get(e,t){var s;return t=null!=t?t:"id",null!==(s=this.getNodes(e,t,!0)[0])&&void 0!==s?s:null}getPathToRoot(e){const t=[];for(;e.parent;)t.unshift(e),e=e.parent;return t.unshift(e),t}getLeftMost(e){if("number"==typeof e&&(e=this.get(e,"id")),!(e=null!=e?e:this.root))return e;if(this._loopType===i.LoopType.RECURSIVE){const t=e=>e.left?t(e.left):e;return t(e)}{const t=(0,r.trampoline)((e=>e.left?t.cont(e.left):e));return t(e)}}getRightMost(e){if(!(e=null!=e?e:this.root))return e;if(this._loopType===i.LoopType.RECURSIVE){const t=e=>e.right?t(e.right):e;return t(e)}{const t=(0,r.trampoline)((e=>e.right?t.cont(e.right):e));return t(e)}}isSubtreeBST(e){if(!e)return!0;if(this._loopType===i.LoopType.RECURSIVE){const t=(e,s,r)=>!e\|\|!(e.id<=s\|\|e.id>=r)&&t(e.left,s,e.id)&&t(e.right,e.id,r);return t(e,Number.MIN_SAFE_INTEGER,Number.MAX_SAFE_INTEGER)}{const t=[];let s=Number.MIN_SAFE_INTEGER,r=e;for(;r\|\|t.length>0;){for(;r;)t.push(r),r=r.left;if(r=t.pop(),!r\|\|s>=r.id)return!1;s=r.id,r=r.right}return!0}}isBST(){return this.isSubtreeBST(this.root)}getSubTreeSize(e){let t=0;if(!e)return t;if(this._loopType===i.LoopType.RECURSIVE){const s=e=>{t++,e.left&&s(e.left),e.right&&s(e.right)};return s(e),t}{const s=[e];for(;s.length>0;){const e=s.pop();t++,e.right&&s.push(e.right),e.left&&s.push(e.left)}return t}}subTreeSum(e,t){if(t=null!=t?t:"id","number"==typeof e&&(e=this.get(e,"id")),!e)return 0;let s=0;const r=e=>{let s;switch(t){case"id":default:s=e.id;break;case"val":s="number"==typeof e.val?e.val:0}return s};if(this._loopType===i.LoopType.RECURSIVE){const t=e=>{s+=r(e),e.left&&t(e.left),e.right&&t(e.right)};t(e)}else{const t=[e];for(;t.length>0;){const e=t.pop();s+=r(e),e.right&&t.push(e.right),e.left&&t.push(e.left)}}return s}subTreeAdd(e,t,s){if(s=null!=s?s:"id","number"==typeof e&&(e=this.get(e,"id")),!e)return!1;const r=e=>{e.id+=t};if(this._loopType===i.LoopType.RECURSIVE){const t=e=>{r(e),e.left&&t(e.left),e.right&&t(e.right)};t(e)}else{const t=[e];for(;t.length>0;){const e=t.pop();r(e),e.right&&t.push(e.right),e.left&&t.push(e.left)}}return!0}BFS(e){e=null!=e?e:"id",this._clearResults();const t=[this.root];for(;0!==t.length;){const s=t.shift();s&&(this._accumulatedByPropertyName(s,e),null!==(null==s?void 0:s.left)&&t.push(s.left),null!==(null==s?void 0:s.right)&&t.push(s.right))}return this._getResultByPropertyName(e)}DFS(e,t){e=null!=e?e:"in",t=null!=t?t:"id",this._clearResults();const s=r=>{switch(e){case"in":r.left&&s(r.left),this._accumulatedByPropertyName(r,t),r.right&&s(r.right);break;case"pre":this._accumulatedByPropertyName(r,t),r.left&&s(r.left),r.right&&s(r.right);break;case"post":r.left&&s(r.left),r.right&&s(r.right),this._accumulatedByPropertyName(r,t)}};return this.root&&s(this.root),this._getResultByPropertyName(t)}DFSIterative(e,t){if(e=e\|\|"in",t=t\|\|"id",this._clearResults(),!this.root)return this._getResultByPropertyName(t);const s=[{opt:0,node:this.root}];for(;s.length>0;){const r=s.pop();if(r&&r.node)if(1===r.opt)this._accumulatedByPropertyName(r.node,t);else switch(e){case"in":default:s.push({opt:0,node:r.node.right}),s.push({opt:1,node:r.node}),s.push({opt:0,node:r.node.left});break;case"pre":s.push({opt:0,node:r.node.right}),s.push({opt:0,node:r.node.left}),s.push({opt:1,node:r.node});break;case"post":s.push({opt:1,node:r.node}),s.push({opt:0,node:r.node.right}),s.push({opt:0,node:r.node.left})}}return this._getResultByPropertyName(t)}levelIterative(e,t){if(t=t\|\|"id",!(e=e\|\|this.root))return[];this._clearResults();const s=[e];for(;s.length>0;){const e=s.shift();e&&(this._accumulatedByPropertyName(e,t),e.left&&s.push(e.left),e.right&&s.push(e.right))}return this._getResultByPropertyName(t)}listLevels(e,t){if(t=t\|\|"id",!(e=e\|\|this.root))return[];const s=[],r=(e,r)=>{switch(t){case"id":default:s[r].push(e.id);break;case"val":s[r].push(e.val);break;case"node":s[r].push(e)}};if(this.loopType===i.LoopType.RECURSIVE){const t=(e,i)=>{s[i]\|\|(s[i]=[]),r(e,i),e.left&&t(e.left,i+1),e.right&&t(e.right,i+1)};t(e,0)}else{const t=[[e,0]];for(;t.length>0;){const e=t.pop(),[i,n]=e;s[n]\|\|(s[n]=[]),r(i,n),i.right&&t.push([i.right,n+1]),i.left&&t.push([i.left,n+1])}}return s}getPredecessor(e){if(e.left){let t=e.left;for(;!t\|\|t.right&&t.right!==e;)t&&(t=t.right);return t}return e}morris(e,t){if(null===this.root)return[];e=e\|\|"in",t=t\|\|"id",this._clearResults();let s=this.root;const r=e=>{let t=null,s=null;for(;e;)s=e.right,e.right=t,t=e,e=s;return t},i=e=>{const s=r(e);let i=s;for(;i;)this._accumulatedByPropertyName(i,t),i=i.right;r(s)};switch(e){case"in":for(;s;){if(s.left){const e=this.getPredecessor(s);if(!e.right){e.right=s,s=s.left;continue}e.right=null}this._accumulatedByPropertyName(s,t),s=s.right}break;case"pre":for(;s;){if(s.left){const e=this.getPredecessor(s);if(!e.right){e.right=s,this._accumulatedByPropertyName(s,t),s=s.left;continue}e.right=null}else this._accumulatedByPropertyName(s,t);s=s.right}break;case"post":for(;s;){if(s.left){const e=this.getPredecessor(s);if(null===e.right){e.right=s,s=s.left;continue}e.right=null,i(s.left)}s=s.right}i(this.root)}return this._getResultByPropertyName(t)}_addTo(e,t){return t?void 0===t.left?(t.left=e,e&&this._setSize(this.size+1),t.left):void 0===t.right?(t.right=e,e&&this._setSize(this.size+1),t.right):void 0:void 0}_setLoopType(e){this._loopType=e}_setVisitedId(e){this._visitedId=e}_setVisitedVal(e){this._visitedVal=e}_setVisitedNode(e){this._visitedNode=e}_setVisitedLeftSum(e){this._visitedLeftSum=e}_setRoot(e){e&&(e.parent=void 0),this._root=e}_setSize(e){this._size=e}_clearResults(){this._visitedId=[],this._visitedVal=[],this._visitedNode=[],this._visitedLeftSum=[]}_pushByPropertyNameStopOrNot(e,t,s,r,i){switch(r){case"id":default:if(e.id===s)return t.push(e),!!i;break;case"val":if(e.val===s)return t.push(e),!!i}}_accumulatedByPropertyName(e,t){switch(t=null!=t?t:"id"){case"id":default:this._visitedId.push(e.id);break;case"val":this._visitedVal.push(e.val);break;case"node":this._visitedNode.push(e)}}_getResultByPropertyName(e){switch(e=null!=e?e:"id"){case"id":default:return this._visitedId;case"val":return this._visitedVal;case"node":return this._visitedNode}}}},9993:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.AVLTree=t.AVLTreeNode=void 0;const r=s(761);class i extends r.BSTNode{constructor(e,t){super(e,t)}}t.AVLTreeNode=i;class n extends r.BST{constructor(e){super(e)}createNode(e,t){return new i(e,t)}add(e,t){const s=super.add(e,t);return s&&this.balancePath(s),s}remove(e,t){const s=super.remove(e,t);for(const{needBalanced:e}of s)e&&this.balancePath(e);return s}balanceFactor(e){return e.right?e.left?e.right.height-e.left.height:+e.height:-e.height}updateHeight(e){if(e.left\|\|e.right)if(e.left)e.right?e.height=1+Math.max(e.right.height,e.left.height):e.height=1+e.left.height;else{const t=e.right?e.right.height:0;e.height=1+t}else e.height=0}balancePath(e){const t=this.getPathToRoot(e);for(let e=t.length-1;e>=0;e--){const s=t[e];switch(this.updateHeight(s),this.balanceFactor(s)){case-2:s&&s.left&&(this.balanceFactor(s.left)<=0?this.balanceLL(s):this.balanceLR(s));break;case 2:s&&s.right&&(this.balanceFactor(s.right)>=0?this.balanceRR(s):this.balanceRL(s))}}}balanceLL(e){const t=e.parent,s=e.left;e.parent=s,s&&s.right&&(s.right.parent=e),s&&(s.parent=t),e===this.root?s&&this._setRoot(s):(null==t?void 0:t.left)===e?t.left=s:t&&(t.right=s),s&&(e.left=s.right,s.right=e),this.updateHeight(e),s&&this.updateHeight(s)}balanceLR(e){const t=e.parent,s=e.left;let r=null;s&&(r=s.right),e&&(e.parent=r),s&&(s.parent=r),r&&(r.left&&(r.left.parent=s),r.right&&(r.right.parent=e),r.parent=t),e===this.root?r&&this._setRoot(r):t&&(t.left===e?t.left=r:t.right=r),r&&(e.left=r.right,s&&(s.right=r.left),r.left=s,r.right=e),this.updateHeight(e),s&&this.updateHeight(s),r&&this.updateHeight(r)}balanceRR(e){const t=e.parent,s=e.right;e.parent=s,s&&(s.left&&(s.left.parent=e),s.parent=t),e===this.root?s&&this._setRoot(s):t&&(t.left===e?t.left=s:t.right=s),s&&(e.right=s.left,s.left=e),this.updateHeight(e),s&&this.updateHeight(s)}balanceRL(e){const t=e.parent,s=e.right;let r=null;s&&(r=s.left),e.parent=r,s&&(s.parent=r),r&&(r.left&&(r.left.parent=e),r.right&&(r.right.parent=s),r.parent=t),e===this.root?r&&this._setRoot(r):t&&(t.left===e?t.left=r:t.right=r),r&&(e.right=r.left),s&&r&&(s.left=r.right),r&&(r.left=e),r&&(r.right=s),this.updateHeight(e),s&&this.updateHeight(s),r&&this.updateHeight(r)}}t.AVLTree=n},479:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.BTree=void 0,t.BTree=class{}},9649:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.BinaryIndexedTree=void 0;class s{constructor(e){this._sumTree=new Array(e+1).fill(0)}get sumTree(){return this._sumTree}static lowBit(e){return e&-e}update(e,t){for(;e<this._sumTree.length;)this._sumTree[e]+=t,e+=s.lowBit(e)}getPrefixSum(e){let t=0;for(;e>0;)t+=this._sumTree[e],e-=s.lowBit(e);return t}getRangeSum(e,t){if(!(0<=e&&e<=t&&t<=this._sumTree.length))throw"Index out of bounds";return this.getPrefixSum(t)-this.getPrefixSum(e)}_setSumTree(e){this._sumTree=e}}t.BinaryIndexedTree=s},8021:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.BinaryTree=t.BinaryTreeNode=void 0;const r=s(6279);class i extends r.AbstractBinaryTreeNode{constructor(e,t){super(e,t)}}t.BinaryTreeNode=i;class n extends r.AbstractBinaryTree{constructor(e){super(e)}createNode(e,t){return new i(e,t)}}t.BinaryTree=n},761:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.BST=t.BSTNode=void 0;const r=s(9011),i=s(8021);class n extends i.BinaryTreeNode{constructor(e,t){super(e,t)}}t.BSTNode=n;class o extends i.BinaryTree{constructor(e){if(super(e),this._comparator=(e,t)=>e-t,void 0!==e){const{comparator:t}=e;void 0!==t&&(this._comparator=t)}}createNode(e,t){return new n(e,t)}add(e,t){let s=null;const i=this.createNode(e,t);if(null===this.root)this._setRoot(i),this._setSize(this.size+1),s=this.root;else{let t=this.root,n=!0;for(;n;)null!==t&&null!==i?this._compare(t.id,e)===r.CP.eq?(i&&(t.val=i.val),n=!1,s=t):this._compare(t.id,e)===r.CP.gt?void 0===t.left?(i&&(i.parent=t),t.left=i,this._setSize(this.size+1),n=!1,s=t.left):t.left&&(t=t.left):this._compare(t.id,e)===r.CP.lt&&(void 0===t.right?(i&&(i.parent=t),t.right=i,this._setSize(this.size+1),n=!1,s=t.right):t.right&&(t=t.right)):n=!1}return s}get(e,t){var s;return t=null!=t?t:"id",null!==(s=this.getNodes(e,t,!0)[0])&&void 0!==s?s:null}lastKey(){var e,t,s,i,n,o;return this._compare(0,1)===r.CP.lt?null!==(t=null===(e=this.getRightMost())\|\|void 0===e?void 0:e.id)&&void 0!==t?t:0:this._compare(0,1)===r.CP.gt?null!==(i=null===(s=this.getLeftMost())\|\|void 0===s?void 0:s.id)&&void 0!==i?i:0:null!==(o=null===(n=this.getRightMost())\|\|void 0===n?void 0:n.id)&&void 0!==o?o:0}getNodes(e,t,s){if(t=null!=t?t:"id",!this.root)return[];const i=[];if(this.loopType===r.LoopType.RECURSIVE){const n=o=>{this._pushByPropertyNameStopOrNot(o,i,e,t,s)\|\|(o.left\|\|o.right)&&("id"===t?(this._compare(o.id,e)===r.CP.gt&&o.left&&n(o.left),this._compare(o.id,e)===r.CP.lt&&o.right&&n(o.right)):(o.left&&n(o.left),o.right&&n(o.right)))};n(this.root)}else{const n=[this.root];for(;n.length>0;){const o=n.shift();if(o){if(this._pushByPropertyNameStopOrNot(o,i,e,t,s))return i;"id"===t?(this._compare(o.id,e)===r.CP.gt&&o.left&&n.push(o.left),this._compare(o.id,e)===r.CP.lt&&o.right&&n.push(o.right)):(o.left&&n.push(o.left),o.right&&n.push(o.right))}}}return i}lesserSum(e,t){if(t=null!=t?t:"id","number"==typeof e&&(e=this.get(e,"id")),!e)return 0;if(!this.root)return 0;const s=e.id,i=e=>{let t;return t=e.id,t};let n=0;if(this.loopType===r.LoopType.RECURSIVE){const e=o=>{const a=this._compare(o.id,s);if(a!==r.CP.eq)if(a===r.CP.lt){if(o.left&&(n+=this.subTreeSum(o.left,t)),n+=i(o),!o.right)return;e(o.right)}else{if(!o.left)return;e(o.left)}else o.right&&(n+=this.subTreeSum(o.right,t))};e(this.root)}else{const e=[this.root];for(;e.length>0;){const o=e.shift();if(o){const a=this._compare(o.id,s);if(a===r.CP.eq)return o.right&&(n+=this.subTreeSum(o.right,t)),n;if(a===r.CP.lt){if(o.left&&(n+=this.subTreeSum(o.left,t)),n+=i(o),!o.right)return n;e.push(o.right)}else{if(!o.left)return n;e.push(o.left)}}}}return n}allGreaterNodesAdd(e,t,s){if(s=null!=s?s:"id","number"==typeof e&&(e=this.get(e,"id")),!e)return!1;const i=e.id;if(!this.root)return!1;const n=e=>{e.id+=t};if(this.loopType===r.LoopType.RECURSIVE){const e=t=>{this._compare(t.id,i)===r.CP.gt&&n(t),(t.left\|\|t.right)&&(t.left&&this._compare(t.left.id,i)===r.CP.gt&&e(t.left),t.right&&this._compare(t.right.id,i)===r.CP.gt&&e(t.right))};return e(this.root),!0}{const e=[this.root];for(;e.length>0;){const t=e.shift();t&&(this._compare(t.id,i)===r.CP.gt&&n(t),t.left&&this._compare(t.left.id,i)===r.CP.gt&&e.push(t.left),t.right&&this._compare(t.right.id,i)===r.CP.gt&&e.push(t.right))}return!0}}perfectlyBalance(){const e=this.DFS("in","node"),t=e.length;if(this.clear(),e.length<1)return!1;if(this.loopType===r.LoopType.RECURSIVE){const s=(t,r)=>{if(t>r)return;const i=t+Math.floor((r-t)/2),n=e[i];this.add(n.id,n.val),s(t,i-1),s(i+1,r)};return s(0,t-1),!0}{const s=[[0,t-1]];for(;s.length>0;){const t=s.pop();if(t){const[r,i]=t;if(r<=i){const t=r+Math.floor((i-r)/2),n=e[t];this.add(n.id,n.val),s.push([t+1,i]),s.push([r,t-1])}}}return!0}}isAVLBalanced(){var e,t;if(!this.root)return!0;let s=!0;if(this.loopType===r.LoopType.RECURSIVE){const e=t=>{if(!t)return 0;const r=e(t.left),i=e(t.right);return Math.abs(r-i)>1&&(s=!1),Math.max(r,i)+1};e(this.root)}else{const s=[];let r=this.root,i=null;const n=new Map;for(;s.length>0\|\|r;)if(r)s.push(r),r=r.left;else if(r=s[s.length-1],r.right&&i!==r.right)r=r.right;else if(r=s.pop(),r){const s=r.left&&null!==(e=n.get(r.left))&&void 0!==e?e:-1,o=r.right&&null!==(t=n.get(r.right))&&void 0!==t?t:-1;if(Math.abs(s-o)>1)return!1;n.set(r,1+Math.max(s,o)),i=r,r=null}}return s}_compare(e,t){const s=this._comparator(e,t);return s>0?r.CP.gt:s<0?r.CP.lt:r.CP.eq}}t.BST=o},255:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(6279),t),i(s(8021),t),i(s(761),t),i(s(9649),t),i(s(8207),t),i(s(9993),t),i(s(479),t),i(s(1259),t),i(s(1564),t),i(s(1925),t),i(s(2570),t),i(s(7159),t)},1259:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.RBTree=t.RBTreeNode=void 0;const r=s(9011),i=s(761);class n extends i.BSTNode{constructor(e,t,s=r.RBColor.RED){super(e,t),this._color=s}get color(){return this._color}set color(e){this._color=e}}t.RBTreeNode=n;class o extends i.BST{constructor(e){super(e)}createNode(e,t){return new n(e,t,r.RBColor.RED)}insert(e,t){}leftRotate(e){}rightRotate(e){}insertFixup(e){}deleteFixup(e){}transplant(e,t){}}t.RBTree=o},8207:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.SegmentTree=t.SegmentTreeNode=void 0;class s{constructor(e,t,s,r){this._start=0,this._end=0,this._val=null,this._sum=0,this._left=null,this._right=null,this._start=e,this._end=t,this._sum=s,this._val=r\|\|null}get start(){return this._start}set start(e){this._start=e}get end(){return this._end}set end(e){this._end=e}get val(){return this._val}set val(e){this._val=e}get sum(){return this._sum}set sum(e){this._sum=e}get left(){return this._left}set left(e){this._left=e}get right(){return this._right}set right(e){this._right=e}}t.SegmentTreeNode=s,t.SegmentTree=class{constructor(e,t,s){this._values=[],this._start=0,t=t\|\|0,s=s\|\|e.length-1,this._values=e,this._start=t,this._end=s,this._root=this.build(t,s)}get values(){return this._values}get start(){return this._start}get end(){return this._end}get root(){return this._root}build(e,t){if(e===t)return new s(e,t,this._values[e]);const r=e+Math.floor((t-e)/2),i=this.build(e,r),n=this.build(r+1,t),o=new s(e,t,i.sum+n.sum);return o.left=i,o.right=n,o}updateNode(e,t,s){const r=this.root\|\|null;if(!r)return;const i=(e,t,s,r)=>{e.start!==e.end\|\|e.start!==t?(t<=e.start+Math.floor((e.end-e.start)/2)?e.left&&i(e.left,t,s,r):e.right&&i(e.right,t,s,r),e.left&&e.right&&(e.sum=e.left.sum+e.right.sum)):e.sum=s};i(r,e,t)}querySumByRange(e,t){const s=this.root\|\|null;if(!s)return 0;const r=(e,t,s)=>{if(e.start===t&&e.end===s)return e.sum;const i=e.start+Math.floor((e.end-e.start)/2);return s<=i?e.left?r(e.left,t,s):NaN:t>i?e.right?r(e.right,t,s):NaN:e.left&&e.right?r(e.left,t,i)+r(e.right,i+1,s):NaN};return r(s,e,t)}_setValues(e){this._values=e}_setStart(e){this._start=e}_setEnd(e){this._end=e}_setRoot(e){this._root=e}}},1564:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.SplayTree=void 0,t.SplayTree=class{}},2570:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.TreeMultiset=t.TreeMultisetNode=void 0;const r=s(9011),i=s(9993);class n extends i.AVLTreeNode{constructor(e,t,s=1){super(e,t),this._count=s}get count(){return this._count}set count(e){this._count=e}}t.TreeMultisetNode=n;class o extends i.AVLTree{constructor(e){super(Object.assign({},e)),this._count=0}get count(){return this._count}createNode(e,t,s){return new n(e,t,s)}swapLocation(e,t){const{id:s,val:r,count:i,height:n}=t,o=this.createNode(s,r,i);return o&&(o.height=n,t.id=e.id,t.val=e.val,t.count=e.count,t.height=e.height,e.id=o.id,e.val=o.val,e.count=o.count,e.height=o.height),t}add(e,t,s){let i,o;if(s=null!=s?s:1,o=e instanceof n?this.createNode(e.id,e.val,e.count):null===e?null:this.createNode(e,t,s),this.root){let e=this.root,t=!0;for(;t;)e?o&&(this._compare(e.id,o.id)===r.CP.eq?(e.val=o.val,e.count+=o.count,this._setCount(this.count+o.count),t=!1,i=e):this._compare(e.id,o.id)===r.CP.gt?void 0===e.left?(e.left=o,this._setSize(this.size+1),this._setCount(this.count+o.count),t=!1,i=e.left):e.left&&(e=e.left):this._compare(e.id,o.id)===r.CP.lt&&(void 0===e.right?(e.right=o,this._setSize(this.size+1),this._setCount(this.count+o.count),t=!1,i=e.right):e.right&&(e=e.right))):t=!1}else this._setRoot(o),this._setSize(this.size+1),o&&this._setCount(this.count+o.count),i=this.root;return i&&this.balancePath(i),i}_addTo(e,t){return t?void 0===t.left?(t.left=e,null!==e&&(this._setSize(this.size+1),this._setCount(this.count+e.count)),t.left):void 0===t.right?(t.right=e,null!==e&&(this._setSize(this.size+1),this._setCount(this.count+e.count)),t.right):void 0:void 0}addMany(e,t){var s;const r=[],i=new Map;for(const t of e)i.set(t,(null!==(s=i.get(t))&&void 0!==s?s:0)+1);for(let s=0;s<e.length;s++){const o=e[s];if(i.has(o)){if(o instanceof n){r.push(this.add(o.id,o.val,o.count));continue}if(null===o){r.push(this.add(NaN,null,0));continue}const e=null==t?void 0:t[s],a=i.get(o);r.push(this.add(o,e,a)),i.delete(o)}}return r}perfectlyBalance(){const e=this.DFS("in","node"),t=e.length;if(e.length<1)return!1;if(this.clear(),this.loopType===r.LoopType.RECURSIVE){const s=(t,r)=>{if(t>r)return;const i=t+Math.floor((r-t)/2),n=e[i];this.add(n.id,n.val,n.count),s(t,i-1),s(i+1,r)};return s(0,t-1),!0}{const s=[[0,t-1]];for(;s.length>0;){const t=s.pop();if(t){const[r,i]=t;if(r<=i){const t=r+Math.floor((i-r)/2),n=e[t];this.add(n.id,n.val,n.count),s.push([t+1,i]),s.push([r,t-1])}}}return!0}}remove(e,t){const s=[];if(!this.root)return s;const i=this.get(e);if(!i)return s;const n=(null==i?void 0:i.parent)?i.parent:null;let o=null,a=i;if(i.count>1&&!t)i.count--,this._setCount(this.count-1);else{if(i.left){const e=i.left?this.getRightMost(i.left):null;if(e){const t=e.parent;a=this.swapLocation(i,e),t&&(t.right===e?t.right=e.left:t.left=e.left,o=t)}}else if(n){const{familyPosition:e}=i;e===r.FamilyPosition.LEFT\|\|e===r.FamilyPosition.ROOT_LEFT?n.left=i.right:e!==r.FamilyPosition.RIGHT&&e!==r.FamilyPosition.ROOT_RIGHT\|\|(n.right=i.right),o=n}else void 0!==i.right&&this._setRoot(i.right);this._setSize(this.size-1),this._setCount(this.count-a.count)}return s.push({deleted:a,needBalanced:o}),o&&this.balancePath(o),s}getSubTreeCount(e){const t=[0,0];if(!e)return t;if(this.loopType===r.LoopType.RECURSIVE){const s=e=>{t[0]++,t[1]+=e.count,e.left&&s(e.left),e.right&&s(e.right)};return s(e),t}{const s=[e];for(;s.length>0;){const e=s.pop();t[0]++,t[1]+=e.count,e.right&&s.push(e.right),e.left&&s.push(e.left)}return t}}subTreeSumCount(e){if("number"==typeof e&&(e=this.get(e,"id")),!e)return 0;let t=0;if(this.loopType===r.LoopType.RECURSIVE){const s=e=>{t+=e.count,e.left&&s(e.left),e.right&&s(e.right)};s(e)}else{const s=[e];for(;s.length>0;){const e=s.pop();t+=e.count,e.right&&s.push(e.right),e.left&&s.push(e.left)}}return t}subTreeAddCount(e,t){if("number"==typeof e&&(e=this.get(e,"id")),!e)return!1;const s=e=>{e.count+=t,this._setCount(this.count+t)};if(this.loopType===r.LoopType.RECURSIVE){const t=e=>{s(e),e.left&&t(e.left),e.right&&t(e.right)};t(e)}else{const t=[e];for(;t.length>0;){const e=t.pop();s(e),e.right&&t.push(e.right),e.left&&t.push(e.left)}}return!0}getNodesByCount(e,t){if(!this.root)return[];const s=[];if(this.loopType===r.LoopType.RECURSIVE){const r=i=>{i.count===e&&(s.push(i),t)\|\|(i.left\|\|i.right)&&(i.left&&r(i.left),i.right&&r(i.right))};r(this.root)}else{const r=[this.root];for(;r.length>0;){const i=r.shift();if(i){if(i.count===e&&(s.push(i),t))return s;i.left&&r.push(i.left),i.right&&r.push(i.right)}}}return s}BFSCount(){return super.BFS("node").map((e=>e.count))}listLevelsCount(e){return super.listLevels(e,"node").map((e=>e.map((e=>e.count))))}morrisCount(e){return e=e\|\|"in",super.morris(e,"node").map((e=>e.count))}DFSIterativeCount(e,t){return e=null!=e?e:"in",super.DFSIterative(e,"node").map((e=>e.count))}DFSCount(e,t){return e=null!=e?e:"in",super.DFS(e,"node").map((e=>e.count))}lesserSumCount(e){if("number"==typeof e&&(e=this.get(e,"id")),!e)return 0;if(!this.root)return 0;const t=e.id;let s=0;if(this.loopType===r.LoopType.RECURSIVE){const e=i=>{const n=this._compare(i.id,t);if(n!==r.CP.eq)if(n===r.CP.lt){if(i.left&&(s+=this.subTreeSumCount(i.left)),s+=i.count,!i.right)return;e(i.right)}else{if(!i.left)return;e(i.left)}else i.right&&(s+=this.subTreeSumCount(i.right))};e(this.root)}else{const e=[this.root];for(;e.length>0;){const i=e.shift();if(i){const n=this._compare(i.id,t);if(n===r.CP.eq)return i.right&&(s+=this.subTreeSumCount(i.right)),s;if(n===r.CP.lt){if(i.left&&(s+=this.subTreeSumCount(i.left)),s+=i.count,!i.right)return s;e.push(i.right)}else{if(!i.left)return s;e.push(i.left)}}}}return s}allGreaterNodesAddCount(e,t){if("number"==typeof e&&(e=this.get(e,"id")),!e)return!1;const s=e.id;if(!this.root)return!1;if(this.loopType===r.LoopType.RECURSIVE){const e=i=>{this._compare(i.id,s)===r.CP.gt&&(i.count+=t),(i.left\|\|i.right)&&(i.left&&this._compare(i.left.id,s)===r.CP.gt&&e(i.left),i.right&&this._compare(i.right.id,s)===r.CP.gt&&e(i.right))};return e(this.root),!0}{const e=[this.root];for(;e.length>0;){const i=e.shift();i&&(this._compare(i.id,s)===r.CP.gt&&(i.count+=t),i.left&&this._compare(i.left.id,s)===r.CP.gt&&e.push(i.left),i.right&&this._compare(i.right.id,s)===r.CP.gt&&e.push(i.right))}return!0}}clear(){super.clear(),this._setCount(0)}_setCount(e){this._count=e}}t.TreeMultiset=o},7159:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.TwoThreeTree=void 0,t.TwoThreeTree=class{}},618:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.AbstractGraph=t.AbstractEdge=t.AbstractVertex=void 0;const r=s(5928),i=s(7641);class n{constructor(e,t){this._id=e,this._val=t}get id(){return this._id}set id(e){this._id=e}get val(){return this._val}set val(e){this._val=e}}t.AbstractVertex=n;class o{constructor(e,t){this._weight=void 0!==e?e:1,this._val=t,this._hashCode=(0,r.uuidV4)()}get val(){return this._val}set val(e){this._val=e}get weight(){return this._weight}set weight(e){this._weight=e}get hashCode(){return this._hashCode}_setHashCode(e){this._hashCode=e}}t.AbstractEdge=o,t.AbstractGraph=class{constructor(){this._vertices=new Map}get vertices(){return this._vertices}getVertex(e){return this._vertices.get(e)\|\|null}hasVertex(e){return this._vertices.has(this._getVertexId(e))}addVertex(e,t){if(e instanceof n)return this._addVertexOnly(e);{const s=this.createVertex(e,t);return this._addVertexOnly(s)}}removeVertex(e){const t=this._getVertexId(e);return this._vertices.delete(t)}removeAllVertices(e){const t=[];for(const s of e)t.push(this.removeVertex(s));return t.length>0}hasEdge(e,t){return!!this.getEdge(e,t)}addEdge(e,t,s,r){if(e instanceof o)return this._addEdgeOnly(e);if(t instanceof n\|\|"string"==typeof t\|\|"number"==typeof t){if(!this.hasVertex(e)\|\|!this.hasVertex(t))return!1;e instanceof n&&(e=e.id),t instanceof n&&(t=t.id);const i=this.createEdge(e,t,s,r);return this._addEdgeOnly(i)}throw new Error("dest must be a Vertex or vertex id while srcOrEdge is an Edge")}setEdgeWeight(e,t,s){const r=this.getEdge(e,t);return!!r&&(r.weight=s,!0)}getAllPathsBetween(e,t){const s=[],i=this._getVertex(e),n=this._getVertex(t);if(!i\|\|!n)return[];const o=(e,t,n,a)=>{n.set(e,!0),e===t&&s.push([i,...a]);const d=this.getNeighbors(e);for(const e of d)n.get(e)\|\|(a.push(e),o(e,t,n,a),(0,r.arrayRemove)(a,(t=>t===e)));n.set(e,!1)};return o(i,n,new Map,[]),s}getPathSumWeight(e){var t;let s=0;for(let r=0;r<e.length;r++)s+=(null===(t=this.getEdge(e[r],e[r+1]))\|\|void 0===t?void 0:t.weight)\|\|0;return s}getMinCostBetween(e,t,s){if(void 0===s&&(s=!1),s){const s=this.getAllPathsBetween(e,t);let r=1/0;for(const e of s)r=Math.min(this.getPathSumWeight(e),r);return r}{const s=this._getVertex(t),r=this._getVertex(e);if(!r\|\|!s)return null;const i=new Map,n=[r];i.set(r,!0);let o=0;for(;n.length>0;){for(let e=0;e<n.length;e++){const e=n.shift();if(e===s)return o;if(void 0!==e){const t=this.getNeighbors(e);for(const e of t)i.has(e)\|\|(i.set(e,!0),n.push(e))}}o++}return null}}getMinPathBetween(e,t,s){if(void 0===s&&(s=!1),s){const s=this.getAllPathsBetween(e,t);let r=1/0,i=-1,n=0;for(const e of s){const t=this.getPathSumWeight(e);t<r&&(r=t,i=n),n++}return s[i]\|\|null}{let s=[];const i=this._getVertex(e),n=this._getVertex(t);if(!i\|\|!n)return[];const o=(e,t,n,a)=>{if(n.set(e,!0),e===t)return void(s=[i,...a]);const d=this.getNeighbors(e);for(const e of d)n.get(e)\|\|(a.push(e),o(e,t,n,a),(0,r.arrayRemove)(a,(t=>t===e)));n.set(e,!1)};return o(i,n,new Map,[]),s}}dijkstraWithoutHeap(e,t,s,r){void 0===s&&(s=!1),void 0===r&&(r=!1),void 0===t&&(t=null);let i=1/0,o=null,a=[];const d=[],u=this._vertices,l=new Map,h=new Set,c=new Map,p=this._getVertex(e),f=t?this._getVertex(t):null;if(!p)return null;for(const e of u){const t=e[1];t instanceof n&&l.set(t,1/0)}l.set(p,0),c.set(p,null);const _=()=>{let e=1/0,t=null;for(const[s,r]of l)h.has(s)\|\|r<e&&(e=r,t=s);return t},g=e=>{for(const t of u){const s=t[1];if(s instanceof n){const r=[s];let i=c.get(s);for(;i;)r.push(i),i=c.get(i);const n=r.reverse();t[1]===e&&(a=n),d.push(n)}}};for(let e=1;e<u.size;e++){const e=_();if(e){if(h.add(e),f&&f===e)return s&&(i=l.get(f)\|\|1/0),r&&g(f),{distMap:l,preMap:c,seen:h,paths:d,minDist:i,minPath:a};const t=this.getNeighbors(e);for(const s of t)if(!h.has(s)){const t=this.getEdge(e,s);if(t){const r=l.get(e),i=l.get(s);void 0!==r&&void 0!==i&&t.weight+r<i&&(l.set(s,t.weight+r),c.set(s,e))}}}}return s&&l.forEach(((e,t)=>{t!==p&&e<i&&(i=e,r&&(o=t))})),r&&g(o),{distMap:l,preMap:c,seen:h,paths:d,minDist:i,minPath:a}}dijkstra(e,t,s,r){var o;void 0===s&&(s=!1),void 0===r&&(r=!1),void 0===t&&(t=null);let a=1/0,d=null,u=[];const l=[],h=this._vertices,c=new Map,p=new Set,f=new Map,_=this._getVertex(e),g=t?this._getVertex(t):null;if(!_)return null;for(const e of h){const t=e[1];t instanceof n&&c.set(t,1/0)}const m=new i.PriorityQueue({comparator:(e,t)=>e.id-t.id});m.add({id:0,val:_}),c.set(_,0),f.set(_,null);const v=e=>{for(const t of h){const s=t[1];if(s instanceof n){const r=[s];let i=f.get(s);for(;i;)r.push(i),i=f.get(i);const n=r.reverse();t[1]===e&&(u=n),l.push(n)}}};for(;m.size>0;){const e=m.poll(),t=null==e?void 0:e.id,i=null==e?void 0:e.val;if(void 0!==t&&i){if(p.add(i),g&&g===i)return s&&(a=c.get(g)\|\|1/0),r&&v(g),{distMap:c,preMap:f,seen:p,paths:l,minDist:a,minPath:u};const e=this.getNeighbors(i);for(const s of e)if(!p.has(s)){const e=null===(o=this.getEdge(i,s))\|\|void 0===o?void 0:o.weight;if("number"==typeof e){const r=c.get(s);r&&t+e<r&&(m.add({id:t+e,val:s}),f.set(s,i),c.set(s,t+e))}}}}return s&&c.forEach(((e,t)=>{t!==_&&e<a&&(a=e,r&&(d=t))})),r&&v(d),{distMap:c,preMap:f,seen:p,paths:l,minDist:a,minPath:u}}bellmanFord(e,t,s,r){void 0===s&&(s=!1),void 0===r&&(r=!1);const i=this._getVertex(e),o=[],a=new Map,d=new Map;let u,l=1/0,h=[];if(t&&(u=!1),!i)return{hasNegativeCycle:u,distMap:a,preMap:d,paths:o,min:l,minPath:h};const c=this._vertices,p=c.size,f=this.edgeSet(),_=f.length;this._vertices.forEach((e=>{a.set(e,1/0)})),a.set(i,0);for(let e=1;e<p;++e)for(let e=0;e<_;++e){const t=this.getEndsOfEdge(f[e]);if(t){const[s,i]=t,n=f[e].weight,o=a.get(s),u=a.get(i);void 0!==o&&void 0!==u&&a.get(s)!==1/0&&o+n<u&&(a.set(i,o+n),r&&d.set(i,s))}}let g=null;if(s&&a.forEach(((e,t)=>{t!==i&&e<l&&(l=e,r&&(g=t))})),r)for(const e of c){const t=e[1];if(t instanceof n){const s=[t];let r=d.get(t);for(;void 0!==r;)s.push(r),r=d.get(r);const i=s.reverse();e[1]===g&&(h=i),o.push(i)}}for(let e=0;e<_;++e){const t=this.getEndsOfEdge(f[e]);if(t){const[s]=t,r=f[e].weight,i=a.get(s);i&&i!==1/0&&i+r<i&&(u=!0)}}return{hasNegativeCycle:u,distMap:a,preMap:d,paths:o,min:l,minPath:h}}floyd(){var e;const t=[...this._vertices],s=t.length,r=[],i=[];for(let e=0;e<s;e++){r[e]=[],i[e]=[];for(let t=0;t<s;t++)i[e][t]=null}for(let i=0;i<s;i++)for(let n=0;n<s;n++)r[i][n]=(null===(e=this.getEdge(t[i][1],t[n][1]))\|\|void 0===e?void 0:e.weight)\|\|1/0;for(let e=0;e<s;e++)for(let n=0;n<s;n++)for(let o=0;o<s;o++)r[n][o]>r[n][e]+r[e][o]&&(r[n][o]=r[n][e]+r[e][o],i[n][o]=t[e][1]);return{costs:r,predecessor:i}}tarjan(e,t,s,r){const i=!1;void 0===e&&(e=i),void 0===t&&(t=i),void 0===s&&(s=i),void 0===r&&(r=i);const n=new Map,o=new Map,a=this._vertices;a.forEach((e=>{n.set(e,-1),o.set(e,1/0)}));const[d]=a.values(),u=[],l=[];let h=0;const c=(s,r)=>{h++,n.set(s,h),o.set(s,h);const i=this.getNeighbors(s);let a=0;for(const h of i)if(h!==r){-1===n.get(h)&&(a++,c(h,s));const r=o.get(h),i=o.get(s);void 0!==i&&void 0!==r&&o.set(s,Math.min(i,r));const p=n.get(s);if(void 0!==r&&void 0!==p&&(e&&(s===d&&a>=2\|\|s!==d&&r>=p)&&u.push(s),t&&r>p)){const e=this.getEdge(s,h);e&&l.push(e)}}};c(d,null);let p=new Map;const f=()=>{const e=new Map;return o.forEach(((t,s)=>{var r;e.has(t)?null===(r=e.get(t))\|\|void 0===r\|\|r.push(s):e.set(t,[s])})),e};s&&(p=f());const _=new Map;if(r){let e=new Map;e.size<1&&(e=f()),e.forEach(((e,t)=>{e.length>1&&_.set(t,e)}))}return{dfnMap:n,lowMap:o,bridges:l,articulationPoints:u,SCCs:p,cycles:_}}_addVertexOnly(e){return!this.hasVertex(e)&&(this._vertices.set(e.id,e),!0)}_getVertex(e){const t=this._getVertexId(e);return this._vertices.get(t)\|\|null}_getVertexId(e){return e instanceof n?e.id:e}_setVertices(e){this._vertices=e}}},4693:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.DirectedGraph=t.DirectedEdge=t.DirectedVertex=void 0;const r=s(5928),i=s(618);class n extends i.AbstractVertex{constructor(e,t){super(e,t)}}t.DirectedVertex=n;class o extends i.AbstractEdge{constructor(e,t,s,r){super(s,r),this._src=e,this._dest=t}get src(){return this._src}set src(e){this._src=e}get dest(){return this._dest}set dest(e){this._dest=e}}t.DirectedEdge=o;class a extends i.AbstractGraph{constructor(){super(),this._outEdgeMap=new Map,this._inEdgeMap=new Map}get outEdgeMap(){return this._outEdgeMap}get inEdgeMap(){return this._inEdgeMap}createVertex(e,t){return new n(e,null!=t?t:e)}createEdge(e,t,s,r){return new o(e,t,null!=s?s:1,r)}getEdge(e,t){let s=[];if(null!==e&&null!==t){const r=this._getVertex(e),i=this._getVertex(t);if(r&&i){const e=this._outEdgeMap.get(r);e&&(s=e.filter((e=>e.dest===i.id)))}}return s[0]\|\|null}removeEdgeSrcToDest(e,t){const s=this._getVertex(e),i=this._getVertex(t);let n=null;if(!s\|\|!i)return null;const o=this._outEdgeMap.get(s);o&&(0,r.arrayRemove)(o,(e=>e.dest===i.id));const a=this._inEdgeMap.get(i);return a&&(n=(0,r.arrayRemove)(a,(e=>e.src===s.id))[0]\|\|null),n}removeEdge(e){let t=null;const s=this._getVertex(e.src),i=this._getVertex(e.dest);if(s&&i){const e=this._outEdgeMap.get(s);e&&e.length>0&&(0,r.arrayRemove)(e,(e=>e.src===s.id));const n=this._inEdgeMap.get(i);n&&n.length>0&&(t=(0,r.arrayRemove)(n,(e=>e.dest===i.id))[0])}return t}removeEdgesBetween(e,t){const s=[];if(e&&t){const r=this.removeEdgeSrcToDest(e,t),i=this.removeEdgeSrcToDest(t,e);r&&s.push(r),i&&s.push(i)}return s}incomingEdgesOf(e){const t=this._getVertex(e);return t&&this.inEdgeMap.get(t)\|\|[]}outgoingEdgesOf(e){const t=this._getVertex(e);return t&&this._outEdgeMap.get(t)\|\|[]}degreeOf(e){return this.outDegreeOf(e)+this.inDegreeOf(e)}inDegreeOf(e){return this.incomingEdgesOf(e).length}outDegreeOf(e){return this.outgoingEdgesOf(e).length}edgesOf(e){return[...this.outgoingEdgesOf(e),...this.incomingEdgesOf(e)]}getEdgeSrc(e){return this._getVertex(e.src)}getEdgeDest(e){return this._getVertex(e.dest)}getDestinations(e){if(null===e)return[];const t=[],s=this.outgoingEdgesOf(e);for(const e of s){const s=this.getEdgeDest(e);s&&t.push(s)}return t}topologicalSort(e){e=null!=e?e:"id";const t=new Map;for(const e of this.vertices)t.set(e[1],0);let s=[],r=!1;const i=e=>{t.set(e,1);const n=this.getDestinations(e);for(const e of n){const s=t.get(e);0===s?i(e):1===s&&(r=!0)}t.set(e,2),s.push(e)};for(const e of this.vertices)0===t.get(e[1])&&i(e[1]);return r?null:("id"===e&&(s=s.map((e=>e instanceof n?e.id:e))),s.reverse())}edgeSet(){let e=[];return this._outEdgeMap.forEach((t=>{e=[...e,...t]})),e}getNeighbors(e){const t=[],s=this._getVertex(e);if(s){const e=this.outgoingEdgesOf(s);for(const s of e){const e=this._getVertex(s.dest);e&&t.push(e)}}return t}getEndsOfEdge(e){if(!this.hasEdge(e.src,e.dest))return null;const t=this._getVertex(e.src),s=this._getVertex(e.dest);return t&&s?[t,s]:null}_addEdgeOnly(e){if(!this.hasVertex(e.src)\|\|!this.hasVertex(e.dest))return!1;const t=this._getVertex(e.src),s=this._getVertex(e.dest);if(t&&s){const r=this._outEdgeMap.get(t);r?r.push(e):this._outEdgeMap.set(t,[e]);const i=this._inEdgeMap.get(s);return i?i.push(e):this._inEdgeMap.set(s,[e]),!0}return!1}_setOutEdgeMap(e){this._outEdgeMap=e}_setInEdgeMap(e){this._inEdgeMap=e}}t.DirectedGraph=a},8079:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(618),t),i(s(4693),t),i(s(5237),t),i(s(5309),t)},5309:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.MapGraph=t.MapEdge=t.MapVertex=void 0;const r=s(4693);class i extends r.DirectedVertex{constructor(e,t,s,r){super(e,r),this._lat=t,this._long=s}get lat(){return this._lat}set lat(e){this._lat=e}get long(){return this._long}set long(e){this._long=e}}t.MapVertex=i;class n extends r.DirectedEdge{constructor(e,t,s,r){super(e,t,s,r)}}t.MapEdge=n;class o extends r.DirectedGraph{constructor(e,t){super(),this._origin=[0,0],this._origin=e,this._bottomRight=t}get origin(){return this._origin}set origin(e){this._origin=e}get bottomRight(){return this._bottomRight}set bottomRight(e){this._bottomRight=e}createVertex(e,t,s=this.origin[0],r=this.origin[1]){return new i(e,s,r,t)}createEdge(e,t,s,r){return new n(e,t,s,r)}}t.MapGraph=o},5237:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.UndirectedGraph=t.UndirectedEdge=t.UndirectedVertex=void 0;const r=s(5928),i=s(618);class n extends i.AbstractVertex{constructor(e,t){super(e,t)}}t.UndirectedVertex=n;class o extends i.AbstractEdge{constructor(e,t,s,r){super(s,r),this._vertices=[e,t]}get vertices(){return this._vertices}set vertices(e){this._vertices=e}}t.UndirectedEdge=o;class a extends i.AbstractGraph{constructor(){super(),this._edges=new Map}get edges(){return this._edges}createVertex(e,t){return new n(e,null!=t?t:e)}createEdge(e,t,s,r){return new o(e,t,null!=s?s:1,r)}getEdge(e,t){var s;let r=[];if(null!==e&&null!==t){const i=this._getVertex(e),n=this._getVertex(t);i&&n&&(r=null===(s=this._edges.get(i))\|\|void 0===s?void 0:s.filter((e=>e.vertices.includes(n.id))))}return r&&r[0]\|\|null}removeEdgeBetween(e,t){const s=this._getVertex(e),i=this._getVertex(t);if(!s\|\|!i)return null;const n=this._edges.get(s);let o=null;n&&(o=(0,r.arrayRemove)(n,(e=>e.vertices.includes(i.id)))[0]\|\|null);const a=this._edges.get(i);return a&&(0,r.arrayRemove)(a,(e=>e.vertices.includes(s.id))),o}removeEdge(e){return this.removeEdgeBetween(e.vertices[0],e.vertices[1])}degreeOf(e){var t;const s=this._getVertex(e);return s&&(null===(t=this._edges.get(s))\|\|void 0===t?void 0:t.length)\|\|0}edgesOf(e){const t=this._getVertex(e);return t&&this._edges.get(t)\|\|[]}edgeSet(){const e=new Set;return this._edges.forEach((t=>{t.forEach((t=>{e.add(t)}))})),[...e]}getNeighbors(e){const t=[],s=this._getVertex(e);if(s){const e=this.edgesOf(s);for(const r of e){const e=this._getVertex(r.vertices.filter((e=>e!==s.id))[0]);e&&t.push(e)}}return t}getEndsOfEdge(e){if(!this.hasEdge(e.vertices[0],e.vertices[1]))return null;const t=this._getVertex(e.vertices[0]),s=this._getVertex(e.vertices[1]);return t&&s?[t,s]:null}_addEdgeOnly(e){for(const t of e.vertices){const s=this._getVertex(t);if(null===s)return!1;if(s){const t=this._edges.get(s);t?t.push(e):this._edges.set(s,[e])}}return!0}_setEdges(e){this._edges=e}}t.UndirectedGraph=a},2808:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.CoordinateMap=void 0;class s extends Map{constructor(e){super(),this._joint="_",void 0!==e&&(this._joint=e)}get joint(){return this._joint}has(e){return super.has(e.join(this._joint))}set(e,t){return super.set(e.join(this._joint),t)}get(e){return super.get(e.join(this._joint))}delete(e){return super.delete(e.join(this._joint))}_setJoint(e){this._joint=e}}t.CoordinateMap=s},2130:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.CoordinateSet=void 0;class s extends Set{constructor(e){super(),this._joint="_",void 0!==e&&(this._joint=e)}get joint(){return this._joint}has(e){return super.has(e.join(this._joint))}add(e){return super.add(e.join(this._joint))}delete(e){return super.delete(e.join(this._joint))}_setJoint(e){this._joint=e}}t.CoordinateSet=s},5946:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.HashTable=void 0,t.HashTable=class{}},6841:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(5946),t),i(s(2808),t),i(s(2130),t),i(s(8328),t),i(s(7665),t),i(s(8107),t)},8328:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.Pair=void 0,t.Pair=class{}},7665:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.TreeMap=void 0,t.TreeMap=class{}},8107:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.TreeSet=void 0,t.TreeSet=class{}},8049:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.Heap=t.HeapItem=void 0;class s{constructor(e=NaN,t=null){this._val=t,this._priority=e}get priority(){return this._priority}set priority(e){this._priority=e}get val(){return this._val}set val(e){this._val=e}}t.HeapItem=s,t.Heap=class{constructor(e){if(e){const{priorityExtractor:t}=e;if(void 0!==t&&"function"!=typeof t)throw new Error(".constructor expects a valid priority function");this._priorityExtractor=t\|\|(e=>+e)}else this._priorityExtractor=e=>+e}get pq(){return this._pq}get priorityExtractor(){return this._priorityExtractor}get size(){return this._pq.size}isEmpty(){return this._pq.size<1}peek(e){e=null!=e&&e;const t=this._pq.peek();return e?t:null==t?void 0:t.val}peekLast(e){e=null!=e&&e;const t=this._pq.leaf();return e?t:null==t?void 0:t.val}add(e,t){return t=void 0===t?e:t,this._pq.add(new s(e,t)),this}poll(e){e=null!=e&&e;const t=this._pq.poll();return t?e?t:t.val:null}has(e){return e instanceof s?this.pq.getNodes().includes(e):-1!==this.pq.getNodes().findIndex((t=>t.val===e))}toArray(e){e=null!=e&&e;const t=this._pq.toArray();return e?t:t.map((e=>e.val))}sort(e){e=null!=e&&e;const t=this._pq.sort();return e?t:t.map((e=>e.val))}clear(){this._pq.clear()}}},7888:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(7112),t),i(s(1269),t),i(s(8049),t)},7112:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.MaxHeap=void 0;const r=s(8049),i=s(7641);class n extends r.Heap{constructor(e){super(e),this._pq=new i.PriorityQueue({comparator:(e,t)=>t.priority-e.priority})}}t.MaxHeap=n},1269:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.MinHeap=void 0;const r=s(8049),i=s(7641);class n extends r.Heap{constructor(e){super(e),this._pq=new i.PriorityQueue({comparator:(e,t)=>e.priority-t.priority})}}t.MinHeap=n},4866:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(6841),t),i(s(2324),t),i(s(9509),t),i(s(2627),t),i(s(8079),t),i(s(255),t),i(s(8456),t),i(s(7888),t),i(s(7641),t),i(s(7619),t),i(s(3543),t),i(s(341),t),i(s(9011),t)},4833:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},98:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},8250:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},748:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},5355:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},9489:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},1918:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},6053:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},341:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(4833),t),i(s(98),t),i(s(8250),t),i(s(748),t),i(s(5355),t),i(s(9489),t),i(s(1918),t),i(s(6053),t),i(s(1979),t),i(s(2337),t),i(s(4533),t),i(s(7319),t),i(s(4327),t),i(s(2175),t),i(s(6947),t)},1979:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},2337:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},4533:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},7319:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},4327:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},2175:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},6947:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},2198:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.DoublyLinkedList=t.DoublyLinkedListNode=void 0;class s{constructor(e){this._val=e,this._next=null,this._prev=null}get val(){return this._val}set val(e){this._val=e}get next(){return this._next}set next(e){this._next=e}get prev(){return this._prev}set prev(e){this._prev=e}}t.DoublyLinkedListNode=s;class r{constructor(){this._head=null,this._tail=null,this._length=0}get head(){return this._head}set head(e){this._head=e}get tail(){return this._tail}set tail(e){this._tail=e}get length(){return this._length}static fromArray(e){const t=new r;for(const s of e)t.push(s);return t}push(e){const t=new s(e);this.head?(t.prev=this.tail,this.tail.next=t,this.tail=t):(this.head=t,this.tail=t),this._length++}pop(){if(!this.tail)return null;const e=this.tail;return this.head===this.tail?(this.head=null,this.tail=null):(this.tail=e.prev,this.tail.next=null),this._length--,e.val}shift(){if(!this.head)return null;const e=this.head;return this.head===this.tail?(this.head=null,this.tail=null):(this.head=e.next,this.head.prev=null),this._length--,e.val}unshift(e){const t=new s(e);this.head?(t.next=this.head,this.head.prev=t,this.head=t):(this.head=t,this.tail=t),this._length++}getAt(e){if(e<0\|\|e>=this.length)return null;let t=this.head;for(let s=0;s<e;s++)t=t.next;return t.val}getNodeAt(e){if(e<0\|\|e>=this.length)return null;let t=this.head;for(let s=0;s<e;s++)t=t.next;return t}findNode(e){let t=this.head;for(;t;){if(t.val===e)return t;t=t.next}return null}insertAt(e,t){if(e<0\|\|e>this.length)return!1;if(0===e)return this.unshift(t),!0;if(e===this.length)return this.push(t),!0;const r=new s(t),i=this.getNodeAt(e-1),n=i.next;return r.prev=i,r.next=n,i.next=r,n.prev=r,this._length++,!0}deleteAt(e){if(e<0\|\|e>=this.length)return null;if(0===e)return this.shift();if(e===this.length-1)return this.pop();const t=this.getNodeAt(e),s=t.prev,r=t.next;return s.next=r,r.prev=s,this._length--,t.val}delete(e){let t;if(t=e instanceof s?e:this.findNode(e),t){if(t===this.head)this.shift();else if(t===this.tail)this.pop();else{const e=t.prev,s=t.next;e.next=s,s.prev=e,this._length--}return!0}return!1}toArray(){const e=[];let t=this.head;for(;t;)e.push(t.val),t=t.next;return e}clear(){this._head=null,this._tail=null,this._length=0}find(e){let t=this.head;for(;t;){if(e(t.val))return t.val;t=t.next}return null}indexOf(e){let t=0,s=this.head;for(;s;){if(s.val===e)return t;t++,s=s.next}return-1}findLast(e){let t=this.tail;for(;t;){if(e(t.val))return t.val;t=t.prev}return null}toArrayReverse(){const e=[];let t=this.tail;for(;t;)e.push(t.val),t=t.prev;return e}reverse(){let e=this.head;for([this.head,this.tail]=[this.tail,this.head];e;){const t=e.next;[e.prev,e.next]=[e.next,e.prev],e=t}}forEach(e){let t=this.head,s=0;for(;t;)e(t.val,s),t=t.next,s++}map(e){const t=new r;let s=this.head;for(;s;)t.push(e(s.val)),s=s.next;return t}filter(e){const t=new r;let s=this.head;for(;s;)e(s.val)&&t.push(s.val),s=s.next;return t}reduce(e,t){let s=t,r=this.head;for(;r;)s=e(s,r.val),r=r.next;return s}insertAfter(e,t){let r;if(r=e instanceof s?e:this.findNode(e),r){const e=new s(t);return e.next=r.next,r.next&&(r.next.prev=e),e.prev=r,r.next=e,r===this.tail&&(this.tail=e),this._length++,!0}return!1}insertBefore(e,t){let r;if(r=e instanceof s?e:this.findNode(e),r){const e=new s(t);return e.prev=r.prev,r.prev&&(r.prev.next=e),e.next=r,r.prev=e,r===this.head&&(this.head=e),this._length++,!0}return!1}}t.DoublyLinkedList=r},2324:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(8549),t),i(s(2198),t),i(s(5435),t)},8549:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.SinglyLinkedList=t.SinglyLinkedListNode=void 0;class s{constructor(e){this._val=e,this._next=null}get val(){return this._val}set val(e){this._val=e}get next(){return this._next}set next(e){this._next=e}}t.SinglyLinkedListNode=s;class r{constructor(){this._head=null,this._tail=null,this._length=0}get head(){return this._head}set head(e){this._head=e}get tail(){return this._tail}set tail(e){this._tail=e}get length(){return this._length}static fromArray(e){const t=new r;for(const s of e)t.push(s);return t}getLength(){return this._length}push(e){const t=new s(e);this.head?(this.tail.next=t,this.tail=t):(this.head=t,this.tail=t),this._length++}pop(){if(!this.head)return null;if(this.head===this.tail){const e=this.head.val;return this.head=null,this.tail=null,this._length--,e}let e=this.head;for(;e.next!==this.tail;)e=e.next;const t=this.tail.val;return e.next=null,this.tail=e,this._length--,t}shift(){if(!this.head)return null;const e=this.head;return this.head=this.head.next,this._length--,e.val}unshift(e){const t=new s(e);this.head?(t.next=this.head,this.head=t):(this.head=t,this.tail=t),this._length++}getAt(e){if(e<0\|\|e>=this.length)return null;let t=this.head;for(let s=0;s<e;s++)t=t.next;return t.val}getNodeAt(e){let t=this.head;for(let s=0;s<e;s++)t=t.next;return t}deleteAt(e){if(e<0\|\|e>=this.length)return null;if(0===e)return this.shift();if(e===this.length-1)return this.pop();const t=this.getNodeAt(e-1),s=t.next;return t.next=s.next,this._length--,s.val}delete(e){let t;t=e instanceof s?e.val:e;let r=this.head,i=null;for(;r;){if(r.val===t)return null===i?(this.head=r.next,r===this.tail&&(this.tail=null)):(i.next=r.next,r===this.tail&&(this.tail=i)),this._length--,!0;i=r,r=r.next}return!1}insertAt(e,t){if(e<0\|\|e>this.length)return!1;if(0===e)return this.unshift(t),!0;if(e===this.length)return this.push(t),!0;const r=new s(t),i=this.getNodeAt(e-1);return r.next=i.next,i.next=r,this._length++,!0}isEmpty(){return 0===this.length}clear(){this._head=null,this._tail=null,this._length=0}toArray(){const e=[];let t=this.head;for(;t;)e.push(t.val),t=t.next;return e}reverse(){if(!this.head\|\|this.head===this.tail)return;let e=null,t=this.head,s=null;for(;t;)s=t.next,t.next=e,e=t,t=s;[this.head,this.tail]=[this.tail,this.head]}find(e){let t=this.head;for(;t;){if(e(t.val))return t.val;t=t.next}return null}indexOf(e){let t=0,s=this.head;for(;s;){if(s.val===e)return t;t++,s=s.next}return-1}findNode(e){let t=this.head;for(;t;){if(t.val===e)return t;t=t.next}return null}insertBefore(e,t){if(!this.head)return!1;let r;if(r=e instanceof s?e.val:e,this.head.val===r)return this.unshift(t),!0;let i=this.head;for(;i.next;){if(i.next.val===r){const e=new s(t);return e.next=i.next,i.next=e,this._length++,!0}i=i.next}return!1}insertAfter(e,t){let r;if(r=e instanceof s?e:this.findNode(e),r){const e=new s(t);return e.next=r.next,r.next=e,r===this.tail&&(this.tail=e),this._length++,!0}return!1}countOccurrences(e){let t=0,s=this.head;for(;s;)s.val===e&&t++,s=s.next;return t}}t.SinglyLinkedList=r},5435:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.SkipLinkedList=void 0,t.SkipLinkedList=class{}},7619:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(4824),t),i(s(6090),t),i(s(8723),t),i(s(6690),t)},4824:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.MatrixNTI2D=void 0,t.MatrixNTI2D=class{constructor(e){const{row:t,col:s,initialVal:r}=e;this._matrix=new Array(t).fill(void 0).map((()=>new Array(s).fill(r\|\|0)))}toArray(){return this._matrix}}},8723:function(e,t,s){var r=this&&this.__importDefault\|\|function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:!0}),t.Matrix2D=void 0;const i=r(s(6090));class n{constructor(e){void 0===e?this._matrix=n.identity:e instanceof i.default?(this._matrix=n.identity,this._matrix[0][0]=e.x,this._matrix[1][0]=e.y,this._matrix[2][0]=e.w):this._matrix=e}static get empty(){return[[],[],[]]}static get identity(){return[[1,0,0],[0,1,0],[0,0,1]]}get m(){return this._matrix}get toVector(){return new i.default(this._matrix[0][0],this._matrix[1][0])}static add(e,t){const s=n.empty;for(let r=0;r<3;r++)for(let i=0;i<3;i++)s[r][i]=e.m[r][i]+t.m[r][i];return new n(s)}static subtract(e,t){const s=n.empty;for(let r=0;r<3;r++)for(let i=0;i<3;i++)s[r][i]=e.m[r][i]-t.m[r][i];return new n(s)}static multiply(e,t){const s=n.empty;for(let r=0;r<3;r++)for(let i=0;i<3;i++){s[r][i]=0;for(let n=0;n<3;n++)s[r][i]+=e.m[r][n]t.m[n][i]}return new n(s)}static multiplyByValue(e,t){const s=n.empty;for(let r=0;r<3;r++)for(let i=0;i<3;i++)s[r][i]=e.m[r][i]t;return new n(s)}static multiplyByVector(e,t){return n.multiply(e,new n(t)).toVector}static view(e,t){const s=e/2,r=t/2,i=Math.cos(Math.PI);return new n([[1,0,s],[0,1i,r],[0,0,1]])}static scale(e){return n.multiplyByValue(new n,e)}static rotate(e){const t=Math.cos(e),s=Math.sin(e);return new n([[t,-s,0],[s,t,0],[0,0,1]])}static translate(e){return new n([[1,0,e.x],[0,1,e.y],[0,0,e.w]])}}t.Matrix2D=n,t.default=n},6690:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.Navigator=t.Character=void 0;class s{constructor(e,t){this.direction=e,this.turn=()=>new s(t[e],t)}}t.Character=s,t.Navigator=class{constructor({matrix:e,turning:t,onMove:r,init:{cur:i,charDir:n,VISITED:o}}){this._matrix=e,this._cur=i,this._character=new s(n,t),this.onMove=r,this.onMove&&this.onMove(this._cur),this._VISITED=o,this._matrix[this._cur[0]][this._cur[1]]=this._VISITED}start(){for(;this.check(this._character.direction)\|\|this.check(this._character.turn().direction);){const{direction:e}=this._character;this.check(e)?this.move(e):this.check(this._character.turn().direction)&&(this._character=this._character.turn())}}check(e){let t,s;const r=this._matrix,[i,n]=this._cur;switch(e){case"up":if(s=r[i-1],!s)return!1;t=s[n];break;case"right":t=r[i][n+1];break;case"down":if(s=r[i+1],!s)return!1;t=s[n];break;case"left":t=r[i][n-1]}return void 0!==t&&t!==this._VISITED}move(e){switch(e){case"up":this._cur[0]--;break;case"right":this._cur[1]++;break;case"down":this._cur[0]++;break;case"left":this._cur[1]--}const[t,s]=this._cur;this._matrix[t][s]=this._VISITED,this.onMove&&this.onMove(this._cur)}}},6090:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.Vector2D=void 0;class s{constructor(e=0,t=0,s=1){this.x=e,this.y=t,this.w=s}get isZero(){return 0===this.x&&0===this.y}get length(){return Math.sqrt(this.xthis.x+this.ythis.y)}get lengthSq(){return this.xthis.x+this.ythis.y}get rounded(){return new s(Math.round(this.x),Math.round(this.y))}static add(e,t){return new s(e.x+t.x,e.y+t.y)}static subtract(e,t){return new s(e.x-t.x,e.y-t.y)}static subtractValue(e,t){return new s(e.x-t,e.y-t)}static multiply(e,t){return new s(e.xt,e.yt)}static divide(e,t){return new s(e.x/t,e.y/t)}static equals(e,t){return e.x===t.x&&e.y===t.y}static equalsRounded(e,t,r=12){const i=s.abs(s.subtract(e,t));return i.x<r&&i.y<r}static normalize(e){const t=e.length;return t>2220446049250313e-31?s.divide(e,t):e}static truncate(e,t){return e.length>t?s.multiply(s.normalize(e),t):e}static perp(e){return new s(-e.y,e.x)}static reverse(e){return new s(-e.x,-e.y)}static abs(e){return new s(Math.abs(e.x),Math.abs(e.y))}static dot(e,t){return e.xt.x+e.yt.y}static distance(e,t){const s=t.y-e.y,r=t.x-e.x;return Math.sqrt(ss+rr)}static distanceSq(e,t){const s=t.y-e.y,r=t.x-e.x;return ss+rr}static sign(e,t){return e.yt.x>e.xt.y?-1:1}static angle(e){const t=new s(0,-1),r=Math.acos(s.dot(e,t)/(e.lengtht.length));return 1===s.sign(e,t)?2Math.PI-r:r}static random(e,t){const r=Math.floor(Math.random()e-e/2),i=Math.floor(Math.random()t-t/2);return new s(r,i)}zero(){this.x=0,this.y=0}}t.Vector2D=s,t.default=s},7641:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(3491),t),i(s(7016),t),i(s(7021),t)},7021:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.MaxPriorityQueue=void 0;const r=s(3491);class i extends r.PriorityQueue{constructor(e){super(Object.assign(Object.assign({},e),{comparator:(null==e?void 0:e.comparator)?e.comparator:(e,t)=>t-e}))}static heapify(e){const t=new i(Object.assign(Object.assign({},e),{comparator:(null==e?void 0:e.comparator)?e.comparator:(e,t)=>t-e}));return t._fix(),t}}t.MaxPriorityQueue=i},7016:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.MinPriorityQueue=void 0;const r=s(3491);class i extends r.PriorityQueue{constructor(e){super(Object.assign(Object.assign({},e),{comparator:(null==e?void 0:e.comparator)?e.comparator:(e,t)=>e-t}))}static heapify(e){const t=new i(Object.assign(Object.assign({},e),{comparator:(null==e?void 0:e.comparator)?e.comparator:(e,t)=>e-t}));return t._fix(),t}}t.MinPriorityQueue=i},3491:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.PriorityQueue=void 0;class s{constructor(e){this._nodes=[],this._comparator=(e,t)=>e-t;const{nodes:t,comparator:s,isFix:r=!0}=e;this._comparator=s,t&&Array.isArray(t)&&t.length>0&&(this._nodes=[...t],r&&this._fix())}get nodes(){return this._nodes}get size(){return this.nodes.length}static heapify(e){const t=new s(e);return t._fix(),t}static isPriorityQueueified(e){return new s(Object.assign(Object.assign({},e),{isFix:!1})).isValid()}getNodes(){return this._nodes}add(e){this.nodes.push(e),this._heapifyUp(this.size-1)}has(e){return this.nodes.includes(e)}peek(){return this.size?this.nodes[0]:null}poll(){var e,t;let s=null;return this.size>1?(this._swap(0,this.nodes.length-1),s=null!==(e=this.nodes.pop())&&void 0!==e?e:null,this._heapifyDown(0)):1===this.size&&(s=null!==(t=this.nodes.pop())&&void 0!==t?t:null),s}leaf(){var e;return null!==(e=this.nodes[this.size-1])&&void 0!==e?e:null}isEmpty(){return 0===this.size}clear(){this._setNodes([])}toArray(){return[...this.nodes]}clone(){return new s({nodes:this.nodes,comparator:this._comparator})}isValid(){for(let e=0;e<this.nodes.length;e++){const t=this._getLeft(e),s=this._getRight(e);if(this._isValidIndex(t)&&!this._compare(t,e))return!1;if(this._isValidIndex(s)&&!this._compare(s,e))return!1}return!0}sort(){const e=[];for(;0!==this.size;){const t=this.poll();t&&e.push(t)}return e}DFS(e){const t=[],s=r=>{var i,n,o;const a=this._getLeft(r),d=this._getRight(r);switch(e){case"in":this._isValidIndex(a)&&s(a),t.push(null!==(i=this.nodes[r])&&void 0!==i?i:null),this._isValidIndex(d)&&s(d);break;case"pre":t.push(null!==(n=this.nodes[r])&&void 0!==n?n:null),this._isValidIndex(a)&&s(a),this._isValidIndex(d)&&s(d);break;case"post":this._isValidIndex(a)&&s(a),this._isValidIndex(d)&&s(d),t.push(null!==(o=this.nodes[r])&&void 0!==o?o:null)}};return this._isValidIndex(0)&&s(0),t}_setNodes(e){this._nodes=e}_compare(e,t){return this._comparator(this.nodes[e],this.nodes[t])>0}_swap(e,t){const s=this.nodes[e];this.nodes[e]=this.nodes[t],this.nodes[t]=s}_isValidIndex(e){return e>-1&&e<this.nodes.length}_getParent(e){return Math.floor((e-1)/2)}_getLeft(e){return 2e+1}_getRight(e){return 2e+2}_getComparedChild(e){let t=e;const s=this._getLeft(e),r=this._getRight(e);return s<this.size&&this._compare(t,s)&&(t=s),r<this.size&&this._compare(t,r)&&(t=r),t}_heapifyUp(e){for(;e>0&&this._compare(this._getParent(e),e);){const t=this._getParent(e);this._swap(e,t),e=t}}_heapifyDown(e){let t=this._getComparedChild(e);for(;this._compare(e,t);)this._swap(t,e),e=t,t=this._getComparedChild(e)}_fix(){for(let e=Math.floor(this.size/2);e>-1;e--)this._heapifyDown(e)}}t.PriorityQueue=s},7569:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.ArrayDeque=t.ObjectDeque=t.Deque=void 0;const r=s(2324);class i extends r.DoublyLinkedList{}t.Deque=i,t.ObjectDeque=class{constructor(e){this._nodes={},this._capacity=Number.MAX_SAFE_INTEGER,this._first=-1,this._last=-1,this._size=0,void 0!==e&&(this._capacity=e)}get nodes(){return this._nodes}get capacity(){return this._capacity}set capacity(e){this._capacity=e}get first(){return this._first}set first(e){this._first=e}get last(){return this._last}set last(e){this._last=e}get size(){return this._size}addFirst(e){if(0===this._size){const e=Math.floor(this._capacity/2);this._first=e,this._last=e}else this._first--;this._nodes[this._first]=e,this._size++}addLast(e){if(0===this._size){const e=Math.floor(this._capacity/2);this._first=e,this._last=e}else this._last++;this._nodes[this._last]=e,this._size++}pollFirst(){if(!this._size)return;const e=this.peekFirst();return delete this._nodes[this._first],this._first++,this._size--,e}peekFirst(){if(this._size)return this._nodes[this._first]}pollLast(){if(!this._size)return;const e=this.peekLast();return delete this._nodes[this._last],this._last--,this._size--,e}peekLast(){if(this._size)return this._nodes[this._last]}get(e){return this._nodes[this._first+e]\|\|null}isEmpty(){return this._size<=0}_seNodes(e){this._nodes=e}_setSize(e){this._size=e}},t.ArrayDeque=class{constructor(){this._nodes=[]}get size(){return this._nodes.length}addLast(e){return this._nodes.push(e)}pollLast(){var e;return null!==(e=this._nodes.pop())&&void 0!==e?e:null}pollFirst(){var e;return null!==(e=this._nodes.shift())&&void 0!==e?e:null}addFirst(e){return this._nodes.unshift(e)}peekFirst(){var e;return null!==(e=this._nodes[0])&&void 0!==e?e:null}peekLast(){var e;return null!==(e=this._nodes[this._nodes.length-1])&&void 0!==e?e:null}get(e){var t;return null!==(t=this._nodes[e])&&void 0!==t?t:null}set(e,t){return this._nodes[e]=t}insert(e,t){return this._nodes.splice(e,0,t)}remove(e){return this._nodes.splice(e,1)}isEmpty(){return 0===this._nodes.length}}},2627:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(3295),t),i(s(7569),t)},3295:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.Queue=void 0;class s{constructor(e){this._nodes=e\|\|[],this._offset=0}static fromArray(e){return new s(e)}add(e){return this._nodes.push(e),this}poll(){if(0===this.size())return null;const e=this.peek();return this._offset+=1,2this._offset<this._nodes.length\|\|(this._nodes=this._nodes.slice(this._offset),this._offset=0),e}peek(){return this.size()>0?this._nodes[this._offset]:null}peekLast(){return this.size()>0?this._nodes[this._nodes.length-1]:null}size(){return this._nodes.length-this._offset}isEmpty(){return 0===this.size()}toArray(){return this._nodes.slice(this._offset)}clear(){this._nodes=[],this._offset=0}clone(){return new s(this._nodes.slice(this._offset))}}t.Queue=s},9509:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(6006),t)},6006:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.Stack=void 0;class s{constructor(e){this._elements=Array.isArray(e)?e:[]}static fromArray(e){return new s(e)}isEmpty(){return 0===this._elements.length}size(){return this._elements.length}peek(){return this.isEmpty()?null:this._elements[this._elements.length-1]}push(e){return this._elements.push(e),this}pop(){return this.isEmpty()?null:this._elements.pop()\|\|null}toArray(){return this._elements.slice()}clear(){this._elements=[]}clone(){return new s(this._elements.slice())}}t.Stack=s},8456:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(301),t)},301:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.TreeNode=void 0;class s{constructor(e,t,s){this._id=e,this._value=t\|\|void 0,this._children=s\|\|[]}get id(){return this._id}set id(e){this._id=e}get value(){return this._value}set value(e){this._value=e}get children(){return this._children}set children(e){this._children=e}addChildren(e){this.children\|\|(this.children=[]),e instanceof s?this.children.push(e):this.children=this.children.concat(e)}getHeight(){const e=this;let t=1;if(e){const s=(e,r)=>{r>t&&(t=r);const{children:i}=e;if(i)for(let e=0,t=i.length;e<t;e++)s(i[e],r+1)};s(e,1)}return t}}t.TreeNode=s},3543:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(2952),t)},2952:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.Trie=t.TrieNode=void 0;class s{constructor(e){this._val=e,this._isEnd=!1,this._children=new Map}get val(){return this._val}set val(e){this._val=e}get children(){return this._children}set children(e){this._children=e}get isEnd(){return this._isEnd}set isEnd(e){this._isEnd=e}}t.TrieNode=s,t.Trie=class{constructor(e){if(this._root=new s(""),e)for(const t of e)this.add(t)}get root(){return this._root}set root(e){this._root=e}add(e){let t=this._root;for(const r of e){let e=t.children.get(r);e\|\|(e=new s(r),t.children.set(r,e)),t=e}return t.isEnd=!0,!0}has(e){let t=this._root;for(const s of e){const e=t.children.get(s);if(!e)return!1;t=e}return t.isEnd}remove(e){let t=!1;const s=(r,i)=>{const n=e[i],o=r.children.get(n);return!!o&&(i===e.length-1?!!o.isEnd&&(o.children.size>0?o.isEnd=!1:r.children.delete(n),t=!0,!0):!(!s(o,i+1)\|\|r.isEnd\|\|0!==o.children.size\|\|(r.children.delete(n),0)))};return s(this.root,0),t}isAbsPrefix(e){let t=this._root;for(const s of e){const e=t.children.get(s);if(!e)return!1;t=e}return!t.isEnd}isPrefix(e){let t=this._root;for(const s of e){const e=t.children.get(s);if(!e)return!1;t=e}return!0}isCommonPrefix(e){let t="";const s=r=>{t+=r.val,t!==e&&(r.isEnd\|\|r&&r.children&&1===r.children.size&&s(Array.from(r.children.values())[0]))};return s(this._root),t===e}getLongestCommonPrefix(){let e="";const t=s=>{e+=s.val,s.isEnd\|\|s&&s.children&&1===s.children.size&&t(Array.from(s.children.values())[0])};return t(this._root),e}getAll(e=""){const t=[];let s=this._root;if(e)for(const t of e){const e=s.children.get(t);e&&(s=e)}return function e(s,r){for(const t of s.children.keys()){const i=s.children.get(t);void 0!==i&&e(i,r.concat(t))}s.isEnd&&t.push(r)}(s,e),t}}},2351:(e,t)=>{var s,r;Object.defineProperty(t,"__esModule",{value:!0}),t.FamilyPosition=t.LoopType=void 0,(r=t.LoopType\|\|(t.LoopType={})).ITERATIVE="ITERATIVE",r.RECURSIVE="RECURSIVE",(s=t.FamilyPosition\|\|(t.FamilyPosition={})).ROOT="ROOT",s.LEFT="LEFT",s.RIGHT="RIGHT",s.ROOT_LEFT="ROOT_LEFT",s.ROOT_RIGHT="ROOT_RIGHT",s.ISOLATED="ISOLATED",s.MAL_NODE="MAL_NODE"},6835:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},7327:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},7749:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},4357:(e,t)=>{var s;Object.defineProperty(t,"__esModule",{value:!0}),t.CP=void 0,(s=t.CP\|\|(t.CP={})).lt="lt",s.eq="eq",s.gt="gt"},3429:(e,t)=>{var s;Object.defineProperty(t,"__esModule",{value:!0}),t.TopologicalProperty=void 0,(s=t.TopologicalProperty\|\|(t.TopologicalProperty={})).VAL="VAL",s.NODE="NODE",s.ID="ID"},7882:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},1787:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},5453:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},9011:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(7749),t),i(s(4357),t),i(s(7327),t),i(s(7406),t),i(s(826),t),i(s(6835),t),i(s(5816),t),i(s(2351),t),i(s(5048),t),i(s(3429),t),i(s(575),t),i(s(1787),t),i(s(4567),t),i(s(7882),t),i(s(4752),t),i(s(5453),t)},5816:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},4752:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},575:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},5048:(e,t)=>{var s;Object.defineProperty(t,"__esModule",{value:!0}),t.RBColor=void 0,(s=t.RBColor\|\|(t.RBColor={})).RED="RED",s.BLACK="BLACK"},7406:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},4567:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},826:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},3607:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(4866),t),i(s(5928),t)},5928:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(974),t),i(s(3202),t),i(s(8802),t)},3202:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s);var i=Object.getOwnPropertyDescriptor(t,s);i&&!("get"in i?!t.__esModule:i.writable\|\|i.configurable)\|\|(i={enumerable:!0,get:function(){return t[s]}}),Object.defineProperty(e,r,i)}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(9738),t),i(s(3527),t)},9738:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},3527:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},974:function(e,t){var s=this&&this.__awaiter\|\|function(e,t,s,r){return new(s\|\|(s=Promise))((function(i,n){function o(e){try{d(r.next(e))}catch(e){n(e)}}function a(e){try{d(r.throw(e))}catch(e){n(e)}}function d(e){var t;e.done?i(e.value):(t=e.value,t instanceof s?t:new s((function(e){e(t)}))).then(o,a)}d((r=r.apply(e,t\|\|[])).next())}))};Object.defineProperty(t,"__esModule",{value:!0}),t.trampolineAsync=t.trampoline=t.toThunk=t.isThunk=t.THUNK_SYMBOL=t.arrayRemove=t.uuidV4=void 0,t.uuidV4=function(){return"xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/[x]/g,(function(e){const t=16Math.random()\|0;return("x"==e?t:3&t\|8).toString(16)}))},t.arrayRemove=function(e,t){let s=-1,r=e?e.length:0;const i=[];for(;++s<r;){const n=e[s];t(n,s,e)&&(i.push(n),Array.prototype.splice.call(e,s--,1),r--)}return i},t.THUNK_SYMBOL=Symbol("thunk"),t.isThunk=e=>"function"==typeof e&&e.__THUNK__===t.THUNK_SYMBOL,t.toThunk=e=>{const s=()=>e();return s.__THUNK__=t.THUNK_SYMBOL,s},t.trampoline=e=>Object.assign(((...s)=>{let r=e(...s);for(;(0,t.isThunk)(r)&&"function"==typeof r;)r=r();return r}),{cont:(...s)=>(0,t.toThunk)((()=>e(...s)))}),t.trampolineAsync=e=>Object.assign(((...r)=>s(void 0,void 0,void 0,(function(){let s=yield e(...r);for(;(0,t.isThunk)(s)&&"function"==typeof s;)s=yield s();return s}))),{cont:(...s)=>(0,t.toThunk)((()=>e(...s)))})},8802:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.isNumber=t.isObjectWithNumberId=t.isObjectWithNonNumberId=t.isObjectWithoutId=t.isNonNumberNonObjectButDefined=t.parseBySchema=t.binaryTreeNodeValWithId=t.objectWithNumberIdSchema=t.objectWithNonNumberIdSchema=t.keyValueObjectWithIdSchema=t.objectWithoutIdSchema=t.keyValueObjectSchema=t.nonNumberNonObjectButDefinedSchema=void 0;const r=s(8754);function i(e,t){try{return e.parse(t),!0}catch(e){return!1}}t.nonNumberNonObjectButDefinedSchema=r.z.union([r.z.string(),r.z.boolean(),r.z.any()]).nullable(),t.keyValueObjectSchema=r.z.record(r.z.unknown()),t.objectWithoutIdSchema=t.keyValueObjectSchema.refine((e=>!("id"in e)),{message:"Object cannot contain the 'id' field"}),t.keyValueObjectWithIdSchema=r.z.record(r.z.any()).and(r.z.object({id:r.z.union([r.z.string(),r.z.number(),r.z.any()])})),t.objectWithNonNumberIdSchema=r.z.record(r.z.any()).and(r.z.object({id:r.z.union([r.z.string(),r.z.boolean(),r.z.any(),r.z.any(),r.z.undefined()]).nullable()})),t.objectWithNumberIdSchema=r.z.record(r.z.any()).and(r.z.object({id:r.z.number()})),t.binaryTreeNodeValWithId=r.z.union([t.nonNumberNonObjectButDefinedSchema,t.objectWithoutIdSchema,t.objectWithNonNumberIdSchema,t.objectWithNumberIdSchema]),t.parseBySchema=i,t.isNonNumberNonObjectButDefined=function(e){return i(t.nonNumberNonObjectButDefinedSchema,e)},t.isObjectWithoutId=function(e){return i(t.objectWithoutIdSchema,e)},t.isObjectWithNonNumberId=function(e){return i(t.objectWithNonNumberIdSchema,e)},t.isObjectWithNumberId=function(e){return i(t.objectWithNonNumberIdSchema,e)},t.isNumber=function(e){return"number"==typeof e}},8280:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.ZodError=t.quotelessJson=t.ZodIssueCode=void 0;const r=s(9110);t.ZodIssueCode=r.util.arrayToEnum(["invalid_type","invalid_literal","custom","invalid_union","invalid_union_discriminator","invalid_enum_value","unrecognized_keys","invalid_arguments","invalid_return_type","invalid_date","invalid_string","too_small","too_big","invalid_intersection_types","not_multiple_of","not_finite"]),t.quotelessJson=e=>JSON.stringify(e,null,2).replace(/"([^"]+)":/g,"$1:");class i extends Error{constructor(e){super(),this.issues=[],this.addIssue=e=>{this.issues=[...this.issues,e]},this.addIssues=(e=[])=>{this.issues=[...this.issues,...e]};const t=new.target.prototype;Object.setPrototypeOf?Object.setPrototypeOf(this,t):this.__proto__=t,this.name="ZodError",this.issues=e}get errors(){return this.issues}format(e){const t=e\|\|function(e){return e.message},s={_errors:[]},r=e=>{for(const i of e.issues)if("invalid_union"===i.code)i.unionErrors.map(r);else if("invalid_return_type"===i.code)r(i.returnTypeError);else if("invalid_arguments"===i.code)r(i.argumentsError);else if(0===i.path.length)s._errors.push(t(i));else{let e=s,r=0;for(;r<i.path.length;){const s=i.path[r];r===i.path.length-1?(e[s]=e[s]\|\|{_errors:[]},e[s]._errors.push(t(i))):e[s]=e[s]\|\|{_errors:[]},e=e[s],r++}}};return r(this),s}toString(){return this.message}get message(){return JSON.stringify(this.issues,r.util.jsonStringifyReplacer,2)}get isEmpty(){return 0===this.issues.length}flatten(e=(e=>e.message)){const t={},s=[];for(const r of this.issues)r.path.length>0?(t[r.path[0]]=t[r.path[0]]\|\|[],t[r.path[0]].push(e(r))):s.push(e(r));return{formErrors:s,fieldErrors:t}}get formErrors(){return this.flatten()}}t.ZodError=i,i.create=e=>new i(e)},6996:function(e,t,s){var r=this&&this.__importDefault\|\|function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:!0}),t.getErrorMap=t.setErrorMap=t.defaultErrorMap=void 0;const i=r(s(9349));t.defaultErrorMap=i.default;let n=i.default;t.setErrorMap=function(e){n=e},t.getErrorMap=function(){return n}},6349:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s),Object.defineProperty(e,r,{enumerable:!0,get:function(){return t[s]}})}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),i(s(6996),t),i(s(3187),t),i(s(116),t),i(s(9110),t),i(s(5433),t),i(s(8280),t)},8762:(e,t)=>{var s;Object.defineProperty(t,"__esModule",{value:!0}),t.errorUtil=void 0,(s=t.errorUtil\|\|(t.errorUtil={})).errToObj=e=>"string"==typeof e?{message:e}:e\|\|{},s.toString=e=>"string"==typeof e?e:null==e?void 0:e.message},3187:function(e,t,s){var r=this&&this.__importDefault\|\|function(e){return e&&e.__esModule?e:{default:e}};Object.defineProperty(t,"__esModule",{value:!0}),t.isAsync=t.isValid=t.isDirty=t.isAborted=t.OK=t.DIRTY=t.INVALID=t.ParseStatus=t.addIssueToContext=t.EMPTY_PATH=t.makeIssue=void 0;const i=s(6996),n=r(s(9349));t.makeIssue=e=>{const{data:t,path:s,errorMaps:r,issueData:i}=e,n=[...s,...i.path\|\|[]],o={...i,path:n};let a="";const d=r.filter((e=>!!e)).slice().reverse();for(const e of d)a=e(o,{data:t,defaultError:a}).message;return{...i,path:n,message:i.message\|\|a}},t.EMPTY_PATH=[],t.addIssueToContext=function(e,s){const r=(0,t.makeIssue)({issueData:s,data:e.data,path:e.path,errorMaps:[e.common.contextualErrorMap,e.schemaErrorMap,(0,i.getErrorMap)(),n.default].filter((e=>!!e))});e.common.issues.push(r)};class o{constructor(){this.value="valid"}dirty(){"valid"===this.value&&(this.value="dirty")}abort(){"aborted"!==this.value&&(this.value="aborted")}static mergeArray(e,s){const r=[];for(const i of s){if("aborted"===i.status)return t.INVALID;"dirty"===i.status&&e.dirty(),r.push(i.value)}return{status:e.value,value:r}}static async mergeObjectAsync(e,t){const s=[];for(const e of t)s.push({key:await e.key,value:await e.value});return o.mergeObjectSync(e,s)}static mergeObjectSync(e,s){const r={};for(const i of s){const{key:s,value:n}=i;if("aborted"===s.status)return t.INVALID;if("aborted"===n.status)return t.INVALID;"dirty"===s.status&&e.dirty(),"dirty"===n.status&&e.dirty(),"__proto__"===s.value\|\|void 0===n.value&&!i.alwaysSet\|\|(r[s.value]=n.value)}return{status:e.value,value:r}}}t.ParseStatus=o,t.INVALID=Object.freeze({status:"aborted"}),t.DIRTY=e=>({status:"dirty",value:e}),t.OK=e=>({status:"valid",value:e}),t.isAborted=e=>"aborted"===e.status,t.isDirty=e=>"dirty"===e.status,t.isValid=e=>"valid"===e.status,t.isAsync=e=>"undefined"!=typeof Promise&&e instanceof Promise},116:(e,t)=>{Object.defineProperty(t,"__esModule",{value:!0})},9110:(e,t)=>{var s;Object.defineProperty(t,"__esModule",{value:!0}),t.getParsedType=t.ZodParsedType=t.objectUtil=t.util=void 0,function(e){e.assertEqual=e=>e,e.assertIs=function(e){},e.assertNever=function(e){throw new Error},e.arrayToEnum=e=>{const t={};for(const s of e)t[s]=s;return t},e.getValidEnumValues=t=>{const s=e.objectKeys(t).filter((e=>"number"!=typeof t[t[e]])),r={};for(const e of s)r[e]=t[e];return e.objectValues(r)},e.objectValues=t=>e.objectKeys(t).map((function(e){return t[e]})),e.objectKeys="function"==typeof Object.keys?e=>Object.keys(e):e=>{const t=[];for(const s in e)Object.prototype.hasOwnProperty.call(e,s)&&t.push(s);return t},e.find=(e,t)=>{for(const s of e)if(t(s))return s},e.isInteger="function"==typeof Number.isInteger?e=>Number.isInteger(e):e=>"number"==typeof e&&isFinite(e)&&Math.floor(e)===e,e.joinValues=function(e,t=" \| "){return e.map((e=>"string"==typeof e?`'${e}'`:e)).join(t)},e.jsonStringifyReplacer=(e,t)=>"bigint"==typeof t?t.toString():t}(s=t.util\|\|(t.util={})),(t.objectUtil\|\|(t.objectUtil={})).mergeShapes=(e,t)=>({...e,...t}),t.ZodParsedType=s.arrayToEnum(["string","nan","number","integer","float","boolean","date","bigint","symbol","function","undefined","null","array","object","unknown","promise","void","never","map","set"]),t.getParsedType=e=>{switch(typeof e){case"undefined":return t.ZodParsedType.undefined;case"string":return t.ZodParsedType.string;case"number":return isNaN(e)?t.ZodParsedType.nan:t.ZodParsedType.number;case"boolean":return t.ZodParsedType.boolean;case"function":return t.ZodParsedType.function;case"bigint":return t.ZodParsedType.bigint;case"symbol":return t.ZodParsedType.symbol;case"object":return Array.isArray(e)?t.ZodParsedType.array:null===e?t.ZodParsedType.null:e.then&&"function"==typeof e.then&&e.catch&&"function"==typeof e.catch?t.ZodParsedType.promise:"undefined"!=typeof Map&&e instanceof Map?t.ZodParsedType.map:"undefined"!=typeof Set&&e instanceof Set?t.ZodParsedType.set:"undefined"!=typeof Date&&e instanceof Date?t.ZodParsedType.date:t.ZodParsedType.object;default:return t.ZodParsedType.unknown}}},8754:function(e,t,s){var r=this&&this.__createBinding\|\|(Object.create?function(e,t,s,r){void 0===r&&(r=s),Object.defineProperty(e,r,{enumerable:!0,get:function(){return t[s]}})}:function(e,t,s,r){void 0===r&&(r=s),e[r]=t[s]}),i=this&&this.__setModuleDefault\|\|(Object.create?function(e,t){Object.defineProperty(e,"default",{enumerable:!0,value:t})}:function(e,t){e.default=t}),n=this&&this.__importStar\|\|function(e){if(e&&e.__esModule)return e;var t={};if(null!=e)for(var s in e)"default"!==s&&Object.prototype.hasOwnProperty.call(e,s)&&r(t,e,s);return i(t,e),t},o=this&&this.__exportStar\|\|function(e,t){for(var s in e)"default"===s\|\|Object.prototype.hasOwnProperty.call(t,s)\|\|r(t,e,s)};Object.defineProperty(t,"__esModule",{value:!0}),t.z=void 0;const a=n(s(6349));t.z=a,o(s(6349),t),t.default=a},9349:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0});const r=s(9110),i=s(8280);t.default=(e,t)=>{let s;switch(e.code){case i.ZodIssueCode.invalid_type:s=e.received===r.ZodParsedType.undefined?"Required":`Expected ${e.expected}, received ${e.received}`;break;case i.ZodIssueCode.invalid_literal:s=`Invalid literal value, expected ${JSON.stringify(e.expected,r.util.jsonStringifyReplacer)}`;break;case i.ZodIssueCode.unrecognized_keys:s=`Unrecognized key(s) in object: ${r.util.joinValues(e.keys,", ")}`;break;case i.ZodIssueCode.invalid_union:s="Invalid input";break;case i.ZodIssueCode.invalid_union_discriminator:s=`Invalid discriminator value. Expected ${r.util.joinValues(e.options)}`;break;case i.ZodIssueCode.invalid_enum_value:s=`Invalid enum value. Expected ${r.util.joinValues(e.options)}, received '${e.received}'`;break;case i.ZodIssueCode.invalid_arguments:s="Invalid function arguments";break;case i.ZodIssueCode.invalid_return_type:s="Invalid function return type";break;case i.ZodIssueCode.invalid_date:s="Invalid date";break;case i.ZodIssueCode.invalid_string:"object"==typeof e.validation?"includes"in e.validation?(s=`Invalid input: must include "${e.validation.includes}"`,"number"==typeof e.validation.position&&(s=`${s} at one or more positions greater than or equal to ${e.validation.position}`)):"startsWith"in e.validation?s=`Invalid input: must start with "${e.validation.startsWith}"`:"endsWith"in e.validation?s=`Invalid input: must end with "${e.validation.endsWith}"`:r.util.assertNever(e.validation):s="regex"!==e.validation?`Invalid ${e.validation}`:"Invalid";break;case i.ZodIssueCode.too_small:s="array"===e.type?`Array must contain ${e.exact?"exactly":e.inclusive?"at least":"more than"} ${e.minimum} element(s)`:"string"===e.type?`String must contain ${e.exact?"exactly":e.inclusive?"at least":"over"} ${e.minimum} character(s)`:"number"===e.type?`Number must be ${e.exact?"exactly equal to ":e.inclusive?"greater than or equal to ":"greater than "}${e.minimum}`:"date"===e.type?`Date must be ${e.exact?"exactly equal to ":e.inclusive?"greater than or equal to ":"greater than "}${new Date(Number(e.minimum))}`:"Invalid input";break;case i.ZodIssueCode.too_big:s="array"===e.type?`Array must contain ${e.exact?"exactly":e.inclusive?"at most":"less than"} ${e.maximum} element(s)`:"string"===e.type?`String must contain ${e.exact?"exactly":e.inclusive?"at most":"under"} ${e.maximum} character(s)`:"number"===e.type?`Number must be ${e.exact?"exactly":e.inclusive?"less than or equal to":"less than"} ${e.maximum}`:"bigint"===e.type?`BigInt must be ${e.exact?"exactly":e.inclusive?"less than or equal to":"less than"} ${e.maximum}`:"date"===e.type?`Date must be ${e.exact?"exactly":e.inclusive?"smaller than or equal to":"smaller than"} ${new Date(Number(e.maximum))}`:"Invalid input";break;case i.ZodIssueCode.custom:s="Invalid input";break;case i.ZodIssueCode.invalid_intersection_types:s="Intersection results could not be merged";break;case i.ZodIssueCode.not_multiple_of:s=`Number must be a multiple of ${e.multipleOf}`;break;case i.ZodIssueCode.not_finite:s="Number must be finite";break;default:s=t.defaultError,r.util.assertNever(e)}return{message:s}}},5433:(e,t,s)=>{Object.defineProperty(t,"__esModule",{value:!0}),t.date=t.boolean=t.bigint=t.array=t.any=t.coerce=t.ZodFirstPartyTypeKind=t.late=t.ZodSchema=t.Schema=t.custom=t.ZodReadonly=t.ZodPipeline=t.ZodBranded=t.BRAND=t.ZodNaN=t.ZodCatch=t.ZodDefault=t.ZodNullable=t.ZodOptional=t.ZodTransformer=t.ZodEffects=t.ZodPromise=t.ZodNativeEnum=t.ZodEnum=t.ZodLiteral=t.ZodLazy=t.ZodFunction=t.ZodSet=t.ZodMap=t.ZodRecord=t.ZodTuple=t.ZodIntersection=t.ZodDiscriminatedUnion=t.ZodUnion=t.ZodObject=t.ZodArray=t.ZodVoid=t.ZodNever=t.ZodUnknown=t.ZodAny=t.ZodNull=t.ZodUndefined=t.ZodSymbol=t.ZodDate=t.ZodBoolean=t.ZodBigInt=t.ZodNumber=t.ZodString=t.ZodType=void 0,t.NEVER=t.void=t.unknown=t.union=t.undefined=t.tuple=t.transformer=t.symbol=t.string=t.strictObject=t.set=t.record=t.promise=t.preprocess=t.pipeline=t.ostring=t.optional=t.onumber=t.oboolean=t.object=t.number=t.nullable=t.null=t.never=t.nativeEnum=t.nan=t.map=t.literal=t.lazy=t.intersection=t.instanceof=t.function=t.enum=t.effect=t.discriminatedUnion=void 0;const r=s(6996),i=s(8762),n=s(3187),o=s(9110),a=s(8280);class d{constructor(e,t,s,r){this._cachedPath=[],this.parent=e,this.data=t,this._path=s,this._key=r}get path(){return this._cachedPath.length\|\|(this._key instanceof Array?this._cachedPath.push(...this._path,...this._key):this._cachedPath.push(...this._path,this._key)),this._cachedPath}}const u=(e,t)=>{if((0,n.isValid)(t))return{success:!0,data:t.value};if(!e.common.issues.length)throw new Error("Validation failed but no issues detected.");return{success:!1,get error(){if(this._error)return this._error;const t=new a.ZodError(e.common.issues);return this._error=t,this._error}}};function l(e){if(!e)return{};const{errorMap:t,invalid_type_error:s,required_error:r,description:i}=e;if(t&&(s\|\|r))throw new Error('Can\'t use "invalid_type_error" or "required_error" in conjunction with custom error map.');return t?{errorMap:t,description:i}:{errorMap:(e,t)=>"invalid_type"!==e.code?{message:t.defaultError}:void 0===t.data?{message:null!=r?r:t.defaultError}:{message:null!=s?s:t.defaultError},description:i}}class h{constructor(e){this.spa=this.safeParseAsync,this._def=e,this.parse=this.parse.bind(this),this.safeParse=this.safeParse.bind(this),this.parseAsync=this.parseAsync.bind(this),this.safeParseAsync=this.safeParseAsync.bind(this),this.spa=this.spa.bind(this),this.refine=this.refine.bind(this),this.refinement=this.refinement.bind(this),this.superRefine=this.superRefine.bind(this),this.optional=this.optional.bind(this),this.nullable=this.nullable.bind(this),this.nullish=this.nullish.bind(this),this.array=this.array.bind(this),this.promise=this.promise.bind(this),this.or=this.or.bind(this),this.and=this.and.bind(this),this.transform=this.transform.bind(this),this.brand=this.brand.bind(this),this.default=this.default.bind(this),this.catch=this.catch.bind(this),this.describe=this.describe.bind(this),this.pipe=this.pipe.bind(this),this.readonly=this.readonly.bind(this),this.isNullable=this.isNullable.bind(this),this.isOptional=this.isOptional.bind(this)}get description(){return this._def.description}_getType(e){return(0,o.getParsedType)(e.data)}_getOrReturnCtx(e,t){return t\|\|{common:e.parent.common,data:e.data,parsedType:(0,o.getParsedType)(e.data),schemaErrorMap:this._def.errorMap,path:e.path,parent:e.parent}}_processInputParams(e){return{status:new n.ParseStatus,ctx:{common:e.parent.common,data:e.data,parsedType:(0,o.getParsedType)(e.data),schemaErrorMap:this._def.errorMap,path:e.path,parent:e.parent}}}_parseSync(e){const t=this._parse(e);if((0,n.isAsync)(t))throw new Error("Synchronous parse encountered promise.");return t}_parseAsync(e){const t=this._parse(e);return Promise.resolve(t)}parse(e,t){const s=this.safeParse(e,t);if(s.success)return s.data;throw s.error}safeParse(e,t){var s;const r={common:{issues:[],async:null!==(s=null==t?void 0:t.async)&&void 0!==s&&s,contextualErrorMap:null==t?void 0:t.errorMap},path:(null==t?void 0:t.path)\|\|[],schemaErrorMap:this._def.errorMap,parent:null,data:e,parsedType:(0,o.getParsedType)(e)},i=this._parseSync({data:e,path:r.path,parent:r});return u(r,i)}async parseAsync(e,t){const s=await this.safeParseAsync(e,t);if(s.success)return s.data;throw s.error}async safeParseAsync(e,t){const s={common:{issues:[],contextualErrorMap:null==t?void 0:t.errorMap,async:!0},path:(null==t?void 0:t.path)\|\|[],schemaErrorMap:this._def.errorMap,parent:null,data:e,parsedType:(0,o.getParsedType)(e)},r=this._parse({data:e,path:s.path,parent:s}),i=await((0,n.isAsync)(r)?r:Promise.resolve(r));return u(s,i)}refine(e,t){const s=e=>"string"==typeof t\|\|void 0===t?{message:t}:"function"==typeof t?t(e):t;return this._refinement(((t,r)=>{const i=e(t),n=()=>r.addIssue({code:a.ZodIssueCode.custom,...s(t)});return"undefined"!=typeof Promise&&i instanceof Promise?i.then((e=>!!e\|\|(n(),!1))):!!i\|\|(n(),!1)}))}refinement(e,t){return this._refinement(((s,r)=>!!e(s)\|\|(r.addIssue("function"==typeof t?t(s,r):t),!1)))}_refinement(e){return new J({schema:this,typeName:ae.ZodEffects,effect:{type:"refinement",refinement:e}})}superRefine(e){return this._refinement(e)}optional(){return X.create(this,this._def)}nullable(){return ee.create(this,this._def)}nullish(){return this.nullable().optional()}array(){return k.create(this,this._def)}promise(){return Y.create(this,this._def)}or(e){return R.create([this,e],this._def)}and(e){return z.create(this,e,this._def)}transform(e){return new J({...l(this._def),schema:this,typeName:ae.ZodEffects,effect:{type:"transform",transform:e}})}default(e){const t="function"==typeof e?e:()=>e;return new te({...l(this._def),innerType:this,defaultValue:t,typeName:ae.ZodDefault})}brand(){return new ie({typeName:ae.ZodBranded,type:this,...l(this._def)})}catch(e){const t="function"==typeof e?e:()=>e;return new se({...l(this._def),innerType:this,catchValue:t,typeName:ae.ZodCatch})}describe(e){return new(0,this.constructor)({...this._def,description:e})}pipe(e){return ne.create(this,e)}readonly(){return oe.create(this)}isOptional(){return this.safeParse(void 0).success}isNullable(){return this.safeParse(null).success}}t.ZodType=h,t.Schema=h,t.ZodSchema=h;const c=/^c[^\s-]{8,}$/i,p=/^[a-z][a-z0-9]$/,f=/[0-9A-HJKMNP-TV-Z]{26}/,_=/^[0-9a-fA-F]{8}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{4}\b-[0-9a-fA-F]{12}$/i,g=/^([A-Z0-9_+-]+\.?)[A-Z0-9_+-]@([A-Z0-9][A-Z0-9\-]*\.)+[A-Z]{2,}$/i,m=/^(\p{Extended_Pictographic}\|\p{Emoji_Component})+$/u,v=/^(((25[0-5])\|(2[0-4][0-9])\|(1[0-9]{2})\|([0-9]{1,2}))\.){3}((25[0-5])\|(2[0-4][0-9])\|(1[0-9]{2})\|([0-9]{1,2}))$/,y=/^(([a-f0-9]{1,4}:){7}\|::([a-f0-9]{1,4}:){0,6}\|([a-f0-9]{1,4}:){1}:([a-f0-9]{1,4}:){0,5}\|([a-f0-9]{1,4}:){2}:([a-f0-9]{1,4}:){0,4}\|([a-f0-9]{1,4}:){3}:([a-f0-9]{1,4}:){0,3}\|([a-f0-9]{1,4}:){4}:([a-f0-9]{1,4}:){0,2}\|([a-f0-9]{1,4}:){5}:([a-f0-9]{1,4}:){0,1})([a-f0-9]{1,4}\|(((25[0-5])\|(2[0-4][0-9])\|(1[0-9]{2})\|([0-9]{1,2}))\.){3}((25[0-5])\|(2[0-4][0-9])\|(1[0-9]{2})\|([0-9]{1,2})))$/;class b extends h{constructor(){super(...arguments),this._regex=(e,t,s)=>this.refinement((t=>e.test(t)),{validation:t,code:a.ZodIssueCode.invalid_string,...i.errorUtil.errToObj(s)}),this.nonempty=e=>this.min(1,i.errorUtil.errToObj(e)),this.trim=()=>new b({...this._def,checks:[...this._def.checks,{kind:"trim"}]}),this.toLowerCase=()=>new b({...this._def,checks:[...this._def.checks,{kind:"toLowerCase"}]}),this.toUpperCase=()=>new b({...this._def,checks:[...this._def.checks,{kind:"toUpperCase"}]})}_parse(e){if(this._def.coerce&&(e.data=String(e.data)),this._getType(e)!==o.ZodParsedType.string){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.string,received:t.parsedType}),n.INVALID}const t=new n.ParseStatus;let s;for(const u of this._def.checks)if("min"===u.kind)e.data.length<u.value&&(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_small,minimum:u.value,type:"string",inclusive:!0,exact:!1,message:u.message}),t.dirty());else if("max"===u.kind)e.data.length>u.value&&(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_big,maximum:u.value,type:"string",inclusive:!0,exact:!1,message:u.message}),t.dirty());else if("length"===u.kind){const r=e.data.length>u.value,i=e.data.length<u.value;(r\|\|i)&&(s=this._getOrReturnCtx(e,s),r?(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_big,maximum:u.value,type:"string",inclusive:!0,exact:!0,message:u.message}):i&&(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_small,minimum:u.value,type:"string",inclusive:!0,exact:!0,message:u.message}),t.dirty())}else if("email"===u.kind)g.test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"email",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty());else if("emoji"===u.kind)m.test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"emoji",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty());else if("uuid"===u.kind)_.test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"uuid",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty());else if("cuid"===u.kind)c.test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"cuid",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty());else if("cuid2"===u.kind)p.test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"cuid2",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty());else if("ulid"===u.kind)f.test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"ulid",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty());else if("url"===u.kind)try{new URL(e.data)}catch(r){s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"url",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty()}else"regex"===u.kind?(u.regex.lastIndex=0,u.regex.test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"regex",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty())):"trim"===u.kind?e.data=e.data.trim():"includes"===u.kind?e.data.includes(u.value,u.position)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_string,validation:{includes:u.value,position:u.position},message:u.message}),t.dirty()):"toLowerCase"===u.kind?e.data=e.data.toLowerCase():"toUpperCase"===u.kind?e.data=e.data.toUpperCase():"startsWith"===u.kind?e.data.startsWith(u.value)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_string,validation:{startsWith:u.value},message:u.message}),t.dirty()):"endsWith"===u.kind?e.data.endsWith(u.value)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_string,validation:{endsWith:u.value},message:u.message}),t.dirty()):"datetime"===u.kind?((d=u).precision?d.offset?new RegExp(`^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}\\.\\d{${d.precision}}(([+-]\\d{2}(:?\\d{2})?)\|Z)$`):new RegExp(`^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}\\.\\d{${d.precision}}Z$`):0===d.precision?d.offset?new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(([+-]\\d{2}(:?\\d{2})?)\|Z)$"):new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}Z$"):d.offset?new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(\\.\\d+)?(([+-]\\d{2}(:?\\d{2})?)\|Z)$"):new RegExp("^\\d{4}-\\d{2}-\\d{2}T\\d{2}:\\d{2}:\\d{2}(\\.\\d+)?Z$")).test(e.data)\|\|(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_string,validation:"datetime",message:u.message}),t.dirty()):"ip"===u.kind?(r=e.data,("v4"!==(i=u.version)&&i\|\|!v.test(r))&&("v6"!==i&&i\|\|!y.test(r))&&(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{validation:"ip",code:a.ZodIssueCode.invalid_string,message:u.message}),t.dirty())):o.util.assertNever(u);var r,i,d;return{status:t.value,value:e.data}}_addCheck(e){return new b({...this._def,checks:[...this._def.checks,e]})}email(e){return this._addCheck({kind:"email",...i.errorUtil.errToObj(e)})}url(e){return this._addCheck({kind:"url",...i.errorUtil.errToObj(e)})}emoji(e){return this._addCheck({kind:"emoji",...i.errorUtil.errToObj(e)})}uuid(e){return this._addCheck({kind:"uuid",...i.errorUtil.errToObj(e)})}cuid(e){return this._addCheck({kind:"cuid",...i.errorUtil.errToObj(e)})}cuid2(e){return this._addCheck({kind:"cuid2",...i.errorUtil.errToObj(e)})}ulid(e){return this._addCheck({kind:"ulid",...i.errorUtil.errToObj(e)})}ip(e){return this._addCheck({kind:"ip",...i.errorUtil.errToObj(e)})}datetime(e){var t;return"string"==typeof e?this._addCheck({kind:"datetime",precision:null,offset:!1,message:e}):this._addCheck({kind:"datetime",precision:void 0===(null==e?void 0:e.precision)?null:null==e?void 0:e.precision,offset:null!==(t=null==e?void 0:e.offset)&&void 0!==t&&t,...i.errorUtil.errToObj(null==e?void 0:e.message)})}regex(e,t){return this._addCheck({kind:"regex",regex:e,...i.errorUtil.errToObj(t)})}includes(e,t){return this._addCheck({kind:"includes",value:e,position:null==t?void 0:t.position,...i.errorUtil.errToObj(null==t?void 0:t.message)})}startsWith(e,t){return this._addCheck({kind:"startsWith",value:e,...i.errorUtil.errToObj(t)})}endsWith(e,t){return this._addCheck({kind:"endsWith",value:e,...i.errorUtil.errToObj(t)})}min(e,t){return this._addCheck({kind:"min",value:e,...i.errorUtil.errToObj(t)})}max(e,t){return this._addCheck({kind:"max",value:e,...i.errorUtil.errToObj(t)})}length(e,t){return this._addCheck({kind:"length",value:e,...i.errorUtil.errToObj(t)})}get isDatetime(){return!!this._def.checks.find((e=>"datetime"===e.kind))}get isEmail(){return!!this._def.checks.find((e=>"email"===e.kind))}get isURL(){return!!this._def.checks.find((e=>"url"===e.kind))}get isEmoji(){return!!this._def.checks.find((e=>"emoji"===e.kind))}get isUUID(){return!!this._def.checks.find((e=>"uuid"===e.kind))}get isCUID(){return!!this._def.checks.find((e=>"cuid"===e.kind))}get isCUID2(){return!!this._def.checks.find((e=>"cuid2"===e.kind))}get isULID(){return!!this._def.checks.find((e=>"ulid"===e.kind))}get isIP(){return!!this._def.checks.find((e=>"ip"===e.kind))}get minLength(){let e=null;for(const t of this._def.checks)"min"===t.kind&&(null===e\|\|t.value>e)&&(e=t.value);return e}get maxLength(){let e=null;for(const t of this._def.checks)"max"===t.kind&&(null===e\|\|t.value<e)&&(e=t.value);return e}}function x(e,t){const s=(e.toString().split(".")[1]\|\|"").length,r=(t.toString().split(".")[1]\|\|"").length,i=s>r?s:r;return parseInt(e.toFixed(i).replace(".",""))%parseInt(t.toFixed(i).replace(".",""))/Math.pow(10,i)}t.ZodString=b,b.create=e=>{var t;return new b({checks:[],typeName:ae.ZodString,coerce:null!==(t=null==e?void 0:e.coerce)&&void 0!==t&&t,...l(e)})};class T extends h{constructor(){super(...arguments),this.min=this.gte,this.max=this.lte,this.step=this.multipleOf}_parse(e){if(this._def.coerce&&(e.data=Number(e.data)),this._getType(e)!==o.ZodParsedType.number){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.number,received:t.parsedType}),n.INVALID}let t;const s=new n.ParseStatus;for(const r of this._def.checks)"int"===r.kind?o.util.isInteger(e.data)\|\|(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:"integer",received:"float",message:r.message}),s.dirty()):"min"===r.kind?(r.inclusive?e.data<r.value:e.data<=r.value)&&(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.too_small,minimum:r.value,type:"number",inclusive:r.inclusive,exact:!1,message:r.message}),s.dirty()):"max"===r.kind?(r.inclusive?e.data>r.value:e.data>=r.value)&&(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.too_big,maximum:r.value,type:"number",inclusive:r.inclusive,exact:!1,message:r.message}),s.dirty()):"multipleOf"===r.kind?0!==x(e.data,r.value)&&(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.not_multiple_of,multipleOf:r.value,message:r.message}),s.dirty()):"finite"===r.kind?Number.isFinite(e.data)\|\|(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.not_finite,message:r.message}),s.dirty()):o.util.assertNever(r);return{status:s.value,value:e.data}}gte(e,t){return this.setLimit("min",e,!0,i.errorUtil.toString(t))}gt(e,t){return this.setLimit("min",e,!1,i.errorUtil.toString(t))}lte(e,t){return this.setLimit("max",e,!0,i.errorUtil.toString(t))}lt(e,t){return this.setLimit("max",e,!1,i.errorUtil.toString(t))}setLimit(e,t,s,r){return new T({...this._def,checks:[...this._def.checks,{kind:e,value:t,inclusive:s,message:i.errorUtil.toString(r)}]})}_addCheck(e){return new T({...this._def,checks:[...this._def.checks,e]})}int(e){return this._addCheck({kind:"int",message:i.errorUtil.toString(e)})}positive(e){return this._addCheck({kind:"min",value:0,inclusive:!1,message:i.errorUtil.toString(e)})}negative(e){return this._addCheck({kind:"max",value:0,inclusive:!1,message:i.errorUtil.toString(e)})}nonpositive(e){return this._addCheck({kind:"max",value:0,inclusive:!0,message:i.errorUtil.toString(e)})}nonnegative(e){return this._addCheck({kind:"min",value:0,inclusive:!0,message:i.errorUtil.toString(e)})}multipleOf(e,t){return this._addCheck({kind:"multipleOf",value:e,message:i.errorUtil.toString(t)})}finite(e){return this._addCheck({kind:"finite",message:i.errorUtil.toString(e)})}safe(e){return this._addCheck({kind:"min",inclusive:!0,value:Number.MIN_SAFE_INTEGER,message:i.errorUtil.toString(e)})._addCheck({kind:"max",inclusive:!0,value:Number.MAX_SAFE_INTEGER,message:i.errorUtil.toString(e)})}get minValue(){let e=null;for(const t of this._def.checks)"min"===t.kind&&(null===e\|\|t.value>e)&&(e=t.value);return e}get maxValue(){let e=null;for(const t of this._def.checks)"max"===t.kind&&(null===e\|\|t.value<e)&&(e=t.value);return e}get isInt(){return!!this._def.checks.find((e=>"int"===e.kind\|\|"multipleOf"===e.kind&&o.util.isInteger(e.value)))}get isFinite(){let e=null,t=null;for(const s of this._def.checks){if("finite"===s.kind\|\|"int"===s.kind\|\|"multipleOf"===s.kind)return!0;"min"===s.kind?(null===t\|\|s.value>t)&&(t=s.value):"max"===s.kind&&(null===e\|\|s.value<e)&&(e=s.value)}return Number.isFinite(t)&&Number.isFinite(e)}}t.ZodNumber=T,T.create=e=>new T({checks:[],typeName:ae.ZodNumber,coerce:(null==e?void 0:e.coerce)\|\|!1,...l(e)});class P extends h{constructor(){super(...arguments),this.min=this.gte,this.max=this.lte}_parse(e){if(this._def.coerce&&(e.data=BigInt(e.data)),this._getType(e)!==o.ZodParsedType.bigint){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.bigint,received:t.parsedType}),n.INVALID}let t;const s=new n.ParseStatus;for(const r of this._def.checks)"min"===r.kind?(r.inclusive?e.data<r.value:e.data<=r.value)&&(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.too_small,type:"bigint",minimum:r.value,inclusive:r.inclusive,message:r.message}),s.dirty()):"max"===r.kind?(r.inclusive?e.data>r.value:e.data>=r.value)&&(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.too_big,type:"bigint",maximum:r.value,inclusive:r.inclusive,message:r.message}),s.dirty()):"multipleOf"===r.kind?e.data%r.value!==BigInt(0)&&(t=this._getOrReturnCtx(e,t),(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.not_multiple_of,multipleOf:r.value,message:r.message}),s.dirty()):o.util.assertNever(r);return{status:s.value,value:e.data}}gte(e,t){return this.setLimit("min",e,!0,i.errorUtil.toString(t))}gt(e,t){return this.setLimit("min",e,!1,i.errorUtil.toString(t))}lte(e,t){return this.setLimit("max",e,!0,i.errorUtil.toString(t))}lt(e,t){return this.setLimit("max",e,!1,i.errorUtil.toString(t))}setLimit(e,t,s,r){return new P({...this._def,checks:[...this._def.checks,{kind:e,value:t,inclusive:s,message:i.errorUtil.toString(r)}]})}_addCheck(e){return new P({...this._def,checks:[...this._def.checks,e]})}positive(e){return this._addCheck({kind:"min",value:BigInt(0),inclusive:!1,message:i.errorUtil.toString(e)})}negative(e){return this._addCheck({kind:"max",value:BigInt(0),inclusive:!1,message:i.errorUtil.toString(e)})}nonpositive(e){return this._addCheck({kind:"max",value:BigInt(0),inclusive:!0,message:i.errorUtil.toString(e)})}nonnegative(e){return this._addCheck({kind:"min",value:BigInt(0),inclusive:!0,message:i.errorUtil.toString(e)})}multipleOf(e,t){return this._addCheck({kind:"multipleOf",value:e,message:i.errorUtil.toString(t)})}get minValue(){let e=null;for(const t of this._def.checks)"min"===t.kind&&(null===e\|\|t.value>e)&&(e=t.value);return e}get maxValue(){let e=null;for(const t of this._def.checks)"max"===t.kind&&(null===e\|\|t.value<e)&&(e=t.value);return e}}t.ZodBigInt=P,P.create=e=>{var t;return new P({checks:[],typeName:ae.ZodBigInt,coerce:null!==(t=null==e?void 0:e.coerce)&&void 0!==t&&t,...l(e)})};class O extends h{_parse(e){if(this._def.coerce&&(e.data=Boolean(e.data)),this._getType(e)!==o.ZodParsedType.boolean){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.boolean,received:t.parsedType}),n.INVALID}return(0,n.OK)(e.data)}}t.ZodBoolean=O,O.create=e=>new O({typeName:ae.ZodBoolean,coerce:(null==e?void 0:e.coerce)\|\|!1,...l(e)});class I extends h{_parse(e){if(this._def.coerce&&(e.data=new Date(e.data)),this._getType(e)!==o.ZodParsedType.date){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.date,received:t.parsedType}),n.INVALID}if(isNaN(e.data.getTime())){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_date}),n.INVALID}const t=new n.ParseStatus;let s;for(const r of this._def.checks)"min"===r.kind?e.data.getTime()<r.value&&(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_small,message:r.message,inclusive:!0,exact:!1,minimum:r.value,type:"date"}),t.dirty()):"max"===r.kind?e.data.getTime()>r.value&&(s=this._getOrReturnCtx(e,s),(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_big,message:r.message,inclusive:!0,exact:!1,maximum:r.value,type:"date"}),t.dirty()):o.util.assertNever(r);return{status:t.value,value:new Date(e.data.getTime())}}_addCheck(e){return new I({...this._def,checks:[...this._def.checks,e]})}min(e,t){return this._addCheck({kind:"min",value:e.getTime(),message:i.errorUtil.toString(t)})}max(e,t){return this._addCheck({kind:"max",value:e.getTime(),message:i.errorUtil.toString(t)})}get minDate(){let e=null;for(const t of this._def.checks)"min"===t.kind&&(null===e\|\|t.value>e)&&(e=t.value);return null!=e?new Date(e):null}get maxDate(){let e=null;for(const t of this._def.checks)"max"===t.kind&&(null===e\|\|t.value<e)&&(e=t.value);return null!=e?new Date(e):null}}t.ZodDate=I,I.create=e=>new I({checks:[],coerce:(null==e?void 0:e.coerce)\|\|!1,typeName:ae.ZodDate,...l(e)});class w extends h{_parse(e){if(this._getType(e)!==o.ZodParsedType.symbol){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.symbol,received:t.parsedType}),n.INVALID}return(0,n.OK)(e.data)}}t.ZodSymbol=w,w.create=e=>new w({typeName:ae.ZodSymbol,...l(e)});class Z extends h{_parse(e){if(this._getType(e)!==o.ZodParsedType.undefined){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.undefined,received:t.parsedType}),n.INVALID}return(0,n.OK)(e.data)}}t.ZodUndefined=Z,Z.create=e=>new Z({typeName:ae.ZodUndefined,...l(e)});class C extends h{_parse(e){if(this._getType(e)!==o.ZodParsedType.null){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.null,received:t.parsedType}),n.INVALID}return(0,n.OK)(e.data)}}t.ZodNull=C,C.create=e=>new C({typeName:ae.ZodNull,...l(e)});class j extends h{constructor(){super(...arguments),this._any=!0}_parse(e){return(0,n.OK)(e.data)}}t.ZodAny=j,j.create=e=>new j({typeName:ae.ZodAny,...l(e)});class N extends h{constructor(){super(...arguments),this._unknown=!0}_parse(e){return(0,n.OK)(e.data)}}t.ZodUnknown=N,N.create=e=>new N({typeName:ae.ZodUnknown,...l(e)});class M extends h{_parse(e){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.never,received:t.parsedType}),n.INVALID}}t.ZodNever=M,M.create=e=>new M({typeName:ae.ZodNever,...l(e)});class E extends h{_parse(e){if(this._getType(e)!==o.ZodParsedType.undefined){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.void,received:t.parsedType}),n.INVALID}return(0,n.OK)(e.data)}}t.ZodVoid=E,E.create=e=>new E({typeName:ae.ZodVoid,...l(e)});class k extends h{_parse(e){const{ctx:t,status:s}=this._processInputParams(e),r=this._def;if(t.parsedType!==o.ZodParsedType.array)return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.array,received:t.parsedType}),n.INVALID;if(null!==r.exactLength){const e=t.data.length>r.exactLength.value,i=t.data.length<r.exactLength.value;(e\|\|i)&&((0,n.addIssueToContext)(t,{code:e?a.ZodIssueCode.too_big:a.ZodIssueCode.too_small,minimum:i?r.exactLength.value:void 0,maximum:e?r.exactLength.value:void 0,type:"array",inclusive:!0,exact:!0,message:r.exactLength.message}),s.dirty())}if(null!==r.minLength&&t.data.length<r.minLength.value&&((0,n.addIssueToContext)(t,{code:a.ZodIssueCode.too_small,minimum:r.minLength.value,type:"array",inclusive:!0,exact:!1,message:r.minLength.message}),s.dirty()),null!==r.maxLength&&t.data.length>r.maxLength.value&&((0,n.addIssueToContext)(t,{code:a.ZodIssueCode.too_big,maximum:r.maxLength.value,type:"array",inclusive:!0,exact:!1,message:r.maxLength.message}),s.dirty()),t.common.async)return Promise.all([...t.data].map(((e,s)=>r.type._parseAsync(new d(t,e,t.path,s))))).then((e=>n.ParseStatus.mergeArray(s,e)));const i=[...t.data].map(((e,s)=>r.type._parseSync(new d(t,e,t.path,s))));return n.ParseStatus.mergeArray(s,i)}get element(){return this._def.type}min(e,t){return new k({...this._def,minLength:{value:e,message:i.errorUtil.toString(t)}})}max(e,t){return new k({...this._def,maxLength:{value:e,message:i.errorUtil.toString(t)}})}length(e,t){return new k({...this._def,exactLength:{value:e,message:i.errorUtil.toString(t)}})}nonempty(e){return this.min(1,e)}}function S(e){if(e instanceof V){const t={};for(const s in e.shape){const r=e.shape[s];t[s]=X.create(S(r))}return new V({...e._def,shape:()=>t})}return e instanceof k?new k({...e._def,type:S(e.element)}):e instanceof X?X.create(S(e.unwrap())):e instanceof ee?ee.create(S(e.unwrap())):e instanceof B?B.create(e.items.map((e=>S(e)))):e}t.ZodArray=k,k.create=(e,t)=>new k({type:e,minLength:null,maxLength:null,exactLength:null,typeName:ae.ZodArray,...l(t)});class V extends h{constructor(){super(...arguments),this._cached=null,this.nonstrict=this.passthrough,this.augment=this.extend}_getCached(){if(null!==this._cached)return this._cached;const e=this._def.shape(),t=o.util.objectKeys(e);return this._cached={shape:e,keys:t}}_parse(e){if(this._getType(e)!==o.ZodParsedType.object){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.object,received:t.parsedType}),n.INVALID}const{status:t,ctx:s}=this._processInputParams(e),{shape:r,keys:i}=this._getCached(),u=[];if(!(this._def.catchall instanceof M&&"strip"===this._def.unknownKeys))for(const e in s.data)i.includes(e)\|\|u.push(e);const l=[];for(const e of i){const t=r[e],i=s.data[e];l.push({key:{status:"valid",value:e},value:t._parse(new d(s,i,s.path,e)),alwaysSet:e in s.data})}if(this._def.catchall instanceof M){const e=this._def.unknownKeys;if("passthrough"===e)for(const e of u)l.push({key:{status:"valid",value:e},value:{status:"valid",value:s.data[e]}});else if("strict"===e)u.length>0&&((0,n.addIssueToContext)(s,{code:a.ZodIssueCode.unrecognized_keys,keys:u}),t.dirty());else if("strip"!==e)throw new Error("Internal ZodObject error: invalid unknownKeys value.")}else{const e=this._def.catchall;for(const t of u){const r=s.data[t];l.push({key:{status:"valid",value:t},value:e._parse(new d(s,r,s.path,t)),alwaysSet:t in s.data})}}return s.common.async?Promise.resolve().then((async()=>{const e=[];for(const t of l){const s=await t.key;e.push({key:s,value:await t.value,alwaysSet:t.alwaysSet})}return e})).then((e=>n.ParseStatus.mergeObjectSync(t,e))):n.ParseStatus.mergeObjectSync(t,l)}get shape(){return this._def.shape()}strict(e){return i.errorUtil.errToObj,new V({...this._def,unknownKeys:"strict",...void 0!==e?{errorMap:(t,s)=>{var r,n,o,a;const d=null!==(o=null===(n=(r=this._def).errorMap)\|\|void 0===n?void 0:n.call(r,t,s).message)&&void 0!==o?o:s.defaultError;return"unrecognized_keys"===t.code?{message:null!==(a=i.errorUtil.errToObj(e).message)&&void 0!==a?a:d}:{message:d}}}:{}})}strip(){return new V({...this._def,unknownKeys:"strip"})}passthrough(){return new V({...this._def,unknownKeys:"passthrough"})}extend(e){return new V({...this._def,shape:()=>({...this._def.shape(),...e})})}merge(e){return new V({unknownKeys:e._def.unknownKeys,catchall:e._def.catchall,shape:()=>({...this._def.shape(),...e._def.shape()}),typeName:ae.ZodObject})}setKey(e,t){return this.augment({[e]:t})}catchall(e){return new V({...this._def,catchall:e})}pick(e){const t={};return o.util.objectKeys(e).forEach((s=>{e[s]&&this.shape[s]&&(t[s]=this.shape[s])})),new V({...this._def,shape:()=>t})}omit(e){const t={};return o.util.objectKeys(this.shape).forEach((s=>{e[s]\|\|(t[s]=this.shape[s])})),new V({...this._def,shape:()=>t})}deepPartial(){return S(this)}partial(e){const t={};return o.util.objectKeys(this.shape).forEach((s=>{const r=this.shape[s];e&&!e[s]?t[s]=r:t[s]=r.optional()})),new V({...this._def,shape:()=>t})}required(e){const t={};return o.util.objectKeys(this.shape).forEach((s=>{if(e&&!e[s])t[s]=this.shape[s];else{let e=this.shape[s];for(;e instanceof X;)e=e._def.innerType;t[s]=e}})),new V({...this._def,shape:()=>t})}keyof(){return W(o.util.objectKeys(this.shape))}}t.ZodObject=V,V.create=(e,t)=>new V({shape:()=>e,unknownKeys:"strip",catchall:M.create(),typeName:ae.ZodObject,...l(t)}),V.strictCreate=(e,t)=>new V({shape:()=>e,unknownKeys:"strict",catchall:M.create(),typeName:ae.ZodObject,...l(t)}),V.lazycreate=(e,t)=>new V({shape:e,unknownKeys:"strip",catchall:M.create(),typeName:ae.ZodObject,...l(t)});class R extends h{_parse(e){const{ctx:t}=this._processInputParams(e),s=this._def.options;if(t.common.async)return Promise.all(s.map((async e=>{const s={...t,common:{...t.common,issues:[]},parent:null};return{result:await e._parseAsync({data:t.data,path:t.path,parent:s}),ctx:s}}))).then((function(e){for(const t of e)if("valid"===t.result.status)return t.result;for(const s of e)if("dirty"===s.result.status)return t.common.issues.push(...s.ctx.common.issues),s.result;const s=e.map((e=>new a.ZodError(e.ctx.common.issues)));return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_union,unionErrors:s}),n.INVALID}));{let e;const r=[];for(const i of s){const s={...t,common:{...t.common,issues:[]},parent:null},n=i._parseSync({data:t.data,path:t.path,parent:s});if("valid"===n.status)return n;"dirty"!==n.status\|\|e\|\|(e={result:n,ctx:s}),s.common.issues.length&&r.push(s.common.issues)}if(e)return t.common.issues.push(...e.ctx.common.issues),e.result;const i=r.map((e=>new a.ZodError(e)));return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_union,unionErrors:i}),n.INVALID}}get options(){return this._def.options}}t.ZodUnion=R,R.create=(e,t)=>new R({options:e,typeName:ae.ZodUnion,...l(t)});const A=e=>e instanceof K?A(e.schema):e instanceof J?A(e.innerType()):e instanceof H?[e.value]:e instanceof G?e.options:e instanceof Q?Object.keys(e.enum):e instanceof te?A(e._def.innerType):e instanceof Z?[void 0]:e instanceof C?[null]:null;class L extends h{_parse(e){const{ctx:t}=this._processInputParams(e);if(t.parsedType!==o.ZodParsedType.object)return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.object,received:t.parsedType}),n.INVALID;const s=this.discriminator,r=t.data[s],i=this.optionsMap.get(r);return i?t.common.async?i._parseAsync({data:t.data,path:t.path,parent:t}):i._parseSync({data:t.data,path:t.path,parent:t}):((0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_union_discriminator,options:Array.from(this.optionsMap.keys()),path:[s]}),n.INVALID)}get discriminator(){return this._def.discriminator}get options(){return this._def.options}get optionsMap(){return this._def.optionsMap}static create(e,t,s){const r=new Map;for(const s of t){const t=A(s.shape[e]);if(!t)throw new Error(`A discriminator value for key \`${e}\` could not be extracted from all schema options`);for(const i of t){if(r.has(i))throw new Error(`Discriminator property ${String(e)} has duplicate value ${String(i)}`);r.set(i,s)}}return new L({typeName:ae.ZodDiscriminatedUnion,discriminator:e,options:t,optionsMap:r,...l(s)})}}function D(e,t){const s=(0,o.getParsedType)(e),r=(0,o.getParsedType)(t);if(e===t)return{valid:!0,data:e};if(s===o.ZodParsedType.object&&r===o.ZodParsedType.object){const s=o.util.objectKeys(t),r=o.util.objectKeys(e).filter((e=>-1!==s.indexOf(e))),i={...e,...t};for(const s of r){const r=D(e[s],t[s]);if(!r.valid)return{valid:!1};i[s]=r.data}return{valid:!0,data:i}}if(s===o.ZodParsedType.array&&r===o.ZodParsedType.array){if(e.length!==t.length)return{valid:!1};const s=[];for(let r=0;r<e.length;r++){const i=D(e[r],t[r]);if(!i.valid)return{valid:!1};s.push(i.data)}return{valid:!0,data:s}}return s===o.ZodParsedType.date&&r===o.ZodParsedType.date&&+e==+t?{valid:!0,data:e}:{valid:!1}}t.ZodDiscriminatedUnion=L;class z extends h{_parse(e){const{status:t,ctx:s}=this._processInputParams(e),r=(e,r)=>{if((0,n.isAborted)(e)\|\|(0,n.isAborted)(r))return n.INVALID;const i=D(e.value,r.value);return i.valid?(((0,n.isDirty)(e)\|\|(0,n.isDirty)(r))&&t.dirty(),{status:t.value,value:i.data}):((0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_intersection_types}),n.INVALID)};return s.common.async?Promise.all([this._def.left._parseAsync({data:s.data,path:s.path,parent:s}),this._def.right._parseAsync({data:s.data,path:s.path,parent:s})]).then((([e,t])=>r(e,t))):r(this._def.left._parseSync({data:s.data,path:s.path,parent:s}),this._def.right._parseSync({data:s.data,path:s.path,parent:s}))}}t.ZodIntersection=z,z.create=(e,t,s)=>new z({left:e,right:t,typeName:ae.ZodIntersection,...l(s)});class B extends h{_parse(e){const{status:t,ctx:s}=this._processInputParams(e);if(s.parsedType!==o.ZodParsedType.array)return(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.array,received:s.parsedType}),n.INVALID;if(s.data.length<this._def.items.length)return(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_small,minimum:this._def.items.length,inclusive:!0,exact:!1,type:"array"}),n.INVALID;!this._def.rest&&s.data.length>this._def.items.length&&((0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_big,maximum:this._def.items.length,inclusive:!0,exact:!1,type:"array"}),t.dirty());const r=[...s.data].map(((e,t)=>{const r=this._def.items[t]\|\|this._def.rest;return r?r._parse(new d(s,e,s.path,t)):null})).filter((e=>!!e));return s.common.async?Promise.all(r).then((e=>n.ParseStatus.mergeArray(t,e))):n.ParseStatus.mergeArray(t,r)}get items(){return this._def.items}rest(e){return new B({...this._def,rest:e})}}t.ZodTuple=B,B.create=(e,t)=>{if(!Array.isArray(e))throw new Error("You must pass an array of schemas to z.tuple([ ... ])");return new B({items:e,typeName:ae.ZodTuple,rest:null,...l(t)})};class U extends h{get keySchema(){return this._def.keyType}get valueSchema(){return this._def.valueType}_parse(e){const{status:t,ctx:s}=this._processInputParams(e);if(s.parsedType!==o.ZodParsedType.object)return(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.object,received:s.parsedType}),n.INVALID;const r=[],i=this._def.keyType,u=this._def.valueType;for(const e in s.data)r.push({key:i._parse(new d(s,e,s.path,e)),value:u._parse(new d(s,s.data[e],s.path,e))});return s.common.async?n.ParseStatus.mergeObjectAsync(t,r):n.ParseStatus.mergeObjectSync(t,r)}get element(){return this._def.valueType}static create(e,t,s){return new U(t instanceof h?{keyType:e,valueType:t,typeName:ae.ZodRecord,...l(s)}:{keyType:b.create(),valueType:e,typeName:ae.ZodRecord,...l(t)})}}t.ZodRecord=U;class F extends h{get keySchema(){return this._def.keyType}get valueSchema(){return this._def.valueType}_parse(e){const{status:t,ctx:s}=this._processInputParams(e);if(s.parsedType!==o.ZodParsedType.map)return(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.map,received:s.parsedType}),n.INVALID;const r=this._def.keyType,i=this._def.valueType,u=[...s.data.entries()].map((([e,t],n)=>({key:r._parse(new d(s,e,s.path,[n,"key"])),value:i._parse(new d(s,t,s.path,[n,"value"]))})));if(s.common.async){const e=new Map;return Promise.resolve().then((async()=>{for(const s of u){const r=await s.key,i=await s.value;if("aborted"===r.status\|\|"aborted"===i.status)return n.INVALID;"dirty"!==r.status&&"dirty"!==i.status\|\|t.dirty(),e.set(r.value,i.value)}return{status:t.value,value:e}}))}{const e=new Map;for(const s of u){const r=s.key,i=s.value;if("aborted"===r.status\|\|"aborted"===i.status)return n.INVALID;"dirty"!==r.status&&"dirty"!==i.status\|\|t.dirty(),e.set(r.value,i.value)}return{status:t.value,value:e}}}}t.ZodMap=F,F.create=(e,t,s)=>new F({valueType:t,keyType:e,typeName:ae.ZodMap,...l(s)});class $ extends h{_parse(e){const{status:t,ctx:s}=this._processInputParams(e);if(s.parsedType!==o.ZodParsedType.set)return(0,n.addIssueToContext)(s,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.set,received:s.parsedType}),n.INVALID;const r=this._def;null!==r.minSize&&s.data.size<r.minSize.value&&((0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_small,minimum:r.minSize.value,type:"set",inclusive:!0,exact:!1,message:r.minSize.message}),t.dirty()),null!==r.maxSize&&s.data.size>r.maxSize.value&&((0,n.addIssueToContext)(s,{code:a.ZodIssueCode.too_big,maximum:r.maxSize.value,type:"set",inclusive:!0,exact:!1,message:r.maxSize.message}),t.dirty());const i=this._def.valueType;function u(e){const s=new Set;for(const r of e){if("aborted"===r.status)return n.INVALID;"dirty"===r.status&&t.dirty(),s.add(r.value)}return{status:t.value,value:s}}const l=[...s.data.values()].map(((e,t)=>i._parse(new d(s,e,s.path,t))));return s.common.async?Promise.all(l).then((e=>u(e))):u(l)}min(e,t){return new $({...this._def,minSize:{value:e,message:i.errorUtil.toString(t)}})}max(e,t){return new $({...this._def,maxSize:{value:e,message:i.errorUtil.toString(t)}})}size(e,t){return this.min(e,t).max(e,t)}nonempty(e){return this.min(1,e)}}t.ZodSet=$,$.create=(e,t)=>new $({valueType:e,minSize:null,maxSize:null,typeName:ae.ZodSet,...l(t)});class q extends h{constructor(){super(...arguments),this.validate=this.implement}_parse(e){const{ctx:t}=this._processInputParams(e);if(t.parsedType!==o.ZodParsedType.function)return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.function,received:t.parsedType}),n.INVALID;function s(e,s){return(0,n.makeIssue)({data:e,path:t.path,errorMaps:[t.common.contextualErrorMap,t.schemaErrorMap,(0,r.getErrorMap)(),r.defaultErrorMap].filter((e=>!!e)),issueData:{code:a.ZodIssueCode.invalid_arguments,argumentsError:s}})}function i(e,s){return(0,n.makeIssue)({data:e,path:t.path,errorMaps:[t.common.contextualErrorMap,t.schemaErrorMap,(0,r.getErrorMap)(),r.defaultErrorMap].filter((e=>!!e)),issueData:{code:a.ZodIssueCode.invalid_return_type,returnTypeError:s}})}const d={errorMap:t.common.contextualErrorMap},u=t.data;if(this._def.returns instanceof Y){const e=this;return(0,n.OK)((async function(...t){const r=new a.ZodError([]),n=await e._def.args.parseAsync(t,d).catch((e=>{throw r.addIssue(s(t,e)),r})),o=await Reflect.apply(u,this,n);return await e._def.returns._def.type.parseAsync(o,d).catch((e=>{throw r.addIssue(i(o,e)),r}))}))}{const e=this;return(0,n.OK)((function(...t){const r=e._def.args.safeParse(t,d);if(!r.success)throw new a.ZodError([s(t,r.error)]);const n=Reflect.apply(u,this,r.data),o=e._def.returns.safeParse(n,d);if(!o.success)throw new a.ZodError([i(n,o.error)]);return o.data}))}}parameters(){return this._def.args}returnType(){return this._def.returns}args(...e){return new q({...this._def,args:B.create(e).rest(N.create())})}returns(e){return new q({...this._def,returns:e})}implement(e){return this.parse(e)}strictImplement(e){return this.parse(e)}static create(e,t,s){return new q({args:e\|\|B.create([]).rest(N.create()),returns:t\|\|N.create(),typeName:ae.ZodFunction,...l(s)})}}t.ZodFunction=q;class K extends h{get schema(){return this._def.getter()}_parse(e){const{ctx:t}=this._processInputParams(e);return this._def.getter()._parse({data:t.data,path:t.path,parent:t})}}t.ZodLazy=K,K.create=(e,t)=>new K({getter:e,typeName:ae.ZodLazy,...l(t)});class H extends h{_parse(e){if(e.data!==this._def.value){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{received:t.data,code:a.ZodIssueCode.invalid_literal,expected:this._def.value}),n.INVALID}return{status:"valid",value:e.data}}get value(){return this._def.value}}function W(e,t){return new G({values:e,typeName:ae.ZodEnum,...l(t)})}t.ZodLiteral=H,H.create=(e,t)=>new H({value:e,typeName:ae.ZodLiteral,...l(t)});class G extends h{_parse(e){if("string"!=typeof e.data){const t=this._getOrReturnCtx(e),s=this._def.values;return(0,n.addIssueToContext)(t,{expected:o.util.joinValues(s),received:t.parsedType,code:a.ZodIssueCode.invalid_type}),n.INVALID}if(-1===this._def.values.indexOf(e.data)){const t=this._getOrReturnCtx(e),s=this._def.values;return(0,n.addIssueToContext)(t,{received:t.data,code:a.ZodIssueCode.invalid_enum_value,options:s}),n.INVALID}return(0,n.OK)(e.data)}get options(){return this._def.values}get enum(){const e={};for(const t of this._def.values)e[t]=t;return e}get Values(){const e={};for(const t of this._def.values)e[t]=t;return e}get Enum(){const e={};for(const t of this._def.values)e[t]=t;return e}extract(e){return G.create(e)}exclude(e){return G.create(this.options.filter((t=>!e.includes(t))))}}t.ZodEnum=G,G.create=W;class Q extends h{_parse(e){const t=o.util.getValidEnumValues(this._def.values),s=this._getOrReturnCtx(e);if(s.parsedType!==o.ZodParsedType.string&&s.parsedType!==o.ZodParsedType.number){const e=o.util.objectValues(t);return(0,n.addIssueToContext)(s,{expected:o.util.joinValues(e),received:s.parsedType,code:a.ZodIssueCode.invalid_type}),n.INVALID}if(-1===t.indexOf(e.data)){const e=o.util.objectValues(t);return(0,n.addIssueToContext)(s,{received:s.data,code:a.ZodIssueCode.invalid_enum_value,options:e}),n.INVALID}return(0,n.OK)(e.data)}get enum(){return this._def.values}}t.ZodNativeEnum=Q,Q.create=(e,t)=>new Q({values:e,typeName:ae.ZodNativeEnum,...l(t)});class Y extends h{unwrap(){return this._def.type}_parse(e){const{ctx:t}=this._processInputParams(e);if(t.parsedType!==o.ZodParsedType.promise&&!1===t.common.async)return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.promise,received:t.parsedType}),n.INVALID;const s=t.parsedType===o.ZodParsedType.promise?t.data:Promise.resolve(t.data);return(0,n.OK)(s.then((e=>this._def.type.parseAsync(e,{path:t.path,errorMap:t.common.contextualErrorMap}))))}}t.ZodPromise=Y,Y.create=(e,t)=>new Y({type:e,typeName:ae.ZodPromise,...l(t)});class J extends h{innerType(){return this._def.schema}sourceType(){return this._def.schema._def.typeName===ae.ZodEffects?this._def.schema.sourceType():this._def.schema}_parse(e){const{status:t,ctx:s}=this._processInputParams(e),r=this._def.effect\|\|null,i={addIssue:e=>{(0,n.addIssueToContext)(s,e),e.fatal?t.abort():t.dirty()},get path(){return s.path}};if(i.addIssue=i.addIssue.bind(i),"preprocess"===r.type){const e=r.transform(s.data,i);return s.common.issues.length?{status:"dirty",value:s.data}:s.common.async?Promise.resolve(e).then((e=>this._def.schema._parseAsync({data:e,path:s.path,parent:s}))):this._def.schema._parseSync({data:e,path:s.path,parent:s})}if("refinement"===r.type){const e=e=>{const t=r.refinement(e,i);if(s.common.async)return Promise.resolve(t);if(t instanceof Promise)throw new Error("Async refinement encountered during synchronous parse operation. Use .parseAsync instead.");return e};if(!1===s.common.async){const r=this._def.schema._parseSync({data:s.data,path:s.path,parent:s});return"aborted"===r.status?n.INVALID:("dirty"===r.status&&t.dirty(),e(r.value),{status:t.value,value:r.value})}return this._def.schema._parseAsync({data:s.data,path:s.path,parent:s}).then((s=>"aborted"===s.status?n.INVALID:("dirty"===s.status&&t.dirty(),e(s.value).then((()=>({status:t.value,value:s.value}))))))}if("transform"===r.type){if(!1===s.common.async){const e=this._def.schema._parseSync({data:s.data,path:s.path,parent:s});if(!(0,n.isValid)(e))return e;const o=r.transform(e.value,i);if(o instanceof Promise)throw new Error("Asynchronous transform encountered during synchronous parse operation. Use .parseAsync instead.");return{status:t.value,value:o}}return this._def.schema._parseAsync({data:s.data,path:s.path,parent:s}).then((e=>(0,n.isValid)(e)?Promise.resolve(r.transform(e.value,i)).then((e=>({status:t.value,value:e}))):e))}o.util.assertNever(r)}}t.ZodEffects=J,t.ZodTransformer=J,J.create=(e,t,s)=>new J({schema:e,typeName:ae.ZodEffects,effect:t,...l(s)}),J.createWithPreprocess=(e,t,s)=>new J({schema:t,effect:{type:"preprocess",transform:e},typeName:ae.ZodEffects,...l(s)});class X extends h{_parse(e){return this._getType(e)===o.ZodParsedType.undefined?(0,n.OK)(void 0):this._def.innerType._parse(e)}unwrap(){return this._def.innerType}}t.ZodOptional=X,X.create=(e,t)=>new X({innerType:e,typeName:ae.ZodOptional,...l(t)});class ee extends h{_parse(e){return this._getType(e)===o.ZodParsedType.null?(0,n.OK)(null):this._def.innerType._parse(e)}unwrap(){return this._def.innerType}}t.ZodNullable=ee,ee.create=(e,t)=>new ee({innerType:e,typeName:ae.ZodNullable,...l(t)});class te extends h{_parse(e){const{ctx:t}=this._processInputParams(e);let s=t.data;return t.parsedType===o.ZodParsedType.undefined&&(s=this._def.defaultValue()),this._def.innerType._parse({data:s,path:t.path,parent:t})}removeDefault(){return this._def.innerType}}t.ZodDefault=te,te.create=(e,t)=>new te({innerType:e,typeName:ae.ZodDefault,defaultValue:"function"==typeof t.default?t.default:()=>t.default,...l(t)});class se extends h{_parse(e){const{ctx:t}=this._processInputParams(e),s={...t,common:{...t.common,issues:[]}},r=this._def.innerType._parse({data:s.data,path:s.path,parent:{...s}});return(0,n.isAsync)(r)?r.then((e=>({status:"valid",value:"valid"===e.status?e.value:this._def.catchValue({get error(){return new a.ZodError(s.common.issues)},input:s.data})}))):{status:"valid",value:"valid"===r.status?r.value:this._def.catchValue({get error(){return new a.ZodError(s.common.issues)},input:s.data})}}removeCatch(){return this._def.innerType}}t.ZodCatch=se,se.create=(e,t)=>new se({innerType:e,typeName:ae.ZodCatch,catchValue:"function"==typeof t.catch?t.catch:()=>t.catch,...l(t)});class re extends h{_parse(e){if(this._getType(e)!==o.ZodParsedType.nan){const t=this._getOrReturnCtx(e);return(0,n.addIssueToContext)(t,{code:a.ZodIssueCode.invalid_type,expected:o.ZodParsedType.nan,received:t.parsedType}),n.INVALID}return{status:"valid",value:e.data}}}t.ZodNaN=re,re.create=e=>new re({typeName:ae.ZodNaN,...l(e)}),t.BRAND=Symbol("zod_brand");class ie extends h{_parse(e){const{ctx:t}=this._processInputParams(e),s=t.data;return this._def.type._parse({data:s,path:t.path,parent:t})}unwrap(){return this._def.type}}t.ZodBranded=ie;class ne extends h{_parse(e){const{status:t,ctx:s}=this._processInputParams(e);if(s.common.async)return(async()=>{const e=await this._def.in._parseAsync({data:s.data,path:s.path,parent:s});return"aborted"===e.status?n.INVALID:"dirty"===e.status?(t.dirty(),(0,n.DIRTY)(e.value)):this._def.out._parseAsync({data:e.value,path:s.path,parent:s})})();{const e=this._def.in._parseSync({data:s.data,path:s.path,parent:s});return"aborted"===e.status?n.INVALID:"dirty"===e.status?(t.dirty(),{status:"dirty",value:e.value}):this._def.out._parseSync({data:e.value,path:s.path,parent:s})}}static create(e,t){return new ne({in:e,out:t,typeName:ae.ZodPipeline})}}t.ZodPipeline=ne;class oe extends h{_parse(e){const t=this._def.innerType._parse(e);return(0,n.isValid)(t)&&(t.value=Object.freeze(t.value)),t}}var ae;t.ZodReadonly=oe,oe.create=(e,t)=>new oe({innerType:e,typeName:ae.ZodReadonly,...l(t)}),t.custom=(e,t={},s)=>e?j.create().superRefine(((r,i)=>{var n,o;if(!e(r)){const e="function"==typeof t?t(r):"string"==typeof t?{message:t}:t,a=null===(o=null!==(n=e.fatal)&&void 0!==n?n:s)\|\|void 0===o\|\|o,d="string"==typeof e?{message:e}:e;i.addIssue({code:"custom",...d,fatal:a})}})):j.create(),t.late={object:V.lazycreate},function(e){e.ZodString="ZodString",e.ZodNumber="ZodNumber",e.ZodNaN="ZodNaN",e.ZodBigInt="ZodBigInt",e.ZodBoolean="ZodBoolean",e.ZodDate="ZodDate",e.ZodSymbol="ZodSymbol",e.ZodUndefined="ZodUndefined",e.ZodNull="ZodNull",e.ZodAny="ZodAny",e.ZodUnknown="ZodUnknown",e.ZodNever="ZodNever",e.ZodVoid="ZodVoid",e.ZodArray="ZodArray",e.ZodObject="ZodObject",e.ZodUnion="ZodUnion",e.ZodDiscriminatedUnion="ZodDiscriminatedUnion",e.ZodIntersection="ZodIntersection",e.ZodTuple="ZodTuple",e.ZodRecord="ZodRecord",e.ZodMap="ZodMap",e.ZodSet="ZodSet",e.ZodFunction="ZodFunction",e.ZodLazy="ZodLazy",e.ZodLiteral="ZodLiteral",e.ZodEnum="ZodEnum",e.ZodEffects="ZodEffects",e.ZodNativeEnum="ZodNativeEnum",e.ZodOptional="ZodOptional",e.ZodNullable="ZodNullable",e.ZodDefault="ZodDefault",e.ZodCatch="ZodCatch",e.ZodPromise="ZodPromise",e.ZodBranded="ZodBranded",e.ZodPipeline="ZodPipeline",e.ZodReadonly="ZodReadonly"}(ae=t.ZodFirstPartyTypeKind\|\|(t.ZodFirstPartyTypeKind={})),t.instanceof=(e,s={message:`Input not instance of ${e.name}`})=>(0,t.custom)((t=>t instanceof e),s);const de=b.create;t.string=de;const ue=T.create;t.number=ue;const le=re.create;t.nan=le;const he=P.create;t.bigint=he;const ce=O.create;t.boolean=ce;const pe=I.create;t.date=pe;const fe=w.create;t.symbol=fe;const _e=Z.create;t.undefined=_e;const ge=C.create;t.null=ge;const me=j.create;t.any=me;const ve=N.create;t.unknown=ve;const ye=M.create;t.never=ye;const be=E.create;t.void=be;const xe=k.create;t.array=xe;const Te=V.create;t.object=Te;const Pe=V.strictCreate;t.strictObject=Pe;const Oe=R.create;t.union=Oe;const Ie=L.create;t.discriminatedUnion=Ie;const we=z.create;t.intersection=we;const Ze=B.create;t.tuple=Ze;const Ce=U.create;t.record=Ce;const je=F.create;t.map=je;const Ne=$.create;t.set=Ne;const Me=q.create;t.function=Me;const Ee=K.create;t.lazy=Ee;const ke=H.create;t.literal=ke;const Se=G.create;t.enum=Se;const Ve=Q.create;t.nativeEnum=Ve;const Re=Y.create;t.promise=Re;const Ae=J.create;t.effect=Ae,t.transformer=Ae;const Le=X.create;t.optional=Le;const De=ee.create;t.nullable=De;const ze=J.createWithPreprocess;t.preprocess=ze;const Be=ne.create;t.pipeline=Be,t.ostring=()=>de().optional(),t.onumber=()=>ue().optional(),t.oboolean=()=>ce().optional(),t.coerce={string:e=>b.create({...e,coerce:!0}),number:e=>T.create({...e,coerce:!0}),boolean:e=>O.create({...e,coerce:!0}),bigint:e=>P.create({...e,coerce:!0}),date:e=>I.create({...e,coerce:!0})},t.NEVER=n.INVALID}},t={},s=function s(r){var i=t[r];if(void 0!==i)return i.exports;var n=t[r]={exports:{}};return e[r].call(n.exports,n,n.exports,s),n.exports}(3607);window.dataStructureTyped=s})();

package/dist/bundle.js.LICENSE.txt ADDED Viewed

@@ -0,0 +1,13 @@
+/**
+ * @license MIT
+ * @copyright Tyler Zeng <zrwusa@gmail.com>
+ * @class
+ */
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */

package/package.json CHANGED Viewed

@@ -1,10 +1,13 @@
 {
   "name": "data-structure-typed",
-  "version": "1.21.0",
+  "version": "1.21.2",
   "description": "Javascript & TypeScript Data Structure Library, meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures, such as Binary Tree, AVL Tree, Binary Search Tree (BST), Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Singly Linked List, Hash, CoordinateSet, CoordinateMap, Heap, Doubly Linked List, Priority Queue, Max Priority Queue, Min Priority Queue, Queue, ObjectDeque, ArrayDeque, Stack, and Trie. Each data structure is thoughtfully designed and implemented using TypeScript to provide efficient, reliable, and easy-to-use solutions for your programming needs. Whether you're optimizing algorithms, managing data, or enhancing performance, our TypeScript Data Structure Library is your go-to resource. Elevate your coding experience with these fundamental building blocks for software development.",
   "main": "dist/index.js",
+  "module": "dist/index.js",
+  "types": "dist/index.d.ts",
   "scripts": {
-    "build": "rm -rf dist && npx tsc",
+    "build": "rm -rf dist && npx tsc && npm run build:browser",
+    "build:browser": "webpack",
     "test": "jest",
     "update:test-deps": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed --save-dev",
     "build:docs": "typedoc --out docs ./src",
@@ -55,34 +58,36 @@
     "url": "https://github.com/zrwusa/data-structure-typed/issues"
   },
   "homepage": "https://github.com/zrwusa/data-structure-typed#readme",
-  "types": "dist/index.d.ts",
   "devDependencies": {
     "@types/jest": "^29.5.3",
     "@types/node": "^20.4.9",
-    "avl-tree-typed": "^1.19.7",
-    "binary-tree-typed": "^1.19.7",
-    "bst-typed": "^1.19.7",
+    "avl-tree-typed": "^1.21.0",
+    "binary-tree-typed": "^1.21.0",
+    "bst-typed": "^1.21.0",
     "dependency-cruiser": "^13.1.2",
-    "deque-typed": "^1.19.7",
-    "directed-graph-typed": "^1.19.7",
-    "doubly-linked-list-typed": "^1.19.7",
-    "graph-typed": "^1.19.7",
-    "heap-typed": "^1.19.7",
+    "deque-typed": "^1.21.0",
+    "directed-graph-typed": "^1.21.0",
+    "doubly-linked-list-typed": "^1.21.0",
+    "graph-typed": "^1.21.0",
+    "heap-typed": "^1.21.0",
     "jest": "^29.6.2",
-    "linked-list-typed": "^1.19.7",
-    "max-heap-typed": "^1.19.7",
-    "max-priority-queue-typed": "^1.19.7",
-    "min-heap-typed": "^1.19.7",
-    "min-priority-queue-typed": "^1.19.7",
-    "priority-queue-typed": "^1.19.7",
-    "singly-linked-list-typed": "^1.19.7",
-    "stack-typed": "^1.19.7",
-    "tree-multiset-typed": "^1.19.7",
-    "trie-typed": "^1.19.7",
+    "linked-list-typed": "^1.21.0",
+    "max-heap-typed": "^1.21.0",
+    "max-priority-queue-typed": "^1.21.0",
+    "min-heap-typed": "^1.21.0",
+    "min-priority-queue-typed": "^1.21.0",
+    "priority-queue-typed": "^1.21.0",
+    "singly-linked-list-typed": "^1.21.0",
+    "stack-typed": "^1.21.0",
+    "tree-multiset-typed": "^1.21.0",
+    "trie-typed": "^1.21.0",
     "ts-jest": "^29.1.1",
+    "ts-loader": "^9.4.4",
     "typedoc": "^0.24.8",
     "typescript": "^4.9.5",
-    "undirected-graph-typed": "^1.19.7"
+    "undirected-graph-typed": "^1.21.0",
+    "webpack": "^5.88.2",
+    "webpack-cli": "^5.1.4"
   },
   "dependencies": {
     "zod": "^3.22.2"

package/tsconfig.json CHANGED Viewed

@@ -2,10 +2,12 @@
   "compilerOptions": {
     "declaration": true,
     "outDir": "./dist",
-    "module": "commonjs",
-    "target": "es6",
+    "module": "CommonJS",
+    //    "target": "CommonJS",
+    "target": "ES6",
     "lib": [
-      "esnext"
+      "esnext",
+      "dom"
     ],
     "strict": true,
     "esModuleInterop": true,
@@ -26,9 +28,7 @@
     ]
   },
-  "include": [
-    "src",
-  ],
+  "include": ["src/**/*.ts", "src/**/*.js"],
   "exclude": [
     //  "node_modules/data-structure-typed",
     "node_modules",

package/webpack.config.js ADDED Viewed

@@ -0,0 +1,27 @@
+const path = require('path');
+module.exports = [
+    {
+        mode:'production',
+        entry: './src/index.ts',
+        target: 'web',
+        output: {
+            filename: 'bundle.js',
+            path: path.resolve(__dirname, 'dist'),
+            library: 'dataStructureTyped',
+            libraryTarget: 'window',
+        },
+        resolve: {
+            extensions: ['.ts', '.js'],
+        },
+        module: {
+            rules: [
+                {
+                    test: /\.ts$/,
+                    use: 'ts-loader',
+                    exclude: /node_modules/,
+                }
+            ],
+        },
+    },
+];