sorted-btree - npm Package Compare versions

Comparing version 1.1.0 to 1.1.1

b+tree.min.js

@@ -1,1 +0,1 @@
-var __extends=this&&this.__extends||function(){var e=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(e,t){e.__proto__=t}||function(e,t){for(var r in t)t.hasOwnProperty(r)&&(e[r]=t[r])};return function(t,r){function i(){this.constructor=t}e(t,r),t.prototype=null===r?Object.create(r):(i.prototype=r.prototype,new i)}}(),__read=this&&this.__read||function(e,t){var r="function"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var i,n,o=r.call(e),s=[];try{for(;(void 0===t||t-- >0)&&!(i=o.next()).done;)s.push(i.value)}catch(e){n={error:e}}finally{try{i&&!i.done&&(r=o.return)&&r.call(o)}finally{if(n)throw n.error}}return s},__spread=this&&this.__spread||function(){for(var e=[],t=0;t<arguments.length;t++)e=e.concat(__read(arguments[t]));return e};!function(e){if("object"==typeof module&&"object"==typeof module.exports){var t=e(require,exports);void 0!==t&&(module.exports=t)}else"function"==typeof define&&define.amd&&define(["require","exports"],e)}(function(e,t){"use strict";function r(e,t){var r=e-t;return r===r?r:(e&&(e=e.valueOf()),t&&(t=t.valueOf()),e<t?-1:e>t?1:e==t?0:r)}function i(e){void 0===e&&(e=function(){return{done:!0,value:void 0}});var t={next:e};return Symbol&&Symbol.iterator&&(t[Symbol.iterator]=function(){return this}),t}function n(e){for(var t=[],r=1;r<arguments.length;r++)t[r-1]=arguments[r];if(!e)throw t.unshift("B+ tree "),new Error(t.join(" "))}Object.defineProperty(t,"__esModule",{value:!0}),t.defaultComparator=r;var o=function(){function e(e,t,i){this._root=p,this._size=0,this._maxNodeSize=i>=4?Math.min(i,256):32,this._compare=t||r,e&&this.setPairs(e)}return Object.defineProperty(e.prototype,"size",{get:function(){return this._size},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"length",{get:function(){return this._size},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"isEmpty",{get:function(){return 0===this._size},enumerable:!0,configurable:!0}),e.prototype.clear=function(){this._root=p,this._size=0},e.prototype.forEach=function(e,t){var r=this;return void 0!==t&&(e=e.bind(t)),this.forEachPair(function(t,i){return e(i,t,r)})},e.prototype.forEachPair=function(e,t){var r=this.minKey(),i=this.maxKey();return this.forRange(r,i,!0,e,t)},e.prototype.get=function(e,t){return this._root.get(e,t,this)},e.prototype.set=function(e,t,r){this._root.isShared&&(this._root=this._root.clone());var i=this._root.set(e,t,r,this);return!0===i||!1===i?i:(this._root=new h([this._root,i]),!0)},e.prototype.has=function(e){return 0!==this.forRange(e,e,!0,void 0)},e.prototype.delete=function(e){return 0!==this.editRange(e,e,!0,f)},e.prototype.with=function(e,t,r){var i=this.clone();return i.set(e,t,r)||r?i:this},e.prototype.withPairs=function(e,t){var r=this.clone();return 0!==r.setPairs(e,t)||t?r:this},e.prototype.withKeys=function(e,t){for(var r=this.clone(),i=!1,n=0;n<e.length;n++)i=r.set(e[n],void 0,!1)||i;return t&&!i?this:r},e.prototype.without=function(e,t){return this.withoutRange(e,e,!0,t)},e.prototype.withoutKeys=function(e,t){var r=this.clone();return r.deleteKeys(e)||!t?r:this},e.prototype.withoutRange=function(e,t,r,i){var n=this.clone();return 0===n.deleteRange(e,t,r)&&i?this:n},e.prototype.filter=function(e,t){var r,i=this.greedyClone();return i.editAll(function(t,i,n){if(!e(t,i,n))return r=u}),!r&&t?this:i},e.prototype.mapValues=function(e){var t={},r=this.greedyClone();return r.editAll(function(r,i,n){return t.value=e(i,r,n),t}),r},e.prototype.reduce=function(e,t){for(var r,i=0,n=t,o=this.entries(this.minKey(),y);!(r=o.next()).done;)n=e(n,r.value,i++,this);return n},e.prototype.entries=function(e,t){var r=this.findPath(e);if(void 0===r)return i();var n=r.nodequeue,o=r.nodeindex,s=r.leaf,h=void 0!==t?1:0,a=void 0===e?-1:s.indexOf(e,0,this._compare)-1;return i(function(){e:for(;;)switch(h){case 0:if(++a<s.keys.length)return{done:!1,value:[s.keys[a],s.values[a]]};h=2;continue;case 1:if(++a<s.keys.length)return t[0]=s.keys[a],t[1]=s.values[a],{done:!1,value:t};h=2;case 2:for(var e=-1;;){if(++e>=n.length){h=3;continue e}if(++o[e]<n[e].length)break}for(;e>0;e--)n[e-1]=n[e][o[e]].children,o[e-1]=0;s=n[0][o[0]],a=-1,h=void 0!==t?1:0;continue;case 3:return{done:!0,value:void 0}}})},e.prototype.entriesReversed=function(e,t,r){if(void 0===(e=e||this.maxKey()))return i();var o=this.findPath(e)||this.findPath(this.maxKey()),s=o.nodequeue,h=o.nodeindex,a=o.leaf;n(!s[0]||a===s[0][h[0]],"wat!");var u=a.indexOf(e,0,this._compare);r||this._compare(a.keys[u],e)>0||u++;var f=void 0!==t?1:0;return i(function(){e:for(;;)switch(f){case 0:if(--u>=0)return{done:!1,value:[a.keys[u],a.values[u]]};f=2;continue;case 1:if(--u>=0)return t[0]=a.keys[u],t[1]=a.values[u],{done:!1,value:t};f=2;case 2:for(var e=-1;;){if(++e>=s.length){f=3;continue e}if(--h[e]>=0)break}for(;e>0;e--)s[e-1]=s[e][h[e]].children,h[e-1]=s[e-1].length-1;a=s[0][h[0]],u=a.keys.length,f=void 0!==t?1:0;continue;case 3:return{done:!0,value:void 0}}})},e.prototype.findPath=function(e){var t,r,i=this._root;if(i.isLeaf)t=c,r=c;else{t=[],r=[];for(var n=0;!i.isLeaf;n++){if(t[n]=i.children,r[n]=void 0===e?0:i.indexOf(e,0,this._compare),r[n]>=t[n].length)return;i=t[n][r[n]]}t.reverse(),r.reverse()}return{nodequeue:t,nodeindex:r,leaf:i}},e.prototype.keys=function(e){var t=this.entries(e,y);return i(function(){var e=t.next();return e.value&&(e.value=e.value[0]),e})},e.prototype.values=function(e){var t=this.entries(e,y);return i(function(){var e=t.next();return e.value&&(e.value=e.value[1]),e})},Object.defineProperty(e.prototype,"maxNodeSize",{get:function(){return this._maxNodeSize},enumerable:!0,configurable:!0}),e.prototype.minKey=function(){return this._root.minKey()},e.prototype.maxKey=function(){return this._root.maxKey()},e.prototype.clone=function(){this._root.isShared=!0;var t=new e(void 0,this._compare,this._maxNodeSize);return t._root=this._root,t._size=this._size,t},e.prototype.greedyClone=function(t){var r=new e(void 0,this._compare,this._maxNodeSize);return r._root=this._root.greedyClone(t),r._size=this._size,r},e.prototype.toArray=function(e){void 0===e&&(e=2147483647);var t=this.minKey(),r=this.maxKey();return void 0!==t?this.getRange(t,r,!0,e):[]},e.prototype.keysArray=function(){var e=[];return this._root.forRange(this.minKey(),this.maxKey(),!0,!1,this,0,function(t,r){e.push(t)}),e},e.prototype.valuesArray=function(){var e=[];return this._root.forRange(this.minKey(),this.maxKey(),!0,!1,this,0,function(t,r){e.push(r)}),e},e.prototype.toString=function(){return this.toArray().toString()},e.prototype.setIfNotPresent=function(e,t){return this.set(e,t,!1)},e.prototype.nextHigherPair=function(e){var t=this.entries(e,y),r=t.next();return!r.done&&this._compare(r.value[0],e)<=0&&(r=t.next()),r.value},e.prototype.nextHigherKey=function(e){var t=this.nextHigherPair(e);return t?t[0]:t},e.prototype.nextLowerPair=function(e){return this.entriesReversed(e,y,!0).next().value},e.prototype.nextLowerKey=function(e){var t=this.nextLowerPair(e);return t?t[0]:t},e.prototype.changeIfPresent=function(e,t){return 0!==this.editRange(e,e,!0,function(e,r){return{value:t}})},e.prototype.getRange=function(e,t,r,i){void 0===i&&(i=67108863);var n=[];return this._root.forRange(e,t,r,!1,this,0,function(e,t){return n.push([e,t]),n.length>i?l:void 0}),n},e.prototype.setPairs=function(e,t){for(var r=0,i=0;i<e.length;i++)this.set(e[i][0],e[i][1],t)&&r++;return r},e.prototype.forRange=function(e,t,r,i,n){var o=this._root.forRange(e,t,r,!1,this,n||0,i);return"number"==typeof o?o:o.break},e.prototype.editRange=function(e,t,r,i,n){var o=this._root;o.isShared&&(this._root=o=o.clone());try{var s=o.forRange(e,t,r,!0,this,n||0,i);return"number"==typeof s?s:s.break}finally{for(;o.keys.length<=1&&!o.isLeaf;)this._root=o=0===o.keys.length?p:o.children[0]}},e.prototype.editAll=function(e,t){return this.editRange(this.minKey(),this.maxKey(),!0,e,t)},e.prototype.deleteRange=function(e,t,r){return this.editRange(e,t,r,f)},e.prototype.deleteKeys=function(e){for(var t=0,r=0;t<e.length;t++)this.delete(e[t])&&r++;return r},Object.defineProperty(e.prototype,"height",{get:function(){for(var e=this._root,t=-1;null!=e;t++)e=e.children;return t},enumerable:!0,configurable:!0}),e.prototype.freeze=function(){var e=this;e.clear=e.set=e.editRange=function(){throw new Error("Attempted to modify a frozen BTree")}},e.prototype.unfreeze=function(){delete this.clear,delete this.set,delete this.editRange},e.prototype.checkValid=function(){var e=this._root.checkValid(0,this);n(e===this.size,"size mismatch: counted ",e,"but stored",this.size)},e}();t.default=o,Symbol&&Symbol.iterator&&(o.prototype[Symbol.iterator]=o.prototype.entries),o.prototype.where=o.prototype.filter,o.prototype.setRange=o.prototype.setPairs;var s=function(){function e(e,t){void 0===e&&(e=[]),this.keys=e,this.values=t||a,this.isShared=void 0}return Object.defineProperty(e.prototype,"isLeaf",{get:function(){return void 0===this.children},enumerable:!0,configurable:!0}),e.prototype.maxKey=function(){return this.keys[this.keys.length-1]},e.prototype.indexOf=function(e,t,r){for(var i=this.keys,n=0,o=i.length,s=o>>1;n<o;){var h=r(i[s],e);if(h<0)n=s+1;else{if(!(h>0)){if(0===h)return s;if(e===e)return i.length;throw new Error("BTree: NaN was used as a key")}o=s}s=n+o>>1}return s^t},e.prototype.minKey=function(){return this.keys[0]},e.prototype.clone=function(){var t=this.values;return new e(this.keys.slice(0),t===a?t:t.slice(0))},e.prototype.greedyClone=function(e){return this.isShared&&!e?this:this.clone()},e.prototype.get=function(e,t,r){var i=this.indexOf(e,-1,r._compare);return i<0?t:this.values[i]},e.prototype.checkValid=function(e,t){var r=this.keys.length,i=this.values.length;return n(this.values===a?r<=i:r===i,"keys/values length mismatch: depth",e,"with lengths",r,i),n(0==e||r>0,"empty leaf at depth",e),r},e.prototype.set=function(e,t,r,i){var n=this.indexOf(e,-1,i._compare);if(n<0){if(n=~n,i._size++,this.keys.length<i._maxNodeSize)return this.insertInLeaf(n,e,t,i);var o=this.splitOffRightSide(),s=this;return n>this.keys.length&&(n-=this.keys.length,s=o),s.insertInLeaf(n,e,t,i),o}return!1!==r&&(void 0!==t&&this.reifyValues(),this.keys[n]=e,this.values[n]=t),!1},e.prototype.reifyValues=function(){return this.values===a?this.values=this.values.slice(0,this.keys.length):this.values},e.prototype.insertInLeaf=function(e,t,r,i){if(this.keys.splice(e,0,t),this.values===a){for(;a.length<i._maxNodeSize;)a.push(void 0);if(void 0===r)return!0;this.values=a.slice(0,this.keys.length-1)}return this.values.splice(e,0,r),!0},e.prototype.takeFromRight=function(e){var t=this.values;e.values===a?t!==a&&t.push(void 0):(t=this.reifyValues(),t.push(e.values.shift())),this.keys.push(e.keys.shift())},e.prototype.takeFromLeft=function(e){var t=this.values;e.values===a?t!==a&&t.unshift(void 0):(t=this.reifyValues(),t.unshift(e.values.pop())),this.keys.unshift(e.keys.pop())},e.prototype.splitOffRightSide=function(){var t=this.keys.length>>1;return new e(this.keys.splice(t),this.values===a?a:this.values.splice(t))},e.prototype.forRange=function(e,t,r,i,n,o,s){var h,u,f=n._compare;if(t===e){if(!r)return o;if(u=(h=this.indexOf(e,-1,f))+1,h<0)return o}else h=this.indexOf(e,0,f),u=this.indexOf(t,-1,f),u<0?u=~u:!0===r&&u++;var l=this.keys,p=this.values;if(void 0!==s)for(var c=h;c<u;c++){var y=l[c],d=s(y,p[c],o++);if(void 0!==d){if(!0===i){if(y!==l[c]||!0===this.isShared)throw new Error("BTree illegally changed or cloned in editRange");d.delete?(this.keys.splice(c,1),this.values!==a&&this.values.splice(c,1),n._size--,c--,u--):d.hasOwnProperty("value")&&(p[c]=d.value)}if(void 0!==d.break)return d}}else o+=u-h;return o},e.prototype.mergeSibling=function(e,t){var r,i;if((r=this.keys).push.apply(r,__spread(e.keys)),this.values===a){if(e.values===a)return;this.values=this.values.slice(0,this.keys.length)}(i=this.values).push.apply(i,__spread(e.reifyValues()))},e}(),h=function(e){function t(t,r){var i=this;if(!r){r=[];for(var n=0;n<t.length;n++)r[n]=t[n].maxKey()}return i=e.call(this,r)||this,i.children=t,i}return __extends(t,e),t.prototype.clone=function(){for(var e=this.children.slice(0),r=0;r<e.length;r++)e[r].isShared=!0;return new t(e,this.keys.slice(0))},t.prototype.greedyClone=function(e){if(this.isShared&&!e)return this;for(var r=new t(this.children.slice(0),this.keys.slice(0)),i=0;i<r.children.length;i++)r.children[i]=r.children[i].greedyClone();return r},t.prototype.minKey=function(){return this.children[0].minKey()},t.prototype.get=function(e,t,r){var i=this.indexOf(e,0,r._compare),n=this.children;return i<n.length?n[i].get(e,t,r):void 0},t.prototype.checkValid=function(e,t){var r=this.keys.length,i=this.children.length;n(r===i,"keys/children length mismatch: depth",e,"lengths",r,i),n(r>1,"internal node has length",r,"at depth",e);for(var o=0,s=this.children,h=this.keys,a=0,u=0;u<i;u++)o+=s[u].checkValid(e+1,t),a+=s[u].keys.length,n(o>=a,"wtf"),n(0===u||s[u-1].constructor===s[u].constructor,"type mismatch"),s[u].maxKey()!=h[u]&&n(!1,"keys[",u,"] =",h[u],"is wrong, should be ",s[u].maxKey(),"at depth",e),0===u||t._compare(h[u-1],h[u])<0||n(!1,"sort violation at depth",e,"index",u,"keys",h[u-1],h[u]);var f=a<(t.maxNodeSize>>1)*i;return(f||a>t.maxNodeSize*i)&&n(!1,f?"too few":"too many","children (",a,o,") at depth",e,", maxNodeSize:",t.maxNodeSize,"children.length:",i),o},t.prototype.set=function(e,t,r,i){var n=this.children,o=i._maxNodeSize,s=i._compare,h=Math.min(this.indexOf(e,0,s),n.length-1),a=n[h];if(a.isShared&&(n[h]=a=a.clone()),a.keys.length>=o){var u;h>0&&(u=n[h-1]).keys.length<o&&s(a.keys[0],e)<0?(u.isShared&&(n[h-1]=u=u.clone()),u.takeFromRight(a),this.keys[h-1]=u.maxKey()):void 0!==(u=n[h+1])&&u.keys.length<o&&s(a.maxKey(),e)<0&&(u.isShared&&(n[h+1]=u=u.clone()),u.takeFromLeft(a),this.keys[h]=n[h].maxKey())}var f=a.set(e,t,r,i);if(!1===f)return!1;if(this.keys[h]=a.maxKey(),!0===f)return!0;if(this.keys.length<o)return this.insert(h+1,f),!0;var l=this.splitOffRightSide(),p=this;return s(f.maxKey(),this.maxKey())>0&&(p=l,h-=this.keys.length),p.insert(h+1,f),l},t.prototype.insert=function(e,t){this.children.splice(e,0,t),this.keys.splice(e,0,t.maxKey())},t.prototype.splitOffRightSide=function(){var e=this.children.length>>1;return new t(this.children.splice(e),this.keys.splice(e))},t.prototype.takeFromRight=function(e){this.keys.push(e.keys.shift()),this.children.push(e.children.shift())},t.prototype.takeFromLeft=function(e){this.keys.unshift(e.keys.pop()),this.children.unshift(e.children.pop())},t.prototype.forRange=function(e,t,r,i,o,s,h){var a=o._compare,u=this.indexOf(e,0,a),f=u,l=Math.min(t===e?u:this.indexOf(t,0,a),this.keys.length-1),p=this.keys,c=this.children;if(i){if(f<=l)try{for(;f<=l;f++){c[f].isShared&&(c[f]=c[f].clone());var y=c[f].forRange(e,t,r,i,o,s,h);if(p[f]=c[f].maxKey(),"number"!=typeof y)return y;s=y}}finally{var d=o._maxNodeSize>>1;for(u>0&&u--,f=l;f>=u;f--)c[f].keys.length<=d&&this.tryMerge(f,o._maxNodeSize);0===c[0].keys.length&&(n(1===c.length&&1===p.length,"emptiness bug"),c.shift(),p.shift())}}else for(;f<=l;f++){var y=c[f].forRange(e,t,r,i,o,s,h);if("number"!=typeof y)return y;s=y}return s},t.prototype.tryMerge=function(e,t){var r=this.children;return e>=0&&e+1<r.length&&r[e].keys.length+r[e+1].keys.length<=t&&(r[e].isShared&&(r[e]=r[e].clone()),r[e].mergeSibling(r[e+1],t),r.splice(e+1,1),this.keys.splice(e+1,1),this.keys[e]=r[e].maxKey(),!0)},t.prototype.mergeSibling=function(e,t){var r,i,n=this.keys.length;(r=this.keys).push.apply(r,__spread(e.keys)),(i=this.children).push.apply(i,__spread(e.children)),this.tryMerge(n-1,t)},t}(s),a=[],u={delete:!0},f=function(){return u},l={break:!0},p=function(){var e=new s;return e.isShared=!0,e}(),c=[],y=[];t.EmptyBTree=function(){var e=new o;return e.freeze(),e}()});
+var __extends=this&&this.__extends||function(){var e=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(e,t){e.__proto__=t}||function(e,t){for(var r in t)t.hasOwnProperty(r)&&(e[r]=t[r])};return function(t,r){function i(){this.constructor=t}e(t,r),t.prototype=null===r?Object.create(r):(i.prototype=r.prototype,new i)}}();!function(e){if("object"==typeof module&&"object"==typeof module.exports){var t=e(require,exports);void 0!==t&&(module.exports=t)}else"function"==typeof define&&define.amd&&define(["require","exports"],e)}(function(e,t){"use strict";function r(e,t){var r=e-t;return r===r?r:(e&&(e=e.valueOf()),t&&(t=t.valueOf()),e<t?-1:e>t?1:e==t?0:r)}function i(e){void 0===e&&(e=function(){return{done:!0,value:void 0}});var t={next:e};return Symbol&&Symbol.iterator&&(t[Symbol.iterator]=function(){return this}),t}function n(e){for(var t=[],r=1;r<arguments.length;r++)t[r-1]=arguments[r];if(!e)throw t.unshift("B+ tree "),new Error(t.join(" "))}Object.defineProperty(t,"__esModule",{value:!0}),t.defaultComparator=r;var o=function(){function e(e,t,i){this._root=p,this._size=0,this._maxNodeSize=i>=4?Math.min(i,256):32,this._compare=t||r,e&&this.setPairs(e)}return Object.defineProperty(e.prototype,"size",{get:function(){return this._size},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"length",{get:function(){return this._size},enumerable:!0,configurable:!0}),Object.defineProperty(e.prototype,"isEmpty",{get:function(){return 0===this._size},enumerable:!0,configurable:!0}),e.prototype.clear=function(){this._root=p,this._size=0},e.prototype.forEach=function(e,t){var r=this;return void 0!==t&&(e=e.bind(t)),this.forEachPair(function(t,i){return e(i,t,r)})},e.prototype.forEachPair=function(e,t){var r=this.minKey(),i=this.maxKey();return this.forRange(r,i,!0,e,t)},e.prototype.get=function(e,t){return this._root.get(e,t,this)},e.prototype.set=function(e,t,r){this._root.isShared&&(this._root=this._root.clone());var i=this._root.set(e,t,r,this);return!0===i||!1===i?i:(this._root=new h([this._root,i]),!0)},e.prototype.has=function(e){return 0!==this.forRange(e,e,!0,void 0)},e.prototype.delete=function(e){return 0!==this.editRange(e,e,!0,f)},e.prototype.with=function(e,t,r){var i=this.clone();return i.set(e,t,r)||r?i:this},e.prototype.withPairs=function(e,t){var r=this.clone();return 0!==r.setPairs(e,t)||t?r:this},e.prototype.withKeys=function(e,t){for(var r=this.clone(),i=!1,n=0;n<e.length;n++)i=r.set(e[n],void 0,!1)||i;return t&&!i?this:r},e.prototype.without=function(e,t){return this.withoutRange(e,e,!0,t)},e.prototype.withoutKeys=function(e,t){var r=this.clone();return r.deleteKeys(e)||!t?r:this},e.prototype.withoutRange=function(e,t,r,i){var n=this.clone();return 0===n.deleteRange(e,t,r)&&i?this:n},e.prototype.filter=function(e,t){var r,i=this.greedyClone();return i.editAll(function(t,i,n){if(!e(t,i,n))return r=u}),!r&&t?this:i},e.prototype.mapValues=function(e){var t={},r=this.greedyClone();return r.editAll(function(r,i,n){return t.value=e(i,r,n),t}),r},e.prototype.reduce=function(e,t){for(var r,i=0,n=t,o=this.entries(this.minKey(),y);!(r=o.next()).done;)n=e(n,r.value,i++,this);return n},e.prototype.entries=function(e,t){var r=this.findPath(e);if(void 0===r)return i();var n=r.nodequeue,o=r.nodeindex,s=r.leaf,h=void 0!==t?1:0,a=void 0===e?-1:s.indexOf(e,0,this._compare)-1;return i(function(){e:for(;;)switch(h){case 0:if(++a<s.keys.length)return{done:!1,value:[s.keys[a],s.values[a]]};h=2;continue;case 1:if(++a<s.keys.length)return t[0]=s.keys[a],t[1]=s.values[a],{done:!1,value:t};h=2;case 2:for(var e=-1;;){if(++e>=n.length){h=3;continue e}if(++o[e]<n[e].length)break}for(;e>0;e--)n[e-1]=n[e][o[e]].children,o[e-1]=0;s=n[0][o[0]],a=-1,h=void 0!==t?1:0;continue;case 3:return{done:!0,value:void 0}}})},e.prototype.entriesReversed=function(e,t,r){if(void 0===(e=e||this.maxKey()))return i();var o=this.findPath(e)||this.findPath(this.maxKey()),s=o.nodequeue,h=o.nodeindex,a=o.leaf;n(!s[0]||a===s[0][h[0]],"wat!");var u=a.indexOf(e,0,this._compare);r||this._compare(a.keys[u],e)>0||u++;var f=void 0!==t?1:0;return i(function(){e:for(;;)switch(f){case 0:if(--u>=0)return{done:!1,value:[a.keys[u],a.values[u]]};f=2;continue;case 1:if(--u>=0)return t[0]=a.keys[u],t[1]=a.values[u],{done:!1,value:t};f=2;case 2:for(var e=-1;;){if(++e>=s.length){f=3;continue e}if(--h[e]>=0)break}for(;e>0;e--)s[e-1]=s[e][h[e]].children,h[e-1]=s[e-1].length-1;a=s[0][h[0]],u=a.keys.length,f=void 0!==t?1:0;continue;case 3:return{done:!0,value:void 0}}})},e.prototype.findPath=function(e){var t,r,i=this._root;if(i.isLeaf)t=c,r=c;else{t=[],r=[];for(var n=0;!i.isLeaf;n++){if(t[n]=i.children,r[n]=void 0===e?0:i.indexOf(e,0,this._compare),r[n]>=t[n].length)return;i=t[n][r[n]]}t.reverse(),r.reverse()}return{nodequeue:t,nodeindex:r,leaf:i}},e.prototype.keys=function(e){var t=this.entries(e,y);return i(function(){var e=t.next();return e.value&&(e.value=e.value[0]),e})},e.prototype.values=function(e){var t=this.entries(e,y);return i(function(){var e=t.next();return e.value&&(e.value=e.value[1]),e})},Object.defineProperty(e.prototype,"maxNodeSize",{get:function(){return this._maxNodeSize},enumerable:!0,configurable:!0}),e.prototype.minKey=function(){return this._root.minKey()},e.prototype.maxKey=function(){return this._root.maxKey()},e.prototype.clone=function(){this._root.isShared=!0;var t=new e(void 0,this._compare,this._maxNodeSize);return t._root=this._root,t._size=this._size,t},e.prototype.greedyClone=function(t){var r=new e(void 0,this._compare,this._maxNodeSize);return r._root=this._root.greedyClone(t),r._size=this._size,r},e.prototype.toArray=function(e){void 0===e&&(e=2147483647);var t=this.minKey(),r=this.maxKey();return void 0!==t?this.getRange(t,r,!0,e):[]},e.prototype.keysArray=function(){var e=[];return this._root.forRange(this.minKey(),this.maxKey(),!0,!1,this,0,function(t,r){e.push(t)}),e},e.prototype.valuesArray=function(){var e=[];return this._root.forRange(this.minKey(),this.maxKey(),!0,!1,this,0,function(t,r){e.push(r)}),e},e.prototype.toString=function(){return this.toArray().toString()},e.prototype.setIfNotPresent=function(e,t){return this.set(e,t,!1)},e.prototype.nextHigherPair=function(e){var t=this.entries(e,y),r=t.next();return!r.done&&this._compare(r.value[0],e)<=0&&(r=t.next()),r.value},e.prototype.nextHigherKey=function(e){var t=this.nextHigherPair(e);return t?t[0]:t},e.prototype.nextLowerPair=function(e){return this.entriesReversed(e,y,!0).next().value},e.prototype.nextLowerKey=function(e){var t=this.nextLowerPair(e);return t?t[0]:t},e.prototype.changeIfPresent=function(e,t){return 0!==this.editRange(e,e,!0,function(e,r){return{value:t}})},e.prototype.getRange=function(e,t,r,i){void 0===i&&(i=67108863);var n=[];return this._root.forRange(e,t,r,!1,this,0,function(e,t){return n.push([e,t]),n.length>i?l:void 0}),n},e.prototype.setPairs=function(e,t){for(var r=0,i=0;i<e.length;i++)this.set(e[i][0],e[i][1],t)&&r++;return r},e.prototype.forRange=function(e,t,r,i,n){var o=this._root.forRange(e,t,r,!1,this,n||0,i);return"number"==typeof o?o:o.break},e.prototype.editRange=function(e,t,r,i,n){var o=this._root;o.isShared&&(this._root=o=o.clone());try{var s=o.forRange(e,t,r,!0,this,n||0,i);return"number"==typeof s?s:s.break}finally{for(;o.keys.length<=1&&!o.isLeaf;)this._root=o=0===o.keys.length?p:o.children[0]}},e.prototype.editAll=function(e,t){return this.editRange(this.minKey(),this.maxKey(),!0,e,t)},e.prototype.deleteRange=function(e,t,r){return this.editRange(e,t,r,f)},e.prototype.deleteKeys=function(e){for(var t=0,r=0;t<e.length;t++)this.delete(e[t])&&r++;return r},Object.defineProperty(e.prototype,"height",{get:function(){for(var e=this._root,t=-1;null!=e;t++)e=e.children;return t},enumerable:!0,configurable:!0}),e.prototype.freeze=function(){var e=this;e.clear=e.set=e.editRange=function(){throw new Error("Attempted to modify a frozen BTree")}},e.prototype.unfreeze=function(){delete this.clear,delete this.set,delete this.editRange},e.prototype.checkValid=function(){var e=this._root.checkValid(0,this);n(e===this.size,"size mismatch: counted ",e,"but stored",this.size)},e}();t.default=o,Symbol&&Symbol.iterator&&(o.prototype[Symbol.iterator]=o.prototype.entries),o.prototype.where=o.prototype.filter,o.prototype.setRange=o.prototype.setPairs;var s=function(){function e(e,t){void 0===e&&(e=[]),this.keys=e,this.values=t||a,this.isShared=void 0}return Object.defineProperty(e.prototype,"isLeaf",{get:function(){return void 0===this.children},enumerable:!0,configurable:!0}),e.prototype.maxKey=function(){return this.keys[this.keys.length-1]},e.prototype.indexOf=function(e,t,r){for(var i=this.keys,n=0,o=i.length,s=o>>1;n<o;){var h=r(i[s],e);if(h<0)n=s+1;else{if(!(h>0)){if(0===h)return s;if(e===e)return i.length;throw new Error("BTree: NaN was used as a key")}o=s}s=n+o>>1}return s^t},e.prototype.minKey=function(){return this.keys[0]},e.prototype.clone=function(){var t=this.values;return new e(this.keys.slice(0),t===a?t:t.slice(0))},e.prototype.greedyClone=function(e){return this.isShared&&!e?this:this.clone()},e.prototype.get=function(e,t,r){var i=this.indexOf(e,-1,r._compare);return i<0?t:this.values[i]},e.prototype.checkValid=function(e,t){var r=this.keys.length,i=this.values.length;return n(this.values===a?r<=i:r===i,"keys/values length mismatch: depth",e,"with lengths",r,i),n(0==e||r>0,"empty leaf at depth",e),r},e.prototype.set=function(e,t,r,i){var n=this.indexOf(e,-1,i._compare);if(n<0){if(n=~n,i._size++,this.keys.length<i._maxNodeSize)return this.insertInLeaf(n,e,t,i);var o=this.splitOffRightSide(),s=this;return n>this.keys.length&&(n-=this.keys.length,s=o),s.insertInLeaf(n,e,t,i),o}return!1!==r&&(void 0!==t&&this.reifyValues(),this.keys[n]=e,this.values[n]=t),!1},e.prototype.reifyValues=function(){return this.values===a?this.values=this.values.slice(0,this.keys.length):this.values},e.prototype.insertInLeaf=function(e,t,r,i){if(this.keys.splice(e,0,t),this.values===a){for(;a.length<i._maxNodeSize;)a.push(void 0);if(void 0===r)return!0;this.values=a.slice(0,this.keys.length-1)}return this.values.splice(e,0,r),!0},e.prototype.takeFromRight=function(e){var t=this.values;e.values===a?t!==a&&t.push(void 0):(t=this.reifyValues(),t.push(e.values.shift())),this.keys.push(e.keys.shift())},e.prototype.takeFromLeft=function(e){var t=this.values;e.values===a?t!==a&&t.unshift(void 0):(t=this.reifyValues(),t.unshift(e.values.pop())),this.keys.unshift(e.keys.pop())},e.prototype.splitOffRightSide=function(){var t=this.keys.length>>1;return new e(this.keys.splice(t),this.values===a?a:this.values.splice(t))},e.prototype.forRange=function(e,t,r,i,n,o,s){var h,u,f=n._compare;if(t===e){if(!r)return o;if(u=(h=this.indexOf(e,-1,f))+1,h<0)return o}else h=this.indexOf(e,0,f),u=this.indexOf(t,-1,f),u<0?u=~u:!0===r&&u++;var l=this.keys,p=this.values;if(void 0!==s)for(var c=h;c<u;c++){var y=l[c],d=s(y,p[c],o++);if(void 0!==d){if(!0===i){if(y!==l[c]||!0===this.isShared)throw new Error("BTree illegally changed or cloned in editRange");d.delete?(this.keys.splice(c,1),this.values!==a&&this.values.splice(c,1),n._size--,c--,u--):d.hasOwnProperty("value")&&(p[c]=d.value)}if(void 0!==d.break)return d}}else o+=u-h;return o},e.prototype.mergeSibling=function(e,t){if(this.keys.push.apply(this.keys,e.keys),this.values===a){if(e.values===a)return;this.values=this.values.slice(0,this.keys.length)}this.values.push.apply(this.values,e.reifyValues())},e}(),h=function(e){function t(t,r){var i=this;if(!r){r=[];for(var n=0;n<t.length;n++)r[n]=t[n].maxKey()}return i=e.call(this,r)||this,i.children=t,i}return __extends(t,e),t.prototype.clone=function(){for(var e=this.children.slice(0),r=0;r<e.length;r++)e[r].isShared=!0;return new t(e,this.keys.slice(0))},t.prototype.greedyClone=function(e){if(this.isShared&&!e)return this;for(var r=new t(this.children.slice(0),this.keys.slice(0)),i=0;i<r.children.length;i++)r.children[i]=r.children[i].greedyClone();return r},t.prototype.minKey=function(){return this.children[0].minKey()},t.prototype.get=function(e,t,r){var i=this.indexOf(e,0,r._compare),n=this.children;return i<n.length?n[i].get(e,t,r):void 0},t.prototype.checkValid=function(e,t){var r=this.keys.length,i=this.children.length;n(r===i,"keys/children length mismatch: depth",e,"lengths",r,i),n(r>1,"internal node has length",r,"at depth",e);for(var o=0,s=this.children,h=this.keys,a=0,u=0;u<i;u++)o+=s[u].checkValid(e+1,t),a+=s[u].keys.length,n(o>=a,"wtf"),n(0===u||s[u-1].constructor===s[u].constructor,"type mismatch"),s[u].maxKey()!=h[u]&&n(!1,"keys[",u,"] =",h[u],"is wrong, should be ",s[u].maxKey(),"at depth",e),0===u||t._compare(h[u-1],h[u])<0||n(!1,"sort violation at depth",e,"index",u,"keys",h[u-1],h[u]);var f=a<(t.maxNodeSize>>1)*i;return(f||a>t.maxNodeSize*i)&&n(!1,f?"too few":"too many","children (",a,o,") at depth",e,", maxNodeSize:",t.maxNodeSize,"children.length:",i),o},t.prototype.set=function(e,t,r,i){var n=this.children,o=i._maxNodeSize,s=i._compare,h=Math.min(this.indexOf(e,0,s),n.length-1),a=n[h];if(a.isShared&&(n[h]=a=a.clone()),a.keys.length>=o){var u;h>0&&(u=n[h-1]).keys.length<o&&s(a.keys[0],e)<0?(u.isShared&&(n[h-1]=u=u.clone()),u.takeFromRight(a),this.keys[h-1]=u.maxKey()):void 0!==(u=n[h+1])&&u.keys.length<o&&s(a.maxKey(),e)<0&&(u.isShared&&(n[h+1]=u=u.clone()),u.takeFromLeft(a),this.keys[h]=n[h].maxKey())}var f=a.set(e,t,r,i);if(!1===f)return!1;if(this.keys[h]=a.maxKey(),!0===f)return!0;if(this.keys.length<o)return this.insert(h+1,f),!0;var l=this.splitOffRightSide(),p=this;return s(f.maxKey(),this.maxKey())>0&&(p=l,h-=this.keys.length),p.insert(h+1,f),l},t.prototype.insert=function(e,t){this.children.splice(e,0,t),this.keys.splice(e,0,t.maxKey())},t.prototype.splitOffRightSide=function(){var e=this.children.length>>1;return new t(this.children.splice(e),this.keys.splice(e))},t.prototype.takeFromRight=function(e){this.keys.push(e.keys.shift()),this.children.push(e.children.shift())},t.prototype.takeFromLeft=function(e){this.keys.unshift(e.keys.pop()),this.children.unshift(e.children.pop())},t.prototype.forRange=function(e,t,r,i,o,s,h){var a=o._compare,u=this.indexOf(e,0,a),f=u,l=Math.min(t===e?u:this.indexOf(t,0,a),this.keys.length-1),p=this.keys,c=this.children;if(i){if(f<=l)try{for(;f<=l;f++){c[f].isShared&&(c[f]=c[f].clone());var y=c[f].forRange(e,t,r,i,o,s,h);if(p[f]=c[f].maxKey(),"number"!=typeof y)return y;s=y}}finally{var d=o._maxNodeSize>>1;for(u>0&&u--,f=l;f>=u;f--)c[f].keys.length<=d&&this.tryMerge(f,o._maxNodeSize);0===c[0].keys.length&&(n(1===c.length&&1===p.length,"emptiness bug"),c.shift(),p.shift())}}else for(;f<=l;f++){var y=c[f].forRange(e,t,r,i,o,s,h);if("number"!=typeof y)return y;s=y}return s},t.prototype.tryMerge=function(e,t){var r=this.children;return e>=0&&e+1<r.length&&r[e].keys.length+r[e+1].keys.length<=t&&(r[e].isShared&&(r[e]=r[e].clone()),r[e].mergeSibling(r[e+1],t),r.splice(e+1,1),this.keys.splice(e+1,1),this.keys[e]=r[e].maxKey(),!0)},t.prototype.mergeSibling=function(e,t){var r=this.keys.length;this.keys.push.apply(this.keys,e.keys),this.children.push.apply(this.children,e.children),this.tryMerge(r-1,t)},t}(s),a=[],u={delete:!0},f=function(){return u},l={break:!0},p=function(){var e=new s;return e.isShared=!0,e}(),c=[],y=[];t.EmptyBTree=function(){var e=new o;return e.freeze(),e}()});

package.json

 {
   "name": "sorted-btree",
-  "version": "1.1.0",
+  "version": "1.1.1",
   "description": "A sorted list of key-value pairs in a fast, typed in-memory B+ tree with a powerful API.",
@@ -5,0 +5,0 @@ "main": "b+tree.js",

readme.md

@@ -37,3 +37,3 @@ B+ tree
 - Throws an exception if you try to use `NaN` as a key, but infinity is allowed.
-- No dependencies. 15.3K minified.
+- No dependencies. 15K minified.
 
@@ -152,151 +152,155 @@ ### Additional operations supported on this B+ tree ###
 
-    0.8     Insert 1000 pairs in sorted-btree's BTree
-    0.4     Insert 1000 pairs in sorted-btree's BTree set (no values)
-    2.7     Insert 1000 pairs in collections' SortedMap
-    1.8     Insert 1000 pairs in collections' SortedSet (no values)
-    0.6     Insert 1000 pairs in functional-red-black-tree
-    0.5     Insert 1000 pairs in bintrees' RBTree (no values)
+0.8     Insert 1000 pairs in sorted-btree's BTree
+0.4     Insert 1000 pairs in sorted-btree's BTree set (no values)
+2.5     Insert 1000 pairs in collections' SortedMap
+1.6     Insert 1000 pairs in collections' SortedSet (no values)
+0.7     Insert 1000 pairs in functional-red-black-tree
+0.5     Insert 1000 pairs in bintrees' RBTree (no values)
 
-    8.5     Insert 10000 pairs in sorted-btree's BTree
-    5.4     Insert 10000 pairs in sorted-btree's BTree set (no values)
-    37.7    Insert 10000 pairs in collections' SortedMap
-    25.8    Insert 10000 pairs in collections' SortedSet (no values)
-    10.7    Insert 10000 pairs in functional-red-black-tree
-    6.4     Insert 10000 pairs in bintrees' RBTree (no values)
+8.6     Insert 10000 pairs in sorted-btree's BTree
+5.1     Insert 10000 pairs in sorted-btree's BTree set (no values)
+37.8    Insert 10000 pairs in collections' SortedMap
+25.8    Insert 10000 pairs in collections' SortedSet (no values)
+8.7     Insert 10000 pairs in functional-red-black-tree
+5.4     Insert 10000 pairs in bintrees' RBTree (no values)
 
-    113.2   Insert 100000 pairs in sorted-btree's BTree
-    73.6    Insert 100000 pairs in sorted-btree's BTree set (no values)
-    686     Insert 100000 pairs in collections' SortedMap
-    390.5   Insert 100000 pairs in collections' SortedSet (no values)
-    194.3   Insert 100000 pairs in functional-red-black-tree
-    108     Insert 100000 pairs in bintrees' RBTree (no values)
+95.9    Insert 100000 pairs in sorted-btree's BTree
+69.1    Insert 100000 pairs in sorted-btree's BTree set (no values)
+564     Insert 100000 pairs in collections' SortedMap
+366.5   Insert 100000 pairs in collections' SortedSet (no values)
+192.5   Insert 100000 pairs in functional-red-black-tree
+107.3   Insert 100000 pairs in bintrees' RBTree (no values)
 
-    1506    Insert 1000000 pairs in sorted-btree's BTree
-    1085    Insert 1000000 pairs in sorted-btree's BTree set (no values)
-    10327   Insert 1000000 pairs in collections' SortedMap
-    5975    Insert 1000000 pairs in collections' SortedSet (no values)
-    3703    Insert 1000000 pairs in functional-red-black-tree
-    2013    Insert 1000000 pairs in bintrees' RBTree (no values)
+1363    Insert 1000000 pairs in sorted-btree's BTree
+909     Insert 1000000 pairs in sorted-btree's BTree set (no values)
+8783    Insert 1000000 pairs in collections' SortedMap
+5443    Insert 1000000 pairs in collections' SortedSet (no values)
+3356    Insert 1000000 pairs in functional-red-black-tree
+1581    Insert 1000000 pairs in bintrees' RBTree (no values)
 
 ### Insert in order, delete: sorted-btree vs the competition ###
 
-    0.8     Insert 1000 sorted pairs in B+ tree
-    0.4     Insert 1000 sorted keys in B+ tree (no values)
-    0.7     Insert 1000 sorted pairs in collections' SortedMap
-    0.4     Insert 1000 sorted keys in collections' SortedSet (no values)
-    0.7     Insert 1000 sorted pairs in functional-red-black-tree
-    0.5     Insert 1000 sorted keys in bintrees' RBTree (no values)
-    5       Delete every second item in B+ tree
-    3       Delete every second item in B+ tree set
-    1       Bulk-delete every second item in B+ tree set
-    16      Delete every second item in collections' SortedMap
-    6       Delete every second item in collections' SortedSet
-    9       Delete every second item in functional-red-black-tree
-    15      Delete every second item in bintrees' RBTree
+0.6     Insert 1000 sorted pairs in B+ tree
+0.4     Insert 1000 sorted keys in B+ tree set (no values)
+0.6     Insert 1000 sorted pairs in collections' SortedMap
+0.4     Insert 1000 sorted keys in collections' SortedSet (no values)
+0.7     Insert 1000 sorted pairs in functional-red-black-tree
+0.5     Insert 1000 sorted keys in bintrees' RBTree (no values)
+1       Delete every second item in B+ tree
+3       Delete every second item in B+ tree set
+1       Bulk-delete every second item in B+ tree set
+1       Delete every second item in collections' SortedMap
+1       Delete every second item in collections' SortedSet
+5       Delete every second item in functional-red-black-tree
+10      Delete every second item in bintrees' RBTree
 
-    7.4     Insert 10000 sorted pairs in B+ tree
-    4.4     Insert 10000 sorted keys in B+ tree (no values)
-    7.7     Insert 10000 sorted pairs in collections' SortedMap
-    4.6     Insert 10000 sorted keys in collections' SortedSet (no values)
-    13.6    Insert 10000 sorted pairs in functional-red-black-tree
-    6.6     Insert 10000 sorted keys in bintrees' RBTree (no values)
-    22      Delete every second item in B+ tree
-    7       Delete every second item in B+ tree set
-    4       Bulk-delete every second item in B+ tree set
-    17      Delete every second item in collections' SortedMap
-    5       Delete every second item in collections' SortedSet
-    17      Delete every second item in functional-red-black-tree
-    37      Delete every second item in bintrees' RBTree
+6.5     Insert 10000 sorted pairs in B+ tree
+3.9     Insert 10000 sorted keys in B+ tree set (no values)
+6.5     Insert 10000 sorted pairs in collections' SortedMap
+3.9     Insert 10000 sorted keys in collections' SortedSet (no values)
+12.4    Insert 10000 sorted pairs in functional-red-black-tree
+5.8     Insert 10000 sorted keys in bintrees' RBTree (no values)
+4       Delete every second item in B+ tree
+4       Delete every second item in B+ tree set
+3       Bulk-delete every second item in B+ tree set
+13      Delete every second item in collections' SortedMap
+7       Delete every second item in collections' SortedSet
+8       Delete every second item in functional-red-black-tree
+6       Delete every second item in bintrees' RBTree
 
-    79.3    Insert 100000 sorted pairs in B+ tree
-    51.7    Insert 100000 sorted keys in B+ tree (no values)
-    107.2   Insert 100000 sorted pairs in collections' SortedMap
-    68      Insert 100000 sorted keys in collections' SortedSet (no values)
-    151.3   Insert 100000 sorted pairs in functional-red-black-tree
-    99.8    Insert 100000 sorted keys in bintrees' RBTree (no values)
-    88      Delete every second item in B+ tree
-    40      Delete every second item in B+ tree set
-    25      Bulk-delete every second item in B+ tree set
-    191     Delete every second item in collections' SortedMap
-    47      Delete every second item in collections' SortedSet
-    69      Delete every second item in functional-red-black-tree
-    57      Delete every second item in bintrees' RBTree
+75.9    Insert 100000 sorted pairs in B+ tree
+45      Insert 100000 sorted keys in B+ tree set (no values)
+98.7    Insert 100000 sorted pairs in collections' SortedMap
+61.4    Insert 100000 sorted keys in collections' SortedSet (no values)
+145.8   Insert 100000 sorted pairs in functional-red-black-tree
+82.6    Insert 100000 sorted keys in bintrees' RBTree (no values)
+79      Delete every second item in B+ tree
+52      Delete every second item in B+ tree set
+18      Bulk-delete every second item in B+ tree set
+166     Delete every second item in collections' SortedMap
+58      Delete every second item in collections' SortedSet
+64      Delete every second item in functional-red-black-tree
+74      Delete every second item in bintrees' RBTree
 
-    784     Insert 1000000 sorted pairs in B+ tree
-    520     Insert 1000000 sorted keys in B+ tree (no values)
-    1210    Insert 1000000 sorted pairs in collections' SortedMap
-    714     Insert 1000000 sorted keys in collections' SortedSet (no values)
-    2111    Insert 1000000 sorted pairs in functional-red-black-tree
-    1076    Insert 1000000 sorted keys in bintrees' RBTree (no values)
-    504     Delete every second item in B+ tree
-    346     Delete every second item in B+ tree set
-    194     Bulk-delete every second item in B+ tree set
-    1561    Delete every second item in collections' SortedMap
-    754     Delete every second item in collections' SortedSet
-    673     Delete every second item in functional-red-black-tree
-    613     Delete every second item in bintrees' RBTree
+700     Insert 1000000 sorted pairs in B+ tree
+452.5   Insert 1000000 sorted keys in B+ tree set (no values)
+1069    Insert 1000000 sorted pairs in collections' SortedMap
+864     Insert 1000000 sorted keys in collections' SortedSet (no values)
+1531    Insert 1000000 sorted pairs in functional-red-black-tree
+966     Insert 1000000 sorted keys in bintrees' RBTree (no values)
+435     Delete every second item in B+ tree
+291     Delete every second item in B+ tree set
+159     Bulk-delete every second item in B+ tree set
+1447    Delete every second item in collections' SortedMap
+796     Delete every second item in collections' SortedSet
+573     Delete every second item in functional-red-black-tree
+537     Delete every second item in bintrees' RBTree
 
 ### Insertions at random locations: sorted-btree vs Array vs Map ###
 
-    0.5     Insert 1000 pairs in sorted array
-    0.7     Insert 1000 pairs in B+ tree
-    0.1     Insert 1000 pairs in ES6 Map (hashtable)
+0.5     Insert 1000 pairs in sorted array
+0.6     Insert 1000 pairs in B+ tree
+0.1     Insert 1000 pairs in ES6 Map (hashtable)
 
-    16.1    Insert 10000 pairs in sorted array
-    8.6     Insert 10000 pairs in B+ tree
-    1.7     Insert 10000 pairs in ES6 Map (hashtable)
+13.2    Insert 10000 pairs in sorted array
+7.2     Insert 10000 pairs in B+ tree
+1.3     Insert 10000 pairs in ES6 Map (hashtable)
 
-    57498   Insert 100000 pairs in sorted array
-    127.5   Insert 100000 pairs in B+ tree
-    20.1    Insert 100000 pairs in ES6 Map (hashtable)
+56980   Insert 100000 pairs in sorted array
+122     Insert 100000 pairs in B+ tree
+17.7    Insert 100000 pairs in ES6 Map (hashtable)
 
-    SLOW!   Insert 1000000 pairs in sorted array
-    1552    Insert 1000000 pairs in B+ tree
-    311     Insert 1000000 pairs in ES6 Map (hashtable)
+SLOW!   Insert 1000000 pairs in sorted array
+1354    Insert 1000000 pairs in B+ tree
+304.5   Insert 1000000 pairs in ES6 Map (hashtable)
 
 ### Insert in order, scan, delete: sorted-btree vs Array vs Map ###
 
-    0.4     Insert 1000 sorted pairs in array
-    0.7     Insert 1000 sorted pairs in B+ tree
-    0.1     Insert 1000 sorted pairs in Map hashtable
-    0       Sum of all values with forEach in sorted array: 27554680
-    0       Sum of all values with forEachPair in B+ tree: 27554680
-    0.1     Sum of all values with forEach in B+ tree: 27554680
-    0       Sum of all values with forEach in Map: 27554680
-    0.1     Delete every second item in sorted array
-    0.1     Delete every second item in B+ tree
-    0       Delete every second item in Map hashtable
+0.4     Insert 1000 sorted pairs in array
+0.6     Insert 1000 sorted pairs in B+ tree
+0.1     Insert 1000 sorted pairs in Map hashtable
+0       Sum of all values with forEach in sorted array: 27350180
+0       Sum of all values with forEachPair in B+ tree: 27350180
+0       Sum of all values with forEach in B+ tree: 27350180
+0       Sum of all values with iterator in B+ tree: 27350180
+0       Sum of all values with forEach in Map: 27350180
+0.1     Delete every second item in sorted array
+0.1     Delete every second item in B+ tree
+0       Delete every second item in Map hashtable
 
-    4.5     Insert 10000 sorted pairs in array
-    7.9     Insert 10000 sorted pairs in B+ tree
-    1.5     Insert 10000 sorted pairs in Map hashtable
-    0.2     Sum of all values with forEach in sorted array: 2753952560
-    0.3     Sum of all values with forEachPair in B+ tree: 2753952560
-    0.5     Sum of all values with forEach in B+ tree: 2753952560
-    0.2     Sum of all values with forEach in Map: 2753952560
-    1.4     Delete every second item in sorted array
-    1       Delete every second item in B+ tree
-    0.3     Delete every second item in Map hashtable
+3.9     Insert 10000 sorted pairs in array
+6.7     Insert 10000 sorted pairs in B+ tree
+1.3     Insert 10000 sorted pairs in Map hashtable
+0.2     Sum of all values with forEach in sorted array: 2716659330
+0.3     Sum of all values with forEachPair in B+ tree: 2716659330
+0.4     Sum of all values with forEach in B+ tree: 2716659330
+0.3     Sum of all values with iterator in B+ tree: 2716659330
+0.2     Sum of all values with forEach in Map: 2716659330
+1.2     Delete every second item in sorted array
+1.1     Delete every second item in B+ tree
+0.3     Delete every second item in Map hashtable
 
-    75.7    Insert 100000 sorted pairs in array
-    85.7    Insert 100000 sorted pairs in B+ tree
-    21.6    Insert 100000 sorted pairs in Map hashtable
-    2.9     Sum of all values with forEach in sorted array: 275508340940
-    3.5     Sum of all values with forEachPair in B+ tree: 275508340940
-    5.4     Sum of all values with forEach in B+ tree: 275508340940
-    2.5     Sum of all values with forEach in Map: 275508340940
-    2794    Delete every second item in sorted array
-    15      Delete every second item in B+ tree
-    4.3     Delete every second item in Map hashtable
+68.4    Insert 100000 sorted pairs in array
+72.7    Insert 100000 sorted pairs in B+ tree
+18.4    Insert 100000 sorted pairs in Map hashtable
+2.5     Sum of all values with forEach in sorted array: 275653049020
+3.3     Sum of all values with forEachPair in B+ tree: 275653049020
+4.5     Sum of all values with forEach in B+ tree: 275653049020
+2.8     Sum of all values with iterator in B+ tree: 275653049020
+2.2     Sum of all values with forEach in Map: 275653049020
+2420    Delete every second item in sorted array
+14.4    Delete every second item in B+ tree
+3.7     Delete every second item in Map hashtable
 
-    1042    Insert 1000000 sorted pairs in array
-    879     Insert 1000000 sorted pairs in B+ tree
-    363     Insert 1000000 sorted pairs in Map hashtable
-    27.7    Sum of all values with forEach in sorted array: 27486298443010
-    36.6    Sum of all values with forEachPair in B+ tree: 27486298443010
-    52.2    Sum of all values with forEach in B+ tree: 27486298443010
-    24.4    Sum of all values with forEach in Map: 27486298443010
-    SLOW!   Delete every second item in sorted array
-    516     Delete every second item in B+ tree
-    101.4   Delete every second item in Map hashtable
+969     Insert 1000000 sorted pairs in array
+773     Insert 1000000 sorted pairs in B+ tree
+305.5   Insert 1000000 sorted pairs in Map hashtable
+25.3    Sum of all values with forEach in sorted array: 27510295368690
+32.4    Sum of all values with forEachPair in B+ tree: 27510295368690
+46.1    Sum of all values with forEach in B+ tree: 27510295368690
+29.9    Sum of all values with iterator in B+ tree: 27510295368690
+22      Sum of all values with forEach in Map: 27510295368690
+SLOW!   Delete every second item in sorted array
+305.5   Delete every second item in B+ tree
+95.6    Delete every second item in Map hashtable
 
@@ -303,0 +307,0 @@ Version history

No alert changes

Improved metrics

Number of lines in readme file

333

increased by1.22%

Worsened metrics

Total package byte prevSize

131729

decreased by-1.1%

Lines of code

1794

decreased by-1.21%

No dependency changes