tree-multimap-typed 2.5.0 → 2.5.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/types/data-structures/base/index.d.ts +1 -0
- package/dist/types/data-structures/base/iterable-entry-base.d.ts +8 -8
- package/dist/types/data-structures/base/linear-base.d.ts +3 -3
- package/dist/types/data-structures/binary-tree/avl-tree.d.ts +252 -0
- package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +294 -0
- package/dist/types/data-structures/binary-tree/binary-tree.d.ts +527 -2
- package/dist/types/data-structures/binary-tree/bst.d.ts +505 -1
- package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +399 -0
- package/dist/types/data-structures/binary-tree/segment-tree.d.ts +126 -1
- package/dist/types/data-structures/binary-tree/tree-map.d.ts +2881 -382
- package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +2867 -347
- package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +2328 -312
- package/dist/types/data-structures/binary-tree/tree-set.d.ts +2671 -277
- package/dist/types/data-structures/graph/abstract-graph.d.ts +4 -4
- package/dist/types/data-structures/graph/directed-graph.d.ts +210 -0
- package/dist/types/data-structures/graph/undirected-graph.d.ts +189 -0
- package/dist/types/data-structures/hash/hash-map.d.ts +241 -10
- package/dist/types/data-structures/heap/heap.d.ts +294 -0
- package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +360 -3
- package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +318 -3
- package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +380 -2
- package/dist/types/data-structures/matrix/matrix.d.ts +168 -0
- package/dist/types/data-structures/queue/deque.d.ts +319 -4
- package/dist/types/data-structures/queue/queue.d.ts +252 -0
- package/dist/types/data-structures/stack/stack.d.ts +210 -0
- package/dist/types/data-structures/trie/trie.d.ts +256 -4
- package/dist/types/interfaces/graph.d.ts +1 -1
- package/dist/types/types/common.d.ts +2 -2
- package/dist/types/types/data-structures/heap/heap.d.ts +1 -0
- package/dist/types/types/data-structures/priority-queue/priority-queue.d.ts +1 -0
- package/dist/types/types/utils/validate-type.d.ts +4 -4
- package/dist/umd/tree-multimap-typed.js +28009 -14563
- package/dist/umd/tree-multimap-typed.js.map +1 -1
- package/dist/umd/tree-multimap-typed.min.js +7 -1
- package/dist/umd/tree-multimap-typed.min.js.map +1 -1
- package/package.json +2 -2
- package/src/data-structures/base/index.ts +1 -0
- package/src/data-structures/base/iterable-entry-base.ts +8 -8
- package/src/data-structures/base/linear-base.ts +3 -3
- package/src/data-structures/binary-tree/avl-tree.ts +252 -0
- package/src/data-structures/binary-tree/binary-indexed-tree.ts +295 -1
- package/src/data-structures/binary-tree/binary-tree.ts +527 -2
- package/src/data-structures/binary-tree/bst.ts +505 -1
- package/src/data-structures/binary-tree/red-black-tree.ts +399 -0
- package/src/data-structures/binary-tree/segment-tree.ts +127 -2
- package/src/data-structures/binary-tree/tree-map.ts +2958 -459
- package/src/data-structures/binary-tree/tree-multi-map.ts +3069 -549
- package/src/data-structures/binary-tree/tree-multi-set.ts +2476 -460
- package/src/data-structures/binary-tree/tree-set.ts +2816 -422
- package/src/data-structures/graph/abstract-graph.ts +4 -4
- package/src/data-structures/graph/directed-graph.ts +210 -0
- package/src/data-structures/graph/undirected-graph.ts +189 -0
- package/src/data-structures/hash/hash-map.ts +246 -15
- package/src/data-structures/heap/heap.ts +294 -0
- package/src/data-structures/linked-list/doubly-linked-list.ts +360 -3
- package/src/data-structures/linked-list/singly-linked-list.ts +318 -3
- package/src/data-structures/linked-list/skip-linked-list.ts +380 -2
- package/src/data-structures/matrix/matrix.ts +169 -1
- package/src/data-structures/queue/deque.ts +320 -5
- package/src/data-structures/queue/queue.ts +252 -0
- package/src/data-structures/stack/stack.ts +210 -0
- package/src/data-structures/trie/trie.ts +257 -5
- package/src/interfaces/graph.ts +1 -1
- package/src/types/common.ts +2 -2
- package/src/types/data-structures/heap/heap.ts +1 -0
- package/src/types/data-structures/priority-queue/priority-queue.ts +1 -0
- package/src/types/utils/validate-type.ts +4 -4
|
@@ -1,4 +1,4 @@
|
|
|
1
|
-
"use strict";var treeMultimapTyped=(()=>{var _t=Object.defineProperty;var Ae=Object.getOwnPropertyDescriptor;var Be=Object.getOwnPropertyNames;var De=Object.prototype.hasOwnProperty;var ze=(c,t)=>{for(var e in t)_t(c,e,{get:t[e],enumerable:!0})},Ve=(c,t,e,i)=>{if(t&&typeof t=="object"||typeof t=="function")for(let s of Be(t))!De.call(c,s)&&s!==e&&_t(c,s,{get:()=>t[s],enumerable:!(i=Ae(t,s))||i.enumerable});return c};var Ke=c=>Ve(_t({},"__esModule",{value:!0}),c);var bi={};ze(bi,{TreeMultiMap:()=>Le});var Tt=Object.defineProperty,St=c=>{throw TypeError(c)},je=(c,t,e)=>t in c?Tt(c,t,{enumerable:!0,configurable:!0,writable:!0,value:e}):c[t]=e,u=(c,t)=>Tt(c,"name",{value:t,configurable:!0}),f=(c,t,e)=>je(c,typeof t!="symbol"?t+"":t,e),Ct=(c,t,e)=>t.has(c)||St("Cannot "+e),g=(c,t,e)=>(Ct(c,t,"read from private field"),e?e.call(c):t.get(c)),z=(c,t,e)=>t.has(c)?St("Cannot add the same private member more than once"):t instanceof WeakSet?t.add(c):t.set(c,e),V=(c,t,e,i)=>(Ct(c,t,"write to private field"),t.set(c,e),e),At=class{*[Symbol.iterator](...t){yield*this._getIterator(...t)}*entries(){for(let t of this)yield t}*keys(){for(let t of this)yield t[0]}*values(){for(let t of this)yield t[1]}every(t,e){let i=0;for(let s of this)if(!t.call(e,s[1],s[0],i++,this))return!1;return!0}some(t,e){let i=0;for(let s of this)if(t.call(e,s[1],s[0],i++,this))return!0;return!1}forEach(t,e){let i=0;for(let s of this){let[r,n]=s;t.call(e,n,r,i++,this)}}find(t,e){let i=0;for(let s of this){let[r,n]=s;if(t.call(e,n,r,i++,this))return s}}has(t){for(let e of this){let[i]=e;if(i===t)return!0}return!1}hasValue(t){for(let[,e]of this)if(e===t)return!0;return!1}get(t){for(let e of this){let[i,s]=e;if(i===t)return s}}reduce(t,e){let i=e,s=0;for(let r of this){let[n,h]=r;i=t(i,h,n,s++,this)}return i}toArray(){return[...this]}toVisual(){return[...this]}print(){console.log(this.toVisual())}};u(At,"IterableEntryBase");var et=At,Bt=class{constructor(t){if(f(this,"_toElementFn"),t){let{toElementFn:e}=t;if(typeof e=="function")this._toElementFn=e;else if(e)throw new TypeError("toElementFn must be a function type")}}get toElementFn(){return this._toElementFn}*[Symbol.iterator](...t){yield*this._getIterator(...t)}*values(){for(let t of this)yield t}every(t,e){let i=0;for(let s of this)if(e===void 0){if(!t(s,i++,this))return!1}else if(!t.call(e,s,i++,this))return!1;return!0}some(t,e){let i=0;for(let s of this)if(e===void 0){if(t(s,i++,this))return!0}else if(t.call(e,s,i++,this))return!0;return!1}forEach(t,e){let i=0;for(let s of this)e===void 0?t(s,i++,this):t.call(e,s,i++,this)}find(t,e){let i=0;for(let s of this)if(e===void 0){if(t(s,i++,this))return s}else if(t.call(e,s,i++,this))return s}has(t){for(let e of this)if(e===t)return!0;return!1}reduce(t,e){let i=0,s=this[Symbol.iterator](),r;if(arguments.length>=2)r=e;else{let n=s.next();if(n.done)throw new TypeError("Reduce of empty structure with no initial value");r=n.value,i=1}for(let n of s)r=t(r,n,i++,this);return r}toArray(){return[...this]}toVisual(){return[...this]}print(){console.log(this.toVisual())}};u(Bt,"IterableElementBase");var at=Bt,He=u(function(){return"xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/[x]/g,function(c){let t=Math.random()*16|0;return(c=="x"?t:t&3|8).toString(16)})},"uuidV4"),U=u(function(c,t){let e=-1,i=c?c.length:0,s=[];for(;++e<i;){let r=c[e];t(r,e,c)&&(s.push(r),Array.prototype.splice.call(c,e--,1),i--)}return s},"arrayRemove");var q=u((c,t,e,i)=>{if(c<t||c>e)throw new RangeError(i!=null?i:`Index ${c} is out of range [${t}, ${e}].`)},"rangeCheck");var j=u(c=>{let t=typeof c;return t==="object"&&c!==null||t==="function"},"isWeakKey"),Et=u((c,t)=>Math.floor((c+t-1)/t),"calcMinUnitsRequired");function ot(c){let t=typeof c;return t==="number"?!0:t==="bigint"||t==="string"||t==="boolean"}u(ot,"isPrimitiveComparable");function xt(c){if(typeof c.valueOf=="function"){let t=c.valueOf();if(t!==c){if(ot(t))return t;if(typeof t=="object"&&t!==null)return xt(t)}}if(typeof c.toString=="function"){let t=c.toString();if(t!=="[object Object]")return t}return null}u(xt,"tryObjectToPrimitive");function Z(c,t=!1){if(c==null)return!1;if(ot(c))return!0;if(typeof c!="object")return!1;if(c instanceof Date||t)return!0;let e=xt(c);return e==null?!1:ot(e)}u(Z,"isComparable");var Lt=u(c=>({isThunk:!0,fn:c}),"makeTrampolineThunk"),Dt=u(c=>typeof c=="object"&&c!==null&&"isThunk"in c&&c.isThunk,"isTrampolineThunk");function zt(c){let t=c;for(;Dt(t);)t=t.fn();return t}u(zt,"trampoline");function mt(c){return(...t)=>zt(c(...t))}u(mt,"makeTrampoline");async function Vt(c){let t=await c;for(;Dt(t);)t=await t.fn();return t}u(Vt,"asyncTrampoline");function Ue(c){return async(...t)=>Vt(c(...t))}u(Ue,"makeAsyncTrampoline");function qe(c,t=32){let e=(c>>>0).toString(2);return e=e.padStart(t,"0"),e}u(qe,"toBinaryString");var N={indexOutOfRange:u((c,t,e,i)=>`${i?i+": ":""}Index ${c} is out of range [${t}, ${e}].`,"indexOutOfRange"),invalidIndex:u(c=>`${c?c+": ":""}Index must be an integer.`,"invalidIndex"),invalidArgument:u((c,t)=>`${t?t+": ":""}${c}`,"invalidArgument"),comparatorRequired:u(c=>`${c?c+": ":""}Comparator is required for non-number/non-string/non-Date keys.`,"comparatorRequired"),invalidKey:u((c,t)=>`${t?t+": ":""}${c}`,"invalidKey"),notAFunction:u((c,t)=>`${t?t+": ":""}${c} must be a function.`,"notAFunction"),invalidEntry:u(c=>`${c?c+": ":""}Each entry must be a [key, value] tuple.`,"invalidEntry"),invalidNaN:u(c=>`${c?c+": ":""}NaN is not a valid key.`,"invalidNaN"),invalidDate:u(c=>`${c?c+": ":""}Invalid Date key.`,"invalidDate"),reduceEmpty:u(c=>`${c?c+": ":""}Reduce of empty structure with no initial value.`,"reduceEmpty"),callbackReturnType:u((c,t,e)=>`${e?e+": ":""}Callback must return ${c}; got ${t}.`,"callbackReturnType"),invalidOperation:u((c,t)=>`${t?t+": ":""}${c}`,"invalidOperation"),matrixDimensionMismatch:u(c=>`Matrix: Dimensions must be compatible for ${c}.`,"matrixDimensionMismatch"),matrixSingular:u(()=>"Matrix: Singular matrix, inverse does not exist.","matrixSingular"),matrixNotSquare:u(()=>"Matrix: Must be square for inversion.","matrixNotSquare"),matrixNotRectangular:u(()=>"Matrix: Must be rectangular for transposition.","matrixNotRectangular"),matrixRowMismatch:u((c,t)=>`Matrix: Expected row length ${c}, but got ${t}.`,"matrixRowMismatch")};var Kt=class{constructor(t,e,i=!0,s=!0){this.low=t,this.high=e,this.includeLow=i,this.includeHigh=s}isInRange(t,e){let i=this.includeLow?e(t,this.low)>=0:e(t,this.low)>0,s=this.includeHigh?e(t,this.high)<=0:e(t,this.high)<0;return i&&s}};u(Kt,"Range");var it=Kt,Ge=class extends et{constructor(t=[],e){if(super(),f(this,"_store",{}),f(this,"_objMap",new Map),f(this,"_toEntryFn"),f(this,"_size",0),f(this,"_hashFn",u(i=>String(i),"_hashFn")),e){let{hashFn:i,toEntryFn:s}=e;i&&(this._hashFn=i),s&&(this._toEntryFn=s)}t&&this.setMany(t)}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}isEmpty(){return this._size===0}clear(){this._store={},this._objMap.clear(),this._size=0}isEntry(t){return Array.isArray(t)&&t.length===2}set(t,e){if(this._isObjKey(t))this.objMap.has(t)||this._size++,this.objMap.set(t,e);else{let i=this._getNoObjKey(t);this.store[i]===void 0&&this._size++,this._store[i]={key:t,value:e}}return!0}setMany(t){let e=[];for(let i of t){let s,r;this.isEntry(i)?[s,r]=i:this._toEntryFn&&([s,r]=this._toEntryFn(i)),s!==void 0&&r!==void 0&&e.push(this.set(s,r))}return e}get(t){var e;if(this._isObjKey(t))return this.objMap.get(t);let i=this._getNoObjKey(t);return(e=this._store[i])==null?void 0:e.value}has(t){return this._isObjKey(t)?this.objMap.has(t):this._getNoObjKey(t)in this.store}delete(t){if(this._isObjKey(t))return this.objMap.has(t)&&this._size--,this.objMap.delete(t);let e=this._getNoObjKey(t);return e in this.store?(delete this.store[e],this._size--,!0):!1}setHashFn(t){return this._hashFn===t?this:(this._hashFn=t,this._rehashNoObj(),this)}clone(){let t={hashFn:this._hashFn,toEntryFn:this._toEntryFn};return this._createLike(this,t)}map(t,e){let i=this._createLike(),s=0;for(let[r,n]of this)i.set(r,t.call(e,n,r,s++,this));return i}filter(t,e){let i=this._createLike(),s=0;for(let[r,n]of this)t.call(e,n,r,s++,this)&&i.set(r,n);return i}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}_rehashNoObj(){let t={};for(let{key:e,value:i}of Object.values(this._store)){let s=this._getNoObjKey(e);t[s]={key:e,value:i}}this._store=t}*_getIterator(){for(let t of Object.values(this.store))yield[t.key,t.value];for(let t of this.objMap)yield t}_isObjKey(t){let e=typeof t;return(e==="object"||e==="function")&&t!==null}_getNoObjKey(t){let e=typeof t,i;return e!=="string"&&e!=="number"&&e!=="symbol"?i=this._hashFn(t):i=t,i}};u(Ge,"HashMap");var We=class extends et{constructor(t=[],e){if(super(),f(this,"_sentinel"),f(this,"_hashFn",u(i=>String(i),"_hashFn")),f(this,"_objHashFn",u(i=>i,"_objHashFn")),f(this,"_noObjMap",{}),f(this,"_objMap",new WeakMap),f(this,"_head"),f(this,"_tail"),f(this,"_toEntryFn",u(i=>{if(this.isEntry(i))return i;throw new TypeError(N.invalidArgument("If elements do not adhere to [key, value], provide options.toEntryFn to transform raw records.","HashMap"))},"_toEntryFn")),f(this,"_size",0),this._sentinel={},this._sentinel.prev=this._sentinel.next=this._head=this._tail=this._sentinel,e){let{hashFn:i,objHashFn:s,toEntryFn:r}=e;i&&(this._hashFn=i),s&&(this._objHashFn=s),r&&(this._toEntryFn=r)}t&&this.setMany(t)}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 t=this.head;for(;t!==this._sentinel;)yield[t.key,t.value],t=t.next}*reverseBegin(){let t=this.tail;for(;t!==this._sentinel;)yield[t.key,t.value],t=t.prev}set(t,e){let i,s=!this.has(t);if(j(t)){let r=this._objHashFn(t);i=this.objMap.get(r),!i&&s?(i={key:r,value:e,prev:this.tail,next:this._sentinel},this.objMap.set(r,i)):i&&(i.value=e)}else{let r=this._hashFn(t);i=this.noObjMap[r],!i&&s?this.noObjMap[r]=i={key:t,value:e,prev:this.tail,next:this._sentinel}:i&&(i.value=e)}return i&&s&&(this._size===0?(this._head=i,this._sentinel.next=i):(this.tail.next=i,i.prev=this.tail),this._tail=i,this._sentinel.prev=i,this._size++),!0}setMany(t){let e=[];for(let i of t){let s,r;this.isEntry(i)?[s,r]=i:this._toEntryFn&&([s,r]=this._toEntryFn(i)),s!==void 0&&r!==void 0&&e.push(this.set(s,r))}return e}has(t){if(j(t)){let i=this._objHashFn(t);return this.objMap.has(i)}return this._hashFn(t)in this.noObjMap}get(t){if(j(t)){let s=this._objHashFn(t),r=this.objMap.get(s);return r?r.value:void 0}let e=this._hashFn(t),i=this.noObjMap[e];return i?i.value:void 0}at(t){q(t,0,this._size-1);let e=this.head;for(;t--;)e=e.next;return e.value}delete(t){let e;if(j(t)){let i=this._objHashFn(t);if(e=this.objMap.get(i),!e)return!1;this.objMap.delete(i)}else{let i=this._hashFn(t);if(e=this.noObjMap[i],!e)return!1;delete this.noObjMap[i]}return this._deleteNode(e)}deleteWhere(t){let e=this._head,i=0;for(;e!==this._sentinel;){let s=e;if(e=e.next,t(s.key,s.value,i++,this)){let r=s.key;if(j(r))this._objMap.delete(r);else{let n=this._hashFn(s.key);delete this._noObjMap[n]}return this._deleteNode(s)}}return!1}deleteAt(t){q(t,0,this._size-1);let e=this.head;for(;t--;)e=e.next;return this._deleteNode(e)}isEmpty(){return this._size===0}isEntry(t){return Array.isArray(t)&&t.length===2}clear(){this._noObjMap={},this._size=0,this._head=this._tail=this._sentinel.prev=this._sentinel.next=this._sentinel}clone(){let t={hashFn:this._hashFn,objHashFn:this._objHashFn};return this._createLike(this,t)}filter(t,e){let i=this._createLike(),s=0;for(let[r,n]of this)t.call(e,n,r,s,this)&&i.set(r,n),s++;return i}map(t,e){let i=this._createLike(),s=0;for(let[r,n]of this){let[h,o]=t.call(e,n,r,s,this);i.set(h,o),s++}return i}*_getIterator(){let t=this.head;for(;t!==this._sentinel;)yield[t.key,t.value],t=t.next}_deleteNode(t){let e=t.key;if(j(e))this._objMap.delete(e);else{let r=this._hashFn(e);delete this._noObjMap[r]}let{prev:i,next:s}=t;return i.next=s,s.prev=i,t===this.head&&(this._head=s),t===this.tail&&(this._tail=i),this._size-=1,!0}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}};u(We,"LinkedHashMap");var jt=class{constructor(t){f(this,"_value"),f(this,"_next"),this._value=t,this._next=void 0}get value(){return this._value}set value(t){this._value=t}get next(){return this._next}set next(t){this._next=t}};u(jt,"LinkedListNode");var Ht=jt,Ut=class qt extends at{constructor(t){if(super(t),f(this,"_maxLen",-1),t){let{maxLen:e}=t;typeof e=="number"&&e>0&&e%1===0&&(this._maxLen=e)}}get maxLen(){return this._maxLen}indexOf(t,e=0){if(this.length===0)return-1;e<0&&(e=this.length+e),e<0&&(e=0);for(let i=e;i<this.length;i++)if(this.at(i)===t)return i;return-1}lastIndexOf(t,e=this.length-1){if(this.length===0)return-1;e>=this.length&&(e=this.length-1),e<0&&(e=this.length+e);for(let i=e;i>=0;i--)if(this.at(i)===t)return i;return-1}findIndex(t,e){for(let i=0;i<this.length;i++){let s=this.at(i);if(s!==void 0&&t.call(e,s,i,this))return i}return-1}concat(...t){let e=this.clone();for(let i of t)i instanceof qt?e.pushMany(i):e.push(i);return e}sort(t){let e=this.toArray();e.sort(t),this.clear();for(let i of e)this.push(i);return this}splice(t,e=0,...i){let s=this._createInstance();t=t<0?this.length+t:t,t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,Math.min(e,this.length-t));for(let r=0;r<e;r++){let n=this.deleteAt(t);n!==void 0&&s.push(n)}for(let r=0;r<i.length;r++)this.addAt(t+r,i[r]);return s}join(t=","){return this.toArray().join(t)}toReversedArray(){let t=[];for(let e=this.length-1;e>=0;e--)t.push(this.at(e));return t}reduceRight(t,e){let i=e!=null?e:0;for(let s=this.length-1;s>=0;s--)i=t(i,this.at(s),s,this);return i}slice(t=0,e=this.length){t=t<0?this.length+t:t,e=e<0?this.length+e:e;let i=this._createInstance();for(let s=t;s<e;s++)i.push(this.at(s));return i}fill(t,e=0,i=this.length){if(e=e<0?this.length+e:e,i=i<0?this.length+i:i,e<0&&(e=0),i>this.length&&(i=this.length),e>=i)return this;for(let s=e;s<i;s++)this.setAt(s,t);return this}};u(Ut,"LinearBase");var lt=Ut,Gt=class extends lt{constructor(t){if(super(t),t){let{maxLen:e}=t;typeof e=="number"&&e>0&&e%1===0&&(this._maxLen=e)}}indexOf(t,e=0){let i=this._getIterator(),s=i.next(),r=0;for(;r<e;)s=i.next(),r++;for(;!s.done;){if(s.value===t)return r;s=i.next(),r++}return-1}lastIndexOf(t,e=this.length-1){let i=this._getReverseIterator(),s=i.next(),r=this.length-1;for(;r>e;)s=i.next(),r--;for(;!s.done;){if(s.value===t)return r;s=i.next(),r--}return-1}concat(...t){let e=this.clone();for(let i of t)i instanceof lt?e.pushMany(i):e.push(i);return e}slice(t=0,e=this.length){t=t<0?this.length+t:t,e=e<0?this.length+e:e;let i=this._createInstance(),s=this._getIterator(),r=s.next(),n=0;for(;n<t;)r=s.next(),n++;for(let h=t;h<e;h++)i.push(r.value),r=s.next();return i}splice(t,e=0,...i){let s=this._createInstance();t=t<0?this.length+t:t,t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,e);let r=0,n,h,o=this._getNodeIterator();for(let l of o){if(r===t){n=l;break}h=l,r++}for(let l=0;l<e&&n;l++){s.push(n.value);let a=n.next;this.delete(n),n=a}for(let l=0;l<i.length;l++)h?(this.addAfter(h,i[l]),h=h.next):(this.addAt(0,i[l]),h=this._getNodeIterator().next().value);return s}reduceRight(t,e){let i=e!=null?e:0,s=this.length-1;for(let r of this._getReverseIterator())i=t(i,r,s--,this);return i}};u(Gt,"LinearLinkedBase");var Wt=Gt,$t=class extends Ht{constructor(t){super(t),f(this,"_next"),this._value=t,this._next=void 0}get next(){return this._next}set next(t){this._next=t}};u($t,"SinglyLinkedListNode");var wt=$t,Pt=class extends Wt{constructor(t=[],e){super(e),f(this,"_equals",u((i,s)=>Object.is(i,s),"_equals")),f(this,"_head"),f(this,"_tail"),f(this,"_length",0),this.pushMany(t)}get head(){return this._head}get tail(){return this._tail}get length(){return this._length}get first(){var t;return(t=this.head)==null?void 0:t.value}get last(){var t;return(t=this.tail)==null?void 0:t.value}static from(t,e){let i=new this([],e);for(let s of t)i.push(s);return i}push(t){let e=this._ensureNode(t);return this.head?(this.tail.next=e,this._tail=e):this._head=this._tail=e,this._length++,this._maxLen>0&&this.length>this._maxLen&&this.shift(),!0}pop(){var t;if(!this.head)return;if(this.head===this.tail){let s=this.head.value;return this._head=void 0,this._tail=void 0,this._length--,s}let e=this.head;for(;e.next&&e.next!==this.tail;)e=e.next;let i=(t=this.tail)==null?void 0:t.value;return e.next=void 0,this._tail=e,this._length--,i}shift(){if(!this.head)return;let t=this.head;return this._head=this.head.next,this._head||(this._tail=void 0),this._length--,t.value}unshift(t){let e=this._ensureNode(t);return this.head?(e.next=this.head,this._head=e):this._head=this._tail=e,this._length++,!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}unshiftMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.unshift(this.toElementFn(i))):e.push(this.unshift(i));return e}search(t){let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i.value;i=i.next}}at(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e==null?void 0:e.value}isNode(t){return t instanceof wt}getNodeAt(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e}deleteAt(t){if(t<0||t>=this._length)return;if(t===0)return this.shift();let e=this.getNodeAt(t),i=this._getPrevNode(e),s=e.value;return i.next=e.next,e===this.tail&&(this._tail=i),this._length--,s}delete(t){if(t===void 0||!this.head)return!1;let e=this.isNode(t)?t:this.getNode(t);if(!e)return!1;let i=this._getPrevNode(e);return i?(i.next=e.next,e===this.tail&&(this._tail=i)):(this._head=e.next,e===this.tail&&(this._tail=void 0)),this._length--,!0}addAt(t,e){if(t<0||t>this._length)return!1;if(t===0)return this.unshift(e);if(t===this._length)return this.push(e);let i=this._ensureNode(e),s=this.getNodeAt(t-1);return i.next=s.next,s.next=i,this._length++,!0}setAt(t,e){let i=this.getNodeAt(t);return i?(i.value=e,!0):!1}isEmpty(){return this._length===0}clear(){this._head=void 0,this._tail=void 0,this._length=0}reverse(){if(!this.head||this.head===this.tail)return this;let t,e=this.head,i;for(;e;)i=e.next,e.next=t,t=e,e=i;return[this._head,this._tail]=[this.tail,this.head],this}getNode(t){if(t===void 0)return;if(this.isNode(t))return t;let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i;i=i.next}}addBefore(t,e){let i=this.getNode(t);if(!i)return!1;let s=this._getPrevNode(i),r=this._ensureNode(e);return s?(s.next=r,r.next=i,this._length++):(r.next=this._head,this._head=r,this._tail||(this._tail=r),this._length++),!0}addAfter(t,e){let i=this.getNode(t);if(!i)return!1;let s=this._ensureNode(e);return s.next=i.next,i.next=s,i===this.tail&&(this._tail=s),this._length++,!0}splice(t,e=0,...i){t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,e);let s=this._createInstance(),r=t===0?void 0:this.getNodeAt(t-1),n=r?r.next:this.head,h=0;for(;h<e&&n;)s.push(n.value),n=n.next,h++;let o=n;if(r?r.next=o:this._head=o,o||(this._tail=r),i.length>0){let l,a;for(let _ of i){let d=this._ensureNode(_);l||(l=d),a&&(a.next=d),a=d}r?r.next=l:this._head=l,a.next=o,o||(this._tail=a)}return this._length+=i.length-h,this._length===0&&(this._head=void 0,this._tail=void 0),s}countOccurrences(t){let e=Qt(t,this._equals),i=0,s=this.head;for(;s;)e(s)&&i++,s=s.next;return i}setEquality(t){return this._equals=t,this}deleteWhere(t){let e,i=this.head,s=0;for(;i;){if(t(i.value,s++,this))return e?(e.next=i.next,i===this._tail&&(this._tail=e)):(this._head=i.next,i===this._tail&&(this._tail=void 0)),this._length--,!0;e=i,i=i.next}return!1}clone(){let t=this._createInstance();for(let e of this)t.push(e);return t}filter(t,e){let i=this._createInstance(),s=0;for(let r of this)t.call(e,r,s++,this)&&i.push(r);return i}mapSame(t,e){let i=this._createInstance(),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{},maxLen:this._maxLen}),r=0;for(let n of this)s.push(t.call(i,n,r++,this));return s}createNode(t){return new wt(t)}_isPredicate(t){return typeof t=="function"}_ensureNode(t){return this.isNode(t)?t:this.createNode(t)}_ensurePredicate(t){if(this.isNode(t))return i=>i===t;if(this._isPredicate(t))return t;let e=t;return i=>this._equals(i.value,e)}_getPrevNode(t){if(!this.head||this.head===t)return;let e=this.head;for(;e.next&&e.next!==t;)e=e.next;return e.next===t?e:void 0}*_getIterator(){let t=this.head;for(;t;)yield t.value,t=t.next}*_getReverseIterator(){let t=[...this].reverse();for(let e of t)yield e}*_getNodeIterator(){let t=this.head;for(;t;)yield t,t=t.next}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}_spawnLike(t){return this._createLike([],t)}};u(Pt,"SinglyLinkedList");var $e=Pt;function Qt(c,t){if(c instanceof wt)return i=>i===c;if(typeof c=="function")return c;let e=c;return i=>t(i.value,e)}u(Qt,"elementOrPredicate");var Ot=class extends Ht{constructor(t){super(t),f(this,"_next"),f(this,"_prev"),this._value=t,this._next=void 0,this._prev=void 0}get next(){return this._next}set next(t){this._next=t}get prev(){return this._prev}set prev(t){this._prev=t}};u(Ot,"DoublyLinkedListNode");var Rt=Ot,Pe=class extends Wt{constructor(t=[],e){super(e),f(this,"_equals",u((i,s)=>Object.is(i,s),"_equals")),f(this,"_head"),f(this,"_tail"),f(this,"_length",0),this._head=void 0,this._tail=void 0,this._length=0,e!=null&&e.maxLen&&Number.isInteger(e.maxLen)&&e.maxLen>0&&(this._maxLen=e.maxLen),this.pushMany(t)}get head(){return this._head}get tail(){return this._tail}get length(){return this._length}get first(){var t;return(t=this.head)==null?void 0:t.value}get last(){var t;return(t=this.tail)==null?void 0:t.value}static fromArray(t){return new this(t)}isNode(t){return t instanceof Rt}push(t){let e=this._ensureNode(t);return this.head?(e.prev=this.tail,this.tail.next=e,this._tail=e):(this._head=e,this._tail=e),this._length++,this._maxLen>0&&this.length>this._maxLen&&this.shift(),!0}pop(){if(!this.tail)return;let t=this.tail;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._tail=t.prev,this.tail.next=void 0),this._length--,t.value}shift(){if(!this.head)return;let t=this.head;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._head=t.next,this.head.prev=void 0),this._length--,t.value}unshift(t){let e=this._ensureNode(t);return this.head?(e.next=this.head,this.head.prev=e,this._head=e):(this._head=e,this._tail=e),this._length++,this._maxLen>0&&this._length>this._maxLen&&this.pop(),!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}unshiftMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.unshift(this.toElementFn(i))):e.push(this.unshift(i));return e}at(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e==null?void 0:e.value}getNodeAt(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e}getNode(t){if(t===void 0)return;if(this.isNode(t)){let s=t,r=this.head;for(;r;){if(r===s)return s;r=r.next}let n=u(h=>this._equals(h.value,s.value),"isMatch");for(r=this.head;r;){if(n(r))return r;r=r.next}return}let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i;i=i.next}}addAt(t,e){if(t<0||t>this._length)return!1;if(t===0)return this.unshift(e);if(t===this._length)return this.push(e);let i=this._ensureNode(e),s=this.getNodeAt(t-1),r=s.next;return i.prev=s,i.next=r,s.next=i,r.prev=i,this._length++,!0}addBefore(t,e){let i=this.isNode(t)?t:this.getNode(t);if(!i)return!1;let s=this._ensureNode(e);return s.prev=i.prev,i.prev&&(i.prev.next=s),s.next=i,i.prev=s,i===this.head&&(this._head=s),this._length++,!0}addAfter(t,e){let i=this.isNode(t)?t:this.getNode(t);if(!i)return!1;let s=this._ensureNode(e);return s.next=i.next,i.next&&(i.next.prev=s),s.prev=i,i.next=s,i===this.tail&&(this._tail=s),this._length++,!0}setAt(t,e){let i=this.getNodeAt(t);return i?(i.value=e,!0):!1}deleteAt(t){if(t<0||t>=this._length)return;if(t===0)return this.shift();if(t===this._length-1)return this.pop();let e=this.getNodeAt(t),i=e.prev,s=e.next;return i.next=s,s.prev=i,this._length--,e.value}delete(t){let e=this.getNode(t);if(!e)return!1;if(e===this.head)this.shift();else if(e===this.tail)this.pop();else{let i=e.prev,s=e.next;i.next=s,s.prev=i,this._length--}return!0}isEmpty(){return this._length===0}clear(){this._head=void 0,this._tail=void 0,this._length=0}search(t){let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i.value;i=i.next}}getBackward(t){let e=this._ensurePredicate(t),i=this.tail;for(;i;){if(e(i))return i.value;i=i.prev}}reverse(){let t=this.head;for([this._head,this._tail]=[this.tail,this.head];t;){let e=t.next;[t.prev,t.next]=[t.next,t.prev],t=e}return this}setEquality(t){return this._equals=t,this}clone(){let t=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});for(let e of this)t.push(e);return t}filter(t,e){let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen}),s=0;for(let r of this)t.call(e,r,s++,this)&&i.push(r);return i}mapSame(t,e){let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen}),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{},maxLen:this._maxLen}),r=0;for(let n of this)s.push(t.call(i,n,r++,this));return s}_ensureNode(t){return this.isNode(t)?t:new Rt(t)}_ensurePredicate(t){if(this.isNode(t)){let i=t;return s=>s===i}if(typeof t=="function")return t;let e=t;return i=>this._equals(i.value,e)}_getPrevNode(t){return t.prev}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}*_getIterator(){let t=this.head;for(;t;)yield t.value,t=t.next}*_getReverseIterator(){let t=this.tail;for(;t;)yield t.value,t=t.prev}*_getNodeIterator(){let t=this.head;for(;t;)yield t,t=t.next}};u(Pe,"DoublyLinkedList");var Xt=class{constructor(t,e,i){f(this,"key"),f(this,"value"),f(this,"forward"),this.key=t,this.value=e,this.forward=new Array(i).fill(void 0)}};u(Xt,"SkipListNode");var dt=Xt,C,G,Qe=class W extends et{constructor(t=[],e={}){super(),z(this,C),z(this,G),f(this,"_head"),f(this,"_level",0),f(this,"_size",0),f(this,"_maxLevel",16),f(this,"_probability",.5);let{comparator:i,toEntryFn:s,maxLevel:r,probability:n}=e;typeof r=="number"&&r>0&&(this._maxLevel=r),typeof n=="number"&&n>0&&n<1&&(this._probability=n),V(this,G,i===void 0),V(this,C,i!=null?i:W.createDefaultComparator()),this._head=new dt(void 0,void 0,this._maxLevel);for(let h of t){let o,l;if(s)[o,l]=s(h);else{if(!Array.isArray(h)||h.length<2)throw new TypeError(N.invalidEntry("SkipList"));[o,l]=h}this.set(o,l)}}static createDefaultComparator(){return(t,e)=>{if(typeof t=="number"&&typeof e=="number"){if(Number.isNaN(t)||Number.isNaN(e))throw new TypeError(N.invalidNaN("SkipList"));return t-e}if(typeof t=="string"&&typeof e=="string")return t<e?-1:t>e?1:0;if(t instanceof Date&&e instanceof Date){let i=t.getTime(),s=e.getTime();if(Number.isNaN(i)||Number.isNaN(s))throw new TypeError(N.invalidDate("SkipList"));return i-s}if(typeof t=="bigint"&&typeof e=="bigint")return t<e?-1:t>e?1:0;throw new TypeError(N.comparatorRequired("SkipList"))}}get size(){return this._size}get maxLevel(){return this._maxLevel}get probability(){return this._probability}get comparator(){return g(this,C)}isEmpty(){return this._size===0}clear(){this._head=new dt(void 0,void 0,this._maxLevel),this._level=0,this._size=0}clone(){return new W(this,{comparator:g(this,G)?void 0:g(this,C),maxLevel:this._maxLevel,probability:this._probability})}set(t,e){let i=g(this,C),s=this._findUpdate(t),r=s[0].forward[0];if(r&&i(r.key,t)===0)return r.value=e,this;let n=this._randomLevel(),h=new dt(t,e,n);if(n>this._level){for(let o=this._level;o<n;o++)s[o]=this._head;this._level=n}for(let o=0;o<n;o++)h.forward[o]=s[o].forward[o],s[o].forward[o]=h;return this._size++,this}get(t){let e=this._findNode(t);return e?e.value:void 0}has(t){return this._findNode(t)!==void 0}delete(t){let e=g(this,C),i=this._findUpdate(t),s=i[0].forward[0];if(!s||e(s.key,t)!==0)return!1;for(let r=0;r<this._level&&i[r].forward[r]===s;r++)i[r].forward[r]=s.forward[r];for(;this._level>0&&!this._head.forward[this._level-1];)this._level--;return this._size--,!0}first(){let t=this._head.forward[0];return t?[t.key,t.value]:void 0}last(){let t=this._head;for(let e=this._level-1;e>=0;e--)for(;t.forward[e];)t=t.forward[e];return t===this._head?void 0:[t.key,t.value]}pollFirst(){let t=this.first();if(t)return this.delete(t[0]),t}pollLast(){let t=this.last();if(t)return this.delete(t[0]),t}ceiling(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<0;)i=i.forward[r];let s=i.forward[0];return s?[s.key,s.value]:void 0}floor(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<=0;)i=i.forward[r];let s=i===this._head?void 0:i;if(s&&e(s.key,t)<=0)return[s.key,s.value]}higher(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<=0;)i=i.forward[r];let s=i.forward[0];return s?[s.key,s.value]:void 0}lower(t){let e=g(this,C),i=this._head,s;for(let r=this._level-1;r>=0;r--){for(;i.forward[r]&&e(i.forward[r].key,t)<0;)i=i.forward[r];i!==this._head&&e(i.key,t)<0&&(s=i)}return s?[s.key,s.value]:void 0}rangeSearch(t,e={}){let{lowInclusive:i=!0,highInclusive:s=!0}=e,[r,n]=t,h=g(this,C),o=[],l=this._head;for(let a=this._level-1;a>=0;a--)for(;l.forward[a]&&h(l.forward[a].key,r)<0;)l=l.forward[a];for(l=l.forward[0];l;){let a=h(l.key,n);if(a>0||a===0&&!s)break;let _=h(l.key,r);(_>0||_===0&&i)&&o.push([l.key,l.value]),l=l.forward[0]}return o}map(t,e){let i=new W([],e!=null?e:{}),s=0;for(let[r,n]of this){let[h,o]=t(n,r,s++,this);i.set(h,o)}return i}filter(t,e){let i=new W([],{comparator:g(this,G)?void 0:g(this,C),maxLevel:this._maxLevel,probability:this._probability}),s=0;for(let[r,n]of this)t.call(e,n,r,s++,this)&&i.set(r,n);return i}_getIterator(){let t=this._head;return(function*(){let e=t.forward[0];for(;e;)yield[e.key,e.value],e=e.forward[0]})()}_findUpdate(t){let e=g(this,C),i=new Array(this._maxLevel).fill(this._head),s=this._head;for(let r=this._level-1;r>=0;r--){for(;s.forward[r]&&e(s.forward[r].key,t)<0;)s=s.forward[r];i[r]=s}return i}_findNode(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<0;)i=i.forward[r];let s=i.forward[0];if(s&&e(s.key,t)===0)return s}_randomLevel(){let t=1;for(;Math.random()<this._probability&&t<this._maxLevel;)t++;return t}};C=new WeakMap;G=new WeakMap;u(Qe,"SkipList");var Oe=class extends at{constructor(t=[],e){super(e),f(this,"_equals",u((i,s)=>Object.is(i,s),"_equals")),f(this,"_elements",[]),this.pushMany(t)}get elements(){return this._elements}get size(){return this.elements.length}static fromArray(t,e){return new this(t,e)}isEmpty(){return this.elements.length===0}peek(){return this.isEmpty()?void 0:this.elements[this.elements.length-1]}push(t){return this.elements.push(t),!0}pop(){return this.isEmpty()?void 0:this.elements.pop()}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}delete(t){let e=this._indexOfByEquals(t);return this.deleteAt(e)}deleteAt(t){return t<0||t>=this.elements.length?!1:this.elements.splice(t,1).length===1}deleteWhere(t){for(let e=0;e<this.elements.length;e++)if(t(this.elements[e],e,this))return this.elements.splice(e,1),!0;return!1}clear(){this._elements=[]}clone(){let t=this._createInstance({toElementFn:this.toElementFn});for(let e of this)t.push(e);return t}filter(t,e){let i=this._createInstance({toElementFn:this.toElementFn}),s=0;for(let r of this)t.call(e,r,s,this)&&i.push(r),s++;return i}mapSame(t,e){let i=this._createInstance({toElementFn:this.toElementFn}),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{}}),r=0;for(let n of this)s.push(i===void 0?t(n,r,this):t.call(i,n,r,this)),r++;return s}setEquality(t){return this._equals=t,this}_indexOfByEquals(t){for(let e=0;e<this.elements.length;e++)if(this._equals(this.elements[e],t))return e;return-1}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}*_getIterator(){for(let t=0;t<this.elements.length;t++)yield this.elements[t]}};u(Oe,"Stack");var Jt=class Yt extends lt{constructor(t=[],e){if(super(e),f(this,"_elements",[]),f(this,"_offset",0),f(this,"_autoCompactRatio",.5),e){let{autoCompactRatio:i=.5}=e;this._autoCompactRatio=i}this.pushMany(t)}get elements(){return this._elements}get offset(){return this._offset}get autoCompactRatio(){return this._autoCompactRatio}set autoCompactRatio(t){this._autoCompactRatio=t}get length(){return this.elements.length-this._offset}get first(){return this.length>0?this.elements[this._offset]:void 0}get last(){return this.length>0?this.elements[this.elements.length-1]:void 0}static fromArray(t){return new Yt(t)}isEmpty(){return this.length===0}push(t){return this.elements.push(t),this._maxLen>0&&this.length>this._maxLen&&this.shift(),!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}shift(){if(this.length===0)return;let t=this.first;return this._offset+=1,this.elements.length>0&&this.offset/this.elements.length>this.autoCompactRatio&&this.compact(),t}delete(t){for(let e=this._offset;e<this.elements.length;e++)if(Object.is(this.elements[e],t))return this.elements.splice(e,1),!0;return!1}at(t){if(!(t<0||t>=this.length))return this._elements[this._offset+t]}deleteAt(t){if(t<0||t>=this.length)return;let e=this._offset+t,[i]=this.elements.splice(e,1);return i}addAt(t,e){return t<0||t>this.length?!1:(this._elements.splice(this._offset+t,0,e),!0)}setAt(t,e){return t<0||t>=this.length?!1:(this._elements[this._offset+t]=e,!0)}reverse(){return this._elements=this.elements.slice(this._offset).reverse(),this._offset=0,this}clear(){this._elements=[],this._offset=0}compact(){return this._elements=this.elements.slice(this._offset),this._offset=0,!0}splice(t,e=0,...i){t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,Math.min(e,this.length-t));let s=this._offset+t,r=this._elements.splice(s,e,...i);this.elements.length>0&&this.offset/this.elements.length>this.autoCompactRatio&&this.compact();let n=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});return n._setAutoCompactRatio(this._autoCompactRatio),n.pushMany(r),n}clone(){let t=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});t._setAutoCompactRatio(this._autoCompactRatio);for(let e=this._offset;e<this.elements.length;e++)t.push(this.elements[e]);return t}filter(t,e){let i=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});i._setAutoCompactRatio(this._autoCompactRatio);let s=0;for(let r of this)t.call(e,r,s,this)&&i.push(r),s++;return i}map(t,e,i){var s,r;let n=new this.constructor([],{toElementFn:e==null?void 0:e.toElementFn,maxLen:(s=e==null?void 0:e.maxLen)!=null?s:this._maxLen,autoCompactRatio:(r=e==null?void 0:e.autoCompactRatio)!=null?r:this._autoCompactRatio}),h=0;for(let o of this)n.push(i===void 0?t(o,h++,this):t.call(i,o,h++,this));return n}mapSame(t,e){var i;let s=this.constructor,r=new s([],{toElementFn:this.toElementFn,maxLen:this._maxLen,autoCompactRatio:this._autoCompactRatio});(i=r._setAutoCompactRatio)==null||i.call(r,this._autoCompactRatio);let n=0;for(let h of this){let o=e===void 0?t(h,n++,this):t.call(e,h,n++,this);r.push(o)}return r}_setAutoCompactRatio(t){this._autoCompactRatio=t}*_getIterator(){for(let t=this._offset;t<this.elements.length;t++)yield this.elements[t]}*_getReverseIterator(){for(let t=this.length-1;t>=0;t--){let e=this.at(t);e!==void 0&&(yield e)}}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}};u(Jt,"Queue");var tt=Jt,Xe=class extends $e{clone(){let t=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});for(let e of this)t.push(e);return t}};u(Xe,"LinkedListQueue");var Je=class extends lt{constructor(t=[],e){if(super(e),f(this,"_equals",u((r,n)=>Object.is(r,n),"_equals")),f(this,"_bucketSize",4096),f(this,"_autoCompactRatio",.5),f(this,"_compactCounter",0),f(this,"_bucketFirst",0),f(this,"_firstInBucket",0),f(this,"_bucketLast",0),f(this,"_lastInBucket",0),f(this,"_bucketCount",0),f(this,"_buckets",[]),f(this,"_length",0),e){let{bucketSize:r,autoCompactRatio:n}=e;typeof r=="number"&&(this._bucketSize=r),typeof n=="number"&&(this._autoCompactRatio=n)}let i;"length"in t?i=typeof t.length=="function"?t.length():t.length:i=typeof t.size=="function"?t.size():t.size,this._bucketCount=Et(i,this._bucketSize)||1;for(let r=0;r<this._bucketCount;++r)this._buckets.push(new Array(this._bucketSize));let s=Et(i,this._bucketSize);this._bucketFirst=this._bucketLast=(this._bucketCount>>1)-(s>>1),this._firstInBucket=this._lastInBucket=this._bucketSize-i%this._bucketSize>>1,this.pushMany(t)}get bucketSize(){return this._bucketSize}get autoCompactRatio(){return this._autoCompactRatio}set autoCompactRatio(t){this._autoCompactRatio=t}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 length(){return this._length}get first(){if(this._length!==0)return this._buckets[this._bucketFirst][this._firstInBucket]}get last(){if(this._length!==0)return this._buckets[this._bucketLast][this._lastInBucket]}static fromArray(t,e){return new this(t,e)}push(t){return this._length&&(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._length+=1,this._buckets[this._bucketLast][this._lastInBucket]=t,this._maxLen>0&&this._length>this._maxLen&&this.shift(),!0}pop(){if(this._length===0)return;let t=this._buckets[this._bucketLast][this._lastInBucket];return this._length!==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._length-=1,this._autoCompact(),t}shift(){if(this._length===0)return;let t=this._buckets[this._bucketFirst][this._firstInBucket];return this._length!==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._length-=1,this._autoCompact(),t}unshift(t){return this._length&&(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._length+=1,this._buckets[this._bucketFirst][this._firstInBucket]=t,this._maxLen>0&&this._length>this._maxLen&&this.pop(),!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}unshiftMany(t=[]){let e=[];for(let i of t)this.toElementFn?e.push(this.unshift(this.toElementFn(i))):e.push(this.unshift(i));return e}isEmpty(){return this._length===0}clear(){this._buckets=[new Array(this._bucketSize)],this._bucketCount=1,this._bucketFirst=this._bucketLast=this._length=0,this._firstInBucket=this._lastInBucket=this._bucketSize>>1}at(t){if(t<0||t>=this._length)return;let{bucketIndex:e,indexInBucket:i}=this._getBucketAndPosition(t);return this._buckets[e][i]}setAt(t,e){q(t,0,this._length-1);let{bucketIndex:i,indexInBucket:s}=this._getBucketAndPosition(t);return this._buckets[i][s]=e,!0}addAt(t,e,i=1){let s=this._length;if(q(t,0,s),t===0)for(;i--;)this.unshift(e);else if(t===this._length)for(;i--;)this.push(e);else{let r=[];for(let n=t;n<this._length;++n){let h=this.at(n);h!==void 0&&r.push(h)}this.cut(t-1,!0);for(let n=0;n<i;++n)this.push(e);for(let n=0;n<r.length;++n)this.push(r[n])}return!0}cut(t,e=!1){if(e){if(t<0)return this.clear(),this;let{bucketIndex:i,indexInBucket:s}=this._getBucketAndPosition(t);return this._bucketLast=i,this._lastInBucket=s,this._length=t+1,this}else{let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize);for(let s=0;s<=t;s++){let r=this.at(s);r!==void 0&&i.push(r)}return i}}splice(t,e=this._length-t,...i){q(t,0,this._length),e<0&&(e=0),t+e>this._length&&(e=this._length-t);let s=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});s._setBucketSize(this._bucketSize);for(let n=0;n<e;n++){let h=this.at(t+n);h!==void 0&&s.push(h)}let r=[];for(let n=t+e;n<this._length;n++){let h=this.at(n);h!==void 0&&r.push(h)}this.cut(t-1,!0);for(let n of i)this.push(n);for(let n of r)this.push(n);return s}cutRest(t,e=!1){if(e){if(t<0)return this;let{bucketIndex:i,indexInBucket:s}=this._getBucketAndPosition(t);return this._bucketFirst=i,this._firstInBucket=s,this._length=this._length-t,this}else{let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize),t<0&&(t=0);for(let s=t;s<this._length;s++){let r=this.at(s);r!==void 0&&i.push(r)}return i}}deleteAt(t){q(t,0,this._length-1);let e;if(t===0)return this.shift();if(t===this._length-1)return e=this.last,this.pop(),e;{let i=this._length-1,{bucketIndex:s,indexInBucket:r}=this._getBucketAndPosition(t);e=this._buckets[s][r];for(let n=t;n<i;n++){let{bucketIndex:h,indexInBucket:o}=this._getBucketAndPosition(n),{bucketIndex:l,indexInBucket:a}=this._getBucketAndPosition(n+1);this._buckets[h][o]=this._buckets[l][a]}return this.pop(),e}}delete(t){let e=this._length;if(e===0)return!1;let i=0,s=0;for(;i<e;){let r=this.at(i);this._equals(r,t)||(this.setAt(s,r),s+=1),i+=1}return this.cut(s-1,!0),!0}deleteWhere(t){for(let e=0;e<this._length;e++){let i=this.at(e);if(t(i,e,this))return this.deleteAt(e),!0}return!1}setEquality(t){return this._equals=t,this}reverse(){this._buckets.reverse().forEach(function(r){r.reverse()});let{_bucketFirst:t,_bucketLast:e,_firstInBucket:i,_lastInBucket:s}=this;return this._bucketFirst=this._bucketCount-e-1,this._bucketLast=this._bucketCount-t-1,this._firstInBucket=this._bucketSize-s-1,this._lastInBucket=this._bucketSize-i-1,this}unique(){if(this._length<=1)return this;let t=1,e=this.at(0);for(let i=1;i<this._length;++i){let s=this.at(i);this._equals(s,e)||(e=s,this.setAt(t++,s))}return this.cut(t-1,!0),this}_autoCompact(){if(this._autoCompactRatio<=0||this._bucketCount<=1||(this._compactCounter++,this._compactCounter<this._bucketSize))return;this._compactCounter=0,this._length/(this._bucketCount*this._bucketSize)<this._autoCompactRatio&&this.shrinkToFit()}compact(){let t=this._bucketCount;return this.shrinkToFit(),this._bucketCount<t}shrinkToFit(){if(this._length===0)return;let t=[];if(this._bucketFirst<=this._bucketLast)for(let e=this._bucketFirst;e<=this._bucketLast;++e)t.push(this._buckets[e]);else{for(let e=this._bucketFirst;e<this._bucketCount;++e)t.push(this._buckets[e]);for(let e=0;e<=this._bucketLast;++e)t.push(this._buckets[e])}this._bucketFirst=0,this._bucketLast=t.length-1,this._buckets=t,this._bucketCount=t.length,this._compactCounter=0}clone(){return this._createLike(this,{bucketSize:this.bucketSize,toElementFn:this.toElementFn,maxLen:this._maxLen})}filter(t,e){let i=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize);let s=0;for(let r of this)t.call(e,r,s,this)&&i.push(r),s++;return i}mapSame(t,e){let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize);let s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{},bucketSize:this._bucketSize,maxLen:this._maxLen}),r=0;for(let n of this){let h=i===void 0?t(n,r,this):t.call(i,n,r,this);s.push(h),r++}return s}_setBucketSize(t){this._bucketSize=t,this._length===0&&(this._buckets=[new Array(this._bucketSize)],this._bucketCount=1,this._bucketFirst=this._bucketLast=0,this._firstInBucket=this._lastInBucket=this._bucketSize>>1)}*_getIterator(){for(let t=0;t<this._length;++t){let e=this.at(t);e!==void 0&&(yield e)}}_reallocate(t){let e=[],i=t||this._bucketCount>>1||1;for(let s=0;s<i;++s)e[s]=new Array(this._bucketSize);for(let s=this._bucketFirst;s<this._bucketCount;++s)e[e.length]=this._buckets[s];for(let s=0;s<this._bucketLast;++s)e[e.length]=this._buckets[s];e[e.length]=[...this._buckets[this._bucketLast]],this._bucketFirst=i,this._bucketLast=e.length-1;for(let s=0;s<i;++s)e[e.length]=new Array(this._bucketSize);this._buckets=e,this._bucketCount=e.length}_getBucketAndPosition(t){let e,i,s=this._firstInBucket+t;return e=this._bucketFirst+Math.floor(s/this._bucketSize),e>=this._bucketCount&&(e-=this._bucketCount),i=(s+1)%this._bucketSize-1,i<0&&(i=this._bucketSize-1),{bucketIndex:e,indexInBucket:i}}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}*_getReverseIterator(){for(let t=this._length-1;t>-1;t--){let e=this.at(t);e!==void 0&&(yield e)}}};u(Je,"Deque");var Zt=class te extends at{constructor(t=[],e){if(super(e),f(this,"_equals",Object.is),f(this,"_elements",[]),f(this,"_DEFAULT_COMPARATOR",u((i,s)=>{if(typeof i=="object"||typeof s=="object")throw new TypeError(N.comparatorRequired("Heap"));return i>s?1:i<s?-1:0},"_DEFAULT_COMPARATOR")),f(this,"_comparator",this._DEFAULT_COMPARATOR),e){let{comparator:i}=e;i&&(this._comparator=i)}this.addMany(t)}get elements(){return this._elements}get size(){return this.elements.length}get leaf(){var t;return(t=this.elements[this.size-1])!=null?t:void 0}static from(t,e){return new this(t,e)}static heapify(t,e){return new te(t,e)}add(t){return this._elements.push(t),this._bubbleUp(this.elements.length-1)}addMany(t){let e=[];for(let i of t)if(this.toElementFn){let s=this.add(this.toElementFn(i));e.push(s)}else{let s=this.add(i);e.push(s)}return e}poll(){if(this.elements.length===0)return;let t=this.elements[0],e=this.elements.pop();return this.elements.length&&(this.elements[0]=e,this._sinkDown(0,this.elements.length>>1)),t}peek(){return this.elements[0]}isEmpty(){return this.size===0}clear(){this._elements=[]}refill(t){return this._elements=Array.from(t),this.fix()}has(t){for(let e of this.elements)if(this._equals(e,t))return!0;return!1}delete(t){let e=-1;for(let i=0;i<this.elements.length;i++)if(this._equals(this.elements[i],t)){e=i;break}return e<0?!1:(e===0?this.poll():e===this.elements.length-1?this.elements.pop():(this.elements.splice(e,1,this.elements.pop()),this._bubbleUp(e),this._sinkDown(e,this.elements.length>>1)),!0)}deleteBy(t){let e=-1;for(let i=0;i<this.elements.length;i++)if(t(this.elements[i],i,this)){e=i;break}return e<0?!1:(e===0?this.poll():e===this.elements.length-1?this.elements.pop():(this.elements.splice(e,1,this.elements.pop()),this._bubbleUp(e),this._sinkDown(e,this.elements.length>>1)),!0)}setEquality(t){return this._equals=t,this}dfs(t="PRE"){let e=[],i=u(s=>{let r=2*s+1,n=r+1;s<this.size&&(t==="IN"?(i(r),e.push(this.elements[s]),i(n)):t==="PRE"?(e.push(this.elements[s]),i(r),i(n)):t==="POST"&&(i(r),i(n),e.push(this.elements[s])))},"_dfs");return i(0),e}fix(){let t=[];for(let e=Math.floor(this.size/2)-1;e>=0;e--)t.push(this._sinkDown(e,this.elements.length>>1));return t}sort(){let t=[],e=this._createInstance();for(let i of this.elements)e.add(i);for(;!e.isEmpty();){let i=e.poll();i!==void 0&&t.push(i)}return t}clone(){let t=this._createInstance();for(let e of this.elements)t.add(e);return t}filter(t,e){let i=this._createInstance(),s=0;for(let r of this)(e===void 0?t(r,s++,this):t.call(e,r,s++,this))?i.add(r):s++;return i}map(t,e,i){let{comparator:s,toElementFn:r,...n}=e!=null?e:{};if(!s)throw new TypeError(N.comparatorRequired("Heap.map"));let h=this._createLike([],{...n,comparator:s,toElementFn:r}),o=0;for(let l of this){let a=i===void 0?t(l,o++,this):t.call(i,l,o++,this);h.add(a)}return h}mapSame(t,e){let i=this._createInstance(),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.add(n)}return i}get comparator(){return this._comparator}*_getIterator(){for(let t of this.elements)yield t}_bubbleUp(t){let e=this.elements[t];for(;t>0;){let i=t-1>>1,s=this.elements[i];if(this.comparator(s,e)<=0)break;this.elements[t]=s,t=i}return this.elements[t]=e,!0}_sinkDown(t,e){let i=this.elements[t];for(;t<e;){let s=t<<1|1,r=s+1,n=this.elements[s];if(r<this.elements.length&&this.comparator(n,this.elements[r])>0&&(s=r,n=this.elements[r]),this.comparator(n,i)>=0)break;this.elements[t]=n,t=s}return this.elements[t]=i,!0}_createInstance(t){let e=this.constructor;return new e([],{comparator:this.comparator,toElementFn:this.toElementFn,...t!=null?t:{}})}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}_spawnLike(t){return this._createLike([],t)}};u(Zt,"Heap");var ut=Zt,ee=class{constructor(t,e=0){f(this,"element"),f(this,"degree"),f(this,"left"),f(this,"right"),f(this,"child"),f(this,"parent"),f(this,"marked"),this.element=t,this.degree=e,this.marked=!1}};u(ee,"FibonacciHeapNode");var Ye=ee,Ze=class{constructor(t){if(f(this,"_root"),f(this,"_size",0),f(this,"_min"),f(this,"_comparator"),this.clear(),this._comparator=t||this._defaultComparator,typeof this.comparator!="function")throw new TypeError(N.notAFunction("comparator","FibonacciHeap"))}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(t){return this.push(t),!0}push(t){let e=this.createNode(t);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(t){let e=[];if(!t)return e;let i=t,s=!1;for(;!(i===t&&s);)i===t&&(s=!0),e.push(i),i=i.right;return e}mergeWithChild(t,e){t.child?(e.right=t.child.right,e.left=t.child,t.child.right.left=e,t.child.right=e):t.child=e}poll(){return this.pop()}pop(){if(this._size===0)return;let t=this.min;if(t.child){let e=this.consumeLinkedList(t.child);for(let i of e)this.mergeWithRoot(i),i.parent=void 0}return this.removeFromRoot(t),t===t.right?(this._min=void 0,this._root=void 0):(this._min=t.right,this._consolidate()),this._size--,t.element}merge(t){if(t.size!==0){if(this.root&&t.root){let e=this.root,i=t.root,s=e.right,r=i.left;e.right=i,i.left=e,s.left=r,r.right=s}else!this.root&&t.root&&(this._root=t.root);(!this.min||t.min&&this.comparator(t.min.element,this.min.element)<0)&&(this._min=t.min),this._size+=t.size,t.clear()}}createNode(t){return new Ye(t)}isEmpty(){return this._size===0}_defaultComparator(t,e){return t<e?-1:t>e?1:0}mergeWithRoot(t){this.root?(t.right=this.root.right,t.left=this.root,this.root.right.left=t,this.root.right=t):this._root=t}removeFromRoot(t){this.root===t&&(this._root=t.right),t.left&&(t.left.right=t.right),t.right&&(t.right.left=t.left)}_link(t,e){this.removeFromRoot(t),t.left=t,t.right=t,this.mergeWithChild(e,t),e.degree++,t.parent=e}_consolidate(){let t=new Array(this._size),e=this.consumeLinkedList(this.root),i,s,r,n;for(let h of e){for(i=h,r=i.degree;t[r];)s=t[r],this.comparator(i.element,s.element)>0&&(n=i,i=s,s=n),this._link(s,i),t[r]=void 0,r++;t[r]=i}for(let h=0;h<t.length;h++)t[h]&&(!this.min||this.comparator(t[h].element,this.min.element)<=0)&&(this._min=t[h])}};u(Ze,"FibonacciHeap");var ti=class extends ut{constructor(t=[],e){super(t,{comparator:u((i,s)=>{if(typeof i=="object"||typeof s=="object")throw new TypeError(N.comparatorRequired("MaxHeap"));return i<s?1:i>s?-1:0},"comparator"),...e})}};u(ti,"MaxHeap");var ei=class extends ut{constructor(t=[],e){super(t,e)}};u(ei,"MinHeap");var ie=class{constructor(t,e){f(this,"key"),f(this,"value"),this.key=t,this.value=e}};u(ie,"AbstractVertex");var D=ie,se=class{constructor(t,e){f(this,"value"),f(this,"weight"),f(this,"_hashCode"),this.weight=t!==void 0?t:1,this.value=e,this._hashCode=He()}get hashCode(){return this._hashCode}};u(se,"AbstractEdge");var kt=se,re=class extends et{constructor(t){super(),f(this,"_options",{defaultEdgeWeight:1}),f(this,"_vertexMap",new Map);let e=t==null?void 0:t.graph;this._options={defaultEdgeWeight:1,...e!=null?e:{}}}get options(){return this._options}get vertexMap(){return this._vertexMap}set vertexMap(t){this._vertexMap=t}get size(){return this._vertexMap.size}getVertex(t){return this._vertexMap.get(t)||void 0}hasVertex(t){return this._vertexMap.has(this._getVertexKey(t))}addVertex(t,e){if(t instanceof D)return this._addVertex(t);{let i=this.createVertex(t,e);return this._addVertex(i)}}isVertexKey(t){let e=typeof t;return e==="string"||e==="number"}removeManyVertices(t){let e=[];for(let i of t)e.push(this.deleteVertex(i));return e.length>0}hasEdge(t,e){return!!this.getEdge(t,e)}addEdge(t,e,i,s){if(t instanceof kt)return this._addEdge(t);if(e instanceof D||typeof e=="string"||typeof e=="number"){if(!(this.hasVertex(t)&&this.hasVertex(e)))return!1;t instanceof D&&(t=t.key),e instanceof D&&(e=e.key);let r=this.createEdge(t,e,i,s);return this._addEdge(r)}else throw new TypeError(N.invalidArgument("dest must be a Vertex or vertex key when srcOrEdge is an Edge.","Graph"))}setEdgeWeight(t,e,i){let s=this.getEdge(t,e);return s?(s.weight=i,!0):!1}getAllPathsBetween(t,e,i=1e3){let s=[],r=this._getVertex(t),n=this._getVertex(e);if(!(r&&n))return[];let h=[];for(h.push({vertex:r,path:[r]});h.length>0;){let{vertex:o,path:l}=h.pop();if(o===n&&(s.push(l),s.length>=i))return s;let a=this.getNeighbors(o);for(let _ of a)if(!l.includes(_)){let d=[...l,_];h.push({vertex:_,path:d})}}return s}getPathSumWeight(t){var e;let i=0;for(let s=0;s<t.length;s++)i+=((e=this.getEdge(t[s],t[s+1]))==null?void 0:e.weight)||0;return i}getMinCostBetween(t,e,i){if(i===void 0&&(i=!1),i){let s=this.getAllPathsBetween(t,e),r=Number.MAX_SAFE_INTEGER;for(let n of s)r=Math.min(this.getPathSumWeight(n),r);return r}else{let s=this._getVertex(e),r=this._getVertex(t);if(!(r&&s))return;let n=new Map,h=new tt([r]);n.set(r,!0);let o=0;for(;h.length>0;){for(let l=0,a=h.length;l<a;l++){let _=h.shift();if(_===s)return o;if(_!==void 0){let d=this.getNeighbors(_);for(let p of d)n.has(p)||(n.set(p,!0),h.push(p))}}o++}return}}getMinPathBetween(t,e,i,s=!1){var r,n;if(i===void 0&&(i=!1),i)if(s){let h=this.getAllPathsBetween(t,e,1e4),o=Number.MAX_SAFE_INTEGER,l=-1,a=0;for(let _ of h){let d=this.getPathSumWeight(_);d<o&&(o=d,l=a),a++}return h[l]||void 0}else return(n=(r=this.dijkstra(t,e,!0,!0))==null?void 0:r.minPath)!=null?n:[];else{let h=[],o=this._getVertex(t),l=this._getVertex(e);if(!(o&&l))return[];let a=u((_,d,p,m)=>{if(p.add(_),_===d){h=[o,...m];return}let x=this.getNeighbors(_);for(let M of x)p.has(M)||(m.push(M),a(M,d,p,m),m.pop());p.delete(_)},"dfs");return a(o,l,new Set,[]),h}}dijkstraWithoutHeap(t,e=void 0,i=!1,s=!1){let r=Number.MAX_SAFE_INTEGER,n,h=[],o=[],l=this._vertexMap,a=new Map,_=new Set,d=new Map,p=this._getVertex(t),m=e?this._getVertex(e):void 0;if(!p)return;for(let y of l){let w=y[1];w instanceof D&&a.set(w,Number.MAX_SAFE_INTEGER)}a.set(p,0),d.set(p,void 0);let x=u(()=>{let y=Number.MAX_SAFE_INTEGER,w;for(let[k,v]of a)_.has(k)||v<y&&(y=v,w=k);return w},"getMinOfNoSeen"),M=u(y=>{for(let w of l){let k=w[1];if(k instanceof D){let v=[k],b=d.get(k);for(;b;)v.push(b),b=d.get(b);let E=v.reverse();w[1]===y&&(h=E),o.push(E)}}},"getPaths");for(let y=1;y<l.size;y++){let w=x();if(w){if(_.add(w),m&&m===w)return i&&(r=a.get(m)||Number.MAX_SAFE_INTEGER),s&&M(m),{distMap:a,preMap:d,seen:_,paths:o,minDist:r,minPath:h};let k=this.getNeighbors(w);for(let v of k)if(!_.has(v)){let b=this.getEdge(w,v);if(b){let E=a.get(w),R=a.get(v);E!==void 0&&R!==void 0&&b.weight+E<R&&(a.set(v,b.weight+E),d.set(v,w))}}}}return i&&a.forEach((y,w)=>{w!==p&&y<r&&(r=y,s&&(n=w))}),s&&M(n),{distMap:a,preMap:d,seen:_,paths:o,minDist:r,minPath:h}}dijkstra(t,e=void 0,i=!1,s=!1){var r;let n=Number.MAX_SAFE_INTEGER,h,o=[],l=[],a=this._vertexMap,_=new Map,d=new Set,p=new Map,m=this._getVertex(t),x=e?this._getVertex(e):void 0;if(!m)return;for(let w of a){let k=w[1];k instanceof D&&_.set(k,Number.MAX_SAFE_INTEGER)}let M=new ut([],{comparator:u((w,k)=>w.key-k.key,"comparator")});M.add({key:0,value:m}),_.set(m,0),p.set(m,void 0);let y=u(w=>{for(let k of a){let v=k[1];if(v instanceof D){let b=[v],E=p.get(v);for(;E;)b.push(E),E=p.get(E);let R=b.reverse();k[1]===w&&(o=R),l.push(R)}}},"getPaths");for(;M.size>0;){let w=M.poll(),k=w==null?void 0:w.key,v=w==null?void 0:w.value;if(k!==void 0&&v){if(d.add(v),x&&x===v)return i&&(n=_.get(x)||Number.MAX_SAFE_INTEGER),s&&y(x),{distMap:_,preMap:p,seen:d,paths:l,minDist:n,minPath:o};let b=this.getNeighbors(v);for(let E of b)if(!d.has(E)){let R=(r=this.getEdge(v,E))==null?void 0:r.weight;if(typeof R=="number"){let S=_.get(E);S!==void 0&&k+R<S&&(M.add({key:k+R,value:E}),p.set(E,v),_.set(E,k+R))}}}}return i&&_.forEach((w,k)=>{k!==m&&w<n&&(n=w,s&&(h=k))}),s&&y(h),{distMap:_,preMap:p,seen:d,paths:l,minDist:n,minPath:o}}bellmanFord(t,e,i,s){i===void 0&&(i=!1),s===void 0&&(s=!1);let r=this._getVertex(t),n=[],h=new Map,o=new Map,l=Number.MAX_SAFE_INTEGER,a=[],_;if(e&&(_=!1),!r)return{hasNegativeCycle:_,distMap:h,preMap:o,paths:n,min:l,minPath:a};let d=this._vertexMap,p=d.size,m=this.edgeSet(),x=m.length;this._vertexMap.forEach(y=>{h.set(y,Number.MAX_SAFE_INTEGER)}),h.set(r,0);for(let y=1;y<p;++y)for(let w=0;w<x;++w){let k=this.getEndsOfEdge(m[w]);if(k){let[v,b]=k,E=m[w].weight,R=h.get(v),S=h.get(b);R!==void 0&&S!==void 0&&h.get(v)!==Number.MAX_SAFE_INTEGER&&R+E<S&&(h.set(b,R+E),s&&o.set(b,v))}}let M;if(i&&h.forEach((y,w)=>{w!==r&&y<l&&(l=y,s&&(M=w))}),s)for(let y of d){let w=y[1];if(w instanceof D){let k=[w],v=o.get(w);for(;v!==void 0;)k.push(v),v=o.get(v);let b=k.reverse();y[1]===M&&(a=b),n.push(b)}}for(let y=0;y<x;++y){let w=this.getEndsOfEdge(m[y]);if(w){let[k]=w,v=m[y].weight,b=h.get(k);b&&b!==Number.MAX_SAFE_INTEGER&&b+v<b&&(_=!0)}}return{hasNegativeCycle:_,distMap:h,preMap:o,paths:n,min:l,minPath:a}}floydWarshall(){var t;let e=[...this._vertexMap],i=e.length,s=[],r=[];for(let n=0;n<i;n++){s[n]=[],r[n]=[];for(let h=0;h<i;h++)r[n][h]=void 0}for(let n=0;n<i;n++)for(let h=0;h<i;h++)s[n][h]=((t=this.getEdge(e[n][1],e[h][1]))==null?void 0:t.weight)||Number.MAX_SAFE_INTEGER;for(let n=0;n<i;n++)for(let h=0;h<i;h++)for(let o=0;o<i;o++)s[h][o]>s[h][n]+s[n][o]&&(s[h][o]=s[h][n]+s[n][o],r[h][o]=e[n][1]);return{costs:s,predecessor:r}}getCycles(t=!1){let e=[],i=new Set,s=u((n,h,o)=>{if(o.has(n)){(!t&&h.length>2||t&&h.length>=2)&&h[0]===n.key&&e.push([...h]);return}o.add(n),h.push(n.key);for(let l of this.getNeighbors(n))l&&s(l,h,o);o.delete(n),h.pop()},"dfs");for(let n of this.vertexMap.values())s(n,[],i);let r=new Map;for(let n of e){let h=[...n].sort().toString();r.has(h)||r.set(h,n)}return[...r].map(n=>n[1])}filter(t,e){let i=[],s=0;for(let[r,n]of this)t.call(e,n,r,s,this)&&i.push([r,n]),s++;return this._createLike(i,this._snapshotOptions())}filterEntries(t,e){let i=[],s=0;for(let[r,n]of this)t.call(e,n,r,s,this)&&i.push([r,n]),s++;return i}map(t,e){let i=[],s=0;for(let[r,n]of this)i.push(t.call(e,n,r,s,this)),s++;return i}clone(){return this._createLike(void 0,this._snapshotOptions())}*_getIterator(){for(let t of this._vertexMap.values())yield[t.key,t.value]}_snapshotOptions(){return{graph:{...this._options}}}_createInstance(t){let e=this.constructor,i=new e,s=t==null?void 0:t.graph;return s?i._options={...i._options,...s}:i._options={...i._options,...this._options},i}_createLike(t,e){let i=this._createInstance(e);if(t)for(let[r,n]of t)i.addVertex(r,n);else for(let[r,n]of this)i.addVertex(r,n);let s=this.edgeSet();for(let r of s){let n=this.getEndsOfEdge(r);if(!n)continue;let[h,o]=n,l=h.key,a=o.key,_=typeof i.hasVertex=="function"?i.hasVertex(l):!1,d=typeof i.hasVertex=="function"?i.hasVertex(a):!1;if(_&&d){let p=i.createEdge(l,a,r.weight,r.value);i._addEdge(p)}}return i}_addVertex(t){return this.hasVertex(t)?!1:(this._vertexMap.set(t.key,t),!0)}_getVertex(t){let e=this._getVertexKey(t);return this._vertexMap.get(e)||void 0}_getVertexKey(t){return t instanceof D?t.key:t}get _edgeConnector(){return"--"}toVisual(t){var e;let i=(e=t==null?void 0:t.showWeight)!=null?e:!0,s=[...this._vertexMap.values()],r=s.length,n=this.edgeSet().length,h=[`Graph (${r} vertices, ${n} edges):`];for(let o of s){let l=this.getNeighbors(o);if(l.length===0)h.push(` ${o.key} (isolated)`);else{let a=l.map(_=>{let d=this.getEdge(o,_);return d&&i&&d.weight!==void 0&&d.weight!==1?`${_.key} (${d.weight})`:`${_.key}`});h.push(` ${o.key} ${this._edgeConnector} ${a.join(", ")}`)}}return h.join(`
|
|
1
|
+
"use strict";var treeMultimapTyped=(()=>{var _t=Object.defineProperty;var Ae=Object.getOwnPropertyDescriptor;var Be=Object.getOwnPropertyNames;var De=Object.prototype.hasOwnProperty;var ze=(c,t)=>{for(var e in t)_t(c,e,{get:t[e],enumerable:!0})},Ve=(c,t,e,i)=>{if(t&&typeof t=="object"||typeof t=="function")for(let s of Be(t))!De.call(c,s)&&s!==e&&_t(c,s,{get:()=>t[s],enumerable:!(i=Ae(t,s))||i.enumerable});return c};var Ke=c=>Ve(_t({},"__esModule",{value:!0}),c);var bi={};ze(bi,{TreeMultiMap:()=>Le});var Tt=Object.defineProperty,St=c=>{throw TypeError(c)},je=(c,t,e)=>t in c?Tt(c,t,{enumerable:!0,configurable:!0,writable:!0,value:e}):c[t]=e,u=(c,t)=>Tt(c,"name",{value:t,configurable:!0}),f=(c,t,e)=>je(c,typeof t!="symbol"?t+"":t,e),Ct=(c,t,e)=>t.has(c)||St("Cannot "+e),g=(c,t,e)=>(Ct(c,t,"read from private field"),e?e.call(c):t.get(c)),z=(c,t,e)=>t.has(c)?St("Cannot add the same private member more than once"):t instanceof WeakSet?t.add(c):t.set(c,e),V=(c,t,e,i)=>(Ct(c,t,"write to private field"),t.set(c,e),e),At=class{*[Symbol.iterator](...t){yield*this._getIterator(...t)}*entries(){for(let t of this)yield t}*keys(){for(let t of this)yield t[0]}*values(){for(let t of this)yield t[1]}every(t,e){let i=0;for(let s of this)if(!t.call(e,s[1],s[0],i++,this))return!1;return!0}some(t,e){let i=0;for(let s of this)if(t.call(e,s[1],s[0],i++,this))return!0;return!1}forEach(t,e){let i=0;for(let s of this){let[r,n]=s;t.call(e,n,r,i++,this)}}find(t,e){let i=0;for(let s of this){let[r,n]=s;if(t.call(e,n,r,i++,this))return s}}has(t){for(let e of this){let[i]=e;if(i===t)return!0}return!1}hasValue(t){for(let[,e]of this)if(e===t)return!0;return!1}get(t){for(let e of this){let[i,s]=e;if(i===t)return s}}reduce(t,e){let i=e,s=0;for(let r of this){let[n,h]=r;i=t(i,h,n,s++,this)}return i}toArray(){return[...this]}toVisual(){return[...this]}print(){console.log(this.toVisual())}};u(At,"IterableEntryBase");var et=At,Bt=class{constructor(t){if(f(this,"_toElementFn"),t){let{toElementFn:e}=t;if(typeof e=="function")this._toElementFn=e;else if(e)throw new TypeError("toElementFn must be a function type")}}get toElementFn(){return this._toElementFn}*[Symbol.iterator](...t){yield*this._getIterator(...t)}*values(){for(let t of this)yield t}every(t,e){let i=0;for(let s of this)if(e===void 0){if(!t(s,i++,this))return!1}else if(!t.call(e,s,i++,this))return!1;return!0}some(t,e){let i=0;for(let s of this)if(e===void 0){if(t(s,i++,this))return!0}else if(t.call(e,s,i++,this))return!0;return!1}forEach(t,e){let i=0;for(let s of this)e===void 0?t(s,i++,this):t.call(e,s,i++,this)}find(t,e){let i=0;for(let s of this)if(e===void 0){if(t(s,i++,this))return s}else if(t.call(e,s,i++,this))return s}has(t){for(let e of this)if(e===t)return!0;return!1}reduce(t,e){let i=0,s=this[Symbol.iterator](),r;if(arguments.length>=2)r=e;else{let n=s.next();if(n.done)throw new TypeError("Reduce of empty structure with no initial value");r=n.value,i=1}for(let n of s)r=t(r,n,i++,this);return r}toArray(){return[...this]}toVisual(){return[...this]}print(){console.log(this.toVisual())}};u(Bt,"IterableElementBase");var at=Bt,Dt=class{constructor(t){f(this,"_value"),f(this,"_next"),this._value=t,this._next=void 0}get value(){return this._value}set value(t){this._value=t}get next(){return this._next}set next(t){this._next=t}};u(Dt,"LinkedListNode");var zt=Dt,Vt=class Kt extends at{constructor(t){if(super(t),f(this,"_maxLen",-1),t){let{maxLen:e}=t;typeof e=="number"&&e>0&&e%1===0&&(this._maxLen=e)}}get maxLen(){return this._maxLen}indexOf(t,e=0){if(this.length===0)return-1;e<0&&(e=this.length+e),e<0&&(e=0);for(let i=e;i<this.length;i++)if(this.at(i)===t)return i;return-1}lastIndexOf(t,e=this.length-1){if(this.length===0)return-1;e>=this.length&&(e=this.length-1),e<0&&(e=this.length+e);for(let i=e;i>=0;i--)if(this.at(i)===t)return i;return-1}findIndex(t,e){for(let i=0;i<this.length;i++){let s=this.at(i);if(s!==void 0&&t.call(e,s,i,this))return i}return-1}concat(...t){let e=this.clone();for(let i of t)i instanceof Kt?e.pushMany(i):e.push(i);return e}sort(t){let e=this.toArray();e.sort(t),this.clear();for(let i of e)this.push(i);return this}splice(t,e=0,...i){let s=this._createInstance();t=t<0?this.length+t:t,t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,Math.min(e,this.length-t));for(let r=0;r<e;r++){let n=this.deleteAt(t);n!==void 0&&s.push(n)}for(let r=0;r<i.length;r++)this.addAt(t+r,i[r]);return s}join(t=","){return this.toArray().join(t)}toReversedArray(){let t=[];for(let e=this.length-1;e>=0;e--)t.push(this.at(e));return t}reduceRight(t,e){let i=e!=null?e:0;for(let s=this.length-1;s>=0;s--)i=t(i,this.at(s),s,this);return i}slice(t=0,e=this.length){t=t<0?this.length+t:t,e=e<0?this.length+e:e;let i=this._createInstance();for(let s=t;s<e;s++)i.push(this.at(s));return i}fill(t,e=0,i=this.length){if(e=e<0?this.length+e:e,i=i<0?this.length+i:i,e<0&&(e=0),i>this.length&&(i=this.length),e>=i)return this;for(let s=e;s<i;s++)this.setAt(s,t);return this}};u(Vt,"LinearBase");var ot=Vt,jt=class extends ot{constructor(t){if(super(t),t){let{maxLen:e}=t;typeof e=="number"&&e>0&&e%1===0&&(this._maxLen=e)}}indexOf(t,e=0){let i=this._getIterator(),s=i.next(),r=0;for(;r<e;)s=i.next(),r++;for(;!s.done;){if(s.value===t)return r;s=i.next(),r++}return-1}lastIndexOf(t,e=this.length-1){let i=this._getReverseIterator(),s=i.next(),r=this.length-1;for(;r>e;)s=i.next(),r--;for(;!s.done;){if(s.value===t)return r;s=i.next(),r--}return-1}concat(...t){let e=this.clone();for(let i of t)i instanceof ot?e.pushMany(i):e.push(i);return e}slice(t=0,e=this.length){t=t<0?this.length+t:t,e=e<0?this.length+e:e;let i=this._createInstance(),s=this._getIterator(),r=s.next(),n=0;for(;n<t;)r=s.next(),n++;for(let h=t;h<e;h++)i.push(r.value),r=s.next();return i}splice(t,e=0,...i){let s=this._createInstance();t=t<0?this.length+t:t,t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,e);let r=0,n,h,o=this._getNodeIterator();for(let l of o){if(r===t){n=l;break}h=l,r++}for(let l=0;l<e&&n;l++){s.push(n.value);let a=n.next;this.delete(n),n=a}for(let l=0;l<i.length;l++)h?(this.addAfter(h,i[l]),h=h.next):(this.addAt(0,i[l]),h=this._getNodeIterator().next().value);return s}reduceRight(t,e){let i=e!=null?e:0,s=this.length-1;for(let r of this._getReverseIterator())i=t(i,r,s--,this);return i}};u(jt,"LinearLinkedBase");var Ht=jt,He=u(function(){return"xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx".replace(/[x]/g,function(c){let t=Math.random()*16|0;return(c=="x"?t:t&3|8).toString(16)})},"uuidV4"),U=u(function(c,t){let e=-1,i=c?c.length:0,s=[];for(;++e<i;){let r=c[e];t(r,e,c)&&(s.push(r),Array.prototype.splice.call(c,e--,1),i--)}return s},"arrayRemove");var q=u((c,t,e,i)=>{if(c<t||c>e)throw new RangeError(i!=null?i:`Index ${c} is out of range [${t}, ${e}].`)},"rangeCheck");var j=u(c=>{let t=typeof c;return t==="object"&&c!==null||t==="function"},"isWeakKey"),Et=u((c,t)=>Math.floor((c+t-1)/t),"calcMinUnitsRequired");function lt(c){let t=typeof c;return t==="number"?!0:t==="bigint"||t==="string"||t==="boolean"}u(lt,"isPrimitiveComparable");function xt(c){if(typeof c.valueOf=="function"){let t=c.valueOf();if(t!==c){if(lt(t))return t;if(typeof t=="object"&&t!==null)return xt(t)}}if(typeof c.toString=="function"){let t=c.toString();if(t!=="[object Object]")return t}return null}u(xt,"tryObjectToPrimitive");function Z(c,t=!1){if(c==null)return!1;if(lt(c))return!0;if(typeof c!="object")return!1;if(c instanceof Date||t)return!0;let e=xt(c);return e==null?!1:lt(e)}u(Z,"isComparable");var Lt=u(c=>({isThunk:!0,fn:c}),"makeTrampolineThunk"),Ut=u(c=>typeof c=="object"&&c!==null&&"isThunk"in c&&c.isThunk,"isTrampolineThunk");function qt(c){let t=c;for(;Ut(t);)t=t.fn();return t}u(qt,"trampoline");function mt(c){return(...t)=>qt(c(...t))}u(mt,"makeTrampoline");async function Gt(c){let t=await c;for(;Ut(t);)t=await t.fn();return t}u(Gt,"asyncTrampoline");function Ue(c){return async(...t)=>Gt(c(...t))}u(Ue,"makeAsyncTrampoline");function qe(c,t=32){let e=(c>>>0).toString(2);return e=e.padStart(t,"0"),e}u(qe,"toBinaryString");var N={indexOutOfRange:u((c,t,e,i)=>`${i?i+": ":""}Index ${c} is out of range [${t}, ${e}].`,"indexOutOfRange"),invalidIndex:u(c=>`${c?c+": ":""}Index must be an integer.`,"invalidIndex"),invalidArgument:u((c,t)=>`${t?t+": ":""}${c}`,"invalidArgument"),comparatorRequired:u(c=>`${c?c+": ":""}Comparator is required for non-number/non-string/non-Date keys.`,"comparatorRequired"),invalidKey:u((c,t)=>`${t?t+": ":""}${c}`,"invalidKey"),notAFunction:u((c,t)=>`${t?t+": ":""}${c} must be a function.`,"notAFunction"),invalidEntry:u(c=>`${c?c+": ":""}Each entry must be a [key, value] tuple.`,"invalidEntry"),invalidNaN:u(c=>`${c?c+": ":""}NaN is not a valid key.`,"invalidNaN"),invalidDate:u(c=>`${c?c+": ":""}Invalid Date key.`,"invalidDate"),reduceEmpty:u(c=>`${c?c+": ":""}Reduce of empty structure with no initial value.`,"reduceEmpty"),callbackReturnType:u((c,t,e)=>`${e?e+": ":""}Callback must return ${c}; got ${t}.`,"callbackReturnType"),invalidOperation:u((c,t)=>`${t?t+": ":""}${c}`,"invalidOperation"),matrixDimensionMismatch:u(c=>`Matrix: Dimensions must be compatible for ${c}.`,"matrixDimensionMismatch"),matrixSingular:u(()=>"Matrix: Singular matrix, inverse does not exist.","matrixSingular"),matrixNotSquare:u(()=>"Matrix: Must be square for inversion.","matrixNotSquare"),matrixNotRectangular:u(()=>"Matrix: Must be rectangular for transposition.","matrixNotRectangular"),matrixRowMismatch:u((c,t)=>`Matrix: Expected row length ${c}, but got ${t}.`,"matrixRowMismatch")};var Wt=class{constructor(t,e,i=!0,s=!0){this.low=t,this.high=e,this.includeLow=i,this.includeHigh=s}isInRange(t,e){let i=this.includeLow?e(t,this.low)>=0:e(t,this.low)>0,s=this.includeHigh?e(t,this.high)<=0:e(t,this.high)<0;return i&&s}};u(Wt,"Range");var it=Wt,Ge=class extends et{constructor(t=[],e){if(super(),f(this,"_store",{}),f(this,"_objMap",new Map),f(this,"_toEntryFn"),f(this,"_size",0),f(this,"_hashFn",u(i=>String(i),"_hashFn")),e){let{hashFn:i,toEntryFn:s}=e;i&&(this._hashFn=i),s&&(this._toEntryFn=s)}t&&this.setMany(t)}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}isEmpty(){return this._size===0}clear(){this._store={},this._objMap.clear(),this._size=0}isEntry(t){return Array.isArray(t)&&t.length===2}set(t,e){if(this._isObjKey(t))this.objMap.has(t)||this._size++,this.objMap.set(t,e);else{let i=this._getNoObjKey(t);this.store[i]===void 0&&this._size++,this._store[i]={key:t,value:e}}return!0}setMany(t){let e=[];for(let i of t){let s,r;this.isEntry(i)?[s,r]=i:this._toEntryFn&&([s,r]=this._toEntryFn(i)),s!==void 0&&r!==void 0&&e.push(this.set(s,r))}return e}get(t){var e;if(this._isObjKey(t))return this.objMap.get(t);let i=this._getNoObjKey(t);return(e=this._store[i])==null?void 0:e.value}has(t){return this._isObjKey(t)?this.objMap.has(t):this._getNoObjKey(t)in this.store}delete(t){if(this._isObjKey(t))return this.objMap.has(t)&&this._size--,this.objMap.delete(t);let e=this._getNoObjKey(t);return e in this.store?(delete this.store[e],this._size--,!0):!1}setHashFn(t){return this._hashFn===t?this:(this._hashFn=t,this._rehashNoObj(),this)}clone(){let t={hashFn:this._hashFn,toEntryFn:this._toEntryFn};return this._createLike(this,t)}map(t,e){let i=this._createLike(),s=0;for(let[r,n]of this)i.set(r,t.call(e,n,r,s++,this));return i}filter(t,e){let i=this._createLike(),s=0;for(let[r,n]of this)t.call(e,n,r,s++,this)&&i.set(r,n);return i}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}_rehashNoObj(){let t={};for(let{key:e,value:i}of Object.values(this._store)){let s=this._getNoObjKey(e);t[s]={key:e,value:i}}this._store=t}*_getIterator(){for(let t of Object.values(this.store))yield[t.key,t.value];for(let t of this.objMap)yield t}_isObjKey(t){let e=typeof t;return(e==="object"||e==="function")&&t!==null}_getNoObjKey(t){let e=typeof t,i;return e!=="string"&&e!=="number"&&e!=="symbol"?i=this._hashFn(t):i=t,i}};u(Ge,"HashMap");var We=class extends et{constructor(t=[],e){if(super(),f(this,"_sentinel"),f(this,"_hashFn",u(i=>String(i),"_hashFn")),f(this,"_objHashFn",u(i=>i,"_objHashFn")),f(this,"_noObjMap",{}),f(this,"_objMap",new WeakMap),f(this,"_head"),f(this,"_tail"),f(this,"_toEntryFn",u(i=>{if(this.isEntry(i))return i;throw new TypeError(N.invalidArgument("If elements do not adhere to [key, value], provide options.toEntryFn to transform raw records.","HashMap"))},"_toEntryFn")),f(this,"_size",0),this._sentinel={},this._sentinel.prev=this._sentinel.next=this._head=this._tail=this._sentinel,e){let{hashFn:i,objHashFn:s,toEntryFn:r}=e;i&&(this._hashFn=i),s&&(this._objHashFn=s),r&&(this._toEntryFn=r)}t&&this.setMany(t)}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 t=this.head;for(;t!==this._sentinel;)yield[t.key,t.value],t=t.next}*reverseBegin(){let t=this.tail;for(;t!==this._sentinel;)yield[t.key,t.value],t=t.prev}set(t,e){let i,s=!this.has(t);if(j(t)){let r=this._objHashFn(t);i=this.objMap.get(r),!i&&s?(i={key:r,value:e,prev:this.tail,next:this._sentinel},this.objMap.set(r,i)):i&&(i.value=e)}else{let r=this._hashFn(t);i=this.noObjMap[r],!i&&s?this.noObjMap[r]=i={key:t,value:e,prev:this.tail,next:this._sentinel}:i&&(i.value=e)}return i&&s&&(this._size===0?(this._head=i,this._sentinel.next=i):(this.tail.next=i,i.prev=this.tail),this._tail=i,this._sentinel.prev=i,this._size++),!0}setMany(t){let e=[];for(let i of t){let s,r;this.isEntry(i)?[s,r]=i:this._toEntryFn&&([s,r]=this._toEntryFn(i)),s!==void 0&&r!==void 0&&e.push(this.set(s,r))}return e}has(t){if(j(t)){let i=this._objHashFn(t);return this.objMap.has(i)}return this._hashFn(t)in this.noObjMap}get(t){if(j(t)){let s=this._objHashFn(t),r=this.objMap.get(s);return r?r.value:void 0}let e=this._hashFn(t),i=this.noObjMap[e];return i?i.value:void 0}at(t){q(t,0,this._size-1);let e=this.head;for(;t--;)e=e.next;return e.value}delete(t){let e;if(j(t)){let i=this._objHashFn(t);if(e=this.objMap.get(i),!e)return!1;this.objMap.delete(i)}else{let i=this._hashFn(t);if(e=this.noObjMap[i],!e)return!1;delete this.noObjMap[i]}return this._deleteNode(e)}deleteWhere(t){let e=this._head,i=0;for(;e!==this._sentinel;){let s=e;if(e=e.next,t(s.key,s.value,i++,this)){let r=s.key;if(j(r))this._objMap.delete(r);else{let n=this._hashFn(s.key);delete this._noObjMap[n]}return this._deleteNode(s)}}return!1}deleteAt(t){q(t,0,this._size-1);let e=this.head;for(;t--;)e=e.next;return this._deleteNode(e)}isEmpty(){return this._size===0}isEntry(t){return Array.isArray(t)&&t.length===2}clear(){this._noObjMap={},this._size=0,this._head=this._tail=this._sentinel.prev=this._sentinel.next=this._sentinel}clone(){let t={hashFn:this._hashFn,objHashFn:this._objHashFn};return this._createLike(this,t)}filter(t,e){let i=this._createLike(),s=0;for(let[r,n]of this)t.call(e,n,r,s,this)&&i.set(r,n),s++;return i}map(t,e){let i=this._createLike(),s=0;for(let[r,n]of this){let[h,o]=t.call(e,n,r,s,this);i.set(h,o),s++}return i}*_getIterator(){let t=this.head;for(;t!==this._sentinel;)yield[t.key,t.value],t=t.next}_deleteNode(t){let e=t.key;if(j(e))this._objMap.delete(e);else{let r=this._hashFn(e);delete this._noObjMap[r]}let{prev:i,next:s}=t;return i.next=s,s.prev=i,t===this.head&&(this._head=s),t===this.tail&&(this._tail=i),this._size-=1,!0}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}};u(We,"LinkedHashMap");var $t=class extends zt{constructor(t){super(t),f(this,"_next"),this._value=t,this._next=void 0}get next(){return this._next}set next(t){this._next=t}};u($t,"SinglyLinkedListNode");var wt=$t,Pt=class extends Ht{constructor(t=[],e){super(e),f(this,"_equals",u((i,s)=>Object.is(i,s),"_equals")),f(this,"_head"),f(this,"_tail"),f(this,"_length",0),this.pushMany(t)}get head(){return this._head}get tail(){return this._tail}get length(){return this._length}get first(){var t;return(t=this.head)==null?void 0:t.value}get last(){var t;return(t=this.tail)==null?void 0:t.value}static from(t,e){let i=new this([],e);for(let s of t)i.push(s);return i}push(t){let e=this._ensureNode(t);return this.head?(this.tail.next=e,this._tail=e):this._head=this._tail=e,this._length++,this._maxLen>0&&this.length>this._maxLen&&this.shift(),!0}pop(){var t;if(!this.head)return;if(this.head===this.tail){let s=this.head.value;return this._head=void 0,this._tail=void 0,this._length--,s}let e=this.head;for(;e.next&&e.next!==this.tail;)e=e.next;let i=(t=this.tail)==null?void 0:t.value;return e.next=void 0,this._tail=e,this._length--,i}shift(){if(!this.head)return;let t=this.head;return this._head=this.head.next,this._head||(this._tail=void 0),this._length--,t.value}unshift(t){let e=this._ensureNode(t);return this.head?(e.next=this.head,this._head=e):this._head=this._tail=e,this._length++,!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}unshiftMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.unshift(this.toElementFn(i))):e.push(this.unshift(i));return e}search(t){let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i.value;i=i.next}}at(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e==null?void 0:e.value}isNode(t){return t instanceof wt}getNodeAt(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e}deleteAt(t){if(t<0||t>=this._length)return;if(t===0)return this.shift();let e=this.getNodeAt(t),i=this._getPrevNode(e),s=e.value;return i.next=e.next,e===this.tail&&(this._tail=i),this._length--,s}delete(t){if(t===void 0||!this.head)return!1;let e=this.isNode(t)?t:this.getNode(t);if(!e)return!1;let i=this._getPrevNode(e);return i?(i.next=e.next,e===this.tail&&(this._tail=i)):(this._head=e.next,e===this.tail&&(this._tail=void 0)),this._length--,!0}addAt(t,e){if(t<0||t>this._length)return!1;if(t===0)return this.unshift(e);if(t===this._length)return this.push(e);let i=this._ensureNode(e),s=this.getNodeAt(t-1);return i.next=s.next,s.next=i,this._length++,!0}setAt(t,e){let i=this.getNodeAt(t);return i?(i.value=e,!0):!1}isEmpty(){return this._length===0}clear(){this._head=void 0,this._tail=void 0,this._length=0}reverse(){if(!this.head||this.head===this.tail)return this;let t,e=this.head,i;for(;e;)i=e.next,e.next=t,t=e,e=i;return[this._head,this._tail]=[this.tail,this.head],this}getNode(t){if(t===void 0)return;if(this.isNode(t))return t;let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i;i=i.next}}addBefore(t,e){let i=this.getNode(t);if(!i)return!1;let s=this._getPrevNode(i),r=this._ensureNode(e);return s?(s.next=r,r.next=i,this._length++):(r.next=this._head,this._head=r,this._tail||(this._tail=r),this._length++),!0}addAfter(t,e){let i=this.getNode(t);if(!i)return!1;let s=this._ensureNode(e);return s.next=i.next,i.next=s,i===this.tail&&(this._tail=s),this._length++,!0}splice(t,e=0,...i){t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,e);let s=this._createInstance(),r=t===0?void 0:this.getNodeAt(t-1),n=r?r.next:this.head,h=0;for(;h<e&&n;)s.push(n.value),n=n.next,h++;let o=n;if(r?r.next=o:this._head=o,o||(this._tail=r),i.length>0){let l,a;for(let _ of i){let d=this._ensureNode(_);l||(l=d),a&&(a.next=d),a=d}r?r.next=l:this._head=l,a.next=o,o||(this._tail=a)}return this._length+=i.length-h,this._length===0&&(this._head=void 0,this._tail=void 0),s}countOccurrences(t){let e=Qt(t,this._equals),i=0,s=this.head;for(;s;)e(s)&&i++,s=s.next;return i}setEquality(t){return this._equals=t,this}deleteWhere(t){let e,i=this.head,s=0;for(;i;){if(t(i.value,s++,this))return e?(e.next=i.next,i===this._tail&&(this._tail=e)):(this._head=i.next,i===this._tail&&(this._tail=void 0)),this._length--,!0;e=i,i=i.next}return!1}clone(){let t=this._createInstance();for(let e of this)t.push(e);return t}filter(t,e){let i=this._createInstance(),s=0;for(let r of this)t.call(e,r,s++,this)&&i.push(r);return i}mapSame(t,e){let i=this._createInstance(),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{},maxLen:this._maxLen}),r=0;for(let n of this)s.push(t.call(i,n,r++,this));return s}createNode(t){return new wt(t)}_isPredicate(t){return typeof t=="function"}_ensureNode(t){return this.isNode(t)?t:this.createNode(t)}_ensurePredicate(t){if(this.isNode(t))return i=>i===t;if(this._isPredicate(t))return t;let e=t;return i=>this._equals(i.value,e)}_getPrevNode(t){if(!this.head||this.head===t)return;let e=this.head;for(;e.next&&e.next!==t;)e=e.next;return e.next===t?e:void 0}*_getIterator(){let t=this.head;for(;t;)yield t.value,t=t.next}*_getReverseIterator(){let t=[...this].reverse();for(let e of t)yield e}*_getNodeIterator(){let t=this.head;for(;t;)yield t,t=t.next}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}_spawnLike(t){return this._createLike([],t)}};u(Pt,"SinglyLinkedList");var $e=Pt;function Qt(c,t){if(c instanceof wt)return i=>i===c;if(typeof c=="function")return c;let e=c;return i=>t(i.value,e)}u(Qt,"elementOrPredicate");var Ot=class extends zt{constructor(t){super(t),f(this,"_next"),f(this,"_prev"),this._value=t,this._next=void 0,this._prev=void 0}get next(){return this._next}set next(t){this._next=t}get prev(){return this._prev}set prev(t){this._prev=t}};u(Ot,"DoublyLinkedListNode");var Rt=Ot,Pe=class extends Ht{constructor(t=[],e){super(e),f(this,"_equals",u((i,s)=>Object.is(i,s),"_equals")),f(this,"_head"),f(this,"_tail"),f(this,"_length",0),this._head=void 0,this._tail=void 0,this._length=0,e!=null&&e.maxLen&&Number.isInteger(e.maxLen)&&e.maxLen>0&&(this._maxLen=e.maxLen),this.pushMany(t)}get head(){return this._head}get tail(){return this._tail}get length(){return this._length}get first(){var t;return(t=this.head)==null?void 0:t.value}get last(){var t;return(t=this.tail)==null?void 0:t.value}static fromArray(t){return new this(t)}isNode(t){return t instanceof Rt}push(t){let e=this._ensureNode(t);return this.head?(e.prev=this.tail,this.tail.next=e,this._tail=e):(this._head=e,this._tail=e),this._length++,this._maxLen>0&&this.length>this._maxLen&&this.shift(),!0}pop(){if(!this.tail)return;let t=this.tail;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._tail=t.prev,this.tail.next=void 0),this._length--,t.value}shift(){if(!this.head)return;let t=this.head;return this.head===this.tail?(this._head=void 0,this._tail=void 0):(this._head=t.next,this.head.prev=void 0),this._length--,t.value}unshift(t){let e=this._ensureNode(t);return this.head?(e.next=this.head,this.head.prev=e,this._head=e):(this._head=e,this._tail=e),this._length++,this._maxLen>0&&this._length>this._maxLen&&this.pop(),!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}unshiftMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.unshift(this.toElementFn(i))):e.push(this.unshift(i));return e}at(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e==null?void 0:e.value}getNodeAt(t){if(t<0||t>=this._length)return;let e=this.head;for(let i=0;i<t&&e;i++)e=e.next;return e}getNode(t){if(t===void 0)return;if(this.isNode(t)){let s=t,r=this.head;for(;r;){if(r===s)return s;r=r.next}let n=u(h=>this._equals(h.value,s.value),"isMatch");for(r=this.head;r;){if(n(r))return r;r=r.next}return}let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i;i=i.next}}addAt(t,e){if(t<0||t>this._length)return!1;if(t===0)return this.unshift(e);if(t===this._length)return this.push(e);let i=this._ensureNode(e),s=this.getNodeAt(t-1),r=s.next;return i.prev=s,i.next=r,s.next=i,r.prev=i,this._length++,!0}addBefore(t,e){let i=this.isNode(t)?t:this.getNode(t);if(!i)return!1;let s=this._ensureNode(e);return s.prev=i.prev,i.prev&&(i.prev.next=s),s.next=i,i.prev=s,i===this.head&&(this._head=s),this._length++,!0}addAfter(t,e){let i=this.isNode(t)?t:this.getNode(t);if(!i)return!1;let s=this._ensureNode(e);return s.next=i.next,i.next&&(i.next.prev=s),s.prev=i,i.next=s,i===this.tail&&(this._tail=s),this._length++,!0}setAt(t,e){let i=this.getNodeAt(t);return i?(i.value=e,!0):!1}deleteAt(t){if(t<0||t>=this._length)return;if(t===0)return this.shift();if(t===this._length-1)return this.pop();let e=this.getNodeAt(t),i=e.prev,s=e.next;return i.next=s,s.prev=i,this._length--,e.value}delete(t){let e=this.getNode(t);if(!e)return!1;if(e===this.head)this.shift();else if(e===this.tail)this.pop();else{let i=e.prev,s=e.next;i.next=s,s.prev=i,this._length--}return!0}isEmpty(){return this._length===0}clear(){this._head=void 0,this._tail=void 0,this._length=0}search(t){let e=this._ensurePredicate(t),i=this.head;for(;i;){if(e(i))return i.value;i=i.next}}getBackward(t){let e=this._ensurePredicate(t),i=this.tail;for(;i;){if(e(i))return i.value;i=i.prev}}reverse(){let t=this.head;for([this._head,this._tail]=[this.tail,this.head];t;){let e=t.next;[t.prev,t.next]=[t.next,t.prev],t=e}return this}setEquality(t){return this._equals=t,this}clone(){let t=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});for(let e of this)t.push(e);return t}filter(t,e){let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen}),s=0;for(let r of this)t.call(e,r,s++,this)&&i.push(r);return i}mapSame(t,e){let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen}),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{},maxLen:this._maxLen}),r=0;for(let n of this)s.push(t.call(i,n,r++,this));return s}_ensureNode(t){return this.isNode(t)?t:new Rt(t)}_ensurePredicate(t){if(this.isNode(t)){let i=t;return s=>s===i}if(typeof t=="function")return t;let e=t;return i=>this._equals(i.value,e)}_getPrevNode(t){return t.prev}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}*_getIterator(){let t=this.head;for(;t;)yield t.value,t=t.next}*_getReverseIterator(){let t=this.tail;for(;t;)yield t.value,t=t.prev}*_getNodeIterator(){let t=this.head;for(;t;)yield t,t=t.next}};u(Pe,"DoublyLinkedList");var Xt=class{constructor(t,e,i){f(this,"key"),f(this,"value"),f(this,"forward"),this.key=t,this.value=e,this.forward=new Array(i).fill(void 0)}};u(Xt,"SkipListNode");var dt=Xt,C,G,Qe=class W extends et{constructor(t=[],e={}){super(),z(this,C),z(this,G),f(this,"_head"),f(this,"_level",0),f(this,"_size",0),f(this,"_maxLevel",16),f(this,"_probability",.5);let{comparator:i,toEntryFn:s,maxLevel:r,probability:n}=e;typeof r=="number"&&r>0&&(this._maxLevel=r),typeof n=="number"&&n>0&&n<1&&(this._probability=n),V(this,G,i===void 0),V(this,C,i!=null?i:W.createDefaultComparator()),this._head=new dt(void 0,void 0,this._maxLevel);for(let h of t){let o,l;if(s)[o,l]=s(h);else{if(!Array.isArray(h)||h.length<2)throw new TypeError(N.invalidEntry("SkipList"));[o,l]=h}this.set(o,l)}}static createDefaultComparator(){return(t,e)=>{if(typeof t=="number"&&typeof e=="number"){if(Number.isNaN(t)||Number.isNaN(e))throw new TypeError(N.invalidNaN("SkipList"));return t-e}if(typeof t=="string"&&typeof e=="string")return t<e?-1:t>e?1:0;if(t instanceof Date&&e instanceof Date){let i=t.getTime(),s=e.getTime();if(Number.isNaN(i)||Number.isNaN(s))throw new TypeError(N.invalidDate("SkipList"));return i-s}if(typeof t=="bigint"&&typeof e=="bigint")return t<e?-1:t>e?1:0;throw new TypeError(N.comparatorRequired("SkipList"))}}get size(){return this._size}get maxLevel(){return this._maxLevel}get probability(){return this._probability}get comparator(){return g(this,C)}isEmpty(){return this._size===0}clear(){this._head=new dt(void 0,void 0,this._maxLevel),this._level=0,this._size=0}clone(){return new W(this,{comparator:g(this,G)?void 0:g(this,C),maxLevel:this._maxLevel,probability:this._probability})}set(t,e){let i=g(this,C),s=this._findUpdate(t),r=s[0].forward[0];if(r&&i(r.key,t)===0)return r.value=e,this;let n=this._randomLevel(),h=new dt(t,e,n);if(n>this._level){for(let o=this._level;o<n;o++)s[o]=this._head;this._level=n}for(let o=0;o<n;o++)h.forward[o]=s[o].forward[o],s[o].forward[o]=h;return this._size++,this}get(t){let e=this._findNode(t);return e?e.value:void 0}has(t){return this._findNode(t)!==void 0}delete(t){let e=g(this,C),i=this._findUpdate(t),s=i[0].forward[0];if(!s||e(s.key,t)!==0)return!1;for(let r=0;r<this._level&&i[r].forward[r]===s;r++)i[r].forward[r]=s.forward[r];for(;this._level>0&&!this._head.forward[this._level-1];)this._level--;return this._size--,!0}first(){let t=this._head.forward[0];return t?[t.key,t.value]:void 0}last(){let t=this._head;for(let e=this._level-1;e>=0;e--)for(;t.forward[e];)t=t.forward[e];return t===this._head?void 0:[t.key,t.value]}pollFirst(){let t=this.first();if(t)return this.delete(t[0]),t}pollLast(){let t=this.last();if(t)return this.delete(t[0]),t}ceiling(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<0;)i=i.forward[r];let s=i.forward[0];return s?[s.key,s.value]:void 0}floor(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<=0;)i=i.forward[r];let s=i===this._head?void 0:i;if(s&&e(s.key,t)<=0)return[s.key,s.value]}higher(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<=0;)i=i.forward[r];let s=i.forward[0];return s?[s.key,s.value]:void 0}lower(t){let e=g(this,C),i=this._head,s;for(let r=this._level-1;r>=0;r--){for(;i.forward[r]&&e(i.forward[r].key,t)<0;)i=i.forward[r];i!==this._head&&e(i.key,t)<0&&(s=i)}return s?[s.key,s.value]:void 0}rangeSearch(t,e={}){let{lowInclusive:i=!0,highInclusive:s=!0}=e,[r,n]=t,h=g(this,C),o=[],l=this._head;for(let a=this._level-1;a>=0;a--)for(;l.forward[a]&&h(l.forward[a].key,r)<0;)l=l.forward[a];for(l=l.forward[0];l;){let a=h(l.key,n);if(a>0||a===0&&!s)break;let _=h(l.key,r);(_>0||_===0&&i)&&o.push([l.key,l.value]),l=l.forward[0]}return o}map(t,e){let i=new W([],e!=null?e:{}),s=0;for(let[r,n]of this){let[h,o]=t(n,r,s++,this);i.set(h,o)}return i}filter(t,e){let i=new W([],{comparator:g(this,G)?void 0:g(this,C),maxLevel:this._maxLevel,probability:this._probability}),s=0;for(let[r,n]of this)t.call(e,n,r,s++,this)&&i.set(r,n);return i}_getIterator(){let t=this._head;return(function*(){let e=t.forward[0];for(;e;)yield[e.key,e.value],e=e.forward[0]})()}_findUpdate(t){let e=g(this,C),i=new Array(this._maxLevel).fill(this._head),s=this._head;for(let r=this._level-1;r>=0;r--){for(;s.forward[r]&&e(s.forward[r].key,t)<0;)s=s.forward[r];i[r]=s}return i}_findNode(t){let e=g(this,C),i=this._head;for(let r=this._level-1;r>=0;r--)for(;i.forward[r]&&e(i.forward[r].key,t)<0;)i=i.forward[r];let s=i.forward[0];if(s&&e(s.key,t)===0)return s}_randomLevel(){let t=1;for(;Math.random()<this._probability&&t<this._maxLevel;)t++;return t}};C=new WeakMap;G=new WeakMap;u(Qe,"SkipList");var Oe=class extends at{constructor(t=[],e){super(e),f(this,"_equals",u((i,s)=>Object.is(i,s),"_equals")),f(this,"_elements",[]),this.pushMany(t)}get elements(){return this._elements}get size(){return this.elements.length}static fromArray(t,e){return new this(t,e)}isEmpty(){return this.elements.length===0}peek(){return this.isEmpty()?void 0:this.elements[this.elements.length-1]}push(t){return this.elements.push(t),!0}pop(){return this.isEmpty()?void 0:this.elements.pop()}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}delete(t){let e=this._indexOfByEquals(t);return this.deleteAt(e)}deleteAt(t){return t<0||t>=this.elements.length?!1:this.elements.splice(t,1).length===1}deleteWhere(t){for(let e=0;e<this.elements.length;e++)if(t(this.elements[e],e,this))return this.elements.splice(e,1),!0;return!1}clear(){this._elements=[]}clone(){let t=this._createInstance({toElementFn:this.toElementFn});for(let e of this)t.push(e);return t}filter(t,e){let i=this._createInstance({toElementFn:this.toElementFn}),s=0;for(let r of this)t.call(e,r,s,this)&&i.push(r),s++;return i}mapSame(t,e){let i=this._createInstance({toElementFn:this.toElementFn}),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{}}),r=0;for(let n of this)s.push(i===void 0?t(n,r,this):t.call(i,n,r,this)),r++;return s}setEquality(t){return this._equals=t,this}_indexOfByEquals(t){for(let e=0;e<this.elements.length;e++)if(this._equals(this.elements[e],t))return e;return-1}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}*_getIterator(){for(let t=0;t<this.elements.length;t++)yield this.elements[t]}};u(Oe,"Stack");var Jt=class Yt extends ot{constructor(t=[],e){if(super(e),f(this,"_elements",[]),f(this,"_offset",0),f(this,"_autoCompactRatio",.5),e){let{autoCompactRatio:i=.5}=e;this._autoCompactRatio=i}this.pushMany(t)}get elements(){return this._elements}get offset(){return this._offset}get autoCompactRatio(){return this._autoCompactRatio}set autoCompactRatio(t){this._autoCompactRatio=t}get length(){return this.elements.length-this._offset}get first(){return this.length>0?this.elements[this._offset]:void 0}get last(){return this.length>0?this.elements[this.elements.length-1]:void 0}static fromArray(t){return new Yt(t)}isEmpty(){return this.length===0}push(t){return this.elements.push(t),this._maxLen>0&&this.length>this._maxLen&&this.shift(),!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}shift(){if(this.length===0)return;let t=this.first;return this._offset+=1,this.elements.length>0&&this.offset/this.elements.length>this.autoCompactRatio&&this.compact(),t}delete(t){for(let e=this._offset;e<this.elements.length;e++)if(Object.is(this.elements[e],t))return this.elements.splice(e,1),!0;return!1}at(t){if(!(t<0||t>=this.length))return this._elements[this._offset+t]}deleteAt(t){if(t<0||t>=this.length)return;let e=this._offset+t,[i]=this.elements.splice(e,1);return i}addAt(t,e){return t<0||t>this.length?!1:(this._elements.splice(this._offset+t,0,e),!0)}setAt(t,e){return t<0||t>=this.length?!1:(this._elements[this._offset+t]=e,!0)}reverse(){return this._elements=this.elements.slice(this._offset).reverse(),this._offset=0,this}clear(){this._elements=[],this._offset=0}compact(){return this._elements=this.elements.slice(this._offset),this._offset=0,!0}splice(t,e=0,...i){t=Math.max(0,Math.min(t,this.length)),e=Math.max(0,Math.min(e,this.length-t));let s=this._offset+t,r=this._elements.splice(s,e,...i);this.elements.length>0&&this.offset/this.elements.length>this.autoCompactRatio&&this.compact();let n=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});return n._setAutoCompactRatio(this._autoCompactRatio),n.pushMany(r),n}clone(){let t=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});t._setAutoCompactRatio(this._autoCompactRatio);for(let e=this._offset;e<this.elements.length;e++)t.push(this.elements[e]);return t}filter(t,e){let i=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});i._setAutoCompactRatio(this._autoCompactRatio);let s=0;for(let r of this)t.call(e,r,s,this)&&i.push(r),s++;return i}map(t,e,i){var s,r;let n=new this.constructor([],{toElementFn:e==null?void 0:e.toElementFn,maxLen:(s=e==null?void 0:e.maxLen)!=null?s:this._maxLen,autoCompactRatio:(r=e==null?void 0:e.autoCompactRatio)!=null?r:this._autoCompactRatio}),h=0;for(let o of this)n.push(i===void 0?t(o,h++,this):t.call(i,o,h++,this));return n}mapSame(t,e){var i;let s=this.constructor,r=new s([],{toElementFn:this.toElementFn,maxLen:this._maxLen,autoCompactRatio:this._autoCompactRatio});(i=r._setAutoCompactRatio)==null||i.call(r,this._autoCompactRatio);let n=0;for(let h of this){let o=e===void 0?t(h,n++,this):t.call(e,h,n++,this);r.push(o)}return r}_setAutoCompactRatio(t){this._autoCompactRatio=t}*_getIterator(){for(let t=this._offset;t<this.elements.length;t++)yield this.elements[t]}*_getReverseIterator(){for(let t=this.length-1;t>=0;t--){let e=this.at(t);e!==void 0&&(yield e)}}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}};u(Jt,"Queue");var tt=Jt,Xe=class extends $e{clone(){let t=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});for(let e of this)t.push(e);return t}};u(Xe,"LinkedListQueue");var Je=class extends ot{constructor(t=[],e){if(super(e),f(this,"_equals",u((r,n)=>Object.is(r,n),"_equals")),f(this,"_bucketSize",4096),f(this,"_autoCompactRatio",.5),f(this,"_compactCounter",0),f(this,"_bucketFirst",0),f(this,"_firstInBucket",0),f(this,"_bucketLast",0),f(this,"_lastInBucket",0),f(this,"_bucketCount",0),f(this,"_buckets",[]),f(this,"_length",0),e){let{bucketSize:r,autoCompactRatio:n}=e;typeof r=="number"&&(this._bucketSize=r),typeof n=="number"&&(this._autoCompactRatio=n)}let i;"length"in t?i=typeof t.length=="function"?t.length():t.length:i=typeof t.size=="function"?t.size():t.size,this._bucketCount=Et(i,this._bucketSize)||1;for(let r=0;r<this._bucketCount;++r)this._buckets.push(new Array(this._bucketSize));let s=Et(i,this._bucketSize);this._bucketFirst=this._bucketLast=(this._bucketCount>>1)-(s>>1),this._firstInBucket=this._lastInBucket=this._bucketSize-i%this._bucketSize>>1,this.pushMany(t)}get bucketSize(){return this._bucketSize}get autoCompactRatio(){return this._autoCompactRatio}set autoCompactRatio(t){this._autoCompactRatio=t}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 length(){return this._length}get first(){if(this._length!==0)return this._buckets[this._bucketFirst][this._firstInBucket]}get last(){if(this._length!==0)return this._buckets[this._bucketLast][this._lastInBucket]}static fromArray(t,e){return new this(t,e)}push(t){return this._length&&(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._length+=1,this._buckets[this._bucketLast][this._lastInBucket]=t,this._maxLen>0&&this._length>this._maxLen&&this.shift(),!0}pop(){if(this._length===0)return;let t=this._buckets[this._bucketLast][this._lastInBucket];return this._length!==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._length-=1,this._autoCompact(),t}shift(){if(this._length===0)return;let t=this._buckets[this._bucketFirst][this._firstInBucket];return this._length!==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._length-=1,this._autoCompact(),t}unshift(t){return this._length&&(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._length+=1,this._buckets[this._bucketFirst][this._firstInBucket]=t,this._maxLen>0&&this._length>this._maxLen&&this.pop(),!0}pushMany(t){let e=[];for(let i of t)this.toElementFn?e.push(this.push(this.toElementFn(i))):e.push(this.push(i));return e}unshiftMany(t=[]){let e=[];for(let i of t)this.toElementFn?e.push(this.unshift(this.toElementFn(i))):e.push(this.unshift(i));return e}isEmpty(){return this._length===0}clear(){this._buckets=[new Array(this._bucketSize)],this._bucketCount=1,this._bucketFirst=this._bucketLast=this._length=0,this._firstInBucket=this._lastInBucket=this._bucketSize>>1}at(t){if(t<0||t>=this._length)return;let{bucketIndex:e,indexInBucket:i}=this._getBucketAndPosition(t);return this._buckets[e][i]}setAt(t,e){q(t,0,this._length-1);let{bucketIndex:i,indexInBucket:s}=this._getBucketAndPosition(t);return this._buckets[i][s]=e,!0}addAt(t,e,i=1){let s=this._length;if(q(t,0,s),t===0)for(;i--;)this.unshift(e);else if(t===this._length)for(;i--;)this.push(e);else{let r=[];for(let n=t;n<this._length;++n){let h=this.at(n);h!==void 0&&r.push(h)}this.cut(t-1,!0);for(let n=0;n<i;++n)this.push(e);for(let n=0;n<r.length;++n)this.push(r[n])}return!0}cut(t,e=!1){if(e){if(t<0)return this.clear(),this;let{bucketIndex:i,indexInBucket:s}=this._getBucketAndPosition(t);return this._bucketLast=i,this._lastInBucket=s,this._length=t+1,this}else{let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize);for(let s=0;s<=t;s++){let r=this.at(s);r!==void 0&&i.push(r)}return i}}splice(t,e=this._length-t,...i){q(t,0,this._length),e<0&&(e=0),t+e>this._length&&(e=this._length-t);let s=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});s._setBucketSize(this._bucketSize);for(let n=0;n<e;n++){let h=this.at(t+n);h!==void 0&&s.push(h)}let r=[];for(let n=t+e;n<this._length;n++){let h=this.at(n);h!==void 0&&r.push(h)}this.cut(t-1,!0);for(let n of i)this.push(n);for(let n of r)this.push(n);return s}cutRest(t,e=!1){if(e){if(t<0)return this;let{bucketIndex:i,indexInBucket:s}=this._getBucketAndPosition(t);return this._bucketFirst=i,this._firstInBucket=s,this._length=this._length-t,this}else{let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize),t<0&&(t=0);for(let s=t;s<this._length;s++){let r=this.at(s);r!==void 0&&i.push(r)}return i}}deleteAt(t){q(t,0,this._length-1);let e;if(t===0)return this.shift();if(t===this._length-1)return e=this.last,this.pop(),e;{let i=this._length-1,{bucketIndex:s,indexInBucket:r}=this._getBucketAndPosition(t);e=this._buckets[s][r];for(let n=t;n<i;n++){let{bucketIndex:h,indexInBucket:o}=this._getBucketAndPosition(n),{bucketIndex:l,indexInBucket:a}=this._getBucketAndPosition(n+1);this._buckets[h][o]=this._buckets[l][a]}return this.pop(),e}}delete(t){let e=this._length;if(e===0)return!1;let i=0,s=0;for(;i<e;){let r=this.at(i);this._equals(r,t)||(this.setAt(s,r),s+=1),i+=1}return this.cut(s-1,!0),!0}deleteWhere(t){for(let e=0;e<this._length;e++){let i=this.at(e);if(t(i,e,this))return this.deleteAt(e),!0}return!1}setEquality(t){return this._equals=t,this}reverse(){this._buckets.reverse().forEach(function(r){r.reverse()});let{_bucketFirst:t,_bucketLast:e,_firstInBucket:i,_lastInBucket:s}=this;return this._bucketFirst=this._bucketCount-e-1,this._bucketLast=this._bucketCount-t-1,this._firstInBucket=this._bucketSize-s-1,this._lastInBucket=this._bucketSize-i-1,this}unique(){if(this._length<=1)return this;let t=1,e=this.at(0);for(let i=1;i<this._length;++i){let s=this.at(i);this._equals(s,e)||(e=s,this.setAt(t++,s))}return this.cut(t-1,!0),this}_autoCompact(){if(this._autoCompactRatio<=0||this._bucketCount<=1||(this._compactCounter++,this._compactCounter<this._bucketSize))return;this._compactCounter=0,this._length/(this._bucketCount*this._bucketSize)<this._autoCompactRatio&&this.shrinkToFit()}compact(){let t=this._bucketCount;return this.shrinkToFit(),this._bucketCount<t}shrinkToFit(){if(this._length===0)return;let t=[];if(this._bucketFirst<=this._bucketLast)for(let e=this._bucketFirst;e<=this._bucketLast;++e)t.push(this._buckets[e]);else{for(let e=this._bucketFirst;e<this._bucketCount;++e)t.push(this._buckets[e]);for(let e=0;e<=this._bucketLast;++e)t.push(this._buckets[e])}this._bucketFirst=0,this._bucketLast=t.length-1,this._buckets=t,this._bucketCount=t.length,this._compactCounter=0}clone(){return this._createLike(this,{bucketSize:this.bucketSize,toElementFn:this.toElementFn,maxLen:this._maxLen})}filter(t,e){let i=this._createInstance({toElementFn:this.toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize);let s=0;for(let r of this)t.call(e,r,s,this)&&i.push(r),s++;return i}mapSame(t,e){let i=this._createInstance({toElementFn:this._toElementFn,maxLen:this._maxLen});i._setBucketSize(this._bucketSize);let s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.push(n)}return i}map(t,e,i){let s=this._createLike([],{...e!=null?e:{},bucketSize:this._bucketSize,maxLen:this._maxLen}),r=0;for(let n of this){let h=i===void 0?t(n,r,this):t.call(i,n,r,this);s.push(h),r++}return s}_setBucketSize(t){this._bucketSize=t,this._length===0&&(this._buckets=[new Array(this._bucketSize)],this._bucketCount=1,this._bucketFirst=this._bucketLast=0,this._firstInBucket=this._lastInBucket=this._bucketSize>>1)}*_getIterator(){for(let t=0;t<this._length;++t){let e=this.at(t);e!==void 0&&(yield e)}}_reallocate(t){let e=[],i=t||this._bucketCount>>1||1;for(let s=0;s<i;++s)e[s]=new Array(this._bucketSize);for(let s=this._bucketFirst;s<this._bucketCount;++s)e[e.length]=this._buckets[s];for(let s=0;s<this._bucketLast;++s)e[e.length]=this._buckets[s];e[e.length]=[...this._buckets[this._bucketLast]],this._bucketFirst=i,this._bucketLast=e.length-1;for(let s=0;s<i;++s)e[e.length]=new Array(this._bucketSize);this._buckets=e,this._bucketCount=e.length}_getBucketAndPosition(t){let e,i,s=this._firstInBucket+t;return e=this._bucketFirst+Math.floor(s/this._bucketSize),e>=this._bucketCount&&(e-=this._bucketCount),i=(s+1)%this._bucketSize-1,i<0&&(i=this._bucketSize-1),{bucketIndex:e,indexInBucket:i}}_createInstance(t){let e=this.constructor;return new e([],t)}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}*_getReverseIterator(){for(let t=this._length-1;t>-1;t--){let e=this.at(t);e!==void 0&&(yield e)}}};u(Je,"Deque");var Zt=class te extends at{constructor(t=[],e){if(super(e),f(this,"_equals",Object.is),f(this,"_elements",[]),f(this,"_DEFAULT_COMPARATOR",u((i,s)=>{if(typeof i=="object"||typeof s=="object")throw new TypeError(N.comparatorRequired("Heap"));return i>s?1:i<s?-1:0},"_DEFAULT_COMPARATOR")),f(this,"_comparator",this._DEFAULT_COMPARATOR),e){let{comparator:i}=e;i&&(this._comparator=i)}this.addMany(t)}get elements(){return this._elements}get size(){return this.elements.length}get leaf(){var t;return(t=this.elements[this.size-1])!=null?t:void 0}static from(t,e){return new this(t,e)}static heapify(t,e){return new te(t,e)}add(t){return this._elements.push(t),this._bubbleUp(this.elements.length-1)}addMany(t){let e=[];for(let i of t)if(this.toElementFn){let s=this.add(this.toElementFn(i));e.push(s)}else{let s=this.add(i);e.push(s)}return e}poll(){if(this.elements.length===0)return;let t=this.elements[0],e=this.elements.pop();return this.elements.length&&(this.elements[0]=e,this._sinkDown(0,this.elements.length>>1)),t}peek(){return this.elements[0]}isEmpty(){return this.size===0}clear(){this._elements=[]}refill(t){return this._elements=Array.from(t),this.fix()}has(t){for(let e of this.elements)if(this._equals(e,t))return!0;return!1}delete(t){let e=-1;for(let i=0;i<this.elements.length;i++)if(this._equals(this.elements[i],t)){e=i;break}return e<0?!1:(e===0?this.poll():e===this.elements.length-1?this.elements.pop():(this.elements.splice(e,1,this.elements.pop()),this._bubbleUp(e),this._sinkDown(e,this.elements.length>>1)),!0)}deleteBy(t){let e=-1;for(let i=0;i<this.elements.length;i++)if(t(this.elements[i],i,this)){e=i;break}return e<0?!1:(e===0?this.poll():e===this.elements.length-1?this.elements.pop():(this.elements.splice(e,1,this.elements.pop()),this._bubbleUp(e),this._sinkDown(e,this.elements.length>>1)),!0)}setEquality(t){return this._equals=t,this}dfs(t="PRE"){let e=[],i=u(s=>{let r=2*s+1,n=r+1;s<this.size&&(t==="IN"?(i(r),e.push(this.elements[s]),i(n)):t==="PRE"?(e.push(this.elements[s]),i(r),i(n)):t==="POST"&&(i(r),i(n),e.push(this.elements[s])))},"_dfs");return i(0),e}fix(){let t=[];for(let e=Math.floor(this.size/2)-1;e>=0;e--)t.push(this._sinkDown(e,this.elements.length>>1));return t}sort(){let t=[],e=this._createInstance();for(let i of this.elements)e.add(i);for(;!e.isEmpty();){let i=e.poll();i!==void 0&&t.push(i)}return t}clone(){let t=this._createInstance();for(let e of this.elements)t.add(e);return t}filter(t,e){let i=this._createInstance(),s=0;for(let r of this)(e===void 0?t(r,s++,this):t.call(e,r,s++,this))?i.add(r):s++;return i}map(t,e,i){let{comparator:s,toElementFn:r,...n}=e!=null?e:{};if(!s)throw new TypeError(N.comparatorRequired("Heap.map"));let h=this._createLike([],{...n,comparator:s,toElementFn:r}),o=0;for(let l of this){let a=i===void 0?t(l,o++,this):t.call(i,l,o++,this);h.add(a)}return h}mapSame(t,e){let i=this._createInstance(),s=0;for(let r of this){let n=e===void 0?t(r,s++,this):t.call(e,r,s++,this);i.add(n)}return i}get comparator(){return this._comparator}*_getIterator(){for(let t of this.elements)yield t}_bubbleUp(t){let e=this.elements[t];for(;t>0;){let i=t-1>>1,s=this.elements[i];if(this.comparator(s,e)<=0)break;this.elements[t]=s,t=i}return this.elements[t]=e,!0}_sinkDown(t,e){let i=this.elements[t];for(;t<e;){let s=t<<1|1,r=s+1,n=this.elements[s];if(r<this.elements.length&&this.comparator(n,this.elements[r])>0&&(s=r,n=this.elements[r]),this.comparator(n,i)>=0)break;this.elements[t]=n,t=s}return this.elements[t]=i,!0}_createInstance(t){let e=this.constructor;return new e([],{comparator:this.comparator,toElementFn:this.toElementFn,...t!=null?t:{}})}_createLike(t=[],e){let i=this.constructor;return new i(t,e)}_spawnLike(t){return this._createLike([],t)}};u(Zt,"Heap");var ut=Zt,ee=class{constructor(t,e=0){f(this,"element"),f(this,"degree"),f(this,"left"),f(this,"right"),f(this,"child"),f(this,"parent"),f(this,"marked"),this.element=t,this.degree=e,this.marked=!1}};u(ee,"FibonacciHeapNode");var Ye=ee,Ze=class{constructor(t){if(f(this,"_root"),f(this,"_size",0),f(this,"_min"),f(this,"_comparator"),this.clear(),this._comparator=t||this._defaultComparator,typeof this.comparator!="function")throw new TypeError(N.notAFunction("comparator","FibonacciHeap"))}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(t){return this.push(t),!0}push(t){let e=this.createNode(t);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(t){let e=[];if(!t)return e;let i=t,s=!1;for(;!(i===t&&s);)i===t&&(s=!0),e.push(i),i=i.right;return e}mergeWithChild(t,e){t.child?(e.right=t.child.right,e.left=t.child,t.child.right.left=e,t.child.right=e):t.child=e}poll(){return this.pop()}pop(){if(this._size===0)return;let t=this.min;if(t.child){let e=this.consumeLinkedList(t.child);for(let i of e)this.mergeWithRoot(i),i.parent=void 0}return this.removeFromRoot(t),t===t.right?(this._min=void 0,this._root=void 0):(this._min=t.right,this._consolidate()),this._size--,t.element}merge(t){if(t.size!==0){if(this.root&&t.root){let e=this.root,i=t.root,s=e.right,r=i.left;e.right=i,i.left=e,s.left=r,r.right=s}else!this.root&&t.root&&(this._root=t.root);(!this.min||t.min&&this.comparator(t.min.element,this.min.element)<0)&&(this._min=t.min),this._size+=t.size,t.clear()}}createNode(t){return new Ye(t)}isEmpty(){return this._size===0}_defaultComparator(t,e){return t<e?-1:t>e?1:0}mergeWithRoot(t){this.root?(t.right=this.root.right,t.left=this.root,this.root.right.left=t,this.root.right=t):this._root=t}removeFromRoot(t){this.root===t&&(this._root=t.right),t.left&&(t.left.right=t.right),t.right&&(t.right.left=t.left)}_link(t,e){this.removeFromRoot(t),t.left=t,t.right=t,this.mergeWithChild(e,t),e.degree++,t.parent=e}_consolidate(){let t=new Array(this._size),e=this.consumeLinkedList(this.root),i,s,r,n;for(let h of e){for(i=h,r=i.degree;t[r];)s=t[r],this.comparator(i.element,s.element)>0&&(n=i,i=s,s=n),this._link(s,i),t[r]=void 0,r++;t[r]=i}for(let h=0;h<t.length;h++)t[h]&&(!this.min||this.comparator(t[h].element,this.min.element)<=0)&&(this._min=t[h])}};u(Ze,"FibonacciHeap");var ti=class extends ut{constructor(t=[],e){super(t,{comparator:u((i,s)=>{if(typeof i=="object"||typeof s=="object")throw new TypeError(N.comparatorRequired("MaxHeap"));return i<s?1:i>s?-1:0},"comparator"),...e})}};u(ti,"MaxHeap");var ei=class extends ut{constructor(t=[],e){super(t,e)}};u(ei,"MinHeap");var ie=class{constructor(t,e){f(this,"key"),f(this,"value"),this.key=t,this.value=e}};u(ie,"AbstractVertex");var D=ie,se=class{constructor(t,e){f(this,"value"),f(this,"weight"),f(this,"_hashCode"),this.weight=t!==void 0?t:1,this.value=e,this._hashCode=He()}get hashCode(){return this._hashCode}};u(se,"AbstractEdge");var kt=se,re=class extends et{constructor(t){super(),f(this,"_options",{defaultEdgeWeight:1}),f(this,"_vertexMap",new Map);let e=t==null?void 0:t.graph;this._options={defaultEdgeWeight:1,...e!=null?e:{}}}get options(){return this._options}get vertexMap(){return this._vertexMap}set vertexMap(t){this._vertexMap=t}get size(){return this._vertexMap.size}getVertex(t){return this._vertexMap.get(t)||void 0}hasVertex(t){return this._vertexMap.has(this._getVertexKey(t))}addVertex(t,e){if(t instanceof D)return this._addVertex(t);{let i=this.createVertex(t,e);return this._addVertex(i)}}isVertexKey(t){let e=typeof t;return e==="string"||e==="number"}removeManyVertices(t){let e=[];for(let i of t)e.push(this.deleteVertex(i));return e.length>0}hasEdge(t,e){return!!this.getEdge(t,e)}addEdge(t,e,i,s){if(t instanceof kt)return this._addEdge(t);if(e instanceof D||typeof e=="string"||typeof e=="number"){if(!(this.hasVertex(t)&&this.hasVertex(e)))return!1;t instanceof D&&(t=t.key),e instanceof D&&(e=e.key);let r=this.createEdge(t,e,i,s);return this._addEdge(r)}else throw new TypeError(N.invalidArgument("dest must be a Vertex or vertex key when srcOrEdge is an Edge.","Graph"))}setEdgeWeight(t,e,i){let s=this.getEdge(t,e);return s?(s.weight=i,!0):!1}getAllPathsBetween(t,e,i=1e3){let s=[],r=this._getVertex(t),n=this._getVertex(e);if(!(r&&n))return[];let h=[];for(h.push({vertex:r,path:[r]});h.length>0;){let{vertex:o,path:l}=h.pop();if(o===n&&(s.push(l),s.length>=i))return s;let a=this.getNeighbors(o);for(let _ of a)if(!l.includes(_)){let d=[...l,_];h.push({vertex:_,path:d})}}return s}getPathSumWeight(t){var e;let i=0;for(let s=0;s<t.length;s++)i+=((e=this.getEdge(t[s],t[s+1]))==null?void 0:e.weight)||0;return i}getMinCostBetween(t,e,i){if(i===void 0&&(i=!1),i){let s=this.getAllPathsBetween(t,e),r=Number.MAX_SAFE_INTEGER;for(let n of s)r=Math.min(this.getPathSumWeight(n),r);return r}else{let s=this._getVertex(e),r=this._getVertex(t);if(!(r&&s))return;let n=new Map,h=new tt([r]);n.set(r,!0);let o=0;for(;h.length>0;){for(let l=0,a=h.length;l<a;l++){let _=h.shift();if(_===s)return o;if(_!==void 0){let d=this.getNeighbors(_);for(let p of d)n.has(p)||(n.set(p,!0),h.push(p))}}o++}return}}getMinPathBetween(t,e,i,s=!1){var r,n;if(i===void 0&&(i=!1),i)if(s){let h=this.getAllPathsBetween(t,e,1e4),o=Number.MAX_SAFE_INTEGER,l=-1,a=0;for(let _ of h){let d=this.getPathSumWeight(_);d<o&&(o=d,l=a),a++}return h[l]||void 0}else return(n=(r=this.dijkstra(t,e,!0,!0))==null?void 0:r.minPath)!=null?n:[];else{let h=[],o=this._getVertex(t),l=this._getVertex(e);if(!(o&&l))return[];let a=u((_,d,p,m)=>{if(p.add(_),_===d){h=[o,...m];return}let x=this.getNeighbors(_);for(let M of x)p.has(M)||(m.push(M),a(M,d,p,m),m.pop());p.delete(_)},"dfs");return a(o,l,new Set,[]),h}}dijkstraWithoutHeap(t,e=void 0,i=!1,s=!1){let r=Number.MAX_SAFE_INTEGER,n,h=[],o=[],l=this._vertexMap,a=new Map,_=new Set,d=new Map,p=this._getVertex(t),m=e?this._getVertex(e):void 0;if(!p)return;for(let y of l){let w=y[1];w instanceof D&&a.set(w,Number.MAX_SAFE_INTEGER)}a.set(p,0),d.set(p,void 0);let x=u(()=>{let y=Number.MAX_SAFE_INTEGER,w;for(let[k,v]of a)_.has(k)||v<y&&(y=v,w=k);return w},"getMinOfNoSeen"),M=u(y=>{for(let w of l){let k=w[1];if(k instanceof D){let v=[k],b=d.get(k);for(;b;)v.push(b),b=d.get(b);let E=v.reverse();w[1]===y&&(h=E),o.push(E)}}},"getPaths");for(let y=1;y<l.size;y++){let w=x();if(w){if(_.add(w),m&&m===w)return i&&(r=a.get(m)||Number.MAX_SAFE_INTEGER),s&&M(m),{distMap:a,preMap:d,seen:_,paths:o,minDist:r,minPath:h};let k=this.getNeighbors(w);for(let v of k)if(!_.has(v)){let b=this.getEdge(w,v);if(b){let E=a.get(w),R=a.get(v);E!==void 0&&R!==void 0&&b.weight+E<R&&(a.set(v,b.weight+E),d.set(v,w))}}}}return i&&a.forEach((y,w)=>{w!==p&&y<r&&(r=y,s&&(n=w))}),s&&M(n),{distMap:a,preMap:d,seen:_,paths:o,minDist:r,minPath:h}}dijkstra(t,e=void 0,i=!1,s=!1){var r;let n=Number.MAX_SAFE_INTEGER,h,o=[],l=[],a=this._vertexMap,_=new Map,d=new Set,p=new Map,m=this._getVertex(t),x=e?this._getVertex(e):void 0;if(!m)return;for(let w of a){let k=w[1];k instanceof D&&_.set(k,Number.MAX_SAFE_INTEGER)}let M=new ut([],{comparator:u((w,k)=>w.key-k.key,"comparator")});M.add({key:0,value:m}),_.set(m,0),p.set(m,void 0);let y=u(w=>{for(let k of a){let v=k[1];if(v instanceof D){let b=[v],E=p.get(v);for(;E;)b.push(E),E=p.get(E);let R=b.reverse();k[1]===w&&(o=R),l.push(R)}}},"getPaths");for(;M.size>0;){let w=M.poll(),k=w==null?void 0:w.key,v=w==null?void 0:w.value;if(k!==void 0&&v){if(d.add(v),x&&x===v)return i&&(n=_.get(x)||Number.MAX_SAFE_INTEGER),s&&y(x),{distMap:_,preMap:p,seen:d,paths:l,minDist:n,minPath:o};let b=this.getNeighbors(v);for(let E of b)if(!d.has(E)){let R=(r=this.getEdge(v,E))==null?void 0:r.weight;if(typeof R=="number"){let S=_.get(E);S!==void 0&&k+R<S&&(M.add({key:k+R,value:E}),p.set(E,v),_.set(E,k+R))}}}}return i&&_.forEach((w,k)=>{k!==m&&w<n&&(n=w,s&&(h=k))}),s&&y(h),{distMap:_,preMap:p,seen:d,paths:l,minDist:n,minPath:o}}bellmanFord(t,e,i,s){i===void 0&&(i=!1),s===void 0&&(s=!1);let r=this._getVertex(t),n=[],h=new Map,o=new Map,l=Number.MAX_SAFE_INTEGER,a=[],_;if(e&&(_=!1),!r)return{hasNegativeCycle:_,distMap:h,preMap:o,paths:n,min:l,minPath:a};let d=this._vertexMap,p=d.size,m=this.edgeSet(),x=m.length;this._vertexMap.forEach(y=>{h.set(y,Number.MAX_SAFE_INTEGER)}),h.set(r,0);for(let y=1;y<p;++y)for(let w=0;w<x;++w){let k=this.getEndsOfEdge(m[w]);if(k){let[v,b]=k,E=m[w].weight,R=h.get(v),S=h.get(b);R!==void 0&&S!==void 0&&h.get(v)!==Number.MAX_SAFE_INTEGER&&R+E<S&&(h.set(b,R+E),s&&o.set(b,v))}}let M;if(i&&h.forEach((y,w)=>{w!==r&&y<l&&(l=y,s&&(M=w))}),s)for(let y of d){let w=y[1];if(w instanceof D){let k=[w],v=o.get(w);for(;v!==void 0;)k.push(v),v=o.get(v);let b=k.reverse();y[1]===M&&(a=b),n.push(b)}}for(let y=0;y<x;++y){let w=this.getEndsOfEdge(m[y]);if(w){let[k]=w,v=m[y].weight,b=h.get(k);b&&b!==Number.MAX_SAFE_INTEGER&&b+v<b&&(_=!0)}}return{hasNegativeCycle:_,distMap:h,preMap:o,paths:n,min:l,minPath:a}}floydWarshall(){var t;let e=[...this._vertexMap],i=e.length,s=[],r=[];for(let n=0;n<i;n++){s[n]=[],r[n]=[];for(let h=0;h<i;h++)r[n][h]=void 0}for(let n=0;n<i;n++)for(let h=0;h<i;h++)s[n][h]=((t=this.getEdge(e[n][1],e[h][1]))==null?void 0:t.weight)||Number.MAX_SAFE_INTEGER;for(let n=0;n<i;n++)for(let h=0;h<i;h++)for(let o=0;o<i;o++)s[h][o]>s[h][n]+s[n][o]&&(s[h][o]=s[h][n]+s[n][o],r[h][o]=e[n][1]);return{costs:s,predecessor:r}}getCycles(t=!1){let e=[],i=new Set,s=u((n,h,o)=>{if(o.has(n)){(!t&&h.length>2||t&&h.length>=2)&&h[0]===n.key&&e.push([...h]);return}o.add(n),h.push(n.key);for(let l of this.getNeighbors(n))l&&s(l,h,o);o.delete(n),h.pop()},"dfs");for(let n of this.vertexMap.values())s(n,[],i);let r=new Map;for(let n of e){let h=[...n].sort().toString();r.has(h)||r.set(h,n)}return[...r].map(n=>n[1])}filter(t,e){let i=[],s=0;for(let[r,n]of this)t.call(e,n,r,s,this)&&i.push([r,n]),s++;return this._createLike(i,this._snapshotOptions())}filterEntries(t,e){let i=[],s=0;for(let[r,n]of this)t.call(e,n,r,s,this)&&i.push([r,n]),s++;return i}map(t,e){let i=[],s=0;for(let[r,n]of this)i.push(t.call(e,n,r,s,this)),s++;return i}clone(){return this._createLike(void 0,this._snapshotOptions())}*_getIterator(){for(let t of this._vertexMap.values())yield[t.key,t.value]}_snapshotOptions(){return{graph:{...this._options}}}_createInstance(t){let e=this.constructor,i=new e,s=t==null?void 0:t.graph;return s?i._options={...i._options,...s}:i._options={...i._options,...this._options},i}_createLike(t,e){let i=this._createInstance(e);if(t)for(let[r,n]of t)i.addVertex(r,n);else for(let[r,n]of this)i.addVertex(r,n);let s=this.edgeSet();for(let r of s){let n=this.getEndsOfEdge(r);if(!n)continue;let[h,o]=n,l=h.key,a=o.key,_=typeof i.hasVertex=="function"?i.hasVertex(l):!1,d=typeof i.hasVertex=="function"?i.hasVertex(a):!1;if(_&&d){let p=i.createEdge(l,a,r.weight,r.value);i._addEdge(p)}}return i}_addVertex(t){return this.hasVertex(t)?!1:(this._vertexMap.set(t.key,t),!0)}_getVertex(t){let e=this._getVertexKey(t);return this._vertexMap.get(e)||void 0}_getVertexKey(t){return t instanceof D?t.key:t}get _edgeConnector(){return"--"}toVisual(t){var e;let i=(e=t==null?void 0:t.showWeight)!=null?e:!0,s=[...this._vertexMap.values()],r=s.length,n=this.edgeSet().length,h=[`Graph (${r} vertices, ${n} edges):`];for(let o of s){let l=this.getNeighbors(o);if(l.length===0)h.push(` ${o.key} (isolated)`);else{let a=l.map(_=>{let d=this.getEdge(o,_);return d&&i&&d.weight!==void 0&&d.weight!==1?`${_.key} (${d.weight})`:`${_.key}`});h.push(` ${o.key} ${this._edgeConnector} ${a.join(", ")}`)}}return h.join(`
|
|
2
2
|
`)}toDot(t){var e,i;let s=(e=t==null?void 0:t.name)!=null?e:"G",r=(i=t==null?void 0:t.showWeight)!=null?i:!0,n=this._edgeConnector==="->",h=n?"digraph":"graph",o=n?"->":"--",l=[`${h} ${s} {`];for(let _ of this._vertexMap.values())l.push(` "${_.key}";`);let a=new Set;for(let _ of this._vertexMap.values())for(let d of this.getNeighbors(_)){let p=n?`${_.key}->${d.key}`:[_.key,d.key].sort().join("--");if(a.has(p))continue;a.add(p);let m=this.getEdge(_,d),x=m&&r&&m.weight!==void 0&&m.weight!==1?` [label="${m.weight}"]`:"";l.push(` "${_.key}" ${o} "${d.key}"${x};`)}return l.push("}"),l.join(`
|
|
3
3
|
`)}print(t){console.log(this.toVisual(t))}};u(re,"AbstractGraph");var ne=re,he=class extends D{constructor(t,e){super(t,e)}};u(he,"DirectedVertex");var yt=he,oe=class extends kt{constructor(t,e,i,s){super(i,s),f(this,"src"),f(this,"dest"),this.src=t,this.dest=e}};u(oe,"DirectedEdge");var le=oe,ae=class Mt extends ne{constructor(t){super(t),f(this,"_outEdgeMap",new Map),f(this,"_inEdgeMap",new Map)}get _edgeConnector(){return"->"}get outEdgeMap(){return this._outEdgeMap}set outEdgeMap(t){this._outEdgeMap=t}get inEdgeMap(){return this._inEdgeMap}set inEdgeMap(t){this._inEdgeMap=t}static fromKeys(t){let e=new Mt({vertexValueInitializer:u(i=>i,"vertexValueInitializer")});for(let i of t)e.addVertex(i);return e}static fromEntries(t){let e=new Mt;for(let[i,s]of t)e.addVertex(i,s);return e}createVertex(t,e){return new yt(t,e)}createEdge(t,e,i,s){var r;return new le(t,e,(r=i!=null?i:this.options.defaultEdgeWeight)!=null?r:1,s)}getEdge(t,e){let i=[];if(t!==void 0&&e!==void 0){let s=this._getVertex(t),r=this._getVertex(e);if(s&&r){let n=this._outEdgeMap.get(s);n&&(i=n.filter(h=>h.dest===r.key))}}return i[0]||void 0}deleteEdgeSrcToDest(t,e){let i=this._getVertex(t),s=this._getVertex(e),r;if(!i||!s)return;let n=this._outEdgeMap.get(i);n&&U(n,o=>o.dest===s.key);let h=this._inEdgeMap.get(s);return h&&(r=U(h,o=>o.src===i.key)[0]||void 0),r}deleteEdge(t,e){let i,s,r;if(this.isVertexKey(t))if(this.isVertexKey(e))s=this._getVertex(t),r=this._getVertex(e);else return;else s=this._getVertex(t.src),r=this._getVertex(t.dest);if(s&&r){let n=this._outEdgeMap.get(s);n&&n.length>0&&U(n,o=>o.src===s.key&&o.dest===(r==null?void 0:r.key));let h=this._inEdgeMap.get(r);h&&h.length>0&&(i=U(h,o=>o.src===s.key&&o.dest===r.key)[0])}return i}deleteVertex(t){let e,i;if(this.isVertexKey(t)?(i=this.getVertex(t),e=t):(i=t,e=this._getVertexKey(t)),i){let s=this.getNeighbors(i);for(let r of s)this.deleteEdgeSrcToDest(i,r);this._outEdgeMap.delete(i),this._inEdgeMap.delete(i)}return this._vertexMap.delete(e)}deleteEdgesBetween(t,e){let i=[];if(t&&e){let s=this.deleteEdgeSrcToDest(t,e),r=this.deleteEdgeSrcToDest(e,t);s&&i.push(s),r&&i.push(r)}return i}incomingEdgesOf(t){let e=this._getVertex(t);return e?this.inEdgeMap.get(e)||[]:[]}outgoingEdgesOf(t){let e=this._getVertex(t);return e?this._outEdgeMap.get(e)||[]:[]}degreeOf(t){return this.outDegreeOf(t)+this.inDegreeOf(t)}inDegreeOf(t){return this.incomingEdgesOf(t).length}outDegreeOf(t){return this.outgoingEdgesOf(t).length}edgesOf(t){return[...this.outgoingEdgesOf(t),...this.incomingEdgesOf(t)]}getEdgeSrc(t){return this._getVertex(t.src)}getEdgeDest(t){return this._getVertex(t.dest)}getDestinations(t){if(t===void 0)return[];let e=[],i=this.outgoingEdgesOf(t);for(let s of i){let r=this.getEdgeDest(s);r&&e.push(r)}return e}topologicalSort(t){t=t!=null?t:"key";let e=new Map;for(let n of this.vertexMap)e.set(n[1],0);let i=[],s=!1,r=u(n=>{e.set(n,1);let h=this.getDestinations(n);for(let o of h){let l=e.get(o);l===0?r(o):l===1&&(s=!0)}e.set(n,2),i.push(n)},"dfs");for(let n of this.vertexMap)e.get(n[1])===0&&r(n[1]);if(!s)return t==="key"&&(i=i.map(n=>n instanceof yt?n.key:n)),i.reverse()}edgeSet(){let t=[];return this._outEdgeMap.forEach(e=>{t=[...t,...e]}),t}getNeighbors(t){let e=[],i=this._getVertex(t);if(i){let s=this.outgoingEdgesOf(i);for(let r of s){let n=this._getVertex(r.dest);n&&e.push(n)}}return e}getEndsOfEdge(t){if(!this.hasEdge(t.src,t.dest))return;let e=this._getVertex(t.src),i=this._getVertex(t.dest);if(e&&i)return[e,i]}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(){return super.clone()}tarjan(){let t=new Map,e=new Map,i=new Map,s=0,r=[],n=new Set,h=u(o=>{t.set(o,s),e.set(o,s),s++,r.push(o),n.add(o);let l=this.getNeighbors(o);for(let a of l)t.has(a)?n.has(a)&&e.set(o,Math.min(e.get(o),t.get(a))):(h(a),e.set(o,Math.min(e.get(o),e.get(a))));if(t.get(o)===e.get(o)){let a=[],_;do _=r.pop(),n.delete(_),a.push(_);while(_!==o);i.set(i.size,a)}},"dfs");for(let o of this.vertexMap.values())t.has(o)||h(o);return{dfnMap:t,lowMap:e,SCCs:i}}getDFNMap(){return this.tarjan().dfnMap}getLowMap(){return this.tarjan().lowMap}getSCCs(){return this.tarjan().SCCs}_addEdge(t){if(!(this.hasVertex(t.src)&&this.hasVertex(t.dest)))return!1;let e=this._getVertex(t.src),i=this._getVertex(t.dest);if(e&&i){let s=this._outEdgeMap.get(e);s?s.push(t):this._outEdgeMap.set(e,[t]);let r=this._inEdgeMap.get(i);return r?r.push(t):this._inEdgeMap.set(i,[t]),!0}else return!1}};u(ae,"DirectedGraph");var ii=ae,ue=class extends D{constructor(t,e){super(t,e)}};u(ue,"UndirectedVertex");var si=ue,ce=class extends kt{constructor(t,e,i,s){super(i,s),f(this,"endpoints"),this.endpoints=[t,e]}};u(ce,"UndirectedEdge");var ri=ce,ni=class bt extends ne{constructor(t){super(t),f(this,"_edgeMap"),this._edgeMap=new Map}get edgeMap(){return this._edgeMap}set edgeMap(t){this._edgeMap=t}static fromKeys(t){let e=new bt({vertexValueInitializer:u(i=>i,"vertexValueInitializer")});for(let i of t)e.addVertex(i);return e}static fromEntries(t){let e=new bt;for(let[i,s]of t)e.addVertex(i,s);return e}createVertex(t,e){return new si(t,e)}createEdge(t,e,i,s){var r;return new ri(t,e,(r=i!=null?i:this.options.defaultEdgeWeight)!=null?r:1,s)}getEdge(t,e){var i;let s=[];if(t!==void 0&&e!==void 0){let r=this._getVertex(t),n=this._getVertex(e);r&&n&&(s=(i=this._edgeMap.get(r))==null?void 0:i.filter(h=>h.endpoints.includes(n.key)))}return s&&s[0]||void 0}deleteEdgeBetween(t,e){let i=this._getVertex(t),s=this._getVertex(e);if(!i||!s)return;let r=this._edgeMap.get(i),n;r&&(n=U(r,o=>o.endpoints.includes(s.key))[0]||void 0);let h=this._edgeMap.get(s);return h&&U(h,o=>o.endpoints.includes(i.key)),n}deleteEdge(t,e){let i,s;if(this.isVertexKey(t))if(this.isVertexKey(e))i=this._getVertex(t),s=this._getVertex(e);else return;else i=this._getVertex(t.endpoints[0]),s=this._getVertex(t.endpoints[1]);if(i&&s)return this.deleteEdgeBetween(i,s)}deleteVertex(t){let e,i;this.isVertexKey(t)?(i=this.getVertex(t),e=t):(i=t,e=this._getVertexKey(t));let s=this.getNeighbors(t);return i&&(s.forEach(r=>{let n=this._edgeMap.get(r);if(n){let h=n.filter(o=>!o.endpoints.includes(e));this._edgeMap.set(r,h)}}),this._edgeMap.delete(i)),this._vertexMap.delete(e)}degreeOf(t){var e;let i=this._getVertex(t);return i&&((e=this._edgeMap.get(i))==null?void 0:e.length)||0}edgesOf(t){let e=this._getVertex(t);return e?this._edgeMap.get(e)||[]:[]}edgeSet(){let t=new Set;return this._edgeMap.forEach(e=>{e.forEach(i=>{t.add(i)})}),[...t]}getNeighbors(t){let e=[],i=this._getVertex(t);if(i){let s=this.edgesOf(i);for(let r of s){let n=this._getVertex(r.endpoints.filter(h=>h!==i.key)[0]);n&&e.push(n)}}return e}getEndsOfEdge(t){if(!this.hasEdge(t.endpoints[0],t.endpoints[1]))return;let e=this._getVertex(t.endpoints[0]),i=this._getVertex(t.endpoints[1]);if(e&&i)return[e,i]}isEmpty(){return this.vertexMap.size===0&&this.edgeMap.size===0}clear(){this._vertexMap=new Map,this._edgeMap=new Map}clone(){return super.clone()}tarjan(){let t=new Map,e=new Map,i=[],s=[],r=0,n=u((h,o)=>{t.set(h,r),e.set(h,r),r++;let l=this.getNeighbors(h),a=0;for(let _ of l)if(t.has(_))_!==o&&e.set(h,Math.min(e.get(h),t.get(_)));else{if(a++,n(_,h),e.set(h,Math.min(e.get(h),e.get(_))),e.get(_)>t.get(h)){let d=this.getEdge(h,_);d&&i.push(d)}o!==void 0&&e.get(_)>=t.get(h)&&s.push(h)}o===void 0&&a>1&&s.push(h)},"dfs");for(let h of this.vertexMap.values())t.has(h)||n(h,void 0);return{dfnMap:t,lowMap:e,bridges:i,cutVertices:s}}getBiconnectedComponents(){let t=new Map,e=new Map,i=[],s=[],r=0,n=u((h,o)=>{t.set(h,r),e.set(h,r),r++;let l=this.getNeighbors(h),a=0;for(let _ of l){let d=this.getEdge(h,_);if(d){if(t.has(_))_!==o&&t.get(_)<t.get(h)&&(i.push(d),e.set(h,Math.min(e.get(h),t.get(_))));else if(a++,i.push(d),n(_,h),e.set(h,Math.min(e.get(h),e.get(_))),o===void 0&&a>1||o!==void 0&&e.get(_)>=t.get(h)){let p=[],m;do m=i.pop(),m&&p.push(m);while(m&&m!==d);p.length>0&&s.push(p)}}}},"dfs");for(let h of this.vertexMap.values())t.has(h)||(n(h,void 0),i.length>0&&(s.push([...i]),i.length=0));return s}hasCycle(){let t=new Set,e=u((i,s)=>{t.add(i);for(let r of this.getNeighbors(i))if(t.has(r)){if(r!==s)return!0}else if(e(r,i))return!0;return!1},"dfs");for(let i of this.vertexMap.values())if(!t.has(i)&&e(i,void 0))return!0;return!1}getBridges(){return this.tarjan().bridges}getCutVertices(){return this.tarjan().cutVertices}getDFNMap(){return this.tarjan().dfnMap}getLowMap(){return this.tarjan().lowMap}_addEdge(t){for(let e of t.endpoints){let i=this._getVertex(e);if(i===void 0)return!1;if(i){let s=this._edgeMap.get(i);s?s.push(t):this._edgeMap.set(i,[t])}}return!0}};u(ni,"UndirectedGraph");var fe=class extends yt{constructor(t,e,i,s){super(t,e),f(this,"lat"),f(this,"long"),this.lat=i,this.long=s}};u(fe,"MapVertex");var hi=fe,_e=class extends le{constructor(t,e,i,s){super(t,e,i,s)}};u(_e,"MapEdge");var oi=_e,li=class de extends ii{constructor(t,e){super(),f(this,"_originCoord",[0,0]),f(this,"_bottomRight"),this._originCoord=t,this._bottomRight=e}get originCoord(){return this._originCoord}get bottomRight(){return this._bottomRight}createVertex(t,e,i=this.originCoord[0],s=this.originCoord[1]){return new hi(t,e,i,s)}createEdge(t,e,i,s){return new oi(t,e,i,s)}clone(){return super.clone()}_snapshotOptions(){return{...super._snapshotOptions(),originCoord:this.originCoord,bottomRight:this.bottomRight}}_createInstance(t){let{originCoord:e,bottomRight:i}=t||{},s=e!=null?e:this.originCoord,r=i!=null?i:this.bottomRight;return new de(s,r)}};u(li,"MapGraph");var ge=class{constructor(t,e){f(this,"key"),f(this,"value"),f(this,"parent"),f(this,"_left"),f(this,"_right"),f(this,"_height",0),f(this,"_color","BLACK"),f(this,"_count",1),this.key=t,this.value=e}get left(){return this._left}set left(t){t&&(t.parent=this),this._left=t}get right(){return this._right}set right(t){t&&(t.parent=this),this._right=t}get height(){return this._height}set height(t){this._height=t}get color(){return this._color}set color(t){this._color=t}get count(){return this._count}set count(t){this._count=t}get familyPosition(){return this.parent?this.parent.left===this?this.left||this.right?"ROOT_LEFT":"LEFT":this.parent.right===this?this.left||this.right?"ROOT_RIGHT":"RIGHT":"MAL_NODE":this.left||this.right?"ROOT":"ISOLATED"}};u(ge,"BinaryTreeNode");var gt=ge,pe=class st extends et{constructor(t=[],e){if(super(),f(this,"iterationType","ITERATIVE"),f(this,"_isMapMode",!0),f(this,"_isDuplicate",!1),f(this,"_store",new Map),f(this,"_root"),f(this,"_size",0),f(this,"_NIL",new gt(NaN)),f(this,"_toEntryFn"),f(this,"_DEFAULT_NODE_CALLBACK",u(i=>i==null?void 0:i.key,"_DEFAULT_NODE_CALLBACK")),e){let{iterationType:i,toEntryFn:s,isMapMode:r,isDuplicate:n}=e;if(i&&(this.iterationType=i),r!==void 0&&(this._isMapMode=r),n!==void 0&&(this._isDuplicate=n),typeof s=="function")this._toEntryFn=s;else if(s)throw new TypeError(N.notAFunction("toEntryFn","BinaryTree"))}t&&this.setMany(t)}get isMapMode(){return this._isMapMode}get isDuplicate(){return this._isDuplicate}get store(){return this._store}get root(){return this._root}get size(){return this._size}get NIL(){return this._NIL}get toEntryFn(){return this._toEntryFn}createNode(t,e){return new gt(t,e)}createTree(t){return this._createInstance(t)}ensureNode(t,e=this.iterationType){if(t===null)return null;if(t!==void 0&&t!==this._NIL){if(this.isNode(t))return t;if(this.isEntry(t)){let i=t[0];return i===null?null:i===void 0?void 0:this.getNode(i,this._root,e)}return this.getNode(t,this._root,e)}}isNode(t){return t instanceof gt}isRaw(t){return this._toEntryFn!==void 0&&typeof t=="object"}isRealNode(t){return t===this._NIL||t===null||t===void 0?!1:this.isNode(t)}isRealNodeOrNull(t){return t===null||this.isRealNode(t)}isNIL(t){return t===this._NIL}isRange(t){return t instanceof it}isLeaf(t){return t=this.ensureNode(t),t===void 0?!1:t===null?!0:!this.isRealNode(t.left)&&!this.isRealNode(t.right)}isEntry(t){return Array.isArray(t)&&t.length===2}isValidKey(t){return t===null?!0:Z(t)}add(t){return this.set(t)}set(t,e){let[i]=this._keyValueNodeOrEntryToNodeAndValue(t,e);if(i===void 0)return!1;if(!this._root)return this._setRoot(i),this._isMapMode&&i!==null&&i!==void 0&&this._store.set(i.key,i),i!==null&&(this._size=1),!0;let s=new tt([this._root]),r;for(;s.length>0;){let n=s.shift();if(n){if(!this._isDuplicate&&i!==null&&n.key===i.key)return this._replaceNode(n,i),this._isMapMode&&i!==null&&this._store.set(n.key,i),!0;r===void 0&&(n.left===void 0||n.right===void 0)&&(r=n),n.left!==null&&n.left&&s.push(n.left),n.right!==null&&n.right&&s.push(n.right)}}return r?(r.left===void 0?r.left=i:r.right===void 0&&(r.right=i),this._isMapMode&&i!==null&&i!==void 0&&this._store.set(i.key,i),i!==null&&this._size++,!0):!1}addMany(t){return this.setMany(t)}setMany(t,e){let i=[],s;e&&(s=e[Symbol.iterator]());for(let r of t){let n;if(s){let h=s.next();h.done||(n=h.value)}this.isRaw(r)&&(r=this._toEntryFn(r)),i.push(this.set(r,n))}return i}merge(t){this.setMany(t,[])}refill(t,e){this.clear(),this.setMany(t,e)}delete(t){let e=[];if(!this._root)return e;let i=this.getNode(t);if(!i)return e;let s=i==null?void 0:i.parent,r,n=i;if(!i.left&&!i.right&&!s)this._setRoot(void 0);else if(i.left){let h=this.getRightMost(o=>o,i.left);if(h){let o=h.parent;n=this._swapProperties(i,h),this._isMapMode&&(this._store.set(i.key,i),this._store.set(h.key,h)),o&&(o.right===h?o.right=h.left:o.left=h.left,r=o)}}else if(s){let{familyPosition:h}=i;h==="LEFT"||h==="ROOT_LEFT"?s.left=i.right:(h==="RIGHT"||h==="ROOT_RIGHT")&&(s.right=i.right),r=s}else this._setRoot(i.right),i.right=void 0;return this._size=this._size-1,e.push({deleted:n,needBalanced:r}),this._isMapMode&&n&&this._store.delete(n.key),e}search(t,e=!1,i=this._DEFAULT_NODE_CALLBACK,s=this._root,r=this.iterationType){if(t===void 0)return[];if(t===null)return[];if(s=this.ensureNode(s),!s)return[];let n=this._ensurePredicate(t),h=[];if(r==="RECURSIVE"){let o=u(l=>{n(l)&&(h.push(i(l)),e)||!this.isRealNode(l.left)&&!this.isRealNode(l.right)||(this.isRealNode(l.left)&&o(l.left),this.isRealNode(l.right)&&o(l.right))},"dfs");o(s)}else{let o=[s];for(;o.length>0;){let l=o.pop();if(this.isRealNode(l)){if(n(l)&&(h.push(i(l)),e))return h;this.isRealNode(l.left)&&o.push(l.left),this.isRealNode(l.right)&&o.push(l.right)}}}return h}getNodes(t,e=!1,i=this._root,s=this.iterationType){return this.search(t,e,r=>r,i,s)}getNode(t,e=this._root,i=this.iterationType){if(this._isMapMode&&t!==null&&t!==void 0&&!this._isPredicate(t)){let s=this._extractKey(t);return s==null?void 0:this._store.get(s)}return this.search(t,!0,s=>s,e,i)[0]}get(t,e=this._root,i=this.iterationType){var s,r;if(this._isMapMode){let n=this._extractKey(t);return n==null||(s=this._store.get(n))==null?void 0:s.value}return(r=this.getNode(t,e,i))==null?void 0:r.value}has(t,e=this._root,i=this.iterationType){if(this._isMapMode&&t!==void 0&&t!==null&&!this._isPredicate(t)){let s=this._extractKey(t);return s==null?!1:this._store.has(s)}return this.search(t,!0,s=>s,e,i).length>0}clear(){this._clearNodes(),this._isMapMode&&this._clearValues()}isEmpty(){return this._size===0}isPerfectlyBalanced(t=this._root){return this.getMinHeight(t)+1>=this.getHeight(t)}isBST(t=this._root,e=this.iterationType){let i=this.ensureNode(t);if(!i)return!0;if(e==="RECURSIVE"){let s=u((h,o,l)=>{if(!this.isRealNode(h))return!0;let a=Number(h.key);return a<=o||a>=l?!1:s(h.left,o,a)&&s(h.right,a,l)},"dfs"),r=s(i,Number.MIN_SAFE_INTEGER,Number.MAX_SAFE_INTEGER),n=s(i,Number.MAX_SAFE_INTEGER,Number.MIN_SAFE_INTEGER);return r||n}else{let s=u((h=!1)=>{let o=[],l=h?Number.MAX_SAFE_INTEGER:Number.MIN_SAFE_INTEGER,a=i;for(;this.isRealNode(a)||o.length>0;){for(;this.isRealNode(a);)o.push(a),a=a.left;a=o.pop();let _=Number(a.key);if(!this.isRealNode(a)||!h&&l>=_||h&&l<=_)return!1;l=_,a=a.right}return!0},"checkBST"),r=s(),n=s(!0);return r||n}}getDepth(t,e=this._root){let i=this.ensureNode(t),s=this.ensureNode(e),r=0;for(;i!=null&&i.parent;){if(i===s)return r;r++,i=i.parent}return r}getHeight(t=this._root,e=this.iterationType){if(t=this.ensureNode(t),!this.isRealNode(t))return-1;if(e==="RECURSIVE"){let i=u(s=>{if(!this.isRealNode(s))return-1;let r=i(s.left),n=i(s.right);return Math.max(r,n)+1},"_getMaxHeight");return i(t)}else{let i=[{node:t,depth:0}],s=0;for(;i.length>0;){let{node:r,depth:n}=i.pop();this.isRealNode(r.left)&&i.push({node:r.left,depth:n+1}),this.isRealNode(r.right)&&i.push({node:r.right,depth:n+1}),s=Math.max(s,n)}return s}}getMinHeight(t=this._root,e=this.iterationType){if(t=this.ensureNode(t),!t)return-1;if(e==="RECURSIVE"){let i=u(s=>{if(!this.isRealNode(s)||!this.isRealNode(s.left)&&!this.isRealNode(s.right))return 0;let r=i(s.left),n=i(s.right);return Math.min(r,n)+1},"_getMinHeight");return i(t)}else{let i=[],s=t,r=null,n=new Map;for(;i.length>0||s;)if(this.isRealNode(s))i.push(s),s=s.left;else if(s=i[i.length-1],!this.isRealNode(s.right)||r===s.right){if(s=i.pop(),this.isRealNode(s)){let h=this.isRealNode(s.left)?n.get(s.left):-1,o=this.isRealNode(s.right)?n.get(s.right):-1;n.set(s,1+Math.min(h,o)),r=s,s=null}}else s=s.right;return n.get(t)}}getPathToRoot(t,e=this._DEFAULT_NODE_CALLBACK,i=!1){let s=[],r=this.ensureNode(t);if(!r)return s;for(;r.parent;)s.push(e(r)),r=r.parent;return s.push(e(r)),i?s.reverse():s}getLeftMost(t=this._DEFAULT_NODE_CALLBACK,e=this._root,i=this.iterationType){if(this.isNIL(e))return t(void 0);let s=this.ensureNode(e);if(!this.isRealNode(s))return t(void 0);if(i==="RECURSIVE"){let r=u(n=>{let{left:h}=n;return this.isRealNode(h)?r(h):n},"dfs");return t(r(s))}else{let r=mt(n=>{let{left:h}=n;return this.isRealNode(h)?Lt(()=>r(h)):n});return t(r(s))}}getRightMost(t=this._DEFAULT_NODE_CALLBACK,e=this._root,i=this.iterationType){if(this.isNIL(e)||(e=this.ensureNode(e),!e))return t(void 0);if(i==="RECURSIVE"){let s=u(r=>{let{right:n}=r;return this.isRealNode(n)?s(n):r},"dfs");return t(s(e))}else{let s=mt(r=>{let{right:n}=r;return this.isRealNode(n)?Lt(()=>s(n)):r});return t(s(e))}}getPredecessor(t){if(this.isRealNode(t.left)){let e=t.left;for(;!this.isRealNode(e)||this.isRealNode(e.right)&&e.right!==t;)this.isRealNode(e)&&(e=e.right);return e}else return t}getSuccessor(t){if(t=this.ensureNode(t),!this.isRealNode(t))return;if(this.isRealNode(t.right))return this.getLeftMost(i=>i,t.right);let e=t.parent;for(;this.isRealNode(e)&&t===e.right;)t=e,e=e.parent;return e}dfs(t=this._DEFAULT_NODE_CALLBACK,e="IN",i=!1,s=this._root,r=this.iterationType,n=!1){return s=this.ensureNode(s),s?this._dfs(t,e,i,s,r,n):[]}bfs(t=this._DEFAULT_NODE_CALLBACK,e=this._root,i=this.iterationType,s=!1){if(e=this.ensureNode(e),!e)return[];let r=[];if(i==="RECURSIVE"){let n=new tt([e]),h=u(o=>{if(n.length===0)return;let l=n.shift();r.push(t(l)),s?(l&&this.isRealNodeOrNull(l.left)&&n.push(l.left),l&&this.isRealNodeOrNull(l.right)&&n.push(l.right)):(this.isRealNode(l.left)&&n.push(l.left),this.isRealNode(l.right)&&n.push(l.right)),h(o+1)},"dfs");h(0)}else{let n=new tt([e]);for(;n.length>0;){let h=n.length;for(let o=0;o<h;o++){let l=n.shift();r.push(t(l)),s?(l&&this.isRealNodeOrNull(l.left)&&n.push(l.left),l&&this.isRealNodeOrNull(l.right)&&n.push(l.right)):(this.isRealNode(l.left)&&n.push(l.left),this.isRealNode(l.right)&&n.push(l.right))}}}return r}leaves(t=this._DEFAULT_NODE_CALLBACK,e=this._root,i=this.iterationType){e=this.ensureNode(e);let s=[];if(!this.isRealNode(e))return[];if(i==="RECURSIVE"){let r=u(n=>{this.isLeaf(n)&&s.push(t(n)),!(!this.isRealNode(n.left)&&!this.isRealNode(n.right))&&(this.isRealNode(n.left)&&r(n.left),this.isRealNode(n.right)&&r(n.right))},"dfs");r(e)}else{let r=[e];for(;r.length>0;){let n=r.pop();this.isRealNode(n)&&(this.isLeaf(n)&&s.push(t(n)),this.isRealNode(n.right)&&r.push(n.right),this.isRealNode(n.left)&&r.push(n.left))}}return s}listLevels(t=this._DEFAULT_NODE_CALLBACK,e=this._root,i=this.iterationType,s=!1){e=this.ensureNode(e);let r=[];if(!e)return r;if(i==="RECURSIVE"){let n=u((h,o)=>{r[o]||(r[o]=[]),r[o].push(t(h)),s?(h&&this.isRealNodeOrNull(h.left)&&n(h.left,o+1),h&&this.isRealNodeOrNull(h.right)&&n(h.right,o+1)):(h&&h.left&&n(h.left,o+1),h&&h.right&&n(h.right,o+1))},"_recursive");n(e,0)}else{let n=[[e,0]];for(;n.length>0;){let h=n.pop(),[o,l]=h;r[l]||(r[l]=[]),r[l].push(t(o)),s?(o&&this.isRealNodeOrNull(o.right)&&n.push([o.right,l+1]),o&&this.isRealNodeOrNull(o.left)&&n.push([o.left,l+1])):(o&&o.right&&n.push([o.right,l+1]),o&&o.left&&n.push([o.left,l+1]))}}return r}morris(t=this._DEFAULT_NODE_CALLBACK,e="IN",i=this._root){if(i=this.ensureNode(i),!i)return[];let s=[],r=i,n=u(o=>{let l=null,a=null;for(;o;)a=o.right,o.right=l,l=o,o=a;return l},"_reverseEdge"),h=u(o=>{let l=n(o),a=l;for(;a;)s.push(t(a)),a=a.right;n(l)},"_printEdge");switch(e){case"IN":for(;r;){if(r.left){let o=this.getPredecessor(r);if(o.right)o.right=null;else{o.right=r,r=r.left;continue}}s.push(t(r)),r=r.right}break;case"PRE":for(;r;){if(r.left){let o=this.getPredecessor(r);if(o.right)o.right=null;else{o.right=r,s.push(t(r)),r=r.left;continue}}else s.push(t(r));r=r.right}break;case"POST":for(;r;){if(r.left){let o=this.getPredecessor(r);if(o.right===null){o.right=r,r=r.left;continue}else o.right=null,h(r.left)}r=r.right}h(i);break}return s}clone(){let t=this._createInstance();return this._clone(t),t}filter(t,e){let i=this._createInstance(),s=0;for(let[r,n]of this)t.call(e,n,r,s++,this)&&i.set([r,n]);return i}map(t,e,i){let s=this._createLike([],e),r=0;for(let[n,h]of this)s.set(t.call(i,h,n,r++,this));return s}toVisual(t=this._root,e){let i={isShowUndefined:!1,isShowNull:!0,isShowRedBlackNIL:!1,...e};t=this.ensureNode(t);let s="";return t&&(i.isShowUndefined&&(s+=`U for undefined
|
|
4
4
|
`),i.isShowNull&&(s+=`N for null
|
|
@@ -28,6 +28,12 @@ data-structure-typed/dist/esm-legacy/index.mjs:
|
|
|
28
28
|
* @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
|
|
29
29
|
* @license MIT License
|
|
30
30
|
*)
|
|
31
|
+
(**
|
|
32
|
+
* data-structure-typed
|
|
33
|
+
*
|
|
34
|
+
* @author Pablo Zeng
|
|
35
|
+
* @license MIT License
|
|
36
|
+
*)
|
|
31
37
|
(**
|
|
32
38
|
* data-structure-typed
|
|
33
39
|
*
|