diff --git a/.nycrc.json b/.nycrc.json
index 76620cd..0cbfa5f 100644
--- a/.nycrc.json
+++ b/.nycrc.json
@@ -2,9 +2,6 @@
     "extends": "@istanbuljs/nyc-config-typescript",
     "all": true,
     "check-coverage": true,
-    "exclude": [
-        "src/TODO/**/*"
-    ],
     "extension": [".ts", ".tsx"],
     "include": [
         "src/**/*"
diff --git a/README.md b/README.md
index 0454869..83af152 100644
--- a/README.md
+++ b/README.md
@@ -39,6 +39,12 @@ See [docs/](./docs/README.md) or the [wiki](https://github.com/havelessbemore/da
 - [LinkedStack](docs/classes/linkedstack.md)
 - [SkewHeap](docs/classes/skewheap.md)
 
+### Utilities
+- [ArrayUtils](docs/modules/arrayutils.md)
+- [IteratorUtils](docs/modules/iteratorutils.md)
+- [NumberUtils](docs/modules/numberutils.md)
+- [u32](docs/modules/u32.md)
+
 ## Contribute
 
 There are many ways to contribute:
diff --git a/src/TODO/array/bigArray.ts b/TODO/array/bigArray.ts
similarity index 100%
rename from src/TODO/array/bigArray.ts
rename to TODO/array/bigArray.ts
diff --git a/src/TODO/segmentTree/operation.ts b/TODO/segmentTree/operation.ts
similarity index 100%
rename from src/TODO/segmentTree/operation.ts
rename to TODO/segmentTree/operation.ts
diff --git a/src/TODO/trie/genericTrie.ts b/TODO/trie/genericTrie.ts
similarity index 100%
rename from src/TODO/trie/genericTrie.ts
rename to TODO/trie/genericTrie.ts
diff --git a/src/TODO/trie/index.ts b/TODO/trie/index.ts
similarity index 100%
rename from src/TODO/trie/index.ts
rename to TODO/trie/index.ts
diff --git a/src/TODO/trie/prefixTrie.ts b/TODO/trie/prefixTrie.ts
similarity index 100%
rename from src/TODO/trie/prefixTrie.ts
rename to TODO/trie/prefixTrie.ts
diff --git a/src/TODO/trie/suffixTrie.ts b/TODO/trie/suffixTrie.ts
similarity index 100%
rename from src/TODO/trie/suffixTrie.ts
rename to TODO/trie/suffixTrie.ts
diff --git a/src/TODO/trie/trie.ts b/TODO/trie/trie.ts
similarity index 100%
rename from src/TODO/trie/trie.ts
rename to TODO/trie/trie.ts
diff --git a/dist/dastal.min.js b/dist/dastal.min.js
index be94993..875a36f 100644
--- a/dist/dastal.min.js
+++ b/dist/dastal.min.js
@@ -1,2 +1,2 @@
-!function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e():"function"==typeof define&&define.amd?define("Dastal",[],e):"object"==typeof exports?exports.Dastal=e():t.Dastal=e()}(self,(function(){return(()=>{"use strict";var t={d:(e,r)=>{for(var n in r)t.o(r,n)&&!t.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:r[n]})},o:(t,e)=>Object.prototype.hasOwnProperty.call(t,e),r:t=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})}},e={};t.r(e),t.d(e,{AATree:()=>ie,AVLTree:()=>ce,ArrayList:()=>rt,ArrayQueue:()=>_t,ArrayStack:()=>Vt,BinaryHeap:()=>b,DoublyLinkedList:()=>ut,InOrderSegmentTree:()=>Ut,LevelOrderSegmentTree:()=>Ht,LinkedList:()=>yt,LinkedQueue:()=>Pt,LinkedStack:()=>Nt,SkewHeap:()=>U,math:()=>n});var r={};t.r(r),t.d(r,{bitsSet:()=>gt,invert:()=>pt,isPow2:()=>dt,lsb:()=>bt,lsp:()=>mt,lsps:()=>kt,mlsp:()=>xt,msb:()=>wt,msp:()=>At,msps:()=>St,reverse:()=>zt,u32:()=>jt});var n={};t.r(n),t.d(n,{clamp:()=>$,u32:()=>r});var i=4294967295;function a(t){return t instanceof Array||u(t)}var o,l,u=(o=Object.getPrototypeOf(Uint8Array),function(t){return t instanceof o});function s(t,e,r){for(var n=r[t];t>0;){var i=Math.floor((t+1)/2)-1,a=r[i];if(e(a,n)<=0)break;r[i]=n,r[t]=a,t=i}}function h(t,e){for(var r=e.length+1>>>1;r>0;f(--r,t,e));}function f(t,e,r){for(var n=r.length,i=r[t];;){var a=2*t+1;if(a>=n)break;var o=r[a];if(a+1<n&&e(r[a+1],o)<=0&&(o=r[++a]),e(i,o)<=0)break;r[t]=o,r[a]=i,t=a}}function c(t,e){for(var r,n=[],i=0;i<e.length;++i)null!=e[i]&&n.push({value:e[i]});if(n.length<2)return null===(r=n[0])||void 0===r?void 0:r.value;for(var a=0;a<n.length;++a){for(var o=n[a],l=o.value;l=l.right;)o={next:o,value:l};n[a]=o}for(var u=function(t,e){var r=function(e,r){return t(e.value,r.value)};h(r,e);for(var n=e[0],i=n;e.length>1;i=i.next){var a;e[0]=null!==(a=e[0].next)&&void 0!==a?a:e.pop(),f(0,r,e),i.next=e[0]}return n}((function(e,r){return t(r.value,e.value)}),n),s=u.value;u=u.next;){var c=u.value;c.right=c.left,c.left=s,s=c}return s}function v(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return y(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?y(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function y(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function g(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function p(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}l=Symbol.iterator;var d,b=function(){function t(e,r){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),p(this,"array",void 0),p(this,"compare",void 0),this.compare=e,this.array=[],this.addAll(null!=r?r:[])}var e,r;return e=t,(r=[{key:"addAll",value:function(t){var e=this.array,r=e.length;if(a(t)){if(e.length+t.length>i)throw new RangeError("Invalid heap length");for(var n=0;n<t.length;++n)e.push(t[n])}else{var o,l=v(t);try{for(l.s();!(o=l.n()).done;){var u=o.value;if(e.length>=i)throw new RangeError("Invalid heap length");e.push(u)}}catch(t){l.e(t)}finally{l.f()}}return r<e.length&&h(this.compare,e),e.length}},{key:"clear",value:function(){this.array.length=0}},{key:"comparator",value:function(){return this.compare}},{key:"contains",value:function(t){return this.array.indexOf(t)>=0}},{key:"delete",value:function(t){var e=this.array.indexOf(t);if(e<0)return!1;var r=this.array.pop();return e>=this.array.length||(this.array[e]=r,f(e,this.compare,this.array),s(e,this.compare,this.array)),!0}},{key:"merge",value:function(t){var e=this.array;if(t.size<1)return this;if(e.length+t.size>i)throw new RangeError("Invalid heap length");var r,n=v(t);try{for(n.s();!(r=n.n()).done;){var a=r.value;e.push(a)}}catch(t){n.e(t)}finally{n.f()}return h(this.compare,e),this}},{key:"peek",value:function(){return this.array.length>0?this.array[0]:void 0}},{key:"pop",value:function(){if(!(this.array.length<1)){var t=this.array[0],e=this.array.pop();return this.array.length>0&&(this.array[0]=e,f(0,this.compare,this.array)),t}}},{key:"push",value:function(t){return this.array.push(t),s(this.array.length-1,this.compare,this.array),this.size}},{key:"pushPop",value:function(t){if(this.array.length<1||this.compare(t,this.array[0])<=0)return t;var e=this.array[0];return this.array[0]=t,f(0,this.compare,this.array),e}},{key:"replace",value:function(t){if(!(this.array.length<1)){var e=this.array[0];return this.array[0]=t,t=e,f(0,this.compare,this.array),t}this.array.push(t)}},{key:"size",get:function(){return this.array.length}},{key:"sorted",value:regeneratorRuntime.mark((function e(){var r,n,i,a=this;return regeneratorRuntime.wrap((function(e){for(;;)switch(e.prev=e.next){case 0:if(!(this.array.length<1)){e.next=2;break}return e.abrupt("return");case 2:r=this.array,n=new t((function(t,e){return a.compare(r[t],r[e])}),[0]);case 4:if(!((i=n.pop())<r.length)){e.next=11;break}return e.next=8,r[i];case 8:(i=2*i+1)<r.length&&n.push(i),++i<r.length&&n.push(i);case 11:if(n.size>0){e.next=4;break}case 12:case"end":return e.stop()}}),e,this)}))},{key:l,value:function(){return this.array[Symbol.iterator]()}},{key:"update",value:function(t,e){var r=this.array.indexOf(t);return!(r<0||(this.array[r]=e,f(r,this.compare,this.array),s(r,this.compare,this.array),0))}}])&&g(e.prototype,r),t}(),m=regeneratorRuntime.mark(z),k=regeneratorRuntime.mark(O);function x(t){var e=!(arguments.length>1&&void 0!==arguments[1])||arguments[1],r=t.value,n=r.to;if(null==n)return t;if(null==n.right)n=n.left;else if(null==n.left)n=n.right;else if(e){var i=(r=(t=P(t)).value).to;n.value=i.value,n=i.right}else{var a=(r=(t=j(t)).value).to;n.value=a.value,n=a.left}return r.to=n,r.from&&(r.from[r.label]=r.to=n),t}function w(t){if(null!=t){var e=Object.assign({},t),r={value:e};do{t=r.value,r=r.next,t.left&&(r={next:r,value:t.left=Object.assign({},t.left)}),t.right&&(r={next:r,value:t.right=Object.assign({},t.right)})}while(r);return e}}function A(t){if(null!=t){for(;t.left;)t=t.left;return t}}function S(t){var e=t.value.to;if(null==e)return t;for(;e.left;)t={next:t,value:{label:"left",from:e,to:e.left}},e=e.left;return t}function z(t){var e;return regeneratorRuntime.wrap((function(r){for(;;)switch(r.prev=r.next){case 0:for(e=void 0;t;)e={next:e,value:t},t=t.left;case 2:if(!e){r.next=11;break}return t=e.value,e=e.next,r.next=7,t;case 7:for(t=t.right;t;)e={next:e,value:t},t=t.left;r.next=2;break;case 11:case"end":return r.stop()}}),m)}function j(t){var e=t.value.to;return null==e?t:_(t={next:t,value:{label:"left",from:e,to:e.left}})}function O(t){var e;return regeneratorRuntime.wrap((function(r){for(;;)switch(r.prev=r.next){case 0:e={value:t};case 1:if(t=e.value,e=e.next,!t){r.next=8;break}return r.next=6,t;case 6:e={next:e={next:e,value:t.right},value:t.left};case 8:if(e){r.next=1;break}case 9:case"end":return r.stop()}}),k)}function R(t){if(null!=t){for(;t.right;)t=t.right;return t}}function _(t){var e=t.value.to;if(null==e)return t;for(;e.right;)t={next:t,value:{label:"right",from:e,to:e.right}},e=e.right;return t}function I(t,e,r){for(;e;){var n=r(t,e.value);if(0==n)break;e=n<0?e.left:e.right}return e}function E(t,e,r){for(var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0,i=["left","right"],a=e.value.to;a;){var o=r(t,a.value)||n;if(0===o)break;var l=i[+(o>0)];e={next:e,value:{label:l,from:a,to:a[l]}},a=a[l]}return e}function P(t){var e=t.value.to;return null==e?t:S(t={next:t,value:{label:"right",from:e,to:e.right}})}function T(t){if(!(null==t||t.length<1||null==t[0])){var e=t.length,r=new Array(e);r[0]={value:t[0]};for(var n=1;n<e;++n)if(null!=t[n]){var i=r[n-1>>>1],a={value:t[n]};r[n]=a,1&n?i.left=a:i.right=a}return r[0]}}function M(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return C(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?C(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function C(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function F(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function W(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}d=Symbol.iterator;var U=function(){function t(e,r){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),W(this,"compare",void 0),W(this,"length",void 0),W(this,"root",void 0),this.compare=e,this.length=0,this.addAll(null!=r?r:[])}var e,r;return e=t,(r=[{key:"addAll",value:function(e){if(a(e))for(var r=0;r<e.length;++r)this.push(e[r]);else if(e instanceof t||e instanceof b)this.merge(e);else{var n,i=M(e);try{for(i.s();!(n=i.n()).done;){var o=n.value;this.push(o)}}catch(t){i.e(t)}finally{i.f()}}return this.length}},{key:"clear",value:function(){this.length=0,this.root=void 0}},{key:"comparator",value:function(){return this.compare}},{key:"contains",value:function(t){var e,r=M(O(this.root));try{for(r.s();!(e=r.n()).done;)if(t===e.value.value)return!0}catch(t){r.e(t)}finally{r.f()}return!1}},{key:"delete",value:function(t){if(null==this.root)return!1;if(this.root.value===t)return this.pop(),!0;var e,r=M(O(this.root));try{for(r.s();!(e=r.n()).done;){var n=e.value,i=n.left&&n.left.value===t?"left":n.right&&n.right.value===t?"right":void 0;if(null!=i){var a=n[i];return n[i]=c(this.compare,[a.left,a.right]),--this.length,!0}}}catch(t){r.e(t)}finally{r.f()}return!1}},{key:"merge",value:function(e){return this.compare!==e.comparator()?this.addAll(e):e instanceof t?(this.root=c(this.compare,[this.root,w(e.root)]),this.length+=e.size):e instanceof b?(this.root=c(this.compare,[this.root,T(e.array)]),this.length+=e.size):this.addAll(e),this}},{key:"peek",value:function(){var t;return null===(t=this.root)||void 0===t?void 0:t.value}},{key:"pop",value:function(){if(null!=this.root){var t=this.root.value;return this.root=c(this.compare,[this.root.left,this.root.right]),--this.length,t}}},{key:"push",value:function(t){return this.root=c(this.compare,[this.root,{value:t}]),++this.length}},{key:"pushPop",value:function(t){return this.push(t),this.pop()}},{key:"replace",value:function(t){if(null==this.root)return this.root={value:t},void(this.length=1);var e=this.root.value;return this.root=c(this.compare,[this.root.left,this.root.right,{value:t}]),e}},{key:"size",get:function(){return this.length}},{key:"sorted",value:regeneratorRuntime.mark((function e(){var r,n,i=this;return regeneratorRuntime.wrap((function(e){for(;;)switch(e.prev=e.next){case 0:if(null!=this.root){e.next=2;break}return e.abrupt("return");case 2:r=new t((function(t,e){return i.compare(t.value,e.value)}),[this.root]);case 3:return n=r.pop(),e.next=6,n.value;case 6:n.left&&r.push(n.left),n.right&&r.push(n.right);case 8:if(r.size>0){e.next=3;break}case 9:case"end":return e.stop()}}),e,this)}))},{key:d,value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=M(O(this.root)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:"update",value:function(t,e){if(null==this.root)return!1;if(this.root.value===t)return this.root=c(this.compare,[this.root.left,this.root.right,{value:e}]),!0;var r,n=void 0,i=M(O(this.root));try{for(i.s();!(r=i.n()).done;){var a=r.value;if(a.left&&a.left.value===t){n=a.left,a.left=void 0;break}if(a.right&&a.right.value===t){n=a.right,a.right=void 0;break}}}catch(t){i.e(t)}finally{i.f()}return null!=n&&(this.root=c(this.compare,[this.root,n.left,n.right,{value:e}]),!0)}}])&&F(e.prototype,r),t}();function $(t,e,r){return Math.min(r,Math.max(e,t))}function L(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return q(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?q(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function q(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}var X,Z=regeneratorRuntime.mark(Q),D=regeneratorRuntime.mark(B);function H(t,e){return a(e)?Q(t,e):B(t,e)}function Q(t,e){var r,n,i;return regeneratorRuntime.wrap((function(a){for(;;)switch(a.prev=a.next){case 0:r=0;case 1:if(!(r<e.length)){a.next=18;break}return i=r+t,a.next=5,e.slice(r,i);case 5:if(a.t1=n=a.sent,a.t0=null!==a.t1,!a.t0){a.next=9;break}a.t0=void 0!==n;case 9:if(!a.t0){a.next=13;break}a.t2=n,a.next=14;break;case 13:a.t2=t;case 14:t=a.t2,r=i,a.next=1;break;case 18:case"end":return a.stop()}}),Z)}function B(t,e){var r,n,i,a,o;return regeneratorRuntime.wrap((function(l){for(;;)switch(l.prev=l.next){case 0:r=[],n=L(e),l.prev=2,n.s();case 4:if((i=n.n()).done){l.next=22;break}if(a=i.value,!(r.push(a)>=t)){l.next=20;break}return l.next=9,r;case 9:if(l.t1=o=l.sent,l.t0=null!==l.t1,!l.t0){l.next=13;break}l.t0=void 0!==o;case 13:if(!l.t0){l.next=17;break}l.t2=o,l.next=18;break;case 17:l.t2=t;case 18:t=l.t2,r=[];case 20:l.next=4;break;case 22:l.next=27;break;case 24:l.prev=24,l.t3=l.catch(2),n.e(l.t3);case 27:return l.prev=27,n.f(),l.finish(27);case 30:if(!(r.length>0)){l.next=33;break}return l.next=33,r;case 33:case"end":return l.stop()}}),D,null,[[2,24,27,30]])}function V(t,e,r){return $(function(t,e){return t<0?e+t:t}(t,r),e,r)}function G(t,e,r,n){if(e<2)return[t,t];e/=2;var i=[Math.ceil(e),Math.floor(e)],a=G(t,i[0],r,n),o=G(a[1].next,i[1],r,n);t=a[1],a[1]=o[0],o[0]=t,o[0].next=o[1].next;var l=a[0].prev;return t=function(t,e,r,n){var i={},a=i;do{var o=+(n(t[0].value,t[1].value)>0);a.next=t[o],r&&(a.next.prev=a),a=a.next,t[o]=a.next,--e[o]}while(e[0]>0&&e[1]>0);return a.next=t[+(e[0]<1)],r&&a.next&&(a.next.prev=a),i.next}(a,i,r,n),r&&(t.prev=l),[t,o[+(i[0]<1)]]}function J(t){return function(t){if(Array.isArray(t))return Y(t)}(t)||function(t){if("undefined"!=typeof Symbol&&null!=t[Symbol.iterator]||null!=t["@@iterator"])return Array.from(t)}(t)||N(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()}function K(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=N(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function N(t,e){if(t){if("string"==typeof t)return Y(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?Y(t,e):void 0}}function Y(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function tt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}X=Symbol.iterator;var et,rt=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="array")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this[r]=n,this.array=e?Array.from(e):[]}var e,r;return e=t,(r=[{key:"add",value:function(t,e){return t>=0&&t<=this.size&&this.array.splice(t,0,e),this.size}},{key:"addAll",value:function(t,e){if(t>=0&&t<=this.size){var r,n=K(H(1e4,e));try{for(n.s();!(r=n.n()).done;){var i,a=r.value;(i=this.array).splice.apply(i,[t,0].concat(J(a))),t+=a.length}}catch(t){n.e(t)}finally{n.f()}}return this.size}},{key:"clear",value:function(){this.array.length=0}},{key:"concat",value:function(){for(var e=new t(this),r=arguments.length,n=new Array(r),i=0;i<r;i++)n[i]=arguments[i];for(var a=0,o=n;a<o.length;a++){var l=o[a];e.addAll(e.size,l)}return e}},{key:"copyWithin",value:function(t,e,r){var n,i,a;return t=V(null!==(n=t)&&void 0!==n?n:0,0,this.size),e=V(null!==(i=e)&&void 0!==i?i:0,0,this.size),r=V(null!==(a=r)&&void 0!==a?a:this.size,0,this.size),this.array.copyWithin(t,e,r),this}},{key:"fill",value:function(t,e,r){var n,i;return e=V(null!==(n=e)&&void 0!==n?n:0,0,this.size),r=V(null!==(i=r)&&void 0!==i?i:this.size,0,this.size),this.array.fill(t,e,r),this}},{key:"get",value:function(t){return t<0||t>=this.size?void 0:this.array[t]}},{key:"getSet",value:function(t,e){var r=void 0;return t>=0&&t<this.size&&(r=this.array[t],this.array[t]=e(r)),r}},{key:"pop",value:function(){return this.array.pop()}},{key:"push",value:function(t){return this.array.push(t)}},{key:"remove",value:function(t){return t<0||t>=this.size?void 0:this.array.splice(t,1)[0]}},{key:"reverse",value:function(t,e){var r,n;for(t=V(null!==(r=t)&&void 0!==r?r:0,0,this.size),e=V(null!==(n=e)&&void 0!==n?n:this.size,0,this.size)-1;t<e;){var i=this.array[t];this.array[t++]=this.array[e],this.array[e--]=i}return this}},{key:"set",value:function(t,e){var r=void 0;return t>=0&&t<this.size&&(r=this.array[t],this.array[t]=e),r}},{key:"shift",value:function(){return this.array.shift()}},{key:"size",get:function(){return this.array.length}},{key:"slice",value:function(e,r){return new t(this.array.slice(e,r))}},{key:"splice",value:function(e,r,n){var i,a;e=V(null!==(i=e)&&void 0!==i?i:0,0,this.size),r=$(null!==(a=r)&&void 0!==a?a:this.size,0,this.size-e);var o,l=new t(this.array.splice(e,r)),u=K(H(1e4,null!=n?n:[]));try{for(u.s();!(o=u.n()).done;){var s,h=o.value;(s=this.array).splice.apply(s,[e,0].concat(J(h))),e+=h.length}}catch(t){u.e(t)}finally{u.f()}return l}},{key:"sort",value:function(t){return this.array.sort(t),this}},{key:X,value:function(){return this.array[Symbol.iterator]()}},{key:"unshift",value:function(t){return this.array.unshift(t)}},{key:"update",value:function(t,e,r){var n,i;for(null==r&&(arguments.length<2?(r=t,t=void 0):(r=e,e=void 0)),t=V(null!==(n=t)&&void 0!==n?n:0,0,this.size),e=V(null!==(i=e)&&void 0!==i?i:this.size,0,this.size);t<e;)this.array[t]=r(this.array[t],t),++t;return this}},{key:"view",value:regeneratorRuntime.mark((function t(e,r){var n,i,a=this;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=V(null!==(n=e)&&void 0!==n?n:0,0,this.size),i=null==r?function(){return a.size}:r>=0?function(){return Math.min(r,a.size)}:function(){return a.size+r};case 2:if(!(e<i())){t.next=7;break}return t.next=5,this.array[e++];case 5:t.next=2;break;case 7:case"end":return t.stop()}}),t,this)}))}])&&tt(e.prototype,r),t}();function nt(t,e){if(t){if("string"==typeof t)return it(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?it(t,e):void 0}}function it(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function at(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function ot(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}et=Symbol.iterator;var lt,ut=function(){function t(e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),ot(this,"length",void 0),ot(this,"root",void 0),this.length=0,this.root={},this.root.prev=this.root.next=this.root,this._addAll(this.root,null!=e?e:[])}var e,r;return e=t,(r=[{key:"add",value:function(t,e){if(t<0||t>this.length)return this.length;var r=this._get(t-1),n={next:r.next,prev:r,value:e};return r.next=n,n.next.prev=n,++this.length}},{key:"addAll",value:function(t,e){return t>=0&&t<=this.length&&this._addAll(this._get(t),e),this.length}},{key:"clear",value:function(){this.length=0,this.root.prev=this.root.next=this.root}},{key:"concat",value:function(){for(var e=new t(this),r=arguments.length,n=new Array(r),i=0;i<r;i++)n[i]=arguments[i];for(var a=0,o=n;a<o.length;a++){var l=o[a];e.addAll(e.size,l)}return e}},{key:"copyWithin",value:function(t,e,r){var n,i;if(t=V(t,0,this.length),(e=V(null!==(n=e)&&void 0!==n?n:0,0,this.length))===t)return this;if(r=V(null!==(i=r)&&void 0!==i?i:this.length,0,this.length),e>=(r=e+Math.min(r-e,this.length-t)))return this;if(e<t&&t<r){var a=this._get(r),o=this._get(t+(r-e));do{a=a.prev,(o=o.prev).value=a.value}while(++e<r);return this}var l=this._get(e),u=this._get(t);do{u.value=l.value,l=l.next,u=u.next}while(++e<r);return this}},{key:"fill",value:function(t,e,r){var n,i;if((e=V(null!==(n=e)&&void 0!==n?n:0,0,this.length))<(r=V(null!==(i=r)&&void 0!==i?i:this.length,0,this.length))){var a=this._get(e);do{a.value=t,a=a.next}while(++e<r)}return this}},{key:"get",value:function(t){return t<0||t>=this.length?void 0:this._get(t).value}},{key:"getSet",value:function(t,e){if(!(t<0||t>=this.length)){var r=this._get(t),n=r.value;return r.value=e(r.value),n}}},{key:"pop",value:function(){if(!(this.length<1)){var t=this.root.prev;return t.prev.next=this.root,this.root.prev=t.prev,--this.length,t.value}}},{key:"push",value:function(t){var e=this.root.prev,r={next:this.root,prev:e,value:t};return e.next=this.root.prev=r,++this.length}},{key:"remove",value:function(t){if(!(t<0||t>=this.length)){var e=this._get(t);return e.prev.next=e.next,e.next.prev=e.prev,--this.length,e.value}}},{key:"reverse",value:function(t,e){var r,n;if(t=V(null!==(r=t)&&void 0!==r?r:0,0,this.length),(e=V(null!==(n=e)&&void 0!==n?n:this.length,0,this.length))-t<2)return this;var i=this._get(t-1),a=i.next,o=a;do{var l=o.next;o.next=o.prev,o.prev=l,i.next=o,o=l}while(++t<e);return a.next=o,o.prev=a,i.next.prev=i,this}},{key:"set",value:function(t,e){if(!(t<0||t>=this.length)){var r=this._get(t),n=r.value;return r.value=e,n}}},{key:"shift",value:function(){if(!(this.length<1)){var t=this.root.next;return t.next.prev=this.root,this.root.next=t.next,--this.length,t.value}}},{key:"size",get:function(){return this.length}},{key:"slice",value:function(e,r){return new t(this.view(e,r))}},{key:"splice",value:function(e,r,n){var i,a;e=V(null!==(i=e)&&void 0!==i?i:0,0,this.size),r=$(null!==(a=r)&&void 0!==a?a:this.size,0,this.size-e);var o=new t;if(null==n&&r<1)return o;for(var l=this._get(e);r-- >0;)o.push(l.value),l.prev.next=l.next,l.next.prev=l.prev,l=l.next,--this.length;return this._addAll(l,null!=n?n:[]),o}},{key:"sort",value:function(t){if(this.length>1){var e=(i=G(this.root.next,this.length,!0,t),a=2,function(t){if(Array.isArray(t))return t}(i)||function(t,e){var r=null==t?null:"undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(null!=r){var n,i,a=[],o=!0,l=!1;try{for(r=r.call(t);!(o=(n=r.next()).done)&&(a.push(n.value),!e||a.length!==e);o=!0);}catch(t){l=!0,i=t}finally{try{o||null==r.return||r.return()}finally{if(l)throw i}}return a}}(i,a)||nt(i,a)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()),r=e[0],n=e[1];this.root.next=r,n.next.prev=n}var i,a;return this}},{key:et,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=this.root.next;case 1:if(e===this.root){t.next=7;break}return t.next=4,e.value;case 4:e=e.next,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"unshift",value:function(t){var e=this.root.next,r={next:e,prev:this.root,value:t};return this.root.next=e.prev=r,++this.length}},{key:"update",value:function(t,e,r){var n,i;if(null==r&&(arguments.length<2?(r=t,t=void 0):(r=e,e=void 0)),(t=V(null!==(n=t)&&void 0!==n?n:0,0,this.length))<(e=V(null!==(i=e)&&void 0!==i?i:this.length,0,this.length))){var a=this._get(t);do{a.value=r(a.value,t),a=a.next}while(++t<e)}return this}},{key:"view",value:regeneratorRuntime.mark((function t(e,r){var n,i,a,o=this;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:if(!((e=V(null!==(n=e)&&void 0!==n?n:0,0,this.length))<(i=null==r?function(){return o.length}:r>=0?function(){return r}:function(){return o.length+r})())){t.next=8;break}a=this._get(e);case 4:return t.next=6,a.value;case 6:a=a.next;case 7:if(++e<i()&&a!==this.root){t.next=4;break}case 8:case"end":return t.stop()}}),t,this)}))},{key:"_addAll",value:function(t,e){var r,n=t.prev,i=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=nt(t))){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(e);try{for(i.s();!(r=i.n()).done;){var a={prev:n,value:r.value};n.next=a,n=a,++this.length}}catch(t){i.e(t)}finally{i.f()}n.next=t,t.prev=n}},{key:"_get",value:function(t){var e=this.root;if(t<this.length/2)for(;t-- >=0;)e=e.next;else for(t=this.length-t;t>0;--t)e=e.prev;return e}}])&&at(e.prototype,r),t}();function st(t,e){if(t){if("string"==typeof t)return ht(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?ht(t,e):void 0}}function ht(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function ft(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function ct(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}lt=Symbol.iterator;var vt,yt=function(){function t(e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),ct(this,"length",void 0),ct(this,"root",void 0),ct(this,"tail",void 0),this.length=0,this.root={},this.root.next=this.root,this.tail=this._addAll(this.root,null!=e?e:[])}var e,r;return e=t,(r=[{key:"add",value:function(t,e){if(t>=0&&t<this.length){var r=this._get(t-1);r.next={value:e,next:r.next},++this.length}else t===this.length&&this.push(e);return this.length}},{key:"addAll",value:function(t,e){return t>=0&&t<this.length?this._addAll(this._get(t-1),e):t===this.length&&(this.tail=this._addAll(this.tail,e)),this.length}},{key:"clear",value:function(){this.length=0,this.tail=this.root.next=this.root}},{key:"concat",value:function(){for(var e=new t(this),r=arguments.length,n=new Array(r),i=0;i<r;i++)n[i]=arguments[i];for(var a=0,o=n;a<o.length;a++){var l=o[a];e.addAll(e.size,l)}return e}},{key:"copyWithin",value:function(t,e,r){var n,i;if(t=V(t,0,this.length),(e=V(null!==(n=e)&&void 0!==n?n:0,0,this.length))===t)return this;if(r=V(null!==(i=r)&&void 0!==i?i:this.length,0,this.length),e>=(r=e+Math.min(r-e,this.length-t)))return this;if(t<e){var a=this._get(t-1);return this._copyWithin(this._get(e-t-1,a),a,r-e),this}if(t>r){var o=this._get(e-1);return this._copyWithin(o,this._get(t-e-1,o),r-e),this}var l=this._get(e-1),u=this._get(r-e-1,l),s=this._copyWithin(l,u,t-e);t+(r-e)>=this.length&&(this.tail=u);var h=l.next;return l.next=u.next,u.next=s.next,s.next=h,this}},{key:"fill",value:function(t,e,r){var n,i;if((e=V(null!==(n=e)&&void 0!==n?n:0,0,this.length))<(r=V(null!==(i=r)&&void 0!==i?i:this.length,0,this.length))){var a=this._get(e);do{a.value=t,a=a.next}while(++e<r)}return this}},{key:"get",value:function(t){if(!(t<0||t>=this.length))return t<this.length-1?this._get(t).value:this.tail.value}},{key:"getSet",value:function(t,e){if(!(t<0||t>=this.length)){var r=t<this.length-1?this._get(t):this.tail,n=r.value;return r.value=e(r.value),n}}},{key:"pop",value:function(){if(!(this.length<1)){var t=this.tail.value;return this.tail=this._get(this.length-2),this.tail.next=this.root,--this.length,t}}},{key:"push",value:function(t){var e={next:this.root,value:t};return this.tail.next=e,this.tail=e,++this.length}},{key:"remove",value:function(t){if(!(t<0||t>=this.length)){var e=this._get(t-1),r=e.next;return e.next=r.next,t===--this.length&&(this.tail=e),r.value}}},{key:"reverse",value:function(t,e){var r,n;if(t=V(null!==(r=t)&&void 0!==r?r:0,0,this.length),(e=V(null!==(n=e)&&void 0!==n?n:this.length,0,this.length))-t<2)return this;var i=this._get(t-1);this.tail=e>=this.length?i.next:this.tail;for(var a=i.next,o=a,l=a.next;++t<e;){var u=l.next;l.next=o,o=l,l=u}return i.next=o,a.next=l,this}},{key:"set",value:function(t,e){if(!(t<0||t>=this.length)){var r=this._get(t),n=r.value;return r.value=e,n}}},{key:"shift",value:function(){return this.remove(0)}},{key:"size",get:function(){return this.length}},{key:"slice",value:function(e,r){return new t(this.view(e,r))}},{key:"splice",value:function(e,r,n){var i,a;e=V(null!==(i=e)&&void 0!==i?i:0,0,this.size),r=$(null!==(a=r)&&void 0!==a?a:this.size,0,this.size-e);var o=new t;if(null==n&&r<1)return o;for(var l=this._get(e-1),u=e+r>=this.size;r-- >0;){var s=l.next;o.push(s.value),l.next=s.next,--this.length}return l=this._addAll(l,null!=n?n:[]),this.tail=u?l:this.tail,o}},{key:"sort",value:function(t){if(this.length>1){var e=(i=G(this.root.next,this.length,!1,t),a=2,function(t){if(Array.isArray(t))return t}(i)||function(t,e){var r=null==t?null:"undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(null!=r){var n,i,a=[],o=!0,l=!1;try{for(r=r.call(t);!(o=(n=r.next()).done)&&(a.push(n.value),!e||a.length!==e);o=!0);}catch(t){l=!0,i=t}finally{try{o||null==r.return||r.return()}finally{if(l)throw i}}return a}}(i,a)||st(i,a)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()),r=e[0],n=e[1];this.root.next=r,this.tail=n}var i,a;return this}},{key:lt,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=this.root.next;case 1:if(e===this.root){t.next=7;break}return t.next=4,e.value;case 4:e=e.next,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"unshift",value:function(t){return this.add(0,t)}},{key:"update",value:function(t,e,r){var n,i;if(null==r&&(arguments.length<2?(r=t,t=void 0):(r=e,e=void 0)),(t=V(null!==(n=t)&&void 0!==n?n:0,0,this.length))<(e=V(null!==(i=e)&&void 0!==i?i:this.length,0,this.length))){var a=this._get(t);do{a.value=r(a.value,t),a=a.next}while(++t<e)}return this}},{key:"view",value:regeneratorRuntime.mark((function t(e,r){var n,i,a,o=this;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:if(!((e=V(null!==(n=e)&&void 0!==n?n:0,0,this.length))<(i=null==r?function(){return o.length}:r>=0?function(){return r}:function(){return o.length+r})())){t.next=8;break}a=this._get(e);case 4:return t.next=6,a.value;case 6:a=a.next;case 7:if(++e<i()&&a!==this.root){t.next=4;break}case 8:case"end":return t.stop()}}),t,this)}))},{key:"_addAll",value:function(t,e){var r,n=t.next,i=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=st(t))){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(e);try{for(i.s();!(r=i.n()).done;){var a={value:r.value};t.next=a,t=a,++this.length}}catch(t){i.e(t)}finally{i.f()}return t.next=n,t}},{key:"_copyWithin",value:function(t,e,r){for(;r-- >0;)t=t.next,(e=e.next).value=t.value;return e}},{key:"_get",value:function(t){for(var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:this.root,r=e;t-- >=0;)r=r.next;return r}}])&&ft(e.prototype,r),t}();function gt(t){for(var e=0;t;)++e,t&=t-1;return e}function pt(t){var e=At(t);return jt(t^(e|e-1))}function dt(t){return 0==(t&t-1)}function bt(t){var e=-1;for(t=mt(t);t;t>>>=1)++e;return e}function mt(t){return jt(t&-t)}function kt(t){return jt(t&mt(t+mt(t))-1)}function xt(t){return mt(t+mt(t))>>>1||jt(2147483648&t)}function wt(t){for(var e=-1;0!==t;)++e,t>>>=1;return e}function At(t){for(var e=t&-t;t!=e;)e=(t^=e)&-t;return jt(e)}function St(t){for(var e=t&-t;t&t+e;)e=(t^=e)&-t;return jt(t)}function zt(t){return jt((t=(4278255360&(t=(4042322160&(t=(3435973836&(t=(2863311530&t)>>>1|(1431655765&t)<<1))>>>2|(858993459&t)<<2))>>>4|(252645135&t)<<4))>>>8|(16711935&t)<<8)>>>16|t<<16)}function jt(t){return t>>>0}function Ot(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}vt=Symbol.iterator;var Rt,_t=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="array")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this[r]=n,this.array=e?Array.from(e):[]}var e,r;return e=t,(r=[{key:"clear",value:function(){this.array.length=0}},{key:"dequeue",value:function(){return this.size<1?void 0:this.array.shift()}},{key:"enqueue",value:function(t){return this.array.push(t)}},{key:"peek",value:function(){return this.size<1?void 0:this.array[0]}},{key:"size",get:function(){return this.array.length}},{key:vt,value:function(){return this.array[Symbol.iterator]()}}])&&Ot(e.prototype,r),t}();function It(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}Rt=Symbol.iterator;var Et,Pt=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="list")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this.list=n,this.list=new yt(e)}var e,r;return e=t,(r=[{key:"clear",value:function(){this.list.clear()}},{key:"dequeue",value:function(){return this.list.shift()}},{key:"enqueue",value:function(t){return this.list.push(t)}},{key:"peek",value:function(){return this.list.get(0)}},{key:"size",get:function(){return this.list.size}},{key:Rt,value:function(){return this.list[Symbol.iterator]()}}])&&It(e.prototype,r),t}();function Tt(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function Mt(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}function Ct(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function Ft(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}Et=Symbol.iterator;var Wt,Ut=function(){function t(e){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];Mt(this,t),Ft(this,"array",void 0),Ft(this,"combine",void 0),this.array=[],this.combine=e,this.build(r)}var e,r;return e=t,(r=[{key:"clear",value:function(){this.array.length=0}},{key:"pop",value:function(){if(!(this.size<1)){for(var t=this.array.length-1,e=2;t&e;e*=2)this.array[t-e]=this.array[t-e-(e>>>1)];var r=this.array[t-1];return this.array.length-=2,r}}},{key:"push",value:function(e){if(this.size>=t.MAX_SIZE)throw new RangeError("Invalid length");var r=this.array.length;return this.array[r+1]=this.set(r,e),this.size}},{key:"query",value:function(t,e){if(t>=e)throw new RangeError("Range [".concat(t,"..").concat(e,") is empty"));if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));var r=mt((t*=2)|At((e*=2)-t)),n=this.array[t-1+(r>>>1)];for(t+=r;t<e;t+=r)r=mt(t|At(e-t)),n=this.combine(n,this.array[t-1+(r>>>1)]);return n}},{key:"size",get:function(){return this.array.length>>>1}},{key:Et,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=0;case 1:if(!(e<this.array.length)){t.next=7;break}return t.next=4,this.array[e];case 4:e+=2,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"update",value:function(t,e,r){if(!(t>=e)){if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));var n;t*=2,e*=2;do{n=this.set(t,r(this.array[t],t>>>1)),t+=2}while(t<e);var i=0,a=mt(t);for(e=wt(t^this.array.length)-bt(t),--t;e>0;--e)n=this.combine(n,this.array[t+(a>>>1)-i]),this.array[t]=n,t+=a-(i=(t&2*a)>>>0),a*=2;this.array[t]=n}}},{key:"build",value:function(t){var e,r=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return Tt(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?Tt(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(t);try{for(r.s();!(e=r.n()).done;){var n=e.value;this.push(n)}}catch(t){r.e(t)}finally{r.f()}}},{key:"set",value:function(t,e){this.array[t++]=e;for(var r=2;t&r;r*=2)e=this.combine(this.array[t-r-(r>>>1)],e),this.array[t-r]=e;return e}}])&&Ct(e.prototype,r),t}();function $t(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return Lt(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?Lt(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function Lt(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function qt(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}function Xt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function Zt(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}Ft(Ut,"MAX_SIZE",2147483647),Wt=Symbol.iterator;var Dt,Ht=function(){function t(e){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];qt(this,t),Zt(this,"array",void 0),Zt(this,"combine",void 0),Zt(this,"length",void 0),Zt(this,"level",void 0),this.array=[],this.combine=e,this.length=0,this.level=0,this.build(r)}var e,r;return e=t,(r=[{key:"clear",value:function(){this.length=0,this.level=0,this.array.length=0}},{key:"pop",value:function(){if(!(this.length<=this.level)){var t=this.array[--this.length];return this.length<=this.array.length+1>>>2&&this.shrink(),t}}},{key:"push",value:function(t){this.length>=this.array.length&&this.grow(),this.array[this.length++]=t;for(var e=this.length;1&e;this.array[e-1]=t)t=this.combine(this.array[e-2],t),e>>>=1;return this.size}},{key:"query",value:function(t,e){if(t>=e)throw new RangeError("Range [".concat(t,"..").concat(e,") is empty"));if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));var r=mt((t+=this.level+1)|At((e+=this.level+1)-t)),n=this.array[t/r-1];for(t+=r;t<e;)r=mt(t|At(e-t)),n=this.combine(n,this.array[t/r-1]),t+=r;return n}},{key:"size",get:function(){return this.length-this.level}},{key:Wt,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=0;case 1:if(!(e<this.size)){t.next=7;break}return t.next=4,this.array[this.level+e];case 4:++e,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"update",value:function(t,e,r){if(!(t>=e)){if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));t+=this.level,e+=this.level;for(var n=t;n<e;++n)this.array[n]=r(this.array[n],n-this.level);this.aggregate(t,e)}}},{key:"aggregate",value:function(t,e){++t,++e;for(var r=this.length+1;t<e;r>>>=1){e+=e&e-r>>>31;for(var n=(1|t)>>>0;n<e;n+=2)this.array[(n>>>1)-1]=this.combine(this.array[n-2],this.array[n-1]);t>>>=1,e>>>=1}}},{key:"build",value:function(e){var r,n=void 0;if(a(e))n="length";else{if(!("size"in(r=e))||"number"!=typeof r.size){var i,o=$t(e);try{for(o.s();!(i=o.n()).done;){var l=i.value;this.push(l)}}catch(t){o.e(t)}finally{o.f()}return}n="size"}var u=e[n];if(u<1)return this.array.length=0,this.length=0,void(this.level=0);if(u>=t.MAX_SIZE)throw new RangeError("Invalid length");this.level=2*At(u-1)-1,this.length=this.level,this.array.length=2*this.level+1;var s,h=$t(e);try{for(h.s();!(s=h.n()).done;){var f=s.value;this.array[this.length++]=f}}catch(t){h.e(t)}finally{h.f()}this.aggregate(this.level,this.length)}},{key:"grow",value:function(){if(this.size<1)this.array.length=1;else{if(this.size>=t.MAX_SIZE)throw new RangeError("Invalid length");this.array.length+=this.array.length+1;for(var e=this.level+1,r=this.length+1;e<r;r>>>=1)this.array.copyWithin(2*e-1,e-1,r-1),e>>>=1;this.length+=this.level+1,this.level+=this.level+1}}},{key:"shrink",value:function(){var t=this.length-this.level;if(t<2)return this.array.copyWithin(0,this.level,this.length),this.level=0,this.length=t,void(this.array.length=t);var e=this.level+1,r=At(t);e=e/mt(e|r)-1,this.level=+!dt(t);for(var n=e+1;r;this.level+=this.level+1)this.array.copyWithin(this.level,e,n),e+=e+1,n+=n+2+ +((t&(r>>>=1))>0);this.length=this.level+t,this.array.length=2*this.level+1}}])&&Xt(e.prototype,r),t}();function Qt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}Zt(Ht,"MAX_SIZE",2147483648),Dt=Symbol.iterator;var Bt,Vt=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="array")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this[r]=n,this.array=e?Array.from(e):[]}var e,r;return e=t,(r=[{key:"clear",value:function(){this.array.length=0}},{key:"peek",value:function(){return this.array[this.array.length-1]}},{key:"pop",value:function(){return this.array.pop()}},{key:"push",value:function(t){return this.array.push(t)}},{key:"size",get:function(){return this.array.length}},{key:Dt,value:regeneratorRuntime.mark((function t(){var e,r;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=this.array,r=e.length;case 2:if(!(r>0)){t.next=7;break}case 3:return t.next=5,e[--r];case 5:t.next=2;break;case 7:case"end":return t.stop()}}),t,this)}))}])&&Qt(e.prototype,r),t}();function Gt(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function Jt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}Bt=Symbol.iterator;var Kt,Nt=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="list")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this.list=n,this.list=new yt;var i,a=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return Gt(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?Gt(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(e||[]);try{for(a.s();!(i=a.n()).done;){var o=i.value;this.push(o)}}catch(t){a.e(t)}finally{a.f()}}var e,r;return e=t,(r=[{key:"clear",value:function(){this.list.clear()}},{key:"peek",value:function(){return this.list.get(0)}},{key:"pop",value:function(){return this.list.shift()}},{key:"push",value:function(t){return this.list.unshift(t)}},{key:"size",get:function(){return this.list.size}},{key:Bt,value:function(){return this.list[Symbol.iterator]()}}])&&Jt(e.prototype,r),t}();function Yt(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return te(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?te(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function te(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function ee(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function re(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}Kt=Symbol.iterator;var ne,ie=function(){function t(e,r,n){var i;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),re(this,"compare",void 0),re(this,"dupeWeight",void 0),re(this,"length",void 0),re(this,"root",void 0),"boolean"!=typeof r&&(n=r,r=!0),this.compare=e,this.dupeWeight=+r,this.length=0,this.build(null!==(i=n)&&void 0!==i?i:[])}var e,r;return e=t,(r=[{key:"add",value:function(t){var e={left:this.root},r={from:e,label:"left",to:this.root},n=E(t,{value:r},this.compare,this.dupeWeight);if(null!=n.value.to)return this;var i=(r=n.value).label;for(r.from[i]={level:1,value:t};n.next;)(r=(n=n.next).value).to=le(oe(r.to)),r.from[i=r.label]=r.to;return++this.length,this.root=e.left,this}},{key:"clear",value:function(){this.root=void 0,this.length=0}},{key:"comparator",value:function(){return this.compare}},{key:"delete",value:function(t){var e={left:this.root},r=ae(E(t,{value:{from:e,label:"left",to:this.root}},this.compare,0));return this.root=e.left,this.length-=+r,r}},{key:"has",value:function(t){return null!=I(t,this.root,this.compare)}},{key:"max",value:function(){var t;return null===(t=R(this.root))||void 0===t?void 0:t.value}},{key:"min",value:function(){var t;return null===(t=A(this.root))||void 0===t?void 0:t.value}},{key:"pop",value:function(){var t,e={left:this.root},r=_({value:{from:e,label:"left",to:this.root}}),n=null===(t=r.value.to)||void 0===t?void 0:t.value,i=ae(r);return this.root=e.left,this.length-=+i,n}},{key:"shift",value:function(){var t,e={left:this.root},r=S({value:{from:e,label:"left",to:this.root}}),n=null===(t=r.value.to)||void 0===t?void 0:t.value,i=ae(r);return this.root=e.left,this.length-=+i,n}},{key:"size",get:function(){return this.length}},{key:"sorted",value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=Yt(z(this.root)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:Kt,value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=Yt(O(this.root)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:"update",value:function(t,e){return!!this.delete(t)&&(this.add(e),!0)}},{key:"build",value:function(e){if(a(e))for(var r=0;r<e.length;++r)this.add(e[r]);else if(e instanceof t&&this.compare===e.compare)this.root=w(e.root),this.length=e.size;else{var n,i=Yt(e);try{for(i.s();!(n=i.n()).done;){var o=n.value;this.add(o)}}catch(t){i.e(t)}finally{i.f()}}}}])&&ee(e.prototype,r),t}();function ae(t){var e=t.value,r=e.to;if(null==r)return!1;for(t=x(t);t.next;){var n,i,a,o;r=(e=(t=t.next).value).to;var l=1+Math.min(null!==(n=null===(i=r.left)||void 0===i?void 0:i.level)&&void 0!==n?n:0,null!==(a=null===(o=r.right)||void 0===o?void 0:o.level)&&void 0!==a?a:0);l<r.level&&(r.level=l,null!=r.right&&l<r.right.level&&(r.right.level=l)),(r=oe(r)).right=oe(r.right),null!=r.right&&(r.right.right=oe(r.right.right)),(r=le(r)).right=le(r.right),e.from[e.label]=e.to=r}return!0}function oe(t){if(null==t||null==t.left||t.level!=t.left.level)return t;var e=t.left;return t.left=e.right,e.right=t,e}function le(t){if(null==t||null==t.right||null==t.right.right||t.level!=t.right.right.level)return t;var e=t.right;return t.right=e.left,e.left=t,++e.level,e}function ue(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return se(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?se(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function se(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function he(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function fe(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}ne=Symbol.iterator;var ce=function(){function t(e,r,n){var i;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),fe(this,"compare",void 0),fe(this,"dupeWeight",void 0),fe(this,"length",void 0),fe(this,"root",void 0),"boolean"!=typeof r&&(n=r,r=!0),this.compare=e,this.dupeWeight=+r,this.length=0,this.root={},this.build(null!==(i=n)&&void 0!==i?i:[])}var e,r;return e=t,(r=[{key:"add",value:function(t){var e={from:this.root,label:"left",to:this.root.left},r=E(t,{value:e},this.compare,this.dupeWeight);if(null!=r.value.to)return this;var n=(e=r.value).label;for(e.from[n]={balanceFactor:0,value:t};r.next&&((e=(r=r.next).value).to.balanceFactor+="left"===n?-1:1,e.to=ve(e.to),e.from[n=e.label]=e.to,0!==e.to.balanceFactor););return++this.length,this}},{key:"clear",value:function(){this.root.left=void 0,this.length=0}},{key:"comparator",value:function(){return this.compare}},{key:"delete",value:function(t){var e=ye(E(t,{value:{from:this.root,label:"left",to:this.root.left}},this.compare,0));return this.length-=+e,e}},{key:"has",value:function(t){return null!=I(t,this.root.left,this.compare)}},{key:"max",value:function(){var t;return null===(t=R(this.root.left))||void 0===t?void 0:t.value}},{key:"min",value:function(){var t;return null===(t=A(this.root.left))||void 0===t?void 0:t.value}},{key:"pop",value:function(){var t,e=_({value:{from:this.root,label:"left",to:this.root.left}}),r=null===(t=e.value.to)||void 0===t?void 0:t.value,n=ye(e);return this.length-=+n,r}},{key:"shift",value:function(){var t,e=S({value:{from:this.root,label:"left",to:this.root.left}}),r=null===(t=e.value.to)||void 0===t?void 0:t.value,n=ye(e);return this.length-=+n,r}},{key:"size",get:function(){return this.length}},{key:"sorted",value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=ue(z(this.root.left)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:ne,value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=ue(O(this.root.left)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:"update",value:function(t,e){return!!this.delete(t)&&(this.add(e),!0)}},{key:"build",value:function(e){if(a(e))for(var r=0;r<e.length;++r)this.add(e[r]);else if(e instanceof t&&this.compare===e.compare)this.root=w(e.root),this.length=e.size;else{var n,i=ue(e);try{for(i.s();!(n=i.n()).done;){var o=n.value;this.add(o)}}catch(t){i.e(t)}finally{i.f()}}}}])&&he(e.prototype,r),t}();function ve(t){return t.balanceFactor>1?(t.right.balanceFactor<0&&(t.right=pe(t.right)),t=ge(t)):t.balanceFactor<-1&&(t.left.balanceFactor>0&&(t.left=ge(t.left)),t=pe(t)),t}function ye(t){var e=t.value;if(null==e.to)return!1;for(var r=(t=x(t)).value.label;t.next&&((e=(t=t.next).value).to.balanceFactor-="left"===r?-1:1,e.to=ve(e.to),e.from[r=e.label]=e.to,0===e.to.balanceFactor););return!0}function ge(t){var e=t.right;return t.right=e.left,e.left=t,t.balanceFactor-=1+Math.max(0,e.balanceFactor),e.balanceFactor-=1-Math.min(0,t.balanceFactor),e}function pe(t){var e=t.left;return t.left=e.right,e.right=t,t.balanceFactor+=1-Math.min(0,e.balanceFactor),e.balanceFactor+=1+Math.max(0,t.balanceFactor),e}return e})()}));
+!function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e():"function"==typeof define&&define.amd?define("Dastal",[],e):"object"==typeof exports?exports.Dastal=e():t.Dastal=e()}(self,(function(){return(()=>{"use strict";var t={d:(e,r)=>{for(var n in r)t.o(r,n)&&!t.o(e,n)&&Object.defineProperty(e,n,{enumerable:!0,get:r[n]})},o:(t,e)=>Object.prototype.hasOwnProperty.call(t,e),r:t=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})}},e={};t.r(e),t.d(e,{AATree:()=>he,AVLTree:()=>be,ArrayList:()=>ut,ArrayQueue:()=>Ct,ArrayStack:()=>te,ArrayUtils:()=>i,BinaryHeap:()=>U,DoublyLinkedList:()=>gt,InOrderSegmentTree:()=>Dt,IteratorUtils:()=>r,LevelOrderSegmentTree:()=>Yt,LinkedList:()=>xt,LinkedQueue:()=>Ut,LinkedStack:()=>ie,NumberUtils:()=>n,SkewHeap:()=>at,isCollection:()=>_,u32:()=>a});var r={};t.r(r),t.d(r,{always:()=>o,fill:()=>l,first:()=>u,join:()=>s,never:()=>h,once:()=>f,skip:()=>c,split:()=>v});var n={};t.r(n),t.d(n,{clamp:()=>y,wrap:()=>d,wrapLeft:()=>g,wrapRight:()=>p});var i={};t.r(i),t.d(i,{MAX_ARRAY_LENGTH:()=>x,MAX_SAFE_ARGUMENT_LENGTH:()=>w,isArray:()=>A,isTypedArray:()=>j,splice:()=>O});var a={};function o(t){return{next:function(){return{done:!1,value:t()}}}}function l(t,e){return{next:function(){return t<1?{done:!0,value:void 0}:(--t,{done:!1,value:e()})}}}function u(t,e){return{next:function(){if(t<1)return{done:!0,value:void 0};var r=e.next();return t=r.done?0:t-1,r}}}function s(t){var e={next:function(){return{done:!0,value:void 0}}};return{next:function(){if(null==e)return{done:!0,value:void 0};for(var r=e.next();r.done;){var n=t.next();if(n.done)return e=void 0,{done:!0,value:void 0};r=(e=n.value).next()}return r}}}function h(){return{next:function(){return{done:!0,value:void 0}}}}function f(t){var e=!1;return{next:function(){var r={done:e,value:t()};return e=!0,t=function(){},r}}}function c(t,e){var r=function(){for(var n={done:!1,value:void 0};t-- >0&&!n.done;)n=e.next();return r=e.next.bind(e),n};return{next:function(){return r()}}}function v(t,e){if(t<1)return{next:function(){return{done:!0,value:void 0}}};var r=!1;return{next:function(){if(r)return{done:r,value:void 0};var n=u(t,e),i=n.next();return i.done?{done:r=!0,value:void 0}:{done:r,value:s([f((function(){return i.value})),n][Symbol.iterator]())}}}}function y(t,e,r){return Math.min(r,Math.max(e,t))}function g(t,e,r){return t<e?r-e+t:t}function p(t,e,r){return t>r?e+(t-r):t}function d(t,e,r){return t<e?r-e+t:p(t,e,r)}function b(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}function m(t){return function(t){if(Array.isArray(t))return k(t)}(t)||function(t){if("undefined"!=typeof Symbol&&null!=t[Symbol.iterator]||null!=t["@@iterator"])return Array.from(t)}(t)||function(t,e){if(t){if("string"==typeof t)return k(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?k(t,e):void 0}}(t)||function(){throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()}function k(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}t.r(a),t.d(a,{bitsSet:()=>wt,invert:()=>At,isPow2:()=>St,lsb:()=>zt,lsp:()=>jt,lsps:()=>Ot,msb:()=>_t,msp:()=>Rt,msps:()=>It,reverse:()=>Et,u32:()=>Pt});var x=4294967295,w=32767;function A(t){return t instanceof Array||j(t)}var S,z,j=(S=Object.getPrototypeOf(Uint8Array),function(t){return t instanceof S});function O(t,e,r,n){var i,a;if(e=y(g(null!==(i=e)&&void 0!==i?i:0,0,t.length),0,t.length),r=y(null!==(a=r)&&void 0!==a?a:t.length,0,t.length-e),null==n)return t.splice(e,r);var o=w-2,l=n[Symbol.iterator](),s=t.length-r,h=x-s,f=Math.min(o,h),c=t.splice.apply(t,[e,r].concat(m(b({},Symbol.iterator,(function(){return u(f,l)})))));for(e+=s=t.length-s,f=h-s;f>=o&&s>=o;f-=s)s=t.length,t.splice.apply(t,[e,0].concat(m(b({},Symbol.iterator,(function(){return u(o,l)}))))),e+=s=t.length-s;if(f>0&&s>=o&&t.splice.apply(t,[e,0].concat(m(b({},Symbol.iterator,(function(){return u(f,l)}))))),1!=l.next().done)throw new RangeError("Invalid array length");return c}function _(t){return null!=t&&"number"==typeof t.size&&"function"==typeof t[Symbol.iterator]}function R(t,e,r){for(var n=r[t];t>0;){var i=Math.floor((t+1)/2)-1,a=r[i];if(e(a,n)<=0)break;r[i]=n,r[t]=a,t=i}}function I(t,e){for(var r=e.length+1>>>1;r>0;E(--r,t,e));}function E(t,e,r){for(var n=r.length,i=r[t];;){var a=2*t+1;if(a>=n)break;var o=r[a];if(a+1<n&&e(r[a+1],o)<=0&&(o=r[++a]),e(i,o)<=0)break;r[t]=o,r[a]=i,t=a}}function P(t,e){for(var r,n=[],i=0;i<e.length;++i)null!=e[i]&&n.push({value:e[i]});if(n.length<2)return null===(r=n[0])||void 0===r?void 0:r.value;for(var a=0;a<n.length;++a){for(var o=n[a],l=o.value;l=l.right;)o={next:o,value:l};n[a]=o}for(var u=function(t,e){var r=function(e,r){return t(e.value,r.value)};I(r,e);for(var n=e[0],i=n;e.length>1;i=i.next){var a;e[0]=null!==(a=e[0].next)&&void 0!==a?a:e.pop(),E(0,r,e),i.next=e[0]}return n}((function(e,r){return t(r.value,e.value)}),n),s=u.value;u=u.next;){var h=u.value;h.right=h.left,h.left=s,s=h}return s}function T(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return M(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?M(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function M(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function C(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function F(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}z=Symbol.iterator;var W,U=function(){function t(e,r){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),F(this,"array",void 0),F(this,"compare",void 0),this.compare=e,this.array=[],this.addAll(null!=r?r:[])}var e,r;return e=t,(r=[{key:"addAll",value:function(t){var e=this.array,r=e.length;if(A(t)){if(e.length+t.length>x)throw new RangeError("Invalid heap length");for(var n=0;n<t.length;++n)e.push(t[n])}else{var i,a=T(t);try{for(a.s();!(i=a.n()).done;){var o=i.value;if(e.length>=x)throw new RangeError("Invalid heap length");e.push(o)}}catch(t){a.e(t)}finally{a.f()}}return r<e.length&&I(this.compare,e),e.length}},{key:"clear",value:function(){this.array.length=0}},{key:"comparator",value:function(){return this.compare}},{key:"contains",value:function(t){return this.array.indexOf(t)>=0}},{key:"delete",value:function(t){var e=this.array.indexOf(t);if(e<0)return!1;var r=this.array.pop();return e>=this.array.length||(this.array[e]=r,E(e,this.compare,this.array),R(e,this.compare,this.array)),!0}},{key:"merge",value:function(t){var e=this.array;if(t.size<1)return this;if(e.length+t.size>x)throw new RangeError("Invalid heap length");var r,n=T(t);try{for(n.s();!(r=n.n()).done;){var i=r.value;e.push(i)}}catch(t){n.e(t)}finally{n.f()}return I(this.compare,e),this}},{key:"peek",value:function(){return this.array.length>0?this.array[0]:void 0}},{key:"pop",value:function(){if(!(this.array.length<1)){var t=this.array[0],e=this.array.pop();return this.array.length>0&&(this.array[0]=e,E(0,this.compare,this.array)),t}}},{key:"push",value:function(t){return this.array.push(t),R(this.array.length-1,this.compare,this.array),this.size}},{key:"pushPop",value:function(t){if(this.array.length<1||this.compare(t,this.array[0])<=0)return t;var e=this.array[0];return this.array[0]=t,E(0,this.compare,this.array),e}},{key:"replace",value:function(t){if(!(this.array.length<1)){var e=this.array[0];return this.array[0]=t,t=e,E(0,this.compare,this.array),t}this.array.push(t)}},{key:"size",get:function(){return this.array.length}},{key:"sorted",value:regeneratorRuntime.mark((function e(){var r,n,i,a=this;return regeneratorRuntime.wrap((function(e){for(;;)switch(e.prev=e.next){case 0:if(!(this.array.length<1)){e.next=2;break}return e.abrupt("return");case 2:r=this.array,n=new t((function(t,e){return a.compare(r[t],r[e])}),[0]);case 4:if(!((i=n.pop())<r.length)){e.next=11;break}return e.next=8,r[i];case 8:(i=2*i+1)<r.length&&n.push(i),++i<r.length&&n.push(i);case 11:if(n.size>0){e.next=4;break}case 12:case"end":return e.stop()}}),e,this)}))},{key:z,value:function(){return this.array[Symbol.iterator]()}},{key:"update",value:function(t,e){var r=this.array.indexOf(t);return!(r<0||(this.array[r]=e,E(r,this.compare,this.array),R(r,this.compare,this.array),0))}}])&&C(e.prototype,r),t}(),L=regeneratorRuntime.mark(H),$=regeneratorRuntime.mark(G);function X(t){var e=!(arguments.length>1&&void 0!==arguments[1])||arguments[1],r=t.value,n=r.to;if(null==n)return t;if(null==n.right)n=n.left;else if(null==n.left)n=n.right;else if(e){var i=(r=(t=J(t)).value).to;n.value=i.value,n=i.right}else{var a=(r=(t=N(t)).value).to;n.value=a.value,n=a.left}return r.to=n,r.from&&(r.from[r.label]=r.to=n),t}function q(t){if(null!=t){var e=Object.assign({},t),r={value:e};do{t=r.value,r=r.next,t.left&&(r={next:r,value:t.left=Object.assign({},t.left)}),t.right&&(r={next:r,value:t.right=Object.assign({},t.right)})}while(r);return e}}function Z(t){if(null!=t){for(;t.left;)t=t.left;return t}}function D(t){var e=t.value.to;if(null==e)return t;for(;e.left;)t={next:t,value:{label:"left",from:e,to:e.left}},e=e.left;return t}function H(t){var e;return regeneratorRuntime.wrap((function(r){for(;;)switch(r.prev=r.next){case 0:for(e=void 0;t;)e={next:e,value:t},t=t.left;case 2:if(!e){r.next=11;break}return t=e.value,e=e.next,r.next=7,t;case 7:for(t=t.right;t;)e={next:e,value:t},t=t.left;r.next=2;break;case 11:case"end":return r.stop()}}),L)}function N(t){var e=t.value.to;return null==e?t:B(t={next:t,value:{label:"left",from:e,to:e.left}})}function G(t){var e;return regeneratorRuntime.wrap((function(r){for(;;)switch(r.prev=r.next){case 0:e={value:t};case 1:if(t=e.value,e=e.next,!t){r.next=8;break}return r.next=6,t;case 6:e={next:e={next:e,value:t.right},value:t.left};case 8:if(e){r.next=1;break}case 9:case"end":return r.stop()}}),$)}function Q(t){if(null!=t){for(;t.right;)t=t.right;return t}}function B(t){var e=t.value.to;if(null==e)return t;for(;e.right;)t={next:t,value:{label:"right",from:e,to:e.right}},e=e.right;return t}function V(t,e,r){for(;e;){var n=r(t,e.value);if(0==n)break;e=n<0?e.left:e.right}return e}function Y(t,e,r){for(var n=arguments.length>3&&void 0!==arguments[3]?arguments[3]:0,i=["left","right"],a=e.value.to;a;){var o=r(t,a.value)||n;if(0===o)break;var l=i[+(o>0)];e={next:e,value:{label:l,from:a,to:a[l]}},a=a[l]}return e}function J(t){var e=t.value.to;return null==e?t:D(t={next:t,value:{label:"right",from:e,to:e.right}})}function K(t){if(!(null==t||t.length<1||null==t[0])){var e=t.length,r=new Array(e);r[0]={value:t[0]};for(var n=1;n<e;++n)if(null!=t[n]){var i=r[n-1>>>1],a={value:t[n]};r[n]=a,1&n?i.left=a:i.right=a}return r[0]}}function tt(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return et(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?et(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function et(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function rt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function nt(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}W=Symbol.iterator;var it,at=function(){function t(e,r){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),nt(this,"compare",void 0),nt(this,"length",void 0),nt(this,"root",void 0),this.compare=e,this.length=0,this.addAll(null!=r?r:[])}var e,r;return e=t,(r=[{key:"addAll",value:function(e){if(A(e))for(var r=0;r<e.length;++r)this.push(e[r]);else if(e instanceof t||e instanceof U)this.merge(e);else{var n,i=tt(e);try{for(i.s();!(n=i.n()).done;){var a=n.value;this.push(a)}}catch(t){i.e(t)}finally{i.f()}}return this.length}},{key:"clear",value:function(){this.length=0,this.root=void 0}},{key:"comparator",value:function(){return this.compare}},{key:"contains",value:function(t){var e,r=tt(G(this.root));try{for(r.s();!(e=r.n()).done;)if(t===e.value.value)return!0}catch(t){r.e(t)}finally{r.f()}return!1}},{key:"delete",value:function(t){if(null==this.root)return!1;if(this.root.value===t)return this.pop(),!0;var e,r=tt(G(this.root));try{for(r.s();!(e=r.n()).done;){var n=e.value,i=n.left&&n.left.value===t?"left":n.right&&n.right.value===t?"right":void 0;if(null!=i){var a=n[i];return n[i]=P(this.compare,[a.left,a.right]),--this.length,!0}}}catch(t){r.e(t)}finally{r.f()}return!1}},{key:"merge",value:function(e){return this.compare!==e.comparator()?this.addAll(e):e instanceof t?(this.root=P(this.compare,[this.root,q(e.root)]),this.length+=e.size):e instanceof U?(this.root=P(this.compare,[this.root,K(e.array)]),this.length+=e.size):this.addAll(e),this}},{key:"peek",value:function(){var t;return null===(t=this.root)||void 0===t?void 0:t.value}},{key:"pop",value:function(){if(null!=this.root){var t=this.root.value;return this.root=P(this.compare,[this.root.left,this.root.right]),--this.length,t}}},{key:"push",value:function(t){return this.root=P(this.compare,[this.root,{value:t}]),++this.length}},{key:"pushPop",value:function(t){return this.push(t),this.pop()}},{key:"replace",value:function(t){if(null==this.root)return this.root={value:t},void(this.length=1);var e=this.root.value;return this.root=P(this.compare,[this.root.left,this.root.right,{value:t}]),e}},{key:"size",get:function(){return this.length}},{key:"sorted",value:regeneratorRuntime.mark((function e(){var r,n,i=this;return regeneratorRuntime.wrap((function(e){for(;;)switch(e.prev=e.next){case 0:if(null!=this.root){e.next=2;break}return e.abrupt("return");case 2:r=new t((function(t,e){return i.compare(t.value,e.value)}),[this.root]);case 3:return n=r.pop(),e.next=6,n.value;case 6:n.left&&r.push(n.left),n.right&&r.push(n.right);case 8:if(r.size>0){e.next=3;break}case 9:case"end":return e.stop()}}),e,this)}))},{key:W,value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=tt(G(this.root)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:"update",value:function(t,e){if(null==this.root)return!1;if(this.root.value===t)return this.root=P(this.compare,[this.root.left,this.root.right,{value:e}]),!0;var r,n=void 0,i=tt(G(this.root));try{for(i.s();!(r=i.n()).done;){var a=r.value;if(a.left&&a.left.value===t){n=a.left,a.left=void 0;break}if(a.right&&a.right.value===t){n=a.right,a.right=void 0;break}}}catch(t){i.e(t)}finally{i.f()}return null!=n&&(this.root=P(this.compare,[this.root,n.left,n.right,{value:e}]),!0)}}])&&rt(e.prototype,r),t}();function ot(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}it=Symbol.iterator;var lt,ut=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="array")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this[r]=n,this.array=e?Array.from(e):[]}var e,r;return e=t,(r=[{key:"add",value:function(t,e){return t>=0&&t<=this.size&&this.array.splice(t,0,e),this.size}},{key:"addAll",value:function(t,e){return t>=0&&t<=this.size&&O(this.array,t,0,e),this.size}},{key:"clear",value:function(){this.array.length=0}},{key:"concat",value:function(){for(var e=new t(this),r=arguments.length,n=new Array(r),i=0;i<r;i++)n[i]=arguments[i];for(var a=0,o=n;a<o.length;a++){var l=o[a];e.addAll(e.size,l)}return e}},{key:"copyWithin",value:function(t,e,r){var n,i;return t=y(g(t,0,this.size),0,this.size),e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.size),0,this.size),r=y(g(null!==(i=r)&&void 0!==i?i:this.size,0,this.size),0,this.size),this.array.copyWithin(t,e,r),this}},{key:"fill",value:function(t,e,r){var n,i;return e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.size),0,this.size),r=y(g(null!==(i=r)&&void 0!==i?i:this.size,0,this.size),0,this.size),this.array.fill(t,e,r),this}},{key:"get",value:function(t){return t<0||t>=this.size?void 0:this.array[t]}},{key:"getSet",value:function(t,e){var r=void 0;return t>=0&&t<this.size&&(r=this.array[t],this.array[t]=e(r)),r}},{key:"pop",value:function(){return this.array.pop()}},{key:"push",value:function(t){return this.array.push(t)}},{key:"remove",value:function(t){return t<0||t>=this.size?void 0:this.array.splice(t,1)[0]}},{key:"reverse",value:function(t,e){var r,n;for(t=y(g(null!==(r=t)&&void 0!==r?r:0,0,this.size),0,this.size),e=y(g(null!==(n=e)&&void 0!==n?n:this.size,0,this.size),0,this.size)-1;t<e;){var i=this.array[t];this.array[t++]=this.array[e],this.array[e--]=i}return this}},{key:"set",value:function(t,e){var r=void 0;return t>=0&&t<this.size&&(r=this.array[t],this.array[t]=e),r}},{key:"shift",value:function(){return this.array.shift()}},{key:"size",get:function(){return this.array.length}},{key:"slice",value:function(e,r){return new t(this.array.slice(e,r))}},{key:"splice",value:function(e,r,n){return new t(O(this.array,e,r,n))}},{key:"sort",value:function(t){return this.array.sort(t),this}},{key:it,value:function(){return this.array[Symbol.iterator]()}},{key:"unshift",value:function(t){return this.array.unshift(t)}},{key:"update",value:function(t,e,r){var n,i;for(null==r&&(arguments.length<2?(r=t,t=void 0):(r=e,e=void 0)),t=y(g(null!==(n=t)&&void 0!==n?n:0,0,this.size),0,this.size),e=y(g(null!==(i=e)&&void 0!==i?i:this.size,0,this.size),0,this.size);t<e;)this.array[t]=r(this.array[t],t),++t;return this}},{key:"view",value:regeneratorRuntime.mark((function t(e,r){var n,i,a=this;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.size),0,this.size),i=null==r?function(){return a.size}:r>=0?function(){return Math.min(r,a.size)}:function(){return a.size+r};case 2:if(!(e<i())){t.next=7;break}return t.next=5,this.array[e++];case 5:t.next=2;break;case 7:case"end":return t.stop()}}),t,this)}))}])&&ot(e.prototype,r),t}();function st(t,e,r,n){if(e<2)return[t,t];e/=2;var i=[Math.ceil(e),Math.floor(e)],a=st(t,i[0],r,n),o=st(a[1].next,i[1],r,n);t=a[1],a[1]=o[0],o[0]=t,o[0].next=o[1].next;var l=a[0].prev;return t=function(t,e,r,n){var i={},a=i;do{var o=+(n(t[0].value,t[1].value)>0);a.next=t[o],r&&(a.next.prev=a),a=a.next,t[o]=a.next,--e[o]}while(e[0]>0&&e[1]>0);return a.next=t[+(e[0]<1)],r&&a.next&&(a.next.prev=a),i.next}(a,i,r,n),r&&(t.prev=l),[t,o[+(i[0]<1)]]}function ht(t,e){if(t){if("string"==typeof t)return ft(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?ft(t,e):void 0}}function ft(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function ct(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function vt(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}lt=Symbol.iterator;var yt,gt=function(){function t(e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),vt(this,"length",void 0),vt(this,"root",void 0),this.length=0,this.root={},this.root.prev=this.root.next=this.root,this._addAll(this.root,null!=e?e:[])}var e,r;return e=t,(r=[{key:"add",value:function(t,e){if(t<0||t>this.length)return this.length;var r=this._get(t-1),n={next:r.next,prev:r,value:e};return r.next=n,n.next.prev=n,++this.length}},{key:"addAll",value:function(t,e){return t>=0&&t<=this.length&&this._addAll(this._get(t),e),this.length}},{key:"clear",value:function(){this.length=0,this.root.prev=this.root.next=this.root}},{key:"concat",value:function(){for(var e=new t(this),r=arguments.length,n=new Array(r),i=0;i<r;i++)n[i]=arguments[i];for(var a=0,o=n;a<o.length;a++){var l=o[a];e.addAll(e.size,l)}return e}},{key:"copyWithin",value:function(t,e,r){var n,i;if(t=y(g(t,0,this.length),0,this.length),(e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.length),0,this.length))===t)return this;if(r=y(g(null!==(i=r)&&void 0!==i?i:this.length,0,this.length),0,this.length),e>=(r=e+Math.min(r-e,this.length-t)))return this;if(e<t&&t<r){var a=this._get(r),o=this._get(t+(r-e));do{a=a.prev,(o=o.prev).value=a.value}while(++e<r);return this}var l=this._get(e),u=this._get(t);do{u.value=l.value,l=l.next,u=u.next}while(++e<r);return this}},{key:"fill",value:function(t,e,r){var n,i;if((e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.length),0,this.length))<(r=y(g(null!==(i=r)&&void 0!==i?i:this.length,0,this.length),0,this.length))){var a=this._get(e);do{a.value=t,a=a.next}while(++e<r)}return this}},{key:"get",value:function(t){return t<0||t>=this.length?void 0:this._get(t).value}},{key:"getSet",value:function(t,e){if(!(t<0||t>=this.length)){var r=this._get(t),n=r.value;return r.value=e(r.value),n}}},{key:"pop",value:function(){if(!(this.length<1)){var t=this.root.prev;return t.prev.next=this.root,this.root.prev=t.prev,--this.length,t.value}}},{key:"push",value:function(t){var e=this.root.prev,r={next:this.root,prev:e,value:t};return e.next=this.root.prev=r,++this.length}},{key:"remove",value:function(t){if(!(t<0||t>=this.length)){var e=this._get(t);return e.prev.next=e.next,e.next.prev=e.prev,--this.length,e.value}}},{key:"reverse",value:function(t,e){var r,n;if(t=y(g(null!==(r=t)&&void 0!==r?r:0,0,this.length),0,this.length),(e=y(g(null!==(n=e)&&void 0!==n?n:this.length,0,this.length),0,this.length))-t<2)return this;var i=this._get(t-1),a=i.next,o=a;do{var l=o.next;o.next=o.prev,o.prev=l,i.next=o,o=l}while(++t<e);return a.next=o,o.prev=a,i.next.prev=i,this}},{key:"set",value:function(t,e){if(!(t<0||t>=this.length)){var r=this._get(t),n=r.value;return r.value=e,n}}},{key:"shift",value:function(){if(!(this.length<1)){var t=this.root.next;return t.next.prev=this.root,this.root.next=t.next,--this.length,t.value}}},{key:"size",get:function(){return this.length}},{key:"slice",value:function(e,r){return new t(this.view(e,r))}},{key:"splice",value:function(e,r,n){var i,a;e=y(g(null!==(i=e)&&void 0!==i?i:0,0,this.length),0,this.length),r=y(null!==(a=r)&&void 0!==a?a:this.size,0,this.size-e);var o=new t;if(null==n&&r<1)return o;for(var l=this._get(e);r-- >0;)o.push(l.value),l.prev.next=l.next,l.next.prev=l.prev,l=l.next,--this.length;return this._addAll(l,null!=n?n:[]),o}},{key:"sort",value:function(t){if(this.length>1){var e=(i=st(this.root.next,this.length,!0,t),a=2,function(t){if(Array.isArray(t))return t}(i)||function(t,e){var r=null==t?null:"undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(null!=r){var n,i,a=[],o=!0,l=!1;try{for(r=r.call(t);!(o=(n=r.next()).done)&&(a.push(n.value),!e||a.length!==e);o=!0);}catch(t){l=!0,i=t}finally{try{o||null==r.return||r.return()}finally{if(l)throw i}}return a}}(i,a)||ht(i,a)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()),r=e[0],n=e[1];this.root.next=r,n.next.prev=n}var i,a;return this}},{key:lt,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=this.root.next;case 1:if(e===this.root){t.next=7;break}return t.next=4,e.value;case 4:e=e.next,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"unshift",value:function(t){var e=this.root.next,r={next:e,prev:this.root,value:t};return this.root.next=e.prev=r,++this.length}},{key:"update",value:function(t,e,r){var n,i;if(null==r&&(arguments.length<2?(r=t,t=void 0):(r=e,e=void 0)),(t=y(g(null!==(n=t)&&void 0!==n?n:0,0,this.length),0,this.length))<(e=y(g(null!==(i=e)&&void 0!==i?i:this.length,0,this.length),0,this.length))){var a=this._get(t);do{a.value=r(a.value,t),a=a.next}while(++t<e)}return this}},{key:"view",value:regeneratorRuntime.mark((function t(e,r){var n,i,a,o=this;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:if(!((e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.length),0,this.length))<(i=null==r?function(){return o.length}:r>=0?function(){return r}:function(){return o.length+r})())){t.next=8;break}a=this._get(e);case 4:return t.next=6,a.value;case 6:a=a.next;case 7:if(++e<i()&&a!==this.root){t.next=4;break}case 8:case"end":return t.stop()}}),t,this)}))},{key:"_addAll",value:function(t,e){var r,n=t.prev,i=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=ht(t))){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(e);try{for(i.s();!(r=i.n()).done;){var a={prev:n,value:r.value};n.next=a,n=a,++this.length}}catch(t){i.e(t)}finally{i.f()}n.next=t,t.prev=n}},{key:"_get",value:function(t){var e=this.root;if(t<this.length/2)for(;t-- >=0;)e=e.next;else for(t=this.length-t;t>0;--t)e=e.prev;return e}}])&&ct(e.prototype,r),t}();function pt(t,e){if(t){if("string"==typeof t)return dt(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?dt(t,e):void 0}}function dt(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function bt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function mt(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}yt=Symbol.iterator;var kt,xt=function(){function t(e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),mt(this,"length",void 0),mt(this,"root",void 0),mt(this,"tail",void 0),this.length=0,this.root={},this.root.next=this.root,this.tail=this._addAll(this.root,null!=e?e:[])}var e,r;return e=t,(r=[{key:"add",value:function(t,e){if(t>=0&&t<this.length){var r=this._get(t-1);r.next={value:e,next:r.next},++this.length}else t===this.length&&this.push(e);return this.length}},{key:"addAll",value:function(t,e){return t>=0&&t<this.length?this._addAll(this._get(t-1),e):t===this.length&&(this.tail=this._addAll(this.tail,e)),this.length}},{key:"clear",value:function(){this.length=0,this.tail=this.root.next=this.root}},{key:"concat",value:function(){for(var e=new t(this),r=arguments.length,n=new Array(r),i=0;i<r;i++)n[i]=arguments[i];for(var a=0,o=n;a<o.length;a++){var l=o[a];e.addAll(e.size,l)}return e}},{key:"copyWithin",value:function(t,e,r){var n,i;if(t=y(g(t,0,this.length),0,this.length),(e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.length),0,this.length))===t)return this;if(r=y(g(null!==(i=r)&&void 0!==i?i:this.length,0,this.length),0,this.length),e>=(r=e+Math.min(r-e,this.length-t)))return this;if(t<e){var a=this._get(t-1);return this._copyWithin(this._get(e-t-1,a),a,r-e),this}if(t>r){var o=this._get(e-1);return this._copyWithin(o,this._get(t-e-1,o),r-e),this}var l=this._get(e-1),u=this._get(r-e-1,l),s=this._copyWithin(l,u,t-e);t+(r-e)>=this.length&&(this.tail=u);var h=l.next;return l.next=u.next,u.next=s.next,s.next=h,this}},{key:"fill",value:function(t,e,r){var n,i;if((e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.length),0,this.length))<(r=y(g(null!==(i=r)&&void 0!==i?i:this.length,0,this.length),0,this.length))){var a=this._get(e);do{a.value=t,a=a.next}while(++e<r)}return this}},{key:"get",value:function(t){if(!(t<0||t>=this.length))return t<this.length-1?this._get(t).value:this.tail.value}},{key:"getSet",value:function(t,e){if(!(t<0||t>=this.length)){var r=t<this.length-1?this._get(t):this.tail,n=r.value;return r.value=e(r.value),n}}},{key:"pop",value:function(){if(!(this.length<1)){var t=this.tail.value;return this.tail=this._get(this.length-2),this.tail.next=this.root,--this.length,t}}},{key:"push",value:function(t){var e={next:this.root,value:t};return this.tail.next=e,this.tail=e,++this.length}},{key:"remove",value:function(t){if(!(t<0||t>=this.length)){var e=this._get(t-1),r=e.next;return e.next=r.next,t===--this.length&&(this.tail=e),r.value}}},{key:"reverse",value:function(t,e){var r,n;if(t=y(g(null!==(r=t)&&void 0!==r?r:0,0,this.length),0,this.length),(e=y(g(null!==(n=e)&&void 0!==n?n:this.length,0,this.length),0,this.length))-t<2)return this;var i=this._get(t-1);this.tail=e>=this.length?i.next:this.tail;for(var a=i.next,o=a,l=a.next;++t<e;){var u=l.next;l.next=o,o=l,l=u}return i.next=o,a.next=l,this}},{key:"set",value:function(t,e){if(!(t<0||t>=this.length)){var r=this._get(t),n=r.value;return r.value=e,n}}},{key:"shift",value:function(){return this.remove(0)}},{key:"size",get:function(){return this.length}},{key:"slice",value:function(e,r){return new t(this.view(e,r))}},{key:"splice",value:function(e,r,n){var i,a;e=y(g(null!==(i=e)&&void 0!==i?i:0,0,this.length),0,this.length),r=y(null!==(a=r)&&void 0!==a?a:this.size,0,this.size-e);var o=new t;if(null==n&&r<1)return o;for(var l=this._get(e-1),u=e+r>=this.size;r-- >0;){var s=l.next;o.push(s.value),l.next=s.next,--this.length}return l=this._addAll(l,null!=n?n:[]),this.tail=u?l:this.tail,o}},{key:"sort",value:function(t){if(this.length>1){var e=(i=st(this.root.next,this.length,!1,t),a=2,function(t){if(Array.isArray(t))return t}(i)||function(t,e){var r=null==t?null:"undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(null!=r){var n,i,a=[],o=!0,l=!1;try{for(r=r.call(t);!(o=(n=r.next()).done)&&(a.push(n.value),!e||a.length!==e);o=!0);}catch(t){l=!0,i=t}finally{try{o||null==r.return||r.return()}finally{if(l)throw i}}return a}}(i,a)||pt(i,a)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}()),r=e[0],n=e[1];this.root.next=r,this.tail=n}var i,a;return this}},{key:yt,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=this.root.next;case 1:if(e===this.root){t.next=7;break}return t.next=4,e.value;case 4:e=e.next,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"unshift",value:function(t){return this.add(0,t)}},{key:"update",value:function(t,e,r){var n,i;if(null==r&&(arguments.length<2?(r=t,t=void 0):(r=e,e=void 0)),(t=y(g(null!==(n=t)&&void 0!==n?n:0,0,this.length),0,this.length))<(e=y(g(null!==(i=e)&&void 0!==i?i:this.length,0,this.length),0,this.length))){var a=this._get(t);do{a.value=r(a.value,t),a=a.next}while(++t<e)}return this}},{key:"view",value:regeneratorRuntime.mark((function t(e,r){var n,i,a,o=this;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:if(!((e=y(g(null!==(n=e)&&void 0!==n?n:0,0,this.length),0,this.length))<(i=null==r?function(){return o.length}:r>=0?function(){return r}:function(){return o.length+r})())){t.next=8;break}a=this._get(e);case 4:return t.next=6,a.value;case 6:a=a.next;case 7:if(++e<i()&&a!==this.root){t.next=4;break}case 8:case"end":return t.stop()}}),t,this)}))},{key:"_addAll",value:function(t,e){var r,n=t.next,i=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=pt(t))){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(e);try{for(i.s();!(r=i.n()).done;){var a={value:r.value};t.next=a,t=a,++this.length}}catch(t){i.e(t)}finally{i.f()}return t.next=n,t}},{key:"_copyWithin",value:function(t,e,r){for(;r-- >0;)t=t.next,(e=e.next).value=t.value;return e}},{key:"_get",value:function(t){for(var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:this.root,r=e;t-- >=0;)r=r.next;return r}}])&&bt(e.prototype,r),t}();function wt(t){for(var e=0;t;)++e,t&=t-1;return e}function At(t){var e=Rt(t);return Pt(t^(e|e-1))}function St(t){return 0==(t&t-1)}function zt(t){var e=-1;for(t=jt(t);t;t>>>=1)++e;return e}function jt(t){return Pt(t&-t)}function Ot(t){return Pt(t&jt(t+jt(t))-1)}function _t(t){for(var e=-1;0!==t;)++e,t>>>=1;return e}function Rt(t){for(var e=t&-t;t!=e;)e=(t^=e)&-t;return Pt(e)}function It(t){for(var e=t&-t;t&t+e;)e=(t^=e)&-t;return Pt(t)}function Et(t){return Pt((t=(4278255360&(t=(4042322160&(t=(3435973836&(t=(2863311530&t)>>>1|(1431655765&t)<<1))>>>2|(858993459&t)<<2))>>>4|(252645135&t)<<4))>>>8|(16711935&t)<<8)>>>16|t<<16)}function Pt(t){return t>>>0}function Tt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}kt=Symbol.iterator;var Mt,Ct=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="array")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this[r]=n,this.array=e?Array.from(e):[]}var e,r;return e=t,(r=[{key:"clear",value:function(){this.array.length=0}},{key:"dequeue",value:function(){return this.size<1?void 0:this.array.shift()}},{key:"enqueue",value:function(t){return this.array.push(t)}},{key:"peek",value:function(){return this.size<1?void 0:this.array[0]}},{key:"size",get:function(){return this.array.length}},{key:kt,value:function(){return this.array[Symbol.iterator]()}}])&&Tt(e.prototype,r),t}();function Ft(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}Mt=Symbol.iterator;var Wt,Ut=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="list")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this.list=n,this.list=new xt(e)}var e,r;return e=t,(r=[{key:"clear",value:function(){this.list.clear()}},{key:"dequeue",value:function(){return this.list.shift()}},{key:"enqueue",value:function(t){return this.list.push(t)}},{key:"peek",value:function(){return this.list.get(0)}},{key:"size",get:function(){return this.list.size}},{key:Mt,value:function(){return this.list[Symbol.iterator]()}}])&&Ft(e.prototype,r),t}();function Lt(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function $t(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}function Xt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function qt(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}Wt=Symbol.iterator;var Zt,Dt=function(){function t(e){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];$t(this,t),qt(this,"array",void 0),qt(this,"combine",void 0),this.array=[],this.combine=e,this.build(r)}var e,r;return e=t,(r=[{key:"clear",value:function(){this.array.length=0}},{key:"pop",value:function(){if(!(this.size<1)){for(var t=this.array.length-1,e=2;t&e;e*=2)this.array[t-e]=this.array[t-e-(e>>>1)];var r=this.array[t-1];return this.array.length-=2,r}}},{key:"push",value:function(e){if(this.size>=t.MAX_SIZE)throw new RangeError("Invalid length");var r=this.array.length;return this.array[r+1]=this.set(r,e),this.size}},{key:"query",value:function(t,e){if(t>=e)throw new RangeError("Range [".concat(t,"..").concat(e,") is empty"));if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));var r=jt((t*=2)|Rt((e*=2)-t)),n=this.array[t-1+(r>>>1)];for(t+=r;t<e;t+=r)r=jt(t|Rt(e-t)),n=this.combine(n,this.array[t-1+(r>>>1)]);return n}},{key:"size",get:function(){return this.array.length>>>1}},{key:Wt,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=0;case 1:if(!(e<this.array.length)){t.next=7;break}return t.next=4,this.array[e];case 4:e+=2,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"update",value:function(t,e,r){if(!(t>=e)){if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));var n;t*=2,e*=2;do{n=this.set(t,r(this.array[t],t>>>1)),t+=2}while(t<e);var i=0,a=jt(t);for(e=_t(t^this.array.length)-zt(t),--t;e>0;--e)n=this.combine(n,this.array[t+(a>>>1)-i]),this.array[t]=n,t+=a-(i=(t&2*a)>>>0),a*=2;this.array[t]=n}}},{key:"build",value:function(t){var e,r=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return Lt(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?Lt(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(t);try{for(r.s();!(e=r.n()).done;){var n=e.value;this.push(n)}}catch(t){r.e(t)}finally{r.f()}}},{key:"set",value:function(t,e){this.array[t++]=e;for(var r=2;t&r;r*=2)e=this.combine(this.array[t-r-(r>>>1)],e),this.array[t-r]=e;return e}}])&&Xt(e.prototype,r),t}();function Ht(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return Nt(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?Nt(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function Nt(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function Gt(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}function Qt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function Bt(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}qt(Dt,"MAX_SIZE",x>>>1),Zt=Symbol.iterator;var Vt,Yt=function(){function t(e){var r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:[];Gt(this,t),Bt(this,"array",void 0),Bt(this,"combine",void 0),Bt(this,"length",void 0),Bt(this,"level",void 0),this.array=[],this.combine=e,this.length=0,this.level=0,this.build(r)}var e,r;return e=t,(r=[{key:"clear",value:function(){this.length=0,this.level=0,this.array.length=0}},{key:"pop",value:function(){if(!(this.length<=this.level)){var t=this.array[--this.length];return this.length<=this.array.length+1>>>2&&this.shrink(),t}}},{key:"push",value:function(t){this.length>=this.array.length&&this.grow(),this.array[this.length++]=t;for(var e=this.length;1&e;this.array[e-1]=t)t=this.combine(this.array[e-2],t),e>>>=1;return this.size}},{key:"query",value:function(t,e){if(t>=e)throw new RangeError("Range [".concat(t,"..").concat(e,") is empty"));if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));var r=jt((t+=this.level+1)|Rt((e+=this.level+1)-t)),n=this.array[t/r-1];for(t+=r;t<e;)r=jt(t|Rt(e-t)),n=this.combine(n,this.array[t/r-1]),t+=r;return n}},{key:"size",get:function(){return this.length-this.level}},{key:Zt,value:regeneratorRuntime.mark((function t(){var e;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=0;case 1:if(!(e<this.size)){t.next=7;break}return t.next=4,this.array[this.level+e];case 4:++e,t.next=1;break;case 7:case"end":return t.stop()}}),t,this)}))},{key:"update",value:function(t,e,r){if(!(t>=e)){if(t<0||e>this.size)throw new RangeError("Range [".concat(t,"..").concat(e,") not in [0..").concat(this.size,")"));t+=this.level,e+=this.level;for(var n=t;n<e;++n)this.array[n]=r(this.array[n],n-this.level);this.aggregate(t,e)}}},{key:"aggregate",value:function(t,e){++t,++e;for(var r=this.length+1;t<e;r>>>=1){e+=e&e-r>>>31;for(var n=(1|t)>>>0;n<e;n+=2)this.array[(n>>>1)-1]=this.combine(this.array[n-2],this.array[n-1]);t>>>=1,e>>>=1}}},{key:"build",value:function(e){var r=void 0;if(A(e))r="length";else{if(!_(e)){var n,i=Ht(e);try{for(i.s();!(n=i.n()).done;){var a=n.value;this.push(a)}}catch(t){i.e(t)}finally{i.f()}return}r="size"}var o=e[r];if(o<1)return this.array.length=0,this.length=0,void(this.level=0);if(o>=t.MAX_SIZE)throw new RangeError("Invalid length");this.level=2*Rt(o-1)-1,this.length=this.level,this.array.length=2*this.level+1;var l,u=Ht(e);try{for(u.s();!(l=u.n()).done;){var s=l.value;this.array[this.length++]=s}}catch(t){u.e(t)}finally{u.f()}this.aggregate(this.level,this.length)}},{key:"grow",value:function(){if(this.size<1)this.array.length=1;else{if(this.size>=t.MAX_SIZE)throw new RangeError("Invalid length");this.array.length+=this.array.length+1;for(var e=this.level+1,r=this.length+1;e<r;r>>>=1)this.array.copyWithin(2*e-1,e-1,r-1),e>>>=1;this.length+=this.level+1,this.level+=this.level+1}}},{key:"shrink",value:function(){var t=this.length-this.level;if(t<2)return this.array.copyWithin(0,this.level,this.length),this.level=0,this.length=t,void(this.array.length=t);var e=this.level+1,r=Rt(t);e=e/jt(e|r)-1,this.level=+!St(t);for(var n=e+1;r;this.level+=this.level+1)this.array.copyWithin(this.level,e,n),e+=e+1,n+=n+2+ +((t&(r>>>=1))>0);this.length=this.level+t,this.array.length=2*this.level+1}}])&&Qt(e.prototype,r),t}();function Jt(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}Bt(Yt,"MAX_SIZE",(x+1)/2),Vt=Symbol.iterator;var Kt,te=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="array")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this[r]=n,this.array=e?Array.from(e):[]}var e,r;return e=t,(r=[{key:"clear",value:function(){this.array.length=0}},{key:"peek",value:function(){return this.array[this.array.length-1]}},{key:"pop",value:function(){return this.array.pop()}},{key:"push",value:function(t){return this.array.push(t)}},{key:"size",get:function(){return this.array.length}},{key:Vt,value:regeneratorRuntime.mark((function t(){var e,r;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=this.array,r=e.length;case 2:if(!(r>0)){t.next=7;break}case 3:return t.next=5,e[--r];case 5:t.next=2;break;case 7:case"end":return t.stop()}}),t,this)}))}])&&Jt(e.prototype,r),t}();function ee(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function re(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}Kt=Symbol.iterator;var ne,ie=function(){function t(e){var r,n;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),n=void 0,(r="list")in this?Object.defineProperty(this,r,{value:n,enumerable:!0,configurable:!0,writable:!0}):this.list=n,this.list=new xt;var i,a=function(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return ee(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?ee(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}(e||[]);try{for(a.s();!(i=a.n()).done;){var o=i.value;this.push(o)}}catch(t){a.e(t)}finally{a.f()}}var e,r;return e=t,(r=[{key:"clear",value:function(){this.list.clear()}},{key:"peek",value:function(){return this.list.get(0)}},{key:"pop",value:function(){return this.list.shift()}},{key:"push",value:function(t){return this.list.unshift(t)}},{key:"size",get:function(){return this.list.size}},{key:Kt,value:function(){return this.list[Symbol.iterator]()}}])&&re(e.prototype,r),t}();function ae(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return oe(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?oe(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function oe(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function le(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function ue(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}ne=Symbol.iterator;var se,he=function(){function t(e,r,n){var i;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),ue(this,"compare",void 0),ue(this,"dupeWeight",void 0),ue(this,"length",void 0),ue(this,"root",void 0),"boolean"!=typeof r&&(n=r,r=!0),this.compare=e,this.dupeWeight=+r,this.length=0,this.build(null!==(i=n)&&void 0!==i?i:[])}var e,r;return e=t,(r=[{key:"add",value:function(t){var e={left:this.root},r={from:e,label:"left",to:this.root},n=Y(t,{value:r},this.compare,this.dupeWeight);if(null!=n.value.to)return this;var i=(r=n.value).label;for(r.from[i]={level:1,value:t};n.next;)(r=(n=n.next).value).to=ve(ce(r.to)),r.from[i=r.label]=r.to;return++this.length,this.root=e.left,this}},{key:"clear",value:function(){this.root=void 0,this.length=0}},{key:"comparator",value:function(){return this.compare}},{key:"delete",value:function(t){var e={left:this.root},r=fe(Y(t,{value:{from:e,label:"left",to:this.root}},this.compare,0));return this.root=e.left,this.length-=+r,r}},{key:"has",value:function(t){return null!=V(t,this.root,this.compare)}},{key:"max",value:function(){var t;return null===(t=Q(this.root))||void 0===t?void 0:t.value}},{key:"min",value:function(){var t;return null===(t=Z(this.root))||void 0===t?void 0:t.value}},{key:"pop",value:function(){var t,e={left:this.root},r=B({value:{from:e,label:"left",to:this.root}}),n=null===(t=r.value.to)||void 0===t?void 0:t.value,i=fe(r);return this.root=e.left,this.length-=+i,n}},{key:"shift",value:function(){var t,e={left:this.root},r=D({value:{from:e,label:"left",to:this.root}}),n=null===(t=r.value.to)||void 0===t?void 0:t.value,i=fe(r);return this.root=e.left,this.length-=+i,n}},{key:"size",get:function(){return this.length}},{key:"sorted",value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=ae(H(this.root)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:ne,value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=ae(G(this.root)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:"update",value:function(t,e){return!!this.delete(t)&&(this.add(e),!0)}},{key:"build",value:function(e){if(A(e))for(var r=0;r<e.length;++r)this.add(e[r]);else if(e instanceof t&&this.compare===e.compare)this.root=q(e.root),this.length=e.size;else{var n,i=ae(e);try{for(i.s();!(n=i.n()).done;){var a=n.value;this.add(a)}}catch(t){i.e(t)}finally{i.f()}}}}])&&le(e.prototype,r),t}();function fe(t){var e=t.value,r=e.to;if(null==r)return!1;for(t=X(t);t.next;){var n,i,a,o;r=(e=(t=t.next).value).to;var l=1+Math.min(null!==(n=null===(i=r.left)||void 0===i?void 0:i.level)&&void 0!==n?n:0,null!==(a=null===(o=r.right)||void 0===o?void 0:o.level)&&void 0!==a?a:0);l<r.level&&(r.level=l,null!=r.right&&l<r.right.level&&(r.right.level=l)),(r=ce(r)).right=ce(r.right),null!=r.right&&(r.right.right=ce(r.right.right)),(r=ve(r)).right=ve(r.right),e.from[e.label]=e.to=r}return!0}function ce(t){if(null==t||null==t.left||t.level!=t.left.level)return t;var e=t.left;return t.left=e.right,e.right=t,e}function ve(t){if(null==t||null==t.right||null==t.right.right||t.level!=t.right.right.level)return t;var e=t.right;return t.right=e.left,e.left=t,++e.level,e}function ye(t,e){var r="undefined"!=typeof Symbol&&t[Symbol.iterator]||t["@@iterator"];if(!r){if(Array.isArray(t)||(r=function(t,e){if(t){if("string"==typeof t)return ge(t,e);var r=Object.prototype.toString.call(t).slice(8,-1);return"Object"===r&&t.constructor&&(r=t.constructor.name),"Map"===r||"Set"===r?Array.from(t):"Arguments"===r||/^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(r)?ge(t,e):void 0}}(t))||e&&t&&"number"==typeof t.length){r&&(t=r);var n=0,i=function(){};return{s:i,n:function(){return n>=t.length?{done:!0}:{done:!1,value:t[n++]}},e:function(t){throw t},f:i}}throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method.")}var a,o=!0,l=!1;return{s:function(){r=r.call(t)},n:function(){var t=r.next();return o=t.done,t},e:function(t){l=!0,a=t},f:function(){try{o||null==r.return||r.return()}finally{if(l)throw a}}}}function ge(t,e){(null==e||e>t.length)&&(e=t.length);for(var r=0,n=new Array(e);r<e;r++)n[r]=t[r];return n}function pe(t,e){for(var r=0;r<e.length;r++){var n=e[r];n.enumerable=n.enumerable||!1,n.configurable=!0,"value"in n&&(n.writable=!0),Object.defineProperty(t,n.key,n)}}function de(t,e,r){return e in t?Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}):t[e]=r,t}se=Symbol.iterator;var be=function(){function t(e,r,n){var i;!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),de(this,"compare",void 0),de(this,"dupeWeight",void 0),de(this,"length",void 0),de(this,"root",void 0),"boolean"!=typeof r&&(n=r,r=!0),this.compare=e,this.dupeWeight=+r,this.length=0,this.root={},this.build(null!==(i=n)&&void 0!==i?i:[])}var e,r;return e=t,(r=[{key:"add",value:function(t){var e={from:this.root,label:"left",to:this.root.left},r=Y(t,{value:e},this.compare,this.dupeWeight);if(null!=r.value.to)return this;var n=(e=r.value).label;for(e.from[n]={balanceFactor:0,value:t};r.next&&((e=(r=r.next).value).to.balanceFactor+="left"===n?-1:1,e.to=me(e.to),e.from[n=e.label]=e.to,0!==e.to.balanceFactor););return++this.length,this}},{key:"clear",value:function(){this.root.left=void 0,this.length=0}},{key:"comparator",value:function(){return this.compare}},{key:"delete",value:function(t){var e=ke(Y(t,{value:{from:this.root,label:"left",to:this.root.left}},this.compare,0));return this.length-=+e,e}},{key:"has",value:function(t){return null!=V(t,this.root.left,this.compare)}},{key:"max",value:function(){var t;return null===(t=Q(this.root.left))||void 0===t?void 0:t.value}},{key:"min",value:function(){var t;return null===(t=Z(this.root.left))||void 0===t?void 0:t.value}},{key:"pop",value:function(){var t,e=B({value:{from:this.root,label:"left",to:this.root.left}}),r=null===(t=e.value.to)||void 0===t?void 0:t.value,n=ke(e);return this.length-=+n,r}},{key:"shift",value:function(){var t,e=D({value:{from:this.root,label:"left",to:this.root.left}}),r=null===(t=e.value.to)||void 0===t?void 0:t.value,n=ke(e);return this.length-=+n,r}},{key:"size",get:function(){return this.length}},{key:"sorted",value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=ye(H(this.root.left)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:se,value:regeneratorRuntime.mark((function t(){var e,r,n;return regeneratorRuntime.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:e=ye(G(this.root.left)),t.prev=1,e.s();case 3:if((r=e.n()).done){t.next=9;break}return n=r.value,t.next=7,n.value;case 7:t.next=3;break;case 9:t.next=14;break;case 11:t.prev=11,t.t0=t.catch(1),e.e(t.t0);case 14:return t.prev=14,e.f(),t.finish(14);case 17:case"end":return t.stop()}}),t,this,[[1,11,14,17]])}))},{key:"update",value:function(t,e){return!!this.delete(t)&&(this.add(e),!0)}},{key:"build",value:function(e){if(A(e))for(var r=0;r<e.length;++r)this.add(e[r]);else if(e instanceof t&&this.compare===e.compare)this.root=q(e.root),this.length=e.size;else{var n,i=ye(e);try{for(i.s();!(n=i.n()).done;){var a=n.value;this.add(a)}}catch(t){i.e(t)}finally{i.f()}}}}])&&pe(e.prototype,r),t}();function me(t){return t.balanceFactor>1?(t.right.balanceFactor<0&&(t.right=we(t.right)),t=xe(t)):t.balanceFactor<-1&&(t.left.balanceFactor>0&&(t.left=xe(t.left)),t=we(t)),t}function ke(t){var e=t.value;if(null==e.to)return!1;for(var r=(t=X(t)).value.label;t.next&&((e=(t=t.next).value).to.balanceFactor-="left"===r?-1:1,e.to=me(e.to),e.from[r=e.label]=e.to,0===e.to.balanceFactor););return!0}function xe(t){var e=t.right;return t.right=e.left,e.left=t,t.balanceFactor-=1+Math.max(0,e.balanceFactor),e.balanceFactor-=1-Math.min(0,t.balanceFactor),e}function we(t){var e=t.left;return t.left=e.right,e.right=t,t.balanceFactor+=1-Math.min(0,e.balanceFactor),e.balanceFactor+=1+Math.max(0,t.balanceFactor),e}return e})()}));
 //# sourceMappingURL=dastal.min.js.map
\ No newline at end of file
diff --git a/dist/dastal.min.js.map b/dist/dastal.min.js.map
index 1638147..ede780b 100644
--- a/dist/dastal.min.js.map
+++ b/dist/dastal.min.js.map
@@ -1 +1 @@
-{"version":3,"sources":["webpack://Dastal/webpack/universalModuleDefinition","webpack://Dastal/webpack/bootstrap","webpack://Dastal/webpack/runtime/define property getters","webpack://Dastal/webpack/runtime/hasOwnProperty shorthand","webpack://Dastal/webpack/runtime/make namespace object","webpack://Dastal/./src/array/utils.ts","webpack://Dastal/./src/heap/utils.ts","webpack://Dastal/./src/heap/binaryHeap.ts","webpack://Dastal/./src/tree/binaryTreeUtils.ts","webpack://Dastal/./src/heap/skewHeap.ts","webpack://Dastal/./src/math/num.ts","webpack://Dastal/./src/list/utils.ts","webpack://Dastal/./src/list/arrayList.ts","webpack://Dastal/./src/list/doublyLinkedList.ts","webpack://Dastal/./src/list/linkedList.ts","webpack://Dastal/./src/math/u32.ts","webpack://Dastal/./src/queue/arrayQueue.ts","webpack://Dastal/./src/queue/linkedQueue.ts","webpack://Dastal/./src/segmentTree/inOrderSegmentTree.ts","webpack://Dastal/./src/segmentTree/levelOrderSegmentTree.ts","webpack://Dastal/./src/collection/index.ts","webpack://Dastal/./src/stack/arrayStack.ts","webpack://Dastal/./src/stack/linkedStack.ts","webpack://Dastal/./src/tree/aaTree.ts","webpack://Dastal/./src/tree/avlTree.ts"],"names":["root","factory","exports","module","define","amd","self","__webpack_require__","definition","key","o","Object","defineProperty","enumerable","get","obj","prop","prototype","hasOwnProperty","call","Symbol","toStringTag","value","MAX_ARRAY_LENGTH","isArray","Array","isTypedArray","TypedArray","getPrototypeOf","Uint8Array","bubbleUp","index","compareFn","array","parentIndex","Math","floor","parent","heapify","i","length","sinkDown","n","childIndex","child","skewMerge","heaps","lists","push","list","tree","right","next","compare","a","b","tail","pop","mergeKSorted","heap","node","left","iterator","BinaryHeap","elements","this","addAll","RangeError","element","indexOf","last","size","undefined","curElement","newElement","inOrderTraverse","preOrderTraverse","removeStack","stack","dir","edge","to","temp","successorStack","predecessorStack","from","label","clone","out","assign","leftmost","leftmostStack","rightmostStack","rightmost","search","comp","searchStack","dupeWeight","paths","toBinaryTree","nodes","par","SkewHeap","merge","comparator","clamp","num","min","max","batchArray","batchIterable","batch","iterable","slice","f","cwrap","pivot","nwrap","linkedMergeSort","len","isDoubly","lens","ceil","heads","tails","prev","linkedMergeSorted","ArrayList","splice","items","copyWithin","fill","callback","shift","start","count","sort","unshift","arguments","DoublyLinkedList","_addAll","_get","nodeA","nodeB","head","view","LinkedList","_copyWithin","nodeC","nodeD","remove","deleted","newTail","add","bitsSet","invert","msp","u32","isPow2","lsb","lsp","lsps","mlsp","msb","msps","reverse","ArrayQueue","LinkedQueue","clear","InOrderSegmentTree","combine","build","mask","MAX_SIZE","set","offset","operation","dc","dp","LevelOrderSegmentTree","level","shrink","grow","aggregate","cap","ArrayStack","LinkedStack","AATree","allowDuplicates","sentinel","split","skew","removed","delete","AVLTree","balanceFactor","balance","rotateR","rotateL","P","R","L"],"mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,SAAU,GAAIH,GACK,iBAAZC,QACdA,QAAgB,OAAID,IAEpBD,EAAa,OAAIC,IARnB,CASGK,MAAM,WACT,M,mBCTA,IAAIC,EAAsB,CCA1B,EAAwB,CAACL,EAASM,KACjC,IAAI,IAAIC,KAAOD,EACXD,EAAoBG,EAAEF,EAAYC,KAASF,EAAoBG,EAAER,EAASO,IAC5EE,OAAOC,eAAeV,EAASO,EAAK,CAAEI,YAAY,EAAMC,IAAKN,EAAWC,MCJ3E,EAAwB,CAACM,EAAKC,IAAUL,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKC,GCClF,EAAyBd,IACH,oBAAXkB,QAA0BA,OAAOC,aAC1CV,OAAOC,eAAeV,EAASkB,OAAOC,YAAa,CAAEC,MAAO,WAE7DX,OAAOC,eAAeV,EAAS,aAAc,CAAEoB,OAAO,M,sfCChD,IAAMC,EAAmB,WAQzB,SAASC,EAAiBT,GAC7B,OAAOA,aAAeU,OAASC,EAAaX,GAYzC,IACGY,E,EADGD,GACHC,EAAahB,OAAOiB,eAAeC,YAClC,SAA+Bd,GAClC,OAAOA,aAAeY,ICvBvB,SAASG,EAAYC,EAAeC,EAAyBC,GAIhE,IAHA,IAAMX,EAAQW,EAAMF,GAGbA,EAAQ,GAAG,CAEd,IAAMG,EAAcC,KAAKC,OAAOL,EAAQ,GAAK,GAAK,EAC5CM,EAASJ,EAAMC,GAGrB,GAAIF,EAAUK,EAAQf,IAAU,EAC5B,MAIJW,EAAMC,GAAeZ,EACrBW,EAAMF,GAASM,EACfN,EAAQG,GAMT,SAASI,EAAWN,EAAyBC,GAChD,IAAK,IAAIM,EAAKN,EAAMO,OAAS,IAAO,EAAGD,EAAI,EAAGE,IAAWF,EAAGP,EAAWC,KAwBpE,SAASQ,EAAYV,EAAeC,EAAyBC,GAGhE,IAFA,IAAMS,EAAIT,EAAMO,OACVlB,EAAQW,EAAMF,KACjB,CAEC,IAAIY,EAAa,EAAIZ,EAAQ,EAG7B,GAAIY,GAAcD,EACd,MAIJ,IAAIE,EAAQX,EAAMU,GAMlB,GALIA,EAAa,EAAID,GAAKV,EAAUC,EAAMU,EAAa,GAAIC,IAAU,IACjEA,EAAQX,IAAQU,IAIhBX,EAAUV,EAAOsB,IAAU,EAC3B,MAIJX,EAAMF,GAASa,EACfX,EAAMU,GAAcrB,EACpBS,EAAQY,GAgBT,SAASE,EACZb,EACAc,GAIA,IADA,IAQsB,EARhBC,EAAyC,GACtCR,EAAI,EAAGA,EAAIO,EAAMN,SAAUD,EAChB,MAAZO,EAAMP,IACNQ,EAAMC,KAAK,CAAE1B,MAAOwB,EAAMP,KAKlC,GAAIQ,EAAMP,OAAS,EACf,iBAAOO,EAAM,UAAb,aAAO,EAAUzB,MAQrB,IAAK,IAAIiB,EAAI,EAAGA,EAAIQ,EAAMP,SAAUD,EAAG,CAGnC,IAFA,IAAIU,EAAOF,EAAMR,GACbW,EAAsCD,EAAK3B,MACvC4B,EAAOA,EAAKC,OAChBF,EAAO,CAAEG,KAAMH,EAAM3B,MAAO4B,GAEhCH,EAAMR,GAAKU,EAcf,IAVA,IAAIA,EA7FD,SAAyBjB,EAAyBe,GAGrD,IAAMM,EAAoC,SAACC,EAAGC,GAAJ,OAAUvB,EAAUsB,EAAEhC,MAAOiC,EAAEjC,QACzEgB,EAAQe,EAASN,GAIjB,IADA,IAAME,EAAsBF,EAAM,GACzBS,EAAOP,EAAMF,EAAMP,OAAS,EAAGgB,EAAOA,EAAKJ,KAAM,OACtDL,EAAM,GAAN,UAAWA,EAAM,GAAGK,YAApB,QAA4BL,EAAMU,MAClChB,EAAS,EAAGY,EAASN,GACrBS,EAAKJ,KAAOL,EAAM,GAGtB,OAAOE,EA+E+CS,EAClD,SAACJ,EAAGC,GAAJ,OAAUvB,EAAUuB,EAAEjC,MAAOgC,EAAEhC,SAC/ByB,GAOAY,EAAOV,EAAK3B,MACR2B,EAAOA,EAAKG,MAAO,CACvB,IAAMQ,EAAOX,EAAK3B,MAClBsC,EAAKT,MAAQS,EAAKC,KAClBD,EAAKC,KAAOF,EACZA,EAAOC,EAGX,OAAOD,E,uyCCkENvC,OAAO0C,SA7LL,I,EAAMC,EAAb,WAeI,WAAY/B,EAAyBgC,I,4FAAwB,yDACzDC,KAAKZ,QAAUrB,EACfiC,KAAKhC,MAAQ,GACbgC,KAAKC,OAAOF,UAAY,I,QAlBhC,O,EAAA,G,EAAA,qBAqBI,SAAOA,GACH,IAAM/B,EAAQgC,KAAKhC,MACbO,EAASP,EAAMO,OAErB,GAAIhB,EAAQwC,GAAW,CACnB,GAAI/B,EAAMO,OAASwB,EAASxB,OAASjB,EACjC,MAAM,IAAI4C,WAAW,uBAEzB,IAAK,IAAI5B,EAAI,EAAGA,EAAIyB,EAASxB,SAAUD,EACnCN,EAAMe,KAAKgB,EAASzB,QAErB,WACmByB,GADnB,IACH,2BAAgC,KAArBI,EAAqB,QAC5B,GAAInC,EAAMO,QAAUjB,EAChB,MAAM,IAAI4C,WAAW,uBAEzBlC,EAAMe,KAAKoB,IALZ,+BAcP,OAJI5B,EAASP,EAAMO,QACfF,EAAQ2B,KAAKZ,QAASpB,GAGnBA,EAAMO,SA9CrB,mBAiDI,WACIyB,KAAKhC,MAAMO,OAAS,IAlD5B,wBAqDI,WACI,OAAOyB,KAAKZ,UAtDpB,sBAyDI,SAASe,GACL,OAAOH,KAAKhC,MAAMoC,QAAQD,IAAY,IA1D9C,oBA6DI,SAAOA,GACH,IAAMrC,EAAQkC,KAAKhC,MAAMoC,QAAQD,GACjC,GAAIrC,EAAQ,EACR,OAAO,EAIX,IAAMuC,EAAOL,KAAKhC,MAAMwB,MACxB,OAAI1B,GAASkC,KAAKhC,MAAMO,SAMxByB,KAAKhC,MAAMF,GAASuC,EACpB7B,EAASV,EAAOkC,KAAKZ,QAASY,KAAKhC,OACnCH,EAASC,EAAOkC,KAAKZ,QAASY,KAAKhC,SAPxB,IAtEnB,mBAiFI,SAAM0B,GACF,IAAM1B,EAAQgC,KAAKhC,MAEnB,GAAI0B,EAAKY,KAAO,EACZ,OAAON,KAGX,GAAIhC,EAAMO,OAASmB,EAAKY,KAAOhD,EAC3B,MAAM,IAAI4C,WAAW,uBARF,UAWDR,GAXC,IAWvB,2BAA4B,KAAjBS,EAAiB,QACxBnC,EAAMe,KAAKoB,IAZQ,8BAgBvB,OADA9B,EAAQ2B,KAAKZ,QAASpB,GACfgC,OAjGf,kBAoGI,WACI,OAAOA,KAAKhC,MAAMO,OAAS,EAAIyB,KAAKhC,MAAM,QAAKuC,IArGvD,iBAwGI,WACI,KAAIP,KAAKhC,MAAMO,OAAS,GAAxB,CAKA,IAAMlB,EAAQ2C,KAAKhC,MAAM,GACnBqC,EAAOL,KAAKhC,MAAMwB,MASxB,OANIQ,KAAKhC,MAAMO,OAAS,IAEpByB,KAAKhC,MAAM,GAAKqC,EAChB7B,EAAS,EAAGwB,KAAKZ,QAASY,KAAKhC,QAG5BX,KAxHf,kBA2HI,SAAKA,GAMD,OAJA2C,KAAKhC,MAAMe,KAAK1B,GAGhBQ,EAASmC,KAAKhC,MAAMO,OAAS,EAAGyB,KAAKZ,QAASY,KAAKhC,OAC5CgC,KAAKM,OAjIpB,qBAoII,SAAQjD,GAEJ,GAAI2C,KAAKhC,MAAMO,OAAS,GAAKyB,KAAKZ,QAAQ/B,EAAO2C,KAAKhC,MAAM,KAAO,EAC/D,OAAOX,EAIX,IAAMtB,EAAOiE,KAAKhC,MAAM,GAGxB,OAFAgC,KAAKhC,MAAM,GAAKX,EAChBmB,EAAS,EAAGwB,KAAKZ,QAASY,KAAKhC,OACxBjC,IA9If,qBAiJI,SAAQsB,GAEJ,KAAI2C,KAAKhC,MAAMO,OAAS,GAAxB,CAMA,IAAMxC,EAAOiE,KAAKhC,MAAM,GAMxB,OALAgC,KAAKhC,MAAM,GAAKX,EAChBA,EAAQtB,EAGRyC,EAAS,EAAGwB,KAAKZ,QAASY,KAAKhC,OACxBX,EAXH2C,KAAKhC,MAAMe,KAAK1B,KApJ5B,gBAkKI,WACI,OAAO2C,KAAKhC,MAAMO,SAnK1B,6CAsKI,mHACQyB,KAAKhC,MAAMO,OAAS,GAD5B,iDAIUP,EAAQgC,KAAKhC,MACb0B,EAAO,IAAII,GAAmB,SAACT,EAAGC,GAAJ,OAAU,EAAKF,QAAQpB,EAAMqB,GAAIrB,EAAMsB,MAAK,CAAC,IALrF,aAOYxB,EAAQ4B,EAAKF,OACLxB,EAAMO,QAR1B,iBASY,OATZ,SASkBP,EAAMF,GATxB,QAUYA,EAAQ,EAAIA,EAAQ,GACZE,EAAMO,QAAUmB,EAAKX,KAAKjB,KAChCA,EAAQE,EAAMO,QAAUmB,EAAKX,KAAKjB,GAZhD,WAca4B,EAAKY,KAAO,EAdzB,iEAtKJ,aA6LI,WACI,OAAON,KAAKhC,MAAMb,OAAO0C,cA9LjC,oBAiMI,SAAOW,EAAeC,GAClB,IAAM3C,EAAQkC,KAAKhC,MAAMoC,QAAQI,GACjC,QAAI1C,EAAQ,IAGZkC,KAAKhC,MAAMF,GAAS2C,EACpBjC,EAASV,EAAOkC,KAAKZ,QAASY,KAAKhC,OACnCH,EAASC,EAAOkC,KAAKZ,QAASY,KAAKhC,OAC5B,S,iBAzMf,K,0BCqKiB0C,G,0BAqHAC,GA9NV,SAASC,EACZC,GAEsB,IADtBC,IACsB,yDAClBC,EAAOF,EAAMxD,MACbsC,EAAOoB,EAAKC,GAGhB,GAAY,MAARrB,EACA,OAAOkB,EAIX,GAAkB,MAAdlB,EAAKT,MAELS,EAAOA,EAAKC,UACT,GAAiB,MAAbD,EAAKC,KAEZD,EAAOA,EAAKT,WACT,GAAI4B,EAAK,CAIZ,IAAMG,GADNF,GADAF,EAAQK,EAAeL,IACVxD,OACK2D,GAClBrB,EAAKtC,MAAQ4D,EAAK5D,MAClBsC,EAAOsB,EAAK/B,UACT,CAIH,IAAM+B,GADNF,GADAF,EAAQM,EAAiBN,IACZxD,OACK2D,GAClBrB,EAAKtC,MAAQ4D,EAAK5D,MAClBsC,EAAOsB,EAAKrB,KAShB,OALAmB,EAAKC,GAAKrB,EACNoB,EAAKK,OACLL,EAAKK,KAAKL,EAAKM,OAAUN,EAAKC,GAAKrB,GAGhCkB,EAQJ,SAASS,EAAyC3B,GACrD,GAAY,MAARA,EAAJ,CAGA,IAAM4B,EAAY7E,OAAO8E,OAAO,GAAI7B,GAChCkB,EAAsC,CAAExD,MAAOkE,GACnD,GACI5B,EAAOkB,EAAMxD,MACbwD,EAAQA,EAAM1B,KACVQ,EAAKC,OACLiB,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAQsC,EAAKC,KAAOlD,OAAO8E,OAAO,GAAI7B,EAAKC,QAElED,EAAKT,QACL2B,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAQsC,EAAKT,MAAQxC,OAAO8E,OAAO,GAAI7B,EAAKT,eAElE2B,GACT,OAAOU,GAUJ,SAASE,EACZ9B,GAEA,GAAY,MAARA,EAAJ,CAGA,KAAOA,EAAKC,MACRD,EAAOA,EAAKC,KAEhB,OAAOD,GAKJ,SAAS+B,EACZb,GAEA,IAAIlB,EAAOkB,EAAMxD,MAAM2D,GACvB,GAAY,MAARrB,EACA,OAAOkB,EAEX,KAAOlB,EAAKC,MACRiB,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAO,CAAEgE,MAAO,OAAQD,KAAMzB,EAAMqB,GAAIrB,EAAKC,OACpED,EAAOA,EAAKC,KAEhB,OAAOiB,EAKJ,SAAUH,EACbf,GADG,sFAKH,IAFIkB,OAAsCN,EAEnCZ,GACHkB,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAOsC,GAC9BA,EAAOA,EAAKC,KAPb,WAUIiB,EAVJ,iBAaC,OAFAlB,EAAOkB,EAAMxD,MACbwD,EAAQA,EAAM1B,KAZf,SAaOQ,EAbP,OAeC,IADAA,EAAOA,EAAKT,MACLS,GACHkB,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAOsC,GAC9BA,EAAOA,EAAKC,KAjBjB,uDAwGA,SAASuB,EACZN,GAEA,IAAMlB,EAAOkB,EAAMxD,MAAM2D,GACzB,OAAY,MAARrB,EACOkB,EAGJc,EADPd,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAO,CAAEgE,MAAO,OAAQD,KAAMzB,EAAMqB,GAAIrB,EAAKC,QAMjE,SAAUe,EACbhB,GADG,sFAGCkB,EAAkD,CAAExD,MAAOsC,GAH5D,UAKCA,EAAOkB,EAAMxD,MACbwD,EAAQA,EAAM1B,MACVQ,EAPL,gBAQK,OARL,SAQWA,EARX,OAUKkB,EAAQ,CAAE1B,KADV0B,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAOsC,EAAKT,OACZ7B,MAAOsC,EAAKC,MAVxC,UAYMiB,EAZN,uDAmCA,SAASe,EACZjC,GAEA,GAAY,MAARA,EAAJ,CAGA,KAAOA,EAAKT,OACRS,EAAOA,EAAKT,MAEhB,OAAOS,GAKJ,SAASgC,EACZd,GAEA,IAAIlB,EAAOkB,EAAMxD,MAAM2D,GACvB,GAAY,MAARrB,EACA,OAAOkB,EAEX,KAAOlB,EAAKT,OACR2B,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAO,CAAEgE,MAAO,QAASD,KAAMzB,EAAMqB,GAAIrB,EAAKT,QACrES,EAAOA,EAAKT,MAEhB,OAAO2B,EAMJ,SAASgB,EACZ1B,EACAR,EACA5B,GAEA,KAAO4B,GAAM,CACT,IAAMmC,EAAe/D,EAAUoC,EAASR,EAAKtC,OAC7C,GAAY,GAARyE,EACA,MAEJnC,EAAOmC,EAAO,EAAInC,EAAKC,KAAOD,EAAKT,MAEvC,OAAOS,EAMJ,SAASoC,EACZ5B,EACAU,EACA9C,GAKA,IAHsB,IADtBiE,EACsB,uDADT,EAEPC,EAA2B,CAAC,OAAQ,SACtCtC,EAAOkB,EAAMxD,MAAM2D,GAChBrB,GAAM,CACT,IAAMmC,EAAe/D,EAAUoC,EAASR,EAAKtC,QAAU2E,EACvD,GAAa,IAATF,EACA,MAEJ,IAAMT,EAAQY,IAAQH,EAAO,IAC7BjB,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAO,CAAEgE,QAAOD,KAAMzB,EAAMqB,GAAIrB,EAAK0B,KAC5D1B,EAAOA,EAAK0B,GAEhB,OAAOR,EAaJ,SAASK,EACZL,GAEA,IAAMlB,EAAOkB,EAAMxD,MAAM2D,GACzB,OAAY,MAARrB,EACOkB,EAGJa,EADPb,EAAQ,CAAE1B,KAAM0B,EAAOxD,MAAO,CAAEgE,MAAO,QAASD,KAAMzB,EAAMqB,GAAIrB,EAAKT,SAMlE,SAASgD,EACZnC,GAEA,KAAgB,MAAZA,GAAoBA,EAASxB,OAAS,GAAoB,MAAfwB,EAAS,IAAxD,CAGA,IAAMtB,EAAIsB,EAASxB,OACb4D,EAA6B,IAAI3E,MAAMiB,GAC7C0D,EAAM,GAAK,CAAE9E,MAAO0C,EAAS,IAC7B,IAAK,IAAIzB,EAAI,EAAGA,EAAIG,IAAKH,EACrB,GAAmB,MAAfyB,EAASzB,GAAb,CAGA,IAAM8D,EAAMD,EAAO7D,EAAI,IAAO,GACxBqB,EAAO,CAAEtC,MAAO0C,EAASzB,IAC/B6D,EAAM7D,GAAKqB,EACH,EAAJrB,EACA8D,EAAIxC,KAAOD,EAEXyC,EAAIlD,MAAQS,EAGpB,OAAOwC,EAAM,I,uyCCrQXhF,OAAO0C,SA/JN,IAAMwC,EAAb,WAmBI,WAAYtE,EAAyBgC,I,4FAAwB,gFACzDC,KAAKZ,QAAUrB,EACfiC,KAAKzB,OAAS,EACdyB,KAAKC,OAAOF,UAAY,I,QAtBhC,O,EAAA,G,EAAA,qBAyBI,SAAOA,GACH,GAAIxC,EAAQwC,GACR,IAAK,IAAIzB,EAAI,EAAGA,EAAIyB,EAASxB,SAAUD,EACnC0B,KAAKjB,KAAKgB,EAASzB,SAEpB,GAAIyB,aAAoBsC,GAAYtC,aAAoBD,EAC3DE,KAAKsC,MAAMvC,OACR,WACmBA,GADnB,IACH,2BAAgC,KAArBI,EAAqB,QAC5BH,KAAKjB,KAAKoB,IAFX,+BAKP,OAAOH,KAAKzB,SArCpB,mBAwCI,WACIyB,KAAKzB,OAAS,EACdyB,KAAKjE,UAAOwE,IA1CpB,wBA6CI,WACI,OAAOP,KAAKZ,UA9CpB,sBAiDI,SAASe,GAAqB,UACPQ,EAAiBX,KAAKjE,OADf,IAC1B,2BACI,GAAIoE,IADwC,QACvB9C,MACjB,OAAO,EAHW,8BAM1B,OAAO,IAvDf,oBA0DI,SAAO8C,GACH,GAAiB,MAAbH,KAAKjE,KACL,OAAO,EAEX,GAAIiE,KAAKjE,KAAKsB,QAAU8C,EAEpB,OADAH,KAAKR,OACE,EANa,UAQNmB,EAAiBX,KAAKjE,OARhB,IAQxB,2BAA+C,KAApCqG,EAAoC,QACrC5F,EACF4F,EAAIxC,MAAQwC,EAAIxC,KAAKvC,QAAU8C,EACzB,OACAiC,EAAIlD,OAASkD,EAAIlD,MAAM7B,QAAU8C,EACjC,aACAI,EACV,GAAW,MAAP/D,EAAa,CACb,IAAMmD,EAAOyC,EAAI5F,GAGjB,OAFA4F,EAAI5F,GAAOoC,EAAUoB,KAAKZ,QAAS,CAACO,EAAKC,KAAMD,EAAKT,UAClDc,KAAKzB,QACA,IAnBS,8BAsBxB,OAAO,IAhFf,mBAmFI,SAAMmB,GAYF,OAXIM,KAAKZ,UAAYM,EAAK6C,aACtBvC,KAAKC,OAAOP,GACLA,aAAgB2C,GACvBrC,KAAKjE,KAAO6C,EAAUoB,KAAKZ,QAAS,CAACY,KAAKjE,KAAMuF,EAAM5B,EAAK3D,QAC3DiE,KAAKzB,QAAUmB,EAAKY,MACbZ,aAAgBI,GACvBE,KAAKjE,KAAO6C,EAAUoB,KAAKZ,QAAS,CAACY,KAAKjE,KAAMmG,EAAaxC,EAAI,SACjEM,KAAKzB,QAAUmB,EAAKY,MAEpBN,KAAKC,OAAOP,GAETM,OA/Ff,kBAkGI,WAAsB,MAClB,iBAAOA,KAAKjE,YAAZ,aAAO,EAAWsB,QAnG1B,iBAsGI,WACI,GAAiB,MAAb2C,KAAKjE,KAAT,CAGA,IAAMsB,EAAQ2C,KAAKjE,KAAKsB,MAGxB,OAFA2C,KAAKjE,KAAO6C,EAAUoB,KAAKZ,QAAS,CAACY,KAAKjE,KAAK6D,KAAMI,KAAKjE,KAAKmD,UAC7Dc,KAAKzB,OACAlB,KA7Gf,kBAgHI,SAAKA,GAED,OADA2C,KAAKjE,KAAO6C,EAAUoB,KAAKZ,QAAS,CAACY,KAAKjE,KAAM,CAAEsB,aACzC2C,KAAKzB,SAlHtB,qBAqHI,SAAQlB,GAEJ,OADA2C,KAAKjB,KAAK1B,GACH2C,KAAKR,QAvHpB,qBA0HI,SAAQnC,GACJ,GAAiB,MAAb2C,KAAKjE,KAGL,OAFAiE,KAAKjE,KAAO,CAAEsB,cACd2C,KAAKzB,OAAS,GAGlB,IAAMgD,EAAMvB,KAAKjE,KAAKsB,MAEtB,OADA2C,KAAKjE,KAAO6C,EAAUoB,KAAKZ,QAAS,CAACY,KAAKjE,KAAK6D,KAAMI,KAAKjE,KAAKmD,MAAO,CAAE7B,WACjEkE,IAlIf,gBAqII,WACI,OAAOvB,KAAKzB,SAtIpB,6CAyII,+GACqB,MAAbyB,KAAKjE,KADb,iDAIU2D,EAAO,IAAI2C,GACb,SAAChD,EAAGC,GAAJ,OAAU,EAAKF,QAAQC,EAAEhC,MAAOiC,EAAEjC,SAClC,CAAC2C,KAAKjE,OANd,OAUQ,OADM4D,EAAOD,EAAKF,MAT1B,SAUcG,EAAKtC,MAVnB,OAWQsC,EAAKC,MAAQF,EAAKX,KAAKY,EAAKC,MAC5BD,EAAKT,OAASQ,EAAKX,KAAKY,EAAKT,OAZrC,UAaaQ,EAAKY,KAAO,EAbzB,gEAzIJ,sCA+JI,2GACuBK,EAAiBX,KAAKjE,OAD7C,wDAEQ,OADO4D,EADf,iBAEcA,EAAKtC,MAFnB,qMA/JJ,oBAqKI,SAAOmD,EAAeC,GAClB,GAAiB,MAAbT,KAAKjE,KACL,OAAO,EAGX,GAAIiE,KAAKjE,KAAKsB,QAAUmD,EAMpB,OALAR,KAAKjE,KAAO6C,EAAUoB,KAAKZ,QAAS,CAChCY,KAAKjE,KAAK6D,KACVI,KAAKjE,KAAKmD,MACV,CAAE7B,MAAOoD,MAEN,EAGX,IAd0C,EActCd,OAAsCY,EAdA,IAexBI,EAAiBX,KAAKjE,OAfE,IAe1C,2BAA+C,KAApCqG,EAAoC,QAC3C,GAAIA,EAAIxC,MAAQwC,EAAIxC,KAAKvC,QAAUmD,EAAY,CAC3Cb,EAAOyC,EAAIxC,KACXwC,EAAIxC,UAAOW,EACX,MAEJ,GAAI6B,EAAIlD,OAASkD,EAAIlD,MAAM7B,QAAUmD,EAAY,CAC7Cb,EAAOyC,EAAIlD,MACXkD,EAAIlD,WAAQqB,EACZ,QAxBkC,8BA4B1C,OAAY,MAARZ,IAIJK,KAAKjE,KAAO6C,EAAUoB,KAAKZ,QAAS,CAChCY,KAAKjE,KACL4D,EAAKC,KACLD,EAAKT,MACL,CAAE7B,MAAOoD,MAEN,Q,iBA3Mf,KCvBO,SAAS+B,EAAMC,EAAaC,EAAaC,GAC5C,OAAOzE,KAAKwE,IAAIC,EAAKzE,KAAKyE,IAAID,EAAKD,I,uiCCuBtBG,G,0BAkBAC,GArCV,SAASC,EACZxC,EACAyC,GAEA,OAAIxF,EAAQwF,GACDH,EAAWtC,EAAMyC,GAErBF,EAAcvC,EAAMyC,GAYxB,SAAUH,EAActC,EAActC,GAAtC,0FACC0E,EAAM,EADP,YAEIA,EAAM1E,EAAMO,QAFhB,iBAIS,OADFoE,EAAMD,EAAMpC,EAHnB,SAIetC,EAAMgF,MAAMN,EAAKC,GAJhC,oJAIyCrC,EAJzC,QAICA,EAJD,KAKCoC,EAAMC,EALP,uDAkBA,SAAUE,EACbvC,EACAyC,GAFG,8FAIC/E,EAAa,GAJd,IAKiB+E,GALjB,4DAKQ1F,EALR,UAMKW,EAAMe,KAAK1B,IAAUiD,GAN1B,iBAOa,OAPb,SAOmBtC,EAPnB,sJAO6BsC,EAP7B,QAOKA,EAPL,KAQKtC,EAAQ,GARb,sHAAAiF,IAAA,0BAWCjF,EAAMO,OAAS,GAXhB,iBAYC,OAZD,UAYOP,EAZP,4DA0BA,SAASkF,EAAMT,EAAaC,EAAaC,GAC5C,OAAOH,EAmHJ,SAAeC,EAAaU,GAC/B,OAAOV,EAAM,EAAIU,EAAQV,EAAMA,EApHlBW,CAAMX,EAAKE,GAAMD,EAAKC,GAuBhC,SAASU,EACZ1D,EACA2D,EACAC,EACAxF,GAGA,GAAIuF,EAAM,EACN,MAAO,CAAC3D,EAAMA,GAIlB2D,GAAY,EACZ,IAAME,EAAyB,CAACtF,KAAKuF,KAAKH,GAAMpF,KAAKC,MAAMmF,IACrDI,EAAQL,EAAgB1D,EAAM6D,EAAK,GAAID,EAAUxF,GACjD4F,EAAQN,EAAgBK,EAAM,GAAGvE,KAAcqE,EAAK,GAAID,EAAUxF,GAGxE4B,EAAO+D,EAAM,GACbA,EAAM,GAAKC,EAAM,GACjBA,EAAM,GAAKhE,EACXgE,EAAM,GAAGxE,KAAOwE,EAAM,GAAGxE,KAGzB,IAAMyE,EAAQF,EAAM,GAA2BE,KAO/C,OANAjE,EAyBG,SACH+D,EACAF,EACAD,EACAxF,GAEA,IAAMhC,EAAO,GAET4D,EAAO5D,EACX,EAAG,CACC,IAAM+B,IAAUC,EAAU2F,EAAM,GAAGrG,MAAOqG,EAAM,GAAGrG,OAAS,GAC5DsC,EAAKR,KAAOuE,EAAM5F,GACdyF,IACC5D,EAAKR,KAA6ByE,KAAOjE,GAE9CA,EAAOA,EAAKR,KACZuE,EAAM5F,GAAS6B,EAAKR,OAClBqE,EAAK1F,SACF0F,EAAK,GAAK,GAAKA,EAAK,GAAK,GAOlC,OAJA7D,EAAKR,KAAOuE,IAAQF,EAAK,GAAK,IAC1BD,GAAY5D,EAAKR,OAChBQ,EAAKR,KAA6ByE,KAAOjE,GAEvC5D,EAAKoD,KAlDL0E,CAAkBH,EAAOF,EAAMD,EAAUxF,GAC5CwF,IACC5D,EAA6BiE,KAAOA,GAIlC,CAACjE,EAAMgE,IAAQH,EAAK,GAAK,K,8hDCW/BrG,OAAO0C,SAzIL,I,GAAMiE,GAAb,WAUI,WAAY/D,G,qGAAwB,S,OAAA,G,EAAA,gB,sBAAA,K,uDAAA,K,KAChCC,KAAKhC,MAAQ+B,EAAWvC,MAAM4D,KAAKrB,GAAY,G,QAXvD,O,EAAA,G,EAAA,kBAcI,SAAIjC,EAAeqC,GAIf,OAHIrC,GAAS,GAAKA,GAASkC,KAAKM,MAC5BN,KAAKhC,MAAM+F,OAAOjG,EAAO,EAAGqC,GAEzBH,KAAKM,OAlBpB,oBAqBI,SAAOxC,EAAeiC,GAClB,GAAIjC,GAAS,GAAKA,GAASkC,KAAKM,KAAM,WACdwC,EAAM,IAAO/C,IADC,IAClC,2BAA4C,OAAjCiE,EAAiC,SACxC,EAAAhE,KAAKhC,OAAM+F,OAAX,SAAkBjG,EAAO,GAAzB,SAA+BkG,KAC/BlG,GAASkG,EAAMzF,QAHe,+BAMtC,OAAOyB,KAAKM,OA5BpB,mBA+BI,WACIN,KAAKhC,MAAMO,OAAS,IAhC5B,oBAmCI,WAA8C,IAC1C,IAAMgD,EAAM,IAAIuC,EAAU9D,MADgB,mBAApClB,EAAoC,yBAApCA,EAAoC,gBAE1C,cAAmBA,EAAnB,eAA0B,CAArB,IAAME,EAAI,KACXuC,EAAItB,OAAOsB,EAAIjB,KAAMtB,GAEzB,OAAOuC,IAxCf,wBA2CI,SAAWzD,EAAe4E,EAAcC,GAAoB,UAKxD,OAJA7E,EAAQoF,EAAK,UAACpF,SAAD,QAAU,EAAG,EAAGkC,KAAKM,MAClCoC,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKM,MAC9BqC,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKM,KAAM,EAAGN,KAAKM,MACtCN,KAAKhC,MAAMiG,WAAWnG,EAAO4E,EAAKC,GAC3B3C,OAhDf,kBAmDI,SAAKG,EAAYuC,EAAcC,GAAoB,QAI/C,OAHAD,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKM,MAC9BqC,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKM,KAAM,EAAGN,KAAKM,MACtCN,KAAKhC,MAAMkG,KAAK/D,EAASuC,EAAKC,GACvB3C,OAvDf,iBA0DI,SAAIlC,GACA,OAAOA,EAAQ,GAAKA,GAASkC,KAAKM,UAAOC,EAAYP,KAAKhC,MAAMF,KA3DxE,oBA8DI,SAAOA,EAAeqG,GAClB,IAAI9G,OAAuBkD,EAK3B,OAJIzC,GAAS,GAAKA,EAAQkC,KAAKM,OAC3BjD,EAAQ2C,KAAKhC,MAAMF,GACnBkC,KAAKhC,MAAMF,GAASqG,EAAS9G,IAE1BA,IApEf,iBAuEI,WACI,OAAO2C,KAAKhC,MAAMwB,QAxE1B,kBA2EI,SAAKW,GACD,OAAOH,KAAKhC,MAAMe,KAAKoB,KA5E/B,oBA+EI,SAAOrC,GACH,OAAOA,EAAQ,GAAKA,GAASkC,KAAKM,UAAOC,EAAYP,KAAKhC,MAAM+F,OAAOjG,EAAO,GAAG,KAhFzF,qBAmFI,SAAQ4E,EAAcC,GAAoB,QAGtC,IAFAD,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKM,MAC9BqC,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKM,KAAM,EAAGN,KAAKM,MAAQ,EACvCoC,EAAMC,GAAK,CACd,IAAM1B,EAAOjB,KAAKhC,MAAM0E,GACxB1C,KAAKhC,MAAM0E,KAAS1C,KAAKhC,MAAM2E,GAC/B3C,KAAKhC,MAAM2E,KAAS1B,EAExB,OAAOjB,OA3Ff,iBA8FI,SAAIlC,EAAeqC,GACf,IAAIyD,OAAsBrD,EAK1B,OAJIzC,GAAS,GAAKA,EAAQkC,KAAKM,OAC3BsD,EAAO5D,KAAKhC,MAAMF,GAClBkC,KAAKhC,MAAMF,GAASqC,GAEjByD,IApGf,mBAuGI,WACI,OAAO5D,KAAKhC,MAAMoG,UAxG1B,gBA2GI,WACI,OAAOpE,KAAKhC,MAAMO,SA5G1B,mBA+GI,SAAMmE,EAAcC,GAChB,OAAO,IAAImB,EAAU9D,KAAKhC,MAAMgF,MAAMN,EAAKC,MAhHnD,oBAmHI,SAAO0B,EAAgBC,EAAgBvE,GAAiC,QACpEsE,EAAQnB,EAAK,UAACmB,SAAD,QAAU,EAAG,EAAGrE,KAAKM,MAClCgE,EAAQ9B,EAAK,UAAC8B,SAAD,QAAUtE,KAAKM,KAAM,EAAGN,KAAKM,KAAO+D,GACjD,IAHoE,EAG9DrF,EAAO,IAAI8E,EAAU9D,KAAKhC,MAAM+F,OAAOM,EAAOC,IAHgB,IAIhDxB,EAAM,IAAO/C,UAAY,KAJuB,IAIpE,2BAAkD,OAAvCiE,EAAuC,SAC9C,EAAAhE,KAAKhC,OAAM+F,OAAX,SAAkBM,EAAO,GAAzB,SAA+BL,KAC/BK,GAASL,EAAMzF,QANiD,8BAQpE,OAAOS,IA3Hf,kBA8HI,SAAKjB,GAED,OADAiC,KAAKhC,MAAMuG,KAAKxG,GACTiC,OAhIf,aAyII,WACI,OAAOA,KAAKhC,MAAMb,OAAO0C,cA1IjC,qBA6II,SAAQM,GACJ,OAAOH,KAAKhC,MAAMwG,QAAQrE,KA9IlC,oBAwJI,SACIuC,EACAC,EACAwB,GACI,QAYJ,IAXgB,MAAZA,IACIM,UAAUlG,OAAS,GACnB4F,EAAWzB,EACXA,OAAMnC,IAEN4D,EAAWxB,EACXA,OAAMpC,IAGdmC,EAAMQ,EAAK,QAAE,EAAAR,SAAF,QAAoB,EAAG,EAAG1C,KAAKM,MAC1CqC,EAAMO,EAAK,QAAE,EAAAP,SAAF,QAAoB3C,KAAKM,KAAM,EAAGN,KAAKM,MAC3CoC,EAAMC,GACT3C,KAAKhC,MAAM0E,GAAOyB,EAASnE,KAAKhC,MAAM0E,GAAMA,KAC1CA,EAEN,OAAO1C,OA5Kf,2CA+KI,WAAM0C,EAAcC,GAApB,+FACID,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKM,MAI1BgD,EADO,MAAPX,EACM,kBAAM,EAAKrC,MACVqC,GAAO,EACR,kBAAMzE,KAAKwE,IAAIC,EAAK,EAAKrC,OAEzB,kBAAM,EAAKA,KAAOqC,GAThC,YAYWD,EAAMY,KAZjB,gBAaQ,OAbR,SAactD,KAAKhC,MAAM0E,KAbzB,yE,kBA/KJ,K,+qBCiPMvF,OAAO0C,SA9ON,I,GAAM6E,GAAb,WAcI,WAAY3E,I,4FAAwB,yDAChCC,KAAKzB,OAAS,EACdyB,KAAKjE,KAAO,GACZiE,KAAKjE,KAAK6H,KAAO5D,KAAKjE,KAAKoD,KAAOa,KAAKjE,KACvCiE,KAAK2E,QAAQ3E,KAAKjE,KAAMgE,UAAY,I,QAlB5C,O,EAAA,G,EAAA,kBAqBI,SAAIjC,EAAeT,GACf,GAAIS,EAAQ,GAAKA,EAAQkC,KAAKzB,OAC1B,OAAOyB,KAAKzB,OAEhB,IAAMqF,EAAO5D,KAAK4E,KAAK9G,EAAQ,GACzB6B,EAAO,CAAER,KAAMyE,EAAKzE,KAAMyE,OAAMvG,SAGtC,OAFAuG,EAAKzE,KAAOQ,EACZA,EAAKR,KAAMyE,KAAOjE,IACTK,KAAKzB,SA7BtB,oBAgCI,SAAOT,EAAeiC,GAIlB,OAHIjC,GAAS,GAAKA,GAASkC,KAAKzB,QAC5ByB,KAAK2E,QAAQ3E,KAAK4E,KAAK9G,GAAQiC,GAE5BC,KAAKzB,SApCpB,mBAuCI,WACIyB,KAAKzB,OAAS,EACdyB,KAAKjE,KAAK6H,KAAO5D,KAAKjE,KAAKoD,KAAOa,KAAKjE,OAzC/C,oBA4CI,WAAqD,IACjD,IAAMwF,EAAM,IAAImD,EAAiB1E,MADgB,mBAA3ClB,EAA2C,yBAA3CA,EAA2C,gBAEjD,cAAmBA,EAAnB,eAA0B,CAArB,IAAME,EAAI,KACXuC,EAAItB,OAAOsB,EAAIjB,KAAMtB,GAEzB,OAAOuC,IAjDf,wBAoDI,SAAWzD,EAAe4E,EAAcC,GAAoB,QAIxD,GAFA7E,EAAQoF,EAAMpF,EAAO,EAAGkC,KAAKzB,SAC7BmE,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,WAClBT,EACR,OAAOkC,KAMX,GAFA2C,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,QAEpCmE,IADJC,EAAMD,EAAMxE,KAAKwE,IAAIC,EAAMD,EAAK1C,KAAKzB,OAAST,IAE1C,OAAOkC,KAIX,GAAI0C,EAAM5E,GAASA,EAAQ6E,EAAK,CAC5B,IAAIkC,EAAQ7E,KAAK4E,KAAKjC,GAClBmC,EAAQ9E,KAAK4E,KAAK9G,GAAS6E,EAAMD,IACrC,GACImC,EAAQA,EAAMjB,MACdkB,EAAQA,EAAMlB,MACRvG,MAAQwH,EAAMxH,cACbqF,EAAMC,GACjB,OAAO3C,KAIX,IAAI6E,EAAQ7E,KAAK4E,KAAKlC,GAClBoC,EAAQ9E,KAAK4E,KAAK9G,GACtB,GACIgH,EAAMzH,MAAQwH,EAAMxH,MACpBwH,EAAQA,EAAM1F,KACd2F,EAAQA,EAAM3F,aACPuD,EAAMC,GACjB,OAAO3C,OAvFf,kBA0FI,SAAKG,EAAYuC,EAAcC,GAAoB,QAG/C,IAFAD,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,UAC9BoE,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,SACzB,CACX,IAAIoB,EAAOK,KAAK4E,KAAKlC,GACrB,GACI/C,EAAKtC,MAAQ8C,EACbR,EAAOA,EAAKR,aACLuD,EAAMC,GAErB,OAAO3C,OApGf,iBAuGI,SAAIlC,GACA,OAAOA,EAAQ,GAAKA,GAASkC,KAAKzB,YAASgC,EAAYP,KAAK4E,KAAK9G,GAAOT,QAxGhF,oBA2GI,SAAOS,EAAeqG,GAClB,KAAIrG,EAAQ,GAAKA,GAASkC,KAAKzB,QAA/B,CAGA,IAAMoB,EAAOK,KAAK4E,KAAK9G,GACjBT,EAAQsC,EAAKtC,MAEnB,OADAsC,EAAKtC,MAAQ8G,EAASxE,EAAKtC,OACpBA,KAlHf,iBAqHI,WACI,KAAI2C,KAAKzB,OAAS,GAAlB,CAGA,IAAMgB,EAAOS,KAAKjE,KAAK6H,KAIvB,OAHArE,EAAKqE,KAAMzE,KAAOa,KAAKjE,KACvBiE,KAAKjE,KAAK6H,KAAOrE,EAAKqE,OACpB5D,KAAKzB,OACAgB,EAAKlC,SA7HpB,kBAgII,SAAKA,GACD,IAAMuG,EAAO5D,KAAKjE,KAAK6H,KACjBjE,EAAO,CAAER,KAAMa,KAAKjE,KAAM6H,OAAMvG,SAEtC,OADAuG,EAAKzE,KAAOa,KAAKjE,KAAK6H,KAAOjE,IACpBK,KAAKzB,SApItB,oBAuII,SAAOT,GACH,KAAIA,EAAQ,GAAKA,GAASkC,KAAKzB,QAA/B,CAGA,IAAMoB,EAAOK,KAAK4E,KAAK9G,GAIvB,OAHA6B,EAAKiE,KAAMzE,KAAOQ,EAAKR,KACvBQ,EAAKR,KAAMyE,KAAOjE,EAAKiE,OACrB5D,KAAKzB,OACAoB,EAAKtC,SA/IpB,qBAkJI,SAAQqF,EAAcC,GAAoB,QAGtC,GAFAD,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,SAC9BoE,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,SAC9BmE,EAAM,EACZ,OAAO1C,KAEX,IAAMjE,EAAOiE,KAAK4E,KAAKlC,EAAM,GACvBnD,EAAOxD,EAAKoD,KACdQ,EAAOJ,EACX,EAAG,CACC,IAAM0B,EAAOtB,EAAKR,KAClBQ,EAAKR,KAAOQ,EAAKiE,KACjBjE,EAAKiE,KAAO3C,EACZlF,EAAKoD,KAAOQ,EACZA,EAAOsB,UACAyB,EAAMC,GAIjB,OAHApD,EAAKJ,KAAOQ,EACZA,EAAKiE,KAAOrE,EACZxD,EAAKoD,KAAMyE,KAAO7H,EACXiE,OArKf,iBAwKI,SAAIlC,EAAeqC,GACf,KAAIrC,EAAQ,GAAKA,GAASkC,KAAKzB,QAA/B,CAGA,IAAMoB,EAAOK,KAAK4E,KAAK9G,GACjBT,EAAQsC,EAAKtC,MAEnB,OADAsC,EAAKtC,MAAQ8C,EACN9C,KA/Kf,mBAkLI,WACI,KAAI2C,KAAKzB,OAAS,GAAlB,CAGA,IAAMwG,EAAO/E,KAAKjE,KAAKoD,KAIvB,OAHA4F,EAAK5F,KAAMyE,KAAO5D,KAAKjE,KACvBiE,KAAKjE,KAAKoD,KAAO4F,EAAK5F,OACpBa,KAAKzB,OACAwG,EAAK1H,SA1LpB,gBA6LI,WACI,OAAO2C,KAAKzB,SA9LpB,mBAiMI,SAAMmE,EAAcC,GAChB,OAAO,IAAI+B,EAAiB1E,KAAKgF,KAAKtC,EAAKC,MAlMnD,oBAqMI,SAAO0B,EAAgBC,EAAgBvE,GAAiC,QACpEsE,EAAQnB,EAAK,UAACmB,SAAD,QAAU,EAAG,EAAGrE,KAAKM,MAClCgE,EAAQ9B,EAAK,UAAC8B,SAAD,QAAUtE,KAAKM,KAAM,EAAGN,KAAKM,KAAO+D,GAGjD,IAAMrF,EAAO,IAAI0F,EACjB,GAAgB,MAAZ3E,GAAoBuE,EAAQ,EAC5B,OAAOtF,EAKX,IADA,IAAIW,EAAOK,KAAK4E,KAAKP,GACdC,KAAU,GACbtF,EAAKD,KAAKY,EAAKtC,OACfsC,EAAKiE,KAAMzE,KAAOQ,EAAKR,KACvBQ,EAAKR,KAAMyE,KAAOjE,EAAKiE,KACvBjE,EAAOA,EAAKR,OACVa,KAAKzB,OAMX,OAFAyB,KAAK2E,QAAQhF,EAAMI,UAAY,IAExBf,IA5Nf,kBA+NI,SAAKjB,GACD,GAAIiC,KAAKzB,OAAS,EAAG,CACjB,O,EAAqB8E,EAAgBrD,KAAKjE,KAAKoD,KAAOa,KAAKzB,QAAQ,EAAMR,G,EAAzE,E,oiBAAOgH,EAAP,KAAaxF,EAAb,KACAS,KAAKjE,KAAKoD,KAAO4F,EACjBxF,EAAKJ,KAAMyE,KAAOrE,E,QAEtB,OAAOS,OArOf,uCA8OI,mGACaL,EAAOK,KAAKjE,KAAKoD,KAD9B,UACqCQ,IAASK,KAAKjE,KADnD,gBAEQ,OAFR,SAEc4D,EAAKtC,MAFnB,OACyDsC,EAAOA,EAAKR,KADrE,+DA9OJ,qBAoPI,SAAQ9B,GACJ,IAAM0H,EAAO/E,KAAKjE,KAAKoD,KACjBQ,EAAO,CAAER,KAAM4F,EAAMnB,KAAM5D,KAAKjE,KAAMsB,SAE5C,OADA2C,KAAKjE,KAAKoD,KAAO4F,EAAKnB,KAAOjE,IACpBK,KAAKzB,SAxPtB,oBAkQI,SACImE,EACAC,EACAwB,GACI,QAYJ,GAXgB,MAAZA,IACIM,UAAUlG,OAAS,GACnB4F,EAAWzB,EACXA,OAAMnC,IAEN4D,EAAWxB,EACXA,OAAMpC,KAGdmC,EAAMQ,EAAK,QAAE,EAAAR,SAAF,QAAoB,EAAG,EAAG1C,KAAKzB,UAC1CoE,EAAMO,EAAK,QAAE,EAAAP,SAAF,QAAoB3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,SACrC,CACX,IAAIoB,EAAOK,KAAK4E,KAAKlC,GACrB,GACI/C,EAAKtC,MAAQ8G,EAASxE,EAAKtC,MAAOqF,GAClC/C,EAAOA,EAAKR,aACLuD,EAAMC,GAErB,OAAO3C,OAzRf,2CA4RI,WAAM0C,EAAcC,GAApB,uGACID,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,UAI1B+E,EADO,MAAPX,EACM,kBAAM,EAAKpE,QACVoE,GAAO,EACR,kBAAMA,GAEN,kBAAM,EAAKpE,OAASoE,OATlC,gBAaYhD,EAAOK,KAAK4E,KAAKlC,GAb7B,OAeY,OAfZ,SAekB/C,EAAKtC,MAfvB,OAgBYsC,EAAOA,EAAKR,KAhBxB,YAiBmBuD,EAAMY,KAAS3D,IAASK,KAAKjE,KAjBhD,gEA5RJ,qBAmTI,SAAkBoD,EAA2BY,GACzC,IADsE,EAClE6D,EAAOzE,EAAKyE,KADsD,E,gmBAAA,CAElD7D,GAFkD,IAEtE,2BAA8B,KACpBJ,EAAO,CAAEiE,OAAMvG,MADK,SAE1BuG,EAAKzE,KAAOQ,EACZiE,EAAOjE,IACLK,KAAKzB,QAN2D,8BAQtEqF,EAAKzE,KAAOA,EACZA,EAAKyE,KAAOA,IA5TpB,kBAuUI,SAAe9F,GACX,IAAI6B,EAAOK,KAAKjE,KAChB,GAAI+B,EAAQkC,KAAKzB,OAAS,EACtB,KAAOT,MAAW,GACd6B,EAAOA,EAAKR,UAGhB,IAAKrB,EAAQkC,KAAKzB,OAAST,EAAOA,EAAQ,IAAKA,EAC3C6B,EAAOA,EAAKiE,KAGpB,OAAOjE,O,kBAlVf,K,+qBCsPMxC,OAAO0C,SAxPN,I,GAAMoF,GAAb,WAkBI,WAAYlF,I,4FAAwB,gFAChCC,KAAKzB,OAAS,EACdyB,KAAKjE,KAAO,GACZiE,KAAKjE,KAAKoD,KAAOa,KAAKjE,KACtBiE,KAAKT,KAAOS,KAAK2E,QAAQ3E,KAAKjE,KAAMgE,UAAY,I,QAtBxD,O,EAAA,G,EAAA,kBAyBI,SAAIjC,EAAeT,GACf,GAAIS,GAAS,GAAKA,EAAQkC,KAAKzB,OAAQ,CACnC,IAAMqF,EAAO5D,KAAK4E,KAAK9G,EAAQ,GAC/B8F,EAAKzE,KAAO,CAAE9B,QAAO8B,KAAMyE,EAAKzE,QAC9Ba,KAAKzB,YACAT,IAAUkC,KAAKzB,QACtByB,KAAKjB,KAAK1B,GAEd,OAAO2C,KAAKzB,SAjCpB,oBAoCI,SAAOT,EAAeiC,GAMlB,OALIjC,GAAS,GAAKA,EAAQkC,KAAKzB,OAC3ByB,KAAK2E,QAAQ3E,KAAK4E,KAAK9G,EAAQ,GAAIiC,GAC5BjC,IAAUkC,KAAKzB,SACtByB,KAAKT,KAAOS,KAAK2E,QAAQ3E,KAAKT,KAAMQ,IAEjCC,KAAKzB,SA1CpB,mBA6CI,WACIyB,KAAKzB,OAAS,EACdyB,KAAKT,KAAOS,KAAKjE,KAAKoD,KAAOa,KAAKjE,OA/C1C,oBAkDI,WAA+C,IAC3C,IAAMwF,EAAM,IAAI0D,EAAWjF,MADgB,mBAArClB,EAAqC,yBAArCA,EAAqC,gBAE3C,cAAmBA,EAAnB,eAA0B,CAArB,IAAME,EAAI,KACXuC,EAAItB,OAAOsB,EAAIjB,KAAMtB,GAEzB,OAAOuC,IAvDf,wBA0DI,SAAWzD,EAAe4E,EAAcC,GAAoB,QAIxD,GAFA7E,EAAQoF,EAAMpF,EAAO,EAAGkC,KAAKzB,SAC7BmE,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,WAClBT,EACR,OAAOkC,KAMX,GAFA2C,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,QAEpCmE,IADJC,EAAMD,EAAMxE,KAAKwE,IAAIC,EAAMD,EAAK1C,KAAKzB,OAAST,IAE1C,OAAOkC,KAIX,GAAIlC,EAAQ4E,EAAK,CACb,IAAM/C,EAAOK,KAAK4E,KAAK9G,EAAQ,GAE/B,OADAkC,KAAKkF,YAAYlF,KAAK4E,KAAKlC,EAAM5E,EAAQ,EAAG6B,GAAOA,EAAMgD,EAAMD,GACxD1C,KAIX,GAAIlC,EAAQ6E,EAAK,CACb,IAAMhD,EAAOK,KAAK4E,KAAKlC,EAAM,GAE7B,OADA1C,KAAKkF,YAAYvF,EAAMK,KAAK4E,KAAK9G,EAAQ4E,EAAM,EAAG/C,GAAOgD,EAAMD,GACxD1C,KAIX,IAAM6E,EAAQ7E,KAAK4E,KAAKlC,EAAM,GACxByC,EAAQnF,KAAK4E,KAAKjC,EAAMD,EAAM,EAAGmC,GACjCO,EAAQpF,KAAKkF,YAAYL,EAAOM,EAAOrH,EAAQ4E,GACjD5E,GAAS6E,EAAMD,IAAQ1C,KAAKzB,SAC5ByB,KAAKT,KAAO4F,GAEhB,IAAMlE,EAAO4D,EAAM1F,KAInB,OAHA0F,EAAM1F,KAAOgG,EAAMhG,KACnBgG,EAAMhG,KAAOiG,EAAMjG,KACnBiG,EAAMjG,KAAO8B,EACNjB,OAlGf,kBAqGI,SAAKG,EAAYuC,EAAcC,GAAoB,QAG/C,IAFAD,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,UAC9BoE,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,SACzB,CACX,IAAIoB,EAAOK,KAAK4E,KAAKlC,GACrB,GACI/C,EAAKtC,MAAQ8C,EACbR,EAAOA,EAAKR,aACLuD,EAAMC,GAErB,OAAO3C,OA/Gf,iBAkHI,SAAIlC,GACA,KAAIA,EAAQ,GAAKA,GAASkC,KAAKzB,QAG/B,OAAOT,EAAQkC,KAAKzB,OAAS,EAAIyB,KAAK4E,KAAK9G,GAAOT,MAAQ2C,KAAKT,KAAKlC,QAtH5E,oBAyHI,SAAOS,EAAeqG,GAClB,KAAIrG,EAAQ,GAAKA,GAASkC,KAAKzB,QAA/B,CAGA,IAAMoB,EAAO7B,EAAQkC,KAAKzB,OAAS,EAAIyB,KAAK4E,KAAK9G,GAASkC,KAAKT,KACzDlC,EAAQsC,EAAKtC,MAEnB,OADAsC,EAAKtC,MAAQ8G,EAASxE,EAAKtC,OACpBA,KAhIf,iBAmII,WACI,KAAI2C,KAAKzB,OAAS,GAAlB,CAGA,IAAMlB,EAAQ2C,KAAKT,KAAKlC,MAIxB,OAHA2C,KAAKT,KAAOS,KAAK4E,KAAK5E,KAAKzB,OAAS,GACpCyB,KAAKT,KAAKJ,KAAOa,KAAKjE,OACpBiE,KAAKzB,OACAlB,KA3If,kBA8II,SAAKA,GACD,IAAMkC,EAAsB,CAAEJ,KAAMa,KAAKjE,KAAMsB,SAG/C,OAFA2C,KAAKT,KAAKJ,KAAOI,EACjBS,KAAKT,KAAOA,IACHS,KAAKzB,SAlJtB,oBAqJI,SAAOT,GACH,KAAIA,EAAQ,GAAKA,GAASkC,KAAKzB,QAA/B,CAGA,IAAMqF,EAAO5D,KAAK4E,KAAK9G,EAAQ,GACzB6B,EAAOiE,EAAKzE,KAKlB,OAJAyE,EAAKzE,KAAOQ,EAAKR,KACbrB,MAAYkC,KAAKzB,SACjByB,KAAKT,KAAOqE,GAETjE,EAAKtC,SA/JpB,qBAkKI,SAAQqF,EAAcC,GAAoB,QAGtC,GAFAD,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,SAC9BoE,EAAMO,EAAK,UAACP,SAAD,QAAQ3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,SAC9BmE,EAAM,EACZ,OAAO1C,KAEX,IAAMjE,EAAOiE,KAAK4E,KAAKlC,EAAM,GAC7B1C,KAAKT,KAAOoD,GAAO3C,KAAKzB,OAASxC,EAAKoD,KAAQa,KAAKT,KAInD,IAHA,IAAMA,EAAOxD,EAAKoD,KACdyE,EAAOrE,EACPI,EAAOJ,EAAKJ,OACPuD,EAAMC,GAAK,CAChB,IAAMxD,EAAOQ,EAAKR,KAClBQ,EAAKR,KAAOyE,EACZA,EAAOjE,EACPA,EAAOR,EAIX,OAFApD,EAAKoD,KAAOyE,EACZrE,EAAKJ,KAAOQ,EACLK,OArLf,iBAwLI,SAAIlC,EAAeqC,GACf,KAAIrC,EAAQ,GAAKA,GAASkC,KAAKzB,QAA/B,CAGA,IAAMoB,EAAOK,KAAK4E,KAAK9G,GACjBT,EAAQsC,EAAKtC,MAEnB,OADAsC,EAAKtC,MAAQ8C,EACN9C,KA/Lf,mBAkMI,WACI,OAAO2C,KAAKqF,OAAO,KAnM3B,gBAsMI,WACI,OAAOrF,KAAKzB,SAvMpB,mBA0MI,SAAMmE,EAAcC,GAChB,OAAO,IAAIsC,EAAWjF,KAAKgF,KAAKtC,EAAKC,MA3M7C,oBA8MI,SAAO0B,EAAgBC,EAAgBvE,GAAiC,QACpEsE,EAAQnB,EAAK,UAACmB,SAAD,QAAU,EAAG,EAAGrE,KAAKM,MAClCgE,EAAQ9B,EAAK,UAAC8B,SAAD,QAAUtE,KAAKM,KAAM,EAAGN,KAAKM,KAAO+D,GAGjD,IAAMiB,EAAU,IAAIL,EACpB,GAAgB,MAAZlF,GAAoBuE,EAAQ,EAC5B,OAAOgB,EAMX,IAFA,IAAI1B,EAAO5D,KAAK4E,KAAKP,EAAQ,GACvBkB,EAAUlB,EAAQC,GAAStE,KAAKM,KAC/BgE,KAAU,GAAG,CAChB,IAAM3E,EAAOiE,EAAKzE,KAClBmG,EAAQvG,KAAKY,EAAKtC,OAClBuG,EAAKzE,KAAOQ,EAAKR,OACfa,KAAKzB,OAOX,OAHAqF,EAAO5D,KAAK2E,QAAQf,EAAM7D,UAAY,IACtCC,KAAKT,KAAOgG,EAAU3B,EAAO5D,KAAKT,KAE3B+F,IAtOf,kBAyOI,SAAKvH,GACD,GAAIiC,KAAKzB,OAAS,EAAG,CACjB,O,EAAqB8E,EAAgBrD,KAAKjE,KAAKoD,KAAOa,KAAKzB,QAAQ,EAAOR,G,EAA1E,E,oiBAAOgH,EAAP,KAAaxF,EAAb,KACAS,KAAKjE,KAAKoD,KAAO4F,EACjB/E,KAAKT,KAAOA,E,QAEhB,OAAOS,OA/Of,uCAwPI,mGACaL,EAAOK,KAAKjE,KAAKoD,KAD9B,UACqCQ,IAASK,KAAKjE,KADnD,gBAEQ,OAFR,SAEc4D,EAAKtC,MAFnB,OACyDsC,EAAOA,EAAKR,KADrE,+DAxPJ,qBA8PI,SAAQ9B,GACJ,OAAO2C,KAAKwF,IAAI,EAAGnI,KA/P3B,oBAyQI,SACIqF,EACAC,EACAwB,GACI,QAYJ,GAXgB,MAAZA,IACIM,UAAUlG,OAAS,GACnB4F,EAAWzB,EACXA,OAAMnC,IAEN4D,EAAWxB,EACXA,OAAMpC,KAGdmC,EAAMQ,EAAK,QAAE,EAAAR,SAAF,QAAoB,EAAG,EAAG1C,KAAKzB,UAC1CoE,EAAMO,EAAK,QAAE,EAAAP,SAAF,QAAoB3C,KAAKzB,OAAQ,EAAGyB,KAAKzB,SACrC,CACX,IAAIoB,EAAOK,KAAK4E,KAAKlC,GACrB,GACI/C,EAAKtC,MAAQ8G,EAASxE,EAAKtC,MAAOqF,GAClC/C,EAAOA,EAAKR,aACLuD,EAAMC,GAErB,OAAO3C,OAhSf,2CAmSI,WAAM0C,EAAcC,GAApB,uGACID,EAAMQ,EAAK,UAACR,SAAD,QAAQ,EAAG,EAAG1C,KAAKzB,UAI1B+E,EADO,MAAPX,EACM,kBAAM,EAAKpE,QACVoE,GAAO,EACR,kBAAMA,GAEN,kBAAM,EAAKpE,OAASoE,OATlC,gBAaYhD,EAAOK,KAAK4E,KAAKlC,GAb7B,OAeY,OAfZ,SAekB/C,EAAKtC,MAfvB,OAgBYsC,EAAOA,EAAKR,KAhBxB,YAiBmBuD,EAAMY,KAAS3D,IAASK,KAAKjE,KAjBhD,gEAnSJ,qBAwTI,SAAkB6H,EAAqB7D,GACnC,IADyE,EACnEZ,EAAOyE,EAAKzE,KADuD,E,gmBAAA,CAErDY,GAFqD,IAEzE,2BAA8B,KACpBJ,EAAO,CAAEtC,MADW,SAE1BuG,EAAKzE,KAAOQ,EACZiE,EAAOjE,IACLK,KAAKzB,QAN8D,8BASzE,OADAqF,EAAKzE,KAAOA,EACLyE,IAjUf,yBA0UI,SAAsBxC,EAAqBJ,EAAmBsD,GAC1D,KAAOA,KAAU,GACblD,EAAOA,EAAKjC,MACZ6B,EAAKA,EAAG7B,MACL9B,MAAQ+D,EAAK/D,MAEpB,OAAO2D,IAhVf,kBAyVI,SAAelD,GAEX,IAF0E,IAAhD/B,EAAgD,uDAA1BiE,KAAKjE,KACjD4D,EAAO5D,EACJ+B,MAAW,GACd6B,EAAOA,EAAKR,KAEhB,OAAOQ,O,kBA9Vf,KCAO,SAAS8F,GAAQpG,GAEpB,IADA,IAAIC,EAAI,EACDD,KACDC,EACFD,GAAKA,EAAI,EAEb,OAAOC,EAWJ,SAASoG,GAAOrG,GACnB,IAAMC,EAAIqG,GAAItG,GACd,OAAOuG,GAAIvG,GAAKC,EAAKA,EAAI,IAStB,SAASuG,GAAOxG,GACnB,OAAyB,IAAjBA,EAAKA,EAAI,GASd,SAASyG,GAAIzG,GAChB,IAAIC,GAAK,EACT,IAAKD,EAAI0G,GAAI1G,GAAIA,EAAGA,KAAO,IACrBC,EAEN,OAAOA,EASJ,SAASyG,GAAI1G,GAChB,OAAOuG,GAAIvG,GAAKA,GASb,SAAS2G,GAAK3G,GACjB,OAAOuG,GAAIvG,EAAK0G,GAAI1G,EAAI0G,GAAI1G,IAAM,GAkB/B,SAAS4G,GAAK5G,GACjB,OAAO0G,GAAI1G,EAAI0G,GAAI1G,MAAQ,GAAKuG,GAAI,WAAavG,GAS9C,SAAS6G,GAAI7G,GAEhB,IADA,IAAIC,GAAK,EACI,IAAND,KACDC,EACFD,KAAO,EAEX,OAAOC,EASJ,SAASqG,GAAItG,GAEhB,IADA,IAAIC,EAAID,GAAKA,EACNA,GAAKC,GAERA,GADAD,GAAKC,IACID,EAEb,OAAOuG,GAAItG,GASR,SAAS6G,GAAK9G,GAEjB,IADA,IAAIC,EAAID,GAAKA,EACNA,EAAKA,EAAIC,GAEZA,GADAD,GAAKC,IACID,EAEb,OAAOuG,GAAIvG,GASR,SAAS+G,GAAQ/G,GAKpB,OAAOuG,IADPvG,GAAU,YADVA,GAAU,YADVA,GAAU,YADVA,GAAU,WAAJA,KAAoB,GAAW,WAAJA,IAAmB,MAC1B,GAAW,UAAJA,IAAmB,MAC1B,GAAW,UAAJA,IAAmB,MAC1B,GAAW,SAAJA,IAAmB,KAClC,GAAOA,GAAK,IAO3B,SAASuG,GAAIvG,GAChB,OAAOA,IAAM,E,0KCjHZlC,OAAO0C,SAxCL,I,GAAMwG,GAAb,WAUI,WAAYtG,G,qGAAwB,S,OAAA,G,EAAA,gB,sBAAA,K,uDAAA,K,KAChCC,KAAKhC,MAAQ+B,EAAWvC,MAAM4D,KAAKrB,GAAY,G,QAXvD,O,EAAA,G,EAAA,oBAcI,WACIC,KAAKhC,MAAMO,OAAS,IAf5B,qBAkBI,WACI,OAAOyB,KAAKM,KAAO,OAAIC,EAAYP,KAAKhC,MAAMoG,UAnBtD,qBAsBI,SAAQjE,GACJ,OAAOH,KAAKhC,MAAMe,KAAKoB,KAvB/B,kBA0BI,WACI,OAAOH,KAAKM,KAAO,OAAIC,EAAYP,KAAKhC,MAAM,KA3BtD,gBA8BI,WACI,OAAOgC,KAAKhC,MAAMO,SA/B1B,cAwCI,WACI,OAAOyB,KAAKhC,MAAMb,OAAO0C,iB,kBAzCjC,K,0KCyCK1C,OAAO0C,SAxCL,I,GAAMyG,GAAb,WAUI,WAAYvG,G,qGAAwB,S,OAAA,G,EAAA,e,sBAAA,K,uDAAA,K,OAChCC,KAAKhB,KAAO,IAAIiG,GAAWlF,G,QAXnC,O,EAAA,G,EAAA,oBAcI,WACIC,KAAKhB,KAAKuH,UAflB,qBAkBI,WACI,OAAOvG,KAAKhB,KAAKoF,UAnBzB,qBAsBI,SAAQjE,GACJ,OAAOH,KAAKhB,KAAKD,KAAKoB,KAvB9B,kBA0BI,WACI,OAAOH,KAAKhB,KAAKnC,IAAI,KA3B7B,gBA8BI,WACI,OAAOmD,KAAKhB,KAAKsB,OA/BzB,cAwCI,WACI,OAAON,KAAKhB,KAAK7B,OAAO0C,iB,kBAzChC,K,6eC2GM1C,OAAO0C,SA/FN,I,GAAM2G,GAAb,WAqBI,WAAYC,GAAmD,IAA5B1G,EAA4B,uDAAJ,GAAI,6DAC3DC,KAAKhC,MAAQ,GACbgC,KAAKyG,QAAUA,EACfzG,KAAK0G,MAAM3G,G,QAxBnB,O,EAAA,G,EAAA,oBA2BI,WACIC,KAAKhC,MAAMO,OAAS,IA5B5B,iBA+BI,WAEI,KAAIyB,KAAKM,KAAO,GAAhB,CAMA,IADA,IAAMhC,EAAI0B,KAAKhC,MAAMO,OAAS,EACrBoI,EAAO,EAAGrI,EAAIqI,EAAMA,GAAQ,EACjC3G,KAAKhC,MAAMM,EAAIqI,GAAQ3G,KAAKhC,MAAMM,EAAIqI,GAAQA,IAAS,IAI3D,IAAMpF,EAAMvB,KAAKhC,MAAMM,EAAI,GAE3B,OADA0B,KAAKhC,MAAMO,QAAU,EACdgD,KA9Cf,kBAiDI,SAAKpB,GAED,GAAIH,KAAKM,MAAQkG,EAAmBI,SAChC,MAAM,IAAI1G,WAAJ,kBAIV,IAAM5B,EAAI0B,KAAKhC,MAAMO,OAGrB,OAFAyB,KAAKhC,MAAMM,EAAI,GAAK0B,KAAK6G,IAAIvI,EAAG6B,GAEzBH,KAAKM,OA3DpB,mBA8DI,SAAMoC,EAAaC,GAEf,GAAID,GAAOC,EACP,MAAM,IAAIzC,WAAJ,iBAAyBwC,EAAzB,aAAiCC,EAAjC,eAEV,GAAID,EAAM,GAAKC,EAAM3C,KAAKM,KACtB,MAAM,IAAIJ,WAAJ,iBAAyBwC,EAAzB,aAAiCC,EAAjC,wBAAoD3C,KAAKM,KAAzD,MAQV,IAAIwG,EAASf,IAJbrD,GAAO,GAIgBiD,IAHvBhD,GAAO,GAG0BD,IAC7BrF,EAAQ2C,KAAKhC,MAAM0E,EAAM,GAAKoE,IAAW,IAG7C,IAAKpE,GAAOoE,EAAQpE,EAAMC,EAAKD,GAAOoE,EAClCA,EAASf,GAAIrD,EAAMiD,GAAIhD,EAAMD,IAC7BrF,EAAQ2C,KAAKyG,QAAQpJ,EAAO2C,KAAKhC,MAAM0E,EAAM,GAAKoE,IAAW,KAGjE,OAAOzJ,IArFf,gBAwFI,WACI,OAAO2C,KAAKhC,MAAMO,SAAW,IAzFrC,uCA+FI,mGACaD,EAAI,EADjB,YACoBA,EAAI0B,KAAKhC,MAAMO,QADnC,gBAEQ,OAFR,SAEcyB,KAAKhC,MAAMM,GAFzB,OAC2CA,GAAK,EADhD,+DA/FJ,oBAqGI,SAAOoE,EAAaC,EAAaoE,GAE7B,KAAIrE,GAAOC,GAAX,CAGA,GAAID,EAAM,GAAKC,EAAM3C,KAAKM,KACtB,MAAM,IAAIJ,WAAJ,iBAAyBwC,EAAzB,aAAiCC,EAAjC,wBAAoD3C,KAAKM,KAAzD,MAQV,IAAIjD,EAJJqF,GAAO,EACPC,GAAO,EAIP,GACItF,EAAQ2C,KAAK6G,IAAInE,EAAKqE,EAAU/G,KAAKhC,MAAM0E,GAAMA,IAAQ,IACzDA,GAAO,QACFA,EAAMC,GAGf,IAAIqE,EAAK,EACLC,EAAKlB,GAAIrD,GAEb,IADAC,EAAMuD,GAAIxD,EAAM1C,KAAKhC,MAAMO,QAAUuH,GAAIpD,KAClCA,EAAKC,EAAM,IAAKA,EACnBtF,EAAQ2C,KAAKyG,QAAQpJ,EAAO2C,KAAKhC,MAAM0E,GAAOuE,IAAO,GAAKD,IAC1DhH,KAAKhC,MAAM0E,GAAOrF,EAElBqF,GAAOuE,GADPD,GAAMtE,EAAO,EAAIuE,KAAS,GAE1BA,GAAM,EAIVjH,KAAKhC,MAAM0E,GAAOrF,KAtI1B,mBA6II,SAAgB0C,GAAuB,Q,65BAAA,CACbA,GADa,IACnC,2BAAgC,KAArBI,EAAqB,QAC5BH,KAAKjB,KAAKoB,IAFqB,iCA7I3C,iBAqJI,SAAcrC,EAAeqC,GAEzBH,KAAKhC,MAAMF,KAAWqC,EAGtB,IAAK,IAAIwG,EAAO,EAAG7I,EAAQ6I,EAAMA,GAAQ,EACrCxG,EAAUH,KAAKyG,QAAQzG,KAAKhC,MAAMF,EAAQ6I,GAAQA,IAAS,IAAKxG,GAChEH,KAAKhC,MAAMF,EAAQ6I,GAAQxG,EAG/B,OAAOA,O,kBA/Jf,K,64CAAaqG,G,WAM0BlJ,Y,GCyGjCH,OAAO0C,SAjHN,I,GAAMqH,GAAb,WA6BI,WAAYT,GAAmD,IAA5B1G,EAA4B,uDAAJ,GAAI,8GAC3DC,KAAKhC,MAAQ,GACbgC,KAAKyG,QAAUA,EACfzG,KAAKzB,OAAS,EACdyB,KAAKmH,MAAQ,EACbnH,KAAK0G,MAAM3G,G,QAlCnB,O,EAAA,G,EAAA,oBAqCI,WACIC,KAAKzB,OAAS,EACdyB,KAAKmH,MAAQ,EACbnH,KAAKhC,MAAMO,OAAS,IAxC5B,iBA2CI,WAEI,KAAIyB,KAAKzB,QAAUyB,KAAKmH,OAAxB,CAKA,IAAM5F,EAAMvB,KAAKhC,QAAQgC,KAAKzB,QAO9B,OAJIyB,KAAKzB,QAAWyB,KAAKhC,MAAMO,OAAS,IAAO,GAC3CyB,KAAKoH,SAGF7F,KAzDf,kBA4DI,SAAKpB,GAEGH,KAAKzB,QAAUyB,KAAKhC,MAAMO,QAC1ByB,KAAKqH,OAITrH,KAAKhC,MAAMgC,KAAKzB,UAAY4B,EAG5B,IAAK,IAAI7B,EAAI0B,KAAKzB,OAAY,EAAJD,EAAO0B,KAAKhC,MAAMM,EAAI,GAAK6B,EACjDA,EAAUH,KAAKyG,QAAQzG,KAAKhC,MAAMM,EAAI,GAAI6B,GAC1C7B,KAAO,EAGX,OAAO0B,KAAKM,OA3EpB,mBA8EI,SAAMoC,EAAaC,GAEf,GAAID,GAAOC,EACP,MAAM,IAAIzC,WAAJ,iBAAyBwC,EAAzB,aAAiCC,EAAjC,eAEV,GAAID,EAAM,GAAKC,EAAM3C,KAAKM,KACtB,MAAM,IAAIJ,WAAJ,iBAAyBwC,EAAzB,aAAiCC,EAAjC,wBAAoD3C,KAAKM,KAAzD,MAQV,IAAIwG,EAASf,IAJbrD,GAAO1C,KAAKmH,MAAQ,GAIGxB,IAHvBhD,GAAO3C,KAAKmH,MAAQ,GAGazE,IAC7BrF,EAAW2C,KAAKhC,MAAM0E,EAAMoE,EAAS,GAIzC,IAHApE,GAAOoE,EAGApE,EAAMC,GACTmE,EAASf,GAAIrD,EAAMiD,GAAIhD,EAAMD,IAC7BrF,EAAQ2C,KAAKyG,QAAQpJ,EAAO2C,KAAKhC,MAAM0E,EAAMoE,EAAS,IACtDpE,GAAOoE,EAGX,OAAOzJ,IAvGf,gBA0GI,WACI,OAAO2C,KAAKzB,OAASyB,KAAKmH,QA3GlC,uCAiHI,mGACa7I,EAAI,EADjB,YACoBA,EAAI0B,KAAKM,MAD7B,gBAEQ,OAFR,SAEcN,KAAKhC,MAAMgC,KAAKmH,MAAQ7I,GAFtC,SACqCA,EADrC,+DAjHJ,oBAuHI,SAAOoE,EAAaC,EAAaoE,GAE7B,KAAIrE,GAAOC,GAAX,CAGA,GAAID,EAAM,GAAKC,EAAM3C,KAAKM,KACtB,MAAM,IAAIJ,WAAJ,iBAAyBwC,EAAzB,aAAiCC,EAAjC,wBAAoD3C,KAAKM,KAAzD,MAIVoC,GAAO1C,KAAKmH,MACZxE,GAAO3C,KAAKmH,MAGZ,IAAK,IAAI7I,EAAIoE,EAAKpE,EAAIqE,IAAOrE,EACzB0B,KAAKhC,MAAMM,GAAKyI,EAAU/G,KAAKhC,MAAMM,GAAIA,EAAI0B,KAAKmH,OAItDnH,KAAKsH,UAAU5E,EAAKC,MA1I5B,uBA+II,SAAoBD,EAAaC,KAE3BD,IACAC,EAGF,IAAK,IAAI4E,EAAMvH,KAAKzB,OAAS,EAAGmE,EAAMC,EAAK4E,KAAS,EAAG,CACnD5E,GAAOA,EAAQA,EAAM4E,IAAS,GAC9B,IAAK,IAAIjJ,GAAW,EAANoE,KAAa,EAAGpE,EAAIqE,EAAKrE,GAAK,EACxC0B,KAAKhC,OAAOM,IAAM,GAAK,GAAK0B,KAAKyG,QAAQzG,KAAKhC,MAAMM,EAAI,GAAI0B,KAAKhC,MAAMM,EAAI,IAE/EoE,KAAS,EACTC,KAAS,KA3JrB,mBAmKI,SAAgB5C,GACZ,IChLqBjD,EDgLjBN,OAA0B+D,EAG9B,GAAIhD,EAAQwC,GACRvD,EAAM,aACH,MCpLJ,SADkBM,EDqLGiD,KCpLmB,iBAAhBjD,EAAG,KDsLvB,YACmBiD,GADnB,IACH,2BAAgC,KAArBI,EAAqB,QAC5BH,KAAKjB,KAAKoB,IAFX,8BAIH,OALA3D,EAAM,OASV,IAAMiC,EAAasB,EAAiBvD,GAGpC,GAAIiC,EAAI,EAIJ,OAHAuB,KAAKhC,MAAMO,OAAS,EACpByB,KAAKzB,OAAS,OACdyB,KAAKmH,MAAQ,GAKjB,GAAI1I,GAAKyI,EAAsBN,SAC3B,MAAM,IAAI1G,WAAW,kBAIzBF,KAAKmH,MAAQ,EAAIxB,GAAIlH,EAAI,GAAK,EAC9BuB,KAAKzB,OAASyB,KAAKmH,MACnBnH,KAAKhC,MAAMO,OAAS,EAAIyB,KAAKmH,MAAQ,EAlCoB,WAqCnCpH,GArCmC,IAqCzD,2BAAgC,KAArBI,EAAqB,QAC5BH,KAAKhC,MAAMgC,KAAKzB,UAAY4B,GAtCyB,8BA0CzDH,KAAKsH,UAAUtH,KAAKmH,MAAOnH,KAAKzB,UA7MxC,kBAkNI,WAEI,GAAIyB,KAAKM,KAAO,EACZN,KAAKhC,MAAMO,OAAS,MADxB,CAMA,GAAIyB,KAAKM,MAAQ4G,EAAsBN,SACnC,MAAM,IAAI1G,WAAW,kBAIzBF,KAAKhC,MAAMO,QAAUyB,KAAKhC,MAAMO,OAAS,EAIzC,IADA,IAAImE,EAAM1C,KAAKmH,MAAQ,EACdxE,EAAM3C,KAAKzB,OAAS,EAAGmE,EAAMC,EAAKA,KAAS,EAChD3C,KAAKhC,MAAMiG,WAAW,EAAIvB,EAAM,EAAGA,EAAM,EAAGC,EAAM,GAClDD,KAAS,EAIb1C,KAAKzB,QAAUyB,KAAKmH,MAAQ,EAC5BnH,KAAKmH,OAASnH,KAAKmH,MAAQ,KA1OnC,oBA+OI,WACI,IAAM5I,EAASyB,KAAKzB,OAASyB,KAAKmH,MAGlC,GAAI5I,EAAS,EAKT,OAJAyB,KAAKhC,MAAMiG,WAAW,EAAGjE,KAAKmH,MAAOnH,KAAKzB,QAC1CyB,KAAKmH,MAAQ,EACbnH,KAAKzB,OAASA,OACdyB,KAAKhC,MAAMO,OAASA,GAKxB,IAAImE,EAAM1C,KAAKmH,MAAQ,EACnBR,EAAOhB,GAAIpH,GACfmE,EAAMA,EAAMqD,GAAIrD,EAAMiE,GAAQ,EAG9B3G,KAAKmH,QAAUtB,GAAOtH,GACtB,IAAK,IAAIoE,EAAMD,EAAM,EAAGiE,EAAM3G,KAAKmH,OAASnH,KAAKmH,MAAQ,EACrDnH,KAAKhC,MAAMiG,WAAWjE,KAAKmH,MAAOzE,EAAKC,GAEvCD,GAAOA,EAAM,EACbC,GAAOA,EAAM,MAAOpE,GAFpBoI,KAAU,IAE2B,GAIzC3G,KAAKzB,OAASyB,KAAKmH,MAAQ5I,EAC3ByB,KAAKhC,MAAMO,OAAS,EAAIyB,KAAKmH,MAAQ,O,kBA3Q7C,K,0KAAaD,G,WAM0B,Y,GEuBjC/J,OAAO0C,SAxCN,I,GAAM2H,GAAb,WAUI,WAAYzH,G,qGAAwB,S,OAAA,G,EAAA,gB,sBAAA,K,uDAAA,K,KAChCC,KAAKhC,MAAQ+B,EAAWvC,MAAM4D,KAAKrB,GAAY,G,QAXvD,O,EAAA,G,EAAA,oBAcI,WACIC,KAAKhC,MAAMO,OAAS,IAf5B,kBAkBI,WACI,OAAOyB,KAAKhC,MAAMgC,KAAKhC,MAAMO,OAAS,KAnB9C,iBAsBI,WACI,OAAOyB,KAAKhC,MAAMwB,QAvB1B,kBA0BI,SAAKW,GACD,OAAOH,KAAKhC,MAAMe,KAAKoB,KA3B/B,gBA8BI,WACI,OAAOH,KAAKhC,MAAMO,SA/B1B,uCAwCI,qGACUP,EAAQgC,KAAKhC,MACVM,EAAIN,EAAMO,OAFvB,YAE+BD,EAAI,GAFnC,uBAEsC,OAFtC,SAE4CN,IAAQM,GAFpD,yE,kBAxCJ,K,qRC4CKnB,OAAO0C,SA3CL,I,GAAM4H,GAAb,WAUI,WAAY1H,G,qGAAwB,S,OAAA,G,EAAA,e,sBAAA,K,uDAAA,K,OAChCC,KAAKhB,KAAO,IAAIiG,GADgB,Q,65BAAA,CAEVlF,GAAY,IAFF,IAEhC,2BAAsC,KAA3BI,EAA2B,QAClCH,KAAKjB,KAAKoB,IAHkB,+B,QAVxC,O,EAAA,G,EAAA,oBAiBI,WACIH,KAAKhB,KAAKuH,UAlBlB,kBAqBI,WACI,OAAOvG,KAAKhB,KAAKnC,IAAI,KAtB7B,iBAyBI,WACI,OAAOmD,KAAKhB,KAAKoF,UA1BzB,kBA6BI,SAAKjE,GACD,OAAOH,KAAKhB,KAAKwF,QAAQrE,KA9BjC,gBAiCI,WACI,OAAOH,KAAKhB,KAAKsB,OAlCzB,cA2CI,WACI,OAAON,KAAKhB,KAAK7B,OAAO0C,iB,kBA5ChC,K,8yCCgMM1C,OAAO0C,SAlKN,I,GAAM6H,GAAb,WAmCI,WACI3J,EACA4J,EACA5H,GACF,O,4FAAA,gHACiC,kBAApB4H,IACP5H,EAAW4H,EACXA,GAAkB,GAEtB3H,KAAKZ,QAAUrB,EACfiC,KAAKgC,YAAc2F,EACnB3H,KAAKzB,OAAS,EACdyB,KAAK0G,MAAL,UAAW3G,SAAX,QAAuB,I,QA/C/B,O,EAAA,G,EAAA,kBAkDI,SAAII,GAEA,IAAMyH,EAAW,CAAEhI,KAAMI,KAAKjE,MAC1BgF,EAA4B,CAAEK,KAAMwG,EAAUvG,MAAO,OAAQL,GAAIhB,KAAKjE,MACtE8E,EAAQkB,EAAY5B,EAAS,CAAE9C,MAAO0D,GAAQf,KAAKZ,QAASY,KAAKgC,YAGrE,GAAsB,MAAlBnB,EAAMxD,MAAM2D,GACZ,OAAOhB,KAKX,IAAIqB,GADJN,EAAOF,EAAMxD,OACIgE,MAIjB,IAHAN,EAAKK,KAAMC,GAAU,CAAE8F,MAAO,EAAG9J,MAAO8C,GAGjCU,EAAM1B,OAET4B,GADAF,EAAQA,EAAM1B,MACD9B,OACR2D,GAAK6G,GAAMC,GAAK/G,EAAKC,KAC1BD,EAAKK,KAAOC,EAAQN,EAAKM,OAAWN,EAAKC,GAM7C,QAFEhB,KAAKzB,OACPyB,KAAKjE,KAAO6L,EAAShI,KACdI,OA7Ef,mBAgFI,WACIA,KAAKjE,UAAOwE,EACZP,KAAKzB,OAAS,IAlFtB,wBAqFI,WACI,OAAOyB,KAAKZ,UAtFpB,oBAyFI,SAAOe,GAEH,IAAMyH,EAAW,CAAEhI,KAAMI,KAAKjE,MAGxBgM,EAAU1C,GADFtD,EAAY5B,EAAS,CAAE9C,MADH,CAAE+D,KAAMwG,EAAUvG,MAAO,OAAQL,GAAIhB,KAAKjE,OACxBiE,KAAKZ,QAAS,IAMlE,OAFAY,KAAKjE,KAAO6L,EAAShI,KACrBI,KAAKzB,SAAWwJ,EACTA,IAnGf,iBAsGI,SAAI5H,GACA,OAAmD,MAA5C0B,EAAO1B,EAASH,KAAKjE,KAAMiE,KAAKZ,WAvG/C,iBA0GI,WAAqB,MACjB,iBAAOwC,EAAU5B,KAAKjE,aAAtB,aAAO,EAAsBsB,QA3GrC,iBA8GI,WAAqB,MACjB,iBAAOoE,EAASzB,KAAKjE,aAArB,aAAO,EAAqBsB,QA/GpC,iBAkHI,WAAqB,MAEXuK,EAAW,CAAEhI,KAAMI,KAAKjE,MAExB8E,EAAQc,EAAe,CAAEtE,MADG,CAAE+D,KAAMwG,EAAUvG,MAAO,OAAQL,GAAIhB,KAAKjE,QAEtEsB,EAAK,UAAGwD,EAAMxD,MAAM2D,UAAf,aAAG,EAAgB3D,MAGxB0K,EAAU1C,GAAOxE,GAKvB,OAFAb,KAAKjE,KAAO6L,EAAShI,KACrBI,KAAKzB,SAAWwJ,EACT1K,IA/Hf,mBAkII,WAAuB,MAEbuK,EAAW,CAAEhI,KAAMI,KAAKjE,MAExB8E,EAAQa,EAAc,CAAErE,MADI,CAAE+D,KAAMwG,EAAUvG,MAAO,OAAQL,GAAIhB,KAAKjE,QAEtEsB,EAAK,UAAGwD,EAAMxD,MAAM2D,UAAf,aAAG,EAAgB3D,MAGxB0K,EAAU1C,GAAOxE,GAKvB,OAFAb,KAAKjE,KAAO6L,EAAShI,KACrBI,KAAKzB,SAAWwJ,EACT1K,IA/If,gBAkJI,WACI,OAAO2C,KAAKzB,SAnJpB,6CAsJI,4GACuBmC,EAAgBV,KAAKjE,OAD5C,wDAEQ,OADO4D,EADf,iBAEcA,EAAKtC,MAFnB,qMAtJJ,uCAkKI,4GACuBsD,EAAiBX,KAAKjE,OAD7C,wDAEQ,OADO4D,EADf,iBAEcA,EAAKtC,MAFnB,qMAlKJ,oBAwKI,SAAOmD,EAAeC,GAClB,QAAIT,KAAKgI,OAAOxH,KACZR,KAAKwF,IAAI/E,IACF,KA3KnB,mBAgLI,SAAgB3D,GACZ,GAAIS,EAAQT,GACR,IAAK,IAAIwB,EAAI,EAAGA,EAAIxB,EAAIyB,SAAUD,EAC9B0B,KAAKwF,IAAI1I,EAAIwB,SAEd,GAAIxB,aAAe4K,GAAU1H,KAAKZ,UAAYtC,EAAIsC,QACrDY,KAAKjE,KAAOuF,EAAMxE,EAAIf,MACtBiE,KAAKzB,OAASzB,EAAIwD,SACf,YACmBxD,GADnB,IACH,2BAA2B,KAAhBqD,EAAgB,QACvBH,KAAKwF,IAAIrF,IAFV,qC,kBAxLf,KAkMO,SAASkF,GAAUxE,GACtB,IAAIE,EAAOF,EAAMxD,MACbsC,EAAOoB,EAAKC,GAGhB,GAAY,MAARrB,EACA,OAAO,EAOX,IAHAkB,EAAQD,EAAYC,GAGbA,EAAM1B,MAAM,aAGfQ,GADAoB,GADAF,EAAQA,EAAM1B,MACD9B,OACD2D,GAGZ,IAAMmG,EAAQ,EAAIjJ,KAAKwE,IAAL,oBAAS/C,EAAKC,YAAd,aAAS,EAAWuH,aAApB,QAA6B,EAA7B,oBAAgCxH,EAAKT,aAArC,aAAgC,EAAYiI,aAA5C,QAAqD,GACnEA,EAAQxH,EAAKwH,QACbxH,EAAKwH,MAAQA,EACK,MAAdxH,EAAKT,OAAiBiI,EAAQxH,EAAKT,MAAMiI,QACzCxH,EAAKT,MAAMiI,MAAQA,KAK3BxH,EAAOmI,GAAKnI,IACPT,MAAQ4I,GAAKnI,EAAKT,OACL,MAAdS,EAAKT,QACLS,EAAKT,MAAMA,MAAQ4I,GAAKnI,EAAKT,MAAMA,SAEvCS,EAAOkI,GAAMlI,IACRT,MAAQ2I,GAAMlI,EAAKT,OAGxB6B,EAAKK,KAAML,EAAKM,OAAUN,EAAKC,GAAKrB,EAGxC,OAAO,EAQJ,SAASmI,GAAQnI,GACpB,GAAY,MAARA,GAA6B,MAAbA,EAAKC,MAAgBD,EAAKwH,OAASxH,EAAKC,KAAKuH,MAC7D,OAAOxH,EAEX,IAAMC,EAAOD,EAAKC,KAGlB,OAFAD,EAAKC,KAAOA,EAAKV,MACjBU,EAAKV,MAAQS,EACNC,EAQJ,SAASiI,GAASlI,GACrB,GACY,MAARA,GACc,MAAdA,EAAKT,OACe,MAApBS,EAAKT,MAAMA,OACXS,EAAKwH,OAASxH,EAAKT,MAAMA,MAAMiI,MAE/B,OAAOxH,EAEX,IAAMT,EAAQS,EAAKT,MAInB,OAHAS,EAAKT,MAAQA,EAAMU,KACnBV,EAAMU,KAAOD,IACXT,EAAMiI,MACDjI,E,8yCC/GL/B,OAAO0C,SA/JN,IAAMoI,GAAb,WAmCI,WACIlK,EACA4J,EACA5H,GACF,O,4FAAA,gHACiC,kBAApB4H,IACP5H,EAAW4H,EACXA,GAAkB,GAEtB3H,KAAKZ,QAAUrB,EACfiC,KAAKgC,YAAc2F,EACnB3H,KAAKzB,OAAS,EACdyB,KAAKjE,KAAO,GACZiE,KAAK0G,MAAL,UAAW3G,SAAX,QAAuB,I,QAhD/B,O,EAAA,G,EAAA,kBAmDI,SAAII,GAEA,IAAIY,EAA6B,CAAEK,KAAMpB,KAAKjE,KAAMsF,MAAO,OAAQL,GAAIhB,KAAKjE,KAAK6D,MAC7EiB,EAAQkB,EAAY5B,EAAS,CAAE9C,MAAO0D,GAAQf,KAAKZ,QAASY,KAAKgC,YAGrE,GAAsB,MAAlBnB,EAAMxD,MAAM2D,GACZ,OAAOhB,KAKX,IAAIqB,GADJN,EAAOF,EAAMxD,OACIgE,MAIjB,IAHAN,EAAKK,KAAMC,GAAU,CAAE6G,cAAe,EAAG7K,MAAO8C,GAGzCU,EAAM1B,QAET4B,GADAF,EAAQA,EAAM1B,MACD9B,OACR2D,GAAIkH,eAA2B,SAAV7G,GAAoB,EAAI,EAClDN,EAAKC,GAAKmH,GAAQpH,EAAKC,IACvBD,EAAKK,KAAOC,EAAQN,EAAKM,OAAWN,EAAKC,GACV,IAA3BD,EAAKC,GAAIkH,iBAOjB,QADElI,KAAKzB,OACAyB,OAhFf,mBAmFI,WACIA,KAAKjE,KAAK6D,UAAOW,EACjBP,KAAKzB,OAAS,IArFtB,wBAwFI,WACI,OAAOyB,KAAKZ,UAzFpB,oBA4FI,SAAOe,GAEH,IAEM4H,EAAU1C,GADFtD,EAAY5B,EAAS,CAAE9C,MADF,CAAE+D,KAAMpB,KAAKjE,KAAMsF,MAAO,OAAQL,GAAIhB,KAAKjE,KAAK6D,OAC/BI,KAAKZ,QAAS,IAKlE,OADAY,KAAKzB,SAAWwJ,EACTA,IApGf,iBAuGI,SAAI5H,GACA,OAAwD,MAAjD0B,EAAO1B,EAASH,KAAKjE,KAAK6D,KAAMI,KAAKZ,WAxGpD,iBA2GI,WAAqB,MACjB,iBAAOwC,EAAU5B,KAAKjE,KAAK6D,aAA3B,aAAO,EAA2BvC,QA5G1C,iBA+GI,WAAqB,MACjB,iBAAOoE,EAASzB,KAAKjE,KAAK6D,aAA1B,aAAO,EAA0BvC,QAhHzC,iBAmHI,WAAqB,MAGXwD,EAAQc,EAAe,CAAEtE,MADI,CAAE+D,KAAMpB,KAAKjE,KAAMsF,MAAO,OAAQL,GAAIhB,KAAKjE,KAAK6D,QAE7EvC,EAAK,UAAGwD,EAAMxD,MAAM2D,UAAf,aAAG,EAAgB3D,MAGxB0K,EAAU1C,GAAOxE,GAIvB,OADAb,KAAKzB,SAAWwJ,EACT1K,IA9Hf,mBAiII,WAAuB,MAGbwD,EAAQa,EAAc,CAAErE,MADK,CAAE+D,KAAMpB,KAAKjE,KAAMsF,MAAO,OAAQL,GAAIhB,KAAKjE,KAAK6D,QAE7EvC,EAAK,UAAGwD,EAAMxD,MAAM2D,UAAf,aAAG,EAAgB3D,MAGxB0K,EAAU1C,GAAOxE,GAIvB,OADAb,KAAKzB,SAAWwJ,EACT1K,IA5If,gBA+II,WACI,OAAO2C,KAAKzB,SAhJpB,6CAmJI,4GACuBmC,EAAgBV,KAAKjE,KAAK6D,OADjD,wDAEQ,OADOD,EADf,iBAEcA,EAAKtC,MAFnB,qMAnJJ,uCA+JI,4GACuBsD,EAAiBX,KAAKjE,KAAK6D,OADlD,wDAEQ,OADOD,EADf,iBAEcA,EAAKtC,MAFnB,qMA/JJ,oBAqKI,SAAOmD,EAAeC,GAClB,QAAIT,KAAKgI,OAAOxH,KACZR,KAAKwF,IAAI/E,IACF,KAxKnB,mBA6KI,SAAgB3D,GACZ,GAAIS,EAAQT,GACR,IAAK,IAAIwB,EAAI,EAAGA,EAAIxB,EAAIyB,SAAUD,EAC9B0B,KAAKwF,IAAI1I,EAAIwB,SAEd,GAAIxB,aAAemL,GAAWjI,KAAKZ,UAAYtC,EAAIsC,QACtDY,KAAKjE,KAAOuF,EAAMxE,EAAIf,MACtBiE,KAAKzB,OAASzB,EAAIwD,SACf,YACmBxD,GADnB,IACH,2BAA2B,KAAhBqD,EAAgB,QACvBH,KAAKwF,IAAIrF,IAFV,qC,kBArLf,KA+LO,SAASgI,GAAWxI,GAYvB,OAXIA,EAAKuI,cAAgB,GACjBvI,EAAKT,MAAOgJ,cAAgB,IAC5BvI,EAAKT,MAAQkJ,GAAQzI,EAAKT,QAE9BS,EAAO0I,GAAQ1I,IACRA,EAAKuI,eAAiB,IACzBvI,EAAKC,KAAMsI,cAAgB,IAC3BvI,EAAKC,KAAOyI,GAAQ1I,EAAKC,OAE7BD,EAAOyI,GAAQzI,IAEZA,EAKJ,SAAS0F,GAAUxE,GACtB,IAAIE,EAAOF,EAAMxD,MAIjB,GAAY,MAHC0D,EAAKC,GAId,OAAO,EAQX,IADA,IAAIK,GAHJR,EAAQD,EAAYC,IAGFxD,MAAMgE,MACjBR,EAAM1B,QAET4B,GADAF,EAAQA,EAAM1B,MACD9B,OACR2D,GAAIkH,eAA2B,SAAV7G,GAAoB,EAAI,EAClDN,EAAKC,GAAKmH,GAAQpH,EAAKC,IACvBD,EAAKK,KAAOC,EAAQN,EAAKM,OAAWN,EAAKC,GACV,IAA3BD,EAAKC,GAAIkH,iBAKjB,OAAO,EAKJ,SAASG,GAAWC,GACvB,IAAMC,EAAID,EAAEpJ,MAKZ,OAJAoJ,EAAEpJ,MAAQqJ,EAAE3I,KACZ2I,EAAE3I,KAAO0I,EACTA,EAAEJ,eAAiB,EAAIhK,KAAKyE,IAAI,EAAG4F,EAAEL,eACrCK,EAAEL,eAAiB,EAAIhK,KAAKwE,IAAI,EAAG4F,EAAEJ,eAC9BK,EAKJ,SAASH,GAAWE,GACvB,IAAME,EAAIF,EAAE1I,KAKZ,OAJA0I,EAAE1I,KAAO4I,EAAEtJ,MACXsJ,EAAEtJ,MAAQoJ,EACVA,EAAEJ,eAAiB,EAAIhK,KAAKwE,IAAI,EAAG8F,EAAEN,eACrCM,EAAEN,eAAiB,EAAIhK,KAAKyE,IAAI,EAAG2F,EAAEJ,eAC9BM,E","file":"dastal.min.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine(\"Dastal\", [], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Dastal\"] = factory();\n\telse\n\t\troot[\"Dastal\"] = factory();\n})(self, function() {\nreturn ","// The require scope\nvar __webpack_require__ = {};\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/**\n * The maximum length of an array.\n *\n * According to [ECMA-262](https://tc39.es/ecma262/#array-index):\n *     0 <= array.length <= 2^32 - 1\n */\nexport const MAX_ARRAY_LENGTH = 4294967295;\n/**\n * Check if a value is an Array or TypedArray.\n *\n * @param obj - The value to check.\n *\n * @returns `true` if an Array or TypedArray, otherwise `false`.\n */\nexport function isArray<T = any>(obj: unknown): obj is T[] {\n    return obj instanceof Array || isTypedArray(obj);\n}\n/**\n * Check if a value is a TypedArray.\n *\n * See [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray)\n * for more details.\n *\n * @param obj - The value to check.\n *\n * @returns `true` if a TypedArray, otherwise `false`.\n */\nexport const isTypedArray = (() => {\n    const TypedArray = Object.getPrototypeOf(Uint8Array);\n    return function isTypedArray<T = any>(obj: unknown): obj is T[] {\n        return obj instanceof TypedArray;\n    };\n})();\n","import { LinkedNode } from 'src/list';\nimport { BinaryTreeNode } from 'src/tree/binaryTreeNode';\nimport { CompareFn } from '..';\n\n/**\n * @internal\n */\nexport function bubbleUp<T>(index: number, compareFn: CompareFn<T>, array: Array<T>): void {\n    const value = array[index];\n\n    // Until we reach the top of the heap\n    while (index > 0) {\n        // Get the parent\n        const parentIndex = Math.floor((index + 1) / 2) - 1;\n        const parent = array[parentIndex]!;\n\n        // If the parent is above or equal to value, the heap is in order\n        if (compareFn(parent, value) <= 0) {\n            break;\n        }\n\n        // Swap the parent with value and continue\n        array[parentIndex] = value;\n        array[index] = parent;\n        index = parentIndex;\n    }\n}\n/**\n * @internal\n */\nexport function heapify<T>(compareFn: CompareFn<T>, array: T[]): void {\n    for (let i = (array.length + 1) >>> 1; i > 0; sinkDown(--i, compareFn, array)) {}\n}\n/**\n * @internal\n */\nexport function mergeKSorted<T>(compareFn: CompareFn<T>, lists: LinkedNode<T>[]): LinkedNode<T> {\n    // Heapify the list of lists based on\n    // the value at the head of each list.\n    const compare: CompareFn<LinkedNode<T>> = (a, b) => compareFn(a.value, b.value);\n    heapify(compare, lists);\n\n    // Combine the lists into a single list.\n    const list: LinkedNode<T> = lists[0];\n    for (let tail = list; lists.length > 1; tail = tail.next) {\n        lists[0] = lists[0].next ?? lists.pop()!;\n        sinkDown(0, compare, lists);\n        tail.next = lists[0];\n    }\n\n    return list;\n}\n/**\n * @internal\n */\nexport function sinkDown<T>(index: number, compareFn: CompareFn<T>, array: Array<T>): void {\n    const n = array.length;\n    const value = array[index];\n    do {\n        // Compute the left child's index\n        let childIndex = 2 * index + 1;\n\n        // If no children exist\n        if (childIndex >= n) {\n            break;\n        }\n\n        // Decide which child to compare with\n        let child = array[childIndex];\n        if (childIndex + 1 < n && compareFn(array[childIndex + 1], child) <= 0) {\n            child = array[++childIndex]!;\n        }\n\n        // If value <= child\n        if (compareFn(value, child) <= 0) {\n            break;\n        }\n\n        // Swap value and child\n        array[index] = child;\n        array[childIndex] = value;\n        index = childIndex;\n    } while (true);\n}\n/**\n * See: https://en.wikipedia.org/wiki/Skew_heap#Merging_two_heaps\n *\n * @param compareFn - A function used to determine the order of the heap.\n *\n * It is expected to return:\n * - A negative value if first argument < second argument\n * - Zero if first argument == second argument\n * - A positive value if first argument > second argument\n * @param heaps - An iterable of heaps to merge\n *\n * @returns The new heap\n */\nexport function skewMerge<T>(\n    compareFn: CompareFn<T>,\n    heaps: (BinaryTreeNode<T> | undefined)[],\n): BinaryTreeNode<T> | undefined {\n    // Remove undefineds and initialize a list for each heap\n    const lists: LinkedNode<BinaryTreeNode<T>>[] = [];\n    for (let i = 0; i < heaps.length; ++i) {\n        if (heaps[i] != null) {\n            lists.push({ value: heaps[i]! });\n        }\n    }\n\n    // Check if nothing to merge with\n    if (lists.length < 2) {\n        return lists[0]?.value;\n    }\n\n    // Split each heap into subheaps by cutting every right path; From the root\n    // node, sever the right node to make the right child its own heap. Repeat\n    // until you can't go right. This will turn each heap into a list of heaps\n    // where the root either only has a left child or no children at all. The\n    // lists of heaps will be in desc order (from bottom to top).\n    for (let i = 0; i < lists.length; ++i) {\n        let list = lists[i];\n        let tree: BinaryTreeNode<T> | undefined = list.value;\n        while ((tree = tree.right)) {\n            list = { next: list, value: tree };\n        }\n        lists[i] = list;\n    }\n\n    // Combine the lists into a single list in desc order\n    let list: LinkedNode<BinaryTreeNode<T>> | undefined = mergeKSorted(\n        (a, b) => compareFn(b.value, a.value),\n        lists,\n    );\n\n    // While there are still multiple heaps, iteratively combine\n    // the first two (from left to right). If the root of the second-to-first\n    // subtree has a left child, swap it to be the right child. Link the root\n    // of the last subtree as the left child of the second-to-first subtree.\n    let heap = list.value;\n    while ((list = list.next)) {\n        const node = list.value;\n        node.right = node.left;\n        node.left = heap;\n        heap = node;\n    }\n\n    return heap;\n}\n","import { isArray, MAX_ARRAY_LENGTH } from 'src/array/utils';\nimport { CompareFn } from '..';\nimport { Heap } from './heap';\nimport { bubbleUp, heapify, sinkDown } from './utils';\n\n/**\n * A binary heap is a heap implemented as a binary tree with an additional shape property\n * ([source](https://en.wikipedia.org/wiki/Binary_heap)).\n *\n * **Shape property**: Must be a complete binary tree. This means all levels of the tree\n * (except possibly the last one) are fully filled. If the last level of the tree is incomplete,\n * the nodes of that level are filled from left to right.\n *\n * #### Complexity\n *\n * | Property | Average | Worst |\n * | :------- | :------ | :---- |\n * | Space    | O(n)    | O(n)\n * | Push     | O(1)    | O(log n)\n * | Peek     | O(1)\t| O(1)\n * | Pop      | O(log n)| O(log n)\n * | Search   | O(n)    | O(n)\n */\nexport class BinaryHeap<T> implements Heap<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: T[];\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * Instantiate a heap.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>) {\n        this.compare = compareFn;\n        this.array = [];\n        this.addAll(elements ?? []);\n    }\n\n    addAll(elements: Iterable<T>): number {\n        const array = this.array;\n        const length = array.length;\n\n        if (isArray(elements)) {\n            if (array.length + elements.length > MAX_ARRAY_LENGTH) {\n                throw new RangeError('Invalid heap length');\n            }\n            for (let i = 0; i < elements.length; ++i) {\n                array.push(elements[i]);\n            }\n        } else {\n            for (const element of elements) {\n                if (array.length >= MAX_ARRAY_LENGTH) {\n                    throw new RangeError('Invalid heap length');\n                }\n                array.push(element);\n            }\n        }\n\n        // Update the heap\n        if (length < array.length) {\n            heapify(this.compare, array);\n        }\n\n        return array.length;\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    contains(element: T): boolean {\n        return this.array.indexOf(element) >= 0;\n    }\n\n    delete(element: T): boolean {\n        const index = this.array.indexOf(element);\n        if (index < 0) {\n            return false;\n        }\n\n        // If deleting the last value\n        const last = this.array.pop()!;\n        if (index >= this.array.length) {\n            return true;\n        }\n\n        // Add the last value to the\n        // deleted index and update the heap\n        this.array[index] = last;\n        sinkDown(index, this.compare, this.array);\n        bubbleUp(index, this.compare, this.array);\n        return true;\n    }\n\n    merge(heap: Heap<T>): this {\n        const array = this.array;\n\n        if (heap.size < 1) {\n            return this;\n        }\n\n        if (array.length + heap.size > MAX_ARRAY_LENGTH) {\n            throw new RangeError('Invalid heap length');\n        }\n\n        for (const element of heap) {\n            array.push(element);\n        }\n\n        heapify(this.compare, array);\n        return this;\n    }\n\n    peek(): T | undefined {\n        return this.array.length > 0 ? this.array[0] : undefined;\n    }\n\n    pop(): T | undefined {\n        if (this.array.length < 1) {\n            return undefined;\n        }\n\n        // Get the root and the last value\n        const value = this.array[0];\n        const last = this.array.pop();\n\n        // If value != last\n        if (this.array.length > 0) {\n            // Move the last value to the root and update the heap\n            this.array[0] = last!;\n            sinkDown(0, this.compare, this.array);\n        }\n\n        return value;\n    }\n\n    push(value: T): number {\n        // Add new value to the end of the heap\n        this.array.push(value);\n\n        // Update the heap\n        bubbleUp(this.array.length - 1, this.compare, this.array);\n        return this.size;\n    }\n\n    pushPop(value: T): T {\n        // If empty or value is <= to root\n        if (this.array.length < 1 || this.compare(value, this.array[0]) <= 0) {\n            return value;\n        }\n\n        // Swap the root and value\n        const root = this.array[0];\n        this.array[0] = value;\n        sinkDown(0, this.compare, this.array);\n        return root;\n    }\n\n    replace(value: T): T | undefined {\n        // If empty\n        if (this.array.length < 1) {\n            this.array.push(value);\n            return undefined;\n        }\n\n        // Swap the root with value\n        const root = this.array[0];\n        this.array[0] = value;\n        value = root;\n\n        // Update the heap\n        sinkDown(0, this.compare, this.array);\n        return value;\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n\n    *sorted(): Iterable<T> {\n        if (this.array.length < 1) {\n            return;\n        }\n        const array = this.array;\n        const heap = new BinaryHeap<number>((a, b) => this.compare(array[a], array[b]), [0]);\n        do {\n            let index = heap.pop()!;\n            if (index < array.length) {\n                yield array[index];\n                index = 2 * index + 1;\n                index < array.length && heap.push(index);\n                ++index < array.length && heap.push(index);\n            }\n        } while (heap.size > 0);\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.array[Symbol.iterator]();\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        const index = this.array.indexOf(curElement);\n        if (index < 0) {\n            return false;\n        }\n        this.array[index] = newElement;\n        sinkDown(index, this.compare, this.array);\n        bubbleUp(index, this.compare, this.array);\n        return true;\n    }\n}\n","import { LinkedNode } from 'src/list';\nimport { CompareFn } from '..';\nimport { BinaryTreeNode } from './binaryTreeNode';\n\n/**\n * @internal\n */\nexport interface Edge<Node extends BinaryTreeNode<unknown>> {\n    label?: 'left' | 'right';\n    from?: Node;\n    to?: Node;\n}\n/**\n * [source](https://stackoverflow.com/questions/51419176/how-to-get-a-subset-of-keyof-t-whose-value-tk-are-callable-functions-in-typ)\n * \n * @internal\n *\nexport type KeyOfType<T, U> = {[K in keyof T]: T[K] extends U ? K: never}[keyof T];\n*/\n/**\n * @internal\n */\nexport function debug<N extends BinaryTreeNode<T>, T = any>(\n    root: N | undefined,\n    mapFn?: (node: N) => any,\n): void {\n    mapFn = mapFn == null ? (n) => n.value : mapFn;\n\n    // Turn the tree into an array in level-order\n    const array: string[] = [];\n    for (const node of levelOrderTraverse(root, true)) {\n        array.push(node ? `${mapFn(node)}` : '?');\n    }\n\n    // If empty\n    if (array.length < 1) {\n        console.log('<empty>\\n');\n        return;\n    }\n\n    // Find the longest value string\n    const lenV = array.reduce((p, c) => Math.max(p, c.length), 0);\n\n    // Pad each value\n    for (let i = 0; i < array.length; ++i) {\n        array[i] = pad(array[i], lenV, ' ');\n    }\n\n    // Split values into levels\n    const levels = [];\n    for (let n = 1; array.length > 0; n *= 2) {\n        levels.push(array.splice(0, n));\n    }\n\n    // Initialize formatting variables\n    let branch = '_'.repeat(1 + lenV / 2);\n    let offset = '';\n    const offsetOffset = ' '.repeat(branch.length);\n    let separator = ' '.repeat(1 + ((lenV - 1) & 1));\n    const separatorOffset = ' '.repeat(lenV);\n\n    // Build the last level\n    array.length = levels.length;\n    array[array.length - 1] = levels.pop()!.join(separator);\n\n    // Build remaining levels in reverse\n    for (let n = levels.length - 1; n >= 0; --n) {\n        const level = levels.pop()!;\n        for (let j = 0; j < level.length; ++j) {\n            level[j] = branch + level[j] + branch;\n        }\n        array[n] = offset + level.join(separator);\n        branch += branch;\n        offset += offset + offsetOffset;\n        separator += separator + separatorOffset;\n    }\n\n    // Output\n    console.log(array.join('\\n'), '\\n');\n}\n/**\n * @internal\n */\nexport function removeStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n    dir = true,\n): LinkedNode<Edge<Node>> {\n    let edge = stack.value;\n    let node = edge.to;\n\n    // Input check\n    if (node == null) {\n        return stack;\n    }\n\n    // Find the replacement\n    if (node.right == null) {\n        // If no right child, replace with left\n        node = node.left;\n    } else if (node.left == null) {\n        // If no left child, replace with right\n        node = node.right;\n    } else if (dir) {\n        // Replace with the successor\n        stack = successorStack(stack);\n        edge = stack.value;\n        const temp = edge.to!;\n        node.value = temp.value;\n        node = temp.right;\n    } else {\n        // Replace with the predecessor\n        stack = predecessorStack(stack);\n        edge = stack.value;\n        const temp = edge.to!;\n        node.value = temp.value;\n        node = temp.left;\n    }\n\n    // Make the replacement / update the tree\n    edge.to = node;\n    if (edge.from) {\n        edge.from[edge.label!] = edge.to = node;\n    }\n\n    return stack;\n}\n/**\n * @internal\n */\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: undefined): undefined;\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: Node): Node;\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: Node | undefined): Node | undefined;\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: Node | undefined): Node | undefined {\n    if (node == null) {\n        return undefined;\n    }\n    const out: Node = Object.assign({}, node);\n    let stack: LinkedNode<Node> | undefined = { value: out };\n    do {\n        node = stack.value;\n        stack = stack.next;\n        if (node.left) {\n            stack = { next: stack, value: (node.left = Object.assign({}, node.left)) };\n        }\n        if (node.right) {\n            stack = { next: stack, value: (node.right = Object.assign({}, node.right)) };\n        }\n    } while (stack);\n    return out;\n}\n/**\n * @internal\n */\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(node: undefined): undefined;\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(node: Node): Node;\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined;\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    if (node == null) {\n        return undefined;\n    }\n    while (node.left) {\n        node = node.left;\n    }\n    return node;\n}\n/**\n * @internal\n */\nexport function leftmostStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    let node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    while (node.left) {\n        stack = { next: stack, value: { label: 'left', from: node, to: node.left } };\n        node = node.left;\n    }\n    return stack;\n}\n/**\n * @internal\n */\nexport function* inOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n): Generator<Node> {\n    let stack: LinkedNode<Node> | undefined = undefined;\n\n    while (node) {\n        stack = { next: stack, value: node };\n        node = node.left;\n    }\n\n    while (stack) {\n        node = stack.value;\n        stack = stack.next;\n        yield node;\n        node = node.right;\n        while (node) {\n            stack = { next: stack, value: node };\n            node = node.left;\n        }\n    }\n}\n/**\n * @internal\n */\nexport function levelOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n    padded?: false,\n): Generator<Node>;\nexport function levelOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n    padded: true,\n): Generator<Node | undefined>;\nexport function* levelOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n    padded = false,\n): Generator<Node | undefined> {\n    const nil = {} as LinkedNode<Node | undefined>;\n    let head: LinkedNode<Node | undefined> = { value: node };\n    let tail = head;\n    for (let cont = node != null; cont; head = head.next!) {\n        tail = tail.next = nil;\n        for (cont = false; head !== nil; head = head.next!) {\n            node = head.value;\n            if (node) {\n                yield node;\n                cont ||= node.left != null || node.right != null;\n                tail = tail.next = { value: node.left };\n                tail = tail.next = { value: node.right };\n            } else if (padded) {\n                yield undefined;\n                tail = tail.next = { value: undefined };\n                tail = tail.next = { value: undefined };\n            }\n        }\n    }\n}\n/**\n * @internal\n */\nfunction pad(str: string, maxLen: number, fillString: string): string {\n    const len = str.length;\n    if (len >= maxLen) {\n        return str;\n    }\n    const diff = maxLen - len;\n    return str.padStart(len + diff / 2, fillString).padEnd(len + diff, fillString);\n}\n/**\n * @internal\n */\nexport function* postOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n): Generator<Node> {\n    interface Meta {\n        seen: boolean;\n        node?: Node;\n    }\n    let stack: LinkedNode<Meta> | undefined = { value: { seen: false, node } };\n    do {\n        const meta = stack.value;\n        stack = stack.next;\n        if (meta.node) {\n            if (meta.seen) {\n                yield meta.node;\n            } else {\n                meta.seen = true;\n                stack = { next: stack, value: meta };\n                stack = { next: stack, value: { seen: false, node: meta.node.right } };\n                stack = { next: stack, value: { seen: false, node: meta.node.left } };\n            }\n        }\n    } while (stack);\n}\n/**\n * @internal\n */\nexport function predecessor<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    return node == null ? undefined : rightmost(node.left);\n}\n/**\n * @internal\n */\nexport function predecessorStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    const node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    stack = { next: stack, value: { label: 'left', from: node, to: node.left } };\n    return rightmostStack(stack);\n}\n/**\n * @internal\n */\nexport function* preOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n): Generator<Node> {\n    let stack: LinkedNode<Node | undefined> | undefined = { value: node };\n    do {\n        node = stack.value;\n        stack = stack.next;\n        if (node) {\n            yield node;\n            stack = { next: stack, value: node.right };\n            stack = { next: stack, value: node.left };\n        }\n    } while (stack);\n}\n/**\n * @internal\n */\nexport function reverse<Node extends BinaryTreeNode<unknown>>(root?: Node): void {\n    if (root == null) {\n        return;\n    }\n    for (const node of preOrderTraverse(root)) {\n        const left = node.left;\n        node.left = node.right;\n        node.right = left;\n    }\n}\n/**\n * @internal\n */\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(node: undefined): undefined;\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(node: Node): Node;\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined;\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    if (node == null) {\n        return undefined;\n    }\n    while (node.right) {\n        node = node.right;\n    }\n    return node;\n}\n/**\n * @internal\n */\nexport function rightmostStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    let node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    while (node.right) {\n        stack = { next: stack, value: { label: 'right', from: node, to: node.right } };\n        node = node.right;\n    }\n    return stack;\n}\n/**\n * Assumes sorted by compareFn\n * @internal\n */\nexport function search<T, Node extends BinaryTreeNode<T>>(\n    element: T,\n    node: Node | undefined,\n    compareFn: CompareFn<T>,\n): Node | undefined {\n    while (node) {\n        const comp: number = compareFn(element, node.value);\n        if (comp == 0) {\n            break;\n        }\n        node = comp < 0 ? node.left : node.right;\n    }\n    return node;\n}\n/**\n * Assumes sorted by compareFn\n * @internal\n */\nexport function searchStack<T, Node extends BinaryTreeNode<T>>(\n    element: T,\n    stack: LinkedNode<Edge<Node>>,\n    compareFn: CompareFn<T>,\n    dupeWeight = 0,\n): LinkedNode<Edge<Node>> {\n    const paths: ['left', 'right'] = ['left', 'right'];\n    let node = stack.value.to;\n    while (node) {\n        const comp: number = compareFn(element, node.value) || dupeWeight;\n        if (comp === 0) {\n            break;\n        }\n        const label = paths[+(comp > 0)];\n        stack = { next: stack, value: { label, from: node, to: node[label] } };\n        node = node[label]!;\n    }\n    return stack;\n}\n/**\n * @internal\n */\nexport function successor<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    return node == null ? undefined : leftmost(node.right);\n}\n/**\n * @internal\n */\nexport function successorStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    const node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    stack = { next: stack, value: { label: 'right', from: node, to: node.right } };\n    return leftmostStack(stack);\n}\n/**\n * @internal\n */\nexport function toBinaryTree<T>(\n    elements: (T | undefined)[] | undefined,\n): BinaryTreeNode<T> | undefined {\n    if (elements == null || elements.length < 1 || elements[0] == null) {\n        return undefined;\n    }\n    const n = elements.length;\n    const nodes: BinaryTreeNode<T>[] = new Array(n);\n    nodes[0] = { value: elements[0] };\n    for (let i = 1; i < n; ++i) {\n        if (elements[i] == null) {\n            continue;\n        }\n        const par = nodes[(i - 1) >>> 1];\n        const node = { value: elements[i]! };\n        nodes[i] = node;\n        if (i & 1) {\n            par.left = node;\n        } else {\n            par.right = node;\n        }\n    }\n    return nodes[0];\n}\n","import { isArray } from 'src/array/utils';\nimport { BinaryTreeNode } from 'src/tree/binaryTreeNode';\nimport { clone, preOrderTraverse, toBinaryTree } from 'src/tree/binaryTreeUtils';\nimport { CompareFn } from '..';\nimport { BinaryHeap } from './binaryHeap';\nimport { Heap } from './heap';\nimport { skewMerge } from './utils';\n\n/**\n * A skew heap is a heap implemented as a binary tree\n * ([source](https://en.wikipedia.org/wiki/Skew_heap)).\n *\n * A skew heap is a self-adjusting heap which attempts to maintain balance\n * by unconditionally swapping all nodes in the merge path when merging two heaps. Every\n * operation that modifies the heap (e.g. push, pop, merge) is considered a merge and is done\n * by using a skew heap merge.\n *\n * Skew heaps can merge more quickly than binary heaps. This can seem contradictory, since\n * skew heaps have no structural constraints and no guarantee that the height of the tree is\n * logarithmic (i.e. balanced). However, amortized complexity analysis can demonstrate that\n * all operations on a skew heap can be done in O(log(n). More specifically, the\n * amortized complexity is known to be log<sub>φ</sub>(n) where φ is the golden ratio. This is\n * approximately 1.44*log<sub>2</sub>(n).\n *\n * #### Complexity\n *\n * | Property | Average  | Worst |\n * | :------- | :------  | :---- |\n * | Space    | O(n)     | O(n)\n * | Push     | O(log n) | O(log n)\n * | Peek     | O(1)\t | O(1)\n * | Pop      | O(log n) | O(log n)\n * | Search   | O(n)     | O(n)\n */\nexport class SkewHeap<T> implements Heap<T> {\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The node at the \"top\" of the heap.\n     */\n    protected root: BinaryTreeNode<T> | undefined;\n    /**\n     * Instantiate a heap.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the heap with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>) {\n        this.compare = compareFn;\n        this.length = 0;\n        this.addAll(elements ?? []);\n    }\n\n    addAll(elements: Iterable<T>): number {\n        if (isArray(elements)) {\n            for (let i = 0; i < elements.length; ++i) {\n                this.push(elements[i]);\n            }\n        } else if (elements instanceof SkewHeap || elements instanceof BinaryHeap) {\n            this.merge(elements);\n        } else {\n            for (const element of elements) {\n                this.push(element);\n            }\n        }\n        return this.length;\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.root = undefined;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    contains(element: T): boolean {\n        for (const node of preOrderTraverse(this.root)) {\n            if (element === node.value) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n    delete(element: T): boolean {\n        if (this.root == null) {\n            return false;\n        }\n        if (this.root.value === element) {\n            this.pop()!;\n            return true;\n        }\n        for (const par of preOrderTraverse(this.root)) {\n            const key: keyof BinaryTreeNode<T> | undefined =\n                par.left && par.left.value === element\n                    ? 'left'\n                    : par.right && par.right.value === element\n                    ? 'right'\n                    : undefined;\n            if (key != null) {\n                const node = par[key]!;\n                par[key] = skewMerge(this.compare, [node.left, node.right]);\n                --this.length;\n                return true;\n            }\n        }\n        return false;\n    }\n\n    merge(heap: Heap<T>): this {\n        if (this.compare !== heap.comparator()) {\n            this.addAll(heap);\n        } else if (heap instanceof SkewHeap) {\n            this.root = skewMerge(this.compare, [this.root, clone(heap.root)]);\n            this.length += heap.size;\n        } else if (heap instanceof BinaryHeap) {\n            this.root = skewMerge(this.compare, [this.root, toBinaryTree(heap['array'])!]);\n            this.length += heap.size;\n        } else {\n            this.addAll(heap);\n        }\n        return this;\n    }\n\n    peek(): T | undefined {\n        return this.root?.value;\n    }\n\n    pop(): T | undefined {\n        if (this.root == null) {\n            return undefined;\n        }\n        const value = this.root.value;\n        this.root = skewMerge(this.compare, [this.root.left, this.root.right]);\n        --this.length;\n        return value;\n    }\n\n    push(value: T): number {\n        this.root = skewMerge(this.compare, [this.root, { value }]);\n        return ++this.length;\n    }\n\n    pushPop(value: T): T {\n        this.push(value);\n        return this.pop()!;\n    }\n\n    replace(value: T): T | undefined {\n        if (this.root == null) {\n            this.root = { value };\n            this.length = 1;\n            return undefined;\n        }\n        const out = this.root.value;\n        this.root = skewMerge(this.compare, [this.root.left, this.root.right, { value }]);\n        return out;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    *sorted(): Iterable<T> {\n        if (this.root == null) {\n            return;\n        }\n        const heap = new SkewHeap<BinaryTreeNode<T>>(\n            (a, b) => this.compare(a.value, b.value),\n            [this.root],\n        );\n        do {\n            const node = heap.pop()!;\n            yield node.value;\n            node.left && heap.push(node.left);\n            node.right && heap.push(node.right);\n        } while (heap.size > 0);\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of preOrderTraverse(this.root)) {\n            yield node.value;\n        }\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        if (this.root == null) {\n            return false;\n        }\n\n        if (this.root.value === curElement) {\n            this.root = skewMerge(this.compare, [\n                this.root.left,\n                this.root.right,\n                { value: newElement },\n            ]);\n            return true;\n        }\n\n        let node: BinaryTreeNode<T> | undefined = undefined;\n        for (const par of preOrderTraverse(this.root)) {\n            if (par.left && par.left.value === curElement) {\n                node = par.left;\n                par.left = undefined;\n                break;\n            }\n            if (par.right && par.right.value === curElement) {\n                node = par.right;\n                par.right = undefined;\n                break;\n            }\n        }\n\n        if (node == null) {\n            return false;\n        }\n\n        this.root = skewMerge(this.compare, [\n            this.root,\n            node.left,\n            node.right,\n            { value: newElement },\n        ]);\n        return true;\n    }\n}\n","/**\n * Limits a number to be within a given range.\n *\n * f(x, min, max) = y, where min <= y <= max\n *\n * @param num - The number to clamp\n * @param min - The minimum result value, inclusive\n * @param max - The maximum result value, inclusive\n *\n * @returns The clamped number\n */\nexport function clamp(num: number, min: number, max: number): number {\n    return Math.min(max, Math.max(min, num));\n}\n","import { isArray } from '../array/utils';\nimport { CompareFn } from '..';\nimport { DoublyLinkedNode } from './doublyLinkedNode';\nimport { LinkedNode } from './linkedNode';\nimport { clamp } from 'src/math';\n\n/**\n * Groups an iterable into batches of a given size.\n *\n * @param size - The maximum batch size\n * @param iterable - The iterable to batch\n *\n * @returns An iterable of batches\n *\n * @internal\n */\nexport function batch<T>(\n    size: number,\n    iterable: Iterable<T>,\n): Generator<T[], void, number | undefined> {\n    if (isArray(iterable)) {\n        return batchArray(size, iterable);\n    }\n    return batchIterable(size, iterable);\n}\n/**\n * Groups an iterable into batches of a given size.\n *\n * @param size - The maximum batch size\n * @param iterable - The iterable to batch\n *\n * @returns An iterable of batches\n *\n * @internal\n */\nexport function* batchArray<T>(size: number, array: T[]): Generator<T[], void, number | undefined> {\n    let min = 0;\n    while (min < array.length) {\n        const max = min + size;\n        size = (yield array.slice(min, max)) ?? size;\n        min = max;\n    }\n}\n/**\n * Groups an iterable into batches of a given size.\n *\n * @param size - The maximum batch size\n * @param iterable - The iterable to batch\n *\n * @returns An iterable of batches\n *\n * @internal\n */\nexport function* batchIterable<T>(\n    size: number,\n    iterable: Iterable<T>,\n): Generator<T[], void, number | undefined> {\n    let array: T[] = [];\n    for (const value of iterable) {\n        if (array.push(value) >= size) {\n            size = (yield array) ?? size;\n            array = [];\n        }\n    }\n    if (array.length > 0) {\n        yield array;\n    }\n}\n/**\n * Wraps and then clamps a number within a given range.\n *\n * @param num - The number to wrap and then clamp\n * @param min - The minimum result value, inclusive\n * @param max - The wrap pivot and maximum result value, inclusive\n *\n * @returns The crwapped number\n *\n * @internal\n */\nexport function cwrap(num: number, min: number, max: number): number {\n    return clamp(nwrap(num, max), min, max);\n}\n/**\n * Sorts a list in place.\n *\n * Works on complete lists as well as sublists and circular lists:\n * - Linked lists will keep the link to the next node beyond the sorted section\n * - Doubly linked lists will keep links to the prev and next nodes outside the sorted section\n *\n * @param node - The head of the list\n * @param len - The length of the list beginning from node\n * @param isDoubly - Whether node is a doubly linked node\n * @param compareFn - A function used to determine the order of elements.\n *\n * It is expected to return:\n * - A negative value if first argument < second argument\n * - Zero if first argument == second argument\n * - A positive value if first argument > second argument\n *\n * @returns The new head and tail of the sorted list\n *\n * @internal\n */\nexport function linkedMergeSort<T, Node extends LinkedNode<T>>(\n    node: Node,\n    len: number,\n    isDoubly: boolean,\n    compareFn: CompareFn<T>,\n): [Node, Node] {\n    // Base case\n    if (len < 2) {\n        return [node, node];\n    }\n\n    // Split the list into two halves and sort them\n    len = len / 2;\n    const lens: [number, number] = [Math.ceil(len), Math.floor(len)];\n    const heads = linkedMergeSort(node, lens[0], isDoubly, compareFn);\n    const tails = linkedMergeSort(heads[1].next as Node, lens[1], isDoubly, compareFn);\n\n    // Group the heads and tails together\n    node = heads[1];\n    heads[1] = tails[0];\n    tails[0] = node;\n    tails[0].next = tails[1].next;\n\n    // Merge the sorted halves\n    const prev = (heads[0] as DoublyLinkedNode<T>).prev;\n    node = linkedMergeSorted(heads, lens, isDoubly, compareFn);\n    if (isDoubly) {\n        (node as DoublyLinkedNode<T>).prev = prev;\n    }\n\n    // Return the head and tail\n    return [node, tails[+(lens[0] < 1)]];\n}\n/**\n * Merges two sorted lists.\n *\n * @param nodes - The heads of the lists\n * @param lens - The lengths of the lists\n * @param isDoubly - Whether the lists are a doubly linked\n * @param compareFn - A function used to determine the order of elements.\n *\n * It is expected to return:\n * - A negative value if first argument < second argument\n * - Zero if first argument == second argument\n * - A positive value if first argument > second argument\n *\n * @returns The new head of the sorted list\n *\n * @internal\n */\nexport function linkedMergeSorted<T, Node extends LinkedNode<T>>(\n    heads: [Node, Node],\n    lens: [number, number],\n    isDoubly: boolean,\n    compareFn: CompareFn<T>,\n): Node {\n    const root = {} as Node;\n\n    let node = root;\n    do {\n        const index = +(compareFn(heads[0].value, heads[1].value) > 0);\n        node.next = heads[index];\n        if (isDoubly) {\n            (node.next as DoublyLinkedNode<T>).prev = node;\n        }\n        node = node.next as Node;\n        heads[index] = node.next as Node;\n        --lens[index];\n    } while (lens[0] > 0 && lens[1] > 0);\n\n    // Add any remaining nodes\n    node.next = heads[+(lens[0] < 1)];\n    if (isDoubly && node.next) {\n        (node.next as DoublyLinkedNode<T>).prev = node;\n    }\n    return root.next as Node;\n}\n/**\n * Wraps negative numbers around a pivot\n *\n * f(x, min, pivot) = {\n *    x, where x >= 0\n *    pivot + x, where x < 0\n * }\n *\n * @param num - The number to wrap\n * @param pivot - The number to pivot on\n *\n * @returns - The wrapped number\n *\n * @internal\n */\nexport function nwrap(num: number, pivot: number): number {\n    return num < 0 ? pivot + num : num;\n}\n","import { clamp } from 'src/math';\nimport { CompareFn } from '..';\nimport { List } from './list';\nimport { batch, cwrap } from './utils';\n\n/**\n * An implementation of the {@link List} interface using an array\n */\nexport class ArrayList<T> implements List<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: Array<T>;\n    /**\n     * Instantiate the list.\n     *\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.array = elements ? Array.from(elements) : [];\n    }\n\n    add(index: number, element: T): number {\n        if (index >= 0 && index <= this.size) {\n            this.array.splice(index, 0, element);\n        }\n        return this.size;\n    }\n\n    addAll(index: number, elements: Iterable<T>): number {\n        if (index >= 0 && index <= this.size) {\n            for (const items of batch(10000, elements)) {\n                this.array.splice(index, 0, ...items);\n                index += items.length;\n            }\n        }\n        return this.size;\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    concat(...lists: Iterable<T>[]): ArrayList<T> {\n        const out = new ArrayList(this);\n        for (const list of lists) {\n            out.addAll(out.size, list);\n        }\n        return out;\n    }\n\n    copyWithin(index: number, min?: number, max?: number): this {\n        index = cwrap(index ?? 0, 0, this.size);\n        min = cwrap(min ?? 0, 0, this.size);\n        max = cwrap(max ?? this.size, 0, this.size);\n        this.array.copyWithin(index, min, max);\n        return this;\n    }\n\n    fill(element: T, min?: number, max?: number): this {\n        min = cwrap(min ?? 0, 0, this.size);\n        max = cwrap(max ?? this.size, 0, this.size);\n        this.array.fill(element, min, max);\n        return this;\n    }\n\n    get(index: number): T | undefined {\n        return index < 0 || index >= this.size ? undefined : this.array[index];\n    }\n\n    getSet(index: number, callback: (element: T) => T): T | undefined {\n        let value: T | undefined = undefined;\n        if (index >= 0 && index < this.size) {\n            value = this.array[index];\n            this.array[index] = callback(value);\n        }\n        return value;\n    }\n\n    pop(): T | undefined {\n        return this.array.pop();\n    }\n\n    push(element: T): number {\n        return this.array.push(element);\n    }\n\n    remove(index: number): T | undefined {\n        return index < 0 || index >= this.size ? undefined : this.array.splice(index, 1)[0];\n    }\n\n    reverse(min?: number, max?: number): this {\n        min = cwrap(min ?? 0, 0, this.size);\n        max = cwrap(max ?? this.size, 0, this.size) - 1;\n        while (min < max) {\n            const temp = this.array[min];\n            this.array[min++] = this.array[max];\n            this.array[max--] = temp;\n        }\n        return this;\n    }\n\n    set(index: number, element: T): T | undefined {\n        let prev: T | undefined = undefined;\n        if (index >= 0 && index < this.size) {\n            prev = this.array[index];\n            this.array[index] = element;\n        }\n        return prev;\n    }\n\n    shift(): T | undefined {\n        return this.array.shift();\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n\n    slice(min?: number, max?: number): ArrayList<T> {\n        return new ArrayList(this.array.slice(min, max));\n    }\n\n    splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {\n        start = cwrap(start ?? 0, 0, this.size);\n        count = clamp(count ?? this.size, 0, this.size - start);\n        const list = new ArrayList(this.array.splice(start, count));\n        for (const items of batch(10000, elements ?? [])) {\n            this.array.splice(start, 0, ...items);\n            start += items.length;\n        }\n        return list;\n    }\n\n    sort(compareFn: CompareFn<T>): this {\n        this.array.sort(compareFn);\n        return this;\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.array[Symbol.iterator]();\n    }\n\n    unshift(element: T): number {\n        return this.array.unshift(element);\n    }\n\n    update(callback: (element: T, index: number) => T): this;\n    update(min: number | undefined, callback: (element: T, index: number) => T): this;\n    update(\n        min: number | undefined,\n        max: number | undefined,\n        callback: (element: T, index: number) => T,\n    ): this;\n    update(\n        min: number | undefined | ((element: T, index: number) => T),\n        max?: number | ((element: T, index: number) => T),\n        callback?: (element: T, index: number) => T,\n    ): this {\n        if (callback == null) {\n            if (arguments.length < 2) {\n                callback = min as (element: T, index: number) => T;\n                min = undefined;\n            } else {\n                callback = max as (element: T, index: number) => T;\n                max = undefined;\n            }\n        }\n        min = cwrap((min as number) ?? 0, 0, this.size);\n        max = cwrap((max as number) ?? this.size, 0, this.size);\n        while (min < max) {\n            this.array[min] = callback(this.array[min], min);\n            ++min;\n        }\n        return this;\n    }\n\n    *view(min?: number, max?: number): Iterable<T> {\n        min = cwrap(min ?? 0, 0, this.size);\n\n        let len: () => number;\n        if (max == null) {\n            len = () => this.size;\n        } else if (max >= 0) {\n            len = () => Math.min(max, this.size);\n        } else {\n            len = () => this.size + max;\n        }\n\n        while (min < len()) {\n            yield this.array[min++];\n        }\n    }\n}\n","import { clamp } from 'src/math';\nimport { CompareFn } from '..';\nimport { DoublyLinkedNode } from './doublyLinkedNode';\nimport { List } from './list';\nimport { linkedMergeSort, cwrap } from './utils';\n\n/**\n * A (circular) doubly-linked list implementation of the {@link List} interface.\n *\n * Operations that index into the list will traverse the list from the beginning or the end, whichever is closer to the specified index.\n */\nexport class DoublyLinkedList<T> implements List<T> {\n    /**\n     * The number of elements in the list\n     */\n    protected length: number;\n    /**\n     * The sentinel node at the fron of the list\n     */\n    protected root: DoublyLinkedNode<T>;\n    /**\n     * Instantiate the list.\n     *\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.length = 0;\n        this.root = {} as DoublyLinkedNode<T>;\n        this.root.prev = this.root.next = this.root;\n        this._addAll(this.root, elements ?? []);\n    }\n\n    add(index: number, value: T): number {\n        if (index < 0 || index > this.length) {\n            return this.length;\n        }\n        const prev = this._get(index - 1);\n        const node = { next: prev.next, prev, value };\n        prev.next = node;\n        node.next!.prev = node;\n        return ++this.length;\n    }\n\n    addAll(index: number, elements: Iterable<T>): number {\n        if (index >= 0 && index <= this.length) {\n            this._addAll(this._get(index), elements);\n        }\n        return this.length;\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.root.prev = this.root.next = this.root;\n    }\n\n    concat(...lists: Iterable<T>[]): DoublyLinkedList<T> {\n        const out = new DoublyLinkedList(this);\n        for (const list of lists) {\n            out.addAll(out.size, list);\n        }\n        return out;\n    }\n\n    copyWithin(index: number, min?: number, max?: number): this {\n        // Check if copying to the same section\n        index = cwrap(index, 0, this.length);\n        min = cwrap(min ?? 0, 0, this.length);\n        if (min === index) {\n            return this;\n        }\n\n        // Check if the section to copy has no length\n        max = cwrap(max ?? this.length, 0, this.length);\n        max = min + Math.min(max - min, this.length - index);\n        if (min >= max) {\n            return this;\n        }\n\n        // Check for overlap edge case\n        if (min < index && index < max) {\n            let nodeA = this._get(max);\n            let nodeB = this._get(index + (max - min));\n            do {\n                nodeA = nodeA.prev!;\n                nodeB = nodeB.prev!;\n                nodeB.value = nodeA.value;\n            } while (++min < max);\n            return this;\n        }\n\n        // Copy the section to the destination\n        let nodeA = this._get(min);\n        let nodeB = this._get(index);\n        do {\n            nodeB.value = nodeA.value;\n            nodeA = nodeA.next!;\n            nodeB = nodeB.next!;\n        } while (++min < max);\n        return this;\n    }\n\n    fill(element: T, min?: number, max?: number): this {\n        min = cwrap(min ?? 0, 0, this.length);\n        max = cwrap(max ?? this.length, 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = element;\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    get(index: number): T | undefined {\n        return index < 0 || index >= this.length ? undefined : this._get(index).value;\n    }\n\n    getSet(index: number, callback: (element: T) => T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        const value = node.value;\n        node.value = callback(node.value);\n        return value;\n    }\n\n    pop(): T | undefined {\n        if (this.length < 1) {\n            return undefined;\n        }\n        const tail = this.root.prev!;\n        tail.prev!.next = this.root;\n        this.root.prev = tail.prev;\n        --this.length;\n        return tail.value;\n    }\n\n    push(value: T): number {\n        const prev = this.root.prev!;\n        const node = { next: this.root, prev, value };\n        prev.next = this.root.prev = node;\n        return ++this.length;\n    }\n\n    remove(index: number): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        node.prev!.next = node.next;\n        node.next!.prev = node.prev;\n        --this.length;\n        return node.value;\n    }\n\n    reverse(min?: number, max?: number): this {\n        min = cwrap(min ?? 0, 0, this.length);\n        max = cwrap(max ?? this.length, 0, this.length);\n        if (max - min < 2) {\n            return this;\n        }\n        const root = this._get(min - 1);\n        const tail = root.next!;\n        let node = tail;\n        do {\n            const temp = node.next!;\n            node.next = node.prev;\n            node.prev = temp;\n            root.next = node;\n            node = temp;\n        } while (++min < max);\n        tail.next = node;\n        node.prev = tail;\n        root.next!.prev = root;\n        return this;\n    }\n\n    set(index: number, element: T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        const value = node.value;\n        node.value = element;\n        return value;\n    }\n\n    shift(): T | undefined {\n        if (this.length < 1) {\n            return undefined;\n        }\n        const head = this.root.next!;\n        head.next!.prev = this.root;\n        this.root.next = head.next;\n        --this.length;\n        return head.value;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    slice(min?: number, max?: number): DoublyLinkedList<T> {\n        return new DoublyLinkedList(this.view(min, max));\n    }\n\n    splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {\n        start = cwrap(start ?? 0, 0, this.size);\n        count = clamp(count ?? this.size, 0, this.size - start);\n\n        // If not modifying the list\n        const list = new DoublyLinkedList<T>();\n        if (elements == null && count < 1) {\n            return list;\n        }\n\n        // Delete elements\n        let node = this._get(start);\n        while (count-- > 0) {\n            list.push(node.value);\n            node.prev!.next = node.next!;\n            node.next!.prev = node.prev!;\n            node = node.next!;\n            --this.length;\n        }\n\n        // Add elements\n        this._addAll(node, elements ?? []);\n\n        return list;\n    }\n\n    sort(compareFn: CompareFn<T>): this {\n        if (this.length > 1) {\n            const [head, tail] = linkedMergeSort(this.root.next!, this.length, true, compareFn);\n            this.root.next = head;\n            tail.next!.prev = tail;\n        }\n        return this;\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let node = this.root.next!; node !== this.root; node = node.next!) {\n            yield node.value;\n        }\n    }\n\n    unshift(value: T): number {\n        const head = this.root.next!;\n        const node = { next: head, prev: this.root, value };\n        this.root.next = head.prev = node;\n        return ++this.length;\n    }\n\n    update(callback: (element: T, index: number) => T): this;\n    update(min: number | undefined, callback: (element: T, index: number) => T): this;\n    update(\n        min: number | undefined,\n        max: number | undefined,\n        callback: (element: T, index: number) => T,\n    ): this;\n    update(\n        min: number | undefined | ((element: T, index: number) => T),\n        max?: number | ((element: T, index: number) => T),\n        callback?: (element: T, index: number) => T,\n    ): this {\n        if (callback == null) {\n            if (arguments.length < 2) {\n                callback = min as (element: T, index: number) => T;\n                min = undefined;\n            } else {\n                callback = max as (element: T, index: number) => T;\n                max = undefined;\n            }\n        }\n        min = cwrap((min as number) ?? 0, 0, this.length);\n        max = cwrap((max as number) ?? this.length, 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = callback(node.value, min);\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    *view(min?: number, max?: number): Iterable<T> {\n        min = cwrap(min ?? 0, 0, this.length);\n\n        let len: () => number;\n        if (max == null) {\n            len = () => this.length;\n        } else if (max >= 0) {\n            len = () => max;\n        } else {\n            len = () => this.length + max;\n        }\n\n        if (min < len()) {\n            let node = this._get(min);\n            do {\n                yield node.value;\n                node = node.next!;\n            } while (++min < len() && node !== this.root);\n        }\n    }\n    /**\n     *\n     */\n    protected _addAll(next: DoublyLinkedNode<T>, elements: Iterable<T>): void {\n        let prev = next.prev!;\n        for (const value of elements) {\n            const node = { prev, value };\n            prev.next = node;\n            prev = node;\n            ++this.length;\n        }\n        prev.next = next;\n        next.prev = prev;\n    }\n    /**\n     * A helper method to iterate and return the node at the given index.\n     *\n     * Depending on the index, the list will be traversed from beginning or end; whichever is closest to the specified index.\n     *\n     * @param index - The index to retrieve\n     *\n     * @returns The node at the given index\n     */\n    protected _get(index: number): DoublyLinkedNode<T> {\n        let node = this.root;\n        if (index < this.length / 2) {\n            while (index-- >= 0) {\n                node = node.next!;\n            }\n        } else {\n            for (index = this.length - index; index > 0; --index) {\n                node = node.prev!;\n            }\n        }\n        return node;\n    }\n}\n","import { clamp } from 'src/math';\nimport { CompareFn } from '..';\nimport { LinkedNode } from './linkedNode';\nimport { List } from './list';\nimport { linkedMergeSort, cwrap } from './utils';\n\n/**\n * A (circular) linked list implementation of the {@link List} interface.\n */\nexport class LinkedList<T> implements List<T> {\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The sentinel node at the front of the list.\n     */\n    protected root: LinkedNode<T>;\n    /**\n     * The last node of the list.\n     */\n    protected tail: LinkedNode<T>;\n    /**\n     * Instantiate the list.\n     *\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.length = 0;\n        this.root = {} as LinkedNode<T>;\n        this.root.next = this.root;\n        this.tail = this._addAll(this.root, elements ?? []);\n    }\n\n    add(index: number, value: T): number {\n        if (index >= 0 && index < this.length) {\n            const prev = this._get(index - 1);\n            prev.next = { value, next: prev.next };\n            ++this.length;\n        } else if (index === this.length) {\n            this.push(value);\n        }\n        return this.length;\n    }\n\n    addAll(index: number, elements: Iterable<T>): number {\n        if (index >= 0 && index < this.length) {\n            this._addAll(this._get(index - 1), elements);\n        } else if (index === this.length) {\n            this.tail = this._addAll(this.tail, elements);\n        }\n        return this.length;\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.tail = this.root.next = this.root;\n    }\n\n    concat(...lists: Iterable<T>[]): LinkedList<T> {\n        const out = new LinkedList(this);\n        for (const list of lists) {\n            out.addAll(out.size, list);\n        }\n        return out;\n    }\n\n    copyWithin(index: number, min?: number, max?: number): this {\n        // Check if copying to itself\n        index = cwrap(index, 0, this.length);\n        min = cwrap(min ?? 0, 0, this.length);\n        if (min === index) {\n            return this;\n        }\n\n        // Check if the section to copy has no length\n        max = cwrap(max ?? this.length, 0, this.length);\n        max = min + Math.min(max - min, this.length - index);\n        if (min >= max) {\n            return this;\n        }\n\n        // Copy to earlier in the list\n        if (index < min) {\n            const node = this._get(index - 1);\n            this._copyWithin(this._get(min - index - 1, node), node, max - min);\n            return this;\n        }\n\n        // Copy to later in the list\n        if (index > max) {\n            const node = this._get(min - 1);\n            this._copyWithin(node, this._get(index - min - 1, node), max - min);\n            return this;\n        }\n\n        // Copy to overlapping destination\n        const nodeA = this._get(min - 1);\n        const nodeC = this._get(max - min - 1, nodeA);\n        const nodeD = this._copyWithin(nodeA, nodeC, index - min);\n        if (index + (max - min) >= this.length) {\n            this.tail = nodeC;\n        }\n        const temp = nodeA.next;\n        nodeA.next = nodeC.next;\n        nodeC.next = nodeD.next;\n        nodeD.next = temp;\n        return this;\n    }\n\n    fill(element: T, min?: number, max?: number): this {\n        min = cwrap(min ?? 0, 0, this.length);\n        max = cwrap(max ?? this.length, 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = element;\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    get(index: number): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        return index < this.length - 1 ? this._get(index).value : this.tail.value;\n    }\n\n    getSet(index: number, callback: (element: T) => T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = index < this.length - 1 ? this._get(index) : this.tail;\n        const value = node.value;\n        node.value = callback(node.value);\n        return value;\n    }\n\n    pop(): T | undefined {\n        if (this.length < 1) {\n            return undefined;\n        }\n        const value = this.tail.value;\n        this.tail = this._get(this.length - 2);\n        this.tail.next = this.root;\n        --this.length;\n        return value;\n    }\n\n    push(value: T): number {\n        const tail: LinkedNode<T> = { next: this.root, value };\n        this.tail.next = tail;\n        this.tail = tail;\n        return ++this.length;\n    }\n\n    remove(index: number): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const prev = this._get(index - 1);\n        const node = prev.next!;\n        prev.next = node.next;\n        if (index === --this.length) {\n            this.tail = prev;\n        }\n        return node.value;\n    }\n\n    reverse(min?: number, max?: number): this {\n        min = cwrap(min ?? 0, 0, this.length);\n        max = cwrap(max ?? this.length, 0, this.length);\n        if (max - min < 2) {\n            return this;\n        }\n        const root = this._get(min - 1);\n        this.tail = max >= this.length ? root.next! : this.tail;\n        const tail = root.next!;\n        let prev = tail;\n        let node = tail.next!;\n        while (++min < max) {\n            const next = node.next!;\n            node.next = prev;\n            prev = node;\n            node = next;\n        }\n        root.next = prev;\n        tail.next = node;\n        return this;\n    }\n\n    set(index: number, element: T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        const value = node.value;\n        node.value = element;\n        return value;\n    }\n\n    shift(): T | undefined {\n        return this.remove(0);\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    slice(min?: number, max?: number): LinkedList<T> {\n        return new LinkedList(this.view(min, max));\n    }\n\n    splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {\n        start = cwrap(start ?? 0, 0, this.size);\n        count = clamp(count ?? this.size, 0, this.size - start);\n\n        // If not modifying the list\n        const deleted = new LinkedList<T>();\n        if (elements == null && count < 1) {\n            return deleted;\n        }\n\n        // Delete elements\n        let prev = this._get(start - 1);\n        const newTail = start + count >= this.size;\n        while (count-- > 0) {\n            const node = prev.next!;\n            deleted.push(node.value);\n            prev.next = node.next;\n            --this.length;\n        }\n\n        // Add elements\n        prev = this._addAll(prev, elements ?? []);\n        this.tail = newTail ? prev : this.tail;\n\n        return deleted;\n    }\n\n    sort(compareFn: CompareFn<T>): this {\n        if (this.length > 1) {\n            const [head, tail] = linkedMergeSort(this.root.next!, this.length, false, compareFn);\n            this.root.next = head;\n            this.tail = tail;\n        }\n        return this;\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let node = this.root.next!; node !== this.root; node = node.next!) {\n            yield node.value;\n        }\n    }\n\n    unshift(value: T): number {\n        return this.add(0, value);\n    }\n\n    update(callback: (element: T, index: number) => T): this;\n    update(min: number | undefined, callback: (element: T, index: number) => T): this;\n    update(\n        min: number | undefined,\n        max: number | undefined,\n        callback: (element: T, index: number) => T,\n    ): this;\n    update(\n        min: number | undefined | ((element: T, index: number) => T),\n        max?: number | ((element: T, index: number) => T),\n        callback?: (element: T, index: number) => T,\n    ): this {\n        if (callback == null) {\n            if (arguments.length < 2) {\n                callback = min as (element: T, index: number) => T;\n                min = undefined;\n            } else {\n                callback = max as (element: T, index: number) => T;\n                max = undefined;\n            }\n        }\n        min = cwrap((min as number) ?? 0, 0, this.length);\n        max = cwrap((max as number) ?? this.length, 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = callback(node.value, min);\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    *view(min?: number, max?: number): Iterable<T> {\n        min = cwrap(min ?? 0, 0, this.length);\n\n        let len: () => number;\n        if (max == null) {\n            len = () => this.length;\n        } else if (max >= 0) {\n            len = () => max;\n        } else {\n            len = () => this.length + max;\n        }\n\n        if (min < len()) {\n            let node = this._get(min);\n            do {\n                yield node.value;\n                node = node.next!;\n            } while (++min < len() && node !== this.root);\n        }\n    }\n\n    protected _addAll(prev: LinkedNode<T>, elements: Iterable<T>): LinkedNode<T> {\n        const next = prev.next!;\n        for (const value of elements) {\n            const node = { value };\n            prev.next = node;\n            prev = node;\n            ++this.length;\n        }\n        prev.next = next;\n        return prev;\n    }\n    /**\n     * Copy values from 'from' to 'to'.\n     *\n     * @param from - The initial node to copy from\n     * @param prev - The root of the initial node to copy to\n     * @param count - The number of values to copy\n     */\n    protected _copyWithin(from: LinkedNode<T>, to: LinkedNode<T>, count: number): LinkedNode<T> {\n        while (count-- > 0) {\n            from = from.next!;\n            to = to.next!;\n            to.value = from.value;\n        }\n        return to;\n    }\n    /**\n     * Get the node at the given index.\n     *\n     * @param index - The index to retrieve\n     *\n     * @returns The node at the given index\n     */\n    protected _get(index: number, root: LinkedNode<T> = this.root): LinkedNode<T> {\n        let node = root!;\n        while (index-- >= 0) {\n            node = node.next!;\n        }\n        return node;\n    }\n}\n","/**\n * Bit hacks for 32-bit unsigned numbers.\n */\n\n/**\n * Get the number of bits set of a 32-bit unsigned number ([source](https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan))\n *\n * @param a\n */\nexport function bitsSet(a: number): number {\n    let b = 0;\n    while (a) {\n        ++b;\n        a &= a - 1;\n    }\n    return b;\n}\n/**\n * Invert the bits of a 32-bit unsigned number.\n *\n * Example: 11 (1011) -> 4 (0100)\n *\n * @param a The number to invert\n *\n * @returns The inverted number\n */\nexport function invert(a: number): number {\n    const b = msp(a);\n    return u32(a ^ (b | (b - 1)));\n}\n/**\n * Check whether a 32-bit unsigned number is a power of 2.\n *\n * Example: 8 (1000) -> true\n *\n * @param a The number to check\n */\nexport function isPow2(a: number): boolean {\n    return (a & (a - 1)) === 0;\n}\n/**\n * Get the Least Significant Bit of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns The lowest bit set\n */\nexport function lsb(a: number): number {\n    let b = -1;\n    for (a = lsp(a); a; a >>>= 1) {\n        ++b;\n    }\n    return b;\n}\n/**\n * Get the Least Significant Power of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns 2**lsb(a)\n */\nexport function lsp(a: number): number {\n    return u32(a & -a);\n}\n/**\n * Get the Least Significant Power Set of a 32-bit unsigned number.\n *\n * Example: 54 (110110) -> 6 (000110)\n *\n * @param a\n */\nexport function lsps(a: number): number {\n    return u32(a & (lsp(a + lsp(a)) - 1));\n}\n/**\n * Get the Most Significant Power of the Least Significant Power Set of a 32-bit unsigned number.\n *\n * Example: 54 (110110) -> 4 (000100)\n *\n * 111111\n * 000000\n * 000000\n *\n * 000010\n * 111000\n * 001000\n * 000100\n *\n * @param a\n */\nexport function mlsp(a: number): number {\n    return lsp(a + lsp(a)) >>> 1 || u32(0x80000000 & a);\n}\n/**\n * Get the Most Significant Bit of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns ⌊log2(a)⌋ : the highest bit set\n */\nexport function msb(a: number): number {\n    let b = -1;\n    while (a !== 0) {\n        ++b;\n        a >>>= 1;\n    }\n    return b;\n}\n/**\n * Get the Most Significant Power of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns 2**msb(a)\n */\nexport function msp(a: number): number {\n    let b = a & -a;\n    while (a != b) {\n        a ^= b;\n        b = a & -a;\n    }\n    return u32(b);\n}\n/**\n * Get the Most Significant Power Set of a 32-bit unsigned number.\n *\n * Example: 50 (110010) -> 48 (110000)\n *\n * @param a\n */\nexport function msps(a: number): number {\n    let b = a & -a;\n    while (a & (a + b)) {\n        a ^= b;\n        b = a & -a;\n    }\n    return u32(a);\n}\n/**\n * Reverse a 32-bit unsigned number.\n *\n * Example: 50 (110010) -> 19 (010011)\n *\n * @param a\n */\nexport function reverse(a: number): number {\n    a = ((a & 0xaaaaaaaa) >>> 1) | ((a & 0x55555555) << 1);\n    a = ((a & 0xcccccccc) >>> 2) | ((a & 0x33333333) << 2);\n    a = ((a & 0xf0f0f0f0) >>> 4) | ((a & 0x0f0f0f0f) << 4);\n    a = ((a & 0xff00ff00) >>> 8) | ((a & 0x00ff00ff) << 8);\n    return u32((a >>> 16) | (a << 16));\n}\n/**\n * Turn a number into an unsigned 32-bit number\n *\n * @param a\n */\nexport function u32(a: number): number {\n    return a >>> 0;\n}\n","import { Queue } from './queue';\n\n/**\n * An implementation of the {@link Queue} interface using an array\n */\nexport class ArrayQueue<T> implements Queue<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: T[];\n    /**\n     * Instantiate the queue.\n     *\n     * @param elements - A set of elements to initialize the queue with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.array = elements ? Array.from(elements) : [];\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    dequeue(): T | undefined {\n        return this.size < 1 ? undefined : this.array.shift();\n    }\n\n    enqueue(element: T): number {\n        return this.array.push(element);\n    }\n\n    peek(): T | undefined {\n        return this.size < 1 ? undefined : this.array[0];\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n    /**\n     * Receive an iterator through the queue.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the queue\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.array[Symbol.iterator]();\n    }\n}\n","import { LinkedList, List } from '../list';\nimport { Queue } from './queue';\n\n/**\n * A linked list implementation of the {@link Queue} interface\n */\nexport class LinkedQueue<T> implements Queue<T> {\n    /**\n     * The list containing every element.\n     */\n    protected list: List<T>;\n    /**\n     * Instantiate the queue.\n     *\n     * @param elements - A set of elements to initialize the queue with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.list = new LinkedList(elements);\n    }\n\n    clear(): void {\n        this.list.clear();\n    }\n\n    dequeue(): T | undefined {\n        return this.list.shift();\n    }\n\n    enqueue(element: T): number {\n        return this.list.push(element);\n    }\n\n    peek(): T | undefined {\n        return this.list.get(0);\n    }\n\n    get size(): number {\n        return this.list.size;\n    }\n    /**\n     * Receive an iterator through the queue.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the queue\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.list[Symbol.iterator]();\n    }\n}\n","import { lsb, lsp, msb, msp } from '../math/u32';\nimport { CombineFn } from '..';\nimport { MAX_ARRAY_LENGTH } from 'src/array/utils';\nimport { SegmentTree } from './segmentTree';\n\n/*\n    mca(a, b) = lsp(a | msp(b - a)) ; // where a <= b\n    left(i) = i - (lsp(i + 1) >>> 1)\n    right(i) = i + (lsp(i + 1) >>> 1)\n    parent(i) =\n        offset = lsp(i + 1)\n        i + offset - ((i & 2*offset) >>> 0)\n*/\n\n/**\n * A {@link SegmentTree} with entries stored in in-order traversal.\n * Inspired by [Tristan Hume's IForestIndex](https://thume.ca/2021/03/14/iforests) ([github](https://github.com/trishume/gigatrace))\n */\nexport class InOrderSegmentTree<T> implements SegmentTree<T> {\n    /**\n     * The maximum amount of elements that can be added.\n     *\n     * n elements require 2n memory.\n     */\n    static readonly MAX_SIZE: number = MAX_ARRAY_LENGTH >>> 1;\n    /**\n     * The set of elements and aggregation nodes for the tree\n     */\n    protected array: T[];\n    /**\n     * The function used to aggregate elements\n     */\n    protected combine: CombineFn<T>;\n    /**\n     * Construct a new segment tree\n     *\n     * @param combine - The function used to aggregate segment information\n     * @param elements - A set of elements to add into the initial tree\n     */\n    constructor(combine: CombineFn<T>, elements: Iterable<T> = []) {\n        this.array = [];\n        this.combine = combine;\n        this.build(elements);\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    pop(): T | undefined {\n        // Sanitize range\n        if (this.size < 1) {\n            return undefined;\n        }\n\n        // Un-complete aggregation nodes\n        const i = this.array.length - 1;\n        for (let mask = 2; i & mask; mask *= 2) {\n            this.array[i - mask] = this.array[i - mask - (mask >>> 1)];\n        }\n\n        // Return element\n        const out = this.array[i - 1];\n        this.array.length -= 2;\n        return out;\n    }\n\n    push(element: T): number {\n        // Sanitize range\n        if (this.size >= InOrderSegmentTree.MAX_SIZE) {\n            throw new RangeError(`Invalid length`);\n        }\n\n        // Add element\n        const i = this.array.length;\n        this.array[i + 1] = this.set(i, element);\n\n        return this.size;\n    }\n\n    query(min: number, max: number): T {\n        // Sanitize range\n        if (min >= max) {\n            throw new RangeError(`Range [${min}..${max}) is empty`);\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices\n        min *= 2;\n        max *= 2;\n\n        // Jump to min's highest aggregation node that is fully within the range\n        let offset = lsp(min | msp(max - min));\n        let value = this.array[min - 1 + (offset >>> 1)];\n\n        // Continue jumping aggregation nodes until max is reached\n        for (min += offset; min < max; min += offset) {\n            offset = lsp(min | msp(max - min));\n            value = this.combine(value, this.array[min - 1 + (offset >>> 1)]);\n        }\n\n        return value;\n    }\n\n    get size(): number {\n        return this.array.length >>> 1;\n    }\n\n    /**\n     * Return an iterator through the tree's elements\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let i = 0; i < this.array.length; i += 2) {\n            yield this.array[i];\n        }\n    }\n\n    update(min: number, max: number, operation: (element: T, index: number) => T): void {\n        // Sanitize range\n        if (min >= max) {\n            return;\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices\n        min *= 2;\n        max *= 2;\n\n        // Update the values\n        let value: T;\n        do {\n            value = this.set(min, operation(this.array[min], min >>> 1));\n            min += 2;\n        } while (min < max);\n\n        // Update remaining aggregation nodes\n        let dc = 0;\n        let dp = lsp(min);\n        max = msb(min ^ this.array.length) - lsb(min);\n        for (--min; max > 0; --max) {\n            value = this.combine(value, this.array[min + (dp >>> 1) - dc]);\n            this.array[min] = value;\n            dc = (min & (2 * dp)) >>> 0;\n            min += dp - dc;\n            dp *= 2;\n        }\n\n        // Update the incomplete aggregation node\n        this.array[min] = value;\n    }\n    /**\n     * A helper method used to build the tree\n     *\n     * @param elements The initial set of elements to add into the tree\n     */\n    protected build(elements: Iterable<T>) {\n        for (const element of elements) {\n            this.push(element);\n        }\n    }\n    /**\n     * A helper method to update complete aggregation nodes for an index\n     */\n    protected set(index: number, element: T): T {\n        // Set the index\n        this.array[index++] = element;\n\n        // Update complete aggregation nodes, from lowest to highest\n        for (let mask = 2; index & mask; mask *= 2) {\n            element = this.combine(this.array[index - mask - (mask >>> 1)], element);\n            this.array[index - mask] = element;\n        }\n\n        return element;\n    }\n}\n","/**\n *  Thanks to [Douglas Wilhelm Harder](https://ece.uwaterloo.ca/~dwharder/aads/Algorithms/Array_resizing/)\n *  for their analysis on array resizing\n */\nimport { isArray, MAX_ARRAY_LENGTH } from 'src/array/utils';\nimport { isCollection } from 'src/collection';\nimport { Collection } from 'src/collection/collection';\nimport { CombineFn } from '..';\nimport { isPow2, lsp, msp } from '../math/u32';\nimport { SegmentTree } from './segmentTree';\n\n/**\n * A {@link SegmentTree} with entries stored in level-order traversal.\n * Memory usage: n elements require between 2n-1 to 4(n-1)-1 entries\n *\n */\nexport class LevelOrderSegmentTree<T> implements SegmentTree<T> {\n    /**\n     * The maximum number of elements that can be added.\n     *\n     * n elements require 2^⌈log2(2n)⌉ - 1 memory:\n     */\n    static readonly MAX_SIZE: number = (MAX_ARRAY_LENGTH + 1) / 2;\n    /**\n     * The internal array used to store elements and aggregation nodes\n     */\n    protected array: Array<T>;\n    /**\n     * The function used to aggregate elements\n     */\n    protected combine: CombineFn<T>;\n    /**\n     * The used length (size) of our internal array\n     */\n    protected length: number;\n    /**\n     * The start index for the lowest level\n     */\n    protected level: number;\n    /**\n     * Construct a new {@link SegmentTree}\n     *\n     * @param combinFn - The function used to aggregate elements\n     * @param elements - Initial elements to build into the tree\n     */\n    constructor(combine: CombineFn<T>, elements: Iterable<T> = []) {\n        this.array = [];\n        this.combine = combine;\n        this.length = 0;\n        this.level = 0;\n        this.build(elements);\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.level = 0;\n        this.array.length = 0;\n    }\n\n    pop(): T | undefined {\n        // Sanitize range\n        if (this.length <= this.level) {\n            return undefined;\n        }\n\n        // Remove element\n        const out = this.array[--this.length];\n\n        // If level is <= 1/4 full\n        if (this.length <= (this.array.length + 1) >>> 2) {\n            this.shrink();\n        }\n\n        return out;\n    }\n\n    push(element: T): number {\n        // If array is full\n        if (this.length >= this.array.length) {\n            this.grow();\n        }\n\n        // Add the new element\n        this.array[this.length++] = element;\n\n        // Update aggregation nodes\n        for (let i = this.length; i & 1; this.array[i - 1] = element) {\n            element = this.combine(this.array[i - 2], element);\n            i >>>= 1;\n        }\n\n        return this.size;\n    }\n\n    query(min: number, max: number): T {\n        // Sanitize range\n        if (min >= max) {\n            throw new RangeError(`Range [${min}..${max}) is empty`);\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices and align with powers of 2\n        min += this.level + 1;\n        max += this.level + 1;\n\n        // Take the longest possible jump from min\n        let offset = lsp(min | msp(max - min));\n        let value: T = this.array[min / offset - 1];\n        min += offset;\n\n        // Continue jumping until max\n        while (min < max) {\n            offset = lsp(min | msp(max - min));\n            value = this.combine(value, this.array[min / offset - 1]);\n            min += offset;\n        }\n\n        return value;\n    }\n\n    get size(): number {\n        return this.length - this.level;\n    }\n\n    /**\n     * Return an iterator through the elements\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let i = 0; i < this.size; ++i) {\n            yield this.array[this.level + i];\n        }\n    }\n\n    update(min: number, max: number, operation: (element: T, index: number) => T): void {\n        // Sanitize range\n        if (min >= max) {\n            return;\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices\n        min += this.level;\n        max += this.level;\n\n        // Update the range\n        for (let i = min; i < max; ++i) {\n            this.array[i] = operation(this.array[i], i - this.level);\n        }\n\n        // Update the range's aggregation nodes\n        this.aggregate(min, max);\n    }\n    /**\n     * A helper method to aggregate a range of elements\n     */\n    protected aggregate(min: number, max: number): void {\n        // Align indices with powers of 2\n        ++min;\n        ++max;\n\n        // Aggregate elements\n        for (let cap = this.length + 1; min < max; cap >>>= 1) {\n            max += max & ((max - cap) >>> 31);\n            for (let i = (min | 1) >>> 0; i < max; i += 2) {\n                this.array[(i >>> 1) - 1] = this.combine(this.array[i - 2], this.array[i - 1]);\n            }\n            min >>>= 1;\n            max >>>= 1;\n        }\n    }\n    /**\n     * A helper method used to build the tree\n     *\n     * @param elements The initial set of elements to add into the tree\n     */\n    protected build(elements: Collection<T> | Iterable<T>): void {\n        let key: string | undefined = undefined;\n\n        // Check if the iterable's size can be known.\n        if (isArray(elements)) {\n            key = 'length';\n        } else if (isCollection(elements)) {\n            key = 'size';\n        } else {\n            for (const element of elements) {\n                this.push(element);\n            }\n            return;\n        }\n\n        // Get the iterable's size\n        const n: number = (elements as any)[key];\n\n        // Check for base case\n        if (n < 1) {\n            this.array.length = 0;\n            this.length = 0;\n            this.level = 0;\n            return;\n        }\n\n        // Check if max capacity reached\n        if (n >= LevelOrderSegmentTree.MAX_SIZE) {\n            throw new RangeError('Invalid length');\n        }\n\n        // Allocate the array\n        this.level = 2 * msp(n - 1) - 1;\n        this.length = this.level;\n        this.array.length = 2 * this.level + 1;\n\n        // Add the elements\n        for (const element of elements) {\n            this.array[this.length++] = element;\n        }\n\n        // Update aggregation nodes\n        this.aggregate(this.level, this.length);\n    }\n    /**\n     * Shift the tree down a level\n     */\n    protected grow(): void {\n        // Check base case\n        if (this.size < 1) {\n            this.array.length = 1;\n            return;\n        }\n\n        // Check if max capacity reached\n        if (this.size >= LevelOrderSegmentTree.MAX_SIZE) {\n            throw new RangeError('Invalid length');\n        }\n\n        // Extend capacity\n        this.array.length += this.array.length + 1;\n\n        // Shift the tree down a level\n        let min = this.level + 1;\n        for (let max = this.length + 1; min < max; max >>>= 1) {\n            this.array.copyWithin(2 * min - 1, min - 1, max - 1);\n            min >>>= 1;\n        }\n\n        // Update pointers\n        this.length += this.level + 1;\n        this.level += this.level + 1;\n    }\n    /**\n     * Shrink the tree to the smallest size\n     */\n    protected shrink(): void {\n        const length = this.length - this.level;\n\n        // Check base case\n        if (length < 2) {\n            this.array.copyWithin(0, this.level, this.length);\n            this.level = 0;\n            this.length = length;\n            this.array.length = length;\n            return;\n        }\n\n        // Get the highest node\n        let min = this.level + 1;\n        let mask = msp(length);\n        min = min / lsp(min | mask) - 1;\n\n        // Update the tree\n        this.level = +!isPow2(length);\n        for (let max = min + 1; mask; this.level += this.level + 1) {\n            this.array.copyWithin(this.level, min, max);\n            mask >>>= 1;\n            min += min + 1;\n            max += max + 2 + +((length & mask) > 0);\n        }\n\n        // Update pointers\n        this.length = this.level + length;\n        this.array.length = 2 * this.level + 1;\n    }\n}\n","import { Collection } from './collection';\n\nexport * from './collection';\n\nexport function isCollection(obj: any): obj is Collection<unknown> {\n    return 'size' in obj && typeof obj['size'] === 'number';\n}\n","import { Stack } from './stack';\n\n/**\n * An implementation of the {@link Stack} interface using an array\n */\nexport class ArrayStack<T> implements Stack<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: T[];\n    /**\n     * Instantiate the stack.\n     *\n     * @param elements - A set of elements to initialize the stack with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.array = elements ? Array.from(elements) : [];\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    peek(): T | undefined {\n        return this.array[this.array.length - 1];\n    }\n\n    pop(): T | undefined {\n        return this.array.pop();\n    }\n\n    push(element: T): number {\n        return this.array.push(element);\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n    /**\n     * Receive an iterator through the stack.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the stack\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        const array = this.array;\n        for (let i = array.length; i > 0; yield array[--i]) {}\n    }\n}\n","import { LinkedList, List } from '../list';\nimport { Stack } from './stack';\n\n/**\n * A linked list implementation of the {@link Stack} interface\n */\nexport class LinkedStack<T> implements Stack<T> {\n    /**\n     * The list containing every element.\n     */\n    protected list: List<T>;\n    /**\n     * Instantiate the stack.\n     *\n     * @param elements - A set of elements to initialize the stack with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.list = new LinkedList();\n        for (const element of elements || []) {\n            this.push(element);\n        }\n    }\n\n    clear(): void {\n        this.list.clear();\n    }\n\n    peek(): T | undefined {\n        return this.list.get(0);\n    }\n\n    pop(): T | undefined {\n        return this.list.shift();\n    }\n\n    push(element: T): number {\n        return this.list.unshift(element);\n    }\n\n    get size(): number {\n        return this.list.size;\n    }\n    /**\n     * Receive an iterator through the stack.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the stack\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.list[Symbol.iterator]();\n    }\n}\n","import { CompareFn } from '..';\nimport { AATreeNode } from './aaTreeNode';\nimport {\n    clone,\n    search,\n    Edge,\n    inOrderTraverse,\n    leftmost,\n    leftmostStack,\n    preOrderTraverse,\n    removeStack,\n    rightmost,\n    rightmostStack,\n    searchStack,\n    debug,\n} from './binaryTreeUtils';\nimport { SortedTree } from './sortedTree';\nimport { isArray } from 'src/array/utils';\nimport { LinkedNode } from 'src/list';\n\n/**\n * An AA tree is a form of balanced tree used for storing and retrieving ordered data efficiently\n * ([source](https://en.wikipedia.org/wiki/AA_tree)).\n *\n * AA trees are named for Arne Andersson, their inventor. They are a variation of the red–black tree,\n * which supports efficient addition and deletion of entries. Unlike red–black trees, additional\n * constraints on the balancing mechanism greatly simplifies the implementation as well as\n * maintenance operations; While a red–black tree needs to consider seven different shapes\n * to properly balance the tree, an AA tree only needs to consider two shapes.\n *\n * The performance of an AA tree is equivalent to the performance of a red–black tree.\n * While an AA tree makes more rotations than a red-black tree, the simpler algorithms\n * tend to be faster, which balances out to similar performance. A red-black tree is\n * more consistent in its performance, but an AA tree tends to be flatter, which results\n * in slightly faster search times.\n */\nexport class AATree<T> implements SortedTree<T> {\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * Indicates how to handle duplicates:\n     * - < 0 : Add to left subtree\n     * - = 0 : Do now allow duplicates\n     * - > 0 : Add to right subtree\n     */\n    protected dupeWeight: number;\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The node at the \"top\" of the heap.\n     */\n    protected root: AATreeNode<T> | undefined;\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>);\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param allowDuplicates - Whether to allow duplicates\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, allowDuplicates: boolean, elements?: Iterable<T>);\n    constructor(\n        compareFn: CompareFn<T>,\n        allowDuplicates?: boolean | Iterable<T>,\n        elements?: Iterable<T>,\n    ) {\n        if (typeof allowDuplicates !== 'boolean') {\n            elements = allowDuplicates;\n            allowDuplicates = true;\n        }\n        this.compare = compareFn;\n        this.dupeWeight = +allowDuplicates;\n        this.length = 0;\n        this.build(elements ?? []);\n    }\n\n    add(element: T): this {\n        // Find the element\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        let edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        let stack = searchStack(element, { value: edge }, this.compare, this.dupeWeight);\n\n        // If element already exists\n        if (stack.value.to != null) {\n            return this;\n        }\n\n        // Add element\n        edge = stack.value;\n        let label = edge.label;\n        edge.from![label!] = { level: 1, value: element };\n\n        // Balance the tree\n        while (stack.next) {\n            stack = stack.next;\n            edge = stack.value;\n            edge.to = split(skew(edge.to));\n            edge.from![(label = edge.label!)] = edge.to;\n        }\n\n        // Update state\n        ++this.length;\n        this.root = sentinel.left;\n        return this;\n    }\n\n    clear(): void {\n        this.root = undefined;\n        this.length = 0;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    delete(element: T): boolean {\n        // Remove the element if found\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        const edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        const stack = searchStack(element, { value: edge }, this.compare, 0);\n        const removed = remove(stack);\n\n        // Update state\n        this.root = sentinel.left;\n        this.length -= +removed;\n        return removed;\n    }\n\n    has(element: T): boolean {\n        return search(element, this.root, this.compare) != null;\n    }\n\n    max(): T | undefined {\n        return rightmost(this.root)?.value;\n    }\n\n    min(): T | undefined {\n        return leftmost(this.root)?.value;\n    }\n\n    pop(): T | undefined {\n        // Find the maximum value\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        const edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        const stack = rightmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.root = sentinel.left;\n        this.length -= +removed;\n        return value;\n    }\n\n    shift(): T | undefined {\n        // Find the minimum value\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        const edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        const stack = leftmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.root = sentinel.left;\n        this.length -= +removed;\n        return value;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    *sorted(): Iterable<T> {\n        for (const node of inOrderTraverse(this.root)) {\n            yield node.value;\n        }\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of preOrderTraverse(this.root)) {\n            yield node.value;\n        }\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        if (this.delete(curElement)) {\n            this.add(newElement);\n            return true;\n        }\n        return false;\n    }\n\n    protected build(obj: Iterable<T>): void {\n        if (isArray(obj)) {\n            for (let i = 0; i < obj.length; ++i) {\n                this.add(obj[i]);\n            }\n        } else if (obj instanceof AATree && this.compare === obj.compare) {\n            this.root = clone(obj.root);\n            this.length = obj.size;\n        } else {\n            for (const element of obj) {\n                this.add(element);\n            }\n        }\n    }\n}\n/**\n * @internal\n */\nexport function remove<T>(stack: LinkedNode<Edge<AATreeNode<T>>>): boolean {\n    let edge = stack.value;\n    let node = edge.to;\n\n    // If not found\n    if (node == null) {\n        return false;\n    }\n\n    // Remove the node\n    stack = removeStack(stack);\n\n    // Update the tree\n    while (stack.next) {\n        stack = stack.next;\n        edge = stack.value;\n        node = edge.to!;\n\n        // Decrease levels\n        const level = 1 + Math.min(node.left?.level ?? 0, node.right?.level ?? 0);\n        if (level < node.level) {\n            node.level = level;\n            if (node.right != null && level < node.right.level) {\n                node.right.level = level;\n            }\n        }\n\n        // Balance\n        node = skew(node);\n        node.right = skew(node.right);\n        if (node.right != null) {\n            node.right.right = skew(node.right.right);\n        }\n        node = split(node);\n        node.right = split(node.right);\n\n        // Make the update\n        edge.from![edge.label!] = edge.to = node;\n    }\n\n    return true;\n}\n/**\n * @internal\n */\nexport function skew<T>(node?: undefined): undefined;\nexport function skew<T>(node: AATreeNode<T>): AATreeNode<T>;\nexport function skew<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined;\nexport function skew<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined {\n    if (node == null || node.left == null || node.level != node.left.level) {\n        return node;\n    }\n    const left = node.left;\n    node.left = left.right;\n    left.right = node;\n    return left;\n}\n/**\n * @internal\n */\nexport function split<T>(node?: undefined): undefined;\nexport function split<T>(node: AATreeNode<T>): AATreeNode<T>;\nexport function split<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined;\nexport function split<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined {\n    if (\n        node == null ||\n        node.right == null ||\n        node.right.right == null ||\n        node.level != node.right.right.level\n    ) {\n        return node;\n    }\n    const right = node.right;\n    node.right = right.left;\n    right.left = node;\n    ++right.level;\n    return right;\n}\n","import { CompareFn } from 'src';\nimport { AVLTreeNode } from './avlTreeNode';\nimport {\n    clone,\n    search,\n    Edge,\n    inOrderTraverse,\n    leftmost,\n    leftmostStack,\n    preOrderTraverse,\n    rightmost,\n    rightmostStack,\n    searchStack,\n    removeStack,\n} from './binaryTreeUtils';\nimport { SortedTree } from './sortedTree';\nimport { isArray } from 'src/array/utils';\nimport { LinkedNode } from 'src/list';\n\n/**\n * An AVL tree is a self-balancing binary search tree ([source](https://en.wikipedia.org/wiki/AVL_tree)).\n *\n * It is named after inventors Georgy Adelson-Velsky and Evgenii Landis and was the first such\n * data structure to be invented. In an AVL tree, the heights of the two child\n * subtrees of any node differ by at most one; if at any time they differ by more\n * than one, rebalancing is done to restore this property.\n *\n * Lookup, insertion, and deletion all take O(log(n)) time in both the average and worst cases,\n * where n is the number of nodes in the tree prior to the operation. Insertions and deletions\n * may require the tree to be rebalanced by one or more tree rotations.\n *\n * AVL trees are often compared with red–black trees as both take O(log(n))\n * time for the basic operations. For lookup-intensive applications, AVL trees are\n * faster than red–black trees because they are more strictly balanced.\n * Similar to red–black trees, AVL trees are height-balanced.\n */\nexport class AVLTree<T> implements SortedTree<T> {\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * Indicates how to handle duplicates:\n     * - < 0 : Add to left subtree\n     * - = 0 : Do now allow duplicates\n     * - > 0 : Add to right subtree\n     */\n    protected dupeWeight: number;\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The root of the tree.\n     */\n    protected root: AVLTreeNode<T>;\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>);\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param allowDuplicates - Whether to allow duplicates\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, allowDuplicates: boolean, elements?: Iterable<T>);\n    constructor(\n        compareFn: CompareFn<T>,\n        allowDuplicates?: boolean | Iterable<T>,\n        elements?: Iterable<T>,\n    ) {\n        if (typeof allowDuplicates !== 'boolean') {\n            elements = allowDuplicates;\n            allowDuplicates = true;\n        }\n        this.compare = compareFn;\n        this.dupeWeight = +allowDuplicates;\n        this.length = 0;\n        this.root = {} as AVLTreeNode<T>;\n        this.build(elements ?? []);\n    }\n\n    add(element: T): this {\n        // Find the element\n        let edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        let stack = searchStack(element, { value: edge }, this.compare, this.dupeWeight);\n\n        // If element already exists\n        if (stack.value.to != null) {\n            return this;\n        }\n\n        // Add element\n        edge = stack.value;\n        let label = edge.label;\n        edge.from![label!] = { balanceFactor: 0, value: element };\n\n        // Balance the tree\n        while (stack.next) {\n            stack = stack.next;\n            edge = stack.value;\n            edge.to!.balanceFactor += label === 'left' ? -1 : 1;\n            edge.to = balance(edge.to!);\n            edge.from![(label = edge.label!)] = edge.to;\n            if (edge.to!.balanceFactor === 0) {\n                break;\n            }\n        }\n\n        // Update state\n        ++this.length;\n        return this;\n    }\n\n    clear(): void {\n        this.root.left = undefined;\n        this.length = 0;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    delete(element: T): boolean {\n        // Remove the element if found\n        const edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        const stack = searchStack(element, { value: edge }, this.compare, 0);\n        const removed = remove(stack);\n\n        // Update state\n        this.length -= +removed;\n        return removed;\n    }\n\n    has(element: T): boolean {\n        return search(element, this.root.left, this.compare) != null;\n    }\n\n    max(): T | undefined {\n        return rightmost(this.root.left)?.value;\n    }\n\n    min(): T | undefined {\n        return leftmost(this.root.left)?.value;\n    }\n\n    pop(): T | undefined {\n        // Find the maximum value\n        const edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        const stack = rightmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.length -= +removed;\n        return value;\n    }\n\n    shift(): T | undefined {\n        // Find the minimum value\n        const edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        const stack = leftmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.length -= +removed;\n        return value;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    *sorted(): Iterable<T> {\n        for (const node of inOrderTraverse(this.root.left)) {\n            yield node.value;\n        }\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of preOrderTraverse(this.root.left)) {\n            yield node.value;\n        }\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        if (this.delete(curElement)) {\n            this.add(newElement);\n            return true;\n        }\n        return false;\n    }\n\n    protected build(obj: Iterable<T>): void {\n        if (isArray(obj)) {\n            for (let i = 0; i < obj.length; ++i) {\n                this.add(obj[i]);\n            }\n        } else if (obj instanceof AVLTree && this.compare === obj.compare) {\n            this.root = clone(obj.root);\n            this.length = obj.size;\n        } else {\n            for (const element of obj) {\n                this.add(element);\n            }\n        }\n    }\n}\n/**\n * @internal\n */\nexport function balance<T>(node: AVLTreeNode<T>): AVLTreeNode<T> {\n    if (node.balanceFactor > 1) {\n        if (node.right!.balanceFactor < 0) {\n            node.right = rotateR(node.right!);\n        }\n        node = rotateL(node);\n    } else if (node.balanceFactor < -1) {\n        if (node.left!.balanceFactor > 0) {\n            node.left = rotateL(node.left!);\n        }\n        node = rotateR(node);\n    }\n    return node;\n}\n/**\n * @internal\n */\nexport function remove<T>(stack: LinkedNode<Edge<AVLTreeNode<T>>>): boolean {\n    let edge = stack.value;\n    const node = edge.to;\n\n    // If not found\n    if (node == null) {\n        return false;\n    }\n\n    // Remove the node\n    stack = removeStack(stack);\n\n    // Balance the tree\n    let label = stack.value.label;\n    while (stack.next) {\n        stack = stack.next;\n        edge = stack.value;\n        edge.to!.balanceFactor -= label === 'left' ? -1 : 1;\n        edge.to = balance(edge.to!);\n        edge.from![(label = edge.label)!] = edge.to;\n        if (edge.to!.balanceFactor !== 0) {\n            break;\n        }\n    }\n\n    return true;\n}\n/**\n * @internal\n */\nexport function rotateL<T>(P: AVLTreeNode<T>): AVLTreeNode<T> {\n    const R = P.right!;\n    P.right = R.left;\n    R.left = P;\n    P.balanceFactor -= 1 + Math.max(0, R.balanceFactor);\n    R.balanceFactor -= 1 - Math.min(0, P.balanceFactor);\n    return R;\n}\n/**\n * @internal\n */\nexport function rotateR<T>(P: AVLTreeNode<T>): AVLTreeNode<T> {\n    const L = P.left!;\n    P.left = L.right;\n    L.right = P;\n    P.balanceFactor += 1 - Math.min(0, L.balanceFactor);\n    L.balanceFactor += 1 + Math.max(0, P.balanceFactor);\n    return L;\n}\n"],"sourceRoot":""}
\ No newline at end of file
+{"version":3,"sources":["webpack://Dastal/webpack/universalModuleDefinition","webpack://Dastal/webpack/bootstrap","webpack://Dastal/webpack/runtime/define property getters","webpack://Dastal/webpack/runtime/hasOwnProperty shorthand","webpack://Dastal/webpack/runtime/make namespace object","webpack://Dastal/./src/collection/iteratorUtils.ts","webpack://Dastal/./src/math/numberUtils.ts","webpack://Dastal/./src/collection/arrayUtils.ts","webpack://Dastal/./src/collection/index.ts","webpack://Dastal/./src/heap/utils.ts","webpack://Dastal/./src/heap/binaryHeap.ts","webpack://Dastal/./src/tree/binaryTreeUtils.ts","webpack://Dastal/./src/heap/skewHeap.ts","webpack://Dastal/./src/list/arrayList.ts","webpack://Dastal/./src/list/utils.ts","webpack://Dastal/./src/list/doublyLinkedList.ts","webpack://Dastal/./src/list/linkedList.ts","webpack://Dastal/./src/math/u32.ts","webpack://Dastal/./src/queue/arrayQueue.ts","webpack://Dastal/./src/queue/linkedQueue.ts","webpack://Dastal/./src/segmentTree/inOrderSegmentTree.ts","webpack://Dastal/./src/segmentTree/levelOrderSegmentTree.ts","webpack://Dastal/./src/stack/arrayStack.ts","webpack://Dastal/./src/stack/linkedStack.ts","webpack://Dastal/./src/tree/aaTree.ts","webpack://Dastal/./src/tree/avlTree.ts"],"names":["root","factory","exports","module","define","amd","self","__webpack_require__","definition","key","o","Object","defineProperty","enumerable","get","obj","prop","prototype","hasOwnProperty","call","Symbol","toStringTag","value","always","fn","next","done","fill","length","undefined","first","n","iterator","res","join","iterators","res2","never","once","skip","bind","split","iter","clamp","num","min","max","Math","wrapLeft","wrapRight","wrap","MAX_ARRAY_LENGTH","MAX_SAFE_ARGUMENT_LENGTH","isArray","Array","isTypedArray","TypedArray","getPrototypeOf","Uint8Array","splice","array","start","count","elements","maxStepSize","stepSize","maxElems","out","RangeError","isCollection","bubbleUp","index","compareFn","parentIndex","floor","parent","heapify","i","sinkDown","childIndex","child","skewMerge","heaps","lists","push","list","tree","right","compare","a","b","tail","pop","mergeKSorted","heap","node","left","BinaryHeap","this","addAll","element","indexOf","last","size","curElement","newElement","inOrderTraverse","preOrderTraverse","removeStack","stack","dir","edge","to","temp","successorStack","predecessorStack","from","label","clone","assign","leftmost","leftmostStack","rightmostStack","rightmost","search","comp","searchStack","dupeWeight","paths","toBinaryTree","nodes","par","SkewHeap","merge","comparator","ArrayList","copyWithin","callback","prev","shift","slice","sort","unshift","arguments","len","linkedMergeSort","isDoubly","lens","ceil","heads","tails","linkedMergeSorted","DoublyLinkedList","_addAll","_get","nodeA","nodeB","head","view","LinkedList","_copyWithin","nodeC","nodeD","remove","deleted","newTail","add","bitsSet","invert","msp","u32","isPow2","lsb","lsp","lsps","msb","msps","reverse","ArrayQueue","LinkedQueue","clear","InOrderSegmentTree","combine","build","mask","MAX_SIZE","set","offset","operation","dc","dp","LevelOrderSegmentTree","level","shrink","grow","aggregate","cap","ArrayStack","LinkedStack","AATree","allowDuplicates","sentinel","skew","removed","delete","AVLTree","balanceFactor","balance","rotateR","rotateL","P","R","L"],"mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,SAAU,GAAIH,GACK,iBAAZC,QACdA,QAAgB,OAAID,IAEpBD,EAAa,OAAIC,IARnB,CASGK,MAAM,WACT,M,mBCTA,IAAIC,EAAsB,CCA1B,EAAwB,CAACL,EAASM,KACjC,IAAI,IAAIC,KAAOD,EACXD,EAAoBG,EAAEF,EAAYC,KAASF,EAAoBG,EAAER,EAASO,IAC5EE,OAAOC,eAAeV,EAASO,EAAK,CAAEI,YAAY,EAAMC,IAAKN,EAAWC,MCJ3E,EAAwB,CAACM,EAAKC,IAAUL,OAAOM,UAAUC,eAAeC,KAAKJ,EAAKC,GCClF,EAAyBd,IACH,oBAAXkB,QAA0BA,OAAOC,aAC1CV,OAAOC,eAAeV,EAASkB,OAAOC,YAAa,CAAEC,MAAO,WAE7DX,OAAOC,eAAeV,EAAS,aAAc,CAAEoB,OAAO,M,8qBCFhD,SAASC,EAAgBC,GAC5B,MAAO,CAAEC,KAAM,iBAAO,CAAEC,MAAM,EAAOJ,MAAOE,OAKzC,SAASG,EAAcC,EAAgBJ,GAC1C,MAAO,CACHC,KAAM,WACF,OAAIG,EAAS,EACF,CAAEF,MAAM,EAAMJ,WAAOO,MAE9BD,EACK,CAAEF,MAAM,EAAOJ,MAAOE,QAYlC,SAASM,EAAeC,EAAWC,GACtC,MAAO,CACHP,KAAM,WACF,GAAIM,EAAI,EACJ,MAAO,CAAEL,MAAM,EAAMJ,WAAOO,GAEhC,IAAMI,EAAMD,EAASP,OAErB,OADAM,EAAIE,EAAIP,KAAO,EAAIK,EAAI,EAChBE,IASZ,SAASC,EAAcC,GAC1B,IAAIH,EAAoC,CAAEP,KAAM,iBAAO,CAAEC,MAAM,EAAMJ,WAAOO,KAC5E,MAAO,CACHJ,KAAM,WACF,GAAgB,MAAZO,EACA,MAAO,CAAEN,MAAM,EAAMJ,WAAOO,GAGhC,IADA,IAAII,EAAMD,EAASP,OACZQ,EAAIP,MAAM,CACb,IAAMU,EAAOD,EAAUV,OACvB,GAAIW,EAAKV,KAEL,OADAM,OAAWH,EACJ,CAAEH,MAAM,EAAMJ,WAAOO,GAGhCI,GADAD,EAAWI,EAAKd,OACDG,OAEnB,OAAOQ,IAOZ,SAASI,IACZ,MAAO,CAAEZ,KAAM,iBAAO,CAAEC,MAAM,EAAMJ,WAAOO,KAKxC,SAASS,EAAcd,GAC1B,IAAIE,GAAO,EACX,MAAO,CACHD,KAAM,WACF,IAAMQ,EAAM,CAAEP,OAAMJ,MAAOE,KAG3B,OAFAE,GAAO,EACPF,EAAK,aACES,IAYZ,SAASM,EAAcR,EAAWC,GACrC,IAAIR,EAAK,WAEL,IADA,IAAIS,EAAyB,CAAEP,MAAM,EAAOJ,WAAOO,GAC5CE,KAAM,IAAME,EAAIP,MACnBO,EAAMD,EAASP,OAGnB,OADAD,EAAKQ,EAASP,KAAKe,KAAKR,GACjBC,GAEX,MAAO,CAAER,KAAM,kBAAMD,MAUlB,SAASiB,EAAeb,EAAgBI,GAC3C,GAAIJ,EAAS,EACT,MAAO,CAAEH,KAAM,iBAAO,CAAEC,MAAM,EAAMJ,WAAOO,KAE/C,IAAIH,GAAO,EACX,MAAO,CACHD,KAAM,WACF,GAAIC,EACA,MAAO,CAAEA,OAAMJ,WAAOO,GAE1B,IAAMa,EAAOZ,EAAMF,EAAQI,GACrBC,EAAMS,EAAKjB,OACjB,OAAIQ,EAAIP,KAEG,CAAEA,KADTA,GAAO,EACQJ,WAAOO,GAEnB,CAAEH,OAAMJ,MAAOY,EAAK,CAACI,GAAK,kBAAML,EAAIX,SAAQoB,GAAMtB,OAAOY,gBCtHrE,SAASW,EAAMC,EAAaC,EAAaC,GAC5C,OAAOC,KAAKF,IAAIC,EAAKC,KAAKD,IAAID,EAAKD,IAgBhC,SAASI,EAASJ,EAAaC,EAAaC,GAC/C,OAAOF,EAAMC,EAAMC,EAAMD,EAAMD,EAAMA,EAgBlC,SAASK,EAAUL,EAAaC,EAAaC,GAChD,OAAOF,EAAME,EAAMD,GAAOD,EAAME,GAAOF,EAWpC,SAASM,EAAKN,EAAaC,EAAaC,GAC3C,OAAOF,EAAMC,EAAMC,EAAMD,EAAMD,EAAMK,EAAUL,EAAKC,EAAKC,G,igCC9CtD,IAAMK,EAAmB,WAWnBC,EAA2B,MAQjC,SAASC,EAAiBtC,GAC7B,OAAOA,aAAeuC,OAASC,EAAaxC,GAYzC,IACGyC,E,EADGD,GACHC,EAAa7C,OAAO8C,eAAeC,YAClC,SAA+B3C,GAClC,OAAOA,aAAeyC,IAevB,SAASG,EAAUC,EAAYC,EAAgBC,EAAgBC,GAA6B,QAK/F,GAJAF,EAAQlB,EAAMK,EAAQ,UAACa,SAAD,QAAU,EAAG,EAAGD,EAAMhC,QAAS,EAAGgC,EAAMhC,QAC9DkC,EAAQnB,EAAK,UAACmB,SAAD,QAAUF,EAAMhC,OAAQ,EAAGgC,EAAMhC,OAASiC,GAGvC,MAAZE,EACA,OAAOH,EAAMD,OAAOE,EAAOC,GAG/B,IAAME,EAAcZ,EAA2B,EACzCpB,EAAW+B,EAAS3C,OAAOY,YAG7BiC,EAAWL,EAAMhC,OAASkC,EACxBI,EAAWf,EAAmBc,EAChClC,EAAIgB,KAAKF,IAAImB,EAAaE,GACxBC,EAAMP,EAAMD,OAAN,MAAAC,EAAK,CAAQC,EAAOC,GAAf,cAA4B1C,OAAOY,UAAW,kBAAMF,EAAMC,EAAGC,SAK9E,IAHA6B,GADAI,EAAWL,EAAMhC,OAASqC,EAIrBlC,EAAImC,EAAWD,EAAUlC,GAAKiC,GAAeC,GAAYD,EAAajC,GAAKkC,EAC5EA,EAAWL,EAAMhC,OACjBgC,EAAMD,OAAN,MAAAC,EAAK,CAAQC,EAAO,GAAf,cAAwBzC,OAAOY,UAAW,kBAAMF,EAAMkC,EAAahC,SAExE6B,GADAI,EAAWL,EAAMhC,OAASqC,EAQ9B,GALIlC,EAAI,GAAKkC,GAAYD,GACrBJ,EAAMD,OAAN,MAAAC,EAAK,CAAQC,EAAO,GAAf,cAAwBzC,OAAOY,UAAW,kBAAMF,EAAMC,EAAGC,SAItC,GAAxBA,EAASP,OAAOC,KAChB,MAAM,IAAI0C,WAAW,wBAGzB,OAAOD,ECrFJ,SAASE,EAAatD,GACzB,OACW,MAAPA,GAAsC,iBAAhBA,EAAG,MAAyD,mBAAzBA,EAAIK,OAAOY,UCRrE,SAASsC,EAAYC,EAAeC,EAAyBZ,GAIhE,IAHA,IAAMtC,EAAQsC,EAAMW,GAGbA,EAAQ,GAAG,CAEd,IAAME,EAAc1B,KAAK2B,OAAOH,EAAQ,GAAK,GAAK,EAC5CI,EAASf,EAAMa,GAGrB,GAAID,EAAUG,EAAQrD,IAAU,EAC5B,MAIJsC,EAAMa,GAAenD,EACrBsC,EAAMW,GAASI,EACfJ,EAAQE,GAMT,SAASG,EAAWJ,EAAyBZ,GAChD,IAAK,IAAIiB,EAAKjB,EAAMhC,OAAS,IAAO,EAAGiD,EAAI,EAAGC,IAAWD,EAAGL,EAAWZ,KAwBpE,SAASkB,EAAYP,EAAeC,EAAyBZ,GAGhE,IAFA,IAAM7B,EAAI6B,EAAMhC,OACVN,EAAQsC,EAAMW,KACjB,CAEC,IAAIQ,EAAa,EAAIR,EAAQ,EAG7B,GAAIQ,GAAchD,EACd,MAIJ,IAAIiD,EAAQpB,EAAMmB,GAMlB,GALIA,EAAa,EAAIhD,GAAKyC,EAAUZ,EAAMmB,EAAa,GAAIC,IAAU,IACjEA,EAAQpB,IAAQmB,IAIhBP,EAAUlD,EAAO0D,IAAU,EAC3B,MAIJpB,EAAMW,GAASS,EACfpB,EAAMmB,GAAczD,EACpBiD,EAAQQ,GAgBT,SAASE,EACZT,EACAU,GAIA,IADA,IAQsB,EARhBC,EAAyC,GACtCN,EAAI,EAAGA,EAAIK,EAAMtD,SAAUiD,EAChB,MAAZK,EAAML,IACNM,EAAMC,KAAK,CAAE9D,MAAO4D,EAAML,KAKlC,GAAIM,EAAMvD,OAAS,EACf,iBAAOuD,EAAM,UAAb,aAAO,EAAU7D,MAQrB,IAAK,IAAIuD,EAAI,EAAGA,EAAIM,EAAMvD,SAAUiD,EAAG,CAGnC,IAFA,IAAIQ,EAAOF,EAAMN,GACbS,EAAsCD,EAAK/D,MACvCgE,EAAOA,EAAKC,OAChBF,EAAO,CAAE5D,KAAM4D,EAAM/D,MAAOgE,GAEhCH,EAAMN,GAAKQ,EAcf,IAVA,IAAIA,EA7FD,SAAyBb,EAAyBW,GAGrD,IAAMK,EAAoC,SAACC,EAAGC,GAAJ,OAAUlB,EAAUiB,EAAEnE,MAAOoE,EAAEpE,QACzEsD,EAAQY,EAASL,GAIjB,IADA,IAAME,EAAsBF,EAAM,GACzBQ,EAAON,EAAMF,EAAMvD,OAAS,EAAG+D,EAAOA,EAAKlE,KAAM,OACtD0D,EAAM,GAAN,UAAWA,EAAM,GAAG1D,YAApB,QAA4B0D,EAAMS,MAClCd,EAAS,EAAGU,EAASL,GACrBQ,EAAKlE,KAAO0D,EAAM,GAGtB,OAAOE,EA+E+CQ,EAClD,SAACJ,EAAGC,GAAJ,OAAUlB,EAAUkB,EAAEpE,MAAOmE,EAAEnE,SAC/B6D,GAOAW,EAAOT,EAAK/D,MACR+D,EAAOA,EAAK5D,MAAO,CACvB,IAAMsE,EAAOV,EAAK/D,MAClByE,EAAKR,MAAQQ,EAAKC,KAClBD,EAAKC,KAAOF,EACZA,EAAOC,EAGX,OAAOD,E,uyCCkEN1E,OAAOY,SA7LL,I,EAAMiE,EAAb,WAeI,WAAYzB,EAAyBT,I,4FAAwB,yDACzDmC,KAAKV,QAAUhB,EACf0B,KAAKtC,MAAQ,GACbsC,KAAKC,OAAOpC,UAAY,I,QAlBhC,O,EAAA,G,EAAA,qBAqBI,SAAOA,GACH,IAAMH,EAAQsC,KAAKtC,MACbhC,EAASgC,EAAMhC,OAErB,GAAIyB,EAAQU,GAAW,CACnB,GAAIH,EAAMhC,OAASmC,EAASnC,OAASuB,EACjC,MAAM,IAAIiB,WAAW,uBAEzB,IAAK,IAAIS,EAAI,EAAGA,EAAId,EAASnC,SAAUiD,EACnCjB,EAAMwB,KAAKrB,EAASc,QAErB,WACmBd,GADnB,IACH,2BAAgC,KAArBqC,EAAqB,QAC5B,GAAIxC,EAAMhC,QAAUuB,EAChB,MAAM,IAAIiB,WAAW,uBAEzBR,EAAMwB,KAAKgB,IALZ,+BAcP,OAJIxE,EAASgC,EAAMhC,QACfgD,EAAQsB,KAAKV,QAAS5B,GAGnBA,EAAMhC,SA9CrB,mBAiDI,WACIsE,KAAKtC,MAAMhC,OAAS,IAlD5B,wBAqDI,WACI,OAAOsE,KAAKV,UAtDpB,sBAyDI,SAASY,GACL,OAAOF,KAAKtC,MAAMyC,QAAQD,IAAY,IA1D9C,oBA6DI,SAAOA,GACH,IAAM7B,EAAQ2B,KAAKtC,MAAMyC,QAAQD,GACjC,GAAI7B,EAAQ,EACR,OAAO,EAIX,IAAM+B,EAAOJ,KAAKtC,MAAMgC,MACxB,OAAIrB,GAAS2B,KAAKtC,MAAMhC,SAMxBsE,KAAKtC,MAAMW,GAAS+B,EACpBxB,EAASP,EAAO2B,KAAKV,QAASU,KAAKtC,OACnCU,EAASC,EAAO2B,KAAKV,QAASU,KAAKtC,SAPxB,IAtEnB,mBAiFI,SAAMkC,GACF,IAAMlC,EAAQsC,KAAKtC,MAEnB,GAAIkC,EAAKS,KAAO,EACZ,OAAOL,KAGX,GAAItC,EAAMhC,OAASkE,EAAKS,KAAOpD,EAC3B,MAAM,IAAIiB,WAAW,uBARF,UAWD0B,GAXC,IAWvB,2BAA4B,KAAjBM,EAAiB,QACxBxC,EAAMwB,KAAKgB,IAZQ,8BAgBvB,OADAxB,EAAQsB,KAAKV,QAAS5B,GACfsC,OAjGf,kBAoGI,WACI,OAAOA,KAAKtC,MAAMhC,OAAS,EAAIsE,KAAKtC,MAAM,QAAK/B,IArGvD,iBAwGI,WACI,KAAIqE,KAAKtC,MAAMhC,OAAS,GAAxB,CAKA,IAAMN,EAAQ4E,KAAKtC,MAAM,GACnB0C,EAAOJ,KAAKtC,MAAMgC,MASxB,OANIM,KAAKtC,MAAMhC,OAAS,IAEpBsE,KAAKtC,MAAM,GAAK0C,EAChBxB,EAAS,EAAGoB,KAAKV,QAASU,KAAKtC,QAG5BtC,KAxHf,kBA2HI,SAAKA,GAMD,OAJA4E,KAAKtC,MAAMwB,KAAK9D,GAGhBgD,EAAS4B,KAAKtC,MAAMhC,OAAS,EAAGsE,KAAKV,QAASU,KAAKtC,OAC5CsC,KAAKK,OAjIpB,qBAoII,SAAQjF,GAEJ,GAAI4E,KAAKtC,MAAMhC,OAAS,GAAKsE,KAAKV,QAAQlE,EAAO4E,KAAKtC,MAAM,KAAO,EAC/D,OAAOtC,EAIX,IAAMtB,EAAOkG,KAAKtC,MAAM,GAGxB,OAFAsC,KAAKtC,MAAM,GAAKtC,EAChBwD,EAAS,EAAGoB,KAAKV,QAASU,KAAKtC,OACxB5D,IA9If,qBAiJI,SAAQsB,GAEJ,KAAI4E,KAAKtC,MAAMhC,OAAS,GAAxB,CAMA,IAAM5B,EAAOkG,KAAKtC,MAAM,GAMxB,OALAsC,KAAKtC,MAAM,GAAKtC,EAChBA,EAAQtB,EAGR8E,EAAS,EAAGoB,KAAKV,QAASU,KAAKtC,OACxBtC,EAXH4E,KAAKtC,MAAMwB,KAAK9D,KApJ5B,gBAkKI,WACI,OAAO4E,KAAKtC,MAAMhC,SAnK1B,6CAsKI,mHACQsE,KAAKtC,MAAMhC,OAAS,GAD5B,iDAIUgC,EAAQsC,KAAKtC,MACbkC,EAAO,IAAIG,GAAmB,SAACR,EAAGC,GAAJ,OAAU,EAAKF,QAAQ5B,EAAM6B,GAAI7B,EAAM8B,MAAK,CAAC,IALrF,aAOYnB,EAAQuB,EAAKF,OACLhC,EAAMhC,QAR1B,iBASY,OATZ,SASkBgC,EAAMW,GATxB,QAUYA,EAAQ,EAAIA,EAAQ,GACZX,EAAMhC,QAAUkE,EAAKV,KAAKb,KAChCA,EAAQX,EAAMhC,QAAUkE,EAAKV,KAAKb,GAZhD,WAcauB,EAAKS,KAAO,EAdzB,iEAtKJ,aA6LI,WACI,OAAOL,KAAKtC,MAAMxC,OAAOY,cA9LjC,oBAiMI,SAAOwE,EAAeC,GAClB,IAAMlC,EAAQ2B,KAAKtC,MAAMyC,QAAQG,GACjC,QAAIjC,EAAQ,IAGZ2B,KAAKtC,MAAMW,GAASkC,EACpB3B,EAASP,EAAO2B,KAAKV,QAASU,KAAKtC,OACnCU,EAASC,EAAO2B,KAAKV,QAASU,KAAKtC,OAC5B,S,iBAzMf,K,0BCqKiB8C,G,0BAqHAC,GA9NV,SAASC,EACZC,GAEsB,IADtBC,IACsB,yDAClBC,EAAOF,EAAMvF,MACbyE,EAAOgB,EAAKC,GAGhB,GAAY,MAARjB,EACA,OAAOc,EAIX,GAAkB,MAAdd,EAAKR,MAELQ,EAAOA,EAAKC,UACT,GAAiB,MAAbD,EAAKC,KAEZD,EAAOA,EAAKR,WACT,GAAIuB,EAAK,CAIZ,IAAMG,GADNF,GADAF,EAAQK,EAAeL,IACVvF,OACK0F,GAClBjB,EAAKzE,MAAQ2F,EAAK3F,MAClByE,EAAOkB,EAAK1B,UACT,CAIH,IAAM0B,GADNF,GADAF,EAAQM,EAAiBN,IACZvF,OACK0F,GAClBjB,EAAKzE,MAAQ2F,EAAK3F,MAClByE,EAAOkB,EAAKjB,KAShB,OALAe,EAAKC,GAAKjB,EACNgB,EAAKK,OACLL,EAAKK,KAAKL,EAAKM,OAAUN,EAAKC,GAAKjB,GAGhCc,EAQJ,SAASS,EAAyCvB,GACrD,GAAY,MAARA,EAAJ,CAGA,IAAM5B,EAAYxD,OAAO4G,OAAO,GAAIxB,GAChCc,EAAsC,CAAEvF,MAAO6C,GACnD,GACI4B,EAAOc,EAAMvF,MACbuF,EAAQA,EAAMpF,KACVsE,EAAKC,OACLa,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAQyE,EAAKC,KAAOrF,OAAO4G,OAAO,GAAIxB,EAAKC,QAElED,EAAKR,QACLsB,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAQyE,EAAKR,MAAQ5E,OAAO4G,OAAO,GAAIxB,EAAKR,eAElEsB,GACT,OAAO1C,GAUJ,SAASqD,EACZzB,GAEA,GAAY,MAARA,EAAJ,CAGA,KAAOA,EAAKC,MACRD,EAAOA,EAAKC,KAEhB,OAAOD,GAKJ,SAAS0B,EACZZ,GAEA,IAAId,EAAOc,EAAMvF,MAAM0F,GACvB,GAAY,MAARjB,EACA,OAAOc,EAEX,KAAOd,EAAKC,MACRa,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAO,CAAE+F,MAAO,OAAQD,KAAMrB,EAAMiB,GAAIjB,EAAKC,OACpED,EAAOA,EAAKC,KAEhB,OAAOa,EAKJ,SAAUH,EACbX,GADG,sFAKH,IAFIc,OAAsChF,EAEnCkE,GACHc,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAOyE,GAC9BA,EAAOA,EAAKC,KAPb,WAUIa,EAVJ,iBAaC,OAFAd,EAAOc,EAAMvF,MACbuF,EAAQA,EAAMpF,KAZf,SAaOsE,EAbP,OAeC,IADAA,EAAOA,EAAKR,MACLQ,GACHc,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAOyE,GAC9BA,EAAOA,EAAKC,KAjBjB,uDAwGA,SAASmB,EACZN,GAEA,IAAMd,EAAOc,EAAMvF,MAAM0F,GACzB,OAAY,MAARjB,EACOc,EAGJa,EADPb,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAO,CAAE+F,MAAO,OAAQD,KAAMrB,EAAMiB,GAAIjB,EAAKC,QAMjE,SAAUW,EACbZ,GADG,sFAGCc,EAAkD,CAAEvF,MAAOyE,GAH5D,UAKCA,EAAOc,EAAMvF,MACbuF,EAAQA,EAAMpF,MACVsE,EAPL,gBAQK,OARL,SAQWA,EARX,OAUKc,EAAQ,CAAEpF,KADVoF,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAOyE,EAAKR,OACZjE,MAAOyE,EAAKC,MAVxC,UAYMa,EAZN,uDAmCA,SAASc,EACZ5B,GAEA,GAAY,MAARA,EAAJ,CAGA,KAAOA,EAAKR,OACRQ,EAAOA,EAAKR,MAEhB,OAAOQ,GAKJ,SAAS2B,EACZb,GAEA,IAAId,EAAOc,EAAMvF,MAAM0F,GACvB,GAAY,MAARjB,EACA,OAAOc,EAEX,KAAOd,EAAKR,OACRsB,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAO,CAAE+F,MAAO,QAASD,KAAMrB,EAAMiB,GAAIjB,EAAKR,QACrEQ,EAAOA,EAAKR,MAEhB,OAAOsB,EAMJ,SAASe,EACZxB,EACAL,EACAvB,GAEA,KAAOuB,GAAM,CACT,IAAM8B,EAAerD,EAAU4B,EAASL,EAAKzE,OAC7C,GAAY,GAARuG,EACA,MAEJ9B,EAAO8B,EAAO,EAAI9B,EAAKC,KAAOD,EAAKR,MAEvC,OAAOQ,EAMJ,SAAS+B,EACZ1B,EACAS,EACArC,GAKA,IAHsB,IADtBuD,EACsB,uDADT,EAEPC,EAA2B,CAAC,OAAQ,SACtCjC,EAAOc,EAAMvF,MAAM0F,GAChBjB,GAAM,CACT,IAAM8B,EAAerD,EAAU4B,EAASL,EAAKzE,QAAUyG,EACvD,GAAa,IAATF,EACA,MAEJ,IAAMR,EAAQW,IAAQH,EAAO,IAC7BhB,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAO,CAAE+F,QAAOD,KAAMrB,EAAMiB,GAAIjB,EAAKsB,KAC5DtB,EAAOA,EAAKsB,GAEhB,OAAOR,EAaJ,SAASK,EACZL,GAEA,IAAMd,EAAOc,EAAMvF,MAAM0F,GACzB,OAAY,MAARjB,EACOc,EAGJY,EADPZ,EAAQ,CAAEpF,KAAMoF,EAAOvF,MAAO,CAAE+F,MAAO,QAASD,KAAMrB,EAAMiB,GAAIjB,EAAKR,SAQlE,SAAS0C,EACZlE,GAEA,KAAgB,MAAZA,GAAoBA,EAASnC,OAAS,GAAoB,MAAfmC,EAAS,IAAxD,CAGA,IAAMhC,EAAIgC,EAASnC,OACbsG,EAA6B,IAAI5E,MAAMvB,GAC7CmG,EAAM,GAAK,CAAE5G,MAAOyC,EAAS,IAC7B,IAAK,IAAIc,EAAI,EAAGA,EAAI9C,IAAK8C,EACrB,GAAmB,MAAfd,EAASc,GAAb,CAGA,IAAMsD,EAAMD,EAAOrD,EAAI,IAAO,GACxBkB,EAAO,CAAEzE,MAAOyC,EAASc,IAC/BqD,EAAMrD,GAAKkB,EACH,EAAJlB,EACAsD,EAAInC,KAAOD,EAEXoC,EAAI5C,MAAQQ,EAGpB,OAAOmC,EAAM,I,6yCCvQX9G,OAAOY,SA/JN,I,GAAMoG,GAAb,WAmBI,WAAY5D,EAAyBT,I,4FAAwB,mFACzDmC,KAAKV,QAAUhB,EACf0B,KAAKtE,OAAS,EACdsE,KAAKC,OAAOpC,UAAY,I,QAtBhC,O,EAAA,G,EAAA,qBAyBI,SAAOA,GACH,GAAIV,EAAQU,GACR,IAAK,IAAIc,EAAI,EAAGA,EAAId,EAASnC,SAAUiD,EACnCqB,KAAKd,KAAKrB,EAASc,SAEpB,GAAId,aAAoBqE,GAAYrE,aAAoBkC,EAC3DC,KAAKmC,MAAMtE,OACR,YACmBA,GADnB,IACH,2BAAgC,KAArBqC,EAAqB,QAC5BF,KAAKd,KAAKgB,IAFX,+BAKP,OAAOF,KAAKtE,SArCpB,mBAwCI,WACIsE,KAAKtE,OAAS,EACdsE,KAAKlG,UAAO6B,IA1CpB,wBA6CI,WACI,OAAOqE,KAAKV,UA9CpB,sBAiDI,SAASY,GAAqB,WACPO,EAAiBT,KAAKlG,OADf,IAC1B,2BACI,GAAIoG,IADwC,QACvB9E,MACjB,OAAO,EAHW,8BAM1B,OAAO,IAvDf,oBA0DI,SAAO8E,GACH,GAAiB,MAAbF,KAAKlG,KACL,OAAO,EAEX,GAAIkG,KAAKlG,KAAKsB,QAAU8E,EAEpB,OADAF,KAAKN,OACE,EANa,WAQNe,EAAiBT,KAAKlG,OARhB,IAQxB,2BAA+C,KAApCmI,EAAoC,QACrC1H,EACF0H,EAAInC,MAAQmC,EAAInC,KAAK1E,QAAU8E,EACzB,OACA+B,EAAI5C,OAAS4C,EAAI5C,MAAMjE,QAAU8E,EACjC,aACAvE,EACV,GAAW,MAAPpB,EAAa,CACb,IAAMsF,EAAOoC,EAAI1H,GAGjB,OAFA0H,EAAI1H,GAAOwE,EAAUiB,KAAKV,QAAS,CAACO,EAAKC,KAAMD,EAAKR,UAClDW,KAAKtE,QACA,IAnBS,8BAsBxB,OAAO,IAhFf,mBAmFI,SAAMkE,GAYF,OAXII,KAAKV,UAAYM,EAAKwC,aACtBpC,KAAKC,OAAOL,GACLA,aAAgBsC,GACvBlC,KAAKlG,KAAOiF,EAAUiB,KAAKV,QAAS,CAACU,KAAKlG,KAAMsH,EAAMxB,EAAK9F,QAC3DkG,KAAKtE,QAAUkE,EAAKS,MACbT,aAAgBG,GACvBC,KAAKlG,KAAOiF,EAAUiB,KAAKV,QAAS,CAACU,KAAKlG,KAAMiI,EAAanC,EAAI,SACjEI,KAAKtE,QAAUkE,EAAKS,MAEpBL,KAAKC,OAAOL,GAETI,OA/Ff,kBAkGI,WAAsB,MAClB,iBAAOA,KAAKlG,YAAZ,aAAO,EAAWsB,QAnG1B,iBAsGI,WACI,GAAiB,MAAb4E,KAAKlG,KAAT,CAGA,IAAMsB,EAAQ4E,KAAKlG,KAAKsB,MAGxB,OAFA4E,KAAKlG,KAAOiF,EAAUiB,KAAKV,QAAS,CAACU,KAAKlG,KAAKgG,KAAME,KAAKlG,KAAKuF,UAC7DW,KAAKtE,OACAN,KA7Gf,kBAgHI,SAAKA,GAED,OADA4E,KAAKlG,KAAOiF,EAAUiB,KAAKV,QAAS,CAACU,KAAKlG,KAAM,CAAEsB,aACzC4E,KAAKtE,SAlHtB,qBAqHI,SAAQN,GAEJ,OADA4E,KAAKd,KAAK9D,GACH4E,KAAKN,QAvHpB,qBA0HI,SAAQtE,GACJ,GAAiB,MAAb4E,KAAKlG,KAGL,OAFAkG,KAAKlG,KAAO,CAAEsB,cACd4E,KAAKtE,OAAS,GAGlB,IAAMuC,EAAM+B,KAAKlG,KAAKsB,MAEtB,OADA4E,KAAKlG,KAAOiF,EAAUiB,KAAKV,QAAS,CAACU,KAAKlG,KAAKgG,KAAME,KAAKlG,KAAKuF,MAAO,CAAEjE,WACjE6C,IAlIf,gBAqII,WACI,OAAO+B,KAAKtE,SAtIpB,6CAyII,+GACqB,MAAbsE,KAAKlG,KADb,iDAIU8F,EAAO,IAAIsC,GACb,SAAC3C,EAAGC,GAAJ,OAAU,EAAKF,QAAQC,EAAEnE,MAAOoE,EAAEpE,SAClC,CAAC4E,KAAKlG,OANd,OAUQ,OADM+F,EAAOD,EAAKF,MAT1B,SAUcG,EAAKzE,MAVnB,OAWQyE,EAAKC,MAAQF,EAAKV,KAAKW,EAAKC,MAC5BD,EAAKR,OAASO,EAAKV,KAAKW,EAAKR,OAZrC,UAaaO,EAAKS,KAAO,EAbzB,gEAzIJ,sCA+JI,4GACuBI,EAAiBT,KAAKlG,OAD7C,wDAEQ,OADO+F,EADf,iBAEcA,EAAKzE,MAFnB,qMA/JJ,oBAqKI,SAAOkF,EAAeC,GAClB,GAAiB,MAAbP,KAAKlG,KACL,OAAO,EAGX,GAAIkG,KAAKlG,KAAKsB,QAAUkF,EAMpB,OALAN,KAAKlG,KAAOiF,EAAUiB,KAAKV,QAAS,CAChCU,KAAKlG,KAAKgG,KACVE,KAAKlG,KAAKuF,MACV,CAAEjE,MAAOmF,MAEN,EAGX,IAd0C,EActCV,OAAsClE,EAdA,KAexB8E,EAAiBT,KAAKlG,OAfE,IAe1C,2BAA+C,KAApCmI,EAAoC,QAC3C,GAAIA,EAAInC,MAAQmC,EAAInC,KAAK1E,QAAUkF,EAAY,CAC3CT,EAAOoC,EAAInC,KACXmC,EAAInC,UAAOnE,EACX,MAEJ,GAAIsG,EAAI5C,OAAS4C,EAAI5C,MAAMjE,QAAUkF,EAAY,CAC7CT,EAAOoC,EAAI5C,MACX4C,EAAI5C,WAAQ1D,EACZ,QAxBkC,8BA4B1C,OAAY,MAARkE,IAIJG,KAAKlG,KAAOiF,EAAUiB,KAAKV,QAAS,CAChCU,KAAKlG,KACL+F,EAAKC,KACLD,EAAKR,MACL,CAAEjE,MAAOmF,MAEN,Q,kBA3Mf,K,0KCqGKrF,OAAOY,SA/HL,I,GAAMuG,GAAb,WAUI,WAAYxE,G,qGAAwB,S,OAAA,G,EAAA,gB,sBAAA,K,uDAAA,K,KAChCmC,KAAKtC,MAAQG,EAAWT,MAAM8D,KAAKrD,GAAY,G,QAXvD,O,EAAA,G,EAAA,kBAcI,SAAIQ,EAAe6B,GAIf,OAHI7B,GAAS,GAAKA,GAAS2B,KAAKK,MAC5BL,KAAKtC,MAAMD,OAAOY,EAAO,EAAG6B,GAEzBF,KAAKK,OAlBpB,oBAqBI,SAAOhC,EAAeR,GAIlB,OAHIQ,GAAS,GAAKA,GAAS2B,KAAKK,MAC5B5C,EAAOuC,KAAKtC,MAAOW,EAAO,EAAGR,GAE1BmC,KAAKK,OAzBpB,mBA4BI,WACIL,KAAKtC,MAAMhC,OAAS,IA7B5B,oBAgCI,WAA8C,IAC1C,IAAMuC,EAAM,IAAIoE,EAAUrC,MADgB,mBAApCf,EAAoC,yBAApCA,EAAoC,gBAE1C,cAAmBA,EAAnB,eAA0B,CAArB,IAAME,EAAI,KACXlB,EAAIgC,OAAOhC,EAAIoC,KAAMlB,GAEzB,OAAOlB,IArCf,wBAwCI,SAAWI,EAAe1B,EAAcC,GAAoB,QAKxD,OAJAyB,EAAQ5B,EAAMK,EAASuB,EAAO,EAAG2B,KAAKK,MAAO,EAAGL,KAAKK,MACrD1D,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKK,MAAO,EAAGL,KAAKK,MACtDzD,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKK,KAAM,EAAGL,KAAKK,MAAO,EAAGL,KAAKK,MAC9DL,KAAKtC,MAAM4E,WAAWjE,EAAO1B,EAAKC,GAC3BoD,OA7Cf,kBAgDI,SAAKE,EAAYvD,EAAcC,GAAoB,QAI/C,OAHAD,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKK,MAAO,EAAGL,KAAKK,MACtDzD,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKK,KAAM,EAAGL,KAAKK,MAAO,EAAGL,KAAKK,MAC9DL,KAAKtC,MAAMjC,KAAKyE,EAASvD,EAAKC,GACvBoD,OApDf,iBAuDI,SAAI3B,GACA,OAAOA,EAAQ,GAAKA,GAAS2B,KAAKK,UAAO1E,EAAYqE,KAAKtC,MAAMW,KAxDxE,oBA2DI,SAAOA,EAAekE,GAClB,IAAInH,OAAuBO,EAK3B,OAJI0C,GAAS,GAAKA,EAAQ2B,KAAKK,OAC3BjF,EAAQ4E,KAAKtC,MAAMW,GACnB2B,KAAKtC,MAAMW,GAASkE,EAASnH,IAE1BA,IAjEf,iBAoEI,WACI,OAAO4E,KAAKtC,MAAMgC,QArE1B,kBAwEI,SAAKQ,GACD,OAAOF,KAAKtC,MAAMwB,KAAKgB,KAzE/B,oBA4EI,SAAO7B,GACH,OAAOA,EAAQ,GAAKA,GAAS2B,KAAKK,UAAO1E,EAAYqE,KAAKtC,MAAMD,OAAOY,EAAO,GAAG,KA7EzF,qBAgFI,SAAQ1B,EAAcC,GAAoB,QAGtC,IAFAD,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKK,MAAO,EAAGL,KAAKK,MACtDzD,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKK,KAAM,EAAGL,KAAKK,MAAO,EAAGL,KAAKK,MAAQ,EAC/D1D,EAAMC,GAAK,CACd,IAAMmE,EAAOf,KAAKtC,MAAMf,GACxBqD,KAAKtC,MAAMf,KAASqD,KAAKtC,MAAMd,GAC/BoD,KAAKtC,MAAMd,KAASmE,EAExB,OAAOf,OAxFf,iBA2FI,SAAI3B,EAAe6B,GACf,IAAIsC,OAAsB7G,EAK1B,OAJI0C,GAAS,GAAKA,EAAQ2B,KAAKK,OAC3BmC,EAAOxC,KAAKtC,MAAMW,GAClB2B,KAAKtC,MAAMW,GAAS6B,GAEjBsC,IAjGf,mBAoGI,WACI,OAAOxC,KAAKtC,MAAM+E,UArG1B,gBAwGI,WACI,OAAOzC,KAAKtC,MAAMhC,SAzG1B,mBA4GI,SAAMiB,EAAcC,GAChB,OAAO,IAAIyF,EAAUrC,KAAKtC,MAAMgF,MAAM/F,EAAKC,MA7GnD,oBAgHI,SAAOe,EAAgBC,EAAgBC,GACnC,OAAO,IAAIwE,EAAU5E,EAAOuC,KAAKtC,MAAOC,EAAOC,EAAOC,MAjH9D,kBAoHI,SAAKS,GAED,OADA0B,KAAKtC,MAAMiF,KAAKrE,GACT0B,OAtHf,cA+HI,WACI,OAAOA,KAAKtC,MAAMxC,OAAOY,cAhIjC,qBAmII,SAAQoE,GACJ,OAAOF,KAAKtC,MAAMkF,QAAQ1C,KApIlC,oBA8II,SACIvD,EACAC,EACA2F,GACI,QAYJ,IAXgB,MAAZA,IACIM,UAAUnH,OAAS,GACnB6G,EAAW5F,EACXA,OAAMhB,IAEN4G,EAAW3F,EACXA,OAAMjB,IAGdgB,EAAMF,EAAMK,EAAQ,QAAE,EAAAH,SAAF,QAAoB,EAAG,EAAGqD,KAAKK,MAAO,EAAGL,KAAKK,MAClEzD,EAAMH,EAAMK,EAAQ,QAAE,EAAAF,SAAF,QAAoBoD,KAAKK,KAAM,EAAGL,KAAKK,MAAO,EAAGL,KAAKK,MACnE1D,EAAMC,GACToD,KAAKtC,MAAMf,GAAO4F,EAASvC,KAAKtC,MAAMf,GAAMA,KAC1CA,EAEN,OAAOqD,OAlKf,2CAqKI,WAAMrD,EAAcC,GAApB,+FACID,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKK,MAAO,EAAGL,KAAKK,MAIlDyC,EADO,MAAPlG,EACM,kBAAM,EAAKyD,MACVzD,GAAO,EACR,kBAAMC,KAAKF,IAAIC,EAAK,EAAKyD,OAEzB,kBAAM,EAAKA,KAAOzD,GAThC,YAYWD,EAAMmG,KAZjB,gBAaQ,OAbR,SAac9C,KAAKtC,MAAMf,KAbzB,yE,kBArKJ,KCiBO,SAASoG,GACZlD,EACAiD,EACAE,EACA1E,GAGA,GAAIwE,EAAM,EACN,MAAO,CAACjD,EAAMA,GAIlBiD,GAAY,EACZ,IAAMG,EAAyB,CAACpG,KAAKqG,KAAKJ,GAAMjG,KAAK2B,MAAMsE,IACrDK,EAAQJ,GAAgBlD,EAAMoD,EAAK,GAAID,EAAU1E,GACjD8E,EAAQL,GAAgBI,EAAM,GAAG5H,KAAc0H,EAAK,GAAID,EAAU1E,GAGxEuB,EAAOsD,EAAM,GACbA,EAAM,GAAKC,EAAM,GACjBA,EAAM,GAAKvD,EACXuD,EAAM,GAAG7H,KAAO6H,EAAM,GAAG7H,KAGzB,IAAMiH,EAAQW,EAAM,GAA2BX,KAO/C,OANA3C,EAyBG,SACHsD,EACAF,EACAD,EACA1E,GAEA,IAAMxE,EAAO,GAET+F,EAAO/F,EACX,EAAG,CACC,IAAMuE,IAAUC,EAAU6E,EAAM,GAAG/H,MAAO+H,EAAM,GAAG/H,OAAS,GAC5DyE,EAAKtE,KAAO4H,EAAM9E,GACd2E,IACCnD,EAAKtE,KAA6BiH,KAAO3C,GAE9CA,EAAOA,EAAKtE,KACZ4H,EAAM9E,GAASwB,EAAKtE,OAClB0H,EAAK5E,SACF4E,EAAK,GAAK,GAAKA,EAAK,GAAK,GAOlC,OAJApD,EAAKtE,KAAO4H,IAAQF,EAAK,GAAK,IAC1BD,GAAYnD,EAAKtE,OAChBsE,EAAKtE,KAA6BiH,KAAO3C,GAEvC/F,EAAKyB,KAlDL8H,CAAkBF,EAAOF,EAAMD,EAAU1E,GAC5C0E,IACCnD,EAA6B2C,KAAOA,GAIlC,CAAC3C,EAAMuD,IAAQH,EAAK,GAAK,K,+qBCiM9B/H,OAAOY,SA9ON,I,GAAMwH,GAAb,WAcI,WAAYzF,I,4FAAwB,yDAChCmC,KAAKtE,OAAS,EACdsE,KAAKlG,KAAO,GACZkG,KAAKlG,KAAK0I,KAAOxC,KAAKlG,KAAKyB,KAAOyE,KAAKlG,KACvCkG,KAAKuD,QAAQvD,KAAKlG,KAAM+D,UAAY,I,QAlB5C,O,EAAA,G,EAAA,kBAqBI,SAAIQ,EAAejD,GACf,GAAIiD,EAAQ,GAAKA,EAAQ2B,KAAKtE,OAC1B,OAAOsE,KAAKtE,OAEhB,IAAM8G,EAAOxC,KAAKwD,KAAKnF,EAAQ,GACzBwB,EAAO,CAAEtE,KAAMiH,EAAKjH,KAAMiH,OAAMpH,SAGtC,OAFAoH,EAAKjH,KAAOsE,EACZA,EAAKtE,KAAMiH,KAAO3C,IACTG,KAAKtE,SA7BtB,oBAgCI,SAAO2C,EAAeR,GAIlB,OAHIQ,GAAS,GAAKA,GAAS2B,KAAKtE,QAC5BsE,KAAKuD,QAAQvD,KAAKwD,KAAKnF,GAAQR,GAE5BmC,KAAKtE,SApCpB,mBAuCI,WACIsE,KAAKtE,OAAS,EACdsE,KAAKlG,KAAK0I,KAAOxC,KAAKlG,KAAKyB,KAAOyE,KAAKlG,OAzC/C,oBA4CI,WAAqD,IACjD,IAAMmE,EAAM,IAAIqF,EAAiBtD,MADgB,mBAA3Cf,EAA2C,yBAA3CA,EAA2C,gBAEjD,cAAmBA,EAAnB,eAA0B,CAArB,IAAME,EAAI,KACXlB,EAAIgC,OAAOhC,EAAIoC,KAAMlB,GAEzB,OAAOlB,IAjDf,wBAoDI,SAAWI,EAAe1B,EAAcC,GAAoB,QAIxD,GAFAyB,EAAQ5B,EAAMK,EAASuB,EAAO,EAAG2B,KAAKtE,QAAS,EAAGsE,KAAKtE,SACvDiB,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,WAC5C2C,EACR,OAAO2B,KAMX,GAFApD,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,QAE9DiB,IADJC,EAAMD,EAAME,KAAKF,IAAIC,EAAMD,EAAKqD,KAAKtE,OAAS2C,IAE1C,OAAO2B,KAIX,GAAIrD,EAAM0B,GAASA,EAAQzB,EAAK,CAC5B,IAAI6G,EAAQzD,KAAKwD,KAAK5G,GAClB8G,EAAQ1D,KAAKwD,KAAKnF,GAASzB,EAAMD,IACrC,GACI8G,EAAQA,EAAMjB,MACdkB,EAAQA,EAAMlB,MACRpH,MAAQqI,EAAMrI,cACbuB,EAAMC,GACjB,OAAOoD,KAIX,IAAIyD,EAAQzD,KAAKwD,KAAK7G,GAClB+G,EAAQ1D,KAAKwD,KAAKnF,GACtB,GACIqF,EAAMtI,MAAQqI,EAAMrI,MACpBqI,EAAQA,EAAMlI,KACdmI,EAAQA,EAAMnI,aACPoB,EAAMC,GACjB,OAAOoD,OAvFf,kBA0FI,SAAKE,EAAYvD,EAAcC,GAAoB,QAG/C,IAFAD,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,UACxDkB,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,SACnD,CACX,IAAImE,EAAOG,KAAKwD,KAAK7G,GACrB,GACIkD,EAAKzE,MAAQ8E,EACbL,EAAOA,EAAKtE,aACLoB,EAAMC,GAErB,OAAOoD,OApGf,iBAuGI,SAAI3B,GACA,OAAOA,EAAQ,GAAKA,GAAS2B,KAAKtE,YAASC,EAAYqE,KAAKwD,KAAKnF,GAAOjD,QAxGhF,oBA2GI,SAAOiD,EAAekE,GAClB,KAAIlE,EAAQ,GAAKA,GAAS2B,KAAKtE,QAA/B,CAGA,IAAMmE,EAAOG,KAAKwD,KAAKnF,GACjBjD,EAAQyE,EAAKzE,MAEnB,OADAyE,EAAKzE,MAAQmH,EAAS1C,EAAKzE,OACpBA,KAlHf,iBAqHI,WACI,KAAI4E,KAAKtE,OAAS,GAAlB,CAGA,IAAM+D,EAAOO,KAAKlG,KAAK0I,KAIvB,OAHA/C,EAAK+C,KAAMjH,KAAOyE,KAAKlG,KACvBkG,KAAKlG,KAAK0I,KAAO/C,EAAK+C,OACpBxC,KAAKtE,OACA+D,EAAKrE,SA7HpB,kBAgII,SAAKA,GACD,IAAMoH,EAAOxC,KAAKlG,KAAK0I,KACjB3C,EAAO,CAAEtE,KAAMyE,KAAKlG,KAAM0I,OAAMpH,SAEtC,OADAoH,EAAKjH,KAAOyE,KAAKlG,KAAK0I,KAAO3C,IACpBG,KAAKtE,SApItB,oBAuII,SAAO2C,GACH,KAAIA,EAAQ,GAAKA,GAAS2B,KAAKtE,QAA/B,CAGA,IAAMmE,EAAOG,KAAKwD,KAAKnF,GAIvB,OAHAwB,EAAK2C,KAAMjH,KAAOsE,EAAKtE,KACvBsE,EAAKtE,KAAMiH,KAAO3C,EAAK2C,OACrBxC,KAAKtE,OACAmE,EAAKzE,SA/IpB,qBAkJI,SAAQuB,EAAcC,GAAoB,QAGtC,GAFAD,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,SACxDkB,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,SACxDiB,EAAM,EACZ,OAAOqD,KAEX,IAAMlG,EAAOkG,KAAKwD,KAAK7G,EAAM,GACvB8C,EAAO3F,EAAKyB,KACdsE,EAAOJ,EACX,EAAG,CACC,IAAMsB,EAAOlB,EAAKtE,KAClBsE,EAAKtE,KAAOsE,EAAK2C,KACjB3C,EAAK2C,KAAOzB,EACZjH,EAAKyB,KAAOsE,EACZA,EAAOkB,UACApE,EAAMC,GAIjB,OAHA6C,EAAKlE,KAAOsE,EACZA,EAAK2C,KAAO/C,EACZ3F,EAAKyB,KAAMiH,KAAO1I,EACXkG,OArKf,iBAwKI,SAAI3B,EAAe6B,GACf,KAAI7B,EAAQ,GAAKA,GAAS2B,KAAKtE,QAA/B,CAGA,IAAMmE,EAAOG,KAAKwD,KAAKnF,GACjBjD,EAAQyE,EAAKzE,MAEnB,OADAyE,EAAKzE,MAAQ8E,EACN9E,KA/Kf,mBAkLI,WACI,KAAI4E,KAAKtE,OAAS,GAAlB,CAGA,IAAMiI,EAAO3D,KAAKlG,KAAKyB,KAIvB,OAHAoI,EAAKpI,KAAMiH,KAAOxC,KAAKlG,KACvBkG,KAAKlG,KAAKyB,KAAOoI,EAAKpI,OACpByE,KAAKtE,OACAiI,EAAKvI,SA1LpB,gBA6LI,WACI,OAAO4E,KAAKtE,SA9LpB,mBAiMI,SAAMiB,EAAcC,GAChB,OAAO,IAAI0G,EAAiBtD,KAAK4D,KAAKjH,EAAKC,MAlMnD,oBAqMI,SAAOe,EAAgBC,EAAgBC,GAAiC,QACpEF,EAAQlB,EAAMK,EAAQ,UAACa,SAAD,QAAU,EAAG,EAAGqC,KAAKtE,QAAS,EAAGsE,KAAKtE,QAC5DkC,EAAQnB,EAAK,UAACmB,SAAD,QAAUoC,KAAKK,KAAM,EAAGL,KAAKK,KAAO1C,GAGjD,IAAMwB,EAAO,IAAImE,EACjB,GAAgB,MAAZzF,GAAoBD,EAAQ,EAC5B,OAAOuB,EAKX,IADA,IAAIU,EAAOG,KAAKwD,KAAK7F,GACdC,KAAU,GACbuB,EAAKD,KAAKW,EAAKzE,OACfyE,EAAK2C,KAAMjH,KAAOsE,EAAKtE,KACvBsE,EAAKtE,KAAMiH,KAAO3C,EAAK2C,KACvB3C,EAAOA,EAAKtE,OACVyE,KAAKtE,OAMX,OAFAsE,KAAKuD,QAAQ1D,EAAMhC,UAAY,IAExBsB,IA5Nf,kBA+NI,SAAKb,GACD,GAAI0B,KAAKtE,OAAS,EAAG,CACjB,O,EAAqBqH,GAAgB/C,KAAKlG,KAAKyB,KAAOyE,KAAKtE,QAAQ,EAAM4C,G,EAAzE,E,oiBAAOqF,EAAP,KAAalE,EAAb,KACAO,KAAKlG,KAAKyB,KAAOoI,EACjBlE,EAAKlE,KAAMiH,KAAO/C,E,QAEtB,OAAOO,OArOf,uCA8OI,mGACaH,EAAOG,KAAKlG,KAAKyB,KAD9B,UACqCsE,IAASG,KAAKlG,KADnD,gBAEQ,OAFR,SAEc+F,EAAKzE,MAFnB,OACyDyE,EAAOA,EAAKtE,KADrE,+DA9OJ,qBAoPI,SAAQH,GACJ,IAAMuI,EAAO3D,KAAKlG,KAAKyB,KACjBsE,EAAO,CAAEtE,KAAMoI,EAAMnB,KAAMxC,KAAKlG,KAAMsB,SAE5C,OADA4E,KAAKlG,KAAKyB,KAAOoI,EAAKnB,KAAO3C,IACpBG,KAAKtE,SAxPtB,oBAkQI,SACIiB,EACAC,EACA2F,GACI,QAYJ,GAXgB,MAAZA,IACIM,UAAUnH,OAAS,GACnB6G,EAAW5F,EACXA,OAAMhB,IAEN4G,EAAW3F,EACXA,OAAMjB,KAGdgB,EAAMF,EAAMK,EAAQ,QAAE,EAAAH,SAAF,QAAoB,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,UACpEkB,EAAMH,EAAMK,EAAQ,QAAE,EAAAF,SAAF,QAAoBoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,SAC/D,CACX,IAAImE,EAAOG,KAAKwD,KAAK7G,GACrB,GACIkD,EAAKzE,MAAQmH,EAAS1C,EAAKzE,MAAOuB,GAClCkD,EAAOA,EAAKtE,aACLoB,EAAMC,GAErB,OAAOoD,OAzRf,2CA4RI,WAAMrD,EAAcC,GAApB,uGACID,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,UAIpDoH,EADO,MAAPlG,EACM,kBAAM,EAAKlB,QACVkB,GAAO,EACR,kBAAMA,GAEN,kBAAM,EAAKlB,OAASkB,OATlC,gBAaYiD,EAAOG,KAAKwD,KAAK7G,GAb7B,OAeY,OAfZ,SAekBkD,EAAKzE,MAfvB,OAgBYyE,EAAOA,EAAKtE,KAhBxB,YAiBmBoB,EAAMmG,KAASjD,IAASG,KAAKlG,KAjBhD,gEA5RJ,qBAmTI,SAAkByB,EAA2BsC,GACzC,IADsE,EAClE2E,EAAOjH,EAAKiH,KADsD,E,gmBAAA,CAElD3E,GAFkD,IAEtE,2BAA8B,KACpBgC,EAAO,CAAE2C,OAAMpH,MADK,SAE1BoH,EAAKjH,KAAOsE,EACZ2C,EAAO3C,IACLG,KAAKtE,QAN2D,8BAQtE8G,EAAKjH,KAAOA,EACZA,EAAKiH,KAAOA,IA5TpB,kBAuUI,SAAenE,GACX,IAAIwB,EAAOG,KAAKlG,KAChB,GAAIuE,EAAQ2B,KAAKtE,OAAS,EACtB,KAAO2C,MAAW,GACdwB,EAAOA,EAAKtE,UAGhB,IAAK8C,EAAQ2B,KAAKtE,OAAS2C,EAAOA,EAAQ,IAAKA,EAC3CwB,EAAOA,EAAK2C,KAGpB,OAAO3C,O,kBAlVf,K,+qBCsPM3E,OAAOY,SAxPN,I,GAAM+H,GAAb,WAkBI,WAAYhG,I,4FAAwB,gFAChCmC,KAAKtE,OAAS,EACdsE,KAAKlG,KAAO,GACZkG,KAAKlG,KAAKyB,KAAOyE,KAAKlG,KACtBkG,KAAKP,KAAOO,KAAKuD,QAAQvD,KAAKlG,KAAM+D,UAAY,I,QAtBxD,O,EAAA,G,EAAA,kBAyBI,SAAIQ,EAAejD,GACf,GAAIiD,GAAS,GAAKA,EAAQ2B,KAAKtE,OAAQ,CACnC,IAAM8G,EAAOxC,KAAKwD,KAAKnF,EAAQ,GAC/BmE,EAAKjH,KAAO,CAAEH,QAAOG,KAAMiH,EAAKjH,QAC9ByE,KAAKtE,YACA2C,IAAU2B,KAAKtE,QACtBsE,KAAKd,KAAK9D,GAEd,OAAO4E,KAAKtE,SAjCpB,oBAoCI,SAAO2C,EAAeR,GAMlB,OALIQ,GAAS,GAAKA,EAAQ2B,KAAKtE,OAC3BsE,KAAKuD,QAAQvD,KAAKwD,KAAKnF,EAAQ,GAAIR,GAC5BQ,IAAU2B,KAAKtE,SACtBsE,KAAKP,KAAOO,KAAKuD,QAAQvD,KAAKP,KAAM5B,IAEjCmC,KAAKtE,SA1CpB,mBA6CI,WACIsE,KAAKtE,OAAS,EACdsE,KAAKP,KAAOO,KAAKlG,KAAKyB,KAAOyE,KAAKlG,OA/C1C,oBAkDI,WAA+C,IAC3C,IAAMmE,EAAM,IAAI4F,EAAW7D,MADgB,mBAArCf,EAAqC,yBAArCA,EAAqC,gBAE3C,cAAmBA,EAAnB,eAA0B,CAArB,IAAME,EAAI,KACXlB,EAAIgC,OAAOhC,EAAIoC,KAAMlB,GAEzB,OAAOlB,IAvDf,wBA0DI,SAAWI,EAAe1B,EAAcC,GAAoB,QAIxD,GAFAyB,EAAQ5B,EAAMK,EAASuB,EAAO,EAAG2B,KAAKtE,QAAS,EAAGsE,KAAKtE,SACvDiB,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,WAC5C2C,EACR,OAAO2B,KAMX,GAFApD,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,QAE9DiB,IADJC,EAAMD,EAAME,KAAKF,IAAIC,EAAMD,EAAKqD,KAAKtE,OAAS2C,IAE1C,OAAO2B,KAIX,GAAI3B,EAAQ1B,EAAK,CACb,IAAMkD,EAAOG,KAAKwD,KAAKnF,EAAQ,GAE/B,OADA2B,KAAK8D,YAAY9D,KAAKwD,KAAK7G,EAAM0B,EAAQ,EAAGwB,GAAOA,EAAMjD,EAAMD,GACxDqD,KAIX,GAAI3B,EAAQzB,EAAK,CACb,IAAMiD,EAAOG,KAAKwD,KAAK7G,EAAM,GAE7B,OADAqD,KAAK8D,YAAYjE,EAAMG,KAAKwD,KAAKnF,EAAQ1B,EAAM,EAAGkD,GAAOjD,EAAMD,GACxDqD,KAIX,IAAMyD,EAAQzD,KAAKwD,KAAK7G,EAAM,GACxBoH,EAAQ/D,KAAKwD,KAAK5G,EAAMD,EAAM,EAAG8G,GACjCO,EAAQhE,KAAK8D,YAAYL,EAAOM,EAAO1F,EAAQ1B,GACjD0B,GAASzB,EAAMD,IAAQqD,KAAKtE,SAC5BsE,KAAKP,KAAOsE,GAEhB,IAAMhD,EAAO0C,EAAMlI,KAInB,OAHAkI,EAAMlI,KAAOwI,EAAMxI,KACnBwI,EAAMxI,KAAOyI,EAAMzI,KACnByI,EAAMzI,KAAOwF,EACNf,OAlGf,kBAqGI,SAAKE,EAAYvD,EAAcC,GAAoB,QAG/C,IAFAD,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,UACxDkB,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,SACnD,CACX,IAAImE,EAAOG,KAAKwD,KAAK7G,GACrB,GACIkD,EAAKzE,MAAQ8E,EACbL,EAAOA,EAAKtE,aACLoB,EAAMC,GAErB,OAAOoD,OA/Gf,iBAkHI,SAAI3B,GACA,KAAIA,EAAQ,GAAKA,GAAS2B,KAAKtE,QAG/B,OAAO2C,EAAQ2B,KAAKtE,OAAS,EAAIsE,KAAKwD,KAAKnF,GAAOjD,MAAQ4E,KAAKP,KAAKrE,QAtH5E,oBAyHI,SAAOiD,EAAekE,GAClB,KAAIlE,EAAQ,GAAKA,GAAS2B,KAAKtE,QAA/B,CAGA,IAAMmE,EAAOxB,EAAQ2B,KAAKtE,OAAS,EAAIsE,KAAKwD,KAAKnF,GAAS2B,KAAKP,KACzDrE,EAAQyE,EAAKzE,MAEnB,OADAyE,EAAKzE,MAAQmH,EAAS1C,EAAKzE,OACpBA,KAhIf,iBAmII,WACI,KAAI4E,KAAKtE,OAAS,GAAlB,CAGA,IAAMN,EAAQ4E,KAAKP,KAAKrE,MAIxB,OAHA4E,KAAKP,KAAOO,KAAKwD,KAAKxD,KAAKtE,OAAS,GACpCsE,KAAKP,KAAKlE,KAAOyE,KAAKlG,OACpBkG,KAAKtE,OACAN,KA3If,kBA8II,SAAKA,GACD,IAAMqE,EAAsB,CAAElE,KAAMyE,KAAKlG,KAAMsB,SAG/C,OAFA4E,KAAKP,KAAKlE,KAAOkE,EACjBO,KAAKP,KAAOA,IACHO,KAAKtE,SAlJtB,oBAqJI,SAAO2C,GACH,KAAIA,EAAQ,GAAKA,GAAS2B,KAAKtE,QAA/B,CAGA,IAAM8G,EAAOxC,KAAKwD,KAAKnF,EAAQ,GACzBwB,EAAO2C,EAAKjH,KAKlB,OAJAiH,EAAKjH,KAAOsE,EAAKtE,KACb8C,MAAY2B,KAAKtE,SACjBsE,KAAKP,KAAO+C,GAET3C,EAAKzE,SA/JpB,qBAkKI,SAAQuB,EAAcC,GAAoB,QAGtC,GAFAD,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,SACxDkB,EAAMH,EAAMK,EAAQ,UAACF,SAAD,QAAQoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,SACxDiB,EAAM,EACZ,OAAOqD,KAEX,IAAMlG,EAAOkG,KAAKwD,KAAK7G,EAAM,GAC7BqD,KAAKP,KAAO7C,GAAOoD,KAAKtE,OAAS5B,EAAKyB,KAAQyE,KAAKP,KAInD,IAHA,IAAMA,EAAO3F,EAAKyB,KACdiH,EAAO/C,EACPI,EAAOJ,EAAKlE,OACPoB,EAAMC,GAAK,CAChB,IAAMrB,EAAOsE,EAAKtE,KAClBsE,EAAKtE,KAAOiH,EACZA,EAAO3C,EACPA,EAAOtE,EAIX,OAFAzB,EAAKyB,KAAOiH,EACZ/C,EAAKlE,KAAOsE,EACLG,OArLf,iBAwLI,SAAI3B,EAAe6B,GACf,KAAI7B,EAAQ,GAAKA,GAAS2B,KAAKtE,QAA/B,CAGA,IAAMmE,EAAOG,KAAKwD,KAAKnF,GACjBjD,EAAQyE,EAAKzE,MAEnB,OADAyE,EAAKzE,MAAQ8E,EACN9E,KA/Lf,mBAkMI,WACI,OAAO4E,KAAKiE,OAAO,KAnM3B,gBAsMI,WACI,OAAOjE,KAAKtE,SAvMpB,mBA0MI,SAAMiB,EAAcC,GAChB,OAAO,IAAIiH,EAAW7D,KAAK4D,KAAKjH,EAAKC,MA3M7C,oBA8MI,SAAOe,EAAgBC,EAAgBC,GAAiC,QACpEF,EAAQlB,EAAMK,EAAQ,UAACa,SAAD,QAAU,EAAG,EAAGqC,KAAKtE,QAAS,EAAGsE,KAAKtE,QAC5DkC,EAAQnB,EAAK,UAACmB,SAAD,QAAUoC,KAAKK,KAAM,EAAGL,KAAKK,KAAO1C,GAGjD,IAAMuG,EAAU,IAAIL,EACpB,GAAgB,MAAZhG,GAAoBD,EAAQ,EAC5B,OAAOsG,EAMX,IAFA,IAAI1B,EAAOxC,KAAKwD,KAAK7F,EAAQ,GACvBwG,EAAUxG,EAAQC,GAASoC,KAAKK,KAC/BzC,KAAU,GAAG,CAChB,IAAMiC,EAAO2C,EAAKjH,KAClB2I,EAAQhF,KAAKW,EAAKzE,OAClBoH,EAAKjH,KAAOsE,EAAKtE,OACfyE,KAAKtE,OAOX,OAHA8G,EAAOxC,KAAKuD,QAAQf,EAAM3E,UAAY,IACtCmC,KAAKP,KAAO0E,EAAU3B,EAAOxC,KAAKP,KAE3ByE,IAtOf,kBAyOI,SAAK5F,GACD,GAAI0B,KAAKtE,OAAS,EAAG,CACjB,O,EAAqBqH,GAAgB/C,KAAKlG,KAAKyB,KAAOyE,KAAKtE,QAAQ,EAAO4C,G,EAA1E,E,oiBAAOqF,EAAP,KAAalE,EAAb,KACAO,KAAKlG,KAAKyB,KAAOoI,EACjB3D,KAAKP,KAAOA,E,QAEhB,OAAOO,OA/Of,uCAwPI,mGACaH,EAAOG,KAAKlG,KAAKyB,KAD9B,UACqCsE,IAASG,KAAKlG,KADnD,gBAEQ,OAFR,SAEc+F,EAAKzE,MAFnB,OACyDyE,EAAOA,EAAKtE,KADrE,+DAxPJ,qBA8PI,SAAQH,GACJ,OAAO4E,KAAKoE,IAAI,EAAGhJ,KA/P3B,oBAyQI,SACIuB,EACAC,EACA2F,GACI,QAYJ,GAXgB,MAAZA,IACIM,UAAUnH,OAAS,GACnB6G,EAAW5F,EACXA,OAAMhB,IAEN4G,EAAW3F,EACXA,OAAMjB,KAGdgB,EAAMF,EAAMK,EAAQ,QAAE,EAAAH,SAAF,QAAoB,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,UACpEkB,EAAMH,EAAMK,EAAQ,QAAE,EAAAF,SAAF,QAAoBoD,KAAKtE,OAAQ,EAAGsE,KAAKtE,QAAS,EAAGsE,KAAKtE,SAC/D,CACX,IAAImE,EAAOG,KAAKwD,KAAK7G,GACrB,GACIkD,EAAKzE,MAAQmH,EAAS1C,EAAKzE,MAAOuB,GAClCkD,EAAOA,EAAKtE,aACLoB,EAAMC,GAErB,OAAOoD,OAhSf,2CAmSI,WAAMrD,EAAcC,GAApB,uGACID,EAAMF,EAAMK,EAAQ,UAACH,SAAD,QAAQ,EAAG,EAAGqD,KAAKtE,QAAS,EAAGsE,KAAKtE,UAIpDoH,EADO,MAAPlG,EACM,kBAAM,EAAKlB,QACVkB,GAAO,EACR,kBAAMA,GAEN,kBAAM,EAAKlB,OAASkB,OATlC,gBAaYiD,EAAOG,KAAKwD,KAAK7G,GAb7B,OAeY,OAfZ,SAekBkD,EAAKzE,MAfvB,OAgBYyE,EAAOA,EAAKtE,KAhBxB,YAiBmBoB,EAAMmG,KAASjD,IAASG,KAAKlG,KAjBhD,gEAnSJ,qBAwTI,SAAkB0I,EAAqB3E,GACnC,IADyE,EACnEtC,EAAOiH,EAAKjH,KADuD,E,gmBAAA,CAErDsC,GAFqD,IAEzE,2BAA8B,KACpBgC,EAAO,CAAEzE,MADW,SAE1BoH,EAAKjH,KAAOsE,EACZ2C,EAAO3C,IACLG,KAAKtE,QAN8D,8BASzE,OADA8G,EAAKjH,KAAOA,EACLiH,IAjUf,yBA0UI,SAAsBtB,EAAqBJ,EAAmBlD,GAC1D,KAAOA,KAAU,GACbsD,EAAOA,EAAK3F,MACZuF,EAAKA,EAAGvF,MACLH,MAAQ8F,EAAK9F,MAEpB,OAAO0F,IAhVf,kBAyVI,SAAezC,GAEX,IAF0E,IAAhDvE,EAAgD,uDAA1BkG,KAAKlG,KACjD+F,EAAO/F,EACJuE,MAAW,GACdwB,EAAOA,EAAKtE,KAEhB,OAAOsE,O,kBA9Vf,KCAO,SAASwE,GAAQ9E,GAEpB,IADA,IAAIC,EAAI,EACDD,KACDC,EACFD,GAAKA,EAAI,EAEb,OAAOC,EAWJ,SAAS8E,GAAO/E,GACnB,IAAMC,EAAI+E,GAAIhF,GACd,OAAOiF,GAAIjF,GAAKC,EAAKA,EAAI,IAStB,SAASiF,GAAOlF,GACnB,OAAyB,IAAjBA,EAAKA,EAAI,GASd,SAASmF,GAAInF,GAChB,IAAIC,GAAK,EACT,IAAKD,EAAIoF,GAAIpF,GAAIA,EAAGA,KAAO,IACrBC,EAEN,OAAOA,EASJ,SAASmF,GAAIpF,GAChB,OAAOiF,GAAIjF,GAAKA,GASb,SAASqF,GAAKrF,GACjB,OAAOiF,GAAIjF,EAAKoF,GAAIpF,EAAIoF,GAAIpF,IAAM,GAoB/B,SAASsF,GAAItF,GAEhB,IADA,IAAIC,GAAK,EACI,IAAND,KACDC,EACFD,KAAO,EAEX,OAAOC,EASJ,SAAS+E,GAAIhF,GAEhB,IADA,IAAIC,EAAID,GAAKA,EACNA,GAAKC,GAERA,GADAD,GAAKC,IACID,EAEb,OAAOiF,GAAIhF,GASR,SAASsF,GAAKvF,GAEjB,IADA,IAAIC,EAAID,GAAKA,EACNA,EAAKA,EAAIC,GAEZA,GADAD,GAAKC,IACID,EAEb,OAAOiF,GAAIjF,GASR,SAASwF,GAAQxF,GAKpB,OAAOiF,IADPjF,GAAU,YADVA,GAAU,YADVA,GAAU,YADVA,GAAU,WAAJA,KAAoB,GAAW,WAAJA,IAAmB,MAC1B,GAAW,UAAJA,IAAmB,MAC1B,GAAW,UAAJA,IAAmB,MAC1B,GAAW,SAAJA,IAAmB,KAClC,GAAOA,GAAK,IAO3B,SAASiF,GAAIjF,GAChB,OAAOA,IAAM,E,0KCzGZrE,OAAOY,SAxCL,I,GAAMkJ,GAAb,WAUI,WAAYnH,G,qGAAwB,S,OAAA,G,EAAA,gB,sBAAA,K,uDAAA,K,KAChCmC,KAAKtC,MAAQG,EAAWT,MAAM8D,KAAKrD,GAAY,G,QAXvD,O,EAAA,G,EAAA,oBAcI,WACImC,KAAKtC,MAAMhC,OAAS,IAf5B,qBAkBI,WACI,OAAOsE,KAAKK,KAAO,OAAI1E,EAAYqE,KAAKtC,MAAM+E,UAnBtD,qBAsBI,SAAQvC,GACJ,OAAOF,KAAKtC,MAAMwB,KAAKgB,KAvB/B,kBA0BI,WACI,OAAOF,KAAKK,KAAO,OAAI1E,EAAYqE,KAAKtC,MAAM,KA3BtD,gBA8BI,WACI,OAAOsC,KAAKtC,MAAMhC,SA/B1B,cAwCI,WACI,OAAOsE,KAAKtC,MAAMxC,OAAOY,iB,kBAzCjC,K,0KCyCKZ,OAAOY,SAxCL,I,GAAMmJ,GAAb,WAUI,WAAYpH,G,qGAAwB,S,OAAA,G,EAAA,e,sBAAA,K,uDAAA,K,OAChCmC,KAAKb,KAAO,IAAI0E,GAAWhG,G,QAXnC,O,EAAA,G,EAAA,oBAcI,WACImC,KAAKb,KAAK+F,UAflB,qBAkBI,WACI,OAAOlF,KAAKb,KAAKsD,UAnBzB,qBAsBI,SAAQvC,GACJ,OAAOF,KAAKb,KAAKD,KAAKgB,KAvB9B,kBA0BI,WACI,OAAOF,KAAKb,KAAKvE,IAAI,KA3B7B,gBA8BI,WACI,OAAOoF,KAAKb,KAAKkB,OA/BzB,cAwCI,WACI,OAAOL,KAAKb,KAAKjE,OAAOY,iB,kBAzChC,K,6eC2GMZ,OAAOY,SA/FN,I,GAAMqJ,GAAb,WAqBI,WAAYC,GAAmD,IAA5BvH,EAA4B,uDAAJ,GAAI,6DAC3DmC,KAAKtC,MAAQ,GACbsC,KAAKoF,QAAUA,EACfpF,KAAKqF,MAAMxH,G,QAxBnB,O,EAAA,G,EAAA,oBA2BI,WACImC,KAAKtC,MAAMhC,OAAS,IA5B5B,iBA+BI,WAEI,KAAIsE,KAAKK,KAAO,GAAhB,CAMA,IADA,IAAM1B,EAAIqB,KAAKtC,MAAMhC,OAAS,EACrB4J,EAAO,EAAG3G,EAAI2G,EAAMA,GAAQ,EACjCtF,KAAKtC,MAAMiB,EAAI2G,GAAQtF,KAAKtC,MAAMiB,EAAI2G,GAAQA,IAAS,IAI3D,IAAMrH,EAAM+B,KAAKtC,MAAMiB,EAAI,GAE3B,OADAqB,KAAKtC,MAAMhC,QAAU,EACduC,KA9Cf,kBAiDI,SAAKiC,GAED,GAAIF,KAAKK,MAAQ8E,EAAmBI,SAChC,MAAM,IAAIrH,WAAJ,kBAIV,IAAMS,EAAIqB,KAAKtC,MAAMhC,OAGrB,OAFAsE,KAAKtC,MAAMiB,EAAI,GAAKqB,KAAKwF,IAAI7G,EAAGuB,GAEzBF,KAAKK,OA3DpB,mBA8DI,SAAM1D,EAAaC,GAEf,GAAID,GAAOC,EACP,MAAM,IAAIsB,WAAJ,iBAAyBvB,EAAzB,aAAiCC,EAAjC,eAEV,GAAID,EAAM,GAAKC,EAAMoD,KAAKK,KACtB,MAAM,IAAInC,WAAJ,iBAAyBvB,EAAzB,aAAiCC,EAAjC,wBAAoDoD,KAAKK,KAAzD,MAQV,IAAIoF,EAASd,IAJbhI,GAAO,GAIgB4H,IAHvB3H,GAAO,GAG0BD,IAC7BvB,EAAQ4E,KAAKtC,MAAMf,EAAM,GAAK8I,IAAW,IAG7C,IAAK9I,GAAO8I,EAAQ9I,EAAMC,EAAKD,GAAO8I,EAClCA,EAASd,GAAIhI,EAAM4H,GAAI3H,EAAMD,IAC7BvB,EAAQ4E,KAAKoF,QAAQhK,EAAO4E,KAAKtC,MAAMf,EAAM,GAAK8I,IAAW,KAGjE,OAAOrK,IArFf,gBAwFI,WACI,OAAO4E,KAAKtC,MAAMhC,SAAW,IAzFrC,uCA+FI,mGACaiD,EAAI,EADjB,YACoBA,EAAIqB,KAAKtC,MAAMhC,QADnC,gBAEQ,OAFR,SAEcsE,KAAKtC,MAAMiB,GAFzB,OAC2CA,GAAK,EADhD,+DA/FJ,oBAqGI,SAAOhC,EAAaC,EAAa8I,GAE7B,KAAI/I,GAAOC,GAAX,CAGA,GAAID,EAAM,GAAKC,EAAMoD,KAAKK,KACtB,MAAM,IAAInC,WAAJ,iBAAyBvB,EAAzB,aAAiCC,EAAjC,wBAAoDoD,KAAKK,KAAzD,MAQV,IAAIjF,EAJJuB,GAAO,EACPC,GAAO,EAIP,GACIxB,EAAQ4E,KAAKwF,IAAI7I,EAAK+I,EAAU1F,KAAKtC,MAAMf,GAAMA,IAAQ,IACzDA,GAAO,QACFA,EAAMC,GAGf,IAAI+I,EAAK,EACLC,EAAKjB,GAAIhI,GAEb,IADAC,EAAMiI,GAAIlI,EAAMqD,KAAKtC,MAAMhC,QAAUgJ,GAAI/H,KAClCA,EAAKC,EAAM,IAAKA,EACnBxB,EAAQ4E,KAAKoF,QAAQhK,EAAO4E,KAAKtC,MAAMf,GAAOiJ,IAAO,GAAKD,IAC1D3F,KAAKtC,MAAMf,GAAOvB,EAElBuB,GAAOiJ,GADPD,GAAMhJ,EAAO,EAAIiJ,KAAS,GAE1BA,GAAM,EAIV5F,KAAKtC,MAAMf,GAAOvB,KAtI1B,mBA6II,SAAgByC,GAAuB,Q,65BAAA,CACbA,GADa,IACnC,2BAAgC,KAArBqC,EAAqB,QAC5BF,KAAKd,KAAKgB,IAFqB,iCA7I3C,iBAqJI,SAAc7B,EAAe6B,GAEzBF,KAAKtC,MAAMW,KAAW6B,EAGtB,IAAK,IAAIoF,EAAO,EAAGjH,EAAQiH,EAAMA,GAAQ,EACrCpF,EAAUF,KAAKoF,QAAQpF,KAAKtC,MAAMW,EAAQiH,GAAQA,IAAS,IAAKpF,GAChEF,KAAKtC,MAAMW,EAAQiH,GAAQpF,EAG/B,OAAOA,O,kBA/Jf,K,64CAAaiF,G,WAM0BlI,IAAqB,G,GCyGtD/B,OAAOY,SAjHN,I,GAAM+J,GAAb,WA6BI,WAAYT,GAAmD,IAA5BvH,EAA4B,uDAAJ,GAAI,8GAC3DmC,KAAKtC,MAAQ,GACbsC,KAAKoF,QAAUA,EACfpF,KAAKtE,OAAS,EACdsE,KAAK8F,MAAQ,EACb9F,KAAKqF,MAAMxH,G,QAlCnB,O,EAAA,G,EAAA,oBAqCI,WACImC,KAAKtE,OAAS,EACdsE,KAAK8F,MAAQ,EACb9F,KAAKtC,MAAMhC,OAAS,IAxC5B,iBA2CI,WAEI,KAAIsE,KAAKtE,QAAUsE,KAAK8F,OAAxB,CAKA,IAAM7H,EAAM+B,KAAKtC,QAAQsC,KAAKtE,QAO9B,OAJIsE,KAAKtE,QAAWsE,KAAKtC,MAAMhC,OAAS,IAAO,GAC3CsE,KAAK+F,SAGF9H,KAzDf,kBA4DI,SAAKiC,GAEGF,KAAKtE,QAAUsE,KAAKtC,MAAMhC,QAC1BsE,KAAKgG,OAIThG,KAAKtC,MAAMsC,KAAKtE,UAAYwE,EAG5B,IAAK,IAAIvB,EAAIqB,KAAKtE,OAAY,EAAJiD,EAAOqB,KAAKtC,MAAMiB,EAAI,GAAKuB,EACjDA,EAAUF,KAAKoF,QAAQpF,KAAKtC,MAAMiB,EAAI,GAAIuB,GAC1CvB,KAAO,EAGX,OAAOqB,KAAKK,OA3EpB,mBA8EI,SAAM1D,EAAaC,GAEf,GAAID,GAAOC,EACP,MAAM,IAAIsB,WAAJ,iBAAyBvB,EAAzB,aAAiCC,EAAjC,eAEV,GAAID,EAAM,GAAKC,EAAMoD,KAAKK,KACtB,MAAM,IAAInC,WAAJ,iBAAyBvB,EAAzB,aAAiCC,EAAjC,wBAAoDoD,KAAKK,KAAzD,MAQV,IAAIoF,EAASd,IAJbhI,GAAOqD,KAAK8F,MAAQ,GAIGvB,IAHvB3H,GAAOoD,KAAK8F,MAAQ,GAGanJ,IAC7BvB,EAAW4E,KAAKtC,MAAMf,EAAM8I,EAAS,GAIzC,IAHA9I,GAAO8I,EAGA9I,EAAMC,GACT6I,EAASd,GAAIhI,EAAM4H,GAAI3H,EAAMD,IAC7BvB,EAAQ4E,KAAKoF,QAAQhK,EAAO4E,KAAKtC,MAAMf,EAAM8I,EAAS,IACtD9I,GAAO8I,EAGX,OAAOrK,IAvGf,gBA0GI,WACI,OAAO4E,KAAKtE,OAASsE,KAAK8F,QA3GlC,uCAiHI,mGACanH,EAAI,EADjB,YACoBA,EAAIqB,KAAKK,MAD7B,gBAEQ,OAFR,SAEcL,KAAKtC,MAAMsC,KAAK8F,MAAQnH,GAFtC,SACqCA,EADrC,+DAjHJ,oBAuHI,SAAOhC,EAAaC,EAAa8I,GAE7B,KAAI/I,GAAOC,GAAX,CAGA,GAAID,EAAM,GAAKC,EAAMoD,KAAKK,KACtB,MAAM,IAAInC,WAAJ,iBAAyBvB,EAAzB,aAAiCC,EAAjC,wBAAoDoD,KAAKK,KAAzD,MAIV1D,GAAOqD,KAAK8F,MACZlJ,GAAOoD,KAAK8F,MAGZ,IAAK,IAAInH,EAAIhC,EAAKgC,EAAI/B,IAAO+B,EACzBqB,KAAKtC,MAAMiB,GAAK+G,EAAU1F,KAAKtC,MAAMiB,GAAIA,EAAIqB,KAAK8F,OAItD9F,KAAKiG,UAAUtJ,EAAKC,MA1I5B,uBA+II,SAAoBD,EAAaC,KAE3BD,IACAC,EAGF,IAAK,IAAIsJ,EAAMlG,KAAKtE,OAAS,EAAGiB,EAAMC,EAAKsJ,KAAS,EAAG,CACnDtJ,GAAOA,EAAQA,EAAMsJ,IAAS,GAC9B,IAAK,IAAIvH,GAAW,EAANhC,KAAa,EAAGgC,EAAI/B,EAAK+B,GAAK,EACxCqB,KAAKtC,OAAOiB,IAAM,GAAK,GAAKqB,KAAKoF,QAAQpF,KAAKtC,MAAMiB,EAAI,GAAIqB,KAAKtC,MAAMiB,EAAI,IAE/EhC,KAAS,EACTC,KAAS,KA3JrB,mBAmKI,SAAgBiB,GACZ,IAAItD,OAA0BoB,EAG9B,GAAIwB,EAAQU,GACRtD,EAAM,aACH,KAAI4D,EAAaN,GAEjB,YACmBA,GADnB,IACH,2BAAgC,KAArBqC,EAAqB,QAC5BF,KAAKd,KAAKgB,IAFX,8BAIH,OALA3F,EAAM,OASV,IAAMsB,EAAagC,EAAiBtD,GAGpC,GAAIsB,EAAI,EAIJ,OAHAmE,KAAKtC,MAAMhC,OAAS,EACpBsE,KAAKtE,OAAS,OACdsE,KAAK8F,MAAQ,GAKjB,GAAIjK,GAAKgK,EAAsBN,SAC3B,MAAM,IAAIrH,WAAW,kBAIzB8B,KAAK8F,MAAQ,EAAIvB,GAAI1I,EAAI,GAAK,EAC9BmE,KAAKtE,OAASsE,KAAK8F,MACnB9F,KAAKtC,MAAMhC,OAAS,EAAIsE,KAAK8F,MAAQ,EAlCoB,WAqCnCjI,GArCmC,IAqCzD,2BAAgC,KAArBqC,EAAqB,QAC5BF,KAAKtC,MAAMsC,KAAKtE,UAAYwE,GAtCyB,8BA0CzDF,KAAKiG,UAAUjG,KAAK8F,MAAO9F,KAAKtE,UA7MxC,kBAkNI,WAEI,GAAIsE,KAAKK,KAAO,EACZL,KAAKtC,MAAMhC,OAAS,MADxB,CAMA,GAAIsE,KAAKK,MAAQwF,EAAsBN,SACnC,MAAM,IAAIrH,WAAW,kBAIzB8B,KAAKtC,MAAMhC,QAAUsE,KAAKtC,MAAMhC,OAAS,EAIzC,IADA,IAAIiB,EAAMqD,KAAK8F,MAAQ,EACdlJ,EAAMoD,KAAKtE,OAAS,EAAGiB,EAAMC,EAAKA,KAAS,EAChDoD,KAAKtC,MAAM4E,WAAW,EAAI3F,EAAM,EAAGA,EAAM,EAAGC,EAAM,GAClDD,KAAS,EAIbqD,KAAKtE,QAAUsE,KAAK8F,MAAQ,EAC5B9F,KAAK8F,OAAS9F,KAAK8F,MAAQ,KA1OnC,oBA+OI,WACI,IAAMpK,EAASsE,KAAKtE,OAASsE,KAAK8F,MAGlC,GAAIpK,EAAS,EAKT,OAJAsE,KAAKtC,MAAM4E,WAAW,EAAGtC,KAAK8F,MAAO9F,KAAKtE,QAC1CsE,KAAK8F,MAAQ,EACb9F,KAAKtE,OAASA,OACdsE,KAAKtC,MAAMhC,OAASA,GAKxB,IAAIiB,EAAMqD,KAAK8F,MAAQ,EACnBR,EAAOf,GAAI7I,GACfiB,EAAMA,EAAMgI,GAAIhI,EAAM2I,GAAQ,EAG9BtF,KAAK8F,QAAUrB,GAAO/I,GACtB,IAAK,IAAIkB,EAAMD,EAAM,EAAG2I,EAAMtF,KAAK8F,OAAS9F,KAAK8F,MAAQ,EACrD9F,KAAKtC,MAAM4E,WAAWtC,KAAK8F,MAAOnJ,EAAKC,GAEvCD,GAAOA,EAAM,EACbC,GAAOA,EAAM,MAAOlB,GAFpB4J,KAAU,IAE2B,GAIzCtF,KAAKtE,OAASsE,KAAK8F,MAAQpK,EAC3BsE,KAAKtC,MAAMhC,OAAS,EAAIsE,KAAK8F,MAAQ,O,kBA3Q7C,K,0KAAaD,G,YAM2B5I,EAAmB,GAAK,G,GCuB1D/B,OAAOY,SAxCN,I,GAAMqK,GAAb,WAUI,WAAYtI,G,qGAAwB,S,OAAA,G,EAAA,gB,sBAAA,K,uDAAA,K,KAChCmC,KAAKtC,MAAQG,EAAWT,MAAM8D,KAAKrD,GAAY,G,QAXvD,O,EAAA,G,EAAA,oBAcI,WACImC,KAAKtC,MAAMhC,OAAS,IAf5B,kBAkBI,WACI,OAAOsE,KAAKtC,MAAMsC,KAAKtC,MAAMhC,OAAS,KAnB9C,iBAsBI,WACI,OAAOsE,KAAKtC,MAAMgC,QAvB1B,kBA0BI,SAAKQ,GACD,OAAOF,KAAKtC,MAAMwB,KAAKgB,KA3B/B,gBA8BI,WACI,OAAOF,KAAKtC,MAAMhC,SA/B1B,uCAwCI,qGACUgC,EAAQsC,KAAKtC,MACViB,EAAIjB,EAAMhC,OAFvB,YAE+BiD,EAAI,GAFnC,uBAEsC,OAFtC,SAE4CjB,IAAQiB,GAFpD,yE,kBAxCJ,K,qRC4CKzD,OAAOY,SA3CL,I,GAAMsK,GAAb,WAUI,WAAYvI,G,qGAAwB,S,OAAA,G,EAAA,e,sBAAA,K,uDAAA,K,OAChCmC,KAAKb,KAAO,IAAI0E,GADgB,Q,65BAAA,CAEVhG,GAAY,IAFF,IAEhC,2BAAsC,KAA3BqC,EAA2B,QAClCF,KAAKd,KAAKgB,IAHkB,+B,QAVxC,O,EAAA,G,EAAA,oBAiBI,WACIF,KAAKb,KAAK+F,UAlBlB,kBAqBI,WACI,OAAOlF,KAAKb,KAAKvE,IAAI,KAtB7B,iBAyBI,WACI,OAAOoF,KAAKb,KAAKsD,UA1BzB,kBA6BI,SAAKvC,GACD,OAAOF,KAAKb,KAAKyD,QAAQ1C,KA9BjC,gBAiCI,WACI,OAAOF,KAAKb,KAAKkB,OAlCzB,cA2CI,WACI,OAAOL,KAAKb,KAAKjE,OAAOY,iB,kBA5ChC,K,8yCCgMMZ,OAAOY,SAlKN,I,GAAMuK,GAAb,WAmCI,WACI/H,EACAgI,EACAzI,GACF,O,4FAAA,gHACiC,kBAApByI,IACPzI,EAAWyI,EACXA,GAAkB,GAEtBtG,KAAKV,QAAUhB,EACf0B,KAAK6B,YAAcyE,EACnBtG,KAAKtE,OAAS,EACdsE,KAAKqF,MAAL,UAAWxH,SAAX,QAAuB,I,QA/C/B,O,EAAA,G,EAAA,kBAkDI,SAAIqC,GAEA,IAAMqG,EAAW,CAAEzG,KAAME,KAAKlG,MAC1B+G,EAA4B,CAAEK,KAAMqF,EAAUpF,MAAO,OAAQL,GAAId,KAAKlG,MACtE6G,EAAQiB,EAAY1B,EAAS,CAAE9E,MAAOyF,GAAQb,KAAKV,QAASU,KAAK6B,YAGrE,GAAsB,MAAlBlB,EAAMvF,MAAM0F,GACZ,OAAOd,KAKX,IAAImB,GADJN,EAAOF,EAAMvF,OACI+F,MAIjB,IAHAN,EAAKK,KAAMC,GAAU,CAAE2E,MAAO,EAAG1K,MAAO8E,GAGjCS,EAAMpF,OAETsF,GADAF,EAAQA,EAAMpF,MACDH,OACR0F,GAAKvE,GAAMiK,GAAK3F,EAAKC,KAC1BD,EAAKK,KAAOC,EAAQN,EAAKM,OAAWN,EAAKC,GAM7C,QAFEd,KAAKtE,OACPsE,KAAKlG,KAAOyM,EAASzG,KACdE,OA7Ef,mBAgFI,WACIA,KAAKlG,UAAO6B,EACZqE,KAAKtE,OAAS,IAlFtB,wBAqFI,WACI,OAAOsE,KAAKV,UAtFpB,oBAyFI,SAAOY,GAEH,IAAMqG,EAAW,CAAEzG,KAAME,KAAKlG,MAGxB2M,EAAUxC,GADFrC,EAAY1B,EAAS,CAAE9E,MADH,CAAE8F,KAAMqF,EAAUpF,MAAO,OAAQL,GAAId,KAAKlG,OACxBkG,KAAKV,QAAS,IAMlE,OAFAU,KAAKlG,KAAOyM,EAASzG,KACrBE,KAAKtE,SAAW+K,EACTA,IAnGf,iBAsGI,SAAIvG,GACA,OAAmD,MAA5CwB,EAAOxB,EAASF,KAAKlG,KAAMkG,KAAKV,WAvG/C,iBA0GI,WAAqB,MACjB,iBAAOmC,EAAUzB,KAAKlG,aAAtB,aAAO,EAAsBsB,QA3GrC,iBA8GI,WAAqB,MACjB,iBAAOkG,EAAStB,KAAKlG,aAArB,aAAO,EAAqBsB,QA/GpC,iBAkHI,WAAqB,MAEXmL,EAAW,CAAEzG,KAAME,KAAKlG,MAExB6G,EAAQa,EAAe,CAAEpG,MADG,CAAE8F,KAAMqF,EAAUpF,MAAO,OAAQL,GAAId,KAAKlG,QAEtEsB,EAAK,UAAGuF,EAAMvF,MAAM0F,UAAf,aAAG,EAAgB1F,MAGxBqL,EAAUxC,GAAOtD,GAKvB,OAFAX,KAAKlG,KAAOyM,EAASzG,KACrBE,KAAKtE,SAAW+K,EACTrL,IA/Hf,mBAkII,WAAuB,MAEbmL,EAAW,CAAEzG,KAAME,KAAKlG,MAExB6G,EAAQY,EAAc,CAAEnG,MADI,CAAE8F,KAAMqF,EAAUpF,MAAO,OAAQL,GAAId,KAAKlG,QAEtEsB,EAAK,UAAGuF,EAAMvF,MAAM0F,UAAf,aAAG,EAAgB1F,MAGxBqL,EAAUxC,GAAOtD,GAKvB,OAFAX,KAAKlG,KAAOyM,EAASzG,KACrBE,KAAKtE,SAAW+K,EACTrL,IA/If,gBAkJI,WACI,OAAO4E,KAAKtE,SAnJpB,6CAsJI,4GACuB8E,EAAgBR,KAAKlG,OAD5C,wDAEQ,OADO+F,EADf,iBAEcA,EAAKzE,MAFnB,qMAtJJ,uCAkKI,4GACuBqF,EAAiBT,KAAKlG,OAD7C,wDAEQ,OADO+F,EADf,iBAEcA,EAAKzE,MAFnB,qMAlKJ,oBAwKI,SAAOkF,EAAeC,GAClB,QAAIP,KAAK0G,OAAOpG,KACZN,KAAKoE,IAAI7D,IACF,KA3KnB,mBAgLI,SAAgB1F,GACZ,GAAIsC,EAAQtC,GACR,IAAK,IAAI8D,EAAI,EAAGA,EAAI9D,EAAIa,SAAUiD,EAC9BqB,KAAKoE,IAAIvJ,EAAI8D,SAEd,GAAI9D,aAAewL,GAAUrG,KAAKV,UAAYzE,EAAIyE,QACrDU,KAAKlG,KAAOsH,EAAMvG,EAAIf,MACtBkG,KAAKtE,OAASb,EAAIwF,SACf,YACmBxF,GADnB,IACH,2BAA2B,KAAhBqF,EAAgB,QACvBF,KAAKoE,IAAIlE,IAFV,qC,kBAxLf,KAkMO,SAAS+D,GAAUtD,GACtB,IAAIE,EAAOF,EAAMvF,MACbyE,EAAOgB,EAAKC,GAGhB,GAAY,MAARjB,EACA,OAAO,EAOX,IAHAc,EAAQD,EAAYC,GAGbA,EAAMpF,MAAM,aAGfsE,GADAgB,GADAF,EAAQA,EAAMpF,MACDH,OACD0F,GAGZ,IAAMgF,EAAQ,EAAIjJ,KAAKF,IAAL,oBAASkD,EAAKC,YAAd,aAAS,EAAWgG,aAApB,QAA6B,EAA7B,oBAAgCjG,EAAKR,aAArC,aAAgC,EAAYyG,aAA5C,QAAqD,GACnEA,EAAQjG,EAAKiG,QACbjG,EAAKiG,MAAQA,EACK,MAAdjG,EAAKR,OAAiByG,EAAQjG,EAAKR,MAAMyG,QACzCjG,EAAKR,MAAMyG,MAAQA,KAK3BjG,EAAO2G,GAAK3G,IACPR,MAAQmH,GAAK3G,EAAKR,OACL,MAAdQ,EAAKR,QACLQ,EAAKR,MAAMA,MAAQmH,GAAK3G,EAAKR,MAAMA,SAEvCQ,EAAOtD,GAAMsD,IACRR,MAAQ9C,GAAMsD,EAAKR,OAGxBwB,EAAKK,KAAML,EAAKM,OAAUN,EAAKC,GAAKjB,EAGxC,OAAO,EAQJ,SAAS2G,GAAQ3G,GACpB,GAAY,MAARA,GAA6B,MAAbA,EAAKC,MAAgBD,EAAKiG,OAASjG,EAAKC,KAAKgG,MAC7D,OAAOjG,EAEX,IAAMC,EAAOD,EAAKC,KAGlB,OAFAD,EAAKC,KAAOA,EAAKT,MACjBS,EAAKT,MAAQQ,EACNC,EAQJ,SAASvD,GAASsD,GACrB,GACY,MAARA,GACc,MAAdA,EAAKR,OACe,MAApBQ,EAAKR,MAAMA,OACXQ,EAAKiG,OAASjG,EAAKR,MAAMA,MAAMyG,MAE/B,OAAOjG,EAEX,IAAMR,EAAQQ,EAAKR,MAInB,OAHAQ,EAAKR,MAAQA,EAAMS,KACnBT,EAAMS,KAAOD,IACXR,EAAMyG,MACDzG,E,8yCC/GLnE,OAAOY,SA/JN,IAAM6K,GAAb,WAmCI,WACIrI,EACAgI,EACAzI,GACF,O,4FAAA,gHACiC,kBAApByI,IACPzI,EAAWyI,EACXA,GAAkB,GAEtBtG,KAAKV,QAAUhB,EACf0B,KAAK6B,YAAcyE,EACnBtG,KAAKtE,OAAS,EACdsE,KAAKlG,KAAO,GACZkG,KAAKqF,MAAL,UAAWxH,SAAX,QAAuB,I,QAhD/B,O,EAAA,G,EAAA,kBAmDI,SAAIqC,GAEA,IAAIW,EAA6B,CAAEK,KAAMlB,KAAKlG,KAAMqH,MAAO,OAAQL,GAAId,KAAKlG,KAAKgG,MAC7Ea,EAAQiB,EAAY1B,EAAS,CAAE9E,MAAOyF,GAAQb,KAAKV,QAASU,KAAK6B,YAGrE,GAAsB,MAAlBlB,EAAMvF,MAAM0F,GACZ,OAAOd,KAKX,IAAImB,GADJN,EAAOF,EAAMvF,OACI+F,MAIjB,IAHAN,EAAKK,KAAMC,GAAU,CAAEyF,cAAe,EAAGxL,MAAO8E,GAGzCS,EAAMpF,QAETsF,GADAF,EAAQA,EAAMpF,MACDH,OACR0F,GAAI8F,eAA2B,SAAVzF,GAAoB,EAAI,EAClDN,EAAKC,GAAK+F,GAAQhG,EAAKC,IACvBD,EAAKK,KAAOC,EAAQN,EAAKM,OAAWN,EAAKC,GACV,IAA3BD,EAAKC,GAAI8F,iBAOjB,QADE5G,KAAKtE,OACAsE,OAhFf,mBAmFI,WACIA,KAAKlG,KAAKgG,UAAOnE,EACjBqE,KAAKtE,OAAS,IArFtB,wBAwFI,WACI,OAAOsE,KAAKV,UAzFpB,oBA4FI,SAAOY,GAEH,IAEMuG,EAAUxC,GADFrC,EAAY1B,EAAS,CAAE9E,MADF,CAAE8F,KAAMlB,KAAKlG,KAAMqH,MAAO,OAAQL,GAAId,KAAKlG,KAAKgG,OAC/BE,KAAKV,QAAS,IAKlE,OADAU,KAAKtE,SAAW+K,EACTA,IApGf,iBAuGI,SAAIvG,GACA,OAAwD,MAAjDwB,EAAOxB,EAASF,KAAKlG,KAAKgG,KAAME,KAAKV,WAxGpD,iBA2GI,WAAqB,MACjB,iBAAOmC,EAAUzB,KAAKlG,KAAKgG,aAA3B,aAAO,EAA2B1E,QA5G1C,iBA+GI,WAAqB,MACjB,iBAAOkG,EAAStB,KAAKlG,KAAKgG,aAA1B,aAAO,EAA0B1E,QAhHzC,iBAmHI,WAAqB,MAGXuF,EAAQa,EAAe,CAAEpG,MADI,CAAE8F,KAAMlB,KAAKlG,KAAMqH,MAAO,OAAQL,GAAId,KAAKlG,KAAKgG,QAE7E1E,EAAK,UAAGuF,EAAMvF,MAAM0F,UAAf,aAAG,EAAgB1F,MAGxBqL,EAAUxC,GAAOtD,GAIvB,OADAX,KAAKtE,SAAW+K,EACTrL,IA9Hf,mBAiII,WAAuB,MAGbuF,EAAQY,EAAc,CAAEnG,MADK,CAAE8F,KAAMlB,KAAKlG,KAAMqH,MAAO,OAAQL,GAAId,KAAKlG,KAAKgG,QAE7E1E,EAAK,UAAGuF,EAAMvF,MAAM0F,UAAf,aAAG,EAAgB1F,MAGxBqL,EAAUxC,GAAOtD,GAIvB,OADAX,KAAKtE,SAAW+K,EACTrL,IA5If,gBA+II,WACI,OAAO4E,KAAKtE,SAhJpB,6CAmJI,4GACuB8E,EAAgBR,KAAKlG,KAAKgG,OADjD,wDAEQ,OADOD,EADf,iBAEcA,EAAKzE,MAFnB,qMAnJJ,uCA+JI,4GACuBqF,EAAiBT,KAAKlG,KAAKgG,OADlD,wDAEQ,OADOD,EADf,iBAEcA,EAAKzE,MAFnB,qMA/JJ,oBAqKI,SAAOkF,EAAeC,GAClB,QAAIP,KAAK0G,OAAOpG,KACZN,KAAKoE,IAAI7D,IACF,KAxKnB,mBA6KI,SAAgB1F,GACZ,GAAIsC,EAAQtC,GACR,IAAK,IAAI8D,EAAI,EAAGA,EAAI9D,EAAIa,SAAUiD,EAC9BqB,KAAKoE,IAAIvJ,EAAI8D,SAEd,GAAI9D,aAAe8L,GAAW3G,KAAKV,UAAYzE,EAAIyE,QACtDU,KAAKlG,KAAOsH,EAAMvG,EAAIf,MACtBkG,KAAKtE,OAASb,EAAIwF,SACf,YACmBxF,GADnB,IACH,2BAA2B,KAAhBqF,EAAgB,QACvBF,KAAKoE,IAAIlE,IAFV,qC,kBArLf,KA+LO,SAAS2G,GAAWhH,GAYvB,OAXIA,EAAK+G,cAAgB,GACjB/G,EAAKR,MAAOuH,cAAgB,IAC5B/G,EAAKR,MAAQyH,GAAQjH,EAAKR,QAE9BQ,EAAOkH,GAAQlH,IACRA,EAAK+G,eAAiB,IACzB/G,EAAKC,KAAM8G,cAAgB,IAC3B/G,EAAKC,KAAOiH,GAAQlH,EAAKC,OAE7BD,EAAOiH,GAAQjH,IAEZA,EAKJ,SAASoE,GAAUtD,GACtB,IAAIE,EAAOF,EAAMvF,MAIjB,GAAY,MAHCyF,EAAKC,GAId,OAAO,EAQX,IADA,IAAIK,GAHJR,EAAQD,EAAYC,IAGFvF,MAAM+F,MACjBR,EAAMpF,QAETsF,GADAF,EAAQA,EAAMpF,MACDH,OACR0F,GAAI8F,eAA2B,SAAVzF,GAAoB,EAAI,EAClDN,EAAKC,GAAK+F,GAAQhG,EAAKC,IACvBD,EAAKK,KAAOC,EAAQN,EAAKM,OAAWN,EAAKC,GACV,IAA3BD,EAAKC,GAAI8F,iBAKjB,OAAO,EAKJ,SAASG,GAAWC,GACvB,IAAMC,EAAID,EAAE3H,MAKZ,OAJA2H,EAAE3H,MAAQ4H,EAAEnH,KACZmH,EAAEnH,KAAOkH,EACTA,EAAEJ,eAAiB,EAAI/J,KAAKD,IAAI,EAAGqK,EAAEL,eACrCK,EAAEL,eAAiB,EAAI/J,KAAKF,IAAI,EAAGqK,EAAEJ,eAC9BK,EAKJ,SAASH,GAAWE,GACvB,IAAME,EAAIF,EAAElH,KAKZ,OAJAkH,EAAElH,KAAOoH,EAAE7H,MACX6H,EAAE7H,MAAQ2H,EACVA,EAAEJ,eAAiB,EAAI/J,KAAKF,IAAI,EAAGuK,EAAEN,eACrCM,EAAEN,eAAiB,EAAI/J,KAAKD,IAAI,EAAGoK,EAAEJ,eAC9BM,E","file":"dastal.min.js","sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine(\"Dastal\", [], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Dastal\"] = factory();\n\telse\n\t\troot[\"Dastal\"] = factory();\n})(self, function() {\nreturn ","// The require scope\nvar __webpack_require__ = {};\n\n","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/**\n * Get an iterator that always returns a given value.\n */\nexport function always<T = any>(fn: () => T): Iterator<T> {\n    return { next: () => ({ done: false, value: fn() }) };\n}\n/**\n * Get an iterator that returns a value a given amount of times.\n */\nexport function fill<T = any>(length: number, fn: () => T): Iterator<T> {\n    return {\n        next: () => {\n            if (length < 1) {\n                return { done: true, value: undefined };\n            }\n            --length;\n            return { done: false, value: fn() };\n        },\n    };\n}\n/**\n * Iterate through the first num elements of an iterator.\n *\n * @param n - The number of elements to iterate.\n * @param iterator - The iterator.\n *\n * @returns - An iterator limited to the next n elements.\n */\nexport function first<T = any>(n: number, iterator: Iterator<T>): Iterator<T> {\n    return {\n        next: () => {\n            if (n < 1) {\n                return { done: true, value: undefined };\n            }\n            const res = iterator.next();\n            n = res.done ? 0 : n - 1;\n            return res;\n        },\n    };\n}\n/**\n * Join multiple iterators into one.\n *\n * @param iterators - The iterators to join.\n */\nexport function join<T = any>(iterators: Iterator<Iterator<T>>): Iterator<T> {\n    let iterator: Iterator<T> | undefined = { next: () => ({ done: true, value: undefined }) };\n    return {\n        next: () => {\n            if (iterator == null) {\n                return { done: true, value: undefined };\n            }\n            let res = iterator.next();\n            while (res.done) {\n                const res2 = iterators.next();\n                if (res2.done) {\n                    iterator = undefined;\n                    return { done: true, value: undefined };\n                }\n                iterator = res2.value;\n                res = iterator.next();\n            }\n            return res;\n        },\n    };\n}\n/**\n * Get an empty iterator.\n */\nexport function never<T = any>(): Iterator<T> {\n    return { next: () => ({ done: true, value: undefined }) };\n}\n/**\n * Wrap a value in an iterator.\n */\nexport function once<T = any>(fn: () => T): Iterator<T> {\n    let done = false;\n    return {\n        next: () => {\n            const res = { done, value: fn() };\n            done = true;\n            fn = () => undefined!;\n            return res;\n        },\n    };\n}\n/**\n * Skip the next num elements of an iterator.\n *\n * @param n - The number of elements to skip.\n * @param iterator - The iterator.\n *\n * @returns - The iterator after skipping n elements.\n */\nexport function skip<T = any>(n: number, iterator: Iterator<T>): Iterator<T> {\n    let fn = () => {\n        let res: IteratorResult<T> = { done: false, value: undefined! };\n        while (n-- > 0 && !res.done) {\n            res = iterator.next();\n        }\n        fn = iterator.next.bind(iterator);\n        return res;\n    };\n    return { next: () => fn() };\n}\n/**\n * Split an iterator into multiple iterators of a given length.\n *\n * @param length - The length of each iterator.\n * @param iterator - The iterator to split.\n *\n * @returns - An iterator of the resulting iterators.\n */\nexport function split<T = any>(length: number, iterator: Iterator<T>): Iterator<Iterator<T>> {\n    if (length < 1) {\n        return { next: () => ({ done: true, value: undefined }) };\n    }\n    let done = false;\n    return {\n        next: () => {\n            if (done) {\n                return { done, value: undefined };\n            }\n            const iter = first(length, iterator);\n            const res = iter.next();\n            if (res.done) {\n                done = true;\n                return { done, value: undefined };\n            }\n            return { done, value: join([once(() => res.value), iter][Symbol.iterator]()) };\n        },\n    };\n}\n","/**\n * Limits a number to be within a given range.\n *\n * f(x, min, max) = y, where min <= y <= max\n *\n * @param num - The number to clamp\n * @param min - The minimum result value, inclusive\n * @param max - The maximum result value, inclusive\n *\n * @returns The clamped number\n */\nexport function clamp(num: number, min: number, max: number): number {\n    return Math.min(max, Math.max(min, num));\n}\n/**\n * Wraps a number if below a given range\n *\n * f(x, min, max) = {\n *    x, where x >= min\n *    max - (min - x), where x < min\n * }\n *\n * @param num - The number to wrap\n * @param min - The minimum result value, inclusive\n * @param max - The maximum result value, inclusive\n *\n * @returns - The wrapped number\n */\nexport function wrapLeft(num: number, min: number, max: number): number {\n    return num < min ? max - min + num : num;\n}\n/**\n * Wraps a number if above a given range\n *\n * f(x, min, max) = {\n *    x, where x <= max\n *    min + (x - max), where x > max\n * }\n *\n * @param num - The number to wrap\n * @param min - The minimum result value, inclusive\n * @param max - The maximum result value, inclusive\n *\n * @returns - The wrapped number\n */\nexport function wrapRight(num: number, min: number, max: number): number {\n    return num > max ? min + (num - max) : num;\n}\n/**\n * Wraps a number if outside a given range\n *\n * @param num - The number to wrap\n * @param min - The minimum result value, inclusive\n * @param max - The maximum result value, inclusive\n *\n * @returns - The wrapped number\n */\nexport function wrap(num: number, min: number, max: number): number {\n    return num < min ? max - min + num : wrapRight(num, min, max);\n}\n","import { first } from 'src/collection/iteratorUtils';\nimport { clamp, wrapLeft } from 'src/math/numberUtils';\n\n/**\n * The maximum length of an array.\n *\n * According to the [ECMA-262](https://tc39.es/ecma262/#array-index):\n *     0 <= array.length <= 2^32 - 1\n *\n * If this value should be updated, please\n * submit a pull request with details supporting a new max length.\n */\nexport const MAX_ARRAY_LENGTH = 4294967295;\n/**\n * The maximum number of arguments that can be safely accepted by a function.\n *\n * According to the [ECMA-262](https://tc39.es/ecma262/#sec-list-and-record-specification-type), there is no maximum. In practice, different\n * environments impose their own limit ([source](https://stackoverflow.com/questions/22747068/is-there-a-max-number-of-arguments-javascript-functions-can-accept)).\n *\n * This value was chosen through research, local testing and iteration. The actual number of arguments\n * accepted in an environment may be larger but hopefully not smaller. If errors are raised,\n * please submit a bug with your environment details and a new max length.\n */\nexport const MAX_SAFE_ARGUMENT_LENGTH = 32767;\n/**\n * Check if a value is an Array or TypedArray.\n *\n * @param obj - The value to check.\n *\n * @returns `true` if an Array or TypedArray, otherwise `false`.\n */\nexport function isArray<T = any>(obj: unknown): obj is T[] {\n    return obj instanceof Array || isTypedArray(obj);\n}\n/**\n * Check if a value is a TypedArray.\n *\n * See [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray)\n * for more details.\n *\n * @param obj - The value to check.\n *\n * @returns `true` if a TypedArray, otherwise `false`.\n */\nexport const isTypedArray = (() => {\n    const TypedArray = Object.getPrototypeOf(Uint8Array);\n    return function isTypedArray<T = any>(obj: unknown): obj is T[] {\n        return obj instanceof TypedArray;\n    };\n})();\n/**\n * Removes elements from an array and, if necessary, inserts new elements in their place, returning the deleted elements.\n *\n * Contrary to Array.splice, this will not throw an error if too many new elements are given as arguments.\n *\n * @param array - The array to splice.\n * @param start - The zero-based location in the array from which to start removing elements.\n * @param count - The number of elements to remove.\n * @param elements - The new elements to splice in.\n *\n * @returns - An array containing the elements that were deleted.\n */\nexport function splice<T>(array: T[], start?: number, count?: number, elements?: Iterable<T>): T[] {\n    start = clamp(wrapLeft(start ?? 0, 0, array.length), 0, array.length);\n    count = clamp(count ?? array.length, 0, array.length - start);\n\n    // Base case\n    if (elements == null) {\n        return array.splice(start, count);\n    }\n\n    const maxStepSize = MAX_SAFE_ARGUMENT_LENGTH - 2;\n    const iterator = elements[Symbol.iterator]();\n\n    // Perform the initial splice\n    let stepSize = array.length - count;\n    const maxElems = MAX_ARRAY_LENGTH - stepSize;\n    let n = Math.min(maxStepSize, maxElems);\n    const out = array.splice(start, count, ...{ [Symbol.iterator]: () => first(n, iterator) });\n    stepSize = array.length - stepSize;\n    start += stepSize;\n\n    // Splice in new elements as long as there is space in the array\n    for (n = maxElems - stepSize; n >= maxStepSize && stepSize >= maxStepSize; n -= stepSize) {\n        stepSize = array.length;\n        array.splice(start, 0, ...{ [Symbol.iterator]: () => first(maxStepSize, iterator) });\n        stepSize = array.length - stepSize;\n        start += stepSize;\n    }\n    if (n > 0 && stepSize >= maxStepSize) {\n        array.splice(start, 0, ...{ [Symbol.iterator]: () => first(n, iterator) });\n    }\n\n    // If maximum array capacity reached\n    if (iterator.next().done != true) {\n        throw new RangeError('Invalid array length');\n    }\n\n    return out;\n}\n","import { Collection } from './collection';\n\nexport * as ArrayUtils from './arrayUtils';\nexport * from './collection';\nexport * as IteratorUtils from './iteratorUtils';\n\n/**\n * Check if a value is a {@link Collection}.\n *\n * @param obj - The value to check.\n *\n * @returns - `true` if obj is a Collection, `false` otherwise.\n */\nexport function isCollection(obj: any): obj is Collection<unknown> {\n    return (\n        obj != null && typeof obj['size'] === 'number' && typeof obj[Symbol.iterator] === 'function'\n    );\n}\n","import { LinkedNode } from 'src/list';\nimport { BinaryTreeNode } from 'src/tree/binaryTreeNode';\nimport { CompareFn } from '..';\n\n/**\n * @internal\n */\nexport function bubbleUp<T>(index: number, compareFn: CompareFn<T>, array: Array<T>): void {\n    const value = array[index];\n\n    // Until we reach the top of the heap\n    while (index > 0) {\n        // Get the parent\n        const parentIndex = Math.floor((index + 1) / 2) - 1;\n        const parent = array[parentIndex]!;\n\n        // If the parent is above or equal to value, the heap is in order\n        if (compareFn(parent, value) <= 0) {\n            break;\n        }\n\n        // Swap the parent with value and continue\n        array[parentIndex] = value;\n        array[index] = parent;\n        index = parentIndex;\n    }\n}\n/**\n * @internal\n */\nexport function heapify<T>(compareFn: CompareFn<T>, array: T[]): void {\n    for (let i = (array.length + 1) >>> 1; i > 0; sinkDown(--i, compareFn, array)) {}\n}\n/**\n * @internal\n */\nexport function mergeKSorted<T>(compareFn: CompareFn<T>, lists: LinkedNode<T>[]): LinkedNode<T> {\n    // Heapify the list of lists based on\n    // the value at the head of each list.\n    const compare: CompareFn<LinkedNode<T>> = (a, b) => compareFn(a.value, b.value);\n    heapify(compare, lists);\n\n    // Combine the lists into a single list.\n    const list: LinkedNode<T> = lists[0];\n    for (let tail = list; lists.length > 1; tail = tail.next) {\n        lists[0] = lists[0].next ?? lists.pop()!;\n        sinkDown(0, compare, lists);\n        tail.next = lists[0];\n    }\n\n    return list;\n}\n/**\n * @internal\n */\nexport function sinkDown<T>(index: number, compareFn: CompareFn<T>, array: Array<T>): void {\n    const n = array.length;\n    const value = array[index];\n    do {\n        // Compute the left child's index\n        let childIndex = 2 * index + 1;\n\n        // If no children exist\n        if (childIndex >= n) {\n            break;\n        }\n\n        // Decide which child to compare with\n        let child = array[childIndex];\n        if (childIndex + 1 < n && compareFn(array[childIndex + 1], child) <= 0) {\n            child = array[++childIndex]!;\n        }\n\n        // If value <= child\n        if (compareFn(value, child) <= 0) {\n            break;\n        }\n\n        // Swap value and child\n        array[index] = child;\n        array[childIndex] = value;\n        index = childIndex;\n    } while (true);\n}\n/**\n * See: https://en.wikipedia.org/wiki/Skew_heap#Merging_two_heaps\n *\n * @param compareFn - A function used to determine the order of the heap.\n *\n * It is expected to return:\n * - A negative value if first argument < second argument\n * - Zero if first argument == second argument\n * - A positive value if first argument > second argument\n * @param heaps - An iterable of heaps to merge\n *\n * @returns The new heap\n */\nexport function skewMerge<T>(\n    compareFn: CompareFn<T>,\n    heaps: (BinaryTreeNode<T> | undefined)[],\n): BinaryTreeNode<T> | undefined {\n    // Remove undefineds and initialize a list for each heap\n    const lists: LinkedNode<BinaryTreeNode<T>>[] = [];\n    for (let i = 0; i < heaps.length; ++i) {\n        if (heaps[i] != null) {\n            lists.push({ value: heaps[i]! });\n        }\n    }\n\n    // Check if nothing to merge with\n    if (lists.length < 2) {\n        return lists[0]?.value;\n    }\n\n    // Split each heap into subheaps by cutting every right path; From the root\n    // node, sever the right node to make the right child its own heap. Repeat\n    // until you can't go right. This will turn each heap into a list of heaps\n    // where the root either only has a left child or no children at all. The\n    // lists of heaps will be in desc order (from bottom to top).\n    for (let i = 0; i < lists.length; ++i) {\n        let list = lists[i];\n        let tree: BinaryTreeNode<T> | undefined = list.value;\n        while ((tree = tree.right)) {\n            list = { next: list, value: tree };\n        }\n        lists[i] = list;\n    }\n\n    // Combine the lists into a single list in desc order\n    let list: LinkedNode<BinaryTreeNode<T>> | undefined = mergeKSorted(\n        (a, b) => compareFn(b.value, a.value),\n        lists,\n    );\n\n    // While there are still multiple heaps, iteratively combine\n    // the first two (from left to right). If the root of the second-to-first\n    // subtree has a left child, swap it to be the right child. Link the root\n    // of the last subtree as the left child of the second-to-first subtree.\n    let heap = list.value;\n    while ((list = list.next)) {\n        const node = list.value;\n        node.right = node.left;\n        node.left = heap;\n        heap = node;\n    }\n\n    return heap;\n}\n","import { isArray, MAX_ARRAY_LENGTH } from 'src/collection/arrayUtils';\nimport { CompareFn } from '..';\nimport { Heap } from './heap';\nimport { bubbleUp, heapify, sinkDown } from './utils';\n\n/**\n * A binary heap is a heap implemented as a binary tree with an additional shape property\n * ([source](https://en.wikipedia.org/wiki/Binary_heap)).\n *\n * **Shape property**: Must be a complete binary tree. This means all levels of the tree\n * (except possibly the last one) are fully filled. If the last level of the tree is incomplete,\n * the nodes of that level are filled from left to right.\n *\n * #### Complexity\n *\n * | Property | Average | Worst |\n * | :------- | :------ | :---- |\n * | Space    | O(n)    | O(n)\n * | Push     | O(1)    | O(log n)\n * | Peek     | O(1)\t| O(1)\n * | Pop      | O(log n)| O(log n)\n * | Search   | O(n)    | O(n)\n */\nexport class BinaryHeap<T> implements Heap<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: T[];\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * Instantiate a heap.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>) {\n        this.compare = compareFn;\n        this.array = [];\n        this.addAll(elements ?? []);\n    }\n\n    addAll(elements: Iterable<T>): number {\n        const array = this.array;\n        const length = array.length;\n\n        if (isArray(elements)) {\n            if (array.length + elements.length > MAX_ARRAY_LENGTH) {\n                throw new RangeError('Invalid heap length');\n            }\n            for (let i = 0; i < elements.length; ++i) {\n                array.push(elements[i]);\n            }\n        } else {\n            for (const element of elements) {\n                if (array.length >= MAX_ARRAY_LENGTH) {\n                    throw new RangeError('Invalid heap length');\n                }\n                array.push(element);\n            }\n        }\n\n        // Update the heap\n        if (length < array.length) {\n            heapify(this.compare, array);\n        }\n\n        return array.length;\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    contains(element: T): boolean {\n        return this.array.indexOf(element) >= 0;\n    }\n\n    delete(element: T): boolean {\n        const index = this.array.indexOf(element);\n        if (index < 0) {\n            return false;\n        }\n\n        // If deleting the last value\n        const last = this.array.pop()!;\n        if (index >= this.array.length) {\n            return true;\n        }\n\n        // Add the last value to the\n        // deleted index and update the heap\n        this.array[index] = last;\n        sinkDown(index, this.compare, this.array);\n        bubbleUp(index, this.compare, this.array);\n        return true;\n    }\n\n    merge(heap: Heap<T>): this {\n        const array = this.array;\n\n        if (heap.size < 1) {\n            return this;\n        }\n\n        if (array.length + heap.size > MAX_ARRAY_LENGTH) {\n            throw new RangeError('Invalid heap length');\n        }\n\n        for (const element of heap) {\n            array.push(element);\n        }\n\n        heapify(this.compare, array);\n        return this;\n    }\n\n    peek(): T | undefined {\n        return this.array.length > 0 ? this.array[0] : undefined;\n    }\n\n    pop(): T | undefined {\n        if (this.array.length < 1) {\n            return undefined;\n        }\n\n        // Get the root and the last value\n        const value = this.array[0];\n        const last = this.array.pop();\n\n        // If value != last\n        if (this.array.length > 0) {\n            // Move the last value to the root and update the heap\n            this.array[0] = last!;\n            sinkDown(0, this.compare, this.array);\n        }\n\n        return value;\n    }\n\n    push(value: T): number {\n        // Add new value to the end of the heap\n        this.array.push(value);\n\n        // Update the heap\n        bubbleUp(this.array.length - 1, this.compare, this.array);\n        return this.size;\n    }\n\n    pushPop(value: T): T {\n        // If empty or value is <= to root\n        if (this.array.length < 1 || this.compare(value, this.array[0]) <= 0) {\n            return value;\n        }\n\n        // Swap the root and value\n        const root = this.array[0];\n        this.array[0] = value;\n        sinkDown(0, this.compare, this.array);\n        return root;\n    }\n\n    replace(value: T): T | undefined {\n        // If empty\n        if (this.array.length < 1) {\n            this.array.push(value);\n            return undefined;\n        }\n\n        // Swap the root with value\n        const root = this.array[0];\n        this.array[0] = value;\n        value = root;\n\n        // Update the heap\n        sinkDown(0, this.compare, this.array);\n        return value;\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n\n    *sorted(): Iterable<T> {\n        if (this.array.length < 1) {\n            return;\n        }\n        const array = this.array;\n        const heap = new BinaryHeap<number>((a, b) => this.compare(array[a], array[b]), [0]);\n        do {\n            let index = heap.pop()!;\n            if (index < array.length) {\n                yield array[index];\n                index = 2 * index + 1;\n                index < array.length && heap.push(index);\n                ++index < array.length && heap.push(index);\n            }\n        } while (heap.size > 0);\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.array[Symbol.iterator]();\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        const index = this.array.indexOf(curElement);\n        if (index < 0) {\n            return false;\n        }\n        this.array[index] = newElement;\n        sinkDown(index, this.compare, this.array);\n        bubbleUp(index, this.compare, this.array);\n        return true;\n    }\n}\n","import { LinkedNode } from 'src/list';\nimport { CompareFn } from '..';\nimport { BinaryTreeNode } from './binaryTreeNode';\n\n/**\n * @internal\n */\nexport interface Edge<Node extends BinaryTreeNode<unknown>> {\n    label?: 'left' | 'right';\n    from?: Node;\n    to?: Node;\n}\n/**\n * [source](https://stackoverflow.com/questions/51419176/how-to-get-a-subset-of-keyof-t-whose-value-tk-are-callable-functions-in-typ)\n * \n * @internal\n *\nexport type KeyOfType<T, U> = {[K in keyof T]: T[K] extends U ? K: never}[keyof T];\n*/\n/**\n * @internal\n */\nexport function debug<N extends BinaryTreeNode<T>, T = any>(\n    root: N | undefined,\n    mapFn?: (node: N) => any,\n): void {\n    mapFn = mapFn == null ? (n) => n.value : mapFn;\n\n    // Turn the tree into an array in level-order\n    const array: string[] = [];\n    for (const node of levelOrderTraverse(root, true)) {\n        array.push(node ? `${mapFn(node)}` : '?');\n    }\n\n    // If empty\n    if (array.length < 1) {\n        console.log('<empty>\\n');\n        return;\n    }\n\n    // Find the longest value string\n    const lenV = array.reduce((p, c) => Math.max(p, c.length), 0);\n\n    // Pad each value\n    for (let i = 0; i < array.length; ++i) {\n        array[i] = pad(array[i], lenV, ' ');\n    }\n\n    // Split values into levels\n    const levels = [];\n    for (let n = 1; array.length > 0; n *= 2) {\n        levels.push(array.splice(0, n));\n    }\n\n    // Initialize formatting variables\n    let branch = '_'.repeat(1 + lenV / 2);\n    let offset = '';\n    const offsetOffset = ' '.repeat(branch.length);\n    let separator = ' '.repeat(1 + ((lenV - 1) & 1));\n    const separatorOffset = ' '.repeat(lenV);\n\n    // Build the last level\n    array.length = levels.length;\n    array[array.length - 1] = levels.pop()!.join(separator);\n\n    // Build remaining levels in reverse\n    for (let n = levels.length - 1; n >= 0; --n) {\n        const level = levels.pop()!;\n        for (let j = 0; j < level.length; ++j) {\n            level[j] = branch + level[j] + branch;\n        }\n        array[n] = offset + level.join(separator);\n        branch += branch;\n        offset += offset + offsetOffset;\n        separator += separator + separatorOffset;\n    }\n\n    // Output\n    console.log(array.join('\\n'), '\\n');\n}\n/**\n * @internal\n */\nexport function removeStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n    dir = true,\n): LinkedNode<Edge<Node>> {\n    let edge = stack.value;\n    let node = edge.to;\n\n    // Input check\n    if (node == null) {\n        return stack;\n    }\n\n    // Find the replacement\n    if (node.right == null) {\n        // If no right child, replace with left\n        node = node.left;\n    } else if (node.left == null) {\n        // If no left child, replace with right\n        node = node.right;\n    } else if (dir) {\n        // Replace with the successor\n        stack = successorStack(stack);\n        edge = stack.value;\n        const temp = edge.to!;\n        node.value = temp.value;\n        node = temp.right;\n    } else {\n        // Replace with the predecessor\n        stack = predecessorStack(stack);\n        edge = stack.value;\n        const temp = edge.to!;\n        node.value = temp.value;\n        node = temp.left;\n    }\n\n    // Make the replacement / update the tree\n    edge.to = node;\n    if (edge.from) {\n        edge.from[edge.label!] = edge.to = node;\n    }\n\n    return stack;\n}\n/**\n * @internal\n */\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: undefined): undefined;\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: Node): Node;\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: Node | undefined): Node | undefined;\nexport function clone<T, Node extends BinaryTreeNode<T>>(node: Node | undefined): Node | undefined {\n    if (node == null) {\n        return undefined;\n    }\n    const out: Node = Object.assign({}, node);\n    let stack: LinkedNode<Node> | undefined = { value: out };\n    do {\n        node = stack.value;\n        stack = stack.next;\n        if (node.left) {\n            stack = { next: stack, value: (node.left = Object.assign({}, node.left)) };\n        }\n        if (node.right) {\n            stack = { next: stack, value: (node.right = Object.assign({}, node.right)) };\n        }\n    } while (stack);\n    return out;\n}\n/**\n * @internal\n */\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(node: undefined): undefined;\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(node: Node): Node;\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined;\nexport function leftmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    if (node == null) {\n        return undefined;\n    }\n    while (node.left) {\n        node = node.left;\n    }\n    return node;\n}\n/**\n * @internal\n */\nexport function leftmostStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    let node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    while (node.left) {\n        stack = { next: stack, value: { label: 'left', from: node, to: node.left } };\n        node = node.left;\n    }\n    return stack;\n}\n/**\n * @internal\n */\nexport function* inOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n): Generator<Node> {\n    let stack: LinkedNode<Node> | undefined = undefined;\n\n    while (node) {\n        stack = { next: stack, value: node };\n        node = node.left;\n    }\n\n    while (stack) {\n        node = stack.value;\n        stack = stack.next;\n        yield node;\n        node = node.right;\n        while (node) {\n            stack = { next: stack, value: node };\n            node = node.left;\n        }\n    }\n}\n/**\n * @internal\n */\nexport function levelOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n    padded?: false,\n): Generator<Node>;\nexport function levelOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n    padded: true,\n): Generator<Node | undefined>;\nexport function* levelOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n    padded = false,\n): Generator<Node | undefined> {\n    const nil = {} as LinkedNode<Node | undefined>;\n    let head: LinkedNode<Node | undefined> = { value: node };\n    let tail = head;\n    for (let cont = node != null; cont; head = head.next!) {\n        tail = tail.next = nil;\n        for (cont = false; head !== nil; head = head.next!) {\n            node = head.value;\n            if (node) {\n                yield node;\n                cont ||= node.left != null || node.right != null;\n                tail = tail.next = { value: node.left };\n                tail = tail.next = { value: node.right };\n            } else if (padded) {\n                yield undefined;\n                tail = tail.next = { value: undefined };\n                tail = tail.next = { value: undefined };\n            }\n        }\n    }\n}\n/**\n * @internal\n */\nfunction pad(str: string, maxLen: number, fillString: string): string {\n    const len = str.length;\n    if (len >= maxLen) {\n        return str;\n    }\n    const diff = maxLen - len;\n    return str.padStart(len + diff / 2, fillString).padEnd(len + diff, fillString);\n}\n/**\n * @internal\n */\nexport function* postOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n): Generator<Node> {\n    interface Meta {\n        seen: boolean;\n        node?: Node;\n    }\n    let stack: LinkedNode<Meta> | undefined = { value: { seen: false, node } };\n    do {\n        const meta = stack.value;\n        stack = stack.next;\n        if (meta.node) {\n            if (meta.seen) {\n                yield meta.node;\n            } else {\n                meta.seen = true;\n                stack = { next: stack, value: meta };\n                stack = { next: stack, value: { seen: false, node: meta.node.right } };\n                stack = { next: stack, value: { seen: false, node: meta.node.left } };\n            }\n        }\n    } while (stack);\n}\n/**\n * @internal\n */\nexport function predecessor<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    return node == null ? undefined : rightmost(node.left);\n}\n/**\n * @internal\n */\nexport function predecessorStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    const node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    stack = { next: stack, value: { label: 'left', from: node, to: node.left } };\n    return rightmostStack(stack);\n}\n/**\n * @internal\n */\nexport function* preOrderTraverse<T, Node extends BinaryTreeNode<T>>(\n    node: Node | undefined,\n): Generator<Node> {\n    let stack: LinkedNode<Node | undefined> | undefined = { value: node };\n    do {\n        node = stack.value;\n        stack = stack.next;\n        if (node) {\n            yield node;\n            stack = { next: stack, value: node.right };\n            stack = { next: stack, value: node.left };\n        }\n    } while (stack);\n}\n/**\n * @internal\n */\nexport function reverse<Node extends BinaryTreeNode<unknown>>(root?: Node): void {\n    if (root == null) {\n        return;\n    }\n    for (const node of preOrderTraverse(root)) {\n        const left = node.left;\n        node.left = node.right;\n        node.right = left;\n    }\n}\n/**\n * @internal\n */\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(node: undefined): undefined;\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(node: Node): Node;\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined;\nexport function rightmost<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    if (node == null) {\n        return undefined;\n    }\n    while (node.right) {\n        node = node.right;\n    }\n    return node;\n}\n/**\n * @internal\n */\nexport function rightmostStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    let node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    while (node.right) {\n        stack = { next: stack, value: { label: 'right', from: node, to: node.right } };\n        node = node.right;\n    }\n    return stack;\n}\n/**\n * Assumes sorted by compareFn\n * @internal\n */\nexport function search<T, Node extends BinaryTreeNode<T>>(\n    element: T,\n    node: Node | undefined,\n    compareFn: CompareFn<T>,\n): Node | undefined {\n    while (node) {\n        const comp: number = compareFn(element, node.value);\n        if (comp == 0) {\n            break;\n        }\n        node = comp < 0 ? node.left : node.right;\n    }\n    return node;\n}\n/**\n * Assumes sorted by compareFn\n * @internal\n */\nexport function searchStack<T, Node extends BinaryTreeNode<T>>(\n    element: T,\n    stack: LinkedNode<Edge<Node>>,\n    compareFn: CompareFn<T>,\n    dupeWeight = 0,\n): LinkedNode<Edge<Node>> {\n    const paths: ['left', 'right'] = ['left', 'right'];\n    let node = stack.value.to;\n    while (node) {\n        const comp: number = compareFn(element, node.value) || dupeWeight;\n        if (comp === 0) {\n            break;\n        }\n        const label = paths[+(comp > 0)];\n        stack = { next: stack, value: { label, from: node, to: node[label] } };\n        node = node[label]!;\n    }\n    return stack;\n}\n/**\n * @internal\n */\nexport function successor<Node extends BinaryTreeNode<unknown>>(\n    node: Node | undefined,\n): Node | undefined {\n    return node == null ? undefined : leftmost(node.right);\n}\n/**\n * @internal\n */\nexport function successorStack<Node extends BinaryTreeNode<unknown>>(\n    stack: LinkedNode<Edge<Node>>,\n): LinkedNode<Edge<Node>> {\n    const node = stack.value.to;\n    if (node == null) {\n        return stack;\n    }\n    stack = { next: stack, value: { label: 'right', from: node, to: node.right } };\n    return leftmostStack(stack);\n}\n/**\n * Turn an array into a binary tree. Assumes elements are in level-order.\n *\n * @internal\n */\nexport function toBinaryTree<T>(\n    elements: (T | undefined)[] | undefined,\n): BinaryTreeNode<T> | undefined {\n    if (elements == null || elements.length < 1 || elements[0] == null) {\n        return undefined;\n    }\n    const n = elements.length;\n    const nodes: BinaryTreeNode<T>[] = new Array(n);\n    nodes[0] = { value: elements[0] };\n    for (let i = 1; i < n; ++i) {\n        if (elements[i] == null) {\n            continue;\n        }\n        const par = nodes[(i - 1) >>> 1];\n        const node = { value: elements[i]! };\n        nodes[i] = node;\n        if (i & 1) {\n            par.left = node;\n        } else {\n            par.right = node;\n        }\n    }\n    return nodes[0];\n}\n","import { isArray } from 'src/collection/arrayUtils';\nimport { BinaryTreeNode } from 'src/tree/binaryTreeNode';\nimport { clone, preOrderTraverse, toBinaryTree } from 'src/tree/binaryTreeUtils';\nimport { CompareFn } from '..';\nimport { BinaryHeap } from './binaryHeap';\nimport { Heap } from './heap';\nimport { skewMerge } from './utils';\n\n/**\n * A skew heap is a heap implemented as a binary tree\n * ([source](https://en.wikipedia.org/wiki/Skew_heap)).\n *\n * A skew heap is a self-adjusting heap which attempts to maintain balance\n * by unconditionally swapping all nodes in the merge path when merging two heaps. Every\n * operation that modifies the heap (e.g. push, pop, merge) is considered a merge and is done\n * by using a skew heap merge.\n *\n * Skew heaps can merge more quickly than binary heaps. This can seem contradictory, since\n * skew heaps have no structural constraints and no guarantee that the height of the tree is\n * logarithmic (i.e. balanced). However, amortized complexity analysis can demonstrate that\n * all operations on a skew heap can be done in O(log(n). More specifically, the\n * amortized complexity is known to be log<sub>φ</sub>(n) where φ is the golden ratio. This is\n * approximately 1.44*log<sub>2</sub>(n).\n *\n * #### Complexity\n *\n * | Property | Average  | Worst |\n * | :------- | :------  | :---- |\n * | Space    | O(n)     | O(n)\n * | Push     | O(log n) | O(log n)\n * | Peek     | O(1)\t | O(1)\n * | Pop      | O(log n) | O(log n)\n * | Search   | O(n)     | O(n)\n */\nexport class SkewHeap<T> implements Heap<T> {\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The node at the \"top\" of the heap.\n     */\n    protected root: BinaryTreeNode<T> | undefined;\n    /**\n     * Instantiate a heap.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the heap with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>) {\n        this.compare = compareFn;\n        this.length = 0;\n        this.addAll(elements ?? []);\n    }\n\n    addAll(elements: Iterable<T>): number {\n        if (isArray(elements)) {\n            for (let i = 0; i < elements.length; ++i) {\n                this.push(elements[i]);\n            }\n        } else if (elements instanceof SkewHeap || elements instanceof BinaryHeap) {\n            this.merge(elements);\n        } else {\n            for (const element of elements) {\n                this.push(element);\n            }\n        }\n        return this.length;\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.root = undefined;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    contains(element: T): boolean {\n        for (const node of preOrderTraverse(this.root)) {\n            if (element === node.value) {\n                return true;\n            }\n        }\n        return false;\n    }\n\n    delete(element: T): boolean {\n        if (this.root == null) {\n            return false;\n        }\n        if (this.root.value === element) {\n            this.pop()!;\n            return true;\n        }\n        for (const par of preOrderTraverse(this.root)) {\n            const key: keyof BinaryTreeNode<T> | undefined =\n                par.left && par.left.value === element\n                    ? 'left'\n                    : par.right && par.right.value === element\n                    ? 'right'\n                    : undefined;\n            if (key != null) {\n                const node = par[key]!;\n                par[key] = skewMerge(this.compare, [node.left, node.right]);\n                --this.length;\n                return true;\n            }\n        }\n        return false;\n    }\n\n    merge(heap: Heap<T>): this {\n        if (this.compare !== heap.comparator()) {\n            this.addAll(heap);\n        } else if (heap instanceof SkewHeap) {\n            this.root = skewMerge(this.compare, [this.root, clone(heap.root)]);\n            this.length += heap.size;\n        } else if (heap instanceof BinaryHeap) {\n            this.root = skewMerge(this.compare, [this.root, toBinaryTree(heap['array'])!]);\n            this.length += heap.size;\n        } else {\n            this.addAll(heap);\n        }\n        return this;\n    }\n\n    peek(): T | undefined {\n        return this.root?.value;\n    }\n\n    pop(): T | undefined {\n        if (this.root == null) {\n            return undefined;\n        }\n        const value = this.root.value;\n        this.root = skewMerge(this.compare, [this.root.left, this.root.right]);\n        --this.length;\n        return value;\n    }\n\n    push(value: T): number {\n        this.root = skewMerge(this.compare, [this.root, { value }]);\n        return ++this.length;\n    }\n\n    pushPop(value: T): T {\n        this.push(value);\n        return this.pop()!;\n    }\n\n    replace(value: T): T | undefined {\n        if (this.root == null) {\n            this.root = { value };\n            this.length = 1;\n            return undefined;\n        }\n        const out = this.root.value;\n        this.root = skewMerge(this.compare, [this.root.left, this.root.right, { value }]);\n        return out;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    *sorted(): Iterable<T> {\n        if (this.root == null) {\n            return;\n        }\n        const heap = new SkewHeap<BinaryTreeNode<T>>(\n            (a, b) => this.compare(a.value, b.value),\n            [this.root],\n        );\n        do {\n            const node = heap.pop()!;\n            yield node.value;\n            node.left && heap.push(node.left);\n            node.right && heap.push(node.right);\n        } while (heap.size > 0);\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of preOrderTraverse(this.root)) {\n            yield node.value;\n        }\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        if (this.root == null) {\n            return false;\n        }\n\n        if (this.root.value === curElement) {\n            this.root = skewMerge(this.compare, [\n                this.root.left,\n                this.root.right,\n                { value: newElement },\n            ]);\n            return true;\n        }\n\n        let node: BinaryTreeNode<T> | undefined = undefined;\n        for (const par of preOrderTraverse(this.root)) {\n            if (par.left && par.left.value === curElement) {\n                node = par.left;\n                par.left = undefined;\n                break;\n            }\n            if (par.right && par.right.value === curElement) {\n                node = par.right;\n                par.right = undefined;\n                break;\n            }\n        }\n\n        if (node == null) {\n            return false;\n        }\n\n        this.root = skewMerge(this.compare, [\n            this.root,\n            node.left,\n            node.right,\n            { value: newElement },\n        ]);\n        return true;\n    }\n}\n","import { splice } from 'src/collection/arrayUtils';\nimport { clamp, wrapLeft } from 'src/math/numberUtils';\nimport { CompareFn } from '..';\nimport { List } from './list';\n\n/**\n * An implementation of the {@link List} interface using an array\n */\nexport class ArrayList<T> implements List<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: Array<T>;\n    /**\n     * Instantiate the list.\n     *\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.array = elements ? Array.from(elements) : [];\n    }\n\n    add(index: number, element: T): number {\n        if (index >= 0 && index <= this.size) {\n            this.array.splice(index, 0, element);\n        }\n        return this.size;\n    }\n\n    addAll(index: number, elements: Iterable<T>): number {\n        if (index >= 0 && index <= this.size) {\n            splice(this.array, index, 0, elements);\n        }\n        return this.size;\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    concat(...lists: Iterable<T>[]): ArrayList<T> {\n        const out = new ArrayList(this);\n        for (const list of lists) {\n            out.addAll(out.size, list);\n        }\n        return out;\n    }\n\n    copyWithin(index: number, min?: number, max?: number): this {\n        index = clamp(wrapLeft(index, 0, this.size), 0, this.size);\n        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);\n        max = clamp(wrapLeft(max ?? this.size, 0, this.size), 0, this.size);\n        this.array.copyWithin(index, min, max);\n        return this;\n    }\n\n    fill(element: T, min?: number, max?: number): this {\n        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);\n        max = clamp(wrapLeft(max ?? this.size, 0, this.size), 0, this.size);\n        this.array.fill(element, min, max);\n        return this;\n    }\n\n    get(index: number): T | undefined {\n        return index < 0 || index >= this.size ? undefined : this.array[index];\n    }\n\n    getSet(index: number, callback: (element: T) => T): T | undefined {\n        let value: T | undefined = undefined;\n        if (index >= 0 && index < this.size) {\n            value = this.array[index];\n            this.array[index] = callback(value);\n        }\n        return value;\n    }\n\n    pop(): T | undefined {\n        return this.array.pop();\n    }\n\n    push(element: T): number {\n        return this.array.push(element);\n    }\n\n    remove(index: number): T | undefined {\n        return index < 0 || index >= this.size ? undefined : this.array.splice(index, 1)[0];\n    }\n\n    reverse(min?: number, max?: number): this {\n        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);\n        max = clamp(wrapLeft(max ?? this.size, 0, this.size), 0, this.size) - 1;\n        while (min < max) {\n            const temp = this.array[min];\n            this.array[min++] = this.array[max];\n            this.array[max--] = temp;\n        }\n        return this;\n    }\n\n    set(index: number, element: T): T | undefined {\n        let prev: T | undefined = undefined;\n        if (index >= 0 && index < this.size) {\n            prev = this.array[index];\n            this.array[index] = element;\n        }\n        return prev;\n    }\n\n    shift(): T | undefined {\n        return this.array.shift();\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n\n    slice(min?: number, max?: number): ArrayList<T> {\n        return new ArrayList(this.array.slice(min, max));\n    }\n\n    splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {\n        return new ArrayList(splice(this.array, start, count, elements));\n    }\n\n    sort(compareFn: CompareFn<T>): this {\n        this.array.sort(compareFn);\n        return this;\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.array[Symbol.iterator]();\n    }\n\n    unshift(element: T): number {\n        return this.array.unshift(element);\n    }\n\n    update(callback: (element: T, index: number) => T): this;\n    update(min: number | undefined, callback: (element: T, index: number) => T): this;\n    update(\n        min: number | undefined,\n        max: number | undefined,\n        callback: (element: T, index: number) => T,\n    ): this;\n    update(\n        min: number | undefined | ((element: T, index: number) => T),\n        max?: number | ((element: T, index: number) => T),\n        callback?: (element: T, index: number) => T,\n    ): this {\n        if (callback == null) {\n            if (arguments.length < 2) {\n                callback = min as (element: T, index: number) => T;\n                min = undefined;\n            } else {\n                callback = max as (element: T, index: number) => T;\n                max = undefined;\n            }\n        }\n        min = clamp(wrapLeft((min as number) ?? 0, 0, this.size), 0, this.size);\n        max = clamp(wrapLeft((max as number) ?? this.size, 0, this.size), 0, this.size);\n        while (min < max) {\n            this.array[min] = callback(this.array[min], min);\n            ++min;\n        }\n        return this;\n    }\n\n    *view(min?: number, max?: number): Iterable<T> {\n        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);\n\n        let len: () => number;\n        if (max == null) {\n            len = () => this.size;\n        } else if (max >= 0) {\n            len = () => Math.min(max, this.size);\n        } else {\n            len = () => this.size + max;\n        }\n\n        while (min < len()) {\n            yield this.array[min++];\n        }\n    }\n}\n","import { CompareFn } from '..';\nimport { DoublyLinkedNode } from './doublyLinkedNode';\nimport { LinkedNode } from './linkedNode';\n\n/**\n * Sorts a list in place.\n *\n * Works on complete lists as well as sublists and circular lists:\n * - Linked lists will keep the link to the next node beyond the sorted section\n * - Doubly linked lists will keep links to the prev and next nodes outside the sorted section\n *\n * @param node - The head of the list\n * @param len - The length of the list beginning from node\n * @param isDoubly - Whether node is a doubly linked node\n * @param compareFn - A function used to determine the order of elements.\n *\n * It is expected to return:\n * - A negative value if first argument < second argument\n * - Zero if first argument == second argument\n * - A positive value if first argument > second argument\n *\n * @returns The new head and tail of the sorted list\n *\n * @internal\n */\nexport function linkedMergeSort<T, Node extends LinkedNode<T>>(\n    node: Node,\n    len: number,\n    isDoubly: boolean,\n    compareFn: CompareFn<T>,\n): [Node, Node] {\n    // Base case\n    if (len < 2) {\n        return [node, node];\n    }\n\n    // Split the list into two halves and sort them\n    len = len / 2;\n    const lens: [number, number] = [Math.ceil(len), Math.floor(len)];\n    const heads = linkedMergeSort(node, lens[0], isDoubly, compareFn);\n    const tails = linkedMergeSort(heads[1].next as Node, lens[1], isDoubly, compareFn);\n\n    // Group the heads and tails together\n    node = heads[1];\n    heads[1] = tails[0];\n    tails[0] = node;\n    tails[0].next = tails[1].next;\n\n    // Merge the sorted halves\n    const prev = (heads[0] as DoublyLinkedNode<T>).prev;\n    node = linkedMergeSorted(heads, lens, isDoubly, compareFn);\n    if (isDoubly) {\n        (node as DoublyLinkedNode<T>).prev = prev;\n    }\n\n    // Return the head and tail\n    return [node, tails[+(lens[0] < 1)]];\n}\n/**\n * Merges two sorted lists.\n *\n * @param nodes - The heads of the lists\n * @param lens - The lengths of the lists\n * @param isDoubly - Whether the lists are a doubly linked\n * @param compareFn - A function used to determine the order of elements.\n *\n * It is expected to return:\n * - A negative value if first argument < second argument\n * - Zero if first argument == second argument\n * - A positive value if first argument > second argument\n *\n * @returns The new head of the sorted list\n *\n * @internal\n */\nexport function linkedMergeSorted<T, Node extends LinkedNode<T>>(\n    heads: [Node, Node],\n    lens: [number, number],\n    isDoubly: boolean,\n    compareFn: CompareFn<T>,\n): Node {\n    const root = {} as Node;\n\n    let node = root;\n    do {\n        const index = +(compareFn(heads[0].value, heads[1].value) > 0);\n        node.next = heads[index];\n        if (isDoubly) {\n            (node.next as DoublyLinkedNode<T>).prev = node;\n        }\n        node = node.next as Node;\n        heads[index] = node.next as Node;\n        --lens[index];\n    } while (lens[0] > 0 && lens[1] > 0);\n\n    // Add any remaining nodes\n    node.next = heads[+(lens[0] < 1)];\n    if (isDoubly && node.next) {\n        (node.next as DoublyLinkedNode<T>).prev = node;\n    }\n    return root.next as Node;\n}\n","import { clamp, wrapLeft } from 'src/math/numberUtils';\nimport { CompareFn } from '..';\nimport { DoublyLinkedNode } from './doublyLinkedNode';\nimport { List } from './list';\nimport { linkedMergeSort } from './utils';\n\n/**\n * A (circular) doubly-linked list implementation of the {@link List} interface.\n *\n * Operations that index into the list will traverse the list from the beginning or the end, whichever is closer to the specified index.\n */\nexport class DoublyLinkedList<T> implements List<T> {\n    /**\n     * The number of elements in the list\n     */\n    protected length: number;\n    /**\n     * The sentinel node at the fron of the list\n     */\n    protected root: DoublyLinkedNode<T>;\n    /**\n     * Instantiate the list.\n     *\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.length = 0;\n        this.root = {} as DoublyLinkedNode<T>;\n        this.root.prev = this.root.next = this.root;\n        this._addAll(this.root, elements ?? []);\n    }\n\n    add(index: number, value: T): number {\n        if (index < 0 || index > this.length) {\n            return this.length;\n        }\n        const prev = this._get(index - 1);\n        const node = { next: prev.next, prev, value };\n        prev.next = node;\n        node.next!.prev = node;\n        return ++this.length;\n    }\n\n    addAll(index: number, elements: Iterable<T>): number {\n        if (index >= 0 && index <= this.length) {\n            this._addAll(this._get(index), elements);\n        }\n        return this.length;\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.root.prev = this.root.next = this.root;\n    }\n\n    concat(...lists: Iterable<T>[]): DoublyLinkedList<T> {\n        const out = new DoublyLinkedList(this);\n        for (const list of lists) {\n            out.addAll(out.size, list);\n        }\n        return out;\n    }\n\n    copyWithin(index: number, min?: number, max?: number): this {\n        // Check if copying to the same section\n        index = clamp(wrapLeft(index, 0, this.length), 0, this.length);\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n        if (min === index) {\n            return this;\n        }\n\n        // Check if the section to copy has no length\n        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);\n        max = min + Math.min(max - min, this.length - index);\n        if (min >= max) {\n            return this;\n        }\n\n        // Check for overlap edge case\n        if (min < index && index < max) {\n            let nodeA = this._get(max);\n            let nodeB = this._get(index + (max - min));\n            do {\n                nodeA = nodeA.prev!;\n                nodeB = nodeB.prev!;\n                nodeB.value = nodeA.value;\n            } while (++min < max);\n            return this;\n        }\n\n        // Copy the section to the destination\n        let nodeA = this._get(min);\n        let nodeB = this._get(index);\n        do {\n            nodeB.value = nodeA.value;\n            nodeA = nodeA.next!;\n            nodeB = nodeB.next!;\n        } while (++min < max);\n        return this;\n    }\n\n    fill(element: T, min?: number, max?: number): this {\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = element;\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    get(index: number): T | undefined {\n        return index < 0 || index >= this.length ? undefined : this._get(index).value;\n    }\n\n    getSet(index: number, callback: (element: T) => T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        const value = node.value;\n        node.value = callback(node.value);\n        return value;\n    }\n\n    pop(): T | undefined {\n        if (this.length < 1) {\n            return undefined;\n        }\n        const tail = this.root.prev!;\n        tail.prev!.next = this.root;\n        this.root.prev = tail.prev;\n        --this.length;\n        return tail.value;\n    }\n\n    push(value: T): number {\n        const prev = this.root.prev!;\n        const node = { next: this.root, prev, value };\n        prev.next = this.root.prev = node;\n        return ++this.length;\n    }\n\n    remove(index: number): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        node.prev!.next = node.next;\n        node.next!.prev = node.prev;\n        --this.length;\n        return node.value;\n    }\n\n    reverse(min?: number, max?: number): this {\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);\n        if (max - min < 2) {\n            return this;\n        }\n        const root = this._get(min - 1);\n        const tail = root.next!;\n        let node = tail;\n        do {\n            const temp = node.next!;\n            node.next = node.prev;\n            node.prev = temp;\n            root.next = node;\n            node = temp;\n        } while (++min < max);\n        tail.next = node;\n        node.prev = tail;\n        root.next!.prev = root;\n        return this;\n    }\n\n    set(index: number, element: T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        const value = node.value;\n        node.value = element;\n        return value;\n    }\n\n    shift(): T | undefined {\n        if (this.length < 1) {\n            return undefined;\n        }\n        const head = this.root.next!;\n        head.next!.prev = this.root;\n        this.root.next = head.next;\n        --this.length;\n        return head.value;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    slice(min?: number, max?: number): DoublyLinkedList<T> {\n        return new DoublyLinkedList(this.view(min, max));\n    }\n\n    splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {\n        start = clamp(wrapLeft(start ?? 0, 0, this.length), 0, this.length);\n        count = clamp(count ?? this.size, 0, this.size - start);\n\n        // If not modifying the list\n        const list = new DoublyLinkedList<T>();\n        if (elements == null && count < 1) {\n            return list;\n        }\n\n        // Delete elements\n        let node = this._get(start);\n        while (count-- > 0) {\n            list.push(node.value);\n            node.prev!.next = node.next!;\n            node.next!.prev = node.prev!;\n            node = node.next!;\n            --this.length;\n        }\n\n        // Add elements\n        this._addAll(node, elements ?? []);\n\n        return list;\n    }\n\n    sort(compareFn: CompareFn<T>): this {\n        if (this.length > 1) {\n            const [head, tail] = linkedMergeSort(this.root.next!, this.length, true, compareFn);\n            this.root.next = head;\n            tail.next!.prev = tail;\n        }\n        return this;\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let node = this.root.next!; node !== this.root; node = node.next!) {\n            yield node.value;\n        }\n    }\n\n    unshift(value: T): number {\n        const head = this.root.next!;\n        const node = { next: head, prev: this.root, value };\n        this.root.next = head.prev = node;\n        return ++this.length;\n    }\n\n    update(callback: (element: T, index: number) => T): this;\n    update(min: number | undefined, callback: (element: T, index: number) => T): this;\n    update(\n        min: number | undefined,\n        max: number | undefined,\n        callback: (element: T, index: number) => T,\n    ): this;\n    update(\n        min: number | undefined | ((element: T, index: number) => T),\n        max?: number | ((element: T, index: number) => T),\n        callback?: (element: T, index: number) => T,\n    ): this {\n        if (callback == null) {\n            if (arguments.length < 2) {\n                callback = min as (element: T, index: number) => T;\n                min = undefined;\n            } else {\n                callback = max as (element: T, index: number) => T;\n                max = undefined;\n            }\n        }\n        min = clamp(wrapLeft((min as number) ?? 0, 0, this.length), 0, this.length);\n        max = clamp(wrapLeft((max as number) ?? this.length, 0, this.length), 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = callback(node.value, min);\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    *view(min?: number, max?: number): Iterable<T> {\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n\n        let len: () => number;\n        if (max == null) {\n            len = () => this.length;\n        } else if (max >= 0) {\n            len = () => max;\n        } else {\n            len = () => this.length + max;\n        }\n\n        if (min < len()) {\n            let node = this._get(min);\n            do {\n                yield node.value;\n                node = node.next!;\n            } while (++min < len() && node !== this.root);\n        }\n    }\n    /**\n     *\n     */\n    protected _addAll(next: DoublyLinkedNode<T>, elements: Iterable<T>): void {\n        let prev = next.prev!;\n        for (const value of elements) {\n            const node = { prev, value };\n            prev.next = node;\n            prev = node;\n            ++this.length;\n        }\n        prev.next = next;\n        next.prev = prev;\n    }\n    /**\n     * A helper method to iterate and return the node at the given index.\n     *\n     * Depending on the index, the list will be traversed from beginning or end; whichever is closest to the specified index.\n     *\n     * @param index - The index to retrieve\n     *\n     * @returns The node at the given index\n     */\n    protected _get(index: number): DoublyLinkedNode<T> {\n        let node = this.root;\n        if (index < this.length / 2) {\n            while (index-- >= 0) {\n                node = node.next!;\n            }\n        } else {\n            for (index = this.length - index; index > 0; --index) {\n                node = node.prev!;\n            }\n        }\n        return node;\n    }\n}\n","import { clamp, wrapLeft } from 'src/math/numberUtils';\nimport { CompareFn } from '..';\nimport { LinkedNode } from './linkedNode';\nimport { List } from './list';\nimport { linkedMergeSort } from './utils';\n\n/**\n * A (circular) linked list implementation of the {@link List} interface.\n */\nexport class LinkedList<T> implements List<T> {\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The sentinel node at the front of the list.\n     */\n    protected root: LinkedNode<T>;\n    /**\n     * The last node of the list.\n     */\n    protected tail: LinkedNode<T>;\n    /**\n     * Instantiate the list.\n     *\n     * @param elements - A set of elements to initialize the list with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.length = 0;\n        this.root = {} as LinkedNode<T>;\n        this.root.next = this.root;\n        this.tail = this._addAll(this.root, elements ?? []);\n    }\n\n    add(index: number, value: T): number {\n        if (index >= 0 && index < this.length) {\n            const prev = this._get(index - 1);\n            prev.next = { value, next: prev.next };\n            ++this.length;\n        } else if (index === this.length) {\n            this.push(value);\n        }\n        return this.length;\n    }\n\n    addAll(index: number, elements: Iterable<T>): number {\n        if (index >= 0 && index < this.length) {\n            this._addAll(this._get(index - 1), elements);\n        } else if (index === this.length) {\n            this.tail = this._addAll(this.tail, elements);\n        }\n        return this.length;\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.tail = this.root.next = this.root;\n    }\n\n    concat(...lists: Iterable<T>[]): LinkedList<T> {\n        const out = new LinkedList(this);\n        for (const list of lists) {\n            out.addAll(out.size, list);\n        }\n        return out;\n    }\n\n    copyWithin(index: number, min?: number, max?: number): this {\n        // Check if copying to itself\n        index = clamp(wrapLeft(index, 0, this.length), 0, this.length);\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n        if (min === index) {\n            return this;\n        }\n\n        // Check if the section to copy has no length\n        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);\n        max = min + Math.min(max - min, this.length - index);\n        if (min >= max) {\n            return this;\n        }\n\n        // Copy to earlier in the list\n        if (index < min) {\n            const node = this._get(index - 1);\n            this._copyWithin(this._get(min - index - 1, node), node, max - min);\n            return this;\n        }\n\n        // Copy to later in the list\n        if (index > max) {\n            const node = this._get(min - 1);\n            this._copyWithin(node, this._get(index - min - 1, node), max - min);\n            return this;\n        }\n\n        // Copy to overlapping destination\n        const nodeA = this._get(min - 1);\n        const nodeC = this._get(max - min - 1, nodeA);\n        const nodeD = this._copyWithin(nodeA, nodeC, index - min);\n        if (index + (max - min) >= this.length) {\n            this.tail = nodeC;\n        }\n        const temp = nodeA.next;\n        nodeA.next = nodeC.next;\n        nodeC.next = nodeD.next;\n        nodeD.next = temp;\n        return this;\n    }\n\n    fill(element: T, min?: number, max?: number): this {\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = element;\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    get(index: number): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        return index < this.length - 1 ? this._get(index).value : this.tail.value;\n    }\n\n    getSet(index: number, callback: (element: T) => T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = index < this.length - 1 ? this._get(index) : this.tail;\n        const value = node.value;\n        node.value = callback(node.value);\n        return value;\n    }\n\n    pop(): T | undefined {\n        if (this.length < 1) {\n            return undefined;\n        }\n        const value = this.tail.value;\n        this.tail = this._get(this.length - 2);\n        this.tail.next = this.root;\n        --this.length;\n        return value;\n    }\n\n    push(value: T): number {\n        const tail: LinkedNode<T> = { next: this.root, value };\n        this.tail.next = tail;\n        this.tail = tail;\n        return ++this.length;\n    }\n\n    remove(index: number): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const prev = this._get(index - 1);\n        const node = prev.next!;\n        prev.next = node.next;\n        if (index === --this.length) {\n            this.tail = prev;\n        }\n        return node.value;\n    }\n\n    reverse(min?: number, max?: number): this {\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);\n        if (max - min < 2) {\n            return this;\n        }\n        const root = this._get(min - 1);\n        this.tail = max >= this.length ? root.next! : this.tail;\n        const tail = root.next!;\n        let prev = tail;\n        let node = tail.next!;\n        while (++min < max) {\n            const next = node.next!;\n            node.next = prev;\n            prev = node;\n            node = next;\n        }\n        root.next = prev;\n        tail.next = node;\n        return this;\n    }\n\n    set(index: number, element: T): T | undefined {\n        if (index < 0 || index >= this.length) {\n            return undefined;\n        }\n        const node = this._get(index);\n        const value = node.value;\n        node.value = element;\n        return value;\n    }\n\n    shift(): T | undefined {\n        return this.remove(0);\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    slice(min?: number, max?: number): LinkedList<T> {\n        return new LinkedList(this.view(min, max));\n    }\n\n    splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {\n        start = clamp(wrapLeft(start ?? 0, 0, this.length), 0, this.length);\n        count = clamp(count ?? this.size, 0, this.size - start);\n\n        // If not modifying the list\n        const deleted = new LinkedList<T>();\n        if (elements == null && count < 1) {\n            return deleted;\n        }\n\n        // Delete elements\n        let prev = this._get(start - 1);\n        const newTail = start + count >= this.size;\n        while (count-- > 0) {\n            const node = prev.next!;\n            deleted.push(node.value);\n            prev.next = node.next;\n            --this.length;\n        }\n\n        // Add elements\n        prev = this._addAll(prev, elements ?? []);\n        this.tail = newTail ? prev : this.tail;\n\n        return deleted;\n    }\n\n    sort(compareFn: CompareFn<T>): this {\n        if (this.length > 1) {\n            const [head, tail] = linkedMergeSort(this.root.next!, this.length, false, compareFn);\n            this.root.next = head;\n            this.tail = tail;\n        }\n        return this;\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let node = this.root.next!; node !== this.root; node = node.next!) {\n            yield node.value;\n        }\n    }\n\n    unshift(value: T): number {\n        return this.add(0, value);\n    }\n\n    update(callback: (element: T, index: number) => T): this;\n    update(min: number | undefined, callback: (element: T, index: number) => T): this;\n    update(\n        min: number | undefined,\n        max: number | undefined,\n        callback: (element: T, index: number) => T,\n    ): this;\n    update(\n        min: number | undefined | ((element: T, index: number) => T),\n        max?: number | ((element: T, index: number) => T),\n        callback?: (element: T, index: number) => T,\n    ): this {\n        if (callback == null) {\n            if (arguments.length < 2) {\n                callback = min as (element: T, index: number) => T;\n                min = undefined;\n            } else {\n                callback = max as (element: T, index: number) => T;\n                max = undefined;\n            }\n        }\n        min = clamp(wrapLeft((min as number) ?? 0, 0, this.length), 0, this.length);\n        max = clamp(wrapLeft((max as number) ?? this.length, 0, this.length), 0, this.length);\n        if (min < max) {\n            let node = this._get(min);\n            do {\n                node.value = callback(node.value, min);\n                node = node.next!;\n            } while (++min < max);\n        }\n        return this;\n    }\n\n    *view(min?: number, max?: number): Iterable<T> {\n        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);\n\n        let len: () => number;\n        if (max == null) {\n            len = () => this.length;\n        } else if (max >= 0) {\n            len = () => max;\n        } else {\n            len = () => this.length + max;\n        }\n\n        if (min < len()) {\n            let node = this._get(min);\n            do {\n                yield node.value;\n                node = node.next!;\n            } while (++min < len() && node !== this.root);\n        }\n    }\n\n    protected _addAll(prev: LinkedNode<T>, elements: Iterable<T>): LinkedNode<T> {\n        const next = prev.next!;\n        for (const value of elements) {\n            const node = { value };\n            prev.next = node;\n            prev = node;\n            ++this.length;\n        }\n        prev.next = next;\n        return prev;\n    }\n    /**\n     * Copy values from 'from' to 'to'.\n     *\n     * @param from - The initial node to copy from\n     * @param prev - The root of the initial node to copy to\n     * @param count - The number of values to copy\n     */\n    protected _copyWithin(from: LinkedNode<T>, to: LinkedNode<T>, count: number): LinkedNode<T> {\n        while (count-- > 0) {\n            from = from.next!;\n            to = to.next!;\n            to.value = from.value;\n        }\n        return to;\n    }\n    /**\n     * Get the node at the given index.\n     *\n     * @param index - The index to retrieve\n     *\n     * @returns The node at the given index\n     */\n    protected _get(index: number, root: LinkedNode<T> = this.root): LinkedNode<T> {\n        let node = root!;\n        while (index-- >= 0) {\n            node = node.next!;\n        }\n        return node;\n    }\n}\n","/**\n * Bit hacks for 32-bit unsigned numbers.\n */\n\n/**\n * Get the number of bits set of a 32-bit unsigned number ([source](https://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetKernighan))\n *\n * @param a\n */\nexport function bitsSet(a: number): number {\n    let b = 0;\n    while (a) {\n        ++b;\n        a &= a - 1;\n    }\n    return b;\n}\n/**\n * Invert the bits of a 32-bit unsigned number.\n *\n * Example: 11 (1011) -> 4 (0100)\n *\n * @param a The number to invert\n *\n * @returns The inverted number\n */\nexport function invert(a: number): number {\n    const b = msp(a);\n    return u32(a ^ (b | (b - 1)));\n}\n/**\n * Check whether a 32-bit unsigned number is a power of 2.\n *\n * Example: 8 (1000) -> true\n *\n * @param a The number to check\n */\nexport function isPow2(a: number): boolean {\n    return (a & (a - 1)) === 0;\n}\n/**\n * Get the Least Significant Bit of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns The lowest bit set\n */\nexport function lsb(a: number): number {\n    let b = -1;\n    for (a = lsp(a); a; a >>>= 1) {\n        ++b;\n    }\n    return b;\n}\n/**\n * Get the Least Significant Power of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns 2**lsb(a)\n */\nexport function lsp(a: number): number {\n    return u32(a & -a);\n}\n/**\n * Get the Least Significant Power Set of a 32-bit unsigned number.\n *\n * Example: 54 (110110) -> 6 (000110)\n *\n * @param a\n */\nexport function lsps(a: number): number {\n    return u32(a & (lsp(a + lsp(a)) - 1));\n}\n/**\n * Get the Most Significant Power of the Least Significant Power Set of a 32-bit unsigned number.\n *\n * Example: 54 (110110) -> 4 (000100)\n *\n * @param a\n */ /*\nexport function mlsp(a: number): number {\n    return (lsp(a + lsp(a)) >>> 1) || u32(0x80000000 & a);\n}\n*/\n/**\n * Get the Most Significant Bit of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns ⌊log2(a)⌋ : the highest bit set\n */\nexport function msb(a: number): number {\n    let b = -1;\n    while (a !== 0) {\n        ++b;\n        a >>>= 1;\n    }\n    return b;\n}\n/**\n * Get the Most Significant Power of a 32-bit unsigned number\n *\n * @param a\n *\n * @returns 2**msb(a)\n */\nexport function msp(a: number): number {\n    let b = a & -a;\n    while (a != b) {\n        a ^= b;\n        b = a & -a;\n    }\n    return u32(b);\n}\n/**\n * Get the Most Significant Power Set of a 32-bit unsigned number.\n *\n * Example: 50 (110010) -> 48 (110000)\n *\n * @param a\n */\nexport function msps(a: number): number {\n    let b = a & -a;\n    while (a & (a + b)) {\n        a ^= b;\n        b = a & -a;\n    }\n    return u32(a);\n}\n/**\n * Reverse a 32-bit unsigned number.\n *\n * Example: 50 (110010) -> 19 (010011)\n *\n * @param a\n */\nexport function reverse(a: number): number {\n    a = ((a & 0xaaaaaaaa) >>> 1) | ((a & 0x55555555) << 1);\n    a = ((a & 0xcccccccc) >>> 2) | ((a & 0x33333333) << 2);\n    a = ((a & 0xf0f0f0f0) >>> 4) | ((a & 0x0f0f0f0f) << 4);\n    a = ((a & 0xff00ff00) >>> 8) | ((a & 0x00ff00ff) << 8);\n    return u32((a >>> 16) | (a << 16));\n}\n/**\n * Turn a number into an unsigned 32-bit number\n *\n * @param a\n */\nexport function u32(a: number): number {\n    return a >>> 0;\n}\n","import { Queue } from './queue';\n\n/**\n * An implementation of the {@link Queue} interface using an array\n */\nexport class ArrayQueue<T> implements Queue<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: T[];\n    /**\n     * Instantiate the queue.\n     *\n     * @param elements - A set of elements to initialize the queue with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.array = elements ? Array.from(elements) : [];\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    dequeue(): T | undefined {\n        return this.size < 1 ? undefined : this.array.shift();\n    }\n\n    enqueue(element: T): number {\n        return this.array.push(element);\n    }\n\n    peek(): T | undefined {\n        return this.size < 1 ? undefined : this.array[0];\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n    /**\n     * Receive an iterator through the queue.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the queue\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.array[Symbol.iterator]();\n    }\n}\n","import { LinkedList, List } from '../list';\nimport { Queue } from './queue';\n\n/**\n * A linked list implementation of the {@link Queue} interface\n */\nexport class LinkedQueue<T> implements Queue<T> {\n    /**\n     * The list containing every element.\n     */\n    protected list: List<T>;\n    /**\n     * Instantiate the queue.\n     *\n     * @param elements - A set of elements to initialize the queue with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.list = new LinkedList(elements);\n    }\n\n    clear(): void {\n        this.list.clear();\n    }\n\n    dequeue(): T | undefined {\n        return this.list.shift();\n    }\n\n    enqueue(element: T): number {\n        return this.list.push(element);\n    }\n\n    peek(): T | undefined {\n        return this.list.get(0);\n    }\n\n    get size(): number {\n        return this.list.size;\n    }\n    /**\n     * Receive an iterator through the queue.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the queue\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.list[Symbol.iterator]();\n    }\n}\n","import { lsb, lsp, msb, msp } from '../math/u32';\nimport { CombineFn } from '..';\nimport { MAX_ARRAY_LENGTH } from 'src/collection/arrayUtils';\nimport { SegmentTree } from './segmentTree';\n\n/*\n    mca(a, b) = lsp(a | msp(b - a)) ; // where a <= b\n    left(i) = i - (lsp(i + 1) >>> 1)\n    right(i) = i + (lsp(i + 1) >>> 1)\n    parent(i) =\n        offset = lsp(i + 1)\n        i + offset - ((i & 2*offset) >>> 0)\n*/\n\n/**\n * A {@link SegmentTree} with entries stored in in-order traversal.\n * Inspired by [Tristan Hume's IForestIndex](https://thume.ca/2021/03/14/iforests) ([github](https://github.com/trishume/gigatrace))\n */\nexport class InOrderSegmentTree<T> implements SegmentTree<T> {\n    /**\n     * The maximum amount of elements that can be added.\n     *\n     * n elements require 2n memory.\n     */\n    static readonly MAX_SIZE: number = MAX_ARRAY_LENGTH >>> 1;\n    /**\n     * The set of elements and aggregation nodes for the tree\n     */\n    protected array: T[];\n    /**\n     * The function used to aggregate elements\n     */\n    protected combine: CombineFn<T>;\n    /**\n     * Construct a new segment tree\n     *\n     * @param combine - The function used to aggregate segment information\n     * @param elements - A set of elements to add into the initial tree\n     */\n    constructor(combine: CombineFn<T>, elements: Iterable<T> = []) {\n        this.array = [];\n        this.combine = combine;\n        this.build(elements);\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    pop(): T | undefined {\n        // Sanitize range\n        if (this.size < 1) {\n            return undefined;\n        }\n\n        // Un-complete aggregation nodes\n        const i = this.array.length - 1;\n        for (let mask = 2; i & mask; mask *= 2) {\n            this.array[i - mask] = this.array[i - mask - (mask >>> 1)];\n        }\n\n        // Return element\n        const out = this.array[i - 1];\n        this.array.length -= 2;\n        return out;\n    }\n\n    push(element: T): number {\n        // Sanitize range\n        if (this.size >= InOrderSegmentTree.MAX_SIZE) {\n            throw new RangeError(`Invalid length`);\n        }\n\n        // Add element\n        const i = this.array.length;\n        this.array[i + 1] = this.set(i, element);\n\n        return this.size;\n    }\n\n    query(min: number, max: number): T {\n        // Sanitize range\n        if (min >= max) {\n            throw new RangeError(`Range [${min}..${max}) is empty`);\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices\n        min *= 2;\n        max *= 2;\n\n        // Jump to min's highest aggregation node that is fully within the range\n        let offset = lsp(min | msp(max - min));\n        let value = this.array[min - 1 + (offset >>> 1)];\n\n        // Continue jumping aggregation nodes until max is reached\n        for (min += offset; min < max; min += offset) {\n            offset = lsp(min | msp(max - min));\n            value = this.combine(value, this.array[min - 1 + (offset >>> 1)]);\n        }\n\n        return value;\n    }\n\n    get size(): number {\n        return this.array.length >>> 1;\n    }\n\n    /**\n     * Return an iterator through the tree's elements\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let i = 0; i < this.array.length; i += 2) {\n            yield this.array[i];\n        }\n    }\n\n    update(min: number, max: number, operation: (element: T, index: number) => T): void {\n        // Sanitize range\n        if (min >= max) {\n            return;\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices\n        min *= 2;\n        max *= 2;\n\n        // Update the values\n        let value: T;\n        do {\n            value = this.set(min, operation(this.array[min], min >>> 1));\n            min += 2;\n        } while (min < max);\n\n        // Update remaining aggregation nodes\n        let dc = 0;\n        let dp = lsp(min);\n        max = msb(min ^ this.array.length) - lsb(min);\n        for (--min; max > 0; --max) {\n            value = this.combine(value, this.array[min + (dp >>> 1) - dc]);\n            this.array[min] = value;\n            dc = (min & (2 * dp)) >>> 0;\n            min += dp - dc;\n            dp *= 2;\n        }\n\n        // Update the incomplete aggregation node\n        this.array[min] = value;\n    }\n    /**\n     * A helper method used to build the tree\n     *\n     * @param elements The initial set of elements to add into the tree\n     */\n    protected build(elements: Iterable<T>) {\n        for (const element of elements) {\n            this.push(element);\n        }\n    }\n    /**\n     * A helper method to update complete aggregation nodes for an index\n     */\n    protected set(index: number, element: T): T {\n        // Set the index\n        this.array[index++] = element;\n\n        // Update complete aggregation nodes, from lowest to highest\n        for (let mask = 2; index & mask; mask *= 2) {\n            element = this.combine(this.array[index - mask - (mask >>> 1)], element);\n            this.array[index - mask] = element;\n        }\n\n        return element;\n    }\n}\n","/**\n *  Thanks to [Douglas Wilhelm Harder](https://ece.uwaterloo.ca/~dwharder/aads/Algorithms/Array_resizing/)\n *  for their analysis on array resizing\n */\nimport { isArray, MAX_ARRAY_LENGTH } from 'src/collection/arrayUtils';\nimport { isCollection } from 'src/collection';\nimport { Collection } from 'src/collection/collection';\nimport { CombineFn } from '..';\nimport { isPow2, lsp, msp } from '../math/u32';\nimport { SegmentTree } from './segmentTree';\n\n/**\n * A {@link SegmentTree} with entries stored in level-order traversal.\n * Memory usage: n elements require between 2n-1 to 4(n-1)-1 entries\n *\n */\nexport class LevelOrderSegmentTree<T> implements SegmentTree<T> {\n    /**\n     * The maximum number of elements that can be added.\n     *\n     * n elements require 2^⌈log2(2n)⌉ - 1 memory:\n     */\n    static readonly MAX_SIZE: number = (MAX_ARRAY_LENGTH + 1) / 2;\n    /**\n     * The internal array used to store elements and aggregation nodes\n     */\n    protected array: Array<T>;\n    /**\n     * The function used to aggregate elements\n     */\n    protected combine: CombineFn<T>;\n    /**\n     * The used length (size) of our internal array\n     */\n    protected length: number;\n    /**\n     * The start index for the lowest level\n     */\n    protected level: number;\n    /**\n     * Construct a new {@link SegmentTree}\n     *\n     * @param combinFn - The function used to aggregate elements\n     * @param elements - Initial elements to build into the tree\n     */\n    constructor(combine: CombineFn<T>, elements: Iterable<T> = []) {\n        this.array = [];\n        this.combine = combine;\n        this.length = 0;\n        this.level = 0;\n        this.build(elements);\n    }\n\n    clear(): void {\n        this.length = 0;\n        this.level = 0;\n        this.array.length = 0;\n    }\n\n    pop(): T | undefined {\n        // Sanitize range\n        if (this.length <= this.level) {\n            return undefined;\n        }\n\n        // Remove element\n        const out = this.array[--this.length];\n\n        // If level is <= 1/4 full\n        if (this.length <= (this.array.length + 1) >>> 2) {\n            this.shrink();\n        }\n\n        return out;\n    }\n\n    push(element: T): number {\n        // If array is full\n        if (this.length >= this.array.length) {\n            this.grow();\n        }\n\n        // Add the new element\n        this.array[this.length++] = element;\n\n        // Update aggregation nodes\n        for (let i = this.length; i & 1; this.array[i - 1] = element) {\n            element = this.combine(this.array[i - 2], element);\n            i >>>= 1;\n        }\n\n        return this.size;\n    }\n\n    query(min: number, max: number): T {\n        // Sanitize range\n        if (min >= max) {\n            throw new RangeError(`Range [${min}..${max}) is empty`);\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices and align with powers of 2\n        min += this.level + 1;\n        max += this.level + 1;\n\n        // Take the longest possible jump from min\n        let offset = lsp(min | msp(max - min));\n        let value: T = this.array[min / offset - 1];\n        min += offset;\n\n        // Continue jumping until max\n        while (min < max) {\n            offset = lsp(min | msp(max - min));\n            value = this.combine(value, this.array[min / offset - 1]);\n            min += offset;\n        }\n\n        return value;\n    }\n\n    get size(): number {\n        return this.length - this.level;\n    }\n\n    /**\n     * Return an iterator through the elements\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (let i = 0; i < this.size; ++i) {\n            yield this.array[this.level + i];\n        }\n    }\n\n    update(min: number, max: number, operation: (element: T, index: number) => T): void {\n        // Sanitize range\n        if (min >= max) {\n            return;\n        }\n        if (min < 0 || max > this.size) {\n            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);\n        }\n\n        // Translate range to interior indices\n        min += this.level;\n        max += this.level;\n\n        // Update the range\n        for (let i = min; i < max; ++i) {\n            this.array[i] = operation(this.array[i], i - this.level);\n        }\n\n        // Update the range's aggregation nodes\n        this.aggregate(min, max);\n    }\n    /**\n     * A helper method to aggregate a range of elements\n     */\n    protected aggregate(min: number, max: number): void {\n        // Align indices with powers of 2\n        ++min;\n        ++max;\n\n        // Aggregate elements\n        for (let cap = this.length + 1; min < max; cap >>>= 1) {\n            max += max & ((max - cap) >>> 31);\n            for (let i = (min | 1) >>> 0; i < max; i += 2) {\n                this.array[(i >>> 1) - 1] = this.combine(this.array[i - 2], this.array[i - 1]);\n            }\n            min >>>= 1;\n            max >>>= 1;\n        }\n    }\n    /**\n     * A helper method used to build the tree\n     *\n     * @param elements The initial set of elements to add into the tree\n     */\n    protected build(elements: Collection<T> | Iterable<T>): void {\n        let key: string | undefined = undefined;\n\n        // Check if the iterable's size can be known.\n        if (isArray(elements)) {\n            key = 'length';\n        } else if (isCollection(elements)) {\n            key = 'size';\n        } else {\n            for (const element of elements) {\n                this.push(element);\n            }\n            return;\n        }\n\n        // Get the iterable's size\n        const n: number = (elements as any)[key];\n\n        // Check for base case\n        if (n < 1) {\n            this.array.length = 0;\n            this.length = 0;\n            this.level = 0;\n            return;\n        }\n\n        // Check if max capacity reached\n        if (n >= LevelOrderSegmentTree.MAX_SIZE) {\n            throw new RangeError('Invalid length');\n        }\n\n        // Allocate the array\n        this.level = 2 * msp(n - 1) - 1;\n        this.length = this.level;\n        this.array.length = 2 * this.level + 1;\n\n        // Add the elements\n        for (const element of elements) {\n            this.array[this.length++] = element;\n        }\n\n        // Update aggregation nodes\n        this.aggregate(this.level, this.length);\n    }\n    /**\n     * Shift the tree down a level\n     */\n    protected grow(): void {\n        // Check base case\n        if (this.size < 1) {\n            this.array.length = 1;\n            return;\n        }\n\n        // Check if max capacity reached\n        if (this.size >= LevelOrderSegmentTree.MAX_SIZE) {\n            throw new RangeError('Invalid length');\n        }\n\n        // Extend capacity\n        this.array.length += this.array.length + 1;\n\n        // Shift the tree down a level\n        let min = this.level + 1;\n        for (let max = this.length + 1; min < max; max >>>= 1) {\n            this.array.copyWithin(2 * min - 1, min - 1, max - 1);\n            min >>>= 1;\n        }\n\n        // Update pointers\n        this.length += this.level + 1;\n        this.level += this.level + 1;\n    }\n    /**\n     * Shrink the tree to the smallest size\n     */\n    protected shrink(): void {\n        const length = this.length - this.level;\n\n        // Check base case\n        if (length < 2) {\n            this.array.copyWithin(0, this.level, this.length);\n            this.level = 0;\n            this.length = length;\n            this.array.length = length;\n            return;\n        }\n\n        // Get the highest node\n        let min = this.level + 1;\n        let mask = msp(length);\n        min = min / lsp(min | mask) - 1;\n\n        // Update the tree\n        this.level = +!isPow2(length);\n        for (let max = min + 1; mask; this.level += this.level + 1) {\n            this.array.copyWithin(this.level, min, max);\n            mask >>>= 1;\n            min += min + 1;\n            max += max + 2 + +((length & mask) > 0);\n        }\n\n        // Update pointers\n        this.length = this.level + length;\n        this.array.length = 2 * this.level + 1;\n    }\n}\n","import { Stack } from './stack';\n\n/**\n * An implementation of the {@link Stack} interface using an array\n */\nexport class ArrayStack<T> implements Stack<T> {\n    /**\n     * The array containing every element.\n     */\n    protected array: T[];\n    /**\n     * Instantiate the stack.\n     *\n     * @param elements - A set of elements to initialize the stack with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.array = elements ? Array.from(elements) : [];\n    }\n\n    clear(): void {\n        this.array.length = 0;\n    }\n\n    peek(): T | undefined {\n        return this.array[this.array.length - 1];\n    }\n\n    pop(): T | undefined {\n        return this.array.pop();\n    }\n\n    push(element: T): number {\n        return this.array.push(element);\n    }\n\n    get size(): number {\n        return this.array.length;\n    }\n    /**\n     * Receive an iterator through the stack.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the stack\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        const array = this.array;\n        for (let i = array.length; i > 0; yield array[--i]) {}\n    }\n}\n","import { LinkedList, List } from '../list';\nimport { Stack } from './stack';\n\n/**\n * A linked list implementation of the {@link Stack} interface\n */\nexport class LinkedStack<T> implements Stack<T> {\n    /**\n     * The list containing every element.\n     */\n    protected list: List<T>;\n    /**\n     * Instantiate the stack.\n     *\n     * @param elements - A set of elements to initialize the stack with.\n     */\n    constructor(elements?: Iterable<T>) {\n        this.list = new LinkedList();\n        for (const element of elements || []) {\n            this.push(element);\n        }\n    }\n\n    clear(): void {\n        this.list.clear();\n    }\n\n    peek(): T | undefined {\n        return this.list.get(0);\n    }\n\n    pop(): T | undefined {\n        return this.list.shift();\n    }\n\n    push(element: T): number {\n        return this.list.unshift(element);\n    }\n\n    get size(): number {\n        return this.list.size;\n    }\n    /**\n     * Receive an iterator through the stack.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the stack\n     */\n    [Symbol.iterator](): Iterator<T> {\n        return this.list[Symbol.iterator]();\n    }\n}\n","import { CompareFn } from '..';\nimport { AATreeNode } from './aaTreeNode';\nimport {\n    clone,\n    search,\n    Edge,\n    inOrderTraverse,\n    leftmost,\n    leftmostStack,\n    preOrderTraverse,\n    removeStack,\n    rightmost,\n    rightmostStack,\n    searchStack,\n    debug,\n} from './binaryTreeUtils';\nimport { SortedTree } from './sortedTree';\nimport { isArray } from 'src/collection/arrayUtils';\nimport { LinkedNode } from 'src/list';\n\n/**\n * An AA tree is a form of balanced tree used for storing and retrieving ordered data efficiently\n * ([source](https://en.wikipedia.org/wiki/AA_tree)).\n *\n * AA trees are named for Arne Andersson, their inventor. They are a variation of the red–black tree,\n * which supports efficient addition and deletion of entries. Unlike red–black trees, additional\n * constraints on the balancing mechanism greatly simplifies the implementation as well as\n * maintenance operations; While a red–black tree needs to consider seven different shapes\n * to properly balance the tree, an AA tree only needs to consider two shapes.\n *\n * The performance of an AA tree is equivalent to the performance of a red–black tree.\n * While an AA tree makes more rotations than a red-black tree, the simpler algorithms\n * tend to be faster, which balances out to similar performance. A red-black tree is\n * more consistent in its performance, but an AA tree tends to be flatter, which results\n * in slightly faster search times.\n */\nexport class AATree<T> implements SortedTree<T> {\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * Indicates how to handle duplicates:\n     * - < 0 : Add to left subtree\n     * - = 0 : Do now allow duplicates\n     * - > 0 : Add to right subtree\n     */\n    protected dupeWeight: number;\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The node at the \"top\" of the heap.\n     */\n    protected root: AATreeNode<T> | undefined;\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>);\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param allowDuplicates - Whether to allow duplicates\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, allowDuplicates: boolean, elements?: Iterable<T>);\n    constructor(\n        compareFn: CompareFn<T>,\n        allowDuplicates?: boolean | Iterable<T>,\n        elements?: Iterable<T>,\n    ) {\n        if (typeof allowDuplicates !== 'boolean') {\n            elements = allowDuplicates;\n            allowDuplicates = true;\n        }\n        this.compare = compareFn;\n        this.dupeWeight = +allowDuplicates;\n        this.length = 0;\n        this.build(elements ?? []);\n    }\n\n    add(element: T): this {\n        // Find the element\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        let edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        let stack = searchStack(element, { value: edge }, this.compare, this.dupeWeight);\n\n        // If element already exists\n        if (stack.value.to != null) {\n            return this;\n        }\n\n        // Add element\n        edge = stack.value;\n        let label = edge.label;\n        edge.from![label!] = { level: 1, value: element };\n\n        // Balance the tree\n        while (stack.next) {\n            stack = stack.next;\n            edge = stack.value;\n            edge.to = split(skew(edge.to));\n            edge.from![(label = edge.label!)] = edge.to;\n        }\n\n        // Update state\n        ++this.length;\n        this.root = sentinel.left;\n        return this;\n    }\n\n    clear(): void {\n        this.root = undefined;\n        this.length = 0;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    delete(element: T): boolean {\n        // Remove the element if found\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        const edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        const stack = searchStack(element, { value: edge }, this.compare, 0);\n        const removed = remove(stack);\n\n        // Update state\n        this.root = sentinel.left;\n        this.length -= +removed;\n        return removed;\n    }\n\n    has(element: T): boolean {\n        return search(element, this.root, this.compare) != null;\n    }\n\n    max(): T | undefined {\n        return rightmost(this.root)?.value;\n    }\n\n    min(): T | undefined {\n        return leftmost(this.root)?.value;\n    }\n\n    pop(): T | undefined {\n        // Find the maximum value\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        const edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        const stack = rightmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.root = sentinel.left;\n        this.length -= +removed;\n        return value;\n    }\n\n    shift(): T | undefined {\n        // Find the minimum value\n        const sentinel = { left: this.root } as AATreeNode<T>;\n        const edge: Edge<AATreeNode<T>> = { from: sentinel, label: 'left', to: this.root };\n        const stack = leftmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.root = sentinel.left;\n        this.length -= +removed;\n        return value;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    *sorted(): Iterable<T> {\n        for (const node of inOrderTraverse(this.root)) {\n            yield node.value;\n        }\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of preOrderTraverse(this.root)) {\n            yield node.value;\n        }\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        if (this.delete(curElement)) {\n            this.add(newElement);\n            return true;\n        }\n        return false;\n    }\n\n    protected build(obj: Iterable<T>): void {\n        if (isArray(obj)) {\n            for (let i = 0; i < obj.length; ++i) {\n                this.add(obj[i]);\n            }\n        } else if (obj instanceof AATree && this.compare === obj.compare) {\n            this.root = clone(obj.root);\n            this.length = obj.size;\n        } else {\n            for (const element of obj) {\n                this.add(element);\n            }\n        }\n    }\n}\n/**\n * @internal\n */\nexport function remove<T>(stack: LinkedNode<Edge<AATreeNode<T>>>): boolean {\n    let edge = stack.value;\n    let node = edge.to;\n\n    // If not found\n    if (node == null) {\n        return false;\n    }\n\n    // Remove the node\n    stack = removeStack(stack);\n\n    // Update the tree\n    while (stack.next) {\n        stack = stack.next;\n        edge = stack.value;\n        node = edge.to!;\n\n        // Decrease levels\n        const level = 1 + Math.min(node.left?.level ?? 0, node.right?.level ?? 0);\n        if (level < node.level) {\n            node.level = level;\n            if (node.right != null && level < node.right.level) {\n                node.right.level = level;\n            }\n        }\n\n        // Balance\n        node = skew(node);\n        node.right = skew(node.right);\n        if (node.right != null) {\n            node.right.right = skew(node.right.right);\n        }\n        node = split(node);\n        node.right = split(node.right);\n\n        // Make the update\n        edge.from![edge.label!] = edge.to = node;\n    }\n\n    return true;\n}\n/**\n * @internal\n */\nexport function skew<T>(node?: undefined): undefined;\nexport function skew<T>(node: AATreeNode<T>): AATreeNode<T>;\nexport function skew<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined;\nexport function skew<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined {\n    if (node == null || node.left == null || node.level != node.left.level) {\n        return node;\n    }\n    const left = node.left;\n    node.left = left.right;\n    left.right = node;\n    return left;\n}\n/**\n * @internal\n */\nexport function split<T>(node?: undefined): undefined;\nexport function split<T>(node: AATreeNode<T>): AATreeNode<T>;\nexport function split<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined;\nexport function split<T>(node?: AATreeNode<T>): AATreeNode<T> | undefined {\n    if (\n        node == null ||\n        node.right == null ||\n        node.right.right == null ||\n        node.level != node.right.right.level\n    ) {\n        return node;\n    }\n    const right = node.right;\n    node.right = right.left;\n    right.left = node;\n    ++right.level;\n    return right;\n}\n","import { CompareFn } from 'src';\nimport { AVLTreeNode } from './avlTreeNode';\nimport {\n    clone,\n    search,\n    Edge,\n    inOrderTraverse,\n    leftmost,\n    leftmostStack,\n    preOrderTraverse,\n    rightmost,\n    rightmostStack,\n    searchStack,\n    removeStack,\n} from './binaryTreeUtils';\nimport { SortedTree } from './sortedTree';\nimport { isArray } from 'src/collection/arrayUtils';\nimport { LinkedNode } from 'src/list';\n\n/**\n * An AVL tree is a self-balancing binary search tree ([source](https://en.wikipedia.org/wiki/AVL_tree)).\n *\n * It is named after inventors Georgy Adelson-Velsky and Evgenii Landis and was the first such\n * data structure to be invented. In an AVL tree, the heights of the two child\n * subtrees of any node differ by at most one; if at any time they differ by more\n * than one, rebalancing is done to restore this property.\n *\n * Lookup, insertion, and deletion all take O(log(n)) time in both the average and worst cases,\n * where n is the number of nodes in the tree prior to the operation. Insertions and deletions\n * may require the tree to be rebalanced by one or more tree rotations.\n *\n * AVL trees are often compared with red–black trees as both take O(log(n))\n * time for the basic operations. For lookup-intensive applications, AVL trees are\n * faster than red–black trees because they are more strictly balanced.\n * Similar to red–black trees, AVL trees are height-balanced.\n */\nexport class AVLTree<T> implements SortedTree<T> {\n    /**\n     * The function to determine the order of elements.\n     */\n    protected compare: CompareFn<T>;\n    /**\n     * Indicates how to handle duplicates:\n     * - < 0 : Add to left subtree\n     * - = 0 : Do now allow duplicates\n     * - > 0 : Add to right subtree\n     */\n    protected dupeWeight: number;\n    /**\n     * The number of elements in the list.\n     */\n    protected length: number;\n    /**\n     * The root of the tree.\n     */\n    protected root: AVLTreeNode<T>;\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, elements?: Iterable<T>);\n    /**\n     * Instantiate a tree.\n     *\n     * @param compareFn - The function to determine the order of elements.\n     * @param allowDuplicates - Whether to allow duplicates\n     * @param elements - A set of elements to initialize the tree with.\n     */\n    constructor(compareFn: CompareFn<T>, allowDuplicates: boolean, elements?: Iterable<T>);\n    constructor(\n        compareFn: CompareFn<T>,\n        allowDuplicates?: boolean | Iterable<T>,\n        elements?: Iterable<T>,\n    ) {\n        if (typeof allowDuplicates !== 'boolean') {\n            elements = allowDuplicates;\n            allowDuplicates = true;\n        }\n        this.compare = compareFn;\n        this.dupeWeight = +allowDuplicates;\n        this.length = 0;\n        this.root = {} as AVLTreeNode<T>;\n        this.build(elements ?? []);\n    }\n\n    add(element: T): this {\n        // Find the element\n        let edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        let stack = searchStack(element, { value: edge }, this.compare, this.dupeWeight);\n\n        // If element already exists\n        if (stack.value.to != null) {\n            return this;\n        }\n\n        // Add element\n        edge = stack.value;\n        let label = edge.label;\n        edge.from![label!] = { balanceFactor: 0, value: element };\n\n        // Balance the tree\n        while (stack.next) {\n            stack = stack.next;\n            edge = stack.value;\n            edge.to!.balanceFactor += label === 'left' ? -1 : 1;\n            edge.to = balance(edge.to!);\n            edge.from![(label = edge.label!)] = edge.to;\n            if (edge.to!.balanceFactor === 0) {\n                break;\n            }\n        }\n\n        // Update state\n        ++this.length;\n        return this;\n    }\n\n    clear(): void {\n        this.root.left = undefined;\n        this.length = 0;\n    }\n\n    comparator(): CompareFn<T> {\n        return this.compare;\n    }\n\n    delete(element: T): boolean {\n        // Remove the element if found\n        const edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        const stack = searchStack(element, { value: edge }, this.compare, 0);\n        const removed = remove(stack);\n\n        // Update state\n        this.length -= +removed;\n        return removed;\n    }\n\n    has(element: T): boolean {\n        return search(element, this.root.left, this.compare) != null;\n    }\n\n    max(): T | undefined {\n        return rightmost(this.root.left)?.value;\n    }\n\n    min(): T | undefined {\n        return leftmost(this.root.left)?.value;\n    }\n\n    pop(): T | undefined {\n        // Find the maximum value\n        const edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        const stack = rightmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.length -= +removed;\n        return value;\n    }\n\n    shift(): T | undefined {\n        // Find the minimum value\n        const edge: Edge<AVLTreeNode<T>> = { from: this.root, label: 'left', to: this.root.left };\n        const stack = leftmostStack({ value: edge });\n        const value = stack.value.to?.value;\n\n        // Remove the value\n        const removed = remove(stack);\n\n        // Update state\n        this.length -= +removed;\n        return value;\n    }\n\n    get size(): number {\n        return this.length;\n    }\n\n    *sorted(): Iterable<T> {\n        for (const node of inOrderTraverse(this.root.left)) {\n            yield node.value;\n        }\n    }\n    /**\n     * Receive an iterator through the list.\n     *\n     * **Note:** Unexpected behavior can occur if the collection is modified during iteration.\n     *\n     * @returns An iterator through the list\n     */\n    *[Symbol.iterator](): Iterator<T> {\n        for (const node of preOrderTraverse(this.root.left)) {\n            yield node.value;\n        }\n    }\n\n    update(curElement: T, newElement: T): boolean {\n        if (this.delete(curElement)) {\n            this.add(newElement);\n            return true;\n        }\n        return false;\n    }\n\n    protected build(obj: Iterable<T>): void {\n        if (isArray(obj)) {\n            for (let i = 0; i < obj.length; ++i) {\n                this.add(obj[i]);\n            }\n        } else if (obj instanceof AVLTree && this.compare === obj.compare) {\n            this.root = clone(obj.root);\n            this.length = obj.size;\n        } else {\n            for (const element of obj) {\n                this.add(element);\n            }\n        }\n    }\n}\n/**\n * @internal\n */\nexport function balance<T>(node: AVLTreeNode<T>): AVLTreeNode<T> {\n    if (node.balanceFactor > 1) {\n        if (node.right!.balanceFactor < 0) {\n            node.right = rotateR(node.right!);\n        }\n        node = rotateL(node);\n    } else if (node.balanceFactor < -1) {\n        if (node.left!.balanceFactor > 0) {\n            node.left = rotateL(node.left!);\n        }\n        node = rotateR(node);\n    }\n    return node;\n}\n/**\n * @internal\n */\nexport function remove<T>(stack: LinkedNode<Edge<AVLTreeNode<T>>>): boolean {\n    let edge = stack.value;\n    const node = edge.to;\n\n    // If not found\n    if (node == null) {\n        return false;\n    }\n\n    // Remove the node\n    stack = removeStack(stack);\n\n    // Balance the tree\n    let label = stack.value.label;\n    while (stack.next) {\n        stack = stack.next;\n        edge = stack.value;\n        edge.to!.balanceFactor -= label === 'left' ? -1 : 1;\n        edge.to = balance(edge.to!);\n        edge.from![(label = edge.label)!] = edge.to;\n        if (edge.to!.balanceFactor !== 0) {\n            break;\n        }\n    }\n\n    return true;\n}\n/**\n * @internal\n */\nexport function rotateL<T>(P: AVLTreeNode<T>): AVLTreeNode<T> {\n    const R = P.right!;\n    P.right = R.left;\n    R.left = P;\n    P.balanceFactor -= 1 + Math.max(0, R.balanceFactor);\n    R.balanceFactor -= 1 - Math.min(0, P.balanceFactor);\n    return R;\n}\n/**\n * @internal\n */\nexport function rotateR<T>(P: AVLTreeNode<T>): AVLTreeNode<T> {\n    const L = P.left!;\n    P.left = L.right;\n    L.right = P;\n    P.balanceFactor += 1 - Math.min(0, L.balanceFactor);\n    L.balanceFactor += 1 + Math.max(0, P.balanceFactor);\n    return L;\n}\n"],"sourceRoot":""}
\ No newline at end of file
diff --git a/docs/README.md b/docs/README.md
index caafe2c..470fc76 100644
--- a/docs/README.md
+++ b/docs/README.md
@@ -1,12 +1,15 @@
-dastal - v3.0.0
+dastal - v4.0.0
 
-# dastal - v3.0.0
+# dastal - v4.0.0
 
 ## Table of contents
 
 ### Namespaces
 
-- [math](modules/math.md)
+- [ArrayUtils](modules/arrayutils.md)
+- [IteratorUtils](modules/iteratorutils.md)
+- [NumberUtils](modules/numberutils.md)
+- [u32](modules/u32.md)
 
 ### Classes
 
@@ -29,6 +32,7 @@ dastal - v3.0.0
 - [AATreeNode](interfaces/aatreenode.md)
 - [AVLTreeNode](interfaces/avltreenode.md)
 - [BinaryTreeNode](interfaces/binarytreenode.md)
+- [Collection](interfaces/collection.md)
 - [DoublyLinkedNode](interfaces/doublylinkednode.md)
 - [Heap](interfaces/heap.md)
 - [LinkedNode](interfaces/linkednode.md)
@@ -46,6 +50,10 @@ dastal - v3.0.0
 - [CombineFn](README.md#combinefn)
 - [CompareFn](README.md#comparefn)
 
+### Functions
+
+- [isCollection](README.md#iscollection)
+
 ## Type aliases
 
 ### CombineFn
@@ -86,7 +94,7 @@ the inputs, depending on the use case.
 
 #### Defined in
 
-[src/index.ts:21](https://github.com/havelessbemore/dastal/blob/e94627b/src/index.ts#L21)
+[src/index.ts:21](https://github.com/havelessbemore/dastal/blob/2fe24da/src/index.ts#L21)
 
 ___
 
@@ -128,4 +136,28 @@ A function used to determine the order of a set of elements.
 
 #### Defined in
 
-[src/index.ts:33](https://github.com/havelessbemore/dastal/blob/e94627b/src/index.ts#L33)
+[src/index.ts:33](https://github.com/havelessbemore/dastal/blob/2fe24da/src/index.ts#L33)
+
+## Functions
+
+### isCollection
+
+▸ **isCollection**(`obj`): obj is Collection<unknown\>
+
+Check if a value is a [Collection](interfaces/collection.md).
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `obj` | `any` | The value to check. |
+
+#### Returns
+
+obj is Collection<unknown\>
+
+- `true` if obj is a Collection, `false` otherwise.
+
+#### Defined in
+
+[src/collection/index.ts:14](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/index.ts#L14)
diff --git a/docs/classes/aatree.md b/docs/classes/aatree.md
index 2402446..f4c1ec6 100644
--- a/docs/classes/aatree.md
+++ b/docs/classes/aatree.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / AATree
+[dastal - v4.0.0](../README.md) / AATree
 
 # Class: AATree<T\>
 
@@ -75,7 +75,7 @@ Instantiate a tree.
 
 #### Defined in
 
-[src/tree/aaTree.ts:56](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L56)
+[src/tree/aaTree.ts:56](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L56)
 
 • **new AATree**<T\>(`compareFn`, `allowDuplicates`, `elements?`)
 
@@ -97,7 +97,7 @@ Instantiate a tree.
 
 #### Defined in
 
-[src/tree/aaTree.ts:63](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L63)
+[src/tree/aaTree.ts:63](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L63)
 
 ## Accessors
 
@@ -117,7 +117,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/tree/aaTree.ts:183](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L183)
+[src/tree/aaTree.ts:183](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L183)
 
 ## Methods
 
@@ -141,7 +141,7 @@ An iterator through the list
 
 #### Defined in
 
-[src/tree/aaTree.ts:199](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L199)
+[src/tree/aaTree.ts:199](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L199)
 
 ___
 
@@ -167,7 +167,7 @@ Inserts an element into the tree.
 
 #### Defined in
 
-[src/tree/aaTree.ts:87](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L87)
+[src/tree/aaTree.ts:87](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L87)
 
 ___
 
@@ -187,7 +187,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/tree/aaTree.ts:117](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L117)
+[src/tree/aaTree.ts:117](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L117)
 
 ___
 
@@ -205,7 +205,7 @@ ___
 
 #### Defined in
 
-[src/tree/aaTree.ts:122](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L122)
+[src/tree/aaTree.ts:122](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L122)
 
 ___
 
@@ -231,7 +231,7 @@ Delete an element from the tree.
 
 #### Defined in
 
-[src/tree/aaTree.ts:126](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L126)
+[src/tree/aaTree.ts:126](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L126)
 
 ___
 
@@ -257,7 +257,7 @@ Check if an element is in the tree.
 
 #### Defined in
 
-[src/tree/aaTree.ts:139](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L139)
+[src/tree/aaTree.ts:139](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L139)
 
 ___
 
@@ -277,7 +277,7 @@ Get the maximum element.
 
 #### Defined in
 
-[src/tree/aaTree.ts:143](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L143)
+[src/tree/aaTree.ts:143](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L143)
 
 ___
 
@@ -297,7 +297,7 @@ Get the minimum element.
 
 #### Defined in
 
-[src/tree/aaTree.ts:147](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L147)
+[src/tree/aaTree.ts:147](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L147)
 
 ___
 
@@ -317,7 +317,7 @@ Remove the maximum element.
 
 #### Defined in
 
-[src/tree/aaTree.ts:151](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L151)
+[src/tree/aaTree.ts:151](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L151)
 
 ___
 
@@ -337,7 +337,7 @@ Remove the minimum element.
 
 #### Defined in
 
-[src/tree/aaTree.ts:167](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L167)
+[src/tree/aaTree.ts:167](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L167)
 
 ___
 
@@ -359,7 +359,7 @@ Iterate through the tree in sorted order (i.e in-order traversal).
 
 #### Defined in
 
-[src/tree/aaTree.ts:187](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L187)
+[src/tree/aaTree.ts:187](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L187)
 
 ___
 
@@ -386,4 +386,4 @@ Update a specific element.
 
 #### Defined in
 
-[src/tree/aaTree.ts:205](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTree.ts#L205)
+[src/tree/aaTree.ts:205](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTree.ts#L205)
diff --git a/docs/classes/arraylist.md b/docs/classes/arraylist.md
index 9a43ea5..d3fee98 100644
--- a/docs/classes/arraylist.md
+++ b/docs/classes/arraylist.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / ArrayList
+[dastal - v4.0.0](../README.md) / ArrayList
 
 # Class: ArrayList<T\>
 
@@ -70,7 +70,7 @@ Instantiate the list.
 
 #### Defined in
 
-[src/list/arrayList.ts:13](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L13)
+[src/list/arrayList.ts:13](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L13)
 
 ## Accessors
 
@@ -90,7 +90,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/list/arrayList.ts:116](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L116)
+[src/list/arrayList.ts:113](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L113)
 
 ## Methods
 
@@ -114,7 +114,7 @@ An iterator through the list
 
 #### Defined in
 
-[src/list/arrayList.ts:146](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L146)
+[src/list/arrayList.ts:136](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L136)
 
 ___
 
@@ -141,7 +141,7 @@ Add the element at the specified index.
 
 #### Defined in
 
-[src/list/arrayList.ts:23](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L23)
+[src/list/arrayList.ts:23](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L23)
 
 ___
 
@@ -168,7 +168,7 @@ Add elements at the specified index.
 
 #### Defined in
 
-[src/list/arrayList.ts:30](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L30)
+[src/list/arrayList.ts:30](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L30)
 
 ___
 
@@ -188,7 +188,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/list/arrayList.ts:40](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L40)
+[src/list/arrayList.ts:37](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L37)
 
 ___
 
@@ -214,7 +214,7 @@ Combines the list with multiple iterables into a new list. Does not modify the e
 
 #### Defined in
 
-[src/list/arrayList.ts:44](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L44)
+[src/list/arrayList.ts:41](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L41)
 
 ___
 
@@ -248,7 +248,7 @@ the copied sequence will be trimmed to fit list.size
 
 #### Defined in
 
-[src/list/arrayList.ts:52](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L52)
+[src/list/arrayList.ts:49](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L49)
 
 ___
 
@@ -279,7 +279,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/arrayList.ts:60](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L60)
+[src/list/arrayList.ts:57](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L57)
 
 ___
 
@@ -305,7 +305,7 @@ Return the element at the specified index.
 
 #### Defined in
 
-[src/list/arrayList.ts:67](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L67)
+[src/list/arrayList.ts:64](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L64)
 
 ___
 
@@ -332,7 +332,7 @@ Update the element at the specified index.
 
 #### Defined in
 
-[src/list/arrayList.ts:71](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L71)
+[src/list/arrayList.ts:68](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L68)
 
 ___
 
@@ -352,7 +352,7 @@ Retrieves and removes the end of the list.
 
 #### Defined in
 
-[src/list/arrayList.ts:80](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L80)
+[src/list/arrayList.ts:77](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L77)
 
 ___
 
@@ -378,7 +378,7 @@ Inserts the specified value into the end of the list
 
 #### Defined in
 
-[src/list/arrayList.ts:84](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L84)
+[src/list/arrayList.ts:81](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L81)
 
 ___
 
@@ -407,7 +407,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/arrayList.ts:88](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L88)
+[src/list/arrayList.ts:85](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L85)
 
 ___
 
@@ -437,7 +437,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/arrayList.ts:92](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L92)
+[src/list/arrayList.ts:89](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L89)
 
 ___
 
@@ -464,7 +464,7 @@ Update the element at the specified index.
 
 #### Defined in
 
-[src/list/arrayList.ts:103](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L103)
+[src/list/arrayList.ts:100](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L100)
 
 ___
 
@@ -484,7 +484,7 @@ Retrieves and removes the first element in the list.
 
 #### Defined in
 
-[src/list/arrayList.ts:112](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L112)
+[src/list/arrayList.ts:109](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L109)
 
 ___
 
@@ -514,7 +514,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/arrayList.ts:120](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L120)
+[src/list/arrayList.ts:117](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L117)
 
 ___
 
@@ -540,7 +540,7 @@ Sorts the elements in place.
 
 #### Defined in
 
-[src/list/arrayList.ts:135](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L135)
+[src/list/arrayList.ts:125](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L125)
 
 ___
 
@@ -569,7 +569,7 @@ Returns any deleted elements.
 
 #### Defined in
 
-[src/list/arrayList.ts:124](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L124)
+[src/list/arrayList.ts:121](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L121)
 
 ___
 
@@ -595,7 +595,7 @@ Inserts the specified value into the front of the list
 
 #### Defined in
 
-[src/list/arrayList.ts:150](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L150)
+[src/list/arrayList.ts:140](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L140)
 
 ___
 
@@ -621,7 +621,7 @@ Update the elements of the list
 
 #### Defined in
 
-[src/list/arrayList.ts:154](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L154)
+[src/list/arrayList.ts:144](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L144)
 
 ▸ **update**(`min`, `callback`): [ArrayList](arraylist.md)<T\>
 
@@ -647,7 +647,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/arrayList.ts:155](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L155)
+[src/list/arrayList.ts:145](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L145)
 
 ▸ **update**(`min`, `max`, `callback`): [ArrayList](arraylist.md)<T\>
 
@@ -674,7 +674,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/arrayList.ts:156](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L156)
+[src/list/arrayList.ts:146](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L146)
 
 ___
 
@@ -706,4 +706,4 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/arrayList.ts:184](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/arrayList.ts#L184)
+[src/list/arrayList.ts:174](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/arrayList.ts#L174)
diff --git a/docs/classes/arrayqueue.md b/docs/classes/arrayqueue.md
index 48fe426..1f06e8a 100644
--- a/docs/classes/arrayqueue.md
+++ b/docs/classes/arrayqueue.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / ArrayQueue
+[dastal - v4.0.0](../README.md) / ArrayQueue
 
 # Class: ArrayQueue<T\>
 
@@ -54,7 +54,7 @@ Instantiate the queue.
 
 #### Defined in
 
-[src/queue/arrayQueue.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/arrayQueue.ts#L10)
+[src/queue/arrayQueue.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/arrayQueue.ts#L10)
 
 ## Accessors
 
@@ -74,7 +74,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/queue/arrayQueue.ts:36](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/arrayQueue.ts#L36)
+[src/queue/arrayQueue.ts:36](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/arrayQueue.ts#L36)
 
 ## Methods
 
@@ -98,7 +98,7 @@ An iterator through the queue
 
 #### Defined in
 
-[src/queue/arrayQueue.ts:46](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/arrayQueue.ts#L46)
+[src/queue/arrayQueue.ts:46](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/arrayQueue.ts#L46)
 
 ___
 
@@ -118,7 +118,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/queue/arrayQueue.ts:20](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/arrayQueue.ts#L20)
+[src/queue/arrayQueue.ts:20](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/arrayQueue.ts#L20)
 
 ___
 
@@ -138,7 +138,7 @@ Retrieves and removes the head of this queue
 
 #### Defined in
 
-[src/queue/arrayQueue.ts:24](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/arrayQueue.ts#L24)
+[src/queue/arrayQueue.ts:24](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/arrayQueue.ts#L24)
 
 ___
 
@@ -164,7 +164,7 @@ Inserts the specified value into this queue
 
 #### Defined in
 
-[src/queue/arrayQueue.ts:28](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/arrayQueue.ts#L28)
+[src/queue/arrayQueue.ts:28](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/arrayQueue.ts#L28)
 
 ___
 
@@ -184,4 +184,4 @@ Retrieves, but does not remove, the head of this queue
 
 #### Defined in
 
-[src/queue/arrayQueue.ts:32](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/arrayQueue.ts#L32)
+[src/queue/arrayQueue.ts:32](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/arrayQueue.ts#L32)
diff --git a/docs/classes/arraystack.md b/docs/classes/arraystack.md
index af0463b..a16f454 100644
--- a/docs/classes/arraystack.md
+++ b/docs/classes/arraystack.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / ArrayStack
+[dastal - v4.0.0](../README.md) / ArrayStack
 
 # Class: ArrayStack<T\>
 
@@ -54,7 +54,7 @@ Instantiate the stack.
 
 #### Defined in
 
-[src/stack/arrayStack.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/arrayStack.ts#L10)
+[src/stack/arrayStack.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/arrayStack.ts#L10)
 
 ## Accessors
 
@@ -74,7 +74,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/stack/arrayStack.ts:36](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/arrayStack.ts#L36)
+[src/stack/arrayStack.ts:36](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/arrayStack.ts#L36)
 
 ## Methods
 
@@ -98,7 +98,7 @@ An iterator through the stack
 
 #### Defined in
 
-[src/stack/arrayStack.ts:46](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/arrayStack.ts#L46)
+[src/stack/arrayStack.ts:46](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/arrayStack.ts#L46)
 
 ___
 
@@ -118,7 +118,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/stack/arrayStack.ts:20](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/arrayStack.ts#L20)
+[src/stack/arrayStack.ts:20](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/arrayStack.ts#L20)
 
 ___
 
@@ -138,7 +138,7 @@ Retrieves, but does not remove, the top of the stack
 
 #### Defined in
 
-[src/stack/arrayStack.ts:24](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/arrayStack.ts#L24)
+[src/stack/arrayStack.ts:24](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/arrayStack.ts#L24)
 
 ___
 
@@ -158,7 +158,7 @@ Retrieves and removes the top of the stack
 
 #### Defined in
 
-[src/stack/arrayStack.ts:28](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/arrayStack.ts#L28)
+[src/stack/arrayStack.ts:28](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/arrayStack.ts#L28)
 
 ___
 
@@ -184,4 +184,4 @@ Inserts an element into the stack
 
 #### Defined in
 
-[src/stack/arrayStack.ts:32](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/arrayStack.ts#L32)
+[src/stack/arrayStack.ts:32](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/arrayStack.ts#L32)
diff --git a/docs/classes/avltree.md b/docs/classes/avltree.md
index 3dddd14..73a942e 100644
--- a/docs/classes/avltree.md
+++ b/docs/classes/avltree.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / AVLTree
+[dastal - v4.0.0](../README.md) / AVLTree
 
 # Class: AVLTree<T\>
 
@@ -76,7 +76,7 @@ Instantiate a tree.
 
 #### Defined in
 
-[src/tree/avlTree.ts:56](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L56)
+[src/tree/avlTree.ts:56](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L56)
 
 • **new AVLTree**<T\>(`compareFn`, `allowDuplicates`, `elements?`)
 
@@ -98,7 +98,7 @@ Instantiate a tree.
 
 #### Defined in
 
-[src/tree/avlTree.ts:63](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L63)
+[src/tree/avlTree.ts:63](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L63)
 
 ## Accessors
 
@@ -118,7 +118,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/tree/avlTree.ts:180](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L180)
+[src/tree/avlTree.ts:180](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L180)
 
 ## Methods
 
@@ -142,7 +142,7 @@ An iterator through the list
 
 #### Defined in
 
-[src/tree/avlTree.ts:196](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L196)
+[src/tree/avlTree.ts:196](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L196)
 
 ___
 
@@ -168,7 +168,7 @@ Inserts an element into the tree.
 
 #### Defined in
 
-[src/tree/avlTree.ts:88](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L88)
+[src/tree/avlTree.ts:88](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L88)
 
 ___
 
@@ -188,7 +188,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/tree/avlTree.ts:120](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L120)
+[src/tree/avlTree.ts:120](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L120)
 
 ___
 
@@ -206,7 +206,7 @@ ___
 
 #### Defined in
 
-[src/tree/avlTree.ts:125](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L125)
+[src/tree/avlTree.ts:125](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L125)
 
 ___
 
@@ -232,7 +232,7 @@ Delete an element from the tree.
 
 #### Defined in
 
-[src/tree/avlTree.ts:129](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L129)
+[src/tree/avlTree.ts:129](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L129)
 
 ___
 
@@ -258,7 +258,7 @@ Check if an element is in the tree.
 
 #### Defined in
 
-[src/tree/avlTree.ts:140](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L140)
+[src/tree/avlTree.ts:140](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L140)
 
 ___
 
@@ -278,7 +278,7 @@ Get the maximum element.
 
 #### Defined in
 
-[src/tree/avlTree.ts:144](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L144)
+[src/tree/avlTree.ts:144](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L144)
 
 ___
 
@@ -298,7 +298,7 @@ Get the minimum element.
 
 #### Defined in
 
-[src/tree/avlTree.ts:148](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L148)
+[src/tree/avlTree.ts:148](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L148)
 
 ___
 
@@ -318,7 +318,7 @@ Remove the maximum element.
 
 #### Defined in
 
-[src/tree/avlTree.ts:152](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L152)
+[src/tree/avlTree.ts:152](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L152)
 
 ___
 
@@ -338,7 +338,7 @@ Remove the minimum element.
 
 #### Defined in
 
-[src/tree/avlTree.ts:166](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L166)
+[src/tree/avlTree.ts:166](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L166)
 
 ___
 
@@ -360,7 +360,7 @@ Iterate through the tree in sorted order (i.e in-order traversal).
 
 #### Defined in
 
-[src/tree/avlTree.ts:184](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L184)
+[src/tree/avlTree.ts:184](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L184)
 
 ___
 
@@ -387,4 +387,4 @@ Update a specific element.
 
 #### Defined in
 
-[src/tree/avlTree.ts:202](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTree.ts#L202)
+[src/tree/avlTree.ts:202](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTree.ts#L202)
diff --git a/docs/classes/binaryheap.md b/docs/classes/binaryheap.md
index 0a3bfb9..140e2d2 100644
--- a/docs/classes/binaryheap.md
+++ b/docs/classes/binaryheap.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / BinaryHeap
+[dastal - v4.0.0](../README.md) / BinaryHeap
 
 # Class: BinaryHeap<T\>
 
@@ -79,7 +79,7 @@ Instantiate a heap.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:32](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L32)
+[src/heap/binaryHeap.ts:32](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L32)
 
 ## Accessors
 
@@ -99,7 +99,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:186](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L186)
+[src/heap/binaryHeap.ts:186](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L186)
 
 ## Methods
 
@@ -123,7 +123,7 @@ An iterator through the list
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:213](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L213)
+[src/heap/binaryHeap.ts:213](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L213)
 
 ___
 
@@ -149,7 +149,7 @@ Insert a set of elements into the heap.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:45](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L45)
+[src/heap/binaryHeap.ts:45](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L45)
 
 ___
 
@@ -169,7 +169,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:73](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L73)
+[src/heap/binaryHeap.ts:73](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L73)
 
 ___
 
@@ -187,7 +187,7 @@ ___
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:77](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L77)
+[src/heap/binaryHeap.ts:77](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L77)
 
 ___
 
@@ -213,7 +213,7 @@ Check if an element is in the heap.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:81](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L81)
+[src/heap/binaryHeap.ts:81](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L81)
 
 ___
 
@@ -239,7 +239,7 @@ Delete an element from the heap.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:85](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L85)
+[src/heap/binaryHeap.ts:85](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L85)
 
 ___
 
@@ -266,7 +266,7 @@ contain elements of both. Does not modify the input.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:105](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L105)
+[src/heap/binaryHeap.ts:105](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L105)
 
 ___
 
@@ -286,7 +286,7 @@ Retrieves, but does not remove, the top of the heap.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:124](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L124)
+[src/heap/binaryHeap.ts:124](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L124)
 
 ___
 
@@ -306,7 +306,7 @@ Remove the top of the heap (AKA extract).
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:128](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L128)
+[src/heap/binaryHeap.ts:128](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L128)
 
 ___
 
@@ -332,7 +332,7 @@ Inserts an element into the heap (AKA insert, add).
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:147](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L147)
+[src/heap/binaryHeap.ts:147](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L147)
 
 ___
 
@@ -358,7 +358,7 @@ Insert an element and then remove the top of the heap.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:156](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L156)
+[src/heap/binaryHeap.ts:156](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L156)
 
 ___
 
@@ -384,7 +384,7 @@ Remove the top of the heap and then insert a new element (AKA popPush).
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:169](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L169)
+[src/heap/binaryHeap.ts:169](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L169)
 
 ___
 
@@ -406,7 +406,7 @@ Iterate through the heap in sorted order.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:190](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L190)
+[src/heap/binaryHeap.ts:190](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L190)
 
 ___
 
@@ -433,4 +433,4 @@ Update a specific element.
 
 #### Defined in
 
-[src/heap/binaryHeap.ts:217](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/binaryHeap.ts#L217)
+[src/heap/binaryHeap.ts:217](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/binaryHeap.ts#L217)
diff --git a/docs/classes/doublylinkedlist.md b/docs/classes/doublylinkedlist.md
index 6a6be4d..c56167d 100644
--- a/docs/classes/doublylinkedlist.md
+++ b/docs/classes/doublylinkedlist.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / DoublyLinkedList
+[dastal - v4.0.0](../README.md) / DoublyLinkedList
 
 # Class: DoublyLinkedList<T\>
 
@@ -72,7 +72,7 @@ Instantiate the list.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:20](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L20)
+[src/list/doublyLinkedList.ts:20](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L20)
 
 ## Accessors
 
@@ -92,7 +92,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:201](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L201)
+[src/list/doublyLinkedList.ts:201](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L201)
 
 ## Methods
 
@@ -116,7 +116,7 @@ An iterator through the list
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:250](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L250)
+[src/list/doublyLinkedList.ts:250](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L250)
 
 ___
 
@@ -143,7 +143,7 @@ Add the element at the specified index.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:33](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L33)
+[src/list/doublyLinkedList.ts:33](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L33)
 
 ___
 
@@ -170,7 +170,7 @@ Add elements at the specified index.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:44](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L44)
+[src/list/doublyLinkedList.ts:44](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L44)
 
 ___
 
@@ -190,7 +190,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:51](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L51)
+[src/list/doublyLinkedList.ts:51](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L51)
 
 ___
 
@@ -216,7 +216,7 @@ Combines the list with multiple iterables into a new list. Does not modify the e
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:56](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L56)
+[src/list/doublyLinkedList.ts:56](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L56)
 
 ___
 
@@ -250,7 +250,7 @@ the copied sequence will be trimmed to fit list.size
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:64](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L64)
+[src/list/doublyLinkedList.ts:64](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L64)
 
 ___
 
@@ -281,7 +281,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:102](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L102)
+[src/list/doublyLinkedList.ts:102](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L102)
 
 ___
 
@@ -307,7 +307,7 @@ Return the element at the specified index.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:115](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L115)
+[src/list/doublyLinkedList.ts:115](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L115)
 
 ___
 
@@ -334,7 +334,7 @@ Update the element at the specified index.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:119](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L119)
+[src/list/doublyLinkedList.ts:119](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L119)
 
 ___
 
@@ -354,7 +354,7 @@ Retrieves and removes the end of the list.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:129](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L129)
+[src/list/doublyLinkedList.ts:129](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L129)
 
 ___
 
@@ -380,7 +380,7 @@ Inserts the specified value into the end of the list
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:140](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L140)
+[src/list/doublyLinkedList.ts:140](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L140)
 
 ___
 
@@ -409,7 +409,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:147](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L147)
+[src/list/doublyLinkedList.ts:147](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L147)
 
 ___
 
@@ -439,7 +439,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:158](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L158)
+[src/list/doublyLinkedList.ts:158](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L158)
 
 ___
 
@@ -466,7 +466,7 @@ Update the element at the specified index.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:180](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L180)
+[src/list/doublyLinkedList.ts:180](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L180)
 
 ___
 
@@ -486,7 +486,7 @@ Retrieves and removes the first element in the list.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:190](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L190)
+[src/list/doublyLinkedList.ts:190](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L190)
 
 ___
 
@@ -516,7 +516,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:205](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L205)
+[src/list/doublyLinkedList.ts:205](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L205)
 
 ___
 
@@ -542,7 +542,7 @@ Sorts the elements in place.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:235](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L235)
+[src/list/doublyLinkedList.ts:235](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L235)
 
 ___
 
@@ -571,7 +571,7 @@ Returns any deleted elements.
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:209](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L209)
+[src/list/doublyLinkedList.ts:209](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L209)
 
 ___
 
@@ -597,7 +597,7 @@ Inserts the specified value into the front of the list
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:256](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L256)
+[src/list/doublyLinkedList.ts:256](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L256)
 
 ___
 
@@ -623,7 +623,7 @@ Update the elements of the list
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:263](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L263)
+[src/list/doublyLinkedList.ts:263](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L263)
 
 ▸ **update**(`min`, `callback`): [DoublyLinkedList](doublylinkedlist.md)<T\>
 
@@ -649,7 +649,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:264](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L264)
+[src/list/doublyLinkedList.ts:264](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L264)
 
 ▸ **update**(`min`, `max`, `callback`): [DoublyLinkedList](doublylinkedlist.md)<T\>
 
@@ -676,7 +676,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:265](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L265)
+[src/list/doublyLinkedList.ts:265](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L265)
 
 ___
 
@@ -708,4 +708,4 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/doublyLinkedList.ts:296](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedList.ts#L296)
+[src/list/doublyLinkedList.ts:296](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedList.ts#L296)
diff --git a/docs/classes/inordersegmenttree.md b/docs/classes/inordersegmenttree.md
index 7b01e70..f0e719d 100644
--- a/docs/classes/inordersegmenttree.md
+++ b/docs/classes/inordersegmenttree.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / InOrderSegmentTree
+[dastal - v4.0.0](../README.md) / InOrderSegmentTree
 
 # Class: InOrderSegmentTree<T\>
 
@@ -61,7 +61,7 @@ Construct a new segment tree
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:33](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L33)
+[src/segmentTree/inOrderSegmentTree.ts:33](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L33)
 
 ## Properties
 
@@ -75,7 +75,7 @@ n elements require 2n memory.
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:25](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L25)
+[src/segmentTree/inOrderSegmentTree.ts:25](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L25)
 
 ## Accessors
 
@@ -95,7 +95,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:107](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L107)
+[src/segmentTree/inOrderSegmentTree.ts:107](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L107)
 
 ## Methods
 
@@ -115,7 +115,7 @@ Return an iterator through the tree's elements
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:114](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L114)
+[src/segmentTree/inOrderSegmentTree.ts:114](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L114)
 
 ___
 
@@ -135,7 +135,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:46](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L46)
+[src/segmentTree/inOrderSegmentTree.ts:46](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L46)
 
 ___
 
@@ -155,7 +155,7 @@ Retrieves and removes the last element
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:50](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L50)
+[src/segmentTree/inOrderSegmentTree.ts:50](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L50)
 
 ___
 
@@ -181,7 +181,7 @@ Appends an element to the tree
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:68](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L68)
+[src/segmentTree/inOrderSegmentTree.ts:68](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L68)
 
 ___
 
@@ -208,7 +208,7 @@ Get the aggregated result of a given range in the tree
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:81](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L81)
+[src/segmentTree/inOrderSegmentTree.ts:81](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L81)
 
 ___
 
@@ -236,4 +236,4 @@ Update the elements of a given range in the tree
 
 #### Defined in
 
-[src/segmentTree/inOrderSegmentTree.ts:120](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/inOrderSegmentTree.ts#L120)
+[src/segmentTree/inOrderSegmentTree.ts:120](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/inOrderSegmentTree.ts#L120)
diff --git a/docs/classes/levelordersegmenttree.md b/docs/classes/levelordersegmenttree.md
index 7bc7ee9..7d186d5 100644
--- a/docs/classes/levelordersegmenttree.md
+++ b/docs/classes/levelordersegmenttree.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / LevelOrderSegmentTree
+[dastal - v4.0.0](../README.md) / LevelOrderSegmentTree
 
 # Class: LevelOrderSegmentTree<T\>
 
@@ -61,7 +61,7 @@ Construct a new [SegmentTree](../interfaces/segmenttree.md)
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:39](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L39)
+[src/segmentTree/levelOrderSegmentTree.ts:39](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L39)
 
 ## Properties
 
@@ -75,7 +75,7 @@ n elements require 2^⌈log2(2n)⌉ - 1 memory:
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:23](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L23)
+[src/segmentTree/levelOrderSegmentTree.ts:23](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L23)
 
 ## Accessors
 
@@ -95,7 +95,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:123](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L123)
+[src/segmentTree/levelOrderSegmentTree.ts:123](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L123)
 
 ## Methods
 
@@ -115,7 +115,7 @@ Return an iterator through the elements
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:130](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L130)
+[src/segmentTree/levelOrderSegmentTree.ts:130](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L130)
 
 ___
 
@@ -135,7 +135,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:54](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L54)
+[src/segmentTree/levelOrderSegmentTree.ts:54](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L54)
 
 ___
 
@@ -155,7 +155,7 @@ Retrieves and removes the last element
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:60](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L60)
+[src/segmentTree/levelOrderSegmentTree.ts:60](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L60)
 
 ___
 
@@ -181,7 +181,7 @@ Appends an element to the tree
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:77](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L77)
+[src/segmentTree/levelOrderSegmentTree.ts:77](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L77)
 
 ___
 
@@ -208,7 +208,7 @@ Get the aggregated result of a given range in the tree
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:95](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L95)
+[src/segmentTree/levelOrderSegmentTree.ts:95](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L95)
 
 ___
 
@@ -236,4 +236,4 @@ Update the elements of a given range in the tree
 
 #### Defined in
 
-[src/segmentTree/levelOrderSegmentTree.ts:136](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/levelOrderSegmentTree.ts#L136)
+[src/segmentTree/levelOrderSegmentTree.ts:136](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/levelOrderSegmentTree.ts#L136)
diff --git a/docs/classes/linkedlist.md b/docs/classes/linkedlist.md
index cc764d7..1e17d01 100644
--- a/docs/classes/linkedlist.md
+++ b/docs/classes/linkedlist.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / LinkedList
+[dastal - v4.0.0](../README.md) / LinkedList
 
 # Class: LinkedList<T\>
 
@@ -70,7 +70,7 @@ Instantiate the list.
 
 #### Defined in
 
-[src/list/linkedList.ts:22](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L22)
+[src/list/linkedList.ts:22](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L22)
 
 ## Accessors
 
@@ -90,7 +90,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/list/linkedList.ts:208](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L208)
+[src/list/linkedList.ts:208](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L208)
 
 ## Methods
 
@@ -114,7 +114,7 @@ An iterator through the list
 
 #### Defined in
 
-[src/list/linkedList.ts:258](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L258)
+[src/list/linkedList.ts:258](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L258)
 
 ___
 
@@ -141,7 +141,7 @@ Add the element at the specified index.
 
 #### Defined in
 
-[src/list/linkedList.ts:35](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L35)
+[src/list/linkedList.ts:35](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L35)
 
 ___
 
@@ -168,7 +168,7 @@ Add elements at the specified index.
 
 #### Defined in
 
-[src/list/linkedList.ts:46](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L46)
+[src/list/linkedList.ts:46](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L46)
 
 ___
 
@@ -188,7 +188,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/list/linkedList.ts:55](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L55)
+[src/list/linkedList.ts:55](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L55)
 
 ___
 
@@ -214,7 +214,7 @@ Combines the list with multiple iterables into a new list. Does not modify the e
 
 #### Defined in
 
-[src/list/linkedList.ts:60](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L60)
+[src/list/linkedList.ts:60](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L60)
 
 ___
 
@@ -248,7 +248,7 @@ the copied sequence will be trimmed to fit list.size
 
 #### Defined in
 
-[src/list/linkedList.ts:68](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L68)
+[src/list/linkedList.ts:68](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L68)
 
 ___
 
@@ -279,7 +279,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/linkedList.ts:111](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L111)
+[src/list/linkedList.ts:111](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L111)
 
 ___
 
@@ -305,7 +305,7 @@ Return the element at the specified index.
 
 #### Defined in
 
-[src/list/linkedList.ts:124](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L124)
+[src/list/linkedList.ts:124](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L124)
 
 ___
 
@@ -332,7 +332,7 @@ Update the element at the specified index.
 
 #### Defined in
 
-[src/list/linkedList.ts:131](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L131)
+[src/list/linkedList.ts:131](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L131)
 
 ___
 
@@ -352,7 +352,7 @@ Retrieves and removes the end of the list.
 
 #### Defined in
 
-[src/list/linkedList.ts:141](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L141)
+[src/list/linkedList.ts:141](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L141)
 
 ___
 
@@ -378,7 +378,7 @@ Inserts the specified value into the end of the list
 
 #### Defined in
 
-[src/list/linkedList.ts:152](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L152)
+[src/list/linkedList.ts:152](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L152)
 
 ___
 
@@ -407,7 +407,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/linkedList.ts:159](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L159)
+[src/list/linkedList.ts:159](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L159)
 
 ___
 
@@ -437,7 +437,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/linkedList.ts:172](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L172)
+[src/list/linkedList.ts:172](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L172)
 
 ___
 
@@ -464,7 +464,7 @@ Update the element at the specified index.
 
 #### Defined in
 
-[src/list/linkedList.ts:194](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L194)
+[src/list/linkedList.ts:194](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L194)
 
 ___
 
@@ -484,7 +484,7 @@ Retrieves and removes the first element in the list.
 
 #### Defined in
 
-[src/list/linkedList.ts:204](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L204)
+[src/list/linkedList.ts:204](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L204)
 
 ___
 
@@ -514,7 +514,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/linkedList.ts:212](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L212)
+[src/list/linkedList.ts:212](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L212)
 
 ___
 
@@ -540,7 +540,7 @@ Sorts the elements in place.
 
 #### Defined in
 
-[src/list/linkedList.ts:243](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L243)
+[src/list/linkedList.ts:243](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L243)
 
 ___
 
@@ -569,7 +569,7 @@ Returns any deleted elements.
 
 #### Defined in
 
-[src/list/linkedList.ts:216](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L216)
+[src/list/linkedList.ts:216](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L216)
 
 ___
 
@@ -595,7 +595,7 @@ Inserts the specified value into the front of the list
 
 #### Defined in
 
-[src/list/linkedList.ts:264](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L264)
+[src/list/linkedList.ts:264](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L264)
 
 ___
 
@@ -621,7 +621,7 @@ Update the elements of the list
 
 #### Defined in
 
-[src/list/linkedList.ts:268](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L268)
+[src/list/linkedList.ts:268](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L268)
 
 ▸ **update**(`min`, `callback`): [LinkedList](linkedlist.md)<T\>
 
@@ -647,7 +647,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/linkedList.ts:269](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L269)
+[src/list/linkedList.ts:269](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L269)
 
 ▸ **update**(`min`, `max`, `callback`): [LinkedList](linkedlist.md)<T\>
 
@@ -674,7 +674,7 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/linkedList.ts:270](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L270)
+[src/list/linkedList.ts:270](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L270)
 
 ___
 
@@ -706,4 +706,4 @@ end of the list. For example, -2 refers to the second to last element of the lis
 
 #### Defined in
 
-[src/list/linkedList.ts:301](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedList.ts#L301)
+[src/list/linkedList.ts:301](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedList.ts#L301)
diff --git a/docs/classes/linkedqueue.md b/docs/classes/linkedqueue.md
index b62d065..7584502 100644
--- a/docs/classes/linkedqueue.md
+++ b/docs/classes/linkedqueue.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / LinkedQueue
+[dastal - v4.0.0](../README.md) / LinkedQueue
 
 # Class: LinkedQueue<T\>
 
@@ -54,7 +54,7 @@ Instantiate the queue.
 
 #### Defined in
 
-[src/queue/linkedQueue.ts:11](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/linkedQueue.ts#L11)
+[src/queue/linkedQueue.ts:11](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/linkedQueue.ts#L11)
 
 ## Accessors
 
@@ -74,7 +74,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/queue/linkedQueue.ts:37](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/linkedQueue.ts#L37)
+[src/queue/linkedQueue.ts:37](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/linkedQueue.ts#L37)
 
 ## Methods
 
@@ -98,7 +98,7 @@ An iterator through the queue
 
 #### Defined in
 
-[src/queue/linkedQueue.ts:47](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/linkedQueue.ts#L47)
+[src/queue/linkedQueue.ts:47](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/linkedQueue.ts#L47)
 
 ___
 
@@ -118,7 +118,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/queue/linkedQueue.ts:21](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/linkedQueue.ts#L21)
+[src/queue/linkedQueue.ts:21](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/linkedQueue.ts#L21)
 
 ___
 
@@ -138,7 +138,7 @@ Retrieves and removes the head of this queue
 
 #### Defined in
 
-[src/queue/linkedQueue.ts:25](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/linkedQueue.ts#L25)
+[src/queue/linkedQueue.ts:25](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/linkedQueue.ts#L25)
 
 ___
 
@@ -164,7 +164,7 @@ Inserts the specified value into this queue
 
 #### Defined in
 
-[src/queue/linkedQueue.ts:29](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/linkedQueue.ts#L29)
+[src/queue/linkedQueue.ts:29](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/linkedQueue.ts#L29)
 
 ___
 
@@ -184,4 +184,4 @@ Retrieves, but does not remove, the head of this queue
 
 #### Defined in
 
-[src/queue/linkedQueue.ts:33](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/linkedQueue.ts#L33)
+[src/queue/linkedQueue.ts:33](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/linkedQueue.ts#L33)
diff --git a/docs/classes/linkedstack.md b/docs/classes/linkedstack.md
index b739757..f4457eb 100644
--- a/docs/classes/linkedstack.md
+++ b/docs/classes/linkedstack.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / LinkedStack
+[dastal - v4.0.0](../README.md) / LinkedStack
 
 # Class: LinkedStack<T\>
 
@@ -54,7 +54,7 @@ Instantiate the stack.
 
 #### Defined in
 
-[src/stack/linkedStack.ts:11](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/linkedStack.ts#L11)
+[src/stack/linkedStack.ts:11](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/linkedStack.ts#L11)
 
 ## Accessors
 
@@ -74,7 +74,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/stack/linkedStack.ts:40](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/linkedStack.ts#L40)
+[src/stack/linkedStack.ts:40](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/linkedStack.ts#L40)
 
 ## Methods
 
@@ -98,7 +98,7 @@ An iterator through the stack
 
 #### Defined in
 
-[src/stack/linkedStack.ts:50](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/linkedStack.ts#L50)
+[src/stack/linkedStack.ts:50](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/linkedStack.ts#L50)
 
 ___
 
@@ -118,7 +118,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/stack/linkedStack.ts:24](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/linkedStack.ts#L24)
+[src/stack/linkedStack.ts:24](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/linkedStack.ts#L24)
 
 ___
 
@@ -138,7 +138,7 @@ Retrieves, but does not remove, the top of the stack
 
 #### Defined in
 
-[src/stack/linkedStack.ts:28](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/linkedStack.ts#L28)
+[src/stack/linkedStack.ts:28](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/linkedStack.ts#L28)
 
 ___
 
@@ -158,7 +158,7 @@ Retrieves and removes the top of the stack
 
 #### Defined in
 
-[src/stack/linkedStack.ts:32](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/linkedStack.ts#L32)
+[src/stack/linkedStack.ts:32](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/linkedStack.ts#L32)
 
 ___
 
@@ -184,4 +184,4 @@ Inserts an element into the stack
 
 #### Defined in
 
-[src/stack/linkedStack.ts:36](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/linkedStack.ts#L36)
+[src/stack/linkedStack.ts:36](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/linkedStack.ts#L36)
diff --git a/docs/classes/skewheap.md b/docs/classes/skewheap.md
index 7b1a702..1fb4b57 100644
--- a/docs/classes/skewheap.md
+++ b/docs/classes/skewheap.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / SkewHeap
+[dastal - v4.0.0](../README.md) / SkewHeap
 
 # Class: SkewHeap<T\>
 
@@ -87,7 +87,7 @@ Instantiate a heap.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:47](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L47)
+[src/heap/skewHeap.ts:47](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L47)
 
 ## Accessors
 
@@ -107,7 +107,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:168](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L168)
+[src/heap/skewHeap.ts:168](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L168)
 
 ## Methods
 
@@ -131,7 +131,7 @@ An iterator through the list
 
 #### Defined in
 
-[src/heap/skewHeap.ts:194](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L194)
+[src/heap/skewHeap.ts:194](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L194)
 
 ___
 
@@ -159,7 +159,7 @@ The new size of the list.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:60](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L60)
+[src/heap/skewHeap.ts:60](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L60)
 
 ___
 
@@ -179,7 +179,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:75](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L75)
+[src/heap/skewHeap.ts:75](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L75)
 
 ___
 
@@ -199,7 +199,7 @@ The function with which elements are sorted
 
 #### Defined in
 
-[src/heap/skewHeap.ts:80](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L80)
+[src/heap/skewHeap.ts:80](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L80)
 
 ___
 
@@ -227,7 +227,7 @@ Check if an element is in the heap.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:84](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L84)
+[src/heap/skewHeap.ts:84](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L84)
 
 ___
 
@@ -255,7 +255,7 @@ Delete an element from the heap.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:93](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L93)
+[src/heap/skewHeap.ts:93](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L93)
 
 ___
 
@@ -284,7 +284,7 @@ The heap.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:118](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L118)
+[src/heap/skewHeap.ts:118](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L118)
 
 ___
 
@@ -306,7 +306,7 @@ The element at the top of the heap or `undefined` if empty.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:133](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L133)
+[src/heap/skewHeap.ts:133](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L133)
 
 ___
 
@@ -328,7 +328,7 @@ The element at the top of the heap or `undefined` if empty.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:137](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L137)
+[src/heap/skewHeap.ts:137](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L137)
 
 ___
 
@@ -356,7 +356,7 @@ The new size of the heap.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:147](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L147)
+[src/heap/skewHeap.ts:147](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L147)
 
 ___
 
@@ -384,7 +384,7 @@ The element at the top of the heap.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:152](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L152)
+[src/heap/skewHeap.ts:152](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L152)
 
 ___
 
@@ -412,7 +412,7 @@ The element at the top of the heap or `undefined` if empty.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:157](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L157)
+[src/heap/skewHeap.ts:157](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L157)
 
 ___
 
@@ -434,7 +434,7 @@ Iterate through the heap in sorted order.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:172](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L172)
+[src/heap/skewHeap.ts:172](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L172)
 
 ___
 
@@ -463,4 +463,4 @@ Update a specific element.
 
 #### Defined in
 
-[src/heap/skewHeap.ts:200](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/skewHeap.ts#L200)
+[src/heap/skewHeap.ts:200](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/skewHeap.ts#L200)
diff --git a/docs/interfaces/aatreenode.md b/docs/interfaces/aatreenode.md
index 4cfec8f..b2f63b6 100644
--- a/docs/interfaces/aatreenode.md
+++ b/docs/interfaces/aatreenode.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / AATreeNode
+[dastal - v4.0.0](../README.md) / AATreeNode
 
 # Interface: AATreeNode<T\>
 
@@ -48,7 +48,7 @@ A link to the node's left child.
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L10)
+[src/tree/binaryTreeNode.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L10)
 
 ___
 
@@ -60,7 +60,7 @@ The level of the node.
 
 #### Defined in
 
-[src/tree/aaTreeNode.ts:19](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/aaTreeNode.ts#L19)
+[src/tree/aaTreeNode.ts:19](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/aaTreeNode.ts#L19)
 
 ___
 
@@ -76,7 +76,7 @@ A link to the node's right child.
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:14](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L14)
+[src/tree/binaryTreeNode.ts:14](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L14)
 
 ___
 
@@ -92,4 +92,4 @@ The value of the node
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:18](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L18)
+[src/tree/binaryTreeNode.ts:18](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L18)
diff --git a/docs/interfaces/avltreenode.md b/docs/interfaces/avltreenode.md
index 604f61e..0bc47b1 100644
--- a/docs/interfaces/avltreenode.md
+++ b/docs/interfaces/avltreenode.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / AVLTreeNode
+[dastal - v4.0.0](../README.md) / AVLTreeNode
 
 # Interface: AVLTreeNode<T\>
 
@@ -38,7 +38,7 @@ The delta rank of the node.
 
 #### Defined in
 
-[src/tree/avlTreeNode.ts:13](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/avlTreeNode.ts#L13)
+[src/tree/avlTreeNode.ts:13](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/avlTreeNode.ts#L13)
 
 ___
 
@@ -54,7 +54,7 @@ A link to the node's left child.
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L10)
+[src/tree/binaryTreeNode.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L10)
 
 ___
 
@@ -70,7 +70,7 @@ A link to the node's right child.
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:14](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L14)
+[src/tree/binaryTreeNode.ts:14](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L14)
 
 ___
 
@@ -86,4 +86,4 @@ The value of the node
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:18](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L18)
+[src/tree/binaryTreeNode.ts:18](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L18)
diff --git a/docs/interfaces/binarytreenode.md b/docs/interfaces/binarytreenode.md
index d0a1cb4..e8b6b39 100644
--- a/docs/interfaces/binarytreenode.md
+++ b/docs/interfaces/binarytreenode.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / BinaryTreeNode
+[dastal - v4.0.0](../README.md) / BinaryTreeNode
 
 # Interface: BinaryTreeNode<T\>
 
@@ -38,7 +38,7 @@ A link to the node's left child.
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L10)
+[src/tree/binaryTreeNode.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L10)
 
 ___
 
@@ -50,7 +50,7 @@ A link to the node's right child.
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:14](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L14)
+[src/tree/binaryTreeNode.ts:14](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L14)
 
 ___
 
@@ -62,4 +62,4 @@ The value of the node
 
 #### Defined in
 
-[src/tree/binaryTreeNode.ts:18](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/binaryTreeNode.ts#L18)
+[src/tree/binaryTreeNode.ts:18](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/binaryTreeNode.ts#L18)
diff --git a/docs/interfaces/collection.md b/docs/interfaces/collection.md
new file mode 100644
index 0000000..0ae5117
--- /dev/null
+++ b/docs/interfaces/collection.md
@@ -0,0 +1,67 @@
+[dastal - v4.0.0](../README.md) / Collection
+
+# Interface: Collection<T\>
+
+## Type parameters
+
+| Name |
+| :------ |
+| `T` |
+
+## Hierarchy
+
+- `Iterable`<T\>
+
+  ↳ **Collection**
+
+  ↳↳ [Heap](heap.md)
+
+  ↳↳ [List](list.md)
+
+  ↳↳ [Queue](queue.md)
+
+  ↳↳ [SegmentTree](segmenttree.md)
+
+  ↳↳ [Stack](stack.md)
+
+  ↳↳ [Tree](tree.md)
+
+## Table of contents
+
+### Properties
+
+- [size](collection.md#size)
+
+### Methods
+
+- [[Symbol.iterator]](collection.md#[symbol.iterator])
+
+## Properties
+
+### size
+
+• `Readonly` **size**: `number`
+
+The number of elements in the collection.
+
+#### Defined in
+
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
+
+## Methods
+
+### [Symbol.iterator]
+
+▸ **[Symbol.iterator]**(): `Iterator`<T, any, undefined\>
+
+#### Returns
+
+`Iterator`<T, any, undefined\>
+
+#### Inherited from
+
+Iterable.\_\_@iterator
+
+#### Defined in
+
+node_modules/typescript/lib/lib.es2015.iterable.d.ts:51
diff --git a/docs/interfaces/doublylinkednode.md b/docs/interfaces/doublylinkednode.md
index 50e14a0..d918183 100644
--- a/docs/interfaces/doublylinkednode.md
+++ b/docs/interfaces/doublylinkednode.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / DoublyLinkedNode
+[dastal - v4.0.0](../README.md) / DoublyLinkedNode
 
 # Interface: DoublyLinkedNode<T\>
 
@@ -30,7 +30,7 @@ A link to the node's next (right) neighbor
 
 #### Defined in
 
-[src/list/doublyLinkedNode.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedNode.ts#L10)
+[src/list/doublyLinkedNode.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedNode.ts#L10)
 
 ___
 
@@ -42,7 +42,7 @@ A link to the node's previous (left) neighbor
 
 #### Defined in
 
-[src/list/doublyLinkedNode.ts:14](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedNode.ts#L14)
+[src/list/doublyLinkedNode.ts:14](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedNode.ts#L14)
 
 ___
 
@@ -54,4 +54,4 @@ The value of the node
 
 #### Defined in
 
-[src/list/doublyLinkedNode.ts:18](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/doublyLinkedNode.ts#L18)
+[src/list/doublyLinkedNode.ts:18](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/doublyLinkedNode.ts#L18)
diff --git a/docs/interfaces/heap.md b/docs/interfaces/heap.md
index 6dcd330..bb1f552 100644
--- a/docs/interfaces/heap.md
+++ b/docs/interfaces/heap.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / Heap
+[dastal - v4.0.0](../README.md) / Heap
 
 # Interface: Heap<T\>
 
@@ -54,7 +54,7 @@ Add & Remove
 
 ## Hierarchy
 
-- `Collection`<T\>
+- [Collection](collection.md)<T\>
 
 - [Sorted](sorted.md)<T\>
 
@@ -98,11 +98,11 @@ The number of elements in the collection.
 
 #### Inherited from
 
-Collection.size
+[Collection](collection.md).[size](collection.md#size)
 
 #### Defined in
 
-[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/e94627b/src/collection/collection.ts#L5)
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
 
 ## Methods
 
@@ -116,7 +116,7 @@ Collection.size
 
 #### Inherited from
 
-Collection.\_\_@iterator
+[Collection](collection.md).[[Symbol.iterator]](collection.md#[symbol.iterator])
 
 #### Defined in
 
@@ -144,7 +144,7 @@ The new size of the list.
 
 #### Defined in
 
-[src/heap/heap.ts:57](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L57)
+[src/heap/heap.ts:57](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L57)
 
 ___
 
@@ -160,7 +160,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/heap/heap.ts:61](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L61)
+[src/heap/heap.ts:61](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L61)
 
 ___
 
@@ -180,7 +180,7 @@ The function with which elements are sorted
 
 #### Defined in
 
-[src/index.ts:59](https://github.com/havelessbemore/dastal/blob/e94627b/src/index.ts#L59)
+[src/index.ts:59](https://github.com/havelessbemore/dastal/blob/2fe24da/src/index.ts#L59)
 
 ___
 
@@ -204,7 +204,7 @@ Check if an element is in the heap.
 
 #### Defined in
 
-[src/heap/heap.ts:69](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L69)
+[src/heap/heap.ts:69](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L69)
 
 ___
 
@@ -228,7 +228,7 @@ Delete an element from the heap.
 
 #### Defined in
 
-[src/heap/heap.ts:77](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L77)
+[src/heap/heap.ts:77](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L77)
 
 ___
 
@@ -253,7 +253,7 @@ The heap.
 
 #### Defined in
 
-[src/heap/heap.ts:86](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L86)
+[src/heap/heap.ts:86](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L86)
 
 ___
 
@@ -271,7 +271,7 @@ The element at the top of the heap or `undefined` if empty.
 
 #### Defined in
 
-[src/heap/heap.ts:92](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L92)
+[src/heap/heap.ts:92](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L92)
 
 ___
 
@@ -289,7 +289,7 @@ The element at the top of the heap or `undefined` if empty.
 
 #### Defined in
 
-[src/heap/heap.ts:98](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L98)
+[src/heap/heap.ts:98](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L98)
 
 ___
 
@@ -313,7 +313,7 @@ The new size of the heap.
 
 #### Defined in
 
-[src/heap/heap.ts:106](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L106)
+[src/heap/heap.ts:106](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L106)
 
 ___
 
@@ -337,7 +337,7 @@ The element at the top of the heap.
 
 #### Defined in
 
-[src/heap/heap.ts:114](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L114)
+[src/heap/heap.ts:114](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L114)
 
 ___
 
@@ -361,7 +361,7 @@ The element at the top of the heap or `undefined` if empty.
 
 #### Defined in
 
-[src/heap/heap.ts:122](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L122)
+[src/heap/heap.ts:122](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L122)
 
 ___
 
@@ -379,7 +379,7 @@ Iterate through the heap in sorted order.
 
 #### Defined in
 
-[src/heap/heap.ts:128](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L128)
+[src/heap/heap.ts:128](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L128)
 
 ___
 
@@ -404,4 +404,4 @@ Update a specific element.
 
 #### Defined in
 
-[src/heap/heap.ts:137](https://github.com/havelessbemore/dastal/blob/e94627b/src/heap/heap.ts#L137)
+[src/heap/heap.ts:137](https://github.com/havelessbemore/dastal/blob/2fe24da/src/heap/heap.ts#L137)
diff --git a/docs/interfaces/linkednode.md b/docs/interfaces/linkednode.md
index e519a54..73e826b 100644
--- a/docs/interfaces/linkednode.md
+++ b/docs/interfaces/linkednode.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / LinkedNode
+[dastal - v4.0.0](../README.md) / LinkedNode
 
 # Interface: LinkedNode<T\>
 
@@ -29,7 +29,7 @@ A link to the node's neighbor.
 
 #### Defined in
 
-[src/list/linkedNode.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedNode.ts#L10)
+[src/list/linkedNode.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedNode.ts#L10)
 
 ___
 
@@ -41,4 +41,4 @@ The value of the node.
 
 #### Defined in
 
-[src/list/linkedNode.ts:14](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/linkedNode.ts#L14)
+[src/list/linkedNode.ts:14](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/linkedNode.ts#L14)
diff --git a/docs/interfaces/list.md b/docs/interfaces/list.md
index 835d410..28e37b5 100644
--- a/docs/interfaces/list.md
+++ b/docs/interfaces/list.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / List
+[dastal - v4.0.0](../README.md) / List
 
 # Interface: List<T\>
 
@@ -45,7 +45,7 @@ where an element is inserted. Elements can be accessed by their integer index (p
 
 ## Hierarchy
 
-- `Collection`<T\>
+- [Collection](collection.md)<T\>
 
 - [Sortable](sortable.md)<T\>
 
@@ -97,11 +97,11 @@ The number of elements in the collection.
 
 #### Inherited from
 
-Collection.size
+[Collection](collection.md).[size](collection.md#size)
 
 #### Defined in
 
-[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/e94627b/src/collection/collection.ts#L5)
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
 
 ## Methods
 
@@ -115,7 +115,7 @@ Collection.size
 
 #### Inherited from
 
-Collection.\_\_@iterator
+[Collection](collection.md).[[Symbol.iterator]](collection.md#[symbol.iterator])
 
 #### Defined in
 
@@ -144,7 +144,7 @@ The new size of the list
 
 #### Defined in
 
-[src/list/list.ts:49](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L49)
+[src/list/list.ts:49](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L49)
 
 ___
 
@@ -169,7 +169,7 @@ The new size of the list
 
 #### Defined in
 
-[src/list/list.ts:58](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L58)
+[src/list/list.ts:58](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L58)
 
 ___
 
@@ -185,7 +185,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/list/list.ts:62](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L62)
+[src/list/list.ts:62](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L62)
 
 ___
 
@@ -211,7 +211,7 @@ or the argument itself. It does not recurse into nested iterable arguments
 
 #### Defined in
 
-[src/list/list.ts:72](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L72)
+[src/list/list.ts:72](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L72)
 
 ___
 
@@ -243,7 +243,7 @@ The list
 
 #### Defined in
 
-[src/list/list.ts:88](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L88)
+[src/list/list.ts:88](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L88)
 
 ___
 
@@ -272,7 +272,7 @@ The list on which this method was called
 
 #### Defined in
 
-[src/list/list.ts:101](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L101)
+[src/list/list.ts:101](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L101)
 
 ___
 
@@ -296,7 +296,7 @@ The element at the index, or `undefined` if index is invalid
 
 #### Defined in
 
-[src/list/list.ts:109](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L109)
+[src/list/list.ts:109](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L109)
 
 ___
 
@@ -321,7 +321,7 @@ The previous element at the index, or `undefined` if index is invalid
 
 #### Defined in
 
-[src/list/list.ts:119](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L119)
+[src/list/list.ts:119](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L119)
 
 ___
 
@@ -339,7 +339,7 @@ The value at the end of the list, or `undefined` if empty.
 
 #### Defined in
 
-[src/list/list.ts:125](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L125)
+[src/list/list.ts:125](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L125)
 
 ___
 
@@ -363,7 +363,7 @@ The new size of the list
 
 #### Defined in
 
-[src/list/list.ts:133](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L133)
+[src/list/list.ts:133](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L133)
 
 ___
 
@@ -390,7 +390,7 @@ The value at the index, or `undefined` if the index is invalid
 
 #### Defined in
 
-[src/list/list.ts:144](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L144)
+[src/list/list.ts:144](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L144)
 
 ___
 
@@ -418,7 +418,7 @@ a reference to the same list
 
 #### Defined in
 
-[src/list/list.ts:156](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L156)
+[src/list/list.ts:156](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L156)
 
 ___
 
@@ -443,7 +443,7 @@ The previous element in the index, or undefined if the index is invalid
 
 #### Defined in
 
-[src/list/list.ts:165](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L165)
+[src/list/list.ts:165](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L165)
 
 ___
 
@@ -461,7 +461,7 @@ The value at the front of the list or `undefined` if this list is empty.
 
 #### Defined in
 
-[src/list/list.ts:171](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L171)
+[src/list/list.ts:171](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L171)
 
 ___
 
@@ -489,7 +489,7 @@ A new list with a copy of the indicated section of the original list
 
 #### Defined in
 
-[src/list/list.ts:183](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L183)
+[src/list/list.ts:183](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L183)
 
 ___
 
@@ -517,7 +517,7 @@ The object this method was called on
 
 #### Defined in
 
-[src/index.ts:50](https://github.com/havelessbemore/dastal/blob/e94627b/src/index.ts#L50)
+[src/index.ts:50](https://github.com/havelessbemore/dastal/blob/2fe24da/src/index.ts#L50)
 
 ___
 
@@ -544,7 +544,7 @@ A new list of deleted elements
 
 #### Defined in
 
-[src/list/list.ts:208](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L208)
+[src/list/list.ts:208](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L208)
 
 ___
 
@@ -568,7 +568,7 @@ The new size of the list
 
 #### Defined in
 
-[src/list/list.ts:216](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L216)
+[src/list/list.ts:216](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L216)
 
 ___
 
@@ -592,7 +592,7 @@ The list on which this method was called
 
 #### Defined in
 
-[src/list/list.ts:224](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L224)
+[src/list/list.ts:224](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L224)
 
 ▸ **update**(`min`, `callback`): [List](list.md)<T\>
 
@@ -616,7 +616,7 @@ The list on which this method was called
 
 #### Defined in
 
-[src/list/list.ts:236](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L236)
+[src/list/list.ts:236](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L236)
 
 ▸ **update**(`min`, `max`, `callback`): [List](list.md)<T\>
 
@@ -641,7 +641,7 @@ The list on which this method was called
 
 #### Defined in
 
-[src/list/list.ts:249](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L249)
+[src/list/list.ts:249](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L249)
 
 ___
 
@@ -671,4 +671,4 @@ An iterator through the indicated section of the list
 
 #### Defined in
 
-[src/list/list.ts:267](https://github.com/havelessbemore/dastal/blob/e94627b/src/list/list.ts#L267)
+[src/list/list.ts:267](https://github.com/havelessbemore/dastal/blob/2fe24da/src/list/list.ts#L267)
diff --git a/docs/interfaces/queue.md b/docs/interfaces/queue.md
index 1b56178..db2a285 100644
--- a/docs/interfaces/queue.md
+++ b/docs/interfaces/queue.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / Queue
+[dastal - v4.0.0](../README.md) / Queue
 
 # Interface: Queue<T\>
 
@@ -21,7 +21,7 @@ Every implementation should specify its ordering properties. Otherwise, insertio
 
 ## Hierarchy
 
-- `Collection`<T\>
+- [Collection](collection.md)<T\>
 
   ↳ **Queue**
 
@@ -54,11 +54,11 @@ The number of elements in the collection.
 
 #### Inherited from
 
-Collection.size
+[Collection](collection.md).[size](collection.md#size)
 
 #### Defined in
 
-[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/e94627b/src/collection/collection.ts#L5)
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
 
 ## Methods
 
@@ -72,7 +72,7 @@ Collection.size
 
 #### Inherited from
 
-Collection.\_\_@iterator
+[Collection](collection.md).[[Symbol.iterator]](collection.md#[symbol.iterator])
 
 #### Defined in
 
@@ -92,7 +92,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/queue/queue.ts:19](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/queue.ts#L19)
+[src/queue/queue.ts:19](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/queue.ts#L19)
 
 ___
 
@@ -110,7 +110,7 @@ The value at the head of the queue or `undefined` if this queue is empty.
 
 #### Defined in
 
-[src/queue/queue.ts:25](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/queue.ts#L25)
+[src/queue/queue.ts:25](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/queue.ts#L25)
 
 ___
 
@@ -134,7 +134,7 @@ The new size of the queue
 
 #### Defined in
 
-[src/queue/queue.ts:33](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/queue.ts#L33)
+[src/queue/queue.ts:33](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/queue.ts#L33)
 
 ___
 
@@ -152,4 +152,4 @@ The value at the head of the queue or `undefined` if this queue is empty.
 
 #### Defined in
 
-[src/queue/queue.ts:39](https://github.com/havelessbemore/dastal/blob/e94627b/src/queue/queue.ts#L39)
+[src/queue/queue.ts:39](https://github.com/havelessbemore/dastal/blob/2fe24da/src/queue/queue.ts#L39)
diff --git a/docs/interfaces/segmenttree.md b/docs/interfaces/segmenttree.md
index ca8a9f4..26e8303 100644
--- a/docs/interfaces/segmenttree.md
+++ b/docs/interfaces/segmenttree.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / SegmentTree
+[dastal - v4.0.0](../README.md) / SegmentTree
 
 # Interface: SegmentTree<T\>
 
@@ -10,7 +10,7 @@
 
 ## Hierarchy
 
-- `Collection`<T\>
+- [Collection](collection.md)<T\>
 
   ↳ **SegmentTree**
 
@@ -44,11 +44,11 @@ The number of elements in the collection.
 
 #### Inherited from
 
-Collection.size
+[Collection](collection.md).[size](collection.md#size)
 
 #### Defined in
 
-[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/e94627b/src/collection/collection.ts#L5)
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
 
 ## Methods
 
@@ -62,7 +62,7 @@ Collection.size
 
 #### Inherited from
 
-Collection.\_\_@iterator
+[Collection](collection.md).[[Symbol.iterator]](collection.md#[symbol.iterator])
 
 #### Defined in
 
@@ -82,7 +82,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/segmentTree/segmentTree.ts:7](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/segmentTree.ts#L7)
+[src/segmentTree/segmentTree.ts:7](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/segmentTree.ts#L7)
 
 ___
 
@@ -100,7 +100,7 @@ The last element or `undefined` if empty.
 
 #### Defined in
 
-[src/segmentTree/segmentTree.ts:13](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/segmentTree.ts#L13)
+[src/segmentTree/segmentTree.ts:13](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/segmentTree.ts#L13)
 
 ___
 
@@ -124,7 +124,7 @@ The new size of the tree
 
 #### Defined in
 
-[src/segmentTree/segmentTree.ts:21](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/segmentTree.ts#L21)
+[src/segmentTree/segmentTree.ts:21](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/segmentTree.ts#L21)
 
 ___
 
@@ -149,7 +149,7 @@ The aggregated result for range [min, max)
 
 #### Defined in
 
-[src/segmentTree/segmentTree.ts:30](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/segmentTree.ts#L30)
+[src/segmentTree/segmentTree.ts:30](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/segmentTree.ts#L30)
 
 ___
 
@@ -173,4 +173,4 @@ Update the elements of a given range in the tree
 
 #### Defined in
 
-[src/segmentTree/segmentTree.ts:38](https://github.com/havelessbemore/dastal/blob/e94627b/src/segmentTree/segmentTree.ts#L38)
+[src/segmentTree/segmentTree.ts:38](https://github.com/havelessbemore/dastal/blob/2fe24da/src/segmentTree/segmentTree.ts#L38)
diff --git a/docs/interfaces/sortable.md b/docs/interfaces/sortable.md
index dcba9c8..1ae7127 100644
--- a/docs/interfaces/sortable.md
+++ b/docs/interfaces/sortable.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / Sortable
+[dastal - v4.0.0](../README.md) / Sortable
 
 # Interface: Sortable<T\>
 
@@ -44,4 +44,4 @@ The object this method was called on
 
 #### Defined in
 
-[src/index.ts:50](https://github.com/havelessbemore/dastal/blob/e94627b/src/index.ts#L50)
+[src/index.ts:50](https://github.com/havelessbemore/dastal/blob/2fe24da/src/index.ts#L50)
diff --git a/docs/interfaces/sorted.md b/docs/interfaces/sorted.md
index c68c0a0..0f7aceb 100644
--- a/docs/interfaces/sorted.md
+++ b/docs/interfaces/sorted.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / Sorted
+[dastal - v4.0.0](../README.md) / Sorted
 
 # Interface: Sorted<T\>
 
@@ -38,4 +38,4 @@ The function with which elements are sorted
 
 #### Defined in
 
-[src/index.ts:59](https://github.com/havelessbemore/dastal/blob/e94627b/src/index.ts#L59)
+[src/index.ts:59](https://github.com/havelessbemore/dastal/blob/2fe24da/src/index.ts#L59)
diff --git a/docs/interfaces/sortedtree.md b/docs/interfaces/sortedtree.md
index 389f5c9..79e733b 100644
--- a/docs/interfaces/sortedtree.md
+++ b/docs/interfaces/sortedtree.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / SortedTree
+[dastal - v4.0.0](../README.md) / SortedTree
 
 # Interface: SortedTree<T\>
 
@@ -58,7 +58,7 @@ The number of elements in the collection.
 
 #### Defined in
 
-[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/e94627b/src/collection/collection.ts#L5)
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
 
 ## Methods
 
@@ -104,7 +104,7 @@ The tree object.
 
 #### Defined in
 
-[src/tree/tree.ts:38](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L38)
+[src/tree/tree.ts:38](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L38)
 
 ___
 
@@ -124,7 +124,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/tree/tree.ts:42](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L42)
+[src/tree/tree.ts:42](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L42)
 
 ___
 
@@ -144,7 +144,7 @@ The function with which elements are sorted
 
 #### Defined in
 
-[src/index.ts:59](https://github.com/havelessbemore/dastal/blob/e94627b/src/index.ts#L59)
+[src/index.ts:59](https://github.com/havelessbemore/dastal/blob/2fe24da/src/index.ts#L59)
 
 ___
 
@@ -172,7 +172,7 @@ Delete an element from the tree.
 
 #### Defined in
 
-[src/tree/tree.ts:50](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L50)
+[src/tree/tree.ts:50](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L50)
 
 ___
 
@@ -200,7 +200,7 @@ Check if an element is in the tree.
 
 #### Defined in
 
-[src/tree/tree.ts:58](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L58)
+[src/tree/tree.ts:58](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L58)
 
 ___
 
@@ -216,7 +216,7 @@ Get the maximum element.
 
 #### Defined in
 
-[src/tree/sortedTree.ts:11](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/sortedTree.ts#L11)
+[src/tree/sortedTree.ts:11](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/sortedTree.ts#L11)
 
 ___
 
@@ -232,7 +232,7 @@ Get the minimum element.
 
 #### Defined in
 
-[src/tree/sortedTree.ts:15](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/sortedTree.ts#L15)
+[src/tree/sortedTree.ts:15](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/sortedTree.ts#L15)
 
 ___
 
@@ -248,7 +248,7 @@ Remove the maximum element.
 
 #### Defined in
 
-[src/tree/sortedTree.ts:19](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/sortedTree.ts#L19)
+[src/tree/sortedTree.ts:19](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/sortedTree.ts#L19)
 
 ___
 
@@ -264,7 +264,7 @@ Remove the minimum element.
 
 #### Defined in
 
-[src/tree/sortedTree.ts:23](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/sortedTree.ts#L23)
+[src/tree/sortedTree.ts:23](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/sortedTree.ts#L23)
 
 ___
 
@@ -282,7 +282,7 @@ Iterate through the tree in sorted order (i.e in-order traversal).
 
 #### Defined in
 
-[src/tree/sortedTree.ts:29](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/sortedTree.ts#L29)
+[src/tree/sortedTree.ts:29](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/sortedTree.ts#L29)
 
 ___
 
@@ -311,4 +311,4 @@ Update a specific element.
 
 #### Defined in
 
-[src/tree/tree.ts:67](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L67)
+[src/tree/tree.ts:67](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L67)
diff --git a/docs/interfaces/stack.md b/docs/interfaces/stack.md
index 1857888..497071f 100644
--- a/docs/interfaces/stack.md
+++ b/docs/interfaces/stack.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / Stack
+[dastal - v4.0.0](../README.md) / Stack
 
 # Interface: Stack<T\>
 
@@ -19,7 +19,7 @@ Every implementation should specify its ordering properties. Otherwise, insertio
 
 ## Hierarchy
 
-- `Collection`<T\>
+- [Collection](collection.md)<T\>
 
   ↳ **Stack**
 
@@ -52,11 +52,11 @@ The number of elements in the collection.
 
 #### Inherited from
 
-Collection.size
+[Collection](collection.md).[size](collection.md#size)
 
 #### Defined in
 
-[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/e94627b/src/collection/collection.ts#L5)
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
 
 ## Methods
 
@@ -70,7 +70,7 @@ Collection.size
 
 #### Inherited from
 
-Collection.\_\_@iterator
+[Collection](collection.md).[[Symbol.iterator]](collection.md#[symbol.iterator])
 
 #### Defined in
 
@@ -90,7 +90,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/stack/stack.ts:17](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/stack.ts#L17)
+[src/stack/stack.ts:17](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/stack.ts#L17)
 
 ___
 
@@ -108,7 +108,7 @@ The element at the top of the stack or `undefined` if empty.
 
 #### Defined in
 
-[src/stack/stack.ts:23](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/stack.ts#L23)
+[src/stack/stack.ts:23](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/stack.ts#L23)
 
 ___
 
@@ -126,7 +126,7 @@ The element at the top of the stack or `undefined` if empty.
 
 #### Defined in
 
-[src/stack/stack.ts:29](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/stack.ts#L29)
+[src/stack/stack.ts:29](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/stack.ts#L29)
 
 ___
 
@@ -150,4 +150,4 @@ The new size of the stack
 
 #### Defined in
 
-[src/stack/stack.ts:37](https://github.com/havelessbemore/dastal/blob/e94627b/src/stack/stack.ts#L37)
+[src/stack/stack.ts:37](https://github.com/havelessbemore/dastal/blob/2fe24da/src/stack/stack.ts#L37)
diff --git a/docs/interfaces/tree.md b/docs/interfaces/tree.md
index 2d46a1b..444efc4 100644
--- a/docs/interfaces/tree.md
+++ b/docs/interfaces/tree.md
@@ -1,4 +1,4 @@
-[dastal - v3.0.0](../README.md) / Tree
+[dastal - v4.0.0](../README.md) / Tree
 
 # Interface: Tree<T\>
 
@@ -36,7 +36,7 @@ Remove
 
 ## Hierarchy
 
-- `Collection`<T\>
+- [Collection](collection.md)<T\>
 
   ↳ **Tree**
 
@@ -67,11 +67,11 @@ The number of elements in the collection.
 
 #### Inherited from
 
-Collection.size
+[Collection](collection.md).[size](collection.md#size)
 
 #### Defined in
 
-[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/e94627b/src/collection/collection.ts#L5)
+[src/collection/collection.ts:5](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/collection.ts#L5)
 
 ## Methods
 
@@ -85,7 +85,7 @@ Collection.size
 
 #### Inherited from
 
-Collection.\_\_@iterator
+[Collection](collection.md).[[Symbol.iterator]](collection.md#[symbol.iterator])
 
 #### Defined in
 
@@ -113,7 +113,7 @@ The tree object.
 
 #### Defined in
 
-[src/tree/tree.ts:38](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L38)
+[src/tree/tree.ts:38](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L38)
 
 ___
 
@@ -129,7 +129,7 @@ Removes all elements.
 
 #### Defined in
 
-[src/tree/tree.ts:42](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L42)
+[src/tree/tree.ts:42](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L42)
 
 ___
 
@@ -153,7 +153,7 @@ Delete an element from the tree.
 
 #### Defined in
 
-[src/tree/tree.ts:50](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L50)
+[src/tree/tree.ts:50](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L50)
 
 ___
 
@@ -177,7 +177,7 @@ Check if an element is in the tree.
 
 #### Defined in
 
-[src/tree/tree.ts:58](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L58)
+[src/tree/tree.ts:58](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L58)
 
 ___
 
@@ -202,4 +202,4 @@ Update a specific element.
 
 #### Defined in
 
-[src/tree/tree.ts:67](https://github.com/havelessbemore/dastal/blob/e94627b/src/tree/tree.ts#L67)
+[src/tree/tree.ts:67](https://github.com/havelessbemore/dastal/blob/2fe24da/src/tree/tree.ts#L67)
diff --git a/docs/modules/arrayutils.md b/docs/modules/arrayutils.md
new file mode 100644
index 0000000..81e6722
--- /dev/null
+++ b/docs/modules/arrayutils.md
@@ -0,0 +1,151 @@
+[dastal - v4.0.0](../README.md) / ArrayUtils
+
+# Namespace: ArrayUtils
+
+## Table of contents
+
+### Variables
+
+- [MAX\_ARRAY\_LENGTH](arrayutils.md#max_array_length)
+- [MAX\_SAFE\_ARGUMENT\_LENGTH](arrayutils.md#max_safe_argument_length)
+
+### Functions
+
+- [isArray](arrayutils.md#isarray)
+- [isTypedArray](arrayutils.md#istypedarray)
+- [splice](arrayutils.md#splice)
+
+## Variables
+
+### MAX\_ARRAY\_LENGTH
+
+• `Const` **MAX\_ARRAY\_LENGTH**: ``4294967295``
+
+The maximum length of an array.
+
+According to the [ECMA-262](https://tc39.es/ecma262/#array-index):
+    0 <= array.length <= 2^32 - 1
+
+If this value should be updated, please
+submit a pull request with details supporting a new max length.
+
+#### Defined in
+
+src/collection/arrayUtils.ts:13
+
+___
+
+### MAX\_SAFE\_ARGUMENT\_LENGTH
+
+• `Const` **MAX\_SAFE\_ARGUMENT\_LENGTH**: ``32767``
+
+The maximum number of arguments that can be safely accepted by a function.
+
+According to the [ECMA-262](https://tc39.es/ecma262/#sec-list-and-record-specification-type), there is no maximum. In practice, different
+environments impose their own limit ([source](https://stackoverflow.com/questions/22747068/is-there-a-max-number-of-arguments-javascript-functions-can-accept)).
+
+This value was chosen through research, local testing and iteration. The actual number of arguments
+accepted in an environment may be larger but hopefully not smaller. If errors are raised,
+please submit a bug with your environment details and a new max length.
+
+#### Defined in
+
+src/collection/arrayUtils.ts:24
+
+## Functions
+
+### isArray
+
+▸ **isArray**<T\>(`obj`): obj is T[]
+
+Check if a value is an Array or TypedArray.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `obj` | `unknown` | The value to check. |
+
+#### Returns
+
+obj is T[]
+
+`true` if an Array or TypedArray, otherwise `false`.
+
+#### Defined in
+
+src/collection/arrayUtils.ts:32
+
+___
+
+### isTypedArray
+
+▸ `Const` **isTypedArray**<T\>(`obj`): obj is T[]
+
+Check if a value is a TypedArray.
+
+See [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray)
+for more details.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `obj` | `unknown` | The value to check. |
+
+#### Returns
+
+obj is T[]
+
+`true` if a TypedArray, otherwise `false`.
+
+#### Defined in
+
+src/collection/arrayUtils.ts:45
+
+___
+
+### splice
+
+▸ **splice**<T\>(`array`, `start?`, `count?`, `elements?`): `T`[]
+
+Removes elements from an array and, if necessary, inserts new elements in their place, returning the deleted elements.
+
+Contrary to Array.splice, this will not throw an error if too many new elements are given as arguments.
+
+#### Type parameters
+
+| Name |
+| :------ |
+| `T` |
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `array` | `T`[] | The array to splice. |
+| `start?` | `number` | The zero-based location in the array from which to start removing elements. |
+| `count?` | `number` | The number of elements to remove. |
+| `elements?` | `Iterable`<T\> | The new elements to splice in. |
+
+#### Returns
+
+`T`[]
+
+- An array containing the elements that were deleted.
+
+#### Defined in
+
+src/collection/arrayUtils.ts:63
diff --git a/docs/modules/iteratorutils.md b/docs/modules/iteratorutils.md
new file mode 100644
index 0000000..6d145ed
--- /dev/null
+++ b/docs/modules/iteratorutils.md
@@ -0,0 +1,244 @@
+[dastal - v4.0.0](../README.md) / IteratorUtils
+
+# Namespace: IteratorUtils
+
+## Table of contents
+
+### Functions
+
+- [always](iteratorutils.md#always)
+- [fill](iteratorutils.md#fill)
+- [first](iteratorutils.md#first)
+- [join](iteratorutils.md#join)
+- [never](iteratorutils.md#never)
+- [once](iteratorutils.md#once)
+- [skip](iteratorutils.md#skip)
+- [split](iteratorutils.md#split)
+
+## Functions
+
+### always
+
+▸ **always**<T\>(`fn`): `Iterator`<T\>
+
+Get an iterator that always returns a given value.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type |
+| :------ | :------ |
+| `fn` | () => `T` |
+
+#### Returns
+
+`Iterator`<T\>
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:4](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L4)
+
+___
+
+### fill
+
+▸ **fill**<T\>(`length`, `fn`): `Iterator`<T\>
+
+Get an iterator that returns a value a given amount of times.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type |
+| :------ | :------ |
+| `length` | `number` |
+| `fn` | () => `T` |
+
+#### Returns
+
+`Iterator`<T\>
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L10)
+
+___
+
+### first
+
+▸ **first**<T\>(`n`, `iterator`): `Iterator`<T\>
+
+Iterate through the first num elements of an iterator.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `n` | `number` | The number of elements to iterate. |
+| `iterator` | `Iterator`<T\> | The iterator. |
+
+#### Returns
+
+`Iterator`<T\>
+
+- An iterator limited to the next n elements.
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:29](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L29)
+
+___
+
+### join
+
+▸ **join**<T\>(`iterators`): `Iterator`<T\>
+
+Join multiple iterators into one.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `iterators` | `Iterator`<Iterator<T\>\> | The iterators to join. |
+
+#### Returns
+
+`Iterator`<T\>
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:46](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L46)
+
+___
+
+### never
+
+▸ **never**<T\>(): `Iterator`<T\>
+
+Get an empty iterator.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Returns
+
+`Iterator`<T\>
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:70](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L70)
+
+___
+
+### once
+
+▸ **once**<T\>(`fn`): `Iterator`<T\>
+
+Wrap a value in an iterator.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type |
+| :------ | :------ |
+| `fn` | () => `T` |
+
+#### Returns
+
+`Iterator`<T\>
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:76](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L76)
+
+___
+
+### skip
+
+▸ **skip**<T\>(`n`, `iterator`): `Iterator`<T\>
+
+Skip the next num elements of an iterator.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `n` | `number` | The number of elements to skip. |
+| `iterator` | `Iterator`<T\> | The iterator. |
+
+#### Returns
+
+`Iterator`<T\>
+
+- The iterator after skipping n elements.
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:95](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L95)
+
+___
+
+### split
+
+▸ **split**<T\>(`length`, `iterator`): `Iterator`<Iterator<T\>\>
+
+Split an iterator into multiple iterators of a given length.
+
+#### Type parameters
+
+| Name | Type |
+| :------ | :------ |
+| `T` | `T` = `any` |
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `length` | `number` | The length of each iterator. |
+| `iterator` | `Iterator`<T\> | The iterator to split. |
+
+#### Returns
+
+`Iterator`<Iterator<T\>\>
+
+- An iterator of the resulting iterators.
+
+#### Defined in
+
+[src/collection/iteratorUtils.ts:114](https://github.com/havelessbemore/dastal/blob/2fe24da/src/collection/iteratorUtils.ts#L114)
diff --git a/docs/modules/math.md b/docs/modules/math.md
deleted file mode 100644
index caa78bd..0000000
--- a/docs/modules/math.md
+++ /dev/null
@@ -1,41 +0,0 @@
-[dastal - v3.0.0](../README.md) / math
-
-# Namespace: math
-
-## Table of contents
-
-### Namespaces
-
-- [u32](math.u32.md)
-
-### Functions
-
-- [clamp](math.md#clamp)
-
-## Functions
-
-### clamp
-
-▸ **clamp**(`num`, `min`, `max`): `number`
-
-Limits a number to be within a given range.
-
-f(x, min, max) = y, where min <= y <= max
-
-#### Parameters
-
-| Name | Type | Description |
-| :------ | :------ | :------ |
-| `num` | `number` | The number to clamp |
-| `min` | `number` | The minimum result value, inclusive |
-| `max` | `number` | The maximum result value, inclusive |
-
-#### Returns
-
-`number`
-
-The clamped number
-
-#### Defined in
-
-[src/math/num.ts:12](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/num.ts#L12)
diff --git a/docs/modules/numberutils.md b/docs/modules/numberutils.md
new file mode 100644
index 0000000..fe29ddf
--- /dev/null
+++ b/docs/modules/numberutils.md
@@ -0,0 +1,128 @@
+[dastal - v4.0.0](../README.md) / NumberUtils
+
+# Namespace: NumberUtils
+
+## Table of contents
+
+### Functions
+
+- [clamp](numberutils.md#clamp)
+- [wrap](numberutils.md#wrap)
+- [wrapLeft](numberutils.md#wrapleft)
+- [wrapRight](numberutils.md#wrapright)
+
+## Functions
+
+### clamp
+
+▸ **clamp**(`num`, `min`, `max`): `number`
+
+Limits a number to be within a given range.
+
+f(x, min, max) = y, where min <= y <= max
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `num` | `number` | The number to clamp |
+| `min` | `number` | The minimum result value, inclusive |
+| `max` | `number` | The maximum result value, inclusive |
+
+#### Returns
+
+`number`
+
+The clamped number
+
+#### Defined in
+
+[src/math/numberUtils.ts:12](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/numberUtils.ts#L12)
+
+___
+
+### wrap
+
+▸ **wrap**(`num`, `min`, `max`): `number`
+
+Wraps a number if outside a given range
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `num` | `number` | The number to wrap |
+| `min` | `number` | The minimum result value, inclusive |
+| `max` | `number` | The maximum result value, inclusive |
+
+#### Returns
+
+`number`
+
+- The wrapped number
+
+#### Defined in
+
+[src/math/numberUtils.ts:58](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/numberUtils.ts#L58)
+
+___
+
+### wrapLeft
+
+▸ **wrapLeft**(`num`, `min`, `max`): `number`
+
+Wraps a number if below a given range
+
+f(x, min, max) = {
+   x, where x >= min
+   max - (min - x), where x < min
+}
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `num` | `number` | The number to wrap |
+| `min` | `number` | The minimum result value, inclusive |
+| `max` | `number` | The maximum result value, inclusive |
+
+#### Returns
+
+`number`
+
+- The wrapped number
+
+#### Defined in
+
+[src/math/numberUtils.ts:29](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/numberUtils.ts#L29)
+
+___
+
+### wrapRight
+
+▸ **wrapRight**(`num`, `min`, `max`): `number`
+
+Wraps a number if above a given range
+
+f(x, min, max) = {
+   x, where x <= max
+   min + (x - max), where x > max
+}
+
+#### Parameters
+
+| Name | Type | Description |
+| :------ | :------ | :------ |
+| `num` | `number` | The number to wrap |
+| `min` | `number` | The minimum result value, inclusive |
+| `max` | `number` | The maximum result value, inclusive |
+
+#### Returns
+
+`number`
+
+- The wrapped number
+
+#### Defined in
+
+[src/math/numberUtils.ts:46](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/numberUtils.ts#L46)
diff --git a/docs/modules/math.u32.md b/docs/modules/u32.md
similarity index 68%
rename from docs/modules/math.u32.md
rename to docs/modules/u32.md
index d9c15f1..318d32a 100644
--- a/docs/modules/math.u32.md
+++ b/docs/modules/u32.md
@@ -1,27 +1,24 @@
-[dastal - v3.0.0](../README.md) / [math](math.md) / u32
+[dastal - v4.0.0](../README.md) / u32
 
 # Namespace: u32
 
-[math](math.md).u32
-
 Bit hacks for 32-bit unsigned numbers.
 
 ## Table of contents
 
 ### Functions
 
-- [bitsSet](math.u32.md#bitsset)
-- [invert](math.u32.md#invert)
-- [isPow2](math.u32.md#ispow2)
-- [lsb](math.u32.md#lsb)
-- [lsp](math.u32.md#lsp)
-- [lsps](math.u32.md#lsps)
-- [mlsp](math.u32.md#mlsp)
-- [msb](math.u32.md#msb)
-- [msp](math.u32.md#msp)
-- [msps](math.u32.md#msps)
-- [reverse](math.u32.md#reverse)
-- [u32](math.u32.md#u32)
+- [bitsSet](u32.md#bitsset)
+- [invert](u32.md#invert)
+- [isPow2](u32.md#ispow2)
+- [lsb](u32.md#lsb)
+- [lsp](u32.md#lsp)
+- [lsps](u32.md#lsps)
+- [msb](u32.md#msb)
+- [msp](u32.md#msp)
+- [msps](u32.md#msps)
+- [reverse](u32.md#reverse)
+- [u32](u32.md#u32)
 
 ## Functions
 
@@ -43,7 +40,7 @@ Get the number of bits set of a 32-bit unsigned number ([source](https://graphic
 
 #### Defined in
 
-[src/math/u32.ts:10](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L10)
+[src/math/u32.ts:10](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L10)
 
 ___
 
@@ -69,7 +66,7 @@ The inverted number
 
 #### Defined in
 
-[src/math/u32.ts:27](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L27)
+[src/math/u32.ts:27](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L27)
 
 ___
 
@@ -93,7 +90,7 @@ Example: 8 (1000) -> true
 
 #### Defined in
 
-[src/math/u32.ts:38](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L38)
+[src/math/u32.ts:38](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L38)
 
 ___
 
@@ -117,7 +114,7 @@ The lowest bit set
 
 #### Defined in
 
-[src/math/u32.ts:48](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L48)
+[src/math/u32.ts:48](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L48)
 
 ___
 
@@ -141,7 +138,7 @@ Get the Least Significant Power of a 32-bit unsigned number
 
 #### Defined in
 
-[src/math/u32.ts:62](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L62)
+[src/math/u32.ts:62](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L62)
 
 ___
 
@@ -165,40 +162,7 @@ Example: 54 (110110) -> 6 (000110)
 
 #### Defined in
 
-[src/math/u32.ts:72](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L72)
-
-___
-
-### mlsp
-
-▸ **mlsp**(`a`): `number`
-
-Get the Most Significant Power of the Least Significant Power Set of a 32-bit unsigned number.
-
-Example: 54 (110110) -> 4 (000100)
-
-111111
-000000
-000000
-
-000010
-111000
-001000
-000100
-
-#### Parameters
-
-| Name | Type |
-| :------ | :------ |
-| `a` | `number` |
-
-#### Returns
-
-`number`
-
-#### Defined in
-
-[src/math/u32.ts:91](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L91)
+[src/math/u32.ts:72](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L72)
 
 ___
 
@@ -222,7 +186,7 @@ Get the Most Significant Bit of a 32-bit unsigned number
 
 #### Defined in
 
-[src/math/u32.ts:101](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L101)
+[src/math/u32.ts:93](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L93)
 
 ___
 
@@ -246,7 +210,7 @@ Get the Most Significant Power of a 32-bit unsigned number
 
 #### Defined in
 
-[src/math/u32.ts:116](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L116)
+[src/math/u32.ts:108](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L108)
 
 ___
 
@@ -270,7 +234,7 @@ Example: 50 (110010) -> 48 (110000)
 
 #### Defined in
 
-[src/math/u32.ts:131](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L131)
+[src/math/u32.ts:123](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L123)
 
 ___
 
@@ -294,7 +258,7 @@ Example: 50 (110010) -> 19 (010011)
 
 #### Defined in
 
-[src/math/u32.ts:146](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L146)
+[src/math/u32.ts:138](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L138)
 
 ___
 
@@ -316,4 +280,4 @@ Turn a number into an unsigned 32-bit number
 
 #### Defined in
 
-[src/math/u32.ts:158](https://github.com/havelessbemore/dastal/blob/e94627b/src/math/u32.ts#L158)
+[src/math/u32.ts:150](https://github.com/havelessbemore/dastal/blob/2fe24da/src/math/u32.ts#L150)
diff --git a/package.json b/package.json
index 3778019..a6c17ec 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "dastal",
-  "version": "3.0.0",
+  "version": "4.0.0",
   "description": "Data Structures & Algorithms implementations",
   "main": "lib/src/index.js",
   "types": "lib/src/index.d.ts",
diff --git a/src/TODO/array/index.ts b/src/TODO/array/index.ts
deleted file mode 100644
index cbc2fed..0000000
--- a/src/TODO/array/index.ts
+++ /dev/null
@@ -1 +0,0 @@
-export * from './bigArray';
diff --git a/src/TODO/segmentTree/composedFunction.ts b/src/TODO/segmentTree/composedFunction.ts
deleted file mode 100644
index 67dd0a8..0000000
--- a/src/TODO/segmentTree/composedFunction.ts
+++ /dev/null
@@ -1,25 +0,0 @@
-import { Transform } from 'stream';
-
-export interface ComposedFunction<I = unknown, O = unknown> {
-    (input: I): O;
-}
-
-export function toStream<I = unknown, O = unknown>(fn: (arg: I) => O): Transform {
-    return new Transform({
-        allowHalfOpen: false,
-        decodeStrings: false,
-        highWaterMark: 1,
-        objectMode: true,
-        transform(arg: I, _, cb) {
-            try {
-                cb(undefined, fn(arg));
-            } catch (err) {
-                cb(err);
-            }
-        },
-    });
-}
-
-toStream(() => 3)
-    .pipe(toStream((v) => console.log(v)))
-    .read();
diff --git a/src/TODO/segmentTree/postOrderSegmentTree.ts b/src/TODO/segmentTree/postOrderSegmentTree.ts
deleted file mode 100644
index a51d264..0000000
--- a/src/TODO/segmentTree/postOrderSegmentTree.ts
+++ /dev/null
@@ -1,210 +0,0 @@
-import { bitsSet } from '../../math/u32';
-import { SegmentTree } from '../../segmentTree/segmentTree';
-/*
-export class PostOrderSegmentTree<T> implements SegmentTree<T> {
-    protected array: T[];
-    protected length: number;
-
-    constructor() {
-        this.array = [];
-        this.length = 0;
-    }
-
-    clear(): void {
-        this.array.length = 0;
-        this.length = 0;
-    }
-
-    pop(): T | undefined {
-        throw new Error('TODO');
-    }
-
-    push(element: T): number {
-        throw new Error('TODO');
-    }
-
-    query(min: number, max: number): T {
-        throw new Error('TODO');
-    }
-
-    get size(): number {
-        throw new Error('TODO');
-    }
-
-    *[Symbol.iterator](): Iterator<T> {
-        let i = 0;
-        for (let j = 0; j < this.length; j = 2 * i - onBits(i)) {
-            yield this.array[j];
-            ++i;
-        }
-    }
-
-    update(min: number, max: number, operation: Operation<T>): void {
-        throw new Error('TODO');
-    }
-}
-*/
-
-/*
-/**
-     * A helper method to apply updates to a given range. This method
-     * applies updates down only to the necessary aggregation nodes
-     * for the range.
-     *
-     * @param min - The start index of the range, inclusive.
-     * @param max - The end index of the range, exclusive.
-     *
- protected propagate(min: number, max: number): void {
-    // (a +1) & -(a + 1)
-    const stack: number[] = [];
-
-    // Get top complete aggregation nodes in the range
-    // for (let i = msp(min); i < max; stack.push(i - 1)) {
-    //     i += lsp(i | msp(this.array.length - i));
-    // }
-
-    // Get top complete aggregation nodes in the range in reverse
-
-    // Iterate through the range, jumping across the largest possible subranges
-    do {
-        const offset = lsp(min | msp(max - min));
-        const mid = min + (offset >>> 1) - 1;
-        min += offset;
-
-        // Apply updates down to the current subrange
-        do {
-            const par = stack.pop()!;
-            if (this.lazy[par]) {
-            }
-        } while (true);
-
-        // let value = operation(this.array[top], min >>> 1, (min + offset) >>> 1);
-    } while (min < max);
-}
-/**
- * A helper method to apply updates to a given range. This method
- * applies updates down to individual elements in the range.
- *
- * @param min - The start index of the range, inclusive.
- * @param max - The end index of the range, exclusive.
- *
-protected flush(min: number, max: number): void {
-    throw new Error('TODO');
-}
-*/
-
-/*
-    lazyUpdate(min: number, max: number, operation: LazyOperation<T>): void {
-        // Sanitize range
-        if (min >= max) {
-            return;
-        }
-        if (min < 0 || max > this.size) {
-            throw new RangeError(`Range [${min}..${max}) not in [0..${this.size})`);
-        }
-
-        // Translate range to interior indices
-        min *= 2;
-        max *= 2;
-
-        // Apply pending updates on the range
-        this.propagate(min, max);
-
-        // Taking the longest possible jumps from min to max...
-        let value: T;
-        do {
-            // Make the jump and update its lowest common ancestor
-            const offset = lsp(min | msp(max - min));
-            const top = min + (offset >>> 1) - 1;
-            value = operation(this.array[top], min >>> 1, (min + offset) >>> 1);
-            this.array[top] = value;
-            min += offset - 1;
-
-            // Mark children for lazy update
-            if (top & 1) {
-                (this.lazy[top] ?? new LinkedList()).push(operation);
-            }
-
-            // Update aggregation nodes
-            for (let mask = 2 * lsp(top + 1); min & mask; mask *= 2) {
-                value = this.combine(this.array[min - mask - (mask >>> 1)], value);
-                this.array[min - mask] = value;
-            }
-        } while (++min < max);
-
-        // Update remaining aggregation nodes
-        let dc = 0;
-        let dp = lsp(min);
-        max = msb(min ^ this.array.length) - lsb(min);
-        for (--min; max > 0; --max) {
-            value = this.combine(value, this.array[min + (dp >>> 1) - dc]);
-            this.array[min] = value;
-            dc = (min & (2 * dp)) >>> 0;
-            min += dp - dc;
-            dp *= 2;
-        }
-
-        // Update the incomplete aggregation node
-        this.array[min] = value;
-    }
-    */
-
-/*
-    protected propagate(min: number, max: number): void {
-        // (a +1) & -(a + 1)
-        const stack: number[] = [];
-
-        // Get top complete aggregation nodes in the range
-        // for (let i = msp(min); i < max; stack.push(i - 1)) {
-        //     i += lsp(i | msp(this.array.length - i));
-        // }
-
-        // Get top complete aggregation nodes in the range in reverse
-
-        // Iterate through the range, jumping across the largest possible subranges
-        do {
-            const offset = lsp(min | msp(max - min));
-            const mid = min + (offset >>> 1) - 1;
-            min += offset;
-
-            // Apply updates down to the current subrange
-            do {
-                const par = stack.pop()!;
-                if (this.lazy[par]) {
-                }
-            } while (true);
-
-            // let value = operation(this.array[top], min >>> 1, (min + offset) >>> 1);
-        } while (min < max);
-
-        throw new Error('Figure out initial i');
-        /*
-        let i = msp(max);
-        for (i = lsp(i | msp(this.array.length - i)); i > min; i -= i & -i) {
-            stack.push(i - (lsp(i) >>> 1) - 1);
-        }
-
-        // Take the longest possible jumps from min to max
-        while (min < max) {
-            const offset = lsp(min | msp(max - min));
-            min += offset;
-            
-            const i = min - 1 + (offset >>> 1);
-
-            
-        }
-        */
-
-// Check each level
-
-/*
-        // Get existing
-        const q = [];
-        for (let i = min; i < max; ) {
-            const offset = lsp(min | msp(max - min));
-            i += offset;
-        }
-
-        max = msb(min ^ this.array.length) - lsb(min);
-    }
-    */
diff --git a/src/array/utils.ts b/src/array/utils.ts
deleted file mode 100644
index 3675b3e..0000000
--- a/src/array/utils.ts
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- * The maximum length of an array.
- *
- * According to [ECMA-262](https://tc39.es/ecma262/#array-index):
- *     0 <= array.length <= 2^32 - 1
- */
-export const MAX_ARRAY_LENGTH = 4294967295;
-/**
- * Check if a value is an Array or TypedArray.
- *
- * @param obj - The value to check.
- *
- * @returns `true` if an Array or TypedArray, otherwise `false`.
- */
-export function isArray<T = any>(obj: unknown): obj is T[] {
-    return obj instanceof Array || isTypedArray(obj);
-}
-/**
- * Check if a value is a TypedArray.
- *
- * See [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray)
- * for more details.
- *
- * @param obj - The value to check.
- *
- * @returns `true` if a TypedArray, otherwise `false`.
- */
-export const isTypedArray = (() => {
-    const TypedArray = Object.getPrototypeOf(Uint8Array);
-    return function isTypedArray<T = any>(obj: unknown): obj is T[] {
-        return obj instanceof TypedArray;
-    };
-})();
diff --git a/src/collection/arrayUtils.ts b/src/collection/arrayUtils.ts
new file mode 100644
index 0000000..9b10267
--- /dev/null
+++ b/src/collection/arrayUtils.ts
@@ -0,0 +1,100 @@
+import { first } from 'src/collection/iteratorUtils';
+import { clamp, wrapLeft } from 'src/math/numberUtils';
+
+/**
+ * The maximum length of an array.
+ *
+ * According to the [ECMA-262](https://tc39.es/ecma262/#array-index):
+ *     0 <= array.length <= 2^32 - 1
+ *
+ * If this value should be updated, please
+ * submit a pull request with details supporting a new max length.
+ */
+export const MAX_ARRAY_LENGTH = 4294967295;
+/**
+ * The maximum number of arguments that can be safely accepted by a function.
+ *
+ * According to the [ECMA-262](https://tc39.es/ecma262/#sec-list-and-record-specification-type), there is no maximum. In practice, different
+ * environments impose their own limit ([source](https://stackoverflow.com/questions/22747068/is-there-a-max-number-of-arguments-javascript-functions-can-accept)).
+ *
+ * This value was chosen through research, local testing and iteration. The actual number of arguments
+ * accepted in an environment may be larger but hopefully not smaller. If errors are raised,
+ * please submit a bug with your environment details and a new max length.
+ */
+export const MAX_SAFE_ARGUMENT_LENGTH = 32767;
+/**
+ * Check if a value is an Array or TypedArray.
+ *
+ * @param obj - The value to check.
+ *
+ * @returns `true` if an Array or TypedArray, otherwise `false`.
+ */
+export function isArray<T = any>(obj: unknown): obj is T[] {
+    return obj instanceof Array || isTypedArray(obj);
+}
+/**
+ * Check if a value is a TypedArray.
+ *
+ * See [MDN](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/TypedArray)
+ * for more details.
+ *
+ * @param obj - The value to check.
+ *
+ * @returns `true` if a TypedArray, otherwise `false`.
+ */
+export const isTypedArray = (() => {
+    const TypedArray = Object.getPrototypeOf(Uint8Array);
+    return function isTypedArray<T = any>(obj: unknown): obj is T[] {
+        return obj instanceof TypedArray;
+    };
+})();
+/**
+ * Removes elements from an array and, if necessary, inserts new elements in their place, returning the deleted elements.
+ *
+ * Contrary to Array.splice, this will not throw an error if too many new elements are given as arguments.
+ *
+ * @param array - The array to splice.
+ * @param start - The zero-based location in the array from which to start removing elements.
+ * @param count - The number of elements to remove.
+ * @param elements - The new elements to splice in.
+ *
+ * @returns - An array containing the elements that were deleted.
+ */
+export function splice<T>(array: T[], start?: number, count?: number, elements?: Iterable<T>): T[] {
+    start = clamp(wrapLeft(start ?? 0, 0, array.length), 0, array.length);
+    count = clamp(count ?? array.length, 0, array.length - start);
+
+    // Base case
+    if (elements == null) {
+        return array.splice(start, count);
+    }
+
+    const maxStepSize = MAX_SAFE_ARGUMENT_LENGTH - 2;
+    const iterator = elements[Symbol.iterator]();
+
+    // Perform the initial splice
+    let stepSize = array.length - count;
+    const maxElems = MAX_ARRAY_LENGTH - stepSize;
+    let n = Math.min(maxStepSize, maxElems);
+    const out = array.splice(start, count, ...{ [Symbol.iterator]: () => first(n, iterator) });
+    stepSize = array.length - stepSize;
+    start += stepSize;
+
+    // Splice in new elements as long as there is space in the array
+    for (n = maxElems - stepSize; n >= maxStepSize && stepSize >= maxStepSize; n -= stepSize) {
+        stepSize = array.length;
+        array.splice(start, 0, ...{ [Symbol.iterator]: () => first(maxStepSize, iterator) });
+        stepSize = array.length - stepSize;
+        start += stepSize;
+    }
+    if (n > 0 && stepSize >= maxStepSize) {
+        array.splice(start, 0, ...{ [Symbol.iterator]: () => first(n, iterator) });
+    }
+
+    // If maximum array capacity reached
+    if (iterator.next().done != true) {
+        throw new RangeError('Invalid array length');
+    }
+
+    return out;
+}
diff --git a/src/collection/index.ts b/src/collection/index.ts
index b0ac26a..5b52cd9 100644
--- a/src/collection/index.ts
+++ b/src/collection/index.ts
@@ -1,7 +1,18 @@
 import { Collection } from './collection';
 
+export * as ArrayUtils from './arrayUtils';
 export * from './collection';
+export * as IteratorUtils from './iteratorUtils';
 
+/**
+ * Check if a value is a {@link Collection}.
+ *
+ * @param obj - The value to check.
+ *
+ * @returns - `true` if obj is a Collection, `false` otherwise.
+ */
 export function isCollection(obj: any): obj is Collection<unknown> {
-    return 'size' in obj && typeof obj['size'] === 'number';
+    return (
+        obj != null && typeof obj['size'] === 'number' && typeof obj[Symbol.iterator] === 'function'
+    );
 }
diff --git a/src/collection/iteratorUtils.ts b/src/collection/iteratorUtils.ts
new file mode 100644
index 0000000..94fc895
--- /dev/null
+++ b/src/collection/iteratorUtils.ts
@@ -0,0 +1,133 @@
+/**
+ * Get an iterator that always returns a given value.
+ */
+export function always<T = any>(fn: () => T): Iterator<T> {
+    return { next: () => ({ done: false, value: fn() }) };
+}
+/**
+ * Get an iterator that returns a value a given amount of times.
+ */
+export function fill<T = any>(length: number, fn: () => T): Iterator<T> {
+    return {
+        next: () => {
+            if (length < 1) {
+                return { done: true, value: undefined };
+            }
+            --length;
+            return { done: false, value: fn() };
+        },
+    };
+}
+/**
+ * Iterate through the first num elements of an iterator.
+ *
+ * @param n - The number of elements to iterate.
+ * @param iterator - The iterator.
+ *
+ * @returns - An iterator limited to the next n elements.
+ */
+export function first<T = any>(n: number, iterator: Iterator<T>): Iterator<T> {
+    return {
+        next: () => {
+            if (n < 1) {
+                return { done: true, value: undefined };
+            }
+            const res = iterator.next();
+            n = res.done ? 0 : n - 1;
+            return res;
+        },
+    };
+}
+/**
+ * Join multiple iterators into one.
+ *
+ * @param iterators - The iterators to join.
+ */
+export function join<T = any>(iterators: Iterator<Iterator<T>>): Iterator<T> {
+    let iterator: Iterator<T> | undefined = { next: () => ({ done: true, value: undefined }) };
+    return {
+        next: () => {
+            if (iterator == null) {
+                return { done: true, value: undefined };
+            }
+            let res = iterator.next();
+            while (res.done) {
+                const res2 = iterators.next();
+                if (res2.done) {
+                    iterator = undefined;
+                    return { done: true, value: undefined };
+                }
+                iterator = res2.value;
+                res = iterator.next();
+            }
+            return res;
+        },
+    };
+}
+/**
+ * Get an empty iterator.
+ */
+export function never<T = any>(): Iterator<T> {
+    return { next: () => ({ done: true, value: undefined }) };
+}
+/**
+ * Wrap a value in an iterator.
+ */
+export function once<T = any>(fn: () => T): Iterator<T> {
+    let done = false;
+    return {
+        next: () => {
+            const res = { done, value: fn() };
+            done = true;
+            fn = () => undefined!;
+            return res;
+        },
+    };
+}
+/**
+ * Skip the next num elements of an iterator.
+ *
+ * @param n - The number of elements to skip.
+ * @param iterator - The iterator.
+ *
+ * @returns - The iterator after skipping n elements.
+ */
+export function skip<T = any>(n: number, iterator: Iterator<T>): Iterator<T> {
+    let fn = () => {
+        let res: IteratorResult<T> = { done: false, value: undefined! };
+        while (n-- > 0 && !res.done) {
+            res = iterator.next();
+        }
+        fn = iterator.next.bind(iterator);
+        return res;
+    };
+    return { next: () => fn() };
+}
+/**
+ * Split an iterator into multiple iterators of a given length.
+ *
+ * @param length - The length of each iterator.
+ * @param iterator - The iterator to split.
+ *
+ * @returns - An iterator of the resulting iterators.
+ */
+export function split<T = any>(length: number, iterator: Iterator<T>): Iterator<Iterator<T>> {
+    if (length < 1) {
+        return { next: () => ({ done: true, value: undefined }) };
+    }
+    let done = false;
+    return {
+        next: () => {
+            if (done) {
+                return { done, value: undefined };
+            }
+            const iter = first(length, iterator);
+            const res = iter.next();
+            if (res.done) {
+                done = true;
+                return { done, value: undefined };
+            }
+            return { done, value: join([once(() => res.value), iter][Symbol.iterator]()) };
+        },
+    };
+}
diff --git a/src/heap/binaryHeap.ts b/src/heap/binaryHeap.ts
index 3d1048a..8b04ca5 100644
--- a/src/heap/binaryHeap.ts
+++ b/src/heap/binaryHeap.ts
@@ -1,4 +1,4 @@
-import { isArray, MAX_ARRAY_LENGTH } from 'src/array/utils';
+import { isArray, MAX_ARRAY_LENGTH } from 'src/collection/arrayUtils';
 import { CompareFn } from '..';
 import { Heap } from './heap';
 import { bubbleUp, heapify, sinkDown } from './utils';
diff --git a/src/heap/skewHeap.ts b/src/heap/skewHeap.ts
index 80065d9..bb3798e 100644
--- a/src/heap/skewHeap.ts
+++ b/src/heap/skewHeap.ts
@@ -1,4 +1,4 @@
-import { isArray } from 'src/array/utils';
+import { isArray } from 'src/collection/arrayUtils';
 import { BinaryTreeNode } from 'src/tree/binaryTreeNode';
 import { clone, preOrderTraverse, toBinaryTree } from 'src/tree/binaryTreeUtils';
 import { CompareFn } from '..';
diff --git a/src/index.ts b/src/index.ts
index 5430e33..c543ee6 100644
--- a/src/index.ts
+++ b/src/index.ts
@@ -1,11 +1,11 @@
+export * from './collection';
 export * from './heap';
 export * from './list';
-export * as math from './math';
+export * from './math';
 export * from './queue';
 export * from './segmentTree';
 export * from './stack';
 export * from './tree';
-// export * from './trie';
 
 /**
  * A function that combines two elements into another.
diff --git a/src/list/arrayList.ts b/src/list/arrayList.ts
index 0dd3331..7a36b6a 100644
--- a/src/list/arrayList.ts
+++ b/src/list/arrayList.ts
@@ -1,7 +1,7 @@
-import { clamp } from 'src/math';
+import { splice } from 'src/collection/arrayUtils';
+import { clamp, wrapLeft } from 'src/math/numberUtils';
 import { CompareFn } from '..';
 import { List } from './list';
-import { batch, cwrap } from './utils';
 
 /**
  * An implementation of the {@link List} interface using an array
@@ -29,10 +29,7 @@ export class ArrayList<T> implements List<T> {
 
     addAll(index: number, elements: Iterable<T>): number {
         if (index >= 0 && index <= this.size) {
-            for (const items of batch(10000, elements)) {
-                this.array.splice(index, 0, ...items);
-                index += items.length;
-            }
+            splice(this.array, index, 0, elements);
         }
         return this.size;
     }
@@ -50,16 +47,16 @@ export class ArrayList<T> implements List<T> {
     }
 
     copyWithin(index: number, min?: number, max?: number): this {
-        index = cwrap(index ?? 0, 0, this.size);
-        min = cwrap(min ?? 0, 0, this.size);
-        max = cwrap(max ?? this.size, 0, this.size);
+        index = clamp(wrapLeft(index, 0, this.size), 0, this.size);
+        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);
+        max = clamp(wrapLeft(max ?? this.size, 0, this.size), 0, this.size);
         this.array.copyWithin(index, min, max);
         return this;
     }
 
     fill(element: T, min?: number, max?: number): this {
-        min = cwrap(min ?? 0, 0, this.size);
-        max = cwrap(max ?? this.size, 0, this.size);
+        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);
+        max = clamp(wrapLeft(max ?? this.size, 0, this.size), 0, this.size);
         this.array.fill(element, min, max);
         return this;
     }
@@ -90,8 +87,8 @@ export class ArrayList<T> implements List<T> {
     }
 
     reverse(min?: number, max?: number): this {
-        min = cwrap(min ?? 0, 0, this.size);
-        max = cwrap(max ?? this.size, 0, this.size) - 1;
+        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);
+        max = clamp(wrapLeft(max ?? this.size, 0, this.size), 0, this.size) - 1;
         while (min < max) {
             const temp = this.array[min];
             this.array[min++] = this.array[max];
@@ -122,14 +119,7 @@ export class ArrayList<T> implements List<T> {
     }
 
     splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {
-        start = cwrap(start ?? 0, 0, this.size);
-        count = clamp(count ?? this.size, 0, this.size - start);
-        const list = new ArrayList(this.array.splice(start, count));
-        for (const items of batch(10000, elements ?? [])) {
-            this.array.splice(start, 0, ...items);
-            start += items.length;
-        }
-        return list;
+        return new ArrayList(splice(this.array, start, count, elements));
     }
 
     sort(compareFn: CompareFn<T>): this {
@@ -172,8 +162,8 @@ export class ArrayList<T> implements List<T> {
                 max = undefined;
             }
         }
-        min = cwrap((min as number) ?? 0, 0, this.size);
-        max = cwrap((max as number) ?? this.size, 0, this.size);
+        min = clamp(wrapLeft((min as number) ?? 0, 0, this.size), 0, this.size);
+        max = clamp(wrapLeft((max as number) ?? this.size, 0, this.size), 0, this.size);
         while (min < max) {
             this.array[min] = callback(this.array[min], min);
             ++min;
@@ -182,7 +172,7 @@ export class ArrayList<T> implements List<T> {
     }
 
     *view(min?: number, max?: number): Iterable<T> {
-        min = cwrap(min ?? 0, 0, this.size);
+        min = clamp(wrapLeft(min ?? 0, 0, this.size), 0, this.size);
 
         let len: () => number;
         if (max == null) {
diff --git a/src/list/doublyLinkedList.ts b/src/list/doublyLinkedList.ts
index cb8d6a2..6e7abf2 100644
--- a/src/list/doublyLinkedList.ts
+++ b/src/list/doublyLinkedList.ts
@@ -1,8 +1,8 @@
-import { clamp } from 'src/math';
+import { clamp, wrapLeft } from 'src/math/numberUtils';
 import { CompareFn } from '..';
 import { DoublyLinkedNode } from './doublyLinkedNode';
 import { List } from './list';
-import { linkedMergeSort, cwrap } from './utils';
+import { linkedMergeSort } from './utils';
 
 /**
  * A (circular) doubly-linked list implementation of the {@link List} interface.
@@ -63,14 +63,14 @@ export class DoublyLinkedList<T> implements List<T> {
 
     copyWithin(index: number, min?: number, max?: number): this {
         // Check if copying to the same section
-        index = cwrap(index, 0, this.length);
-        min = cwrap(min ?? 0, 0, this.length);
+        index = clamp(wrapLeft(index, 0, this.length), 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
         if (min === index) {
             return this;
         }
 
         // Check if the section to copy has no length
-        max = cwrap(max ?? this.length, 0, this.length);
+        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);
         max = min + Math.min(max - min, this.length - index);
         if (min >= max) {
             return this;
@@ -100,8 +100,8 @@ export class DoublyLinkedList<T> implements List<T> {
     }
 
     fill(element: T, min?: number, max?: number): this {
-        min = cwrap(min ?? 0, 0, this.length);
-        max = cwrap(max ?? this.length, 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
+        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);
         if (min < max) {
             let node = this._get(min);
             do {
@@ -156,8 +156,8 @@ export class DoublyLinkedList<T> implements List<T> {
     }
 
     reverse(min?: number, max?: number): this {
-        min = cwrap(min ?? 0, 0, this.length);
-        max = cwrap(max ?? this.length, 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
+        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);
         if (max - min < 2) {
             return this;
         }
@@ -207,7 +207,7 @@ export class DoublyLinkedList<T> implements List<T> {
     }
 
     splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {
-        start = cwrap(start ?? 0, 0, this.size);
+        start = clamp(wrapLeft(start ?? 0, 0, this.length), 0, this.length);
         count = clamp(count ?? this.size, 0, this.size - start);
 
         // If not modifying the list
@@ -281,8 +281,8 @@ export class DoublyLinkedList<T> implements List<T> {
                 max = undefined;
             }
         }
-        min = cwrap((min as number) ?? 0, 0, this.length);
-        max = cwrap((max as number) ?? this.length, 0, this.length);
+        min = clamp(wrapLeft((min as number) ?? 0, 0, this.length), 0, this.length);
+        max = clamp(wrapLeft((max as number) ?? this.length, 0, this.length), 0, this.length);
         if (min < max) {
             let node = this._get(min);
             do {
@@ -294,7 +294,7 @@ export class DoublyLinkedList<T> implements List<T> {
     }
 
     *view(min?: number, max?: number): Iterable<T> {
-        min = cwrap(min ?? 0, 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
 
         let len: () => number;
         if (max == null) {
diff --git a/src/list/linkedList.ts b/src/list/linkedList.ts
index 9508c9b..cd39d0c 100644
--- a/src/list/linkedList.ts
+++ b/src/list/linkedList.ts
@@ -1,8 +1,8 @@
-import { clamp } from 'src/math';
+import { clamp, wrapLeft } from 'src/math/numberUtils';
 import { CompareFn } from '..';
 import { LinkedNode } from './linkedNode';
 import { List } from './list';
-import { linkedMergeSort, cwrap } from './utils';
+import { linkedMergeSort } from './utils';
 
 /**
  * A (circular) linked list implementation of the {@link List} interface.
@@ -67,14 +67,14 @@ export class LinkedList<T> implements List<T> {
 
     copyWithin(index: number, min?: number, max?: number): this {
         // Check if copying to itself
-        index = cwrap(index, 0, this.length);
-        min = cwrap(min ?? 0, 0, this.length);
+        index = clamp(wrapLeft(index, 0, this.length), 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
         if (min === index) {
             return this;
         }
 
         // Check if the section to copy has no length
-        max = cwrap(max ?? this.length, 0, this.length);
+        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);
         max = min + Math.min(max - min, this.length - index);
         if (min >= max) {
             return this;
@@ -109,8 +109,8 @@ export class LinkedList<T> implements List<T> {
     }
 
     fill(element: T, min?: number, max?: number): this {
-        min = cwrap(min ?? 0, 0, this.length);
-        max = cwrap(max ?? this.length, 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
+        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);
         if (min < max) {
             let node = this._get(min);
             do {
@@ -170,8 +170,8 @@ export class LinkedList<T> implements List<T> {
     }
 
     reverse(min?: number, max?: number): this {
-        min = cwrap(min ?? 0, 0, this.length);
-        max = cwrap(max ?? this.length, 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
+        max = clamp(wrapLeft(max ?? this.length, 0, this.length), 0, this.length);
         if (max - min < 2) {
             return this;
         }
@@ -214,7 +214,7 @@ export class LinkedList<T> implements List<T> {
     }
 
     splice(start?: number, count?: number, elements?: Iterable<T>): List<T> {
-        start = cwrap(start ?? 0, 0, this.size);
+        start = clamp(wrapLeft(start ?? 0, 0, this.length), 0, this.length);
         count = clamp(count ?? this.size, 0, this.size - start);
 
         // If not modifying the list
@@ -286,8 +286,8 @@ export class LinkedList<T> implements List<T> {
                 max = undefined;
             }
         }
-        min = cwrap((min as number) ?? 0, 0, this.length);
-        max = cwrap((max as number) ?? this.length, 0, this.length);
+        min = clamp(wrapLeft((min as number) ?? 0, 0, this.length), 0, this.length);
+        max = clamp(wrapLeft((max as number) ?? this.length, 0, this.length), 0, this.length);
         if (min < max) {
             let node = this._get(min);
             do {
@@ -299,7 +299,7 @@ export class LinkedList<T> implements List<T> {
     }
 
     *view(min?: number, max?: number): Iterable<T> {
-        min = cwrap(min ?? 0, 0, this.length);
+        min = clamp(wrapLeft(min ?? 0, 0, this.length), 0, this.length);
 
         let len: () => number;
         if (max == null) {
diff --git a/src/list/utils.ts b/src/list/utils.ts
index d33d3ba..1d855ec 100644
--- a/src/list/utils.ts
+++ b/src/list/utils.ts
@@ -1,85 +1,7 @@
-import { isArray } from '../array/utils';
 import { CompareFn } from '..';
 import { DoublyLinkedNode } from './doublyLinkedNode';
 import { LinkedNode } from './linkedNode';
-import { clamp } from 'src/math';
 
-/**
- * Groups an iterable into batches of a given size.
- *
- * @param size - The maximum batch size
- * @param iterable - The iterable to batch
- *
- * @returns An iterable of batches
- *
- * @internal
- */
-export function batch<T>(
-    size: number,
-    iterable: Iterable<T>,
-): Generator<T[], void, number | undefined> {
-    if (isArray(iterable)) {
-        return batchArray(size, iterable);
-    }
-    return batchIterable(size, iterable);
-}
-/**
- * Groups an iterable into batches of a given size.
- *
- * @param size - The maximum batch size
- * @param iterable - The iterable to batch
- *
- * @returns An iterable of batches
- *
- * @internal
- */
-export function* batchArray<T>(size: number, array: T[]): Generator<T[], void, number | undefined> {
-    let min = 0;
-    while (min < array.length) {
-        const max = min + size;
-        size = (yield array.slice(min, max)) ?? size;
-        min = max;
-    }
-}
-/**
- * Groups an iterable into batches of a given size.
- *
- * @param size - The maximum batch size
- * @param iterable - The iterable to batch
- *
- * @returns An iterable of batches
- *
- * @internal
- */
-export function* batchIterable<T>(
-    size: number,
-    iterable: Iterable<T>,
-): Generator<T[], void, number | undefined> {
-    let array: T[] = [];
-    for (const value of iterable) {
-        if (array.push(value) >= size) {
-            size = (yield array) ?? size;
-            array = [];
-        }
-    }
-    if (array.length > 0) {
-        yield array;
-    }
-}
-/**
- * Wraps and then clamps a number within a given range.
- *
- * @param num - The number to wrap and then clamp
- * @param min - The minimum result value, inclusive
- * @param max - The wrap pivot and maximum result value, inclusive
- *
- * @returns The crwapped number
- *
- * @internal
- */
-export function cwrap(num: number, min: number, max: number): number {
-    return clamp(nwrap(num, max), min, max);
-}
 /**
  * Sorts a list in place.
  *
@@ -178,21 +100,3 @@ export function linkedMergeSorted<T, Node extends LinkedNode<T>>(
     }
     return root.next as Node;
 }
-/**
- * Wraps negative numbers around a pivot
- *
- * f(x, min, pivot) = {
- *    x, where x >= 0
- *    pivot + x, where x < 0
- * }
- *
- * @param num - The number to wrap
- * @param pivot - The number to pivot on
- *
- * @returns - The wrapped number
- *
- * @internal
- */
-export function nwrap(num: number, pivot: number): number {
-    return num < 0 ? pivot + num : num;
-}
diff --git a/src/math/index.ts b/src/math/index.ts
index bf7f5d0..90bef3f 100644
--- a/src/math/index.ts
+++ b/src/math/index.ts
@@ -1,2 +1,2 @@
 export * as u32 from './u32';
-export * from './num';
+export * as NumberUtils from './numberUtils';
diff --git a/src/math/num.ts b/src/math/num.ts
deleted file mode 100644
index 043dbb9..0000000
--- a/src/math/num.ts
+++ /dev/null
@@ -1,14 +0,0 @@
-/**
- * Limits a number to be within a given range.
- *
- * f(x, min, max) = y, where min <= y <= max
- *
- * @param num - The number to clamp
- * @param min - The minimum result value, inclusive
- * @param max - The maximum result value, inclusive
- *
- * @returns The clamped number
- */
-export function clamp(num: number, min: number, max: number): number {
-    return Math.min(max, Math.max(min, num));
-}
diff --git a/src/math/numberUtils.ts b/src/math/numberUtils.ts
new file mode 100644
index 0000000..5bfc50f
--- /dev/null
+++ b/src/math/numberUtils.ts
@@ -0,0 +1,60 @@
+/**
+ * Limits a number to be within a given range.
+ *
+ * f(x, min, max) = y, where min <= y <= max
+ *
+ * @param num - The number to clamp
+ * @param min - The minimum result value, inclusive
+ * @param max - The maximum result value, inclusive
+ *
+ * @returns The clamped number
+ */
+export function clamp(num: number, min: number, max: number): number {
+    return Math.min(max, Math.max(min, num));
+}
+/**
+ * Wraps a number if below a given range
+ *
+ * f(x, min, max) = {
+ *    x, where x >= min
+ *    max - (min - x), where x < min
+ * }
+ *
+ * @param num - The number to wrap
+ * @param min - The minimum result value, inclusive
+ * @param max - The maximum result value, inclusive
+ *
+ * @returns - The wrapped number
+ */
+export function wrapLeft(num: number, min: number, max: number): number {
+    return num < min ? max - min + num : num;
+}
+/**
+ * Wraps a number if above a given range
+ *
+ * f(x, min, max) = {
+ *    x, where x <= max
+ *    min + (x - max), where x > max
+ * }
+ *
+ * @param num - The number to wrap
+ * @param min - The minimum result value, inclusive
+ * @param max - The maximum result value, inclusive
+ *
+ * @returns - The wrapped number
+ */
+export function wrapRight(num: number, min: number, max: number): number {
+    return num > max ? min + (num - max) : num;
+}
+/**
+ * Wraps a number if outside a given range
+ *
+ * @param num - The number to wrap
+ * @param min - The minimum result value, inclusive
+ * @param max - The maximum result value, inclusive
+ *
+ * @returns - The wrapped number
+ */
+export function wrap(num: number, min: number, max: number): number {
+    return num < min ? max - min + num : wrapRight(num, min, max);
+}
diff --git a/src/math/u32.ts b/src/math/u32.ts
index e0949ae..a1ba56a 100644
--- a/src/math/u32.ts
+++ b/src/math/u32.ts
@@ -77,20 +77,12 @@ export function lsps(a: number): number {
  *
  * Example: 54 (110110) -> 4 (000100)
  *
- * 111111
- * 000000
- * 000000
- *
- * 000010
- * 111000
- * 001000
- * 000100
- *
  * @param a
- */
+ */ /*
 export function mlsp(a: number): number {
-    return lsp(a + lsp(a)) >>> 1 || u32(0x80000000 & a);
+    return (lsp(a + lsp(a)) >>> 1) || u32(0x80000000 & a);
 }
+*/
 /**
  * Get the Most Significant Bit of a 32-bit unsigned number
  *
diff --git a/src/segmentTree/inOrderSegmentTree.ts b/src/segmentTree/inOrderSegmentTree.ts
index 0cb62b9..bd21d07 100644
--- a/src/segmentTree/inOrderSegmentTree.ts
+++ b/src/segmentTree/inOrderSegmentTree.ts
@@ -1,6 +1,6 @@
 import { lsb, lsp, msb, msp } from '../math/u32';
 import { CombineFn } from '..';
-import { MAX_ARRAY_LENGTH } from 'src/array/utils';
+import { MAX_ARRAY_LENGTH } from 'src/collection/arrayUtils';
 import { SegmentTree } from './segmentTree';
 
 /*
diff --git a/src/segmentTree/levelOrderSegmentTree.ts b/src/segmentTree/levelOrderSegmentTree.ts
index a1bd7b8..1f64083 100644
--- a/src/segmentTree/levelOrderSegmentTree.ts
+++ b/src/segmentTree/levelOrderSegmentTree.ts
@@ -2,7 +2,7 @@
  *  Thanks to [Douglas Wilhelm Harder](https://ece.uwaterloo.ca/~dwharder/aads/Algorithms/Array_resizing/)
  *  for their analysis on array resizing
  */
-import { isArray, MAX_ARRAY_LENGTH } from 'src/array/utils';
+import { isArray, MAX_ARRAY_LENGTH } from 'src/collection/arrayUtils';
 import { isCollection } from 'src/collection';
 import { Collection } from 'src/collection/collection';
 import { CombineFn } from '..';
diff --git a/src/tree/aaTree.ts b/src/tree/aaTree.ts
index 072e96d..c60a11f 100644
--- a/src/tree/aaTree.ts
+++ b/src/tree/aaTree.ts
@@ -15,7 +15,7 @@ import {
     debug,
 } from './binaryTreeUtils';
 import { SortedTree } from './sortedTree';
-import { isArray } from 'src/array/utils';
+import { isArray } from 'src/collection/arrayUtils';
 import { LinkedNode } from 'src/list';
 
 /**
diff --git a/src/tree/avlTree.ts b/src/tree/avlTree.ts
index 69068ae..e5d3143 100644
--- a/src/tree/avlTree.ts
+++ b/src/tree/avlTree.ts
@@ -14,7 +14,7 @@ import {
     removeStack,
 } from './binaryTreeUtils';
 import { SortedTree } from './sortedTree';
-import { isArray } from 'src/array/utils';
+import { isArray } from 'src/collection/arrayUtils';
 import { LinkedNode } from 'src/list';
 
 /**
diff --git a/src/tree/binaryTreeUtils.ts b/src/tree/binaryTreeUtils.ts
index 353f420..0c4d5be 100644
--- a/src/tree/binaryTreeUtils.ts
+++ b/src/tree/binaryTreeUtils.ts
@@ -428,6 +428,8 @@ export function successorStack<Node extends BinaryTreeNode<unknown>>(
     return leftmostStack(stack);
 }
 /**
+ * Turn an array into a binary tree. Assumes elements are in level-order.
+ *
  * @internal
  */
 export function toBinaryTree<T>(
diff --git a/test/collection/index.ts b/test/collection/index.ts
new file mode 100644
index 0000000..c18bc1c
--- /dev/null
+++ b/test/collection/index.ts
@@ -0,0 +1,30 @@
+import { expect } from 'chai';
+import { isCollection } from 'src/collection/index';
+
+describe('collection unit tests', function () {
+    describe('#isCollection()', function () {
+        it('Should return false for undefined', function () {
+            expect(isCollection(undefined)).to.equal(false);
+        });
+        it('Should return false for null', function () {
+            expect(isCollection(null)).to.equal(false);
+        });
+        it('Should return false if no `size` property', function () {
+            expect(isCollection({})).to.equal(false);
+            expect(isCollection([])).to.equal(false);
+        });
+        it('Should return false if size property is not correct type', function () {
+            expect(isCollection({ size: 'd' })).to.equal(false);
+            expect(isCollection({ size: {} })).to.equal(false);
+            expect(isCollection({ size: false })).to.equal(false);
+        });
+        it('Should return false if not an iterable', function () {
+            expect(isCollection(true)).to.equal(false);
+            expect(isCollection(12)).to.equal(false);
+            expect(isCollection({ size: 12 })).to.equal(false);
+        });
+        it('Should return true if a Collection', function () {
+            expect(isCollection({ size: 0, [Symbol.iterator]: () => undefined })).to.equal(true);
+        });
+    });
+});
diff --git a/test/collection/iteratorUtils.ts b/test/collection/iteratorUtils.ts
new file mode 100644
index 0000000..c2dc957
--- /dev/null
+++ b/test/collection/iteratorUtils.ts
@@ -0,0 +1,183 @@
+import { expect } from 'chai';
+import { always, fill, first, join, never, once, skip, split } from 'src/collection/iteratorUtils';
+
+describe('IteratorUtils unit tests', function () {
+    describe('#always()', function () {
+        it('Should return an infinite iterable', function () {
+            let i = 0;
+            const fn = () => ++i;
+            const it = always(fn);
+            while (i < 100) {
+                const res = it.next();
+                expect(res.done).to.equal(false);
+                expect(res.value).to.equal(i);
+            }
+        });
+    });
+    describe('#fill()', function () {
+        it('Should call a function a given amount of times', function () {
+            const n = 10;
+            let i = 0;
+            const fn = () => ++i;
+            for (const v of { [Symbol.iterator]: () => fill(n, fn) }) {
+                expect(v).to.equal(i);
+            }
+            expect(i).to.equal(n);
+        });
+    });
+    describe('#first()', function () {
+        it('Should walk through a given amount of elements in an iterable', function () {
+            let i = 0;
+            const n = 100;
+            const jump = 5;
+            const fn = () => ++i;
+            const it = always(fn);
+            while (i < n) {
+                const j = i;
+                for (const v of { [Symbol.iterator]: () => first(jump, it) }) {
+                    expect(v).to.equal(i);
+                }
+                expect(i).to.equal(j + jump);
+            }
+            expect(i).to.equal(n);
+        });
+        it('Should walk through an iterable until the end', function () {
+            let i = 0;
+            const n = 100;
+            const jump = 17;
+            const fn = () => ++i;
+            const it = fill(n, fn);
+            while (i + jump <= n) {
+                const j = i;
+                for (const v of { [Symbol.iterator]: () => first(jump, it) }) {
+                    expect(v).to.equal(i);
+                }
+                expect(i).to.equal(j + jump);
+            }
+            if (i < n) {
+                for (const v of { [Symbol.iterator]: () => first(jump, it) }) {
+                    expect(v).to.equal(i);
+                }
+            }
+            expect(i).to.equal(n);
+        });
+    });
+    describe('#join()', function () {
+        it('Should join multiple iterators together', function () {
+            let i = 0;
+            const n = 100;
+            const fn = () => ++i;
+            const iterators = [fill(20, fn), fill(55, fn), fill(25, fn)];
+            const iterator = join(iterators[Symbol.iterator]());
+            for (const v of { [Symbol.iterator]: () => iterator }) {
+                expect(v).to.equal(i);
+            }
+            expect(i).to.equal(n);
+            const res = iterator.next();
+            expect(res.done).to.equal(true);
+            expect(res.value).to.equal(undefined);
+        });
+    });
+    describe('#never()', function () {
+        it('Should return an empty iterable', function () {
+            const res = never().next();
+            expect(res.done).to.equal(true);
+            expect(res.value).to.equal(undefined);
+        });
+    });
+    describe('#once()', function () {
+        it('Should return an iterable of size 1', function () {
+            let i = 0;
+            const fn = () => ++i;
+            for (const v of { [Symbol.iterator]: () => once(fn) }) {
+                expect(v).to.equal(i);
+            }
+            expect(i).to.equal(1);
+        });
+    });
+    describe('#skip()', function () {
+        it('Should skip a fixed amount', function () {
+            let i = 0;
+            const n = 100;
+            const jump = 5;
+            const fn = () => ++i;
+            const it = always(fn);
+            while (i < n) {
+                const j = i;
+                const res = skip(jump, it).next();
+                expect(res.done).to.equal(false);
+                expect(res.value).to.equal(i);
+                expect(i).to.equal(j + jump);
+            }
+            expect(i).to.equal(n);
+        });
+        it('Should skip until the end of the iterable', function () {
+            let i = 0;
+            const n = 100;
+            const jump = 17;
+            const fn = () => ++i;
+            const it = fill(n, fn);
+            while (i + jump <= n) {
+                const j = i;
+                const res = skip(jump, it).next();
+                expect(res.done).to.equal(false);
+                expect(res.value).to.equal(i);
+                expect(i).to.equal(j + jump);
+            }
+            if (i < n) {
+                const res = skip(jump, it).next();
+                expect(res.done).to.equal(true);
+                expect(res.value).to.equal(undefined);
+            }
+            expect(i).to.equal(n);
+        });
+    });
+    describe('#split()', function () {
+        it('Should return an empty iterator if amount < 0', function () {
+            const iterators = split(
+                -12,
+                fill(10, () => 1),
+            );
+            const res = never().next();
+            expect(res.done).to.equal(true);
+            expect(res.value).to.equal(undefined);
+        });
+        it('Should return an empty iterator if amount = 0', function () {
+            const iterators = split(
+                0,
+                fill(10, () => 1),
+            );
+            const res = never().next();
+            expect(res.done).to.equal(true);
+            expect(res.value).to.equal(undefined);
+        });
+        it('Should split an iterator to a given amount', function () {
+            let i = 0;
+            const n = 100;
+            const jump = 17;
+            const fn = () => ++i;
+            const iterators = split(jump, fill(n, fn));
+            while (i + jump <= n) {
+                const j = i;
+                const res = iterators.next();
+                expect(res.done).to.equal(false);
+                expect(res.value).to.not.equal(null);
+                for (const v of { [Symbol.iterator]: () => res.value }) {
+                    expect(v).to.equal(i);
+                }
+                expect(i).to.equal(j + jump);
+            }
+            if (i < n) {
+                const res = iterators.next();
+                expect(res.done).to.equal(false);
+                expect(res.value).to.not.equal(null);
+                for (const v of { [Symbol.iterator]: () => res.value }) {
+                    expect(v).to.equal(i);
+                }
+            }
+            expect(iterators.next().done).to.equal(true);
+            expect(iterators.next().done).to.equal(true);
+            expect(i).to.equal(n);
+        });
+    });
+});
diff --git a/test/list/arrayList.ts b/test/list/arrayList.ts
index 4b5df94..dcbf68c 100644
--- a/test/list/arrayList.ts
+++ b/test/list/arrayList.ts
@@ -2,8 +2,11 @@ import { expect } from 'chai';
 import { randomFill, randomInt } from 'crypto';
 import { CompareFn } from 'src';
 import { ArrayList } from 'src/list/arrayList';
-import { cwrap } from 'src/list/utils';
-import { clamp } from 'src/math';
+import { clamp, wrapLeft } from 'src/math/numberUtils';
+
+export function cwrap(num: number, min: number, max: number): number {
+    return clamp(wrapLeft(num, 0, max), min, max);
+}
 
 describe('ArrayList unit tests', function () {
     let empty: ArrayList<number>;
diff --git a/test/list/doublyLinkedList.ts b/test/list/doublyLinkedList.ts
index dfa0d5a..3c96310 100644
--- a/test/list/doublyLinkedList.ts
+++ b/test/list/doublyLinkedList.ts
@@ -2,8 +2,11 @@ import { expect } from 'chai';
 import { randomFill, randomInt } from 'crypto';
 import { CompareFn } from 'src';
 import { DoublyLinkedList } from 'src/list/doublyLinkedList';
-import { cwrap } from 'src/list/utils';
-import { clamp } from 'src/math';
+import { clamp, wrapLeft } from 'src/math/numberUtils';
+
+export function cwrap(num: number, min: number, max: number): number {
+    return clamp(wrapLeft(num, 0, max), min, max);
+}
 
 describe('DoublyLinkedList unit tests', function () {
     let empty: DoublyLinkedList<number>;
diff --git a/test/list/linkedList.ts b/test/list/linkedList.ts
index b59f732..e5bd008 100644
--- a/test/list/linkedList.ts
+++ b/test/list/linkedList.ts
@@ -2,8 +2,11 @@ import { expect } from 'chai';
 import { randomFill, randomInt } from 'crypto';
 import { CompareFn } from 'src';
 import { LinkedList } from 'src/list/linkedList';
-import { cwrap } from 'src/list/utils';
-import { clamp } from 'src/math';
+import { clamp, wrapLeft } from 'src/math/numberUtils';
+
+export function cwrap(num: number, min: number, max: number): number {
+    return clamp(wrapLeft(num, 0, max), min, max);
+}
 
 describe('LinkedList unit tests', function () {
     let empty: LinkedList<number>;
diff --git a/test/math/num.ts b/test/math/num.ts
deleted file mode 100644
index f4c40e7..0000000
--- a/test/math/num.ts
+++ /dev/null
@@ -1,27 +0,0 @@
-import { expect } from 'chai';
-import { clamp } from 'src/math/num';
-
-describe('math/num unit tests', function () {
-    describe('#clamp()', function () {
-        it('Should return the given number if within [min, max]', function () {
-            expect(clamp(-5, -10, 0)).to.equal(-5);
-            expect(clamp(5, 0, 10)).to.equal(5);
-        });
-        it('Should return min if before [min, max]', function () {
-            expect(clamp(-15, -10, 0)).to.equal(-10);
-            expect(clamp(-5, 0, 10)).to.equal(0);
-        });
-        it('Should return min if equal to min', function () {
-            expect(clamp(-10, -10, 0)).to.equal(-10);
-            expect(clamp(0, 0, 10)).to.equal(0);
-        });
-        it('Should return max if equal to max', function () {
-            expect(clamp(0, -10, 0)).to.equal(0);
-            expect(clamp(10, 0, 10)).to.equal(10);
-        });
-        it('Should return max if after [min, max]', function () {
-            expect(clamp(5, -10, 0)).to.equal(0);
-            expect(clamp(15, 0, 10)).to.equal(10);
-        });
-    });
-});
diff --git a/test/math/numberUtils.ts b/test/math/numberUtils.ts
new file mode 100644
index 0000000..eb27598
--- /dev/null
+++ b/test/math/numberUtils.ts
@@ -0,0 +1,93 @@
+import { expect } from 'chai';
+import { clamp, wrap, wrapLeft, wrapRight } from 'src/math/numberUtils';
+
+describe('numberUtils unit tests', function () {
+    describe('#clamp()', function () {
+        it('Should return min if < min', function () {
+            expect(clamp(-150, -10, 0)).to.equal(-10);
+            expect(clamp(-500, 0, 10)).to.equal(0);
+        });
+        it('Should return the given number if = min', function () {
+            expect(clamp(-10, -10, 0)).to.equal(-10);
+            expect(clamp(0, 0, 10)).to.equal(0);
+        });
+        it('Should return the given number if within [min, max]', function () {
+            expect(clamp(-5, -10, 0)).to.equal(-5);
+            expect(clamp(5, 0, 10)).to.equal(5);
+        });
+        it('Should return the given number if = max', function () {
+            expect(clamp(0, -10, 0)).to.equal(0);
+            expect(clamp(10, 0, 10)).to.equal(10);
+        });
+        it('Should return max if > max', function () {
+            expect(clamp(500, -10, 0)).to.equal(0);
+            expect(clamp(150, 0, 10)).to.equal(10);
+        });
+    });
+    describe('#wrap()', function () {
+        it('Should wrap around max if < min', function () {
+            expect(wrap(-150, -10, 10)).to.equal(-130);
+            expect(wrap(-500, 0, 10)).to.equal(-490);
+        });
+        it('Should return the given number if = min', function () {
+            expect(wrap(-10, -10, 0)).to.equal(-10);
+            expect(wrap(0, 0, 10)).to.equal(0);
+        });
+        it('Should return the given number if within [min, max]', function () {
+            expect(wrap(-5, -10, 0)).to.equal(-5);
+            expect(wrap(5, 0, 10)).to.equal(5);
+        });
+        it('Should return the given number if = max', function () {
+            expect(wrap(0, -10, 0)).to.equal(0);
+            expect(wrap(10, 0, 10)).to.equal(10);
+        });
+        it('Should wrap around min if > max', function () {
+            expect(wrap(500, -10, 0)).to.equal(490);
+            expect(wrap(150, -5, 10)).to.equal(135);
+        });
+    });
+    describe('#wrapLeft()', function () {
+        it('Should wrap around max if < min', function () {
+            expect(wrapLeft(9, 10, 20)).to.equal(19);
+            expect(wrapLeft(-500, 10, 20)).to.equal(-490);
+        });
+        it('Should return the given number if = min', function () {
+            expect(wrapLeft(-10, -10, 0)).to.equal(-10);
+            expect(wrapLeft(0, 0, 10)).to.equal(0);
+        });
+        it('Should return the given number if within [min, max]', function () {
+            expect(wrapLeft(-5, -10, 0)).to.equal(-5);
+            expect(wrapLeft(5, 0, 10)).to.equal(5);
+        });
+        it('Should return the given number if = max', function () {
+            expect(wrapLeft(0, -10, 0)).to.equal(0);
+            expect(wrapLeft(10, 0, 10)).to.equal(10);
+        });
+        it('Should return the given number if > max', function () {
+            expect(wrapLeft(150, -10, 0)).to.equal(150);
+            expect(wrapLeft(500, 0, 10)).to.equal(500);
+        });
+    });
+    describe('#wrapRight()', function () {
+        it('Should return the given number if < min', function () {
+            expect(wrapRight(-150, -10, 0)).to.equal(-150);
+            expect(wrapRight(-500, 0, 10)).to.equal(-500);
+        });
+        it('Should return the given number if = min', function () {
+            expect(wrapRight(-10, -10, 0)).to.equal(-10);
+            expect(wrapRight(0, 0, 10)).to.equal(0);
+        });
+        it('Should return the given number if within [min, max]', function () {
+            expect(wrapRight(-5, -10, 0)).to.equal(-5);
+            expect(wrapRight(5, 0, 10)).to.equal(5);
+        });
+        it('Should return the given number if = max', function () {
+            expect(wrapRight(0, -10, 0)).to.equal(0);
+            expect(wrapRight(10, 0, 10)).to.equal(10);
+        });
+        it('Should wrap around min if > max', function () {
+            expect(wrapRight(500, -20, -10)).to.equal(490);
+            expect(wrapRight(150, 10, 20)).to.equal(140);
+        });
+    });
+});
diff --git a/test/math/u32.ts b/test/math/u32.ts
index ec4119c..0583fb7 100644
--- a/test/math/u32.ts
+++ b/test/math/u32.ts
@@ -1,7 +1,20 @@
 import { expect } from 'chai';
-import { invert, lsb, lsp, lsps, msb, msp, msps, bitsSet, reverse, u32 } from 'src/math/u32';
+import {
+    invert,
+    lsb,
+    lsp,
+    lsps,
+    msb,
+    msp,
+    msps,
+    bitsSet,
+    reverse,
+    u32,
+    isPow2,
+} from 'src/math/u32';
 
-describe('math/bits unit tests', function () {
+describe('u32 unit tests', function () {
+    const p32 = 4294967296;
     const neg = [-1, -2, -3, -4, -5, -6, -7, -8, -9, -10, -11, -12, -13, -14, -15, -16];
     const pos = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16];
     describe('#bitsSet()', function () {
@@ -38,6 +51,21 @@ describe('math/bits unit tests', function () {
             }
         });
     });
+    describe('#isPow2()', function () {
+        it('Should work for all powers of 2', function () {
+            for (let i = 1; i <= p32; i *= 2) {
+                expect(isPow2(i)).to.equal(true);
+            }
+        });
+        it('Should work for zero', function () {
+            expect(isPow2(0)).to.equal(true);
+        });
+        it('Should work for non powers of 2', function () {
+            for (let i = 3; i < 36; ++i) {
+                expect(isPow2(i)).to.equal(Math.log2(i) % 1 === 0);
+            }
+        });
+    });
     describe('#lsb()', function () {
         const nVals = [0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4];
         const pVals = [0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0, 4];
@@ -73,7 +101,6 @@ describe('math/bits unit tests', function () {
         });
     });
     describe('#lsps()', function () {
-        const p32 = 4294967296;
         const nVals = [
             p32 - 1,
             p32 - 2,
@@ -143,7 +170,6 @@ describe('math/bits unit tests', function () {
         });
     });
     describe('#msps()', function () {
-        const p32 = 4294967296;
         const nVals = [1, 2, 4, 4, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16].map((v) => p32 - v);
         const pVals = [1, 2, 3, 4, 4, 6, 7, 8, 8, 8, 8, 12, 12, 14, 15, 16];
         it('Should work for "negative" values', function () {
@@ -190,7 +216,6 @@ describe('math/bits unit tests', function () {
         });
     });
     describe('#u32()', function () {
-        const p32 = 2 ** 32;
         const nVals = [
             p32 - 1,
             p32 - 2,