data-structure-typed 1.50.1 → 1.50.3

package/dist/umd/data-structure-typed.min.js

@@ -1,7 +1,7 @@
-"use strict";var dataStructureTyped=(()=>{var se=Object.defineProperty;var Ze=Object.getOwnPropertyDescriptor;var $e=Object.getOwnPropertyNames,We=Object.getOwnPropertySymbols;var Qe=Object.prototype.hasOwnProperty,et=Object.prototype.propertyIsEnumerable;var me=(h,n)=>{if(n=Symbol[h])return n;throw Error("Symbol."+h+" is not defined")};var ge=(h,n,e)=>n in h?se(h,n,{enumerable:!0,configurable:!0,writable:!0,value:e}):h[n]=e,R=(h,n)=>{for(var e in n||(n={}))Qe.call(n,e)&&ge(h,e,n[e]);if(We)for(var e of We(n))et.call(n,e)&&ge(h,e,n[e]);return h};var tt=(h,n)=>{for(var e in n)se(h,e,{get:n[e],enumerable:!0})},rt=(h,n,e,t)=>{if(n&&typeof n=="object"||typeof n=="function")for(let r of $e(n))!Qe.call(h,r)&&r!==e&&se(h,r,{get:()=>n[r],enumerable:!(t=Ze(n,r))||t.enumerable});return h};var it=h=>rt(se({},"__esModule",{value:!0}),h);var d=(h,n,e)=>(ge(h,typeof n!="symbol"?n+"":n,e),e);var Xe=(h,n,e)=>new Promise((t,r)=>{var i=l=>{try{o(e.next(l))}catch(a){r(a)}},s=l=>{try{o(e.throw(l))}catch(a){r(a)}},o=l=>l.done?t(l.value):Promise.resolve(l.value).then(i,s);o((e=e.apply(h,n)).next())}),nt=function(h,n){this[0]=h,this[1]=n};var L=h=>{var n=h[me("asyncIterator")],e=!1,t,r={};return n==null?(n=h[me("iterator")](),t=i=>r[i]=s=>n[i](s)):(n=n.call(h),t=i=>r[i]=s=>{if(e){if(e=!1,i==="throw")throw s;return s}return e=!0,{done:!1,value:new nt(new Promise(o=>{var l=n[i](s);if(!(l instanceof Object))throw TypeError("Object expected");o(l)}),1)}}),r[me("iterator")]=()=>r,t("next"),"throw"in n?t("throw"):r.throw=i=>{throw i},"return"in n&&t("return"),r};var lt={};tt(lt,{AVLTree:()=>re,AVLTreeNode:()=>H,AbstractEdge:()=>D,AbstractGraph:()=>q,AbstractVertex:()=>O,BST:()=>G,BSTNode:()=>A,BSTVariant:()=>Se,BinaryIndexedTree:()=>ze,BinaryTree:()=>te,BinaryTreeNode:()=>w,CP:()=>Le,Character:()=>pe,Deque:()=>ve,DirectedEdge:()=>X,DirectedGraph:()=>$,DirectedVertex:()=>U,DoublyLinkedList:()=>Ke,DoublyLinkedListNode:()=>M,FamilyPosition:()=>ce,FibonacciHeap:()=>we,FibonacciHeapNode:()=>le,HashMap:()=>Ee,Heap:()=>I,IterableElementBase:()=>k,IterableEntryBase:()=>S,IterationType:()=>ee,LinkedHashMap:()=>xe,LinkedListQueue:()=>Oe,MapEdge:()=>fe,MapGraph:()=>Me,MapVertex:()=>de,Matrix:()=>qe,MaxHeap:()=>Ce,MaxPriorityQueue:()=>je,MinHeap:()=>Re,MinPriorityQueue:()=>Pe,Navigator:()=>Ue,PriorityQueue:()=>W,Queue:()=>v,RBTNColor:()=>Ie,RedBlackTree:()=>Ae,RedBlackTreeNode:()=>P,SegmentTree:()=>Fe,SegmentTreeNode:()=>Y,SinglyLinkedList:()=>J,SinglyLinkedListNode:()=>B,SkipList:()=>Te,SkipListNode:()=>Z,Stack:()=>ke,THUNK_SYMBOL:()=>Ne,TreeMultimap:()=>De,TreeMultimapNode:()=>ie,TreeNode:()=>He,Trie:()=>Ge,TrieNode:()=>ne,UndirectedEdge:()=>ue,UndirectedGraph:()=>Be,UndirectedVertex:()=>he,arrayRemove:()=>z,calcMinUnitsRequired:()=>ae,getMSB:()=>Ve,isThunk:()=>ye,isWeakKey:()=>Q,rangeCheck:()=>F,roundFixed:()=>at,throwRangeError:()=>ot,toThunk:()=>_e,trampoline:()=>oe,trampolineAsync:()=>st,uuidV4:()=>be});var S=class{*[Symbol.iterator](...n){yield*L(this._getIterator(...n))}*entries(){for(let n of this)yield n}*keys(){for(let n of this)yield n[0]}*values(){for(let n of this)yield n[1]}every(n,e){let t=0;for(let r of this)if(!n.call(e,r[1],r[0],t++,this))return!1;return!0}some(n,e){let t=0;for(let r of this)if(n.call(e,r[1],r[0],t++,this))return!0;return!1}forEach(n,e){let t=0;for(let r of this){let[i,s]=r;n.call(e,s,i,t++,this)}}reduce(n,e){let t=e,r=0;for(let i of this){let[s,o]=i;t=n(t,o,s,r++,this)}return t}hasValue(n){for(let[,e]of this)if(e===n)return!0;return!1}print(){console.log([...this])}},k=class{*[Symbol.iterator](...n){yield*L(this._getIterator(...n))}*values(){for(let n of this)yield n}every(n,e){let t=0;for(let r of this)if(!n.call(e,r,t++,this))return!1;return!0}some(n,e){let t=0;for(let r of this)if(n.call(e,r,t++,this))return!0;return!1}forEach(n,e){let t=0;for(let r of this)n.call(e,r,t++,this)}reduce(n,e){let t=e,r=0;for(let i of this)t=n(t,i,r++,this);return t}print(){console.log([...this])}};var be=function(){return"xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/[x]/g,function(h){let n=Math.random()*16|0;return(h=="x"?n:n&3|8).toString(16)})},z=function(h,n){let e=-1,t=h?h.length:0,r=[];for(;++e<t;){let i=h[e];n(i,e,h)&&(r.push(i),Array.prototype.splice.call(h,e--,1),t--)}return r},Ne=Symbol("thunk"),ye=h=>typeof h=="function"&&h.__THUNK__===Ne,_e=h=>{let n=()=>h();return n.__THUNK__=Ne,n},oe=h=>Object.assign((...e)=>{let t=h(...e);for(;ye(t)&&typeof t=="function";)t=t();return t},{cont:(...e)=>_e(()=>h(...e))}),st=h=>Object.assign((...e)=>Xe(void 0,null,function*(){let t=yield h(...e);for(;ye(t)&&typeof t=="function";)t=yield t();return t}),{cont:(...e)=>_e(()=>h(...e))}),Ve=h=>h<=0?0:1<<31-Math.clz32(h),F=(h,n,e,t="Index out of bounds.")=>{if(h<n||h>e)throw new RangeError(t)},ot=(h="The value is off-limits.")=>{throw new RangeError(h)},Q=h=>{let n=typeof h;return n==="object"&&h!==null||n==="function"},ae=(h,n)=>Math.floor((h+n-1)/n),at=(h,n=10)=>{let e=Math.pow(10,n);return Math.round(h*e)/e};var Ee=class h extends S{constructor(e=[],t){super();d(this,"_store",{});d(this,"_objMap",new Map);d(this,"_toEntryFn",e=>{if(this.isEntry(e))return e;throw new Error("If the provided rawCollection does not adhere to the [key, value] type format, the toEntryFn in the constructor's options parameter needs to specified.")});d(this,"_size",0);d(this,"_hashFn",e=>String(e));if(t){let{hashFn:r,toEntryFn:i}=t;r&&(this._hashFn=r),i&&(this._toEntryFn=i)}e&&this.setMany(e)}get toEntryFn(){return this._toEntryFn}get size(){return this._size}isEntry(e){return Array.isArray(e)&&e.length===2}isEmpty(){return this.size===0}clear(){this._store={},this._objMap.clear(),this._size=0}set(e,t){if(this._isObjKey(e))this._objMap.has(e)||this._size++,this._objMap.set(e,t);else{let r=this._getNoObjKey(e);this._store[r]===void 0&&this._size++,this._store[r]={key:e,value:t}}return!0}setMany(e){let t=[];for(let r of e){let[i,s]=this.toEntryFn(r);t.push(this.set(i,s))}return t}get(e){var t;if(this._isObjKey(e))return this._objMap.get(e);{let r=this._getNoObjKey(e);return(t=this._store[r])==null?void 0:t.value}}has(e){return this._isObjKey(e)?this._objMap.has(e):this._getNoObjKey(e)in this._store}delete(e){if(this._isObjKey(e))return this._objMap.has(e)&&this._size--,this._objMap.delete(e);{let t=this._getNoObjKey(e);return t in this._store?(delete this._store[t],this._size--,!0):!1}}map(e,t){let r=new h,i=0;for(let[s,o]of this)r.set(s,e.call(t,o,s,i++,this));return r}filter(e,t){let r=new h,i=0;for(let[s,o]of this)e.call(t,o,s,i++,this)&&r.set(s,o);return r}put(e,t){return this.set(e,t)}*_getIterator(){for(let e of Object.values(this._store))yield[e.key,e.value];for(let e of this._objMap)yield e}_isObjKey(e){let t=typeof e;return(t==="object"||t==="function")&&e!==null}_getNoObjKey(e){let t=typeof e,r;return t!=="string"&&t!=="number"&&t!=="symbol"?r=this._hashFn(e):r=e,r}},xe=class h extends S{constructor(e,t){super();d(this,"_noObjMap",{});d(this,"_objMap",new WeakMap);d(this,"_head");d(this,"_tail");d(this,"_sentinel");d(this,"_size",0);d(this,"_hashFn",e=>String(e));d(this,"_objHashFn",e=>e);if(this._sentinel={},this._sentinel.prev=this._sentinel.next=this._head=this._tail=this._sentinel,t){let{hashFn:r,objHashFn:i}=t;r&&(this._hashFn=r),i&&(this._objHashFn=i)}if(e)for(let r of e)this.set(r[0],r[1])}get size(){return this._size}get first(){if(this._size!==0)return[this._head.key,this._head.value]}get last(){if(this._size!==0)return[this._tail.key,this._tail.value]}*begin(){let e=this._head;for(;e!==this._sentinel;)yield[e.key,e.value],e=e.next}*reverseBegin(){let e=this._tail;for(;e!==this._sentinel;)yield[e.key,e.value],e=e.prev}set(e,t){let r,i=!this.has(e);if(Q(e)){let s=this._objHashFn(e);r=this._objMap.get(s),!r&&i?(r={key:s,value:t,prev:this._tail,next:this._sentinel},this._objMap.set(s,r)):r&&(r.value=t)}else{let s=this._hashFn(e);r=this._noObjMap[s],!r&&i?this._noObjMap[s]=r={key:e,value:t,prev:this._tail,next:this._sentinel}:r&&(r.value=t)}return r&&i&&(this._size===0?(this._head=r,this._sentinel.next=r):(this._tail.next=r,r.prev=this._tail),this._tail=r,this._sentinel.prev=r,this._size++),!0}has(e){if(Q(e)){let t=this._objHashFn(e);return this._objMap.has(t)}else return this._hashFn(e)in this._noObjMap}setMany(e){let t=[];for(let r of e){let[i,s]=r;t.push(this.set(i,s))}return t}get(e){if(Q(e)){let t=this._objHashFn(e),r=this._objMap.get(t);return r?r.value:void 0}else{let t=this._hashFn(e),r=this._noObjMap[t];return r?r.value:void 0}}getAt(e){F(e,0,this._size-1);let t=this._head;for(;e--;)t=t.next;return t.value}delete(e){let t;if(Q(e)){let r=this._objHashFn(e);if(t=this._objMap.get(r),!t)return!1;this._objMap.delete(r)}else{let r=this._hashFn(e);if(t=this._noObjMap[r],!t)return!1;delete this._noObjMap[r]}return this._deleteNode(t),!0}deleteAt(e){F(e,0,this._size-1);let t=this._head;for(;e--;)t=t.next;return this._deleteNode(t)}isEmpty(){return this._size===0}clear(){this._noObjMap={},this._size=0,this._head=this._tail=this._sentinel.prev=this._sentinel.next=this._sentinel}clone(){let e=new h([],{hashFn:this._hashFn,objHashFn:this._objHashFn});for(let t of this){let[r,i]=t;e.set(r,i)}return e}filter(e,t){let r=new h,i=0;for(let[s,o]of this)e.call(t,o,s,i,this)&&r.set(s,o),i++;return r}map(e,t){let r=new h,i=0;for(let[s,o]of this){let l=e.call(t,o,s,i,this);r.set(s,l),i++}return r}put(e,t){return this.set(e,t)}*_getIterator(){let e=this._head;for(;e!==this._sentinel;)yield[e.key,e.value],e=e.next}_deleteNode(e){let{prev:t,next:r}=e;return t.next=r,r.prev=t,e===this._head&&(this._head=r),e===this._tail&&(this._tail=t),this._size-=1,!0}};var B=class{constructor(n){d(this,"value");d(this,"next");this.value=n,this.next=void 0}},J=class h extends k{constructor(e=[]){super();d(this,"_head");d(this,"_tail");d(this,"_size",0);if(e)for(let t of e)this.push(t)}get head(){return this._head}get tail(){return this._tail}get size(){return this._size}static fromArray(e){let t=new h;for(let r of e)t.push(r);return t}push(e){let t=new B(e);return this.head?(this.tail.next=t,this._tail=t):(this._head=t,this._tail=t),this._size++,!0}addLast(e){return this.push(e)}pop(){if(!this.head)return;if(this.head===this.tail){let r=this.head.value;return this._head=void 0,this._tail=void 0,this._size--,r}let e=this.head;for(;e.next!==this.tail;)e=e.next;let t=this.tail.value;return e.next=void 0,this._tail=e,this._size--,t}pollLast(){return this.pop()}shift(){if(!this.head)return;let e=this.head;return this._head=this.head.next,this._size--,e.value}pollFirst(){return this.shift()}unshift(e){let t=new B(e);return this.head?(t.next=this.head,this._head=t):(this._head=t,this._tail=t),this._size++,!0}addFirst(e){return this.unshift(e)}getAt(e){if(e<0||e>=this.size)return;let t=this.head;for(let r=0;r<e;r++)t=t.next;return t.value}getNodeAt(e){let t=this.head;for(let r=0;r<e;r++)t=t.next;return t}deleteAt(e){if(e<0||e>=this.size)return!1;if(e===0)return this.shift(),!0;if(e===this.size-1)return this.pop(),!0;let t=this.getNodeAt(e-1),r=t.next;return t.next=r.next,this._size--,!0}delete(e){if(!e)return!1;let t;e instanceof B?t=e.value:t=e;let r=this.head,i;for(;r;){if(r.value===t)return i===void 0?(this._head=r.next,r===this.tail&&(this._tail=void 0)):(i.next=r.next,r===this.tail&&(this._tail=i)),this._size--,!0;i=r,r=r.next}return!1}addAt(e,t){if(e<0||e>this.size)return!1;if(e===0)return this.unshift(t),!0;if(e===this.size)return this.push(t),!0;let r=new B(t),i=this.getNodeAt(e-1);return r.next=i.next,i.next=r,this._size++,!0}isEmpty(){return this.size===0}clear(){this._head=void 0,this._tail=void 0,this._size=0}toArray(){let e=[],t=this.head;for(;t;)e.push(t.value),t=t.next;return e}reverse(){if(!this.head||this.head===this.tail)return this;let e,t=this.head,r;for(;t;)r=t.next,t.next=e,e=t,t=r;return[this._head,this._tail]=[this.tail,this.head],this}find(e){let t=this.head;for(;t;){if(e(t.value))return t.value;t=t.next}}indexOf(e){let t=0,r=this.head;for(;r;){if(r.value===e)return t;t++,r=r.next}return-1}getNode(e){let t=this.head;for(;t;){if(t.value===e)return t;t=t.next}}addBefore(e,t){if(!this.head)return!1;let r;if(e instanceof B?r=e.value:r=e,this.head.value===r)return this.unshift(t),!0;let i=this.head;for(;i.next;){if(i.next.value===r){let s=new B(t);return s.next=i.next,i.next=s,this._size++,!0}i=i.next}return!1}addAfter(e,t){let r;if(e instanceof B?r=e:r=this.getNode(e),r){let i=new B(t);return i.next=r.next,r.next=i,r===this.tail&&(this._tail=i),this._size++,!0}return!1}countOccurrences(e){let t=0,r=this.head;for(;r;)r.value===e&&t++,r=r.next;return t}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}*_getIterator(){let e=this.head;for(;e;)yield e.value,e=e.next}};var M=class{constructor(n){d(this,"value");d(this,"next");d(this,"prev");this.value=n,this.next=void 0,this.prev=void 0}},Ke=class h extends k{constructor(e=[]){super();d(this,"_head");d(this,"_tail");d(this,"_size");if(this._head=void 0,this._tail=void 0,this._size=0,e)for(let t of e)this.push(t)}get head(){return this._head}get tail(){return this._tail}get size(){return this._size}get first(){var e;return(e=this.head)==null?void 0:e.value}get last(){var e;return(e=this.tail)==null?void 0:e.value}static fromArray(e){let t=new h;for(let r of e)t.push(r);return t}push(e){let t=new M(e);return this.head?(t.prev=this.tail,this.tail.next=t,this._tail=t):(this._head=t,this._tail=t),this._size++,!0}pop(){if(!this.tail)return;let e=this.tail;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._tail=e.prev,this.tail.next=void 0),this._size--,e.value}shift(){if(!this.head)return;let e=this.head;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._head=e.next,this.head.prev=void 0),this._size--,e.value}unshift(e){let t=new M(e);return this.head?(t.next=this.head,this.head.prev=t,this._head=t):(this._head=t,this._tail=t),this._size++,!0}getAt(e){if(e<0||e>=this.size)return;let t=this.head;for(let r=0;r<e;r++)t=t.next;return t.value}getNodeAt(e){if(e<0||e>=this.size)return;let t=this.head;for(let r=0;r<e;r++)t=t.next;return t}getNode(e){let t=this.head;for(;t;){if(t.value===e)return t;t=t.next}}addAt(e,t){if(e<0||e>this.size)return!1;if(e===0)return this.unshift(t),!0;if(e===this.size)return this.push(t),!0;let r=new M(t),i=this.getNodeAt(e-1),s=i.next;return r.prev=i,r.next=s,i.next=r,s.prev=r,this._size++,!0}addBefore(e,t){let r;if(e instanceof M?r=e:r=this.getNode(e),r){let i=new M(t);return i.prev=r.prev,r.prev&&(r.prev.next=i),i.next=r,r.prev=i,r===this.head&&(this._head=i),this._size++,!0}return!1}addAfter(e,t){let r;if(e instanceof M?r=e:r=this.getNode(e),r){let i=new M(t);return i.next=r.next,r.next&&(r.next.prev=i),i.prev=r,r.next=i,r===this.tail&&(this._tail=i),this._size++,!0}return!1}deleteAt(e){if(e<0||e>=this.size)return!1;if(e===0)return this.shift(),!0;if(e===this.size-1)return this.pop(),!0;let t=this.getNodeAt(e),r=t.prev,i=t.next;return r.next=i,i.prev=r,this._size--,!0}delete(e){let t;if(e instanceof M?t=e:t=this.getNode(e),t){if(t===this.head)this.shift();else if(t===this.tail)this.pop();else{let r=t.prev,i=t.next;r.next=i,i.prev=r,this._size--}return!0}return!1}isEmpty(){return this.size===0}clear(){this._head=void 0,this._tail=void 0,this._size=0}find(e){let t=this.head;for(;t;){if(e(t.value))return t.value;t=t.next}}indexOf(e){let t=0,r=this.head;for(;r;){if(r.value===e)return t;t++,r=r.next}return-1}findBackward(e){let t=this.tail;for(;t;){if(e(t.value))return t.value;t=t.prev}}reverse(){let e=this.head;for([this._head,this._tail]=[this.tail,this.head];e;){let t=e.next;[e.prev,e.next]=[e.next,e.prev],e=t}return this}toArray(){let e=[],t=this.head;for(;t;)e.push(t.value),t=t.next;return e}toReversedArray(){let e=[],t=this.tail;for(;t;)e.push(t.value),t=t.prev;return e}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}addLast(e){return this.push(e)}pollLast(){return this.pop()}pollFirst(){return this.shift()}addFirst(e){this.unshift(e)}*_getIterator(){let e=this.head;for(;e;)yield e.value,e=e.next}};var Z=class{constructor(n,e,t){d(this,"key");d(this,"value");d(this,"forward");this.key=n,this.value=e,this.forward=new Array(t)}},Te=class{constructor(n=[],e){d(this,"_head",new Z(void 0,void 0,this.maxLevel));d(this,"_level",0);d(this,"_maxLevel",16);d(this,"_probability",.5);if(e){let{maxLevel:t,probability:r}=e;typeof t=="number"&&(this._maxLevel=t),typeof r=="number"&&(this._probability=r)}if(n)for(let[t,r]of n)this.add(t,r)}get head(){return this._head}get level(){return this._level}get maxLevel(){return this._maxLevel}get probability(){return this._probability}get first(){let n=this.head.forward[0];return n?n.value:void 0}get last(){let n=this.head;for(let e=this.level-1;e>=0;e--)for(;n.forward[e];)n=n.forward[e];return n.value}add(n,e){let t=new Z(n,e,this._randomLevel()),r=new Array(this.maxLevel).fill(this.head),i=this.head;for(let s=this.level-1;s>=0;s--){for(;i.forward[s]&&i.forward[s].key<n;)i=i.forward[s];r[s]=i}for(let s=0;s<t.forward.length;s++)t.forward[s]=r[s].forward[s],r[s].forward[s]=t;t.forward[0]||(this._level=Math.max(this.level,t.forward.length))}get(n){let e=this.head;for(let t=this.level-1;t>=0;t--)for(;e.forward[t]&&e.forward[t].key<n;)e=e.forward[t];if(e=e.forward[0],e&&e.key===n)return e.value}has(n){return this.get(n)!==void 0}delete(n){let e=new Array(this.maxLevel).fill(this.head),t=this.head;for(let r=this.level-1;r>=0;r--){for(;t.forward[r]&&t.forward[r].key<n;)t=t.forward[r];e[r]=t}if(t=t.forward[0],t&&t.key===n){for(let r=0;r<this.level&&e[r].forward[r]===t;r++)e[r].forward[r]=t.forward[r];for(;this.level>0&&!this.head.forward[this.level-1];)this._level--;return!0}return!1}higher(n){let e=this.head;for(let r=this.level-1;r>=0;r--)for(;e.forward[r]&&e.forward[r].key<=n;)e=e.forward[r];let t=e.forward[0];return t?t.value:void 0}lower(n){let e=this.head,t;for(let r=this.level-1;r>=0;r--){for(;e.forward[r]&&e.forward[r].key<n;)e=e.forward[r];e.key<n&&(t=e)}return t?t.value:void 0}_randomLevel(){let n=1;for(;Math.random()<this.probability&&n<this.maxLevel;)n++;return n}};var ke=class h extends k{constructor(e=[]){super();d(this,"_elements",[]);if(e)for(let t of e)this.push(t)}get elements(){return this._elements}get size(){return this.elements.length}static fromArray(e){return new h(e)}isEmpty(){return this.elements.length===0}peek(){if(!this.isEmpty())return this.elements[this.elements.length-1]}push(e){return this.elements.push(e),!0}pop(){if(!this.isEmpty())return this.elements.pop()}toArray(){return this.elements.slice()}clear(){this._elements=[]}clone(){return new h(this.elements.slice())}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}*_getIterator(){for(let e=0;e<this.elements.length;e++)yield this.elements[e]}};var v=class h extends k{constructor(e=[]){super();d(this,"_elements",[]);d(this,"_offset",0);if(e)for(let t of e)this.push(t)}get elements(){return this._elements}get offset(){return this._offset}get size(){return this.elements.length-this.offset}get first(){return this.size>0?this.elements[this.offset]:void 0}get last(){return this.size>0?this.elements[this.elements.length-1]:void 0}static fromArray(e){return new h(e)}push(e){return this.elements.push(e),!0}shift(){if(this.size===0)return;let e=this.first;return this._offset+=1,this.offset*2<this.elements.length||(this._elements=this.elements.slice(this.offset),this._offset=0),e}peek(){return this.first}peekLast(){return this.last}enqueue(e){return this.push(e)}dequeue(){return this.shift()}getAt(e){return this.elements[e]}isEmpty(){return this.size===0}toArray(){return this.elements.slice(this.offset)}clear(){this._elements=[],this._offset=0}clone(){return new h(this.elements.slice(this.offset))}filter(e,t){let r=new h([]),i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h([]),i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}*_getIterator(){for(let e of this.elements)yield e}},Oe=class extends J{get first(){var n;return(n=this.head)==null?void 0:n.value}enqueue(n){return this.push(n)}dequeue(){return this.shift()}peek(){return this.first}};var ve=class h extends k{constructor(e=[],t){super();d(this,"_bucketFirst",0);d(this,"_firstInBucket",0);d(this,"_bucketLast",0);d(this,"_lastInBucket",0);d(this,"_bucketCount",0);d(this,"_bucketSize",4096);d(this,"_buckets",[]);d(this,"_size",0);if(t){let{bucketSize:s}=t;typeof s=="number"&&(this._bucketSize=s)}let r;"length"in e?e.length instanceof Function?r=e.length():r=e.length:e.size instanceof Function?r=e.size():r=e.size,this._bucketCount=ae(r,this._bucketSize)||1;for(let s=0;s<this._bucketCount;++s)this._buckets.push(new Array(this._bucketSize));let i=ae(r,this._bucketSize);this._bucketFirst=this._bucketLast=(this._bucketCount>>1)-(i>>1),this._firstInBucket=this._lastInBucket=this._bucketSize-r%this._bucketSize>>1;for(let s of e)this.push(s)}get buckets(){return this._buckets}get size(){return this._size}get first(){if(this.size!==0)return this._buckets[this._bucketFirst][this._firstInBucket]}get last(){if(this.size!==0)return this._buckets[this._bucketLast][this._lastInBucket]}push(e){return this.size&&(this._lastInBucket<this._bucketSize-1?this._lastInBucket+=1:this._bucketLast<this._bucketCount-1?(this._bucketLast+=1,this._lastInBucket=0):(this._bucketLast=0,this._lastInBucket=0),this._bucketLast===this._bucketFirst&&this._lastInBucket===this._firstInBucket&&this._reallocate()),this._size+=1,this._buckets[this._bucketLast][this._lastInBucket]=e,!0}pop(){if(this.size===0)return;let e=this._buckets[this._bucketLast][this._lastInBucket];return this.size!==1&&(this._lastInBucket>0?this._lastInBucket-=1:this._bucketLast>0?(this._bucketLast-=1,this._lastInBucket=this._bucketSize-1):(this._bucketLast=this._bucketCount-1,this._lastInBucket=this._bucketSize-1)),this._size-=1,e}unshift(e){return this.size&&(this._firstInBucket>0?this._firstInBucket-=1:this._bucketFirst>0?(this._bucketFirst-=1,this._firstInBucket=this._bucketSize-1):(this._bucketFirst=this._bucketCount-1,this._firstInBucket=this._bucketSize-1),this._bucketFirst===this._bucketLast&&this._firstInBucket===this._lastInBucket&&this._reallocate()),this._size+=1,this._buckets[this._bucketFirst][this._firstInBucket]=e,!0}shift(){if(this.size===0)return;let e=this._buckets[this._bucketFirst][this._firstInBucket];return this.size!==1&&(this._firstInBucket<this._bucketSize-1?this._firstInBucket+=1:this._bucketFirst<this._bucketCount-1?(this._bucketFirst+=1,this._firstInBucket=0):(this._bucketFirst=0,this._firstInBucket=0)),this._size-=1,e}isEmpty(){return this.size===0}clear(){this._buckets=[new Array(this._bucketSize)],this._bucketCount=1,this._bucketFirst=this._bucketLast=this._size=0,this._firstInBucket=this._lastInBucket=this._bucketSize>>1}*begin(){let e=0;for(;e<this.size;)yield this.getAt(e),e++}*reverseBegin(){let e=this.size-1;for(;e>=0;)yield this.getAt(e),e--}getAt(e){F(e,0,this.size-1);let{bucketIndex:t,indexInBucket:r}=this._getBucketAndPosition(e);return this._buckets[t][r]}setAt(e,t){F(e,0,this.size-1);let{bucketIndex:r,indexInBucket:i}=this._getBucketAndPosition(e);return this._buckets[r][i]=t,!0}addAt(e,t,r=1){let i=this.size;if(F(e,0,i),e===0)for(;r--;)this.unshift(t);else if(e===this.size)for(;r--;)this.push(t);else{let s=[];for(let o=e;o<this.size;++o)s.push(this.getAt(o));this.cut(e-1);for(let o=0;o<r;++o)this.push(t);for(let o=0;o<s.length;++o)this.push(s[o])}return!0}cut(e){if(e<0)return this.clear(),0;let{bucketIndex:t,indexInBucket:r}=this._getBucketAndPosition(e);return this._bucketLast=t,this._lastInBucket=r,this._size=e+1,this.size}deleteAt(e){if(F(e,0,this.size-1),e===0)this.shift();else if(e===this.size-1)this.pop();else{let t=this.size-1,{bucketIndex:r,indexInBucket:i}=this._getBucketAndPosition(e);for(let s=e;s<t;++s){let{bucketIndex:o,indexInBucket:l}=this._getBucketAndPosition(e+1);this._buckets[r][i]=this._buckets[o][l],r=o,i=l}this.pop()}return!0}delete(e){let t=this.size;if(t===0)return!1;let r=0,i=0;for(;r<t;){let s=this.getAt(r);s!==e&&(this.setAt(i,s),i+=1),r+=1}return this.cut(i-1),!0}reverse(){this._buckets.reverse().forEach(function(s){s.reverse()});let{_bucketFirst:e,_bucketLast:t,_firstInBucket:r,_lastInBucket:i}=this;return this._bucketFirst=this._bucketCount-t-1,this._bucketLast=this._bucketCount-e-1,this._firstInBucket=this._bucketSize-i-1,this._lastInBucket=this._bucketSize-r-1,this}unique(){if(this.size<=1)return this;let e=1,t=this.getAt(0);for(let r=1;r<this.size;++r){let i=this.getAt(r);i!==t&&(t=i,this.setAt(e++,i))}return this.cut(e-1),this}sort(e){let t=[];for(let r=0;r<this.size;++r)t.push(this.getAt(r));t.sort(e);for(let r=0;r<this.size;++r)this.setAt(r,t[r]);return this}shrinkToFit(){if(this.size===0)return;let e=[];if(this._bucketFirst!==this._bucketLast){if(this._bucketFirst<this._bucketLast)for(let t=this._bucketFirst;t<=this._bucketLast;++t)e.push(this._buckets[t]);else{for(let t=this._bucketFirst;t<this._bucketCount;++t)e.push(this._buckets[t]);for(let t=0;t<=this._bucketLast;++t)e.push(this._buckets[t])}this._bucketFirst=0,this._bucketLast=e.length-1,this._buckets=e}}find(e){for(let t=0;t<this.size;++t){let r=this.getAt(t);if(e(r,t,this))return r}}indexOf(e){for(let t=0;t<this.size;++t)if(this.getAt(t)===e)return t;return-1}toArray(){return[...this]}filter(e,t){let r=new h([],{bucketSize:this._bucketSize}),i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h([],{bucketSize:this._bucketSize}),i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}addLast(e){return this.push(e)}pollLast(){return this.pop()}addFirst(e){return this.unshift(e)}pollFirst(){return this.shift()}*_getIterator(){for(let e=0;e<this.size;++e)yield this.getAt(e)}_reallocate(e){let t=[],r=e||this._bucketCount>>1||1;for(let i=0;i<r;++i)t[i]=new Array(this._bucketSize);for(let i=this._bucketFirst;i<this._bucketCount;++i)t[t.length]=this._buckets[i];for(let i=0;i<this._bucketLast;++i)t[t.length]=this._buckets[i];t[t.length]=[...this._buckets[this._bucketLast]],this._bucketFirst=r,this._bucketLast=t.length-1;for(let i=0;i<r;++i)t[t.length]=new Array(this._bucketSize);this._buckets=t,this._bucketCount=t.length}_getBucketAndPosition(e){let t,r,i=this._firstInBucket+e;return t=this._bucketFirst+Math.floor(i/this._bucketSize),t>=this._bucketCount&&(t-=this._bucketCount),r=(i+1)%this._bucketSize-1,r<0&&(r=this._bucketSize-1),{bucketIndex:t,indexInBucket:r}}};var I=class h extends k{constructor(e=[],t){super();d(this,"_comparator",(e,t)=>{if(typeof e=="number"&&typeof t=="number")return e-t;throw new Error("The a, b params of compare function must be number")});d(this,"_elements",[]);if(t){let{comparator:r}=t;r&&(this._comparator=r)}if(e)for(let r of e)this.add(r)}get comparator(){return this._comparator}get elements(){return this._elements}get size(){return this.elements.length}get leaf(){var e;return(e=this.elements[this.size-1])!=null?e:void 0}static heapify(e,t){return new h(e,t)}add(e){return this._elements.push(e),this._bubbleUp(this.elements.length-1)}poll(){if(this.elements.length===0)return;let e=this.elements[0],t=this.elements.pop();return this.elements.length&&(this.elements[0]=t,this._sinkDown(0,this.elements.length>>1)),e}peek(){return this.elements[0]}isEmpty(){return this.size===0}clear(){this._elements=[]}refill(e){return this._elements=e,this.fix()}has(e){return this.elements.includes(e)}delete(e){let t=this.elements.indexOf(e);return t<0?!1:(t===0?this.poll():t===this.elements.length-1?this.elements.pop():(this.elements.splice(t,1,this.elements.pop()),this._bubbleUp(t),this._sinkDown(t,this.elements.length>>1)),!0)}dfs(e="pre"){let t=[],r=i=>{let s=2*i+1,o=s+1;i<this.size&&(e==="in"?(r(s),t.push(this.elements[i]),r(o)):e==="pre"?(t.push(this.elements[i]),r(s),r(o)):e==="post"&&(r(s),r(o),t.push(this.elements[i])))};return r(0),t}toArray(){return[...this.elements]}clone(){let e=new h([],{comparator:this.comparator});return e._elements=[...this.elements],e}sort(){let e=[],t=this.clone();for(;t.size!==0;){let r=t.poll();r&&e.push(r)}return e}fix(){let e=[];for(let t=Math.floor(this.size/2);t>=0;t--)e.push(this._sinkDown(t,this.elements.length>>1));return e}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.add(s),i++;return r}map(e,t,r){let i=new h([],{comparator:t}),s=0;for(let o of this)i.add(e.call(r,o,s,this)),s++;return i}*_getIterator(){for(let e of this.elements)yield e}_bubbleUp(e){let t=this.elements[e];for(;e>0;){let r=e-1>>1,i=this.elements[r];if(this.comparator(i,t)<=0)break;this.elements[e]=i,e=r}return this.elements[e]=t,!0}_sinkDown(e,t){let r=this.elements[e];for(;e<t;){let i=e<<1|1,s=i+1,o=this.elements[i];if(s<this.elements.length&&this.comparator(o,this.elements[s])>0&&(i=s,o=this.elements[s]),this.comparator(o,r)>=0)break;this.elements[e]=o,e=i}return this.elements[e]=r,!0}},le=class{constructor(n,e=0){d(this,"element");d(this,"degree");d(this,"left");d(this,"right");d(this,"child");d(this,"parent");d(this,"marked");this.element=n,this.degree=e,this.marked=!1}},we=class{constructor(n){d(this,"_root");d(this,"_size",0);d(this,"_min");d(this,"_comparator");if(this.clear(),this._comparator=n||this._defaultComparator,typeof this.comparator!="function")throw new Error("FibonacciHeap constructor: given comparator should be a function.")}get root(){return this._root}get size(){return this._size}get min(){return this._min}get comparator(){return this._comparator}clear(){this._root=void 0,this._min=void 0,this._size=0}add(n){return this.push(n)}push(n){let e=this.createNode(n);return e.left=e,e.right=e,this.mergeWithRoot(e),(!this.min||this.comparator(e.element,this.min.element)<=0)&&(this._min=e),this._size++,this}peek(){return this.min?this.min.element:void 0}consumeLinkedList(n){let e=[];if(!n)return e;let t=n,r=!1;for(;!(t===n&&r);)t===n&&(r=!0),t&&(e.push(t),t=t.right);return e}mergeWithChild(n,e){n.child?(e.right=n.child.right,e.left=n.child,n.child.right.left=e,n.child.right=e):n.child=e}poll(){return this.pop()}pop(){if(this.size===0)return;let n=this.min;if(n.child){let e=this.consumeLinkedList(n.child);for(let t of e)this.mergeWithRoot(t),t.parent=void 0}return this.removeFromRoot(n),n===n.right?(this._min=void 0,this._root=void 0):(this._min=n.right,this._consolidate()),this._size--,n.element}merge(n){if(n.size!==0){if(this.root&&n.root){let e=this.root,t=n.root,r=e.right,i=t.left;e.right=t,t.left=e,r.left=i,i.right=r}(!this.min||n.min&&this.comparator(n.min.element,this.min.element)<0)&&(this._min=n.min),this._size+=n.size,n.clear()}}createNode(n){return new le(n)}_defaultComparator(n,e){return n<e?-1:n>e?1:0}mergeWithRoot(n){this.root?(n.right=this.root.right,n.left=this.root,this.root.right.left=n,this.root.right=n):this._root=n}removeFromRoot(n){this.root===n&&(this._root=n.right),n.left&&(n.left.right=n.right),n.right&&(n.right.left=n.left)}_link(n,e){this.removeFromRoot(n),n.left=n,n.right=n,this.mergeWithChild(e,n),e.degree++,n.parent=e}_consolidate(){let n=new Array(this.size),e=this.consumeLinkedList(this.root),t,r,i,s;for(let o of e){for(t=o,i=t.degree;n[i];)r=n[i],this.comparator(t.element,r.element)>0&&(s=t,t=r,r=s),this._link(r,t),n[i]=void 0,i++;n[i]=t}for(let o=0;o<this.size;o++)n[o]&&this.comparator(n[o].element,this.min.element)<=0&&(this._min=n[o])}};var Ce=class extends I{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return r-t;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var Re=class extends I{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return t-r;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var O=class{constructor(n,e){d(this,"key");d(this,"value");this.key=n,this.value=e}},D=class{constructor(n,e){d(this,"value");d(this,"weight");d(this,"_hashCode");this.weight=n!==void 0?n:1,this.value=e,this._hashCode=be()}get hashCode(){return this._hashCode}},q=class extends S{constructor(){super();d(this,"_vertexMap",new Map)}get vertexMap(){return this._vertexMap}getVertex(e){return this._vertexMap.get(e)||void 0}hasVertex(e){return this._vertexMap.has(this._getVertexKey(e))}addVertex(e,t){if(e instanceof O)return this._addVertex(e);{let r=this.createVertex(e,t);return this._addVertex(r)}}isVertexKey(e){let t=typeof e;return t==="string"||t==="number"}removeManyVertices(e){let t=[];for(let r of e)t.push(this.deleteVertex(r));return t.length>0}hasEdge(e,t){return!!this.getEdge(e,t)}addEdge(e,t,r,i){if(e instanceof D)return this._addEdge(e);if(t instanceof O||typeof t=="string"||typeof t=="number"){if(!(this.hasVertex(e)&&this.hasVertex(t)))return!1;e instanceof O&&(e=e.key),t instanceof O&&(t=t.key);let s=this.createEdge(e,t,r,i);return this._addEdge(s)}else throw new Error("dest must be a Vertex or vertex key while srcOrEdge is an Edge")}setEdgeWeight(e,t,r){let i=this.getEdge(e,t);return i?(i.weight=r,!0):!1}getAllPathsBetween(e,t,r=1e3){let i=[],s=this._getVertex(e),o=this._getVertex(t);if(!(s&&o))return[];let l=[];for(l.push({vertex:s,path:[s]});l.length>0;){let{vertex:a,path:u}=l.pop();if(a===o&&(i.push(u),i.length>=r))return i;let f=this.getNeighbors(a);for(let b of f)if(!u.includes(b)){let m=[...u,b];l.push({vertex:b,path:m})}}return i}getPathSumWeight(e){var r;let t=0;for(let i=0;i<e.length;i++)t+=((r=this.getEdge(e[i],e[i+1]))==null?void 0:r.weight)||0;return t}getMinCostBetween(e,t,r){if(r===void 0&&(r=!1),r){let i=this.getAllPathsBetween(e,t),s=1/0;for(let o of i)s=Math.min(this.getPathSumWeight(o),s);return s}else{let i=this._getVertex(t),s=this._getVertex(e);if(!(s&&i))return;let o=new Map,l=new v([s]);o.set(s,!0);let a=0;for(;l.size>0;){for(let u=0;u<l.size;u++){let f=l.shift();if(f===i)return a;if(f!==void 0){let b=this.getNeighbors(f);for(let m of b)o.has(m)||(o.set(m,!0),l.push(m))}}a++}return}}getMinPathBetween(e,t,r,i=!1){var s,o;if(r===void 0&&(r=!1),r)if(i){let l=this.getAllPathsBetween(e,t,1e4),a=1/0,u=-1,f=0;for(let b of l){let m=this.getPathSumWeight(b);m<a&&(a=m,u=f),f++}return l[u]||void 0}else return(o=(s=this.dijkstra(e,t,!0,!0))==null?void 0:s.minPath)!=null?o:[];else{let l=[],a=this._getVertex(e),u=this._getVertex(t);if(!(a&&u))return[];let f=(b,m,y,_)=>{if(y.add(b),b===m){l=[a,..._];return}let K=this.getNeighbors(b);for(let T of K)y.has(T)||(_.push(T),f(T,m,y,_),_.pop());y.delete(b)};return f(a,u,new Set,[]),l}}dijkstraWithoutHeap(e,t=void 0,r=!1,i=!1){let s=1/0,o,l=[],a=[],u=this._vertexMap,f=new Map,b=new Set,m=new Map,y=this._getVertex(e),_=t?this._getVertex(t):void 0;if(!y)return;for(let p of u){let c=p[1];c instanceof O&&f.set(c,1/0)}f.set(y,0),m.set(y,void 0);let K=()=>{let p=1/0,c;for(let[N,g]of f)b.has(N)||g<p&&(p=g,c=N);return c},T=p=>{for(let c of u){let N=c[1];if(N instanceof O){let g=[N],V=m.get(N);for(;V;)g.push(V),V=m.get(V);let E=g.reverse();c[1]===p&&(l=E),a.push(E)}}};for(let p=1;p<u.size;p++){let c=K();if(c){if(b.add(c),_&&_===c)return r&&(s=f.get(_)||1/0),i&&T(_),{distMap:f,preMap:m,seen:b,paths:a,minDist:s,minPath:l};let N=this.getNeighbors(c);for(let g of N)if(!b.has(g)){let V=this.getEdge(c,g);if(V){let E=f.get(c),x=f.get(g);E!==void 0&&x!==void 0&&V.weight+E<x&&(f.set(g,V.weight+E),m.set(g,c))}}}}return r&&f.forEach((p,c)=>{c!==y&&p<s&&(s=p,i&&(o=c))}),i&&T(o),{distMap:f,preMap:m,seen:b,paths:a,minDist:s,minPath:l}}dijkstra(e,t=void 0,r=!1,i=!1){var p;let s=1/0,o,l=[],a=[],u=this._vertexMap,f=new Map,b=new Set,m=new Map,y=this._getVertex(e),_=t?this._getVertex(t):void 0;if(!y)return;for(let c of u){let N=c[1];N instanceof O&&f.set(N,1/0)}let K=new I([],{comparator:(c,N)=>c.key-N.key});K.add({key:0,value:y}),f.set(y,0),m.set(y,void 0);let T=c=>{for(let N of u){let g=N[1];if(g instanceof O){let V=[g],E=m.get(g);for(;E;)V.push(E),E=m.get(E);let x=V.reverse();N[1]===c&&(l=x),a.push(x)}}};for(;K.size>0;){let c=K.poll(),N=c==null?void 0:c.key,g=c==null?void 0:c.value;if(N!==void 0&&g){if(b.add(g),_&&_===g)return r&&(s=f.get(_)||1/0),i&&T(_),{distMap:f,preMap:m,seen:b,paths:a,minDist:s,minPath:l};let V=this.getNeighbors(g);for(let E of V)if(!b.has(E)){let x=(p=this.getEdge(g,E))==null?void 0:p.weight;if(typeof x=="number"){let C=f.get(E);C&&N+x<C&&(K.add({key:N+x,value:E}),m.set(E,g),f.set(E,N+x))}}}}return r&&f.forEach((c,N)=>{N!==y&&c<s&&(s=c,i&&(o=N))}),i&&T(o),{distMap:f,preMap:m,seen:b,paths:a,minDist:s,minPath:l}}bellmanFord(e,t,r,i){r===void 0&&(r=!1),i===void 0&&(i=!1);let s=this._getVertex(e),o=[],l=new Map,a=new Map,u=1/0,f=[],b;if(t&&(b=!1),!s)return{hasNegativeCycle:b,distMap:l,preMap:a,paths:o,min:u,minPath:f};let m=this._vertexMap,y=m.size,_=this.edgeSet(),K=_.length;this._vertexMap.forEach(p=>{l.set(p,1/0)}),l.set(s,0);for(let p=1;p<y;++p)for(let c=0;c<K;++c){let N=this.getEndsOfEdge(_[c]);if(N){let[g,V]=N,E=_[c].weight,x=l.get(g),C=l.get(V);x!==void 0&&C!==void 0&&l.get(g)!==1/0&&x+E<C&&(l.set(V,x+E),i&&a.set(V,g))}}let T;if(r&&l.forEach((p,c)=>{c!==s&&p<u&&(u=p,i&&(T=c))}),i)for(let p of m){let c=p[1];if(c instanceof O){let N=[c],g=a.get(c);for(;g!==void 0;)N.push(g),g=a.get(g);let V=N.reverse();p[1]===T&&(f=V),o.push(V)}}for(let p=0;p<K;++p){let c=this.getEndsOfEdge(_[p]);if(c){let[N]=c,g=_[p].weight,V=l.get(N);V&&V!==1/0&&V+g<V&&(b=!0)}}return{hasNegativeCycle:b,distMap:l,preMap:a,paths:o,min:u,minPath:f}}floydWarshall(){var s;let e=[...this._vertexMap],t=e.length,r=[],i=[];for(let o=0;o<t;o++){r[o]=[],i[o]=[];for(let l=0;l<t;l++)i[o][l]=void 0}for(let o=0;o<t;o++)for(let l=0;l<t;l++)r[o][l]=((s=this.getEdge(e[o][1],e[l][1]))==null?void 0:s.weight)||1/0;for(let o=0;o<t;o++)for(let l=0;l<t;l++)for(let a=0;a<t;a++)r[l][a]>r[l][o]+r[o][a]&&(r[l][a]=r[l][o]+r[o][a],i[l][a]=e[o][1]);return{costs:r,predecessor:i}}tarjan(e=!1,t=!1,r=!0,i=!1){e===void 0&&(e=!1),t===void 0&&(t=!1),r===void 0&&(r=!1),i===void 0&&(i=!1);let o=new Map,l=new Map,a=this._vertexMap;a.forEach(p=>{o.set(p,-1),l.set(p,1/0)});let[u]=a.values(),f=[],b=[],m=0,y=(p,c)=>{m++,o.set(p,m),l.set(p,m);let N=this.getNeighbors(p),g=0;for(let V of N)if(V!==c){o.get(V)===-1&&(g++,y(V,p));let E=l.get(V),x=l.get(p);x!==void 0&&E!==void 0&&l.set(p,Math.min(x,E));let C=o.get(p);if(E!==void 0&&C!==void 0&&(e&&(p===u&&g>=2||p!==u&&E>=C)&&f.push(p),t&&E>C)){let j=this.getEdge(p,V);j&&b.push(j)}}};y(u,void 0);let _=new Map;r&&(_=(()=>{let p=new Map;return l.forEach((c,N)=>{var g;p.has(c)?(g=p.get(c))==null||g.push(N):p.set(c,[N])}),p})());let T=new Map;if(i){let p=new Map,c=[],N=(g,V)=>{p.set(g,!0),c.push(g);let E=this.getNeighbors(g);for(let x of E)if(!p.get(x))N(x,g);else if(c.includes(x)&&x!==V){let C=c.indexOf(x),j=c.slice(C),Ye=Math.min(...j.map(Je=>o.get(Je)||1/0));T.set(Ye,j)}c.pop()};a.forEach(g=>{p.get(g)||N(g,void 0)})}return{dfnMap:o,lowMap:l,bridges:b,cutVertexes:f,SCCs:_,cycles:T}}getDFNMap(){return this.tarjan(!1,!1,!1,!1).dfnMap}getLowMap(){return this.tarjan(!1,!1,!1,!1).lowMap}getCutVertexes(){return this.tarjan(!0,!1,!1,!1).cutVertexes}getSCCs(){return this.tarjan(!1,!1,!0,!1).SCCs}getBridges(){return this.tarjan(!1,!0,!1,!1).bridges}getCycles(e=!1){let t=[],r=new Set,i=(o,l,a)=>{if(a.has(o)){(!e&&l.length>2||e&&l.length>=2)&&l[0]===o.key&&t.push([...l]);return}a.add(o),l.push(o.key);for(let u of this.getNeighbors(o))u&&i(u,l,a);a.delete(o),l.pop()};for(let o of this.vertexMap.values())i(o,[],r);let s=new Map;for(let o of t){let l=[...o].sort().toString();s.has(l)||s.set(l,o)}return[...s].map(o=>o[1])}filter(e,t){let r=[],i=0;for(let[s,o]of this)e.call(t,o,s,i,this)&&r.push([s,o]),i++;return r}map(e,t){let r=[],i=0;for(let[s,o]of this)r.push(e.call(t,o,s,i,this)),i++;return r}*_getIterator(){for(let e of this._vertexMap.values())yield[e.key,e.value]}_addVertex(e){return this.hasVertex(e)?!1:(this._vertexMap.set(e.key,e),!0)}_getVertex(e){let t=this._getVertexKey(e);return this._vertexMap.get(t)||void 0}_getVertexKey(e){return e instanceof O?e.key:e}};var U=class extends O{constructor(n,e){super(n,e)}},X=class extends D{constructor(e,t,r,i){super(r,i);d(this,"src");d(this,"dest");this.src=e,this.dest=t}},$=class extends q{constructor(){super();d(this,"_outEdgeMap",new Map);d(this,"_inEdgeMap",new Map)}get outEdgeMap(){return this._outEdgeMap}get inEdgeMap(){return this._inEdgeMap}createVertex(e,t){return new U(e,t)}createEdge(e,t,r,i){return new X(e,t,r!=null?r:1,i)}getEdge(e,t){let r=[];if(e!==void 0&&t!==void 0){let i=this._getVertex(e),s=this._getVertex(t);if(i&&s){let o=this._outEdgeMap.get(i);o&&(r=o.filter(l=>l.dest===s.key))}}return r[0]||void 0}deleteEdgeSrcToDest(e,t){let r=this._getVertex(e),i=this._getVertex(t),s;if(!r||!i)return;let o=this._outEdgeMap.get(r);o&&z(o,a=>a.dest===i.key);let l=this._inEdgeMap.get(i);return l&&(s=z(l,a=>a.src===r.key)[0]||void 0),s}deleteEdge(e,t){let r,i,s;if(this.isVertexKey(e))if(this.isVertexKey(t))i=this._getVertex(e),s=this._getVertex(t);else return;else i=this._getVertex(e.src),s=this._getVertex(e.dest);if(i&&s){let o=this._outEdgeMap.get(i);o&&o.length>0&&z(o,a=>a.src===i.key&&a.dest===(s==null?void 0:s.key));let l=this._inEdgeMap.get(s);l&&l.length>0&&(r=z(l,a=>a.src===i.key&&a.dest===s.key)[0])}return r}deleteVertex(e){let t,r;if(this.isVertexKey(e)?(r=this.getVertex(e),t=e):(r=e,t=this._getVertexKey(e)),r){let i=this.getNeighbors(r);for(let s of i)this._inEdgeMap.delete(s);this._outEdgeMap.delete(r),this._inEdgeMap.delete(r)}return this._vertexMap.delete(t)}deleteEdgesBetween(e,t){let r=[];if(e&&t){let i=this.deleteEdgeSrcToDest(e,t),s=this.deleteEdgeSrcToDest(t,e);i&&r.push(i),s&&r.push(s)}return r}incomingEdgesOf(e){let t=this._getVertex(e);return t?this.inEdgeMap.get(t)||[]:[]}outgoingEdgesOf(e){let 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(e===void 0)return[];let t=[],r=this.outgoingEdgesOf(e);for(let i of r){let s=this.getEdgeDest(i);s&&t.push(s)}return t}topologicalSort(e){e=e!=null?e:"key";let t=new Map;for(let o of this.vertexMap)t.set(o[1],0);let r=[],i=!1,s=o=>{t.set(o,1);let l=this.getDestinations(o);for(let a of l){let u=t.get(a);u===0?s(a):u===1&&(i=!0)}t.set(o,2),r.push(o)};for(let o of this.vertexMap)t.get(o[1])===0&&s(o[1]);if(!i)return e==="key"&&(r=r.map(o=>o instanceof U?o.key:o)),r.reverse()}edgeSet(){let e=[];return this._outEdgeMap.forEach(t=>{e=[...e,...t]}),e}getNeighbors(e){let t=[],r=this._getVertex(e);if(r){let i=this.outgoingEdgesOf(r);for(let s of i){let o=this._getVertex(s.dest);o&&t.push(o)}}return t}getEndsOfEdge(e){if(!this.hasEdge(e.src,e.dest))return;let t=this._getVertex(e.src),r=this._getVertex(e.dest);if(t&&r)return[t,r]}_addEdge(e){if(!(this.hasVertex(e.src)&&this.hasVertex(e.dest)))return!1;let t=this._getVertex(e.src),r=this._getVertex(e.dest);if(t&&r){let i=this._outEdgeMap.get(t);i?i.push(e):this._outEdgeMap.set(t,[e]);let s=this._inEdgeMap.get(r);return s?s.push(e):this._inEdgeMap.set(r,[e]),!0}else return!1}};var he=class extends O{constructor(n,e){super(n,e)}},ue=class extends D{constructor(e,t,r,i){super(r,i);d(this,"vertexMap");this.vertexMap=[e,t]}},Be=class extends q{constructor(){super();d(this,"_edgeMap");this._edgeMap=new Map}get edgeMap(){return this._edgeMap}createVertex(e,t){return new he(e,t!=null?t:e)}createEdge(e,t,r,i){return new ue(e,t,r!=null?r:1,i)}getEdge(e,t){var i;let r=[];if(e!==void 0&&t!==void 0){let s=this._getVertex(e),o=this._getVertex(t);s&&o&&(r=(i=this._edgeMap.get(s))==null?void 0:i.filter(l=>l.vertexMap.includes(o.key)))}return r&&r[0]||void 0}deleteEdgeBetween(e,t){let r=this._getVertex(e),i=this._getVertex(t);if(!r||!i)return;let s=this._edgeMap.get(r),o;s&&(o=z(s,a=>a.vertexMap.includes(i.key))[0]||void 0);let l=this._edgeMap.get(i);return l&&z(l,a=>a.vertexMap.includes(r.key)),o}deleteEdge(e,t){let r,i;if(this.isVertexKey(e))if(this.isVertexKey(t))r=this._getVertex(e),i=this._getVertex(t);else return;else r=this._getVertex(e.vertexMap[0]),i=this._getVertex(e.vertexMap[1]);if(r&&i)return this.deleteEdgeBetween(r,i)}deleteVertex(e){let t,r;this.isVertexKey(e)?(r=this.getVertex(e),t=e):(r=e,t=this._getVertexKey(e));let i=this.getNeighbors(e);return r&&(i.forEach(s=>{let o=this._edgeMap.get(s);if(o){let l=o.filter(a=>!a.vertexMap.includes(t));this._edgeMap.set(s,l)}}),this._edgeMap.delete(r)),this._vertexMap.delete(t)}degreeOf(e){var r;let t=this._getVertex(e);return t&&((r=this._edgeMap.get(t))==null?void 0:r.length)||0}edgesOf(e){let t=this._getVertex(e);return t?this._edgeMap.get(t)||[]:[]}edgeSet(){let e=new Set;return this._edgeMap.forEach(t=>{t.forEach(r=>{e.add(r)})}),[...e]}getNeighbors(e){let t=[],r=this._getVertex(e);if(r){let i=this.edgesOf(r);for(let s of i){let o=this._getVertex(s.vertexMap.filter(l=>l!==r.key)[0]);o&&t.push(o)}}return t}getEndsOfEdge(e){if(!this.hasEdge(e.vertexMap[0],e.vertexMap[1]))return;let t=this._getVertex(e.vertexMap[0]),r=this._getVertex(e.vertexMap[1]);if(t&&r)return[t,r]}_addEdge(e){for(let t of e.vertexMap){let r=this._getVertex(t);if(r===void 0)return!1;if(r){let i=this._edgeMap.get(r);i?i.push(e):this._edgeMap.set(r,[e])}}return!0}};var de=class extends U{constructor(e,t,r,i){super(e,t);d(this,"lat");d(this,"long");this.lat=r,this.long=i}},fe=class extends X{constructor(n,e,t,r){super(n,e,t,r)}},Me=class extends ${constructor(e,t){super();d(this,"_originCoord",[0,0]);d(this,"_bottomRight");this._originCoord=e,this._bottomRight=t}get originCoord(){return this._originCoord}get bottomRight(){return this._bottomRight}createVertex(e,t,r=this.originCoord[0],i=this.originCoord[1]){return new de(e,t,r,i)}createEdge(e,t,r,i){return new fe(e,t,r,i)}};var Ie=(e=>(e[e.RED=1]="RED",e[e.BLACK=0]="BLACK",e))(Ie||{});var Se=(e=>(e.STANDARD="STANDARD",e.INVERSE="INVERSE",e))(Se||{}),Le=(t=>(t.lt="lt",t.eq="eq",t.gt="gt",t))(Le||{}),ee=(e=>(e.ITERATIVE="ITERATIVE",e.RECURSIVE="RECURSIVE",e))(ee||{}),ce=(o=>(o.ROOT="ROOT",o.LEFT="LEFT",o.RIGHT="RIGHT",o.ROOT_LEFT="ROOT_LEFT",o.ROOT_RIGHT="ROOT_RIGHT",o.ISOLATED="ISOLATED",o.MAL_NODE="MAL_NODE",o))(ce||{});var w=class{constructor(n,e){d(this,"key");d(this,"value");d(this,"parent");d(this,"_left");d(this,"_right");this.key=n,this.value=e}get left(){return this._left}set left(n){n&&(n.parent=this),this._left=n}get right(){return this._right}set right(n){n&&(n.parent=this),this._right=n}get familyPosition(){let n=this;return this.parent?this.parent.left===n?this.left||this.right?"ROOT_LEFT":"LEFT":this.parent.right===n?this.left||this.right?"ROOT_RIGHT":"RIGHT":"MAL_NODE":this.left||this.right?"ROOT":"ISOLATED"}},te=class h extends S{constructor(e=[],t){super();d(this,"iterationType","ITERATIVE");d(this,"_extractor",e=>Number(e));d(this,"_root");d(this,"_size");d(this,"_defaultOneParamCallback",e=>e?e.key:void 0);if(t){let{iterationType:r,extractor:i}=t;r&&(this.iterationType=r),i&&(this._extractor=i)}this._size=0,e&&this.addMany(e)}get extractor(){return this._extractor}get root(){return this._root}get size(){return this._size}createNode(e,t){return new w(e,t)}createTree(e){return new h([],R({iterationType:this.iterationType},e))}exemplarToNode(e,t){if(e===void 0)return;let r;if(e===null)r=null;else if(this.isEntry(e)){let[i,s]=e;if(i===void 0)return;i===null?r=null:r=this.createNode(i,s)}else if(this.isNode(e))r=e;else if(!this.isNode(e))r=this.createNode(e,t);else return;return r}ensureNode(e,t="ITERATIVE"){let r;return this.isRealNode(e)?r=e:this.isEntry(e)?e[0]===null?r=null:e[0]!==void 0&&(r=this.getNodeByKey(e[0],t)):e===null?r=null:e!==void 0&&(r=this.getNodeByKey(e,t)),r}isNode(e){return e instanceof w}isEntry(e){return Array.isArray(e)&&e.length===2}isRealNode(e){return e instanceof w&&String(e.key)!=="NaN"}isNIL(e){return e instanceof w&&String(e.key)==="NaN"}isNodeOrNull(e){return this.isRealNode(e)||e===null}add(e,t){let r=this.exemplarToNode(e,t);if(r===void 0)return!1;if(!this.root)return this._root=r,this._size=1,!0;let i=new v([this.root]),s;for(;i.size>0;){let o=i.shift();if(o){if(r!==null&&o.key===r.key)return this._replaceNode(o,r),!0;s===void 0&&(o.left===void 0||o.right===void 0)&&(s=o),o.left!==null&&o.left&&i.push(o.left),o.right!==null&&o.right&&i.push(o.right)}}return s?(s.left===void 0?s.left=r:s.right===void 0&&(s.right=r),this._size++,!0):!1}addMany(e,t){let r=[],i;t&&(i=t[Symbol.iterator]());for(let s of e){let o;if(i){let l=i.next();l.done||(o=l.value)}r.push(this.add(s,o))}return r}refill(e,t){this.clear(),this.addMany(e,t)}delete(e,t=this._defaultOneParamCallback){let r=[];if(!this.root)return r;(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=a=>a);let i=this.getNode(e,t);if(!i)return r;let s=i!=null&&i.parent?i.parent:null,o,l=i;if(i.left){if(i.left){let a=this.getRightMost(i.left);if(a){let u=a.parent;l=this._swapProperties(i,a),u&&(u.right===a?u.right=a.left:u.left=a.left,o=u)}}}else if(!s)this._setRoot(null);else{let{familyPosition:a}=i;a==="LEFT"||a==="ROOT_LEFT"?s.left=i.right:(a==="RIGHT"||a==="ROOT_RIGHT")&&(s.right=i.right),o=s}return this._size=this.size-1,r.push({deleted:l,needBalanced:o}),r}getDepth(e,t=this.root){e=this.ensureNode(e),t=this.ensureNode(t);let r=0;for(;e!=null&&e.parent;){if(e===t)return r;r++,e=e.parent}return r}getHeight(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return-1;if(t==="RECURSIVE"){let r=i=>{if(!i)return-1;let s=r(i.left),o=r(i.right);return Math.max(s,o)+1};return r(e)}else{let r=[{node:e,depth:0}],i=0;for(;r.length>0;){let{node:s,depth:o}=r.pop();s.left&&r.push({node:s.left,depth:o+1}),s.right&&r.push({node:s.right,depth:o+1}),i=Math.max(i,o)}return i}}getMinHeight(e=this.root,t=this.iterationType){var r,i,s;if(e=this.ensureNode(e),!e)return-1;if(t==="RECURSIVE"){let o=l=>{if(!l||!l.left&&!l.right)return 0;let a=o(l.left),u=o(l.right);return Math.min(a,u)+1};return o(e)}else{let o=[],l=e,a=null,u=new Map;for(;o.length>0||l;)if(l)o.push(l),l=l.left;else if(l=o[o.length-1],!l.right||a===l.right){if(l=o.pop(),l){let f=l.left&&(r=u.get(l.left))!=null?r:-1,b=l.right&&(i=u.get(l.right))!=null?i:-1;u.set(l,1+Math.min(f,b)),a=l,l=null}}else l=l.right;return(s=u.get(e))!=null?s:-1}}isPerfectlyBalanced(e=this.root){return this.getMinHeight(e)+1>=this.getHeight(e)}getNodes(e,t=this._defaultOneParamCallback,r=!1,i=this.root,s=this.iterationType){if((!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=l=>l),i=this.ensureNode(i),!i)return[];let o=[];if(s==="RECURSIVE"){let l=a=>{t(a)===e&&(o.push(a),r)||!a.left&&!a.right||(a.left&&l(a.left),a.right&&l(a.right))};l(i)}else{let l=new v([i]);for(;l.size>0;){let a=l.shift();if(a){if(t(a)===e&&(o.push(a),r))return o;a.left&&l.push(a.left),a.right&&l.push(a.right)}}}return o}has(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){return(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=s=>s),this.getNodes(e,t,!0,r,i).length>0}getNode(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){var s;return(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=o=>o),(s=this.getNodes(e,t,!0,r,i)[0])!=null?s:null}getNodeByKey(e,t="ITERATIVE"){if(this.root)if(t==="RECURSIVE"){let r=i=>{if(i.key===e)return i;if(!(!i.left&&!i.right)){if(i.left)return r(i.left);if(i.right)return r(i.right)}};return r(this.root)}else{let r=new v([this.root]);for(;r.size>0;){let i=r.shift();if(i){if(i.key===e)return i;i.left&&r.push(i.left),i.right&&r.push(i.right)}}}}get(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){var s,o;return(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=l=>l),(o=(s=this.getNode(e,t,r,i))==null?void 0:s.value)!=null?o:void 0}clear(){this._setRoot(void 0),this._size=0}isEmpty(){return this.size===0}getPathToRoot(e,t=!0){let r=[];if(e=this.ensureNode(e),!e)return r;for(;e.parent;)r.push(e),e=e.parent;return r.push(e),t?r.reverse():r}getLeftMost(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return e;if(t==="RECURSIVE"){let r=i=>this.isRealNode(i.left)?r(i.left):i;return r(e)}else{let r=oe(i=>this.isRealNode(i.left)?r.cont(i.left):i);return r(e)}}getRightMost(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return e;if(t==="RECURSIVE"){let r=i=>this.isRealNode(i.right)?r(i.right):i;return r(e)}else{let r=oe(i=>this.isRealNode(i.right)?r.cont(i.right):i);return r(e)}}isBST(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return!0;if(t==="RECURSIVE"){let r=(o,l,a)=>{if(!o)return!0;let u=this.extractor(o.key);return u<=l||u>=a?!1:r(o.left,l,u)&&r(o.right,u,a)},i=r(e,Number.MIN_SAFE_INTEGER,Number.MAX_SAFE_INTEGER),s=r(e,Number.MAX_SAFE_INTEGER,Number.MIN_SAFE_INTEGER);return i||s}else{let r=(o=!1)=>{let l=[],a=o?Number.MAX_SAFE_INTEGER:Number.MIN_SAFE_INTEGER,u=e;for(;u||l.length>0;){for(;u;)l.push(u),u=u.left;u=l.pop();let f=this.extractor(u.key);if(!u||!o&&a>=f||o&&a<=f)return!1;a=f,u=u.right}return!0},i=r(!1),s=r(!0);return i||s}}dfs(e=this._defaultOneParamCallback,t="in",r=this.root,i="ITERATIVE",s=!1){if(r=this.ensureNode(r),!r)return[];let o=[];if(i==="RECURSIVE"){let l=a=>{switch(t){case"in":s?(a&&this.isNodeOrNull(a.left)&&l(a.left),this.isNodeOrNull(a)&&o.push(e(a)),a&&this.isNodeOrNull(a.right)&&l(a.right)):(a&&a.left&&l(a.left),this.isRealNode(a)&&o.push(e(a)),a&&a.right&&l(a.right));break;case"pre":s?(this.isNodeOrNull(a)&&o.push(e(a)),a&&this.isNodeOrNull(a.left)&&l(a.left),a&&this.isNodeOrNull(a.right)&&l(a.right)):(this.isRealNode(a)&&o.push(e(a)),a&&a.left&&l(a.left),a&&a.right&&l(a.right));break;case"post":s?(a&&this.isNodeOrNull(a.left)&&l(a.left),a&&this.isNodeOrNull(a.right)&&l(a.right),this.isNodeOrNull(a)&&o.push(e(a))):(a&&a.left&&l(a.left),a&&a.right&&l(a.right),this.isRealNode(a)&&o.push(e(a)));break}};l(r)}else{let l=[{opt:0,node:r}];for(;l.length>0;){let a=l.pop();if(!(a===void 0||this.isNIL(a.node))){if(s){if(a.node===void 0)continue}else if(a.node===null||a.node===void 0)continue;if(a.opt===1)o.push(e(a.node));else switch(t){case"in":a.node&&l.push({opt:0,node:a.node.right}),l.push({opt:1,node:a.node}),a.node&&l.push({opt:0,node:a.node.left});break;case"pre":a.node&&l.push({opt:0,node:a.node.right}),a.node&&l.push({opt:0,node:a.node.left}),l.push({opt:1,node:a.node});break;case"post":l.push({opt:1,node:a.node}),a.node&&l.push({opt:0,node:a.node.right}),a.node&&l.push({opt:0,node:a.node.left});break;default:a.node&&l.push({opt:0,node:a.node.right}),l.push({opt:1,node:a.node}),a.node&&l.push({opt:0,node:a.node.left});break}}}}return o}bfs(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType,i=!1){if(t=this.ensureNode(t),!t)return[];let s=[];if(r==="RECURSIVE"){let o=new v([t]),l=a=>{if(o.size===0)return;let u=o.shift();s.push(e(u)),i?(u&&this.isNodeOrNull(u.left)&&o.push(u.left),u&&this.isNodeOrNull(u.right)&&o.push(u.right)):(this.isRealNode(u.left)&&o.push(u.left),this.isRealNode(u.right)&&o.push(u.right)),l(a+1)};l(0)}else{let o=new v([t]);for(;o.size>0;){let l=o.size;for(let a=0;a<l;a++){let u=o.shift();s.push(e(u)),i?(u&&this.isNodeOrNull(u.left)&&o.push(u.left),u&&this.isNodeOrNull(u.right)&&o.push(u.right)):(this.isRealNode(u.left)&&o.push(u.left),this.isRealNode(u.right)&&o.push(u.right))}}}return s}listLevels(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType,i=!1){t=this.ensureNode(t);let s=[];if(!t)return s;if(r==="RECURSIVE"){let o=(l,a)=>{s[a]||(s[a]=[]),s[a].push(e(l)),i?(l&&this.isNodeOrNull(l.left)&&o(l.left,a+1),l&&this.isNodeOrNull(l.right)&&o(l.right,a+1)):(l&&l.left&&o(l.left,a+1),l&&l.right&&o(l.right,a+1))};o(t,0)}else{let o=[[t,0]];for(;o.length>0;){let l=o.pop(),[a,u]=l;s[u]||(s[u]=[]),s[u].push(e(a)),i?(a&&this.isNodeOrNull(a.right)&&o.push([a.right,u+1]),a&&this.isNodeOrNull(a.left)&&o.push([a.left,u+1])):(a&&a.right&&o.push([a.right,u+1]),a&&a.left&&o.push([a.left,u+1]))}}return s}getPredecessor(e){if(this.isRealNode(e.left)){let t=e.left;for(;!this.isRealNode(t)||this.isRealNode(t.right)&&t.right!==e;)this.isRealNode(t)&&(t=t.right);return t}else return e}getSuccessor(e){if(e=this.ensureNode(e),!this.isRealNode(e))return;if(this.isRealNode(e.right))return this.getLeftMost(e.right);let t=e.parent;for(;this.isRealNode(t)&&e===t.right;)e=t,t=t.parent;return t}morris(e=this._defaultOneParamCallback,t="in",r=this.root){if(r=this.ensureNode(r),r===null)return[];let i=[],s=r,o=a=>{let u=null,f=null;for(;a;)f=a.right,a.right=u,u=a,a=f;return u},l=a=>{let u=o(a),f=u;for(;f;)i.push(e(f)),f=f.right;o(u)};switch(t){case"in":for(;s;){if(s.left){let a=this.getPredecessor(s);if(a.right)a.right=null;else{a.right=s,s=s.left;continue}}i.push(e(s)),s=s.right}break;case"pre":for(;s;){if(s.left){let a=this.getPredecessor(s);if(a.right)a.right=null;else{a.right=s,i.push(e(s)),s=s.left;continue}}else i.push(e(s));s=s.right}break;case"post":for(;s;){if(s.left){let a=this.getPredecessor(s);if(a.right===null){a.right=s,s=s.left;continue}else a.right=null,l(s.left)}s=s.right}l(r);break}return i}clone(){let e=this.createTree();return this.bfs(t=>e.add([t.key,t.value])),e}filter(e,t){let r=this.createTree(),i=0;for(let[s,o]of this)e.call(t,o,s,i++,this)&&r.add([s,o]);return r}map(e,t){let r=this.createTree(),i=0;for(let[s,o]of this)r.add([s,e.call(t,o,s,i++,this)]);return r}print(e=this.root,t){let r=R({isShowUndefined:!1,isShowNull:!1,isShowRedBlackNIL:!1},t);if(e=this.ensureNode(e),!e)return;r.isShowUndefined&&console.log(`U for undefined
-      `),r.isShowNull&&console.log(`N for null
+"use strict";var dataStructureTyped=(()=>{var ne=Object.defineProperty;var Ye=Object.getOwnPropertyDescriptor;var Je=Object.getOwnPropertyNames,Ge=Object.getOwnPropertySymbols;var We=Object.prototype.hasOwnProperty,Ze=Object.prototype.propertyIsEnumerable;var pe=(h,n)=>{if(n=Symbol[h])return n;throw Error("Symbol."+h+" is not defined")};var Ee=(h,n,e)=>n in h?ne(h,n,{enumerable:!0,configurable:!0,writable:!0,value:e}):h[n]=e,v=(h,n)=>{for(var e in n||(n={}))We.call(n,e)&&Ee(h,e,n[e]);if(Ge)for(var e of Ge(n))Ze.call(n,e)&&Ee(h,e,n[e]);return h};var $e=(h,n)=>{for(var e in n)ne(h,e,{get:n[e],enumerable:!0})},et=(h,n,e,t)=>{if(n&&typeof n=="object"||typeof n=="function")for(let r of Je(n))!We.call(h,r)&&r!==e&&ne(h,r,{get:()=>n[r],enumerable:!(t=Ye(n,r))||t.enumerable});return h};var tt=h=>et(ne({},"__esModule",{value:!0}),h);var d=(h,n,e)=>(Ee(h,typeof n!="symbol"?n+"":n,e),e);var Qe=(h,n,e)=>new Promise((t,r)=>{var i=l=>{try{o(e.next(l))}catch(a){r(a)}},s=l=>{try{o(e.throw(l))}catch(a){r(a)}},o=l=>l.done?t(l.value):Promise.resolve(l.value).then(i,s);o((e=e.apply(h,n)).next())}),rt=function(h,n){this[0]=h,this[1]=n};var I=h=>{var n=h[pe("asyncIterator")],e=!1,t,r={};return n==null?(n=h[pe("iterator")](),t=i=>r[i]=s=>n[i](s)):(n=n.call(h),t=i=>r[i]=s=>{if(e){if(e=!1,i==="throw")throw s;return s}return e=!0,{done:!1,value:new rt(new Promise(o=>{var l=n[i](s);if(!(l instanceof Object))throw TypeError("Object expected");o(l)}),1)}}),r[pe("iterator")]=()=>r,t("next"),"throw"in n?t("throw"):r.throw=i=>{throw i},"return"in n&&t("return"),r};var ot={};$e(ot,{AVLTree:()=>re,AVLTreeNode:()=>A,AbstractEdge:()=>z,AbstractGraph:()=>j,AbstractVertex:()=>T,BST:()=>U,BSTNode:()=>F,BSTVariant:()=>Me,BinaryIndexedTree:()=>Se,BinaryTree:()=>te,BinaryTreeNode:()=>w,CP:()=>Ie,Character:()=>ce,Deque:()=>Te,DirectedEdge:()=>Q,DirectedGraph:()=>$,DirectedVertex:()=>q,DoublyLinkedList:()=>Ve,DoublyLinkedListNode:()=>C,FamilyPosition:()=>fe,FibonacciHeap:()=>De,FibonacciHeapNode:()=>ae,HashMap:()=>_e,Heap:()=>B,IterableElementBase:()=>k,IterableEntryBase:()=>M,IterationType:()=>ee,LinkedHashMap:()=>Oe,LinkedListQueue:()=>ke,MapEdge:()=>de,MapGraph:()=>Ce,MapVertex:()=>ue,Matrix:()=>je,MaxHeap:()=>we,MaxPriorityQueue:()=>Pe,MinHeap:()=>ve,MinPriorityQueue:()=>He,Navigator:()=>qe,PriorityQueue:()=>G,Queue:()=>D,RBTNColor:()=>Be,RedBlackTree:()=>Fe,RedBlackTreeNode:()=>H,SegmentTree:()=>Le,SegmentTreeNode:()=>X,SinglyLinkedList:()=>J,SinglyLinkedListNode:()=>R,SkipList:()=>xe,SkipListNode:()=>Z,Stack:()=>Ke,THUNK_SYMBOL:()=>me,TreeMultimap:()=>ze,TreeMultimapNode:()=>ie,TreeNode:()=>Ae,Trie:()=>Ue,TrieNode:()=>Y,UndirectedEdge:()=>he,UndirectedGraph:()=>Re,UndirectedVertex:()=>le,arrayRemove:()=>S,calcMinUnitsRequired:()=>oe,getMSB:()=>Ne,isThunk:()=>be,isWeakKey:()=>W,rangeCheck:()=>L,roundFixed:()=>st,throwRangeError:()=>nt,toThunk:()=>ye,trampoline:()=>se,trampolineAsync:()=>it,uuidV4:()=>ge});var M=class{*[Symbol.iterator](...n){yield*I(this._getIterator(...n))}*entries(){for(let n of this)yield n}*keys(){for(let n of this)yield n[0]}*values(){for(let n of this)yield n[1]}every(n,e){let t=0;for(let r of this)if(!n.call(e,r[1],r[0],t++,this))return!1;return!0}some(n,e){let t=0;for(let r of this)if(n.call(e,r[1],r[0],t++,this))return!0;return!1}forEach(n,e){let t=0;for(let r of this){let[i,s]=r;n.call(e,s,i,t++,this)}}find(n,e){let t=0;for(let r of this){let[i,s]=r;if(n.call(e,s,i,t++,this))return r}}has(n){for(let e of this){let[t]=e;if(t===n)return!0}return!1}hasValue(n){for(let[,e]of this)if(e===n)return!0;return!1}get(n){for(let e of this){let[t,r]=e;if(t===n)return r}}reduce(n,e){let t=e,r=0;for(let i of this){let[s,o]=i;t=n(t,o,s,r++,this)}return t}print(){console.log([...this])}},k=class{*[Symbol.iterator](...n){yield*I(this._getIterator(...n))}*values(){for(let n of this)yield n}every(n,e){let t=0;for(let r of this)if(!n.call(e,r,t++,this))return!1;return!0}some(n,e){let t=0;for(let r of this)if(n.call(e,r,t++,this))return!0;return!1}forEach(n,e){let t=0;for(let r of this)n.call(e,r,t++,this)}find(n,e){let t=0;for(let r of this)if(n.call(e,r,t++,this))return r}has(n){for(let e of this)if(e===n)return!0;return!1}reduce(n,e){let t=e,r=0;for(let i of this)t=n(t,i,r++,this);return t}print(){console.log([...this])}};var ge=function(){return"xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/[x]/g,function(h){let n=Math.random()*16|0;return(h=="x"?n:n&3|8).toString(16)})},S=function(h,n){let e=-1,t=h?h.length:0,r=[];for(;++e<t;){let i=h[e];n(i,e,h)&&(r.push(i),Array.prototype.splice.call(h,e--,1),t--)}return r},me=Symbol("thunk"),be=h=>typeof h=="function"&&h.__THUNK__===me,ye=h=>{let n=()=>h();return n.__THUNK__=me,n},se=h=>Object.assign((...e)=>{let t=h(...e);for(;be(t)&&typeof t=="function";)t=t();return t},{cont:(...e)=>ye(()=>h(...e))}),it=h=>Object.assign((...e)=>Qe(void 0,null,function*(){let t=yield h(...e);for(;be(t)&&typeof t=="function";)t=yield t();return t}),{cont:(...e)=>ye(()=>h(...e))}),Ne=h=>h<=0?0:1<<31-Math.clz32(h),L=(h,n,e,t="Index out of bounds.")=>{if(h<n||h>e)throw new RangeError(t)},nt=(h="The value is off-limits.")=>{throw new RangeError(h)},W=h=>{let n=typeof h;return n==="object"&&h!==null||n==="function"},oe=(h,n)=>Math.floor((h+n-1)/n),st=(h,n=10)=>{let e=Math.pow(10,n);return Math.round(h*e)/e};var _e=class h extends M{constructor(e=[],t){super();d(this,"_store",{});d(this,"_objMap",new Map);d(this,"_toEntryFn",e=>{if(this.isEntry(e))return e;throw new Error("If the provided rawCollection does not adhere to the [key, value] type format, the toEntryFn in the constructor's options parameter needs to specified.")});d(this,"_size",0);d(this,"_hashFn",e=>String(e));if(t){let{hashFn:r,toEntryFn:i}=t;r&&(this._hashFn=r),i&&(this._toEntryFn=i)}e&&this.setMany(e)}get store(){return this._store}get objMap(){return this._objMap}get toEntryFn(){return this._toEntryFn}get size(){return this._size}get hashFn(){return this._hashFn}isEntry(e){return Array.isArray(e)&&e.length===2}isEmpty(){return this.size===0}clear(){this._store={},this._objMap.clear(),this._size=0}set(e,t){if(this._isObjKey(e))this.objMap.has(e)||this._size++,this.objMap.set(e,t);else{let r=this._getNoObjKey(e);this.store[r]===void 0&&this._size++,this._store[r]={key:e,value:t}}return!0}setMany(e){let t=[];for(let r of e){let i,s;if(this.isEntry(r))i=r[0],s=r[1];else{let o=this.toEntryFn(r);i=o[0],s=o[1]}t.push(this.set(i,s))}return t}get(e){var t;if(this._isObjKey(e))return this.objMap.get(e);{let r=this._getNoObjKey(e);return(t=this._store[r])==null?void 0:t.value}}has(e){return this._isObjKey(e)?this.objMap.has(e):this._getNoObjKey(e)in this.store}delete(e){if(this._isObjKey(e))return this.objMap.has(e)&&this._size--,this.objMap.delete(e);{let t=this._getNoObjKey(e);return t in this.store?(delete this.store[t],this._size--,!0):!1}}clone(){return new h(this,{hashFn:this.hashFn,toEntryFn:this.toEntryFn})}map(e,t){let r=new h,i=0;for(let[s,o]of this)r.set(s,e.call(t,o,s,i++,this));return r}filter(e,t){let r=new h,i=0;for(let[s,o]of this)e.call(t,o,s,i++,this)&&r.set(s,o);return r}put(e,t){return this.set(e,t)}*_getIterator(){for(let e of Object.values(this.store))yield[e.key,e.value];for(let e of this.objMap)yield e}_isObjKey(e){let t=typeof e;return(t==="object"||t==="function")&&e!==null}_getNoObjKey(e){let t=typeof e,r;return t!=="string"&&t!=="number"&&t!=="symbol"?r=this.hashFn(e):r=e,r}},Oe=class h extends M{constructor(e=[],t){super();d(this,"_sentinel");d(this,"_hashFn",e=>String(e));d(this,"_objHashFn",e=>e);d(this,"_noObjMap",{});d(this,"_objMap",new WeakMap);d(this,"_head");d(this,"_tail");d(this,"_toEntryFn",e=>{if(this.isEntry(e))return e;throw new Error("If the provided rawCollection does not adhere to the [key, value] type format, the toEntryFn in the constructor's options parameter needs to specified.")});d(this,"_size",0);if(this._sentinel={},this._sentinel.prev=this._sentinel.next=this._head=this._tail=this._sentinel,t){let{hashFn:r,objHashFn:i,toEntryFn:s}=t;r&&(this._hashFn=r),i&&(this._objHashFn=i),s&&(this._toEntryFn=s)}if(e)for(let r of e){let[i,s]=this.toEntryFn(r);this.set(i,s)}}get hashFn(){return this._hashFn}get objHashFn(){return this._objHashFn}get noObjMap(){return this._noObjMap}get objMap(){return this._objMap}get head(){return this._head}get tail(){return this._tail}get toEntryFn(){return this._toEntryFn}get size(){return this._size}get first(){if(this._size!==0)return[this.head.key,this.head.value]}get last(){if(this._size!==0)return[this.tail.key,this.tail.value]}*begin(){let e=this.head;for(;e!==this._sentinel;)yield[e.key,e.value],e=e.next}*reverseBegin(){let e=this.tail;for(;e!==this._sentinel;)yield[e.key,e.value],e=e.prev}set(e,t){let r,i=!this.has(e);if(W(e)){let s=this.objHashFn(e);r=this.objMap.get(s),!r&&i?(r={key:s,value:t,prev:this.tail,next:this._sentinel},this.objMap.set(s,r)):r&&(r.value=t)}else{let s=this.hashFn(e);r=this.noObjMap[s],!r&&i?this.noObjMap[s]=r={key:e,value:t,prev:this.tail,next:this._sentinel}:r&&(r.value=t)}return r&&i&&(this._size===0?(this._head=r,this._sentinel.next=r):(this.tail.next=r,r.prev=this.tail),this._tail=r,this._sentinel.prev=r,this._size++),!0}setMany(e){let t=[];for(let r of e){let[i,s]=this.toEntryFn(r);t.push(this.set(i,s))}return t}has(e){if(W(e)){let t=this.objHashFn(e);return this.objMap.has(t)}else return this.hashFn(e)in this.noObjMap}get(e){if(W(e)){let t=this.objHashFn(e),r=this.objMap.get(t);return r?r.value:void 0}else{let t=this.hashFn(e),r=this.noObjMap[t];return r?r.value:void 0}}at(e){L(e,0,this._size-1);let t=this.head;for(;e--;)t=t.next;return t.value}delete(e){let t;if(W(e)){let r=this.objHashFn(e);if(t=this.objMap.get(r),!t)return!1;this.objMap.delete(r)}else{let r=this.hashFn(e);if(t=this.noObjMap[r],!t)return!1;delete this.noObjMap[r]}return this._deleteNode(t),!0}deleteAt(e){L(e,0,this._size-1);let t=this.head;for(;e--;)t=t.next;return this._deleteNode(t)}isEmpty(){return this._size===0}isEntry(e){return Array.isArray(e)&&e.length===2}clear(){this._noObjMap={},this._size=0,this._head=this._tail=this._sentinel.prev=this._sentinel.next=this._sentinel}clone(){let e=new h([],{hashFn:this.hashFn,objHashFn:this.objHashFn});for(let t of this){let[r,i]=t;e.set(r,i)}return e}filter(e,t){let r=new h,i=0;for(let[s,o]of this)e.call(t,o,s,i,this)&&r.set(s,o),i++;return r}map(e,t){let r=new h,i=0;for(let[s,o]of this){let l=e.call(t,o,s,i,this);r.set(s,l),i++}return r}put(e,t){return this.set(e,t)}*_getIterator(){let e=this.head;for(;e!==this._sentinel;)yield[e.key,e.value],e=e.next}_deleteNode(e){let{prev:t,next:r}=e;return t.next=r,r.prev=t,e===this.head&&(this._head=r),e===this.tail&&(this._tail=t),this._size-=1,!0}};var R=class{constructor(n){d(this,"_value");d(this,"_next");this._value=n,this._next=void 0}get value(){return this._value}set value(n){this._value=n}get next(){return this._next}set next(n){this._next=n}},J=class h extends k{constructor(e=[]){super();d(this,"_head");d(this,"_tail");d(this,"_size",0);if(e)for(let t of e)this.push(t)}get head(){return this._head}get tail(){return this._tail}get size(){return this._size}static fromArray(e){let t=new h;for(let r of e)t.push(r);return t}push(e){let t=new R(e);return this.head?(this.tail.next=t,this._tail=t):(this._head=t,this._tail=t),this._size++,!0}addLast(e){return this.push(e)}pop(){if(!this.head)return;if(this.head===this.tail){let r=this.head.value;return this._head=void 0,this._tail=void 0,this._size--,r}let e=this.head;for(;e.next!==this.tail;)e=e.next;let t=this.tail.value;return e.next=void 0,this._tail=e,this._size--,t}pollLast(){return this.pop()}shift(){if(!this.head)return;let e=this.head;return this._head=this.head.next,this._size--,e.value}pollFirst(){return this.shift()}unshift(e){let t=new R(e);return this.head?(t.next=this.head,this._head=t):(this._head=t,this._tail=t),this._size++,!0}addFirst(e){return this.unshift(e)}at(e){if(e<0||e>=this.size)return;let t=this.head;for(let r=0;r<e;r++)t=t.next;return t.value}getNodeAt(e){let t=this.head;for(let r=0;r<e;r++)t=t.next;return t}deleteAt(e){if(e<0||e>=this.size)return!1;if(e===0)return this.shift(),!0;if(e===this.size-1)return this.pop(),!0;let t=this.getNodeAt(e-1),r=t.next;return t.next=r.next,this._size--,!0}delete(e){if(!e)return!1;let t;e instanceof R?t=e.value:t=e;let r=this.head,i;for(;r;){if(r.value===t)return i===void 0?(this._head=r.next,r===this.tail&&(this._tail=void 0)):(i.next=r.next,r===this.tail&&(this._tail=i)),this._size--,!0;i=r,r=r.next}return!1}addAt(e,t){if(e<0||e>this.size)return!1;if(e===0)return this.unshift(t),!0;if(e===this.size)return this.push(t),!0;let r=new R(t),i=this.getNodeAt(e-1);return r.next=i.next,i.next=r,this._size++,!0}isEmpty(){return this.size===0}clear(){this._head=void 0,this._tail=void 0,this._size=0}toArray(){let e=[],t=this.head;for(;t;)e.push(t.value),t=t.next;return e}reverse(){if(!this.head||this.head===this.tail)return this;let e,t=this.head,r;for(;t;)r=t.next,t.next=e,e=t,t=r;return[this._head,this._tail]=[this.tail,this.head],this}indexOf(e){let t=0,r=this.head;for(;r;){if(r.value===e)return t;t++,r=r.next}return-1}getNode(e){let t=this.head;for(;t;){if(t.value===e)return t;t=t.next}}addBefore(e,t){if(!this.head)return!1;let r;if(e instanceof R?r=e.value:r=e,this.head.value===r)return this.unshift(t),!0;let i=this.head;for(;i.next;){if(i.next.value===r){let s=new R(t);return s.next=i.next,i.next=s,this._size++,!0}i=i.next}return!1}addAfter(e,t){let r;if(e instanceof R?r=e:r=this.getNode(e),r){let i=new R(t);return i.next=r.next,r.next=i,r===this.tail&&(this._tail=i),this._size++,!0}return!1}countOccurrences(e){let t=0,r=this.head;for(;r;)r.value===e&&t++,r=r.next;return t}clone(){return new h(this.values())}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}*_getIterator(){let e=this.head;for(;e;)yield e.value,e=e.next}};var C=class{constructor(n){d(this,"_value");d(this,"_next");d(this,"_prev");this._value=n,this._next=void 0,this._prev=void 0}get value(){return this._value}set value(n){this._value=n}get next(){return this._next}set next(n){this._next=n}get prev(){return this._prev}set prev(n){this._prev=n}},Ve=class h extends k{constructor(e=[]){super();d(this,"_head");d(this,"_tail");d(this,"_size");if(this._head=void 0,this._tail=void 0,this._size=0,e)for(let t of e)this.push(t)}get head(){return this._head}get tail(){return this._tail}get size(){return this._size}get first(){var e;return(e=this.head)==null?void 0:e.value}get last(){var e;return(e=this.tail)==null?void 0:e.value}static fromArray(e){return new h(e)}push(e){let t=new C(e);return this.head?(t.prev=this.tail,this.tail.next=t,this._tail=t):(this._head=t,this._tail=t),this._size++,!0}pop(){if(!this.tail)return;let e=this.tail;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._tail=e.prev,this.tail.next=void 0),this._size--,e.value}shift(){if(!this.head)return;let e=this.head;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._head=e.next,this.head.prev=void 0),this._size--,e.value}unshift(e){let t=new C(e);return this.head?(t.next=this.head,this.head.prev=t,this._head=t):(this._head=t,this._tail=t),this._size++,!0}at(e){if(e<0||e>=this.size)return;let t=this.head;for(let r=0;r<e;r++)t=t.next;return t.value}getNodeAt(e){if(e<0||e>=this.size)return;let t=this.head;for(let r=0;r<e;r++)t=t.next;return t}getNode(e){let t=this.head;for(;t;){if(t.value===e)return t;t=t.next}}addAt(e,t){if(e<0||e>this.size)return!1;if(e===0)return this.unshift(t),!0;if(e===this.size)return this.push(t),!0;let r=new C(t),i=this.getNodeAt(e-1),s=i.next;return r.prev=i,r.next=s,i.next=r,s.prev=r,this._size++,!0}addBefore(e,t){let r;if(e instanceof C?r=e:r=this.getNode(e),r){let i=new C(t);return i.prev=r.prev,r.prev&&(r.prev.next=i),i.next=r,r.prev=i,r===this.head&&(this._head=i),this._size++,!0}return!1}addAfter(e,t){let r;if(e instanceof C?r=e:r=this.getNode(e),r){let i=new C(t);return i.next=r.next,r.next&&(r.next.prev=i),i.prev=r,r.next=i,r===this.tail&&(this._tail=i),this._size++,!0}return!1}deleteAt(e){if(e<0||e>=this.size)return!1;if(e===0)return this.shift(),!0;if(e===this.size-1)return this.pop(),!0;let t=this.getNodeAt(e),r=t.prev,i=t.next;return r.next=i,i.prev=r,this._size--,!0}delete(e){let t;if(e instanceof C?t=e:t=this.getNode(e),t){if(t===this.head)this.shift();else if(t===this.tail)this.pop();else{let r=t.prev,i=t.next;r.next=i,i.prev=r,this._size--}return!0}return!1}isEmpty(){return this.size===0}clear(){this._head=void 0,this._tail=void 0,this._size=0}indexOf(e){let t=0,r=this.head;for(;r;){if(r.value===e)return t;t++,r=r.next}return-1}findBackward(e){let t=this.tail;for(;t;){if(e(t.value))return t.value;t=t.prev}}reverse(){let e=this.head;for([this._head,this._tail]=[this.tail,this.head];e;){let t=e.next;[e.prev,e.next]=[e.next,e.prev],e=t}return this}toArray(){let e=[],t=this.head;for(;t;)e.push(t.value),t=t.next;return e}toReversedArray(){let e=[],t=this.tail;for(;t;)e.push(t.value),t=t.prev;return e}clone(){return new h(this.values())}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}addLast(e){return this.push(e)}pollLast(){return this.pop()}pollFirst(){return this.shift()}addFirst(e){this.unshift(e)}*_getIterator(){let e=this.head;for(;e;)yield e.value,e=e.next}};var Z=class{constructor(n,e,t){d(this,"key");d(this,"value");d(this,"forward");this.key=n,this.value=e,this.forward=new Array(t)}},xe=class{constructor(n=[],e){d(this,"_head",new Z(void 0,void 0,this.maxLevel));d(this,"_level",0);d(this,"_maxLevel",16);d(this,"_probability",.5);if(e){let{maxLevel:t,probability:r}=e;typeof t=="number"&&(this._maxLevel=t),typeof r=="number"&&(this._probability=r)}if(n)for(let[t,r]of n)this.add(t,r)}get head(){return this._head}get level(){return this._level}get maxLevel(){return this._maxLevel}get probability(){return this._probability}get first(){let n=this.head.forward[0];return n?n.value:void 0}get last(){let n=this.head;for(let e=this.level-1;e>=0;e--)for(;n.forward[e];)n=n.forward[e];return n.value}add(n,e){let t=new Z(n,e,this._randomLevel()),r=new Array(this.maxLevel).fill(this.head),i=this.head;for(let s=this.level-1;s>=0;s--){for(;i.forward[s]&&i.forward[s].key<n;)i=i.forward[s];r[s]=i}for(let s=0;s<t.forward.length;s++)t.forward[s]=r[s].forward[s],r[s].forward[s]=t;t.forward[0]||(this._level=Math.max(this.level,t.forward.length))}get(n){let e=this.head;for(let t=this.level-1;t>=0;t--)for(;e.forward[t]&&e.forward[t].key<n;)e=e.forward[t];if(e=e.forward[0],e&&e.key===n)return e.value}has(n){return this.get(n)!==void 0}delete(n){let e=new Array(this.maxLevel).fill(this.head),t=this.head;for(let r=this.level-1;r>=0;r--){for(;t.forward[r]&&t.forward[r].key<n;)t=t.forward[r];e[r]=t}if(t=t.forward[0],t&&t.key===n){for(let r=0;r<this.level&&e[r].forward[r]===t;r++)e[r].forward[r]=t.forward[r];for(;this.level>0&&!this.head.forward[this.level-1];)this._level--;return!0}return!1}higher(n){let e=this.head;for(let r=this.level-1;r>=0;r--)for(;e.forward[r]&&e.forward[r].key<=n;)e=e.forward[r];let t=e.forward[0];return t?t.value:void 0}lower(n){let e=this.head,t;for(let r=this.level-1;r>=0;r--){for(;e.forward[r]&&e.forward[r].key<n;)e=e.forward[r];e.key<n&&(t=e)}return t?t.value:void 0}_randomLevel(){let n=1;for(;Math.random()<this.probability&&n<this.maxLevel;)n++;return n}};var Ke=class h extends k{constructor(e=[]){super();d(this,"_elements",[]);if(e)for(let t of e)this.push(t)}get elements(){return this._elements}get size(){return this.elements.length}static fromArray(e){return new h(e)}isEmpty(){return this.elements.length===0}peek(){if(!this.isEmpty())return this.elements[this.elements.length-1]}push(e){return this.elements.push(e),!0}pop(){if(!this.isEmpty())return this.elements.pop()}delete(e){let t=this.elements.indexOf(e);return this.deleteAt(t)}deleteAt(e){return this.elements.splice(e,1).length===1}toArray(){return this.elements.slice()}clear(){this._elements=[]}clone(){return new h(this.elements.slice())}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}*_getIterator(){for(let e=0;e<this.elements.length;e++)yield this.elements[e]}};var D=class h extends k{constructor(e=[]){super();d(this,"_elements",[]);d(this,"_offset",0);if(e)for(let t of e)this.push(t)}get elements(){return this._elements}get offset(){return this._offset}get size(){return this.elements.length-this.offset}get first(){return this.size>0?this.elements[this.offset]:void 0}get last(){return this.size>0?this.elements[this.elements.length-1]:void 0}static fromArray(e){return new h(e)}push(e){return this.elements.push(e),!0}shift(){if(this.size===0)return;let e=this.first;return this._offset+=1,this.offset*2<this.elements.length||(this._elements=this.elements.slice(this.offset),this._offset=0),e}delete(e){let t=this.elements.indexOf(e);return this.deleteAt(t)}deleteAt(e){return this.elements.splice(e,1).length===1}peek(){return this.first}peekLast(){return this.last}enqueue(e){return this.push(e)}dequeue(){return this.shift()}at(e){return this.elements[e]}isEmpty(){return this.size===0}toArray(){return this.elements.slice(this.offset)}clear(){this._elements=[],this._offset=0}clone(){return new h(this.elements.slice(this.offset))}filter(e,t){let r=new h([]),i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h([]),i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}*_getIterator(){for(let e of this.elements)yield e}},ke=class h extends J{get first(){var n;return(n=this.head)==null?void 0:n.value}enqueue(n){return this.push(n)}dequeue(){return this.shift()}peek(){return this.first}clone(){return new h(this.values())}};var Te=class h extends k{constructor(e=[],t){super();d(this,"_bucketSize",4096);d(this,"_bucketFirst",0);d(this,"_firstInBucket",0);d(this,"_bucketLast",0);d(this,"_lastInBucket",0);d(this,"_bucketCount",0);d(this,"_buckets",[]);d(this,"_size",0);if(t){let{bucketSize:s}=t;typeof s=="number"&&(this._bucketSize=s)}let r;"length"in e?e.length instanceof Function?r=e.length():r=e.length:e.size instanceof Function?r=e.size():r=e.size,this._bucketCount=oe(r,this._bucketSize)||1;for(let s=0;s<this._bucketCount;++s)this._buckets.push(new Array(this._bucketSize));let i=oe(r,this._bucketSize);this._bucketFirst=this._bucketLast=(this._bucketCount>>1)-(i>>1),this._firstInBucket=this._lastInBucket=this._bucketSize-r%this._bucketSize>>1;for(let s of e)this.push(s)}get bucketSize(){return this._bucketSize}get bucketFirst(){return this._bucketFirst}get firstInBucket(){return this._firstInBucket}get bucketLast(){return this._bucketLast}get lastInBucket(){return this._lastInBucket}get bucketCount(){return this._bucketCount}get buckets(){return this._buckets}get size(){return this._size}get first(){if(this.size!==0)return this._buckets[this._bucketFirst][this._firstInBucket]}get last(){if(this.size!==0)return this._buckets[this._bucketLast][this._lastInBucket]}push(e){return this.size&&(this._lastInBucket<this._bucketSize-1?this._lastInBucket+=1:this._bucketLast<this._bucketCount-1?(this._bucketLast+=1,this._lastInBucket=0):(this._bucketLast=0,this._lastInBucket=0),this._bucketLast===this._bucketFirst&&this._lastInBucket===this._firstInBucket&&this._reallocate()),this._size+=1,this._buckets[this._bucketLast][this._lastInBucket]=e,!0}pop(){if(this.size===0)return;let e=this._buckets[this._bucketLast][this._lastInBucket];return this.size!==1&&(this._lastInBucket>0?this._lastInBucket-=1:this._bucketLast>0?(this._bucketLast-=1,this._lastInBucket=this._bucketSize-1):(this._bucketLast=this._bucketCount-1,this._lastInBucket=this._bucketSize-1)),this._size-=1,e}unshift(e){return this.size&&(this._firstInBucket>0?this._firstInBucket-=1:this._bucketFirst>0?(this._bucketFirst-=1,this._firstInBucket=this._bucketSize-1):(this._bucketFirst=this._bucketCount-1,this._firstInBucket=this._bucketSize-1),this._bucketFirst===this._bucketLast&&this._firstInBucket===this._lastInBucket&&this._reallocate()),this._size+=1,this._buckets[this._bucketFirst][this._firstInBucket]=e,!0}shift(){if(this.size===0)return;let e=this._buckets[this._bucketFirst][this._firstInBucket];return this.size!==1&&(this._firstInBucket<this._bucketSize-1?this._firstInBucket+=1:this._bucketFirst<this._bucketCount-1?(this._bucketFirst+=1,this._firstInBucket=0):(this._bucketFirst=0,this._firstInBucket=0)),this._size-=1,e}isEmpty(){return this.size===0}clear(){this._buckets=[new Array(this._bucketSize)],this._bucketCount=1,this._bucketFirst=this._bucketLast=this._size=0,this._firstInBucket=this._lastInBucket=this._bucketSize>>1}*begin(){let e=0;for(;e<this.size;)yield this.at(e),e++}*reverseBegin(){let e=this.size-1;for(;e>=0;)yield this.at(e),e--}at(e){L(e,0,this.size-1);let{bucketIndex:t,indexInBucket:r}=this._getBucketAndPosition(e);return this._buckets[t][r]}setAt(e,t){L(e,0,this.size-1);let{bucketIndex:r,indexInBucket:i}=this._getBucketAndPosition(e);return this._buckets[r][i]=t,!0}addAt(e,t,r=1){let i=this.size;if(L(e,0,i),e===0)for(;r--;)this.unshift(t);else if(e===this.size)for(;r--;)this.push(t);else{let s=[];for(let o=e;o<this.size;++o)s.push(this.at(o));this.cut(e-1,!0);for(let o=0;o<r;++o)this.push(t);for(let o=0;o<s.length;++o)this.push(s[o])}return!0}cut(e,t=!1){if(t){if(e<0)return this.clear(),this;let{bucketIndex:r,indexInBucket:i}=this._getBucketAndPosition(e);return this._bucketLast=r,this._lastInBucket=i,this._size=e+1,this}else{let r=new h([],{bucketSize:this._bucketSize});for(let i=0;i<=e;i++)r.push(this.at(i));return r}}cutRest(e,t=!1){if(t){if(e<0)return this.clear(),this;let{bucketIndex:r,indexInBucket:i}=this._getBucketAndPosition(e);return this._bucketFirst=r,this._firstInBucket=i,this._size=this._size-e,this}else{let r=new h([],{bucketSize:this._bucketSize});for(let i=e;i<this.size;i++)r.push(this.at(i));return r}}deleteAt(e){if(L(e,0,this.size-1),e===0)this.shift();else if(e===this.size-1)this.pop();else{let t=this.size-1,{bucketIndex:r,indexInBucket:i}=this._getBucketAndPosition(e);for(let s=e;s<t;++s){let{bucketIndex:o,indexInBucket:l}=this._getBucketAndPosition(e+1);this._buckets[r][i]=this._buckets[o][l],r=o,i=l}this.pop()}return!0}delete(e){let t=this.size;if(t===0)return!1;let r=0,i=0;for(;r<t;){let s=this.at(r);s!==e&&(this.setAt(i,s),i+=1),r+=1}return this.cut(i-1,!0),!0}reverse(){this._buckets.reverse().forEach(function(s){s.reverse()});let{_bucketFirst:e,_bucketLast:t,_firstInBucket:r,_lastInBucket:i}=this;return this._bucketFirst=this._bucketCount-t-1,this._bucketLast=this._bucketCount-e-1,this._firstInBucket=this._bucketSize-i-1,this._lastInBucket=this._bucketSize-r-1,this}unique(){if(this.size<=1)return this;let e=1,t=this.at(0);for(let r=1;r<this.size;++r){let i=this.at(r);i!==t&&(t=i,this.setAt(e++,i))}return this.cut(e-1,!0),this}sort(e){let t=[];for(let r=0;r<this.size;++r)t.push(this.at(r));t.sort(e);for(let r=0;r<this.size;++r)this.setAt(r,t[r]);return this}shrinkToFit(){if(this.size===0)return;let e=[];if(this._bucketFirst!==this._bucketLast){if(this._bucketFirst<this._bucketLast)for(let t=this._bucketFirst;t<=this._bucketLast;++t)e.push(this._buckets[t]);else{for(let t=this._bucketFirst;t<this._bucketCount;++t)e.push(this._buckets[t]);for(let t=0;t<=this._bucketLast;++t)e.push(this._buckets[t])}this._bucketFirst=0,this._bucketLast=e.length-1,this._buckets=e}}indexOf(e){for(let t=0;t<this.size;++t)if(this.at(t)===e)return t;return-1}toArray(){return[...this]}clone(){return new h([...this],{bucketSize:this.bucketSize})}filter(e,t){let r=new h([],{bucketSize:this._bucketSize}),i=0;for(let s of this)e.call(t,s,i,this)&&r.push(s),i++;return r}map(e,t){let r=new h([],{bucketSize:this._bucketSize}),i=0;for(let s of this)r.push(e.call(t,s,i,this)),i++;return r}addLast(e){return this.push(e)}pollLast(){return this.pop()}addFirst(e){return this.unshift(e)}pollFirst(){return this.shift()}*_getIterator(){for(let e=0;e<this.size;++e)yield this.at(e)}_reallocate(e){let t=[],r=e||this._bucketCount>>1||1;for(let i=0;i<r;++i)t[i]=new Array(this._bucketSize);for(let i=this._bucketFirst;i<this._bucketCount;++i)t[t.length]=this._buckets[i];for(let i=0;i<this._bucketLast;++i)t[t.length]=this._buckets[i];t[t.length]=[...this._buckets[this._bucketLast]],this._bucketFirst=r,this._bucketLast=t.length-1;for(let i=0;i<r;++i)t[t.length]=new Array(this._bucketSize);this._buckets=t,this._bucketCount=t.length}_getBucketAndPosition(e){let t,r,i=this._firstInBucket+e;return t=this._bucketFirst+Math.floor(i/this._bucketSize),t>=this._bucketCount&&(t-=this._bucketCount),r=(i+1)%this._bucketSize-1,r<0&&(r=this._bucketSize-1),{bucketIndex:t,indexInBucket:r}}};var B=class h extends k{constructor(e=[],t){super();d(this,"_comparator",(e,t)=>{if(typeof e=="number"&&typeof t=="number")return e-t;throw new Error("The a, b params of compare function must be number")});d(this,"_elements",[]);if(t){let{comparator:r}=t;r&&(this._comparator=r)}if(e)for(let r of e)this.add(r)}get comparator(){return this._comparator}get elements(){return this._elements}get size(){return this.elements.length}get leaf(){var e;return(e=this.elements[this.size-1])!=null?e:void 0}static heapify(e,t){return new h(e,t)}add(e){return this._elements.push(e),this._bubbleUp(this.elements.length-1)}poll(){if(this.elements.length===0)return;let e=this.elements[0],t=this.elements.pop();return this.elements.length&&(this.elements[0]=t,this._sinkDown(0,this.elements.length>>1)),e}peek(){return this.elements[0]}isEmpty(){return this.size===0}clear(){this._elements=[]}refill(e){return this._elements=e,this.fix()}has(e){return this.elements.includes(e)}delete(e){let t=this.elements.indexOf(e);return t<0?!1:(t===0?this.poll():t===this.elements.length-1?this.elements.pop():(this.elements.splice(t,1,this.elements.pop()),this._bubbleUp(t),this._sinkDown(t,this.elements.length>>1)),!0)}dfs(e="pre"){let t=[],r=i=>{let s=2*i+1,o=s+1;i<this.size&&(e==="in"?(r(s),t.push(this.elements[i]),r(o)):e==="pre"?(t.push(this.elements[i]),r(s),r(o)):e==="post"&&(r(s),r(o),t.push(this.elements[i])))};return r(0),t}toArray(){return[...this.elements]}clone(){let e=new h([],{comparator:this.comparator});return e._elements=[...this.elements],e}sort(){let e=[],t=this.clone();for(;t.size!==0;){let r=t.poll();r&&e.push(r)}return e}fix(){let e=[];for(let t=Math.floor(this.size/2);t>=0;t--)e.push(this._sinkDown(t,this.elements.length>>1));return e}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.add(s),i++;return r}map(e,t,r){let i=new h([],{comparator:t}),s=0;for(let o of this)i.add(e.call(r,o,s,this)),s++;return i}*_getIterator(){for(let e of this.elements)yield e}_bubbleUp(e){let t=this.elements[e];for(;e>0;){let r=e-1>>1,i=this.elements[r];if(this.comparator(i,t)<=0)break;this.elements[e]=i,e=r}return this.elements[e]=t,!0}_sinkDown(e,t){let r=this.elements[e];for(;e<t;){let i=e<<1|1,s=i+1,o=this.elements[i];if(s<this.elements.length&&this.comparator(o,this.elements[s])>0&&(i=s,o=this.elements[s]),this.comparator(o,r)>=0)break;this.elements[e]=o,e=i}return this.elements[e]=r,!0}},ae=class{constructor(n,e=0){d(this,"element");d(this,"degree");d(this,"left");d(this,"right");d(this,"child");d(this,"parent");d(this,"marked");this.element=n,this.degree=e,this.marked=!1}},De=class{constructor(n){d(this,"_root");d(this,"_size",0);d(this,"_min");d(this,"_comparator");if(this.clear(),this._comparator=n||this._defaultComparator,typeof this.comparator!="function")throw new Error("FibonacciHeap constructor: given comparator should be a function.")}get root(){return this._root}get size(){return this._size}get min(){return this._min}get comparator(){return this._comparator}clear(){this._root=void 0,this._min=void 0,this._size=0}add(n){return this.push(n)}push(n){let e=this.createNode(n);return e.left=e,e.right=e,this.mergeWithRoot(e),(!this.min||this.comparator(e.element,this.min.element)<=0)&&(this._min=e),this._size++,this}peek(){return this.min?this.min.element:void 0}consumeLinkedList(n){let e=[];if(!n)return e;let t=n,r=!1;for(;!(t===n&&r);)t===n&&(r=!0),t&&(e.push(t),t=t.right);return e}mergeWithChild(n,e){n.child?(e.right=n.child.right,e.left=n.child,n.child.right.left=e,n.child.right=e):n.child=e}poll(){return this.pop()}pop(){if(this.size===0)return;let n=this.min;if(n.child){let e=this.consumeLinkedList(n.child);for(let t of e)this.mergeWithRoot(t),t.parent=void 0}return this.removeFromRoot(n),n===n.right?(this._min=void 0,this._root=void 0):(this._min=n.right,this._consolidate()),this._size--,n.element}merge(n){if(n.size!==0){if(this.root&&n.root){let e=this.root,t=n.root,r=e.right,i=t.left;e.right=t,t.left=e,r.left=i,i.right=r}(!this.min||n.min&&this.comparator(n.min.element,this.min.element)<0)&&(this._min=n.min),this._size+=n.size,n.clear()}}createNode(n){return new ae(n)}_defaultComparator(n,e){return n<e?-1:n>e?1:0}mergeWithRoot(n){this.root?(n.right=this.root.right,n.left=this.root,this.root.right.left=n,this.root.right=n):this._root=n}removeFromRoot(n){this.root===n&&(this._root=n.right),n.left&&(n.left.right=n.right),n.right&&(n.right.left=n.left)}_link(n,e){this.removeFromRoot(n),n.left=n,n.right=n,this.mergeWithChild(e,n),e.degree++,n.parent=e}_consolidate(){let n=new Array(this.size),e=this.consumeLinkedList(this.root),t,r,i,s;for(let o of e){for(t=o,i=t.degree;n[i];)r=n[i],this.comparator(t.element,r.element)>0&&(s=t,t=r,r=s),this._link(r,t),n[i]=void 0,i++;n[i]=t}for(let o=0;o<this.size;o++)n[o]&&this.comparator(n[o].element,this.min.element)<=0&&(this._min=n[o])}};var we=class extends B{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return r-t;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var ve=class extends B{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return t-r;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var T=class{constructor(n,e){d(this,"key");d(this,"value");this.key=n,this.value=e}},z=class{constructor(n,e){d(this,"value");d(this,"weight");d(this,"_hashCode");this.weight=n!==void 0?n:1,this.value=e,this._hashCode=ge()}get hashCode(){return this._hashCode}},j=class extends M{constructor(){super();d(this,"_vertexMap",new Map)}get vertexMap(){return this._vertexMap}set vertexMap(e){this._vertexMap=e}getVertex(e){return this._vertexMap.get(e)||void 0}hasVertex(e){return this._vertexMap.has(this._getVertexKey(e))}addVertex(e,t){if(e instanceof T)return this._addVertex(e);{let r=this.createVertex(e,t);return this._addVertex(r)}}isVertexKey(e){let t=typeof e;return t==="string"||t==="number"}removeManyVertices(e){let t=[];for(let r of e)t.push(this.deleteVertex(r));return t.length>0}hasEdge(e,t){return!!this.getEdge(e,t)}addEdge(e,t,r,i){if(e instanceof z)return this._addEdge(e);if(t instanceof T||typeof t=="string"||typeof t=="number"){if(!(this.hasVertex(e)&&this.hasVertex(t)))return!1;e instanceof T&&(e=e.key),t instanceof T&&(t=t.key);let s=this.createEdge(e,t,r,i);return this._addEdge(s)}else throw new Error("dest must be a Vertex or vertex key while srcOrEdge is an Edge")}setEdgeWeight(e,t,r){let i=this.getEdge(e,t);return i?(i.weight=r,!0):!1}getAllPathsBetween(e,t,r=1e3){let i=[],s=this._getVertex(e),o=this._getVertex(t);if(!(s&&o))return[];let l=[];for(l.push({vertex:s,path:[s]});l.length>0;){let{vertex:a,path:u}=l.pop();if(a===o&&(i.push(u),i.length>=r))return i;let f=this.getNeighbors(a);for(let c of f)if(!u.includes(c)){let p=[...u,c];l.push({vertex:c,path:p})}}return i}getPathSumWeight(e){var r;let t=0;for(let i=0;i<e.length;i++)t+=((r=this.getEdge(e[i],e[i+1]))==null?void 0:r.weight)||0;return t}getMinCostBetween(e,t,r){if(r===void 0&&(r=!1),r){let i=this.getAllPathsBetween(e,t),s=1/0;for(let o of i)s=Math.min(this.getPathSumWeight(o),s);return s}else{let i=this._getVertex(t),s=this._getVertex(e);if(!(s&&i))return;let o=new Map,l=new D([s]);o.set(s,!0);let a=0;for(;l.size>0;){for(let u=0;u<l.size;u++){let f=l.shift();if(f===i)return a;if(f!==void 0){let c=this.getNeighbors(f);for(let p of c)o.has(p)||(o.set(p,!0),l.push(p))}}a++}return}}getMinPathBetween(e,t,r,i=!1){var s,o;if(r===void 0&&(r=!1),r)if(i){let l=this.getAllPathsBetween(e,t,1e4),a=1/0,u=-1,f=0;for(let c of l){let p=this.getPathSumWeight(c);p<a&&(a=p,u=f),f++}return l[u]||void 0}else return(o=(s=this.dijkstra(e,t,!0,!0))==null?void 0:s.minPath)!=null?o:[];else{let l=[],a=this._getVertex(e),u=this._getVertex(t);if(!(a&&u))return[];let f=(c,p,g,b)=>{if(g.add(c),c===p){l=[a,...b];return}let O=this.getNeighbors(c);for(let K of O)g.has(K)||(b.push(K),f(K,p,g,b),b.pop());g.delete(c)};return f(a,u,new Set,[]),l}}dijkstraWithoutHeap(e,t=void 0,r=!1,i=!1){let s=1/0,o,l=[],a=[],u=this._vertexMap,f=new Map,c=new Set,p=new Map,g=this._getVertex(e),b=t?this._getVertex(t):void 0;if(!g)return;for(let m of u){let E=m[1];E instanceof T&&f.set(E,1/0)}f.set(g,0),p.set(g,void 0);let O=()=>{let m=1/0,E;for(let[y,N]of f)c.has(y)||N<m&&(m=N,E=y);return E},K=m=>{for(let E of u){let y=E[1];if(y instanceof T){let N=[y],_=p.get(y);for(;_;)N.push(_),_=p.get(_);let V=N.reverse();E[1]===m&&(l=V),a.push(V)}}};for(let m=1;m<u.size;m++){let E=O();if(E){if(c.add(E),b&&b===E)return r&&(s=f.get(b)||1/0),i&&K(b),{distMap:f,preMap:p,seen:c,paths:a,minDist:s,minPath:l};let y=this.getNeighbors(E);for(let N of y)if(!c.has(N)){let _=this.getEdge(E,N);if(_){let V=f.get(E),x=f.get(N);V!==void 0&&x!==void 0&&_.weight+V<x&&(f.set(N,_.weight+V),p.set(N,E))}}}}return r&&f.forEach((m,E)=>{E!==g&&m<s&&(s=m,i&&(o=E))}),i&&K(o),{distMap:f,preMap:p,seen:c,paths:a,minDist:s,minPath:l}}dijkstra(e,t=void 0,r=!1,i=!1){var m;let s=1/0,o,l=[],a=[],u=this._vertexMap,f=new Map,c=new Set,p=new Map,g=this._getVertex(e),b=t?this._getVertex(t):void 0;if(!g)return;for(let E of u){let y=E[1];y instanceof T&&f.set(y,1/0)}let O=new B([],{comparator:(E,y)=>E.key-y.key});O.add({key:0,value:g}),f.set(g,0),p.set(g,void 0);let K=E=>{for(let y of u){let N=y[1];if(N instanceof T){let _=[N],V=p.get(N);for(;V;)_.push(V),V=p.get(V);let x=_.reverse();y[1]===E&&(l=x),a.push(x)}}};for(;O.size>0;){let E=O.poll(),y=E==null?void 0:E.key,N=E==null?void 0:E.value;if(y!==void 0&&N){if(c.add(N),b&&b===N)return r&&(s=f.get(b)||1/0),i&&K(b),{distMap:f,preMap:p,seen:c,paths:a,minDist:s,minPath:l};let _=this.getNeighbors(N);for(let V of _)if(!c.has(V)){let x=(m=this.getEdge(N,V))==null?void 0:m.weight;if(typeof x=="number"){let P=f.get(V);P&&y+x<P&&(O.add({key:y+x,value:V}),p.set(V,N),f.set(V,y+x))}}}}return r&&f.forEach((E,y)=>{y!==g&&E<s&&(s=E,i&&(o=y))}),i&&K(o),{distMap:f,preMap:p,seen:c,paths:a,minDist:s,minPath:l}}bellmanFord(e,t,r,i){r===void 0&&(r=!1),i===void 0&&(i=!1);let s=this._getVertex(e),o=[],l=new Map,a=new Map,u=1/0,f=[],c;if(t&&(c=!1),!s)return{hasNegativeCycle:c,distMap:l,preMap:a,paths:o,min:u,minPath:f};let p=this._vertexMap,g=p.size,b=this.edgeSet(),O=b.length;this._vertexMap.forEach(m=>{l.set(m,1/0)}),l.set(s,0);for(let m=1;m<g;++m)for(let E=0;E<O;++E){let y=this.getEndsOfEdge(b[E]);if(y){let[N,_]=y,V=b[E].weight,x=l.get(N),P=l.get(_);x!==void 0&&P!==void 0&&l.get(N)!==1/0&&x+V<P&&(l.set(_,x+V),i&&a.set(_,N))}}let K;if(r&&l.forEach((m,E)=>{E!==s&&m<u&&(u=m,i&&(K=E))}),i)for(let m of p){let E=m[1];if(E instanceof T){let y=[E],N=a.get(E);for(;N!==void 0;)y.push(N),N=a.get(N);let _=y.reverse();m[1]===K&&(f=_),o.push(_)}}for(let m=0;m<O;++m){let E=this.getEndsOfEdge(b[m]);if(E){let[y]=E,N=b[m].weight,_=l.get(y);_&&_!==1/0&&_+N<_&&(c=!0)}}return{hasNegativeCycle:c,distMap:l,preMap:a,paths:o,min:u,minPath:f}}floydWarshall(){var s;let e=[...this._vertexMap],t=e.length,r=[],i=[];for(let o=0;o<t;o++){r[o]=[],i[o]=[];for(let l=0;l<t;l++)i[o][l]=void 0}for(let o=0;o<t;o++)for(let l=0;l<t;l++)r[o][l]=((s=this.getEdge(e[o][1],e[l][1]))==null?void 0:s.weight)||1/0;for(let o=0;o<t;o++)for(let l=0;l<t;l++)for(let a=0;a<t;a++)r[l][a]>r[l][o]+r[o][a]&&(r[l][a]=r[l][o]+r[o][a],i[l][a]=e[o][1]);return{costs:r,predecessor:i}}getCycles(e=!1){let t=[],r=new Set,i=(o,l,a)=>{if(a.has(o)){(!e&&l.length>2||e&&l.length>=2)&&l[0]===o.key&&t.push([...l]);return}a.add(o),l.push(o.key);for(let u of this.getNeighbors(o))u&&i(u,l,a);a.delete(o),l.pop()};for(let o of this.vertexMap.values())i(o,[],r);let s=new Map;for(let o of t){let l=[...o].sort().toString();s.has(l)||s.set(l,o)}return[...s].map(o=>o[1])}filter(e,t){let r=[],i=0;for(let[s,o]of this)e.call(t,o,s,i,this)&&r.push([s,o]),i++;return r}map(e,t){let r=[],i=0;for(let[s,o]of this)r.push(e.call(t,o,s,i,this)),i++;return r}*_getIterator(){for(let e of this._vertexMap.values())yield[e.key,e.value]}_addVertex(e){return this.hasVertex(e)?!1:(this._vertexMap.set(e.key,e),!0)}_getVertex(e){let t=this._getVertexKey(e);return this._vertexMap.get(t)||void 0}_getVertexKey(e){return e instanceof T?e.key:e}};var q=class extends T{constructor(n,e){super(n,e)}},Q=class extends z{constructor(e,t,r,i){super(r,i);d(this,"src");d(this,"dest");this.src=e,this.dest=t}},$=class h extends j{constructor(){super();d(this,"_outEdgeMap",new Map);d(this,"_inEdgeMap",new Map)}get outEdgeMap(){return this._outEdgeMap}set outEdgeMap(e){this._outEdgeMap=e}get inEdgeMap(){return this._inEdgeMap}set inEdgeMap(e){this._inEdgeMap=e}createVertex(e,t){return new q(e,t)}createEdge(e,t,r,i){return new Q(e,t,r!=null?r:1,i)}getEdge(e,t){let r=[];if(e!==void 0&&t!==void 0){let i=this._getVertex(e),s=this._getVertex(t);if(i&&s){let o=this._outEdgeMap.get(i);o&&(r=o.filter(l=>l.dest===s.key))}}return r[0]||void 0}deleteEdgeSrcToDest(e,t){let r=this._getVertex(e),i=this._getVertex(t),s;if(!r||!i)return;let o=this._outEdgeMap.get(r);o&&S(o,a=>a.dest===i.key);let l=this._inEdgeMap.get(i);return l&&(s=S(l,a=>a.src===r.key)[0]||void 0),s}deleteEdge(e,t){let r,i,s;if(this.isVertexKey(e))if(this.isVertexKey(t))i=this._getVertex(e),s=this._getVertex(t);else return;else i=this._getVertex(e.src),s=this._getVertex(e.dest);if(i&&s){let o=this._outEdgeMap.get(i);o&&o.length>0&&S(o,a=>a.src===i.key&&a.dest===(s==null?void 0:s.key));let l=this._inEdgeMap.get(s);l&&l.length>0&&(r=S(l,a=>a.src===i.key&&a.dest===s.key)[0])}return r}deleteVertex(e){let t,r;if(this.isVertexKey(e)?(r=this.getVertex(e),t=e):(r=e,t=this._getVertexKey(e)),r){let i=this.getNeighbors(r);for(let s of i)this._inEdgeMap.delete(s);this._outEdgeMap.delete(r),this._inEdgeMap.delete(r)}return this._vertexMap.delete(t)}deleteEdgesBetween(e,t){let r=[];if(e&&t){let i=this.deleteEdgeSrcToDest(e,t),s=this.deleteEdgeSrcToDest(t,e);i&&r.push(i),s&&r.push(s)}return r}incomingEdgesOf(e){let t=this._getVertex(e);return t?this.inEdgeMap.get(t)||[]:[]}outgoingEdgesOf(e){let 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(e===void 0)return[];let t=[],r=this.outgoingEdgesOf(e);for(let i of r){let s=this.getEdgeDest(i);s&&t.push(s)}return t}topologicalSort(e){e=e!=null?e:"key";let t=new Map;for(let o of this.vertexMap)t.set(o[1],0);let r=[],i=!1,s=o=>{t.set(o,1);let l=this.getDestinations(o);for(let a of l){let u=t.get(a);u===0?s(a):u===1&&(i=!0)}t.set(o,2),r.push(o)};for(let o of this.vertexMap)t.get(o[1])===0&&s(o[1]);if(!i)return e==="key"&&(r=r.map(o=>o instanceof q?o.key:o)),r.reverse()}edgeSet(){let e=[];return this._outEdgeMap.forEach(t=>{e=[...e,...t]}),e}getNeighbors(e){let t=[],r=this._getVertex(e);if(r){let i=this.outgoingEdgesOf(r);for(let s of i){let o=this._getVertex(s.dest);o&&t.push(o)}}return t}getEndsOfEdge(e){if(!this.hasEdge(e.src,e.dest))return;let t=this._getVertex(e.src),r=this._getVertex(e.dest);if(t&&r)return[t,r]}isEmpty(){return this.vertexMap.size===0&&this.inEdgeMap.size===0&&this.outEdgeMap.size===0}clear(){this._vertexMap=new Map,this._inEdgeMap=new Map,this._outEdgeMap=new Map}clone(){let e=new h;return e.vertexMap=new Map(this.vertexMap),e.inEdgeMap=new Map(this.inEdgeMap),e.outEdgeMap=new Map(this.outEdgeMap),e}tarjan(){let e=new Map,t=new Map,r=new Map,i=0,s=[],o=new Set,l=a=>{e.set(a,i),t.set(a,i),i++,s.push(a),o.add(a);let u=this.getNeighbors(a);for(let f of u)e.has(f)?o.has(f)&&t.set(a,Math.min(t.get(a),e.get(f))):(l(f),t.set(a,Math.min(t.get(a),t.get(f))));if(e.get(a)===t.get(a)){let f=[],c;do c=s.pop(),o.delete(c),f.push(c);while(c!==a);r.set(r.size,f)}};for(let a of this.vertexMap.values())e.has(a)||l(a);return{dfnMap:e,lowMap:t,SCCs:r}}getDFNMap(){return this.tarjan().dfnMap}getLowMap(){return this.tarjan().lowMap}getSCCs(){return this.tarjan().SCCs}_addEdge(e){if(!(this.hasVertex(e.src)&&this.hasVertex(e.dest)))return!1;let t=this._getVertex(e.src),r=this._getVertex(e.dest);if(t&&r){let i=this._outEdgeMap.get(t);i?i.push(e):this._outEdgeMap.set(t,[e]);let s=this._inEdgeMap.get(r);return s?s.push(e):this._inEdgeMap.set(r,[e]),!0}else return!1}};var le=class extends T{constructor(n,e){super(n,e)}},he=class extends z{constructor(e,t,r,i){super(r,i);d(this,"endpoints");this.endpoints=[e,t]}},Re=class h extends j{constructor(){super();d(this,"_edgeMap");this._edgeMap=new Map}get edgeMap(){return this._edgeMap}set edgeMap(e){this._edgeMap=e}createVertex(e,t){return new le(e,t!=null?t:e)}createEdge(e,t,r,i){return new he(e,t,r!=null?r:1,i)}getEdge(e,t){var i;let r=[];if(e!==void 0&&t!==void 0){let s=this._getVertex(e),o=this._getVertex(t);s&&o&&(r=(i=this._edgeMap.get(s))==null?void 0:i.filter(l=>l.endpoints.includes(o.key)))}return r&&r[0]||void 0}deleteEdgeBetween(e,t){let r=this._getVertex(e),i=this._getVertex(t);if(!r||!i)return;let s=this._edgeMap.get(r),o;s&&(o=S(s,a=>a.endpoints.includes(i.key))[0]||void 0);let l=this._edgeMap.get(i);return l&&S(l,a=>a.endpoints.includes(r.key)),o}deleteEdge(e,t){let r,i;if(this.isVertexKey(e))if(this.isVertexKey(t))r=this._getVertex(e),i=this._getVertex(t);else return;else r=this._getVertex(e.endpoints[0]),i=this._getVertex(e.endpoints[1]);if(r&&i)return this.deleteEdgeBetween(r,i)}deleteVertex(e){let t,r;this.isVertexKey(e)?(r=this.getVertex(e),t=e):(r=e,t=this._getVertexKey(e));let i=this.getNeighbors(e);return r&&(i.forEach(s=>{let o=this._edgeMap.get(s);if(o){let l=o.filter(a=>!a.endpoints.includes(t));this._edgeMap.set(s,l)}}),this._edgeMap.delete(r)),this._vertexMap.delete(t)}degreeOf(e){var r;let t=this._getVertex(e);return t&&((r=this._edgeMap.get(t))==null?void 0:r.length)||0}edgesOf(e){let t=this._getVertex(e);return t?this._edgeMap.get(t)||[]:[]}edgeSet(){let e=new Set;return this._edgeMap.forEach(t=>{t.forEach(r=>{e.add(r)})}),[...e]}getNeighbors(e){let t=[],r=this._getVertex(e);if(r){let i=this.edgesOf(r);for(let s of i){let o=this._getVertex(s.endpoints.filter(l=>l!==r.key)[0]);o&&t.push(o)}}return t}getEndsOfEdge(e){if(!this.hasEdge(e.endpoints[0],e.endpoints[1]))return;let t=this._getVertex(e.endpoints[0]),r=this._getVertex(e.endpoints[1]);if(t&&r)return[t,r]}isEmpty(){return this.vertexMap.size===0&&this.edgeMap.size===0}clear(){this._vertexMap=new Map,this._edgeMap=new Map}clone(){let e=new h;return e.vertexMap=new Map(this.vertexMap),e.edgeMap=new Map(this.edgeMap),e}tarjan(){let e=new Map,t=new Map,r=[],i=[],s=0,o=(l,a)=>{e.set(l,s),t.set(l,s),s++;let u=this.getNeighbors(l),f=0;for(let c of u)if(e.has(c))c!==a&&t.set(l,Math.min(t.get(l),e.get(c)));else{if(f++,o(c,l),t.set(l,Math.min(t.get(l),t.get(c))),t.get(c)>e.get(l)){let p=this.getEdge(l,c);p&&r.push(p)}a!==void 0&&t.get(c)>=e.get(l)&&i.push(l)}a===void 0&&f>1&&i.push(l)};for(let l of this.vertexMap.values())e.has(l)||o(l,void 0);return{dfnMap:e,lowMap:t,bridges:r,cutVertices:i}}getBridges(){return this.tarjan().bridges}getCutVertices(){return this.tarjan().cutVertices}getDFNMap(){return this.tarjan().dfnMap}getLowMap(){return this.tarjan().lowMap}_addEdge(e){for(let t of e.endpoints){let r=this._getVertex(t);if(r===void 0)return!1;if(r){let i=this._edgeMap.get(r);i?i.push(e):this._edgeMap.set(r,[e])}}return!0}};var ue=class extends q{constructor(e,t,r,i){super(e,t);d(this,"lat");d(this,"long");this.lat=r,this.long=i}},de=class extends Q{constructor(n,e,t,r){super(n,e,t,r)}},Ce=class h extends ${constructor(e,t){super();d(this,"_originCoord",[0,0]);d(this,"_bottomRight");this._originCoord=e,this._bottomRight=t}get originCoord(){return this._originCoord}get bottomRight(){return this._bottomRight}createVertex(e,t,r=this.originCoord[0],i=this.originCoord[1]){return new ue(e,t,r,i)}createEdge(e,t,r,i){return new de(e,t,r,i)}clone(){let e=new h(this.originCoord,this.bottomRight);return e.vertexMap=new Map(this.vertexMap),e.inEdgeMap=new Map(this.inEdgeMap),e.outEdgeMap=new Map(this.outEdgeMap),e}};var Be=(e=>(e[e.RED=1]="RED",e[e.BLACK=0]="BLACK",e))(Be||{});var Me=(e=>(e.STANDARD="STANDARD",e.INVERSE="INVERSE",e))(Me||{}),Ie=(t=>(t.lt="lt",t.eq="eq",t.gt="gt",t))(Ie||{}),ee=(e=>(e.ITERATIVE="ITERATIVE",e.RECURSIVE="RECURSIVE",e))(ee||{}),fe=(o=>(o.ROOT="ROOT",o.LEFT="LEFT",o.RIGHT="RIGHT",o.ROOT_LEFT="ROOT_LEFT",o.ROOT_RIGHT="ROOT_RIGHT",o.ISOLATED="ISOLATED",o.MAL_NODE="MAL_NODE",o))(fe||{});var w=class{constructor(n,e){d(this,"key");d(this,"value");d(this,"parent");d(this,"_left");d(this,"_right");this.key=n,this.value=e}get left(){return this._left}set left(n){n&&(n.parent=this),this._left=n}get right(){return this._right}set right(n){n&&(n.parent=this),this._right=n}get familyPosition(){let n=this;return this.parent?this.parent.left===n?this.left||this.right?"ROOT_LEFT":"LEFT":this.parent.right===n?this.left||this.right?"ROOT_RIGHT":"RIGHT":"MAL_NODE":this.left||this.right?"ROOT":"ISOLATED"}},te=class h extends M{constructor(e=[],t){super();d(this,"iterationType","ITERATIVE");d(this,"_extractor",e=>Number(e));d(this,"_root");d(this,"_size");d(this,"_defaultOneParamCallback",e=>e?e.key:void 0);if(t){let{iterationType:r,extractor:i}=t;r&&(this.iterationType=r),i&&(this._extractor=i)}this._size=0,e&&this.addMany(e)}get extractor(){return this._extractor}get root(){return this._root}get size(){return this._size}createNode(e,t){return new w(e,t)}createTree(e){return new h([],v({iterationType:this.iterationType},e))}keyValueOrEntryToNode(e,t){if(e===void 0)return;let r;if(e===null)r=null;else if(this.isEntry(e)){let[i,s]=e;if(i===void 0)return;i===null?r=null:r=this.createNode(i,s)}else if(this.isNode(e))r=e;else if(!this.isNode(e))r=this.createNode(e,t);else return;return r}ensureNode(e,t="ITERATIVE"){let r;return this.isRealNode(e)?r=e:this.isEntry(e)?e[0]===null?r=null:e[0]!==void 0&&(r=this.getNodeByKey(e[0],t)):e===null?r=null:e!==void 0&&(r=this.getNodeByKey(e,t)),r}isNode(e){return e instanceof w}isEntry(e){return Array.isArray(e)&&e.length===2}isRealNode(e){return e instanceof w&&String(e.key)!=="NaN"}isNIL(e){return e instanceof w&&String(e.key)==="NaN"}isNodeOrNull(e){return this.isRealNode(e)||e===null}add(e,t){let r=this.keyValueOrEntryToNode(e,t);if(r===void 0)return!1;if(!this.root)return this._root=r,this._size=1,!0;let i=new D([this.root]),s;for(;i.size>0;){let o=i.shift();if(o){if(r!==null&&o.key===r.key)return this._replaceNode(o,r),!0;s===void 0&&(o.left===void 0||o.right===void 0)&&(s=o),o.left!==null&&o.left&&i.push(o.left),o.right!==null&&o.right&&i.push(o.right)}}return s?(s.left===void 0?s.left=r:s.right===void 0&&(s.right=r),this._size++,!0):!1}addMany(e,t){let r=[],i;t&&(i=t[Symbol.iterator]());for(let s of e){let o;if(i){let l=i.next();l.done||(o=l.value)}r.push(this.add(s,o))}return r}refill(e,t){this.clear(),this.addMany(e,t)}delete(e,t=this._defaultOneParamCallback){let r=[];if(!this.root)return r;(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=a=>a);let i=this.getNode(e,t);if(!i)return r;let s=i==null?void 0:i.parent,o,l=i;if(!i.left&&!i.right&&!s)this._setRoot(void 0);else if(i.left){let a=this.getRightMost(i.left);if(a){let u=a.parent;l=this._swapProperties(i,a),u&&(u.right===a?u.right=a.left:u.left=a.left,o=u)}}else if(s){let{familyPosition:a}=i;a==="LEFT"||a==="ROOT_LEFT"?s.left=i.right:(a==="RIGHT"||a==="ROOT_RIGHT")&&(s.right=i.right),o=s}else this._setRoot(i.right),i.right=void 0;return this._size=this.size-1,r.push({deleted:l,needBalanced:o}),r}getNodes(e,t=this._defaultOneParamCallback,r=!1,i=this.root,s=this.iterationType){if((!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=l=>l),i=this.ensureNode(i),!i)return[];let o=[];if(s==="RECURSIVE"){let l=a=>{t(a)===e&&(o.push(a),r)||!a.left&&!a.right||(a.left&&l(a.left),a.right&&l(a.right))};l(i)}else{let l=new D([i]);for(;l.size>0;){let a=l.shift();if(a){if(t(a)===e&&(o.push(a),r))return o;a.left&&l.push(a.left),a.right&&l.push(a.right)}}}return o}getNode(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){var s;return(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=o=>o),(s=this.getNodes(e,t,!0,r,i)[0])!=null?s:null}getNodeByKey(e,t="ITERATIVE"){if(this.root)if(t==="RECURSIVE"){let r=i=>{if(i.key===e)return i;if(!(!i.left&&!i.right)){if(i.left)return r(i.left);if(i.right)return r(i.right)}};return r(this.root)}else{let r=new D([this.root]);for(;r.size>0;){let i=r.shift();if(i){if(i.key===e)return i;i.left&&r.push(i.left),i.right&&r.push(i.right)}}}}get(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){var s,o;return(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=l=>l),(o=(s=this.getNode(e,t,r,i))==null?void 0:s.value)!=null?o:void 0}has(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){return(!t||t===this._defaultOneParamCallback)&&e instanceof w&&(t=s=>s),this.getNodes(e,t,!0,r,i).length>0}clear(){this._setRoot(void 0),this._size=0}isEmpty(){return this.size===0}isPerfectlyBalanced(e=this.root){return this.getMinHeight(e)+1>=this.getHeight(e)}isBST(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return!0;if(t==="RECURSIVE"){let r=(o,l,a)=>{if(!o)return!0;let u=this.extractor(o.key);return u<=l||u>=a?!1:r(o.left,l,u)&&r(o.right,u,a)},i=r(e,Number.MIN_SAFE_INTEGER,Number.MAX_SAFE_INTEGER),s=r(e,Number.MAX_SAFE_INTEGER,Number.MIN_SAFE_INTEGER);return i||s}else{let r=(o=!1)=>{let l=[],a=o?Number.MAX_SAFE_INTEGER:Number.MIN_SAFE_INTEGER,u=e;for(;u||l.length>0;){for(;u;)l.push(u),u=u.left;u=l.pop();let f=this.extractor(u.key);if(!u||!o&&a>=f||o&&a<=f)return!1;a=f,u=u.right}return!0},i=r(!1),s=r(!0);return i||s}}getDepth(e,t=this.root){e=this.ensureNode(e),t=this.ensureNode(t);let r=0;for(;e!=null&&e.parent;){if(e===t)return r;r++,e=e.parent}return r}getHeight(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return-1;if(t==="RECURSIVE"){let r=i=>{if(!i)return-1;let s=r(i.left),o=r(i.right);return Math.max(s,o)+1};return r(e)}else{let r=[{node:e,depth:0}],i=0;for(;r.length>0;){let{node:s,depth:o}=r.pop();s.left&&r.push({node:s.left,depth:o+1}),s.right&&r.push({node:s.right,depth:o+1}),i=Math.max(i,o)}return i}}getMinHeight(e=this.root,t=this.iterationType){var r,i,s;if(e=this.ensureNode(e),!e)return-1;if(t==="RECURSIVE"){let o=l=>{if(!l||!l.left&&!l.right)return 0;let a=o(l.left),u=o(l.right);return Math.min(a,u)+1};return o(e)}else{let o=[],l=e,a=null,u=new Map;for(;o.length>0||l;)if(l)o.push(l),l=l.left;else if(l=o[o.length-1],!l.right||a===l.right){if(l=o.pop(),l){let f=l.left&&(r=u.get(l.left))!=null?r:-1,c=l.right&&(i=u.get(l.right))!=null?i:-1;u.set(l,1+Math.min(f,c)),a=l,l=null}}else l=l.right;return(s=u.get(e))!=null?s:-1}}getPathToRoot(e,t=!0){let r=[];if(e=this.ensureNode(e),!e)return r;for(;e.parent;)r.push(e),e=e.parent;return r.push(e),t?r.reverse():r}getLeftMost(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return e;if(t==="RECURSIVE"){let r=i=>this.isRealNode(i.left)?r(i.left):i;return r(e)}else{let r=se(i=>this.isRealNode(i.left)?r.cont(i.left):i);return r(e)}}getRightMost(e=this.root,t=this.iterationType){if(e=this.ensureNode(e),!e)return e;if(t==="RECURSIVE"){let r=i=>this.isRealNode(i.right)?r(i.right):i;return r(e)}else{let r=se(i=>this.isRealNode(i.right)?r.cont(i.right):i);return r(e)}}getPredecessor(e){if(this.isRealNode(e.left)){let t=e.left;for(;!this.isRealNode(t)||this.isRealNode(t.right)&&t.right!==e;)this.isRealNode(t)&&(t=t.right);return t}else return e}getSuccessor(e){if(e=this.ensureNode(e),!this.isRealNode(e))return;if(this.isRealNode(e.right))return this.getLeftMost(e.right);let t=e.parent;for(;this.isRealNode(t)&&e===t.right;)e=t,t=t.parent;return t}dfs(e=this._defaultOneParamCallback,t="in",r=this.root,i="ITERATIVE",s=!1){if(r=this.ensureNode(r),!r)return[];let o=[];if(i==="RECURSIVE"){let l=a=>{switch(t){case"in":s?(a&&this.isNodeOrNull(a.left)&&l(a.left),this.isNodeOrNull(a)&&o.push(e(a)),a&&this.isNodeOrNull(a.right)&&l(a.right)):(a&&a.left&&l(a.left),this.isRealNode(a)&&o.push(e(a)),a&&a.right&&l(a.right));break;case"pre":s?(this.isNodeOrNull(a)&&o.push(e(a)),a&&this.isNodeOrNull(a.left)&&l(a.left),a&&this.isNodeOrNull(a.right)&&l(a.right)):(this.isRealNode(a)&&o.push(e(a)),a&&a.left&&l(a.left),a&&a.right&&l(a.right));break;case"post":s?(a&&this.isNodeOrNull(a.left)&&l(a.left),a&&this.isNodeOrNull(a.right)&&l(a.right),this.isNodeOrNull(a)&&o.push(e(a))):(a&&a.left&&l(a.left),a&&a.right&&l(a.right),this.isRealNode(a)&&o.push(e(a)));break}};l(r)}else{let l=[{opt:0,node:r}];for(;l.length>0;){let a=l.pop();if(!(a===void 0||this.isNIL(a.node))){if(s){if(a.node===void 0)continue}else if(a.node===null||a.node===void 0)continue;if(a.opt===1)o.push(e(a.node));else switch(t){case"in":a.node&&l.push({opt:0,node:a.node.right}),l.push({opt:1,node:a.node}),a.node&&l.push({opt:0,node:a.node.left});break;case"pre":a.node&&l.push({opt:0,node:a.node.right}),a.node&&l.push({opt:0,node:a.node.left}),l.push({opt:1,node:a.node});break;case"post":l.push({opt:1,node:a.node}),a.node&&l.push({opt:0,node:a.node.right}),a.node&&l.push({opt:0,node:a.node.left});break;default:a.node&&l.push({opt:0,node:a.node.right}),l.push({opt:1,node:a.node}),a.node&&l.push({opt:0,node:a.node.left});break}}}}return o}bfs(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType,i=!1){if(t=this.ensureNode(t),!t)return[];let s=[];if(r==="RECURSIVE"){let o=new D([t]),l=a=>{if(o.size===0)return;let u=o.shift();s.push(e(u)),i?(u&&this.isNodeOrNull(u.left)&&o.push(u.left),u&&this.isNodeOrNull(u.right)&&o.push(u.right)):(this.isRealNode(u.left)&&o.push(u.left),this.isRealNode(u.right)&&o.push(u.right)),l(a+1)};l(0)}else{let o=new D([t]);for(;o.size>0;){let l=o.size;for(let a=0;a<l;a++){let u=o.shift();s.push(e(u)),i?(u&&this.isNodeOrNull(u.left)&&o.push(u.left),u&&this.isNodeOrNull(u.right)&&o.push(u.right)):(this.isRealNode(u.left)&&o.push(u.left),this.isRealNode(u.right)&&o.push(u.right))}}}return s}listLevels(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType,i=!1){t=this.ensureNode(t);let s=[];if(!t)return s;if(r==="RECURSIVE"){let o=(l,a)=>{s[a]||(s[a]=[]),s[a].push(e(l)),i?(l&&this.isNodeOrNull(l.left)&&o(l.left,a+1),l&&this.isNodeOrNull(l.right)&&o(l.right,a+1)):(l&&l.left&&o(l.left,a+1),l&&l.right&&o(l.right,a+1))};o(t,0)}else{let o=[[t,0]];for(;o.length>0;){let l=o.pop(),[a,u]=l;s[u]||(s[u]=[]),s[u].push(e(a)),i?(a&&this.isNodeOrNull(a.right)&&o.push([a.right,u+1]),a&&this.isNodeOrNull(a.left)&&o.push([a.left,u+1])):(a&&a.right&&o.push([a.right,u+1]),a&&a.left&&o.push([a.left,u+1]))}}return s}morris(e=this._defaultOneParamCallback,t="in",r=this.root){if(r=this.ensureNode(r),r===null)return[];let i=[],s=r,o=a=>{let u=null,f=null;for(;a;)f=a.right,a.right=u,u=a,a=f;return u},l=a=>{let u=o(a),f=u;for(;f;)i.push(e(f)),f=f.right;o(u)};switch(t){case"in":for(;s;){if(s.left){let a=this.getPredecessor(s);if(a.right)a.right=null;else{a.right=s,s=s.left;continue}}i.push(e(s)),s=s.right}break;case"pre":for(;s;){if(s.left){let a=this.getPredecessor(s);if(a.right)a.right=null;else{a.right=s,i.push(e(s)),s=s.left;continue}}else i.push(e(s));s=s.right}break;case"post":for(;s;){if(s.left){let a=this.getPredecessor(s);if(a.right===null){a.right=s,s=s.left;continue}else a.right=null,l(s.left)}s=s.right}l(r);break}return i}clone(){let e=this.createTree();return this.bfs(t=>{t===null?e.add(null):e.add([t.key,t.value])},this.root,this.iterationType,!0),e}filter(e,t){let r=this.createTree(),i=0;for(let[s,o]of this)e.call(t,o,s,i++,this)&&r.add([s,o]);return r}map(e,t){let r=this.createTree(),i=0;for(let[s,o]of this)r.add([s,e.call(t,o,s,i++,this)]);return r}print(e=this.root,t){let r=v({isShowUndefined:!1,isShowNull:!1,isShowRedBlackNIL:!1},t);if(e=this.ensureNode(e),!e)return;r.isShowUndefined&&console.log(`U for undefined
+      `),r.isShowNull&&console.log(`NODE for null
       `),r.isShowRedBlackNIL&&console.log(`S for Sentinel Node
-      `),(s=>{let[o,,,]=this._displayAux(s,r);for(let l of o)console.log(l)})(e)}*_getIterator(e=this.root){if(e)if(this.iterationType==="ITERATIVE"){let t=[],r=e;for(;r||t.length>0;){for(;r&&!isNaN(this.extractor(r.key));)t.push(r),r=r.left;r=t.pop(),r&&!isNaN(this.extractor(r.key))&&(yield[r.key,r.value],r=r.right)}}else e.left&&!isNaN(this.extractor(e.key))&&(yield*L(this[Symbol.iterator](e.left))),yield[e.key,e.value],e.right&&!isNaN(this.extractor(e.key))&&(yield*L(this[Symbol.iterator](e.right)))}_displayAux(e,t){let{isShowNull:r,isShowUndefined:i,isShowRedBlackNIL:s}=t,o=[["\u2500"],1,0,0];if(e===null&&!r)return o;if(e===void 0&&!i)return o;if(e!=null&&isNaN(this.extractor(e.key))&&!s)return o;if(e!=null){let a=e.key,u=isNaN(this.extractor(a))?"S":this.extractor(a).toString(),f=u.length;return l(u,f,this._displayAux(e.left,t),this._displayAux(e.right,t))}else{let a=e===void 0?"U":"N",u=a.length;return l(a,u,[[""],1,0,0],[[""],1,0,0])}function l(a,u,f,b){let[m,y,_,K]=f,[T,p,c,N]=b,g=" ".repeat(Math.max(0,K+1))+"_".repeat(Math.max(0,y-K-1))+a+"_".repeat(Math.max(0,N))+" ".repeat(Math.max(0,p-N)),V=(_>0?" ".repeat(K)+"/"+" ".repeat(y-K-1):" ".repeat(y))+" ".repeat(u)+(c>0?" ".repeat(N)+"\\"+" ".repeat(p-N-1):" ".repeat(p)),E=[g,V];for(let x=0;x<Math.max(_,c);x++){let C=x<_?m[x]:" ".repeat(y),j=x<c?T[x]:" ".repeat(p);E.push(C+" ".repeat(u)+j)}return[E,y+u+p,Math.max(_,c)+2,y+Math.floor(u/2)]}}_swapProperties(e,t){if(e=this.ensureNode(e),t=this.ensureNode(t),e&&t){let{key:r,value:i}=t,s=this.createNode(r,i);return s&&(t.key=e.key,t.value=e.value,e.key=s.key,e.value=s.value),t}}_replaceNode(e,t){return e.parent&&(e.parent.left===e?e.parent.left=t:e.parent.right===e&&(e.parent.right=t)),t.left=e.left,t.right=e.right,t.parent=e.parent,this.root===e&&(this._root=t),t}_setRoot(e){e&&(e.parent=void 0),this._root=e}};var A=class extends w{constructor(e,t){super(e,t);d(this,"parent");d(this,"_left");d(this,"_right");this.parent=void 0,this._left=void 0,this._right=void 0}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}},G=class h extends te{constructor(e=[],t){super([],t);d(this,"_root");d(this,"_variant","STANDARD");if(t){let{variant:r}=t;r&&(this._variant=r)}this._root=void 0,e&&this.addMany(e)}get root(){return this._root}get variant(){return this._variant}createNode(e,t){return new A(e,t)}createTree(e){return new h([],R({iterationType:this.iterationType,variant:this.variant},e))}exemplarToNode(e,t){let r;if(e!=null){if(this.isNode(e))r=e;else if(this.isEntry(e)){let[i,s]=e;if(i==null)return;r=this.createNode(i,s)}else if(!this.isNode(e))r=this.createNode(e,t);else return;return r}}ensureNode(e,t="ITERATIVE"){let r;return this.isRealNode(e)?r=e:this.isEntry(e)?e[0]&&(r=this.getNodeByKey(e[0],t)):e&&(r=this.getNodeByKey(e,t)),r}isNode(e){return e instanceof A}add(e,t){let r=this.exemplarToNode(e,t);if(r===void 0)return!1;if(this.root===void 0)return this._setRoot(r),this._size++,!0;let i=this.root;for(;i!==void 0;){if(this._compare(i.key,r.key)==="eq")return this._replaceNode(i,r),!0;if(this._compare(i.key,r.key)==="gt"){if(i.left===void 0)return i.left=r,r.parent=i,this._size++,!0;i=i.left}else{if(i.right===void 0)return i.right=r,r.parent=i,this._size++,!0;i=i.right}}return!1}addMany(e,t,r=!0,i=this.iterationType){let s=[],o;if(t&&(o=t[Symbol.iterator]()),!r){for(let m of e){let y=o==null?void 0:o.next().value,_=this.add(m,y);s.push(_)}return s}let l=[],a=m=>m==null?!1:!(this.isEntry(m)&&(m[0]===void 0||m[0]===null));for(let m of e)a(m)&&l.push(m);let u=[];u=l.sort((m,y)=>{let _,K;return this.isEntry(m)?_=this.extractor(m[0]):this.isRealNode(m)?_=this.extractor(m.key):_=this.extractor(m),this.isEntry(y)?K=this.extractor(y[0]):this.isRealNode(y)?K=this.extractor(y.key):K=this.extractor(y),_-K});let f=m=>{if(m.length===0)return;let y=Math.floor((m.length-1)/2),_=this.add(m[y]);s.push(_),f(m.slice(0,y)),f(m.slice(y+1))},b=()=>{let y=[[0,u.length-1]];for(;y.length>0;){let _=y.pop();if(_){let[K,T]=_;if(K<=T){let p=K+Math.floor((T-K)/2),c=this.add(u[p]);s.push(c),y.push([p+1,T]),y.push([K,p-1])}}}};return i==="RECURSIVE"?f(u):b(),s}getNodeByKey(e,t="ITERATIVE"){if(this.root)if(t==="RECURSIVE"){let r=i=>{if(i.key===e)return i;if(!(!i.left&&!i.right)){if(this._compare(i.key,e)==="gt"&&i.left)return r(i.left);if(this._compare(i.key,e)==="lt"&&i.right)return r(i.right)}};return r(this.root)}else{let r=new v([this.root]);for(;r.size>0;){let i=r.shift();if(i){if(this._compare(i.key,e)==="eq")return i;this._compare(i.key,e)==="gt"&&i.left&&r.push(i.left),this._compare(i.key,e)==="lt"&&i.right&&r.push(i.right)}}}}getNodes(e,t=this._defaultOneParamCallback,r=!1,i=this.root,s=this.iterationType){if(i=this.ensureNode(i),!i)return[];let o=[];if(s==="RECURSIVE"){let l=a=>{t(a)===e&&(o.push(a),r)||!a.left&&!a.right||(t===this._defaultOneParamCallback?(this._compare(a.key,e)==="gt"&&a.left&&l(a.left),this._compare(a.key,e)==="lt"&&a.right&&l(a.right)):(a.left&&l(a.left),a.right&&l(a.right)))};l(i)}else{let l=new v([i]);for(;l.size>0;){let a=l.shift();if(a){if(t(a)===e&&(o.push(a),r))return o;t===this._defaultOneParamCallback?(this._compare(a.key,e)==="gt"&&a.left&&l.push(a.left),this._compare(a.key,e)==="lt"&&a.right&&l.push(a.right)):(a.left&&l.push(a.left),a.right&&l.push(a.right))}}}return o}dfs(e=this._defaultOneParamCallback,t="in",r=this.root,i="ITERATIVE"){return super.dfs(e,t,r,i,!1)}bfs(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType){return super.bfs(e,t,r,!1)}listLevels(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType){return super.listLevels(e,t,r,!1)}lastKey(e=this.root){let t=this.ensureNode(e);if(t){if(this._variant==="STANDARD")for(;t.right!==void 0;)t=t.right;else for(;t.left!==void 0;)t=t.left;return t.key}}lesserOrGreaterTraverse(e=this._defaultOneParamCallback,t="lt",r=this.root,i=this.iterationType){r=this.ensureNode(r);let s=[];if(!r||!this.root)return s;let o=r.key;if(i==="RECURSIVE"){let l=a=>{this._compare(a.key,o)===t&&s.push(e(a)),!(!a.left&&!a.right)&&(a.left&&this._compare(a.left.key,o)===t&&l(a.left),a.right&&this._compare(a.right.key,o)===t&&l(a.right))};return l(this.root),s}else{let l=new v([this.root]);for(;l.size>0;){let a=l.shift();a&&(this._compare(a.key,o)===t&&s.push(e(a)),a.left&&this._compare(a.left.key,o)===t&&l.push(a.left),a.right&&this._compare(a.right.key,o)===t&&l.push(a.right))}return s}}perfectlyBalance(e=this.iterationType){let t=this.dfs(i=>i,"in"),r=t.length;if(this.clear(),t.length<1)return!1;if(e==="RECURSIVE"){let i=(s,o)=>{if(s>o)return;let l=s+Math.floor((o-s)/2),a=t[l];this.add([a.key,a.value]),i(s,l-1),i(l+1,o)};return i(0,r-1),!0}else{let i=[[0,r-1]];for(;i.length>0;){let s=i.pop();if(s){let[o,l]=s;if(o<=l){let a=o+Math.floor((l-o)/2),u=t[a];this.add([u.key,u.value]),i.push([a+1,l]),i.push([o,a-1])}}}return!0}}isAVLBalanced(e=this.iterationType){var r,i;if(!this.root)return!0;let t=!0;if(e==="RECURSIVE"){let s=o=>{if(!o)return 0;let l=s(o.left),a=s(o.right);return Math.abs(l-a)>1&&(t=!1),Math.max(l,a)+1};s(this.root)}else{let s=[],o=this.root,l,a=new Map;for(;s.length>0||o;)if(o)s.push(o),o=o.left;else if(o=s[s.length-1],!o.right||l===o.right){if(o=s.pop(),o){let u=o.left&&(r=a.get(o.left))!=null?r:-1,f=o.right&&(i=a.get(o.right))!=null?i:-1;if(Math.abs(u-f)>1)return!1;a.set(o,1+Math.max(u,f)),l=o,o=void 0}}else o=o.right}return t}_setRoot(e){e&&(e.parent=void 0),this._root=e}_compare(e,t){let r=this.extractor(e),i=this.extractor(t),s=this.variant==="STANDARD"?r-i:i-r;return s>0?"gt":s<0?"lt":"eq"}};var ze=class{constructor({frequency:n=0,max:e}){d(this,"_freq");d(this,"_max");d(this,"_freqMap");d(this,"_msb");d(this,"_negativeCount");this._freq=n,this._max=e,this._freqMap={0:0},this._msb=Ve(e),this._negativeCount=n<0?e:0}get freqMap(){return this._freqMap}get msb(){return this._msb}get negativeCount(){return this._negativeCount}get freq(){return this._freq}get max(){return this._max}readSingle(n){return this._checkIndex(n),this._readSingle(n)}update(n,e){this._checkIndex(n);let t=this._readSingle(n);this._update(n,e),this._updateNegativeCount(t,t+e)}writeSingle(n,e){this._checkIndex(n),this._writeSingle(n,e)}read(n){if(!Number.isInteger(n))throw new Error("Invalid count");return this._read(Math.max(Math.min(n,this.max),0))}lowerBound(n){if(this.negativeCount>0)throw new Error("Sequence is not non-descending");return this._binarySearch(n,(e,t)=>e<t)}upperBound(n){if(this.negativeCount>0)throw new Error("Must not be descending");return this._binarySearch(n,(e,t)=>e<=t)}getPrefixSum(n){this._checkIndex(n),n++;let e=0;for(;n>0;)e+=this._getFrequency(n),n-=n&-n;return e}_getFrequency(n){return n in this.freqMap?this.freqMap[n]:this.freq*(n&-n)}_updateFrequency(n,e){this.freqMap[n]=this._getFrequency(n)+e}_checkIndex(n){if(!Number.isInteger(n))throw new Error("Invalid index: Index must be an integer.");if(n<0||n>=this.max)throw new Error("Index out of range: Index must be within the range [0, this.max).")}_readSingle(n){n=n+1;let e=this._getFrequency(n),t=n-(n&-n);for(n--;n!==t;)e-=this._getFrequency(n),n-=n&-n;return e}_updateNegativeCount(n,e){n<0&&e>=0?this._negativeCount--:n>=0&&e<0&&this._negativeCount++}_update(n,e){for(n=n+1;n<=this.max;)this._updateFrequency(n,e),n+=n&-n}_writeSingle(n,e){let t=this._readSingle(n);this._update(n,e-t),this._updateNegativeCount(t,e)}_read(n){let e=n,t=0;for(;e;)t+=this._getFrequency(e),e-=e&-e;return t}_binarySearch(n,e){let t=0,r=this.msb<<1,i=n;for(;r>t+1;){let s=t+r>>1,o=this._getFrequency(s);s<=this.max&&e(o,i)?(i-=o,t=s):r=s}return t}};var Y=class{constructor(n,e,t,r){d(this,"start",0);d(this,"end",0);d(this,"value");d(this,"sum",0);d(this,"left");d(this,"right");this.start=n,this.end=e,this.sum=t,this.value=r||void 0}},Fe=class{constructor(n,e,t){d(this,"_values",[]);d(this,"_start",0);d(this,"_end");d(this,"_root");e=e||0,t=t||n.length-1,this._values=n,this._start=e,this._end=t,n.length>0?this._root=this.build(e,t):(this._root=void 0,this._values=[])}get values(){return this._values}get start(){return this._start}get end(){return this._end}get root(){return this._root}build(n,e){if(n>e)return new Y(n,e,0);if(n===e)return new Y(n,e,this._values[n]);let t=n+Math.floor((e-n)/2),r=this.build(n,t),i=this.build(t+1,e),s=new Y(n,e,r.sum+i.sum);return s.left=r,s.right=i,s}updateNode(n,e,t){let r=this.root||void 0;if(!r)return;let i=(s,o,l,a)=>{if(s.start===s.end&&s.start===o){s.sum=l,a!==void 0&&(s.value=a);return}let u=s.start+Math.floor((s.end-s.start)/2);o<=u?s.left&&i(s.left,o,l,a):s.right&&i(s.right,o,l,a),s.left&&s.right&&(s.sum=s.left.sum+s.right.sum)};i(r,n,e,t)}querySumByRange(n,e){let t=this.root||void 0;if(!t)return 0;if(n<0||e>=this.values.length||n>e)return NaN;let r=(i,s,o)=>{if(s<=i.start&&o>=i.end)return i.sum;let l=i.start+Math.floor((i.end-i.start)/2);if(o<=l)return i.left?r(i.left,s,o):NaN;if(s>l)return i.right?r(i.right,s,o):NaN;{let a=0,u=0;return i.left&&(a=r(i.left,s,l)),i.right&&(u=r(i.right,l+1,o)),a+u}};return r(t,n,e)}};var H=class extends A{constructor(e,t){super(e,t);d(this,"height");this.height=0}},re=class h extends G{constructor(n=[],e){super([],e),n&&super.addMany(n)}createNode(n,e){return new H(n,e)}createTree(n){return new h([],R({iterationType:this.iterationType,variant:this.variant},n))}isNode(n){return n instanceof H}add(n,e){if(n===null)return!1;let t=super.add(n,e);return t&&this._balancePath(n),t}delete(n,e=this._defaultOneParamCallback){n instanceof H&&(e=r=>r);let t=super.delete(n,e);for(let{needBalanced:r}of t)r&&this._balancePath(r);return t}_swapProperties(n,e){if(n=this.ensureNode(n),e=this.ensureNode(e),n&&e){let{key:t,value:r,height:i}=e,s=this.createNode(t,r);return s&&(s.height=i,e.key=n.key,e.value=n.value,e.height=n.height,n.key=s.key,n.value=s.value,n.height=s.height),e}}_balanceFactor(n){return n.right?n.left?n.right.height-n.left.height:+n.height:-n.height}_updateHeight(n){if(!n.left&&!n.right)n.height=0;else if(n.left)n.right?n.height=1+Math.max(n.right.height,n.left.height):n.height=1+n.left.height;else{let e=n.right?n.right.height:0;n.height=1+e}}_balancePath(n){n=this.ensureNode(n);let e=this.getPathToRoot(n,!1);for(let t=0;t<e.length;t++){let r=e[t];switch(this._updateHeight(r),this._balanceFactor(r)){case-2:r&&r.left&&(this._balanceFactor(r.left)<=0?this._balanceLL(r):this._balanceLR(r));break;case 2:r&&r.right&&(this._balanceFactor(r.right)>=0?this._balanceRR(r):this._balanceRL(r))}}}_balanceLL(n){let e=n.parent,t=n.left;n.parent=t,t&&t.right&&(t.right.parent=n),t&&(t.parent=e),n===this.root?t&&this._setRoot(t):(e==null?void 0:e.left)===n?e.left=t:e&&(e.right=t),t&&(n.left=t.right,t.right=n),this._updateHeight(n),t&&this._updateHeight(t)}_balanceLR(n){let e=n.parent,t=n.left,r;t&&(r=t.right),n&&(n.parent=r),t&&(t.parent=r),r&&(r.left&&(r.left.parent=t),r.right&&(r.right.parent=n),r.parent=e),n===this.root?r&&this._setRoot(r):e&&(e.left===n?e.left=r:e.right=r),r&&(n.left=r.right,t&&(t.right=r.left),r.left=t,r.right=n),this._updateHeight(n),t&&this._updateHeight(t),r&&this._updateHeight(r)}_balanceRR(n){let e=n.parent,t=n.right;n.parent=t,t&&(t.left&&(t.left.parent=n),t.parent=e),n===this.root?t&&this._setRoot(t):e&&(e.left===n?e.left=t:e.right=t),t&&(n.right=t.left,t.left=n),this._updateHeight(n),t&&this._updateHeight(t)}_balanceRL(n){let e=n.parent,t=n.right,r;t&&(r=t.left),n.parent=r,t&&(t.parent=r),r&&(r.left&&(r.left.parent=n),r.right&&(r.right.parent=t),r.parent=e),n===this.root?r&&this._setRoot(r):e&&(e.left===n?e.left=r:e.right=r),r&&(n.right=r.left),t&&r&&(t.left=r.right),r&&(r.left=n),r&&(r.right=t),this._updateHeight(n),t&&this._updateHeight(t),r&&this._updateHeight(r)}_replaceNode(n,e){return e.height=n.height,super._replaceNode(n,e)}};var P=class extends A{constructor(e,t,r=0){super(e,t);d(this,"color");this.color=r}},Ae=class h extends G{constructor(e=[],t){super([],t);d(this,"Sentinel",new P(NaN));d(this,"_root");d(this,"_size",0);this._root=this.Sentinel,e&&super.addMany(e)}get root(){return this._root}get size(){return this._size}createNode(e,t,r=0){return new P(e,t,r)}createTree(e){return new h([],R({iterationType:this.iterationType},e))}exemplarToNode(e,t){let r;if(e!=null){if(this.isNode(e))r=e;else if(this.isEntry(e)){let[i,s]=e;if(i==null)return;r=this.createNode(i,s,1)}else if(!this.isNode(e))r=this.createNode(e,t,1);else return;return r}}isNode(e){return e instanceof P}isRealNode(e){return e===this.Sentinel||e===void 0?!1:e instanceof P}add(e,t){let r=this.exemplarToNode(e,t);if(r===void 0)return!1;r.left=this.Sentinel,r.right=this.Sentinel;let i,s=this.root;for(;s!==this.Sentinel;)if(i=s,s)if(r.key<s.key)s=s.left;else if(r.key>s.key)s=s==null?void 0:s.right;else return r!==s&&this._replaceNode(s,r),!1;return r.parent=i,i===void 0?this._setRoot(r):r.key<i.key?i.left=r:i.right=r,r.parent===void 0?(r.color=0,this._size++,!1):r.parent.parent===void 0?(this._size++,!1):(this._fixInsert(r),this._size++,!0)}delete(e,t=this._defaultOneParamCallback){let r=[];return e===null||(s=>{let o=this.Sentinel,l,a;for(;s!==this.Sentinel;)s&&t(s)===e&&(o=s),s&&e&&t(s)<=e?s=s.right:s=s==null?void 0:s.left;if(o===this.Sentinel){this._size--;return}a=o;let u=a.color;o.left===this.Sentinel?(l=o.right,this._rbTransplant(o,o.right)):o.right===this.Sentinel?(l=o.left,this._rbTransplant(o,o.left)):(a=this.getLeftMost(o.right),u=a.color,l=a.right,a.parent===o?l.parent=a:(this._rbTransplant(a,a.right),a.right=o.right,a.right.parent=a),this._rbTransplant(o,a),a.left=o.left,a.left.parent=a,a.color=o.color),u===0&&this._fixDelete(l),this._size--,r.push({deleted:o,needBalanced:void 0})})(this.root),r}getNode(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){var s;return e instanceof P&&(t=o=>o),r=this.ensureNode(r),(s=this.getNodes(e,t,!0,r,i)[0])!=null?s:void 0}getPredecessor(e){if(this.isRealNode(e.left))return this.getRightMost(e.left);let t=e.parent;for(;this.isRealNode(t)&&e===t.left;)e=t,t=t.parent;return t}clear(){this._root=this.Sentinel,this._size=0}_setRoot(e){e&&(e.parent=void 0),this._root=e}_leftRotate(e){if(e.right){let t=e.right;e.right=t.left,t.left!==this.Sentinel&&t.left&&(t.left.parent=e),t.parent=e.parent,e.parent===void 0?this._setRoot(t):e===e.parent.left?e.parent.left=t:e.parent.right=t,t.left=e,e.parent=t}}_rightRotate(e){if(e.left){let t=e.left;e.left=t.right,t.right!==this.Sentinel&&t.right&&(t.right.parent=e),t.parent=e.parent,e.parent===void 0?this._setRoot(t):e===e.parent.right?e.parent.right=t:e.parent.left=t,t.right=e,e.parent=t}}_fixDelete(e){let t;for(;e!==this.root&&e.color===0;)e.parent&&e===e.parent.left?(t=e.parent.right,t.color===1&&(t.color=0,e.parent.color=1,this._leftRotate(e.parent),t=e.parent.right),t.left!==void 0&&t.left.color===0&&t.right&&t.right.color===0?(t.color=1,e=e.parent):(t.right&&t.right.color===0&&(t.left&&(t.left.color=0),t.color=1,this._rightRotate(t),t=e.parent.right),t&&(t.color=e.parent.color),e.parent.color=0,t&&t.right&&(t.right.color=0),this._leftRotate(e.parent),e=this.root)):(t=e.parent.left,t.color===1&&(t.color=0,e.parent.color=1,this._rightRotate(e.parent),t=e.parent.left),t&&t.right&&t.right.color===0&&t.right.color===0?(t.color=1,e=e.parent):(t&&t.left&&t.left.color===0&&(t.right&&(t.right.color=0),t.color=1,this._leftRotate(t),t=e.parent.left),t&&(t.color=e.parent.color),e.parent.color=0,t&&t.left&&(t.left.color=0),this._rightRotate(e.parent),e=this.root));e.color=0}_rbTransplant(e,t){e.parent===void 0?this._setRoot(t):e===e.parent.left?e.parent.left=t:e.parent.right=t,t.parent=e.parent}_fixInsert(e){let t;for(;e.parent&&e.parent.color===1&&(e.parent.parent&&e.parent===e.parent.parent.right?(t=e.parent.parent.left,t&&t.color===1?(t.color=0,e.parent.color=0,e.parent.parent.color=1,e=e.parent.parent):(e===e.parent.left&&(e=e.parent,this._rightRotate(e)),e.parent.color=0,e.parent.parent.color=1,this._leftRotate(e.parent.parent))):(t=e.parent.parent.right,t&&t.color===1?(t.color=0,e.parent.color=0,e.parent.parent.color=1,e=e.parent.parent):(e===e.parent.right&&(e=e.parent,this._leftRotate(e)),e.parent.color=0,e.parent.parent.color=1,this._rightRotate(e.parent.parent))),e!==this.root););this.root.color=0}_replaceNode(e,t){return t.color=e.color,super._replaceNode(e,t)}};var ie=class extends H{constructor(e,t,r=1){super(e,t);d(this,"count");this.count=r}},De=class h extends re{constructor(e=[],t){super([],t);d(this,"_count",0);e&&this.addMany(e)}get count(){let e=0;return this.dfs(t=>e+=t.count),e}createNode(e,t,r){return new ie(e,t,r)}createTree(e){return new h([],R({iterationType:this.iterationType,variant:this.variant},e))}exemplarToNode(e,t,r=1){let i;if(e!=null){if(this.isNode(e))i=e;else if(this.isEntry(e)){let[s,o]=e;if(s==null)return;i=this.createNode(s,o,r)}else if(!this.isNode(e))i=this.createNode(e,t,r);else return;return i}}isNode(e){return e instanceof ie}add(e,t,r=1){let i=this.exemplarToNode(e,t,r);if(i===void 0)return!1;let s=(i==null?void 0:i.count)||0;return super.add(i)&&(this._count+=s),!0}addMany(e){return super.addMany(e)}perfectlyBalance(e=this.iterationType){let t=this.dfs(i=>i,"in"),r=t.length;if(t.length<1)return!1;if(this.clear(),e==="RECURSIVE"){let i=(s,o)=>{if(s>o)return;let l=s+Math.floor((o-s)/2),a=t[l];this.add(a.key,a.value,a.count),i(s,l-1),i(l+1,o)};return i(0,r-1),!0}else{let i=[[0,r-1]];for(;i.length>0;){let s=i.pop();if(s){let[o,l]=s;if(o<=l){let a=o+Math.floor((l-o)/2),u=t[a];this.add(u.key,u.value,u.count),i.push([a+1,l]),i.push([o,a-1])}}}return!0}}delete(e,t=this._defaultOneParamCallback,r=!1){var u;let i=[];if(!this.root)return i;let s=(u=this.getNode(e,t))!=null?u:void 0;if(!s)return i;let o=s!=null&&s.parent?s.parent:void 0,l,a=s;if(s.count>1&&!r)s.count--,this._count--;else{if(s.left){let f=s.left?this.getRightMost(s.left):void 0;if(f){let b=f.parent;a=this._swapProperties(s,f),b&&(b.right===f?b.right=f.left:b.left=f.left,l=b)}}else if(!o)s.right!==void 0&&this._setRoot(s.right);else{let{familyPosition:f}=s;f==="LEFT"||f==="ROOT_LEFT"?o.left=s.right:(f==="RIGHT"||f==="ROOT_RIGHT")&&(o.right=s.right),l=o}this._size=this.size-1,a&&(this._count-=a.count)}return i.push({deleted:a,needBalanced:l}),l&&this._balancePath(l),i}clear(){super.clear(),this._count=0}clone(){let e=this.createTree();return this.bfs(t=>e.add(t.key,t.value,t.count)),e}_swapProperties(e,t){if(e=this.ensureNode(e),t=this.ensureNode(t),e&&t){let{key:r,value:i,count:s,height:o}=t,l=this.createNode(r,i,s);return l&&(l.height=o,t.key=e.key,t.value=e.value,t.count=e.count,t.height=e.height,e.key=l.key,e.value=l.value,e.count=l.count,e.height=l.height),t}}_replaceNode(e,t){return t.count=e.count+t.count,super._replaceNode(e,t)}};var He=class h{constructor(n,e,t){d(this,"key");d(this,"value");d(this,"children");this.key=n,this.value=e||void 0,this.children=t||[]}addChildren(n){this.children||(this.children=[]),n instanceof h?this.children.push(n):this.children=this.children.concat(n)}getHeight(){let n=0;if(this){let e=(t,r)=>{r>n&&(n=r);let{children:i}=t;if(i)for(let s=0,o=i.length;s<o;s++)e(i[s],r+1)};e(this,0)}return n}};var W=class extends I{constructor(n=[],e){super(n,e)}};var Pe=class extends W{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return t-r;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var je=class extends W{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return r-t;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var qe=class h{constructor(n,e){d(this,"_rows",0);d(this,"_cols",0);d(this,"_data");var t,r,i;if(e){let{rows:s,cols:o,addFn:l,subtractFn:a,multiplyFn:u}=e;typeof s=="number"&&s>0?this._rows=s:this._rows=n.length,typeof o=="number"&&o>0?this._cols=o:this._cols=((t=n[0])==null?void 0:t.length)||0,l&&(this._addFn=l),a&&(this._subtractFn=a),u&&(this._multiplyFn=u)}else this._rows=n.length,this._cols=(i=(r=n[0])==null?void 0:r.length)!=null?i:0;if(n.length>0)this._data=n;else{this._data=[];for(let s=0;s<this.rows;s++)this._data[s]=new Array(this.cols).fill(0)}}get rows(){return this._rows}get cols(){return this._cols}get data(){return this._data}get addFn(){return this._addFn}get subtractFn(){return this._subtractFn}get multiplyFn(){return this._multiplyFn}get(n,e){if(this.isValidIndex(n,e))return this.data[n][e]}set(n,e,t){return this.isValidIndex(n,e)?(this.data[n][e]=t,!0):!1}isMatchForCalculate(n){return this.rows===n.rows&&this.cols===n.cols}add(n){if(!this.isMatchForCalculate(n))throw new Error("Matrix dimensions must match for addition.");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<this.cols;r++){let i=this.get(t,r),s=n.get(t,r);if(i!==void 0&&s!==void 0){let o=this._addFn(i,s);o&&(e[t][r]=o)}}}return new h(e,{rows:this.rows,cols:this.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}subtract(n){if(!this.isMatchForCalculate(n))throw new Error("Matrix dimensions must match for subtraction.");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<this.cols;r++){let i=this.get(t,r),s=n.get(t,r);if(i!==void 0&&s!==void 0){let o=this._subtractFn(i,s);o&&(e[t][r]=o)}}}return new h(e,{rows:this.rows,cols:this.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}multiply(n){if(this.cols!==n.rows)throw new Error("Matrix dimensions must be compatible for multiplication (A.cols = B.rows).");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<n.cols;r++){let i;for(let s=0;s<this.cols;s++){let o=this.get(t,s),l=n.get(s,r);if(o!==void 0&&l!==void 0){let a=this.multiplyFn(o,l);a!==void 0&&(i=this.addFn(i,a))}}i!==void 0&&(e[t][r]=i)}}return new h(e,{rows:this.rows,cols:n.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}transpose(){if(this.data.some(e=>e.length!==this.rows))throw new Error("Matrix must be rectangular for transposition.");let n=[];for(let e=0;e<this.cols;e++){n[e]=[];for(let t=0;t<this.rows;t++){let r=this.get(t,e);r!==void 0&&(n[e][t]=r)}}return new h(n,{rows:this.cols,cols:this.rows,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}inverse(){var r;if(this.rows!==this.cols)throw new Error("Matrix must be square for inversion.");let n=[];for(let i=0;i<this.rows;i++){n[i]=this.data[i].slice();for(let s=0;s<this.cols;s++)n[i][this.cols+s]=i===s?1:0}let e=new h(n,{rows:this.rows,cols:this.cols*2,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn});for(let i=0;i<this.rows;i++){let s=i;for(;s<this.rows&&e.get(s,i)===0;)s++;if(s===this.rows)throw new Error("Matrix is singular, and its inverse does not exist.");e._swapRows(i,s);let o=(r=e.get(i,i))!=null?r:1;if(o===0)throw new Error("Matrix is singular, and its inverse does not exist (division by zero).");e._scaleRow(i,1/o);for(let l=0;l<this.rows;l++)if(l!==i){let a=e.get(l,i);a===void 0&&(a=0),e._addScaledRow(l,i,-a)}}let t=[];for(let i=0;i<this.rows;i++)t[i]=e.data[i].slice(this.cols);return new h(t,{rows:this.rows,cols:this.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}dot(n){if(this.cols!==n.rows)throw new Error("Number of columns in the first matrix must be equal to the number of rows in the second matrix for dot product.");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<n.cols;r++){let i;for(let s=0;s<this.cols;s++){let o=this.get(t,s),l=n.get(s,r);if(o!==void 0&&l!==void 0){let a=this.multiplyFn(o,l);a!==void 0&&(i=this.addFn(i,a))}}i!==void 0&&(e[t][r]=i)}}return new h(e,{rows:this.rows,cols:n.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}_addFn(n,e){return n===void 0?e:n+e}_subtractFn(n,e){return n-e}_multiplyFn(n,e){return n*e}isValidIndex(n,e){return n>=0&&n<this.rows&&e>=0&&e<this.cols}_swapRows(n,e){let t=this.data[n];this.data[n]=this.data[e],this.data[e]=t}_scaleRow(n,e){for(let t=0;t<this.cols;t++){let r=this.multiplyFn(this.data[n][t],e);r===void 0&&(r=0),this.data[n][t]=r}}_addScaledRow(n,e,t){for(let r=0;r<this.cols;r++){let i=this.multiplyFn(this.data[e][r],t);i===void 0&&(i=0);let s=i,o=this.addFn(this.data[n][r],s);o===void 0&&(o=0),this.data[n][r]=o}}};var pe=class h{constructor(n,e){d(this,"direction");d(this,"turn");this.direction=n,this.turn=()=>new h(e[n],e)}},Ue=class{constructor({matrix:n,turning:e,onMove:t,init:{cur:r,charDir:i,VISITED:s}}){d(this,"onMove");d(this,"_matrix");d(this,"_cur");d(this,"_character");d(this,"_VISITED");this._matrix=n,this._cur=r,this._character=new pe(i,e),this.onMove=t,this.onMove&&this.onMove(this._cur),this._VISITED=s,this._matrix[this._cur[0]][this._cur[1]]=this._VISITED}start(){for(;this.check(this._character.direction)||this.check(this._character.turn().direction);){let{direction:n}=this._character;this.check(n)?this.move(n):this.check(this._character.turn().direction)&&(this._character=this._character.turn())}}check(n){let e,t,r=this._matrix,[i,s]=this._cur;switch(n){case"up":if(t=r[i-1],!t)return!1;e=t[s];break;case"right":e=r[i][s+1];break;case"down":if(t=r[i+1],!t)return!1;e=t[s];break;case"left":e=r[i][s-1];break}return e!==void 0&&e!==this._VISITED}move(n){switch(n){case"up":this._cur[0]--;break;case"right":this._cur[1]++;break;case"down":this._cur[0]++;break;case"left":this._cur[1]--;break}let[e,t]=this._cur;this._matrix[e][t]=this._VISITED,this.onMove&&this.onMove(this._cur)}};var ne=class{constructor(n){d(this,"key");d(this,"children");d(this,"isEnd");this.key=n,this.isEnd=!1,this.children=new Map}},Ge=class h extends k{constructor(e=[],t){super();d(this,"_size",0);d(this,"_caseSensitive",!0);d(this,"_root",new ne(""));if(t){let{caseSensitive:r}=t;r!==void 0&&(this._caseSensitive=r)}if(e)for(let r of e)this.add(r)}get size(){return this._size}get caseSensitive(){return this._caseSensitive}get root(){return this._root}add(e){e=this._caseProcess(e);let t=this.root,r=!1;for(let i of e){let s=t.children.get(i);s||(s=new ne(i),t.children.set(i,s)),t=s}return t.isEnd||(r=!0,t.isEnd=!0,this._size++),r}has(e){e=this._caseProcess(e);let t=this.root;for(let r of e){let i=t.children.get(r);if(!i)return!1;t=i}return t.isEnd}delete(e){e=this._caseProcess(e);let t=!1,r=(i,s)=>{let o=e[s],l=i.children.get(o);return l?s===e.length-1?l.isEnd?(l.children.size>0?l.isEnd=!1:i.children.delete(o),t=!0,!0):!1:r(l,s+1)&&!i.isEnd&&l.children.size===0?(i.children.delete(o),!0):!1:!1};return r(this.root,0),t&&this._size--,t}getHeight(){let e=this.root,t=0;if(e){let r=(i,s)=>{s>t&&(t=s);let{children:o}=i;if(o)for(let l of o.entries())r(l[1],s+1)};r(e,0)}return t}hasPurePrefix(e){e=this._caseProcess(e);let t=this.root;for(let r of e){let i=t.children.get(r);if(!i)return!1;t=i}return!t.isEnd}hasPrefix(e){e=this._caseProcess(e);let t=this.root;for(let r of e){let i=t.children.get(r);if(!i)return!1;t=i}return!0}hasCommonPrefix(e){e=this._caseProcess(e);let t="",r=i=>{if(t+=i.key,t!==e&&!i.isEnd)if(i&&i.children&&i.children.size===1)r(Array.from(i.children.values())[0]);else return};return r(this.root),t===e}getLongestCommonPrefix(){let e="",t=r=>{if(e+=r.key,!r.isEnd)if(r&&r.children&&r.children.size===1)t(Array.from(r.children.values())[0]);else return};return t(this.root),e}getWords(e="",t=Number.MAX_SAFE_INTEGER,r=!1){e=this._caseProcess(e);let i=[],s=0;function o(a,u){for(let f of a.children.keys()){let b=a.children.get(f);b!==void 0&&o(b,u.concat(f))}if(a.isEnd){if(s>t-1)return;i.push(u),s++}}let l=this.root;if(e)for(let a of e){let u=l.children.get(a);u&&(l=u)}return(r||l!==this.root)&&o(l,e),i}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.add(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.add(e.call(t,s,i,this)),i++;return r}*_getIterator(){function*e(t,r){t.isEnd&&(yield r);for(let[i,s]of t.children)yield*L(e(s,r+i))}yield*L(e(this.root,""))}_caseProcess(e){return this._caseSensitive||(e=e.toLowerCase()),e}};return it(lt);})();
+      `),(s=>{let[o,,,]=this._displayAux(s,r);for(let l of o)console.log(l)})(e)}*_getIterator(e=this.root){if(e)if(this.iterationType==="ITERATIVE"){let t=[],r=e;for(;r||t.length>0;){for(;r&&!isNaN(this.extractor(r.key));)t.push(r),r=r.left;r=t.pop(),r&&!isNaN(this.extractor(r.key))&&(yield[r.key,r.value],r=r.right)}}else e.left&&!isNaN(this.extractor(e.key))&&(yield*I(this[Symbol.iterator](e.left))),yield[e.key,e.value],e.right&&!isNaN(this.extractor(e.key))&&(yield*I(this[Symbol.iterator](e.right)))}_displayAux(e,t){let{isShowNull:r,isShowUndefined:i,isShowRedBlackNIL:s}=t,o=[["\u2500"],1,0,0];if(e===null&&!r)return o;if(e===void 0&&!i)return o;if(e!=null&&isNaN(this.extractor(e.key))&&!s)return o;if(e!=null){let a=e.key,u=isNaN(this.extractor(a))?"S":this.extractor(a).toString(),f=u.length;return l(u,f,this._displayAux(e.left,t),this._displayAux(e.right,t))}else{let a=e===void 0?"U":"NODE",u=a.length;return l(a,u,[[""],1,0,0],[[""],1,0,0])}function l(a,u,f,c){let[p,g,b,O]=f,[K,m,E,y]=c,N=" ".repeat(Math.max(0,O+1))+"_".repeat(Math.max(0,g-O-1))+a+"_".repeat(Math.max(0,y))+" ".repeat(Math.max(0,m-y)),_=(b>0?" ".repeat(O)+"/"+" ".repeat(g-O-1):" ".repeat(g))+" ".repeat(u)+(E>0?" ".repeat(y)+"\\"+" ".repeat(m-y-1):" ".repeat(m)),V=[N,_];for(let x=0;x<Math.max(b,E);x++){let P=x<b?p[x]:" ".repeat(g),Xe=x<E?K[x]:" ".repeat(m);V.push(P+" ".repeat(u)+Xe)}return[V,g+u+m,Math.max(b,E)+2,g+Math.floor(u/2)]}}_swapProperties(e,t){if(e=this.ensureNode(e),t=this.ensureNode(t),e&&t){let{key:r,value:i}=t,s=this.createNode(r,i);return s&&(t.key=e.key,t.value=e.value,e.key=s.key,e.value=s.value),t}}_replaceNode(e,t){return e.parent&&(e.parent.left===e?e.parent.left=t:e.parent.right===e&&(e.parent.right=t)),t.left=e.left,t.right=e.right,t.parent=e.parent,this.root===e&&(this._root=t),t}_setRoot(e){e&&(e.parent=void 0),this._root=e}};var F=class extends w{constructor(e,t){super(e,t);d(this,"parent");d(this,"_left");d(this,"_right");this.parent=void 0,this._left=void 0,this._right=void 0}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}},U=class h extends te{constructor(e=[],t){super([],t);d(this,"_root");d(this,"_variant","STANDARD");if(t){let{variant:r}=t;r&&(this._variant=r)}this._root=void 0,e&&this.addMany(e)}get root(){return this._root}get variant(){return this._variant}createNode(e,t){return new F(e,t)}createTree(e){return new h([],v({iterationType:this.iterationType,variant:this.variant},e))}keyValueOrEntryToNode(e,t){let r;if(e!=null){if(this.isNode(e))r=e;else if(this.isEntry(e)){let[i,s]=e;if(i==null)return;r=this.createNode(i,s)}else if(!this.isNode(e))r=this.createNode(e,t);else return;return r}}ensureNode(e,t="ITERATIVE"){let r;return this.isRealNode(e)?r=e:this.isEntry(e)?e[0]&&(r=this.getNodeByKey(e[0],t)):e&&(r=this.getNodeByKey(e,t)),r}isNode(e){return e instanceof F}add(e,t){let r=this.keyValueOrEntryToNode(e,t);if(r===void 0)return!1;if(this.root===void 0)return this._setRoot(r),this._size++,!0;let i=this.root;for(;i!==void 0;){if(this._compare(i.key,r.key)==="eq")return this._replaceNode(i,r),!0;if(this._compare(i.key,r.key)==="gt"){if(i.left===void 0)return i.left=r,this._size++,!0;i=i.left}else{if(i.right===void 0)return i.right=r,this._size++,!0;i=i.right}}return!1}addMany(e,t,r=!0,i=this.iterationType){let s=[],o;if(t&&(o=t[Symbol.iterator]()),!r){for(let p of e){let g=o==null?void 0:o.next().value,b=this.add(p,g);s.push(b)}return s}let l=[],a=p=>p==null?!1:!(this.isEntry(p)&&(p[0]===void 0||p[0]===null));for(let p of e)a(p)&&l.push(p);let u=[];u=l.sort((p,g)=>{let b,O;return this.isEntry(p)?b=this.extractor(p[0]):this.isRealNode(p)?b=this.extractor(p.key):b=this.extractor(p),this.isEntry(g)?O=this.extractor(g[0]):this.isRealNode(g)?O=this.extractor(g.key):O=this.extractor(g),b-O});let f=p=>{if(p.length===0)return;let g=Math.floor((p.length-1)/2),b=this.add(p[g]);s.push(b),f(p.slice(0,g)),f(p.slice(g+1))},c=()=>{let g=[[0,u.length-1]];for(;g.length>0;){let b=g.pop();if(b){let[O,K]=b;if(O<=K){let m=O+Math.floor((K-O)/2),E=this.add(u[m]);s.push(E),g.push([m+1,K]),g.push([O,m-1])}}}};return i==="RECURSIVE"?f(u):c(),s}getNodeByKey(e,t="ITERATIVE"){if(this.root)if(t==="RECURSIVE"){let r=i=>{if(i.key===e)return i;if(!(!i.left&&!i.right)){if(this._compare(i.key,e)==="gt"&&i.left)return r(i.left);if(this._compare(i.key,e)==="lt"&&i.right)return r(i.right)}};return r(this.root)}else{let r=new D([this.root]);for(;r.size>0;){let i=r.shift();if(i){if(this._compare(i.key,e)==="eq")return i;this._compare(i.key,e)==="gt"&&i.left&&r.push(i.left),this._compare(i.key,e)==="lt"&&i.right&&r.push(i.right)}}}}getNodes(e,t=this._defaultOneParamCallback,r=!1,i=this.root,s=this.iterationType){if(i=this.ensureNode(i),!i)return[];let o=[];if(s==="RECURSIVE"){let l=a=>{t(a)===e&&(o.push(a),r)||!a.left&&!a.right||(t===this._defaultOneParamCallback?(this._compare(a.key,e)==="gt"&&a.left&&l(a.left),this._compare(a.key,e)==="lt"&&a.right&&l(a.right)):(a.left&&l(a.left),a.right&&l(a.right)))};l(i)}else{let l=new D([i]);for(;l.size>0;){let a=l.shift();if(a){if(t(a)===e&&(o.push(a),r))return o;t===this._defaultOneParamCallback?(this._compare(a.key,e)==="gt"&&a.left&&l.push(a.left),this._compare(a.key,e)==="lt"&&a.right&&l.push(a.right)):(a.left&&l.push(a.left),a.right&&l.push(a.right))}}}return o}dfs(e=this._defaultOneParamCallback,t="in",r=this.root,i="ITERATIVE"){return super.dfs(e,t,r,i,!1)}bfs(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType){return super.bfs(e,t,r,!1)}listLevels(e=this._defaultOneParamCallback,t=this.root,r=this.iterationType){return super.listLevels(e,t,r,!1)}lastKey(e=this.root){let t=this.ensureNode(e);if(t){if(this._variant==="STANDARD")for(;t.right!==void 0;)t=t.right;else for(;t.left!==void 0;)t=t.left;return t.key}}lesserOrGreaterTraverse(e=this._defaultOneParamCallback,t="lt",r=this.root,i=this.iterationType){r=this.ensureNode(r);let s=[];if(!r||!this.root)return s;let o=r.key;if(i==="RECURSIVE"){let l=a=>{this._compare(a.key,o)===t&&s.push(e(a)),!(!a.left&&!a.right)&&(a.left&&this._compare(a.left.key,o)===t&&l(a.left),a.right&&this._compare(a.right.key,o)===t&&l(a.right))};return l(this.root),s}else{let l=new D([this.root]);for(;l.size>0;){let a=l.shift();a&&(this._compare(a.key,o)===t&&s.push(e(a)),a.left&&this._compare(a.left.key,o)===t&&l.push(a.left),a.right&&this._compare(a.right.key,o)===t&&l.push(a.right))}return s}}perfectlyBalance(e=this.iterationType){let t=this.dfs(i=>i,"in"),r=t.length;if(this.clear(),t.length<1)return!1;if(e==="RECURSIVE"){let i=(s,o)=>{if(s>o)return;let l=s+Math.floor((o-s)/2),a=t[l];this.add([a.key,a.value]),i(s,l-1),i(l+1,o)};return i(0,r-1),!0}else{let i=[[0,r-1]];for(;i.length>0;){let s=i.pop();if(s){let[o,l]=s;if(o<=l){let a=o+Math.floor((l-o)/2),u=t[a];this.add([u.key,u.value]),i.push([a+1,l]),i.push([o,a-1])}}}return!0}}isAVLBalanced(e=this.iterationType){var r,i;if(!this.root)return!0;let t=!0;if(e==="RECURSIVE"){let s=o=>{if(!o)return 0;let l=s(o.left),a=s(o.right);return Math.abs(l-a)>1&&(t=!1),Math.max(l,a)+1};s(this.root)}else{let s=[],o=this.root,l,a=new Map;for(;s.length>0||o;)if(o)s.push(o),o=o.left;else if(o=s[s.length-1],!o.right||l===o.right){if(o=s.pop(),o){let u=o.left&&(r=a.get(o.left))!=null?r:-1,f=o.right&&(i=a.get(o.right))!=null?i:-1;if(Math.abs(u-f)>1)return!1;a.set(o,1+Math.max(u,f)),l=o,o=void 0}}else o=o.right}return t}_setRoot(e){e&&(e.parent=void 0),this._root=e}_compare(e,t){let r=this.extractor(e),i=this.extractor(t),s=this.variant==="STANDARD"?r-i:i-r;return s>0?"gt":s<0?"lt":"eq"}};var Se=class{constructor({frequency:n=0,max:e}){d(this,"_freq");d(this,"_max");d(this,"_freqMap");d(this,"_msb");d(this,"_negativeCount");this._freq=n,this._max=e,this._freqMap={0:0},this._msb=Ne(e),this._negativeCount=n<0?e:0}get freqMap(){return this._freqMap}get msb(){return this._msb}get negativeCount(){return this._negativeCount}get freq(){return this._freq}get max(){return this._max}readSingle(n){return this._checkIndex(n),this._readSingle(n)}update(n,e){this._checkIndex(n);let t=this._readSingle(n);this._update(n,e),this._updateNegativeCount(t,t+e)}writeSingle(n,e){this._checkIndex(n),this._writeSingle(n,e)}read(n){if(!Number.isInteger(n))throw new Error("Invalid count");return this._read(Math.max(Math.min(n,this.max),0))}lowerBound(n){if(this.negativeCount>0)throw new Error("Sequence is not non-descending");return this._binarySearch(n,(e,t)=>e<t)}upperBound(n){if(this.negativeCount>0)throw new Error("Must not be descending");return this._binarySearch(n,(e,t)=>e<=t)}getPrefixSum(n){this._checkIndex(n),n++;let e=0;for(;n>0;)e+=this._getFrequency(n),n-=n&-n;return e}_getFrequency(n){return n in this.freqMap?this.freqMap[n]:this.freq*(n&-n)}_updateFrequency(n,e){this.freqMap[n]=this._getFrequency(n)+e}_checkIndex(n){if(!Number.isInteger(n))throw new Error("Invalid index: Index must be an integer.");if(n<0||n>=this.max)throw new Error("Index out of range: Index must be within the range [0, this.max).")}_readSingle(n){n=n+1;let e=this._getFrequency(n),t=n-(n&-n);for(n--;n!==t;)e-=this._getFrequency(n),n-=n&-n;return e}_updateNegativeCount(n,e){n<0&&e>=0?this._negativeCount--:n>=0&&e<0&&this._negativeCount++}_update(n,e){for(n=n+1;n<=this.max;)this._updateFrequency(n,e),n+=n&-n}_writeSingle(n,e){let t=this._readSingle(n);this._update(n,e-t),this._updateNegativeCount(t,e)}_read(n){let e=n,t=0;for(;e;)t+=this._getFrequency(e),e-=e&-e;return t}_binarySearch(n,e){let t=0,r=this.msb<<1,i=n;for(;r>t+1;){let s=t+r>>1,o=this._getFrequency(s);s<=this.max&&e(o,i)?(i-=o,t=s):r=s}return t}};var X=class{constructor(n,e,t,r){d(this,"_start",0);d(this,"_end",0);d(this,"_value");d(this,"_sum",0);d(this,"_left");d(this,"_right");this._start=n,this._end=e,this._sum=t,this._value=r||void 0}get start(){return this._start}set start(n){this._start=n}get end(){return this._end}set end(n){this._end=n}get value(){return this._value}set value(n){this._value=n}get sum(){return this._sum}set sum(n){this._sum=n}get left(){return this._left}set left(n){this._left=n}get right(){return this._right}set right(n){this._right=n}},Le=class{constructor(n,e,t){d(this,"_values",[]);d(this,"_start",0);d(this,"_end");d(this,"_root");e=e||0,t=t||n.length-1,this._values=n,this._start=e,this._end=t,n.length>0?this._root=this.build(e,t):(this._root=void 0,this._values=[])}get values(){return this._values}get start(){return this._start}get end(){return this._end}get root(){return this._root}build(n,e){if(n>e)return new X(n,e,0);if(n===e)return new X(n,e,this._values[n]);let t=n+Math.floor((e-n)/2),r=this.build(n,t),i=this.build(t+1,e),s=new X(n,e,r.sum+i.sum);return s.left=r,s.right=i,s}updateNode(n,e,t){let r=this.root||void 0;if(!r)return;let i=(s,o,l,a)=>{if(s.start===s.end&&s.start===o){s.sum=l,a!==void 0&&(s.value=a);return}let u=s.start+Math.floor((s.end-s.start)/2);o<=u?s.left&&i(s.left,o,l,a):s.right&&i(s.right,o,l,a),s.left&&s.right&&(s.sum=s.left.sum+s.right.sum)};i(r,n,e,t)}querySumByRange(n,e){let t=this.root||void 0;if(!t)return 0;if(n<0||e>=this.values.length||n>e)return NaN;let r=(i,s,o)=>{if(s<=i.start&&o>=i.end)return i.sum;let l=i.start+Math.floor((i.end-i.start)/2);if(o<=l)return i.left?r(i.left,s,o):NaN;if(s>l)return i.right?r(i.right,s,o):NaN;{let a=0,u=0;return i.left&&(a=r(i.left,s,l)),i.right&&(u=r(i.right,l+1,o)),a+u}};return r(t,n,e)}};var A=class extends F{constructor(e,t){super(e,t);d(this,"_height");this._height=0}get height(){return this._height}set height(e){this._height=e}},re=class h extends U{constructor(n=[],e){super([],e),n&&super.addMany(n)}createNode(n,e){return new A(n,e)}createTree(n){return new h([],v({iterationType:this.iterationType,variant:this.variant},n))}isNode(n){return n instanceof A}add(n,e){if(n===null)return!1;let t=super.add(n,e);return t&&this._balancePath(n),t}delete(n,e=this._defaultOneParamCallback){n instanceof A&&(e=r=>r);let t=super.delete(n,e);for(let{needBalanced:r}of t)r&&this._balancePath(r);return t}_swapProperties(n,e){if(n=this.ensureNode(n),e=this.ensureNode(e),n&&e){let{key:t,value:r,height:i}=e,s=this.createNode(t,r);return s&&(s.height=i,e.key=n.key,e.value=n.value,e.height=n.height,n.key=s.key,n.value=s.value,n.height=s.height),e}}_balanceFactor(n){return n.right?n.left?n.right.height-n.left.height:+n.height:-n.height}_updateHeight(n){if(!n.left&&!n.right)n.height=0;else if(n.left)n.right?n.height=1+Math.max(n.right.height,n.left.height):n.height=1+n.left.height;else{let e=n.right?n.right.height:0;n.height=1+e}}_balanceLL(n){let e=n.parent,t=n.left;n.parent=t,t&&t.right&&(t.right.parent=n),t&&(t.parent=e),n===this.root?t&&this._setRoot(t):(e==null?void 0:e.left)===n?e.left=t:e&&(e.right=t),t&&(n.left=t.right,t.right=n),this._updateHeight(n),t&&this._updateHeight(t)}_balanceLR(n){let e=n.parent,t=n.left,r;t&&(r=t.right),n&&(n.parent=r),t&&(t.parent=r),r&&(r.left&&(r.left.parent=t),r.right&&(r.right.parent=n),r.parent=e),n===this.root?r&&this._setRoot(r):e&&(e.left===n?e.left=r:e.right=r),r&&(n.left=r.right,t&&(t.right=r.left),r.left=t,r.right=n),this._updateHeight(n),t&&this._updateHeight(t),r&&this._updateHeight(r)}_balanceRR(n){let e=n.parent,t=n.right;n.parent=t,t&&(t.left&&(t.left.parent=n),t.parent=e),n===this.root?t&&this._setRoot(t):e&&(e.left===n?e.left=t:e.right=t),t&&(n.right=t.left,t.left=n),this._updateHeight(n),t&&this._updateHeight(t)}_balanceRL(n){let e=n.parent,t=n.right,r;t&&(r=t.left),n.parent=r,t&&(t.parent=r),r&&(r.left&&(r.left.parent=n),r.right&&(r.right.parent=t),r.parent=e),n===this.root?r&&this._setRoot(r):e&&(e.left===n?e.left=r:e.right=r),r&&(n.right=r.left),t&&r&&(t.left=r.right),r&&(r.left=n),r&&(r.right=t),this._updateHeight(n),t&&this._updateHeight(t),r&&this._updateHeight(r)}_balancePath(n){n=this.ensureNode(n);let e=this.getPathToRoot(n,!1);for(let t=0;t<e.length;t++){let r=e[t];switch(this._updateHeight(r),this._balanceFactor(r)){case-2:r&&r.left&&(this._balanceFactor(r.left)<=0?this._balanceLL(r):this._balanceLR(r));break;case 2:r&&r.right&&(this._balanceFactor(r.right)>=0?this._balanceRR(r):this._balanceRL(r))}}}_replaceNode(n,e){return e.height=n.height,super._replaceNode(n,e)}};var H=class extends F{constructor(e,t,r=0){super(e,t);d(this,"_color");this._color=r}get color(){return this._color}set color(e){this._color=e}},Fe=class h extends U{constructor(e=[],t){super([],t);d(this,"_Sentinel",new H(NaN));d(this,"_root");d(this,"_size",0);this._root=this._Sentinel,e&&super.addMany(e)}get Sentinel(){return this._Sentinel}get root(){return this._root}get size(){return this._size}createNode(e,t,r=0){return new H(e,t,r)}createTree(e){return new h([],v({iterationType:this.iterationType},e))}keyValueOrEntryToNode(e,t){let r;if(e!=null){if(this.isNode(e))r=e;else if(this.isEntry(e)){let[i,s]=e;if(i==null)return;r=this.createNode(i,s,1)}else if(!this.isNode(e))r=this.createNode(e,t,1);else return;return r}}isNode(e){return e instanceof H}isRealNode(e){return e===this._Sentinel||e===void 0?!1:e instanceof H}add(e,t){let r=this.keyValueOrEntryToNode(e,t);if(r===void 0)return!1;r.left=this._Sentinel,r.right=this._Sentinel;let i,s=this.root;for(;s!==this._Sentinel;)if(i=s,s)if(r.key<s.key)s=s.left;else if(r.key>s.key)s=s==null?void 0:s.right;else return r!==s&&this._replaceNode(s,r),!1;return r.parent=i,i===void 0?this._setRoot(r):r.key<i.key?i.left=r:i.right=r,r.parent===void 0?(r.color=0,this._size++,!1):r.parent.parent===void 0?(this._size++,!1):(this._fixInsert(r),this._size++,!0)}delete(e,t=this._defaultOneParamCallback){let r=[];return e===null||(s=>{let o=this._Sentinel,l,a;for(;s!==this._Sentinel;)s&&t(s)===e&&(o=s),s&&e&&t(s)<=e?s=s.right:s=s==null?void 0:s.left;if(o===this._Sentinel){this._size--;return}a=o;let u=a.color;o.left===this._Sentinel?(l=o.right,this._rbTransplant(o,o.right)):o.right===this._Sentinel?(l=o.left,this._rbTransplant(o,o.left)):(a=this.getLeftMost(o.right),u=a.color,l=a.right,a.parent===o?l.parent=a:(this._rbTransplant(a,a.right),a.right=o.right,a.right.parent=a),this._rbTransplant(o,a),a.left=o.left,a.left.parent=a,a.color=o.color),u===0&&this._fixDelete(l),this._size--,r.push({deleted:o,needBalanced:void 0})})(this.root),r}getNode(e,t=this._defaultOneParamCallback,r=this.root,i=this.iterationType){var s;return e instanceof H&&(t=o=>o),r=this.ensureNode(r),(s=this.getNodes(e,t,!0,r,i)[0])!=null?s:void 0}clear(){this._root=this._Sentinel,this._size=0}getPredecessor(e){if(this.isRealNode(e.left))return this.getRightMost(e.left);let t=e.parent;for(;this.isRealNode(t)&&e===t.left;)e=t,t=t.parent;return t}_setRoot(e){e&&(e.parent=void 0),this._root=e}_leftRotate(e){if(e.right){let t=e.right;e.right=t.left,t.left!==this._Sentinel&&t.left&&(t.left.parent=e),t.parent=e.parent,e.parent===void 0?this._setRoot(t):e===e.parent.left?e.parent.left=t:e.parent.right=t,t.left=e,e.parent=t}}_rightRotate(e){if(e.left){let t=e.left;e.left=t.right,t.right!==this._Sentinel&&t.right&&(t.right.parent=e),t.parent=e.parent,e.parent===void 0?this._setRoot(t):e===e.parent.right?e.parent.right=t:e.parent.left=t,t.right=e,e.parent=t}}_fixInsert(e){let t;for(;e.parent&&e.parent.color===1&&(e.parent.parent&&e.parent===e.parent.parent.right?(t=e.parent.parent.left,t&&t.color===1?(t.color=0,e.parent.color=0,e.parent.parent.color=1,e=e.parent.parent):(e===e.parent.left&&(e=e.parent,this._rightRotate(e)),e.parent.color=0,e.parent.parent.color=1,this._leftRotate(e.parent.parent))):(t=e.parent.parent.right,t&&t.color===1?(t.color=0,e.parent.color=0,e.parent.parent.color=1,e=e.parent.parent):(e===e.parent.right&&(e=e.parent,this._leftRotate(e)),e.parent.color=0,e.parent.parent.color=1,this._rightRotate(e.parent.parent))),e!==this.root););this.root.color=0}_fixDelete(e){let t;for(;e!==this.root&&e.color===0;)e.parent&&e===e.parent.left?(t=e.parent.right,t.color===1&&(t.color=0,e.parent.color=1,this._leftRotate(e.parent),t=e.parent.right),t.left!==void 0&&t.left.color===0&&t.right&&t.right.color===0?(t.color=1,e=e.parent):(t.right&&t.right.color===0&&(t.left&&(t.left.color=0),t.color=1,this._rightRotate(t),t=e.parent.right),t&&(t.color=e.parent.color),e.parent.color=0,t&&t.right&&(t.right.color=0),this._leftRotate(e.parent),e=this.root)):(t=e.parent.left,t.color===1&&(t.color=0,e.parent.color=1,this._rightRotate(e.parent),t=e.parent.left),t&&t.right&&t.right.color===0&&t.right.color===0?(t.color=1,e=e.parent):(t&&t.left&&t.left.color===0&&(t.right&&(t.right.color=0),t.color=1,this._leftRotate(t),t=e.parent.left),t&&(t.color=e.parent.color),e.parent.color=0,t&&t.left&&(t.left.color=0),this._rightRotate(e.parent),e=this.root));e.color=0}_rbTransplant(e,t){e.parent===void 0?this._setRoot(t):e===e.parent.left?e.parent.left=t:e.parent.right=t,t.parent=e.parent}_replaceNode(e,t){return t.color=e.color,super._replaceNode(e,t)}};var ie=class extends A{constructor(e,t,r=1){super(e,t);d(this,"_count",1);this.count=r}get count(){return this._count}set count(e){this._count=e}},ze=class h extends re{constructor(e=[],t){super([],t);d(this,"_count",0);e&&this.addMany(e)}get count(){let e=0;return this.dfs(t=>e+=t.count),e}createNode(e,t,r){return new ie(e,t,r)}createTree(e){return new h([],v({iterationType:this.iterationType,variant:this.variant},e))}keyValueOrEntryToNode(e,t,r=1){let i;if(e!=null){if(this.isNode(e))i=e;else if(this.isEntry(e)){let[s,o]=e;if(s==null)return;i=this.createNode(s,o,r)}else if(!this.isNode(e))i=this.createNode(e,t,r);else return;return i}}isNode(e){return e instanceof ie}add(e,t,r=1){let i=this.keyValueOrEntryToNode(e,t,r);if(i===void 0)return!1;let s=(i==null?void 0:i.count)||0;return super.add(i)&&(this._count+=s),!0}delete(e,t=this._defaultOneParamCallback,r=!1){var u;let i=[];if(!this.root)return i;let s=(u=this.getNode(e,t))!=null?u:void 0;if(!s)return i;let o=s!=null&&s.parent?s.parent:void 0,l,a=s;if(s.count>1&&!r)s.count--,this._count--;else{if(s.left){let f=s.left?this.getRightMost(s.left):void 0;if(f){let c=f.parent;a=this._swapProperties(s,f),c&&(c.right===f?c.right=f.left:c.left=f.left,l=c)}}else if(!o)s.right!==void 0&&this._setRoot(s.right);else{let{familyPosition:f}=s;f==="LEFT"||f==="ROOT_LEFT"?o.left=s.right:(f==="RIGHT"||f==="ROOT_RIGHT")&&(o.right=s.right),l=o}this._size=this.size-1,a&&(this._count-=a.count)}return i.push({deleted:a,needBalanced:l}),l&&this._balancePath(l),i}clear(){super.clear(),this._count=0}perfectlyBalance(e=this.iterationType){let t=this.dfs(i=>i,"in"),r=t.length;if(t.length<1)return!1;if(this.clear(),e==="RECURSIVE"){let i=(s,o)=>{if(s>o)return;let l=s+Math.floor((o-s)/2),a=t[l];this.add(a.key,a.value,a.count),i(s,l-1),i(l+1,o)};return i(0,r-1),!0}else{let i=[[0,r-1]];for(;i.length>0;){let s=i.pop();if(s){let[o,l]=s;if(o<=l){let a=o+Math.floor((l-o)/2),u=t[a];this.add(u.key,u.value,u.count),i.push([a+1,l]),i.push([o,a-1])}}}return!0}}clone(){let e=this.createTree();return this.bfs(t=>e.add(t.key,t.value,t.count)),e}_swapProperties(e,t){if(e=this.ensureNode(e),t=this.ensureNode(t),e&&t){let{key:r,value:i,count:s,height:o}=t,l=this.createNode(r,i,s);return l&&(l.height=o,t.key=e.key,t.value=e.value,t.count=e.count,t.height=e.height,e.key=l.key,e.value=l.value,e.count=l.count,e.height=l.height),t}}_replaceNode(e,t){return t.count=e.count+t.count,super._replaceNode(e,t)}};var Ae=class h{constructor(n,e,t){d(this,"_key");d(this,"_value");d(this,"_children");this._key=n,this._value=e||void 0,this._children=t||[]}get key(){return this._key}set key(n){this._key=n}get value(){return this._value}set value(n){this._value=n}get children(){return this._children}set children(n){this._children=n}addChildren(n){this._children||(this._children=[]),n instanceof h?this._children.push(n):this._children=this._children.concat(n)}getHeight(){let n=0;if(this){let e=(t,r)=>{r>n&&(n=r);let{_children:i}=t;if(i)for(let s=0,o=i.length;s<o;s++)e(i[s],r+1)};e(this,0)}return n}};var G=class extends B{constructor(n=[],e){super(n,e)}};var He=class extends G{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return t-r;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var Pe=class extends G{constructor(n=[],e={comparator:(t,r)=>{if(typeof t=="number"&&typeof r=="number")return r-t;throw new Error("The a, b params of compare function must be number")}}){super(n,e)}};var je=class h{constructor(n,e){d(this,"_rows",0);d(this,"_cols",0);d(this,"_data");var t,r,i;if(e){let{rows:s,cols:o,addFn:l,subtractFn:a,multiplyFn:u}=e;typeof s=="number"&&s>0?this._rows=s:this._rows=n.length,typeof o=="number"&&o>0?this._cols=o:this._cols=((t=n[0])==null?void 0:t.length)||0,l&&(this._addFn=l),a&&(this._subtractFn=a),u&&(this._multiplyFn=u)}else this._rows=n.length,this._cols=(i=(r=n[0])==null?void 0:r.length)!=null?i:0;if(n.length>0)this._data=n;else{this._data=[];for(let s=0;s<this.rows;s++)this._data[s]=new Array(this.cols).fill(0)}}get rows(){return this._rows}get cols(){return this._cols}get data(){return this._data}get addFn(){return this._addFn}get subtractFn(){return this._subtractFn}get multiplyFn(){return this._multiplyFn}get(n,e){if(this.isValidIndex(n,e))return this.data[n][e]}set(n,e,t){return this.isValidIndex(n,e)?(this.data[n][e]=t,!0):!1}isMatchForCalculate(n){return this.rows===n.rows&&this.cols===n.cols}add(n){if(!this.isMatchForCalculate(n))throw new Error("Matrix dimensions must match for addition.");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<this.cols;r++){let i=this.get(t,r),s=n.get(t,r);if(i!==void 0&&s!==void 0){let o=this._addFn(i,s);o&&(e[t][r]=o)}}}return new h(e,{rows:this.rows,cols:this.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}subtract(n){if(!this.isMatchForCalculate(n))throw new Error("Matrix dimensions must match for subtraction.");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<this.cols;r++){let i=this.get(t,r),s=n.get(t,r);if(i!==void 0&&s!==void 0){let o=this._subtractFn(i,s);o&&(e[t][r]=o)}}}return new h(e,{rows:this.rows,cols:this.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}multiply(n){if(this.cols!==n.rows)throw new Error("Matrix dimensions must be compatible for multiplication (A.cols = B.rows).");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<n.cols;r++){let i;for(let s=0;s<this.cols;s++){let o=this.get(t,s),l=n.get(s,r);if(o!==void 0&&l!==void 0){let a=this.multiplyFn(o,l);a!==void 0&&(i=this.addFn(i,a))}}i!==void 0&&(e[t][r]=i)}}return new h(e,{rows:this.rows,cols:n.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}transpose(){if(this.data.some(e=>e.length!==this.rows))throw new Error("Matrix must be rectangular for transposition.");let n=[];for(let e=0;e<this.cols;e++){n[e]=[];for(let t=0;t<this.rows;t++){let r=this.get(t,e);r!==void 0&&(n[e][t]=r)}}return new h(n,{rows:this.cols,cols:this.rows,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}inverse(){var r;if(this.rows!==this.cols)throw new Error("Matrix must be square for inversion.");let n=[];for(let i=0;i<this.rows;i++){n[i]=this.data[i].slice();for(let s=0;s<this.cols;s++)n[i][this.cols+s]=i===s?1:0}let e=new h(n,{rows:this.rows,cols:this.cols*2,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn});for(let i=0;i<this.rows;i++){let s=i;for(;s<this.rows&&e.get(s,i)===0;)s++;if(s===this.rows)throw new Error("Matrix is singular, and its inverse does not exist.");e._swapRows(i,s);let o=(r=e.get(i,i))!=null?r:1;if(o===0)throw new Error("Matrix is singular, and its inverse does not exist (division by zero).");e._scaleRow(i,1/o);for(let l=0;l<this.rows;l++)if(l!==i){let a=e.get(l,i);a===void 0&&(a=0),e._addScaledRow(l,i,-a)}}let t=[];for(let i=0;i<this.rows;i++)t[i]=e.data[i].slice(this.cols);return new h(t,{rows:this.rows,cols:this.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}dot(n){if(this.cols!==n.rows)throw new Error("Number of columns in the first matrix must be equal to the number of rows in the second matrix for dot product.");let e=[];for(let t=0;t<this.rows;t++){e[t]=[];for(let r=0;r<n.cols;r++){let i;for(let s=0;s<this.cols;s++){let o=this.get(t,s),l=n.get(s,r);if(o!==void 0&&l!==void 0){let a=this.multiplyFn(o,l);a!==void 0&&(i=this.addFn(i,a))}}i!==void 0&&(e[t][r]=i)}}return new h(e,{rows:this.rows,cols:n.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}isValidIndex(n,e){return n>=0&&n<this.rows&&e>=0&&e<this.cols}clone(){return new h(this.data,{rows:this.rows,cols:this.cols,addFn:this.addFn,subtractFn:this.subtractFn,multiplyFn:this.multiplyFn})}_addFn(n,e){return n===void 0?e:n+e}_subtractFn(n,e){return n-e}_multiplyFn(n,e){return n*e}_swapRows(n,e){let t=this.data[n];this.data[n]=this.data[e],this.data[e]=t}_scaleRow(n,e){for(let t=0;t<this.cols;t++){let r=this.multiplyFn(this.data[n][t],e);r===void 0&&(r=0),this.data[n][t]=r}}_addScaledRow(n,e,t){for(let r=0;r<this.cols;r++){let i=this.multiplyFn(this.data[e][r],t);i===void 0&&(i=0);let s=i,o=this.addFn(this.data[n][r],s);o===void 0&&(o=0),this.data[n][r]=o}}};var ce=class h{constructor(n,e){d(this,"direction");d(this,"turn");this.direction=n,this.turn=()=>new h(e[n],e)}},qe=class{constructor({matrix:n,turning:e,onMove:t,init:{cur:r,charDir:i,VISITED:s}}){d(this,"onMove");d(this,"_matrix");d(this,"_cur");d(this,"_character");d(this,"_VISITED");this._matrix=n,this._cur=r,this._character=new ce(i,e),this.onMove=t,this.onMove&&this.onMove(this._cur),this._VISITED=s,this._matrix[this._cur[0]][this._cur[1]]=this._VISITED}start(){for(;this.check(this._character.direction)||this.check(this._character.turn().direction);){let{direction:n}=this._character;this.check(n)?this.move(n):this.check(this._character.turn().direction)&&(this._character=this._character.turn())}}check(n){let e,t,r=this._matrix,[i,s]=this._cur;switch(n){case"up":if(t=r[i-1],!t)return!1;e=t[s];break;case"right":e=r[i][s+1];break;case"down":if(t=r[i+1],!t)return!1;e=t[s];break;case"left":e=r[i][s-1];break}return e!==void 0&&e!==this._VISITED}move(n){switch(n){case"up":this._cur[0]--;break;case"right":this._cur[1]++;break;case"down":this._cur[0]++;break;case"left":this._cur[1]--;break}let[e,t]=this._cur;this._matrix[e][t]=this._VISITED,this.onMove&&this.onMove(this._cur)}};var Y=class{constructor(n){d(this,"_key");d(this,"_children");d(this,"_isEnd");this._key=n,this._isEnd=!1,this._children=new Map}get key(){return this._key}set key(n){this._key=n}get children(){return this._children}set children(n){this._children=n}get isEnd(){return this._isEnd}set isEnd(n){this._isEnd=n}},Ue=class h extends k{constructor(e=[],t){super();d(this,"_size",0);d(this,"_caseSensitive",!0);d(this,"_root",new Y(""));if(t){let{caseSensitive:r}=t;r!==void 0&&(this._caseSensitive=r)}if(e)for(let r of e)this.add(r)}get size(){return this._size}get caseSensitive(){return this._caseSensitive}get root(){return this._root}add(e){e=this._caseProcess(e);let t=this.root,r=!1;for(let i of e){let s=t.children.get(i);s||(s=new Y(i),t.children.set(i,s)),t=s}return t.isEnd||(r=!0,t.isEnd=!0,this._size++),r}has(e){e=this._caseProcess(e);let t=this.root;for(let r of e){let i=t.children.get(r);if(!i)return!1;t=i}return t.isEnd}isEmpty(){return this.size===0}clear(){this._size=0,this._root=new Y("")}delete(e){e=this._caseProcess(e);let t=!1,r=(i,s)=>{let o=e[s],l=i.children.get(o);return l?s===e.length-1?l.isEnd?(l.children.size>0?l.isEnd=!1:i.children.delete(o),t=!0,!0):!1:r(l,s+1)&&!i.isEnd&&l.children.size===0?(i.children.delete(o),!0):!1:!1};return r(this.root,0),t&&this._size--,t}getHeight(){let e=this.root,t=0;if(e){let r=(i,s)=>{s>t&&(t=s);let{children:o}=i;if(o)for(let l of o.entries())r(l[1],s+1)};r(e,0)}return t}hasPurePrefix(e){e=this._caseProcess(e);let t=this.root;for(let r of e){let i=t.children.get(r);if(!i)return!1;t=i}return!t.isEnd}hasPrefix(e){e=this._caseProcess(e);let t=this.root;for(let r of e){let i=t.children.get(r);if(!i)return!1;t=i}return!0}hasCommonPrefix(e){e=this._caseProcess(e);let t="",r=i=>{if(t+=i.key,t!==e&&!i.isEnd)if(i&&i.children&&i.children.size===1)r(Array.from(i.children.values())[0]);else return};return r(this.root),t===e}getLongestCommonPrefix(){let e="",t=r=>{if(e+=r.key,!r.isEnd)if(r&&r.children&&r.children.size===1)t(Array.from(r.children.values())[0]);else return};return t(this.root),e}getWords(e="",t=Number.MAX_SAFE_INTEGER,r=!1){e=this._caseProcess(e);let i=[],s=0;function o(a,u){for(let f of a.children.keys()){let c=a.children.get(f);c!==void 0&&o(c,u.concat(f))}if(a.isEnd){if(s>t-1)return;i.push(u),s++}}let l=this.root;if(e)for(let a of e){let u=l.children.get(a);u&&(l=u)}return(r||l!==this.root)&&o(l,e),i}clone(){return new h(this.values(),{caseSensitive:this.caseSensitive})}filter(e,t){let r=new h,i=0;for(let s of this)e.call(t,s,i,this)&&r.add(s),i++;return r}map(e,t){let r=new h,i=0;for(let s of this)r.add(e.call(t,s,i,this)),i++;return r}*_getIterator(){function*e(t,r){t.isEnd&&(yield r);for(let[i,s]of t.children)yield*I(e(s,r+i))}yield*I(e(this.root,""))}_caseProcess(e){return this._caseSensitive||(e=e.toLowerCase()),e}};return tt(ot);})();
 /**
  * data-structure-typed
  *