From 7d20e79c0b39b83304a0ea8b6c276fcf61f1524d Mon Sep 17 00:00:00 2001
From: Momtchil Momtchev <momtchil@momtchev.com>
Date: Thu, 14 Jan 2021 12:27:53 +0100
Subject: [PATCH] 1.5.2

---
 doc/global.html                  |     2 +-
 doc/index.html                   |     2 +-
 doc/module-igc-xc-score.html     |     2 +-
 doc/scoring-rules.config.js.html |     2 +-
 doc/solver.js.html               |     2 +-
 igc-xc-score.js                  |     2 +-
 index.cjs.js                     |     2 +-
 index.es.js                      | 12646 ++++++++++++++---------------
 package-lock.json                |     2 +-
 package.json                     |     2 +-
 10 files changed, 6147 insertions(+), 6517 deletions(-)

diff --git a/doc/global.html b/doc/global.html
index 40369a3..4e94b3f 100644
--- a/doc/global.html
+++ b/doc/global.html
@@ -267,7 +267,7 @@ <h2><a href="index.html">Home</a></h2><h3>Modules</h3><ul><li><a href="module-ig
 <br class="clear">
 
 <footer>
-    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Mon Sep 28 2020 18:31:04 GMT+0200 (Central European Summer Time)
+    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Thu Jan 14 2021 12:27:53 GMT+0100 (Central European Standard Time)
 </footer>
 
 <script> prettyPrint(); </script>
diff --git a/doc/index.html b/doc/index.html
index 285a300..b858573 100644
--- a/doc/index.html
+++ b/doc/index.html
@@ -56,7 +56,7 @@ <h2><a href="index.html">Home</a></h2><h3>Modules</h3><ul><li><a href="module-ig
 <br class="clear">
 
 <footer>
-    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Mon Sep 28 2020 18:31:04 GMT+0200 (Central European Summer Time)
+    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Thu Jan 14 2021 12:27:53 GMT+0100 (Central European Standard Time)
 </footer>
 
 <script> prettyPrint(); </script>
diff --git a/doc/module-igc-xc-score.html b/doc/module-igc-xc-score.html
index 3bac995..07e0d9f 100644
--- a/doc/module-igc-xc-score.html
+++ b/doc/module-igc-xc-score.html
@@ -574,7 +574,7 @@ <h2><a href="index.html">Home</a></h2><h3>Modules</h3><ul><li><a href="module-ig
 <br class="clear">
 
 <footer>
-    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Mon Sep 28 2020 18:31:04 GMT+0200 (Central European Summer Time)
+    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Thu Jan 14 2021 12:27:53 GMT+0100 (Central European Standard Time)
 </footer>
 
 <script> prettyPrint(); </script>
diff --git a/doc/scoring-rules.config.js.html b/doc/scoring-rules.config.js.html
index 5e611b7..8de6497 100644
--- a/doc/scoring-rules.config.js.html
+++ b/doc/scoring-rules.config.js.html
@@ -171,7 +171,7 @@ <h2><a href="index.html">Home</a></h2><h3>Modules</h3><ul><li><a href="module-ig
 <br class="clear">
 
 <footer>
-    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Mon Sep 28 2020 18:31:04 GMT+0200 (Central European Summer Time)
+    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Thu Jan 14 2021 12:27:53 GMT+0100 (Central European Standard Time)
 </footer>
 
 <script> prettyPrint(); </script>
diff --git a/doc/solver.js.html b/doc/solver.js.html
index fffa93f..38fe5d3 100644
--- a/doc/solver.js.html
+++ b/doc/solver.js.html
@@ -171,7 +171,7 @@ <h2><a href="index.html">Home</a></h2><h3>Modules</h3><ul><li><a href="module-ig
 <br class="clear">
 
 <footer>
-    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Mon Sep 28 2020 18:31:04 GMT+0200 (Central European Summer Time)
+    Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.4</a> on Thu Jan 14 2021 12:27:53 GMT+0100 (Central European Standard Time)
 </footer>
 
 <script> prettyPrint(); </script>
diff --git a/igc-xc-score.js b/igc-xc-score.js
index 934f0eb..b60c06a 100755
--- a/igc-xc-score.js
+++ b/igc-xc-score.js
@@ -1,2 +1,2 @@
 #!/usr/bin/env node
-"use strict";var e,fs=(e=require("fs"))&&"object"==typeof e&&"default"in e?e.default:e,commonjsGlobal="undefined"!=typeof globalThis?globalThis:"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:{};function createCommonjsModule(fn,module){return fn(module={exports:{}},module.exports),module.exports}function getCjsExportFromNamespace(n){return n&&n.default||n}var MANUFACTURERS=getCjsExportFromNamespace(Object.freeze({__proto__:null,default:[{name:"Aircotec",long:"ACT",short:"I"},{name:"Cambridge Aero Instruments",long:"CAM",short:"C"},{name:"ClearNav Instruments",long:"CNI",short:null},{name:"Data Swan/DSX",long:"DSX",short:"D"},{name:"EW Avionics",long:"EWA",short:"E"},{name:"Filser",long:"FIL",short:"F"},{name:"Flarm",long:"FLA",short:"G"},{name:"Flytech",long:"FLY",short:null},{name:"Garrecht",long:"GCS",short:"A"},{name:"IMI Gliding Equipment",long:"IMI",short:"M"},{name:"Logstream",long:"LGS",short:null},{name:"LX Navigation",long:"LXN",short:"L"},{name:"LXNAV",long:"LXV",short:"V"},{name:"Naviter",long:"NAV",short:null},{name:"New Technologies",long:"NTE",short:"N"},{name:"Nielsen Kellerman",long:"NKL",short:"K"},{name:"Peschges",long:"PES",short:"P"},{name:"PressFinish Electronics",long:"PFE",short:null},{name:"Print Technik",long:"PRT",short:"R"},{name:"Scheffel",long:"SCH",short:"H"},{name:"Streamline Data Instruments",long:"SDI",short:"S"},{name:"Triadis Engineering GmbH",long:"TRI",short:"T"},{name:"Zander",long:"ZAN",short:"Z"},{name:"XCSoar",long:"XCS",short:null},{name:"LK8000",long:"XLK",short:null},{name:"GpsDump",long:"XGD",short:null},{name:"SeeYou Recorder",long:"XCM",short:null}]})),lookup=function(id){let short=1===id.length;id=id.toUpperCase();let manufacturers=MANUFACTURERS.filter(it=>it[short?"short":"long"]===id);return 0!==manufacturers.length?manufacturers[0].name:id},RE_A=/^A(\w{3})(\w{3,}?)(?:FLIGHT:(\d+)|\:(.+))?$/,RE_HFDTE=/^HFDTE(?:DATE:)?(\d{2})(\d{2})(\d{2})(?:,?(\d{2}))?/,RE_PLT_HEADER=/^H[FO]PLT(?:.{0,}?:(.*)|(.*))$/,RE_CM2_HEADER=/^H[FOP]CM2(?:.{0,}?:(.*)|(.*))$/,RE_GTY_HEADER=/^H[FO]GTY(?:.{0,}?:(.*)|(.*))$/,RE_GID_HEADER=/^H[FO]GID(?:.{0,}?:(.*)|(.*))$/,RE_CID_HEADER=/^H[FO]CID(?:.{0,}?:(.*)|(.*))$/,RE_CCL_HEADER=/^H[FO]CCL(?:.{0,}?:(.*)|(.*))$/,RE_FTY_HEADER=/^H[FO]FTY(?:.{0,}?:(.*)|(.*))$/,RE_RFW_HEADER=/^H[FO]RFW(?:.{0,}?:(.*)|(.*))$/,RE_RHW_HEADER=/^H[FO]RHW(?:.{0,}?:(.*)|(.*))$/,RE_B=/^B(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])([AV])(-\d{4}|\d{5})(-\d{4}|\d{5})/,RE_K=/^K(\d{2})(\d{2})(\d{2})/,RE_IJ=/^[IJ](\d{2})(?:\d{2}\d{2}[A-Z]{3})+/,RE_TASK=/^C(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{4})([-\d]{2})(.*)/,RE_TASKPOINT=/^C(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])(.*)/,igcParser=function(){function IGCParser(){this._result={numFlight:null,pilot:null,copilot:null,gliderType:null,registration:null,callsign:null,competitionClass:null,loggerType:null,firmwareVersion:null,hardwareVersion:null,task:null,fixes:[],dataRecords:[],security:null,errors:[]},this.fixExtensions=[],this.dataExtensions=[],this.lineNumber=0,this.prevTimestamp=null}return IGCParser.parse=function(str,options){void 0===options&&(options={});for(var parser=new IGCParser,errors=[],_i=0,_a=str.split("\n");_i<_a.length;_i++){var line=_a[_i];try{parser.processLine(line.trim())}catch(error){if(!options.lenient)throw error;errors.push(error)}}var result=parser.result;return result.errors=errors,result},Object.defineProperty(IGCParser.prototype,"result",{get:function(){if(!this._result.loggerManufacturer)throw new Error("Missing A record");if(!this._result.date)throw new Error("Missing HFDTE record");return this._result},enumerable:!0,configurable:!0}),IGCParser.prototype.processLine=function(line){this.lineNumber+=1;var recordType=line[0];if("B"===recordType){var fix=this.parseBRecord(line);this.prevTimestamp=fix.timestamp,this._result.fixes.push(fix)}else if("K"===recordType){var data=this.parseKRecord(line);this.prevTimestamp=data.timestamp,this._result.dataRecords.push(data)}else if("H"===recordType)this.processHeader(line);else if("C"===recordType)this.processTaskLine(line);else if("A"===recordType){var record=this.parseARecord(line);this._result.loggerId=record.loggerId,this._result.loggerManufacturer=record.manufacturer,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"I"===recordType?this.fixExtensions=this.parseIJRecord(line):"J"===recordType?this.dataExtensions=this.parseIJRecord(line):"G"===recordType&&(this._result.security=(this._result.security||"")+line.slice(1))},IGCParser.prototype.processHeader=function(line){var headerType=line.slice(2,5);if("DTE"===headerType){var record=this.parseDateHeader(line);this._result.date=record.date,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"PLT"===headerType?this._result.pilot=this.parsePilot(line):"CM2"===headerType?this._result.copilot=this.parseCopilot(line):"GTY"===headerType?this._result.gliderType=this.parseGliderType(line):"GID"===headerType?this._result.registration=this.parseRegistration(line):"CID"===headerType?this._result.callsign=this.parseCallsign(line):"CCL"===headerType?this._result.competitionClass=this.parseCompetitionClass(line):"FTY"===headerType?this._result.loggerType=this.parseLoggerType(line):"RFW"===headerType?this._result.firmwareVersion=this.parseFirmwareVersion(line):"RHW"===headerType&&(this._result.hardwareVersion=this.parseHardwareVersion(line))},IGCParser.prototype.parseARecord=function(line){var match=line.match(RE_A);if(match)return{manufacturer:lookup(match[1]),loggerId:match[2],numFlight:match[3]?parseInt(match[3],10):null,additionalData:match[4]||null};if(match=line.match(/^A(\w{3})(.+)?$/))return{manufacturer:lookup(match[1]),loggerId:null,numFlight:null,additionalData:match[2]?match[2].trim():null};throw new Error("Invalid A record at line "+this.lineNumber+": "+line)},IGCParser.prototype.parseDateHeader=function(line){var match=line.match(RE_HFDTE);if(!match)throw new Error("Invalid DTE header at line "+this.lineNumber+": "+line);return{date:("8"===match[3][0]||"9"===match[3][0]?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],numFlight:match[4]?parseInt(match[4],10):null}},IGCParser.prototype.parseTextHeader=function(headerType,regex,line,underscoreReplacement){void 0===underscoreReplacement&&(underscoreReplacement=" ");var match=line.match(regex);if(!match)throw new Error("Invalid "+headerType+" header at line "+this.lineNumber+": "+line);return(match[1]||match[2]||"").replace(/_/g,underscoreReplacement).trim()},IGCParser.prototype.parsePilot=function(line){return this.parseTextHeader("PLT",RE_PLT_HEADER,line)},IGCParser.prototype.parseCopilot=function(line){return this.parseTextHeader("CM2",RE_CM2_HEADER,line)},IGCParser.prototype.parseGliderType=function(line){return this.parseTextHeader("GTY",RE_GTY_HEADER,line)},IGCParser.prototype.parseRegistration=function(line){return this.parseTextHeader("GID",RE_GID_HEADER,line,"-")},IGCParser.prototype.parseCallsign=function(line){return this.parseTextHeader("GTY",RE_CID_HEADER,line)},IGCParser.prototype.parseCompetitionClass=function(line){return this.parseTextHeader("GID",RE_CCL_HEADER,line)},IGCParser.prototype.parseLoggerType=function(line){return this.parseTextHeader("FTY",RE_FTY_HEADER,line)},IGCParser.prototype.parseFirmwareVersion=function(line){return this.parseTextHeader("RFW",RE_RFW_HEADER,line)},IGCParser.prototype.parseHardwareVersion=function(line){return this.parseTextHeader("RHW",RE_RHW_HEADER,line)},IGCParser.prototype.processTaskLine=function(line){this._result.task?this._result.task.points.push(this.parseTaskPoint(line)):this._result.task=this.parseTask(line)},IGCParser.prototype.parseTask=function(line){var match=line.match(RE_TASK);if(!match)throw new Error("Invalid task declaration at line "+this.lineNumber+": "+line);var lastCentury="8"===match[3][0]||"9"===match[3][0],declarationDate=(lastCentury?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],declarationTime=match[4]+":"+match[5]+":"+match[6],declarationTimestamp=Date.parse(declarationDate+"T"+declarationTime+"Z"),flightDate=null;return"00"===match[7]&&"00"===match[8]&&"00"===match[9]||(flightDate=((lastCentury="8"===match[9][0]||"9"===match[9][0])?"19":"20")+match[9]+"-"+match[8]+"-"+match[7]),{declarationDate:declarationDate,declarationTime:declarationTime,declarationTimestamp:declarationTimestamp,flightDate:flightDate,taskNumber:"0000"!==match[10]?parseInt(match[10],10):null,numTurnpoints:parseInt(match[11],10),comment:match[12]||null,points:[]}},IGCParser.prototype.parseTaskPoint=function(line){var match=line.match(RE_TASKPOINT);if(!match)throw new Error("Invalid task point declaration at line "+this.lineNumber+": "+line);return{latitude:IGCParser.parseLatitude(match[1],match[2],match[3],match[4]),longitude:IGCParser.parseLongitude(match[5],match[6],match[7],match[8]),name:match[9]||null}},IGCParser.prototype.parseBRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first B record");var match=line.match(RE_B);if(!match)throw new Error("Invalid B record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),latitude=IGCParser.parseLatitude(match[4],match[5],match[6],match[7]),longitude=IGCParser.parseLongitude(match[8],match[9],match[10],match[11]),valid="A"===match[12],pressureAltitude="00000"===match[13]?null:parseInt(match[13],10),gpsAltitude="00000"===match[14]?null:parseInt(match[14],10),extensions={};if(this.fixExtensions)for(var _i=0,_a=this.fixExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}var enl=null;if(extensions.ENL){var enlLength=this.fixExtensions.filter((function(it){return"ENL"===it.code}))[0].length,enlMax=Math.pow(10,enlLength);enl=parseInt(extensions.ENL,10)/enlMax}return{timestamp:timestamp,time:time,latitude:latitude,longitude:longitude,valid:valid,pressureAltitude:pressureAltitude,gpsAltitude:gpsAltitude,extensions:extensions,enl:enl,fixAccuracy:extensions.FXA?parseInt(extensions.FXA,10):null}},IGCParser.prototype.parseKRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first K record");if(!this.dataExtensions)throw new Error("Missing J record before first K record");var match=line.match(RE_K);if(!match)throw new Error("Invalid K record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),extensions={};if(this.dataExtensions)for(var _i=0,_a=this.dataExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}return{timestamp:timestamp,time:time,extensions:extensions}},IGCParser.prototype.parseIJRecord=function(line){var match=line.match(RE_IJ);if(!match)throw new Error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line);var num=parseInt(match[1],10);if(line.length<3+7*num)throw new Error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line);for(var extensions=new Array(num),i=0;i<num;i++){var offset=3+7*i,start=parseInt(line.slice(offset,offset+2),10),length=parseInt(line.slice(offset+2,offset+4),10)-start+1,code=line.slice(offset+4,offset+7);extensions[i]={start:start,length:length,code:code}}return extensions},IGCParser.parseLatitude=function(dd,mm,mmm,ns){var degrees=parseInt(dd,10)+parseFloat(mm+"."+mmm)/60;return"S"===ns?-degrees:degrees},IGCParser.parseLongitude=function(ddd,mm,mmm,ew){var degrees=parseInt(ddd,10)+parseFloat(mm+"."+mmm)/60;return"W"===ew?-degrees:degrees},IGCParser.prototype.calcTimestamp=function(time){for(var timestamp=Date.parse(this._result.date+"T"+time+"Z");this.prevTimestamp&&timestamp<this.prevTimestamp-36e5;)timestamp+=864e5;return timestamp},IGCParser}();Function.noop=function(){},Function.identity=function(value){return value},Function.by=function(by,compare){compare=compare||Object.compare,by=by||Function.identity;var compareBy=function(a,b){return compare(by(a),by(b))};return compareBy.compare=compare,compareBy.by=by,compareBy},Function.get=function(key){return function(object){return Object.get(object,key)}};var genericCollection=GenericCollection;function GenericCollection(){throw new Error("Can't construct. GenericCollection is a mixin.")}var DOMTokenList=commonjsGlobal.DOMTokenList||function(){};GenericCollection.EmptyArray=Object.freeze([]),GenericCollection.prototype.addEach=function(values,mapFn,thisp){if(values&&(values instanceof Array||values instanceof DOMTokenList||values instanceof String))if(mapFn)for(var i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else if(values&&Object(values)===values)if("function"==typeof values.forEach)mapFn?values.map(mapFn,thisp).forEach(this.add,this):values.forEach(this.add,this);else if("function"==typeof values.next){var value;i=0;if(mapFn)for(;value=values.next().value;)this.add(mapFn.call(thisp,value),i++);else for(;value=values.next().value;)this.add(value,i++)}else if("number"==typeof values.length)if(mapFn)for(i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else mapFn?Object.keys(values).forEach((function(key){this.add(mapFn.call(thisp,values[key]),key)}),this):Object.keys(values).forEach((function(key){this.add(values[key],key)}),this);return this},GenericCollection.prototype.deleteEach=function(values,equals){return values.forEach((function(value){this.delete(value,equals)}),this),this},GenericCollection.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)}),void 0)},GenericCollection.prototype.map=function(callback){var thisp=arguments[1],result=[];return this.reduce((function(undefined$1,value,key,object,depth){result.push(callback.call(thisp,value,key,object,depth))}),void 0),result},GenericCollection.prototype.enumerate=function(start){null==start&&(start=0);var result=[];return this.reduce((function(undefined$1,value){result.push([start++,value])}),void 0),result},GenericCollection.prototype.group=function(callback,thisp,equals){equals=equals||Object.equals;var groups=[],keys=[];return this.forEach((function(value,key,object){key=callback.call(thisp,value,key,object);var group,index=keys.indexOf(key,equals);-1===index?(group=[],groups.push([key,group]),keys.push(key)):group=groups[index][1],group.push(value)})),groups},GenericCollection.prototype.toArray=function(){return this.map(Function.identity)},GenericCollection.prototype.toObject=function(){var object={};return this.reduce((function(undefined$1,value,key){object[key]=value}),void 0),object},GenericCollection.from=function(){return this.apply(this,arguments)},GenericCollection.prototype.filter=function(callback){var thisp=arguments[1],result=this.constructClone();return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)&&result.add(value,key)}),void 0),result},GenericCollection.prototype.every=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result&&callback.call(thisp,value,key,object,depth)}),!0)},GenericCollection.prototype.some=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result||callback.call(thisp,value,key,object,depth)}),!1)},GenericCollection.prototype.all=function(){return this.every(Boolean)},GenericCollection.prototype.any=function(){return this.some(Boolean)},GenericCollection.prototype.min=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)<0?value:result}),void 0)},GenericCollection.prototype.max=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)>0?value:result}),void 0)},GenericCollection.prototype.sum=function(zero){return zero=void 0===zero?0:zero,this.reduce((function(a,b){return a+b}),zero)},GenericCollection.prototype.average=function(zero){var sum=void 0===zero?0:zero,count=void 0===zero?0:zero;return this.reduce((function(undefined$1,value){sum+=value,count+=1}),void 0),sum/count},GenericCollection.prototype.concat=function(){for(var result=this.constructClone(this),i=0;i<arguments.length;i++)result.addEach(arguments[i]);return result},GenericCollection.prototype.flatten=function(){var self=this;return this.reduce((function(result,array){return array.forEach((function(value){this.push(value)}),result,self),result}),[])},GenericCollection.prototype.zip=function(){var table=Array.prototype.slice.call(arguments);return table.unshift(this),Array.unzip(table)},GenericCollection.prototype.join=function(delimiter){return this.reduce((function(result,string){return void 0===result?string:result+delimiter+string}),void 0)},GenericCollection.prototype.sorted=function(compare,by,order){return(compare=compare||this.contentCompare||Object.compare).by?(by=compare.by,compare=compare.compare||this.contentCompare||Object.compare):by=by||Function.identity,void 0===order&&(order=1),this.map((function(item){return{by:by(item),value:item}})).sort((function(a,b){return compare(a.by,b.by)*order})).map((function(pair){return pair.value}))},GenericCollection.prototype.reversed=function(){return this.constructClone(this).reverse()},GenericCollection.prototype.clone=function(depth,memo){if(void 0===depth)depth=1/0;else if(0===depth)return this;var clone=this.constructClone();return this.forEach((function(value,key){clone.add(Object.clone(value,depth-1,memo),key)}),this),clone},GenericCollection.prototype.only=function(){if(1===this.length)return this.one()},GenericCollection.prototype.iterator=function(){return this.iterate.apply(this,arguments)},GenericCollection._sizePropertyDescriptor={get:function(){return this.length},enumerable:!1,configurable:!0},Object.defineProperty(GenericCollection.prototype,"size",GenericCollection._sizePropertyDescriptor);var weakMap=createCommonjsModule((function(module){!function(){if("undefined"==typeof ses||!ses.ok||ses.ok()){"undefined"!=typeof ses&&(ses.weakMapPermitHostObjects=weakMapPermitHostObjects);var doubleWeakMapCheckSilentFailure=!1;if("function"==typeof WeakMap){var HostWeakMap=WeakMap;if("undefined"!=typeof navigator&&/Firefox/.test(navigator.userAgent));else{var testMap=new HostWeakMap,testObject=Object.freeze({});if(testMap.set(testObject,1),1===testMap.get(testObject))return void(module.exports=WeakMap);doubleWeakMapCheckSilentFailure=!0}}var gopn=Object.getOwnPropertyNames,defProp=Object.defineProperty,isExtensible=Object.isExtensible,HIDDEN_NAME="weakmap:ident:"+Math.random()+"___";if("undefined"!=typeof crypto&&"function"==typeof crypto.getRandomValues&&"function"==typeof ArrayBuffer&&"function"==typeof Uint8Array){var ab=new ArrayBuffer(25),u8s=new Uint8Array(ab);crypto.getRandomValues(u8s),HIDDEN_NAME="weakmap:rand:"+Array.prototype.map.call(u8s,(function(u8){return(u8%36).toString(36)})).join("")+"___"}if(defProp(Object,"getOwnPropertyNames",{value:function(obj){return gopn(obj).filter(isNotHiddenName)}}),"getPropertyNames"in Object){var originalGetPropertyNames=Object.getPropertyNames;defProp(Object,"getPropertyNames",{value:function(obj){return originalGetPropertyNames(obj).filter(isNotHiddenName)}})}!function(){var oldFreeze=Object.freeze;defProp(Object,"freeze",{value:function(obj){return getHiddenRecord(obj),oldFreeze(obj)}});var oldSeal=Object.seal;defProp(Object,"seal",{value:function(obj){return getHiddenRecord(obj),oldSeal(obj)}});var oldPreventExtensions=Object.preventExtensions;defProp(Object,"preventExtensions",{value:function(obj){return getHiddenRecord(obj),oldPreventExtensions(obj)}})}();var calledAsFunctionWarningDone=!1,nextId=0,OurWeakMap=function(){this instanceof OurWeakMap||calledAsFunctionWarning();var keys=[],values=[],id=nextId++;return Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord?hiddenRecord[id]:opt_default:(index=keys.indexOf(key))>=0?values[index]:opt_default}))},has___:{value:constFunc((function(key){var hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord:keys.indexOf(key)>=0}))},set___:{value:constFunc((function(key,value){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?hiddenRecord[id]=value:(index=keys.indexOf(key))>=0?values[index]=value:(index=keys.length,values[index]=value,keys[index]=key),this}))},delete___:{value:constFunc((function(key){var index,lastIndex,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord&&delete hiddenRecord[id]:!((index=keys.indexOf(key))<0)&&(lastIndex=keys.length-1,keys[index]=void 0,values[index]=values[lastIndex],keys[index]=keys[lastIndex],keys.length=lastIndex,values.length=lastIndex,!0)}))}})};OurWeakMap.prototype=Object.create(Object.prototype,{get:{value:function(key,opt_default){return this.get___(key,opt_default)},writable:!0,configurable:!0},has:{value:function(key){return this.has___(key)},writable:!0,configurable:!0},set:{value:function(key,value){return this.set___(key,value)},writable:!0,configurable:!0},delete:{value:function(key){return this.delete___(key)},writable:!0,configurable:!0}}),"function"==typeof HostWeakMap?function(){function DoubleWeakMap(){this instanceof OurWeakMap||calledAsFunctionWarning();var dset,hmap=new HostWeakMap,omap=void 0,enableSwitching=!1;return dset=doubleWeakMapCheckSilentFailure?function(key,value){return hmap.set(key,value),hmap.has(key)||(omap||(omap=new OurWeakMap),omap.set(key,value)),this}:function(key,value){if(enableSwitching)try{hmap.set(key,value)}catch(e){omap||(omap=new OurWeakMap),omap.set___(key,value)}else hmap.set(key,value);return this},Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){return omap?hmap.has(key)?hmap.get(key):omap.get___(key,opt_default):hmap.get(key,opt_default)}))},has___:{value:constFunc((function(key){return hmap.has(key)||!!omap&&omap.has___(key)}))},set___:{value:constFunc(dset)},delete___:{value:constFunc((function(key){var result=!!hmap.delete(key);return omap&&omap.delete___(key)||result}))},permitHostObjects___:{value:constFunc((function(token){if(token!==weakMapPermitHostObjects)throw new Error("bogus call to permitHostObjects___");enableSwitching=!0}))}})}doubleWeakMapCheckSilentFailure&&"undefined"!=typeof Proxy&&(Proxy=void 0),DoubleWeakMap.prototype=OurWeakMap.prototype,module.exports=DoubleWeakMap,Object.defineProperty(WeakMap.prototype,"constructor",{value:WeakMap,enumerable:!1,configurable:!0,writable:!0})}():("undefined"!=typeof Proxy&&(Proxy=void 0),module.exports=OurWeakMap)}function weakMapPermitHostObjects(map){map.permitHostObjects___&&map.permitHostObjects___(weakMapPermitHostObjects)}function isNotHiddenName(name){return!("weakmap:"==name.substr(0,"weakmap:".length)&&"___"===name.substr(name.length-3))}function getHiddenRecord(key){if(key!==Object(key))throw new TypeError("Not an object: "+key);var hiddenRecord=key[HIDDEN_NAME];if(hiddenRecord&&hiddenRecord.key===key)return hiddenRecord;if(isExtensible(key)){hiddenRecord={key:key};try{return defProp(key,HIDDEN_NAME,{value:hiddenRecord,writable:!1,enumerable:!1,configurable:!1}),hiddenRecord}catch(error){return}}}function constFunc(func){return func.prototype=null,Object.freeze(func)}function calledAsFunctionWarning(){calledAsFunctionWarningDone||"undefined"==typeof console||(calledAsFunctionWarningDone=!0,console.warn("WeakMap should be invoked as new WeakMap(), not WeakMap(). This will be an error in the future."))}}()})),weakMap$1="undefined"!=typeof WeakMap?WeakMap:weakMap,shimObject=Object;Object.empty=Object.freeze(Object.create(null)),Object.isObject=function(object){return Object(object)===object},Object.getValueOf=function(value){return value&&"function"==typeof value.valueOf&&(value=value.valueOf()),value};var hashMap=new weakMap$1;Object.hash=function(object){return object&&"function"==typeof object.hash?""+object.hash():Object(object)===object?(hashMap.has(object)||hashMap.set(object,Math.random().toString(36).slice(2)),hashMap.get(object)):""+object};var owns=Object.prototype.hasOwnProperty;Object.owns=function(object,key){return owns.call(object,key)},Object.has=function(object,key){if("object"!=typeof object)throw new Error("Object.has can't accept non-object: "+typeof object);if(object&&"function"==typeof object.has)return object.has(key);if("string"==typeof key)return key in object&&object[key]!==Object.prototype[key];throw new Error("Key must be a string for Object.has on plain objects")},Object.get=function(object,key,value){if("object"!=typeof object)throw new Error("Object.get can't accept non-object: "+typeof object);return object&&"function"==typeof object.get?object.get(key,value):Object.has(object,key)?object[key]:value},Object.set=function(object,key,value){object&&"function"==typeof object.set?object.set(key,value):object[key]=value},Object.addEach=function(target,source,overrides){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)target[index]=source[index];else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||(target[key]=source[key]);else!0===source.isMap?source.forEach((function(value,key){target[key]=value})):source.forEach((function(pair){target[pair[0]]=pair[1]}));else;return target},Object.defineEach=function(target,source,overrides,configurable,enumerable,writable){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)Object.defineProperty(target,index,{value:source[index],writable:writable,configurable:configurable,enumerable:enumerable});else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||Object.defineProperty(target,key,{value:source[key],writable:writable,configurable:configurable,enumerable:enumerable});else!0===source.isMap?source.forEach((function(value,key){Object.defineProperty(target,key,{value:value,writable:writable,configurable:configurable,enumerable:enumerable})})):source.forEach((function(pair){Object.defineProperty(target,pair[0],{value:pair[1],writable:writable,configurable:configurable,enumerable:enumerable})}));else;return target},Object.forEach=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0;iKey=keys[i];i++)callback.call(thisp,object[iKey],iKey,object)},Object.map=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0,result=[];iKey=keys[i];i++)result.push(callback.call(thisp,object[iKey],iKey,object));return result},Object.values=function(object){return Object.map(object,Function.identity)},Object.concat=function(){for(var object={},i=0;i<arguments.length;i++)Object.addEach(object,arguments[i]);return object},Object.from=Object.concat,Object.is=function(x,y){return x===y?0!==x||1/x==1/y:x!=x&&y!=y},Object.equals=function(a,b,equals,memo){if(equals=equals||Object.equals,(a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return!0;if(Object.isObject(a)){if((memo=memo||new weakMap$1).has(a))return!0;memo.set(a,!0)}if(Object.isObject(a)&&"function"==typeof a.equals)return a.equals(b,equals,memo);if(Object.isObject(b)&&"function"==typeof b.equals)return b.equals(a,equals,memo);if(Object.isObject(a)&&Object.isObject(b)&&Object.getPrototypeOf(a)===Object.prototype&&Object.getPrototypeOf(b)===Object.prototype){for(var name in a)if(!equals(a[name],b[name],equals,memo))return!1;for(var name in b)if(!(name in a)||!equals(b[name],a[name],equals,memo))return!1;return!0}return a!=a&&b!=b||(!a||!b)&&a===b},Object.compare=function(a,b){if((a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return 0;var aType=typeof a,bType=typeof b;return"number"===aType&&"number"===bType?a-b:"string"===aType&&"string"===bType?a<b?-1/0:1/0:a&&"function"==typeof a.compare?a.compare(b):b&&"function"==typeof b.compare?-b.compare(a):0},Object.clone=function(value,depth,memo){if(value=Object.getValueOf(value),memo=memo||new weakMap$1,void 0===depth)depth=1/0;else if(0===depth)return value;if(Object.isObject(value)){if(!memo.has(value))if(value&&"function"==typeof value.clone)memo.set(value,value.clone(depth,memo));else{var prototype=Object.getPrototypeOf(value);if(null!==prototype&&prototype!==Object.prototype)throw new Error("Can't clone "+value);var clone=Object.create(prototype);for(var key in memo.set(value,clone),value)clone[key]=Object.clone(value[key],depth-1,memo)}return memo.get(value)}return value},Object.clear=function(object){if(object&&"function"==typeof object.clear)object.clear();else for(var keys=Object.keys(object),i=keys.length;i;)delete object[keys[--i]];return object};var genericOrder=GenericOrder;function GenericOrder(){throw new Error("Can't construct. GenericOrder is a mixin.")}GenericOrder.prototype.equals=function(that,equals){return equals=equals||this.contentEquals||shimObject.equals,this===that||!!that&&(this.length===that.length&&this.zip(that).every((function(pair){return equals(pair[0],pair[1])})))},GenericOrder.prototype.compare=function(that,compare){if(compare=compare||this.contentCompare||shimObject.compare,this===that)return 0;if(!that)return 1;var length=Math.min(this.length,that.length),comparison=this.zip(that).reduce((function(comparison,pair,index){return 0===comparison?index>=length?comparison:compare(pair[0],pair[1]):comparison}),0);return 0===comparison?this.length-that.length:comparison},GenericOrder.prototype.toJSON=function(){return this.toArray()};var array_splice=Array.prototype.splice,array_slice=Array.prototype.slice;Array.empty=[],Object.freeze&&Object.freeze(Array.empty),Array.nativeFrom=Array.from;var isSymbolDefined="undefined"!=typeof Symbol;function define(key,value){Object.defineProperty(Array.prototype,key,{value:value,writable:!0,configurable:!0,enumerable:!1})}Array.from=function(values,mapFn,thisArg){if(isSymbolDefined&&values&&"function"==typeof values[Symbol.iterator])return Array.nativeFrom(values,mapFn,thisArg);var array=[];return array.addEach(values),array},Array.unzip=function(table){for(var transpose=[],length=1/0,i=0;i<table.length;i++){var row=table[i];table[i]=row.toArray(),row.length<length&&(length=row.length)}for(i=0;i<table.length;i++){row=table[i];for(var j=0;j<row.length;j++)j<length&&j in row&&(transpose[j]=transpose[j]||[],transpose[j][i]=row[j])}return transpose},define("addEach",genericCollection.prototype.addEach),define("deleteEach",genericCollection.prototype.deleteEach),define("toArray",genericCollection.prototype.toArray),define("toObject",genericCollection.prototype.toObject),define("all",genericCollection.prototype.all),define("any",genericCollection.prototype.any),define("min",genericCollection.prototype.min),define("max",genericCollection.prototype.max),define("sum",genericCollection.prototype.sum),define("average",genericCollection.prototype.average),define("only",genericCollection.prototype.only),define("flatten",genericCollection.prototype.flatten),define("zip",genericCollection.prototype.zip),define("enumerate",genericCollection.prototype.enumerate),define("group",genericCollection.prototype.group),define("sorted",genericCollection.prototype.sorted),define("reversed",genericCollection.prototype.reversed),define("constructClone",(function(values){var clone=new this.constructor;return clone.addEach(values),clone})),define("has",(function(value,equals){return-1!==this.findValue(value,equals)})),define("get",(function(index,defaultValue){if(+index!==index)throw new Error("Indicies must be numbers");return!index in this?defaultValue:this[index]})),define("set",(function(index,value){return this[index]=value,!0})),define("add",(function(value){return this.push(value),!0})),define("delete",(function(value,equals){var index=this.findValue(value,equals);return-1!==index&&(this.spliceOne(index),!0)})),define("deleteAll",(function(value,equals){equals=equals||this.contentEquals||Object.equals;for(var count=0,index=0;index<this.length;)equals(value,this[index])?(this.swap(index,1),count++):index++;return count})),Array.prototype.find||define("find",(function(predicate){if(null==this)throw new TypeError('"this" is null or not defined');var o=Object(this),len=o.length>>>0;if("function"!=typeof predicate)throw new TypeError("predicate must be a function");for(var thisArg=arguments[1],k=0;k<len;){var kValue=o[k];if(predicate.call(thisArg,kValue,k,o))return kValue;k++}}));var deprecatedWarnNonce={};function deprecatedWarn(msg,notOnce){"undefined"!=typeof console&&"function"==typeof console.warn&&!0!==notOnce&&!1===deprecatedWarnNonce.hasOwnProperty(msg)&&(console.warn(msg),deprecatedWarnNonce[msg]++)}var ArrayFindPrototype=Object.getOwnPropertyDescriptor(Array.prototype,"find").value;function ArrayIterator(array,start,end){this.array=array,this.start=null==start?0:start,this.end=end}if(define("find",(function(value,equals,index){return"function"==typeof arguments[0]&&this instanceof Array?ArrayFindPrototype.apply(this,arguments):(deprecatedWarn("Array#find usage is deprecated please use Array#findValue"),this.findValue.apply(this,arguments))})),define("findValue",(function(value,equals,index){if(index)throw new Error("Array#findValue does not support third argument: index");equals=equals||this.contentEquals||Object.equals;for(index=0;index<this.length;index++)if(index in this&&equals(value,this[index]))return index;return-1})),define("findLast",(function(value,equals){return deprecatedWarn("Array#findLast function is deprecated please use Array#findLastValue instead."),this.findLastValue.apply(this,arguments)})),define("findLastValue",(function(value,equals){equals=equals||this.contentEquals||Object.equals;var index=this.length;do{if(--index in this&&equals(this[index],value))return index}while(index>0);return-1})),define("swap",(function(start,length,plus){var args,plusLength,i,j,returnValue;if(start>this.length&&(this.length=start),void 0!==plus){if(args=[start,length],Array.isArray(plus)||(plus=array_slice.call(plus)),i=0,(plusLength=plus.length)<1e3){for(;i<plusLength;i++)args[i+2]=plus[i];return array_splice.apply(this,args)}for(returnValue=array_splice.apply(this,args);i<plusLength;){for(args=[start+i,0],j=2;j<1002&&i<plusLength;j++,i++)args[j]=plus[i];array_splice.apply(this,args)}return returnValue}return void 0!==length?array_splice.call(this,start,length):void 0!==start?array_splice.call(this,start):[]})),define("peek",(function(){return this[0]})),define("poke",(function(value){this.length>0&&(this[0]=value)})),define("peekBack",(function(){if(this.length>0)return this[this.length-1]})),define("pokeBack",(function(value){this.length>0&&(this[this.length-1]=value)})),define("one",(function(){for(var i in this)if(Object.owns(this,i))return this[i]})),Array.prototype.clear||define("clear",(function(){return this.length=0,this})),define("compare",(function(that,compare){var i,length,relative;if(compare=compare||Object.compare,this===that)return 0;if(!that||!Array.isArray(that))return genericOrder.prototype.compare.call(this,that,compare);for(length=this.length<that.length?this.length:that.length,i=0;i<length;i++)if(i in this){if(!(i in that))return-1;if(relative=compare(this[i],that[i]))return relative}else if(i in that)return 1;return this.length-that.length})),define("equals",(function(that,equals){equals=equals||Object.equals;var i=0,length=this.length;if(this===that)return!0;if(!that||!Array.isArray(that))return genericOrder.prototype.equals.call(this,that);if(length!==that.length)return!1;for(;i<length;++i)if(i in this){if(!(i in that))return!1;if(!equals(this[i],that[i]))return!1}else if(i in that)return!1;return!0})),define("clone",(function(depth,memo){if(null==depth)depth=1/0;else if(0===depth)return this;if((memo=memo||new weakMap$1).has(this))return memo.get(this);var clone=new Array(this.length);for(var i in memo.set(this,clone),this)clone[i]=Object.clone(this[i],depth-1,memo);return clone})),define("iterate",(function(start,end){return new ArrayIterator(this,start,end)})),void 0===Array.prototype.spliceOne&&define("spliceOne",(function(index,itemToAdd){var len=this.length;if(len)if(1===arguments.length){for(;index<len;)this[index]=this[index+1],index++;this.length--}else this[index]=itemToAdd})),define("Iterator",ArrayIterator),ArrayIterator.prototype.__iterationObject=null,Object.defineProperty(ArrayIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ArrayIterator.prototype.next=function(){return this.start===(null==this.end?this.array.length:this.end)?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=this.array[this.start++],this._iterationObject},!RegExp.escape){var special=/[-[\]{}()*+?.\\^$|,#\s]/g;RegExp.escape=function(string){return string.replace(special,"\\$&")}}var genericSet=GenericSet;function GenericSet(){throw new Error("Can't construct. GenericSet is a mixin.")}GenericSet.prototype.isSet=!0,GenericSet.prototype.union=function(that){var union=this.constructClone(this);return union.addEach(that),union},GenericSet.prototype.intersection=function(that){return this.constructClone(this.filter((function(value){return that.has(value)})))},GenericSet.prototype.difference=function(that){var union=this.constructClone(this);return union.deleteEach(that),union},GenericSet.prototype.symmetricDifference=function(that){var union=this.union(that),intersection=this.intersection(that);return union.difference(intersection)},GenericSet.prototype.deleteAll=function(value){return+this.delete(value)},GenericSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.length===that.length&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GenericSet.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,value,object,depth)}),void 0)},GenericSet.prototype.toJSON=function(){return this.toArray()},GenericSet.prototype.contains=function(value){return this.has(value)},GenericSet.prototype.remove=function(value){return this.delete(value)},GenericSet.prototype.toggle=function(value){this.has(value)?this.delete(value):this.add(value)};var _valuesArrayFunction=function(value,key){return value};GenericSet.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};GenericSet.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)};var _list=List;function List(values,equals,getDefault){return List._init(List,this,values,equals,getDefault)}function ListIterator(head){this.head=head,this.at=head.next}function Node(value){this.value=value,this.prev=null,this.next=null}List._init=function(constructor,object,values,equals,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,getDefault);var head=object.head=new object.Node;head.next=head,head.prev=head,object.contentEquals=equals||Object.equals,object.getDefault=getDefault||Function.noop,object.length=0,object.addEach(values)},List.List=List,Object.addEach(List.prototype,genericCollection.prototype),Object.addEach(List.prototype,genericOrder.prototype),List.from=genericCollection.from,List.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.getDefault)},List.prototype.find=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.next);at!==head;){if(equals(at.value,value))return at;at=at.next}},List.prototype.findLast=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.prev);at!==head;){if(equals(at.value,value))return at;at=at.prev}},List.prototype.has=function(value,equals){return!!this.find(value,equals)},List.prototype.get=function(value,equals){var found=this.find(value,equals);return found?found.value:this.getDefault(value)},List.prototype.delete=function(value,equals){var found=this.findLast(value,equals);return!!found&&(found.delete(),this.length--,!0)},List.prototype.deleteAll=function(value,equals){equals=equals||this.contentEquals;for(var head=this.head,at=head.next,count=0;at!==head;)equals(value,at.value)&&(at.delete(),count++),at=at.next;return this.length-=count,count},List.prototype.clear=function(){this.head.next=this.head.prev=this.head,this.length=0},List.prototype.add=function(value){var node=new this.Node(value);return this._addNode(node)},List.prototype._addNode=function(node){return this.head.addBefore(node),this.length++,!0},List.prototype.push=function(){for(var head=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);head.addBefore(node)}this.length+=arguments.length},List.prototype.unshift=function(){for(var at=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);at.addAfter(node),at=node}this.length+=arguments.length},List.prototype._shouldPop=function(){var value,head=this.head;return head.prev!==head&&(value=head.prev.value),value},List.prototype.pop=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.prev.value;var index=this.length-1,popDispatchValueArray=_before?_before.call(this,value,index):void 0;head.prev.delete(),this.length--,_after&&_after.call(this,value,index,popDispatchValueArray)}return value},List.prototype.shift=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.next.value;var dispatchValueArray=_before?_before.call(this,value,0):void 0;head.next.delete(),this.length--,_after&&_after.call(this,value,0,dispatchValueArray)}return value},List.prototype.peek=function(){if(this.head!==this.head.next)return this.head.next.value},List.prototype.poke=function(value){this.head!==this.head.next?this.head.next.value=value:this.push(value)},List.prototype.one=function(){return this.peek()},List.prototype.scan=function(at,fallback){var head=this.head;if("number"==typeof at){var count=at;if(count>=0)for(at=head.next;count&&(count--,(at=at.next)!=head););else for(at=head;count<0&&(count++,(at=at.prev)!=head););return at}return at||fallback},List.prototype.slice=function(at,end){var sliced=[],head=this.head;for(at=this.scan(at,head.next),end=this.scan(end,head);at!==end&&at!==head;)sliced.push(at.value),at=at.next;return sliced},List.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},List.prototype.swap=function(start,length,plus,_before,_after){var initial=start;start=this.scan(start,this.head),null==length&&(length=1/0),plus=Array.from(plus);for(var minus=[],at=start;length--&&length>=0&&at!==this.head;)minus.push(at.value),at=at.next;_before&&_before.call(this,start,plus,minus);at=start;var i=0;for(at=start;i<minus.length;i++,at=at.next)at.delete();null==initial&&at===this.head&&(at=this.head.next);for(i=0;i<plus.length;i++){var node=new this.Node(plus[i]);at.addBefore(node)}return this.length+=plus.length-minus.length,_after&&_after.call(this,start,plus,minus),minus},List.prototype.reverse=function(){var at=this.head;do{var temp=at.next;at.next=at.prev,at.prev=temp,at=at.next}while(at!==this.head);return this},List.prototype.sort=function(){this.swap(0,this.length,this.sorted.apply(this,arguments))},List.prototype.reduce=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.next;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.next;return basis},List.prototype.reduceRight=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.prev;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.prev;return basis},List.prototype.updateIndexes=function(node,index){for(;node!==this.head;)node.index=index++,node=node.next},List.prototype.iterate=function(){return new ListIterator(this.head)},ListIterator.prototype.__iterationObject=null,Object.defineProperty(ListIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ListIterator.prototype.next=function(){if(this.at===this.head)this._iterationObject.done=!0,this._iterationObject.value=void 0;else{var value=this.at.value;this.at=this.at.next,this._iterationObject.value=value}return this._iterationObject},List.prototype.Node=Node,Node.prototype.delete=function(){this.prev.next=this.next,this.next.prev=this.prev},Node.prototype.addBefore=function(node){var prev=this.prev;this.prev=node,node.prev=prev,prev.next=node,node.next=this},Node.prototype.addAfter=function(node){var next=this.next;this.next=node,node.next=next,next.prev=node,node.prev=this};var iterator=Iterator;function Iterator(iterable,standardMode){var values=standardMode&&iterable&&iterable.values&&iterable.values();if(values&&"function"==typeof values.next)return values;if(!(this instanceof Iterator))return new Iterator(iterable);if(Array.isArray(iterable)||"string"==typeof iterable)return Iterator.iterate(iterable);if((iterable=shimObject(iterable))instanceof Iterator)return iterable;if(iterable.next)this.next=function(){return iterable.next()};else if(iterable.iterate){var iterator=iterable.iterate();this.next=function(){return iterator.next()}}else{if("[object Function]"!==shimObject.prototype.toString.call(iterable))throw new TypeError("Can't iterate "+iterable);this.next=iterable}}Iterator.prototype.forEach=genericCollection.prototype.forEach,Iterator.prototype.map=genericCollection.prototype.map,Iterator.prototype.filter=genericCollection.prototype.filter,Iterator.prototype.every=genericCollection.prototype.every,Iterator.prototype.some=genericCollection.prototype.some,Iterator.prototype.any=genericCollection.prototype.any,Iterator.prototype.all=genericCollection.prototype.all,Iterator.prototype.min=genericCollection.prototype.min,Iterator.prototype.max=genericCollection.prototype.max,Iterator.prototype.sum=genericCollection.prototype.sum,Iterator.prototype.average=genericCollection.prototype.average,Iterator.prototype.flatten=genericCollection.prototype.flatten,Iterator.prototype.zip=genericCollection.prototype.zip,Iterator.prototype.enumerate=genericCollection.prototype.enumerate,Iterator.prototype.sorted=genericCollection.prototype.sorted,Iterator.prototype.group=genericCollection.prototype.group,Iterator.prototype.reversed=genericCollection.prototype.reversed,Iterator.prototype.toArray=genericCollection.prototype.toArray,Iterator.prototype.toObject=genericCollection.prototype.toObject,Iterator.prototype.iterator=genericCollection.prototype.iterator,Iterator.prototype.__iterationObject=null,shimObject.defineProperty(Iterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:void 0})}}),Iterator.prototype.constructClone=function(values){var clone=[];return clone.addEach(values),clone},Iterator.prototype.mapIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var callbackValue=callback.call(thisp,self.next().value,i++,self);self._iterationObject.value=callbackValue}return self._iterationObject}))},Iterator.prototype.filterIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){for(var nextEntry;;){if(!0===(nextEntry=self.next()).done)return nextEntry;if(callback.call(thisp,nextEntry.value,i++,self))return nextEntry}}))},Iterator.prototype.reduce=function(callback){var nextEntry,self=Iterator(this),result=arguments[1],thisp=arguments[2],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;if(!0===(nextEntry=self.next()).done){if(arguments.length>1)return arguments[1];throw TypeError("cannot reduce a value from an empty iterator with no initial value")}for(result=arguments.length>1?callback.call(thisp,result,nextEntry.value,i,self):nextEntry.value,i++;;){if(!0===(nextEntry=self.next()).done)return result;result=callback.call(thisp,result,nextEntry.value,i,self),i++}},Iterator.prototype.concat=function(){return Iterator.concat(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.dropWhile=function(callback){var stopValue,nextEntry,self=Iterator(this),thisp=arguments[1],stopped=!1,i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;for(;!0!==(nextEntry=self.next()).done;){if(!callback.call(thisp,nextEntry.value,i,self)){stopped=!0,stopValue=nextEntry.value;break}i++}return stopped?self.constructor([stopValue]).concat(self):self.constructor([])},Iterator.prototype.takeWhile=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var value=self.next().value;callback.call(thisp,value,i++,self)?self._iterationObject.value=value:(self._iterationObject.done=!0,self._iterationObject.value=void 0)}return self._iterationObject}))},Iterator.prototype.zipIterator=function(){return Iterator.unzip(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.enumerateIterator=function(start){return Iterator.count(start).zipIterator(this)},Iterator.iterate=function(iterable){var start;return start=0,new Iterator((function(){if("object"==typeof iterable)for(;!(start in iterable);){if(start>=iterable.length){this._iterationObject.done=!0,this._iterationObject.value=void 0;break}start+=1}else start>=iterable.length&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);return this._iterationObject.done||(this._iterationObject.value=iterable[start],start+=1),this._iterationObject}))},Iterator.cycle=function(cycle,times){var next;return arguments.length<2&&(times=1/0),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),next&&!0!==nextEntry.done||(times>0?(times--,iteration=Iterator.iterate(cycle),nextEntry=(next=iteration.next.bind(iteration))()):(this._iterationObject.done=!0,nextEntry=this._iterationObject)),nextEntry}))},Iterator.concat=function(iterators){var next;return iterators=Iterator(iterators),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),nextEntry&&!0!==nextEntry.done?nextEntry:!1===(nextEntry=iterators.next()).done?(iteration=Iterator(nextEntry.value),(next=iteration.next.bind(iteration))()):nextEntry}))},Iterator.unzip=function(iterators){return 0===(iterators=Iterator(iterators).map(Iterator)).length?new Iterator([]):new Iterator((function(){var stopped,nextEntry,result=iterators.map((function(iterator){return!0===(nextEntry=iterator.next()).done&&(stopped=!0),nextEntry.value}));return stopped?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=result,this._iterationObject}))},Iterator.zip=function(){return Iterator.unzip(Array.prototype.slice.call(arguments))},Iterator.chain=function(){return Iterator.concat(Array.prototype.slice.call(arguments))},Iterator.range=function(start,stop,step){return arguments.length<3&&(step=1),arguments.length<2&&(stop=start,start=0),start=start||0,step=step||1,new Iterator((function(){start>=stop&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);var result=start;return start+=step,this._iterationObject.value=result,this._iterationObject}))},Iterator.count=function(start,step){return Iterator.range(start,1/0,step)},Iterator.repeat=function(value,times){return new Iterator.range(times).mapIterator((function(){return value}))};var genericMap=GenericMap;function GenericMap(){throw new Error("Can't construct. GenericMap is a mixin.")}function Item(key,value){this.key=key,this.value=value}GenericMap.prototype.isMap=!0,GenericMap.prototype.addEach=function(values){var i;if(values&&shimObject(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);else shimObject.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},GenericMap.prototype.get=function(key,defaultValue){var item=this.store.get(new this.Item(key));return item?item.value:arguments.length>1?(console.log("Use of a second argument as default value is deprecated to match standards"),defaultValue):this.getDefault(key)},GenericMap.prototype.set=function(key,value){var item=new this.Item(key,value),found=this.store.get(item);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found.value),found.value=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.store.add(item)&&this.length++,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},GenericMap.prototype.add=function(value,key){return this.set(key,value)},GenericMap.prototype.has=function(key){return this.store.has(new this.Item(key))},GenericMap.prototype.delete=function(key){var item=new this.Item(key);if(this.store.has(item)){var from=this.store.get(item).value;return this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,from),this.store.delete(item),this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0}return!1},GenericMap.prototype.clear=function(){var keys,key;if(this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),this.store.clear(),this.length=0,this.dispatchesMapChanges)for(var i=0;key=keys[i];i++)this.dispatchMapChange(key)},GenericMap.prototype.reduce=function(callback,basis,thisp){return this.store.reduce((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.reduceRight=function(callback,basis,thisp){return this.store.reduceRight((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.keysArray=function(){return this.map((function(value,key){return key}))},GenericMap.prototype.keys=function(){return new iterator(this.keysArray(),!0)},GenericMap.prototype.valuesArray=function(){return this.map(Function.identity)},GenericMap.prototype.values=function(){return new iterator(this.valuesArray(),!0)},GenericMap.prototype.entriesArray=function(){return this.map((function(value,key){return[key,value]}))},GenericMap.prototype.entries=function(){return new iterator(this.entriesArray(),!0)},GenericMap.prototype.items=function(){return this.entriesArray()},GenericMap.prototype.equals=function(that,equals){return equals=equals||shimObject.equals,this===that||(that&&"function"==typeof that.every?that.length===this.length&&that.every((function(value,key){return equals(this.get(key),value)}),this):shimObject.keys(that).length===this.length&&shimObject.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))},GenericMap.prototype.toJSON=function(){return this.entriesArray()},GenericMap.prototype.Item=Item,Item.prototype.equals=function(that){return shimObject.equals(this.key,that.key)&&shimObject.equals(this.value,that.value)},Item.prototype.compare=function(that){return shimObject.compare(this.key,that.key)};var _dict=Dict;function Dict(values,getDefault){if(!(this instanceof Dict))return new Dict(values,getDefault);getDefault=getDefault||Function.noop,this.getDefault=getDefault,this.store=Object.create(null),this.length=0,this.addEach(values)}Dict.Dict=Dict,Object.addEach(Dict.prototype,genericCollection.prototype),Object.addEach(Dict.prototype,genericMap.prototype),Dict.from=genericCollection.from,Dict.prototype.constructClone=function(values){return new this.constructor(values,this.getDefault)},Dict.prototype.assertString=function(key){if("string"!=typeof key)throw new TypeError("key must be a string but Got "+key)},Object.defineProperty(Dict.prototype,"$__proto__",{writable:!0}),Object.defineProperty(Dict.prototype,"_hasProto",{get:function(){return this.hasOwnProperty("$__proto__")&&void 0!==this._protoValue}}),Object.defineProperty(Dict.prototype,"_protoValue",{get:function(){return this.$__proto__},set:function(value){this.$__proto__=value}}),Object.defineProperty(Dict.prototype,"size",genericCollection._sizePropertyDescriptor),Dict.prototype.get=function(key,defaultValue){return this.assertString(key),"__proto__"===key?this._hasProto?this._protoValue:arguments.length>1?defaultValue:this.getDefault(key):key in this.store?this.store[key]:arguments.length>1?defaultValue:this.getDefault(key)},Dict.prototype.set=function(key,value){this.assertString(key);var isProtoKey="__proto__"===key;return(isProtoKey?this._hasProto:key in this.store)?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,isProtoKey?this._protoValue:this.store[key]),isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!1):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.length++,isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!0)},Dict.prototype.has=function(key){return this.assertString(key),"__proto__"===key?this._hasProto:key in this.store},Dict.prototype.delete=function(key){return this.assertString(key),"__proto__"===key?!!this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this._protoValue),this._protoValue=void 0,this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0):key in this.store&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)},Dict.prototype.clear=function(){var key;for(key in this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange("__proto__",this._protoValue),this._protoValue=void 0,this.dispatchesMapChanges&&this.dispatchMapChange("__proto__",void 0)),this.store)this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0);this.length=0},Dict.prototype.reduce=function(callback,basis,thisp){this._hasProto&&(basis=callback.call(thisp,basis,"$__proto__","__proto__",this));var store=this.store;for(var key in this.store)basis=callback.call(thisp,basis,store[key],key,this);return basis},Dict.prototype.reduceRight=function(callback,basis,thisp){var self=this,store=this.store;return basis=Object.keys(this.store).reduceRight((function(basis,key){return callback.call(thisp,basis,store[key],key,self)}),basis),this._hasProto?callback.call(thisp,basis,this._protoValue,"__proto__",self):basis},Dict.prototype.one=function(){var key;for(key in this.store)return this.store[key];return this._protoValue},Dict.prototype.toJSON=function(){return this.toObject()};var treeLog=TreeLog;function TreeLog(){}TreeLog.ascii={intersection:"+",through:"-",branchUp:"+",branchDown:"+",fromBelow:".",fromAbove:"'",fromBoth:"+",strafe:"|"},TreeLog.unicodeRound={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"╭",fromAbove:"╰",fromBoth:"┣",strafe:"┃"},TreeLog.unicodeSharp={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"┏",fromAbove:"┗",fromBoth:"┣",strafe:"┃"};var _fastSet=FastSet;function FastSet(values,equals,hash,getDefault){if(!(this instanceof FastSet))return new FastSet(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault;var self=this;this.buckets=new this.Buckets(null,(function(){return new self.Bucket})),this.length=0,this.addEach(values)}FastSet.FastSet=FastSet,Object.addEach(FastSet.prototype,genericCollection.prototype),Object.addEach(FastSet.prototype,genericSet.prototype),FastSet.from=genericCollection.from,FastSet.prototype.Buckets=_dict,FastSet.prototype.Bucket=_list,FastSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},FastSet.prototype.has=function(value){var hash=this.contentHash(value);return this.buckets.get(hash).has(value)},FastSet.prototype.get=function(value,equals){if(equals)throw new Error("FastSet#get does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)?buckets.get(hash).get(value):this.getDefault(value)},FastSet.prototype.delete=function(value,equals){if(equals)throw new Error("FastSet#delete does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;if(buckets.has(hash)){var bucket=buckets.get(hash);if(bucket.delete(value))return this.length--,0===bucket.length&&buckets.delete(hash),!0}return!1},FastSet.prototype.clear=function(){this.buckets.clear(),this.length=0},FastSet.prototype.add=function(value){var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)||buckets.set(hash,new this.Bucket(null,this.contentEquals)),!buckets.get(hash).has(value)&&(buckets.get(hash).add(value),this.length++,!0)},FastSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],buckets=this.buckets,index=0;return buckets.reduce((function(basis,bucket){return bucket.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)}),basis,this)},FastSet.prototype.one=function(){if(this.length>0)return this.buckets.one().one()},FastSet.prototype.iterate=function(){return this.buckets.valuesArray().flatten().iterate()},FastSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeSharp,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp);for(var hash,branch,leader,bucket,buckets=this.buckets,bucketsSize=buckets.size,mapIter=buckets.keys(),index=0;hash=mapIter.next().value;)index===bucketsSize-1?(branch=charmap.fromAbove,leader=" "):0===index?(branch=charmap.branchDown,leader=charmap.strafe):(branch=charmap.fromBoth,leader=charmap.strafe),bucket=buckets.get(hash),callback.call(thisp,branch+charmap.through+charmap.branchDown+" "+hash),bucket.forEach((function(value,node){var branch,below,written;node===bucket.head.prev?(branch=charmap.fromAbove,below=" "):(branch=charmap.fromBoth,below=charmap.strafe),logNode(node,(function(line){written?callback.call(thisp,leader+" "+below+"  "+line):(callback.call(thisp,leader+" "+branch+charmap.through+charmap.through+line),written=!0)}),(function(line){callback.call(thisp,leader+" "+charmap.strafe+"  "+line)}))})),index++},FastSet.prototype.logNode=function(node,write){var value=node.value;Object(value)===value?JSON.stringify(value,null,4).split("\n").forEach((function(line){write(" "+line)})):write(" "+value)};var _set=createCommonjsModule((function(module){var GlobalSet,CollectionsSet;void 0!==commonjsGlobal.Set&&"function"==typeof commonjsGlobal.Set.prototype.values&&((GlobalSet=module.exports=commonjsGlobal.Set).Set=GlobalSet,GlobalSet.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value){basis=callback.call(thisp,basis,value,this)})),basis},GlobalSet.prototype.reduceRight=function(callback,basis){for(var value,thisp=arguments[2],setIterator=this.values(),size=this.size,reverseOrder=new Array(this.size),i=size;value=setIterator.next().value;)reverseOrder[--i]=value;for(;i<size;)basis=callback.call(thisp,basis,reverseOrder[i++],this);return basis},GlobalSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.size===(that.size||that.length)&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GlobalSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},GlobalSet.prototype.toJSON=function(){return this.entriesArray()},GlobalSet.prototype.one=function(){if(this.size>0)return this.values().next().value},GlobalSet.prototype.pop=function(){if(this.size){for(var aValue,value,setIterator=this.values();aValue=setIterator.next().value;)value=aValue;return this.delete(value,this.size-1),value}},GlobalSet.prototype.shift=function(){if(this.size){var firstValue=this.values().next().value;return this.delete(firstValue,0),firstValue}},Object.defineProperty(GlobalSet.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0}),GlobalSet.from=function(value){var result=new this;return result.addEach(value),result},Object.addEach(GlobalSet.prototype,genericCollection.prototype,!1),Object.addEach(GlobalSet.prototype,genericSet.prototype,!1)),(CollectionsSet=function CollectionsSet(values,equals,hash,getDefault){return CollectionsSet._init(CollectionsSet,this,values,equals,hash,getDefault)})._init=function(constructor,object,values,equals,hash,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,object.contentEquals=equals,object.contentHash=hash,object.getDefault=getDefault,object.order=new object.Order(void 0,equals),object.store=new object.Store(void 0,(function(a,b){return equals(a.value,b.value)}),(function(node){return hash(node.value)})),object.length=0,object.addEach(values)},CollectionsSet.Set=CollectionsSet,CollectionsSet.CollectionsSet=CollectionsSet,Object.addEach(CollectionsSet.prototype,genericCollection.prototype),Object.addEach(CollectionsSet.prototype,genericSet.prototype),CollectionsSet.from=genericCollection.from,Object.defineProperty(CollectionsSet.prototype,"size",genericCollection._sizePropertyDescriptor),CollectionsSet.prototype.Order=_list,CollectionsSet.prototype.Store=_fastSet,CollectionsSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},CollectionsSet.prototype.has=function(value){var node=new this.order.Node(value);return this.store.has(node)},CollectionsSet.prototype.get=function(value,equals){if(equals)throw new Error("Set#get does not support second argument: equals");var node=new this.order.Node(value);return(node=this.store.get(node))?node.value:this.getDefault(value)},CollectionsSet.prototype.add=function(value){var node=new this.order.Node(value);if(!this.store.has(node)){this.length;return this.order.add(value),node=this.order.head.prev,this.store.add(node),this.length++,!0}return!1},CollectionsSet.prototype.delete=function(value,equals){if(equals)throw new Error("Set#delete does not support second argument: equals");var node=new this.order.Node(value);return!!this.store.has(node)&&(node=this.store.get(node),this.store.delete(node),this.order.splice(node,1),this.length--,!0)},CollectionsSet.prototype.pop=function(){if(this.length){var result=this.order.head.prev.value;return this.delete(result),result}},CollectionsSet.prototype.shift=function(){if(this.length){var result=this.order.head.next.value;return this.delete(result),result}},CollectionsSet.prototype.one=function(){if(this.length>0)return this.store.one().value},CollectionsSet.prototype.clear=function(){this.store.clear(),this.order.clear(),this.length=0},Object.defineProperty(CollectionsSet.prototype,"_clear",{value:CollectionsSet.prototype.clear}),CollectionsSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],list=this.order,index=0;return list.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)},CollectionsSet.prototype.reduceRight=function(callback,basis){var thisp=arguments[2],list=this.order,index=this.length-1;return list.reduceRight((function(basis,value){return callback.call(thisp,basis,value,index--,this)}),basis,this)},CollectionsSet.prototype.iterate=function(){return this.order.iterate()},CollectionsSet.prototype.values=function(){return new iterator(this.valuesArray(),!0)},CollectionsSet.prototype.log=function(){var set=this.store;return set.log.apply(set,arguments)},GlobalSet?(GlobalSet.prototype.valuesArray=genericSet.prototype.valuesArray,GlobalSet.prototype.entriesArray=genericSet.prototype.entriesArray,module.exports=GlobalSet,GlobalSet.CollectionsSet=CollectionsSet):module.exports=CollectionsSet})),_map=createCommonjsModule((function(module){var Map,GlobalMap,CollectionsMap;if(void 0!==commonjsGlobal.Map&&"function"==typeof commonjsGlobal.Set.prototype.values){var map_makeObservable;GlobalMap=Map=module.exports=commonjsGlobal.Map,Map.Map=Map,map_makeObservable={}.__proto__===Object.prototype?function(){this.__proto__=ChangeDispatchMap}:function(){Object.defineProperties(this,observableSetProperties)},Object.defineProperty(Map.prototype,"makeObservable",{value:map_makeObservable,writable:!0,configurable:!0,enumerable:!1}),Object.defineProperty(Map.prototype,"makePropertyObservable",{value:function(){},writable:!0,configurable:!0,enumerable:!1}),Map.prototype.constructClone=function(values){return new this.constructor(values)},Map.prototype.isMap=!0,Map.prototype.addEach=function(values){if(values&&Object(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(var i=0;i<values.length;i++)this.add(values[i],i);else Object.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},Map.prototype.add=function(value,key){return this.set(key,value)},Map.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value,key,map){basis=callback.call(thisp,basis,value,key,this)})),basis},Map.prototype.reduceRight=function(callback,basis){for(var aKey,thisp=arguments[2],keysIterator=this.keys(),size=this.size,reverseOrder=new Array(this.size),i=0;aKey=keysIterator.next().value;)reverseOrder[--size]=aKey;for(;i++<size;)basis=callback.call(thisp,basis,this.get(reverseOrder[i]),reverseOrder[i],this);return basis},Map.prototype.equals=function(that,equals){return equals=equals||Object.equals,this===that||(that&&"function"==typeof that.every?that.size===this.size&&that.every((function(value,key){return equals(this.get(key),value)}),this):Object.keys(that).length===this.size&&Object.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))};var _keysArrayFunction=function(value,key){return key};Map.prototype.keysArray=function(){return this.map(_keysArrayFunction)};var _valuesArrayFunction=function(value,key){return value};Map.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};Map.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)},Map.prototype.toJSON=function(){return this.entriesArray()},Map.prototype.items=function(){return this.entriesArray()},Map.from=function(value){var result=new this;return result.addEach(value),result},Object.defineProperty(Map.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0});var map_clear=Map.prototype.clear,map_set=Map.prototype.set,map_delete=Map.prototype.delete,observableMapProperties={clear:{value:function(){var keys;this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),map_clear.call(this),this.dispatchesMapChanges&&keys.forEach((function(key){this.dispatchMapChange(key)}),this)},writable:!0,configurable:!0},set:{value:function(key,value){var found=this.get(key);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},writable:!0,configurable:!0},delete:{value:function(key){return!!this.has(key)&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.get(key)),map_delete.call(this,key),this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)}}};Object.addEach(Map.prototype,genericCollection.prototype,!1);var ChangeDispatchMap=Object.create(Map.prototype,observableMapProperties)}var Set=_set.CollectionsSet;CollectionsMap=Map=function Map(values,equals,hash,getDefault){if(!(this instanceof Map))return new Map(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault,this.store=new Set(void 0,(function(a,b){return equals(a.key,b.key)}),(function(item){return hash(item.key)})),this.length=0,this.addEach(values)},Map.Map=Map,Object.addEach(Map.prototype,genericCollection.prototype),Object.addEach(Map.prototype,genericMap.prototype),Object.defineProperty(Map.prototype,"size",genericCollection._sizePropertyDescriptor),Map.from=genericCollection.from,Map.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},Map.prototype.log=function(charmap,logNode,callback,thisp){logNode=logNode||this.logNode,this.store.log(charmap,(function(node,log,logBefore){logNode(node.value.value,log,logBefore)}),callback,thisp)},Map.prototype.logNode=function(node,log){log(" key: "+node.key),log(" value: "+node.value)},GlobalMap?(module.exports=GlobalMap,GlobalMap.CollectionsMap=CollectionsMap):module.exports=CollectionsMap})),changeDescriptor=createCommonjsModule((function(module){var ObjectChangeDescriptor=module.exports.ObjectChangeDescriptor=function(name){return this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null,this};Object.defineProperties(ObjectChangeDescriptor.prototype,{name:{value:null,writable:!0},isActive:{value:!1,writable:!0},_willChangeListeners:{value:null,writable:!0},willChangeListeners:{get:function(){return this._willChangeListeners||(this._willChangeListeners=new this.willChangeListenersRecordConstructor(this.name))}},_changeListeners:{value:null,writable:!0},changeListeners:{get:function(){return this._changeListeners||(this._changeListeners=new this.changeListenersRecordConstructor(this.name))}},changeListenersRecordConstructor:{value:ChangeListenersRecord,writable:!0},willChangeListenersRecordConstructor:{value:WillChangeListenersRecord,writable:!0}});var ListenerGhost=module.exports.ListenerGhost=Object.create(null),ChangeListenerSpecificHandlerMethodName=new _map;function ChangeListenersRecord(name){var specificHandlerMethodName=ChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="Change",ChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this._current=null,this._current=null,this.specificHandlerMethodName=specificHandlerMethodName,this}module.exports.ChangeListenersRecord=ChangeListenersRecord,Object.defineProperties(ChangeListenersRecord.prototype,{_current:{value:null,writable:!0},current:{get:function(){return this._current},set:function(value){this._current=value}},ListenerGhost:{value:ListenerGhost,writable:!0},ghostCount:{value:0,writable:!0},maxListenerGhostRatio:{value:.3,writable:!0},listenerGhostFilter:{value:function(value){return value!==this.ListenerGhost}},removeCurrentGostListenersIfNeeded:{value:function(){return this._current&&this.ghostCount/this._current.length>this.maxListenerGhostRatio&&(this.ghostCount=0,this._current=this._current.filter(this.listenerGhostFilter,this)),this._current}},dispatchBeforeChange:{value:!1,writable:!0},genericHandlerMethodName:{value:"handlePropertyChange",writable:!0}}),module.exports.WillChangeListenersRecord=WillChangeListenersRecord;var WillChangeListenerSpecificHandlerMethodName=new _map;function WillChangeListenersRecord(name){var specificHandlerMethodName=WillChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="WillChange",WillChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}WillChangeListenersRecord.prototype=new ChangeListenersRecord,WillChangeListenersRecord.prototype.constructor=WillChangeListenersRecord,WillChangeListenersRecord.prototype.genericHandlerMethodName="handlePropertyWillChange"})),propertyChanges=(changeDescriptor.ObjectChangeDescriptor,changeDescriptor.ListenerGhost,changeDescriptor.ChangeListenersRecord,changeDescriptor.WillChangeListenersRecord,PropertyChanges);function PropertyChanges(){throw new Error("This is an abstract interface. Mix it. Don't construct it")}var ObjectChangeDescriptor=changeDescriptor.ObjectChangeDescriptor,ListenerGhost=changeDescriptor.ListenerGhost;PropertyChanges.debug=!0;var ObjectsPropertyChangeListeners=new weakMap$1,ObjectChangeDescriptorName=new _map;function dispatchEach(listeners,key,value,object){if(listeners&&listeners._current){var current,listener,i,countI,thisp,specificHandlerMethodName=listeners.specificHandlerMethodName,genericHandlerMethodName=listeners.genericHandlerMethodName,Ghost=ListenerGhost;if(Array.isArray(listeners._current)){for(i=0,countI=(current=listeners.removeCurrentGostListenersIfNeeded()).length;i<countI;i++)if((thisp=current[i])!==Ghost){if(!(listener=thisp[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}else{if(!(listener=(thisp=listeners._current)[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}}PropertyChanges.ObjectChangeDescriptor=function(){},PropertyChanges.prototype.getOwnPropertyChangeDescriptor=function(key){var keyChangeDescriptor,objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);if(objectPropertyChangeDescriptors||(objectPropertyChangeDescriptors=Object.create(null),ObjectsPropertyChangeListeners.set(this,objectPropertyChangeDescriptors)),void 0===(keyChangeDescriptor=objectPropertyChangeDescriptors[key])){var propertyName=ObjectChangeDescriptorName.get(key);return propertyName||(propertyName=(propertyName=String(key))&&propertyName[0].toUpperCase()+propertyName.slice(1),ObjectChangeDescriptorName.set(key,propertyName)),objectPropertyChangeDescriptors[key]=new ObjectChangeDescriptor(propertyName)}return keyChangeDescriptor},PropertyChanges.prototype.hasOwnPropertyChangeDescriptor=function(key){var objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);return!!objectPropertyChangeDescriptors&&(!key||void 0!==objectPropertyChangeDescriptors[key])},PropertyChanges.prototype.addOwnPropertyChangeListener=function(key,listener,beforeChange){this.makeObservable&&!this.isObservable&&this.makeObservable();var descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key),listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners;PropertyChanges.makePropertyObservable(this,key),listeners._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener;var self=this;return function(){PropertyChanges.removeOwnPropertyChangeListener(self,key,listener,beforeChange),self=null}},PropertyChanges.prototype.addBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.addOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.removeOwnPropertyChangeListener=function removeOwnPropertyChangeListener(key,listener,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove property change listener: does not exist: property name"+JSON.stringify(key));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=removeOwnPropertyChangeListener.ListenerGhost):listeners._current.spliceOne(index)}},PropertyChanges.prototype.removeOwnPropertyChangeListener.ListenerGhost=ListenerGhost,PropertyChanges.prototype.removeBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.removeOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.dispatchOwnPropertyChange=function dispatchOwnPropertyChange(key,value,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if(!descriptor.isActive){descriptor.isActive=!0,listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners;try{dispatchOwnPropertyChange.dispatchEach(listeners,key,value,this)}finally{descriptor.isActive=!1}}},PropertyChanges.prototype.dispatchOwnPropertyChange.dispatchEach=dispatchEach,dispatchEach.ListenerGhost=ListenerGhost,PropertyChanges.prototype.dispatchBeforeOwnPropertyChange=function(key,listener){return PropertyChanges.dispatchOwnPropertyChange(this,key,listener,!0)};var ObjectsOverriddenPropertyDescriptors=new weakMap$1,propertyListener=(new weakMap$1,{get:void 0,set:void 0,configurable:!0,enumerable:!1});PropertyChanges.prototype.makePropertyObservable=function(key){var overriddenPropertyDescriptors=ObjectsOverriddenPropertyDescriptors.get(this);if(!overriddenPropertyDescriptors||void 0===overriddenPropertyDescriptors.get(key)){if(!overriddenPropertyDescriptors){if(Array.isArray(this))return;if(!Object.isExtensible(this))throw new Error("Can't make property "+JSON.stringify(key)+" observable on "+this+" because object is not extensible");overriddenPropertyDescriptors=new _map,ObjectsOverriddenPropertyDescriptors.set(this,overriddenPropertyDescriptors)}var overriddenDescriptor,attached=this;do{if(overriddenDescriptor=Object.getOwnPropertyDescriptor(attached,key))break;attached=Object.getPrototypeOf(attached)}while(attached);if(overriddenDescriptor){if(!overriddenDescriptor.configurable)return;if(!overriddenDescriptor.writable&&!overriddenDescriptor.set)return}else overriddenDescriptor={value:void 0,enumerable:!0,writable:!0,configurable:!0};overriddenPropertyDescriptors.set(key,overriddenDescriptor),"value"in overriddenDescriptor?(propertyListener.get=function dispatchingGetter(){return dispatchingGetter.overriddenDescriptor.value},propertyListener.set=function dispatchingSetter(value){var descriptor,isActive,overriddenDescriptor=dispatchingSetter.overriddenDescriptor;if(value!==overriddenDescriptor.value){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,dispatchingSetter.key,overriddenDescriptor.value,this)}finally{}}if(overriddenDescriptor.value=value,!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,dispatchingSetter.key,value,this)}finally{descriptor.isActive=!1}}},propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.key=key,propertyListener.get.overriddenDescriptor=propertyListener.set.overriddenDescriptor=overriddenDescriptor,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key],propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0):(propertyListener.get=overriddenDescriptor.get,propertyListener.set=function dispatchingSetter(){var descriptor,isActive,newValue,formerValue=dispatchingSetter.overriddenGetter.call(this);if(1===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0]):2===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0],arguments[1]):dispatchingSetter.overriddenSetter.apply(this,arguments),(newValue=dispatchingSetter.overriddenGetter.call(this))!==formerValue){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,key,formerValue,this)}finally{}}if(!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,key,newValue,this)}finally{descriptor.isActive=!1}}},propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0,propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.overriddenSetter=overriddenDescriptor.set,propertyListener.set.overriddenGetter=overriddenDescriptor.get,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key]),Object.defineProperty(this,key,propertyListener)}},PropertyChanges.getOwnPropertyChangeDescriptor=function(object,key){return object.getOwnPropertyChangeDescriptor?object.getOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.getOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.hasOwnPropertyChangeDescriptor=function(object,key){return object.hasOwnPropertyChangeDescriptor?object.hasOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.hasOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.addOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.addOwnPropertyChangeListener?object.addOwnPropertyChangeListener(key,listener,beforeChange):this.prototype.addOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.removeOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.removeOwnPropertyChangeListener?object.removeOwnPropertyChangeListener(key,listener,beforeChange):PropertyChanges.prototype.removeOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.dispatchOwnPropertyChange=function(object,key,value,beforeChange){if(Object.isObject(object))return object.dispatchOwnPropertyChange?object.dispatchOwnPropertyChange(key,value,beforeChange):PropertyChanges.prototype.dispatchOwnPropertyChange.call(object,key,value,beforeChange)},PropertyChanges.addBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.addOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.removeBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.removeOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.dispatchBeforeOwnPropertyChange=function(object,key,value){return PropertyChanges.dispatchOwnPropertyChange(object,key,value,!0)},PropertyChanges.makePropertyObservable=function(object,key){return object.makePropertyObservable?object.makePropertyObservable(key):PropertyChanges.prototype.makePropertyObservable.call(object,key)};var ObjectChangeDescriptor$1=changeDescriptor.ObjectChangeDescriptor,ChangeListenersRecord=changeDescriptor.ChangeListenersRecord,ListenerGhost$1=changeDescriptor.ListenerGhost,rangeChangeDescriptors=new weakMap$1;function RangeChangeDescriptor(name){this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null}RangeChangeDescriptor.prototype=new ObjectChangeDescriptor$1,RangeChangeDescriptor.prototype.constructor=RangeChangeDescriptor,RangeChangeDescriptor.prototype.changeListenersRecordConstructor=RangeChangeListenersRecord,RangeChangeDescriptor.prototype.willChangeListenersRecordConstructor=RangeWillChangeListenersRecord,Object.defineProperty(RangeChangeDescriptor.prototype,"active",{get:function(){return this._active||(this._active=this._current?this._current.slice():[])}});var RangeChangeListenersSpecificHandlerMethodName=new _map;function RangeChangeListenersRecord(name){var specificHandlerMethodName=RangeChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeChange",RangeChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeChangeListenersRecord.prototype=new ChangeListenersRecord,RangeChangeListenersRecord.prototype.constructor=RangeChangeListenersRecord;var RangeWillChangeListenersSpecificHandlerMethodName=new _map;function RangeWillChangeListenersRecord(name){var specificHandlerMethodName=RangeWillChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeWillChange",RangeWillChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeWillChangeListenersRecord.prototype=new ChangeListenersRecord,RangeWillChangeListenersRecord.prototype.constructor=RangeWillChangeListenersRecord;var rangeChanges=RangeChanges;function RangeChanges(){throw new Error("Can't construct. RangeChanges is a mixin.")}RangeChanges.prototype.getAllRangeChangeDescriptors=function(){return rangeChangeDescriptors.has(this)||rangeChangeDescriptors.set(this,new _map),rangeChangeDescriptors.get(this)},RangeChanges.prototype.getRangeChangeDescriptor=function(token){var tokenChangeDescriptors=this.getAllRangeChangeDescriptors();return token=token||"",tokenChangeDescriptors.has(token)||tokenChangeDescriptors.set(token,new RangeChangeDescriptor(token)),tokenChangeDescriptors.get(token)};var ObjectsDispatchesRangeChanges=new weakMap$1,dispatchesChangesPropertyDescriptor={get:function(){return ObjectsDispatchesRangeChanges.get(this)},set:function(value){return ObjectsDispatchesRangeChanges.set(this,value)},configurable:!0,enumerable:!1};RangeChanges.prototype.addRangeChangeListener=function(listener,token,beforeChange){!this.isObservable&&this.makeObservable&&this.makeObservable();var listeners,descriptor=this.getRangeChangeDescriptor(token);(listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener,void 0===Object.getOwnPropertyDescriptor(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges")&&Object.defineProperty(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges",dispatchesChangesPropertyDescriptor),this.dispatchesRangeChanges=!0;var self=this;return function(){self&&(self.removeRangeChangeListener(listener,token,beforeChange),self=null)}},RangeChanges.prototype.removeRangeChangeListener=function(listener,token,beforeChange){var listeners,descriptor=this.getRangeChangeDescriptor(token);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove range change listener: does not exist: token "+JSON.stringify(token));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=ListenerGhost$1):listeners._current.spliceOne(index)}},RangeChanges.prototype.dispatchRangeChange=function(plus,minus,index,beforeChange){var descriptor,listeners,tokenName,i,countI,listener,currentListeners,Ghost,descriptors=this.getAllRangeChangeDescriptors(),mapIter=descriptors.values();for(descriptors.dispatchBeforeChange=beforeChange;descriptor=mapIter.next().value;){if(descriptor.isActive)return;if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(tokenName=listeners.specificHandlerMethodName,Array.isArray(listeners._current)){if(listeners._current.length){descriptor.isActive=!0;try{for(currentListeners=listeners.removeCurrentGostListenersIfNeeded(),Ghost=ListenerGhost$1,i=0,countI=currentListeners.length;i<countI;i++)if((listener=currentListeners[i])!==Ghost)if(listener[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}else{descriptor.isActive=!0;try{if((listener=listeners._current)[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}},RangeChanges.prototype.addBeforeRangeChangeListener=function(listener,token){return this.addRangeChangeListener(listener,token,!0)},RangeChanges.prototype.removeBeforeRangeChangeListener=function(listener,token){return this.removeRangeChangeListener(listener,token,!0)},RangeChanges.prototype.dispatchBeforeRangeChange=function(plus,minus,index){return this.dispatchRangeChange(plus,minus,index,!0)};var sortedSet=SortedSet;function SortedSet(values,equals,compare,getDefault){if(!(this instanceof SortedSet))return new SortedSet(values,equals,compare,getDefault);this.contentEquals=equals||Object.equals,this.contentCompare=compare||Object.compare,this.getDefault=getDefault||Function.noop,this.root=null,this.length=0,this.addEach(values)}function Node$1(value){this.value=value,this.left=null,this.right=null,this.length=1}function Iterator$1(set,start,end){if(this.set=set,this.prev=null,this.end=end,start){var next=this.set.findLeastGreaterThanOrEqual(start);next&&(this.set.splay(next.value),this.prev=next.getPrevious())}}SortedSet.SortedSet=SortedSet,Object.addEach(SortedSet.prototype,genericCollection.prototype),Object.addEach(SortedSet.prototype,genericSet.prototype),Object.addEach(SortedSet.prototype,propertyChanges.prototype),Object.addEach(SortedSet.prototype,rangeChanges.prototype),Object.defineProperty(SortedSet.prototype,"size",genericCollection._sizePropertyDescriptor),SortedSet.from=genericCollection.from,SortedSet.prototype.isSorted=!0,SortedSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentCompare,this.getDefault)},SortedSet.prototype.has=function(value,equals){if(equals)throw new Error("SortedSet#has does not support second argument: equals");return!!this.root&&(this.splay(value),this.contentEquals(value,this.root.value))},SortedSet.prototype.get=function(value,equals){if(equals)throw new Error("SortedSet#get does not support second argument: equals");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.value:this.getDefault(value)},SortedSet.prototype.add=function(value){var node=new this.Node(value);if(!this.root)return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],0),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],0),!0;if(this.splay(value),!this.contentEquals(value,this.root.value)){var comparison=this.contentCompare(value,this.root.value);if(0===comparison)throw new Error("SortedSet cannot contain incomparable but inequal values: "+value+" and "+this.root.value);return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],this.root.index),comparison<0?(node.right=this.root,node.left=this.root.left,this.root.left=null,this.root.touch()):(node.left=this.root,node.right=this.root.right,this.root.right=null,this.root.touch()),node.touch(),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],this.root.index),!0}return!1},SortedSet.prototype.delete=function(value,equals){if(equals)throw new Error("SortedSet#delete does not support second argument: equals");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value))){var index=this.root.index;if(this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([],[value],index),this.root.left){var right=this.root.right;this.root=this.root.left,this.splay(value),this.root.right=right}else this.root=this.root.right;return this.length--,this.root&&this.root.touch(),this.dispatchesRangeChanges&&this.dispatchRangeChange([],[value],index),!0}return!1},SortedSet.prototype.indexOf=function(value,index){if(index)throw new Error("SortedSet#indexOf does not support second argument: startIndex");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.index:-1},SortedSet.prototype.find=function(value,equals,index){if(equals)throw new Error("SortedSet#find does not support second argument: equals");if(index)throw new Error("SortedSet#find does not support third argument: index");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value)))return this.root},SortedSet.prototype.findGreatest=function(at){if(this.root){for(at=at||this.root;at.right;)at=at.right;return at}},SortedSet.prototype.findLeast=function(at){if(this.root){for(at=at||this.root;at.left;)at=at.left;return at}},SortedSet.prototype.findGreatestLessThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>0?this.root.getPrevious():this.root},SortedSet.prototype.findGreatestLessThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root.getPrevious():this.root},SortedSet.prototype.findLeastGreaterThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root:this.root.getNext()},SortedSet.prototype.findLeastGreaterThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)<=0?this.root.getNext():this.root},SortedSet.prototype.pop=function(){if(this.root){var found=this.findGreatest();return this.delete(found.value),found.value}},SortedSet.prototype.shift=function(){if(this.root){var found=this.findLeast();return this.delete(found.value),found.value}},SortedSet.prototype.push=function(){this.addEach(arguments)},SortedSet.prototype.unshift=function(){this.addEach(arguments)},SortedSet.prototype.slice=function(start,end){start=start||0,end=end||this.length,start<0&&(start+=this.length),end<0&&(end+=this.length);var sliced=[];if(this.root)for(this.splayIndex(start);this.root.index<end&&(sliced.push(this.root.value),this.root.right);)this.splay(this.root.getNext().value);return sliced},SortedSet.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},SortedSet.prototype.swap=function(start,length,plus){if(void 0===start&&void 0===length)return[];(start=start||0)<0&&(start+=this.length),void 0===length&&(length=1/0);var swapped=[];if(this.root){this.splayIndex(start);for(var i=0;i<length;i++){swapped.push(this.root.value);var next=this.root.getNext();if(this.delete(this.root.value),!next)break;this.splay(next.value)}}return this.addEach(plus),swapped},SortedSet.prototype.splay=function(value){var stub,left,right,temp,root,history;if(this.root){for(stub=left=right=new this.Node,history=new this.Node,root=this.root;;){var comparison=this.contentCompare(value,root.value);if(comparison<0){if(!root.left)break;if(this.contentCompare(value,root.left.value)<0&&(temp=root.left,root.left=temp.right,root.touch(),temp.right=root,temp.touch(),!(root=temp).left))break;(temp=new Node$1).right=root,temp.left=history.left,history.left=temp,right.left=root,right.touch(),right=root,root=root.left}else{if(!(comparison>0))break;if(!root.right)break;if(this.contentCompare(value,root.right.value)>0&&(temp=root.right,root.right=temp.left,root.touch(),temp.left=root,temp.touch(),!(root=temp).right))break;(temp=new Node$1).left=root,temp.right=history.right,history.right=temp,left.right=root,left.touch(),left=root,root=root.right}}for(left.right=root.left,left.touch(),right.left=root.right,right.touch(),root.left=stub.right,root.right=stub.left;history.left;)history.left.right.touch(),history.left=history.left.left;for(;history.right;)history.right.left.touch(),history.right=history.right.right;root.touch(),this.root=root}},SortedSet.prototype.splayIndex=function(index){if(this.root){for(var at=this.root,atIndex=this.root.index;atIndex!==index;)if(atIndex>index&&at.left)atIndex-=1+((at=at.left).right?at.right.length:0);else{if(!(atIndex<index&&at.right))break;atIndex+=1+((at=at.right).left?at.left.length:0)}return this.splay(at.value),this.root.index===index}return!1},SortedSet.prototype.reduce=function(callback,basis,thisp){return this.root&&(basis=this.root.reduce(callback,basis,0,thisp,this)),basis},SortedSet.prototype.reduceRight=function(callback,basis,thisp){return this.root&&(basis=this.root.reduceRight(callback,basis,this.length-1,thisp,this)),basis},SortedSet.prototype.min=function(at){var least=this.findLeast(at);if(least)return least.value},SortedSet.prototype.max=function(at){var greatest=this.findGreatest(at);if(greatest)return greatest.value},SortedSet.prototype.one=function(){return this.min()},SortedSet.prototype.clear=function(){var minus;this.dispatchesRangeChanges&&(minus=this.toArray(),this.dispatchBeforeRangeChange([],minus,0)),this.root=null,this.length=0,this.dispatchesRangeChanges&&this.dispatchRangeChange([],minus,0)},SortedSet.prototype.iterate=function(start,end){return new this.Iterator(this,start,end)},SortedSet.prototype.Iterator=Iterator$1,SortedSet.prototype.summary=function(){return this.root?this.root.summary():"()"},SortedSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeRound,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp),this.root&&this.root.log(charmap,logNode,callback,callback)},SortedSet.prototype.logNode=function(node,log,logBefore){log(" "+node.value)},SortedSet.logCharsets=treeLog,SortedSet.prototype.Node=Node$1,Node$1.prototype.reduce=function(callback,basis,index,thisp,tree,depth){if(depth=depth||0,this.left){var length=this.left.length;basis=this.left.reduce(callback,basis,index,thisp,tree,depth+1),index+=length}return basis=callback.call(thisp,basis,this.value,index,tree,this,depth),index+=1,this.right&&(basis=this.right.reduce(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.reduceRight=function(callback,basis,index,thisp,tree,depth){return depth=depth||0,this.right&&(basis=this.right.reduceRight(callback,basis,index,thisp,tree,depth+1),index-=this.right.length),basis=callback.call(thisp,basis,this.value,this.value,tree,this,depth),index-=1,this.left&&(basis=this.left.reduceRight(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.touch=function(){this.length=1+(this.left?this.left.length:0)+(this.right?this.right.length:0),this.index=this.left?this.left.length:0},Node$1.prototype.checkIntegrity=function(){var length=1;if(length+=this.left?this.left.checkIntegrity():0,length+=this.right?this.right.checkIntegrity():0,this.length!==length)throw new Error("Integrity check failed: "+this.summary());return length},Node$1.prototype.getNext=function(){var node=this;if(node.right){for(node=node.right;node.left;)node=node.left;return node}},Node$1.prototype.getPrevious=function(){var node=this;if(node.left){for(node=node.left;node.right;)node=node.right;return node}},Node$1.prototype.summary=function(){var value=this.value||"-";return value+=" <"+this.length,this.left||this.right?"("+value+" "+(this.left?this.left.summary():"()")+", "+(this.right?this.right.summary():"()")+")":"("+value+")"},Node$1.prototype.log=function(charmap,logNode,log,logAbove){var branch,loggedAbove,loggedOn,loggedBelow,self=this;branch=this.left&&this.right?charmap.intersection:this.left?charmap.branchUp:this.right?charmap.branchDown:charmap.through,this.left&&this.left.log(charmap,logNode,(function(line){loggedAbove?logAbove(charmap.strafe+" "+line):(loggedAbove=!0,logAbove(charmap.fromBelow+charmap.through+line))}),(function(line){logAbove("  "+line)})),logNode(this,(function(line){loggedOn?log((self.right?charmap.strafe:" ")+line):(loggedOn=!0,log(branch+line))}),(function(line){logAbove((self.left?charmap.strafe:" ")+line)})),this.right&&this.right.log(charmap,logNode,(function(line){loggedBelow?log("  "+line):(loggedBelow=!0,log(charmap.fromAbove+charmap.through+line))}),(function(line){log(charmap.strafe+" "+line)}))},Iterator$1.prototype.__iterationObject=null,Object.defineProperty(Iterator$1.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),Iterator$1.prototype.next=function(){var next;return(next=this.prev?this.set.findLeastGreaterThan(this.prev.value):this.set.findLeast())?void 0!==this.end&&this.set.contentCompare(next.value,this.end)>=0?(this._iterationObject.done=!0,this._iterationObject.value=void 0):(this.prev=next,this._iterationObject.value=next.value):(this._iterationObject.done=!0,this._iterationObject.value=void 0),this._iterationObject};var util={radians:function(degrees){return degrees/(180/Math.PI)},degrees:function(radians){return radians*(180/Math.PI)},REarth:6371,WGS84:{a:6378.137,b:6356.752314245,f:1/298.257223563},consoleColors:{reset:"",bright:"",dim:"",underscore:"",blink:"",reverse:"",hidden:"",fg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""},bg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""}}};var vincentys={inverse:function(p1,p2){const φ1=util.radians(p1.y),λ1=util.radians(p1.x),φ2=util.radians(p2.y),λ2=util.radians(p2.x),{a:a,b:b,f:f}=util.WGS84,L=λ2-λ1,tanU1=(1-f)*Math.tan(φ1),cosU1=1/Math.sqrt(1+tanU1*tanU1),sinU1=tanU1*cosU1,tanU2=(1-f)*Math.tan(φ2),cosU2=1/Math.sqrt(1+tanU2*tanU2),sinU2=tanU2*cosU2,antipodal=Math.abs(L)>Math.PI/2||Math.abs(φ2-φ1)>Math.PI/2;let λ=L,sinλ=null,cosλ=null,σ=antipodal?Math.PI:0,sinσ=0,cosσ=antipodal?-1:1,sinSqσ=null,cos2σₘ=1,sinα=null,cosSqα=1,C=null,λʹ=null,iterations=0;do{if(sinλ=Math.sin(λ),cosλ=Math.cos(λ),sinSqσ=cosU2*sinλ*(cosU2*sinλ)+(cosU1*sinU2-sinU1*cosU2*cosλ)*(cosU1*sinU2-sinU1*cosU2*cosλ),Math.abs(sinSqσ)<Number.EPSILON)break;sinσ=Math.sqrt(sinSqσ),cosσ=sinU1*sinU2+cosU1*cosU2*cosλ,σ=Math.atan2(sinσ,cosσ),sinα=cosU1*cosU2*sinλ/sinσ,cosSqα=1-sinα*sinα,cos2σₘ=0!=cosSqα?cosσ-2*sinU1*sinU2/cosSqα:0,C=f/16*cosSqα*(4+f*(4-3*cosSqα)),λʹ=λ,λ=L+(1-C)*f*sinα*(σ+C*sinσ*(cos2σₘ+C*cosσ*(2*cos2σₘ*cos2σₘ-1)));if((antipodal?Math.abs(λ)-Math.PI:Math.abs(λ))>Math.PI)throw new EvalError("λ > π")}while(Math.abs(λ-λʹ)>1e-7&&++iterations<1e3);if(iterations>=1e3)throw new EvalError("Vincenty formula failed to converge");const uSq=cosSqα*(a*a-b*b)/(b*b),B=uSq/1024*(256+uSq*(uSq*(74-47*uSq)-128)),s=b*(1+uSq/16384*(4096+uSq*(uSq*(320-175*uSq)-768)))*(σ-B*sinσ*(cos2σₘ+B/4*(cosσ*(2*cos2σₘ*cos2σₘ-1)-B/6*cos2σₘ*(4*sinσ*sinσ-3)*(4*cos2σₘ*cos2σₘ-3)))),α1=Math.abs(sinSqσ)<Number.EPSILON?0:Math.atan2(cosU2*sinλ,cosU1*sinU2-sinU1*cosU2*cosλ),α2=Math.abs(sinSqσ)<Number.EPSILON?Math.PI:Math.atan2(cosU1*sinλ,-sinU1*cosU2+cosU1*sinU2*cosλ);return{distance:s,initialBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α1),finalBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α2),iterations:iterations}}};class Point{constructor(x,y){Array.isArray(x)?[this.x,this.y,this.r]=[x[y].longitude,x[y].latitude,y]:[this.x,this.y]=[x,y]}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Point",coordinates:[this.x,this.y]}}}toString(){return JSON.stringify(this.geojson())}intersects(other){if(other instanceof Point)return this.x==other.x&&this.y==other.y;if(other instanceof Box)return other.intersects(this);throw"other must be either Point or Box"}distanceEarth(p){return this.distanceEarthFCC(p)}distanceEarthFCC(p){const df=p.y-this.y,dg=p.x-this.x,fm=util.radians((this.y+p.y)/2),k1=111.13209-.566605*Math.cos(2*fm)+.0012*Math.cos(4*fm),k2=111.41513*Math.cos(fm)-.09455*Math.cos(3*fm)+12e-5*Math.cos(5*fm);return Math.sqrt(k1*df*(k1*df)+k2*dg*(k2*dg))}distanceEarthRev(dx,dy){const lon=this.x+util.degrees(dx/util.REarth/Math.cos(util.radians(this.y))),lat=this.y+util.degrees(dy/util.REarth);return new Point(lon,lat)}distanceEarthVincentys(p){return vincentys.inverse(this,p).distance}}class Range{constructor(a,b){[this.a,this.b]=[a,b]}count(){return Math.abs(this.a-this.b)+1}center(){return Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2)}left(){return new Range(Math.min(this.a,this.b),Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2))}right(){return new Range(Math.min(this.a,this.b)+Math.ceil(Math.abs(this.a-this.b)/2),Math.max(this.a,this.b))}contains(p){return this.a<=p&&p<=this.b}toString(){return`${this.a}:${this.b}`}}class Box{constructor(a,b,c,d){if(a instanceof Range){[this.x1,this.y1,this.x2,this.y2]=[1/0,1/0,-1/0,-1/0];for(let i=a.a;i<=a.b;i++)this.x1=Math.min(b.flightPoints[i].x,this.x1),this.y1=Math.min(b.flightPoints[i].y,this.y1),this.x2=Math.max(b.flightPoints[i].x,this.x2),this.y2=Math.max(b.flightPoints[i].y,this.y2)}else[this.x1,this.y1,this.x2,this.y2]=[a,b,c,d]}vertices(){return[new Point(this.x1,this.y1),new Point(this.x2,this.y1),new Point(this.x2,this.y2),new Point(this.x1,this.y2)]}intersects(other){return other instanceof Point?this.x1<=other.x&&this.y1<=other.y&&this.x2>=other.x&&this.y2>=other.y:!(this.x1>other.x2||this.x2<other.x1||this.y1>other.y2||this.y2<other.y1)}area(){return Math.abs(this.x2-this.x1)*Math.abs(this.y2-this.y1)}distance(other){if(this.intersects(other))return 0;let x1,y1,x2,y2;return this.x1>other.x2&&(x1=this.x1),x2=other.x2,this.x2<other.x1&&(x1=this.x2),x2=other.x1,this.y1<other.y2&&(y1=this.y1),y2=other.y2,this.y2>other.y1&&(y1=this.y2),y2=other.y1,void 0===x1&&(x1=this.x1,x2=this.x1),void 0===y1&&(y1=this.y1,y2=this.y1),new Point(x1,y1).distanceEarth(new Point(x2,y2))}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Polygon",coordinates:[[[this.x1,this.y1],[this.x1,this.y2],[this.x2,this.y2],[this.x2,this.y1],[this.x1,this.y1]]]}}}geojson_collection(boxes){let features=[];for(let b in boxes)features.push(boxes[b].geojson(b,{id:b}));return{type:"FeatureCollection",features:features}}toString(){return JSON.stringify(this.geojson())}}var foundation={Point:Point,Range:Range,Box:Box};let id=0;const{Box:Box$1,Point:Point$1,Range:Range$1}=foundation;class Solution{constructor(ranges,opt,parent){ranges.length>opt.scoring.cardinality?this.ranges=ranges.slice(0,opt.scoring.cardinality):this.ranges=ranges,this.opt=opt;for(let _r in this.ranges){const r=parseInt(_r);if(r>0&&this.ranges[r-1].a>this.ranges[r].a&&(this.ranges[r]=new Range$1(Math.max(this.ranges[r-1].a,this.ranges[r].a),this.ranges[r].b)),r<this.ranges.length-1&&this.ranges[r].b>this.ranges[r+1].b&&(this.ranges[r]=new Range$1(this.ranges[r].a,Math.min(this.ranges[r+1].b,this.ranges[r].b))),this.ranges[r].a>this.ranges[r].b)throw console.log(this.ranges,parent.ranges),"error"}this.boxes=[];for(let r in this.ranges)this.boxes[r]=new Box$1(this.ranges[r],opt.flight);this.score=void 0,this.bound=void 0,this.id=id++,this.opt.config&&this.opt.config.debug&&(this.parent=parent,this.trace())}do_branch(){let div=0;for(let r in this.ranges)this.ranges[r].count()>this.ranges[div].count()&&(div=parseInt(r));for(let r in this.ranges)this.ranges[r].count()>1&&this.boxes[r].area()>8*this.boxes[div].area()&&(div=parseInt(r));if(1==this.ranges[div].count())return[];let subsolutions=[];for(let i of[this.ranges[div].left(),this.ranges[div].right()]){let subranges=[];for(let r in this.ranges)subranges[r]=r!=div?this.ranges[r]:i;subsolutions.push(new Solution(subranges,this.opt,this))}return subsolutions}do_bound(){this.bound=this.opt.scoring.bound(this.ranges,this.boxes,this.opt),this.trace()}do_score(){for(let r in this.ranges)if(r<this.ranges.length-1&&this.ranges[r].center()>=this.ranges[parseInt(r)+1].center())return void(this.score=0);let tp=[];for(let r in this.ranges)tp[r]=new Point$1(this.opt.flight.filtered,this.ranges[r].center());this.scoreInfo=this.opt.scoring.score(tp,this.opt),this.score=this.scoreInfo.score,this.trace()}contentEquals(self,other){return self.id===other.id}contentCompare(self,other){return self.bound<other.bound?-1:self.bound>other.bound?1:self.id<other.id?-1:self.id>other.id?1:0}geojson(){let features=[];if(this.opt.config&&this.opt.config.debug)for(let r in this.ranges)features.push(new Box$1(this.ranges[r],this.opt.flight).geojson("box"+r,{id:"box"+r,area:new Box$1(this.ranges[r],this.opt.flight).area(),a:this.ranges[r].a,b:this.ranges[r].b}));try{const tp=this.scoreInfo.tp;for(let r of[0,1,2])features.push(tp[r].geojson("tp"+r,{id:"tp"+r,r:tp[r].r,timestamp:this.opt.flight.filtered[tp[r].r].timestamp})),(r<2||this.scoreInfo.cp)&&features.push({type:"Feature",id:"seg"+r,properties:{id:"seg"+r,stroke:"yellow","stroke-width":4,d:tp[r].distanceEarth(tp[(r+1)%3])},geometry:{type:"LineString",coordinates:[[tp[r].x,tp[r].y],[tp[(r+1)%3].x,tp[(r+1)%3].y]],style:{stroke:"yellow","stroke-width":4}}})}catch(e){}try{if(void 0!==this.scoreInfo.ep||void 0!==this.scoreInfo.cp){const cp=this.scoreInfo.cp,tp=this.scoreInfo.tp,ep=this.scoreInfo.ep;if(cp&&cp.in&&cp.out){for(let r of["in","out"])features.push(cp[r].geojson("cp_"+r,{id:"cp_"+r,r:cp[r].r,timestamp:this.opt.flight.filtered[cp[r].r].timestamp}));features.push({type:"Feature",id:"closing",properties:{id:"closing",stroke:"green","stroke-width":3,d:cp.in.distanceEarth(cp.out)},geometry:{type:"LineString",coordinates:[[cp.in.x,cp.in.y],[cp.out.x,cp.out.y]],style:{stroke:"green","stroke-width":3}}})}if(ep&&ep.start&&ep.finish){for(let r of["start","finish"])features.push(ep[r].geojson("ep_"+r,{id:"ep_"+r,r:ep[r].r,timestamp:this.opt.flight.filtered[ep[r].r].timestamp}));features.push({type:"Feature",id:"seg_in",properties:{id:"seg_in",stroke:"gold","stroke-width":3,d:ep.start.distanceEarth(tp[0])},geometry:{type:"LineString",coordinates:[[ep.start.x,ep.start.y],[tp[0].x,tp[0].y]],style:{stroke:"green","stroke-width":3}}}),features.push({type:"Feature",id:"seg_out",properties:{id:"seg_out",stroke:"gold","stroke-width":3,d:ep.finish.distanceEarth(tp[2])},geometry:{type:"LineString",coordinates:[[tp[2].x,tp[2].y],[ep.finish.x,ep.finish.y]],style:{stroke:"green","stroke-width":3}}})}}}catch(e){}for(let li in this.opt.flight.ll){const l=this.opt.flight.ll[li];features.push(this.opt.flight.flightPoints[l.launch].geojson("launch"+li,{id:"launch"+li,r:l.launch,timestamp:this.opt.flight.filtered[l.launch].timestamp})),features.push(this.opt.flight.flightPoints[l.landing].geojson("land"+li,{id:"land"+li,r:l.landing,timestamp:this.opt.flight.filtered[l.landing].timestamp}))}if(!this.opt.config||!this.opt.config.noflight){let flightData=[];for(let r of this.opt.flight.filtered)flightData.push([r.longitude,r.latitude]);features.push({type:"Feature",id:"flight",properties:{id:"flight"},geometry:{type:"LineString",coordinates:flightData}})}return{type:"FeatureCollection",properties:{name:"EPSG:3857",id:this.id,score:void 0!==this.score?this.score:void 0,bound:void 0!==this.currentUpperBound?this.currentUpperBound:this.bound,optimal:this.optimal,processedTime:this.time/1e3,processedSolutions:this.processed,type:this.opt.scoring.name,code:this.opt.scoring.code},features:features}}toString(){let s=""+this.opt.scoring.name;if(this.score&&(s+=` ${this.opt.scoring.rounding(this.score)} points`),this.scoreInfo&&(s+=` ${this.opt.scoring.rounding(this.scoreInfo.distance)}km`),s+=` ( <${this.bound.toFixed(4)} )`,this.opt.config&&this.opt.config.debug){s+=` { id: ${this.id} `;for(let r of this.ranges)s+=" "+r.toString();s+=" } "}return s}trace(msg){if(!this.opt.config.trace||!process.stdout)return;const trace=this.opt.config.trace.split(",");if(trace[0]<0){if(this.id%parseInt(trace[1])!=0)return}else for(let i in this.ranges)if(!this.ranges[i].contains(trace[i]))return;let r=`${msg||""} solution tracing: ${this.id} ${this.opt.scoring.name} `;for(let i in this.ranges)r+=this.ranges[i]+" ";this.bound&&(r+=`bound: ${this.bound} `),this.score&&(r+=`score: ${this.score} `),process.stdout.write("\n"+r+"\n"),this.opt.config.env.fs.writeFileSync(`debug-${this.id}.json`,JSON.stringify(this.geojson({debug:!0})))}}var solution_Solution=Solution;class FlatQueue{constructor(){this.ids=[],this.values=[],this.length=0}clear(){this.length=0}push(id,value){let pos=this.length++;for(this.ids[pos]=id,this.values[pos]=value;pos>0;){const parent=pos-1>>1,parentValue=this.values[parent];if(value>=parentValue)break;this.ids[pos]=this.ids[parent],this.values[pos]=parentValue,pos=parent}this.ids[pos]=id,this.values[pos]=value}pop(){if(0===this.length)return;const top=this.ids[0];if(this.length--,this.length>0){const id=this.ids[0]=this.ids[this.length],value=this.values[0]=this.values[this.length],halfLength=this.length>>1;let pos=0;for(;pos<halfLength;){let left=1+(pos<<1);const right=left+1;let bestIndex=this.ids[left],bestValue=this.values[left];const rightValue=this.values[right];if(right<this.length&&rightValue<bestValue&&(left=right,bestIndex=this.ids[right],bestValue=rightValue),bestValue>=value)break;this.ids[pos]=bestIndex,this.values[pos]=bestValue,pos=left}this.ids[pos]=id,this.values[pos]=value}return top}peek(){return this.ids[0]}peekValue(){return this.values[0]}}const ARRAY_TYPES=[Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array];class Flatbush{static from(data){if(!(data instanceof ArrayBuffer))throw new Error("Data must be an instance of ArrayBuffer.");const[magic,versionAndType]=new Uint8Array(data,0,2);if(251!==magic)throw new Error("Data does not appear to be in a Flatbush format.");if(versionAndType>>4!=3)throw new Error(`Got v${versionAndType>>4} data when expected v3.`);const[nodeSize]=new Uint16Array(data,2,1),[numItems]=new Uint32Array(data,4,1);return new Flatbush(numItems,nodeSize,ARRAY_TYPES[15&versionAndType],data)}constructor(numItems,nodeSize=16,ArrayType=Float64Array,data){if(void 0===numItems)throw new Error("Missing required argument: numItems.");if(isNaN(numItems)||numItems<=0)throw new Error(`Unpexpected numItems value: ${numItems}.`);this.numItems=+numItems,this.nodeSize=Math.min(Math.max(+nodeSize,2),65535);let n=numItems,numNodes=n;this._levelBounds=[4*n];do{n=Math.ceil(n/this.nodeSize),numNodes+=n,this._levelBounds.push(4*numNodes)}while(1!==n);this.ArrayType=ArrayType||Float64Array,this.IndexArrayType=numNodes<16384?Uint16Array:Uint32Array;const arrayTypeIndex=ARRAY_TYPES.indexOf(this.ArrayType),nodesByteSize=4*numNodes*this.ArrayType.BYTES_PER_ELEMENT;if(arrayTypeIndex<0)throw new Error(`Unexpected typed array class: ${ArrayType}.`);data&&data instanceof ArrayBuffer?(this.data=data,this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=4*numNodes,this.minX=this._boxes[this._pos-4],this.minY=this._boxes[this._pos-3],this.maxX=this._boxes[this._pos-2],this.maxY=this._boxes[this._pos-1]):(this.data=new ArrayBuffer(8+nodesByteSize+numNodes*this.IndexArrayType.BYTES_PER_ELEMENT),this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=0,this.minX=1/0,this.minY=1/0,this.maxX=-1/0,this.maxY=-1/0,new Uint8Array(this.data,0,2).set([251,48+arrayTypeIndex]),new Uint16Array(this.data,2,1)[0]=nodeSize,new Uint32Array(this.data,4,1)[0]=numItems),this._queue=new FlatQueue}add(minX,minY,maxX,maxY){const index=this._pos>>2;return this._indices[index]=index,this._boxes[this._pos++]=minX,this._boxes[this._pos++]=minY,this._boxes[this._pos++]=maxX,this._boxes[this._pos++]=maxY,minX<this.minX&&(this.minX=minX),minY<this.minY&&(this.minY=minY),maxX>this.maxX&&(this.maxX=maxX),maxY>this.maxY&&(this.maxY=maxY),index}finish(){if(this._pos>>2!==this.numItems)throw new Error(`Added ${this._pos>>2} items when expected ${this.numItems}.`);if(this.numItems<=this.nodeSize)return this._boxes[this._pos++]=this.minX,this._boxes[this._pos++]=this.minY,this._boxes[this._pos++]=this.maxX,void(this._boxes[this._pos++]=this.maxY);const width=this.maxX-this.minX,height=this.maxY-this.minY,hilbertValues=new Uint32Array(this.numItems);for(let i=0;i<this.numItems;i++){let pos=4*i;const minX=this._boxes[pos++],minY=this._boxes[pos++],maxX=this._boxes[pos++],maxY=this._boxes[pos++],x=Math.floor(65535*((minX+maxX)/2-this.minX)/width),y=Math.floor(65535*((minY+maxY)/2-this.minY)/height);hilbertValues[i]=hilbert(x,y)}!function sort(values,boxes,indices,left,right,nodeSize){if(Math.floor(left/nodeSize)>=Math.floor(right/nodeSize))return;const pivot=values[left+right>>1];let i=left-1,j=right+1;for(;;){do{i++}while(values[i]<pivot);do{j--}while(values[j]>pivot);if(i>=j)break;swap(values,boxes,indices,i,j)}sort(values,boxes,indices,left,j,nodeSize),sort(values,boxes,indices,j+1,right,nodeSize)}(hilbertValues,this._boxes,this._indices,0,this.numItems-1,this.nodeSize);for(let i=0,pos=0;i<this._levelBounds.length-1;i++){const end=this._levelBounds[i];for(;pos<end;){const nodeIndex=pos;let nodeMinX=1/0,nodeMinY=1/0,nodeMaxX=-1/0,nodeMaxY=-1/0;for(let i=0;i<this.nodeSize&&pos<end;i++)nodeMinX=Math.min(nodeMinX,this._boxes[pos++]),nodeMinY=Math.min(nodeMinY,this._boxes[pos++]),nodeMaxX=Math.max(nodeMaxX,this._boxes[pos++]),nodeMaxY=Math.max(nodeMaxY,this._boxes[pos++]);this._indices[this._pos>>2]=nodeIndex,this._boxes[this._pos++]=nodeMinX,this._boxes[this._pos++]=nodeMinY,this._boxes[this._pos++]=nodeMaxX,this._boxes[this._pos++]=nodeMaxY}}}search(minX,minY,maxX,maxY,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const queue=[],results=[];for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2];maxX<this._boxes[pos]||(maxY<this._boxes[pos+1]||minX>this._boxes[pos+2]||minY>this._boxes[pos+3]||(nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&results.push(index):queue.push(index)))}nodeIndex=queue.pop()}return results}neighbors(x,y,maxResults=1/0,maxDistance=1/0,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const q=this._queue,results=[],maxDistSquared=maxDistance*maxDistance;for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2],dx=axisDist(x,this._boxes[pos],this._boxes[pos+2]),dy=axisDist(y,this._boxes[pos+1],this._boxes[pos+3]),dist=dx*dx+dy*dy;nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&q.push(-index-1,dist):q.push(index,dist)}for(;q.length&&q.peek()<0;){if(q.peekValue()>maxDistSquared)return q.clear(),results;if(results.push(-q.pop()-1),results.length===maxResults)return q.clear(),results}nodeIndex=q.pop()}return q.clear(),results}}function axisDist(k,min,max){return k<min?min-k:k<=max?0:k-max}function upperBound(value,arr){let i=0,j=arr.length-1;for(;i<j;){const m=i+j>>1;arr[m]>value?j=m:i=m+1}return arr[i]}function swap(values,boxes,indices,i,j){const temp=values[i];values[i]=values[j],values[j]=temp;const k=4*i,m=4*j,a=boxes[k],b=boxes[k+1],c=boxes[k+2],d=boxes[k+3];boxes[k]=boxes[m],boxes[k+1]=boxes[m+1],boxes[k+2]=boxes[m+2],boxes[k+3]=boxes[m+3],boxes[m]=a,boxes[m+1]=b,boxes[m+2]=c,boxes[m+3]=d;const e=indices[i];indices[i]=indices[j],indices[j]=e}function hilbert(x,y){let a=x^y,b=65535^a,c=65535^(x|y),d=x&(65535^y),A=a|b>>1,B=a>>1^a,C=c>>1^b&d>>1^c,D=a&c>>1^d>>1^d;a=A,b=B,c=C,d=D,A=a&a>>2^b&b>>2,B=a&b>>2^b&(a^b)>>2,C^=a&c>>2^b&d>>2,D^=b&c>>2^(a^b)&d>>2,a=A,b=B,c=C,d=D,A=a&a>>4^b&b>>4,B=a&b>>4^b&(a^b)>>4,C^=a&c>>4^b&d>>4,D^=b&c>>4^(a^b)&d>>4,a=A,b=B,c=C,d=D,C^=a&c>>8^b&d>>8,D^=b&c>>8^(a^b)&d>>8,a=C^C>>1,b=D^D>>1;let i0=x^y,i1=b|65535^(i0|a);return i0=16711935&(i0|i0<<8),i0=252645135&(i0|i0<<4),i0=858993459&(i0|i0<<2),i0=1431655765&(i0|i0<<1),i1=16711935&(i1|i1<<8),i1=252645135&(i1|i1<<4),i1=858993459&(i1|i1<<2),i1=1431655765&(i1|i1<<1),(i1<<1|i0)>>>0}function quickselect(arr,k,left,right,compare){!function quickselectStep(arr,k,left,right,compare){for(;right>left;){if(right-left>600){var n=right-left+1,m=k-left+1,z=Math.log(n),s=.5*Math.exp(2*z/3),sd=.5*Math.sqrt(z*s*(n-s)/n)*(m-n/2<0?-1:1);quickselectStep(arr,k,Math.max(left,Math.floor(k-m*s/n+sd)),Math.min(right,Math.floor(k+(n-m)*s/n+sd)),compare)}var t=arr[k],i=left,j=right;for(swap$1(arr,left,k),compare(arr[right],t)>0&&swap$1(arr,left,right);i<j;){for(swap$1(arr,i,j),i++,j--;compare(arr[i],t)<0;)i++;for(;compare(arr[j],t)>0;)j--}0===compare(arr[left],t)?swap$1(arr,left,j):swap$1(arr,++j,right),j<=k&&(left=j+1),k<=j&&(right=j-1)}}(arr,k,left||0,right||arr.length-1,compare||defaultCompare)}function swap$1(arr,i,j){var tmp=arr[i];arr[i]=arr[j],arr[j]=tmp}function defaultCompare(a,b){return a<b?-1:a>b?1:0}class RBush{constructor(maxEntries=9){this._maxEntries=Math.max(4,maxEntries),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()}all(){return this._all(this.data,[])}search(bbox){let node=this.data;const result=[];if(!intersects(bbox,node))return result;const toBBox=this.toBBox,nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?toBBox(child):child;intersects(bbox,childBBox)&&(node.leaf?result.push(child):contains(bbox,childBBox)?this._all(child,result):nodesToSearch.push(child))}node=nodesToSearch.pop()}return result}collides(bbox){let node=this.data;if(!intersects(bbox,node))return!1;const nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?this.toBBox(child):child;if(intersects(bbox,childBBox)){if(node.leaf||contains(bbox,childBBox))return!0;nodesToSearch.push(child)}}node=nodesToSearch.pop()}return!1}load(data){if(!data||!data.length)return this;if(data.length<this._minEntries){for(let i=0;i<data.length;i++)this.insert(data[i]);return this}let node=this._build(data.slice(),0,data.length-1,0);if(this.data.children.length)if(this.data.height===node.height)this._splitRoot(this.data,node);else{if(this.data.height<node.height){const tmpNode=this.data;this.data=node,node=tmpNode}this._insert(node,this.data.height-node.height-1,!0)}else this.data=node;return this}insert(item){return item&&this._insert(item,this.data.height-1),this}clear(){return this.data=createNode([]),this}remove(item,equalsFn){if(!item)return this;let node=this.data;const bbox=this.toBBox(item),path=[],indexes=[];let i,parent,goingUp;for(;node||path.length;){if(node||(node=path.pop(),parent=path[path.length-1],i=indexes.pop(),goingUp=!0),node.leaf){const index=findItem(item,node.children,equalsFn);if(-1!==index)return node.children.splice(index,1),path.push(node),this._condense(path),this}goingUp||node.leaf||!contains(node,bbox)?parent?(i++,node=parent.children[i],goingUp=!1):node=null:(path.push(node),indexes.push(i),i=0,parent=node,node=node.children[0])}return this}toBBox(item){return item}compareMinX(a,b){return a.minX-b.minX}compareMinY(a,b){return a.minY-b.minY}toJSON(){return this.data}fromJSON(data){return this.data=data,this}_all(node,result){const nodesToSearch=[];for(;node;)node.leaf?result.push(...node.children):nodesToSearch.push(...node.children),node=nodesToSearch.pop();return result}_build(items,left,right,height){const N=right-left+1;let node,M=this._maxEntries;if(N<=M)return node=createNode(items.slice(left,right+1)),calcBBox(node,this.toBBox),node;height||(height=Math.ceil(Math.log(N)/Math.log(M)),M=Math.ceil(N/Math.pow(M,height-1))),node=createNode([]),node.leaf=!1,node.height=height;const N2=Math.ceil(N/M),N1=N2*Math.ceil(Math.sqrt(M));multiSelect(items,left,right,N1,this.compareMinX);for(let i=left;i<=right;i+=N1){const right2=Math.min(i+N1-1,right);multiSelect(items,i,right2,N2,this.compareMinY);for(let j=i;j<=right2;j+=N2){const right3=Math.min(j+N2-1,right2);node.children.push(this._build(items,j,right3,height-1))}}return calcBBox(node,this.toBBox),node}_chooseSubtree(bbox,node,level,path){for(;path.push(node),!node.leaf&&path.length-1!==level;){let targetNode,minArea=1/0,minEnlargement=1/0;for(let i=0;i<node.children.length;i++){const child=node.children[i],area=bboxArea(child),enlargement=(a=bbox,b=child,(Math.max(b.maxX,a.maxX)-Math.min(b.minX,a.minX))*(Math.max(b.maxY,a.maxY)-Math.min(b.minY,a.minY))-area);enlargement<minEnlargement?(minEnlargement=enlargement,minArea=area<minArea?area:minArea,targetNode=child):enlargement===minEnlargement&&area<minArea&&(minArea=area,targetNode=child)}node=targetNode||node.children[0]}var a,b;return node}_insert(item,level,isNode){const bbox=isNode?item:this.toBBox(item),insertPath=[],node=this._chooseSubtree(bbox,this.data,level,insertPath);for(node.children.push(item),extend(node,bbox);level>=0&&insertPath[level].children.length>this._maxEntries;)this._split(insertPath,level),level--;this._adjustParentBBoxes(bbox,insertPath,level)}_split(insertPath,level){const node=insertPath[level],M=node.children.length,m=this._minEntries;this._chooseSplitAxis(node,m,M);const splitIndex=this._chooseSplitIndex(node,m,M),newNode=createNode(node.children.splice(splitIndex,node.children.length-splitIndex));newNode.height=node.height,newNode.leaf=node.leaf,calcBBox(node,this.toBBox),calcBBox(newNode,this.toBBox),level?insertPath[level-1].children.push(newNode):this._splitRoot(node,newNode)}_splitRoot(node,newNode){this.data=createNode([node,newNode]),this.data.height=node.height+1,this.data.leaf=!1,calcBBox(this.data,this.toBBox)}_chooseSplitIndex(node,m,M){let index,minOverlap=1/0,minArea=1/0;for(let i=m;i<=M-m;i++){const bbox1=distBBox(node,0,i,this.toBBox),bbox2=distBBox(node,i,M,this.toBBox),overlap=intersectionArea(bbox1,bbox2),area=bboxArea(bbox1)+bboxArea(bbox2);overlap<minOverlap?(minOverlap=overlap,index=i,minArea=area<minArea?area:minArea):overlap===minOverlap&&area<minArea&&(minArea=area,index=i)}return index||M-m}_chooseSplitAxis(node,m,M){const compareMinX=node.leaf?this.compareMinX:compareNodeMinX,compareMinY=node.leaf?this.compareMinY:compareNodeMinY;this._allDistMargin(node,m,M,compareMinX)<this._allDistMargin(node,m,M,compareMinY)&&node.children.sort(compareMinX)}_allDistMargin(node,m,M,compare){node.children.sort(compare);const toBBox=this.toBBox,leftBBox=distBBox(node,0,m,toBBox),rightBBox=distBBox(node,M-m,M,toBBox);let margin=bboxMargin(leftBBox)+bboxMargin(rightBBox);for(let i=m;i<M-m;i++){const child=node.children[i];extend(leftBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(leftBBox)}for(let i=M-m-1;i>=m;i--){const child=node.children[i];extend(rightBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(rightBBox)}return margin}_adjustParentBBoxes(bbox,path,level){for(let i=level;i>=0;i--)extend(path[i],bbox)}_condense(path){for(let siblings,i=path.length-1;i>=0;i--)0===path[i].children.length?i>0?(siblings=path[i-1].children,siblings.splice(siblings.indexOf(path[i]),1)):this.clear():calcBBox(path[i],this.toBBox)}}function findItem(item,items,equalsFn){if(!equalsFn)return items.indexOf(item);for(let i=0;i<items.length;i++)if(equalsFn(item,items[i]))return i;return-1}function calcBBox(node,toBBox){distBBox(node,0,node.children.length,toBBox,node)}function distBBox(node,k,p,toBBox,destNode){destNode||(destNode=createNode(null)),destNode.minX=1/0,destNode.minY=1/0,destNode.maxX=-1/0,destNode.maxY=-1/0;for(let i=k;i<p;i++){const child=node.children[i];extend(destNode,node.leaf?toBBox(child):child)}return destNode}function extend(a,b){return a.minX=Math.min(a.minX,b.minX),a.minY=Math.min(a.minY,b.minY),a.maxX=Math.max(a.maxX,b.maxX),a.maxY=Math.max(a.maxY,b.maxY),a}function compareNodeMinX(a,b){return a.minX-b.minX}function compareNodeMinY(a,b){return a.minY-b.minY}function bboxArea(a){return(a.maxX-a.minX)*(a.maxY-a.minY)}function bboxMargin(a){return a.maxX-a.minX+(a.maxY-a.minY)}function intersectionArea(a,b){const minX=Math.max(a.minX,b.minX),minY=Math.max(a.minY,b.minY),maxX=Math.min(a.maxX,b.maxX),maxY=Math.min(a.maxY,b.maxY);return Math.max(0,maxX-minX)*Math.max(0,maxY-minY)}function contains(a,b){return a.minX<=b.minX&&a.minY<=b.minY&&b.maxX<=a.maxX&&b.maxY<=a.maxY}function intersects(a,b){return b.minX<=a.maxX&&b.minY<=a.maxY&&b.maxX>=a.minX&&b.maxY>=a.minY}function createNode(children){return{children:children,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function multiSelect(arr,left,right,n,compare){const stack=[left,right];for(;stack.length;){if((right=stack.pop())-(left=stack.pop())<=n)continue;const mid=left+Math.ceil((right-left)/n/2)*n;quickselect(arr,mid,left,right,compare),stack.push(left,mid,mid,right)}}var x,quickselect$1=createCommonjsModule((function(module,exports){module.exports=function(){function quickselect(arr,k,left,right,compare){quickselectStep(arr,k,left||0,right||arr.length-1,compare||defaultCompare)}function quickselectStep(arr,k,left,right,compare){for(;right>left;){if(right-left>600){var n=right-left+1,m=k-left+1,z=Math.log(n),s=.5*Math.exp(2*z/3),sd=.5*Math.sqrt(z*s*(n-s)/n)*(m-n/2<0?-1:1);quickselectStep(arr,k,Math.max(left,Math.floor(k-m*s/n+sd)),Math.min(right,Math.floor(k+(n-m)*s/n+sd)),compare)}var t=arr[k],i=left,j=right;for(swap(arr,left,k),compare(arr[right],t)>0&&swap(arr,left,right);i<j;){for(swap(arr,i,j),i++,j--;compare(arr[i],t)<0;)i++;for(;compare(arr[j],t)>0;)j--}0===compare(arr[left],t)?swap(arr,left,j):swap(arr,++j,right),j<=k&&(left=j+1),k<=j&&(right=j-1)}}function swap(arr,i,j){var tmp=arr[i];arr[i]=arr[j],arr[j]=tmp}function defaultCompare(a,b){return a<b?-1:a>b?1:0}return quickselect}()})),dist=createCommonjsModule((function(module,exports){Object.defineProperty(exports,"__esModule",{value:!0});var nodePool=[],freeNode=function(node){return nodePool.push(node)},freeAllNode=function(node){node&&(freeNode(node),isLeaf(node)||node.children.forEach(freeAllNode))},allowNode=function(children){var node=nodePool.pop();return node?(node.children=children,node.height=1,node.leaf=!0,node.minX=1/0,node.minY=1/0,node.minZ=1/0,node.maxX=-1/0,node.maxY=-1/0,node.maxZ=-1/0):node={children:children,height:1,leaf:!0,minX:1/0,minY:1/0,minZ:1/0,maxX:-1/0,maxY:-1/0,maxZ:-1/0},node},distNodePool=[],allowDistNode=function(dist,node){var heapNode=distNodePool.pop();return heapNode?(heapNode.dist=dist,heapNode.node=node):heapNode={dist:dist,node:node},heapNode},isLeaf=function(node){return node.leaf},isLeafChild=function(node,child){return node.leaf},findItem=function(item,items,equalsFn){if(!equalsFn)return items.indexOf(item);for(var i=0;i<items.length;i++)if(equalsFn(item,items[i]))return i;return-1},calcBBox=function(node){distBBox(node,0,node.children.length,node)},distBBox=function(node,k,p,destNode){var dNode=destNode;dNode?(dNode.minX=1/0,dNode.minY=1/0,dNode.minZ=1/0,dNode.maxX=-1/0,dNode.maxY=-1/0,dNode.maxZ=-1/0):dNode=allowNode([]);for(var i=k,child=void 0;i<p;i++)child=node.children[i],extend(dNode,child);return dNode},extend=function(a,b){return a.minX=Math.min(a.minX,b.minX),a.minY=Math.min(a.minY,b.minY),a.minZ=Math.min(a.minZ,b.minZ),a.maxX=Math.max(a.maxX,b.maxX),a.maxY=Math.max(a.maxY,b.maxY),a.maxZ=Math.max(a.maxZ,b.maxZ),a},bboxVolume=function(a){return(a.maxX-a.minX)*(a.maxY-a.minY)*(a.maxZ-a.minZ)},bboxMargin=function(a){return a.maxX-a.minX+(a.maxY-a.minY)+(a.maxZ-a.minZ)},contains=function(a,b){return a.minX<=b.minX&&a.minY<=b.minY&&a.minZ<=b.minZ&&b.maxX<=a.maxX&&b.maxY<=a.maxY&&b.maxZ<=a.maxZ};exports.intersects=function(a,b){return b.minX<=a.maxX&&b.minY<=a.maxY&&b.minZ<=a.maxZ&&b.maxX>=a.minX&&b.maxY>=a.minY&&b.maxZ>=a.minZ},exports.boxRayIntersects=function(box,ox,oy,oz,idx,idy,idz){var tx0=(box.minX-ox)*idx,tx1=(box.maxX-ox)*idx,ty0=(box.minY-oy)*idy,ty1=(box.maxY-oy)*idy,tz0=(box.minZ-oz)*idz,tz1=(box.maxZ-oz)*idz,z0=Math.min(tz0,tz1),z1=Math.max(tz0,tz1),y0=Math.min(ty0,ty1),y1=Math.max(ty0,ty1),x0=Math.min(tx0,tx1),x1=Math.max(tx0,tx1),tmin=Math.max(0,x0,y0,z0);return Math.min(x1,y1,z1)>=tmin?tmin:1/0};var multiSelect=function(arr,left,right,n,compare){for(var mid,stack=[left,right];stack.length;)(right=stack.pop())-(left=stack.pop())<=n||(mid=left+Math.ceil((right-left)/n/2)*n,quickselect$1(arr,mid,left,right,compare),stack.push(left,mid,mid,right))},compareMinX=function(a,b){return a.minX-b.minX},compareMinY=function(a,b){return a.minY-b.minY},compareMinZ=function(a,b){return a.minZ-b.minZ},RBush3D=function(){function RBush3D(maxEntries){void 0===maxEntries&&(maxEntries=16),this.maxEntries=Math.max(maxEntries,8),this.minEntries=Math.max(4,Math.ceil(.4*this.maxEntries)),this.clear()}return RBush3D.alloc=function(){return this.pool.pop()||new this},RBush3D.free=function(rbush){rbush.clear(),this.pool.push(rbush)},RBush3D.prototype.search=function(bbox){var node=this.data,result=[];if(!exports.intersects(bbox,node))return result;for(var nodesToSearch=[];node;){for(var i=0,len=node.children.length;i<len;i++){var child=node.children[i];exports.intersects(bbox,child)&&(isLeafChild(node)?result.push(child):contains(bbox,child)?this._all(child,result):nodesToSearch.push(child))}node=nodesToSearch.pop()}return result},RBush3D.prototype.collides=function(bbox){var node=this.data;if(!exports.intersects(bbox,node))return!1;for(var nodesToSearch=[];node;){for(var i=0,len=node.children.length;i<len;i++){var child=node.children[i];if(exports.intersects(bbox,child)){if(isLeafChild(node)||contains(bbox,child))return!0;nodesToSearch.push(child)}}node=nodesToSearch.pop()}return!1},RBush3D.prototype.raycastInv=function(ox,oy,oz,idx,idy,idz,maxLen){void 0===maxLen&&(maxLen=1/0);var node=this.data;if(idx===1/0&&idy===1/0&&idz===1/0)return allowDistNode(1/0,void 0);if(exports.boxRayIntersects(node,ox,oy,oz,idx,idy,idz)===1/0)return allowDistNode(1/0,void 0);for(var result,heap=[allowDistNode(0,node)],swap=function(a,b){var t=heap[a];heap[a]=heap[b],heap[b]=t},pop=function(){var top=heap[0],newLen=heap.length-1;heap[0]=heap[newLen],heap.length=newLen;for(var idx=0;;){var left=idx<<1|1;if(left>=newLen)break;var right=left+1;if(right<newLen&&heap[right].dist<heap[left].dist&&(left=right),heap[idx].dist<heap[left].dist)break;swap(idx,left),idx=left}return function(node){distNodePool.push(node)}(top),top.node},push=function(dist,node){var idx=heap.length;for(heap.push(allowDistNode(dist,node));idx>0;){var p=idx-1>>1;if(heap[p].dist<=heap[idx].dist)break;swap(idx,p),idx=p}},dist=maxLen;heap.length&&heap[0].dist<dist;)for(var i=0,len=(node=pop()).children.length;i<len;i++){var child=node.children[i],d=exports.boxRayIntersects(child,ox,oy,oz,idx,idy,idz);if(isLeafChild(node)){if(d<dist){if(0===d)return allowDistNode(d,child);dist=d,result=child}}else push(d,child)}return allowDistNode(dist<maxLen?dist:1/0,result)},RBush3D.prototype.raycast=function(ox,oy,oz,dx,dy,dz,maxLen){return void 0===maxLen&&(maxLen=1/0),this.raycastInv(ox,oy,oz,1/dx,1/dy,1/dz,maxLen)},RBush3D.prototype.all=function(){return this._all(this.data,[])},RBush3D.prototype.load=function(data){if(!data||!data.length)return this;if(data.length<this.minEntries){for(var i=0,len=data.length;i<len;i++)this.insert(data[i]);return this}var node=this.build(data.slice(),0,data.length-1,0);if(this.data.children.length)if(this.data.height===node.height)this.splitRoot(this.data,node);else{if(this.data.height<node.height){var tmpNode=this.data;this.data=node,node=tmpNode}this._insert(node,this.data.height-node.height-1,!0)}else this.data=node;return this},RBush3D.prototype.insert=function(item){return item&&this._insert(item,this.data.height-1),this},RBush3D.prototype.clear=function(){return this.data&&freeAllNode(this.data),this.data=allowNode([]),this},RBush3D.prototype.remove=function(item,equalsFn){if(!item)return this;for(var index,parent,node=this.data,i=0,goingUp=!1,path=[],indexes=[];node||path.length;){if(node||(node=path.pop(),i=indexes.pop(),parent=path[path.length-1],goingUp=!0),isLeaf(node)&&-1!==(index=findItem(item,node.children,equalsFn)))return node.children.splice(index,1),path.push(node),this.condense(path),this;goingUp||isLeaf(node)||!contains(node,item)?parent?(i++,node=parent.children[i],goingUp=!1):node=void 0:(path.push(node),indexes.push(i),i=0,parent=node,node=node.children[0])}return this},RBush3D.prototype.toJSON=function(){return this.data},RBush3D.prototype.fromJSON=function(data){return freeAllNode(this.data),this.data=data,this},RBush3D.prototype.build=function(items,left,right,height){var node,N=right-left+1,M=this.maxEntries;if(N<=M)return node=allowNode(items.slice(left,right+1)),calcBBox(node),node;height||(height=Math.ceil(Math.log(N)/Math.log(M)),M=Math.ceil(N/Math.pow(M,height-1))),(node=allowNode([])).leaf=!1,node.height=height;var N3=Math.ceil(N/M),N2=N3*Math.ceil(Math.pow(M,2/3)),N1=N3*Math.ceil(Math.pow(M,1/3));multiSelect(items,left,right,N1,compareMinX);for(var i=left;i<=right;i+=N1){var right2=Math.min(i+N1-1,right);multiSelect(items,i,right2,N2,compareMinY);for(var j=i;j<=right2;j+=N2){var right3=Math.min(j+N2-1,right2);multiSelect(items,j,right3,N3,compareMinZ);for(var k=j;k<=right3;k+=N3){var right4=Math.min(k+N3-1,right3);node.children.push(this.build(items,k,right4,height-1))}}}return calcBBox(node),node},RBush3D.prototype._all=function(node,result){for(var nodesToSearch=[];node;)isLeaf(node)?result.push.apply(result,node.children):nodesToSearch.push.apply(nodesToSearch,node.children),node=nodesToSearch.pop();return result},RBush3D.prototype.chooseSubtree=function(bbox,node,level,path){for(var minVolume,minEnlargement,targetNode,a,b,minX,minY,minZ;path.push(node),!isLeaf(node)&&path.length-1!==level;){minVolume=minEnlargement=1/0;for(var i=0,len=node.children.length;i<len;i++){var child=node.children[i],volume=bboxVolume(child),enlargement=(a=bbox,b=child,minX=void 0,minY=void 0,minZ=void 0,minX=Math.min(a.minX,b.minX),minY=Math.min(a.minY,b.minY),minZ=Math.min(a.minZ,b.minZ),(Math.max(a.maxX,b.maxX)-minX)*(Math.max(a.maxY,b.maxY)-minY)*(Math.max(a.maxZ,b.maxZ)-minZ)-volume);enlargement<minEnlargement?(minEnlargement=enlargement,minVolume=volume<minVolume?volume:minVolume,targetNode=child):enlargement===minEnlargement&&volume<minVolume&&(minVolume=volume,targetNode=child)}node=targetNode||node.children[0]}return node},RBush3D.prototype.split=function(insertPath,level){var node=insertPath[level],M=node.children.length,m=this.minEntries;this.chooseSplitAxis(node,m,M);var splitIndex=this.chooseSplitIndex(node,m,M),newNode=allowNode(node.children.splice(splitIndex,node.children.length-splitIndex));newNode.height=node.height,newNode.leaf=node.leaf,calcBBox(node),calcBBox(newNode),level?insertPath[level-1].children.push(newNode):this.splitRoot(node,newNode)},RBush3D.prototype.splitRoot=function(node,newNode){this.data=allowNode([node,newNode]),this.data.height=node.height+1,this.data.leaf=!1,calcBBox(this.data)},RBush3D.prototype.chooseSplitIndex=function(node,m,M){for(var index,a,b,minX,minY,minZ,maxX,maxY,maxZ,minOverlap=1/0,minVolume=1/0,i=m;i<=M-m;i++){var bbox1=distBBox(node,0,i),bbox2=distBBox(node,i,M),overlap=(a=bbox1,b=bbox2,minX=void 0,minY=void 0,minZ=void 0,maxX=void 0,maxY=void 0,maxZ=void 0,minX=Math.max(a.minX,b.minX),minY=Math.max(a.minY,b.minY),minZ=Math.max(a.minZ,b.minZ),maxX=Math.min(a.maxX,b.maxX),maxY=Math.min(a.maxY,b.maxY),maxZ=Math.min(a.maxZ,b.maxZ),Math.max(0,maxX-minX)*Math.max(0,maxY-minY)*Math.max(0,maxZ-minZ)),volume=bboxVolume(bbox1)+bboxVolume(bbox2);overlap<minOverlap?(minOverlap=overlap,index=i,minVolume=volume<minVolume?volume:minVolume):overlap===minOverlap&&volume<minVolume&&(minVolume=volume,index=i)}return index},RBush3D.prototype.chooseSplitAxis=function(node,m,M){var xMargin=this.allDistMargin(node,m,M,compareMinX),yMargin=this.allDistMargin(node,m,M,compareMinY),zMargin=this.allDistMargin(node,m,M,compareMinZ);xMargin<yMargin&&xMargin<zMargin?node.children.sort(compareMinX):yMargin<xMargin&&yMargin<zMargin&&node.children.sort(compareMinY)},RBush3D.prototype.allDistMargin=function(node,m,M,compare){node.children.sort(compare);for(var leftBBox=distBBox(node,0,m),rightBBox=distBBox(node,M-m,M),margin=bboxMargin(leftBBox)+bboxMargin(rightBBox),i=m;i<M-m;i++){var child=node.children[i];extend(leftBBox,child),margin+=bboxMargin(leftBBox)}for(i=M-m-1;i>=m;i--){child=node.children[i];extend(rightBBox,child),margin+=bboxMargin(rightBBox)}return margin},RBush3D.prototype.adjustParentBBoxes=function(bbox,path,level){for(var i=level;i>=0;i--)extend(path[i],bbox)},RBush3D.prototype.condense=function(path){for(var i=path.length-1,siblings=void 0;i>=0;i--)0===path[i].children.length?i>0?((siblings=path[i-1].children).splice(siblings.indexOf(path[i]),1),freeNode(path[i])):this.clear():calcBBox(path[i])},RBush3D.prototype._insert=function(item,level,isNode){var insertPath=[],node=this.chooseSubtree(item,this.data,level,insertPath);for(node.children.push(item),extend(node,item);level>=0&&insertPath[level].children.length>this.maxEntries;)this.split(insertPath,level),level--;this.adjustParentBBoxes(item,insertPath,level)},RBush3D.pool=[],RBush3D}();exports.RBush3D=RBush3D}));(x=dist)&&x.__esModule&&Object.prototype.hasOwnProperty.call(x,"default")&&x.default;dist.intersects,dist.boxRayIntersects,dist.RBush3D;const Flatbush$1=Flatbush.default?Flatbush.default:Flatbush,RBush3D=dist.RBush3D,{Box:Box$2,Point:Point$2}=foundation;var geom={maxDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let intersecting=!1;for(let i of[0,1,2])if(boxes[i].intersects(boxes[(i+1)%3])){intersecting=!0;break}let path=[[],[],[]];for(let i of[0,1,2]){for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);(0==path[i].length||intersecting)&&(path[i]=vertices[i])}let distanceMax=0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMax=Math.max(distanceMax,distance)}return distanceMax},maxDistance2Rectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[]];for(let i of[0,1])path[i]=vertices[i];let distanceMax=0;for(let i of path[0])for(let j of path[1]){const distance=i.distanceEarth(j);distanceMax=Math.max(distanceMax,distance)}return distanceMax},minDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[],[]];for(let i of[0,1,2])path[i]=vertices[i];let distanceMin=1/0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMin=Math.min(distanceMin,distance)}return distanceMin},maxDistanceNRectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[],path=[];for(let r in boxes){if(boxes[r]instanceof Box$2)vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);else{if(!(boxes[r]instanceof Point$2))throw new TypeError("boxes must contain only Box or Point");vertices[r]=[boxes[r]],minx=Math.min(minx||1/0,boxes[r].x),miny=Math.min(miny||1/0,boxes[r].y),maxx=Math.max(maxx||-1/0,boxes[r].x),maxy=Math.max(maxy||-1/0,boxes[r].y)}path[r]=[]}for(let i in boxes)if(i>0){boxes[i-1].intersects(boxes[i])&&(boxes[i-1].intersecting=!0,boxes[i].intersecting=!0)}for(let i in boxes)if(boxes[i].intersecting)path[i]=vertices[i];else{for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);0==path[i].length&&(path[i]=vertices[i])}return function maxDistancePath(origin,path,pathStart){let distanceMax=0;for(let i of path[pathStart]){const distance1=void 0!==origin?i.distanceEarth(origin):0,distance2=path.length>pathStart+1?maxDistancePath(i,path,pathStart+1):0;distanceMax=Math.max(distanceMax,distance1+distance2)}return distanceMax}(void 0,path,0)},findFurthestPointInSegment:function(sega,segb,target,opt){let points,pos,zSearch;if(target instanceof Box$2)points=target.vertices();else{if(!(target instanceof Point$2))throw new TypeError("target must be either Point or Box");points=[target]}if(sega===opt.launch)pos=0,zSearch={minZ:+opt.launch,maxZ:+segb};else{if(segb!==opt.landing)throw new RangeError("this function supports seeking only from the launch or the landing point");pos=1,zSearch={minZ:+sega,maxZ:+opt.landing}}let fpoint,distanceMax=-1/0;for(let v of points){let fVpoint,distanceVMax=-1/0;const precomputed=opt.flight.furthestPoints[pos].search({minX:v.x,minY:v.y,maxX:v.x,maxY:v.y,...zSearch});if(precomputed.length>1)throw new Error("furthestPoints cache inconsistency");if(precomputed[0]){if(!(sega<=precomputed[0].o.r&&precomputed[0].o.r<=segb))throw new Error("furthestPoints cache inconsistency");distanceVMax=v.distanceEarth(precomputed[0].o),fVpoint=precomputed[0].o}if(void 0===fVpoint){let intersecting=!1,canCache=!1;for(let p=sega;p<=segb;p++){const f=opt.flight.flightPoints[p];if(target instanceof Box$2&&target.intersects(f)){intersecting=!0;continue}const d=v.distanceEarth(f);d>distanceVMax&&(distanceVMax=d,fVpoint=f,canCache=!0)}if(intersecting)for(let p of points){const d=v.distanceEarth(p);d>distanceVMax&&(distanceVMax=d,fVpoint=target,canCache=!1)}if(canCache){let zCache;sega===opt.launch?zCache={minZ:+fVpoint.r,maxZ:+segb}:segb===opt.landing&&(zCache={minZ:+sega,maxZ:+fVpoint.r}),opt.flight.furthestPoints[pos].insert({minX:v.x,maxX:v.x,minY:v.y,maxY:v.y,...zCache,o:fVpoint})}}distanceVMax>distanceMax&&(distanceMax=distanceVMax,fpoint=fVpoint)}return void 0===fpoint&&(fpoint=target),fpoint},isTriangleClosed:function(p1,p2,distance,opt){const fastCandidates=opt.flight.closestPairs.search({minX:opt.launch,minY:p2,maxX:p1,maxY:opt.landing});for(let f of fastCandidates)if(f.o.d<=opt.scoring.closingDistanceFree)return f.o;const min=function(p1,p2,opt){let precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:p2}),precomputed=precomputedAll.reduce((a,x)=>!a||x.in>a.in?x:a,void 0);if(precomputed=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,precomputed),void 0!==precomputed)return precomputed.o;const rtree=new Flatbush$1(p1+1-opt.launch,8),lc=Math.abs(Math.cos(util.radians(opt.flight.flightPoints[p1].y)));for(let i=opt.launch;i<=p1;i++){const r=opt.flight.flightPoints[i];rtree.add(r.x*lc,r.y,r.x*lc,r.y)}rtree.finish(),precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:opt.landing});const precomputedNext=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,void 0),lastUnknown=void 0!==precomputedNext?precomputedNext.maxY:opt.landing;let min={d:1/0};for(let i=p2;i<lastUnknown;i++){const pout=opt.flight.flightPoints[i],n=rtree.neighbors(pout.x*lc,pout.y,1)[0]+opt.launch;if(void 0!==n){const pin=opt.flight.flightPoints[n],d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}}if(void 0!==precomputedNext){const pout=precomputedNext.o.out,pin=precomputedNext.o.in,d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}return opt.flight.closestPairs.insert({minX:min.in.r,minY:p2,maxX:p1,maxY:min.out.r,o:min}),min}(p1,p2,opt);return min.d<=opt.scoring.closingDistance(distance,opt)&&min},init:function(opt){opt.flight.closestPairs=new RBush,opt.flight.furthestPoints=[new RBush3D,new RBush3D],opt.flight.flightPoints=new Array(opt.flight.filtered.length);for(let r in opt.flight.filtered)opt.flight.flightPoints[r]=new Point$2(opt.flight.filtered,r)}};const definitionFlight_t=60,definitionFlight_x0=1.5,definitionFlight_xt=5,definitionFlight_z0=.05,definitionFlight_zt=.9,definitionGround_t=20,definitionGround_xmax=2.5,definitionGround_zmax=.1,Point$3=foundation.Point;var flight={analyze:function(flight,config){if(config.invalid?flight.filtered=flight.fixes.slice(0):flight.filtered=flight.fixes.filter(x=>x.valid).filter((x,i,a)=>0==i||a[i-1].timestamp!==x.timestamp),flight.filtered.length<5)throw new Error(`Flight must contain at least 5 valid GPS fixes, ${flight.filtered.length} valid fixes found (out of ${flight.fixes.length})`);config.trim||config.detectLaunch||config.detectLanding?(!function(fixes){for(let i in fixes)(null===fixes[i].pressureAltitude||void 0===fixes[i].pressureAltitude||fixes[i].pressureAltitude<-1e3)&&(fixes[i].pressureAltitude=fixes[i].gpsAltitude),null===fixes[i].pressureAltitude&&(fixes[i].gpsAltitude=void 0),i>0?fixes[i].timestamp!==fixes[i-1].timestamp?(fixes[i].hspeed=1e3*new Point$3(fixes,i-1).distanceEarth(new Point$3(fixes,i))/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3,fixes[i].vspeed=(fixes[i].pressureAltitude-fixes[i-1].pressureAltitude)/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3):(fixes[i].hspeed=fixes[i-1].hspeed,fixes[i].vspeed=fixes[i-1].vspeed):(fixes[i].hspeed=0,fixes[i].vspeed=0);for(let _i in fixes){const i=parseInt(_i),now=fixes[i].timestamp;let start,end;for(start=i;start>0&&fixes[start].timestamp>now-Math.round(5e3);start--);for(end=i;end<fixes.length-1&&fixes[end].timestamp<now+Math.round(5e3);end++);const maSegment=fixes.slice(start,end+1);fixes[i].hma=maSegment.reduce((sum,x)=>sum+x.hspeed,0)/maSegment.length,fixes[i].vma=maSegment.reduce((sum,x)=>sum+Math.abs(x.vspeed),0)/maSegment.length}}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma>definitionFlight_xt&&fixes[i].vma>definitionFlight_zt&&(start=i),void 0!==start)if(fixes[i].hma>definitionFlight_x0&&fixes[i].vma>definitionFlight_z0){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionFlight_t)for(let j=start;j<=i;j++)fixes[i].stateFlight=!0}else start=void 0}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax&&(start=i),void 0!==start)if(fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionGround_t)for(let j=start;j<=i;j++)fixes[i].stateGround=!0}else start=void 0}(flight.filtered),flight.ll=function(fixes){let ll=[];for(let i=0;i<fixes.length-1;i++)if(fixes[i].stateFlight){let j;for(j=i;j>0&&!fixes[j].stateGround;j--);const launch=j;for(j=i;j<fixes.length-2&&!fixes[j].stateGround;j++);const landing=j;i=j,ll.push({launch:launch,landing:landing})}return 0==ll.length&&ll.push({launch:0,landing:fixes.length-1}),ll}(flight.filtered)):flight.ll=[{launch:0,landing:flight.filtered.length-1}]}};function closingPenalty(cd,opt){return cd>(opt.scoring.closingDistanceFree||0)?cd:0}function maxFAIDistance(maxTriDistance,boxes,opt){const minTriDistance=geom.minDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxAB=geom.maxDistance2Rectangles([boxes[0],boxes[1]]),maxBC=geom.maxDistance2Rectangles([boxes[1],boxes[2]]),maxCA=geom.maxDistance2Rectangles([boxes[2],boxes[0]]),maxDistance=Math.min(maxAB/opt.scoring.minSide,maxBC/opt.scoring.minSide,maxCA/opt.scoring.minSide,maxTriDistance);return maxDistance<minTriDistance?0:maxDistance}var scoring={closingWithLimit:function(distance,opt){return Math.max(opt.scoring.closingDistanceFixed||0,distance*(opt.scoring.closingDistanceRelative||0))},closingWithPenalty:function(distance,opt){return 1/0},boundTriangle:function(ranges,boxes,opt){const maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxDistance=void 0!==opt.scoring.minSide?maxFAIDistance(maxTriDistance,boxes,opt):maxTriDistance;if(0===maxDistance)return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxDistance,opt),cp?(maxDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxDistance*opt.scoring.multiplier},scoreTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),distance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*distance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,distance,opt);return cp?{distance:distance,score:(distance-closingPenalty(cp.d,opt))*opt.scoring.multiplier,tp:tp,cp:cp}:{score:0}},boundDistance3Points:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt);return geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout])*opt.scoring.multiplier},scoreDistance3Points:function(tp,opt){let distance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])distance+=all[i].distanceEarth(all[i+1]);return{distance:distance,score:distance*opt.scoring.multiplier,tp:tp,ep:{start:pin,finish:pout}}},boundOpenTriangle:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt),maxD3PDistance=geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout]),maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i));if(void 0!==opt.scoring.minSide&&0===maxFAIDistance(maxTriDistance,boxes,opt))return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxTriDistance,opt),cp?(maxD3PDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxD3PDistance*opt.scoring.multiplier},scoreOpenTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),triDistance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*triDistance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,triDistance,opt);if(!cp)return{score:0};let d3pDistance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])d3pDistance+=all[i].distanceEarth(all[i+1]);return{distance:d3pDistance,score:d3pDistance*opt.scoring.multiplier-closingPenalty(cp.d,opt),tp:tp,ep:{start:pin,finish:pout},cp:cp}}};function round2(score){return parseFloat(parseFloat(score).toFixed(2))}var scoringRules_config={FFVL:[{name:"Distance 3 points",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Triangle plat",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Triangle FAI",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}],XContest:[{name:"Free flight",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Free triangle",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"tri"},{name:"FAI triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"fai"},{name:"Closed free triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Closed FAI triangle",multiplier:1.6,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}]};const Solution$1=solution_Solution,{Range:Range$2,Point:Point$4}=foundation;var solver_1=function*(flight$1,_scoringTypes,_config){let reset;const scoringTypes=_scoringTypes||scoringRules_config.FFVL,config=_config||{};flight.analyze(flight$1,config),geom.init({flight:flight$1}),config.hp?Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthVincentys:Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthFCC;let solutionRoots=[];for(let scoringType of scoringTypes)for(let l of flight$1.ll){const opt={flight:flight$1,launch:l.launch,landing:l.landing,scoring:scoringType,config:config};let solutionRoot=new Solution$1([new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing)],opt);solutionRoot.do_bound(),solutionRoot.do_score(),solutionRoots.push(solutionRoot)}let best=solutionRoots[0],solutionQueue=new sortedSet(solutionRoots,Solution$1.prototype.contentEquals,Solution$1.prototype.contentCompare),processed=0,tcum=0;do{const tstart=Date.now();for(;solutionQueue.length>0;){if(processed%100==0&&"undefined"!=typeof process&&process.memoryUsage){const mem=process.memoryUsage();if(mem.heapUsed/mem.heapTotal>.98)break}let current=solutionQueue.pop();if(current.opt.scoring.rounding(current.bound)<=best.opt.scoring.rounding(best.score)){solutionQueue.clear();break}let children=current.do_branch();for(let s of children)if(s.do_bound(),!(s.bound<=best.score)){if(s.do_score(),processed++,s.score>=best.score&&s.score>0&&(best=s,solutionQueue.length>1e4&&solutionQueue.findLeast().value.bound<=best.score)){const garbageBest=solutionQueue.findGreatestLessThanOrEqual({bound:best.score});if(void 0!==garbageBest){const cutoff=solutionQueue.indexOf(garbageBest.value);solutionQueue.splice(0,cutoff+1).length}}solutionQueue.push(s)}if(processed>config.maxloop||Date.now()-tstart>config.maxcycle)break}best.processed=processed;const currentUpperBound=solutionQueue.findGreatest();if(best.currentUpperBound=currentUpperBound?currentUpperBound.value.bound:best.bound,tcum+=Date.now()-tstart,best.time=tcum,0==solutionQueue.length?best.optimal=!0:best.optimal=!1,best.optimal)return best.score=best.opt.scoring.rounding(best.score),best.scoreInfo&&(best.scoreInfo.distance=best.opt.scoring.rounding(best.scoreInfo.distance),best.scoreInfo.cp&&(best.scoreInfo.cp.d=best.opt.scoring.rounding(best.scoreInfo.cp.d))),reset=!0,best;reset=yield best}while(!reset)},description="igc-xc-score is a paragliding and hang-gliding XC scoring program in vanilla JS",directories={test:"test",example:"www"},bin={"igc-xc-score":"./igc-xc-score.js"},scripts={test:"node test && npm run eslint",eslint:"eslint geom.js index.js scoring.js scoring-rules.config.js solution.js solver.js test.js foundation.js util.js vincentys.js flight.js main.js",doc:"jsdoc -d doc solver.js scoring-rules.config.js",nexe_linux:"nexe -i igc-xc-score.js -o dist/igc-xc-score-linux-x86-x64 -t linux-x64-12.16.2",nexe_win:"nexe -i igc-xc-score.js -o dist/igc-xc-score.exe -t windows-x64-12.16.3",nexe_mac:"nexe -i igc-xc-score.js -o dist/igc-xc-score-macos -t darwin-x64-12.15.0",nexe_all:"npm run nexe_linux && npm run nexe_win && npm run nexe_mac",www:"webpack && cp www/index.html www/pacman.svg dist/www",build:"rollup -c && npm run nexe_all && npm run www && npm run doc",c8:"npx c8 --exclude igc-parser.js node test",lcov:"npx c8 --exclude igc-parser.js report --reporter=text-lcov > coverage/tests.lcov",codecov:"curl -s https://codecov.io/bash | env CODECOV_TOKEN='4d5a31d4-9b2f-4a62-9db9-2c49eef14ea0' bash",preversion:"npm test",version:"npm run build && git add package.json igc-xc-score.js index.es.js index.cjs.js doc",postversion:"git push && git push --tags"},repository={type:"git",url:"git+https://github.com/mmomtchev/igc-xc-score.git"},keywords=["igc","paragliding","hang-gliding","gliding"],author="Momtchil Momtchev <momtchil@momtchev.com>",bugs={url:"https://github.com/mmomtchev/igc-xc-score/issues"},homepage="https://github.com/mmomtchev/igc-xc-score#readme",dependencies={collections:"^5.1.11",flatbush:"^3.3.0","igc-parser":"^0.5.0",rbush:"^3.0.1","rbush-3d":"0.0.4"},devDependencies={"@rollup/plugin-commonjs":"^11.1.0","@rollup/plugin-json":"^4.1.0","@rollup/plugin-node-resolve":"^7.1.3",bootstrap:"^4.5.0",c8:"^7.2.0","css-loader":"^3.6.0",elliptic:">=6.5.3",eslint:"^6.8.0","eslint-config-standard":"^14.1.1","eslint-plugin-import":"^2.22.0","eslint-plugin-node":"^11.1.0","eslint-plugin-promise":"^4.2.1","eslint-plugin-standard":"^4.0.1",jquery:"^3.5.1",jsdoc:"^3.6.4",nexe:"^3.3.7",ol:"^6.3.1","popper.js":"^1.16.1",rollup:"^2.21.0","rollup-plugin-executable":"^1.6.0","rollup-plugin-terser":"^7.0.0","style-loader":"^1.2.1",webpack:"^4.43.0","webpack-cli":"^3.3.12"},_package={name:"igc-xc-score",version:"1.5.1",description:description,main:"index.cjs.js",module:"index.es.js",directories:directories,bin:bin,scripts:scripts,repository:repository,keywords:keywords,author:author,license:"LGPL-3.0-or-later",bugs:bugs,homepage:homepage,dependencies:dependencies,devDependencies:devDependencies},require$$1=getCjsExportFromNamespace(Object.freeze({__proto__:null,name:"igc-xc-score",version:"1.5.1",description:description,main:"index.cjs.js",module:"index.es.js",directories:directories,bin:bin,scripts:scripts,repository:repository,keywords:keywords,author:author,license:"LGPL-3.0-or-later",bugs:bugs,homepage:homepage,dependencies:dependencies,devDependencies:devDependencies,default:_package}));const Solution$2=solution_Solution;function displayDistance(labela,labelb,a,b){console.log(labela.padStart(6," "),labelb.padStart(6," "),"".padStart(4," "),a.distanceEarth(b).toFixed(2)+"km")}let inf,outf,config={};for(let arg of process.argv.slice(3)){const kv=arg.split("=");isNaN(kv[1])?"true"===kv[1]?config[kv[0]]=!0:"false"===kv[1]?config[kv[0]]=!1:config[kv[0]]=kv[1]:config[kv[0]]=parseInt(kv[1])}Object.keys(config).length&&!config.quiet&&console.log(config),config.scoring&&!scoringRules_config[config.scoring]&&(console.log("No scoring rules named "+config.scoring),process.exit(2)),config.pipe?(inf=0,outf=1):(process.argv[2]||(console.log("igc-xc-score "+require$$1.version),console.log("Momtchil Momtchev, velivole.fr/meteo.guru, 2020/COVID19"),console.log("Usage:"),console.log("igc-xc-score <flight.igc> [out=flight.json] [maxtime=<n>] [scoring=FFVL|XContest] [quiet=true] [pipe=true] [progress=<n>] ..."),console.log("flight.igc             is the flight track log"),console.log("out=flight.json        save the optimal solution in GeoJSON format"),console.log("maxtime=n              limit the execution time to n seconds"),console.log("scoring=FFVL|XContest  select the scoring rules"),console.log("quiet=true             suppress all output"),console.log("pipe=true              read flight data from stdin and write optimal solutions to stdout, works best with quiet"),console.log("progress=<n>           output an intermediate solution every n milliseconds, works best with pipe"),console.log("hp=true                enable High Precision mode (twice slower, precision goes from 10m-20m to 0.6m)"),console.log("trim=true              auto-trim the flight log to its launch and landing points"),process.exit(1)),inf=process.argv[2],outf=config.out);try{const flight=igcParser.parse(fs.readFileSync(inf,"utf8"),{lenient:!0});let best;config.env={fs:fs};const tend=Date.now()+1e3*config.maxtime;config.maxcycle=config.progress||100;const it=solver_1(flight,scoringRules_config[config.scoring]||scoringRules_config.FFVL,config);let newbest;do{if(newbest=it.next(),config.progress&&process.stdout.write(JSON.stringify(newbest.value.geojson())),void 0!==best&&Solution$2.prototype.contentEquals(newbest.value,best)||(best=newbest.value,config.quiet||process.stdout.write("best so far is "+best+"                                                               \n")),config.quiet||process.stdout.write(`processing solutions, current upper bound is ${best.currentUpperBound.toFixed(4)}             \r`),void 0!==config.maxtime&&Date.now()>tend){config.quiet||process.stdout.write("max execution time reached, no optimal solution found                                         \r");break}const mem=process.memoryUsage();if(mem.heapUsed/mem.heapTotal>.98){console.error("max memory usage reached, allocate more heap memory (--max-old-space-size)                  ");break}}while(!newbest.done);if(process.stdout.write("                                                                                                      \r"),void 0!==outf&&fs.writeFileSync(outf,JSON.stringify(best.geojson())),!config.quiet){for(let l of flight.ll)console.log(`Launch at fix ${l.launch}, ${flight.filtered[l.launch].time}`),console.log(`Landing at fix n-${flight.filtered.length-l.landing-1}, ${flight.filtered[l.landing].time}`);if(void 0!==best.scoreInfo){best.scoreInfo.ep&&best.scoreInfo.ep.start&&displayDistance("start","tp0",best.scoreInfo.ep.start,best.scoreInfo.tp[0]);for(let i of[0,1])displayDistance("tp"+i,"tp"+(i+1),best.scoreInfo.tp[i],best.scoreInfo.tp[i+1]);best.scoreInfo.ep&&best.scoreInfo.ep.finish?displayDistance("tp2","finish",best.scoreInfo.tp[2],best.scoreInfo.ep.finish):displayDistance("tp2","tp0",best.scoreInfo.tp[2],best.scoreInfo.tp[0]),console.log("Best solution is "+(best.optimal?util.consoleColors.fg.green+"optimal":util.consoleColors.fg.red+"not optimal")+util.consoleColors.reset+` ${util.consoleColors.fg.yellow}${best.opt.scoring.name}`+` ${util.consoleColors.fg.green}${best.score} points,`+` ${util.consoleColors.fg.yellow}${best.scoreInfo.distance}km`+(best.opt.scoring.closingDistance?` [ closing distance is ${best.scoreInfo.cp.d}km ]`:"")+(best.optimal?"":` potential maximum score could be up to ${best.bound.toFixed(2)} points`)+util.consoleColors.reset)}else console.log(`no solution found, try increasing maximum running time, potential maximum score could be up to ${best.bound.toFixed(2)} points`)}}catch(e){console.error(e.message),config&&config.debug&&console.error(e.stack),process.exit(1)}
\ No newline at end of file
+"use strict";var e,fs=(e=require("fs"))&&"object"==typeof e&&"default"in e?e.default:e,commonjsGlobal="undefined"!=typeof globalThis?globalThis:"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:{};function createCommonjsModule(fn,module){return fn(module={exports:{}},module.exports),module.exports}function getCjsExportFromNamespace(n){return n&&n.default||n}var MANUFACTURERS=getCjsExportFromNamespace(Object.freeze({__proto__:null,default:[{name:"Aircotec",long:"ACT",short:"I"},{name:"Cambridge Aero Instruments",long:"CAM",short:"C"},{name:"ClearNav Instruments",long:"CNI",short:null},{name:"Data Swan/DSX",long:"DSX",short:"D"},{name:"EW Avionics",long:"EWA",short:"E"},{name:"Filser",long:"FIL",short:"F"},{name:"Flarm",long:"FLA",short:"G"},{name:"Flytech",long:"FLY",short:null},{name:"Garrecht",long:"GCS",short:"A"},{name:"IMI Gliding Equipment",long:"IMI",short:"M"},{name:"Logstream",long:"LGS",short:null},{name:"LX Navigation",long:"LXN",short:"L"},{name:"LXNAV",long:"LXV",short:"V"},{name:"Naviter",long:"NAV",short:null},{name:"New Technologies",long:"NTE",short:"N"},{name:"Nielsen Kellerman",long:"NKL",short:"K"},{name:"Peschges",long:"PES",short:"P"},{name:"PressFinish Electronics",long:"PFE",short:null},{name:"Print Technik",long:"PRT",short:"R"},{name:"Scheffel",long:"SCH",short:"H"},{name:"Streamline Data Instruments",long:"SDI",short:"S"},{name:"Triadis Engineering GmbH",long:"TRI",short:"T"},{name:"Zander",long:"ZAN",short:"Z"},{name:"XCSoar",long:"XCS",short:null},{name:"LK8000",long:"XLK",short:null},{name:"GpsDump",long:"XGD",short:null},{name:"SeeYou Recorder",long:"XCM",short:null}]})),lookup=function(id){let short=1===id.length;id=id.toUpperCase();let manufacturers=MANUFACTURERS.filter(it=>it[short?"short":"long"]===id);return 0!==manufacturers.length?manufacturers[0].name:id},RE_A=/^A(\w{3})(\w{3,}?)(?:FLIGHT:(\d+)|\:(.+))?$/,RE_HFDTE=/^HFDTE(?:DATE:)?(\d{2})(\d{2})(\d{2})(?:,?(\d{2}))?/,RE_PLT_HEADER=/^H[FO]PLT(?:.{0,}?:(.*)|(.*))$/,RE_CM2_HEADER=/^H[FOP]CM2(?:.{0,}?:(.*)|(.*))$/,RE_GTY_HEADER=/^H[FO]GTY(?:.{0,}?:(.*)|(.*))$/,RE_GID_HEADER=/^H[FO]GID(?:.{0,}?:(.*)|(.*))$/,RE_CID_HEADER=/^H[FO]CID(?:.{0,}?:(.*)|(.*))$/,RE_CCL_HEADER=/^H[FO]CCL(?:.{0,}?:(.*)|(.*))$/,RE_FTY_HEADER=/^H[FO]FTY(?:.{0,}?:(.*)|(.*))$/,RE_RFW_HEADER=/^H[FO]RFW(?:.{0,}?:(.*)|(.*))$/,RE_RHW_HEADER=/^H[FO]RHW(?:.{0,}?:(.*)|(.*))$/,RE_B=/^B(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])([AV])(-\d{4}|\d{5})(-\d{4}|\d{5})/,RE_K=/^K(\d{2})(\d{2})(\d{2})/,RE_IJ=/^[IJ](\d{2})(?:\d{2}\d{2}[A-Z]{3})+/,RE_TASK=/^C(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{4})([-\d]{2})(.*)/,RE_TASKPOINT=/^C(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])(.*)/,igcParser=function(){function IGCParser(){this._result={numFlight:null,pilot:null,copilot:null,gliderType:null,registration:null,callsign:null,competitionClass:null,loggerType:null,firmwareVersion:null,hardwareVersion:null,task:null,fixes:[],dataRecords:[],security:null,errors:[]},this.fixExtensions=[],this.dataExtensions=[],this.lineNumber=0,this.prevTimestamp=null}return IGCParser.parse=function(str,options){void 0===options&&(options={});for(var parser=new IGCParser,errors=[],_i=0,_a=str.split("\n");_i<_a.length;_i++){var line=_a[_i];try{parser.processLine(line.trim())}catch(error){if(!options.lenient)throw error;errors.push(error)}}var result=parser.result;return result.errors=errors,result},Object.defineProperty(IGCParser.prototype,"result",{get:function(){if(!this._result.loggerManufacturer)throw new Error("Missing A record");if(!this._result.date)throw new Error("Missing HFDTE record");return this._result},enumerable:!0,configurable:!0}),IGCParser.prototype.processLine=function(line){this.lineNumber+=1;var recordType=line[0];if("B"===recordType){var fix=this.parseBRecord(line);this.prevTimestamp=fix.timestamp,this._result.fixes.push(fix)}else if("K"===recordType){var data=this.parseKRecord(line);this.prevTimestamp=data.timestamp,this._result.dataRecords.push(data)}else if("H"===recordType)this.processHeader(line);else if("C"===recordType)this.processTaskLine(line);else if("A"===recordType){var record=this.parseARecord(line);this._result.loggerId=record.loggerId,this._result.loggerManufacturer=record.manufacturer,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"I"===recordType?this.fixExtensions=this.parseIJRecord(line):"J"===recordType?this.dataExtensions=this.parseIJRecord(line):"G"===recordType&&(this._result.security=(this._result.security||"")+line.slice(1))},IGCParser.prototype.processHeader=function(line){var headerType=line.slice(2,5);if("DTE"===headerType){var record=this.parseDateHeader(line);this._result.date=record.date,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"PLT"===headerType?this._result.pilot=this.parsePilot(line):"CM2"===headerType?this._result.copilot=this.parseCopilot(line):"GTY"===headerType?this._result.gliderType=this.parseGliderType(line):"GID"===headerType?this._result.registration=this.parseRegistration(line):"CID"===headerType?this._result.callsign=this.parseCallsign(line):"CCL"===headerType?this._result.competitionClass=this.parseCompetitionClass(line):"FTY"===headerType?this._result.loggerType=this.parseLoggerType(line):"RFW"===headerType?this._result.firmwareVersion=this.parseFirmwareVersion(line):"RHW"===headerType&&(this._result.hardwareVersion=this.parseHardwareVersion(line))},IGCParser.prototype.parseARecord=function(line){var match=line.match(RE_A);if(match)return{manufacturer:lookup(match[1]),loggerId:match[2],numFlight:match[3]?parseInt(match[3],10):null,additionalData:match[4]||null};if(match=line.match(/^A(\w{3})(.+)?$/))return{manufacturer:lookup(match[1]),loggerId:null,numFlight:null,additionalData:match[2]?match[2].trim():null};throw new Error("Invalid A record at line "+this.lineNumber+": "+line)},IGCParser.prototype.parseDateHeader=function(line){var match=line.match(RE_HFDTE);if(!match)throw new Error("Invalid DTE header at line "+this.lineNumber+": "+line);return{date:("8"===match[3][0]||"9"===match[3][0]?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],numFlight:match[4]?parseInt(match[4],10):null}},IGCParser.prototype.parseTextHeader=function(headerType,regex,line,underscoreReplacement){void 0===underscoreReplacement&&(underscoreReplacement=" ");var match=line.match(regex);if(!match)throw new Error("Invalid "+headerType+" header at line "+this.lineNumber+": "+line);return(match[1]||match[2]||"").replace(/_/g,underscoreReplacement).trim()},IGCParser.prototype.parsePilot=function(line){return this.parseTextHeader("PLT",RE_PLT_HEADER,line)},IGCParser.prototype.parseCopilot=function(line){return this.parseTextHeader("CM2",RE_CM2_HEADER,line)},IGCParser.prototype.parseGliderType=function(line){return this.parseTextHeader("GTY",RE_GTY_HEADER,line)},IGCParser.prototype.parseRegistration=function(line){return this.parseTextHeader("GID",RE_GID_HEADER,line,"-")},IGCParser.prototype.parseCallsign=function(line){return this.parseTextHeader("GTY",RE_CID_HEADER,line)},IGCParser.prototype.parseCompetitionClass=function(line){return this.parseTextHeader("GID",RE_CCL_HEADER,line)},IGCParser.prototype.parseLoggerType=function(line){return this.parseTextHeader("FTY",RE_FTY_HEADER,line)},IGCParser.prototype.parseFirmwareVersion=function(line){return this.parseTextHeader("RFW",RE_RFW_HEADER,line)},IGCParser.prototype.parseHardwareVersion=function(line){return this.parseTextHeader("RHW",RE_RHW_HEADER,line)},IGCParser.prototype.processTaskLine=function(line){this._result.task?this._result.task.points.push(this.parseTaskPoint(line)):this._result.task=this.parseTask(line)},IGCParser.prototype.parseTask=function(line){var match=line.match(RE_TASK);if(!match)throw new Error("Invalid task declaration at line "+this.lineNumber+": "+line);var lastCentury="8"===match[3][0]||"9"===match[3][0],declarationDate=(lastCentury?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],declarationTime=match[4]+":"+match[5]+":"+match[6],declarationTimestamp=Date.parse(declarationDate+"T"+declarationTime+"Z"),flightDate=null;return"00"===match[7]&&"00"===match[8]&&"00"===match[9]||(flightDate=((lastCentury="8"===match[9][0]||"9"===match[9][0])?"19":"20")+match[9]+"-"+match[8]+"-"+match[7]),{declarationDate:declarationDate,declarationTime:declarationTime,declarationTimestamp:declarationTimestamp,flightDate:flightDate,taskNumber:"0000"!==match[10]?parseInt(match[10],10):null,numTurnpoints:parseInt(match[11],10),comment:match[12]||null,points:[]}},IGCParser.prototype.parseTaskPoint=function(line){var match=line.match(RE_TASKPOINT);if(!match)throw new Error("Invalid task point declaration at line "+this.lineNumber+": "+line);return{latitude:IGCParser.parseLatitude(match[1],match[2],match[3],match[4]),longitude:IGCParser.parseLongitude(match[5],match[6],match[7],match[8]),name:match[9]||null}},IGCParser.prototype.parseBRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first B record");var match=line.match(RE_B);if(!match)throw new Error("Invalid B record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),latitude=IGCParser.parseLatitude(match[4],match[5],match[6],match[7]),longitude=IGCParser.parseLongitude(match[8],match[9],match[10],match[11]),valid="A"===match[12],pressureAltitude="00000"===match[13]?null:parseInt(match[13],10),gpsAltitude="00000"===match[14]?null:parseInt(match[14],10),extensions={};if(this.fixExtensions)for(var _i=0,_a=this.fixExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}var enl=null;if(extensions.ENL){var enlLength=this.fixExtensions.filter((function(it){return"ENL"===it.code}))[0].length,enlMax=Math.pow(10,enlLength);enl=parseInt(extensions.ENL,10)/enlMax}return{timestamp:timestamp,time:time,latitude:latitude,longitude:longitude,valid:valid,pressureAltitude:pressureAltitude,gpsAltitude:gpsAltitude,extensions:extensions,enl:enl,fixAccuracy:extensions.FXA?parseInt(extensions.FXA,10):null}},IGCParser.prototype.parseKRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first K record");if(!this.dataExtensions)throw new Error("Missing J record before first K record");var match=line.match(RE_K);if(!match)throw new Error("Invalid K record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),extensions={};if(this.dataExtensions)for(var _i=0,_a=this.dataExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}return{timestamp:timestamp,time:time,extensions:extensions}},IGCParser.prototype.parseIJRecord=function(line){var match=line.match(RE_IJ);if(!match)throw new Error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line);var num=parseInt(match[1],10);if(line.length<3+7*num)throw new Error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line);for(var extensions=new Array(num),i=0;i<num;i++){var offset=3+7*i,start=parseInt(line.slice(offset,offset+2),10),length=parseInt(line.slice(offset+2,offset+4),10)-start+1,code=line.slice(offset+4,offset+7);extensions[i]={start:start,length:length,code:code}}return extensions},IGCParser.parseLatitude=function(dd,mm,mmm,ns){var degrees=parseInt(dd,10)+parseFloat(mm+"."+mmm)/60;return"S"===ns?-degrees:degrees},IGCParser.parseLongitude=function(ddd,mm,mmm,ew){var degrees=parseInt(ddd,10)+parseFloat(mm+"."+mmm)/60;return"W"===ew?-degrees:degrees},IGCParser.prototype.calcTimestamp=function(time){for(var timestamp=Date.parse(this._result.date+"T"+time+"Z");this.prevTimestamp&&timestamp<this.prevTimestamp-36e5;)timestamp+=864e5;return timestamp},IGCParser}();Function.noop=function(){},Function.identity=function(value){return value},Function.by=function(by,compare){compare=compare||Object.compare,by=by||Function.identity;var compareBy=function(a,b){return compare(by(a),by(b))};return compareBy.compare=compare,compareBy.by=by,compareBy},Function.get=function(key){return function(object){return Object.get(object,key)}};var genericCollection=GenericCollection;function GenericCollection(){throw new Error("Can't construct. GenericCollection is a mixin.")}var DOMTokenList=commonjsGlobal.DOMTokenList||function(){};GenericCollection.EmptyArray=Object.freeze([]),GenericCollection.prototype.addEach=function(values,mapFn,thisp){if(values&&(values instanceof Array||values instanceof DOMTokenList||values instanceof String))if(mapFn)for(var i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else if(values&&Object(values)===values)if("function"==typeof values.forEach)mapFn?values.map(mapFn,thisp).forEach(this.add,this):values.forEach(this.add,this);else if("function"==typeof values.next){var value;i=0;if(mapFn)for(;value=values.next().value;)this.add(mapFn.call(thisp,value),i++);else for(;value=values.next().value;)this.add(value,i++)}else if("number"==typeof values.length)if(mapFn)for(i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else mapFn?Object.keys(values).forEach((function(key){this.add(mapFn.call(thisp,values[key]),key)}),this):Object.keys(values).forEach((function(key){this.add(values[key],key)}),this);return this},GenericCollection.prototype.deleteEach=function(values,equals){return values.forEach((function(value){this.delete(value,equals)}),this),this},GenericCollection.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)}),void 0)},GenericCollection.prototype.map=function(callback){var thisp=arguments[1],result=[];return this.reduce((function(undefined$1,value,key,object,depth){result.push(callback.call(thisp,value,key,object,depth))}),void 0),result},GenericCollection.prototype.enumerate=function(start){null==start&&(start=0);var result=[];return this.reduce((function(undefined$1,value){result.push([start++,value])}),void 0),result},GenericCollection.prototype.group=function(callback,thisp,equals){equals=equals||Object.equals;var groups=[],keys=[];return this.forEach((function(value,key,object){key=callback.call(thisp,value,key,object);var group,index=keys.indexOf(key,equals);-1===index?(group=[],groups.push([key,group]),keys.push(key)):group=groups[index][1],group.push(value)})),groups},GenericCollection.prototype.toArray=function(){return this.map(Function.identity)},GenericCollection.prototype.toObject=function(){var object={};return this.reduce((function(undefined$1,value,key){object[key]=value}),void 0),object},GenericCollection.from=function(){return this.apply(this,arguments)},GenericCollection.prototype.filter=function(callback){var thisp=arguments[1],result=this.constructClone();return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)&&result.add(value,key)}),void 0),result},GenericCollection.prototype.every=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result&&callback.call(thisp,value,key,object,depth)}),!0)},GenericCollection.prototype.some=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result||callback.call(thisp,value,key,object,depth)}),!1)},GenericCollection.prototype.all=function(){return this.every(Boolean)},GenericCollection.prototype.any=function(){return this.some(Boolean)},GenericCollection.prototype.min=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)<0?value:result}),void 0)},GenericCollection.prototype.max=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)>0?value:result}),void 0)},GenericCollection.prototype.sum=function(zero){return zero=void 0===zero?0:zero,this.reduce((function(a,b){return a+b}),zero)},GenericCollection.prototype.average=function(zero){var sum=void 0===zero?0:zero,count=void 0===zero?0:zero;return this.reduce((function(undefined$1,value){sum+=value,count+=1}),void 0),sum/count},GenericCollection.prototype.concat=function(){for(var result=this.constructClone(this),i=0;i<arguments.length;i++)result.addEach(arguments[i]);return result},GenericCollection.prototype.flatten=function(){var self=this;return this.reduce((function(result,array){return array.forEach((function(value){this.push(value)}),result,self),result}),[])},GenericCollection.prototype.zip=function(){var table=Array.prototype.slice.call(arguments);return table.unshift(this),Array.unzip(table)},GenericCollection.prototype.join=function(delimiter){return this.reduce((function(result,string){return void 0===result?string:result+delimiter+string}),void 0)},GenericCollection.prototype.sorted=function(compare,by,order){return(compare=compare||this.contentCompare||Object.compare).by?(by=compare.by,compare=compare.compare||this.contentCompare||Object.compare):by=by||Function.identity,void 0===order&&(order=1),this.map((function(item){return{by:by(item),value:item}})).sort((function(a,b){return compare(a.by,b.by)*order})).map((function(pair){return pair.value}))},GenericCollection.prototype.reversed=function(){return this.constructClone(this).reverse()},GenericCollection.prototype.clone=function(depth,memo){if(void 0===depth)depth=1/0;else if(0===depth)return this;var clone=this.constructClone();return this.forEach((function(value,key){clone.add(Object.clone(value,depth-1,memo),key)}),this),clone},GenericCollection.prototype.only=function(){if(1===this.length)return this.one()},GenericCollection.prototype.iterator=function(){return this.iterate.apply(this,arguments)},GenericCollection._sizePropertyDescriptor={get:function(){return this.length},enumerable:!1,configurable:!0},Object.defineProperty(GenericCollection.prototype,"size",GenericCollection._sizePropertyDescriptor);var weakMap=createCommonjsModule((function(module){!function(){if("undefined"==typeof ses||!ses.ok||ses.ok()){"undefined"!=typeof ses&&(ses.weakMapPermitHostObjects=weakMapPermitHostObjects);var doubleWeakMapCheckSilentFailure=!1;if("function"==typeof WeakMap){var HostWeakMap=WeakMap;if("undefined"!=typeof navigator&&/Firefox/.test(navigator.userAgent));else{var testMap=new HostWeakMap,testObject=Object.freeze({});if(testMap.set(testObject,1),1===testMap.get(testObject))return void(module.exports=WeakMap);doubleWeakMapCheckSilentFailure=!0}}var gopn=Object.getOwnPropertyNames,defProp=Object.defineProperty,isExtensible=Object.isExtensible,HIDDEN_NAME="weakmap:ident:"+Math.random()+"___";if("undefined"!=typeof crypto&&"function"==typeof crypto.getRandomValues&&"function"==typeof ArrayBuffer&&"function"==typeof Uint8Array){var ab=new ArrayBuffer(25),u8s=new Uint8Array(ab);crypto.getRandomValues(u8s),HIDDEN_NAME="weakmap:rand:"+Array.prototype.map.call(u8s,(function(u8){return(u8%36).toString(36)})).join("")+"___"}if(defProp(Object,"getOwnPropertyNames",{value:function(obj){return gopn(obj).filter(isNotHiddenName)}}),"getPropertyNames"in Object){var originalGetPropertyNames=Object.getPropertyNames;defProp(Object,"getPropertyNames",{value:function(obj){return originalGetPropertyNames(obj).filter(isNotHiddenName)}})}!function(){var oldFreeze=Object.freeze;defProp(Object,"freeze",{value:function(obj){return getHiddenRecord(obj),oldFreeze(obj)}});var oldSeal=Object.seal;defProp(Object,"seal",{value:function(obj){return getHiddenRecord(obj),oldSeal(obj)}});var oldPreventExtensions=Object.preventExtensions;defProp(Object,"preventExtensions",{value:function(obj){return getHiddenRecord(obj),oldPreventExtensions(obj)}})}();var calledAsFunctionWarningDone=!1,nextId=0,OurWeakMap=function(){this instanceof OurWeakMap||calledAsFunctionWarning();var keys=[],values=[],id=nextId++;return Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord?hiddenRecord[id]:opt_default:(index=keys.indexOf(key))>=0?values[index]:opt_default}))},has___:{value:constFunc((function(key){var hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord:keys.indexOf(key)>=0}))},set___:{value:constFunc((function(key,value){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?hiddenRecord[id]=value:(index=keys.indexOf(key))>=0?values[index]=value:(index=keys.length,values[index]=value,keys[index]=key),this}))},delete___:{value:constFunc((function(key){var index,lastIndex,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord&&delete hiddenRecord[id]:!((index=keys.indexOf(key))<0)&&(lastIndex=keys.length-1,keys[index]=void 0,values[index]=values[lastIndex],keys[index]=keys[lastIndex],keys.length=lastIndex,values.length=lastIndex,!0)}))}})};OurWeakMap.prototype=Object.create(Object.prototype,{get:{value:function(key,opt_default){return this.get___(key,opt_default)},writable:!0,configurable:!0},has:{value:function(key){return this.has___(key)},writable:!0,configurable:!0},set:{value:function(key,value){return this.set___(key,value)},writable:!0,configurable:!0},delete:{value:function(key){return this.delete___(key)},writable:!0,configurable:!0}}),"function"==typeof HostWeakMap?function(){function DoubleWeakMap(){this instanceof OurWeakMap||calledAsFunctionWarning();var dset,hmap=new HostWeakMap,omap=void 0,enableSwitching=!1;return dset=doubleWeakMapCheckSilentFailure?function(key,value){return hmap.set(key,value),hmap.has(key)||(omap||(omap=new OurWeakMap),omap.set(key,value)),this}:function(key,value){if(enableSwitching)try{hmap.set(key,value)}catch(e){omap||(omap=new OurWeakMap),omap.set___(key,value)}else hmap.set(key,value);return this},Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){return omap?hmap.has(key)?hmap.get(key):omap.get___(key,opt_default):hmap.get(key,opt_default)}))},has___:{value:constFunc((function(key){return hmap.has(key)||!!omap&&omap.has___(key)}))},set___:{value:constFunc(dset)},delete___:{value:constFunc((function(key){var result=!!hmap.delete(key);return omap&&omap.delete___(key)||result}))},permitHostObjects___:{value:constFunc((function(token){if(token!==weakMapPermitHostObjects)throw new Error("bogus call to permitHostObjects___");enableSwitching=!0}))}})}doubleWeakMapCheckSilentFailure&&"undefined"!=typeof Proxy&&(Proxy=void 0),DoubleWeakMap.prototype=OurWeakMap.prototype,module.exports=DoubleWeakMap,Object.defineProperty(WeakMap.prototype,"constructor",{value:WeakMap,enumerable:!1,configurable:!0,writable:!0})}():("undefined"!=typeof Proxy&&(Proxy=void 0),module.exports=OurWeakMap)}function weakMapPermitHostObjects(map){map.permitHostObjects___&&map.permitHostObjects___(weakMapPermitHostObjects)}function isNotHiddenName(name){return!("weakmap:"==name.substr(0,"weakmap:".length)&&"___"===name.substr(name.length-3))}function getHiddenRecord(key){if(key!==Object(key))throw new TypeError("Not an object: "+key);var hiddenRecord=key[HIDDEN_NAME];if(hiddenRecord&&hiddenRecord.key===key)return hiddenRecord;if(isExtensible(key)){hiddenRecord={key:key};try{return defProp(key,HIDDEN_NAME,{value:hiddenRecord,writable:!1,enumerable:!1,configurable:!1}),hiddenRecord}catch(error){return}}}function constFunc(func){return func.prototype=null,Object.freeze(func)}function calledAsFunctionWarning(){calledAsFunctionWarningDone||"undefined"==typeof console||(calledAsFunctionWarningDone=!0,console.warn("WeakMap should be invoked as new WeakMap(), not WeakMap(). This will be an error in the future."))}}()})),weakMap$1="undefined"!=typeof WeakMap?WeakMap:weakMap,shimObject=Object;Object.empty=Object.freeze(Object.create(null)),Object.isObject=function(object){return Object(object)===object},Object.getValueOf=function(value){return value&&"function"==typeof value.valueOf&&(value=value.valueOf()),value};var hashMap=new weakMap$1;Object.hash=function(object){return object&&"function"==typeof object.hash?""+object.hash():Object(object)===object?(hashMap.has(object)||hashMap.set(object,Math.random().toString(36).slice(2)),hashMap.get(object)):""+object};var owns=Object.prototype.hasOwnProperty;Object.owns=function(object,key){return owns.call(object,key)},Object.has=function(object,key){if("object"!=typeof object)throw new Error("Object.has can't accept non-object: "+typeof object);if(object&&"function"==typeof object.has)return object.has(key);if("string"==typeof key)return key in object&&object[key]!==Object.prototype[key];throw new Error("Key must be a string for Object.has on plain objects")},Object.get=function(object,key,value){if("object"!=typeof object)throw new Error("Object.get can't accept non-object: "+typeof object);return object&&"function"==typeof object.get?object.get(key,value):Object.has(object,key)?object[key]:value},Object.set=function(object,key,value){object&&"function"==typeof object.set?object.set(key,value):object[key]=value},Object.addEach=function(target,source,overrides){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)target[index]=source[index];else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||(target[key]=source[key]);else!0===source.isMap?source.forEach((function(value,key){target[key]=value})):source.forEach((function(pair){target[pair[0]]=pair[1]}));else;return target},Object.defineEach=function(target,source,overrides,configurable,enumerable,writable){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)Object.defineProperty(target,index,{value:source[index],writable:writable,configurable:configurable,enumerable:enumerable});else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||Object.defineProperty(target,key,{value:source[key],writable:writable,configurable:configurable,enumerable:enumerable});else!0===source.isMap?source.forEach((function(value,key){Object.defineProperty(target,key,{value:value,writable:writable,configurable:configurable,enumerable:enumerable})})):source.forEach((function(pair){Object.defineProperty(target,pair[0],{value:pair[1],writable:writable,configurable:configurable,enumerable:enumerable})}));else;return target},Object.forEach=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0;iKey=keys[i];i++)callback.call(thisp,object[iKey],iKey,object)},Object.map=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0,result=[];iKey=keys[i];i++)result.push(callback.call(thisp,object[iKey],iKey,object));return result},Object.values=function(object){return Object.map(object,Function.identity)},Object.concat=function(){for(var object={},i=0;i<arguments.length;i++)Object.addEach(object,arguments[i]);return object},Object.from=Object.concat,Object.is=function(x,y){return x===y?0!==x||1/x==1/y:x!=x&&y!=y},Object.equals=function(a,b,equals,memo){if(equals=equals||Object.equals,(a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return!0;if(Object.isObject(a)){if((memo=memo||new weakMap$1).has(a))return!0;memo.set(a,!0)}if(Object.isObject(a)&&"function"==typeof a.equals)return a.equals(b,equals,memo);if(Object.isObject(b)&&"function"==typeof b.equals)return b.equals(a,equals,memo);if(Object.isObject(a)&&Object.isObject(b)&&Object.getPrototypeOf(a)===Object.prototype&&Object.getPrototypeOf(b)===Object.prototype){for(var name in a)if(!equals(a[name],b[name],equals,memo))return!1;for(var name in b)if(!(name in a)||!equals(b[name],a[name],equals,memo))return!1;return!0}return a!=a&&b!=b||(!a||!b)&&a===b},Object.compare=function(a,b){if((a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return 0;var aType=typeof a,bType=typeof b;return"number"===aType&&"number"===bType?a-b:"string"===aType&&"string"===bType?a<b?-1/0:1/0:a&&"function"==typeof a.compare?a.compare(b):b&&"function"==typeof b.compare?-b.compare(a):0},Object.clone=function(value,depth,memo){if(value=Object.getValueOf(value),memo=memo||new weakMap$1,void 0===depth)depth=1/0;else if(0===depth)return value;if(Object.isObject(value)){if(!memo.has(value))if(value&&"function"==typeof value.clone)memo.set(value,value.clone(depth,memo));else{var prototype=Object.getPrototypeOf(value);if(null!==prototype&&prototype!==Object.prototype)throw new Error("Can't clone "+value);var clone=Object.create(prototype);for(var key in memo.set(value,clone),value)clone[key]=Object.clone(value[key],depth-1,memo)}return memo.get(value)}return value},Object.clear=function(object){if(object&&"function"==typeof object.clear)object.clear();else for(var keys=Object.keys(object),i=keys.length;i;)delete object[keys[--i]];return object};var genericOrder=GenericOrder;function GenericOrder(){throw new Error("Can't construct. GenericOrder is a mixin.")}GenericOrder.prototype.equals=function(that,equals){return equals=equals||this.contentEquals||shimObject.equals,this===that||!!that&&(this.length===that.length&&this.zip(that).every((function(pair){return equals(pair[0],pair[1])})))},GenericOrder.prototype.compare=function(that,compare){if(compare=compare||this.contentCompare||shimObject.compare,this===that)return 0;if(!that)return 1;var length=Math.min(this.length,that.length),comparison=this.zip(that).reduce((function(comparison,pair,index){return 0===comparison?index>=length?comparison:compare(pair[0],pair[1]):comparison}),0);return 0===comparison?this.length-that.length:comparison},GenericOrder.prototype.toJSON=function(){return this.toArray()};var array_splice=Array.prototype.splice,array_slice=Array.prototype.slice;Array.empty=[],Object.freeze&&Object.freeze(Array.empty),Array.nativeFrom=Array.from;var isSymbolDefined="undefined"!=typeof Symbol;function define(key,value){Object.defineProperty(Array.prototype,key,{value:value,writable:!0,configurable:!0,enumerable:!1})}Array.from=function(values,mapFn,thisArg){if(isSymbolDefined&&values&&"function"==typeof values[Symbol.iterator])return Array.nativeFrom(values,mapFn,thisArg);var array=[];return array.addEach(values),array},Array.unzip=function(table){for(var transpose=[],length=1/0,i=0;i<table.length;i++){var row=table[i];table[i]=row.toArray(),row.length<length&&(length=row.length)}for(i=0;i<table.length;i++){row=table[i];for(var j=0;j<row.length;j++)j<length&&j in row&&(transpose[j]=transpose[j]||[],transpose[j][i]=row[j])}return transpose},define("addEach",genericCollection.prototype.addEach),define("deleteEach",genericCollection.prototype.deleteEach),define("toArray",genericCollection.prototype.toArray),define("toObject",genericCollection.prototype.toObject),define("all",genericCollection.prototype.all),define("any",genericCollection.prototype.any),define("min",genericCollection.prototype.min),define("max",genericCollection.prototype.max),define("sum",genericCollection.prototype.sum),define("average",genericCollection.prototype.average),define("only",genericCollection.prototype.only),define("flatten",genericCollection.prototype.flatten),define("zip",genericCollection.prototype.zip),define("enumerate",genericCollection.prototype.enumerate),define("group",genericCollection.prototype.group),define("sorted",genericCollection.prototype.sorted),define("reversed",genericCollection.prototype.reversed),define("constructClone",(function(values){var clone=new this.constructor;return clone.addEach(values),clone})),define("has",(function(value,equals){return-1!==this.findValue(value,equals)})),define("get",(function(index,defaultValue){if(+index!==index)throw new Error("Indicies must be numbers");return!index in this?defaultValue:this[index]})),define("set",(function(index,value){return this[index]=value,!0})),define("add",(function(value){return this.push(value),!0})),define("delete",(function(value,equals){var index=this.findValue(value,equals);return-1!==index&&(this.spliceOne(index),!0)})),define("deleteAll",(function(value,equals){equals=equals||this.contentEquals||Object.equals;for(var count=0,index=0;index<this.length;)equals(value,this[index])?(this.swap(index,1),count++):index++;return count})),Array.prototype.find||define("find",(function(predicate){if(null==this)throw new TypeError('"this" is null or not defined');var o=Object(this),len=o.length>>>0;if("function"!=typeof predicate)throw new TypeError("predicate must be a function");for(var thisArg=arguments[1],k=0;k<len;){var kValue=o[k];if(predicate.call(thisArg,kValue,k,o))return kValue;k++}}));var deprecatedWarnNonce={};function deprecatedWarn(msg,notOnce){"undefined"!=typeof console&&"function"==typeof console.warn&&!0!==notOnce&&!1===deprecatedWarnNonce.hasOwnProperty(msg)&&(console.warn(msg),deprecatedWarnNonce[msg]++)}var ArrayFindPrototype=Object.getOwnPropertyDescriptor(Array.prototype,"find").value;function ArrayIterator(array,start,end){this.array=array,this.start=null==start?0:start,this.end=end}if(define("find",(function(value,equals,index){return"function"==typeof arguments[0]&&this instanceof Array?ArrayFindPrototype.apply(this,arguments):(deprecatedWarn("Array#find usage is deprecated please use Array#findValue"),this.findValue.apply(this,arguments))})),define("findValue",(function(value,equals,index){if(index)throw new Error("Array#findValue does not support third argument: index");equals=equals||this.contentEquals||Object.equals;for(index=0;index<this.length;index++)if(index in this&&equals(value,this[index]))return index;return-1})),define("findLast",(function(value,equals){return deprecatedWarn("Array#findLast function is deprecated please use Array#findLastValue instead."),this.findLastValue.apply(this,arguments)})),define("findLastValue",(function(value,equals){equals=equals||this.contentEquals||Object.equals;var index=this.length;do{if(--index in this&&equals(this[index],value))return index}while(index>0);return-1})),define("swap",(function(start,length,plus){var args,plusLength,i,j,returnValue;if(start>this.length&&(this.length=start),void 0!==plus){if(args=[start,length],Array.isArray(plus)||(plus=array_slice.call(plus)),i=0,(plusLength=plus.length)<1e3){for(;i<plusLength;i++)args[i+2]=plus[i];return array_splice.apply(this,args)}for(returnValue=array_splice.apply(this,args);i<plusLength;){for(args=[start+i,0],j=2;j<1002&&i<plusLength;j++,i++)args[j]=plus[i];array_splice.apply(this,args)}return returnValue}return void 0!==length?array_splice.call(this,start,length):void 0!==start?array_splice.call(this,start):[]})),define("peek",(function(){return this[0]})),define("poke",(function(value){this.length>0&&(this[0]=value)})),define("peekBack",(function(){if(this.length>0)return this[this.length-1]})),define("pokeBack",(function(value){this.length>0&&(this[this.length-1]=value)})),define("one",(function(){for(var i in this)if(Object.owns(this,i))return this[i]})),Array.prototype.clear||define("clear",(function(){return this.length=0,this})),define("compare",(function(that,compare){var i,length,relative;if(compare=compare||Object.compare,this===that)return 0;if(!that||!Array.isArray(that))return genericOrder.prototype.compare.call(this,that,compare);for(length=this.length<that.length?this.length:that.length,i=0;i<length;i++)if(i in this){if(!(i in that))return-1;if(relative=compare(this[i],that[i]))return relative}else if(i in that)return 1;return this.length-that.length})),define("equals",(function(that,equals){equals=equals||Object.equals;var i=0,length=this.length;if(this===that)return!0;if(!that||!Array.isArray(that))return genericOrder.prototype.equals.call(this,that);if(length!==that.length)return!1;for(;i<length;++i)if(i in this){if(!(i in that))return!1;if(!equals(this[i],that[i]))return!1}else if(i in that)return!1;return!0})),define("clone",(function(depth,memo){if(null==depth)depth=1/0;else if(0===depth)return this;if((memo=memo||new weakMap$1).has(this))return memo.get(this);var clone=new Array(this.length);for(var i in memo.set(this,clone),this)clone[i]=Object.clone(this[i],depth-1,memo);return clone})),define("iterate",(function(start,end){return new ArrayIterator(this,start,end)})),void 0===Array.prototype.spliceOne&&define("spliceOne",(function(index,itemToAdd){var len=this.length;if(len)if(1===arguments.length){for(;index<len;)this[index]=this[index+1],index++;this.length--}else this[index]=itemToAdd})),define("Iterator",ArrayIterator),ArrayIterator.prototype.__iterationObject=null,Object.defineProperty(ArrayIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ArrayIterator.prototype.next=function(){return this.start===(null==this.end?this.array.length:this.end)?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=this.array[this.start++],this._iterationObject},!RegExp.escape){var special=/[-[\]{}()*+?.\\^$|,#\s]/g;RegExp.escape=function(string){return string.replace(special,"\\$&")}}var genericSet=GenericSet;function GenericSet(){throw new Error("Can't construct. GenericSet is a mixin.")}GenericSet.prototype.isSet=!0,GenericSet.prototype.union=function(that){var union=this.constructClone(this);return union.addEach(that),union},GenericSet.prototype.intersection=function(that){return this.constructClone(this.filter((function(value){return that.has(value)})))},GenericSet.prototype.difference=function(that){var union=this.constructClone(this);return union.deleteEach(that),union},GenericSet.prototype.symmetricDifference=function(that){var union=this.union(that),intersection=this.intersection(that);return union.difference(intersection)},GenericSet.prototype.deleteAll=function(value){return+this.delete(value)},GenericSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.length===that.length&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GenericSet.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,value,object,depth)}),void 0)},GenericSet.prototype.toJSON=function(){return this.toArray()},GenericSet.prototype.contains=function(value){return this.has(value)},GenericSet.prototype.remove=function(value){return this.delete(value)},GenericSet.prototype.toggle=function(value){this.has(value)?this.delete(value):this.add(value)};var _valuesArrayFunction=function(value,key){return value};GenericSet.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};GenericSet.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)};var _list=List;function List(values,equals,getDefault){return List._init(List,this,values,equals,getDefault)}function ListIterator(head){this.head=head,this.at=head.next}function Node(value){this.value=value,this.prev=null,this.next=null}List._init=function(constructor,object,values,equals,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,getDefault);var head=object.head=new object.Node;head.next=head,head.prev=head,object.contentEquals=equals||Object.equals,object.getDefault=getDefault||Function.noop,object.length=0,object.addEach(values)},List.List=List,Object.addEach(List.prototype,genericCollection.prototype),Object.addEach(List.prototype,genericOrder.prototype),List.from=genericCollection.from,List.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.getDefault)},List.prototype.find=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.next);at!==head;){if(equals(at.value,value))return at;at=at.next}},List.prototype.findLast=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.prev);at!==head;){if(equals(at.value,value))return at;at=at.prev}},List.prototype.has=function(value,equals){return!!this.find(value,equals)},List.prototype.get=function(value,equals){var found=this.find(value,equals);return found?found.value:this.getDefault(value)},List.prototype.delete=function(value,equals){var found=this.findLast(value,equals);return!!found&&(found.delete(),this.length--,!0)},List.prototype.deleteAll=function(value,equals){equals=equals||this.contentEquals;for(var head=this.head,at=head.next,count=0;at!==head;)equals(value,at.value)&&(at.delete(),count++),at=at.next;return this.length-=count,count},List.prototype.clear=function(){this.head.next=this.head.prev=this.head,this.length=0},List.prototype.add=function(value){var node=new this.Node(value);return this._addNode(node)},List.prototype._addNode=function(node){return this.head.addBefore(node),this.length++,!0},List.prototype.push=function(){for(var head=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);head.addBefore(node)}this.length+=arguments.length},List.prototype.unshift=function(){for(var at=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);at.addAfter(node),at=node}this.length+=arguments.length},List.prototype._shouldPop=function(){var value,head=this.head;return head.prev!==head&&(value=head.prev.value),value},List.prototype.pop=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.prev.value;var index=this.length-1,popDispatchValueArray=_before?_before.call(this,value,index):void 0;head.prev.delete(),this.length--,_after&&_after.call(this,value,index,popDispatchValueArray)}return value},List.prototype.shift=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.next.value;var dispatchValueArray=_before?_before.call(this,value,0):void 0;head.next.delete(),this.length--,_after&&_after.call(this,value,0,dispatchValueArray)}return value},List.prototype.peek=function(){if(this.head!==this.head.next)return this.head.next.value},List.prototype.poke=function(value){this.head!==this.head.next?this.head.next.value=value:this.push(value)},List.prototype.one=function(){return this.peek()},List.prototype.scan=function(at,fallback){var head=this.head;if("number"==typeof at){var count=at;if(count>=0)for(at=head.next;count&&(count--,(at=at.next)!=head););else for(at=head;count<0&&(count++,(at=at.prev)!=head););return at}return at||fallback},List.prototype.slice=function(at,end){var sliced=[],head=this.head;for(at=this.scan(at,head.next),end=this.scan(end,head);at!==end&&at!==head;)sliced.push(at.value),at=at.next;return sliced},List.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},List.prototype.swap=function(start,length,plus,_before,_after){var initial=start;start=this.scan(start,this.head),null==length&&(length=1/0),plus=Array.from(plus);for(var minus=[],at=start;length--&&length>=0&&at!==this.head;)minus.push(at.value),at=at.next;_before&&_before.call(this,start,plus,minus);at=start;var i=0;for(at=start;i<minus.length;i++,at=at.next)at.delete();null==initial&&at===this.head&&(at=this.head.next);for(i=0;i<plus.length;i++){var node=new this.Node(plus[i]);at.addBefore(node)}return this.length+=plus.length-minus.length,_after&&_after.call(this,start,plus,minus),minus},List.prototype.reverse=function(){var at=this.head;do{var temp=at.next;at.next=at.prev,at.prev=temp,at=at.next}while(at!==this.head);return this},List.prototype.sort=function(){this.swap(0,this.length,this.sorted.apply(this,arguments))},List.prototype.reduce=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.next;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.next;return basis},List.prototype.reduceRight=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.prev;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.prev;return basis},List.prototype.updateIndexes=function(node,index){for(;node!==this.head;)node.index=index++,node=node.next},List.prototype.iterate=function(){return new ListIterator(this.head)},ListIterator.prototype.__iterationObject=null,Object.defineProperty(ListIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ListIterator.prototype.next=function(){if(this.at===this.head)this._iterationObject.done=!0,this._iterationObject.value=void 0;else{var value=this.at.value;this.at=this.at.next,this._iterationObject.value=value}return this._iterationObject},List.prototype.Node=Node,Node.prototype.delete=function(){this.prev.next=this.next,this.next.prev=this.prev},Node.prototype.addBefore=function(node){var prev=this.prev;this.prev=node,node.prev=prev,prev.next=node,node.next=this},Node.prototype.addAfter=function(node){var next=this.next;this.next=node,node.next=next,next.prev=node,node.prev=this};var iterator=Iterator;function Iterator(iterable,standardMode){var values=standardMode&&iterable&&iterable.values&&iterable.values();if(values&&"function"==typeof values.next)return values;if(!(this instanceof Iterator))return new Iterator(iterable);if(Array.isArray(iterable)||"string"==typeof iterable)return Iterator.iterate(iterable);if((iterable=shimObject(iterable))instanceof Iterator)return iterable;if(iterable.next)this.next=function(){return iterable.next()};else if(iterable.iterate){var iterator=iterable.iterate();this.next=function(){return iterator.next()}}else{if("[object Function]"!==shimObject.prototype.toString.call(iterable))throw new TypeError("Can't iterate "+iterable);this.next=iterable}}Iterator.prototype.forEach=genericCollection.prototype.forEach,Iterator.prototype.map=genericCollection.prototype.map,Iterator.prototype.filter=genericCollection.prototype.filter,Iterator.prototype.every=genericCollection.prototype.every,Iterator.prototype.some=genericCollection.prototype.some,Iterator.prototype.any=genericCollection.prototype.any,Iterator.prototype.all=genericCollection.prototype.all,Iterator.prototype.min=genericCollection.prototype.min,Iterator.prototype.max=genericCollection.prototype.max,Iterator.prototype.sum=genericCollection.prototype.sum,Iterator.prototype.average=genericCollection.prototype.average,Iterator.prototype.flatten=genericCollection.prototype.flatten,Iterator.prototype.zip=genericCollection.prototype.zip,Iterator.prototype.enumerate=genericCollection.prototype.enumerate,Iterator.prototype.sorted=genericCollection.prototype.sorted,Iterator.prototype.group=genericCollection.prototype.group,Iterator.prototype.reversed=genericCollection.prototype.reversed,Iterator.prototype.toArray=genericCollection.prototype.toArray,Iterator.prototype.toObject=genericCollection.prototype.toObject,Iterator.prototype.iterator=genericCollection.prototype.iterator,Iterator.prototype.__iterationObject=null,shimObject.defineProperty(Iterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:void 0})}}),Iterator.prototype.constructClone=function(values){var clone=[];return clone.addEach(values),clone},Iterator.prototype.mapIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var callbackValue=callback.call(thisp,self.next().value,i++,self);self._iterationObject.value=callbackValue}return self._iterationObject}))},Iterator.prototype.filterIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){for(var nextEntry;;){if(!0===(nextEntry=self.next()).done)return nextEntry;if(callback.call(thisp,nextEntry.value,i++,self))return nextEntry}}))},Iterator.prototype.reduce=function(callback){var nextEntry,self=Iterator(this),result=arguments[1],thisp=arguments[2],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;if(!0===(nextEntry=self.next()).done){if(arguments.length>1)return arguments[1];throw TypeError("cannot reduce a value from an empty iterator with no initial value")}for(result=arguments.length>1?callback.call(thisp,result,nextEntry.value,i,self):nextEntry.value,i++;;){if(!0===(nextEntry=self.next()).done)return result;result=callback.call(thisp,result,nextEntry.value,i,self),i++}},Iterator.prototype.concat=function(){return Iterator.concat(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.dropWhile=function(callback){var stopValue,nextEntry,self=Iterator(this),thisp=arguments[1],stopped=!1,i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;for(;!0!==(nextEntry=self.next()).done;){if(!callback.call(thisp,nextEntry.value,i,self)){stopped=!0,stopValue=nextEntry.value;break}i++}return stopped?self.constructor([stopValue]).concat(self):self.constructor([])},Iterator.prototype.takeWhile=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var value=self.next().value;callback.call(thisp,value,i++,self)?self._iterationObject.value=value:(self._iterationObject.done=!0,self._iterationObject.value=void 0)}return self._iterationObject}))},Iterator.prototype.zipIterator=function(){return Iterator.unzip(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.enumerateIterator=function(start){return Iterator.count(start).zipIterator(this)},Iterator.iterate=function(iterable){var start;return start=0,new Iterator((function(){if("object"==typeof iterable)for(;!(start in iterable);){if(start>=iterable.length){this._iterationObject.done=!0,this._iterationObject.value=void 0;break}start+=1}else start>=iterable.length&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);return this._iterationObject.done||(this._iterationObject.value=iterable[start],start+=1),this._iterationObject}))},Iterator.cycle=function(cycle,times){var next;return arguments.length<2&&(times=1/0),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),next&&!0!==nextEntry.done||(times>0?(times--,iteration=Iterator.iterate(cycle),nextEntry=(next=iteration.next.bind(iteration))()):(this._iterationObject.done=!0,nextEntry=this._iterationObject)),nextEntry}))},Iterator.concat=function(iterators){var next;return iterators=Iterator(iterators),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),nextEntry&&!0!==nextEntry.done?nextEntry:!1===(nextEntry=iterators.next()).done?(iteration=Iterator(nextEntry.value),(next=iteration.next.bind(iteration))()):nextEntry}))},Iterator.unzip=function(iterators){return 0===(iterators=Iterator(iterators).map(Iterator)).length?new Iterator([]):new Iterator((function(){var stopped,nextEntry,result=iterators.map((function(iterator){return!0===(nextEntry=iterator.next()).done&&(stopped=!0),nextEntry.value}));return stopped?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=result,this._iterationObject}))},Iterator.zip=function(){return Iterator.unzip(Array.prototype.slice.call(arguments))},Iterator.chain=function(){return Iterator.concat(Array.prototype.slice.call(arguments))},Iterator.range=function(start,stop,step){return arguments.length<3&&(step=1),arguments.length<2&&(stop=start,start=0),start=start||0,step=step||1,new Iterator((function(){start>=stop&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);var result=start;return start+=step,this._iterationObject.value=result,this._iterationObject}))},Iterator.count=function(start,step){return Iterator.range(start,1/0,step)},Iterator.repeat=function(value,times){return new Iterator.range(times).mapIterator((function(){return value}))};var genericMap=GenericMap;function GenericMap(){throw new Error("Can't construct. GenericMap is a mixin.")}function Item(key,value){this.key=key,this.value=value}GenericMap.prototype.isMap=!0,GenericMap.prototype.addEach=function(values){var i;if(values&&shimObject(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);else shimObject.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},GenericMap.prototype.get=function(key,defaultValue){var item=this.store.get(new this.Item(key));return item?item.value:arguments.length>1?(console.log("Use of a second argument as default value is deprecated to match standards"),defaultValue):this.getDefault(key)},GenericMap.prototype.set=function(key,value){var item=new this.Item(key,value),found=this.store.get(item);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found.value),found.value=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.store.add(item)&&this.length++,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},GenericMap.prototype.add=function(value,key){return this.set(key,value)},GenericMap.prototype.has=function(key){return this.store.has(new this.Item(key))},GenericMap.prototype.delete=function(key){var item=new this.Item(key);if(this.store.has(item)){var from=this.store.get(item).value;return this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,from),this.store.delete(item),this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0}return!1},GenericMap.prototype.clear=function(){var keys,key;if(this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),this.store.clear(),this.length=0,this.dispatchesMapChanges)for(var i=0;key=keys[i];i++)this.dispatchMapChange(key)},GenericMap.prototype.reduce=function(callback,basis,thisp){return this.store.reduce((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.reduceRight=function(callback,basis,thisp){return this.store.reduceRight((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.keysArray=function(){return this.map((function(value,key){return key}))},GenericMap.prototype.keys=function(){return new iterator(this.keysArray(),!0)},GenericMap.prototype.valuesArray=function(){return this.map(Function.identity)},GenericMap.prototype.values=function(){return new iterator(this.valuesArray(),!0)},GenericMap.prototype.entriesArray=function(){return this.map((function(value,key){return[key,value]}))},GenericMap.prototype.entries=function(){return new iterator(this.entriesArray(),!0)},GenericMap.prototype.items=function(){return this.entriesArray()},GenericMap.prototype.equals=function(that,equals){return equals=equals||shimObject.equals,this===that||(that&&"function"==typeof that.every?that.length===this.length&&that.every((function(value,key){return equals(this.get(key),value)}),this):shimObject.keys(that).length===this.length&&shimObject.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))},GenericMap.prototype.toJSON=function(){return this.entriesArray()},GenericMap.prototype.Item=Item,Item.prototype.equals=function(that){return shimObject.equals(this.key,that.key)&&shimObject.equals(this.value,that.value)},Item.prototype.compare=function(that){return shimObject.compare(this.key,that.key)};var _dict=Dict;function Dict(values,getDefault){if(!(this instanceof Dict))return new Dict(values,getDefault);getDefault=getDefault||Function.noop,this.getDefault=getDefault,this.store=Object.create(null),this.length=0,this.addEach(values)}Dict.Dict=Dict,Object.addEach(Dict.prototype,genericCollection.prototype),Object.addEach(Dict.prototype,genericMap.prototype),Dict.from=genericCollection.from,Dict.prototype.constructClone=function(values){return new this.constructor(values,this.getDefault)},Dict.prototype.assertString=function(key){if("string"!=typeof key)throw new TypeError("key must be a string but Got "+key)},Object.defineProperty(Dict.prototype,"$__proto__",{writable:!0}),Object.defineProperty(Dict.prototype,"_hasProto",{get:function(){return this.hasOwnProperty("$__proto__")&&void 0!==this._protoValue}}),Object.defineProperty(Dict.prototype,"_protoValue",{get:function(){return this.$__proto__},set:function(value){this.$__proto__=value}}),Object.defineProperty(Dict.prototype,"size",genericCollection._sizePropertyDescriptor),Dict.prototype.get=function(key,defaultValue){return this.assertString(key),"__proto__"===key?this._hasProto?this._protoValue:arguments.length>1?defaultValue:this.getDefault(key):key in this.store?this.store[key]:arguments.length>1?defaultValue:this.getDefault(key)},Dict.prototype.set=function(key,value){this.assertString(key);var isProtoKey="__proto__"===key;return(isProtoKey?this._hasProto:key in this.store)?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,isProtoKey?this._protoValue:this.store[key]),isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!1):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.length++,isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!0)},Dict.prototype.has=function(key){return this.assertString(key),"__proto__"===key?this._hasProto:key in this.store},Dict.prototype.delete=function(key){return this.assertString(key),"__proto__"===key?!!this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this._protoValue),this._protoValue=void 0,this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0):key in this.store&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)},Dict.prototype.clear=function(){var key;for(key in this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange("__proto__",this._protoValue),this._protoValue=void 0,this.dispatchesMapChanges&&this.dispatchMapChange("__proto__",void 0)),this.store)this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0);this.length=0},Dict.prototype.reduce=function(callback,basis,thisp){this._hasProto&&(basis=callback.call(thisp,basis,"$__proto__","__proto__",this));var store=this.store;for(var key in this.store)basis=callback.call(thisp,basis,store[key],key,this);return basis},Dict.prototype.reduceRight=function(callback,basis,thisp){var self=this,store=this.store;return basis=Object.keys(this.store).reduceRight((function(basis,key){return callback.call(thisp,basis,store[key],key,self)}),basis),this._hasProto?callback.call(thisp,basis,this._protoValue,"__proto__",self):basis},Dict.prototype.one=function(){var key;for(key in this.store)return this.store[key];return this._protoValue},Dict.prototype.toJSON=function(){return this.toObject()};var treeLog=TreeLog;function TreeLog(){}TreeLog.ascii={intersection:"+",through:"-",branchUp:"+",branchDown:"+",fromBelow:".",fromAbove:"'",fromBoth:"+",strafe:"|"},TreeLog.unicodeRound={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"╭",fromAbove:"╰",fromBoth:"┣",strafe:"┃"},TreeLog.unicodeSharp={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"┏",fromAbove:"┗",fromBoth:"┣",strafe:"┃"};var _fastSet=FastSet;function FastSet(values,equals,hash,getDefault){if(!(this instanceof FastSet))return new FastSet(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault;var self=this;this.buckets=new this.Buckets(null,(function(){return new self.Bucket})),this.length=0,this.addEach(values)}FastSet.FastSet=FastSet,Object.addEach(FastSet.prototype,genericCollection.prototype),Object.addEach(FastSet.prototype,genericSet.prototype),FastSet.from=genericCollection.from,FastSet.prototype.Buckets=_dict,FastSet.prototype.Bucket=_list,FastSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},FastSet.prototype.has=function(value){var hash=this.contentHash(value);return this.buckets.get(hash).has(value)},FastSet.prototype.get=function(value,equals){if(equals)throw new Error("FastSet#get does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)?buckets.get(hash).get(value):this.getDefault(value)},FastSet.prototype.delete=function(value,equals){if(equals)throw new Error("FastSet#delete does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;if(buckets.has(hash)){var bucket=buckets.get(hash);if(bucket.delete(value))return this.length--,0===bucket.length&&buckets.delete(hash),!0}return!1},FastSet.prototype.clear=function(){this.buckets.clear(),this.length=0},FastSet.prototype.add=function(value){var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)||buckets.set(hash,new this.Bucket(null,this.contentEquals)),!buckets.get(hash).has(value)&&(buckets.get(hash).add(value),this.length++,!0)},FastSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],buckets=this.buckets,index=0;return buckets.reduce((function(basis,bucket){return bucket.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)}),basis,this)},FastSet.prototype.one=function(){if(this.length>0)return this.buckets.one().one()},FastSet.prototype.iterate=function(){return this.buckets.valuesArray().flatten().iterate()},FastSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeSharp,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp);for(var hash,branch,leader,bucket,buckets=this.buckets,bucketsSize=buckets.size,mapIter=buckets.keys(),index=0;hash=mapIter.next().value;)index===bucketsSize-1?(branch=charmap.fromAbove,leader=" "):0===index?(branch=charmap.branchDown,leader=charmap.strafe):(branch=charmap.fromBoth,leader=charmap.strafe),bucket=buckets.get(hash),callback.call(thisp,branch+charmap.through+charmap.branchDown+" "+hash),bucket.forEach((function(value,node){var branch,below,written;node===bucket.head.prev?(branch=charmap.fromAbove,below=" "):(branch=charmap.fromBoth,below=charmap.strafe),logNode(node,(function(line){written?callback.call(thisp,leader+" "+below+"  "+line):(callback.call(thisp,leader+" "+branch+charmap.through+charmap.through+line),written=!0)}),(function(line){callback.call(thisp,leader+" "+charmap.strafe+"  "+line)}))})),index++},FastSet.prototype.logNode=function(node,write){var value=node.value;Object(value)===value?JSON.stringify(value,null,4).split("\n").forEach((function(line){write(" "+line)})):write(" "+value)};var _set=createCommonjsModule((function(module){var GlobalSet,CollectionsSet;void 0!==commonjsGlobal.Set&&"function"==typeof commonjsGlobal.Set.prototype.values&&((GlobalSet=module.exports=commonjsGlobal.Set).Set=GlobalSet,GlobalSet.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value){basis=callback.call(thisp,basis,value,this)})),basis},GlobalSet.prototype.reduceRight=function(callback,basis){for(var value,thisp=arguments[2],setIterator=this.values(),size=this.size,reverseOrder=new Array(this.size),i=size;value=setIterator.next().value;)reverseOrder[--i]=value;for(;i<size;)basis=callback.call(thisp,basis,reverseOrder[i++],this);return basis},GlobalSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.size===(that.size||that.length)&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GlobalSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},GlobalSet.prototype.toJSON=function(){return this.entriesArray()},GlobalSet.prototype.one=function(){if(this.size>0)return this.values().next().value},GlobalSet.prototype.pop=function(){if(this.size){for(var aValue,value,setIterator=this.values();aValue=setIterator.next().value;)value=aValue;return this.delete(value,this.size-1),value}},GlobalSet.prototype.shift=function(){if(this.size){var firstValue=this.values().next().value;return this.delete(firstValue,0),firstValue}},Object.defineProperty(GlobalSet.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0}),GlobalSet.from=function(value){var result=new this;return result.addEach(value),result},Object.addEach(GlobalSet.prototype,genericCollection.prototype,!1),Object.addEach(GlobalSet.prototype,genericSet.prototype,!1)),(CollectionsSet=function CollectionsSet(values,equals,hash,getDefault){return CollectionsSet._init(CollectionsSet,this,values,equals,hash,getDefault)})._init=function(constructor,object,values,equals,hash,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,object.contentEquals=equals,object.contentHash=hash,object.getDefault=getDefault,object.order=new object.Order(void 0,equals),object.store=new object.Store(void 0,(function(a,b){return equals(a.value,b.value)}),(function(node){return hash(node.value)})),object.length=0,object.addEach(values)},CollectionsSet.Set=CollectionsSet,CollectionsSet.CollectionsSet=CollectionsSet,Object.addEach(CollectionsSet.prototype,genericCollection.prototype),Object.addEach(CollectionsSet.prototype,genericSet.prototype),CollectionsSet.from=genericCollection.from,Object.defineProperty(CollectionsSet.prototype,"size",genericCollection._sizePropertyDescriptor),CollectionsSet.prototype.Order=_list,CollectionsSet.prototype.Store=_fastSet,CollectionsSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},CollectionsSet.prototype.has=function(value){var node=new this.order.Node(value);return this.store.has(node)},CollectionsSet.prototype.get=function(value,equals){if(equals)throw new Error("Set#get does not support second argument: equals");var node=new this.order.Node(value);return(node=this.store.get(node))?node.value:this.getDefault(value)},CollectionsSet.prototype.add=function(value){var node=new this.order.Node(value);if(!this.store.has(node)){this.length;return this.order.add(value),node=this.order.head.prev,this.store.add(node),this.length++,!0}return!1},CollectionsSet.prototype.delete=function(value,equals){if(equals)throw new Error("Set#delete does not support second argument: equals");var node=new this.order.Node(value);return!!this.store.has(node)&&(node=this.store.get(node),this.store.delete(node),this.order.splice(node,1),this.length--,!0)},CollectionsSet.prototype.pop=function(){if(this.length){var result=this.order.head.prev.value;return this.delete(result),result}},CollectionsSet.prototype.shift=function(){if(this.length){var result=this.order.head.next.value;return this.delete(result),result}},CollectionsSet.prototype.one=function(){if(this.length>0)return this.store.one().value},CollectionsSet.prototype.clear=function(){this.store.clear(),this.order.clear(),this.length=0},Object.defineProperty(CollectionsSet.prototype,"_clear",{value:CollectionsSet.prototype.clear}),CollectionsSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],list=this.order,index=0;return list.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)},CollectionsSet.prototype.reduceRight=function(callback,basis){var thisp=arguments[2],list=this.order,index=this.length-1;return list.reduceRight((function(basis,value){return callback.call(thisp,basis,value,index--,this)}),basis,this)},CollectionsSet.prototype.iterate=function(){return this.order.iterate()},CollectionsSet.prototype.values=function(){return new iterator(this.valuesArray(),!0)},CollectionsSet.prototype.log=function(){var set=this.store;return set.log.apply(set,arguments)},GlobalSet?(GlobalSet.prototype.valuesArray=genericSet.prototype.valuesArray,GlobalSet.prototype.entriesArray=genericSet.prototype.entriesArray,module.exports=GlobalSet,GlobalSet.CollectionsSet=CollectionsSet):module.exports=CollectionsSet})),_map=createCommonjsModule((function(module){var Map,GlobalMap,CollectionsMap;if(void 0!==commonjsGlobal.Map&&"function"==typeof commonjsGlobal.Set.prototype.values){var map_makeObservable;GlobalMap=Map=module.exports=commonjsGlobal.Map,Map.Map=Map,map_makeObservable={}.__proto__===Object.prototype?function(){this.__proto__=ChangeDispatchMap}:function(){Object.defineProperties(this,observableSetProperties)},Object.defineProperty(Map.prototype,"makeObservable",{value:map_makeObservable,writable:!0,configurable:!0,enumerable:!1}),Object.defineProperty(Map.prototype,"makePropertyObservable",{value:function(){},writable:!0,configurable:!0,enumerable:!1}),Map.prototype.constructClone=function(values){return new this.constructor(values)},Map.prototype.isMap=!0,Map.prototype.addEach=function(values){if(values&&Object(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(var i=0;i<values.length;i++)this.add(values[i],i);else Object.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},Map.prototype.add=function(value,key){return this.set(key,value)},Map.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value,key,map){basis=callback.call(thisp,basis,value,key,this)})),basis},Map.prototype.reduceRight=function(callback,basis){for(var aKey,thisp=arguments[2],keysIterator=this.keys(),size=this.size,reverseOrder=new Array(this.size),i=0;aKey=keysIterator.next().value;)reverseOrder[--size]=aKey;for(;i++<size;)basis=callback.call(thisp,basis,this.get(reverseOrder[i]),reverseOrder[i],this);return basis},Map.prototype.equals=function(that,equals){return equals=equals||Object.equals,this===that||(that&&"function"==typeof that.every?that.size===this.size&&that.every((function(value,key){return equals(this.get(key),value)}),this):Object.keys(that).length===this.size&&Object.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))};var _keysArrayFunction=function(value,key){return key};Map.prototype.keysArray=function(){return this.map(_keysArrayFunction)};var _valuesArrayFunction=function(value,key){return value};Map.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};Map.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)},Map.prototype.toJSON=function(){return this.entriesArray()},Map.prototype.items=function(){return this.entriesArray()},Map.from=function(value){var result=new this;return result.addEach(value),result},Object.defineProperty(Map.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0});var map_clear=Map.prototype.clear,map_set=Map.prototype.set,map_delete=Map.prototype.delete,observableMapProperties={clear:{value:function(){var keys;this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),map_clear.call(this),this.dispatchesMapChanges&&keys.forEach((function(key){this.dispatchMapChange(key)}),this)},writable:!0,configurable:!0},set:{value:function(key,value){var found=this.get(key);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},writable:!0,configurable:!0},delete:{value:function(key){return!!this.has(key)&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.get(key)),map_delete.call(this,key),this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)}}};Object.addEach(Map.prototype,genericCollection.prototype,!1);var ChangeDispatchMap=Object.create(Map.prototype,observableMapProperties)}var Set=_set.CollectionsSet;CollectionsMap=Map=function Map(values,equals,hash,getDefault){if(!(this instanceof Map))return new Map(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault,this.store=new Set(void 0,(function(a,b){return equals(a.key,b.key)}),(function(item){return hash(item.key)})),this.length=0,this.addEach(values)},Map.Map=Map,Object.addEach(Map.prototype,genericCollection.prototype),Object.addEach(Map.prototype,genericMap.prototype),Object.defineProperty(Map.prototype,"size",genericCollection._sizePropertyDescriptor),Map.from=genericCollection.from,Map.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},Map.prototype.log=function(charmap,logNode,callback,thisp){logNode=logNode||this.logNode,this.store.log(charmap,(function(node,log,logBefore){logNode(node.value.value,log,logBefore)}),callback,thisp)},Map.prototype.logNode=function(node,log){log(" key: "+node.key),log(" value: "+node.value)},GlobalMap?(module.exports=GlobalMap,GlobalMap.CollectionsMap=CollectionsMap):module.exports=CollectionsMap})),changeDescriptor=createCommonjsModule((function(module){var ObjectChangeDescriptor=module.exports.ObjectChangeDescriptor=function(name){return this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null,this};Object.defineProperties(ObjectChangeDescriptor.prototype,{name:{value:null,writable:!0},isActive:{value:!1,writable:!0},_willChangeListeners:{value:null,writable:!0},willChangeListeners:{get:function(){return this._willChangeListeners||(this._willChangeListeners=new this.willChangeListenersRecordConstructor(this.name))}},_changeListeners:{value:null,writable:!0},changeListeners:{get:function(){return this._changeListeners||(this._changeListeners=new this.changeListenersRecordConstructor(this.name))}},changeListenersRecordConstructor:{value:ChangeListenersRecord,writable:!0},willChangeListenersRecordConstructor:{value:WillChangeListenersRecord,writable:!0}});var ListenerGhost=module.exports.ListenerGhost=Object.create(null),ChangeListenerSpecificHandlerMethodName=new _map;function ChangeListenersRecord(name){var specificHandlerMethodName=ChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="Change",ChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this._current=null,this._current=null,this.specificHandlerMethodName=specificHandlerMethodName,this}module.exports.ChangeListenersRecord=ChangeListenersRecord,Object.defineProperties(ChangeListenersRecord.prototype,{_current:{value:null,writable:!0},current:{get:function(){return this._current},set:function(value){this._current=value}},ListenerGhost:{value:ListenerGhost,writable:!0},ghostCount:{value:0,writable:!0},maxListenerGhostRatio:{value:.3,writable:!0},listenerGhostFilter:{value:function(value){return value!==this.ListenerGhost}},removeCurrentGostListenersIfNeeded:{value:function(){return this._current&&this.ghostCount/this._current.length>this.maxListenerGhostRatio&&(this.ghostCount=0,this._current=this._current.filter(this.listenerGhostFilter,this)),this._current}},dispatchBeforeChange:{value:!1,writable:!0},genericHandlerMethodName:{value:"handlePropertyChange",writable:!0}}),module.exports.WillChangeListenersRecord=WillChangeListenersRecord;var WillChangeListenerSpecificHandlerMethodName=new _map;function WillChangeListenersRecord(name){var specificHandlerMethodName=WillChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="WillChange",WillChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}WillChangeListenersRecord.prototype=new ChangeListenersRecord,WillChangeListenersRecord.prototype.constructor=WillChangeListenersRecord,WillChangeListenersRecord.prototype.genericHandlerMethodName="handlePropertyWillChange"})),propertyChanges=(changeDescriptor.ObjectChangeDescriptor,changeDescriptor.ListenerGhost,changeDescriptor.ChangeListenersRecord,changeDescriptor.WillChangeListenersRecord,PropertyChanges);function PropertyChanges(){throw new Error("This is an abstract interface. Mix it. Don't construct it")}var ObjectChangeDescriptor=changeDescriptor.ObjectChangeDescriptor,ListenerGhost=changeDescriptor.ListenerGhost;PropertyChanges.debug=!0;var ObjectsPropertyChangeListeners=new weakMap$1,ObjectChangeDescriptorName=new _map;function dispatchEach(listeners,key,value,object){if(listeners&&listeners._current){var current,listener,i,countI,thisp,specificHandlerMethodName=listeners.specificHandlerMethodName,genericHandlerMethodName=listeners.genericHandlerMethodName,Ghost=ListenerGhost;if(Array.isArray(listeners._current)){for(i=0,countI=(current=listeners.removeCurrentGostListenersIfNeeded()).length;i<countI;i++)if((thisp=current[i])!==Ghost){if(!(listener=thisp[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}else{if(!(listener=(thisp=listeners._current)[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}}PropertyChanges.ObjectChangeDescriptor=function(){},PropertyChanges.prototype.getOwnPropertyChangeDescriptor=function(key){var keyChangeDescriptor,objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);if(objectPropertyChangeDescriptors||(objectPropertyChangeDescriptors=Object.create(null),ObjectsPropertyChangeListeners.set(this,objectPropertyChangeDescriptors)),void 0===(keyChangeDescriptor=objectPropertyChangeDescriptors[key])){var propertyName=ObjectChangeDescriptorName.get(key);return propertyName||(propertyName=(propertyName=String(key))&&propertyName[0].toUpperCase()+propertyName.slice(1),ObjectChangeDescriptorName.set(key,propertyName)),objectPropertyChangeDescriptors[key]=new ObjectChangeDescriptor(propertyName)}return keyChangeDescriptor},PropertyChanges.prototype.hasOwnPropertyChangeDescriptor=function(key){var objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);return!!objectPropertyChangeDescriptors&&(!key||void 0!==objectPropertyChangeDescriptors[key])},PropertyChanges.prototype.addOwnPropertyChangeListener=function(key,listener,beforeChange){this.makeObservable&&!this.isObservable&&this.makeObservable();var descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key),listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners;PropertyChanges.makePropertyObservable(this,key),listeners._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener;var self=this;return function(){PropertyChanges.removeOwnPropertyChangeListener(self,key,listener,beforeChange),self=null}},PropertyChanges.prototype.addBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.addOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.removeOwnPropertyChangeListener=function removeOwnPropertyChangeListener(key,listener,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove property change listener: does not exist: property name"+JSON.stringify(key));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=removeOwnPropertyChangeListener.ListenerGhost):listeners._current.spliceOne(index)}},PropertyChanges.prototype.removeOwnPropertyChangeListener.ListenerGhost=ListenerGhost,PropertyChanges.prototype.removeBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.removeOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.dispatchOwnPropertyChange=function dispatchOwnPropertyChange(key,value,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if(!descriptor.isActive){descriptor.isActive=!0,listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners;try{dispatchOwnPropertyChange.dispatchEach(listeners,key,value,this)}finally{descriptor.isActive=!1}}},PropertyChanges.prototype.dispatchOwnPropertyChange.dispatchEach=dispatchEach,dispatchEach.ListenerGhost=ListenerGhost,PropertyChanges.prototype.dispatchBeforeOwnPropertyChange=function(key,listener){return PropertyChanges.dispatchOwnPropertyChange(this,key,listener,!0)};var ObjectsOverriddenPropertyDescriptors=new weakMap$1,propertyListener=(new weakMap$1,{get:void 0,set:void 0,configurable:!0,enumerable:!1});PropertyChanges.prototype.makePropertyObservable=function(key){var overriddenPropertyDescriptors=ObjectsOverriddenPropertyDescriptors.get(this);if(!overriddenPropertyDescriptors||void 0===overriddenPropertyDescriptors.get(key)){if(!overriddenPropertyDescriptors){if(Array.isArray(this))return;if(!Object.isExtensible(this))throw new Error("Can't make property "+JSON.stringify(key)+" observable on "+this+" because object is not extensible");overriddenPropertyDescriptors=new _map,ObjectsOverriddenPropertyDescriptors.set(this,overriddenPropertyDescriptors)}var overriddenDescriptor,attached=this;do{if(overriddenDescriptor=Object.getOwnPropertyDescriptor(attached,key))break;attached=Object.getPrototypeOf(attached)}while(attached);if(overriddenDescriptor){if(!overriddenDescriptor.configurable)return;if(!overriddenDescriptor.writable&&!overriddenDescriptor.set)return}else overriddenDescriptor={value:void 0,enumerable:!0,writable:!0,configurable:!0};overriddenPropertyDescriptors.set(key,overriddenDescriptor),"value"in overriddenDescriptor?(propertyListener.get=function dispatchingGetter(){return dispatchingGetter.overriddenDescriptor.value},propertyListener.set=function dispatchingSetter(value){var descriptor,isActive,overriddenDescriptor=dispatchingSetter.overriddenDescriptor;if(value!==overriddenDescriptor.value){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,dispatchingSetter.key,overriddenDescriptor.value,this)}finally{}}if(overriddenDescriptor.value=value,!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,dispatchingSetter.key,value,this)}finally{descriptor.isActive=!1}}},propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.key=key,propertyListener.get.overriddenDescriptor=propertyListener.set.overriddenDescriptor=overriddenDescriptor,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key],propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0):(propertyListener.get=overriddenDescriptor.get,propertyListener.set=function dispatchingSetter(){var descriptor,isActive,newValue,formerValue=dispatchingSetter.overriddenGetter.call(this);if(1===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0]):2===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0],arguments[1]):dispatchingSetter.overriddenSetter.apply(this,arguments),(newValue=dispatchingSetter.overriddenGetter.call(this))!==formerValue){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,key,formerValue,this)}finally{}}if(!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,key,newValue,this)}finally{descriptor.isActive=!1}}},propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0,propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.overriddenSetter=overriddenDescriptor.set,propertyListener.set.overriddenGetter=overriddenDescriptor.get,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key]),Object.defineProperty(this,key,propertyListener)}},PropertyChanges.getOwnPropertyChangeDescriptor=function(object,key){return object.getOwnPropertyChangeDescriptor?object.getOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.getOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.hasOwnPropertyChangeDescriptor=function(object,key){return object.hasOwnPropertyChangeDescriptor?object.hasOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.hasOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.addOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.addOwnPropertyChangeListener?object.addOwnPropertyChangeListener(key,listener,beforeChange):this.prototype.addOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.removeOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.removeOwnPropertyChangeListener?object.removeOwnPropertyChangeListener(key,listener,beforeChange):PropertyChanges.prototype.removeOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.dispatchOwnPropertyChange=function(object,key,value,beforeChange){if(Object.isObject(object))return object.dispatchOwnPropertyChange?object.dispatchOwnPropertyChange(key,value,beforeChange):PropertyChanges.prototype.dispatchOwnPropertyChange.call(object,key,value,beforeChange)},PropertyChanges.addBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.addOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.removeBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.removeOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.dispatchBeforeOwnPropertyChange=function(object,key,value){return PropertyChanges.dispatchOwnPropertyChange(object,key,value,!0)},PropertyChanges.makePropertyObservable=function(object,key){return object.makePropertyObservable?object.makePropertyObservable(key):PropertyChanges.prototype.makePropertyObservable.call(object,key)};var ObjectChangeDescriptor$1=changeDescriptor.ObjectChangeDescriptor,ChangeListenersRecord=changeDescriptor.ChangeListenersRecord,ListenerGhost$1=changeDescriptor.ListenerGhost,rangeChangeDescriptors=new weakMap$1;function RangeChangeDescriptor(name){this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null}RangeChangeDescriptor.prototype=new ObjectChangeDescriptor$1,RangeChangeDescriptor.prototype.constructor=RangeChangeDescriptor,RangeChangeDescriptor.prototype.changeListenersRecordConstructor=RangeChangeListenersRecord,RangeChangeDescriptor.prototype.willChangeListenersRecordConstructor=RangeWillChangeListenersRecord,Object.defineProperty(RangeChangeDescriptor.prototype,"active",{get:function(){return this._active||(this._active=this._current?this._current.slice():[])}});var RangeChangeListenersSpecificHandlerMethodName=new _map;function RangeChangeListenersRecord(name){var specificHandlerMethodName=RangeChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeChange",RangeChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeChangeListenersRecord.prototype=new ChangeListenersRecord,RangeChangeListenersRecord.prototype.constructor=RangeChangeListenersRecord;var RangeWillChangeListenersSpecificHandlerMethodName=new _map;function RangeWillChangeListenersRecord(name){var specificHandlerMethodName=RangeWillChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeWillChange",RangeWillChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeWillChangeListenersRecord.prototype=new ChangeListenersRecord,RangeWillChangeListenersRecord.prototype.constructor=RangeWillChangeListenersRecord;var rangeChanges=RangeChanges;function RangeChanges(){throw new Error("Can't construct. RangeChanges is a mixin.")}RangeChanges.prototype.getAllRangeChangeDescriptors=function(){return rangeChangeDescriptors.has(this)||rangeChangeDescriptors.set(this,new _map),rangeChangeDescriptors.get(this)},RangeChanges.prototype.getRangeChangeDescriptor=function(token){var tokenChangeDescriptors=this.getAllRangeChangeDescriptors();return token=token||"",tokenChangeDescriptors.has(token)||tokenChangeDescriptors.set(token,new RangeChangeDescriptor(token)),tokenChangeDescriptors.get(token)};var ObjectsDispatchesRangeChanges=new weakMap$1,dispatchesChangesPropertyDescriptor={get:function(){return ObjectsDispatchesRangeChanges.get(this)},set:function(value){return ObjectsDispatchesRangeChanges.set(this,value)},configurable:!0,enumerable:!1};RangeChanges.prototype.addRangeChangeListener=function(listener,token,beforeChange){!this.isObservable&&this.makeObservable&&this.makeObservable();var listeners,descriptor=this.getRangeChangeDescriptor(token);(listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener,void 0===Object.getOwnPropertyDescriptor(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges")&&Object.defineProperty(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges",dispatchesChangesPropertyDescriptor),this.dispatchesRangeChanges=!0;var self=this;return function(){self&&(self.removeRangeChangeListener(listener,token,beforeChange),self=null)}},RangeChanges.prototype.removeRangeChangeListener=function(listener,token,beforeChange){var listeners,descriptor=this.getRangeChangeDescriptor(token);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove range change listener: does not exist: token "+JSON.stringify(token));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=ListenerGhost$1):listeners._current.spliceOne(index)}},RangeChanges.prototype.dispatchRangeChange=function(plus,minus,index,beforeChange){var descriptor,listeners,tokenName,i,countI,listener,currentListeners,Ghost,descriptors=this.getAllRangeChangeDescriptors(),mapIter=descriptors.values();for(descriptors.dispatchBeforeChange=beforeChange;descriptor=mapIter.next().value;){if(descriptor.isActive)return;if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(tokenName=listeners.specificHandlerMethodName,Array.isArray(listeners._current)){if(listeners._current.length){descriptor.isActive=!0;try{for(currentListeners=listeners.removeCurrentGostListenersIfNeeded(),Ghost=ListenerGhost$1,i=0,countI=currentListeners.length;i<countI;i++)if((listener=currentListeners[i])!==Ghost)if(listener[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}else{descriptor.isActive=!0;try{if((listener=listeners._current)[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}},RangeChanges.prototype.addBeforeRangeChangeListener=function(listener,token){return this.addRangeChangeListener(listener,token,!0)},RangeChanges.prototype.removeBeforeRangeChangeListener=function(listener,token){return this.removeRangeChangeListener(listener,token,!0)},RangeChanges.prototype.dispatchBeforeRangeChange=function(plus,minus,index){return this.dispatchRangeChange(plus,minus,index,!0)};var sortedSet=SortedSet;function SortedSet(values,equals,compare,getDefault){if(!(this instanceof SortedSet))return new SortedSet(values,equals,compare,getDefault);this.contentEquals=equals||Object.equals,this.contentCompare=compare||Object.compare,this.getDefault=getDefault||Function.noop,this.root=null,this.length=0,this.addEach(values)}function Node$1(value){this.value=value,this.left=null,this.right=null,this.length=1}function Iterator$1(set,start,end){if(this.set=set,this.prev=null,this.end=end,start){var next=this.set.findLeastGreaterThanOrEqual(start);next&&(this.set.splay(next.value),this.prev=next.getPrevious())}}SortedSet.SortedSet=SortedSet,Object.addEach(SortedSet.prototype,genericCollection.prototype),Object.addEach(SortedSet.prototype,genericSet.prototype),Object.addEach(SortedSet.prototype,propertyChanges.prototype),Object.addEach(SortedSet.prototype,rangeChanges.prototype),Object.defineProperty(SortedSet.prototype,"size",genericCollection._sizePropertyDescriptor),SortedSet.from=genericCollection.from,SortedSet.prototype.isSorted=!0,SortedSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentCompare,this.getDefault)},SortedSet.prototype.has=function(value,equals){if(equals)throw new Error("SortedSet#has does not support second argument: equals");return!!this.root&&(this.splay(value),this.contentEquals(value,this.root.value))},SortedSet.prototype.get=function(value,equals){if(equals)throw new Error("SortedSet#get does not support second argument: equals");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.value:this.getDefault(value)},SortedSet.prototype.add=function(value){var node=new this.Node(value);if(!this.root)return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],0),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],0),!0;if(this.splay(value),!this.contentEquals(value,this.root.value)){var comparison=this.contentCompare(value,this.root.value);if(0===comparison)throw new Error("SortedSet cannot contain incomparable but inequal values: "+value+" and "+this.root.value);return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],this.root.index),comparison<0?(node.right=this.root,node.left=this.root.left,this.root.left=null,this.root.touch()):(node.left=this.root,node.right=this.root.right,this.root.right=null,this.root.touch()),node.touch(),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],this.root.index),!0}return!1},SortedSet.prototype.delete=function(value,equals){if(equals)throw new Error("SortedSet#delete does not support second argument: equals");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value))){var index=this.root.index;if(this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([],[value],index),this.root.left){var right=this.root.right;this.root=this.root.left,this.splay(value),this.root.right=right}else this.root=this.root.right;return this.length--,this.root&&this.root.touch(),this.dispatchesRangeChanges&&this.dispatchRangeChange([],[value],index),!0}return!1},SortedSet.prototype.indexOf=function(value,index){if(index)throw new Error("SortedSet#indexOf does not support second argument: startIndex");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.index:-1},SortedSet.prototype.find=function(value,equals,index){if(equals)throw new Error("SortedSet#find does not support second argument: equals");if(index)throw new Error("SortedSet#find does not support third argument: index");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value)))return this.root},SortedSet.prototype.findGreatest=function(at){if(this.root){for(at=at||this.root;at.right;)at=at.right;return at}},SortedSet.prototype.findLeast=function(at){if(this.root){for(at=at||this.root;at.left;)at=at.left;return at}},SortedSet.prototype.findGreatestLessThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>0?this.root.getPrevious():this.root},SortedSet.prototype.findGreatestLessThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root.getPrevious():this.root},SortedSet.prototype.findLeastGreaterThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root:this.root.getNext()},SortedSet.prototype.findLeastGreaterThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)<=0?this.root.getNext():this.root},SortedSet.prototype.pop=function(){if(this.root){var found=this.findGreatest();return this.delete(found.value),found.value}},SortedSet.prototype.shift=function(){if(this.root){var found=this.findLeast();return this.delete(found.value),found.value}},SortedSet.prototype.push=function(){this.addEach(arguments)},SortedSet.prototype.unshift=function(){this.addEach(arguments)},SortedSet.prototype.slice=function(start,end){start=start||0,end=end||this.length,start<0&&(start+=this.length),end<0&&(end+=this.length);var sliced=[];if(this.root)for(this.splayIndex(start);this.root.index<end&&(sliced.push(this.root.value),this.root.right);)this.splay(this.root.getNext().value);return sliced},SortedSet.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},SortedSet.prototype.swap=function(start,length,plus){if(void 0===start&&void 0===length)return[];(start=start||0)<0&&(start+=this.length),void 0===length&&(length=1/0);var swapped=[];if(this.root){this.splayIndex(start);for(var i=0;i<length;i++){swapped.push(this.root.value);var next=this.root.getNext();if(this.delete(this.root.value),!next)break;this.splay(next.value)}}return this.addEach(plus),swapped},SortedSet.prototype.splay=function(value){var stub,left,right,temp,root,history;if(this.root){for(stub=left=right=new this.Node,history=new this.Node,root=this.root;;){var comparison=this.contentCompare(value,root.value);if(comparison<0){if(!root.left)break;if(this.contentCompare(value,root.left.value)<0&&(temp=root.left,root.left=temp.right,root.touch(),temp.right=root,temp.touch(),!(root=temp).left))break;(temp=new Node$1).right=root,temp.left=history.left,history.left=temp,right.left=root,right.touch(),right=root,root=root.left}else{if(!(comparison>0))break;if(!root.right)break;if(this.contentCompare(value,root.right.value)>0&&(temp=root.right,root.right=temp.left,root.touch(),temp.left=root,temp.touch(),!(root=temp).right))break;(temp=new Node$1).left=root,temp.right=history.right,history.right=temp,left.right=root,left.touch(),left=root,root=root.right}}for(left.right=root.left,left.touch(),right.left=root.right,right.touch(),root.left=stub.right,root.right=stub.left;history.left;)history.left.right.touch(),history.left=history.left.left;for(;history.right;)history.right.left.touch(),history.right=history.right.right;root.touch(),this.root=root}},SortedSet.prototype.splayIndex=function(index){if(this.root){for(var at=this.root,atIndex=this.root.index;atIndex!==index;)if(atIndex>index&&at.left)atIndex-=1+((at=at.left).right?at.right.length:0);else{if(!(atIndex<index&&at.right))break;atIndex+=1+((at=at.right).left?at.left.length:0)}return this.splay(at.value),this.root.index===index}return!1},SortedSet.prototype.reduce=function(callback,basis,thisp){return this.root&&(basis=this.root.reduce(callback,basis,0,thisp,this)),basis},SortedSet.prototype.reduceRight=function(callback,basis,thisp){return this.root&&(basis=this.root.reduceRight(callback,basis,this.length-1,thisp,this)),basis},SortedSet.prototype.min=function(at){var least=this.findLeast(at);if(least)return least.value},SortedSet.prototype.max=function(at){var greatest=this.findGreatest(at);if(greatest)return greatest.value},SortedSet.prototype.one=function(){return this.min()},SortedSet.prototype.clear=function(){var minus;this.dispatchesRangeChanges&&(minus=this.toArray(),this.dispatchBeforeRangeChange([],minus,0)),this.root=null,this.length=0,this.dispatchesRangeChanges&&this.dispatchRangeChange([],minus,0)},SortedSet.prototype.iterate=function(start,end){return new this.Iterator(this,start,end)},SortedSet.prototype.Iterator=Iterator$1,SortedSet.prototype.summary=function(){return this.root?this.root.summary():"()"},SortedSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeRound,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp),this.root&&this.root.log(charmap,logNode,callback,callback)},SortedSet.prototype.logNode=function(node,log,logBefore){log(" "+node.value)},SortedSet.logCharsets=treeLog,SortedSet.prototype.Node=Node$1,Node$1.prototype.reduce=function(callback,basis,index,thisp,tree,depth){if(depth=depth||0,this.left){var length=this.left.length;basis=this.left.reduce(callback,basis,index,thisp,tree,depth+1),index+=length}return basis=callback.call(thisp,basis,this.value,index,tree,this,depth),index+=1,this.right&&(basis=this.right.reduce(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.reduceRight=function(callback,basis,index,thisp,tree,depth){return depth=depth||0,this.right&&(basis=this.right.reduceRight(callback,basis,index,thisp,tree,depth+1),index-=this.right.length),basis=callback.call(thisp,basis,this.value,this.value,tree,this,depth),index-=1,this.left&&(basis=this.left.reduceRight(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.touch=function(){this.length=1+(this.left?this.left.length:0)+(this.right?this.right.length:0),this.index=this.left?this.left.length:0},Node$1.prototype.checkIntegrity=function(){var length=1;if(length+=this.left?this.left.checkIntegrity():0,length+=this.right?this.right.checkIntegrity():0,this.length!==length)throw new Error("Integrity check failed: "+this.summary());return length},Node$1.prototype.getNext=function(){var node=this;if(node.right){for(node=node.right;node.left;)node=node.left;return node}},Node$1.prototype.getPrevious=function(){var node=this;if(node.left){for(node=node.left;node.right;)node=node.right;return node}},Node$1.prototype.summary=function(){var value=this.value||"-";return value+=" <"+this.length,this.left||this.right?"("+value+" "+(this.left?this.left.summary():"()")+", "+(this.right?this.right.summary():"()")+")":"("+value+")"},Node$1.prototype.log=function(charmap,logNode,log,logAbove){var branch,loggedAbove,loggedOn,loggedBelow,self=this;branch=this.left&&this.right?charmap.intersection:this.left?charmap.branchUp:this.right?charmap.branchDown:charmap.through,this.left&&this.left.log(charmap,logNode,(function(line){loggedAbove?logAbove(charmap.strafe+" "+line):(loggedAbove=!0,logAbove(charmap.fromBelow+charmap.through+line))}),(function(line){logAbove("  "+line)})),logNode(this,(function(line){loggedOn?log((self.right?charmap.strafe:" ")+line):(loggedOn=!0,log(branch+line))}),(function(line){logAbove((self.left?charmap.strafe:" ")+line)})),this.right&&this.right.log(charmap,logNode,(function(line){loggedBelow?log("  "+line):(loggedBelow=!0,log(charmap.fromAbove+charmap.through+line))}),(function(line){log(charmap.strafe+" "+line)}))},Iterator$1.prototype.__iterationObject=null,Object.defineProperty(Iterator$1.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),Iterator$1.prototype.next=function(){var next;return(next=this.prev?this.set.findLeastGreaterThan(this.prev.value):this.set.findLeast())?void 0!==this.end&&this.set.contentCompare(next.value,this.end)>=0?(this._iterationObject.done=!0,this._iterationObject.value=void 0):(this.prev=next,this._iterationObject.value=next.value):(this._iterationObject.done=!0,this._iterationObject.value=void 0),this._iterationObject};var util={radians:function(degrees){return degrees/(180/Math.PI)},degrees:function(radians){return radians*(180/Math.PI)},REarth:6371,WGS84:{a:6378.137,b:6356.752314245,f:1/298.257223563},consoleColors:{bright:"",dim:"",underscore:"",blink:"",reverse:"",hidden:"",fg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""},bg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""},reset:""}};var vincentys={inverse:function(p1,p2){const φ1=util.radians(p1.y),λ1=util.radians(p1.x),φ2=util.radians(p2.y),λ2=util.radians(p2.x),{a:a,b:b,f:f}=util.WGS84,L=λ2-λ1,tanU1=(1-f)*Math.tan(φ1),cosU1=1/Math.sqrt(1+tanU1*tanU1),sinU1=tanU1*cosU1,tanU2=(1-f)*Math.tan(φ2),cosU2=1/Math.sqrt(1+tanU2*tanU2),sinU2=tanU2*cosU2,antipodal=Math.abs(L)>Math.PI/2||Math.abs(φ2-φ1)>Math.PI/2;let λ=L,sinλ=null,cosλ=null,σ=antipodal?Math.PI:0,sinσ=0,cosσ=antipodal?-1:1,sinSqσ=null,cos2σₘ=1,sinα=null,cosSqα=1,C=null,λʹ=null,iterations=0;do{if(sinλ=Math.sin(λ),cosλ=Math.cos(λ),sinSqσ=cosU2*sinλ*(cosU2*sinλ)+(cosU1*sinU2-sinU1*cosU2*cosλ)*(cosU1*sinU2-sinU1*cosU2*cosλ),Math.abs(sinSqσ)<Number.EPSILON)break;sinσ=Math.sqrt(sinSqσ),cosσ=sinU1*sinU2+cosU1*cosU2*cosλ,σ=Math.atan2(sinσ,cosσ),sinα=cosU1*cosU2*sinλ/sinσ,cosSqα=1-sinα*sinα,cos2σₘ=0!=cosSqα?cosσ-2*sinU1*sinU2/cosSqα:0,C=f/16*cosSqα*(4+f*(4-3*cosSqα)),λʹ=λ,λ=L+(1-C)*f*sinα*(σ+C*sinσ*(cos2σₘ+C*cosσ*(2*cos2σₘ*cos2σₘ-1)));if((antipodal?Math.abs(λ)-Math.PI:Math.abs(λ))>Math.PI)throw new EvalError("λ > π")}while(Math.abs(λ-λʹ)>1e-7&&++iterations<1e3);if(iterations>=1e3)throw new EvalError("Vincenty formula failed to converge");const uSq=cosSqα*(a*a-b*b)/(b*b),B=uSq/1024*(256+uSq*(uSq*(74-47*uSq)-128)),s=b*(1+uSq/16384*(4096+uSq*(uSq*(320-175*uSq)-768)))*(σ-B*sinσ*(cos2σₘ+B/4*(cosσ*(2*cos2σₘ*cos2σₘ-1)-B/6*cos2σₘ*(4*sinσ*sinσ-3)*(4*cos2σₘ*cos2σₘ-3)))),α1=Math.abs(sinSqσ)<Number.EPSILON?0:Math.atan2(cosU2*sinλ,cosU1*sinU2-sinU1*cosU2*cosλ),α2=Math.abs(sinSqσ)<Number.EPSILON?Math.PI:Math.atan2(cosU1*sinλ,-sinU1*cosU2+cosU1*sinU2*cosλ);return{distance:s,initialBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α1),finalBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α2),iterations:iterations}}};class Point{constructor(x,y){Array.isArray(x)?[this.x,this.y,this.r]=[x[y].longitude,x[y].latitude,y]:[this.x,this.y]=[x,y]}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Point",coordinates:[this.x,this.y]}}}toString(){return JSON.stringify(this.geojson())}intersects(other){if(other instanceof Point)return this.x==other.x&&this.y==other.y;if(other instanceof Box)return other.intersects(this);throw"other must be either Point or Box"}distanceEarth(p){return this.distanceEarthFCC(p)}distanceEarthFCC(p){const df=p.y-this.y,dg=p.x-this.x,fm=util.radians((this.y+p.y)/2),k1=111.13209-.566605*Math.cos(2*fm)+.0012*Math.cos(4*fm),k2=111.41513*Math.cos(fm)-.09455*Math.cos(3*fm)+12e-5*Math.cos(5*fm);return Math.sqrt(k1*df*(k1*df)+k2*dg*(k2*dg))}distanceEarthRev(dx,dy){const lon=this.x+util.degrees(dx/util.REarth/Math.cos(util.radians(this.y))),lat=this.y+util.degrees(dy/util.REarth);return new Point(lon,lat)}distanceEarthVincentys(p){return vincentys.inverse(this,p).distance}}class Range{constructor(a,b){[this.a,this.b]=[a,b]}count(){return Math.abs(this.a-this.b)+1}center(){return Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2)}left(){return new Range(Math.min(this.a,this.b),Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2))}right(){return new Range(Math.min(this.a,this.b)+Math.ceil(Math.abs(this.a-this.b)/2),Math.max(this.a,this.b))}contains(p){return this.a<=p&&p<=this.b}toString(){return`${this.a}:${this.b}`}}class Box{constructor(a,b,c,d){if(a instanceof Range){[this.x1,this.y1,this.x2,this.y2]=[1/0,1/0,-1/0,-1/0];for(let i=a.a;i<=a.b;i++)this.x1=Math.min(b.flightPoints[i].x,this.x1),this.y1=Math.min(b.flightPoints[i].y,this.y1),this.x2=Math.max(b.flightPoints[i].x,this.x2),this.y2=Math.max(b.flightPoints[i].y,this.y2)}else[this.x1,this.y1,this.x2,this.y2]=[a,b,c,d]}vertices(){return[new Point(this.x1,this.y1),new Point(this.x2,this.y1),new Point(this.x2,this.y2),new Point(this.x1,this.y2)]}intersects(other){return other instanceof Point?this.x1<=other.x&&this.y1<=other.y&&this.x2>=other.x&&this.y2>=other.y:!(this.x1>other.x2||this.x2<other.x1||this.y1>other.y2||this.y2<other.y1)}area(){return Math.abs(this.x2-this.x1)*Math.abs(this.y2-this.y1)}distance(other){if(this.intersects(other))return 0;let x1,y1,x2,y2;return this.x1>other.x2&&(x1=this.x1),x2=other.x2,this.x2<other.x1&&(x1=this.x2),x2=other.x1,this.y1<other.y2&&(y1=this.y1),y2=other.y2,this.y2>other.y1&&(y1=this.y2),y2=other.y1,void 0===x1&&(x1=this.x1,x2=this.x1),void 0===y1&&(y1=this.y1,y2=this.y1),new Point(x1,y1).distanceEarth(new Point(x2,y2))}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Polygon",coordinates:[[[this.x1,this.y1],[this.x1,this.y2],[this.x2,this.y2],[this.x2,this.y1],[this.x1,this.y1]]]}}}geojson_collection(boxes){let features=[];for(let b in boxes)features.push(boxes[b].geojson(b,{id:b}));return{type:"FeatureCollection",features:features}}toString(){return JSON.stringify(this.geojson())}}var foundation={Point:Point,Range:Range,Box:Box};let id=0;const{Box:Box$1,Point:Point$1,Range:Range$1}=foundation;class Solution{constructor(ranges,opt,parent){ranges.length>opt.scoring.cardinality?this.ranges=ranges.slice(0,opt.scoring.cardinality):this.ranges=ranges,this.opt=opt;for(let _r in this.ranges){const r=parseInt(_r);if(r>0&&this.ranges[r-1].a>this.ranges[r].a&&(this.ranges[r]=new Range$1(Math.max(this.ranges[r-1].a,this.ranges[r].a),this.ranges[r].b)),r<this.ranges.length-1&&this.ranges[r].b>this.ranges[r+1].b&&(this.ranges[r]=new Range$1(this.ranges[r].a,Math.min(this.ranges[r+1].b,this.ranges[r].b))),this.ranges[r].a>this.ranges[r].b)throw console.log(this.ranges,parent.ranges),"error"}this.boxes=[];for(let r in this.ranges)this.boxes[r]=new Box$1(this.ranges[r],opt.flight);this.score=void 0,this.bound=void 0,this.id=id++,this.opt.config&&this.opt.config.debug&&(this.parent=parent,this.trace())}do_branch(){let div=0;for(let r in this.ranges)this.ranges[r].count()>this.ranges[div].count()&&(div=parseInt(r));for(let r in this.ranges)this.ranges[r].count()>1&&this.boxes[r].area()>8*this.boxes[div].area()&&(div=parseInt(r));if(1==this.ranges[div].count())return[];let subsolutions=[];for(let i of[this.ranges[div].left(),this.ranges[div].right()]){let subranges=[];for(let r in this.ranges)subranges[r]=r!=div?this.ranges[r]:i;subsolutions.push(new Solution(subranges,this.opt,this))}return subsolutions}do_bound(){this.bound=this.opt.scoring.bound(this.ranges,this.boxes,this.opt),this.trace()}do_score(){for(let r in this.ranges)if(r<this.ranges.length-1&&this.ranges[r].center()>=this.ranges[parseInt(r)+1].center())return void(this.score=0);let tp=[];for(let r in this.ranges)tp[r]=new Point$1(this.opt.flight.filtered,this.ranges[r].center());this.scoreInfo=this.opt.scoring.score(tp,this.opt),this.score=this.scoreInfo.score,this.trace()}contentEquals(self,other){return self.id===other.id}contentCompare(self,other){return self.bound<other.bound?-1:self.bound>other.bound?1:self.id<other.id?-1:self.id>other.id?1:0}geojson(){let features=[];if(this.opt.config&&this.opt.config.debug)for(let r in this.ranges)features.push(new Box$1(this.ranges[r],this.opt.flight).geojson("box"+r,{id:"box"+r,area:new Box$1(this.ranges[r],this.opt.flight).area(),a:this.ranges[r].a,b:this.ranges[r].b}));try{const tp=this.scoreInfo.tp;for(let r of[0,1,2])features.push(tp[r].geojson("tp"+r,{id:"tp"+r,r:tp[r].r,timestamp:this.opt.flight.filtered[tp[r].r].timestamp})),(r<2||this.scoreInfo.cp)&&features.push({type:"Feature",id:"seg"+r,properties:{id:"seg"+r,stroke:"yellow","stroke-width":4,d:tp[r].distanceEarth(tp[(r+1)%3])},geometry:{type:"LineString",coordinates:[[tp[r].x,tp[r].y],[tp[(r+1)%3].x,tp[(r+1)%3].y]],style:{stroke:"yellow","stroke-width":4}}})}catch(e){}try{if(void 0!==this.scoreInfo.ep||void 0!==this.scoreInfo.cp){const cp=this.scoreInfo.cp,tp=this.scoreInfo.tp,ep=this.scoreInfo.ep;if(cp&&cp.in&&cp.out){for(let r of["in","out"])features.push(cp[r].geojson("cp_"+r,{id:"cp_"+r,r:cp[r].r,timestamp:this.opt.flight.filtered[cp[r].r].timestamp}));features.push({type:"Feature",id:"closing",properties:{id:"closing",stroke:"green","stroke-width":3,d:cp.in.distanceEarth(cp.out)},geometry:{type:"LineString",coordinates:[[cp.in.x,cp.in.y],[cp.out.x,cp.out.y]],style:{stroke:"green","stroke-width":3}}})}if(ep&&ep.start&&ep.finish){for(let r of["start","finish"])features.push(ep[r].geojson("ep_"+r,{id:"ep_"+r,r:ep[r].r,timestamp:this.opt.flight.filtered[ep[r].r].timestamp}));features.push({type:"Feature",id:"seg_in",properties:{id:"seg_in",stroke:"gold","stroke-width":3,d:ep.start.distanceEarth(tp[0])},geometry:{type:"LineString",coordinates:[[ep.start.x,ep.start.y],[tp[0].x,tp[0].y]],style:{stroke:"green","stroke-width":3}}}),features.push({type:"Feature",id:"seg_out",properties:{id:"seg_out",stroke:"gold","stroke-width":3,d:ep.finish.distanceEarth(tp[2])},geometry:{type:"LineString",coordinates:[[tp[2].x,tp[2].y],[ep.finish.x,ep.finish.y]],style:{stroke:"green","stroke-width":3}}})}}}catch(e){}for(let li in this.opt.flight.ll){const l=this.opt.flight.ll[li];features.push(this.opt.flight.flightPoints[l.launch].geojson("launch"+li,{id:"launch"+li,r:l.launch,timestamp:this.opt.flight.filtered[l.launch].timestamp})),features.push(this.opt.flight.flightPoints[l.landing].geojson("land"+li,{id:"land"+li,r:l.landing,timestamp:this.opt.flight.filtered[l.landing].timestamp}))}if(!this.opt.config||!this.opt.config.noflight){let flightData=[];for(let r of this.opt.flight.filtered)flightData.push([r.longitude,r.latitude]);features.push({type:"Feature",id:"flight",properties:{id:"flight"},geometry:{type:"LineString",coordinates:flightData}})}return{type:"FeatureCollection",properties:{name:"EPSG:3857",id:this.id,score:void 0!==this.score?this.score:void 0,bound:void 0!==this.currentUpperBound?this.currentUpperBound:this.bound,optimal:this.optimal,processedTime:this.time/1e3,processedSolutions:this.processed,type:this.opt.scoring.name,code:this.opt.scoring.code},features:features}}toString(){let s=""+this.opt.scoring.name;if(this.score&&(s+=` ${this.opt.scoring.rounding(this.score)} points`),this.scoreInfo&&(s+=` ${this.opt.scoring.rounding(this.scoreInfo.distance)}km`),s+=` ( <${this.bound.toFixed(4)} )`,this.opt.config&&this.opt.config.debug){s+=` { id: ${this.id} `;for(let r of this.ranges)s+=" "+r.toString();s+=" } "}return s}trace(msg){if(!this.opt.config.trace||!process.stdout)return;const trace=this.opt.config.trace.split(",");if(trace[0]<0){if(this.id%parseInt(trace[1])!=0)return}else for(let i in this.ranges)if(!this.ranges[i].contains(trace[i]))return;let r=`${msg||""} solution tracing: ${this.id} ${this.opt.scoring.name} `;for(let i in this.ranges)r+=this.ranges[i]+" ";this.bound&&(r+=`bound: ${this.bound} `),this.score&&(r+=`score: ${this.score} `),process.stdout.write("\n"+r+"\n"),this.opt.config.env.fs.writeFileSync(`debug-${this.id}.json`,JSON.stringify(this.geojson({debug:!0})))}}var solution_Solution=Solution,ObjectChangeDescriptor$2=changeDescriptor.ObjectChangeDescriptor,ChangeListenersRecord$1=changeDescriptor.ChangeListenersRecord,ListenerGhost$2=changeDescriptor.ListenerGhost,mapChanges=MapChanges;function MapChanges(){throw new Error("Can't construct. MapChanges is a mixin.")}var mapChangeDescriptors=new weakMap$1;function MapChangeDescriptor(name){this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null}MapChangeDescriptor.prototype=new ObjectChangeDescriptor$2,MapChangeDescriptor.prototype.constructor=MapChangeDescriptor,MapChangeDescriptor.prototype.changeListenersRecordConstructor=MapChangeListenersRecord,MapChangeDescriptor.prototype.willChangeListenersRecordConstructor=MapWillChangeListenersRecord;var MapChangeListenersSpecificHandlerMethodName=new _map;function MapChangeListenersRecord(name){var specificHandlerMethodName=MapChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="MapChange",MapChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}MapChangeListenersRecord.prototype=new ChangeListenersRecord$1,MapChangeListenersRecord.prototype.constructor=MapChangeListenersRecord,MapChangeListenersRecord.prototype.genericHandlerMethodName="handleMapChange";var MapWillChangeListenersSpecificHandlerMethodName=new _map;function MapWillChangeListenersRecord(name){var specificHandlerMethodName=MapWillChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="MapWillChange",MapWillChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}MapWillChangeListenersRecord.prototype=new ChangeListenersRecord$1,MapWillChangeListenersRecord.prototype.constructor=MapWillChangeListenersRecord,MapWillChangeListenersRecord.prototype.genericHandlerMethodName="handleMapWillChange",MapChanges.prototype.getAllMapChangeDescriptors=function(){return mapChangeDescriptors.has(this)||mapChangeDescriptors.set(this,new _map),mapChangeDescriptors.get(this)},MapChanges.prototype.getMapChangeDescriptor=function(token){var tokenChangeDescriptors=this.getAllMapChangeDescriptors();return token=token||"",tokenChangeDescriptors.has(token)||tokenChangeDescriptors.set(token,new MapChangeDescriptor(token)),tokenChangeDescriptors.get(token)};var ObjectsDispatchesMapChanges=new weakMap$1,dispatchesChangesPropertyDescriptor$1={get:function(){return ObjectsDispatchesMapChanges.get(this)},set:function(value){return ObjectsDispatchesMapChanges.set(this,value)},configurable:!0,enumerable:!1};MapChanges.prototype.addMapChangeListener=function(listener,token,beforeChange){!this.isObservable&&this.makeObservable&&this.makeObservable();var listeners,descriptor=this.getMapChangeDescriptor(token);(listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener,void 0===Object.getOwnPropertyDescriptor(this.__proto__||Object.getPrototypeOf(this),"dispatchesMapChanges")&&Object.defineProperty(this.__proto__||Object.getPrototypeOf(this),"dispatchesMapChanges",dispatchesChangesPropertyDescriptor$1),this.dispatchesMapChanges=!0;var self=this;return function(){self&&(self.removeMapChangeListener(listener,token,beforeChange),self=null)}},MapChanges.prototype.removeMapChangeListener=function(listener,token,beforeChange){var listeners,descriptor=this.getMapChangeDescriptor(token);if((listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove map change listener: does not exist: token "+JSON.stringify(token));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=ListenerGhost$2):listeners._current.spliceOne(index)}},MapChanges.prototype.dispatchMapChange=function(key,value,beforeChange){var descriptors=this.getAllMapChangeDescriptors(),Ghost=ListenerGhost$2;descriptors.forEach((function(descriptor,token){if(!descriptor.isActive){var listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners;if(listeners&&listeners._current){var tokenName=listeners.specificHandlerMethodName;if(Array.isArray(listeners._current)){if(listeners._current.length){var i,countI,listener,currentListeners=listeners.removeCurrentGostListenersIfNeeded();descriptor.isActive=!0;try{for(i=0,countI=currentListeners.length;i<countI;i++)if((listener=currentListeners[i])!==Ghost)if(listener[tokenName])listener[tokenName](value,key,this);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(listener,value,key,this)}}finally{descriptor.isActive=!1}}}else{descriptor.isActive=!0;try{if((listener=listeners._current)[tokenName])listener[tokenName](value,key,this);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(listener,value,key,this)}}finally{descriptor.isActive=!1}}}}}),this)},MapChanges.prototype.addBeforeMapChangeListener=function(listener,token){return this.addMapChangeListener(listener,token,!0)},MapChanges.prototype.removeBeforeMapChangeListener=function(listener,token){return this.removeMapChangeListener(listener,token,!0)},MapChanges.prototype.dispatchBeforeMapChange=function(key,value){return this.dispatchMapChange(key,value,!0)};var map=_map;void 0===commonjsGlobal.Map||"function"!=typeof commonjsGlobal.Set.prototype.values?(Object.addEach(_map.prototype,propertyChanges.prototype),Object.addEach(_map.prototype,mapChanges.prototype)):(Object.defineEach(_map.prototype,propertyChanges.prototype,!1,!0,!1,!0),Object.defineEach(_map.prototype,mapChanges.prototype,!1,!0,!1,!0));class FlatQueue{constructor(){this.ids=[],this.values=[],this.length=0}clear(){this.length=0}push(id,value){let pos=this.length++;for(this.ids[pos]=id,this.values[pos]=value;pos>0;){const parent=pos-1>>1,parentValue=this.values[parent];if(value>=parentValue)break;this.ids[pos]=this.ids[parent],this.values[pos]=parentValue,pos=parent}this.ids[pos]=id,this.values[pos]=value}pop(){if(0===this.length)return;const top=this.ids[0];if(this.length--,this.length>0){const id=this.ids[0]=this.ids[this.length],value=this.values[0]=this.values[this.length],halfLength=this.length>>1;let pos=0;for(;pos<halfLength;){let left=1+(pos<<1);const right=left+1;let bestIndex=this.ids[left],bestValue=this.values[left];const rightValue=this.values[right];if(right<this.length&&rightValue<bestValue&&(left=right,bestIndex=this.ids[right],bestValue=rightValue),bestValue>=value)break;this.ids[pos]=bestIndex,this.values[pos]=bestValue,pos=left}this.ids[pos]=id,this.values[pos]=value}return top}peek(){return this.ids[0]}peekValue(){return this.values[0]}}const ARRAY_TYPES=[Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array];class Flatbush{static from(data){if(!(data instanceof ArrayBuffer))throw new Error("Data must be an instance of ArrayBuffer.");const[magic,versionAndType]=new Uint8Array(data,0,2);if(251!==magic)throw new Error("Data does not appear to be in a Flatbush format.");if(versionAndType>>4!=3)throw new Error(`Got v${versionAndType>>4} data when expected v3.`);const[nodeSize]=new Uint16Array(data,2,1),[numItems]=new Uint32Array(data,4,1);return new Flatbush(numItems,nodeSize,ARRAY_TYPES[15&versionAndType],data)}constructor(numItems,nodeSize=16,ArrayType=Float64Array,data){if(void 0===numItems)throw new Error("Missing required argument: numItems.");if(isNaN(numItems)||numItems<=0)throw new Error(`Unpexpected numItems value: ${numItems}.`);this.numItems=+numItems,this.nodeSize=Math.min(Math.max(+nodeSize,2),65535);let n=numItems,numNodes=n;this._levelBounds=[4*n];do{n=Math.ceil(n/this.nodeSize),numNodes+=n,this._levelBounds.push(4*numNodes)}while(1!==n);this.ArrayType=ArrayType||Float64Array,this.IndexArrayType=numNodes<16384?Uint16Array:Uint32Array;const arrayTypeIndex=ARRAY_TYPES.indexOf(this.ArrayType),nodesByteSize=4*numNodes*this.ArrayType.BYTES_PER_ELEMENT;if(arrayTypeIndex<0)throw new Error(`Unexpected typed array class: ${ArrayType}.`);data&&data instanceof ArrayBuffer?(this.data=data,this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=4*numNodes,this.minX=this._boxes[this._pos-4],this.minY=this._boxes[this._pos-3],this.maxX=this._boxes[this._pos-2],this.maxY=this._boxes[this._pos-1]):(this.data=new ArrayBuffer(8+nodesByteSize+numNodes*this.IndexArrayType.BYTES_PER_ELEMENT),this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=0,this.minX=1/0,this.minY=1/0,this.maxX=-1/0,this.maxY=-1/0,new Uint8Array(this.data,0,2).set([251,48+arrayTypeIndex]),new Uint16Array(this.data,2,1)[0]=nodeSize,new Uint32Array(this.data,4,1)[0]=numItems),this._queue=new FlatQueue}add(minX,minY,maxX,maxY){const index=this._pos>>2;return this._indices[index]=index,this._boxes[this._pos++]=minX,this._boxes[this._pos++]=minY,this._boxes[this._pos++]=maxX,this._boxes[this._pos++]=maxY,minX<this.minX&&(this.minX=minX),minY<this.minY&&(this.minY=minY),maxX>this.maxX&&(this.maxX=maxX),maxY>this.maxY&&(this.maxY=maxY),index}finish(){if(this._pos>>2!==this.numItems)throw new Error(`Added ${this._pos>>2} items when expected ${this.numItems}.`);if(this.numItems<=this.nodeSize)return this._boxes[this._pos++]=this.minX,this._boxes[this._pos++]=this.minY,this._boxes[this._pos++]=this.maxX,void(this._boxes[this._pos++]=this.maxY);const width=this.maxX-this.minX,height=this.maxY-this.minY,hilbertValues=new Uint32Array(this.numItems);for(let i=0;i<this.numItems;i++){let pos=4*i;const minX=this._boxes[pos++],minY=this._boxes[pos++],maxX=this._boxes[pos++],maxY=this._boxes[pos++],x=Math.floor(65535*((minX+maxX)/2-this.minX)/width),y=Math.floor(65535*((minY+maxY)/2-this.minY)/height);hilbertValues[i]=hilbert(x,y)}!function sort(values,boxes,indices,left,right,nodeSize){if(Math.floor(left/nodeSize)>=Math.floor(right/nodeSize))return;const pivot=values[left+right>>1];let i=left-1,j=right+1;for(;;){do{i++}while(values[i]<pivot);do{j--}while(values[j]>pivot);if(i>=j)break;swap(values,boxes,indices,i,j)}sort(values,boxes,indices,left,j,nodeSize),sort(values,boxes,indices,j+1,right,nodeSize)}(hilbertValues,this._boxes,this._indices,0,this.numItems-1,this.nodeSize);for(let i=0,pos=0;i<this._levelBounds.length-1;i++){const end=this._levelBounds[i];for(;pos<end;){const nodeIndex=pos;let nodeMinX=1/0,nodeMinY=1/0,nodeMaxX=-1/0,nodeMaxY=-1/0;for(let i=0;i<this.nodeSize&&pos<end;i++)nodeMinX=Math.min(nodeMinX,this._boxes[pos++]),nodeMinY=Math.min(nodeMinY,this._boxes[pos++]),nodeMaxX=Math.max(nodeMaxX,this._boxes[pos++]),nodeMaxY=Math.max(nodeMaxY,this._boxes[pos++]);this._indices[this._pos>>2]=nodeIndex,this._boxes[this._pos++]=nodeMinX,this._boxes[this._pos++]=nodeMinY,this._boxes[this._pos++]=nodeMaxX,this._boxes[this._pos++]=nodeMaxY}}}search(minX,minY,maxX,maxY,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const queue=[],results=[];for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2];maxX<this._boxes[pos]||(maxY<this._boxes[pos+1]||minX>this._boxes[pos+2]||minY>this._boxes[pos+3]||(nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&results.push(index):queue.push(index)))}nodeIndex=queue.pop()}return results}neighbors(x,y,maxResults=1/0,maxDistance=1/0,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const q=this._queue,results=[],maxDistSquared=maxDistance*maxDistance;for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2],dx=axisDist(x,this._boxes[pos],this._boxes[pos+2]),dy=axisDist(y,this._boxes[pos+1],this._boxes[pos+3]),dist=dx*dx+dy*dy;nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&q.push(-index-1,dist):q.push(index,dist)}for(;q.length&&q.peek()<0;){if(q.peekValue()>maxDistSquared)return q.clear(),results;if(results.push(-q.pop()-1),results.length===maxResults)return q.clear(),results}nodeIndex=q.pop()}return q.clear(),results}}function axisDist(k,min,max){return k<min?min-k:k<=max?0:k-max}function upperBound(value,arr){let i=0,j=arr.length-1;for(;i<j;){const m=i+j>>1;arr[m]>value?j=m:i=m+1}return arr[i]}function swap(values,boxes,indices,i,j){const temp=values[i];values[i]=values[j],values[j]=temp;const k=4*i,m=4*j,a=boxes[k],b=boxes[k+1],c=boxes[k+2],d=boxes[k+3];boxes[k]=boxes[m],boxes[k+1]=boxes[m+1],boxes[k+2]=boxes[m+2],boxes[k+3]=boxes[m+3],boxes[m]=a,boxes[m+1]=b,boxes[m+2]=c,boxes[m+3]=d;const e=indices[i];indices[i]=indices[j],indices[j]=e}function hilbert(x,y){let a=x^y,b=65535^a,c=65535^(x|y),d=x&(65535^y),A=a|b>>1,B=a>>1^a,C=c>>1^b&d>>1^c,D=a&c>>1^d>>1^d;a=A,b=B,c=C,d=D,A=a&a>>2^b&b>>2,B=a&b>>2^b&(a^b)>>2,C^=a&c>>2^b&d>>2,D^=b&c>>2^(a^b)&d>>2,a=A,b=B,c=C,d=D,A=a&a>>4^b&b>>4,B=a&b>>4^b&(a^b)>>4,C^=a&c>>4^b&d>>4,D^=b&c>>4^(a^b)&d>>4,a=A,b=B,c=C,d=D,C^=a&c>>8^b&d>>8,D^=b&c>>8^(a^b)&d>>8,a=C^C>>1,b=D^D>>1;let i0=x^y,i1=b|65535^(i0|a);return i0=16711935&(i0|i0<<8),i0=252645135&(i0|i0<<4),i0=858993459&(i0|i0<<2),i0=1431655765&(i0|i0<<1),i1=16711935&(i1|i1<<8),i1=252645135&(i1|i1<<4),i1=858993459&(i1|i1<<2),i1=1431655765&(i1|i1<<1),(i1<<1|i0)>>>0}function quickselect(arr,k,left,right,compare){!function quickselectStep(arr,k,left,right,compare){for(;right>left;){if(right-left>600){var n=right-left+1,m=k-left+1,z=Math.log(n),s=.5*Math.exp(2*z/3),sd=.5*Math.sqrt(z*s*(n-s)/n)*(m-n/2<0?-1:1);quickselectStep(arr,k,Math.max(left,Math.floor(k-m*s/n+sd)),Math.min(right,Math.floor(k+(n-m)*s/n+sd)),compare)}var t=arr[k],i=left,j=right;for(swap$1(arr,left,k),compare(arr[right],t)>0&&swap$1(arr,left,right);i<j;){for(swap$1(arr,i,j),i++,j--;compare(arr[i],t)<0;)i++;for(;compare(arr[j],t)>0;)j--}0===compare(arr[left],t)?swap$1(arr,left,j):swap$1(arr,++j,right),j<=k&&(left=j+1),k<=j&&(right=j-1)}}(arr,k,left||0,right||arr.length-1,compare||defaultCompare)}function swap$1(arr,i,j){var tmp=arr[i];arr[i]=arr[j],arr[j]=tmp}function defaultCompare(a,b){return a<b?-1:a>b?1:0}class RBush{constructor(maxEntries=9){this._maxEntries=Math.max(4,maxEntries),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()}all(){return this._all(this.data,[])}search(bbox){let node=this.data;const result=[];if(!intersects(bbox,node))return result;const toBBox=this.toBBox,nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?toBBox(child):child;intersects(bbox,childBBox)&&(node.leaf?result.push(child):contains(bbox,childBBox)?this._all(child,result):nodesToSearch.push(child))}node=nodesToSearch.pop()}return result}collides(bbox){let node=this.data;if(!intersects(bbox,node))return!1;const nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?this.toBBox(child):child;if(intersects(bbox,childBBox)){if(node.leaf||contains(bbox,childBBox))return!0;nodesToSearch.push(child)}}node=nodesToSearch.pop()}return!1}load(data){if(!data||!data.length)return this;if(data.length<this._minEntries){for(let i=0;i<data.length;i++)this.insert(data[i]);return this}let node=this._build(data.slice(),0,data.length-1,0);if(this.data.children.length)if(this.data.height===node.height)this._splitRoot(this.data,node);else{if(this.data.height<node.height){const tmpNode=this.data;this.data=node,node=tmpNode}this._insert(node,this.data.height-node.height-1,!0)}else this.data=node;return this}insert(item){return item&&this._insert(item,this.data.height-1),this}clear(){return this.data=createNode([]),this}remove(item,equalsFn){if(!item)return this;let node=this.data;const bbox=this.toBBox(item),path=[],indexes=[];let i,parent,goingUp;for(;node||path.length;){if(node||(node=path.pop(),parent=path[path.length-1],i=indexes.pop(),goingUp=!0),node.leaf){const index=findItem(item,node.children,equalsFn);if(-1!==index)return node.children.splice(index,1),path.push(node),this._condense(path),this}goingUp||node.leaf||!contains(node,bbox)?parent?(i++,node=parent.children[i],goingUp=!1):node=null:(path.push(node),indexes.push(i),i=0,parent=node,node=node.children[0])}return this}toBBox(item){return item}compareMinX(a,b){return a.minX-b.minX}compareMinY(a,b){return a.minY-b.minY}toJSON(){return this.data}fromJSON(data){return this.data=data,this}_all(node,result){const nodesToSearch=[];for(;node;)node.leaf?result.push(...node.children):nodesToSearch.push(...node.children),node=nodesToSearch.pop();return result}_build(items,left,right,height){const N=right-left+1;let node,M=this._maxEntries;if(N<=M)return node=createNode(items.slice(left,right+1)),calcBBox(node,this.toBBox),node;height||(height=Math.ceil(Math.log(N)/Math.log(M)),M=Math.ceil(N/Math.pow(M,height-1))),node=createNode([]),node.leaf=!1,node.height=height;const N2=Math.ceil(N/M),N1=N2*Math.ceil(Math.sqrt(M));multiSelect(items,left,right,N1,this.compareMinX);for(let i=left;i<=right;i+=N1){const right2=Math.min(i+N1-1,right);multiSelect(items,i,right2,N2,this.compareMinY);for(let j=i;j<=right2;j+=N2){const right3=Math.min(j+N2-1,right2);node.children.push(this._build(items,j,right3,height-1))}}return calcBBox(node,this.toBBox),node}_chooseSubtree(bbox,node,level,path){for(;path.push(node),!node.leaf&&path.length-1!==level;){let targetNode,minArea=1/0,minEnlargement=1/0;for(let i=0;i<node.children.length;i++){const child=node.children[i],area=bboxArea(child),enlargement=(a=bbox,b=child,(Math.max(b.maxX,a.maxX)-Math.min(b.minX,a.minX))*(Math.max(b.maxY,a.maxY)-Math.min(b.minY,a.minY))-area);enlargement<minEnlargement?(minEnlargement=enlargement,minArea=area<minArea?area:minArea,targetNode=child):enlargement===minEnlargement&&area<minArea&&(minArea=area,targetNode=child)}node=targetNode||node.children[0]}var a,b;return node}_insert(item,level,isNode){const bbox=isNode?item:this.toBBox(item),insertPath=[],node=this._chooseSubtree(bbox,this.data,level,insertPath);for(node.children.push(item),extend(node,bbox);level>=0&&insertPath[level].children.length>this._maxEntries;)this._split(insertPath,level),level--;this._adjustParentBBoxes(bbox,insertPath,level)}_split(insertPath,level){const node=insertPath[level],M=node.children.length,m=this._minEntries;this._chooseSplitAxis(node,m,M);const splitIndex=this._chooseSplitIndex(node,m,M),newNode=createNode(node.children.splice(splitIndex,node.children.length-splitIndex));newNode.height=node.height,newNode.leaf=node.leaf,calcBBox(node,this.toBBox),calcBBox(newNode,this.toBBox),level?insertPath[level-1].children.push(newNode):this._splitRoot(node,newNode)}_splitRoot(node,newNode){this.data=createNode([node,newNode]),this.data.height=node.height+1,this.data.leaf=!1,calcBBox(this.data,this.toBBox)}_chooseSplitIndex(node,m,M){let index,minOverlap=1/0,minArea=1/0;for(let i=m;i<=M-m;i++){const bbox1=distBBox(node,0,i,this.toBBox),bbox2=distBBox(node,i,M,this.toBBox),overlap=intersectionArea(bbox1,bbox2),area=bboxArea(bbox1)+bboxArea(bbox2);overlap<minOverlap?(minOverlap=overlap,index=i,minArea=area<minArea?area:minArea):overlap===minOverlap&&area<minArea&&(minArea=area,index=i)}return index||M-m}_chooseSplitAxis(node,m,M){const compareMinX=node.leaf?this.compareMinX:compareNodeMinX,compareMinY=node.leaf?this.compareMinY:compareNodeMinY;this._allDistMargin(node,m,M,compareMinX)<this._allDistMargin(node,m,M,compareMinY)&&node.children.sort(compareMinX)}_allDistMargin(node,m,M,compare){node.children.sort(compare);const toBBox=this.toBBox,leftBBox=distBBox(node,0,m,toBBox),rightBBox=distBBox(node,M-m,M,toBBox);let margin=bboxMargin(leftBBox)+bboxMargin(rightBBox);for(let i=m;i<M-m;i++){const child=node.children[i];extend(leftBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(leftBBox)}for(let i=M-m-1;i>=m;i--){const child=node.children[i];extend(rightBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(rightBBox)}return margin}_adjustParentBBoxes(bbox,path,level){for(let i=level;i>=0;i--)extend(path[i],bbox)}_condense(path){for(let siblings,i=path.length-1;i>=0;i--)0===path[i].children.length?i>0?(siblings=path[i-1].children,siblings.splice(siblings.indexOf(path[i]),1)):this.clear():calcBBox(path[i],this.toBBox)}}function findItem(item,items,equalsFn){if(!equalsFn)return items.indexOf(item);for(let i=0;i<items.length;i++)if(equalsFn(item,items[i]))return i;return-1}function calcBBox(node,toBBox){distBBox(node,0,node.children.length,toBBox,node)}function distBBox(node,k,p,toBBox,destNode){destNode||(destNode=createNode(null)),destNode.minX=1/0,destNode.minY=1/0,destNode.maxX=-1/0,destNode.maxY=-1/0;for(let i=k;i<p;i++){const child=node.children[i];extend(destNode,node.leaf?toBBox(child):child)}return destNode}function extend(a,b){return a.minX=Math.min(a.minX,b.minX),a.minY=Math.min(a.minY,b.minY),a.maxX=Math.max(a.maxX,b.maxX),a.maxY=Math.max(a.maxY,b.maxY),a}function compareNodeMinX(a,b){return a.minX-b.minX}function compareNodeMinY(a,b){return a.minY-b.minY}function bboxArea(a){return(a.maxX-a.minX)*(a.maxY-a.minY)}function bboxMargin(a){return a.maxX-a.minX+(a.maxY-a.minY)}function intersectionArea(a,b){const minX=Math.max(a.minX,b.minX),minY=Math.max(a.minY,b.minY),maxX=Math.min(a.maxX,b.maxX),maxY=Math.min(a.maxY,b.maxY);return Math.max(0,maxX-minX)*Math.max(0,maxY-minY)}function contains(a,b){return a.minX<=b.minX&&a.minY<=b.minY&&b.maxX<=a.maxX&&b.maxY<=a.maxY}function intersects(a,b){return b.minX<=a.maxX&&b.minY<=a.maxY&&b.maxX>=a.minX&&b.maxY>=a.minY}function createNode(children){return{children:children,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function multiSelect(arr,left,right,n,compare){const stack=[left,right];for(;stack.length;){if((right=stack.pop())-(left=stack.pop())<=n)continue;const mid=left+Math.ceil((right-left)/n/2)*n;quickselect(arr,mid,left,right,compare),stack.push(left,mid,mid,right)}}const Flatbush$1=Flatbush.default?Flatbush.default:Flatbush,{Box:Box$2,Point:Point$2}=foundation;var geom={maxDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let intersecting=!1;for(let i of[0,1,2])if(boxes[i].intersects(boxes[(i+1)%3])){intersecting=!0;break}let path=[[],[],[]];for(let i of[0,1,2]){for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);(0==path[i].length||intersecting)&&(path[i]=vertices[i])}let distanceMax=0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMax=Math.max(distanceMax,distance)}return distanceMax},maxDistance2Rectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[]];for(let i of[0,1])path[i]=vertices[i];let distanceMax=0;for(let i of path[0])for(let j of path[1]){const distance=i.distanceEarth(j);distanceMax=Math.max(distanceMax,distance)}return distanceMax},minDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[],[]];for(let i of[0,1,2])path[i]=vertices[i];let distanceMin=1/0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMin=Math.min(distanceMin,distance)}return distanceMin},maxDistanceNRectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[],path=[];for(let r in boxes){if(boxes[r]instanceof Box$2)vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);else{if(!(boxes[r]instanceof Point$2))throw new TypeError("boxes must contain only Box or Point");vertices[r]=[boxes[r]],minx=Math.min(minx||1/0,boxes[r].x),miny=Math.min(miny||1/0,boxes[r].y),maxx=Math.max(maxx||-1/0,boxes[r].x),maxy=Math.max(maxy||-1/0,boxes[r].y)}path[r]=[]}for(let i in boxes)if(i>0){boxes[i-1].intersects(boxes[i])&&(boxes[i-1].intersecting=!0,boxes[i].intersecting=!0)}for(let i in boxes)if(boxes[i].intersecting)path[i]=vertices[i];else{for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);0==path[i].length&&(path[i]=vertices[i])}return function maxDistancePath(origin,path,pathStart){let distanceMax=0;for(let i of path[pathStart]){const distance1=void 0!==origin?i.distanceEarth(origin):0,distance2=path.length>pathStart+1?maxDistancePath(i,path,pathStart+1):0;distanceMax=Math.max(distanceMax,distance1+distance2)}return distanceMax}(void 0,path,0)},findFurthestPointInSegment:function(sega,segb,target,opt){let points,pos,zSearch;if(target instanceof Box$2)points=target.vertices();else{if(!(target instanceof Point$2))throw new TypeError("target must be either Point or Box");points=[target]}if(sega===opt.launch)pos=0,zSearch=+segb;else{if(segb!==opt.landing)throw new RangeError("this function supports seeking only from the launch or the landing point");pos=1,zSearch=+sega}let fpoint,distanceMax=-1/0;for(let v of points){let fVpoint,precomputed,distanceVMax=-1/0;const precomputedAll=opt.flight.furthestPoints[pos].get(v.x+":"+v.y);for(const p of precomputedAll||[])if(zSearch>=p.min&&zSearch<=p.max){precomputed=p;break}if(precomputed){if(!(sega<=precomputed.o.r&&precomputed.o.r<=segb))throw new Error("furthestPoints cache inconsistency");distanceVMax=v.distanceEarth(precomputed.o),fVpoint=precomputed.o}if(void 0===fVpoint){let intersecting=!1,canCache=!1;for(let p=sega;p<=segb;p++){const f=opt.flight.flightPoints[p];if(target instanceof Box$2&&target.intersects(f)){intersecting=!0;continue}const d=v.distanceEarth(f);d>distanceVMax&&(distanceVMax=d,fVpoint=f,canCache=!0)}if(intersecting)for(let p of points){const d=v.distanceEarth(p);d>distanceVMax&&(distanceVMax=d,fVpoint=target,canCache=!1)}if(canCache){let zCache;sega===opt.launch?zCache={min:+fVpoint.r,max:+segb}:segb===opt.landing&&(zCache={min:+sega,max:+fVpoint.r});let c=precomputedAll;c||(c=[],opt.flight.furthestPoints[pos].set(v.x+":"+v.y,c));const existing=c.filter(x=>x.o.r==fVpoint.r&&!(zCache.max<=x.min||zCache.min>=x.max))[0];existing?(existing.min=Math.min(zCache.min,existing.min),existing.max=Math.max(zCache.max,existing.max)):c.push({...zCache,o:fVpoint})}}distanceVMax>distanceMax&&(distanceMax=distanceVMax,fpoint=fVpoint)}return void 0===fpoint&&(fpoint=target),fpoint},isTriangleClosed:function(p1,p2,distance,opt){const fastCandidates=opt.flight.closestPairs.search({minX:opt.launch,minY:p2,maxX:p1,maxY:opt.landing});for(let f of fastCandidates)if(f.o.d<=opt.scoring.closingDistanceFree)return f.o;const min=function(p1,p2,opt){let precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:p2}),precomputed=precomputedAll.reduce((a,x)=>!a||x.in>a.in?x:a,void 0);if(precomputed=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,precomputed),void 0!==precomputed)return precomputed.o;const rtree=new Flatbush$1(p1+1-opt.launch,8),lc=Math.abs(Math.cos(util.radians(opt.flight.flightPoints[p1].y)));for(let i=opt.launch;i<=p1;i++){const r=opt.flight.flightPoints[i];rtree.add(r.x*lc,r.y,r.x*lc,r.y)}rtree.finish(),precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:opt.landing});const precomputedNext=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,void 0),lastUnknown=void 0!==precomputedNext?precomputedNext.maxY:opt.landing;let min={d:1/0};for(let i=p2;i<lastUnknown;i++){const pout=opt.flight.flightPoints[i],n=rtree.neighbors(pout.x*lc,pout.y,1)[0]+opt.launch;if(void 0!==n){const pin=opt.flight.flightPoints[n],d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}}if(void 0!==precomputedNext){const pout=precomputedNext.o.out,pin=precomputedNext.o.in,d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}return opt.flight.closestPairs.insert({minX:min.in.r,minY:p2,maxX:p1,maxY:min.out.r,o:min}),min}(p1,p2,opt);return min.d<=opt.scoring.closingDistance(distance,opt)&&min},init:function(opt){opt.flight.closestPairs=new RBush,opt.flight.furthestPoints=[new map,new map],opt.flight.flightPoints=new Array(opt.flight.filtered.length);for(let r in opt.flight.filtered)opt.flight.flightPoints[r]=new Point$2(opt.flight.filtered,r)}};const definitionFlight_t=60,definitionFlight_x0=1.5,definitionFlight_xt=5,definitionFlight_z0=.05,definitionFlight_zt=.9,definitionGround_t=20,definitionGround_xmax=2.5,definitionGround_zmax=.1,Point$3=foundation.Point;var flight={analyze:function(flight,config){if(config.invalid?flight.filtered=flight.fixes.slice(0):flight.filtered=flight.fixes.filter(x=>x.valid).filter((x,i,a)=>0==i||a[i-1].timestamp!==x.timestamp),flight.filtered.length<5)throw new Error(`Flight must contain at least 5 valid GPS fixes, ${flight.filtered.length} valid fixes found (out of ${flight.fixes.length})`);config.trim||config.detectLaunch||config.detectLanding?(!function(fixes){for(let i in fixes)(null===fixes[i].pressureAltitude||void 0===fixes[i].pressureAltitude||fixes[i].pressureAltitude<-1e3)&&(fixes[i].pressureAltitude=fixes[i].gpsAltitude),null===fixes[i].pressureAltitude&&(fixes[i].gpsAltitude=void 0),i>0?fixes[i].timestamp!==fixes[i-1].timestamp?(fixes[i].hspeed=1e3*new Point$3(fixes,i-1).distanceEarth(new Point$3(fixes,i))/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3,fixes[i].vspeed=(fixes[i].pressureAltitude-fixes[i-1].pressureAltitude)/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3):(fixes[i].hspeed=fixes[i-1].hspeed,fixes[i].vspeed=fixes[i-1].vspeed):(fixes[i].hspeed=0,fixes[i].vspeed=0);for(let _i in fixes){const i=parseInt(_i),now=fixes[i].timestamp;let start,end;for(start=i;start>0&&fixes[start].timestamp>now-Math.round(5e3);start--);for(end=i;end<fixes.length-1&&fixes[end].timestamp<now+Math.round(5e3);end++);const maSegment=fixes.slice(start,end+1);fixes[i].hma=maSegment.reduce((sum,x)=>sum+x.hspeed,0)/maSegment.length,fixes[i].vma=maSegment.reduce((sum,x)=>sum+Math.abs(x.vspeed),0)/maSegment.length}}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma>definitionFlight_xt&&fixes[i].vma>definitionFlight_zt&&(start=i),void 0!==start)if(fixes[i].hma>definitionFlight_x0&&fixes[i].vma>definitionFlight_z0){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionFlight_t)for(let j=start;j<=i;j++)fixes[i].stateFlight=!0}else start=void 0}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax&&(start=i),void 0!==start)if(fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionGround_t)for(let j=start;j<=i;j++)fixes[i].stateGround=!0}else start=void 0}(flight.filtered),flight.ll=function(fixes){let ll=[];for(let i=0;i<fixes.length-1;i++)if(fixes[i].stateFlight){let j;for(j=i;j>0&&!fixes[j].stateGround;j--);const launch=j;for(j=i;j<fixes.length-2&&!fixes[j].stateGround;j++);const landing=j;i=j,ll.push({launch:launch,landing:landing})}return 0==ll.length&&ll.push({launch:0,landing:fixes.length-1}),ll}(flight.filtered)):flight.ll=[{launch:0,landing:flight.filtered.length-1}]}};function closingPenalty(cd,opt){return cd>(opt.scoring.closingDistanceFree||0)?cd:0}function maxFAIDistance(maxTriDistance,boxes,opt){const minTriDistance=geom.minDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxAB=geom.maxDistance2Rectangles([boxes[0],boxes[1]]),maxBC=geom.maxDistance2Rectangles([boxes[1],boxes[2]]),maxCA=geom.maxDistance2Rectangles([boxes[2],boxes[0]]),maxDistance=Math.min(maxAB/opt.scoring.minSide,maxBC/opt.scoring.minSide,maxCA/opt.scoring.minSide,maxTriDistance);return maxDistance<minTriDistance?0:maxDistance}var scoring={closingWithLimit:function(distance,opt){return Math.max(opt.scoring.closingDistanceFixed||0,distance*(opt.scoring.closingDistanceRelative||0))},closingWithPenalty:function(distance,opt){return 1/0},boundTriangle:function(ranges,boxes,opt){const maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxDistance=void 0!==opt.scoring.minSide?maxFAIDistance(maxTriDistance,boxes,opt):maxTriDistance;if(0===maxDistance)return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxDistance,opt),cp?(maxDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxDistance*opt.scoring.multiplier},scoreTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),distance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*distance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,distance,opt);return cp?{distance:distance,score:(distance-closingPenalty(cp.d,opt))*opt.scoring.multiplier,tp:tp,cp:cp}:{score:0}},boundDistance3Points:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt);return geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout])*opt.scoring.multiplier},scoreDistance3Points:function(tp,opt){let distance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])distance+=all[i].distanceEarth(all[i+1]);return{distance:distance,score:distance*opt.scoring.multiplier,tp:tp,ep:{start:pin,finish:pout}}},boundOpenTriangle:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt),maxD3PDistance=geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout]),maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i));if(void 0!==opt.scoring.minSide&&0===maxFAIDistance(maxTriDistance,boxes,opt))return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxTriDistance,opt),cp?(maxD3PDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxD3PDistance*opt.scoring.multiplier},scoreOpenTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),triDistance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*triDistance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,triDistance,opt);if(!cp)return{score:0};let d3pDistance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])d3pDistance+=all[i].distanceEarth(all[i+1]);return{distance:d3pDistance,score:d3pDistance*opt.scoring.multiplier-closingPenalty(cp.d,opt),tp:tp,ep:{start:pin,finish:pout},cp:cp}}};function round2(score){return parseFloat(parseFloat(score).toFixed(2))}var scoringRules_config={FFVL:[{name:"Distance 3 points",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Triangle plat",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Triangle FAI",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}],XContest:[{name:"Free flight",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Free triangle",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"tri"},{name:"FAI triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"fai"},{name:"Closed free triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Closed FAI triangle",multiplier:1.6,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}]};const Solution$1=solution_Solution,{Range:Range$2,Point:Point$4}=foundation;var solver_1=function*(flight$1,_scoringTypes,_config){let reset;const scoringTypes=_scoringTypes||scoringRules_config.FFVL,config=_config||{};flight.analyze(flight$1,config),geom.init({flight:flight$1}),config.hp?Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthVincentys:Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthFCC;let solutionRoots=[];for(let scoringType of scoringTypes)for(let l of flight$1.ll){const opt={flight:flight$1,launch:l.launch,landing:l.landing,scoring:scoringType,config:config};let solutionRoot=new Solution$1([new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing)],opt);solutionRoot.do_bound(),solutionRoot.do_score(),solutionRoots.push(solutionRoot)}let best=solutionRoots[0],solutionQueue=new sortedSet(solutionRoots,Solution$1.prototype.contentEquals,Solution$1.prototype.contentCompare),processed=0,tcum=0;do{const tstart=Date.now();for(;solutionQueue.length>0;){if(processed%100==0&&"undefined"!=typeof process&&process.memoryUsage){const mem=process.memoryUsage();if(mem.heapUsed/mem.heapTotal>.98)break}let current=solutionQueue.pop();if(current.opt.scoring.rounding(current.bound)<=best.opt.scoring.rounding(best.score)){solutionQueue.clear();break}let children=current.do_branch();for(let s of children)if(s.do_bound(),!(s.bound<=best.score)){if(s.do_score(),processed++,s.score>=best.score&&s.score>0&&(best=s,solutionQueue.length>1e4&&solutionQueue.findLeast().value.bound<=best.score)){const garbageBest=solutionQueue.findGreatestLessThanOrEqual({bound:best.score});if(void 0!==garbageBest){const cutoff=solutionQueue.indexOf(garbageBest.value);solutionQueue.splice(0,cutoff+1).length}}solutionQueue.push(s)}if(processed>config.maxloop||Date.now()-tstart>config.maxcycle)break}best.processed=processed;const currentUpperBound=solutionQueue.findGreatest();if(best.currentUpperBound=currentUpperBound?currentUpperBound.value.bound:best.bound,tcum+=Date.now()-tstart,best.time=tcum,0==solutionQueue.length?best.optimal=!0:best.optimal=!1,best.optimal)return best.score=best.opt.scoring.rounding(best.score),best.scoreInfo&&(best.scoreInfo.distance=best.opt.scoring.rounding(best.scoreInfo.distance),best.scoreInfo.cp&&(best.scoreInfo.cp.d=best.opt.scoring.rounding(best.scoreInfo.cp.d))),reset=!0,best;reset=yield best}while(!reset)},description="igc-xc-score is a paragliding and hang-gliding XC scoring program in vanilla JS",directories={test:"test",example:"www"},bin={"igc-xc-score":"./igc-xc-score.js"},scripts={test:"node test && npm run eslint",eslint:"eslint geom.js index.js scoring.js scoring-rules.config.js solution.js solver.js test.js foundation.js util.js vincentys.js flight.js main.js",doc:"jsdoc -d doc solver.js scoring-rules.config.js",nexe_linux:"nexe -i igc-xc-score.js -o dist/igc-xc-score-linux-x86-x64 -t linux-x64-12.16.2",nexe_win:"nexe -i igc-xc-score.js -o dist/igc-xc-score.exe -t windows-x64-12.16.3",nexe_mac:"nexe -i igc-xc-score.js -o dist/igc-xc-score-macos -t darwin-x64-12.15.0",nexe_all:"npm run nexe_linux && npm run nexe_win && npm run nexe_mac",www:"webpack && cp www/index.html www/pacman.svg dist/www",build:"rollup -c && npm run nexe_all && npm run www && npm run doc",c8:"npx c8 --exclude igc-parser.js node test",lcov:"npx c8 --exclude igc-parser.js report --reporter=text-lcov > coverage/tests.lcov",codecov:"curl -s https://codecov.io/bash | env CODECOV_TOKEN='4d5a31d4-9b2f-4a62-9db9-2c49eef14ea0' bash",preversion:"npm test",version:"npm run build && git add package.json igc-xc-score.js index.es.js index.cjs.js doc",postversion:"git push && git push --tags"},repository={type:"git",url:"git+https://github.com/mmomtchev/igc-xc-score.git"},keywords=["igc","paragliding","hang-gliding","gliding"],author="Momtchil Momtchev <momtchil@momtchev.com>",bugs={url:"https://github.com/mmomtchev/igc-xc-score/issues"},homepage="https://github.com/mmomtchev/igc-xc-score#readme",dependencies={collections:"^5.1.11",flatbush:"^3.3.0","igc-parser":"^0.5.0",rbush:"^3.0.1"},devDependencies={"@rollup/plugin-commonjs":"^11.1.0","@rollup/plugin-json":"^4.1.0","@rollup/plugin-node-resolve":"^7.1.3",bootstrap:"^4.5.0",c8:"^7.2.0","css-loader":"^3.6.0",elliptic:">=6.5.3",eslint:"^6.8.0","eslint-config-standard":"^14.1.1","eslint-plugin-import":"^2.22.0","eslint-plugin-node":"^11.1.0","eslint-plugin-promise":"^4.2.1","eslint-plugin-standard":"^4.0.1",jquery:"^3.5.1",jsdoc:"^3.6.4",nexe:"^3.3.7",ol:"^6.3.1","popper.js":"^1.16.1",rollup:"^2.21.0","rollup-plugin-executable":"^1.6.0","rollup-plugin-terser":"^7.0.0","style-loader":"^1.2.1",webpack:"^4.43.0","webpack-cli":"^3.3.12"},_package={name:"igc-xc-score",version:"1.5.2",description:description,main:"index.cjs.js",module:"index.es.js",directories:directories,bin:bin,scripts:scripts,repository:repository,keywords:keywords,author:author,license:"LGPL-3.0-or-later",bugs:bugs,homepage:homepage,dependencies:dependencies,devDependencies:devDependencies},require$$1=getCjsExportFromNamespace(Object.freeze({__proto__:null,name:"igc-xc-score",version:"1.5.2",description:description,main:"index.cjs.js",module:"index.es.js",directories:directories,bin:bin,scripts:scripts,repository:repository,keywords:keywords,author:author,license:"LGPL-3.0-or-later",bugs:bugs,homepage:homepage,dependencies:dependencies,devDependencies:devDependencies,default:_package}));const Solution$2=solution_Solution;function displayDistance(labela,labelb,a,b){console.log(labela.padStart(6," "),labelb.padStart(6," "),"".padStart(4," "),a.distanceEarth(b).toFixed(2)+"km")}let inf,outf,config={};for(let arg of process.argv.slice(3)){const kv=arg.split("=");isNaN(kv[1])?"true"===kv[1]?config[kv[0]]=!0:"false"===kv[1]?config[kv[0]]=!1:config[kv[0]]=kv[1]:config[kv[0]]=parseInt(kv[1])}Object.keys(config).length&&!config.quiet&&console.log(config),config.scoring&&!scoringRules_config[config.scoring]&&(console.log("No scoring rules named "+config.scoring),process.exit(2)),config.pipe?(inf=0,outf=1):(process.argv[2]||(console.log("igc-xc-score "+require$$1.version),console.log("Momtchil Momtchev, velivole.fr/meteo.guru, 2020/COVID19"),console.log("Usage:"),console.log("igc-xc-score <flight.igc> [out=flight.json] [maxtime=<n>] [scoring=FFVL|XContest] [quiet=true] [pipe=true] [progress=<n>] ..."),console.log("flight.igc             is the flight track log"),console.log("out=flight.json        save the optimal solution in GeoJSON format"),console.log("maxtime=n              limit the execution time to n seconds"),console.log("scoring=FFVL|XContest  select the scoring rules"),console.log("quiet=true             suppress all output"),console.log("pipe=true              read flight data from stdin and write optimal solutions to stdout, works best with quiet"),console.log("progress=<n>           output an intermediate solution every n milliseconds, works best with pipe"),console.log("hp=true                enable High Precision mode (twice slower, precision goes from 10m-20m to 0.6m)"),console.log("trim=true              auto-trim the flight log to its launch and landing points"),process.exit(1)),inf=process.argv[2],outf=config.out);try{const flight=igcParser.parse(fs.readFileSync(inf,"utf8"),{lenient:!0});let best;config.env={fs:fs};const tend=Date.now()+1e3*config.maxtime;config.maxcycle=config.progress||100;const it=solver_1(flight,scoringRules_config[config.scoring]||scoringRules_config.FFVL,config);let newbest;do{if(newbest=it.next(),config.progress&&process.stdout.write(JSON.stringify(newbest.value.geojson())),void 0!==best&&Solution$2.prototype.contentEquals(newbest.value,best)||(best=newbest.value,config.quiet||process.stdout.write("best so far is "+best+"                                                               \n")),config.quiet||process.stdout.write(`processing solutions, current upper bound is ${best.currentUpperBound.toFixed(4)}             \r`),void 0!==config.maxtime&&Date.now()>tend){config.quiet||process.stdout.write("max execution time reached, no optimal solution found                                         \r");break}const mem=process.memoryUsage();if(mem.heapUsed/mem.heapTotal>.98){console.error("max memory usage reached, allocate more heap memory (--max-old-space-size)                  ");break}}while(!newbest.done);if(process.stdout.write("                                                                                                      \r"),void 0!==outf&&fs.writeFileSync(outf,JSON.stringify(best.geojson())),!config.quiet){for(let l of flight.ll)console.log(`Launch at fix ${l.launch}, ${flight.filtered[l.launch].time}`),console.log(`Landing at fix n-${flight.filtered.length-l.landing-1}, ${flight.filtered[l.landing].time}`);if(void 0!==best.scoreInfo){best.scoreInfo.ep&&best.scoreInfo.ep.start&&displayDistance("start","tp0",best.scoreInfo.ep.start,best.scoreInfo.tp[0]);for(let i of[0,1])displayDistance("tp"+i,"tp"+(i+1),best.scoreInfo.tp[i],best.scoreInfo.tp[i+1]);best.scoreInfo.ep&&best.scoreInfo.ep.finish?displayDistance("tp2","finish",best.scoreInfo.tp[2],best.scoreInfo.ep.finish):displayDistance("tp2","tp0",best.scoreInfo.tp[2],best.scoreInfo.tp[0]),console.log("Best solution is "+(best.optimal?util.consoleColors.fg.green+"optimal":util.consoleColors.fg.red+"not optimal")+util.consoleColors.reset+` ${util.consoleColors.fg.yellow}${best.opt.scoring.name}`+` ${util.consoleColors.fg.green}${best.score} points,`+` ${util.consoleColors.fg.yellow}${best.scoreInfo.distance}km`+(best.opt.scoring.closingDistance?` [ closing distance is ${best.scoreInfo.cp.d}km ]`:"")+(best.optimal?"":` potential maximum score could be up to ${best.bound.toFixed(2)} points`)+util.consoleColors.reset)}else console.log(`no solution found, try increasing maximum running time, potential maximum score could be up to ${best.bound.toFixed(2)} points`)}}catch(e){console.error(e.message),config&&config.debug&&console.error(e.stack),process.exit(1)}
\ No newline at end of file
diff --git a/index.cjs.js b/index.cjs.js
index 1845d00..c6eb5e4 100644
--- a/index.cjs.js
+++ b/index.cjs.js
@@ -1 +1 @@
-"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),Function.noop=function(){},Function.identity=function(value){return value},Function.by=function(by,compare){compare=compare||Object.compare,by=by||Function.identity;var compareBy=function(a,b){return compare(by(a),by(b))};return compareBy.compare=compare,compareBy.by=by,compareBy},Function.get=function(key){return function(object){return Object.get(object,key)}};var commonjsGlobal="undefined"!=typeof globalThis?globalThis:"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:{};function createCommonjsModule(fn,module){return fn(module={exports:{}},module.exports),module.exports}function getCjsExportFromNamespace(n){return n&&n.default||n}var genericCollection=GenericCollection;function GenericCollection(){throw new Error("Can't construct. GenericCollection is a mixin.")}var DOMTokenList=commonjsGlobal.DOMTokenList||function(){};GenericCollection.EmptyArray=Object.freeze([]),GenericCollection.prototype.addEach=function(values,mapFn,thisp){if(values&&(values instanceof Array||values instanceof DOMTokenList||values instanceof String))if(mapFn)for(var i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else if(values&&Object(values)===values)if("function"==typeof values.forEach)mapFn?values.map(mapFn,thisp).forEach(this.add,this):values.forEach(this.add,this);else if("function"==typeof values.next){var value;i=0;if(mapFn)for(;value=values.next().value;)this.add(mapFn.call(thisp,value),i++);else for(;value=values.next().value;)this.add(value,i++)}else if("number"==typeof values.length)if(mapFn)for(i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else mapFn?Object.keys(values).forEach((function(key){this.add(mapFn.call(thisp,values[key]),key)}),this):Object.keys(values).forEach((function(key){this.add(values[key],key)}),this);return this},GenericCollection.prototype.deleteEach=function(values,equals){return values.forEach((function(value){this.delete(value,equals)}),this),this},GenericCollection.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)}),void 0)},GenericCollection.prototype.map=function(callback){var thisp=arguments[1],result=[];return this.reduce((function(undefined$1,value,key,object,depth){result.push(callback.call(thisp,value,key,object,depth))}),void 0),result},GenericCollection.prototype.enumerate=function(start){null==start&&(start=0);var result=[];return this.reduce((function(undefined$1,value){result.push([start++,value])}),void 0),result},GenericCollection.prototype.group=function(callback,thisp,equals){equals=equals||Object.equals;var groups=[],keys=[];return this.forEach((function(value,key,object){key=callback.call(thisp,value,key,object);var group,index=keys.indexOf(key,equals);-1===index?(group=[],groups.push([key,group]),keys.push(key)):group=groups[index][1],group.push(value)})),groups},GenericCollection.prototype.toArray=function(){return this.map(Function.identity)},GenericCollection.prototype.toObject=function(){var object={};return this.reduce((function(undefined$1,value,key){object[key]=value}),void 0),object},GenericCollection.from=function(){return this.apply(this,arguments)},GenericCollection.prototype.filter=function(callback){var thisp=arguments[1],result=this.constructClone();return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)&&result.add(value,key)}),void 0),result},GenericCollection.prototype.every=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result&&callback.call(thisp,value,key,object,depth)}),!0)},GenericCollection.prototype.some=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result||callback.call(thisp,value,key,object,depth)}),!1)},GenericCollection.prototype.all=function(){return this.every(Boolean)},GenericCollection.prototype.any=function(){return this.some(Boolean)},GenericCollection.prototype.min=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)<0?value:result}),void 0)},GenericCollection.prototype.max=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)>0?value:result}),void 0)},GenericCollection.prototype.sum=function(zero){return zero=void 0===zero?0:zero,this.reduce((function(a,b){return a+b}),zero)},GenericCollection.prototype.average=function(zero){var sum=void 0===zero?0:zero,count=void 0===zero?0:zero;return this.reduce((function(undefined$1,value){sum+=value,count+=1}),void 0),sum/count},GenericCollection.prototype.concat=function(){for(var result=this.constructClone(this),i=0;i<arguments.length;i++)result.addEach(arguments[i]);return result},GenericCollection.prototype.flatten=function(){var self=this;return this.reduce((function(result,array){return array.forEach((function(value){this.push(value)}),result,self),result}),[])},GenericCollection.prototype.zip=function(){var table=Array.prototype.slice.call(arguments);return table.unshift(this),Array.unzip(table)},GenericCollection.prototype.join=function(delimiter){return this.reduce((function(result,string){return void 0===result?string:result+delimiter+string}),void 0)},GenericCollection.prototype.sorted=function(compare,by,order){return(compare=compare||this.contentCompare||Object.compare).by?(by=compare.by,compare=compare.compare||this.contentCompare||Object.compare):by=by||Function.identity,void 0===order&&(order=1),this.map((function(item){return{by:by(item),value:item}})).sort((function(a,b){return compare(a.by,b.by)*order})).map((function(pair){return pair.value}))},GenericCollection.prototype.reversed=function(){return this.constructClone(this).reverse()},GenericCollection.prototype.clone=function(depth,memo){if(void 0===depth)depth=1/0;else if(0===depth)return this;var clone=this.constructClone();return this.forEach((function(value,key){clone.add(Object.clone(value,depth-1,memo),key)}),this),clone},GenericCollection.prototype.only=function(){if(1===this.length)return this.one()},GenericCollection.prototype.iterator=function(){return this.iterate.apply(this,arguments)},GenericCollection._sizePropertyDescriptor={get:function(){return this.length},enumerable:!1,configurable:!0},Object.defineProperty(GenericCollection.prototype,"size",GenericCollection._sizePropertyDescriptor);var weakMap=createCommonjsModule((function(module){!function(){if("undefined"==typeof ses||!ses.ok||ses.ok()){"undefined"!=typeof ses&&(ses.weakMapPermitHostObjects=weakMapPermitHostObjects);var doubleWeakMapCheckSilentFailure=!1;if("function"==typeof WeakMap){var HostWeakMap=WeakMap;if("undefined"!=typeof navigator&&/Firefox/.test(navigator.userAgent));else{var testMap=new HostWeakMap,testObject=Object.freeze({});if(testMap.set(testObject,1),1===testMap.get(testObject))return void(module.exports=WeakMap);doubleWeakMapCheckSilentFailure=!0}}var gopn=Object.getOwnPropertyNames,defProp=Object.defineProperty,isExtensible=Object.isExtensible,HIDDEN_NAME="weakmap:ident:"+Math.random()+"___";if("undefined"!=typeof crypto&&"function"==typeof crypto.getRandomValues&&"function"==typeof ArrayBuffer&&"function"==typeof Uint8Array){var ab=new ArrayBuffer(25),u8s=new Uint8Array(ab);crypto.getRandomValues(u8s),HIDDEN_NAME="weakmap:rand:"+Array.prototype.map.call(u8s,(function(u8){return(u8%36).toString(36)})).join("")+"___"}if(defProp(Object,"getOwnPropertyNames",{value:function(obj){return gopn(obj).filter(isNotHiddenName)}}),"getPropertyNames"in Object){var originalGetPropertyNames=Object.getPropertyNames;defProp(Object,"getPropertyNames",{value:function(obj){return originalGetPropertyNames(obj).filter(isNotHiddenName)}})}!function(){var oldFreeze=Object.freeze;defProp(Object,"freeze",{value:function(obj){return getHiddenRecord(obj),oldFreeze(obj)}});var oldSeal=Object.seal;defProp(Object,"seal",{value:function(obj){return getHiddenRecord(obj),oldSeal(obj)}});var oldPreventExtensions=Object.preventExtensions;defProp(Object,"preventExtensions",{value:function(obj){return getHiddenRecord(obj),oldPreventExtensions(obj)}})}();var calledAsFunctionWarningDone=!1,nextId=0,OurWeakMap=function(){this instanceof OurWeakMap||calledAsFunctionWarning();var keys=[],values=[],id=nextId++;return Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord?hiddenRecord[id]:opt_default:(index=keys.indexOf(key))>=0?values[index]:opt_default}))},has___:{value:constFunc((function(key){var hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord:keys.indexOf(key)>=0}))},set___:{value:constFunc((function(key,value){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?hiddenRecord[id]=value:(index=keys.indexOf(key))>=0?values[index]=value:(index=keys.length,values[index]=value,keys[index]=key),this}))},delete___:{value:constFunc((function(key){var index,lastIndex,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord&&delete hiddenRecord[id]:!((index=keys.indexOf(key))<0)&&(lastIndex=keys.length-1,keys[index]=void 0,values[index]=values[lastIndex],keys[index]=keys[lastIndex],keys.length=lastIndex,values.length=lastIndex,!0)}))}})};OurWeakMap.prototype=Object.create(Object.prototype,{get:{value:function(key,opt_default){return this.get___(key,opt_default)},writable:!0,configurable:!0},has:{value:function(key){return this.has___(key)},writable:!0,configurable:!0},set:{value:function(key,value){return this.set___(key,value)},writable:!0,configurable:!0},delete:{value:function(key){return this.delete___(key)},writable:!0,configurable:!0}}),"function"==typeof HostWeakMap?function(){function DoubleWeakMap(){this instanceof OurWeakMap||calledAsFunctionWarning();var dset,hmap=new HostWeakMap,omap=void 0,enableSwitching=!1;return dset=doubleWeakMapCheckSilentFailure?function(key,value){return hmap.set(key,value),hmap.has(key)||(omap||(omap=new OurWeakMap),omap.set(key,value)),this}:function(key,value){if(enableSwitching)try{hmap.set(key,value)}catch(e){omap||(omap=new OurWeakMap),omap.set___(key,value)}else hmap.set(key,value);return this},Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){return omap?hmap.has(key)?hmap.get(key):omap.get___(key,opt_default):hmap.get(key,opt_default)}))},has___:{value:constFunc((function(key){return hmap.has(key)||!!omap&&omap.has___(key)}))},set___:{value:constFunc(dset)},delete___:{value:constFunc((function(key){var result=!!hmap.delete(key);return omap&&omap.delete___(key)||result}))},permitHostObjects___:{value:constFunc((function(token){if(token!==weakMapPermitHostObjects)throw new Error("bogus call to permitHostObjects___");enableSwitching=!0}))}})}doubleWeakMapCheckSilentFailure&&"undefined"!=typeof Proxy&&(Proxy=void 0),DoubleWeakMap.prototype=OurWeakMap.prototype,module.exports=DoubleWeakMap,Object.defineProperty(WeakMap.prototype,"constructor",{value:WeakMap,enumerable:!1,configurable:!0,writable:!0})}():("undefined"!=typeof Proxy&&(Proxy=void 0),module.exports=OurWeakMap)}function weakMapPermitHostObjects(map){map.permitHostObjects___&&map.permitHostObjects___(weakMapPermitHostObjects)}function isNotHiddenName(name){return!("weakmap:"==name.substr(0,"weakmap:".length)&&"___"===name.substr(name.length-3))}function getHiddenRecord(key){if(key!==Object(key))throw new TypeError("Not an object: "+key);var hiddenRecord=key[HIDDEN_NAME];if(hiddenRecord&&hiddenRecord.key===key)return hiddenRecord;if(isExtensible(key)){hiddenRecord={key:key};try{return defProp(key,HIDDEN_NAME,{value:hiddenRecord,writable:!1,enumerable:!1,configurable:!1}),hiddenRecord}catch(error){return}}}function constFunc(func){return func.prototype=null,Object.freeze(func)}function calledAsFunctionWarning(){calledAsFunctionWarningDone||"undefined"==typeof console||(calledAsFunctionWarningDone=!0,console.warn("WeakMap should be invoked as new WeakMap(), not WeakMap(). This will be an error in the future."))}}()})),weakMap$1="undefined"!=typeof WeakMap?WeakMap:weakMap,shimObject=Object;Object.empty=Object.freeze(Object.create(null)),Object.isObject=function(object){return Object(object)===object},Object.getValueOf=function(value){return value&&"function"==typeof value.valueOf&&(value=value.valueOf()),value};var hashMap=new weakMap$1;Object.hash=function(object){return object&&"function"==typeof object.hash?""+object.hash():Object(object)===object?(hashMap.has(object)||hashMap.set(object,Math.random().toString(36).slice(2)),hashMap.get(object)):""+object};var owns=Object.prototype.hasOwnProperty;Object.owns=function(object,key){return owns.call(object,key)},Object.has=function(object,key){if("object"!=typeof object)throw new Error("Object.has can't accept non-object: "+typeof object);if(object&&"function"==typeof object.has)return object.has(key);if("string"==typeof key)return key in object&&object[key]!==Object.prototype[key];throw new Error("Key must be a string for Object.has on plain objects")},Object.get=function(object,key,value){if("object"!=typeof object)throw new Error("Object.get can't accept non-object: "+typeof object);return object&&"function"==typeof object.get?object.get(key,value):Object.has(object,key)?object[key]:value},Object.set=function(object,key,value){object&&"function"==typeof object.set?object.set(key,value):object[key]=value},Object.addEach=function(target,source,overrides){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)target[index]=source[index];else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||(target[key]=source[key]);else!0===source.isMap?source.forEach((function(value,key){target[key]=value})):source.forEach((function(pair){target[pair[0]]=pair[1]}));else;return target},Object.defineEach=function(target,source,overrides,configurable,enumerable,writable){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)Object.defineProperty(target,index,{value:source[index],writable:writable,configurable:configurable,enumerable:enumerable});else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||Object.defineProperty(target,key,{value:source[key],writable:writable,configurable:configurable,enumerable:enumerable});else!0===source.isMap?source.forEach((function(value,key){Object.defineProperty(target,key,{value:value,writable:writable,configurable:configurable,enumerable:enumerable})})):source.forEach((function(pair){Object.defineProperty(target,pair[0],{value:pair[1],writable:writable,configurable:configurable,enumerable:enumerable})}));else;return target},Object.forEach=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0;iKey=keys[i];i++)callback.call(thisp,object[iKey],iKey,object)},Object.map=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0,result=[];iKey=keys[i];i++)result.push(callback.call(thisp,object[iKey],iKey,object));return result},Object.values=function(object){return Object.map(object,Function.identity)},Object.concat=function(){for(var object={},i=0;i<arguments.length;i++)Object.addEach(object,arguments[i]);return object},Object.from=Object.concat,Object.is=function(x,y){return x===y?0!==x||1/x==1/y:x!=x&&y!=y},Object.equals=function(a,b,equals,memo){if(equals=equals||Object.equals,(a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return!0;if(Object.isObject(a)){if((memo=memo||new weakMap$1).has(a))return!0;memo.set(a,!0)}if(Object.isObject(a)&&"function"==typeof a.equals)return a.equals(b,equals,memo);if(Object.isObject(b)&&"function"==typeof b.equals)return b.equals(a,equals,memo);if(Object.isObject(a)&&Object.isObject(b)&&Object.getPrototypeOf(a)===Object.prototype&&Object.getPrototypeOf(b)===Object.prototype){for(var name in a)if(!equals(a[name],b[name],equals,memo))return!1;for(var name in b)if(!(name in a)||!equals(b[name],a[name],equals,memo))return!1;return!0}return a!=a&&b!=b||(!a||!b)&&a===b},Object.compare=function(a,b){if((a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return 0;var aType=typeof a,bType=typeof b;return"number"===aType&&"number"===bType?a-b:"string"===aType&&"string"===bType?a<b?-1/0:1/0:a&&"function"==typeof a.compare?a.compare(b):b&&"function"==typeof b.compare?-b.compare(a):0},Object.clone=function(value,depth,memo){if(value=Object.getValueOf(value),memo=memo||new weakMap$1,void 0===depth)depth=1/0;else if(0===depth)return value;if(Object.isObject(value)){if(!memo.has(value))if(value&&"function"==typeof value.clone)memo.set(value,value.clone(depth,memo));else{var prototype=Object.getPrototypeOf(value);if(null!==prototype&&prototype!==Object.prototype)throw new Error("Can't clone "+value);var clone=Object.create(prototype);for(var key in memo.set(value,clone),value)clone[key]=Object.clone(value[key],depth-1,memo)}return memo.get(value)}return value},Object.clear=function(object){if(object&&"function"==typeof object.clear)object.clear();else for(var keys=Object.keys(object),i=keys.length;i;)delete object[keys[--i]];return object};var genericOrder=GenericOrder;function GenericOrder(){throw new Error("Can't construct. GenericOrder is a mixin.")}GenericOrder.prototype.equals=function(that,equals){return equals=equals||this.contentEquals||shimObject.equals,this===that||!!that&&(this.length===that.length&&this.zip(that).every((function(pair){return equals(pair[0],pair[1])})))},GenericOrder.prototype.compare=function(that,compare){if(compare=compare||this.contentCompare||shimObject.compare,this===that)return 0;if(!that)return 1;var length=Math.min(this.length,that.length),comparison=this.zip(that).reduce((function(comparison,pair,index){return 0===comparison?index>=length?comparison:compare(pair[0],pair[1]):comparison}),0);return 0===comparison?this.length-that.length:comparison},GenericOrder.prototype.toJSON=function(){return this.toArray()};var array_splice=Array.prototype.splice,array_slice=Array.prototype.slice;Array.empty=[],Object.freeze&&Object.freeze(Array.empty),Array.nativeFrom=Array.from;var isSymbolDefined="undefined"!=typeof Symbol;function define(key,value){Object.defineProperty(Array.prototype,key,{value:value,writable:!0,configurable:!0,enumerable:!1})}Array.from=function(values,mapFn,thisArg){if(isSymbolDefined&&values&&"function"==typeof values[Symbol.iterator])return Array.nativeFrom(values,mapFn,thisArg);var array=[];return array.addEach(values),array},Array.unzip=function(table){for(var transpose=[],length=1/0,i=0;i<table.length;i++){var row=table[i];table[i]=row.toArray(),row.length<length&&(length=row.length)}for(i=0;i<table.length;i++){row=table[i];for(var j=0;j<row.length;j++)j<length&&j in row&&(transpose[j]=transpose[j]||[],transpose[j][i]=row[j])}return transpose},define("addEach",genericCollection.prototype.addEach),define("deleteEach",genericCollection.prototype.deleteEach),define("toArray",genericCollection.prototype.toArray),define("toObject",genericCollection.prototype.toObject),define("all",genericCollection.prototype.all),define("any",genericCollection.prototype.any),define("min",genericCollection.prototype.min),define("max",genericCollection.prototype.max),define("sum",genericCollection.prototype.sum),define("average",genericCollection.prototype.average),define("only",genericCollection.prototype.only),define("flatten",genericCollection.prototype.flatten),define("zip",genericCollection.prototype.zip),define("enumerate",genericCollection.prototype.enumerate),define("group",genericCollection.prototype.group),define("sorted",genericCollection.prototype.sorted),define("reversed",genericCollection.prototype.reversed),define("constructClone",(function(values){var clone=new this.constructor;return clone.addEach(values),clone})),define("has",(function(value,equals){return-1!==this.findValue(value,equals)})),define("get",(function(index,defaultValue){if(+index!==index)throw new Error("Indicies must be numbers");return!index in this?defaultValue:this[index]})),define("set",(function(index,value){return this[index]=value,!0})),define("add",(function(value){return this.push(value),!0})),define("delete",(function(value,equals){var index=this.findValue(value,equals);return-1!==index&&(this.spliceOne(index),!0)})),define("deleteAll",(function(value,equals){equals=equals||this.contentEquals||Object.equals;for(var count=0,index=0;index<this.length;)equals(value,this[index])?(this.swap(index,1),count++):index++;return count})),Array.prototype.find||define("find",(function(predicate){if(null==this)throw new TypeError('"this" is null or not defined');var o=Object(this),len=o.length>>>0;if("function"!=typeof predicate)throw new TypeError("predicate must be a function");for(var thisArg=arguments[1],k=0;k<len;){var kValue=o[k];if(predicate.call(thisArg,kValue,k,o))return kValue;k++}}));var deprecatedWarnNonce={};function deprecatedWarn(msg,notOnce){"undefined"!=typeof console&&"function"==typeof console.warn&&!0!==notOnce&&!1===deprecatedWarnNonce.hasOwnProperty(msg)&&(console.warn(msg),deprecatedWarnNonce[msg]++)}var ArrayFindPrototype=Object.getOwnPropertyDescriptor(Array.prototype,"find").value;function ArrayIterator(array,start,end){this.array=array,this.start=null==start?0:start,this.end=end}if(define("find",(function(value,equals,index){return"function"==typeof arguments[0]&&this instanceof Array?ArrayFindPrototype.apply(this,arguments):(deprecatedWarn("Array#find usage is deprecated please use Array#findValue"),this.findValue.apply(this,arguments))})),define("findValue",(function(value,equals,index){if(index)throw new Error("Array#findValue does not support third argument: index");equals=equals||this.contentEquals||Object.equals;for(index=0;index<this.length;index++)if(index in this&&equals(value,this[index]))return index;return-1})),define("findLast",(function(value,equals){return deprecatedWarn("Array#findLast function is deprecated please use Array#findLastValue instead."),this.findLastValue.apply(this,arguments)})),define("findLastValue",(function(value,equals){equals=equals||this.contentEquals||Object.equals;var index=this.length;do{if(--index in this&&equals(this[index],value))return index}while(index>0);return-1})),define("swap",(function(start,length,plus){var args,plusLength,i,j,returnValue;if(start>this.length&&(this.length=start),void 0!==plus){if(args=[start,length],Array.isArray(plus)||(plus=array_slice.call(plus)),i=0,(plusLength=plus.length)<1e3){for(;i<plusLength;i++)args[i+2]=plus[i];return array_splice.apply(this,args)}for(returnValue=array_splice.apply(this,args);i<plusLength;){for(args=[start+i,0],j=2;j<1002&&i<plusLength;j++,i++)args[j]=plus[i];array_splice.apply(this,args)}return returnValue}return void 0!==length?array_splice.call(this,start,length):void 0!==start?array_splice.call(this,start):[]})),define("peek",(function(){return this[0]})),define("poke",(function(value){this.length>0&&(this[0]=value)})),define("peekBack",(function(){if(this.length>0)return this[this.length-1]})),define("pokeBack",(function(value){this.length>0&&(this[this.length-1]=value)})),define("one",(function(){for(var i in this)if(Object.owns(this,i))return this[i]})),Array.prototype.clear||define("clear",(function(){return this.length=0,this})),define("compare",(function(that,compare){var i,length,relative;if(compare=compare||Object.compare,this===that)return 0;if(!that||!Array.isArray(that))return genericOrder.prototype.compare.call(this,that,compare);for(length=this.length<that.length?this.length:that.length,i=0;i<length;i++)if(i in this){if(!(i in that))return-1;if(relative=compare(this[i],that[i]))return relative}else if(i in that)return 1;return this.length-that.length})),define("equals",(function(that,equals){equals=equals||Object.equals;var i=0,length=this.length;if(this===that)return!0;if(!that||!Array.isArray(that))return genericOrder.prototype.equals.call(this,that);if(length!==that.length)return!1;for(;i<length;++i)if(i in this){if(!(i in that))return!1;if(!equals(this[i],that[i]))return!1}else if(i in that)return!1;return!0})),define("clone",(function(depth,memo){if(null==depth)depth=1/0;else if(0===depth)return this;if((memo=memo||new weakMap$1).has(this))return memo.get(this);var clone=new Array(this.length);for(var i in memo.set(this,clone),this)clone[i]=Object.clone(this[i],depth-1,memo);return clone})),define("iterate",(function(start,end){return new ArrayIterator(this,start,end)})),void 0===Array.prototype.spliceOne&&define("spliceOne",(function(index,itemToAdd){var len=this.length;if(len)if(1===arguments.length){for(;index<len;)this[index]=this[index+1],index++;this.length--}else this[index]=itemToAdd})),define("Iterator",ArrayIterator),ArrayIterator.prototype.__iterationObject=null,Object.defineProperty(ArrayIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ArrayIterator.prototype.next=function(){return this.start===(null==this.end?this.array.length:this.end)?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=this.array[this.start++],this._iterationObject},!RegExp.escape){var special=/[-[\]{}()*+?.\\^$|,#\s]/g;RegExp.escape=function(string){return string.replace(special,"\\$&")}}getCjsExportFromNamespace(Object.freeze({__proto__:null}));var genericSet=GenericSet;function GenericSet(){throw new Error("Can't construct. GenericSet is a mixin.")}GenericSet.prototype.isSet=!0,GenericSet.prototype.union=function(that){var union=this.constructClone(this);return union.addEach(that),union},GenericSet.prototype.intersection=function(that){return this.constructClone(this.filter((function(value){return that.has(value)})))},GenericSet.prototype.difference=function(that){var union=this.constructClone(this);return union.deleteEach(that),union},GenericSet.prototype.symmetricDifference=function(that){var union=this.union(that),intersection=this.intersection(that);return union.difference(intersection)},GenericSet.prototype.deleteAll=function(value){return+this.delete(value)},GenericSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.length===that.length&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GenericSet.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,value,object,depth)}),void 0)},GenericSet.prototype.toJSON=function(){return this.toArray()},GenericSet.prototype.contains=function(value){return this.has(value)},GenericSet.prototype.remove=function(value){return this.delete(value)},GenericSet.prototype.toggle=function(value){this.has(value)?this.delete(value):this.add(value)};var _valuesArrayFunction=function(value,key){return value};GenericSet.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};GenericSet.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)};var _list=List;function List(values,equals,getDefault){return List._init(List,this,values,equals,getDefault)}function ListIterator(head){this.head=head,this.at=head.next}function Node(value){this.value=value,this.prev=null,this.next=null}List._init=function(constructor,object,values,equals,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,getDefault);var head=object.head=new object.Node;head.next=head,head.prev=head,object.contentEquals=equals||Object.equals,object.getDefault=getDefault||Function.noop,object.length=0,object.addEach(values)},List.List=List,Object.addEach(List.prototype,genericCollection.prototype),Object.addEach(List.prototype,genericOrder.prototype),List.from=genericCollection.from,List.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.getDefault)},List.prototype.find=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.next);at!==head;){if(equals(at.value,value))return at;at=at.next}},List.prototype.findLast=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.prev);at!==head;){if(equals(at.value,value))return at;at=at.prev}},List.prototype.has=function(value,equals){return!!this.find(value,equals)},List.prototype.get=function(value,equals){var found=this.find(value,equals);return found?found.value:this.getDefault(value)},List.prototype.delete=function(value,equals){var found=this.findLast(value,equals);return!!found&&(found.delete(),this.length--,!0)},List.prototype.deleteAll=function(value,equals){equals=equals||this.contentEquals;for(var head=this.head,at=head.next,count=0;at!==head;)equals(value,at.value)&&(at.delete(),count++),at=at.next;return this.length-=count,count},List.prototype.clear=function(){this.head.next=this.head.prev=this.head,this.length=0},List.prototype.add=function(value){var node=new this.Node(value);return this._addNode(node)},List.prototype._addNode=function(node){return this.head.addBefore(node),this.length++,!0},List.prototype.push=function(){for(var head=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);head.addBefore(node)}this.length+=arguments.length},List.prototype.unshift=function(){for(var at=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);at.addAfter(node),at=node}this.length+=arguments.length},List.prototype._shouldPop=function(){var value,head=this.head;return head.prev!==head&&(value=head.prev.value),value},List.prototype.pop=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.prev.value;var index=this.length-1,popDispatchValueArray=_before?_before.call(this,value,index):void 0;head.prev.delete(),this.length--,_after&&_after.call(this,value,index,popDispatchValueArray)}return value},List.prototype.shift=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.next.value;var dispatchValueArray=_before?_before.call(this,value,0):void 0;head.next.delete(),this.length--,_after&&_after.call(this,value,0,dispatchValueArray)}return value},List.prototype.peek=function(){if(this.head!==this.head.next)return this.head.next.value},List.prototype.poke=function(value){this.head!==this.head.next?this.head.next.value=value:this.push(value)},List.prototype.one=function(){return this.peek()},List.prototype.scan=function(at,fallback){var head=this.head;if("number"==typeof at){var count=at;if(count>=0)for(at=head.next;count&&(count--,(at=at.next)!=head););else for(at=head;count<0&&(count++,(at=at.prev)!=head););return at}return at||fallback},List.prototype.slice=function(at,end){var sliced=[],head=this.head;for(at=this.scan(at,head.next),end=this.scan(end,head);at!==end&&at!==head;)sliced.push(at.value),at=at.next;return sliced},List.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},List.prototype.swap=function(start,length,plus,_before,_after){var initial=start;start=this.scan(start,this.head),null==length&&(length=1/0),plus=Array.from(plus);for(var minus=[],at=start;length--&&length>=0&&at!==this.head;)minus.push(at.value),at=at.next;_before&&_before.call(this,start,plus,minus);at=start;var i=0;for(at=start;i<minus.length;i++,at=at.next)at.delete();null==initial&&at===this.head&&(at=this.head.next);for(i=0;i<plus.length;i++){var node=new this.Node(plus[i]);at.addBefore(node)}return this.length+=plus.length-minus.length,_after&&_after.call(this,start,plus,minus),minus},List.prototype.reverse=function(){var at=this.head;do{var temp=at.next;at.next=at.prev,at.prev=temp,at=at.next}while(at!==this.head);return this},List.prototype.sort=function(){this.swap(0,this.length,this.sorted.apply(this,arguments))},List.prototype.reduce=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.next;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.next;return basis},List.prototype.reduceRight=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.prev;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.prev;return basis},List.prototype.updateIndexes=function(node,index){for(;node!==this.head;)node.index=index++,node=node.next},List.prototype.iterate=function(){return new ListIterator(this.head)},ListIterator.prototype.__iterationObject=null,Object.defineProperty(ListIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ListIterator.prototype.next=function(){if(this.at===this.head)this._iterationObject.done=!0,this._iterationObject.value=void 0;else{var value=this.at.value;this.at=this.at.next,this._iterationObject.value=value}return this._iterationObject},List.prototype.Node=Node,Node.prototype.delete=function(){this.prev.next=this.next,this.next.prev=this.prev},Node.prototype.addBefore=function(node){var prev=this.prev;this.prev=node,node.prev=prev,prev.next=node,node.next=this},Node.prototype.addAfter=function(node){var next=this.next;this.next=node,node.next=next,next.prev=node,node.prev=this};var iterator=Iterator;function Iterator(iterable,standardMode){var values=standardMode&&iterable&&iterable.values&&iterable.values();if(values&&"function"==typeof values.next)return values;if(!(this instanceof Iterator))return new Iterator(iterable);if(Array.isArray(iterable)||"string"==typeof iterable)return Iterator.iterate(iterable);if((iterable=shimObject(iterable))instanceof Iterator)return iterable;if(iterable.next)this.next=function(){return iterable.next()};else if(iterable.iterate){var iterator=iterable.iterate();this.next=function(){return iterator.next()}}else{if("[object Function]"!==shimObject.prototype.toString.call(iterable))throw new TypeError("Can't iterate "+iterable);this.next=iterable}}Iterator.prototype.forEach=genericCollection.prototype.forEach,Iterator.prototype.map=genericCollection.prototype.map,Iterator.prototype.filter=genericCollection.prototype.filter,Iterator.prototype.every=genericCollection.prototype.every,Iterator.prototype.some=genericCollection.prototype.some,Iterator.prototype.any=genericCollection.prototype.any,Iterator.prototype.all=genericCollection.prototype.all,Iterator.prototype.min=genericCollection.prototype.min,Iterator.prototype.max=genericCollection.prototype.max,Iterator.prototype.sum=genericCollection.prototype.sum,Iterator.prototype.average=genericCollection.prototype.average,Iterator.prototype.flatten=genericCollection.prototype.flatten,Iterator.prototype.zip=genericCollection.prototype.zip,Iterator.prototype.enumerate=genericCollection.prototype.enumerate,Iterator.prototype.sorted=genericCollection.prototype.sorted,Iterator.prototype.group=genericCollection.prototype.group,Iterator.prototype.reversed=genericCollection.prototype.reversed,Iterator.prototype.toArray=genericCollection.prototype.toArray,Iterator.prototype.toObject=genericCollection.prototype.toObject,Iterator.prototype.iterator=genericCollection.prototype.iterator,Iterator.prototype.__iterationObject=null,shimObject.defineProperty(Iterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:void 0})}}),Iterator.prototype.constructClone=function(values){var clone=[];return clone.addEach(values),clone},Iterator.prototype.mapIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var callbackValue=callback.call(thisp,self.next().value,i++,self);self._iterationObject.value=callbackValue}return self._iterationObject}))},Iterator.prototype.filterIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){for(var nextEntry;;){if(!0===(nextEntry=self.next()).done)return nextEntry;if(callback.call(thisp,nextEntry.value,i++,self))return nextEntry}}))},Iterator.prototype.reduce=function(callback){var nextEntry,self=Iterator(this),result=arguments[1],thisp=arguments[2],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;if(!0===(nextEntry=self.next()).done){if(arguments.length>1)return arguments[1];throw TypeError("cannot reduce a value from an empty iterator with no initial value")}for(result=arguments.length>1?callback.call(thisp,result,nextEntry.value,i,self):nextEntry.value,i++;;){if(!0===(nextEntry=self.next()).done)return result;result=callback.call(thisp,result,nextEntry.value,i,self),i++}},Iterator.prototype.concat=function(){return Iterator.concat(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.dropWhile=function(callback){var stopValue,nextEntry,self=Iterator(this),thisp=arguments[1],stopped=!1,i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;for(;!0!==(nextEntry=self.next()).done;){if(!callback.call(thisp,nextEntry.value,i,self)){stopped=!0,stopValue=nextEntry.value;break}i++}return stopped?self.constructor([stopValue]).concat(self):self.constructor([])},Iterator.prototype.takeWhile=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var value=self.next().value;callback.call(thisp,value,i++,self)?self._iterationObject.value=value:(self._iterationObject.done=!0,self._iterationObject.value=void 0)}return self._iterationObject}))},Iterator.prototype.zipIterator=function(){return Iterator.unzip(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.enumerateIterator=function(start){return Iterator.count(start).zipIterator(this)},Iterator.iterate=function(iterable){var start;return start=0,new Iterator((function(){if("object"==typeof iterable)for(;!(start in iterable);){if(start>=iterable.length){this._iterationObject.done=!0,this._iterationObject.value=void 0;break}start+=1}else start>=iterable.length&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);return this._iterationObject.done||(this._iterationObject.value=iterable[start],start+=1),this._iterationObject}))},Iterator.cycle=function(cycle,times){var next;return arguments.length<2&&(times=1/0),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),next&&!0!==nextEntry.done||(times>0?(times--,iteration=Iterator.iterate(cycle),nextEntry=(next=iteration.next.bind(iteration))()):(this._iterationObject.done=!0,nextEntry=this._iterationObject)),nextEntry}))},Iterator.concat=function(iterators){var next;return iterators=Iterator(iterators),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),nextEntry&&!0!==nextEntry.done?nextEntry:!1===(nextEntry=iterators.next()).done?(iteration=Iterator(nextEntry.value),(next=iteration.next.bind(iteration))()):nextEntry}))},Iterator.unzip=function(iterators){return 0===(iterators=Iterator(iterators).map(Iterator)).length?new Iterator([]):new Iterator((function(){var stopped,nextEntry,result=iterators.map((function(iterator){return!0===(nextEntry=iterator.next()).done&&(stopped=!0),nextEntry.value}));return stopped?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=result,this._iterationObject}))},Iterator.zip=function(){return Iterator.unzip(Array.prototype.slice.call(arguments))},Iterator.chain=function(){return Iterator.concat(Array.prototype.slice.call(arguments))},Iterator.range=function(start,stop,step){return arguments.length<3&&(step=1),arguments.length<2&&(stop=start,start=0),start=start||0,step=step||1,new Iterator((function(){start>=stop&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);var result=start;return start+=step,this._iterationObject.value=result,this._iterationObject}))},Iterator.count=function(start,step){return Iterator.range(start,1/0,step)},Iterator.repeat=function(value,times){return new Iterator.range(times).mapIterator((function(){return value}))};var genericMap=GenericMap;function GenericMap(){throw new Error("Can't construct. GenericMap is a mixin.")}function Item(key,value){this.key=key,this.value=value}GenericMap.prototype.isMap=!0,GenericMap.prototype.addEach=function(values){var i;if(values&&shimObject(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);else shimObject.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},GenericMap.prototype.get=function(key,defaultValue){var item=this.store.get(new this.Item(key));return item?item.value:arguments.length>1?(console.log("Use of a second argument as default value is deprecated to match standards"),defaultValue):this.getDefault(key)},GenericMap.prototype.set=function(key,value){var item=new this.Item(key,value),found=this.store.get(item);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found.value),found.value=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.store.add(item)&&this.length++,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},GenericMap.prototype.add=function(value,key){return this.set(key,value)},GenericMap.prototype.has=function(key){return this.store.has(new this.Item(key))},GenericMap.prototype.delete=function(key){var item=new this.Item(key);if(this.store.has(item)){var from=this.store.get(item).value;return this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,from),this.store.delete(item),this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0}return!1},GenericMap.prototype.clear=function(){var keys,key;if(this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),this.store.clear(),this.length=0,this.dispatchesMapChanges)for(var i=0;key=keys[i];i++)this.dispatchMapChange(key)},GenericMap.prototype.reduce=function(callback,basis,thisp){return this.store.reduce((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.reduceRight=function(callback,basis,thisp){return this.store.reduceRight((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.keysArray=function(){return this.map((function(value,key){return key}))},GenericMap.prototype.keys=function(){return new iterator(this.keysArray(),!0)},GenericMap.prototype.valuesArray=function(){return this.map(Function.identity)},GenericMap.prototype.values=function(){return new iterator(this.valuesArray(),!0)},GenericMap.prototype.entriesArray=function(){return this.map((function(value,key){return[key,value]}))},GenericMap.prototype.entries=function(){return new iterator(this.entriesArray(),!0)},GenericMap.prototype.items=function(){return this.entriesArray()},GenericMap.prototype.equals=function(that,equals){return equals=equals||shimObject.equals,this===that||(that&&"function"==typeof that.every?that.length===this.length&&that.every((function(value,key){return equals(this.get(key),value)}),this):shimObject.keys(that).length===this.length&&shimObject.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))},GenericMap.prototype.toJSON=function(){return this.entriesArray()},GenericMap.prototype.Item=Item,Item.prototype.equals=function(that){return shimObject.equals(this.key,that.key)&&shimObject.equals(this.value,that.value)},Item.prototype.compare=function(that){return shimObject.compare(this.key,that.key)};var _dict=Dict;function Dict(values,getDefault){if(!(this instanceof Dict))return new Dict(values,getDefault);getDefault=getDefault||Function.noop,this.getDefault=getDefault,this.store=Object.create(null),this.length=0,this.addEach(values)}Dict.Dict=Dict,Object.addEach(Dict.prototype,genericCollection.prototype),Object.addEach(Dict.prototype,genericMap.prototype),Dict.from=genericCollection.from,Dict.prototype.constructClone=function(values){return new this.constructor(values,this.getDefault)},Dict.prototype.assertString=function(key){if("string"!=typeof key)throw new TypeError("key must be a string but Got "+key)},Object.defineProperty(Dict.prototype,"$__proto__",{writable:!0}),Object.defineProperty(Dict.prototype,"_hasProto",{get:function(){return this.hasOwnProperty("$__proto__")&&void 0!==this._protoValue}}),Object.defineProperty(Dict.prototype,"_protoValue",{get:function(){return this.$__proto__},set:function(value){this.$__proto__=value}}),Object.defineProperty(Dict.prototype,"size",genericCollection._sizePropertyDescriptor),Dict.prototype.get=function(key,defaultValue){return this.assertString(key),"__proto__"===key?this._hasProto?this._protoValue:arguments.length>1?defaultValue:this.getDefault(key):key in this.store?this.store[key]:arguments.length>1?defaultValue:this.getDefault(key)},Dict.prototype.set=function(key,value){this.assertString(key);var isProtoKey="__proto__"===key;return(isProtoKey?this._hasProto:key in this.store)?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,isProtoKey?this._protoValue:this.store[key]),isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!1):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.length++,isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!0)},Dict.prototype.has=function(key){return this.assertString(key),"__proto__"===key?this._hasProto:key in this.store},Dict.prototype.delete=function(key){return this.assertString(key),"__proto__"===key?!!this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this._protoValue),this._protoValue=void 0,this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0):key in this.store&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)},Dict.prototype.clear=function(){var key;for(key in this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange("__proto__",this._protoValue),this._protoValue=void 0,this.dispatchesMapChanges&&this.dispatchMapChange("__proto__",void 0)),this.store)this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0);this.length=0},Dict.prototype.reduce=function(callback,basis,thisp){this._hasProto&&(basis=callback.call(thisp,basis,"$__proto__","__proto__",this));var store=this.store;for(var key in this.store)basis=callback.call(thisp,basis,store[key],key,this);return basis},Dict.prototype.reduceRight=function(callback,basis,thisp){var self=this,store=this.store;return basis=Object.keys(this.store).reduceRight((function(basis,key){return callback.call(thisp,basis,store[key],key,self)}),basis),this._hasProto?callback.call(thisp,basis,this._protoValue,"__proto__",self):basis},Dict.prototype.one=function(){var key;for(key in this.store)return this.store[key];return this._protoValue},Dict.prototype.toJSON=function(){return this.toObject()};var treeLog=TreeLog;function TreeLog(){}TreeLog.ascii={intersection:"+",through:"-",branchUp:"+",branchDown:"+",fromBelow:".",fromAbove:"'",fromBoth:"+",strafe:"|"},TreeLog.unicodeRound={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"╭",fromAbove:"╰",fromBoth:"┣",strafe:"┃"},TreeLog.unicodeSharp={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"┏",fromAbove:"┗",fromBoth:"┣",strafe:"┃"};var _fastSet=FastSet;function FastSet(values,equals,hash,getDefault){if(!(this instanceof FastSet))return new FastSet(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault;var self=this;this.buckets=new this.Buckets(null,(function(){return new self.Bucket})),this.length=0,this.addEach(values)}FastSet.FastSet=FastSet,Object.addEach(FastSet.prototype,genericCollection.prototype),Object.addEach(FastSet.prototype,genericSet.prototype),FastSet.from=genericCollection.from,FastSet.prototype.Buckets=_dict,FastSet.prototype.Bucket=_list,FastSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},FastSet.prototype.has=function(value){var hash=this.contentHash(value);return this.buckets.get(hash).has(value)},FastSet.prototype.get=function(value,equals){if(equals)throw new Error("FastSet#get does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)?buckets.get(hash).get(value):this.getDefault(value)},FastSet.prototype.delete=function(value,equals){if(equals)throw new Error("FastSet#delete does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;if(buckets.has(hash)){var bucket=buckets.get(hash);if(bucket.delete(value))return this.length--,0===bucket.length&&buckets.delete(hash),!0}return!1},FastSet.prototype.clear=function(){this.buckets.clear(),this.length=0},FastSet.prototype.add=function(value){var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)||buckets.set(hash,new this.Bucket(null,this.contentEquals)),!buckets.get(hash).has(value)&&(buckets.get(hash).add(value),this.length++,!0)},FastSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],buckets=this.buckets,index=0;return buckets.reduce((function(basis,bucket){return bucket.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)}),basis,this)},FastSet.prototype.one=function(){if(this.length>0)return this.buckets.one().one()},FastSet.prototype.iterate=function(){return this.buckets.valuesArray().flatten().iterate()},FastSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeSharp,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp);for(var hash,branch,leader,bucket,buckets=this.buckets,bucketsSize=buckets.size,mapIter=buckets.keys(),index=0;hash=mapIter.next().value;)index===bucketsSize-1?(branch=charmap.fromAbove,leader=" "):0===index?(branch=charmap.branchDown,leader=charmap.strafe):(branch=charmap.fromBoth,leader=charmap.strafe),bucket=buckets.get(hash),callback.call(thisp,branch+charmap.through+charmap.branchDown+" "+hash),bucket.forEach((function(value,node){var branch,below,written;node===bucket.head.prev?(branch=charmap.fromAbove,below=" "):(branch=charmap.fromBoth,below=charmap.strafe),logNode(node,(function(line){written?callback.call(thisp,leader+" "+below+"  "+line):(callback.call(thisp,leader+" "+branch+charmap.through+charmap.through+line),written=!0)}),(function(line){callback.call(thisp,leader+" "+charmap.strafe+"  "+line)}))})),index++},FastSet.prototype.logNode=function(node,write){var value=node.value;Object(value)===value?JSON.stringify(value,null,4).split("\n").forEach((function(line){write(" "+line)})):write(" "+value)};var _set=createCommonjsModule((function(module){var GlobalSet,CollectionsSet;void 0!==commonjsGlobal.Set&&"function"==typeof commonjsGlobal.Set.prototype.values&&((GlobalSet=module.exports=commonjsGlobal.Set).Set=GlobalSet,GlobalSet.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value){basis=callback.call(thisp,basis,value,this)})),basis},GlobalSet.prototype.reduceRight=function(callback,basis){for(var value,thisp=arguments[2],setIterator=this.values(),size=this.size,reverseOrder=new Array(this.size),i=size;value=setIterator.next().value;)reverseOrder[--i]=value;for(;i<size;)basis=callback.call(thisp,basis,reverseOrder[i++],this);return basis},GlobalSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.size===(that.size||that.length)&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GlobalSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},GlobalSet.prototype.toJSON=function(){return this.entriesArray()},GlobalSet.prototype.one=function(){if(this.size>0)return this.values().next().value},GlobalSet.prototype.pop=function(){if(this.size){for(var aValue,value,setIterator=this.values();aValue=setIterator.next().value;)value=aValue;return this.delete(value,this.size-1),value}},GlobalSet.prototype.shift=function(){if(this.size){var firstValue=this.values().next().value;return this.delete(firstValue,0),firstValue}},Object.defineProperty(GlobalSet.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0}),GlobalSet.from=function(value){var result=new this;return result.addEach(value),result},Object.addEach(GlobalSet.prototype,genericCollection.prototype,!1),Object.addEach(GlobalSet.prototype,genericSet.prototype,!1)),(CollectionsSet=function CollectionsSet(values,equals,hash,getDefault){return CollectionsSet._init(CollectionsSet,this,values,equals,hash,getDefault)})._init=function(constructor,object,values,equals,hash,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,object.contentEquals=equals,object.contentHash=hash,object.getDefault=getDefault,object.order=new object.Order(void 0,equals),object.store=new object.Store(void 0,(function(a,b){return equals(a.value,b.value)}),(function(node){return hash(node.value)})),object.length=0,object.addEach(values)},CollectionsSet.Set=CollectionsSet,CollectionsSet.CollectionsSet=CollectionsSet,Object.addEach(CollectionsSet.prototype,genericCollection.prototype),Object.addEach(CollectionsSet.prototype,genericSet.prototype),CollectionsSet.from=genericCollection.from,Object.defineProperty(CollectionsSet.prototype,"size",genericCollection._sizePropertyDescriptor),CollectionsSet.prototype.Order=_list,CollectionsSet.prototype.Store=_fastSet,CollectionsSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},CollectionsSet.prototype.has=function(value){var node=new this.order.Node(value);return this.store.has(node)},CollectionsSet.prototype.get=function(value,equals){if(equals)throw new Error("Set#get does not support second argument: equals");var node=new this.order.Node(value);return(node=this.store.get(node))?node.value:this.getDefault(value)},CollectionsSet.prototype.add=function(value){var node=new this.order.Node(value);if(!this.store.has(node)){this.length;return this.order.add(value),node=this.order.head.prev,this.store.add(node),this.length++,!0}return!1},CollectionsSet.prototype.delete=function(value,equals){if(equals)throw new Error("Set#delete does not support second argument: equals");var node=new this.order.Node(value);return!!this.store.has(node)&&(node=this.store.get(node),this.store.delete(node),this.order.splice(node,1),this.length--,!0)},CollectionsSet.prototype.pop=function(){if(this.length){var result=this.order.head.prev.value;return this.delete(result),result}},CollectionsSet.prototype.shift=function(){if(this.length){var result=this.order.head.next.value;return this.delete(result),result}},CollectionsSet.prototype.one=function(){if(this.length>0)return this.store.one().value},CollectionsSet.prototype.clear=function(){this.store.clear(),this.order.clear(),this.length=0},Object.defineProperty(CollectionsSet.prototype,"_clear",{value:CollectionsSet.prototype.clear}),CollectionsSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],list=this.order,index=0;return list.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)},CollectionsSet.prototype.reduceRight=function(callback,basis){var thisp=arguments[2],list=this.order,index=this.length-1;return list.reduceRight((function(basis,value){return callback.call(thisp,basis,value,index--,this)}),basis,this)},CollectionsSet.prototype.iterate=function(){return this.order.iterate()},CollectionsSet.prototype.values=function(){return new iterator(this.valuesArray(),!0)},CollectionsSet.prototype.log=function(){var set=this.store;return set.log.apply(set,arguments)},GlobalSet?(GlobalSet.prototype.valuesArray=genericSet.prototype.valuesArray,GlobalSet.prototype.entriesArray=genericSet.prototype.entriesArray,module.exports=GlobalSet,GlobalSet.CollectionsSet=CollectionsSet):module.exports=CollectionsSet})),_map=createCommonjsModule((function(module){var Map,GlobalMap,CollectionsMap;if(void 0!==commonjsGlobal.Map&&"function"==typeof commonjsGlobal.Set.prototype.values){var map_makeObservable;GlobalMap=Map=module.exports=commonjsGlobal.Map,Map.Map=Map,map_makeObservable={}.__proto__===Object.prototype?function(){this.__proto__=ChangeDispatchMap}:function(){Object.defineProperties(this,observableSetProperties)},Object.defineProperty(Map.prototype,"makeObservable",{value:map_makeObservable,writable:!0,configurable:!0,enumerable:!1}),Object.defineProperty(Map.prototype,"makePropertyObservable",{value:function(){},writable:!0,configurable:!0,enumerable:!1}),Map.prototype.constructClone=function(values){return new this.constructor(values)},Map.prototype.isMap=!0,Map.prototype.addEach=function(values){if(values&&Object(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(var i=0;i<values.length;i++)this.add(values[i],i);else Object.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},Map.prototype.add=function(value,key){return this.set(key,value)},Map.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value,key,map){basis=callback.call(thisp,basis,value,key,this)})),basis},Map.prototype.reduceRight=function(callback,basis){for(var aKey,thisp=arguments[2],keysIterator=this.keys(),size=this.size,reverseOrder=new Array(this.size),i=0;aKey=keysIterator.next().value;)reverseOrder[--size]=aKey;for(;i++<size;)basis=callback.call(thisp,basis,this.get(reverseOrder[i]),reverseOrder[i],this);return basis},Map.prototype.equals=function(that,equals){return equals=equals||Object.equals,this===that||(that&&"function"==typeof that.every?that.size===this.size&&that.every((function(value,key){return equals(this.get(key),value)}),this):Object.keys(that).length===this.size&&Object.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))};var _keysArrayFunction=function(value,key){return key};Map.prototype.keysArray=function(){return this.map(_keysArrayFunction)};var _valuesArrayFunction=function(value,key){return value};Map.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};Map.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)},Map.prototype.toJSON=function(){return this.entriesArray()},Map.prototype.items=function(){return this.entriesArray()},Map.from=function(value){var result=new this;return result.addEach(value),result},Object.defineProperty(Map.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0});var map_clear=Map.prototype.clear,map_set=Map.prototype.set,map_delete=Map.prototype.delete,observableMapProperties={clear:{value:function(){var keys;this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),map_clear.call(this),this.dispatchesMapChanges&&keys.forEach((function(key){this.dispatchMapChange(key)}),this)},writable:!0,configurable:!0},set:{value:function(key,value){var found=this.get(key);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},writable:!0,configurable:!0},delete:{value:function(key){return!!this.has(key)&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.get(key)),map_delete.call(this,key),this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)}}};Object.addEach(Map.prototype,genericCollection.prototype,!1);var ChangeDispatchMap=Object.create(Map.prototype,observableMapProperties)}var Set=_set.CollectionsSet;CollectionsMap=Map=function Map(values,equals,hash,getDefault){if(!(this instanceof Map))return new Map(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault,this.store=new Set(void 0,(function(a,b){return equals(a.key,b.key)}),(function(item){return hash(item.key)})),this.length=0,this.addEach(values)},Map.Map=Map,Object.addEach(Map.prototype,genericCollection.prototype),Object.addEach(Map.prototype,genericMap.prototype),Object.defineProperty(Map.prototype,"size",genericCollection._sizePropertyDescriptor),Map.from=genericCollection.from,Map.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},Map.prototype.log=function(charmap,logNode,callback,thisp){logNode=logNode||this.logNode,this.store.log(charmap,(function(node,log,logBefore){logNode(node.value.value,log,logBefore)}),callback,thisp)},Map.prototype.logNode=function(node,log){log(" key: "+node.key),log(" value: "+node.value)},GlobalMap?(module.exports=GlobalMap,GlobalMap.CollectionsMap=CollectionsMap):module.exports=CollectionsMap})),changeDescriptor=createCommonjsModule((function(module){var ObjectChangeDescriptor=module.exports.ObjectChangeDescriptor=function(name){return this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null,this};Object.defineProperties(ObjectChangeDescriptor.prototype,{name:{value:null,writable:!0},isActive:{value:!1,writable:!0},_willChangeListeners:{value:null,writable:!0},willChangeListeners:{get:function(){return this._willChangeListeners||(this._willChangeListeners=new this.willChangeListenersRecordConstructor(this.name))}},_changeListeners:{value:null,writable:!0},changeListeners:{get:function(){return this._changeListeners||(this._changeListeners=new this.changeListenersRecordConstructor(this.name))}},changeListenersRecordConstructor:{value:ChangeListenersRecord,writable:!0},willChangeListenersRecordConstructor:{value:WillChangeListenersRecord,writable:!0}});var ListenerGhost=module.exports.ListenerGhost=Object.create(null),ChangeListenerSpecificHandlerMethodName=new _map;function ChangeListenersRecord(name){var specificHandlerMethodName=ChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="Change",ChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this._current=null,this._current=null,this.specificHandlerMethodName=specificHandlerMethodName,this}module.exports.ChangeListenersRecord=ChangeListenersRecord,Object.defineProperties(ChangeListenersRecord.prototype,{_current:{value:null,writable:!0},current:{get:function(){return this._current},set:function(value){this._current=value}},ListenerGhost:{value:ListenerGhost,writable:!0},ghostCount:{value:0,writable:!0},maxListenerGhostRatio:{value:.3,writable:!0},listenerGhostFilter:{value:function(value){return value!==this.ListenerGhost}},removeCurrentGostListenersIfNeeded:{value:function(){return this._current&&this.ghostCount/this._current.length>this.maxListenerGhostRatio&&(this.ghostCount=0,this._current=this._current.filter(this.listenerGhostFilter,this)),this._current}},dispatchBeforeChange:{value:!1,writable:!0},genericHandlerMethodName:{value:"handlePropertyChange",writable:!0}}),module.exports.WillChangeListenersRecord=WillChangeListenersRecord;var WillChangeListenerSpecificHandlerMethodName=new _map;function WillChangeListenersRecord(name){var specificHandlerMethodName=WillChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="WillChange",WillChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}WillChangeListenersRecord.prototype=new ChangeListenersRecord,WillChangeListenersRecord.prototype.constructor=WillChangeListenersRecord,WillChangeListenersRecord.prototype.genericHandlerMethodName="handlePropertyWillChange"})),propertyChanges=(changeDescriptor.ObjectChangeDescriptor,changeDescriptor.ListenerGhost,changeDescriptor.ChangeListenersRecord,changeDescriptor.WillChangeListenersRecord,PropertyChanges);function PropertyChanges(){throw new Error("This is an abstract interface. Mix it. Don't construct it")}var ObjectChangeDescriptor=changeDescriptor.ObjectChangeDescriptor,ListenerGhost=changeDescriptor.ListenerGhost;PropertyChanges.debug=!0;var ObjectsPropertyChangeListeners=new weakMap$1,ObjectChangeDescriptorName=new _map;function dispatchEach(listeners,key,value,object){if(listeners&&listeners._current){var current,listener,i,countI,thisp,specificHandlerMethodName=listeners.specificHandlerMethodName,genericHandlerMethodName=listeners.genericHandlerMethodName,Ghost=ListenerGhost;if(Array.isArray(listeners._current)){for(i=0,countI=(current=listeners.removeCurrentGostListenersIfNeeded()).length;i<countI;i++)if((thisp=current[i])!==Ghost){if(!(listener=thisp[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}else{if(!(listener=(thisp=listeners._current)[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}}PropertyChanges.ObjectChangeDescriptor=function(){},PropertyChanges.prototype.getOwnPropertyChangeDescriptor=function(key){var keyChangeDescriptor,objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);if(objectPropertyChangeDescriptors||(objectPropertyChangeDescriptors=Object.create(null),ObjectsPropertyChangeListeners.set(this,objectPropertyChangeDescriptors)),void 0===(keyChangeDescriptor=objectPropertyChangeDescriptors[key])){var propertyName=ObjectChangeDescriptorName.get(key);return propertyName||(propertyName=(propertyName=String(key))&&propertyName[0].toUpperCase()+propertyName.slice(1),ObjectChangeDescriptorName.set(key,propertyName)),objectPropertyChangeDescriptors[key]=new ObjectChangeDescriptor(propertyName)}return keyChangeDescriptor},PropertyChanges.prototype.hasOwnPropertyChangeDescriptor=function(key){var objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);return!!objectPropertyChangeDescriptors&&(!key||void 0!==objectPropertyChangeDescriptors[key])},PropertyChanges.prototype.addOwnPropertyChangeListener=function(key,listener,beforeChange){this.makeObservable&&!this.isObservable&&this.makeObservable();var descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key),listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners;PropertyChanges.makePropertyObservable(this,key),listeners._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener;var self=this;return function(){PropertyChanges.removeOwnPropertyChangeListener(self,key,listener,beforeChange),self=null}},PropertyChanges.prototype.addBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.addOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.removeOwnPropertyChangeListener=function removeOwnPropertyChangeListener(key,listener,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove property change listener: does not exist: property name"+JSON.stringify(key));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=removeOwnPropertyChangeListener.ListenerGhost):listeners._current.spliceOne(index)}},PropertyChanges.prototype.removeOwnPropertyChangeListener.ListenerGhost=ListenerGhost,PropertyChanges.prototype.removeBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.removeOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.dispatchOwnPropertyChange=function dispatchOwnPropertyChange(key,value,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if(!descriptor.isActive){descriptor.isActive=!0,listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners;try{dispatchOwnPropertyChange.dispatchEach(listeners,key,value,this)}finally{descriptor.isActive=!1}}},PropertyChanges.prototype.dispatchOwnPropertyChange.dispatchEach=dispatchEach,dispatchEach.ListenerGhost=ListenerGhost,PropertyChanges.prototype.dispatchBeforeOwnPropertyChange=function(key,listener){return PropertyChanges.dispatchOwnPropertyChange(this,key,listener,!0)};var ObjectsOverriddenPropertyDescriptors=new weakMap$1,propertyListener=(new weakMap$1,{get:void 0,set:void 0,configurable:!0,enumerable:!1});PropertyChanges.prototype.makePropertyObservable=function(key){var overriddenPropertyDescriptors=ObjectsOverriddenPropertyDescriptors.get(this);if(!overriddenPropertyDescriptors||void 0===overriddenPropertyDescriptors.get(key)){if(!overriddenPropertyDescriptors){if(Array.isArray(this))return;if(!Object.isExtensible(this))throw new Error("Can't make property "+JSON.stringify(key)+" observable on "+this+" because object is not extensible");overriddenPropertyDescriptors=new _map,ObjectsOverriddenPropertyDescriptors.set(this,overriddenPropertyDescriptors)}var overriddenDescriptor,attached=this;do{if(overriddenDescriptor=Object.getOwnPropertyDescriptor(attached,key))break;attached=Object.getPrototypeOf(attached)}while(attached);if(overriddenDescriptor){if(!overriddenDescriptor.configurable)return;if(!overriddenDescriptor.writable&&!overriddenDescriptor.set)return}else overriddenDescriptor={value:void 0,enumerable:!0,writable:!0,configurable:!0};overriddenPropertyDescriptors.set(key,overriddenDescriptor),"value"in overriddenDescriptor?(propertyListener.get=function dispatchingGetter(){return dispatchingGetter.overriddenDescriptor.value},propertyListener.set=function dispatchingSetter(value){var descriptor,isActive,overriddenDescriptor=dispatchingSetter.overriddenDescriptor;if(value!==overriddenDescriptor.value){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,dispatchingSetter.key,overriddenDescriptor.value,this)}finally{}}if(overriddenDescriptor.value=value,!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,dispatchingSetter.key,value,this)}finally{descriptor.isActive=!1}}},propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.key=key,propertyListener.get.overriddenDescriptor=propertyListener.set.overriddenDescriptor=overriddenDescriptor,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key],propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0):(propertyListener.get=overriddenDescriptor.get,propertyListener.set=function dispatchingSetter(){var descriptor,isActive,newValue,formerValue=dispatchingSetter.overriddenGetter.call(this);if(1===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0]):2===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0],arguments[1]):dispatchingSetter.overriddenSetter.apply(this,arguments),(newValue=dispatchingSetter.overriddenGetter.call(this))!==formerValue){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,key,formerValue,this)}finally{}}if(!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,key,newValue,this)}finally{descriptor.isActive=!1}}},propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0,propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.overriddenSetter=overriddenDescriptor.set,propertyListener.set.overriddenGetter=overriddenDescriptor.get,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key]),Object.defineProperty(this,key,propertyListener)}},PropertyChanges.getOwnPropertyChangeDescriptor=function(object,key){return object.getOwnPropertyChangeDescriptor?object.getOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.getOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.hasOwnPropertyChangeDescriptor=function(object,key){return object.hasOwnPropertyChangeDescriptor?object.hasOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.hasOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.addOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.addOwnPropertyChangeListener?object.addOwnPropertyChangeListener(key,listener,beforeChange):this.prototype.addOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.removeOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.removeOwnPropertyChangeListener?object.removeOwnPropertyChangeListener(key,listener,beforeChange):PropertyChanges.prototype.removeOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.dispatchOwnPropertyChange=function(object,key,value,beforeChange){if(Object.isObject(object))return object.dispatchOwnPropertyChange?object.dispatchOwnPropertyChange(key,value,beforeChange):PropertyChanges.prototype.dispatchOwnPropertyChange.call(object,key,value,beforeChange)},PropertyChanges.addBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.addOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.removeBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.removeOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.dispatchBeforeOwnPropertyChange=function(object,key,value){return PropertyChanges.dispatchOwnPropertyChange(object,key,value,!0)},PropertyChanges.makePropertyObservable=function(object,key){return object.makePropertyObservable?object.makePropertyObservable(key):PropertyChanges.prototype.makePropertyObservable.call(object,key)};var ObjectChangeDescriptor$1=changeDescriptor.ObjectChangeDescriptor,ChangeListenersRecord=changeDescriptor.ChangeListenersRecord,ListenerGhost$1=changeDescriptor.ListenerGhost,rangeChangeDescriptors=new weakMap$1;function RangeChangeDescriptor(name){this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null}RangeChangeDescriptor.prototype=new ObjectChangeDescriptor$1,RangeChangeDescriptor.prototype.constructor=RangeChangeDescriptor,RangeChangeDescriptor.prototype.changeListenersRecordConstructor=RangeChangeListenersRecord,RangeChangeDescriptor.prototype.willChangeListenersRecordConstructor=RangeWillChangeListenersRecord,Object.defineProperty(RangeChangeDescriptor.prototype,"active",{get:function(){return this._active||(this._active=this._current?this._current.slice():[])}});var RangeChangeListenersSpecificHandlerMethodName=new _map;function RangeChangeListenersRecord(name){var specificHandlerMethodName=RangeChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeChange",RangeChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeChangeListenersRecord.prototype=new ChangeListenersRecord,RangeChangeListenersRecord.prototype.constructor=RangeChangeListenersRecord;var RangeWillChangeListenersSpecificHandlerMethodName=new _map;function RangeWillChangeListenersRecord(name){var specificHandlerMethodName=RangeWillChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeWillChange",RangeWillChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeWillChangeListenersRecord.prototype=new ChangeListenersRecord,RangeWillChangeListenersRecord.prototype.constructor=RangeWillChangeListenersRecord;var rangeChanges=RangeChanges;function RangeChanges(){throw new Error("Can't construct. RangeChanges is a mixin.")}RangeChanges.prototype.getAllRangeChangeDescriptors=function(){return rangeChangeDescriptors.has(this)||rangeChangeDescriptors.set(this,new _map),rangeChangeDescriptors.get(this)},RangeChanges.prototype.getRangeChangeDescriptor=function(token){var tokenChangeDescriptors=this.getAllRangeChangeDescriptors();return token=token||"",tokenChangeDescriptors.has(token)||tokenChangeDescriptors.set(token,new RangeChangeDescriptor(token)),tokenChangeDescriptors.get(token)};var ObjectsDispatchesRangeChanges=new weakMap$1,dispatchesChangesPropertyDescriptor={get:function(){return ObjectsDispatchesRangeChanges.get(this)},set:function(value){return ObjectsDispatchesRangeChanges.set(this,value)},configurable:!0,enumerable:!1};RangeChanges.prototype.addRangeChangeListener=function(listener,token,beforeChange){!this.isObservable&&this.makeObservable&&this.makeObservable();var listeners,descriptor=this.getRangeChangeDescriptor(token);(listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener,void 0===Object.getOwnPropertyDescriptor(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges")&&Object.defineProperty(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges",dispatchesChangesPropertyDescriptor),this.dispatchesRangeChanges=!0;var self=this;return function(){self&&(self.removeRangeChangeListener(listener,token,beforeChange),self=null)}},RangeChanges.prototype.removeRangeChangeListener=function(listener,token,beforeChange){var listeners,descriptor=this.getRangeChangeDescriptor(token);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove range change listener: does not exist: token "+JSON.stringify(token));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=ListenerGhost$1):listeners._current.spliceOne(index)}},RangeChanges.prototype.dispatchRangeChange=function(plus,minus,index,beforeChange){var descriptor,listeners,tokenName,i,countI,listener,currentListeners,Ghost,descriptors=this.getAllRangeChangeDescriptors(),mapIter=descriptors.values();for(descriptors.dispatchBeforeChange=beforeChange;descriptor=mapIter.next().value;){if(descriptor.isActive)return;if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(tokenName=listeners.specificHandlerMethodName,Array.isArray(listeners._current)){if(listeners._current.length){descriptor.isActive=!0;try{for(currentListeners=listeners.removeCurrentGostListenersIfNeeded(),Ghost=ListenerGhost$1,i=0,countI=currentListeners.length;i<countI;i++)if((listener=currentListeners[i])!==Ghost)if(listener[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}else{descriptor.isActive=!0;try{if((listener=listeners._current)[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}},RangeChanges.prototype.addBeforeRangeChangeListener=function(listener,token){return this.addRangeChangeListener(listener,token,!0)},RangeChanges.prototype.removeBeforeRangeChangeListener=function(listener,token){return this.removeRangeChangeListener(listener,token,!0)},RangeChanges.prototype.dispatchBeforeRangeChange=function(plus,minus,index){return this.dispatchRangeChange(plus,minus,index,!0)};var sortedSet=SortedSet;function SortedSet(values,equals,compare,getDefault){if(!(this instanceof SortedSet))return new SortedSet(values,equals,compare,getDefault);this.contentEquals=equals||Object.equals,this.contentCompare=compare||Object.compare,this.getDefault=getDefault||Function.noop,this.root=null,this.length=0,this.addEach(values)}function Node$1(value){this.value=value,this.left=null,this.right=null,this.length=1}function Iterator$1(set,start,end){if(this.set=set,this.prev=null,this.end=end,start){var next=this.set.findLeastGreaterThanOrEqual(start);next&&(this.set.splay(next.value),this.prev=next.getPrevious())}}SortedSet.SortedSet=SortedSet,Object.addEach(SortedSet.prototype,genericCollection.prototype),Object.addEach(SortedSet.prototype,genericSet.prototype),Object.addEach(SortedSet.prototype,propertyChanges.prototype),Object.addEach(SortedSet.prototype,rangeChanges.prototype),Object.defineProperty(SortedSet.prototype,"size",genericCollection._sizePropertyDescriptor),SortedSet.from=genericCollection.from,SortedSet.prototype.isSorted=!0,SortedSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentCompare,this.getDefault)},SortedSet.prototype.has=function(value,equals){if(equals)throw new Error("SortedSet#has does not support second argument: equals");return!!this.root&&(this.splay(value),this.contentEquals(value,this.root.value))},SortedSet.prototype.get=function(value,equals){if(equals)throw new Error("SortedSet#get does not support second argument: equals");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.value:this.getDefault(value)},SortedSet.prototype.add=function(value){var node=new this.Node(value);if(!this.root)return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],0),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],0),!0;if(this.splay(value),!this.contentEquals(value,this.root.value)){var comparison=this.contentCompare(value,this.root.value);if(0===comparison)throw new Error("SortedSet cannot contain incomparable but inequal values: "+value+" and "+this.root.value);return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],this.root.index),comparison<0?(node.right=this.root,node.left=this.root.left,this.root.left=null,this.root.touch()):(node.left=this.root,node.right=this.root.right,this.root.right=null,this.root.touch()),node.touch(),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],this.root.index),!0}return!1},SortedSet.prototype.delete=function(value,equals){if(equals)throw new Error("SortedSet#delete does not support second argument: equals");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value))){var index=this.root.index;if(this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([],[value],index),this.root.left){var right=this.root.right;this.root=this.root.left,this.splay(value),this.root.right=right}else this.root=this.root.right;return this.length--,this.root&&this.root.touch(),this.dispatchesRangeChanges&&this.dispatchRangeChange([],[value],index),!0}return!1},SortedSet.prototype.indexOf=function(value,index){if(index)throw new Error("SortedSet#indexOf does not support second argument: startIndex");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.index:-1},SortedSet.prototype.find=function(value,equals,index){if(equals)throw new Error("SortedSet#find does not support second argument: equals");if(index)throw new Error("SortedSet#find does not support third argument: index");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value)))return this.root},SortedSet.prototype.findGreatest=function(at){if(this.root){for(at=at||this.root;at.right;)at=at.right;return at}},SortedSet.prototype.findLeast=function(at){if(this.root){for(at=at||this.root;at.left;)at=at.left;return at}},SortedSet.prototype.findGreatestLessThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>0?this.root.getPrevious():this.root},SortedSet.prototype.findGreatestLessThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root.getPrevious():this.root},SortedSet.prototype.findLeastGreaterThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root:this.root.getNext()},SortedSet.prototype.findLeastGreaterThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)<=0?this.root.getNext():this.root},SortedSet.prototype.pop=function(){if(this.root){var found=this.findGreatest();return this.delete(found.value),found.value}},SortedSet.prototype.shift=function(){if(this.root){var found=this.findLeast();return this.delete(found.value),found.value}},SortedSet.prototype.push=function(){this.addEach(arguments)},SortedSet.prototype.unshift=function(){this.addEach(arguments)},SortedSet.prototype.slice=function(start,end){start=start||0,end=end||this.length,start<0&&(start+=this.length),end<0&&(end+=this.length);var sliced=[];if(this.root)for(this.splayIndex(start);this.root.index<end&&(sliced.push(this.root.value),this.root.right);)this.splay(this.root.getNext().value);return sliced},SortedSet.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},SortedSet.prototype.swap=function(start,length,plus){if(void 0===start&&void 0===length)return[];(start=start||0)<0&&(start+=this.length),void 0===length&&(length=1/0);var swapped=[];if(this.root){this.splayIndex(start);for(var i=0;i<length;i++){swapped.push(this.root.value);var next=this.root.getNext();if(this.delete(this.root.value),!next)break;this.splay(next.value)}}return this.addEach(plus),swapped},SortedSet.prototype.splay=function(value){var stub,left,right,temp,root,history;if(this.root){for(stub=left=right=new this.Node,history=new this.Node,root=this.root;;){var comparison=this.contentCompare(value,root.value);if(comparison<0){if(!root.left)break;if(this.contentCompare(value,root.left.value)<0&&(temp=root.left,root.left=temp.right,root.touch(),temp.right=root,temp.touch(),!(root=temp).left))break;(temp=new Node$1).right=root,temp.left=history.left,history.left=temp,right.left=root,right.touch(),right=root,root=root.left}else{if(!(comparison>0))break;if(!root.right)break;if(this.contentCompare(value,root.right.value)>0&&(temp=root.right,root.right=temp.left,root.touch(),temp.left=root,temp.touch(),!(root=temp).right))break;(temp=new Node$1).left=root,temp.right=history.right,history.right=temp,left.right=root,left.touch(),left=root,root=root.right}}for(left.right=root.left,left.touch(),right.left=root.right,right.touch(),root.left=stub.right,root.right=stub.left;history.left;)history.left.right.touch(),history.left=history.left.left;for(;history.right;)history.right.left.touch(),history.right=history.right.right;root.touch(),this.root=root}},SortedSet.prototype.splayIndex=function(index){if(this.root){for(var at=this.root,atIndex=this.root.index;atIndex!==index;)if(atIndex>index&&at.left)atIndex-=1+((at=at.left).right?at.right.length:0);else{if(!(atIndex<index&&at.right))break;atIndex+=1+((at=at.right).left?at.left.length:0)}return this.splay(at.value),this.root.index===index}return!1},SortedSet.prototype.reduce=function(callback,basis,thisp){return this.root&&(basis=this.root.reduce(callback,basis,0,thisp,this)),basis},SortedSet.prototype.reduceRight=function(callback,basis,thisp){return this.root&&(basis=this.root.reduceRight(callback,basis,this.length-1,thisp,this)),basis},SortedSet.prototype.min=function(at){var least=this.findLeast(at);if(least)return least.value},SortedSet.prototype.max=function(at){var greatest=this.findGreatest(at);if(greatest)return greatest.value},SortedSet.prototype.one=function(){return this.min()},SortedSet.prototype.clear=function(){var minus;this.dispatchesRangeChanges&&(minus=this.toArray(),this.dispatchBeforeRangeChange([],minus,0)),this.root=null,this.length=0,this.dispatchesRangeChanges&&this.dispatchRangeChange([],minus,0)},SortedSet.prototype.iterate=function(start,end){return new this.Iterator(this,start,end)},SortedSet.prototype.Iterator=Iterator$1,SortedSet.prototype.summary=function(){return this.root?this.root.summary():"()"},SortedSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeRound,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp),this.root&&this.root.log(charmap,logNode,callback,callback)},SortedSet.prototype.logNode=function(node,log,logBefore){log(" "+node.value)},SortedSet.logCharsets=treeLog,SortedSet.prototype.Node=Node$1,Node$1.prototype.reduce=function(callback,basis,index,thisp,tree,depth){if(depth=depth||0,this.left){var length=this.left.length;basis=this.left.reduce(callback,basis,index,thisp,tree,depth+1),index+=length}return basis=callback.call(thisp,basis,this.value,index,tree,this,depth),index+=1,this.right&&(basis=this.right.reduce(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.reduceRight=function(callback,basis,index,thisp,tree,depth){return depth=depth||0,this.right&&(basis=this.right.reduceRight(callback,basis,index,thisp,tree,depth+1),index-=this.right.length),basis=callback.call(thisp,basis,this.value,this.value,tree,this,depth),index-=1,this.left&&(basis=this.left.reduceRight(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.touch=function(){this.length=1+(this.left?this.left.length:0)+(this.right?this.right.length:0),this.index=this.left?this.left.length:0},Node$1.prototype.checkIntegrity=function(){var length=1;if(length+=this.left?this.left.checkIntegrity():0,length+=this.right?this.right.checkIntegrity():0,this.length!==length)throw new Error("Integrity check failed: "+this.summary());return length},Node$1.prototype.getNext=function(){var node=this;if(node.right){for(node=node.right;node.left;)node=node.left;return node}},Node$1.prototype.getPrevious=function(){var node=this;if(node.left){for(node=node.left;node.right;)node=node.right;return node}},Node$1.prototype.summary=function(){var value=this.value||"-";return value+=" <"+this.length,this.left||this.right?"("+value+" "+(this.left?this.left.summary():"()")+", "+(this.right?this.right.summary():"()")+")":"("+value+")"},Node$1.prototype.log=function(charmap,logNode,log,logAbove){var branch,loggedAbove,loggedOn,loggedBelow,self=this;branch=this.left&&this.right?charmap.intersection:this.left?charmap.branchUp:this.right?charmap.branchDown:charmap.through,this.left&&this.left.log(charmap,logNode,(function(line){loggedAbove?logAbove(charmap.strafe+" "+line):(loggedAbove=!0,logAbove(charmap.fromBelow+charmap.through+line))}),(function(line){logAbove("  "+line)})),logNode(this,(function(line){loggedOn?log((self.right?charmap.strafe:" ")+line):(loggedOn=!0,log(branch+line))}),(function(line){logAbove((self.left?charmap.strafe:" ")+line)})),this.right&&this.right.log(charmap,logNode,(function(line){loggedBelow?log("  "+line):(loggedBelow=!0,log(charmap.fromAbove+charmap.through+line))}),(function(line){log(charmap.strafe+" "+line)}))},Iterator$1.prototype.__iterationObject=null,Object.defineProperty(Iterator$1.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),Iterator$1.prototype.next=function(){var next;return(next=this.prev?this.set.findLeastGreaterThan(this.prev.value):this.set.findLeast())?void 0!==this.end&&this.set.contentCompare(next.value,this.end)>=0?(this._iterationObject.done=!0,this._iterationObject.value=void 0):(this.prev=next,this._iterationObject.value=next.value):(this._iterationObject.done=!0,this._iterationObject.value=void 0),this._iterationObject};var util={radians:function(degrees){return degrees/(180/Math.PI)},degrees:function(radians){return radians*(180/Math.PI)},REarth:6371,WGS84:{a:6378.137,b:6356.752314245,f:1/298.257223563},consoleColors:{reset:"",bright:"",dim:"",underscore:"",blink:"",reverse:"",hidden:"",fg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""},bg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""}}};var vincentys={inverse:function(p1,p2){const φ1=util.radians(p1.y),λ1=util.radians(p1.x),φ2=util.radians(p2.y),λ2=util.radians(p2.x),{a:a,b:b,f:f}=util.WGS84,L=λ2-λ1,tanU1=(1-f)*Math.tan(φ1),cosU1=1/Math.sqrt(1+tanU1*tanU1),sinU1=tanU1*cosU1,tanU2=(1-f)*Math.tan(φ2),cosU2=1/Math.sqrt(1+tanU2*tanU2),sinU2=tanU2*cosU2,antipodal=Math.abs(L)>Math.PI/2||Math.abs(φ2-φ1)>Math.PI/2;let λ=L,sinλ=null,cosλ=null,σ=antipodal?Math.PI:0,sinσ=0,cosσ=antipodal?-1:1,sinSqσ=null,cos2σₘ=1,sinα=null,cosSqα=1,C=null,λʹ=null,iterations=0;do{if(sinλ=Math.sin(λ),cosλ=Math.cos(λ),sinSqσ=cosU2*sinλ*(cosU2*sinλ)+(cosU1*sinU2-sinU1*cosU2*cosλ)*(cosU1*sinU2-sinU1*cosU2*cosλ),Math.abs(sinSqσ)<Number.EPSILON)break;sinσ=Math.sqrt(sinSqσ),cosσ=sinU1*sinU2+cosU1*cosU2*cosλ,σ=Math.atan2(sinσ,cosσ),sinα=cosU1*cosU2*sinλ/sinσ,cosSqα=1-sinα*sinα,cos2σₘ=0!=cosSqα?cosσ-2*sinU1*sinU2/cosSqα:0,C=f/16*cosSqα*(4+f*(4-3*cosSqα)),λʹ=λ,λ=L+(1-C)*f*sinα*(σ+C*sinσ*(cos2σₘ+C*cosσ*(2*cos2σₘ*cos2σₘ-1)));if((antipodal?Math.abs(λ)-Math.PI:Math.abs(λ))>Math.PI)throw new EvalError("λ > π")}while(Math.abs(λ-λʹ)>1e-7&&++iterations<1e3);if(iterations>=1e3)throw new EvalError("Vincenty formula failed to converge");const uSq=cosSqα*(a*a-b*b)/(b*b),B=uSq/1024*(256+uSq*(uSq*(74-47*uSq)-128)),s=b*(1+uSq/16384*(4096+uSq*(uSq*(320-175*uSq)-768)))*(σ-B*sinσ*(cos2σₘ+B/4*(cosσ*(2*cos2σₘ*cos2σₘ-1)-B/6*cos2σₘ*(4*sinσ*sinσ-3)*(4*cos2σₘ*cos2σₘ-3)))),α1=Math.abs(sinSqσ)<Number.EPSILON?0:Math.atan2(cosU2*sinλ,cosU1*sinU2-sinU1*cosU2*cosλ),α2=Math.abs(sinSqσ)<Number.EPSILON?Math.PI:Math.atan2(cosU1*sinλ,-sinU1*cosU2+cosU1*sinU2*cosλ);return{distance:s,initialBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α1),finalBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α2),iterations:iterations}}};class Point{constructor(x,y){Array.isArray(x)?[this.x,this.y,this.r]=[x[y].longitude,x[y].latitude,y]:[this.x,this.y]=[x,y]}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Point",coordinates:[this.x,this.y]}}}toString(){return JSON.stringify(this.geojson())}intersects(other){if(other instanceof Point)return this.x==other.x&&this.y==other.y;if(other instanceof Box)return other.intersects(this);throw"other must be either Point or Box"}distanceEarth(p){return this.distanceEarthFCC(p)}distanceEarthFCC(p){const df=p.y-this.y,dg=p.x-this.x,fm=util.radians((this.y+p.y)/2),k1=111.13209-.566605*Math.cos(2*fm)+.0012*Math.cos(4*fm),k2=111.41513*Math.cos(fm)-.09455*Math.cos(3*fm)+12e-5*Math.cos(5*fm);return Math.sqrt(k1*df*(k1*df)+k2*dg*(k2*dg))}distanceEarthRev(dx,dy){const lon=this.x+util.degrees(dx/util.REarth/Math.cos(util.radians(this.y))),lat=this.y+util.degrees(dy/util.REarth);return new Point(lon,lat)}distanceEarthVincentys(p){return vincentys.inverse(this,p).distance}}class Range{constructor(a,b){[this.a,this.b]=[a,b]}count(){return Math.abs(this.a-this.b)+1}center(){return Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2)}left(){return new Range(Math.min(this.a,this.b),Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2))}right(){return new Range(Math.min(this.a,this.b)+Math.ceil(Math.abs(this.a-this.b)/2),Math.max(this.a,this.b))}contains(p){return this.a<=p&&p<=this.b}toString(){return`${this.a}:${this.b}`}}class Box{constructor(a,b,c,d){if(a instanceof Range){[this.x1,this.y1,this.x2,this.y2]=[1/0,1/0,-1/0,-1/0];for(let i=a.a;i<=a.b;i++)this.x1=Math.min(b.flightPoints[i].x,this.x1),this.y1=Math.min(b.flightPoints[i].y,this.y1),this.x2=Math.max(b.flightPoints[i].x,this.x2),this.y2=Math.max(b.flightPoints[i].y,this.y2)}else[this.x1,this.y1,this.x2,this.y2]=[a,b,c,d]}vertices(){return[new Point(this.x1,this.y1),new Point(this.x2,this.y1),new Point(this.x2,this.y2),new Point(this.x1,this.y2)]}intersects(other){return other instanceof Point?this.x1<=other.x&&this.y1<=other.y&&this.x2>=other.x&&this.y2>=other.y:!(this.x1>other.x2||this.x2<other.x1||this.y1>other.y2||this.y2<other.y1)}area(){return Math.abs(this.x2-this.x1)*Math.abs(this.y2-this.y1)}distance(other){if(this.intersects(other))return 0;let x1,y1,x2,y2;return this.x1>other.x2&&(x1=this.x1),x2=other.x2,this.x2<other.x1&&(x1=this.x2),x2=other.x1,this.y1<other.y2&&(y1=this.y1),y2=other.y2,this.y2>other.y1&&(y1=this.y2),y2=other.y1,void 0===x1&&(x1=this.x1,x2=this.x1),void 0===y1&&(y1=this.y1,y2=this.y1),new Point(x1,y1).distanceEarth(new Point(x2,y2))}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Polygon",coordinates:[[[this.x1,this.y1],[this.x1,this.y2],[this.x2,this.y2],[this.x2,this.y1],[this.x1,this.y1]]]}}}geojson_collection(boxes){let features=[];for(let b in boxes)features.push(boxes[b].geojson(b,{id:b}));return{type:"FeatureCollection",features:features}}toString(){return JSON.stringify(this.geojson())}}var foundation={Point:Point,Range:Range,Box:Box};let id=0;const{Box:Box$1,Point:Point$1,Range:Range$1}=foundation;class Solution{constructor(ranges,opt,parent){ranges.length>opt.scoring.cardinality?this.ranges=ranges.slice(0,opt.scoring.cardinality):this.ranges=ranges,this.opt=opt;for(let _r in this.ranges){const r=parseInt(_r);if(r>0&&this.ranges[r-1].a>this.ranges[r].a&&(this.ranges[r]=new Range$1(Math.max(this.ranges[r-1].a,this.ranges[r].a),this.ranges[r].b)),r<this.ranges.length-1&&this.ranges[r].b>this.ranges[r+1].b&&(this.ranges[r]=new Range$1(this.ranges[r].a,Math.min(this.ranges[r+1].b,this.ranges[r].b))),this.ranges[r].a>this.ranges[r].b)throw console.log(this.ranges,parent.ranges),"error"}this.boxes=[];for(let r in this.ranges)this.boxes[r]=new Box$1(this.ranges[r],opt.flight);this.score=void 0,this.bound=void 0,this.id=id++,this.opt.config&&this.opt.config.debug&&(this.parent=parent,this.trace())}do_branch(){let div=0;for(let r in this.ranges)this.ranges[r].count()>this.ranges[div].count()&&(div=parseInt(r));for(let r in this.ranges)this.ranges[r].count()>1&&this.boxes[r].area()>8*this.boxes[div].area()&&(div=parseInt(r));if(1==this.ranges[div].count())return[];let subsolutions=[];for(let i of[this.ranges[div].left(),this.ranges[div].right()]){let subranges=[];for(let r in this.ranges)subranges[r]=r!=div?this.ranges[r]:i;subsolutions.push(new Solution(subranges,this.opt,this))}return subsolutions}do_bound(){this.bound=this.opt.scoring.bound(this.ranges,this.boxes,this.opt),this.trace()}do_score(){for(let r in this.ranges)if(r<this.ranges.length-1&&this.ranges[r].center()>=this.ranges[parseInt(r)+1].center())return void(this.score=0);let tp=[];for(let r in this.ranges)tp[r]=new Point$1(this.opt.flight.filtered,this.ranges[r].center());this.scoreInfo=this.opt.scoring.score(tp,this.opt),this.score=this.scoreInfo.score,this.trace()}contentEquals(self,other){return self.id===other.id}contentCompare(self,other){return self.bound<other.bound?-1:self.bound>other.bound?1:self.id<other.id?-1:self.id>other.id?1:0}geojson(){let features=[];if(this.opt.config&&this.opt.config.debug)for(let r in this.ranges)features.push(new Box$1(this.ranges[r],this.opt.flight).geojson("box"+r,{id:"box"+r,area:new Box$1(this.ranges[r],this.opt.flight).area(),a:this.ranges[r].a,b:this.ranges[r].b}));try{const tp=this.scoreInfo.tp;for(let r of[0,1,2])features.push(tp[r].geojson("tp"+r,{id:"tp"+r,r:tp[r].r,timestamp:this.opt.flight.filtered[tp[r].r].timestamp})),(r<2||this.scoreInfo.cp)&&features.push({type:"Feature",id:"seg"+r,properties:{id:"seg"+r,stroke:"yellow","stroke-width":4,d:tp[r].distanceEarth(tp[(r+1)%3])},geometry:{type:"LineString",coordinates:[[tp[r].x,tp[r].y],[tp[(r+1)%3].x,tp[(r+1)%3].y]],style:{stroke:"yellow","stroke-width":4}}})}catch(e){}try{if(void 0!==this.scoreInfo.ep||void 0!==this.scoreInfo.cp){const cp=this.scoreInfo.cp,tp=this.scoreInfo.tp,ep=this.scoreInfo.ep;if(cp&&cp.in&&cp.out){for(let r of["in","out"])features.push(cp[r].geojson("cp_"+r,{id:"cp_"+r,r:cp[r].r,timestamp:this.opt.flight.filtered[cp[r].r].timestamp}));features.push({type:"Feature",id:"closing",properties:{id:"closing",stroke:"green","stroke-width":3,d:cp.in.distanceEarth(cp.out)},geometry:{type:"LineString",coordinates:[[cp.in.x,cp.in.y],[cp.out.x,cp.out.y]],style:{stroke:"green","stroke-width":3}}})}if(ep&&ep.start&&ep.finish){for(let r of["start","finish"])features.push(ep[r].geojson("ep_"+r,{id:"ep_"+r,r:ep[r].r,timestamp:this.opt.flight.filtered[ep[r].r].timestamp}));features.push({type:"Feature",id:"seg_in",properties:{id:"seg_in",stroke:"gold","stroke-width":3,d:ep.start.distanceEarth(tp[0])},geometry:{type:"LineString",coordinates:[[ep.start.x,ep.start.y],[tp[0].x,tp[0].y]],style:{stroke:"green","stroke-width":3}}}),features.push({type:"Feature",id:"seg_out",properties:{id:"seg_out",stroke:"gold","stroke-width":3,d:ep.finish.distanceEarth(tp[2])},geometry:{type:"LineString",coordinates:[[tp[2].x,tp[2].y],[ep.finish.x,ep.finish.y]],style:{stroke:"green","stroke-width":3}}})}}}catch(e){}for(let li in this.opt.flight.ll){const l=this.opt.flight.ll[li];features.push(this.opt.flight.flightPoints[l.launch].geojson("launch"+li,{id:"launch"+li,r:l.launch,timestamp:this.opt.flight.filtered[l.launch].timestamp})),features.push(this.opt.flight.flightPoints[l.landing].geojson("land"+li,{id:"land"+li,r:l.landing,timestamp:this.opt.flight.filtered[l.landing].timestamp}))}if(!this.opt.config||!this.opt.config.noflight){let flightData=[];for(let r of this.opt.flight.filtered)flightData.push([r.longitude,r.latitude]);features.push({type:"Feature",id:"flight",properties:{id:"flight"},geometry:{type:"LineString",coordinates:flightData}})}return{type:"FeatureCollection",properties:{name:"EPSG:3857",id:this.id,score:void 0!==this.score?this.score:void 0,bound:void 0!==this.currentUpperBound?this.currentUpperBound:this.bound,optimal:this.optimal,processedTime:this.time/1e3,processedSolutions:this.processed,type:this.opt.scoring.name,code:this.opt.scoring.code},features:features}}toString(){let s=""+this.opt.scoring.name;if(this.score&&(s+=` ${this.opt.scoring.rounding(this.score)} points`),this.scoreInfo&&(s+=` ${this.opt.scoring.rounding(this.scoreInfo.distance)}km`),s+=` ( <${this.bound.toFixed(4)} )`,this.opt.config&&this.opt.config.debug){s+=` { id: ${this.id} `;for(let r of this.ranges)s+=" "+r.toString();s+=" } "}return s}trace(msg){if(!this.opt.config.trace||!process.stdout)return;const trace=this.opt.config.trace.split(",");if(trace[0]<0){if(this.id%parseInt(trace[1])!=0)return}else for(let i in this.ranges)if(!this.ranges[i].contains(trace[i]))return;let r=`${msg||""} solution tracing: ${this.id} ${this.opt.scoring.name} `;for(let i in this.ranges)r+=this.ranges[i]+" ";this.bound&&(r+=`bound: ${this.bound} `),this.score&&(r+=`score: ${this.score} `),process.stdout.write("\n"+r+"\n"),this.opt.config.env.fs.writeFileSync(`debug-${this.id}.json`,JSON.stringify(this.geojson({debug:!0})))}}var solution_Solution=Solution;class FlatQueue{constructor(){this.ids=[],this.values=[],this.length=0}clear(){this.length=0}push(id,value){let pos=this.length++;for(this.ids[pos]=id,this.values[pos]=value;pos>0;){const parent=pos-1>>1,parentValue=this.values[parent];if(value>=parentValue)break;this.ids[pos]=this.ids[parent],this.values[pos]=parentValue,pos=parent}this.ids[pos]=id,this.values[pos]=value}pop(){if(0===this.length)return;const top=this.ids[0];if(this.length--,this.length>0){const id=this.ids[0]=this.ids[this.length],value=this.values[0]=this.values[this.length],halfLength=this.length>>1;let pos=0;for(;pos<halfLength;){let left=1+(pos<<1);const right=left+1;let bestIndex=this.ids[left],bestValue=this.values[left];const rightValue=this.values[right];if(right<this.length&&rightValue<bestValue&&(left=right,bestIndex=this.ids[right],bestValue=rightValue),bestValue>=value)break;this.ids[pos]=bestIndex,this.values[pos]=bestValue,pos=left}this.ids[pos]=id,this.values[pos]=value}return top}peek(){return this.ids[0]}peekValue(){return this.values[0]}}const ARRAY_TYPES=[Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array];class Flatbush{static from(data){if(!(data instanceof ArrayBuffer))throw new Error("Data must be an instance of ArrayBuffer.");const[magic,versionAndType]=new Uint8Array(data,0,2);if(251!==magic)throw new Error("Data does not appear to be in a Flatbush format.");if(versionAndType>>4!=3)throw new Error(`Got v${versionAndType>>4} data when expected v3.`);const[nodeSize]=new Uint16Array(data,2,1),[numItems]=new Uint32Array(data,4,1);return new Flatbush(numItems,nodeSize,ARRAY_TYPES[15&versionAndType],data)}constructor(numItems,nodeSize=16,ArrayType=Float64Array,data){if(void 0===numItems)throw new Error("Missing required argument: numItems.");if(isNaN(numItems)||numItems<=0)throw new Error(`Unpexpected numItems value: ${numItems}.`);this.numItems=+numItems,this.nodeSize=Math.min(Math.max(+nodeSize,2),65535);let n=numItems,numNodes=n;this._levelBounds=[4*n];do{n=Math.ceil(n/this.nodeSize),numNodes+=n,this._levelBounds.push(4*numNodes)}while(1!==n);this.ArrayType=ArrayType||Float64Array,this.IndexArrayType=numNodes<16384?Uint16Array:Uint32Array;const arrayTypeIndex=ARRAY_TYPES.indexOf(this.ArrayType),nodesByteSize=4*numNodes*this.ArrayType.BYTES_PER_ELEMENT;if(arrayTypeIndex<0)throw new Error(`Unexpected typed array class: ${ArrayType}.`);data&&data instanceof ArrayBuffer?(this.data=data,this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=4*numNodes,this.minX=this._boxes[this._pos-4],this.minY=this._boxes[this._pos-3],this.maxX=this._boxes[this._pos-2],this.maxY=this._boxes[this._pos-1]):(this.data=new ArrayBuffer(8+nodesByteSize+numNodes*this.IndexArrayType.BYTES_PER_ELEMENT),this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=0,this.minX=1/0,this.minY=1/0,this.maxX=-1/0,this.maxY=-1/0,new Uint8Array(this.data,0,2).set([251,48+arrayTypeIndex]),new Uint16Array(this.data,2,1)[0]=nodeSize,new Uint32Array(this.data,4,1)[0]=numItems),this._queue=new FlatQueue}add(minX,minY,maxX,maxY){const index=this._pos>>2;return this._indices[index]=index,this._boxes[this._pos++]=minX,this._boxes[this._pos++]=minY,this._boxes[this._pos++]=maxX,this._boxes[this._pos++]=maxY,minX<this.minX&&(this.minX=minX),minY<this.minY&&(this.minY=minY),maxX>this.maxX&&(this.maxX=maxX),maxY>this.maxY&&(this.maxY=maxY),index}finish(){if(this._pos>>2!==this.numItems)throw new Error(`Added ${this._pos>>2} items when expected ${this.numItems}.`);if(this.numItems<=this.nodeSize)return this._boxes[this._pos++]=this.minX,this._boxes[this._pos++]=this.minY,this._boxes[this._pos++]=this.maxX,void(this._boxes[this._pos++]=this.maxY);const width=this.maxX-this.minX,height=this.maxY-this.minY,hilbertValues=new Uint32Array(this.numItems);for(let i=0;i<this.numItems;i++){let pos=4*i;const minX=this._boxes[pos++],minY=this._boxes[pos++],maxX=this._boxes[pos++],maxY=this._boxes[pos++],x=Math.floor(65535*((minX+maxX)/2-this.minX)/width),y=Math.floor(65535*((minY+maxY)/2-this.minY)/height);hilbertValues[i]=hilbert(x,y)}!function sort(values,boxes,indices,left,right,nodeSize){if(Math.floor(left/nodeSize)>=Math.floor(right/nodeSize))return;const pivot=values[left+right>>1];let i=left-1,j=right+1;for(;;){do{i++}while(values[i]<pivot);do{j--}while(values[j]>pivot);if(i>=j)break;swap(values,boxes,indices,i,j)}sort(values,boxes,indices,left,j,nodeSize),sort(values,boxes,indices,j+1,right,nodeSize)}(hilbertValues,this._boxes,this._indices,0,this.numItems-1,this.nodeSize);for(let i=0,pos=0;i<this._levelBounds.length-1;i++){const end=this._levelBounds[i];for(;pos<end;){const nodeIndex=pos;let nodeMinX=1/0,nodeMinY=1/0,nodeMaxX=-1/0,nodeMaxY=-1/0;for(let i=0;i<this.nodeSize&&pos<end;i++)nodeMinX=Math.min(nodeMinX,this._boxes[pos++]),nodeMinY=Math.min(nodeMinY,this._boxes[pos++]),nodeMaxX=Math.max(nodeMaxX,this._boxes[pos++]),nodeMaxY=Math.max(nodeMaxY,this._boxes[pos++]);this._indices[this._pos>>2]=nodeIndex,this._boxes[this._pos++]=nodeMinX,this._boxes[this._pos++]=nodeMinY,this._boxes[this._pos++]=nodeMaxX,this._boxes[this._pos++]=nodeMaxY}}}search(minX,minY,maxX,maxY,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const queue=[],results=[];for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2];maxX<this._boxes[pos]||(maxY<this._boxes[pos+1]||minX>this._boxes[pos+2]||minY>this._boxes[pos+3]||(nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&results.push(index):queue.push(index)))}nodeIndex=queue.pop()}return results}neighbors(x,y,maxResults=1/0,maxDistance=1/0,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const q=this._queue,results=[],maxDistSquared=maxDistance*maxDistance;for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2],dx=axisDist(x,this._boxes[pos],this._boxes[pos+2]),dy=axisDist(y,this._boxes[pos+1],this._boxes[pos+3]),dist=dx*dx+dy*dy;nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&q.push(-index-1,dist):q.push(index,dist)}for(;q.length&&q.peek()<0;){if(q.peekValue()>maxDistSquared)return q.clear(),results;if(results.push(-q.pop()-1),results.length===maxResults)return q.clear(),results}nodeIndex=q.pop()}return q.clear(),results}}function axisDist(k,min,max){return k<min?min-k:k<=max?0:k-max}function upperBound(value,arr){let i=0,j=arr.length-1;for(;i<j;){const m=i+j>>1;arr[m]>value?j=m:i=m+1}return arr[i]}function swap(values,boxes,indices,i,j){const temp=values[i];values[i]=values[j],values[j]=temp;const k=4*i,m=4*j,a=boxes[k],b=boxes[k+1],c=boxes[k+2],d=boxes[k+3];boxes[k]=boxes[m],boxes[k+1]=boxes[m+1],boxes[k+2]=boxes[m+2],boxes[k+3]=boxes[m+3],boxes[m]=a,boxes[m+1]=b,boxes[m+2]=c,boxes[m+3]=d;const e=indices[i];indices[i]=indices[j],indices[j]=e}function hilbert(x,y){let a=x^y,b=65535^a,c=65535^(x|y),d=x&(65535^y),A=a|b>>1,B=a>>1^a,C=c>>1^b&d>>1^c,D=a&c>>1^d>>1^d;a=A,b=B,c=C,d=D,A=a&a>>2^b&b>>2,B=a&b>>2^b&(a^b)>>2,C^=a&c>>2^b&d>>2,D^=b&c>>2^(a^b)&d>>2,a=A,b=B,c=C,d=D,A=a&a>>4^b&b>>4,B=a&b>>4^b&(a^b)>>4,C^=a&c>>4^b&d>>4,D^=b&c>>4^(a^b)&d>>4,a=A,b=B,c=C,d=D,C^=a&c>>8^b&d>>8,D^=b&c>>8^(a^b)&d>>8,a=C^C>>1,b=D^D>>1;let i0=x^y,i1=b|65535^(i0|a);return i0=16711935&(i0|i0<<8),i0=252645135&(i0|i0<<4),i0=858993459&(i0|i0<<2),i0=1431655765&(i0|i0<<1),i1=16711935&(i1|i1<<8),i1=252645135&(i1|i1<<4),i1=858993459&(i1|i1<<2),i1=1431655765&(i1|i1<<1),(i1<<1|i0)>>>0}var flatbush=Object.freeze({__proto__:null,default:Flatbush});function quickselect(arr,k,left,right,compare){!function quickselectStep(arr,k,left,right,compare){for(;right>left;){if(right-left>600){var n=right-left+1,m=k-left+1,z=Math.log(n),s=.5*Math.exp(2*z/3),sd=.5*Math.sqrt(z*s*(n-s)/n)*(m-n/2<0?-1:1);quickselectStep(arr,k,Math.max(left,Math.floor(k-m*s/n+sd)),Math.min(right,Math.floor(k+(n-m)*s/n+sd)),compare)}var t=arr[k],i=left,j=right;for(swap$1(arr,left,k),compare(arr[right],t)>0&&swap$1(arr,left,right);i<j;){for(swap$1(arr,i,j),i++,j--;compare(arr[i],t)<0;)i++;for(;compare(arr[j],t)>0;)j--}0===compare(arr[left],t)?swap$1(arr,left,j):swap$1(arr,++j,right),j<=k&&(left=j+1),k<=j&&(right=j-1)}}(arr,k,left||0,right||arr.length-1,compare||defaultCompare)}function swap$1(arr,i,j){var tmp=arr[i];arr[i]=arr[j],arr[j]=tmp}function defaultCompare(a,b){return a<b?-1:a>b?1:0}function findItem(item,items,equalsFn){if(!equalsFn)return items.indexOf(item);for(let i=0;i<items.length;i++)if(equalsFn(item,items[i]))return i;return-1}function calcBBox(node,toBBox){distBBox(node,0,node.children.length,toBBox,node)}function distBBox(node,k,p,toBBox,destNode){destNode||(destNode=createNode(null)),destNode.minX=1/0,destNode.minY=1/0,destNode.maxX=-1/0,destNode.maxY=-1/0;for(let i=k;i<p;i++){const child=node.children[i];extend(destNode,node.leaf?toBBox(child):child)}return destNode}function extend(a,b){return a.minX=Math.min(a.minX,b.minX),a.minY=Math.min(a.minY,b.minY),a.maxX=Math.max(a.maxX,b.maxX),a.maxY=Math.max(a.maxY,b.maxY),a}function compareNodeMinX(a,b){return a.minX-b.minX}function compareNodeMinY(a,b){return a.minY-b.minY}function bboxArea(a){return(a.maxX-a.minX)*(a.maxY-a.minY)}function bboxMargin(a){return a.maxX-a.minX+(a.maxY-a.minY)}function intersectionArea(a,b){const minX=Math.max(a.minX,b.minX),minY=Math.max(a.minY,b.minY),maxX=Math.min(a.maxX,b.maxX),maxY=Math.min(a.maxY,b.maxY);return Math.max(0,maxX-minX)*Math.max(0,maxY-minY)}function contains(a,b){return a.minX<=b.minX&&a.minY<=b.minY&&b.maxX<=a.maxX&&b.maxY<=a.maxY}function intersects(a,b){return b.minX<=a.maxX&&b.minY<=a.maxY&&b.maxX>=a.minX&&b.maxY>=a.minY}function createNode(children){return{children:children,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function multiSelect(arr,left,right,n,compare){const stack=[left,right];for(;stack.length;){if((right=stack.pop())-(left=stack.pop())<=n)continue;const mid=left+Math.ceil((right-left)/n/2)*n;quickselect(arr,mid,left,right,compare),stack.push(left,mid,mid,right)}}var x,rbush=Object.freeze({__proto__:null,default:class{constructor(maxEntries=9){this._maxEntries=Math.max(4,maxEntries),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()}all(){return this._all(this.data,[])}search(bbox){let node=this.data;const result=[];if(!intersects(bbox,node))return result;const toBBox=this.toBBox,nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?toBBox(child):child;intersects(bbox,childBBox)&&(node.leaf?result.push(child):contains(bbox,childBBox)?this._all(child,result):nodesToSearch.push(child))}node=nodesToSearch.pop()}return result}collides(bbox){let node=this.data;if(!intersects(bbox,node))return!1;const nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?this.toBBox(child):child;if(intersects(bbox,childBBox)){if(node.leaf||contains(bbox,childBBox))return!0;nodesToSearch.push(child)}}node=nodesToSearch.pop()}return!1}load(data){if(!data||!data.length)return this;if(data.length<this._minEntries){for(let i=0;i<data.length;i++)this.insert(data[i]);return this}let node=this._build(data.slice(),0,data.length-1,0);if(this.data.children.length)if(this.data.height===node.height)this._splitRoot(this.data,node);else{if(this.data.height<node.height){const tmpNode=this.data;this.data=node,node=tmpNode}this._insert(node,this.data.height-node.height-1,!0)}else this.data=node;return this}insert(item){return item&&this._insert(item,this.data.height-1),this}clear(){return this.data=createNode([]),this}remove(item,equalsFn){if(!item)return this;let node=this.data;const bbox=this.toBBox(item),path=[],indexes=[];let i,parent,goingUp;for(;node||path.length;){if(node||(node=path.pop(),parent=path[path.length-1],i=indexes.pop(),goingUp=!0),node.leaf){const index=findItem(item,node.children,equalsFn);if(-1!==index)return node.children.splice(index,1),path.push(node),this._condense(path),this}goingUp||node.leaf||!contains(node,bbox)?parent?(i++,node=parent.children[i],goingUp=!1):node=null:(path.push(node),indexes.push(i),i=0,parent=node,node=node.children[0])}return this}toBBox(item){return item}compareMinX(a,b){return a.minX-b.minX}compareMinY(a,b){return a.minY-b.minY}toJSON(){return this.data}fromJSON(data){return this.data=data,this}_all(node,result){const nodesToSearch=[];for(;node;)node.leaf?result.push(...node.children):nodesToSearch.push(...node.children),node=nodesToSearch.pop();return result}_build(items,left,right,height){const N=right-left+1;let node,M=this._maxEntries;if(N<=M)return node=createNode(items.slice(left,right+1)),calcBBox(node,this.toBBox),node;height||(height=Math.ceil(Math.log(N)/Math.log(M)),M=Math.ceil(N/Math.pow(M,height-1))),node=createNode([]),node.leaf=!1,node.height=height;const N2=Math.ceil(N/M),N1=N2*Math.ceil(Math.sqrt(M));multiSelect(items,left,right,N1,this.compareMinX);for(let i=left;i<=right;i+=N1){const right2=Math.min(i+N1-1,right);multiSelect(items,i,right2,N2,this.compareMinY);for(let j=i;j<=right2;j+=N2){const right3=Math.min(j+N2-1,right2);node.children.push(this._build(items,j,right3,height-1))}}return calcBBox(node,this.toBBox),node}_chooseSubtree(bbox,node,level,path){for(;path.push(node),!node.leaf&&path.length-1!==level;){let targetNode,minArea=1/0,minEnlargement=1/0;for(let i=0;i<node.children.length;i++){const child=node.children[i],area=bboxArea(child),enlargement=(a=bbox,b=child,(Math.max(b.maxX,a.maxX)-Math.min(b.minX,a.minX))*(Math.max(b.maxY,a.maxY)-Math.min(b.minY,a.minY))-area);enlargement<minEnlargement?(minEnlargement=enlargement,minArea=area<minArea?area:minArea,targetNode=child):enlargement===minEnlargement&&area<minArea&&(minArea=area,targetNode=child)}node=targetNode||node.children[0]}var a,b;return node}_insert(item,level,isNode){const bbox=isNode?item:this.toBBox(item),insertPath=[],node=this._chooseSubtree(bbox,this.data,level,insertPath);for(node.children.push(item),extend(node,bbox);level>=0&&insertPath[level].children.length>this._maxEntries;)this._split(insertPath,level),level--;this._adjustParentBBoxes(bbox,insertPath,level)}_split(insertPath,level){const node=insertPath[level],M=node.children.length,m=this._minEntries;this._chooseSplitAxis(node,m,M);const splitIndex=this._chooseSplitIndex(node,m,M),newNode=createNode(node.children.splice(splitIndex,node.children.length-splitIndex));newNode.height=node.height,newNode.leaf=node.leaf,calcBBox(node,this.toBBox),calcBBox(newNode,this.toBBox),level?insertPath[level-1].children.push(newNode):this._splitRoot(node,newNode)}_splitRoot(node,newNode){this.data=createNode([node,newNode]),this.data.height=node.height+1,this.data.leaf=!1,calcBBox(this.data,this.toBBox)}_chooseSplitIndex(node,m,M){let index,minOverlap=1/0,minArea=1/0;for(let i=m;i<=M-m;i++){const bbox1=distBBox(node,0,i,this.toBBox),bbox2=distBBox(node,i,M,this.toBBox),overlap=intersectionArea(bbox1,bbox2),area=bboxArea(bbox1)+bboxArea(bbox2);overlap<minOverlap?(minOverlap=overlap,index=i,minArea=area<minArea?area:minArea):overlap===minOverlap&&area<minArea&&(minArea=area,index=i)}return index||M-m}_chooseSplitAxis(node,m,M){const compareMinX=node.leaf?this.compareMinX:compareNodeMinX,compareMinY=node.leaf?this.compareMinY:compareNodeMinY;this._allDistMargin(node,m,M,compareMinX)<this._allDistMargin(node,m,M,compareMinY)&&node.children.sort(compareMinX)}_allDistMargin(node,m,M,compare){node.children.sort(compare);const toBBox=this.toBBox,leftBBox=distBBox(node,0,m,toBBox),rightBBox=distBBox(node,M-m,M,toBBox);let margin=bboxMargin(leftBBox)+bboxMargin(rightBBox);for(let i=m;i<M-m;i++){const child=node.children[i];extend(leftBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(leftBBox)}for(let i=M-m-1;i>=m;i--){const child=node.children[i];extend(rightBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(rightBBox)}return margin}_adjustParentBBoxes(bbox,path,level){for(let i=level;i>=0;i--)extend(path[i],bbox)}_condense(path){for(let siblings,i=path.length-1;i>=0;i--)0===path[i].children.length?i>0?(siblings=path[i-1].children,siblings.splice(siblings.indexOf(path[i]),1)):this.clear():calcBBox(path[i],this.toBBox)}}}),quickselect$1=createCommonjsModule((function(module,exports){module.exports=function(){function quickselect(arr,k,left,right,compare){quickselectStep(arr,k,left||0,right||arr.length-1,compare||defaultCompare)}function quickselectStep(arr,k,left,right,compare){for(;right>left;){if(right-left>600){var n=right-left+1,m=k-left+1,z=Math.log(n),s=.5*Math.exp(2*z/3),sd=.5*Math.sqrt(z*s*(n-s)/n)*(m-n/2<0?-1:1);quickselectStep(arr,k,Math.max(left,Math.floor(k-m*s/n+sd)),Math.min(right,Math.floor(k+(n-m)*s/n+sd)),compare)}var t=arr[k],i=left,j=right;for(swap(arr,left,k),compare(arr[right],t)>0&&swap(arr,left,right);i<j;){for(swap(arr,i,j),i++,j--;compare(arr[i],t)<0;)i++;for(;compare(arr[j],t)>0;)j--}0===compare(arr[left],t)?swap(arr,left,j):swap(arr,++j,right),j<=k&&(left=j+1),k<=j&&(right=j-1)}}function swap(arr,i,j){var tmp=arr[i];arr[i]=arr[j],arr[j]=tmp}function defaultCompare(a,b){return a<b?-1:a>b?1:0}return quickselect}()})),dist=createCommonjsModule((function(module,exports){Object.defineProperty(exports,"__esModule",{value:!0});var nodePool=[],freeNode=function(node){return nodePool.push(node)},freeAllNode=function(node){node&&(freeNode(node),isLeaf(node)||node.children.forEach(freeAllNode))},allowNode=function(children){var node=nodePool.pop();return node?(node.children=children,node.height=1,node.leaf=!0,node.minX=1/0,node.minY=1/0,node.minZ=1/0,node.maxX=-1/0,node.maxY=-1/0,node.maxZ=-1/0):node={children:children,height:1,leaf:!0,minX:1/0,minY:1/0,minZ:1/0,maxX:-1/0,maxY:-1/0,maxZ:-1/0},node},distNodePool=[],allowDistNode=function(dist,node){var heapNode=distNodePool.pop();return heapNode?(heapNode.dist=dist,heapNode.node=node):heapNode={dist:dist,node:node},heapNode},isLeaf=function(node){return node.leaf},isLeafChild=function(node,child){return node.leaf},findItem=function(item,items,equalsFn){if(!equalsFn)return items.indexOf(item);for(var i=0;i<items.length;i++)if(equalsFn(item,items[i]))return i;return-1},calcBBox=function(node){distBBox(node,0,node.children.length,node)},distBBox=function(node,k,p,destNode){var dNode=destNode;dNode?(dNode.minX=1/0,dNode.minY=1/0,dNode.minZ=1/0,dNode.maxX=-1/0,dNode.maxY=-1/0,dNode.maxZ=-1/0):dNode=allowNode([]);for(var i=k,child=void 0;i<p;i++)child=node.children[i],extend(dNode,child);return dNode},extend=function(a,b){return a.minX=Math.min(a.minX,b.minX),a.minY=Math.min(a.minY,b.minY),a.minZ=Math.min(a.minZ,b.minZ),a.maxX=Math.max(a.maxX,b.maxX),a.maxY=Math.max(a.maxY,b.maxY),a.maxZ=Math.max(a.maxZ,b.maxZ),a},bboxVolume=function(a){return(a.maxX-a.minX)*(a.maxY-a.minY)*(a.maxZ-a.minZ)},bboxMargin=function(a){return a.maxX-a.minX+(a.maxY-a.minY)+(a.maxZ-a.minZ)},contains=function(a,b){return a.minX<=b.minX&&a.minY<=b.minY&&a.minZ<=b.minZ&&b.maxX<=a.maxX&&b.maxY<=a.maxY&&b.maxZ<=a.maxZ};exports.intersects=function(a,b){return b.minX<=a.maxX&&b.minY<=a.maxY&&b.minZ<=a.maxZ&&b.maxX>=a.minX&&b.maxY>=a.minY&&b.maxZ>=a.minZ},exports.boxRayIntersects=function(box,ox,oy,oz,idx,idy,idz){var tx0=(box.minX-ox)*idx,tx1=(box.maxX-ox)*idx,ty0=(box.minY-oy)*idy,ty1=(box.maxY-oy)*idy,tz0=(box.minZ-oz)*idz,tz1=(box.maxZ-oz)*idz,z0=Math.min(tz0,tz1),z1=Math.max(tz0,tz1),y0=Math.min(ty0,ty1),y1=Math.max(ty0,ty1),x0=Math.min(tx0,tx1),x1=Math.max(tx0,tx1),tmin=Math.max(0,x0,y0,z0);return Math.min(x1,y1,z1)>=tmin?tmin:1/0};var multiSelect=function(arr,left,right,n,compare){for(var mid,stack=[left,right];stack.length;)(right=stack.pop())-(left=stack.pop())<=n||(mid=left+Math.ceil((right-left)/n/2)*n,quickselect$1(arr,mid,left,right,compare),stack.push(left,mid,mid,right))},compareMinX=function(a,b){return a.minX-b.minX},compareMinY=function(a,b){return a.minY-b.minY},compareMinZ=function(a,b){return a.minZ-b.minZ},RBush3D=function(){function RBush3D(maxEntries){void 0===maxEntries&&(maxEntries=16),this.maxEntries=Math.max(maxEntries,8),this.minEntries=Math.max(4,Math.ceil(.4*this.maxEntries)),this.clear()}return RBush3D.alloc=function(){return this.pool.pop()||new this},RBush3D.free=function(rbush){rbush.clear(),this.pool.push(rbush)},RBush3D.prototype.search=function(bbox){var node=this.data,result=[];if(!exports.intersects(bbox,node))return result;for(var nodesToSearch=[];node;){for(var i=0,len=node.children.length;i<len;i++){var child=node.children[i];exports.intersects(bbox,child)&&(isLeafChild(node)?result.push(child):contains(bbox,child)?this._all(child,result):nodesToSearch.push(child))}node=nodesToSearch.pop()}return result},RBush3D.prototype.collides=function(bbox){var node=this.data;if(!exports.intersects(bbox,node))return!1;for(var nodesToSearch=[];node;){for(var i=0,len=node.children.length;i<len;i++){var child=node.children[i];if(exports.intersects(bbox,child)){if(isLeafChild(node)||contains(bbox,child))return!0;nodesToSearch.push(child)}}node=nodesToSearch.pop()}return!1},RBush3D.prototype.raycastInv=function(ox,oy,oz,idx,idy,idz,maxLen){void 0===maxLen&&(maxLen=1/0);var node=this.data;if(idx===1/0&&idy===1/0&&idz===1/0)return allowDistNode(1/0,void 0);if(exports.boxRayIntersects(node,ox,oy,oz,idx,idy,idz)===1/0)return allowDistNode(1/0,void 0);for(var result,heap=[allowDistNode(0,node)],swap=function(a,b){var t=heap[a];heap[a]=heap[b],heap[b]=t},pop=function(){var top=heap[0],newLen=heap.length-1;heap[0]=heap[newLen],heap.length=newLen;for(var idx=0;;){var left=idx<<1|1;if(left>=newLen)break;var right=left+1;if(right<newLen&&heap[right].dist<heap[left].dist&&(left=right),heap[idx].dist<heap[left].dist)break;swap(idx,left),idx=left}return function(node){distNodePool.push(node)}(top),top.node},push=function(dist,node){var idx=heap.length;for(heap.push(allowDistNode(dist,node));idx>0;){var p=idx-1>>1;if(heap[p].dist<=heap[idx].dist)break;swap(idx,p),idx=p}},dist=maxLen;heap.length&&heap[0].dist<dist;)for(var i=0,len=(node=pop()).children.length;i<len;i++){var child=node.children[i],d=exports.boxRayIntersects(child,ox,oy,oz,idx,idy,idz);if(isLeafChild(node)){if(d<dist){if(0===d)return allowDistNode(d,child);dist=d,result=child}}else push(d,child)}return allowDistNode(dist<maxLen?dist:1/0,result)},RBush3D.prototype.raycast=function(ox,oy,oz,dx,dy,dz,maxLen){return void 0===maxLen&&(maxLen=1/0),this.raycastInv(ox,oy,oz,1/dx,1/dy,1/dz,maxLen)},RBush3D.prototype.all=function(){return this._all(this.data,[])},RBush3D.prototype.load=function(data){if(!data||!data.length)return this;if(data.length<this.minEntries){for(var i=0,len=data.length;i<len;i++)this.insert(data[i]);return this}var node=this.build(data.slice(),0,data.length-1,0);if(this.data.children.length)if(this.data.height===node.height)this.splitRoot(this.data,node);else{if(this.data.height<node.height){var tmpNode=this.data;this.data=node,node=tmpNode}this._insert(node,this.data.height-node.height-1,!0)}else this.data=node;return this},RBush3D.prototype.insert=function(item){return item&&this._insert(item,this.data.height-1),this},RBush3D.prototype.clear=function(){return this.data&&freeAllNode(this.data),this.data=allowNode([]),this},RBush3D.prototype.remove=function(item,equalsFn){if(!item)return this;for(var index,parent,node=this.data,i=0,goingUp=!1,path=[],indexes=[];node||path.length;){if(node||(node=path.pop(),i=indexes.pop(),parent=path[path.length-1],goingUp=!0),isLeaf(node)&&-1!==(index=findItem(item,node.children,equalsFn)))return node.children.splice(index,1),path.push(node),this.condense(path),this;goingUp||isLeaf(node)||!contains(node,item)?parent?(i++,node=parent.children[i],goingUp=!1):node=void 0:(path.push(node),indexes.push(i),i=0,parent=node,node=node.children[0])}return this},RBush3D.prototype.toJSON=function(){return this.data},RBush3D.prototype.fromJSON=function(data){return freeAllNode(this.data),this.data=data,this},RBush3D.prototype.build=function(items,left,right,height){var node,N=right-left+1,M=this.maxEntries;if(N<=M)return node=allowNode(items.slice(left,right+1)),calcBBox(node),node;height||(height=Math.ceil(Math.log(N)/Math.log(M)),M=Math.ceil(N/Math.pow(M,height-1))),(node=allowNode([])).leaf=!1,node.height=height;var N3=Math.ceil(N/M),N2=N3*Math.ceil(Math.pow(M,2/3)),N1=N3*Math.ceil(Math.pow(M,1/3));multiSelect(items,left,right,N1,compareMinX);for(var i=left;i<=right;i+=N1){var right2=Math.min(i+N1-1,right);multiSelect(items,i,right2,N2,compareMinY);for(var j=i;j<=right2;j+=N2){var right3=Math.min(j+N2-1,right2);multiSelect(items,j,right3,N3,compareMinZ);for(var k=j;k<=right3;k+=N3){var right4=Math.min(k+N3-1,right3);node.children.push(this.build(items,k,right4,height-1))}}}return calcBBox(node),node},RBush3D.prototype._all=function(node,result){for(var nodesToSearch=[];node;)isLeaf(node)?result.push.apply(result,node.children):nodesToSearch.push.apply(nodesToSearch,node.children),node=nodesToSearch.pop();return result},RBush3D.prototype.chooseSubtree=function(bbox,node,level,path){for(var minVolume,minEnlargement,targetNode,a,b,minX,minY,minZ;path.push(node),!isLeaf(node)&&path.length-1!==level;){minVolume=minEnlargement=1/0;for(var i=0,len=node.children.length;i<len;i++){var child=node.children[i],volume=bboxVolume(child),enlargement=(a=bbox,b=child,minX=void 0,minY=void 0,minZ=void 0,minX=Math.min(a.minX,b.minX),minY=Math.min(a.minY,b.minY),minZ=Math.min(a.minZ,b.minZ),(Math.max(a.maxX,b.maxX)-minX)*(Math.max(a.maxY,b.maxY)-minY)*(Math.max(a.maxZ,b.maxZ)-minZ)-volume);enlargement<minEnlargement?(minEnlargement=enlargement,minVolume=volume<minVolume?volume:minVolume,targetNode=child):enlargement===minEnlargement&&volume<minVolume&&(minVolume=volume,targetNode=child)}node=targetNode||node.children[0]}return node},RBush3D.prototype.split=function(insertPath,level){var node=insertPath[level],M=node.children.length,m=this.minEntries;this.chooseSplitAxis(node,m,M);var splitIndex=this.chooseSplitIndex(node,m,M),newNode=allowNode(node.children.splice(splitIndex,node.children.length-splitIndex));newNode.height=node.height,newNode.leaf=node.leaf,calcBBox(node),calcBBox(newNode),level?insertPath[level-1].children.push(newNode):this.splitRoot(node,newNode)},RBush3D.prototype.splitRoot=function(node,newNode){this.data=allowNode([node,newNode]),this.data.height=node.height+1,this.data.leaf=!1,calcBBox(this.data)},RBush3D.prototype.chooseSplitIndex=function(node,m,M){for(var index,a,b,minX,minY,minZ,maxX,maxY,maxZ,minOverlap=1/0,minVolume=1/0,i=m;i<=M-m;i++){var bbox1=distBBox(node,0,i),bbox2=distBBox(node,i,M),overlap=(a=bbox1,b=bbox2,minX=void 0,minY=void 0,minZ=void 0,maxX=void 0,maxY=void 0,maxZ=void 0,minX=Math.max(a.minX,b.minX),minY=Math.max(a.minY,b.minY),minZ=Math.max(a.minZ,b.minZ),maxX=Math.min(a.maxX,b.maxX),maxY=Math.min(a.maxY,b.maxY),maxZ=Math.min(a.maxZ,b.maxZ),Math.max(0,maxX-minX)*Math.max(0,maxY-minY)*Math.max(0,maxZ-minZ)),volume=bboxVolume(bbox1)+bboxVolume(bbox2);overlap<minOverlap?(minOverlap=overlap,index=i,minVolume=volume<minVolume?volume:minVolume):overlap===minOverlap&&volume<minVolume&&(minVolume=volume,index=i)}return index},RBush3D.prototype.chooseSplitAxis=function(node,m,M){var xMargin=this.allDistMargin(node,m,M,compareMinX),yMargin=this.allDistMargin(node,m,M,compareMinY),zMargin=this.allDistMargin(node,m,M,compareMinZ);xMargin<yMargin&&xMargin<zMargin?node.children.sort(compareMinX):yMargin<xMargin&&yMargin<zMargin&&node.children.sort(compareMinY)},RBush3D.prototype.allDistMargin=function(node,m,M,compare){node.children.sort(compare);for(var leftBBox=distBBox(node,0,m),rightBBox=distBBox(node,M-m,M),margin=bboxMargin(leftBBox)+bboxMargin(rightBBox),i=m;i<M-m;i++){var child=node.children[i];extend(leftBBox,child),margin+=bboxMargin(leftBBox)}for(i=M-m-1;i>=m;i--){child=node.children[i];extend(rightBBox,child),margin+=bboxMargin(rightBBox)}return margin},RBush3D.prototype.adjustParentBBoxes=function(bbox,path,level){for(var i=level;i>=0;i--)extend(path[i],bbox)},RBush3D.prototype.condense=function(path){for(var i=path.length-1,siblings=void 0;i>=0;i--)0===path[i].children.length?i>0?((siblings=path[i-1].children).splice(siblings.indexOf(path[i]),1),freeNode(path[i])):this.clear():calcBBox(path[i])},RBush3D.prototype._insert=function(item,level,isNode){var insertPath=[],node=this.chooseSubtree(item,this.data,level,insertPath);for(node.children.push(item),extend(node,item);level>=0&&insertPath[level].children.length>this.maxEntries;)this.split(insertPath,level),level--;this.adjustParentBBoxes(item,insertPath,level)},RBush3D.pool=[],RBush3D}();exports.RBush3D=RBush3D}));(x=dist)&&x.__esModule&&Object.prototype.hasOwnProperty.call(x,"default")&&x.default;dist.intersects,dist.boxRayIntersects,dist.RBush3D;var _Flatbush=getCjsExportFromNamespace(flatbush),RBush$1=getCjsExportFromNamespace(rbush);const Flatbush$1=_Flatbush.default?_Flatbush.default:_Flatbush,RBush3D=dist.RBush3D,{Box:Box$2,Point:Point$2}=foundation;var geom={maxDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let intersecting=!1;for(let i of[0,1,2])if(boxes[i].intersects(boxes[(i+1)%3])){intersecting=!0;break}let path=[[],[],[]];for(let i of[0,1,2]){for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);(0==path[i].length||intersecting)&&(path[i]=vertices[i])}let distanceMax=0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMax=Math.max(distanceMax,distance)}return distanceMax},maxDistance2Rectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[]];for(let i of[0,1])path[i]=vertices[i];let distanceMax=0;for(let i of path[0])for(let j of path[1]){const distance=i.distanceEarth(j);distanceMax=Math.max(distanceMax,distance)}return distanceMax},minDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[],[]];for(let i of[0,1,2])path[i]=vertices[i];let distanceMin=1/0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMin=Math.min(distanceMin,distance)}return distanceMin},maxDistanceNRectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[],path=[];for(let r in boxes){if(boxes[r]instanceof Box$2)vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);else{if(!(boxes[r]instanceof Point$2))throw new TypeError("boxes must contain only Box or Point");vertices[r]=[boxes[r]],minx=Math.min(minx||1/0,boxes[r].x),miny=Math.min(miny||1/0,boxes[r].y),maxx=Math.max(maxx||-1/0,boxes[r].x),maxy=Math.max(maxy||-1/0,boxes[r].y)}path[r]=[]}for(let i in boxes)if(i>0){boxes[i-1].intersects(boxes[i])&&(boxes[i-1].intersecting=!0,boxes[i].intersecting=!0)}for(let i in boxes)if(boxes[i].intersecting)path[i]=vertices[i];else{for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);0==path[i].length&&(path[i]=vertices[i])}return function maxDistancePath(origin,path,pathStart){let distanceMax=0;for(let i of path[pathStart]){const distance1=void 0!==origin?i.distanceEarth(origin):0,distance2=path.length>pathStart+1?maxDistancePath(i,path,pathStart+1):0;distanceMax=Math.max(distanceMax,distance1+distance2)}return distanceMax}(void 0,path,0)},findFurthestPointInSegment:function(sega,segb,target,opt){let points,pos,zSearch;if(target instanceof Box$2)points=target.vertices();else{if(!(target instanceof Point$2))throw new TypeError("target must be either Point or Box");points=[target]}if(sega===opt.launch)pos=0,zSearch={minZ:+opt.launch,maxZ:+segb};else{if(segb!==opt.landing)throw new RangeError("this function supports seeking only from the launch or the landing point");pos=1,zSearch={minZ:+sega,maxZ:+opt.landing}}let fpoint,distanceMax=-1/0;for(let v of points){let fVpoint,distanceVMax=-1/0;const precomputed=opt.flight.furthestPoints[pos].search({minX:v.x,minY:v.y,maxX:v.x,maxY:v.y,...zSearch});if(precomputed.length>1)throw new Error("furthestPoints cache inconsistency");if(precomputed[0]){if(!(sega<=precomputed[0].o.r&&precomputed[0].o.r<=segb))throw new Error("furthestPoints cache inconsistency");distanceVMax=v.distanceEarth(precomputed[0].o),fVpoint=precomputed[0].o}if(void 0===fVpoint){let intersecting=!1,canCache=!1;for(let p=sega;p<=segb;p++){const f=opt.flight.flightPoints[p];if(target instanceof Box$2&&target.intersects(f)){intersecting=!0;continue}const d=v.distanceEarth(f);d>distanceVMax&&(distanceVMax=d,fVpoint=f,canCache=!0)}if(intersecting)for(let p of points){const d=v.distanceEarth(p);d>distanceVMax&&(distanceVMax=d,fVpoint=target,canCache=!1)}if(canCache){let zCache;sega===opt.launch?zCache={minZ:+fVpoint.r,maxZ:+segb}:segb===opt.landing&&(zCache={minZ:+sega,maxZ:+fVpoint.r}),opt.flight.furthestPoints[pos].insert({minX:v.x,maxX:v.x,minY:v.y,maxY:v.y,...zCache,o:fVpoint})}}distanceVMax>distanceMax&&(distanceMax=distanceVMax,fpoint=fVpoint)}return void 0===fpoint&&(fpoint=target),fpoint},isTriangleClosed:function(p1,p2,distance,opt){const fastCandidates=opt.flight.closestPairs.search({minX:opt.launch,minY:p2,maxX:p1,maxY:opt.landing});for(let f of fastCandidates)if(f.o.d<=opt.scoring.closingDistanceFree)return f.o;const min=function(p1,p2,opt){let precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:p2}),precomputed=precomputedAll.reduce((a,x)=>!a||x.in>a.in?x:a,void 0);if(precomputed=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,precomputed),void 0!==precomputed)return precomputed.o;const rtree=new Flatbush$1(p1+1-opt.launch,8),lc=Math.abs(Math.cos(util.radians(opt.flight.flightPoints[p1].y)));for(let i=opt.launch;i<=p1;i++){const r=opt.flight.flightPoints[i];rtree.add(r.x*lc,r.y,r.x*lc,r.y)}rtree.finish(),precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:opt.landing});const precomputedNext=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,void 0),lastUnknown=void 0!==precomputedNext?precomputedNext.maxY:opt.landing;let min={d:1/0};for(let i=p2;i<lastUnknown;i++){const pout=opt.flight.flightPoints[i],n=rtree.neighbors(pout.x*lc,pout.y,1)[0]+opt.launch;if(void 0!==n){const pin=opt.flight.flightPoints[n],d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}}if(void 0!==precomputedNext){const pout=precomputedNext.o.out,pin=precomputedNext.o.in,d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}return opt.flight.closestPairs.insert({minX:min.in.r,minY:p2,maxX:p1,maxY:min.out.r,o:min}),min}(p1,p2,opt);return min.d<=opt.scoring.closingDistance(distance,opt)&&min},init:function(opt){opt.flight.closestPairs=new RBush$1,opt.flight.furthestPoints=[new RBush3D,new RBush3D],opt.flight.flightPoints=new Array(opt.flight.filtered.length);for(let r in opt.flight.filtered)opt.flight.flightPoints[r]=new Point$2(opt.flight.filtered,r)}};const definitionFlight_t=60,definitionFlight_x0=1.5,definitionFlight_xt=5,definitionFlight_z0=.05,definitionFlight_zt=.9,definitionGround_t=20,definitionGround_xmax=2.5,definitionGround_zmax=.1,Point$3=foundation.Point;var flight={analyze:function(flight,config){if(config.invalid?flight.filtered=flight.fixes.slice(0):flight.filtered=flight.fixes.filter(x=>x.valid).filter((x,i,a)=>0==i||a[i-1].timestamp!==x.timestamp),flight.filtered.length<5)throw new Error(`Flight must contain at least 5 valid GPS fixes, ${flight.filtered.length} valid fixes found (out of ${flight.fixes.length})`);config.trim||config.detectLaunch||config.detectLanding?(!function(fixes){for(let i in fixes)(null===fixes[i].pressureAltitude||void 0===fixes[i].pressureAltitude||fixes[i].pressureAltitude<-1e3)&&(fixes[i].pressureAltitude=fixes[i].gpsAltitude),null===fixes[i].pressureAltitude&&(fixes[i].gpsAltitude=void 0),i>0?fixes[i].timestamp!==fixes[i-1].timestamp?(fixes[i].hspeed=1e3*new Point$3(fixes,i-1).distanceEarth(new Point$3(fixes,i))/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3,fixes[i].vspeed=(fixes[i].pressureAltitude-fixes[i-1].pressureAltitude)/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3):(fixes[i].hspeed=fixes[i-1].hspeed,fixes[i].vspeed=fixes[i-1].vspeed):(fixes[i].hspeed=0,fixes[i].vspeed=0);for(let _i in fixes){const i=parseInt(_i),now=fixes[i].timestamp;let start,end;for(start=i;start>0&&fixes[start].timestamp>now-Math.round(5e3);start--);for(end=i;end<fixes.length-1&&fixes[end].timestamp<now+Math.round(5e3);end++);const maSegment=fixes.slice(start,end+1);fixes[i].hma=maSegment.reduce((sum,x)=>sum+x.hspeed,0)/maSegment.length,fixes[i].vma=maSegment.reduce((sum,x)=>sum+Math.abs(x.vspeed),0)/maSegment.length}}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma>definitionFlight_xt&&fixes[i].vma>definitionFlight_zt&&(start=i),void 0!==start)if(fixes[i].hma>definitionFlight_x0&&fixes[i].vma>definitionFlight_z0){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionFlight_t)for(let j=start;j<=i;j++)fixes[i].stateFlight=!0}else start=void 0}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax&&(start=i),void 0!==start)if(fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionGround_t)for(let j=start;j<=i;j++)fixes[i].stateGround=!0}else start=void 0}(flight.filtered),flight.ll=function(fixes){let ll=[];for(let i=0;i<fixes.length-1;i++)if(fixes[i].stateFlight){let j;for(j=i;j>0&&!fixes[j].stateGround;j--);const launch=j;for(j=i;j<fixes.length-2&&!fixes[j].stateGround;j++);const landing=j;i=j,ll.push({launch:launch,landing:landing})}return 0==ll.length&&ll.push({launch:0,landing:fixes.length-1}),ll}(flight.filtered)):flight.ll=[{launch:0,landing:flight.filtered.length-1}]}};function closingPenalty(cd,opt){return cd>(opt.scoring.closingDistanceFree||0)?cd:0}function maxFAIDistance(maxTriDistance,boxes,opt){const minTriDistance=geom.minDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxAB=geom.maxDistance2Rectangles([boxes[0],boxes[1]]),maxBC=geom.maxDistance2Rectangles([boxes[1],boxes[2]]),maxCA=geom.maxDistance2Rectangles([boxes[2],boxes[0]]),maxDistance=Math.min(maxAB/opt.scoring.minSide,maxBC/opt.scoring.minSide,maxCA/opt.scoring.minSide,maxTriDistance);return maxDistance<minTriDistance?0:maxDistance}var scoring={closingWithLimit:function(distance,opt){return Math.max(opt.scoring.closingDistanceFixed||0,distance*(opt.scoring.closingDistanceRelative||0))},closingWithPenalty:function(distance,opt){return 1/0},boundTriangle:function(ranges,boxes,opt){const maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxDistance=void 0!==opt.scoring.minSide?maxFAIDistance(maxTriDistance,boxes,opt):maxTriDistance;if(0===maxDistance)return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxDistance,opt),cp?(maxDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxDistance*opt.scoring.multiplier},scoreTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),distance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*distance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,distance,opt);return cp?{distance:distance,score:(distance-closingPenalty(cp.d,opt))*opt.scoring.multiplier,tp:tp,cp:cp}:{score:0}},boundDistance3Points:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt);return geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout])*opt.scoring.multiplier},scoreDistance3Points:function(tp,opt){let distance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])distance+=all[i].distanceEarth(all[i+1]);return{distance:distance,score:distance*opt.scoring.multiplier,tp:tp,ep:{start:pin,finish:pout}}},boundOpenTriangle:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt),maxD3PDistance=geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout]),maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i));if(void 0!==opt.scoring.minSide&&0===maxFAIDistance(maxTriDistance,boxes,opt))return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxTriDistance,opt),cp?(maxD3PDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxD3PDistance*opt.scoring.multiplier},scoreOpenTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),triDistance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*triDistance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,triDistance,opt);if(!cp)return{score:0};let d3pDistance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])d3pDistance+=all[i].distanceEarth(all[i+1]);return{distance:d3pDistance,score:d3pDistance*opt.scoring.multiplier-closingPenalty(cp.d,opt),tp:tp,ep:{start:pin,finish:pout},cp:cp}}};function round2(score){return parseFloat(parseFloat(score).toFixed(2))}var scoringRules_config={FFVL:[{name:"Distance 3 points",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Triangle plat",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Triangle FAI",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}],XContest:[{name:"Free flight",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Free triangle",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"tri"},{name:"FAI triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"fai"},{name:"Closed free triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Closed FAI triangle",multiplier:1.6,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}]};const Solution$1=solution_Solution,{Range:Range$2,Point:Point$4}=foundation;var solver_1=function*(flight$1,_scoringTypes,_config){let reset;const scoringTypes=_scoringTypes||scoringRules_config.FFVL,config=_config||{};flight.analyze(flight$1,config),geom.init({flight:flight$1}),config.hp?Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthVincentys:Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthFCC;let solutionRoots=[];for(let scoringType of scoringTypes)for(let l of flight$1.ll){const opt={flight:flight$1,launch:l.launch,landing:l.landing,scoring:scoringType,config:config};let solutionRoot=new Solution$1([new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing)],opt);solutionRoot.do_bound(),solutionRoot.do_score(),solutionRoots.push(solutionRoot)}let best=solutionRoots[0],solutionQueue=new sortedSet(solutionRoots,Solution$1.prototype.contentEquals,Solution$1.prototype.contentCompare),processed=0,tcum=0;do{const tstart=Date.now();for(;solutionQueue.length>0;){if(processed%100==0&&"undefined"!=typeof process&&process.memoryUsage){const mem=process.memoryUsage();if(mem.heapUsed/mem.heapTotal>.98)break}let current=solutionQueue.pop();if(current.opt.scoring.rounding(current.bound)<=best.opt.scoring.rounding(best.score)){solutionQueue.clear();break}let children=current.do_branch();for(let s of children)if(s.do_bound(),!(s.bound<=best.score)){if(s.do_score(),processed++,s.score>=best.score&&s.score>0&&(best=s,solutionQueue.length>1e4&&solutionQueue.findLeast().value.bound<=best.score)){const garbageBest=solutionQueue.findGreatestLessThanOrEqual({bound:best.score});if(void 0!==garbageBest){const cutoff=solutionQueue.indexOf(garbageBest.value);solutionQueue.splice(0,cutoff+1).length}}solutionQueue.push(s)}if(processed>config.maxloop||Date.now()-tstart>config.maxcycle)break}best.processed=processed;const currentUpperBound=solutionQueue.findGreatest();if(best.currentUpperBound=currentUpperBound?currentUpperBound.value.bound:best.bound,tcum+=Date.now()-tstart,best.time=tcum,0==solutionQueue.length?best.optimal=!0:best.optimal=!1,best.optimal)return best.score=best.opt.scoring.rounding(best.score),best.scoreInfo&&(best.scoreInfo.distance=best.opt.scoring.rounding(best.scoreInfo.distance),best.scoreInfo.cp&&(best.scoreInfo.cp.d=best.opt.scoring.rounding(best.scoreInfo.cp.d))),reset=!0,best;reset=yield best}while(!reset)},MANUFACTURERS=getCjsExportFromNamespace(Object.freeze({__proto__:null,default:[{name:"Aircotec",long:"ACT",short:"I"},{name:"Cambridge Aero Instruments",long:"CAM",short:"C"},{name:"ClearNav Instruments",long:"CNI",short:null},{name:"Data Swan/DSX",long:"DSX",short:"D"},{name:"EW Avionics",long:"EWA",short:"E"},{name:"Filser",long:"FIL",short:"F"},{name:"Flarm",long:"FLA",short:"G"},{name:"Flytech",long:"FLY",short:null},{name:"Garrecht",long:"GCS",short:"A"},{name:"IMI Gliding Equipment",long:"IMI",short:"M"},{name:"Logstream",long:"LGS",short:null},{name:"LX Navigation",long:"LXN",short:"L"},{name:"LXNAV",long:"LXV",short:"V"},{name:"Naviter",long:"NAV",short:null},{name:"New Technologies",long:"NTE",short:"N"},{name:"Nielsen Kellerman",long:"NKL",short:"K"},{name:"Peschges",long:"PES",short:"P"},{name:"PressFinish Electronics",long:"PFE",short:null},{name:"Print Technik",long:"PRT",short:"R"},{name:"Scheffel",long:"SCH",short:"H"},{name:"Streamline Data Instruments",long:"SDI",short:"S"},{name:"Triadis Engineering GmbH",long:"TRI",short:"T"},{name:"Zander",long:"ZAN",short:"Z"},{name:"XCSoar",long:"XCS",short:null},{name:"LK8000",long:"XLK",short:null},{name:"GpsDump",long:"XGD",short:null},{name:"SeeYou Recorder",long:"XCM",short:null}]})),lookup=function(id){let short=1===id.length;id=id.toUpperCase();let manufacturers=MANUFACTURERS.filter(it=>it[short?"short":"long"]===id);return 0!==manufacturers.length?manufacturers[0].name:id},RE_A=/^A(\w{3})(\w{3,}?)(?:FLIGHT:(\d+)|:(.+))?$/,RE_HFDTE=/^HFDTE(?:DATE:)?(\d{2})(\d{2})(\d{2})(?:,?(\d{2}))?/,RE_PLT_HEADER=/^H[FOP]PLT(?:.{0,}?:(.*)|(.*))$/,RE_CM2_HEADER=/^H[FOP]CM2(?:.{0,}?:(.*)|(.*))$/,RE_GTY_HEADER=/^H[FOP]GTY(?:.{0,}?:(.*)|(.*))$/,RE_GID_HEADER=/^H[FOP]GID(?:.{0,}?:(.*)|(.*))$/,RE_CID_HEADER=/^H[FOP]CID(?:.{0,}?:(.*)|(.*))$/,RE_CCL_HEADER=/^H[FOP]CCL(?:.{0,}?:(.*)|(.*))$/,RE_FTY_HEADER=/^H[FOP]FTY(?:.{0,}?:(.*)|(.*))$/,RE_RFW_HEADER=/^H[FOP]RFW(?:.{0,}?:(.*)|(.*))$/,RE_RHW_HEADER=/^H[FOP]RHW(?:.{0,}?:(.*)|(.*))$/,RE_B=/^B(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])([AV])(-\d{4}|\d{5})(-\d{4}|\d{5})/,RE_K=/^K(\d{2})(\d{2})(\d{2})/,RE_IJ=/^[IJ](\d{2})(?:\d{2}\d{2}[A-Z]{3})+/,RE_TASK=/^C(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{4})([-\d]{2})(.*)/,RE_TASKPOINT=/^C(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])(.*)/,IGCParser=function(){function IGCParser(){this._result={numFlight:null,pilot:null,copilot:null,gliderType:null,registration:null,callsign:null,competitionClass:null,loggerType:null,firmwareVersion:null,hardwareVersion:null,task:null,fixes:[],dataRecords:[],security:null,errors:[]},this.fixExtensions=[],this.dataExtensions=[],this.lineNumber=0,this.prevTimestamp=null}return IGCParser.parse=function(str,options){void 0===options&&(options={});for(var parser=new IGCParser,errors=[],_i=0,_a=str.split("\n");_i<_a.length;_i++){var line=_a[_i];try{parser.processLine(line.trim())}catch(error){if(!options.lenient)continue;errors.push(error)}}var result=parser.result;return result.errors=errors,result},Object.defineProperty(IGCParser.prototype,"result",{get:function(){if(this._result.loggerManufacturer||console.error("Missing A record"),!this._result.date)throw new Error("Missing HFDTE record");return this._result},enumerable:!0,configurable:!0}),IGCParser.prototype.processLine=function(line){this.lineNumber+=1;var recordType=line[0];if("B"===recordType){var fix=this.parseBRecord(line);this.prevTimestamp=fix.timestamp,this._result.fixes.push(fix)}else if("K"===recordType){var data=this.parseKRecord(line);this.prevTimestamp=data.timestamp,this._result.dataRecords.push(data)}else if("H"===recordType)this.processHeader(line);else if("C"===recordType)this.processTaskLine(line);else if("A"===recordType){var record=this.parseARecord(line);this._result.loggerId=record.loggerId,this._result.loggerManufacturer=record.manufacturer,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"I"===recordType?this.fixExtensions=this.parseIJRecord(line):"J"===recordType?this.dataExtensions=this.parseIJRecord(line):"G"===recordType&&(this._result.security=(this._result.security||"")+line.slice(1))},IGCParser.prototype.processHeader=function(line){var headerType=line.slice(2,5);if("DTE"===headerType){var record=this.parseDateHeader(line);this._result.date=record.date,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"PLT"===headerType?this._result.pilot=this.parsePilot(line):"CM2"===headerType?this._result.copilot=this.parseCopilot(line):"GTY"===headerType?this._result.gliderType=this.parseGliderType(line):"GID"===headerType?this._result.registration=this.parseRegistration(line):"CID"===headerType?this._result.callsign=this.parseCallsign(line):"CCL"===headerType?this._result.competitionClass=this.parseCompetitionClass(line):"FTY"===headerType?this._result.loggerType=this.parseLoggerType(line):"RFW"===headerType?this._result.firmwareVersion=this.parseFirmwareVersion(line):"RHW"===headerType&&(this._result.hardwareVersion=this.parseHardwareVersion(line))},IGCParser.prototype.parseARecord=function(line){var match=line.match(RE_A);if(match){return{manufacturer:lookup(match[1]),loggerId:match[2],numFlight:match[3]?parseInt(match[3],10):null,additionalData:match[4]||null}}if(match=line.match(/^A(\w{3})(.+)?$/)){return{manufacturer:lookup(match[1]),loggerId:null,numFlight:null,additionalData:match[2]?match[2].trim():null}}throw new Error("Invalid A record at line "+this.lineNumber+": "+line)},IGCParser.prototype.parseDateHeader=function(line){var match=line.match(RE_HFDTE);if(!match)throw new Error("Invalid DTE header at line "+this.lineNumber+": "+line);return{date:("8"===match[3][0]||"9"===match[3][0]?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],numFlight:match[4]?parseInt(match[4],10):null}},IGCParser.prototype.parseTextHeader=function(headerType,regex,line,underscoreReplacement){void 0===underscoreReplacement&&(underscoreReplacement=" ");var match=line.match(regex);return match?(match[1]||match[2]||"").replace(/_/g,underscoreReplacement).trim():""},IGCParser.prototype.parsePilot=function(line){return this.parseTextHeader("PLT",RE_PLT_HEADER,line)},IGCParser.prototype.parseCopilot=function(line){return this.parseTextHeader("CM2",RE_CM2_HEADER,line)},IGCParser.prototype.parseGliderType=function(line){return this.parseTextHeader("GTY",RE_GTY_HEADER,line)},IGCParser.prototype.parseRegistration=function(line){return this.parseTextHeader("GID",RE_GID_HEADER,line,"-")},IGCParser.prototype.parseCallsign=function(line){return this.parseTextHeader("CID",RE_CID_HEADER,line)},IGCParser.prototype.parseCompetitionClass=function(line){return this.parseTextHeader("GID",RE_CCL_HEADER,line)},IGCParser.prototype.parseLoggerType=function(line){return this.parseTextHeader("FTY",RE_FTY_HEADER,line)},IGCParser.prototype.parseFirmwareVersion=function(line){return this.parseTextHeader("RFW",RE_RFW_HEADER,line)},IGCParser.prototype.parseHardwareVersion=function(line){return this.parseTextHeader("RHW",RE_RHW_HEADER,line)},IGCParser.prototype.processTaskLine=function(line){this._result.task?this._result.task.points.push(this.parseTaskPoint(line)):this._result.task=this.parseTask(line)},IGCParser.prototype.parseTask=function(line){var match=line.match(RE_TASK);if(!match)throw new Error("Invalid task declaration at line "+this.lineNumber+": "+line);var lastCentury="8"===match[3][0]||"9"===match[3][0],declarationDate=(lastCentury?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],declarationTime=match[4]+":"+match[5]+":"+match[6],declarationTimestamp=Date.parse(declarationDate+"T"+declarationTime+"Z"),flightDate=null;return"00"===match[7]&&"00"===match[8]&&"00"===match[9]||(flightDate=((lastCentury="8"===match[9][0]||"9"===match[9][0])?"19":"20")+match[9]+"-"+match[8]+"-"+match[7]),{declarationDate:declarationDate,declarationTime:declarationTime,declarationTimestamp:declarationTimestamp,flightDate:flightDate,taskNumber:"0000"!==match[10]?parseInt(match[10],10):null,numTurnpoints:parseInt(match[11],10),comment:match[12]||null,points:[]}},IGCParser.prototype.parseTaskPoint=function(line){var match=line.match(RE_TASKPOINT);if(!match)throw new Error("Invalid task point declaration at line "+this.lineNumber+": "+line);return{latitude:IGCParser.parseLatitude(match[1],match[2],match[3],match[4]),longitude:IGCParser.parseLongitude(match[5],match[6],match[7],match[8]),name:match[9]||null}},IGCParser.prototype.parseBRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first B record");var match=line.match(RE_B);if(!match)throw new Error("Invalid B record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),latitude=IGCParser.parseLatitude(match[4],match[5],match[6],match[7]),longitude=IGCParser.parseLongitude(match[8],match[9],match[10],match[11]),valid="A"===match[12],pressureAltitude="00000"===match[13]?null:parseInt(match[13],10),gpsAltitude="00000"===match[14]?null:parseInt(match[14],10),extensions={};if(this.fixExtensions)for(var _i=0,_a=this.fixExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}var enl=null;if(extensions.ENL){var enlLength=this.fixExtensions.filter((function(it){return"ENL"===it.code}))[0].length,enlMax=Math.pow(10,enlLength);enl=parseInt(extensions.ENL,10)/enlMax}return{timestamp:timestamp,time:time,latitude:latitude,longitude:longitude,valid:valid,pressureAltitude:pressureAltitude,gpsAltitude:gpsAltitude,extensions:extensions,enl:enl,fixAccuracy:extensions.FXA?parseInt(extensions.FXA,10):null}},IGCParser.prototype.parseKRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first K record");if(!this.dataExtensions)throw new Error("Missing J record before first K record");var match=line.match(RE_K);if(!match)throw new Error("Invalid K record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),extensions={};if(this.dataExtensions)for(var _i=0,_a=this.dataExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}return{timestamp:timestamp,time:time,extensions:extensions}},IGCParser.prototype.parseIJRecord=function(line){var match=line.match(RE_IJ);if(!match)return console.error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line),[];var num=parseInt(match[1],10);if(line.length<3+7*num)throw new Error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line);for(var extensions=new Array(num),i=0;i<num;i++){var offset=3+7*i,start=parseInt(line.slice(offset,offset+2),10),length=parseInt(line.slice(offset+2,offset+4),10)-start+1,code=line.slice(offset+4,offset+7);extensions[i]={start:start,length:length,code:code}}return extensions},IGCParser.parseLatitude=function(dd,mm,mmm,ns){var degrees=parseInt(dd,10)+parseFloat(mm+"."+mmm)/60;return"S"===ns?-degrees:degrees},IGCParser.parseLongitude=function(ddd,mm,mmm,ew){var degrees=parseInt(ddd,10)+parseFloat(mm+"."+mmm)/60;return"W"===ew?-degrees:degrees},IGCParser.prototype.calcTimestamp=function(time){for(var timestamp=Date.parse(this._result.date+"T"+time+"Z");this.prevTimestamp&&timestamp<this.prevTimestamp-36e5;)timestamp+=864e5;return timestamp},IGCParser}();var main={solver:solver_1,parser:IGCParser,scoring:scoringRules_config,IGCParser:IGCParser},main_1=main.solver,main_2=main.parser,main_3=main.scoring,main_4=main.IGCParser;exports.IGCParser=main_4,exports.default=main,exports.parser=main_2,exports.scoring=main_3,exports.solver=main_1;
\ No newline at end of file
+"use strict";Object.defineProperty(exports,"__esModule",{value:!0}),Function.noop=function(){},Function.identity=function(value){return value},Function.by=function(by,compare){compare=compare||Object.compare,by=by||Function.identity;var compareBy=function(a,b){return compare(by(a),by(b))};return compareBy.compare=compare,compareBy.by=by,compareBy},Function.get=function(key){return function(object){return Object.get(object,key)}};var commonjsGlobal="undefined"!=typeof globalThis?globalThis:"undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof self?self:{};function createCommonjsModule(fn,module){return fn(module={exports:{}},module.exports),module.exports}function getCjsExportFromNamespace(n){return n&&n.default||n}var genericCollection=GenericCollection;function GenericCollection(){throw new Error("Can't construct. GenericCollection is a mixin.")}var DOMTokenList=commonjsGlobal.DOMTokenList||function(){};GenericCollection.EmptyArray=Object.freeze([]),GenericCollection.prototype.addEach=function(values,mapFn,thisp){if(values&&(values instanceof Array||values instanceof DOMTokenList||values instanceof String))if(mapFn)for(var i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else if(values&&Object(values)===values)if("function"==typeof values.forEach)mapFn?values.map(mapFn,thisp).forEach(this.add,this):values.forEach(this.add,this);else if("function"==typeof values.next){var value;i=0;if(mapFn)for(;value=values.next().value;)this.add(mapFn.call(thisp,value),i++);else for(;value=values.next().value;)this.add(value,i++)}else if("number"==typeof values.length)if(mapFn)for(i=0;i<values.length;i++)this.add(mapFn.call(thisp,values[i]),i);else for(i=0;i<values.length;i++)this.add(values[i],i);else mapFn?Object.keys(values).forEach((function(key){this.add(mapFn.call(thisp,values[key]),key)}),this):Object.keys(values).forEach((function(key){this.add(values[key],key)}),this);return this},GenericCollection.prototype.deleteEach=function(values,equals){return values.forEach((function(value){this.delete(value,equals)}),this),this},GenericCollection.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)}),void 0)},GenericCollection.prototype.map=function(callback){var thisp=arguments[1],result=[];return this.reduce((function(undefined$1,value,key,object,depth){result.push(callback.call(thisp,value,key,object,depth))}),void 0),result},GenericCollection.prototype.enumerate=function(start){null==start&&(start=0);var result=[];return this.reduce((function(undefined$1,value){result.push([start++,value])}),void 0),result},GenericCollection.prototype.group=function(callback,thisp,equals){equals=equals||Object.equals;var groups=[],keys=[];return this.forEach((function(value,key,object){key=callback.call(thisp,value,key,object);var group,index=keys.indexOf(key,equals);-1===index?(group=[],groups.push([key,group]),keys.push(key)):group=groups[index][1],group.push(value)})),groups},GenericCollection.prototype.toArray=function(){return this.map(Function.identity)},GenericCollection.prototype.toObject=function(){var object={};return this.reduce((function(undefined$1,value,key){object[key]=value}),void 0),object},GenericCollection.from=function(){return this.apply(this,arguments)},GenericCollection.prototype.filter=function(callback){var thisp=arguments[1],result=this.constructClone();return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,key,object,depth)&&result.add(value,key)}),void 0),result},GenericCollection.prototype.every=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result&&callback.call(thisp,value,key,object,depth)}),!0)},GenericCollection.prototype.some=function(callback){var thisp=arguments[1];return this.reduce((function(result,value,key,object,depth){return result||callback.call(thisp,value,key,object,depth)}),!1)},GenericCollection.prototype.all=function(){return this.every(Boolean)},GenericCollection.prototype.any=function(){return this.some(Boolean)},GenericCollection.prototype.min=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)<0?value:result}),void 0)},GenericCollection.prototype.max=function(compare){compare=compare||this.contentCompare||Object.compare;var first=!0;return this.reduce((function(result,value){return first?(first=!1,value):compare(value,result)>0?value:result}),void 0)},GenericCollection.prototype.sum=function(zero){return zero=void 0===zero?0:zero,this.reduce((function(a,b){return a+b}),zero)},GenericCollection.prototype.average=function(zero){var sum=void 0===zero?0:zero,count=void 0===zero?0:zero;return this.reduce((function(undefined$1,value){sum+=value,count+=1}),void 0),sum/count},GenericCollection.prototype.concat=function(){for(var result=this.constructClone(this),i=0;i<arguments.length;i++)result.addEach(arguments[i]);return result},GenericCollection.prototype.flatten=function(){var self=this;return this.reduce((function(result,array){return array.forEach((function(value){this.push(value)}),result,self),result}),[])},GenericCollection.prototype.zip=function(){var table=Array.prototype.slice.call(arguments);return table.unshift(this),Array.unzip(table)},GenericCollection.prototype.join=function(delimiter){return this.reduce((function(result,string){return void 0===result?string:result+delimiter+string}),void 0)},GenericCollection.prototype.sorted=function(compare,by,order){return(compare=compare||this.contentCompare||Object.compare).by?(by=compare.by,compare=compare.compare||this.contentCompare||Object.compare):by=by||Function.identity,void 0===order&&(order=1),this.map((function(item){return{by:by(item),value:item}})).sort((function(a,b){return compare(a.by,b.by)*order})).map((function(pair){return pair.value}))},GenericCollection.prototype.reversed=function(){return this.constructClone(this).reverse()},GenericCollection.prototype.clone=function(depth,memo){if(void 0===depth)depth=1/0;else if(0===depth)return this;var clone=this.constructClone();return this.forEach((function(value,key){clone.add(Object.clone(value,depth-1,memo),key)}),this),clone},GenericCollection.prototype.only=function(){if(1===this.length)return this.one()},GenericCollection.prototype.iterator=function(){return this.iterate.apply(this,arguments)},GenericCollection._sizePropertyDescriptor={get:function(){return this.length},enumerable:!1,configurable:!0},Object.defineProperty(GenericCollection.prototype,"size",GenericCollection._sizePropertyDescriptor);var weakMap=createCommonjsModule((function(module){!function(){if("undefined"==typeof ses||!ses.ok||ses.ok()){"undefined"!=typeof ses&&(ses.weakMapPermitHostObjects=weakMapPermitHostObjects);var doubleWeakMapCheckSilentFailure=!1;if("function"==typeof WeakMap){var HostWeakMap=WeakMap;if("undefined"!=typeof navigator&&/Firefox/.test(navigator.userAgent));else{var testMap=new HostWeakMap,testObject=Object.freeze({});if(testMap.set(testObject,1),1===testMap.get(testObject))return void(module.exports=WeakMap);doubleWeakMapCheckSilentFailure=!0}}var gopn=Object.getOwnPropertyNames,defProp=Object.defineProperty,isExtensible=Object.isExtensible,HIDDEN_NAME="weakmap:ident:"+Math.random()+"___";if("undefined"!=typeof crypto&&"function"==typeof crypto.getRandomValues&&"function"==typeof ArrayBuffer&&"function"==typeof Uint8Array){var ab=new ArrayBuffer(25),u8s=new Uint8Array(ab);crypto.getRandomValues(u8s),HIDDEN_NAME="weakmap:rand:"+Array.prototype.map.call(u8s,(function(u8){return(u8%36).toString(36)})).join("")+"___"}if(defProp(Object,"getOwnPropertyNames",{value:function(obj){return gopn(obj).filter(isNotHiddenName)}}),"getPropertyNames"in Object){var originalGetPropertyNames=Object.getPropertyNames;defProp(Object,"getPropertyNames",{value:function(obj){return originalGetPropertyNames(obj).filter(isNotHiddenName)}})}!function(){var oldFreeze=Object.freeze;defProp(Object,"freeze",{value:function(obj){return getHiddenRecord(obj),oldFreeze(obj)}});var oldSeal=Object.seal;defProp(Object,"seal",{value:function(obj){return getHiddenRecord(obj),oldSeal(obj)}});var oldPreventExtensions=Object.preventExtensions;defProp(Object,"preventExtensions",{value:function(obj){return getHiddenRecord(obj),oldPreventExtensions(obj)}})}();var calledAsFunctionWarningDone=!1,nextId=0,OurWeakMap=function(){this instanceof OurWeakMap||calledAsFunctionWarning();var keys=[],values=[],id=nextId++;return Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord?hiddenRecord[id]:opt_default:(index=keys.indexOf(key))>=0?values[index]:opt_default}))},has___:{value:constFunc((function(key){var hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord:keys.indexOf(key)>=0}))},set___:{value:constFunc((function(key,value){var index,hiddenRecord=getHiddenRecord(key);return hiddenRecord?hiddenRecord[id]=value:(index=keys.indexOf(key))>=0?values[index]=value:(index=keys.length,values[index]=value,keys[index]=key),this}))},delete___:{value:constFunc((function(key){var index,lastIndex,hiddenRecord=getHiddenRecord(key);return hiddenRecord?id in hiddenRecord&&delete hiddenRecord[id]:!((index=keys.indexOf(key))<0)&&(lastIndex=keys.length-1,keys[index]=void 0,values[index]=values[lastIndex],keys[index]=keys[lastIndex],keys.length=lastIndex,values.length=lastIndex,!0)}))}})};OurWeakMap.prototype=Object.create(Object.prototype,{get:{value:function(key,opt_default){return this.get___(key,opt_default)},writable:!0,configurable:!0},has:{value:function(key){return this.has___(key)},writable:!0,configurable:!0},set:{value:function(key,value){return this.set___(key,value)},writable:!0,configurable:!0},delete:{value:function(key){return this.delete___(key)},writable:!0,configurable:!0}}),"function"==typeof HostWeakMap?function(){function DoubleWeakMap(){this instanceof OurWeakMap||calledAsFunctionWarning();var dset,hmap=new HostWeakMap,omap=void 0,enableSwitching=!1;return dset=doubleWeakMapCheckSilentFailure?function(key,value){return hmap.set(key,value),hmap.has(key)||(omap||(omap=new OurWeakMap),omap.set(key,value)),this}:function(key,value){if(enableSwitching)try{hmap.set(key,value)}catch(e){omap||(omap=new OurWeakMap),omap.set___(key,value)}else hmap.set(key,value);return this},Object.create(OurWeakMap.prototype,{get___:{value:constFunc((function(key,opt_default){return omap?hmap.has(key)?hmap.get(key):omap.get___(key,opt_default):hmap.get(key,opt_default)}))},has___:{value:constFunc((function(key){return hmap.has(key)||!!omap&&omap.has___(key)}))},set___:{value:constFunc(dset)},delete___:{value:constFunc((function(key){var result=!!hmap.delete(key);return omap&&omap.delete___(key)||result}))},permitHostObjects___:{value:constFunc((function(token){if(token!==weakMapPermitHostObjects)throw new Error("bogus call to permitHostObjects___");enableSwitching=!0}))}})}doubleWeakMapCheckSilentFailure&&"undefined"!=typeof Proxy&&(Proxy=void 0),DoubleWeakMap.prototype=OurWeakMap.prototype,module.exports=DoubleWeakMap,Object.defineProperty(WeakMap.prototype,"constructor",{value:WeakMap,enumerable:!1,configurable:!0,writable:!0})}():("undefined"!=typeof Proxy&&(Proxy=void 0),module.exports=OurWeakMap)}function weakMapPermitHostObjects(map){map.permitHostObjects___&&map.permitHostObjects___(weakMapPermitHostObjects)}function isNotHiddenName(name){return!("weakmap:"==name.substr(0,"weakmap:".length)&&"___"===name.substr(name.length-3))}function getHiddenRecord(key){if(key!==Object(key))throw new TypeError("Not an object: "+key);var hiddenRecord=key[HIDDEN_NAME];if(hiddenRecord&&hiddenRecord.key===key)return hiddenRecord;if(isExtensible(key)){hiddenRecord={key:key};try{return defProp(key,HIDDEN_NAME,{value:hiddenRecord,writable:!1,enumerable:!1,configurable:!1}),hiddenRecord}catch(error){return}}}function constFunc(func){return func.prototype=null,Object.freeze(func)}function calledAsFunctionWarning(){calledAsFunctionWarningDone||"undefined"==typeof console||(calledAsFunctionWarningDone=!0,console.warn("WeakMap should be invoked as new WeakMap(), not WeakMap(). This will be an error in the future."))}}()})),weakMap$1="undefined"!=typeof WeakMap?WeakMap:weakMap,shimObject=Object;Object.empty=Object.freeze(Object.create(null)),Object.isObject=function(object){return Object(object)===object},Object.getValueOf=function(value){return value&&"function"==typeof value.valueOf&&(value=value.valueOf()),value};var hashMap=new weakMap$1;Object.hash=function(object){return object&&"function"==typeof object.hash?""+object.hash():Object(object)===object?(hashMap.has(object)||hashMap.set(object,Math.random().toString(36).slice(2)),hashMap.get(object)):""+object};var owns=Object.prototype.hasOwnProperty;Object.owns=function(object,key){return owns.call(object,key)},Object.has=function(object,key){if("object"!=typeof object)throw new Error("Object.has can't accept non-object: "+typeof object);if(object&&"function"==typeof object.has)return object.has(key);if("string"==typeof key)return key in object&&object[key]!==Object.prototype[key];throw new Error("Key must be a string for Object.has on plain objects")},Object.get=function(object,key,value){if("object"!=typeof object)throw new Error("Object.get can't accept non-object: "+typeof object);return object&&"function"==typeof object.get?object.get(key,value):Object.has(object,key)?object[key]:value},Object.set=function(object,key,value){object&&"function"==typeof object.set?object.set(key,value):object[key]=value},Object.addEach=function(target,source,overrides){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)target[index]=source[index];else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||(target[key]=source[key]);else!0===source.isMap?source.forEach((function(value,key){target[key]=value})):source.forEach((function(pair){target[pair[0]]=pair[1]}));else;return target},Object.defineEach=function(target,source,overrides,configurable,enumerable,writable){var overridesExistingProperty=3!==arguments.length||overrides;if(source)if("function"!=typeof source.forEach||source.hasOwnProperty("forEach"))if("number"==typeof source.length)for(var index=0;index<source.length;index++)Object.defineProperty(target,index,{value:source[index],writable:writable,configurable:configurable,enumerable:enumerable});else for(var key,keys=Object.keys(source),i=0;key=keys[i];i++)!overridesExistingProperty&&Object.owns(target,key)||Object.defineProperty(target,key,{value:source[key],writable:writable,configurable:configurable,enumerable:enumerable});else!0===source.isMap?source.forEach((function(value,key){Object.defineProperty(target,key,{value:value,writable:writable,configurable:configurable,enumerable:enumerable})})):source.forEach((function(pair){Object.defineProperty(target,pair[0],{value:pair[1],writable:writable,configurable:configurable,enumerable:enumerable})}));else;return target},Object.forEach=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0;iKey=keys[i];i++)callback.call(thisp,object[iKey],iKey,object)},Object.map=function(object,callback,thisp){for(var iKey,keys=Object.keys(object),i=0,result=[];iKey=keys[i];i++)result.push(callback.call(thisp,object[iKey],iKey,object));return result},Object.values=function(object){return Object.map(object,Function.identity)},Object.concat=function(){for(var object={},i=0;i<arguments.length;i++)Object.addEach(object,arguments[i]);return object},Object.from=Object.concat,Object.is=function(x,y){return x===y?0!==x||1/x==1/y:x!=x&&y!=y},Object.equals=function(a,b,equals,memo){if(equals=equals||Object.equals,(a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return!0;if(Object.isObject(a)){if((memo=memo||new weakMap$1).has(a))return!0;memo.set(a,!0)}if(Object.isObject(a)&&"function"==typeof a.equals)return a.equals(b,equals,memo);if(Object.isObject(b)&&"function"==typeof b.equals)return b.equals(a,equals,memo);if(Object.isObject(a)&&Object.isObject(b)&&Object.getPrototypeOf(a)===Object.prototype&&Object.getPrototypeOf(b)===Object.prototype){for(var name in a)if(!equals(a[name],b[name],equals,memo))return!1;for(var name in b)if(!(name in a)||!equals(b[name],a[name],equals,memo))return!1;return!0}return a!=a&&b!=b||(!a||!b)&&a===b},Object.compare=function(a,b){if((a=Object.getValueOf(a))===(b=Object.getValueOf(b)))return 0;var aType=typeof a,bType=typeof b;return"number"===aType&&"number"===bType?a-b:"string"===aType&&"string"===bType?a<b?-1/0:1/0:a&&"function"==typeof a.compare?a.compare(b):b&&"function"==typeof b.compare?-b.compare(a):0},Object.clone=function(value,depth,memo){if(value=Object.getValueOf(value),memo=memo||new weakMap$1,void 0===depth)depth=1/0;else if(0===depth)return value;if(Object.isObject(value)){if(!memo.has(value))if(value&&"function"==typeof value.clone)memo.set(value,value.clone(depth,memo));else{var prototype=Object.getPrototypeOf(value);if(null!==prototype&&prototype!==Object.prototype)throw new Error("Can't clone "+value);var clone=Object.create(prototype);for(var key in memo.set(value,clone),value)clone[key]=Object.clone(value[key],depth-1,memo)}return memo.get(value)}return value},Object.clear=function(object){if(object&&"function"==typeof object.clear)object.clear();else for(var keys=Object.keys(object),i=keys.length;i;)delete object[keys[--i]];return object};var genericOrder=GenericOrder;function GenericOrder(){throw new Error("Can't construct. GenericOrder is a mixin.")}GenericOrder.prototype.equals=function(that,equals){return equals=equals||this.contentEquals||shimObject.equals,this===that||!!that&&(this.length===that.length&&this.zip(that).every((function(pair){return equals(pair[0],pair[1])})))},GenericOrder.prototype.compare=function(that,compare){if(compare=compare||this.contentCompare||shimObject.compare,this===that)return 0;if(!that)return 1;var length=Math.min(this.length,that.length),comparison=this.zip(that).reduce((function(comparison,pair,index){return 0===comparison?index>=length?comparison:compare(pair[0],pair[1]):comparison}),0);return 0===comparison?this.length-that.length:comparison},GenericOrder.prototype.toJSON=function(){return this.toArray()};var array_splice=Array.prototype.splice,array_slice=Array.prototype.slice;Array.empty=[],Object.freeze&&Object.freeze(Array.empty),Array.nativeFrom=Array.from;var isSymbolDefined="undefined"!=typeof Symbol;function define(key,value){Object.defineProperty(Array.prototype,key,{value:value,writable:!0,configurable:!0,enumerable:!1})}Array.from=function(values,mapFn,thisArg){if(isSymbolDefined&&values&&"function"==typeof values[Symbol.iterator])return Array.nativeFrom(values,mapFn,thisArg);var array=[];return array.addEach(values),array},Array.unzip=function(table){for(var transpose=[],length=1/0,i=0;i<table.length;i++){var row=table[i];table[i]=row.toArray(),row.length<length&&(length=row.length)}for(i=0;i<table.length;i++){row=table[i];for(var j=0;j<row.length;j++)j<length&&j in row&&(transpose[j]=transpose[j]||[],transpose[j][i]=row[j])}return transpose},define("addEach",genericCollection.prototype.addEach),define("deleteEach",genericCollection.prototype.deleteEach),define("toArray",genericCollection.prototype.toArray),define("toObject",genericCollection.prototype.toObject),define("all",genericCollection.prototype.all),define("any",genericCollection.prototype.any),define("min",genericCollection.prototype.min),define("max",genericCollection.prototype.max),define("sum",genericCollection.prototype.sum),define("average",genericCollection.prototype.average),define("only",genericCollection.prototype.only),define("flatten",genericCollection.prototype.flatten),define("zip",genericCollection.prototype.zip),define("enumerate",genericCollection.prototype.enumerate),define("group",genericCollection.prototype.group),define("sorted",genericCollection.prototype.sorted),define("reversed",genericCollection.prototype.reversed),define("constructClone",(function(values){var clone=new this.constructor;return clone.addEach(values),clone})),define("has",(function(value,equals){return-1!==this.findValue(value,equals)})),define("get",(function(index,defaultValue){if(+index!==index)throw new Error("Indicies must be numbers");return!index in this?defaultValue:this[index]})),define("set",(function(index,value){return this[index]=value,!0})),define("add",(function(value){return this.push(value),!0})),define("delete",(function(value,equals){var index=this.findValue(value,equals);return-1!==index&&(this.spliceOne(index),!0)})),define("deleteAll",(function(value,equals){equals=equals||this.contentEquals||Object.equals;for(var count=0,index=0;index<this.length;)equals(value,this[index])?(this.swap(index,1),count++):index++;return count})),Array.prototype.find||define("find",(function(predicate){if(null==this)throw new TypeError('"this" is null or not defined');var o=Object(this),len=o.length>>>0;if("function"!=typeof predicate)throw new TypeError("predicate must be a function");for(var thisArg=arguments[1],k=0;k<len;){var kValue=o[k];if(predicate.call(thisArg,kValue,k,o))return kValue;k++}}));var deprecatedWarnNonce={};function deprecatedWarn(msg,notOnce){"undefined"!=typeof console&&"function"==typeof console.warn&&!0!==notOnce&&!1===deprecatedWarnNonce.hasOwnProperty(msg)&&(console.warn(msg),deprecatedWarnNonce[msg]++)}var ArrayFindPrototype=Object.getOwnPropertyDescriptor(Array.prototype,"find").value;function ArrayIterator(array,start,end){this.array=array,this.start=null==start?0:start,this.end=end}if(define("find",(function(value,equals,index){return"function"==typeof arguments[0]&&this instanceof Array?ArrayFindPrototype.apply(this,arguments):(deprecatedWarn("Array#find usage is deprecated please use Array#findValue"),this.findValue.apply(this,arguments))})),define("findValue",(function(value,equals,index){if(index)throw new Error("Array#findValue does not support third argument: index");equals=equals||this.contentEquals||Object.equals;for(index=0;index<this.length;index++)if(index in this&&equals(value,this[index]))return index;return-1})),define("findLast",(function(value,equals){return deprecatedWarn("Array#findLast function is deprecated please use Array#findLastValue instead."),this.findLastValue.apply(this,arguments)})),define("findLastValue",(function(value,equals){equals=equals||this.contentEquals||Object.equals;var index=this.length;do{if(--index in this&&equals(this[index],value))return index}while(index>0);return-1})),define("swap",(function(start,length,plus){var args,plusLength,i,j,returnValue;if(start>this.length&&(this.length=start),void 0!==plus){if(args=[start,length],Array.isArray(plus)||(plus=array_slice.call(plus)),i=0,(plusLength=plus.length)<1e3){for(;i<plusLength;i++)args[i+2]=plus[i];return array_splice.apply(this,args)}for(returnValue=array_splice.apply(this,args);i<plusLength;){for(args=[start+i,0],j=2;j<1002&&i<plusLength;j++,i++)args[j]=plus[i];array_splice.apply(this,args)}return returnValue}return void 0!==length?array_splice.call(this,start,length):void 0!==start?array_splice.call(this,start):[]})),define("peek",(function(){return this[0]})),define("poke",(function(value){this.length>0&&(this[0]=value)})),define("peekBack",(function(){if(this.length>0)return this[this.length-1]})),define("pokeBack",(function(value){this.length>0&&(this[this.length-1]=value)})),define("one",(function(){for(var i in this)if(Object.owns(this,i))return this[i]})),Array.prototype.clear||define("clear",(function(){return this.length=0,this})),define("compare",(function(that,compare){var i,length,relative;if(compare=compare||Object.compare,this===that)return 0;if(!that||!Array.isArray(that))return genericOrder.prototype.compare.call(this,that,compare);for(length=this.length<that.length?this.length:that.length,i=0;i<length;i++)if(i in this){if(!(i in that))return-1;if(relative=compare(this[i],that[i]))return relative}else if(i in that)return 1;return this.length-that.length})),define("equals",(function(that,equals){equals=equals||Object.equals;var i=0,length=this.length;if(this===that)return!0;if(!that||!Array.isArray(that))return genericOrder.prototype.equals.call(this,that);if(length!==that.length)return!1;for(;i<length;++i)if(i in this){if(!(i in that))return!1;if(!equals(this[i],that[i]))return!1}else if(i in that)return!1;return!0})),define("clone",(function(depth,memo){if(null==depth)depth=1/0;else if(0===depth)return this;if((memo=memo||new weakMap$1).has(this))return memo.get(this);var clone=new Array(this.length);for(var i in memo.set(this,clone),this)clone[i]=Object.clone(this[i],depth-1,memo);return clone})),define("iterate",(function(start,end){return new ArrayIterator(this,start,end)})),void 0===Array.prototype.spliceOne&&define("spliceOne",(function(index,itemToAdd){var len=this.length;if(len)if(1===arguments.length){for(;index<len;)this[index]=this[index+1],index++;this.length--}else this[index]=itemToAdd})),define("Iterator",ArrayIterator),ArrayIterator.prototype.__iterationObject=null,Object.defineProperty(ArrayIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ArrayIterator.prototype.next=function(){return this.start===(null==this.end?this.array.length:this.end)?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=this.array[this.start++],this._iterationObject},!RegExp.escape){var special=/[-[\]{}()*+?.\\^$|,#\s]/g;RegExp.escape=function(string){return string.replace(special,"\\$&")}}getCjsExportFromNamespace(Object.freeze({__proto__:null}));var genericSet=GenericSet;function GenericSet(){throw new Error("Can't construct. GenericSet is a mixin.")}GenericSet.prototype.isSet=!0,GenericSet.prototype.union=function(that){var union=this.constructClone(this);return union.addEach(that),union},GenericSet.prototype.intersection=function(that){return this.constructClone(this.filter((function(value){return that.has(value)})))},GenericSet.prototype.difference=function(that){var union=this.constructClone(this);return union.deleteEach(that),union},GenericSet.prototype.symmetricDifference=function(that){var union=this.union(that),intersection=this.intersection(that);return union.difference(intersection)},GenericSet.prototype.deleteAll=function(value){return+this.delete(value)},GenericSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.length===that.length&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GenericSet.prototype.forEach=function(callback){var thisp=arguments[1];return this.reduce((function(undefined$1,value,key,object,depth){callback.call(thisp,value,value,object,depth)}),void 0)},GenericSet.prototype.toJSON=function(){return this.toArray()},GenericSet.prototype.contains=function(value){return this.has(value)},GenericSet.prototype.remove=function(value){return this.delete(value)},GenericSet.prototype.toggle=function(value){this.has(value)?this.delete(value):this.add(value)};var _valuesArrayFunction=function(value,key){return value};GenericSet.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};GenericSet.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)};var _list=List;function List(values,equals,getDefault){return List._init(List,this,values,equals,getDefault)}function ListIterator(head){this.head=head,this.at=head.next}function Node(value){this.value=value,this.prev=null,this.next=null}List._init=function(constructor,object,values,equals,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,getDefault);var head=object.head=new object.Node;head.next=head,head.prev=head,object.contentEquals=equals||Object.equals,object.getDefault=getDefault||Function.noop,object.length=0,object.addEach(values)},List.List=List,Object.addEach(List.prototype,genericCollection.prototype),Object.addEach(List.prototype,genericOrder.prototype),List.from=genericCollection.from,List.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.getDefault)},List.prototype.find=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.next);at!==head;){if(equals(at.value,value))return at;at=at.next}},List.prototype.findLast=function(value,equals,index){equals=equals||this.contentEquals;for(var head=this.head,at=this.scan(index,head.prev);at!==head;){if(equals(at.value,value))return at;at=at.prev}},List.prototype.has=function(value,equals){return!!this.find(value,equals)},List.prototype.get=function(value,equals){var found=this.find(value,equals);return found?found.value:this.getDefault(value)},List.prototype.delete=function(value,equals){var found=this.findLast(value,equals);return!!found&&(found.delete(),this.length--,!0)},List.prototype.deleteAll=function(value,equals){equals=equals||this.contentEquals;for(var head=this.head,at=head.next,count=0;at!==head;)equals(value,at.value)&&(at.delete(),count++),at=at.next;return this.length-=count,count},List.prototype.clear=function(){this.head.next=this.head.prev=this.head,this.length=0},List.prototype.add=function(value){var node=new this.Node(value);return this._addNode(node)},List.prototype._addNode=function(node){return this.head.addBefore(node),this.length++,!0},List.prototype.push=function(){for(var head=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);head.addBefore(node)}this.length+=arguments.length},List.prototype.unshift=function(){for(var at=this.head,i=0;i<arguments.length;i++){var value=arguments[i],node=new this.Node(value);at.addAfter(node),at=node}this.length+=arguments.length},List.prototype._shouldPop=function(){var value,head=this.head;return head.prev!==head&&(value=head.prev.value),value},List.prototype.pop=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.prev.value;var index=this.length-1,popDispatchValueArray=_before?_before.call(this,value,index):void 0;head.prev.delete(),this.length--,_after&&_after.call(this,value,index,popDispatchValueArray)}return value},List.prototype.shift=function(_before,_after){var value,head=this.head;if(head.prev!==head){value=head.next.value;var dispatchValueArray=_before?_before.call(this,value,0):void 0;head.next.delete(),this.length--,_after&&_after.call(this,value,0,dispatchValueArray)}return value},List.prototype.peek=function(){if(this.head!==this.head.next)return this.head.next.value},List.prototype.poke=function(value){this.head!==this.head.next?this.head.next.value=value:this.push(value)},List.prototype.one=function(){return this.peek()},List.prototype.scan=function(at,fallback){var head=this.head;if("number"==typeof at){var count=at;if(count>=0)for(at=head.next;count&&(count--,(at=at.next)!=head););else for(at=head;count<0&&(count++,(at=at.prev)!=head););return at}return at||fallback},List.prototype.slice=function(at,end){var sliced=[],head=this.head;for(at=this.scan(at,head.next),end=this.scan(end,head);at!==end&&at!==head;)sliced.push(at.value),at=at.next;return sliced},List.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},List.prototype.swap=function(start,length,plus,_before,_after){var initial=start;start=this.scan(start,this.head),null==length&&(length=1/0),plus=Array.from(plus);for(var minus=[],at=start;length--&&length>=0&&at!==this.head;)minus.push(at.value),at=at.next;_before&&_before.call(this,start,plus,minus);at=start;var i=0;for(at=start;i<minus.length;i++,at=at.next)at.delete();null==initial&&at===this.head&&(at=this.head.next);for(i=0;i<plus.length;i++){var node=new this.Node(plus[i]);at.addBefore(node)}return this.length+=plus.length-minus.length,_after&&_after.call(this,start,plus,minus),minus},List.prototype.reverse=function(){var at=this.head;do{var temp=at.next;at.next=at.prev,at.prev=temp,at=at.next}while(at!==this.head);return this},List.prototype.sort=function(){this.swap(0,this.length,this.sorted.apply(this,arguments))},List.prototype.reduce=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.next;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.next;return basis},List.prototype.reduceRight=function(callback,basis){for(var thisp=arguments[2],head=this.head,at=head.prev;at!==head;)basis=callback.call(thisp,basis,at.value,at,this),at=at.prev;return basis},List.prototype.updateIndexes=function(node,index){for(;node!==this.head;)node.index=index++,node=node.next},List.prototype.iterate=function(){return new ListIterator(this.head)},ListIterator.prototype.__iterationObject=null,Object.defineProperty(ListIterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),ListIterator.prototype.next=function(){if(this.at===this.head)this._iterationObject.done=!0,this._iterationObject.value=void 0;else{var value=this.at.value;this.at=this.at.next,this._iterationObject.value=value}return this._iterationObject},List.prototype.Node=Node,Node.prototype.delete=function(){this.prev.next=this.next,this.next.prev=this.prev},Node.prototype.addBefore=function(node){var prev=this.prev;this.prev=node,node.prev=prev,prev.next=node,node.next=this},Node.prototype.addAfter=function(node){var next=this.next;this.next=node,node.next=next,next.prev=node,node.prev=this};var iterator=Iterator;function Iterator(iterable,standardMode){var values=standardMode&&iterable&&iterable.values&&iterable.values();if(values&&"function"==typeof values.next)return values;if(!(this instanceof Iterator))return new Iterator(iterable);if(Array.isArray(iterable)||"string"==typeof iterable)return Iterator.iterate(iterable);if((iterable=shimObject(iterable))instanceof Iterator)return iterable;if(iterable.next)this.next=function(){return iterable.next()};else if(iterable.iterate){var iterator=iterable.iterate();this.next=function(){return iterator.next()}}else{if("[object Function]"!==shimObject.prototype.toString.call(iterable))throw new TypeError("Can't iterate "+iterable);this.next=iterable}}Iterator.prototype.forEach=genericCollection.prototype.forEach,Iterator.prototype.map=genericCollection.prototype.map,Iterator.prototype.filter=genericCollection.prototype.filter,Iterator.prototype.every=genericCollection.prototype.every,Iterator.prototype.some=genericCollection.prototype.some,Iterator.prototype.any=genericCollection.prototype.any,Iterator.prototype.all=genericCollection.prototype.all,Iterator.prototype.min=genericCollection.prototype.min,Iterator.prototype.max=genericCollection.prototype.max,Iterator.prototype.sum=genericCollection.prototype.sum,Iterator.prototype.average=genericCollection.prototype.average,Iterator.prototype.flatten=genericCollection.prototype.flatten,Iterator.prototype.zip=genericCollection.prototype.zip,Iterator.prototype.enumerate=genericCollection.prototype.enumerate,Iterator.prototype.sorted=genericCollection.prototype.sorted,Iterator.prototype.group=genericCollection.prototype.group,Iterator.prototype.reversed=genericCollection.prototype.reversed,Iterator.prototype.toArray=genericCollection.prototype.toArray,Iterator.prototype.toObject=genericCollection.prototype.toObject,Iterator.prototype.iterator=genericCollection.prototype.iterator,Iterator.prototype.__iterationObject=null,shimObject.defineProperty(Iterator.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:void 0})}}),Iterator.prototype.constructClone=function(values){var clone=[];return clone.addEach(values),clone},Iterator.prototype.mapIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var callbackValue=callback.call(thisp,self.next().value,i++,self);self._iterationObject.value=callbackValue}return self._iterationObject}))},Iterator.prototype.filterIterator=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){for(var nextEntry;;){if(!0===(nextEntry=self.next()).done)return nextEntry;if(callback.call(thisp,nextEntry.value,i++,self))return nextEntry}}))},Iterator.prototype.reduce=function(callback){var nextEntry,self=Iterator(this),result=arguments[1],thisp=arguments[2],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;if(!0===(nextEntry=self.next()).done){if(arguments.length>1)return arguments[1];throw TypeError("cannot reduce a value from an empty iterator with no initial value")}for(result=arguments.length>1?callback.call(thisp,result,nextEntry.value,i,self):nextEntry.value,i++;;){if(!0===(nextEntry=self.next()).done)return result;result=callback.call(thisp,result,nextEntry.value,i,self),i++}},Iterator.prototype.concat=function(){return Iterator.concat(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.dropWhile=function(callback){var stopValue,nextEntry,self=Iterator(this),thisp=arguments[1],stopped=!1,i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;for(;!0!==(nextEntry=self.next()).done;){if(!callback.call(thisp,nextEntry.value,i,self)){stopped=!0,stopValue=nextEntry.value;break}i++}return stopped?self.constructor([stopValue]).concat(self):self.constructor([])},Iterator.prototype.takeWhile=function(callback){var self=Iterator(this),thisp=arguments[1],i=0;if("[object Function]"!=shimObject.prototype.toString.call(callback))throw new TypeError;return new self.constructor((function(){if(!0!==self._iterationObject.done){var value=self.next().value;callback.call(thisp,value,i++,self)?self._iterationObject.value=value:(self._iterationObject.done=!0,self._iterationObject.value=void 0)}return self._iterationObject}))},Iterator.prototype.zipIterator=function(){return Iterator.unzip(Array.prototype.concat.apply(this,arguments))},Iterator.prototype.enumerateIterator=function(start){return Iterator.count(start).zipIterator(this)},Iterator.iterate=function(iterable){var start;return start=0,new Iterator((function(){if("object"==typeof iterable)for(;!(start in iterable);){if(start>=iterable.length){this._iterationObject.done=!0,this._iterationObject.value=void 0;break}start+=1}else start>=iterable.length&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);return this._iterationObject.done||(this._iterationObject.value=iterable[start],start+=1),this._iterationObject}))},Iterator.cycle=function(cycle,times){var next;return arguments.length<2&&(times=1/0),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),next&&!0!==nextEntry.done||(times>0?(times--,iteration=Iterator.iterate(cycle),nextEntry=(next=iteration.next.bind(iteration))()):(this._iterationObject.done=!0,nextEntry=this._iterationObject)),nextEntry}))},Iterator.concat=function(iterators){var next;return iterators=Iterator(iterators),new Iterator((function(){var iteration,nextEntry;return next&&(nextEntry=next()),nextEntry&&!0!==nextEntry.done?nextEntry:!1===(nextEntry=iterators.next()).done?(iteration=Iterator(nextEntry.value),(next=iteration.next.bind(iteration))()):nextEntry}))},Iterator.unzip=function(iterators){return 0===(iterators=Iterator(iterators).map(Iterator)).length?new Iterator([]):new Iterator((function(){var stopped,nextEntry,result=iterators.map((function(iterator){return!0===(nextEntry=iterator.next()).done&&(stopped=!0),nextEntry.value}));return stopped?(this._iterationObject.done=!0,this._iterationObject.value=void 0):this._iterationObject.value=result,this._iterationObject}))},Iterator.zip=function(){return Iterator.unzip(Array.prototype.slice.call(arguments))},Iterator.chain=function(){return Iterator.concat(Array.prototype.slice.call(arguments))},Iterator.range=function(start,stop,step){return arguments.length<3&&(step=1),arguments.length<2&&(stop=start,start=0),start=start||0,step=step||1,new Iterator((function(){start>=stop&&(this._iterationObject.done=!0,this._iterationObject.value=void 0);var result=start;return start+=step,this._iterationObject.value=result,this._iterationObject}))},Iterator.count=function(start,step){return Iterator.range(start,1/0,step)},Iterator.repeat=function(value,times){return new Iterator.range(times).mapIterator((function(){return value}))};var genericMap=GenericMap;function GenericMap(){throw new Error("Can't construct. GenericMap is a mixin.")}function Item(key,value){this.key=key,this.value=value}GenericMap.prototype.isMap=!0,GenericMap.prototype.addEach=function(values){var i;if(values&&shimObject(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);else shimObject.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},GenericMap.prototype.get=function(key,defaultValue){var item=this.store.get(new this.Item(key));return item?item.value:arguments.length>1?(console.log("Use of a second argument as default value is deprecated to match standards"),defaultValue):this.getDefault(key)},GenericMap.prototype.set=function(key,value){var item=new this.Item(key,value),found=this.store.get(item);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found.value),found.value=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.store.add(item)&&this.length++,this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},GenericMap.prototype.add=function(value,key){return this.set(key,value)},GenericMap.prototype.has=function(key){return this.store.has(new this.Item(key))},GenericMap.prototype.delete=function(key){var item=new this.Item(key);if(this.store.has(item)){var from=this.store.get(item).value;return this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,from),this.store.delete(item),this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0}return!1},GenericMap.prototype.clear=function(){var keys,key;if(this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),this.store.clear(),this.length=0,this.dispatchesMapChanges)for(var i=0;key=keys[i];i++)this.dispatchMapChange(key)},GenericMap.prototype.reduce=function(callback,basis,thisp){return this.store.reduce((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.reduceRight=function(callback,basis,thisp){return this.store.reduceRight((function(basis,item){return callback.call(thisp,basis,item.value,item.key,this)}),basis,this)},GenericMap.prototype.keysArray=function(){return this.map((function(value,key){return key}))},GenericMap.prototype.keys=function(){return new iterator(this.keysArray(),!0)},GenericMap.prototype.valuesArray=function(){return this.map(Function.identity)},GenericMap.prototype.values=function(){return new iterator(this.valuesArray(),!0)},GenericMap.prototype.entriesArray=function(){return this.map((function(value,key){return[key,value]}))},GenericMap.prototype.entries=function(){return new iterator(this.entriesArray(),!0)},GenericMap.prototype.items=function(){return this.entriesArray()},GenericMap.prototype.equals=function(that,equals){return equals=equals||shimObject.equals,this===that||(that&&"function"==typeof that.every?that.length===this.length&&that.every((function(value,key){return equals(this.get(key),value)}),this):shimObject.keys(that).length===this.length&&shimObject.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))},GenericMap.prototype.toJSON=function(){return this.entriesArray()},GenericMap.prototype.Item=Item,Item.prototype.equals=function(that){return shimObject.equals(this.key,that.key)&&shimObject.equals(this.value,that.value)},Item.prototype.compare=function(that){return shimObject.compare(this.key,that.key)};var _dict=Dict;function Dict(values,getDefault){if(!(this instanceof Dict))return new Dict(values,getDefault);getDefault=getDefault||Function.noop,this.getDefault=getDefault,this.store=Object.create(null),this.length=0,this.addEach(values)}Dict.Dict=Dict,Object.addEach(Dict.prototype,genericCollection.prototype),Object.addEach(Dict.prototype,genericMap.prototype),Dict.from=genericCollection.from,Dict.prototype.constructClone=function(values){return new this.constructor(values,this.getDefault)},Dict.prototype.assertString=function(key){if("string"!=typeof key)throw new TypeError("key must be a string but Got "+key)},Object.defineProperty(Dict.prototype,"$__proto__",{writable:!0}),Object.defineProperty(Dict.prototype,"_hasProto",{get:function(){return this.hasOwnProperty("$__proto__")&&void 0!==this._protoValue}}),Object.defineProperty(Dict.prototype,"_protoValue",{get:function(){return this.$__proto__},set:function(value){this.$__proto__=value}}),Object.defineProperty(Dict.prototype,"size",genericCollection._sizePropertyDescriptor),Dict.prototype.get=function(key,defaultValue){return this.assertString(key),"__proto__"===key?this._hasProto?this._protoValue:arguments.length>1?defaultValue:this.getDefault(key):key in this.store?this.store[key]:arguments.length>1?defaultValue:this.getDefault(key)},Dict.prototype.set=function(key,value){this.assertString(key);var isProtoKey="__proto__"===key;return(isProtoKey?this._hasProto:key in this.store)?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,isProtoKey?this._protoValue:this.store[key]),isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!1):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),this.length++,isProtoKey?this._protoValue=value:this.store[key]=value,this.dispatchesMapChanges&&this.dispatchMapChange(key,value),!0)},Dict.prototype.has=function(key){return this.assertString(key),"__proto__"===key?this._hasProto:key in this.store},Dict.prototype.delete=function(key){return this.assertString(key),"__proto__"===key?!!this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this._protoValue),this._protoValue=void 0,this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0):key in this.store&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.length--,this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)},Dict.prototype.clear=function(){var key;for(key in this._hasProto&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange("__proto__",this._protoValue),this._protoValue=void 0,this.dispatchesMapChanges&&this.dispatchMapChange("__proto__",void 0)),this.store)this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.store[key]),delete this.store[key],this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0);this.length=0},Dict.prototype.reduce=function(callback,basis,thisp){this._hasProto&&(basis=callback.call(thisp,basis,"$__proto__","__proto__",this));var store=this.store;for(var key in this.store)basis=callback.call(thisp,basis,store[key],key,this);return basis},Dict.prototype.reduceRight=function(callback,basis,thisp){var self=this,store=this.store;return basis=Object.keys(this.store).reduceRight((function(basis,key){return callback.call(thisp,basis,store[key],key,self)}),basis),this._hasProto?callback.call(thisp,basis,this._protoValue,"__proto__",self):basis},Dict.prototype.one=function(){var key;for(key in this.store)return this.store[key];return this._protoValue},Dict.prototype.toJSON=function(){return this.toObject()};var treeLog=TreeLog;function TreeLog(){}TreeLog.ascii={intersection:"+",through:"-",branchUp:"+",branchDown:"+",fromBelow:".",fromAbove:"'",fromBoth:"+",strafe:"|"},TreeLog.unicodeRound={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"╭",fromAbove:"╰",fromBoth:"┣",strafe:"┃"},TreeLog.unicodeSharp={intersection:"╋",through:"━",branchUp:"┻",branchDown:"┳",fromBelow:"┏",fromAbove:"┗",fromBoth:"┣",strafe:"┃"};var _fastSet=FastSet;function FastSet(values,equals,hash,getDefault){if(!(this instanceof FastSet))return new FastSet(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault;var self=this;this.buckets=new this.Buckets(null,(function(){return new self.Bucket})),this.length=0,this.addEach(values)}FastSet.FastSet=FastSet,Object.addEach(FastSet.prototype,genericCollection.prototype),Object.addEach(FastSet.prototype,genericSet.prototype),FastSet.from=genericCollection.from,FastSet.prototype.Buckets=_dict,FastSet.prototype.Bucket=_list,FastSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},FastSet.prototype.has=function(value){var hash=this.contentHash(value);return this.buckets.get(hash).has(value)},FastSet.prototype.get=function(value,equals){if(equals)throw new Error("FastSet#get does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)?buckets.get(hash).get(value):this.getDefault(value)},FastSet.prototype.delete=function(value,equals){if(equals)throw new Error("FastSet#delete does not support second argument: equals");var hash=this.contentHash(value),buckets=this.buckets;if(buckets.has(hash)){var bucket=buckets.get(hash);if(bucket.delete(value))return this.length--,0===bucket.length&&buckets.delete(hash),!0}return!1},FastSet.prototype.clear=function(){this.buckets.clear(),this.length=0},FastSet.prototype.add=function(value){var hash=this.contentHash(value),buckets=this.buckets;return buckets.has(hash)||buckets.set(hash,new this.Bucket(null,this.contentEquals)),!buckets.get(hash).has(value)&&(buckets.get(hash).add(value),this.length++,!0)},FastSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],buckets=this.buckets,index=0;return buckets.reduce((function(basis,bucket){return bucket.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)}),basis,this)},FastSet.prototype.one=function(){if(this.length>0)return this.buckets.one().one()},FastSet.prototype.iterate=function(){return this.buckets.valuesArray().flatten().iterate()},FastSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeSharp,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp);for(var hash,branch,leader,bucket,buckets=this.buckets,bucketsSize=buckets.size,mapIter=buckets.keys(),index=0;hash=mapIter.next().value;)index===bucketsSize-1?(branch=charmap.fromAbove,leader=" "):0===index?(branch=charmap.branchDown,leader=charmap.strafe):(branch=charmap.fromBoth,leader=charmap.strafe),bucket=buckets.get(hash),callback.call(thisp,branch+charmap.through+charmap.branchDown+" "+hash),bucket.forEach((function(value,node){var branch,below,written;node===bucket.head.prev?(branch=charmap.fromAbove,below=" "):(branch=charmap.fromBoth,below=charmap.strafe),logNode(node,(function(line){written?callback.call(thisp,leader+" "+below+"  "+line):(callback.call(thisp,leader+" "+branch+charmap.through+charmap.through+line),written=!0)}),(function(line){callback.call(thisp,leader+" "+charmap.strafe+"  "+line)}))})),index++},FastSet.prototype.logNode=function(node,write){var value=node.value;Object(value)===value?JSON.stringify(value,null,4).split("\n").forEach((function(line){write(" "+line)})):write(" "+value)};var _set=createCommonjsModule((function(module){var GlobalSet,CollectionsSet;void 0!==commonjsGlobal.Set&&"function"==typeof commonjsGlobal.Set.prototype.values&&((GlobalSet=module.exports=commonjsGlobal.Set).Set=GlobalSet,GlobalSet.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value){basis=callback.call(thisp,basis,value,this)})),basis},GlobalSet.prototype.reduceRight=function(callback,basis){for(var value,thisp=arguments[2],setIterator=this.values(),size=this.size,reverseOrder=new Array(this.size),i=size;value=setIterator.next().value;)reverseOrder[--i]=value;for(;i<size;)basis=callback.call(thisp,basis,reverseOrder[i++],this);return basis},GlobalSet.prototype.equals=function(that,equals){var self=this;return that&&"function"==typeof that.reduce&&this.size===(that.size||that.length)&&that.reduce((function(equal,value){return equal&&self.has(value,equals)}),!0)},GlobalSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},GlobalSet.prototype.toJSON=function(){return this.entriesArray()},GlobalSet.prototype.one=function(){if(this.size>0)return this.values().next().value},GlobalSet.prototype.pop=function(){if(this.size){for(var aValue,value,setIterator=this.values();aValue=setIterator.next().value;)value=aValue;return this.delete(value,this.size-1),value}},GlobalSet.prototype.shift=function(){if(this.size){var firstValue=this.values().next().value;return this.delete(firstValue,0),firstValue}},Object.defineProperty(GlobalSet.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0}),GlobalSet.from=function(value){var result=new this;return result.addEach(value),result},Object.addEach(GlobalSet.prototype,genericCollection.prototype,!1),Object.addEach(GlobalSet.prototype,genericSet.prototype,!1)),(CollectionsSet=function CollectionsSet(values,equals,hash,getDefault){return CollectionsSet._init(CollectionsSet,this,values,equals,hash,getDefault)})._init=function(constructor,object,values,equals,hash,getDefault){if(!(object instanceof constructor))return new constructor(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,object.contentEquals=equals,object.contentHash=hash,object.getDefault=getDefault,object.order=new object.Order(void 0,equals),object.store=new object.Store(void 0,(function(a,b){return equals(a.value,b.value)}),(function(node){return hash(node.value)})),object.length=0,object.addEach(values)},CollectionsSet.Set=CollectionsSet,CollectionsSet.CollectionsSet=CollectionsSet,Object.addEach(CollectionsSet.prototype,genericCollection.prototype),Object.addEach(CollectionsSet.prototype,genericSet.prototype),CollectionsSet.from=genericCollection.from,Object.defineProperty(CollectionsSet.prototype,"size",genericCollection._sizePropertyDescriptor),CollectionsSet.prototype.Order=_list,CollectionsSet.prototype.Store=_fastSet,CollectionsSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},CollectionsSet.prototype.has=function(value){var node=new this.order.Node(value);return this.store.has(node)},CollectionsSet.prototype.get=function(value,equals){if(equals)throw new Error("Set#get does not support second argument: equals");var node=new this.order.Node(value);return(node=this.store.get(node))?node.value:this.getDefault(value)},CollectionsSet.prototype.add=function(value){var node=new this.order.Node(value);if(!this.store.has(node)){this.length;return this.order.add(value),node=this.order.head.prev,this.store.add(node),this.length++,!0}return!1},CollectionsSet.prototype.delete=function(value,equals){if(equals)throw new Error("Set#delete does not support second argument: equals");var node=new this.order.Node(value);return!!this.store.has(node)&&(node=this.store.get(node),this.store.delete(node),this.order.splice(node,1),this.length--,!0)},CollectionsSet.prototype.pop=function(){if(this.length){var result=this.order.head.prev.value;return this.delete(result),result}},CollectionsSet.prototype.shift=function(){if(this.length){var result=this.order.head.next.value;return this.delete(result),result}},CollectionsSet.prototype.one=function(){if(this.length>0)return this.store.one().value},CollectionsSet.prototype.clear=function(){this.store.clear(),this.order.clear(),this.length=0},Object.defineProperty(CollectionsSet.prototype,"_clear",{value:CollectionsSet.prototype.clear}),CollectionsSet.prototype.reduce=function(callback,basis){var thisp=arguments[2],list=this.order,index=0;return list.reduce((function(basis,value){return callback.call(thisp,basis,value,index++,this)}),basis,this)},CollectionsSet.prototype.reduceRight=function(callback,basis){var thisp=arguments[2],list=this.order,index=this.length-1;return list.reduceRight((function(basis,value){return callback.call(thisp,basis,value,index--,this)}),basis,this)},CollectionsSet.prototype.iterate=function(){return this.order.iterate()},CollectionsSet.prototype.values=function(){return new iterator(this.valuesArray(),!0)},CollectionsSet.prototype.log=function(){var set=this.store;return set.log.apply(set,arguments)},GlobalSet?(GlobalSet.prototype.valuesArray=genericSet.prototype.valuesArray,GlobalSet.prototype.entriesArray=genericSet.prototype.entriesArray,module.exports=GlobalSet,GlobalSet.CollectionsSet=CollectionsSet):module.exports=CollectionsSet})),_map=createCommonjsModule((function(module){var Map,GlobalMap,CollectionsMap;if(void 0!==commonjsGlobal.Map&&"function"==typeof commonjsGlobal.Set.prototype.values){var map_makeObservable;GlobalMap=Map=module.exports=commonjsGlobal.Map,Map.Map=Map,map_makeObservable={}.__proto__===Object.prototype?function(){this.__proto__=ChangeDispatchMap}:function(){Object.defineProperties(this,observableSetProperties)},Object.defineProperty(Map.prototype,"makeObservable",{value:map_makeObservable,writable:!0,configurable:!0,enumerable:!1}),Object.defineProperty(Map.prototype,"makePropertyObservable",{value:function(){},writable:!0,configurable:!0,enumerable:!1}),Map.prototype.constructClone=function(values){return new this.constructor(values)},Map.prototype.isMap=!0,Map.prototype.addEach=function(values){if(values&&Object(values)===values)if("function"==typeof values.forEach)!0===values.isMap?values.forEach((function(value,key){this.set(key,value)}),this):values.forEach((function(pair){this.set(pair[0],pair[1])}),this);else if("number"==typeof values.length)for(var i=0;i<values.length;i++)this.add(values[i],i);else Object.keys(values).forEach((function(key){this.set(key,values[key])}),this);else if(values&&"number"==typeof values.length)for(i=0;i<values.length;i++)this.add(values[i],i);return this},Map.prototype.add=function(value,key){return this.set(key,value)},Map.prototype.reduce=function(callback,basis){var thisp=arguments[2];return this.forEach((function(value,key,map){basis=callback.call(thisp,basis,value,key,this)})),basis},Map.prototype.reduceRight=function(callback,basis){for(var aKey,thisp=arguments[2],keysIterator=this.keys(),size=this.size,reverseOrder=new Array(this.size),i=0;aKey=keysIterator.next().value;)reverseOrder[--size]=aKey;for(;i++<size;)basis=callback.call(thisp,basis,this.get(reverseOrder[i]),reverseOrder[i],this);return basis},Map.prototype.equals=function(that,equals){return equals=equals||Object.equals,this===that||(that&&"function"==typeof that.every?that.size===this.size&&that.every((function(value,key){return equals(this.get(key),value)}),this):Object.keys(that).length===this.size&&Object.keys(that).every((function(key){return equals(this.get(key),that[key])}),this))};var _keysArrayFunction=function(value,key){return key};Map.prototype.keysArray=function(){return this.map(_keysArrayFunction)};var _valuesArrayFunction=function(value,key){return value};Map.prototype.valuesArray=function(){return this.map(_valuesArrayFunction)};var _entriesArrayFunction=function(value,key){return[key,value]};Map.prototype.entriesArray=function(){return this.map(_entriesArrayFunction)},Map.prototype.toJSON=function(){return this.entriesArray()},Map.prototype.items=function(){return this.entriesArray()},Map.from=function(value){var result=new this;return result.addEach(value),result},Object.defineProperty(Map.prototype,"length",{get:function(){return this.size},enumerable:!0,configurable:!0});var map_clear=Map.prototype.clear,map_set=Map.prototype.set,map_delete=Map.prototype.delete,observableMapProperties={clear:{value:function(){var keys;this.dispatchesMapChanges&&(this.forEach((function(value,key){this.dispatchBeforeMapChange(key,value)}),this),keys=this.keysArray()),map_clear.call(this),this.dispatchesMapChanges&&keys.forEach((function(key){this.dispatchMapChange(key)}),this)},writable:!0,configurable:!0},set:{value:function(key,value){var found=this.get(key);return found?(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,found),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)):(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,void 0),map_set.call(this,key,value),this.dispatchesMapChanges&&this.dispatchMapChange(key,value)),this},writable:!0,configurable:!0},delete:{value:function(key){return!!this.has(key)&&(this.dispatchesMapChanges&&this.dispatchBeforeMapChange(key,this.get(key)),map_delete.call(this,key),this.dispatchesMapChanges&&this.dispatchMapChange(key,void 0),!0)}}};Object.addEach(Map.prototype,genericCollection.prototype,!1);var ChangeDispatchMap=Object.create(Map.prototype,observableMapProperties)}var Set=_set.CollectionsSet;CollectionsMap=Map=function Map(values,equals,hash,getDefault){if(!(this instanceof Map))return new Map(values,equals,hash,getDefault);equals=equals||Object.equals,hash=hash||Object.hash,getDefault=getDefault||Function.noop,this.contentEquals=equals,this.contentHash=hash,this.getDefault=getDefault,this.store=new Set(void 0,(function(a,b){return equals(a.key,b.key)}),(function(item){return hash(item.key)})),this.length=0,this.addEach(values)},Map.Map=Map,Object.addEach(Map.prototype,genericCollection.prototype),Object.addEach(Map.prototype,genericMap.prototype),Object.defineProperty(Map.prototype,"size",genericCollection._sizePropertyDescriptor),Map.from=genericCollection.from,Map.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentHash,this.getDefault)},Map.prototype.log=function(charmap,logNode,callback,thisp){logNode=logNode||this.logNode,this.store.log(charmap,(function(node,log,logBefore){logNode(node.value.value,log,logBefore)}),callback,thisp)},Map.prototype.logNode=function(node,log){log(" key: "+node.key),log(" value: "+node.value)},GlobalMap?(module.exports=GlobalMap,GlobalMap.CollectionsMap=CollectionsMap):module.exports=CollectionsMap})),changeDescriptor=createCommonjsModule((function(module){var ObjectChangeDescriptor=module.exports.ObjectChangeDescriptor=function(name){return this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null,this};Object.defineProperties(ObjectChangeDescriptor.prototype,{name:{value:null,writable:!0},isActive:{value:!1,writable:!0},_willChangeListeners:{value:null,writable:!0},willChangeListeners:{get:function(){return this._willChangeListeners||(this._willChangeListeners=new this.willChangeListenersRecordConstructor(this.name))}},_changeListeners:{value:null,writable:!0},changeListeners:{get:function(){return this._changeListeners||(this._changeListeners=new this.changeListenersRecordConstructor(this.name))}},changeListenersRecordConstructor:{value:ChangeListenersRecord,writable:!0},willChangeListenersRecordConstructor:{value:WillChangeListenersRecord,writable:!0}});var ListenerGhost=module.exports.ListenerGhost=Object.create(null),ChangeListenerSpecificHandlerMethodName=new _map;function ChangeListenersRecord(name){var specificHandlerMethodName=ChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="Change",ChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this._current=null,this._current=null,this.specificHandlerMethodName=specificHandlerMethodName,this}module.exports.ChangeListenersRecord=ChangeListenersRecord,Object.defineProperties(ChangeListenersRecord.prototype,{_current:{value:null,writable:!0},current:{get:function(){return this._current},set:function(value){this._current=value}},ListenerGhost:{value:ListenerGhost,writable:!0},ghostCount:{value:0,writable:!0},maxListenerGhostRatio:{value:.3,writable:!0},listenerGhostFilter:{value:function(value){return value!==this.ListenerGhost}},removeCurrentGostListenersIfNeeded:{value:function(){return this._current&&this.ghostCount/this._current.length>this.maxListenerGhostRatio&&(this.ghostCount=0,this._current=this._current.filter(this.listenerGhostFilter,this)),this._current}},dispatchBeforeChange:{value:!1,writable:!0},genericHandlerMethodName:{value:"handlePropertyChange",writable:!0}}),module.exports.WillChangeListenersRecord=WillChangeListenersRecord;var WillChangeListenerSpecificHandlerMethodName=new _map;function WillChangeListenersRecord(name){var specificHandlerMethodName=WillChangeListenerSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name,specificHandlerMethodName+="WillChange",WillChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}WillChangeListenersRecord.prototype=new ChangeListenersRecord,WillChangeListenersRecord.prototype.constructor=WillChangeListenersRecord,WillChangeListenersRecord.prototype.genericHandlerMethodName="handlePropertyWillChange"})),propertyChanges=(changeDescriptor.ObjectChangeDescriptor,changeDescriptor.ListenerGhost,changeDescriptor.ChangeListenersRecord,changeDescriptor.WillChangeListenersRecord,PropertyChanges);function PropertyChanges(){throw new Error("This is an abstract interface. Mix it. Don't construct it")}var ObjectChangeDescriptor=changeDescriptor.ObjectChangeDescriptor,ListenerGhost=changeDescriptor.ListenerGhost;PropertyChanges.debug=!0;var ObjectsPropertyChangeListeners=new weakMap$1,ObjectChangeDescriptorName=new _map;function dispatchEach(listeners,key,value,object){if(listeners&&listeners._current){var current,listener,i,countI,thisp,specificHandlerMethodName=listeners.specificHandlerMethodName,genericHandlerMethodName=listeners.genericHandlerMethodName,Ghost=ListenerGhost;if(Array.isArray(listeners._current)){for(i=0,countI=(current=listeners.removeCurrentGostListenersIfNeeded()).length;i<countI;i++)if((thisp=current[i])!==Ghost){if(!(listener=thisp[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}else{if(!(listener=(thisp=listeners._current)[specificHandlerMethodName]||thisp[genericHandlerMethodName]||thisp).call)throw new Error("No event listener for "+listeners.specificHandlerName+" or "+listeners.genericHandlerName+" or call on "+listener);listener.call(thisp,value,key,object)}}}PropertyChanges.ObjectChangeDescriptor=function(){},PropertyChanges.prototype.getOwnPropertyChangeDescriptor=function(key){var keyChangeDescriptor,objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);if(objectPropertyChangeDescriptors||(objectPropertyChangeDescriptors=Object.create(null),ObjectsPropertyChangeListeners.set(this,objectPropertyChangeDescriptors)),void 0===(keyChangeDescriptor=objectPropertyChangeDescriptors[key])){var propertyName=ObjectChangeDescriptorName.get(key);return propertyName||(propertyName=(propertyName=String(key))&&propertyName[0].toUpperCase()+propertyName.slice(1),ObjectChangeDescriptorName.set(key,propertyName)),objectPropertyChangeDescriptors[key]=new ObjectChangeDescriptor(propertyName)}return keyChangeDescriptor},PropertyChanges.prototype.hasOwnPropertyChangeDescriptor=function(key){var objectPropertyChangeDescriptors=ObjectsPropertyChangeListeners.get(this);return!!objectPropertyChangeDescriptors&&(!key||void 0!==objectPropertyChangeDescriptors[key])},PropertyChanges.prototype.addOwnPropertyChangeListener=function(key,listener,beforeChange){this.makeObservable&&!this.isObservable&&this.makeObservable();var descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key),listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners;PropertyChanges.makePropertyObservable(this,key),listeners._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener;var self=this;return function(){PropertyChanges.removeOwnPropertyChangeListener(self,key,listener,beforeChange),self=null}},PropertyChanges.prototype.addBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.addOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.removeOwnPropertyChangeListener=function removeOwnPropertyChangeListener(key,listener,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove property change listener: does not exist: property name"+JSON.stringify(key));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=removeOwnPropertyChangeListener.ListenerGhost):listeners._current.spliceOne(index)}},PropertyChanges.prototype.removeOwnPropertyChangeListener.ListenerGhost=ListenerGhost,PropertyChanges.prototype.removeBeforeOwnPropertyChangeListener=function(key,listener){return PropertyChanges.removeOwnPropertyChangeListener(this,key,listener,!0)},PropertyChanges.prototype.dispatchOwnPropertyChange=function dispatchOwnPropertyChange(key,value,beforeChange){var listeners,descriptor=PropertyChanges.getOwnPropertyChangeDescriptor(this,key);if(!descriptor.isActive){descriptor.isActive=!0,listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners;try{dispatchOwnPropertyChange.dispatchEach(listeners,key,value,this)}finally{descriptor.isActive=!1}}},PropertyChanges.prototype.dispatchOwnPropertyChange.dispatchEach=dispatchEach,dispatchEach.ListenerGhost=ListenerGhost,PropertyChanges.prototype.dispatchBeforeOwnPropertyChange=function(key,listener){return PropertyChanges.dispatchOwnPropertyChange(this,key,listener,!0)};var ObjectsOverriddenPropertyDescriptors=new weakMap$1,propertyListener=(new weakMap$1,{get:void 0,set:void 0,configurable:!0,enumerable:!1});PropertyChanges.prototype.makePropertyObservable=function(key){var overriddenPropertyDescriptors=ObjectsOverriddenPropertyDescriptors.get(this);if(!overriddenPropertyDescriptors||void 0===overriddenPropertyDescriptors.get(key)){if(!overriddenPropertyDescriptors){if(Array.isArray(this))return;if(!Object.isExtensible(this))throw new Error("Can't make property "+JSON.stringify(key)+" observable on "+this+" because object is not extensible");overriddenPropertyDescriptors=new _map,ObjectsOverriddenPropertyDescriptors.set(this,overriddenPropertyDescriptors)}var overriddenDescriptor,attached=this;do{if(overriddenDescriptor=Object.getOwnPropertyDescriptor(attached,key))break;attached=Object.getPrototypeOf(attached)}while(attached);if(overriddenDescriptor){if(!overriddenDescriptor.configurable)return;if(!overriddenDescriptor.writable&&!overriddenDescriptor.set)return}else overriddenDescriptor={value:void 0,enumerable:!0,writable:!0,configurable:!0};overriddenPropertyDescriptors.set(key,overriddenDescriptor),"value"in overriddenDescriptor?(propertyListener.get=function dispatchingGetter(){return dispatchingGetter.overriddenDescriptor.value},propertyListener.set=function dispatchingSetter(value){var descriptor,isActive,overriddenDescriptor=dispatchingSetter.overriddenDescriptor;if(value!==overriddenDescriptor.value){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,dispatchingSetter.key,overriddenDescriptor.value,this)}finally{}}if(overriddenDescriptor.value=value,!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,dispatchingSetter.key,value,this)}finally{descriptor.isActive=!1}}},propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.key=key,propertyListener.get.overriddenDescriptor=propertyListener.set.overriddenDescriptor=overriddenDescriptor,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key],propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0):(propertyListener.get=overriddenDescriptor.get,propertyListener.set=function dispatchingSetter(){var descriptor,isActive,newValue,formerValue=dispatchingSetter.overriddenGetter.call(this);if(1===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0]):2===arguments.length?dispatchingSetter.overriddenSetter.call(this,arguments[0],arguments[1]):dispatchingSetter.overriddenSetter.apply(this,arguments),(newValue=dispatchingSetter.overriddenGetter.call(this))!==formerValue){if(!(isActive=(descriptor=dispatchingSetter.descriptor).isActive)){descriptor.isActive=!0;try{dispatchingSetter.dispatchEach(descriptor._willChangeListeners,key,formerValue,this)}finally{}}if(!isActive)try{dispatchingSetter.dispatchEach(descriptor._changeListeners,key,newValue,this)}finally{descriptor.isActive=!1}}},propertyListener.enumerable=overriddenDescriptor.enumerable,propertyListener.configurable=!0,propertyListener.set.dispatchEach=dispatchEach,propertyListener.set.overriddenSetter=overriddenDescriptor.set,propertyListener.set.overriddenGetter=overriddenDescriptor.get,propertyListener.set.descriptor=ObjectsPropertyChangeListeners.get(this)[key]),Object.defineProperty(this,key,propertyListener)}},PropertyChanges.getOwnPropertyChangeDescriptor=function(object,key){return object.getOwnPropertyChangeDescriptor?object.getOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.getOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.hasOwnPropertyChangeDescriptor=function(object,key){return object.hasOwnPropertyChangeDescriptor?object.hasOwnPropertyChangeDescriptor(key):PropertyChanges.prototype.hasOwnPropertyChangeDescriptor.call(object,key)},PropertyChanges.addOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.addOwnPropertyChangeListener?object.addOwnPropertyChangeListener(key,listener,beforeChange):this.prototype.addOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.removeOwnPropertyChangeListener=function(object,key,listener,beforeChange){if(Object.isObject(object))return object.removeOwnPropertyChangeListener?object.removeOwnPropertyChangeListener(key,listener,beforeChange):PropertyChanges.prototype.removeOwnPropertyChangeListener.call(object,key,listener,beforeChange)},PropertyChanges.dispatchOwnPropertyChange=function(object,key,value,beforeChange){if(Object.isObject(object))return object.dispatchOwnPropertyChange?object.dispatchOwnPropertyChange(key,value,beforeChange):PropertyChanges.prototype.dispatchOwnPropertyChange.call(object,key,value,beforeChange)},PropertyChanges.addBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.addOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.removeBeforeOwnPropertyChangeListener=function(object,key,listener){return PropertyChanges.removeOwnPropertyChangeListener(object,key,listener,!0)},PropertyChanges.dispatchBeforeOwnPropertyChange=function(object,key,value){return PropertyChanges.dispatchOwnPropertyChange(object,key,value,!0)},PropertyChanges.makePropertyObservable=function(object,key){return object.makePropertyObservable?object.makePropertyObservable(key):PropertyChanges.prototype.makePropertyObservable.call(object,key)};var ObjectChangeDescriptor$1=changeDescriptor.ObjectChangeDescriptor,ChangeListenersRecord=changeDescriptor.ChangeListenersRecord,ListenerGhost$1=changeDescriptor.ListenerGhost,rangeChangeDescriptors=new weakMap$1;function RangeChangeDescriptor(name){this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null}RangeChangeDescriptor.prototype=new ObjectChangeDescriptor$1,RangeChangeDescriptor.prototype.constructor=RangeChangeDescriptor,RangeChangeDescriptor.prototype.changeListenersRecordConstructor=RangeChangeListenersRecord,RangeChangeDescriptor.prototype.willChangeListenersRecordConstructor=RangeWillChangeListenersRecord,Object.defineProperty(RangeChangeDescriptor.prototype,"active",{get:function(){return this._active||(this._active=this._current?this._current.slice():[])}});var RangeChangeListenersSpecificHandlerMethodName=new _map;function RangeChangeListenersRecord(name){var specificHandlerMethodName=RangeChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeChange",RangeChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeChangeListenersRecord.prototype=new ChangeListenersRecord,RangeChangeListenersRecord.prototype.constructor=RangeChangeListenersRecord;var RangeWillChangeListenersSpecificHandlerMethodName=new _map;function RangeWillChangeListenersRecord(name){var specificHandlerMethodName=RangeWillChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="RangeWillChange",RangeWillChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}RangeWillChangeListenersRecord.prototype=new ChangeListenersRecord,RangeWillChangeListenersRecord.prototype.constructor=RangeWillChangeListenersRecord;var rangeChanges=RangeChanges;function RangeChanges(){throw new Error("Can't construct. RangeChanges is a mixin.")}RangeChanges.prototype.getAllRangeChangeDescriptors=function(){return rangeChangeDescriptors.has(this)||rangeChangeDescriptors.set(this,new _map),rangeChangeDescriptors.get(this)},RangeChanges.prototype.getRangeChangeDescriptor=function(token){var tokenChangeDescriptors=this.getAllRangeChangeDescriptors();return token=token||"",tokenChangeDescriptors.has(token)||tokenChangeDescriptors.set(token,new RangeChangeDescriptor(token)),tokenChangeDescriptors.get(token)};var ObjectsDispatchesRangeChanges=new weakMap$1,dispatchesChangesPropertyDescriptor={get:function(){return ObjectsDispatchesRangeChanges.get(this)},set:function(value){return ObjectsDispatchesRangeChanges.set(this,value)},configurable:!0,enumerable:!1};RangeChanges.prototype.addRangeChangeListener=function(listener,token,beforeChange){!this.isObservable&&this.makeObservable&&this.makeObservable();var listeners,descriptor=this.getRangeChangeDescriptor(token);(listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener,void 0===Object.getOwnPropertyDescriptor(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges")&&Object.defineProperty(this.__proto__||Object.getPrototypeOf(this),"dispatchesRangeChanges",dispatchesChangesPropertyDescriptor),this.dispatchesRangeChanges=!0;var self=this;return function(){self&&(self.removeRangeChangeListener(listener,token,beforeChange),self=null)}},RangeChanges.prototype.removeRangeChangeListener=function(listener,token,beforeChange){var listeners,descriptor=this.getRangeChangeDescriptor(token);if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove range change listener: does not exist: token "+JSON.stringify(token));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=ListenerGhost$1):listeners._current.spliceOne(index)}},RangeChanges.prototype.dispatchRangeChange=function(plus,minus,index,beforeChange){var descriptor,listeners,tokenName,i,countI,listener,currentListeners,Ghost,descriptors=this.getAllRangeChangeDescriptors(),mapIter=descriptors.values();for(descriptors.dispatchBeforeChange=beforeChange;descriptor=mapIter.next().value;){if(descriptor.isActive)return;if((listeners=beforeChange?descriptor._willChangeListeners:descriptor._changeListeners)&&listeners._current)if(tokenName=listeners.specificHandlerMethodName,Array.isArray(listeners._current)){if(listeners._current.length){descriptor.isActive=!0;try{for(currentListeners=listeners.removeCurrentGostListenersIfNeeded(),Ghost=ListenerGhost$1,i=0,countI=currentListeners.length;i<countI;i++)if((listener=currentListeners[i])!==Ghost)if(listener[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}else{descriptor.isActive=!0;try{if((listener=listeners._current)[tokenName])listener[tokenName](plus,minus,index,this,beforeChange);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(this,plus,minus,index,this,beforeChange)}}finally{descriptor.isActive=!1}}}},RangeChanges.prototype.addBeforeRangeChangeListener=function(listener,token){return this.addRangeChangeListener(listener,token,!0)},RangeChanges.prototype.removeBeforeRangeChangeListener=function(listener,token){return this.removeRangeChangeListener(listener,token,!0)},RangeChanges.prototype.dispatchBeforeRangeChange=function(plus,minus,index){return this.dispatchRangeChange(plus,minus,index,!0)};var sortedSet=SortedSet;function SortedSet(values,equals,compare,getDefault){if(!(this instanceof SortedSet))return new SortedSet(values,equals,compare,getDefault);this.contentEquals=equals||Object.equals,this.contentCompare=compare||Object.compare,this.getDefault=getDefault||Function.noop,this.root=null,this.length=0,this.addEach(values)}function Node$1(value){this.value=value,this.left=null,this.right=null,this.length=1}function Iterator$1(set,start,end){if(this.set=set,this.prev=null,this.end=end,start){var next=this.set.findLeastGreaterThanOrEqual(start);next&&(this.set.splay(next.value),this.prev=next.getPrevious())}}SortedSet.SortedSet=SortedSet,Object.addEach(SortedSet.prototype,genericCollection.prototype),Object.addEach(SortedSet.prototype,genericSet.prototype),Object.addEach(SortedSet.prototype,propertyChanges.prototype),Object.addEach(SortedSet.prototype,rangeChanges.prototype),Object.defineProperty(SortedSet.prototype,"size",genericCollection._sizePropertyDescriptor),SortedSet.from=genericCollection.from,SortedSet.prototype.isSorted=!0,SortedSet.prototype.constructClone=function(values){return new this.constructor(values,this.contentEquals,this.contentCompare,this.getDefault)},SortedSet.prototype.has=function(value,equals){if(equals)throw new Error("SortedSet#has does not support second argument: equals");return!!this.root&&(this.splay(value),this.contentEquals(value,this.root.value))},SortedSet.prototype.get=function(value,equals){if(equals)throw new Error("SortedSet#get does not support second argument: equals");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.value:this.getDefault(value)},SortedSet.prototype.add=function(value){var node=new this.Node(value);if(!this.root)return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],0),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],0),!0;if(this.splay(value),!this.contentEquals(value,this.root.value)){var comparison=this.contentCompare(value,this.root.value);if(0===comparison)throw new Error("SortedSet cannot contain incomparable but inequal values: "+value+" and "+this.root.value);return this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([value],[],this.root.index),comparison<0?(node.right=this.root,node.left=this.root.left,this.root.left=null,this.root.touch()):(node.left=this.root,node.right=this.root.right,this.root.right=null,this.root.touch()),node.touch(),this.root=node,this.length++,this.dispatchesRangeChanges&&this.dispatchRangeChange([value],[],this.root.index),!0}return!1},SortedSet.prototype.delete=function(value,equals){if(equals)throw new Error("SortedSet#delete does not support second argument: equals");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value))){var index=this.root.index;if(this.dispatchesRangeChanges&&this.dispatchBeforeRangeChange([],[value],index),this.root.left){var right=this.root.right;this.root=this.root.left,this.splay(value),this.root.right=right}else this.root=this.root.right;return this.length--,this.root&&this.root.touch(),this.dispatchesRangeChanges&&this.dispatchRangeChange([],[value],index),!0}return!1},SortedSet.prototype.indexOf=function(value,index){if(index)throw new Error("SortedSet#indexOf does not support second argument: startIndex");return this.root&&(this.splay(value),this.contentEquals(value,this.root.value))?this.root.index:-1},SortedSet.prototype.find=function(value,equals,index){if(equals)throw new Error("SortedSet#find does not support second argument: equals");if(index)throw new Error("SortedSet#find does not support third argument: index");if(this.root&&(this.splay(value),this.contentEquals(value,this.root.value)))return this.root},SortedSet.prototype.findGreatest=function(at){if(this.root){for(at=at||this.root;at.right;)at=at.right;return at}},SortedSet.prototype.findLeast=function(at){if(this.root){for(at=at||this.root;at.left;)at=at.left;return at}},SortedSet.prototype.findGreatestLessThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>0?this.root.getPrevious():this.root},SortedSet.prototype.findGreatestLessThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root.getPrevious():this.root},SortedSet.prototype.findLeastGreaterThanOrEqual=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)>=0?this.root:this.root.getNext()},SortedSet.prototype.findLeastGreaterThan=function(value){if(this.root)return this.splay(value),this.contentCompare(this.root.value,value)<=0?this.root.getNext():this.root},SortedSet.prototype.pop=function(){if(this.root){var found=this.findGreatest();return this.delete(found.value),found.value}},SortedSet.prototype.shift=function(){if(this.root){var found=this.findLeast();return this.delete(found.value),found.value}},SortedSet.prototype.push=function(){this.addEach(arguments)},SortedSet.prototype.unshift=function(){this.addEach(arguments)},SortedSet.prototype.slice=function(start,end){start=start||0,end=end||this.length,start<0&&(start+=this.length),end<0&&(end+=this.length);var sliced=[];if(this.root)for(this.splayIndex(start);this.root.index<end&&(sliced.push(this.root.value),this.root.right);)this.splay(this.root.getNext().value);return sliced},SortedSet.prototype.splice=function(at,length){return this.swap(at,length,Array.prototype.slice.call(arguments,2))},SortedSet.prototype.swap=function(start,length,plus){if(void 0===start&&void 0===length)return[];(start=start||0)<0&&(start+=this.length),void 0===length&&(length=1/0);var swapped=[];if(this.root){this.splayIndex(start);for(var i=0;i<length;i++){swapped.push(this.root.value);var next=this.root.getNext();if(this.delete(this.root.value),!next)break;this.splay(next.value)}}return this.addEach(plus),swapped},SortedSet.prototype.splay=function(value){var stub,left,right,temp,root,history;if(this.root){for(stub=left=right=new this.Node,history=new this.Node,root=this.root;;){var comparison=this.contentCompare(value,root.value);if(comparison<0){if(!root.left)break;if(this.contentCompare(value,root.left.value)<0&&(temp=root.left,root.left=temp.right,root.touch(),temp.right=root,temp.touch(),!(root=temp).left))break;(temp=new Node$1).right=root,temp.left=history.left,history.left=temp,right.left=root,right.touch(),right=root,root=root.left}else{if(!(comparison>0))break;if(!root.right)break;if(this.contentCompare(value,root.right.value)>0&&(temp=root.right,root.right=temp.left,root.touch(),temp.left=root,temp.touch(),!(root=temp).right))break;(temp=new Node$1).left=root,temp.right=history.right,history.right=temp,left.right=root,left.touch(),left=root,root=root.right}}for(left.right=root.left,left.touch(),right.left=root.right,right.touch(),root.left=stub.right,root.right=stub.left;history.left;)history.left.right.touch(),history.left=history.left.left;for(;history.right;)history.right.left.touch(),history.right=history.right.right;root.touch(),this.root=root}},SortedSet.prototype.splayIndex=function(index){if(this.root){for(var at=this.root,atIndex=this.root.index;atIndex!==index;)if(atIndex>index&&at.left)atIndex-=1+((at=at.left).right?at.right.length:0);else{if(!(atIndex<index&&at.right))break;atIndex+=1+((at=at.right).left?at.left.length:0)}return this.splay(at.value),this.root.index===index}return!1},SortedSet.prototype.reduce=function(callback,basis,thisp){return this.root&&(basis=this.root.reduce(callback,basis,0,thisp,this)),basis},SortedSet.prototype.reduceRight=function(callback,basis,thisp){return this.root&&(basis=this.root.reduceRight(callback,basis,this.length-1,thisp,this)),basis},SortedSet.prototype.min=function(at){var least=this.findLeast(at);if(least)return least.value},SortedSet.prototype.max=function(at){var greatest=this.findGreatest(at);if(greatest)return greatest.value},SortedSet.prototype.one=function(){return this.min()},SortedSet.prototype.clear=function(){var minus;this.dispatchesRangeChanges&&(minus=this.toArray(),this.dispatchBeforeRangeChange([],minus,0)),this.root=null,this.length=0,this.dispatchesRangeChanges&&this.dispatchRangeChange([],minus,0)},SortedSet.prototype.iterate=function(start,end){return new this.Iterator(this,start,end)},SortedSet.prototype.Iterator=Iterator$1,SortedSet.prototype.summary=function(){return this.root?this.root.summary():"()"},SortedSet.prototype.log=function(charmap,logNode,callback,thisp){charmap=charmap||treeLog.unicodeRound,logNode=logNode||this.logNode,callback||(callback=console.log,thisp=console),callback=callback.bind(thisp),this.root&&this.root.log(charmap,logNode,callback,callback)},SortedSet.prototype.logNode=function(node,log,logBefore){log(" "+node.value)},SortedSet.logCharsets=treeLog,SortedSet.prototype.Node=Node$1,Node$1.prototype.reduce=function(callback,basis,index,thisp,tree,depth){if(depth=depth||0,this.left){var length=this.left.length;basis=this.left.reduce(callback,basis,index,thisp,tree,depth+1),index+=length}return basis=callback.call(thisp,basis,this.value,index,tree,this,depth),index+=1,this.right&&(basis=this.right.reduce(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.reduceRight=function(callback,basis,index,thisp,tree,depth){return depth=depth||0,this.right&&(basis=this.right.reduceRight(callback,basis,index,thisp,tree,depth+1),index-=this.right.length),basis=callback.call(thisp,basis,this.value,this.value,tree,this,depth),index-=1,this.left&&(basis=this.left.reduceRight(callback,basis,index,thisp,tree,depth+1)),basis},Node$1.prototype.touch=function(){this.length=1+(this.left?this.left.length:0)+(this.right?this.right.length:0),this.index=this.left?this.left.length:0},Node$1.prototype.checkIntegrity=function(){var length=1;if(length+=this.left?this.left.checkIntegrity():0,length+=this.right?this.right.checkIntegrity():0,this.length!==length)throw new Error("Integrity check failed: "+this.summary());return length},Node$1.prototype.getNext=function(){var node=this;if(node.right){for(node=node.right;node.left;)node=node.left;return node}},Node$1.prototype.getPrevious=function(){var node=this;if(node.left){for(node=node.left;node.right;)node=node.right;return node}},Node$1.prototype.summary=function(){var value=this.value||"-";return value+=" <"+this.length,this.left||this.right?"("+value+" "+(this.left?this.left.summary():"()")+", "+(this.right?this.right.summary():"()")+")":"("+value+")"},Node$1.prototype.log=function(charmap,logNode,log,logAbove){var branch,loggedAbove,loggedOn,loggedBelow,self=this;branch=this.left&&this.right?charmap.intersection:this.left?charmap.branchUp:this.right?charmap.branchDown:charmap.through,this.left&&this.left.log(charmap,logNode,(function(line){loggedAbove?logAbove(charmap.strafe+" "+line):(loggedAbove=!0,logAbove(charmap.fromBelow+charmap.through+line))}),(function(line){logAbove("  "+line)})),logNode(this,(function(line){loggedOn?log((self.right?charmap.strafe:" ")+line):(loggedOn=!0,log(branch+line))}),(function(line){logAbove((self.left?charmap.strafe:" ")+line)})),this.right&&this.right.log(charmap,logNode,(function(line){loggedBelow?log("  "+line):(loggedBelow=!0,log(charmap.fromAbove+charmap.through+line))}),(function(line){log(charmap.strafe+" "+line)}))},Iterator$1.prototype.__iterationObject=null,Object.defineProperty(Iterator$1.prototype,"_iterationObject",{get:function(){return this.__iterationObject||(this.__iterationObject={done:!1,value:null})}}),Iterator$1.prototype.next=function(){var next;return(next=this.prev?this.set.findLeastGreaterThan(this.prev.value):this.set.findLeast())?void 0!==this.end&&this.set.contentCompare(next.value,this.end)>=0?(this._iterationObject.done=!0,this._iterationObject.value=void 0):(this.prev=next,this._iterationObject.value=next.value):(this._iterationObject.done=!0,this._iterationObject.value=void 0),this._iterationObject};var util={radians:function(degrees){return degrees/(180/Math.PI)},degrees:function(radians){return radians*(180/Math.PI)},REarth:6371,WGS84:{a:6378.137,b:6356.752314245,f:1/298.257223563},consoleColors:{bright:"",dim:"",underscore:"",blink:"",reverse:"",hidden:"",fg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""},bg:{black:"",red:"",green:"",yellow:"",blue:"",magenta:"",cyan:"",white:"",crimson:""},reset:""}};var vincentys={inverse:function(p1,p2){const φ1=util.radians(p1.y),λ1=util.radians(p1.x),φ2=util.radians(p2.y),λ2=util.radians(p2.x),{a:a,b:b,f:f}=util.WGS84,L=λ2-λ1,tanU1=(1-f)*Math.tan(φ1),cosU1=1/Math.sqrt(1+tanU1*tanU1),sinU1=tanU1*cosU1,tanU2=(1-f)*Math.tan(φ2),cosU2=1/Math.sqrt(1+tanU2*tanU2),sinU2=tanU2*cosU2,antipodal=Math.abs(L)>Math.PI/2||Math.abs(φ2-φ1)>Math.PI/2;let λ=L,sinλ=null,cosλ=null,σ=antipodal?Math.PI:0,sinσ=0,cosσ=antipodal?-1:1,sinSqσ=null,cos2σₘ=1,sinα=null,cosSqα=1,C=null,λʹ=null,iterations=0;do{if(sinλ=Math.sin(λ),cosλ=Math.cos(λ),sinSqσ=cosU2*sinλ*(cosU2*sinλ)+(cosU1*sinU2-sinU1*cosU2*cosλ)*(cosU1*sinU2-sinU1*cosU2*cosλ),Math.abs(sinSqσ)<Number.EPSILON)break;sinσ=Math.sqrt(sinSqσ),cosσ=sinU1*sinU2+cosU1*cosU2*cosλ,σ=Math.atan2(sinσ,cosσ),sinα=cosU1*cosU2*sinλ/sinσ,cosSqα=1-sinα*sinα,cos2σₘ=0!=cosSqα?cosσ-2*sinU1*sinU2/cosSqα:0,C=f/16*cosSqα*(4+f*(4-3*cosSqα)),λʹ=λ,λ=L+(1-C)*f*sinα*(σ+C*sinσ*(cos2σₘ+C*cosσ*(2*cos2σₘ*cos2σₘ-1)));if((antipodal?Math.abs(λ)-Math.PI:Math.abs(λ))>Math.PI)throw new EvalError("λ > π")}while(Math.abs(λ-λʹ)>1e-7&&++iterations<1e3);if(iterations>=1e3)throw new EvalError("Vincenty formula failed to converge");const uSq=cosSqα*(a*a-b*b)/(b*b),B=uSq/1024*(256+uSq*(uSq*(74-47*uSq)-128)),s=b*(1+uSq/16384*(4096+uSq*(uSq*(320-175*uSq)-768)))*(σ-B*sinσ*(cos2σₘ+B/4*(cosσ*(2*cos2σₘ*cos2σₘ-1)-B/6*cos2σₘ*(4*sinσ*sinσ-3)*(4*cos2σₘ*cos2σₘ-3)))),α1=Math.abs(sinSqσ)<Number.EPSILON?0:Math.atan2(cosU2*sinλ,cosU1*sinU2-sinU1*cosU2*cosλ),α2=Math.abs(sinSqσ)<Number.EPSILON?Math.PI:Math.atan2(cosU1*sinλ,-sinU1*cosU2+cosU1*sinU2*cosλ);return{distance:s,initialBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α1),finalBearing:Math.abs(s)<Number.EPSILON?NaN:util.degrees(α2),iterations:iterations}}};class Point{constructor(x,y){Array.isArray(x)?[this.x,this.y,this.r]=[x[y].longitude,x[y].latitude,y]:[this.x,this.y]=[x,y]}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Point",coordinates:[this.x,this.y]}}}toString(){return JSON.stringify(this.geojson())}intersects(other){if(other instanceof Point)return this.x==other.x&&this.y==other.y;if(other instanceof Box)return other.intersects(this);throw"other must be either Point or Box"}distanceEarth(p){return this.distanceEarthFCC(p)}distanceEarthFCC(p){const df=p.y-this.y,dg=p.x-this.x,fm=util.radians((this.y+p.y)/2),k1=111.13209-.566605*Math.cos(2*fm)+.0012*Math.cos(4*fm),k2=111.41513*Math.cos(fm)-.09455*Math.cos(3*fm)+12e-5*Math.cos(5*fm);return Math.sqrt(k1*df*(k1*df)+k2*dg*(k2*dg))}distanceEarthRev(dx,dy){const lon=this.x+util.degrees(dx/util.REarth/Math.cos(util.radians(this.y))),lat=this.y+util.degrees(dy/util.REarth);return new Point(lon,lat)}distanceEarthVincentys(p){return vincentys.inverse(this,p).distance}}class Range{constructor(a,b){[this.a,this.b]=[a,b]}count(){return Math.abs(this.a-this.b)+1}center(){return Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2)}left(){return new Range(Math.min(this.a,this.b),Math.min(this.a,this.b)+Math.floor(Math.abs(this.a-this.b)/2))}right(){return new Range(Math.min(this.a,this.b)+Math.ceil(Math.abs(this.a-this.b)/2),Math.max(this.a,this.b))}contains(p){return this.a<=p&&p<=this.b}toString(){return`${this.a}:${this.b}`}}class Box{constructor(a,b,c,d){if(a instanceof Range){[this.x1,this.y1,this.x2,this.y2]=[1/0,1/0,-1/0,-1/0];for(let i=a.a;i<=a.b;i++)this.x1=Math.min(b.flightPoints[i].x,this.x1),this.y1=Math.min(b.flightPoints[i].y,this.y1),this.x2=Math.max(b.flightPoints[i].x,this.x2),this.y2=Math.max(b.flightPoints[i].y,this.y2)}else[this.x1,this.y1,this.x2,this.y2]=[a,b,c,d]}vertices(){return[new Point(this.x1,this.y1),new Point(this.x2,this.y1),new Point(this.x2,this.y2),new Point(this.x1,this.y2)]}intersects(other){return other instanceof Point?this.x1<=other.x&&this.y1<=other.y&&this.x2>=other.x&&this.y2>=other.y:!(this.x1>other.x2||this.x2<other.x1||this.y1>other.y2||this.y2<other.y1)}area(){return Math.abs(this.x2-this.x1)*Math.abs(this.y2-this.y1)}distance(other){if(this.intersects(other))return 0;let x1,y1,x2,y2;return this.x1>other.x2&&(x1=this.x1),x2=other.x2,this.x2<other.x1&&(x1=this.x2),x2=other.x1,this.y1<other.y2&&(y1=this.y1),y2=other.y2,this.y2>other.y1&&(y1=this.y2),y2=other.y1,void 0===x1&&(x1=this.x1,x2=this.x1),void 0===y1&&(y1=this.y1,y2=this.y1),new Point(x1,y1).distanceEarth(new Point(x2,y2))}geojson(id,properties){return{type:"Feature",id:id,properties:properties||{},geometry:{type:"Polygon",coordinates:[[[this.x1,this.y1],[this.x1,this.y2],[this.x2,this.y2],[this.x2,this.y1],[this.x1,this.y1]]]}}}geojson_collection(boxes){let features=[];for(let b in boxes)features.push(boxes[b].geojson(b,{id:b}));return{type:"FeatureCollection",features:features}}toString(){return JSON.stringify(this.geojson())}}var foundation={Point:Point,Range:Range,Box:Box};let id=0;const{Box:Box$1,Point:Point$1,Range:Range$1}=foundation;class Solution{constructor(ranges,opt,parent){ranges.length>opt.scoring.cardinality?this.ranges=ranges.slice(0,opt.scoring.cardinality):this.ranges=ranges,this.opt=opt;for(let _r in this.ranges){const r=parseInt(_r);if(r>0&&this.ranges[r-1].a>this.ranges[r].a&&(this.ranges[r]=new Range$1(Math.max(this.ranges[r-1].a,this.ranges[r].a),this.ranges[r].b)),r<this.ranges.length-1&&this.ranges[r].b>this.ranges[r+1].b&&(this.ranges[r]=new Range$1(this.ranges[r].a,Math.min(this.ranges[r+1].b,this.ranges[r].b))),this.ranges[r].a>this.ranges[r].b)throw console.log(this.ranges,parent.ranges),"error"}this.boxes=[];for(let r in this.ranges)this.boxes[r]=new Box$1(this.ranges[r],opt.flight);this.score=void 0,this.bound=void 0,this.id=id++,this.opt.config&&this.opt.config.debug&&(this.parent=parent,this.trace())}do_branch(){let div=0;for(let r in this.ranges)this.ranges[r].count()>this.ranges[div].count()&&(div=parseInt(r));for(let r in this.ranges)this.ranges[r].count()>1&&this.boxes[r].area()>8*this.boxes[div].area()&&(div=parseInt(r));if(1==this.ranges[div].count())return[];let subsolutions=[];for(let i of[this.ranges[div].left(),this.ranges[div].right()]){let subranges=[];for(let r in this.ranges)subranges[r]=r!=div?this.ranges[r]:i;subsolutions.push(new Solution(subranges,this.opt,this))}return subsolutions}do_bound(){this.bound=this.opt.scoring.bound(this.ranges,this.boxes,this.opt),this.trace()}do_score(){for(let r in this.ranges)if(r<this.ranges.length-1&&this.ranges[r].center()>=this.ranges[parseInt(r)+1].center())return void(this.score=0);let tp=[];for(let r in this.ranges)tp[r]=new Point$1(this.opt.flight.filtered,this.ranges[r].center());this.scoreInfo=this.opt.scoring.score(tp,this.opt),this.score=this.scoreInfo.score,this.trace()}contentEquals(self,other){return self.id===other.id}contentCompare(self,other){return self.bound<other.bound?-1:self.bound>other.bound?1:self.id<other.id?-1:self.id>other.id?1:0}geojson(){let features=[];if(this.opt.config&&this.opt.config.debug)for(let r in this.ranges)features.push(new Box$1(this.ranges[r],this.opt.flight).geojson("box"+r,{id:"box"+r,area:new Box$1(this.ranges[r],this.opt.flight).area(),a:this.ranges[r].a,b:this.ranges[r].b}));try{const tp=this.scoreInfo.tp;for(let r of[0,1,2])features.push(tp[r].geojson("tp"+r,{id:"tp"+r,r:tp[r].r,timestamp:this.opt.flight.filtered[tp[r].r].timestamp})),(r<2||this.scoreInfo.cp)&&features.push({type:"Feature",id:"seg"+r,properties:{id:"seg"+r,stroke:"yellow","stroke-width":4,d:tp[r].distanceEarth(tp[(r+1)%3])},geometry:{type:"LineString",coordinates:[[tp[r].x,tp[r].y],[tp[(r+1)%3].x,tp[(r+1)%3].y]],style:{stroke:"yellow","stroke-width":4}}})}catch(e){}try{if(void 0!==this.scoreInfo.ep||void 0!==this.scoreInfo.cp){const cp=this.scoreInfo.cp,tp=this.scoreInfo.tp,ep=this.scoreInfo.ep;if(cp&&cp.in&&cp.out){for(let r of["in","out"])features.push(cp[r].geojson("cp_"+r,{id:"cp_"+r,r:cp[r].r,timestamp:this.opt.flight.filtered[cp[r].r].timestamp}));features.push({type:"Feature",id:"closing",properties:{id:"closing",stroke:"green","stroke-width":3,d:cp.in.distanceEarth(cp.out)},geometry:{type:"LineString",coordinates:[[cp.in.x,cp.in.y],[cp.out.x,cp.out.y]],style:{stroke:"green","stroke-width":3}}})}if(ep&&ep.start&&ep.finish){for(let r of["start","finish"])features.push(ep[r].geojson("ep_"+r,{id:"ep_"+r,r:ep[r].r,timestamp:this.opt.flight.filtered[ep[r].r].timestamp}));features.push({type:"Feature",id:"seg_in",properties:{id:"seg_in",stroke:"gold","stroke-width":3,d:ep.start.distanceEarth(tp[0])},geometry:{type:"LineString",coordinates:[[ep.start.x,ep.start.y],[tp[0].x,tp[0].y]],style:{stroke:"green","stroke-width":3}}}),features.push({type:"Feature",id:"seg_out",properties:{id:"seg_out",stroke:"gold","stroke-width":3,d:ep.finish.distanceEarth(tp[2])},geometry:{type:"LineString",coordinates:[[tp[2].x,tp[2].y],[ep.finish.x,ep.finish.y]],style:{stroke:"green","stroke-width":3}}})}}}catch(e){}for(let li in this.opt.flight.ll){const l=this.opt.flight.ll[li];features.push(this.opt.flight.flightPoints[l.launch].geojson("launch"+li,{id:"launch"+li,r:l.launch,timestamp:this.opt.flight.filtered[l.launch].timestamp})),features.push(this.opt.flight.flightPoints[l.landing].geojson("land"+li,{id:"land"+li,r:l.landing,timestamp:this.opt.flight.filtered[l.landing].timestamp}))}if(!this.opt.config||!this.opt.config.noflight){let flightData=[];for(let r of this.opt.flight.filtered)flightData.push([r.longitude,r.latitude]);features.push({type:"Feature",id:"flight",properties:{id:"flight"},geometry:{type:"LineString",coordinates:flightData}})}return{type:"FeatureCollection",properties:{name:"EPSG:3857",id:this.id,score:void 0!==this.score?this.score:void 0,bound:void 0!==this.currentUpperBound?this.currentUpperBound:this.bound,optimal:this.optimal,processedTime:this.time/1e3,processedSolutions:this.processed,type:this.opt.scoring.name,code:this.opt.scoring.code},features:features}}toString(){let s=""+this.opt.scoring.name;if(this.score&&(s+=` ${this.opt.scoring.rounding(this.score)} points`),this.scoreInfo&&(s+=` ${this.opt.scoring.rounding(this.scoreInfo.distance)}km`),s+=` ( <${this.bound.toFixed(4)} )`,this.opt.config&&this.opt.config.debug){s+=` { id: ${this.id} `;for(let r of this.ranges)s+=" "+r.toString();s+=" } "}return s}trace(msg){if(!this.opt.config.trace||!process.stdout)return;const trace=this.opt.config.trace.split(",");if(trace[0]<0){if(this.id%parseInt(trace[1])!=0)return}else for(let i in this.ranges)if(!this.ranges[i].contains(trace[i]))return;let r=`${msg||""} solution tracing: ${this.id} ${this.opt.scoring.name} `;for(let i in this.ranges)r+=this.ranges[i]+" ";this.bound&&(r+=`bound: ${this.bound} `),this.score&&(r+=`score: ${this.score} `),process.stdout.write("\n"+r+"\n"),this.opt.config.env.fs.writeFileSync(`debug-${this.id}.json`,JSON.stringify(this.geojson({debug:!0})))}}var solution_Solution=Solution,ObjectChangeDescriptor$2=changeDescriptor.ObjectChangeDescriptor,ChangeListenersRecord$1=changeDescriptor.ChangeListenersRecord,ListenerGhost$2=changeDescriptor.ListenerGhost,mapChanges=MapChanges;function MapChanges(){throw new Error("Can't construct. MapChanges is a mixin.")}var mapChangeDescriptors=new weakMap$1;function MapChangeDescriptor(name){this.name=name,this.isActive=!1,this._willChangeListeners=null,this._changeListeners=null}MapChangeDescriptor.prototype=new ObjectChangeDescriptor$2,MapChangeDescriptor.prototype.constructor=MapChangeDescriptor,MapChangeDescriptor.prototype.changeListenersRecordConstructor=MapChangeListenersRecord,MapChangeDescriptor.prototype.willChangeListenersRecordConstructor=MapWillChangeListenersRecord;var MapChangeListenersSpecificHandlerMethodName=new _map;function MapChangeListenersRecord(name){var specificHandlerMethodName=MapChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="MapChange",MapChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}MapChangeListenersRecord.prototype=new ChangeListenersRecord$1,MapChangeListenersRecord.prototype.constructor=MapChangeListenersRecord,MapChangeListenersRecord.prototype.genericHandlerMethodName="handleMapChange";var MapWillChangeListenersSpecificHandlerMethodName=new _map;function MapWillChangeListenersRecord(name){var specificHandlerMethodName=MapWillChangeListenersSpecificHandlerMethodName.get(name);return specificHandlerMethodName||(specificHandlerMethodName="handle",specificHandlerMethodName+=name.slice(0,1).toUpperCase(),specificHandlerMethodName+=name.slice(1),specificHandlerMethodName+="MapWillChange",MapWillChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName)),this.specificHandlerMethodName=specificHandlerMethodName,this}MapWillChangeListenersRecord.prototype=new ChangeListenersRecord$1,MapWillChangeListenersRecord.prototype.constructor=MapWillChangeListenersRecord,MapWillChangeListenersRecord.prototype.genericHandlerMethodName="handleMapWillChange",MapChanges.prototype.getAllMapChangeDescriptors=function(){return mapChangeDescriptors.has(this)||mapChangeDescriptors.set(this,new _map),mapChangeDescriptors.get(this)},MapChanges.prototype.getMapChangeDescriptor=function(token){var tokenChangeDescriptors=this.getAllMapChangeDescriptors();return token=token||"",tokenChangeDescriptors.has(token)||tokenChangeDescriptors.set(token,new MapChangeDescriptor(token)),tokenChangeDescriptors.get(token)};var ObjectsDispatchesMapChanges=new weakMap$1,dispatchesChangesPropertyDescriptor$1={get:function(){return ObjectsDispatchesMapChanges.get(this)},set:function(value){return ObjectsDispatchesMapChanges.set(this,value)},configurable:!0,enumerable:!1};MapChanges.prototype.addMapChangeListener=function(listener,token,beforeChange){!this.isObservable&&this.makeObservable&&this.makeObservable();var listeners,descriptor=this.getMapChangeDescriptor(token);(listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current?Array.isArray(listeners._current)?listeners._current.push(listener):listeners._current=[listeners._current,listener]:listeners._current=listener,void 0===Object.getOwnPropertyDescriptor(this.__proto__||Object.getPrototypeOf(this),"dispatchesMapChanges")&&Object.defineProperty(this.__proto__||Object.getPrototypeOf(this),"dispatchesMapChanges",dispatchesChangesPropertyDescriptor$1),this.dispatchesMapChanges=!0;var self=this;return function(){self&&(self.removeMapChangeListener(listener,token,beforeChange),self=null)}},MapChanges.prototype.removeMapChangeListener=function(listener,token,beforeChange){var listeners,descriptor=this.getMapChangeDescriptor(token);if((listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners)._current)if(listeners._current===listener)listeners._current=null;else{var index=listeners._current.lastIndexOf(listener);if(-1===index)throw new Error("Can't remove map change listener: does not exist: token "+JSON.stringify(token));descriptor.isActive?(listeners.ghostCount=listeners.ghostCount+1,listeners._current[index]=ListenerGhost$2):listeners._current.spliceOne(index)}},MapChanges.prototype.dispatchMapChange=function(key,value,beforeChange){var descriptors=this.getAllMapChangeDescriptors(),Ghost=ListenerGhost$2;descriptors.forEach((function(descriptor,token){if(!descriptor.isActive){var listeners=beforeChange?descriptor.willChangeListeners:descriptor.changeListeners;if(listeners&&listeners._current){var tokenName=listeners.specificHandlerMethodName;if(Array.isArray(listeners._current)){if(listeners._current.length){var i,countI,listener,currentListeners=listeners.removeCurrentGostListenersIfNeeded();descriptor.isActive=!0;try{for(i=0,countI=currentListeners.length;i<countI;i++)if((listener=currentListeners[i])!==Ghost)if(listener[tokenName])listener[tokenName](value,key,this);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(listener,value,key,this)}}finally{descriptor.isActive=!1}}}else{descriptor.isActive=!0;try{if((listener=listeners._current)[tokenName])listener[tokenName](value,key,this);else{if(!listener.call)throw new Error("Handler "+listener+" has no method "+tokenName+" and is not callable");listener.call(listener,value,key,this)}}finally{descriptor.isActive=!1}}}}}),this)},MapChanges.prototype.addBeforeMapChangeListener=function(listener,token){return this.addMapChangeListener(listener,token,!0)},MapChanges.prototype.removeBeforeMapChangeListener=function(listener,token){return this.removeMapChangeListener(listener,token,!0)},MapChanges.prototype.dispatchBeforeMapChange=function(key,value){return this.dispatchMapChange(key,value,!0)};var map=_map;void 0===commonjsGlobal.Map||"function"!=typeof commonjsGlobal.Set.prototype.values?(Object.addEach(_map.prototype,propertyChanges.prototype),Object.addEach(_map.prototype,mapChanges.prototype)):(Object.defineEach(_map.prototype,propertyChanges.prototype,!1,!0,!1,!0),Object.defineEach(_map.prototype,mapChanges.prototype,!1,!0,!1,!0));class FlatQueue{constructor(){this.ids=[],this.values=[],this.length=0}clear(){this.length=0}push(id,value){let pos=this.length++;for(this.ids[pos]=id,this.values[pos]=value;pos>0;){const parent=pos-1>>1,parentValue=this.values[parent];if(value>=parentValue)break;this.ids[pos]=this.ids[parent],this.values[pos]=parentValue,pos=parent}this.ids[pos]=id,this.values[pos]=value}pop(){if(0===this.length)return;const top=this.ids[0];if(this.length--,this.length>0){const id=this.ids[0]=this.ids[this.length],value=this.values[0]=this.values[this.length],halfLength=this.length>>1;let pos=0;for(;pos<halfLength;){let left=1+(pos<<1);const right=left+1;let bestIndex=this.ids[left],bestValue=this.values[left];const rightValue=this.values[right];if(right<this.length&&rightValue<bestValue&&(left=right,bestIndex=this.ids[right],bestValue=rightValue),bestValue>=value)break;this.ids[pos]=bestIndex,this.values[pos]=bestValue,pos=left}this.ids[pos]=id,this.values[pos]=value}return top}peek(){return this.ids[0]}peekValue(){return this.values[0]}}const ARRAY_TYPES=[Int8Array,Uint8Array,Uint8ClampedArray,Int16Array,Uint16Array,Int32Array,Uint32Array,Float32Array,Float64Array];class Flatbush{static from(data){if(!(data instanceof ArrayBuffer))throw new Error("Data must be an instance of ArrayBuffer.");const[magic,versionAndType]=new Uint8Array(data,0,2);if(251!==magic)throw new Error("Data does not appear to be in a Flatbush format.");if(versionAndType>>4!=3)throw new Error(`Got v${versionAndType>>4} data when expected v3.`);const[nodeSize]=new Uint16Array(data,2,1),[numItems]=new Uint32Array(data,4,1);return new Flatbush(numItems,nodeSize,ARRAY_TYPES[15&versionAndType],data)}constructor(numItems,nodeSize=16,ArrayType=Float64Array,data){if(void 0===numItems)throw new Error("Missing required argument: numItems.");if(isNaN(numItems)||numItems<=0)throw new Error(`Unpexpected numItems value: ${numItems}.`);this.numItems=+numItems,this.nodeSize=Math.min(Math.max(+nodeSize,2),65535);let n=numItems,numNodes=n;this._levelBounds=[4*n];do{n=Math.ceil(n/this.nodeSize),numNodes+=n,this._levelBounds.push(4*numNodes)}while(1!==n);this.ArrayType=ArrayType||Float64Array,this.IndexArrayType=numNodes<16384?Uint16Array:Uint32Array;const arrayTypeIndex=ARRAY_TYPES.indexOf(this.ArrayType),nodesByteSize=4*numNodes*this.ArrayType.BYTES_PER_ELEMENT;if(arrayTypeIndex<0)throw new Error(`Unexpected typed array class: ${ArrayType}.`);data&&data instanceof ArrayBuffer?(this.data=data,this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=4*numNodes,this.minX=this._boxes[this._pos-4],this.minY=this._boxes[this._pos-3],this.maxX=this._boxes[this._pos-2],this.maxY=this._boxes[this._pos-1]):(this.data=new ArrayBuffer(8+nodesByteSize+numNodes*this.IndexArrayType.BYTES_PER_ELEMENT),this._boxes=new this.ArrayType(this.data,8,4*numNodes),this._indices=new this.IndexArrayType(this.data,8+nodesByteSize,numNodes),this._pos=0,this.minX=1/0,this.minY=1/0,this.maxX=-1/0,this.maxY=-1/0,new Uint8Array(this.data,0,2).set([251,48+arrayTypeIndex]),new Uint16Array(this.data,2,1)[0]=nodeSize,new Uint32Array(this.data,4,1)[0]=numItems),this._queue=new FlatQueue}add(minX,minY,maxX,maxY){const index=this._pos>>2;return this._indices[index]=index,this._boxes[this._pos++]=minX,this._boxes[this._pos++]=minY,this._boxes[this._pos++]=maxX,this._boxes[this._pos++]=maxY,minX<this.minX&&(this.minX=minX),minY<this.minY&&(this.minY=minY),maxX>this.maxX&&(this.maxX=maxX),maxY>this.maxY&&(this.maxY=maxY),index}finish(){if(this._pos>>2!==this.numItems)throw new Error(`Added ${this._pos>>2} items when expected ${this.numItems}.`);if(this.numItems<=this.nodeSize)return this._boxes[this._pos++]=this.minX,this._boxes[this._pos++]=this.minY,this._boxes[this._pos++]=this.maxX,void(this._boxes[this._pos++]=this.maxY);const width=this.maxX-this.minX,height=this.maxY-this.minY,hilbertValues=new Uint32Array(this.numItems);for(let i=0;i<this.numItems;i++){let pos=4*i;const minX=this._boxes[pos++],minY=this._boxes[pos++],maxX=this._boxes[pos++],maxY=this._boxes[pos++],x=Math.floor(65535*((minX+maxX)/2-this.minX)/width),y=Math.floor(65535*((minY+maxY)/2-this.minY)/height);hilbertValues[i]=hilbert(x,y)}!function sort(values,boxes,indices,left,right,nodeSize){if(Math.floor(left/nodeSize)>=Math.floor(right/nodeSize))return;const pivot=values[left+right>>1];let i=left-1,j=right+1;for(;;){do{i++}while(values[i]<pivot);do{j--}while(values[j]>pivot);if(i>=j)break;swap(values,boxes,indices,i,j)}sort(values,boxes,indices,left,j,nodeSize),sort(values,boxes,indices,j+1,right,nodeSize)}(hilbertValues,this._boxes,this._indices,0,this.numItems-1,this.nodeSize);for(let i=0,pos=0;i<this._levelBounds.length-1;i++){const end=this._levelBounds[i];for(;pos<end;){const nodeIndex=pos;let nodeMinX=1/0,nodeMinY=1/0,nodeMaxX=-1/0,nodeMaxY=-1/0;for(let i=0;i<this.nodeSize&&pos<end;i++)nodeMinX=Math.min(nodeMinX,this._boxes[pos++]),nodeMinY=Math.min(nodeMinY,this._boxes[pos++]),nodeMaxX=Math.max(nodeMaxX,this._boxes[pos++]),nodeMaxY=Math.max(nodeMaxY,this._boxes[pos++]);this._indices[this._pos>>2]=nodeIndex,this._boxes[this._pos++]=nodeMinX,this._boxes[this._pos++]=nodeMinY,this._boxes[this._pos++]=nodeMaxX,this._boxes[this._pos++]=nodeMaxY}}}search(minX,minY,maxX,maxY,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const queue=[],results=[];for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2];maxX<this._boxes[pos]||(maxY<this._boxes[pos+1]||minX>this._boxes[pos+2]||minY>this._boxes[pos+3]||(nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&results.push(index):queue.push(index)))}nodeIndex=queue.pop()}return results}neighbors(x,y,maxResults=1/0,maxDistance=1/0,filterFn){if(this._pos!==this._boxes.length)throw new Error("Data not yet indexed - call index.finish().");let nodeIndex=this._boxes.length-4;const q=this._queue,results=[],maxDistSquared=maxDistance*maxDistance;for(;void 0!==nodeIndex;){const end=Math.min(nodeIndex+4*this.nodeSize,upperBound(nodeIndex,this._levelBounds));for(let pos=nodeIndex;pos<end;pos+=4){const index=0|this._indices[pos>>2],dx=axisDist(x,this._boxes[pos],this._boxes[pos+2]),dy=axisDist(y,this._boxes[pos+1],this._boxes[pos+3]),dist=dx*dx+dy*dy;nodeIndex<4*this.numItems?(void 0===filterFn||filterFn(index))&&q.push(-index-1,dist):q.push(index,dist)}for(;q.length&&q.peek()<0;){if(q.peekValue()>maxDistSquared)return q.clear(),results;if(results.push(-q.pop()-1),results.length===maxResults)return q.clear(),results}nodeIndex=q.pop()}return q.clear(),results}}function axisDist(k,min,max){return k<min?min-k:k<=max?0:k-max}function upperBound(value,arr){let i=0,j=arr.length-1;for(;i<j;){const m=i+j>>1;arr[m]>value?j=m:i=m+1}return arr[i]}function swap(values,boxes,indices,i,j){const temp=values[i];values[i]=values[j],values[j]=temp;const k=4*i,m=4*j,a=boxes[k],b=boxes[k+1],c=boxes[k+2],d=boxes[k+3];boxes[k]=boxes[m],boxes[k+1]=boxes[m+1],boxes[k+2]=boxes[m+2],boxes[k+3]=boxes[m+3],boxes[m]=a,boxes[m+1]=b,boxes[m+2]=c,boxes[m+3]=d;const e=indices[i];indices[i]=indices[j],indices[j]=e}function hilbert(x,y){let a=x^y,b=65535^a,c=65535^(x|y),d=x&(65535^y),A=a|b>>1,B=a>>1^a,C=c>>1^b&d>>1^c,D=a&c>>1^d>>1^d;a=A,b=B,c=C,d=D,A=a&a>>2^b&b>>2,B=a&b>>2^b&(a^b)>>2,C^=a&c>>2^b&d>>2,D^=b&c>>2^(a^b)&d>>2,a=A,b=B,c=C,d=D,A=a&a>>4^b&b>>4,B=a&b>>4^b&(a^b)>>4,C^=a&c>>4^b&d>>4,D^=b&c>>4^(a^b)&d>>4,a=A,b=B,c=C,d=D,C^=a&c>>8^b&d>>8,D^=b&c>>8^(a^b)&d>>8,a=C^C>>1,b=D^D>>1;let i0=x^y,i1=b|65535^(i0|a);return i0=16711935&(i0|i0<<8),i0=252645135&(i0|i0<<4),i0=858993459&(i0|i0<<2),i0=1431655765&(i0|i0<<1),i1=16711935&(i1|i1<<8),i1=252645135&(i1|i1<<4),i1=858993459&(i1|i1<<2),i1=1431655765&(i1|i1<<1),(i1<<1|i0)>>>0}var flatbush=Object.freeze({__proto__:null,default:Flatbush});function quickselect(arr,k,left,right,compare){!function quickselectStep(arr,k,left,right,compare){for(;right>left;){if(right-left>600){var n=right-left+1,m=k-left+1,z=Math.log(n),s=.5*Math.exp(2*z/3),sd=.5*Math.sqrt(z*s*(n-s)/n)*(m-n/2<0?-1:1);quickselectStep(arr,k,Math.max(left,Math.floor(k-m*s/n+sd)),Math.min(right,Math.floor(k+(n-m)*s/n+sd)),compare)}var t=arr[k],i=left,j=right;for(swap$1(arr,left,k),compare(arr[right],t)>0&&swap$1(arr,left,right);i<j;){for(swap$1(arr,i,j),i++,j--;compare(arr[i],t)<0;)i++;for(;compare(arr[j],t)>0;)j--}0===compare(arr[left],t)?swap$1(arr,left,j):swap$1(arr,++j,right),j<=k&&(left=j+1),k<=j&&(right=j-1)}}(arr,k,left||0,right||arr.length-1,compare||defaultCompare)}function swap$1(arr,i,j){var tmp=arr[i];arr[i]=arr[j],arr[j]=tmp}function defaultCompare(a,b){return a<b?-1:a>b?1:0}function findItem(item,items,equalsFn){if(!equalsFn)return items.indexOf(item);for(let i=0;i<items.length;i++)if(equalsFn(item,items[i]))return i;return-1}function calcBBox(node,toBBox){distBBox(node,0,node.children.length,toBBox,node)}function distBBox(node,k,p,toBBox,destNode){destNode||(destNode=createNode(null)),destNode.minX=1/0,destNode.minY=1/0,destNode.maxX=-1/0,destNode.maxY=-1/0;for(let i=k;i<p;i++){const child=node.children[i];extend(destNode,node.leaf?toBBox(child):child)}return destNode}function extend(a,b){return a.minX=Math.min(a.minX,b.minX),a.minY=Math.min(a.minY,b.minY),a.maxX=Math.max(a.maxX,b.maxX),a.maxY=Math.max(a.maxY,b.maxY),a}function compareNodeMinX(a,b){return a.minX-b.minX}function compareNodeMinY(a,b){return a.minY-b.minY}function bboxArea(a){return(a.maxX-a.minX)*(a.maxY-a.minY)}function bboxMargin(a){return a.maxX-a.minX+(a.maxY-a.minY)}function intersectionArea(a,b){const minX=Math.max(a.minX,b.minX),minY=Math.max(a.minY,b.minY),maxX=Math.min(a.maxX,b.maxX),maxY=Math.min(a.maxY,b.maxY);return Math.max(0,maxX-minX)*Math.max(0,maxY-minY)}function contains(a,b){return a.minX<=b.minX&&a.minY<=b.minY&&b.maxX<=a.maxX&&b.maxY<=a.maxY}function intersects(a,b){return b.minX<=a.maxX&&b.minY<=a.maxY&&b.maxX>=a.minX&&b.maxY>=a.minY}function createNode(children){return{children:children,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function multiSelect(arr,left,right,n,compare){const stack=[left,right];for(;stack.length;){if((right=stack.pop())-(left=stack.pop())<=n)continue;const mid=left+Math.ceil((right-left)/n/2)*n;quickselect(arr,mid,left,right,compare),stack.push(left,mid,mid,right)}}var rbush=Object.freeze({__proto__:null,default:class{constructor(maxEntries=9){this._maxEntries=Math.max(4,maxEntries),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()}all(){return this._all(this.data,[])}search(bbox){let node=this.data;const result=[];if(!intersects(bbox,node))return result;const toBBox=this.toBBox,nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?toBBox(child):child;intersects(bbox,childBBox)&&(node.leaf?result.push(child):contains(bbox,childBBox)?this._all(child,result):nodesToSearch.push(child))}node=nodesToSearch.pop()}return result}collides(bbox){let node=this.data;if(!intersects(bbox,node))return!1;const nodesToSearch=[];for(;node;){for(let i=0;i<node.children.length;i++){const child=node.children[i],childBBox=node.leaf?this.toBBox(child):child;if(intersects(bbox,childBBox)){if(node.leaf||contains(bbox,childBBox))return!0;nodesToSearch.push(child)}}node=nodesToSearch.pop()}return!1}load(data){if(!data||!data.length)return this;if(data.length<this._minEntries){for(let i=0;i<data.length;i++)this.insert(data[i]);return this}let node=this._build(data.slice(),0,data.length-1,0);if(this.data.children.length)if(this.data.height===node.height)this._splitRoot(this.data,node);else{if(this.data.height<node.height){const tmpNode=this.data;this.data=node,node=tmpNode}this._insert(node,this.data.height-node.height-1,!0)}else this.data=node;return this}insert(item){return item&&this._insert(item,this.data.height-1),this}clear(){return this.data=createNode([]),this}remove(item,equalsFn){if(!item)return this;let node=this.data;const bbox=this.toBBox(item),path=[],indexes=[];let i,parent,goingUp;for(;node||path.length;){if(node||(node=path.pop(),parent=path[path.length-1],i=indexes.pop(),goingUp=!0),node.leaf){const index=findItem(item,node.children,equalsFn);if(-1!==index)return node.children.splice(index,1),path.push(node),this._condense(path),this}goingUp||node.leaf||!contains(node,bbox)?parent?(i++,node=parent.children[i],goingUp=!1):node=null:(path.push(node),indexes.push(i),i=0,parent=node,node=node.children[0])}return this}toBBox(item){return item}compareMinX(a,b){return a.minX-b.minX}compareMinY(a,b){return a.minY-b.minY}toJSON(){return this.data}fromJSON(data){return this.data=data,this}_all(node,result){const nodesToSearch=[];for(;node;)node.leaf?result.push(...node.children):nodesToSearch.push(...node.children),node=nodesToSearch.pop();return result}_build(items,left,right,height){const N=right-left+1;let node,M=this._maxEntries;if(N<=M)return node=createNode(items.slice(left,right+1)),calcBBox(node,this.toBBox),node;height||(height=Math.ceil(Math.log(N)/Math.log(M)),M=Math.ceil(N/Math.pow(M,height-1))),node=createNode([]),node.leaf=!1,node.height=height;const N2=Math.ceil(N/M),N1=N2*Math.ceil(Math.sqrt(M));multiSelect(items,left,right,N1,this.compareMinX);for(let i=left;i<=right;i+=N1){const right2=Math.min(i+N1-1,right);multiSelect(items,i,right2,N2,this.compareMinY);for(let j=i;j<=right2;j+=N2){const right3=Math.min(j+N2-1,right2);node.children.push(this._build(items,j,right3,height-1))}}return calcBBox(node,this.toBBox),node}_chooseSubtree(bbox,node,level,path){for(;path.push(node),!node.leaf&&path.length-1!==level;){let targetNode,minArea=1/0,minEnlargement=1/0;for(let i=0;i<node.children.length;i++){const child=node.children[i],area=bboxArea(child),enlargement=(a=bbox,b=child,(Math.max(b.maxX,a.maxX)-Math.min(b.minX,a.minX))*(Math.max(b.maxY,a.maxY)-Math.min(b.minY,a.minY))-area);enlargement<minEnlargement?(minEnlargement=enlargement,minArea=area<minArea?area:minArea,targetNode=child):enlargement===minEnlargement&&area<minArea&&(minArea=area,targetNode=child)}node=targetNode||node.children[0]}var a,b;return node}_insert(item,level,isNode){const bbox=isNode?item:this.toBBox(item),insertPath=[],node=this._chooseSubtree(bbox,this.data,level,insertPath);for(node.children.push(item),extend(node,bbox);level>=0&&insertPath[level].children.length>this._maxEntries;)this._split(insertPath,level),level--;this._adjustParentBBoxes(bbox,insertPath,level)}_split(insertPath,level){const node=insertPath[level],M=node.children.length,m=this._minEntries;this._chooseSplitAxis(node,m,M);const splitIndex=this._chooseSplitIndex(node,m,M),newNode=createNode(node.children.splice(splitIndex,node.children.length-splitIndex));newNode.height=node.height,newNode.leaf=node.leaf,calcBBox(node,this.toBBox),calcBBox(newNode,this.toBBox),level?insertPath[level-1].children.push(newNode):this._splitRoot(node,newNode)}_splitRoot(node,newNode){this.data=createNode([node,newNode]),this.data.height=node.height+1,this.data.leaf=!1,calcBBox(this.data,this.toBBox)}_chooseSplitIndex(node,m,M){let index,minOverlap=1/0,minArea=1/0;for(let i=m;i<=M-m;i++){const bbox1=distBBox(node,0,i,this.toBBox),bbox2=distBBox(node,i,M,this.toBBox),overlap=intersectionArea(bbox1,bbox2),area=bboxArea(bbox1)+bboxArea(bbox2);overlap<minOverlap?(minOverlap=overlap,index=i,minArea=area<minArea?area:minArea):overlap===minOverlap&&area<minArea&&(minArea=area,index=i)}return index||M-m}_chooseSplitAxis(node,m,M){const compareMinX=node.leaf?this.compareMinX:compareNodeMinX,compareMinY=node.leaf?this.compareMinY:compareNodeMinY;this._allDistMargin(node,m,M,compareMinX)<this._allDistMargin(node,m,M,compareMinY)&&node.children.sort(compareMinX)}_allDistMargin(node,m,M,compare){node.children.sort(compare);const toBBox=this.toBBox,leftBBox=distBBox(node,0,m,toBBox),rightBBox=distBBox(node,M-m,M,toBBox);let margin=bboxMargin(leftBBox)+bboxMargin(rightBBox);for(let i=m;i<M-m;i++){const child=node.children[i];extend(leftBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(leftBBox)}for(let i=M-m-1;i>=m;i--){const child=node.children[i];extend(rightBBox,node.leaf?toBBox(child):child),margin+=bboxMargin(rightBBox)}return margin}_adjustParentBBoxes(bbox,path,level){for(let i=level;i>=0;i--)extend(path[i],bbox)}_condense(path){for(let siblings,i=path.length-1;i>=0;i--)0===path[i].children.length?i>0?(siblings=path[i-1].children,siblings.splice(siblings.indexOf(path[i]),1)):this.clear():calcBBox(path[i],this.toBBox)}}}),_Flatbush=getCjsExportFromNamespace(flatbush),RBush$1=getCjsExportFromNamespace(rbush);const Flatbush$1=_Flatbush.default?_Flatbush.default:_Flatbush,{Box:Box$2,Point:Point$2}=foundation;var geom={maxDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let intersecting=!1;for(let i of[0,1,2])if(boxes[i].intersects(boxes[(i+1)%3])){intersecting=!0;break}let path=[[],[],[]];for(let i of[0,1,2]){for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);(0==path[i].length||intersecting)&&(path[i]=vertices[i])}let distanceMax=0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMax=Math.max(distanceMax,distance)}return distanceMax},maxDistance2Rectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[]];for(let i of[0,1])path[i]=vertices[i];let distanceMax=0;for(let i of path[0])for(let j of path[1]){const distance=i.distanceEarth(j);distanceMax=Math.max(distanceMax,distance)}return distanceMax},minDistance3Rectangles:function(boxes,distance_fn){let minx,miny,maxx,maxy,vertices=[];for(let r of[0,1,2])vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);let path=[[],[],[]];for(let i of[0,1,2])path[i]=vertices[i];let distanceMin=1/0;for(let i of path[0])for(let j of path[1])for(let k of path[2]){const distance=distance_fn(i,j,k);distanceMin=Math.min(distanceMin,distance)}return distanceMin},maxDistanceNRectangles:function(boxes){let minx,miny,maxx,maxy,vertices=[],path=[];for(let r in boxes){if(boxes[r]instanceof Box$2)vertices[r]=boxes[r].vertices(),minx=Math.min(minx||1/0,boxes[r].x1),miny=Math.min(miny||1/0,boxes[r].y1),maxx=Math.max(maxx||-1/0,boxes[r].x2),maxy=Math.max(maxy||-1/0,boxes[r].y2);else{if(!(boxes[r]instanceof Point$2))throw new TypeError("boxes must contain only Box or Point");vertices[r]=[boxes[r]],minx=Math.min(minx||1/0,boxes[r].x),miny=Math.min(miny||1/0,boxes[r].y),maxx=Math.max(maxx||-1/0,boxes[r].x),maxy=Math.max(maxy||-1/0,boxes[r].y)}path[r]=[]}for(let i in boxes)if(i>0){boxes[i-1].intersects(boxes[i])&&(boxes[i-1].intersecting=!0,boxes[i].intersecting=!0)}for(let i in boxes)if(boxes[i].intersecting)path[i]=vertices[i];else{for(let v of vertices[i])v.x!=minx&&v.x!=maxx||v.y!=miny&&v.y!=maxy||path[i].push(v);if(0==path[i].length)for(let v of vertices[i])v.x!=minx&&v.x!=maxx&&v.y!=miny&&v.y!=maxy||path[i].push(v);0==path[i].length&&(path[i]=vertices[i])}return function maxDistancePath(origin,path,pathStart){let distanceMax=0;for(let i of path[pathStart]){const distance1=void 0!==origin?i.distanceEarth(origin):0,distance2=path.length>pathStart+1?maxDistancePath(i,path,pathStart+1):0;distanceMax=Math.max(distanceMax,distance1+distance2)}return distanceMax}(void 0,path,0)},findFurthestPointInSegment:function(sega,segb,target,opt){let points,pos,zSearch;if(target instanceof Box$2)points=target.vertices();else{if(!(target instanceof Point$2))throw new TypeError("target must be either Point or Box");points=[target]}if(sega===opt.launch)pos=0,zSearch=+segb;else{if(segb!==opt.landing)throw new RangeError("this function supports seeking only from the launch or the landing point");pos=1,zSearch=+sega}let fpoint,distanceMax=-1/0;for(let v of points){let fVpoint,precomputed,distanceVMax=-1/0;const precomputedAll=opt.flight.furthestPoints[pos].get(v.x+":"+v.y);for(const p of precomputedAll||[])if(zSearch>=p.min&&zSearch<=p.max){precomputed=p;break}if(precomputed){if(!(sega<=precomputed.o.r&&precomputed.o.r<=segb))throw new Error("furthestPoints cache inconsistency");distanceVMax=v.distanceEarth(precomputed.o),fVpoint=precomputed.o}if(void 0===fVpoint){let intersecting=!1,canCache=!1;for(let p=sega;p<=segb;p++){const f=opt.flight.flightPoints[p];if(target instanceof Box$2&&target.intersects(f)){intersecting=!0;continue}const d=v.distanceEarth(f);d>distanceVMax&&(distanceVMax=d,fVpoint=f,canCache=!0)}if(intersecting)for(let p of points){const d=v.distanceEarth(p);d>distanceVMax&&(distanceVMax=d,fVpoint=target,canCache=!1)}if(canCache){let zCache;sega===opt.launch?zCache={min:+fVpoint.r,max:+segb}:segb===opt.landing&&(zCache={min:+sega,max:+fVpoint.r});let c=precomputedAll;c||(c=[],opt.flight.furthestPoints[pos].set(v.x+":"+v.y,c));const existing=c.filter(x=>x.o.r==fVpoint.r&&!(zCache.max<=x.min||zCache.min>=x.max))[0];existing?(existing.min=Math.min(zCache.min,existing.min),existing.max=Math.max(zCache.max,existing.max)):c.push({...zCache,o:fVpoint})}}distanceVMax>distanceMax&&(distanceMax=distanceVMax,fpoint=fVpoint)}return void 0===fpoint&&(fpoint=target),fpoint},isTriangleClosed:function(p1,p2,distance,opt){const fastCandidates=opt.flight.closestPairs.search({minX:opt.launch,minY:p2,maxX:p1,maxY:opt.landing});for(let f of fastCandidates)if(f.o.d<=opt.scoring.closingDistanceFree)return f.o;const min=function(p1,p2,opt){let precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:p2}),precomputed=precomputedAll.reduce((a,x)=>!a||x.in>a.in?x:a,void 0);if(precomputed=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,precomputed),void 0!==precomputed)return precomputed.o;const rtree=new Flatbush$1(p1+1-opt.launch,8),lc=Math.abs(Math.cos(util.radians(opt.flight.flightPoints[p1].y)));for(let i=opt.launch;i<=p1;i++){const r=opt.flight.flightPoints[i];rtree.add(r.x*lc,r.y,r.x*lc,r.y)}rtree.finish(),precomputedAll=opt.flight.closestPairs.search({minX:p1,minY:p2,maxX:p1,maxY:opt.landing});const precomputedNext=precomputedAll.reduce((a,x)=>!a||x.out<a.out?x:a,void 0),lastUnknown=void 0!==precomputedNext?precomputedNext.maxY:opt.landing;let min={d:1/0};for(let i=p2;i<lastUnknown;i++){const pout=opt.flight.flightPoints[i],n=rtree.neighbors(pout.x*lc,pout.y,1)[0]+opt.launch;if(void 0!==n){const pin=opt.flight.flightPoints[n],d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}}if(void 0!==precomputedNext){const pout=precomputedNext.o.out,pin=precomputedNext.o.in,d=pout.distanceEarth(pin);d<min.d&&(min.d=d,min.out=pout,min.in=pin)}return opt.flight.closestPairs.insert({minX:min.in.r,minY:p2,maxX:p1,maxY:min.out.r,o:min}),min}(p1,p2,opt);return min.d<=opt.scoring.closingDistance(distance,opt)&&min},init:function(opt){opt.flight.closestPairs=new RBush$1,opt.flight.furthestPoints=[new map,new map],opt.flight.flightPoints=new Array(opt.flight.filtered.length);for(let r in opt.flight.filtered)opt.flight.flightPoints[r]=new Point$2(opt.flight.filtered,r)}};const definitionFlight_t=60,definitionFlight_x0=1.5,definitionFlight_xt=5,definitionFlight_z0=.05,definitionFlight_zt=.9,definitionGround_t=20,definitionGround_xmax=2.5,definitionGround_zmax=.1,Point$3=foundation.Point;var flight={analyze:function(flight,config){if(config.invalid?flight.filtered=flight.fixes.slice(0):flight.filtered=flight.fixes.filter(x=>x.valid).filter((x,i,a)=>0==i||a[i-1].timestamp!==x.timestamp),flight.filtered.length<5)throw new Error(`Flight must contain at least 5 valid GPS fixes, ${flight.filtered.length} valid fixes found (out of ${flight.fixes.length})`);config.trim||config.detectLaunch||config.detectLanding?(!function(fixes){for(let i in fixes)(null===fixes[i].pressureAltitude||void 0===fixes[i].pressureAltitude||fixes[i].pressureAltitude<-1e3)&&(fixes[i].pressureAltitude=fixes[i].gpsAltitude),null===fixes[i].pressureAltitude&&(fixes[i].gpsAltitude=void 0),i>0?fixes[i].timestamp!==fixes[i-1].timestamp?(fixes[i].hspeed=1e3*new Point$3(fixes,i-1).distanceEarth(new Point$3(fixes,i))/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3,fixes[i].vspeed=(fixes[i].pressureAltitude-fixes[i-1].pressureAltitude)/(fixes[i].timestamp-fixes[i-1].timestamp)*1e3):(fixes[i].hspeed=fixes[i-1].hspeed,fixes[i].vspeed=fixes[i-1].vspeed):(fixes[i].hspeed=0,fixes[i].vspeed=0);for(let _i in fixes){const i=parseInt(_i),now=fixes[i].timestamp;let start,end;for(start=i;start>0&&fixes[start].timestamp>now-Math.round(5e3);start--);for(end=i;end<fixes.length-1&&fixes[end].timestamp<now+Math.round(5e3);end++);const maSegment=fixes.slice(start,end+1);fixes[i].hma=maSegment.reduce((sum,x)=>sum+x.hspeed,0)/maSegment.length,fixes[i].vma=maSegment.reduce((sum,x)=>sum+Math.abs(x.vspeed),0)/maSegment.length}}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma>definitionFlight_xt&&fixes[i].vma>definitionFlight_zt&&(start=i),void 0!==start)if(fixes[i].hma>definitionFlight_x0&&fixes[i].vma>definitionFlight_z0){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionFlight_t)for(let j=start;j<=i;j++)fixes[i].stateFlight=!0}else start=void 0}(flight.filtered),function(fixes){let start;for(let i=0;i<fixes.length-1;i++)if(void 0===start&&fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax&&(start=i),void 0!==start)if(fixes[i].hma<definitionGround_xmax&&fixes[i].vma<definitionGround_zmax){if(fixes[i].timestamp>fixes[start].timestamp+1e3*definitionGround_t)for(let j=start;j<=i;j++)fixes[i].stateGround=!0}else start=void 0}(flight.filtered),flight.ll=function(fixes){let ll=[];for(let i=0;i<fixes.length-1;i++)if(fixes[i].stateFlight){let j;for(j=i;j>0&&!fixes[j].stateGround;j--);const launch=j;for(j=i;j<fixes.length-2&&!fixes[j].stateGround;j++);const landing=j;i=j,ll.push({launch:launch,landing:landing})}return 0==ll.length&&ll.push({launch:0,landing:fixes.length-1}),ll}(flight.filtered)):flight.ll=[{launch:0,landing:flight.filtered.length-1}]}};function closingPenalty(cd,opt){return cd>(opt.scoring.closingDistanceFree||0)?cd:0}function maxFAIDistance(maxTriDistance,boxes,opt){const minTriDistance=geom.minDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxAB=geom.maxDistance2Rectangles([boxes[0],boxes[1]]),maxBC=geom.maxDistance2Rectangles([boxes[1],boxes[2]]),maxCA=geom.maxDistance2Rectangles([boxes[2],boxes[0]]),maxDistance=Math.min(maxAB/opt.scoring.minSide,maxBC/opt.scoring.minSide,maxCA/opt.scoring.minSide,maxTriDistance);return maxDistance<minTriDistance?0:maxDistance}var scoring={closingWithLimit:function(distance,opt){return Math.max(opt.scoring.closingDistanceFixed||0,distance*(opt.scoring.closingDistanceRelative||0))},closingWithPenalty:function(distance,opt){return 1/0},boundTriangle:function(ranges,boxes,opt){const maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i)),maxDistance=void 0!==opt.scoring.minSide?maxFAIDistance(maxTriDistance,boxes,opt):maxTriDistance;if(0===maxDistance)return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxDistance,opt),cp?(maxDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxDistance*opt.scoring.multiplier},scoreTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),distance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*distance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,distance,opt);return cp?{distance:distance,score:(distance-closingPenalty(cp.d,opt))*opt.scoring.multiplier,tp:tp,cp:cp}:{score:0}},boundDistance3Points:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt);return geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout])*opt.scoring.multiplier},scoreDistance3Points:function(tp,opt){let distance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])distance+=all[i].distanceEarth(all[i+1]);return{distance:distance,score:distance*opt.scoring.multiplier,tp:tp,ep:{start:pin,finish:pout}}},boundOpenTriangle:function(ranges,boxes,opt){const pin=geom.findFurthestPointInSegment(opt.launch,ranges[0].a,boxes[0],opt),pout=geom.findFurthestPointInSegment(ranges[2].b,opt.landing,boxes[2],opt),maxD3PDistance=geom.maxDistanceNRectangles([pin,boxes[0],boxes[1],boxes[2],pout]),maxTriDistance=geom.maxDistance3Rectangles(boxes,(i,j,k)=>i.distanceEarth(j)+j.distanceEarth(k)+k.distanceEarth(i));if(void 0!==opt.scoring.minSide&&0===maxFAIDistance(maxTriDistance,boxes,opt))return 0;let cp={d:0};return ranges[0].b<ranges[2].a?(cp=geom.isTriangleClosed(ranges[0].b,ranges[2].a,maxTriDistance,opt),cp?(maxD3PDistance-closingPenalty(cp.d,opt))*opt.scoring.multiplier:0):maxD3PDistance*opt.scoring.multiplier},scoreOpenTriangle:function(tp,opt){const d0=tp[0].distanceEarth(tp[1]),d1=tp[1].distanceEarth(tp[2]),d2=tp[2].distanceEarth(tp[0]),triDistance=d0+d1+d2;if(void 0!==opt.scoring.minSide){const minSide=opt.scoring.minSide*triDistance;if(d0<minSide||d1<minSide||d2<minSide)return{score:0}}let cp=geom.isTriangleClosed(tp[0].r,tp[2].r,triDistance,opt);if(!cp)return{score:0};let d3pDistance=0;const pin=geom.findFurthestPointInSegment(opt.launch,tp[0].r,tp[0],opt),pout=geom.findFurthestPointInSegment(tp[2].r,opt.landing,tp[2],opt),all=[pin,tp[0],tp[1],tp[2],pout];for(let i of[0,1,2,3])d3pDistance+=all[i].distanceEarth(all[i+1]);return{distance:d3pDistance,score:d3pDistance*opt.scoring.multiplier-closingPenalty(cp.d,opt),tp:tp,ep:{start:pin,finish:pout},cp:cp}}};function round2(score){return parseFloat(parseFloat(score).toFixed(2))}var scoringRules_config={FFVL:[{name:"Distance 3 points",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Triangle plat",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Triangle FAI",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:3,closingDistanceFree:3,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}],XContest:[{name:"Free flight",multiplier:1,bound:scoring.boundDistance3Points,score:scoring.scoreDistance3Points,rounding:round2,cardinality:3,code:"od"},{name:"Free triangle",multiplier:1.2,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"tri"},{name:"FAI triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceRelative:.2,rounding:round2,cardinality:3,code:"fai"},{name:"Closed free triangle",multiplier:1.4,bound:scoring.boundTriangle,score:scoring.scoreTriangle,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"tri"},{name:"Closed FAI triangle",multiplier:1.6,bound:scoring.boundTriangle,score:scoring.scoreTriangle,minSide:.28,closingDistance:scoring.closingWithLimit,closingDistanceFixed:0,closingDistanceFree:0,closingDistanceRelative:.05,rounding:round2,cardinality:3,code:"fai"}]};const Solution$1=solution_Solution,{Range:Range$2,Point:Point$4}=foundation;var solver_1=function*(flight$1,_scoringTypes,_config){let reset;const scoringTypes=_scoringTypes||scoringRules_config.FFVL,config=_config||{};flight.analyze(flight$1,config),geom.init({flight:flight$1}),config.hp?Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthVincentys:Point$4.prototype.distanceEarth=Point$4.prototype.distanceEarthFCC;let solutionRoots=[];for(let scoringType of scoringTypes)for(let l of flight$1.ll){const opt={flight:flight$1,launch:l.launch,landing:l.landing,scoring:scoringType,config:config};let solutionRoot=new Solution$1([new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing),new Range$2(l.launch,l.landing)],opt);solutionRoot.do_bound(),solutionRoot.do_score(),solutionRoots.push(solutionRoot)}let best=solutionRoots[0],solutionQueue=new sortedSet(solutionRoots,Solution$1.prototype.contentEquals,Solution$1.prototype.contentCompare),processed=0,tcum=0;do{const tstart=Date.now();for(;solutionQueue.length>0;){if(processed%100==0&&"undefined"!=typeof process&&process.memoryUsage){const mem=process.memoryUsage();if(mem.heapUsed/mem.heapTotal>.98)break}let current=solutionQueue.pop();if(current.opt.scoring.rounding(current.bound)<=best.opt.scoring.rounding(best.score)){solutionQueue.clear();break}let children=current.do_branch();for(let s of children)if(s.do_bound(),!(s.bound<=best.score)){if(s.do_score(),processed++,s.score>=best.score&&s.score>0&&(best=s,solutionQueue.length>1e4&&solutionQueue.findLeast().value.bound<=best.score)){const garbageBest=solutionQueue.findGreatestLessThanOrEqual({bound:best.score});if(void 0!==garbageBest){const cutoff=solutionQueue.indexOf(garbageBest.value);solutionQueue.splice(0,cutoff+1).length}}solutionQueue.push(s)}if(processed>config.maxloop||Date.now()-tstart>config.maxcycle)break}best.processed=processed;const currentUpperBound=solutionQueue.findGreatest();if(best.currentUpperBound=currentUpperBound?currentUpperBound.value.bound:best.bound,tcum+=Date.now()-tstart,best.time=tcum,0==solutionQueue.length?best.optimal=!0:best.optimal=!1,best.optimal)return best.score=best.opt.scoring.rounding(best.score),best.scoreInfo&&(best.scoreInfo.distance=best.opt.scoring.rounding(best.scoreInfo.distance),best.scoreInfo.cp&&(best.scoreInfo.cp.d=best.opt.scoring.rounding(best.scoreInfo.cp.d))),reset=!0,best;reset=yield best}while(!reset)},MANUFACTURERS=getCjsExportFromNamespace(Object.freeze({__proto__:null,default:[{name:"Aircotec",long:"ACT",short:"I"},{name:"Cambridge Aero Instruments",long:"CAM",short:"C"},{name:"ClearNav Instruments",long:"CNI",short:null},{name:"Data Swan/DSX",long:"DSX",short:"D"},{name:"EW Avionics",long:"EWA",short:"E"},{name:"Filser",long:"FIL",short:"F"},{name:"Flarm",long:"FLA",short:"G"},{name:"Flytech",long:"FLY",short:null},{name:"Garrecht",long:"GCS",short:"A"},{name:"IMI Gliding Equipment",long:"IMI",short:"M"},{name:"Logstream",long:"LGS",short:null},{name:"LX Navigation",long:"LXN",short:"L"},{name:"LXNAV",long:"LXV",short:"V"},{name:"Naviter",long:"NAV",short:null},{name:"New Technologies",long:"NTE",short:"N"},{name:"Nielsen Kellerman",long:"NKL",short:"K"},{name:"Peschges",long:"PES",short:"P"},{name:"PressFinish Electronics",long:"PFE",short:null},{name:"Print Technik",long:"PRT",short:"R"},{name:"Scheffel",long:"SCH",short:"H"},{name:"Streamline Data Instruments",long:"SDI",short:"S"},{name:"Triadis Engineering GmbH",long:"TRI",short:"T"},{name:"Zander",long:"ZAN",short:"Z"},{name:"XCSoar",long:"XCS",short:null},{name:"LK8000",long:"XLK",short:null},{name:"GpsDump",long:"XGD",short:null},{name:"SeeYou Recorder",long:"XCM",short:null}]})),lookup=function(id){let short=1===id.length;id=id.toUpperCase();let manufacturers=MANUFACTURERS.filter(it=>it[short?"short":"long"]===id);return 0!==manufacturers.length?manufacturers[0].name:id},RE_A=/^A(\w{3})(\w{3,}?)(?:FLIGHT:(\d+)|:(.+))?$/,RE_HFDTE=/^HFDTE(?:DATE:)?(\d{2})(\d{2})(\d{2})(?:,?(\d{2}))?/,RE_PLT_HEADER=/^H[FOP]PLT(?:.{0,}?:(.*)|(.*))$/,RE_CM2_HEADER=/^H[FOP]CM2(?:.{0,}?:(.*)|(.*))$/,RE_GTY_HEADER=/^H[FOP]GTY(?:.{0,}?:(.*)|(.*))$/,RE_GID_HEADER=/^H[FOP]GID(?:.{0,}?:(.*)|(.*))$/,RE_CID_HEADER=/^H[FOP]CID(?:.{0,}?:(.*)|(.*))$/,RE_CCL_HEADER=/^H[FOP]CCL(?:.{0,}?:(.*)|(.*))$/,RE_FTY_HEADER=/^H[FOP]FTY(?:.{0,}?:(.*)|(.*))$/,RE_RFW_HEADER=/^H[FOP]RFW(?:.{0,}?:(.*)|(.*))$/,RE_RHW_HEADER=/^H[FOP]RHW(?:.{0,}?:(.*)|(.*))$/,RE_B=/^B(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])([AV])(-\d{4}|\d{5})(-\d{4}|\d{5})/,RE_K=/^K(\d{2})(\d{2})(\d{2})/,RE_IJ=/^[IJ](\d{2})(?:\d{2}\d{2}[A-Z]{3})+/,RE_TASK=/^C(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{2})(\d{4})([-\d]{2})(.*)/,RE_TASKPOINT=/^C(\d{2})(\d{2})(\d{3})([NS])(\d{3})(\d{2})(\d{3})([EW])(.*)/,IGCParser=function(){function IGCParser(){this._result={numFlight:null,pilot:null,copilot:null,gliderType:null,registration:null,callsign:null,competitionClass:null,loggerType:null,firmwareVersion:null,hardwareVersion:null,task:null,fixes:[],dataRecords:[],security:null,errors:[]},this.fixExtensions=[],this.dataExtensions=[],this.lineNumber=0,this.prevTimestamp=null}return IGCParser.parse=function(str,options){void 0===options&&(options={});for(var parser=new IGCParser,errors=[],_i=0,_a=str.split("\n");_i<_a.length;_i++){var line=_a[_i];try{parser.processLine(line.trim())}catch(error){if(!options.lenient)continue;errors.push(error)}}var result=parser.result;return result.errors=errors,result},Object.defineProperty(IGCParser.prototype,"result",{get:function(){if(this._result.loggerManufacturer||console.error("Missing A record"),!this._result.date)throw new Error("Missing HFDTE record");return this._result},enumerable:!0,configurable:!0}),IGCParser.prototype.processLine=function(line){this.lineNumber+=1;var recordType=line[0];if("B"===recordType){var fix=this.parseBRecord(line);this.prevTimestamp=fix.timestamp,this._result.fixes.push(fix)}else if("K"===recordType){var data=this.parseKRecord(line);this.prevTimestamp=data.timestamp,this._result.dataRecords.push(data)}else if("H"===recordType)this.processHeader(line);else if("C"===recordType)this.processTaskLine(line);else if("A"===recordType){var record=this.parseARecord(line);this._result.loggerId=record.loggerId,this._result.loggerManufacturer=record.manufacturer,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"I"===recordType?this.fixExtensions=this.parseIJRecord(line):"J"===recordType?this.dataExtensions=this.parseIJRecord(line):"G"===recordType&&(this._result.security=(this._result.security||"")+line.slice(1))},IGCParser.prototype.processHeader=function(line){var headerType=line.slice(2,5);if("DTE"===headerType){var record=this.parseDateHeader(line);this._result.date=record.date,null!==record.numFlight&&(this._result.numFlight=record.numFlight)}else"PLT"===headerType?this._result.pilot=this.parsePilot(line):"CM2"===headerType?this._result.copilot=this.parseCopilot(line):"GTY"===headerType?this._result.gliderType=this.parseGliderType(line):"GID"===headerType?this._result.registration=this.parseRegistration(line):"CID"===headerType?this._result.callsign=this.parseCallsign(line):"CCL"===headerType?this._result.competitionClass=this.parseCompetitionClass(line):"FTY"===headerType?this._result.loggerType=this.parseLoggerType(line):"RFW"===headerType?this._result.firmwareVersion=this.parseFirmwareVersion(line):"RHW"===headerType&&(this._result.hardwareVersion=this.parseHardwareVersion(line))},IGCParser.prototype.parseARecord=function(line){var match=line.match(RE_A);if(match){return{manufacturer:lookup(match[1]),loggerId:match[2],numFlight:match[3]?parseInt(match[3],10):null,additionalData:match[4]||null}}if(match=line.match(/^A(\w{3})(.+)?$/)){return{manufacturer:lookup(match[1]),loggerId:null,numFlight:null,additionalData:match[2]?match[2].trim():null}}throw new Error("Invalid A record at line "+this.lineNumber+": "+line)},IGCParser.prototype.parseDateHeader=function(line){var match=line.match(RE_HFDTE);if(!match)throw new Error("Invalid DTE header at line "+this.lineNumber+": "+line);return{date:("8"===match[3][0]||"9"===match[3][0]?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],numFlight:match[4]?parseInt(match[4],10):null}},IGCParser.prototype.parseTextHeader=function(headerType,regex,line,underscoreReplacement){void 0===underscoreReplacement&&(underscoreReplacement=" ");var match=line.match(regex);return match?(match[1]||match[2]||"").replace(/_/g,underscoreReplacement).trim():""},IGCParser.prototype.parsePilot=function(line){return this.parseTextHeader("PLT",RE_PLT_HEADER,line)},IGCParser.prototype.parseCopilot=function(line){return this.parseTextHeader("CM2",RE_CM2_HEADER,line)},IGCParser.prototype.parseGliderType=function(line){return this.parseTextHeader("GTY",RE_GTY_HEADER,line)},IGCParser.prototype.parseRegistration=function(line){return this.parseTextHeader("GID",RE_GID_HEADER,line,"-")},IGCParser.prototype.parseCallsign=function(line){return this.parseTextHeader("CID",RE_CID_HEADER,line)},IGCParser.prototype.parseCompetitionClass=function(line){return this.parseTextHeader("GID",RE_CCL_HEADER,line)},IGCParser.prototype.parseLoggerType=function(line){return this.parseTextHeader("FTY",RE_FTY_HEADER,line)},IGCParser.prototype.parseFirmwareVersion=function(line){return this.parseTextHeader("RFW",RE_RFW_HEADER,line)},IGCParser.prototype.parseHardwareVersion=function(line){return this.parseTextHeader("RHW",RE_RHW_HEADER,line)},IGCParser.prototype.processTaskLine=function(line){this._result.task?this._result.task.points.push(this.parseTaskPoint(line)):this._result.task=this.parseTask(line)},IGCParser.prototype.parseTask=function(line){var match=line.match(RE_TASK);if(!match)throw new Error("Invalid task declaration at line "+this.lineNumber+": "+line);var lastCentury="8"===match[3][0]||"9"===match[3][0],declarationDate=(lastCentury?"19":"20")+match[3]+"-"+match[2]+"-"+match[1],declarationTime=match[4]+":"+match[5]+":"+match[6],declarationTimestamp=Date.parse(declarationDate+"T"+declarationTime+"Z"),flightDate=null;return"00"===match[7]&&"00"===match[8]&&"00"===match[9]||(flightDate=((lastCentury="8"===match[9][0]||"9"===match[9][0])?"19":"20")+match[9]+"-"+match[8]+"-"+match[7]),{declarationDate:declarationDate,declarationTime:declarationTime,declarationTimestamp:declarationTimestamp,flightDate:flightDate,taskNumber:"0000"!==match[10]?parseInt(match[10],10):null,numTurnpoints:parseInt(match[11],10),comment:match[12]||null,points:[]}},IGCParser.prototype.parseTaskPoint=function(line){var match=line.match(RE_TASKPOINT);if(!match)throw new Error("Invalid task point declaration at line "+this.lineNumber+": "+line);return{latitude:IGCParser.parseLatitude(match[1],match[2],match[3],match[4]),longitude:IGCParser.parseLongitude(match[5],match[6],match[7],match[8]),name:match[9]||null}},IGCParser.prototype.parseBRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first B record");var match=line.match(RE_B);if(!match)throw new Error("Invalid B record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),latitude=IGCParser.parseLatitude(match[4],match[5],match[6],match[7]),longitude=IGCParser.parseLongitude(match[8],match[9],match[10],match[11]),valid="A"===match[12],pressureAltitude="00000"===match[13]?null:parseInt(match[13],10),gpsAltitude="00000"===match[14]?null:parseInt(match[14],10),extensions={};if(this.fixExtensions)for(var _i=0,_a=this.fixExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}var enl=null;if(extensions.ENL){var enlLength=this.fixExtensions.filter((function(it){return"ENL"===it.code}))[0].length,enlMax=Math.pow(10,enlLength);enl=parseInt(extensions.ENL,10)/enlMax}return{timestamp:timestamp,time:time,latitude:latitude,longitude:longitude,valid:valid,pressureAltitude:pressureAltitude,gpsAltitude:gpsAltitude,extensions:extensions,enl:enl,fixAccuracy:extensions.FXA?parseInt(extensions.FXA,10):null}},IGCParser.prototype.parseKRecord=function(line){if(!this._result.date)throw new Error("Missing HFDTE record before first K record");if(!this.dataExtensions)throw new Error("Missing J record before first K record");var match=line.match(RE_K);if(!match)throw new Error("Invalid K record at line "+this.lineNumber+": "+line);var time=match[1]+":"+match[2]+":"+match[3],timestamp=this.calcTimestamp(time),extensions={};if(this.dataExtensions)for(var _i=0,_a=this.dataExtensions;_i<_a.length;_i++){var _b=_a[_i],code=_b.code,start=_b.start,length=_b.length;extensions[code]=line.slice(start,start+length)}return{timestamp:timestamp,time:time,extensions:extensions}},IGCParser.prototype.parseIJRecord=function(line){var match=line.match(RE_IJ);if(!match)return console.error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line),[];var num=parseInt(match[1],10);if(line.length<3+7*num)throw new Error("Invalid "+line[0]+" record at line "+this.lineNumber+": "+line);for(var extensions=new Array(num),i=0;i<num;i++){var offset=3+7*i,start=parseInt(line.slice(offset,offset+2),10),length=parseInt(line.slice(offset+2,offset+4),10)-start+1,code=line.slice(offset+4,offset+7);extensions[i]={start:start,length:length,code:code}}return extensions},IGCParser.parseLatitude=function(dd,mm,mmm,ns){var degrees=parseInt(dd,10)+parseFloat(mm+"."+mmm)/60;return"S"===ns?-degrees:degrees},IGCParser.parseLongitude=function(ddd,mm,mmm,ew){var degrees=parseInt(ddd,10)+parseFloat(mm+"."+mmm)/60;return"W"===ew?-degrees:degrees},IGCParser.prototype.calcTimestamp=function(time){for(var timestamp=Date.parse(this._result.date+"T"+time+"Z");this.prevTimestamp&&timestamp<this.prevTimestamp-36e5;)timestamp+=864e5;return timestamp},IGCParser}();var main={solver:solver_1,parser:IGCParser,scoring:scoringRules_config,IGCParser:IGCParser},main_1=main.solver,main_2=main.parser,main_3=main.scoring,main_4=main.IGCParser;exports.IGCParser=main_4,exports.default=main,exports.parser=main_2,exports.scoring=main_3,exports.solver=main_1;
\ No newline at end of file
diff --git a/index.es.js b/index.es.js
index 36094f7..23efe4b 100644
--- a/index.es.js
+++ b/index.es.js
@@ -2,7529 +2,7159 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-class FlatQueue {
-
-    constructor() {
-        this.ids = [];
-        this.values = [];
-        this.length = 0;
-    }
-
-    clear() {
-        this.length = 0;
-    }
-
-    push(id, value) {
-        let pos = this.length++;
-        this.ids[pos] = id;
-        this.values[pos] = value;
-
-        while (pos > 0) {
-            const parent = (pos - 1) >> 1;
-            const parentValue = this.values[parent];
-            if (value >= parentValue) break;
-            this.ids[pos] = this.ids[parent];
-            this.values[pos] = parentValue;
-            pos = parent;
-        }
-
-        this.ids[pos] = id;
-        this.values[pos] = value;
-    }
+var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
 
-    pop() {
-        if (this.length === 0) return undefined;
+function createCommonjsModule(fn, module) {
+	return module = { exports: {} }, fn(module, module.exports), module.exports;
+}
 
-        const top = this.ids[0];
-        this.length--;
+function getCjsExportFromNamespace (n) {
+	return n && n['default'] || n;
+}
 
-        if (this.length > 0) {
-            const id = this.ids[0] = this.ids[this.length];
-            const value = this.values[0] = this.values[this.length];
-            const halfLength = this.length >> 1;
-            let pos = 0;
+/**
+    A utility to reduce unnecessary allocations of <code>function () {}</code>
+    in its many colorful variations.  It does nothing and returns
+    <code>undefined</code> thus makes a suitable default in some circumstances.
 
-            while (pos < halfLength) {
-                let left = (pos << 1) + 1;
-                const right = left + 1;
-                let bestIndex = this.ids[left];
-                let bestValue = this.values[left];
-                const rightValue = this.values[right];
+    @function external:Function.noop
+*/
+Function.noop = function () {
+};
 
-                if (right < this.length && rightValue < bestValue) {
-                    left = right;
-                    bestIndex = this.ids[right];
-                    bestValue = rightValue;
-                }
-                if (bestValue >= value) break;
+/**
+    A utility to reduce unnecessary allocations of <code>function (x) {return
+    x}</code> in its many colorful but ultimately wasteful parameter name
+    variations.
 
-                this.ids[pos] = bestIndex;
-                this.values[pos] = bestValue;
-                pos = left;
-            }
+    @function external:Function.identity
+    @param {Any} any value
+    @returns {Any} that value
+*/
+Function.identity = function (value) {
+    return value;
+};
 
-            this.ids[pos] = id;
-            this.values[pos] = value;
-        }
+/**
+    A utility for creating a comparator function for a particular aspect of a
+    figurative class of objects.
 
-        return top;
-    }
+    @function external:Function.by
+    @param {Function} relation A function that accepts a value and returns a
+    corresponding value to use as a representative when sorting that object.
+    @param {Function} compare an alternate comparator for comparing the
+    represented values.  The default is <code>Object.compare</code>, which
+    does a deep, type-sensitive, polymorphic comparison.
+    @returns {Function} a comparator that has been annotated with
+    <code>by</code> and <code>compare</code> properties so
+    <code>sorted</code> can perform a transform that reduces the need to call
+    <code>by</code> on each sorted object to just once.
+ */
+Function.by = function (by , compare) {
+    compare = compare || Object.compare;
+    by = by || Function.identity;
+    var compareBy = function (a, b) {
+        return compare(by(a), by(b));
+    };
+    compareBy.compare = compare;
+    compareBy.by = by;
+    return compareBy;
+};
 
-    peek() {
-        return this.ids[0];
-    }
+// TODO document
+Function.get = function (key) {
+    return function (object) {
+        return Object.get(object, key);
+    };
+};
 
-    peekValue() {
-        return this.values[0];
-    }
+var genericCollection = GenericCollection;
+function GenericCollection() {
+    throw new Error("Can't construct. GenericCollection is a mixin.");
 }
 
-const ARRAY_TYPES = [
-    Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array,
-    Int32Array, Uint32Array, Float32Array, Float64Array
-];
-
-const VERSION = 3; // serialized format version
+var DOMTokenList = commonjsGlobal.DOMTokenList || function(){};
 
-class Flatbush {
+GenericCollection.EmptyArray = Object.freeze([]);
 
-    static from(data) {
-        if (!(data instanceof ArrayBuffer)) {
-            throw new Error('Data must be an instance of ArrayBuffer.');
-        }
-        const [magic, versionAndType] = new Uint8Array(data, 0, 2);
-        if (magic !== 0xfb) {
-            throw new Error('Data does not appear to be in a Flatbush format.');
+GenericCollection.prototype.addEach = function (values, mapFn, thisp) {
+    //We want to eliminate everything but array like: Strings, Arrays, DOMTokenList
+    if(values && (values instanceof Array || (values instanceof DOMTokenList) || values instanceof String)) {
+        if(mapFn) {
+            for (var i = 0; i < values.length; i++) {
+                this.add(mapFn.call(thisp,values[i]), i);
+            }
+        } else {
+            for (var i = 0; i < values.length; i++) {
+                this.add(values[i], i);
+            }
         }
-        if (versionAndType >> 4 !== VERSION) {
-            throw new Error(`Got v${versionAndType >> 4} data when expected v${VERSION}.`);
+    }
+    else if (values && Object(values) === values) {
+        if (typeof values.forEach === "function") {
+            if(mapFn) {
+                values.map(mapFn, thisp).forEach(this.add, this);
+            } else {
+                values.forEach(this.add, this);
+            }
+        } else if(typeof values.next === "function") {
+            var value, i=0;
+            if(mapFn) {
+                while ((value = values.next().value)) {
+                    this.add(mapFn.call(thisp,value), i++);
+                }
+            }
+            else {
+                while ((value = values.next().value)) {
+                    this.add(value, i++);
+                }
+            }
+        } else if (typeof values.length === "number") {
+            // Array-like objects that do not implement forEach, ergo,
+            // Arguments
+            if(mapFn) {
+                for (var i = 0; i < values.length; i++) {
+                    this.add(mapFn.call(thisp,values[i]), i);
+                }
+            }
+            else {
+                for (var i = 0; i < values.length; i++) {
+                    this.add(values[i], i);
+                }
+            }
+        } else {
+            if(mapFn) {
+                Object.keys(values).forEach(function (key) {
+                    this.add(mapFn.call(thisp,values[key]), key);
+                }, this);
+            } else {
+                Object.keys(values).forEach(function (key) {
+                    this.add(values[key], key);
+                }, this);
+            }
         }
-        const [nodeSize] = new Uint16Array(data, 2, 1);
-        const [numItems] = new Uint32Array(data, 4, 1);
-
-        return new Flatbush(numItems, nodeSize, ARRAY_TYPES[versionAndType & 0x0f], data);
     }
+    return this;
+};
 
-    constructor(numItems, nodeSize = 16, ArrayType = Float64Array, data) {
-        if (numItems === undefined) throw new Error('Missing required argument: numItems.');
-        if (isNaN(numItems) || numItems <= 0) throw new Error(`Unpexpected numItems value: ${numItems}.`);
+// This is sufficiently generic for Map (since the value may be a key)
+// and ordered collections (since it forwards the equals argument)
+GenericCollection.prototype.deleteEach = function (values, equals) {
+    values.forEach(function (value) {
+        this["delete"](value, equals);
+    }, this);
+    return this;
+};
 
-        this.numItems = +numItems;
-        this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);
+// all of the following functions are implemented in terms of "reduce".
+// some need "constructClone".
 
-        // calculate the total number of nodes in the R-tree to allocate space for
-        // and the index of each tree level (used in search later)
-        let n = numItems;
-        let numNodes = n;
-        this._levelBounds = [n * 4];
-        do {
-            n = Math.ceil(n / this.nodeSize);
-            numNodes += n;
-            this._levelBounds.push(numNodes * 4);
-        } while (n !== 1);
+GenericCollection.prototype.forEach = function (callback /*, thisp*/) {
+    var thisp = arguments[1];
+    return this.reduce(function (undefined$1, value, key, object, depth) {
+        callback.call(thisp, value, key, object, depth);
+    }, undefined);
+};
 
-        this.ArrayType = ArrayType || Float64Array;
-        this.IndexArrayType = numNodes < 16384 ? Uint16Array : Uint32Array;
+GenericCollection.prototype.map = function (callback /*, thisp*/) {
+    var thisp = arguments[1];
+    var result = [];
+    this.reduce(function (undefined$1, value, key, object, depth) {
+        result.push(callback.call(thisp, value, key, object, depth));
+    }, undefined);
+    return result;
+};
 
-        const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);
-        const nodesByteSize = numNodes * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+GenericCollection.prototype.enumerate = function (start) {
+    if (start == null) {
+        start = 0;
+    }
+    var result = [];
+    this.reduce(function (undefined$1, value) {
+        result.push([start++, value]);
+    }, undefined);
+    return result;
+};
 
-        if (arrayTypeIndex < 0) {
-            throw new Error(`Unexpected typed array class: ${ArrayType}.`);
+GenericCollection.prototype.group = function (callback, thisp, equals) {
+    equals = equals || Object.equals;
+    var groups = [];
+    var keys = [];
+    this.forEach(function (value, key, object) {
+        var key = callback.call(thisp, value, key, object);
+        var index = keys.indexOf(key, equals);
+        var group;
+        if (index === -1) {
+            group = [];
+            groups.push([key, group]);
+            keys.push(key);
+        } else {
+            group = groups[index][1];
         }
+        group.push(value);
+    });
+    return groups;
+};
 
-        if (data && (data instanceof ArrayBuffer)) {
-            this.data = data;
-            this._boxes = new this.ArrayType(this.data, 8, numNodes * 4);
-            this._indices = new this.IndexArrayType(this.data, 8 + nodesByteSize, numNodes);
+GenericCollection.prototype.toArray = function () {
+    return this.map(Function.identity);
+};
 
-            this._pos = numNodes * 4;
-            this.minX = this._boxes[this._pos - 4];
-            this.minY = this._boxes[this._pos - 3];
-            this.maxX = this._boxes[this._pos - 2];
-            this.maxY = this._boxes[this._pos - 1];
+// this depends on stringable keys, which apply to Array and Iterator
+// because they have numeric keys and all Maps since they may use
+// strings as keys.  List, Set, and SortedSet have nodes for keys, so
+// toObject would not be meaningful.
+GenericCollection.prototype.toObject = function () {
+    var object = {};
+    this.reduce(function (undefined$1, value, key) {
+        object[key] = value;
+    }, undefined);
+    return object;
+};
 
-        } else {
-            this.data = new ArrayBuffer(8 + nodesByteSize + numNodes * this.IndexArrayType.BYTES_PER_ELEMENT);
-            this._boxes = new this.ArrayType(this.data, 8, numNodes * 4);
-            this._indices = new this.IndexArrayType(this.data, 8 + nodesByteSize, numNodes);
-            this._pos = 0;
-            this.minX = Infinity;
-            this.minY = Infinity;
-            this.maxX = -Infinity;
-            this.maxY = -Infinity;
+GenericCollection.from = function () {
+    return this.apply(this,arguments);
+};
 
-            new Uint8Array(this.data, 0, 2).set([0xfb, (VERSION << 4) + arrayTypeIndex]);
-            new Uint16Array(this.data, 2, 1)[0] = nodeSize;
-            new Uint32Array(this.data, 4, 1)[0] = numItems;
+GenericCollection.prototype.filter = function (callback /*, thisp*/) {
+    var thisp = arguments[1];
+    var result = this.constructClone();
+    this.reduce(function (undefined$1, value, key, object, depth) {
+        if (callback.call(thisp, value, key, object, depth)) {
+            result.add(value, key);
         }
+    }, undefined);
+    return result;
+};
 
-        // a priority queue for k-nearest-neighbors queries
-        this._queue = new FlatQueue();
-    }
+GenericCollection.prototype.every = function (callback /*, thisp*/) {
+    var thisp = arguments[1];
+    return this.reduce(function (result, value, key, object, depth) {
+        return result && callback.call(thisp, value, key, object, depth);
+    }, true);
+};
 
-    add(minX, minY, maxX, maxY) {
-        const index = this._pos >> 2;
-        this._indices[index] = index;
-        this._boxes[this._pos++] = minX;
-        this._boxes[this._pos++] = minY;
-        this._boxes[this._pos++] = maxX;
-        this._boxes[this._pos++] = maxY;
+GenericCollection.prototype.some = function (callback /*, thisp*/) {
+    var thisp = arguments[1];
+    return this.reduce(function (result, value, key, object, depth) {
+        return result || callback.call(thisp, value, key, object, depth);
+    }, false);
+};
 
-        if (minX < this.minX) this.minX = minX;
-        if (minY < this.minY) this.minY = minY;
-        if (maxX > this.maxX) this.maxX = maxX;
-        if (maxY > this.maxY) this.maxY = maxY;
+GenericCollection.prototype.all = function () {
+    return this.every(Boolean);
+};
 
-        return index;
-    }
+GenericCollection.prototype.any = function () {
+    return this.some(Boolean);
+};
 
-    finish() {
-        if (this._pos >> 2 !== this.numItems) {
-            throw new Error(`Added ${this._pos >> 2} items when expected ${this.numItems}.`);
+GenericCollection.prototype.min = function (compare) {
+    compare = compare || this.contentCompare || Object.compare;
+    var first = true;
+    return this.reduce(function (result, value) {
+        if (first) {
+            first = false;
+            return value;
+        } else {
+            return compare(value, result) < 0 ? value : result;
         }
+    }, undefined);
+};
 
-        if (this.numItems <= this.nodeSize) {
-            // only one node, skip sorting and just fill the root box
-            this._boxes[this._pos++] = this.minX;
-            this._boxes[this._pos++] = this.minY;
-            this._boxes[this._pos++] = this.maxX;
-            this._boxes[this._pos++] = this.maxY;
-            return;
+GenericCollection.prototype.max = function (compare) {
+    compare = compare || this.contentCompare || Object.compare;
+    var first = true;
+    return this.reduce(function (result, value) {
+        if (first) {
+            first = false;
+            return value;
+        } else {
+            return compare(value, result) > 0 ? value : result;
         }
+    }, undefined);
+};
 
-        const width = this.maxX - this.minX;
-        const height = this.maxY - this.minY;
-        const hilbertValues = new Uint32Array(this.numItems);
-        const hilbertMax = (1 << 16) - 1;
-
-        // map item centers into Hilbert coordinate space and calculate Hilbert values
-        for (let i = 0; i < this.numItems; i++) {
-            let pos = 4 * i;
-            const minX = this._boxes[pos++];
-            const minY = this._boxes[pos++];
-            const maxX = this._boxes[pos++];
-            const maxY = this._boxes[pos++];
-            const x = Math.floor(hilbertMax * ((minX + maxX) / 2 - this.minX) / width);
-            const y = Math.floor(hilbertMax * ((minY + maxY) / 2 - this.minY) / height);
-            hilbertValues[i] = hilbert(x, y);
-        }
+GenericCollection.prototype.sum = function (zero) {
+    zero = zero === undefined ? 0 : zero;
+    return this.reduce(function (a, b) {
+        return a + b;
+    }, zero);
+};
 
-        // sort items by their Hilbert value (for packing later)
-        sort(hilbertValues, this._boxes, this._indices, 0, this.numItems - 1, this.nodeSize);
+GenericCollection.prototype.average = function (zero) {
+    var sum = zero === undefined ? 0 : zero;
+    var count = zero === undefined ? 0 : zero;
+    this.reduce(function (undefined$1, value) {
+        sum += value;
+        count += 1;
+    }, undefined);
+    return sum / count;
+};
 
-        // generate nodes at each tree level, bottom-up
-        for (let i = 0, pos = 0; i < this._levelBounds.length - 1; i++) {
-            const end = this._levelBounds[i];
+GenericCollection.prototype.concat = function () {
+    var result = this.constructClone(this);
+    for (var i = 0; i < arguments.length; i++) {
+        result.addEach(arguments[i]);
+    }
+    return result;
+};
 
-            // generate a parent node for each block of consecutive <nodeSize> nodes
-            while (pos < end) {
-                const nodeIndex = pos;
+GenericCollection.prototype.flatten = function () {
+    var self = this;
+    return this.reduce(function (result, array) {
+        array.forEach(function (value) {
+            this.push(value);
+        }, result, self);
+        return result;
+    }, []);
+};
 
-                // calculate bbox for the new node
-                let nodeMinX = Infinity;
-                let nodeMinY = Infinity;
-                let nodeMaxX = -Infinity;
-                let nodeMaxY = -Infinity;
-                for (let i = 0; i < this.nodeSize && pos < end; i++) {
-                    nodeMinX = Math.min(nodeMinX, this._boxes[pos++]);
-                    nodeMinY = Math.min(nodeMinY, this._boxes[pos++]);
-                    nodeMaxX = Math.max(nodeMaxX, this._boxes[pos++]);
-                    nodeMaxY = Math.max(nodeMaxY, this._boxes[pos++]);
-                }
+GenericCollection.prototype.zip = function () {
+    var table = Array.prototype.slice.call(arguments);
+    table.unshift(this);
+    return Array.unzip(table);
+};
 
-                // add the new node to the tree data
-                this._indices[this._pos >> 2] = nodeIndex;
-                this._boxes[this._pos++] = nodeMinX;
-                this._boxes[this._pos++] = nodeMinY;
-                this._boxes[this._pos++] = nodeMaxX;
-                this._boxes[this._pos++] = nodeMaxY;
-            }
+GenericCollection.prototype.join = function (delimiter) {
+    return this.reduce(function (result, string) {
+        // work-around for reduce that does not support no-basis form
+        if (result === void 0) {
+            return string;
+        } else {
+            return result + delimiter + string;
         }
-    }
+    }, void 0);
+};
 
-    search(minX, minY, maxX, maxY, filterFn) {
-        if (this._pos !== this._boxes.length) {
-            throw new Error('Data not yet indexed - call index.finish().');
-        }
+GenericCollection.prototype.sorted = function (compare, by, order) {
+    compare = compare || this.contentCompare || Object.compare;
+    // account for comparators generated by Function.by
+    if (compare.by) {
+        by = compare.by;
+        compare = compare.compare || this.contentCompare || Object.compare;
+    } else {
+        by = by || Function.identity;
+    }
+    if (order === undefined)
+        order = 1;
+    return this.map(function (item) {
+        return {
+            by: by(item),
+            value: item
+        };
+    })
+    .sort(function (a, b) {
+        return compare(a.by, b.by) * order;
+    })
+    .map(function (pair) {
+        return pair.value;
+    });
+};
 
-        let nodeIndex = this._boxes.length - 4;
-        const queue = [];
-        const results = [];
+GenericCollection.prototype.reversed = function () {
+    return this.constructClone(this).reverse();
+};
 
-        while (nodeIndex !== undefined) {
-            // find the end index of the node
-            const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
-
-            // search through child nodes
-            for (let pos = nodeIndex; pos < end; pos += 4) {
-                const index = this._indices[pos >> 2] | 0;
-
-                // check if node bbox intersects with query bbox
-                if (maxX < this._boxes[pos]) continue; // maxX < nodeMinX
-                if (maxY < this._boxes[pos + 1]) continue; // maxY < nodeMinY
-                if (minX > this._boxes[pos + 2]) continue; // minX > nodeMaxX
-                if (minY > this._boxes[pos + 3]) continue; // minY > nodeMaxY
-
-                if (nodeIndex < this.numItems * 4) {
-                    if (filterFn === undefined || filterFn(index)) {
-                        results.push(index); // leaf item
-                    }
-
-                } else {
-                    queue.push(index); // node; add it to the search queue
-                }
-            }
-
-            nodeIndex = queue.pop();
-        }
-
-        return results;
+GenericCollection.prototype.clone = function (depth, memo) {
+    if (depth === undefined) {
+        depth = Infinity;
+    } else if (depth === 0) {
+        return this;
     }
+    var clone = this.constructClone();
+    this.forEach(function (value, key) {
+        clone.add(Object.clone(value, depth - 1, memo), key);
+    }, this);
+    return clone;
+};
 
-    neighbors(x, y, maxResults = Infinity, maxDistance = Infinity, filterFn) {
-        if (this._pos !== this._boxes.length) {
-            throw new Error('Data not yet indexed - call index.finish().');
-        }
+GenericCollection.prototype.only = function () {
+    if (this.length === 1) {
+        return this.one();
+    }
+};
 
-        let nodeIndex = this._boxes.length - 4;
-        const q = this._queue;
-        const results = [];
-        const maxDistSquared = maxDistance * maxDistance;
+GenericCollection.prototype.iterator = function () {
+    return this.iterate.apply(this, arguments);
+};
 
-        while (nodeIndex !== undefined) {
-            // find the end index of the node
-            const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
+GenericCollection._sizePropertyDescriptor = {
+    get: function() {
+        return this.length;
+    },
+    enumerable: false,
+    configurable: true
+};
 
-            // add child nodes to the queue
-            for (let pos = nodeIndex; pos < end; pos += 4) {
-                const index = this._indices[pos >> 2] | 0;
+Object.defineProperty(GenericCollection.prototype,"size",GenericCollection._sizePropertyDescriptor);
 
-                const dx = axisDist(x, this._boxes[pos], this._boxes[pos + 2]);
-                const dy = axisDist(y, this._boxes[pos + 1], this._boxes[pos + 3]);
-                const dist = dx * dx + dy * dy;
+var weakMap = createCommonjsModule(function (module) {
+// Copyright (C) 2011 Google Inc.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+// http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
 
-                if (nodeIndex < this.numItems * 4) { // leaf node
-                    if (filterFn === undefined || filterFn(index)) {
-                        // put a negative index if it's an item rather than a node, to recognize later
-                        q.push(-index - 1, dist);
-                    }
-                } else {
-                    q.push(index, dist);
-                }
-            }
+/**
+ * @fileoverview Install a leaky WeakMap emulation on platforms that
+ * don't provide a built-in one.
+ *
+ * <p>Assumes that an ES5 platform where, if {@code WeakMap} is
+ * already present, then it conforms to the anticipated ES6
+ * specification. To run this file on an ES5 or almost ES5
+ * implementation where the {@code WeakMap} specification does not
+ * quite conform, run <code>repairES5.js</code> first.
+ *
+ * <p>Even though WeakMapModule is not global, the linter thinks it
+ * is, which is why it is in the overrides list below.
+ *
+ * <p>NOTE: Before using this WeakMap emulation in a non-SES
+ * environment, see the note below about hiddenRecord.
+ *
+ * @author Mark S. Miller
+ * @requires crypto, ArrayBuffer, Uint8Array, navigator, console
+ * @overrides WeakMap, ses, Proxy
+ * @overrides WeakMapModule
+ */
 
-            // pop items from the queue
-            while (q.length && q.peek() < 0) {
-                const dist = q.peekValue();
-                if (dist > maxDistSquared) {
-                    q.clear();
-                    return results;
-                }
-                results.push(-q.pop() - 1);
+/**
+ * This {@code WeakMap} emulation is observably equivalent to the
+ * ES-Harmony WeakMap, but with leakier garbage collection properties.
+ *
+ * <p>As with true WeakMaps, in this emulation, a key does not
+ * retain maps indexed by that key and (crucially) a map does not
+ * retain the keys it indexes. A map by itself also does not retain
+ * the values associated with that map.
+ *
+ * <p>However, the values associated with a key in some map are
+ * retained so long as that key is retained and those associations are
+ * not overridden. For example, when used to support membranes, all
+ * values exported from a given membrane will live for the lifetime
+ * they would have had in the absence of an interposed membrane. Even
+ * when the membrane is revoked, all objects that would have been
+ * reachable in the absence of revocation will still be reachable, as
+ * far as the GC can tell, even though they will no longer be relevant
+ * to ongoing computation.
+ *
+ * <p>The API implemented here is approximately the API as implemented
+ * in FF6.0a1 and agreed to by MarkM, Andreas Gal, and Dave Herman,
+ * rather than the offially approved proposal page. TODO(erights):
+ * upgrade the ecmascript WeakMap proposal page to explain this API
+ * change and present to EcmaScript committee for their approval.
+ *
+ * <p>The first difference between the emulation here and that in
+ * FF6.0a1 is the presence of non enumerable {@code get___, has___,
+ * set___, and delete___} methods on WeakMap instances to represent
+ * what would be the hidden internal properties of a primitive
+ * implementation. Whereas the FF6.0a1 WeakMap.prototype methods
+ * require their {@code this} to be a genuine WeakMap instance (i.e.,
+ * an object of {@code [[Class]]} "WeakMap}), since there is nothing
+ * unforgeable about the pseudo-internal method names used here,
+ * nothing prevents these emulated prototype methods from being
+ * applied to non-WeakMaps with pseudo-internal methods of the same
+ * names.
+ *
+ * <p>Another difference is that our emulated {@code
+ * WeakMap.prototype} is not itself a WeakMap. A problem with the
+ * current FF6.0a1 API is that WeakMap.prototype is itself a WeakMap
+ * providing ambient mutability and an ambient communications
+ * channel. Thus, if a WeakMap is already present and has this
+ * problem, repairES5.js wraps it in a safe wrappper in order to
+ * prevent access to this channel. (See
+ * PATCH_MUTABLE_FROZEN_WEAKMAP_PROTO in repairES5.js).
+ */
 
-                if (results.length === maxResults) {
-                    q.clear();
-                    return results;
-                }
-            }
+/**
+ * If this is a full <a href=
+ * "http://code.google.com/p/es-lab/wiki/SecureableES5"
+ * >secureable ES5</a> platform and the ES-Harmony {@code WeakMap} is
+ * absent, install an approximate emulation.
+ *
+ * <p>If WeakMap is present but cannot store some objects, use our approximate
+ * emulation as a wrapper.
+ *
+ * <p>If this is almost a secureable ES5 platform, then WeakMap.js
+ * should be run after repairES5.js.
+ *
+ * <p>See {@code WeakMap} for documentation of the garbage collection
+ * properties of this WeakMap emulation.
+ */
+(function WeakMapModule() {
 
-            nodeIndex = q.pop();
-        }
+  if (typeof ses !== 'undefined' && ses.ok && !ses.ok()) {
+    // already too broken, so give up
+    return;
+  }
 
-        q.clear();
-        return results;
+  /**
+   * In some cases (current Firefox), we must make a choice betweeen a
+   * WeakMap which is capable of using all varieties of host objects as
+   * keys and one which is capable of safely using proxies as keys. See
+   * comments below about HostWeakMap and DoubleWeakMap for details.
+   *
+   * This function (which is a global, not exposed to guests) marks a
+   * WeakMap as permitted to do what is necessary to index all host
+   * objects, at the cost of making it unsafe for proxies.
+   *
+   * Do not apply this function to anything which is not a genuine
+   * fresh WeakMap.
+   */
+  function weakMapPermitHostObjects(map) {
+    // identity of function used as a secret -- good enough and cheap
+    if (map.permitHostObjects___) {
+      map.permitHostObjects___(weakMapPermitHostObjects);
     }
-}
+  }
+  if (typeof ses !== 'undefined') {
+    ses.weakMapPermitHostObjects = weakMapPermitHostObjects;
+  }
 
-function axisDist(k, min, max) {
-    return k < min ? min - k : k <= max ? 0 : k - max;
-}
+  // IE 11 has no Proxy but has a broken WeakMap such that we need to patch
+  // it using DoubleWeakMap; this flag tells DoubleWeakMap so.
+  var doubleWeakMapCheckSilentFailure = false;
 
-// binary search for the first value in the array bigger than the given
-function upperBound(value, arr) {
-    let i = 0;
-    let j = arr.length - 1;
-    while (i < j) {
-        const m = (i + j) >> 1;
-        if (arr[m] > value) {
-            j = m;
-        } else {
-            i = m + 1;
-        }
+  // Check if there is already a good-enough WeakMap implementation, and if so
+  // exit without replacing it.
+  if (typeof WeakMap === 'function') {
+    var HostWeakMap = WeakMap;
+    // There is a WeakMap -- is it good enough?
+    if (typeof navigator !== 'undefined' &&
+        /Firefox/.test(navigator.userAgent)) ; else {
+      // IE 11 bug: WeakMaps silently fail to store frozen objects.
+      var testMap = new HostWeakMap();
+      var testObject = Object.freeze({});
+      testMap.set(testObject, 1);
+      if (testMap.get(testObject) !== 1) {
+        doubleWeakMapCheckSilentFailure = true;
+        // Fall through to installing our WeakMap.
+      } else {
+        module.exports = WeakMap;
+        return;
+      }
     }
-    return arr[i];
-}
+  }
+  var gopn = Object.getOwnPropertyNames;
+  var defProp = Object.defineProperty;
+  var isExtensible = Object.isExtensible;
 
-// custom quicksort that partially sorts bbox data alongside the hilbert values
-function sort(values, boxes, indices, left, right, nodeSize) {
-    if (Math.floor(left / nodeSize) >= Math.floor(right / nodeSize)) return;
+  /**
+   * Security depends on HIDDEN_NAME being both <i>unguessable</i> and
+   * <i>undiscoverable</i> by untrusted code.
+   *
+   * <p>Given the known weaknesses of Math.random() on existing
+   * browsers, it does not generate unguessability we can be confident
+   * of.
+   *
+   * <p>It is the monkey patching logic in this file that is intended
+   * to ensure undiscoverability. The basic idea is that there are
+   * three fundamental means of discovering properties of an object:
+   * The for/in loop, Object.keys(), and Object.getOwnPropertyNames(),
+   * as well as some proposed ES6 extensions that appear on our
+   * whitelist. The first two only discover enumerable properties, and
+   * we only use HIDDEN_NAME to name a non-enumerable property, so the
+   * only remaining threat should be getOwnPropertyNames and some
+   * proposed ES6 extensions that appear on our whitelist. We monkey
+   * patch them to remove HIDDEN_NAME from the list of properties they
+   * returns.
+   *
+   * <p>TODO(erights): On a platform with built-in Proxies, proxies
+   * could be used to trap and thereby discover the HIDDEN_NAME, so we
+   * need to monkey patch Proxy.create, Proxy.createFunction, etc, in
+   * order to wrap the provided handler with the real handler which
+   * filters out all traps using HIDDEN_NAME.
+   *
+   * <p>TODO(erights): Revisit Mike Stay's suggestion that we use an
+   * encapsulated function at a not-necessarily-secret name, which
+   * uses the Stiegler shared-state rights amplification pattern to
+   * reveal the associated value only to the WeakMap in which this key
+   * is associated with that value. Since only the key retains the
+   * function, the function can also remember the key without causing
+   * leakage of the key, so this doesn't violate our general gc
+   * goals. In addition, because the name need not be a guarded
+   * secret, we could efficiently handle cross-frame frozen keys.
+   */
+  var HIDDEN_NAME_PREFIX = 'weakmap:';
+  var HIDDEN_NAME = HIDDEN_NAME_PREFIX + 'ident:' + Math.random() + '___';
 
-    const pivot = values[(left + right) >> 1];
-    let i = left - 1;
-    let j = right + 1;
+  if (typeof crypto !== 'undefined' &&
+      typeof crypto.getRandomValues === 'function' &&
+      typeof ArrayBuffer === 'function' &&
+      typeof Uint8Array === 'function') {
+    var ab = new ArrayBuffer(25);
+    var u8s = new Uint8Array(ab);
+    crypto.getRandomValues(u8s);
+    HIDDEN_NAME = HIDDEN_NAME_PREFIX + 'rand:' +
+      Array.prototype.map.call(u8s, function(u8) {
+        return (u8 % 36).toString(36);
+      }).join('') + '___';
+  }
 
-    while (true) {
-        do i++; while (values[i] < pivot);
-        do j--; while (values[j] > pivot);
-        if (i >= j) break;
-        swap(values, boxes, indices, i, j);
+  function isNotHiddenName(name) {
+    return !(
+        name.substr(0, HIDDEN_NAME_PREFIX.length) == HIDDEN_NAME_PREFIX &&
+        name.substr(name.length - 3) === '___');
+  }
+
+  /**
+   * Monkey patch getOwnPropertyNames to avoid revealing the
+   * HIDDEN_NAME.
+   *
+   * <p>The ES5.1 spec requires each name to appear only once, but as
+   * of this writing, this requirement is controversial for ES6, so we
+   * made this code robust against this case. If the resulting extra
+   * search turns out to be expensive, we can probably relax this once
+   * ES6 is adequately supported on all major browsers, iff no browser
+   * versions we support at that time have relaxed this constraint
+   * without providing built-in ES6 WeakMaps.
+   */
+  defProp(Object, 'getOwnPropertyNames', {
+    value: function fakeGetOwnPropertyNames(obj) {
+      return gopn(obj).filter(isNotHiddenName);
     }
+  });
 
-    sort(values, boxes, indices, left, j, nodeSize);
-    sort(values, boxes, indices, j + 1, right, nodeSize);
-}
+  /**
+   * getPropertyNames is not in ES5 but it is proposed for ES6 and
+   * does appear in our whitelist, so we need to clean it too.
+   */
+  if ('getPropertyNames' in Object) {
+    var originalGetPropertyNames = Object.getPropertyNames;
+    defProp(Object, 'getPropertyNames', {
+      value: function fakeGetPropertyNames(obj) {
+        return originalGetPropertyNames(obj).filter(isNotHiddenName);
+      }
+    });
+  }
 
-// swap two values and two corresponding boxes
-function swap(values, boxes, indices, i, j) {
-    const temp = values[i];
-    values[i] = values[j];
-    values[j] = temp;
+  /**
+   * <p>To treat objects as identity-keys with reasonable efficiency
+   * on ES5 by itself (i.e., without any object-keyed collections), we
+   * need to add a hidden property to such key objects when we
+   * can. This raises several issues:
+   * <ul>
+   * <li>Arranging to add this property to objects before we lose the
+   *     chance, and
+   * <li>Hiding the existence of this new property from most
+   *     JavaScript code.
+   * <li>Preventing <i>certification theft</i>, where one object is
+   *     created falsely claiming to be the key of an association
+   *     actually keyed by another object.
+   * <li>Preventing <i>value theft</i>, where untrusted code with
+   *     access to a key object but not a weak map nevertheless
+   *     obtains access to the value associated with that key in that
+   *     weak map.
+   * </ul>
+   * We do so by
+   * <ul>
+   * <li>Making the name of the hidden property unguessable, so "[]"
+   *     indexing, which we cannot intercept, cannot be used to access
+   *     a property without knowing the name.
+   * <li>Making the hidden property non-enumerable, so we need not
+   *     worry about for-in loops or {@code Object.keys},
+   * <li>monkey patching those reflective methods that would
+   *     prevent extensions, to add this hidden property first,
+   * <li>monkey patching those methods that would reveal this
+   *     hidden property.
+   * </ul>
+   * Unfortunately, because of same-origin iframes, we cannot reliably
+   * add this hidden property before an object becomes
+   * non-extensible. Instead, if we encounter a non-extensible object
+   * without a hidden record that we can detect (whether or not it has
+   * a hidden record stored under a name secret to us), then we just
+   * use the key object itself to represent its identity in a brute
+   * force leaky map stored in the weak map, losing all the advantages
+   * of weakness for these.
+   */
+  function getHiddenRecord(key) {
+    if (key !== Object(key)) {
+      throw new TypeError('Not an object: ' + key);
+    }
+    var hiddenRecord = key[HIDDEN_NAME];
+    if (hiddenRecord && hiddenRecord.key === key) { return hiddenRecord; }
+    if (!isExtensible(key)) {
+      // Weak map must brute force, as explained in doc-comment above.
+      return void 0;
+    }
 
-    const k = 4 * i;
-    const m = 4 * j;
+    // The hiddenRecord and the key point directly at each other, via
+    // the "key" and HIDDEN_NAME properties respectively. The key
+    // field is for quickly verifying that this hidden record is an
+    // own property, not a hidden record from up the prototype chain.
+    //
+    // NOTE: Because this WeakMap emulation is meant only for systems like
+    // SES where Object.prototype is frozen without any numeric
+    // properties, it is ok to use an object literal for the hiddenRecord.
+    // This has two advantages:
+    // * It is much faster in a performance critical place
+    // * It avoids relying on Object.create(null), which had been
+    //   problematic on Chrome 28.0.1480.0. See
+    //   https://code.google.com/p/google-caja/issues/detail?id=1687
+    hiddenRecord = { key: key };
 
-    const a = boxes[k];
-    const b = boxes[k + 1];
-    const c = boxes[k + 2];
-    const d = boxes[k + 3];
-    boxes[k] = boxes[m];
-    boxes[k + 1] = boxes[m + 1];
-    boxes[k + 2] = boxes[m + 2];
-    boxes[k + 3] = boxes[m + 3];
-    boxes[m] = a;
-    boxes[m + 1] = b;
-    boxes[m + 2] = c;
-    boxes[m + 3] = d;
+    // When using this WeakMap emulation on platforms where
+    // Object.prototype might not be frozen and Object.create(null) is
+    // reliable, use the following two commented out lines instead.
+    // hiddenRecord = Object.create(null);
+    // hiddenRecord.key = key;
 
-    const e = indices[i];
-    indices[i] = indices[j];
-    indices[j] = e;
-}
+    // Please contact us if you need this to work on platforms where
+    // Object.prototype might not be frozen and
+    // Object.create(null) might not be reliable.
 
-// Fast Hilbert curve algorithm by http://threadlocalmutex.com/
-// Ported from C++ https://github.com/rawrunprotected/hilbert_curves (public domain)
-function hilbert(x, y) {
-    let a = x ^ y;
-    let b = 0xFFFF ^ a;
-    let c = 0xFFFF ^ (x | y);
-    let d = x & (y ^ 0xFFFF);
+    try {
+      defProp(key, HIDDEN_NAME, {
+        value: hiddenRecord,
+        writable: false,
+        enumerable: false,
+        configurable: false
+      });
+      return hiddenRecord;
+    } catch (error) {
+      // Under some circumstances, isExtensible seems to misreport whether
+      // the HIDDEN_NAME can be defined.
+      // The circumstances have not been isolated, but at least affect
+      // Node.js v0.10.26 on TravisCI / Linux, but not the same version of
+      // Node.js on OS X.
+      return void 0;
+    }
+  }
 
-    let A = a | (b >> 1);
-    let B = (a >> 1) ^ a;
-    let C = ((c >> 1) ^ (b & (d >> 1))) ^ c;
-    let D = ((a & (c >> 1)) ^ (d >> 1)) ^ d;
+  /**
+   * Monkey patch operations that would make their argument
+   * non-extensible.
+   *
+   * <p>The monkey patched versions throw a TypeError if their
+   * argument is not an object, so it should only be done to functions
+   * that should throw a TypeError anyway if their argument is not an
+   * object.
+   */
+  (function(){
+    var oldFreeze = Object.freeze;
+    defProp(Object, 'freeze', {
+      value: function identifyingFreeze(obj) {
+        getHiddenRecord(obj);
+        return oldFreeze(obj);
+      }
+    });
+    var oldSeal = Object.seal;
+    defProp(Object, 'seal', {
+      value: function identifyingSeal(obj) {
+        getHiddenRecord(obj);
+        return oldSeal(obj);
+      }
+    });
+    var oldPreventExtensions = Object.preventExtensions;
+    defProp(Object, 'preventExtensions', {
+      value: function identifyingPreventExtensions(obj) {
+        getHiddenRecord(obj);
+        return oldPreventExtensions(obj);
+      }
+    });
+  })();
 
-    a = A; b = B; c = C; d = D;
-    A = ((a & (a >> 2)) ^ (b & (b >> 2)));
-    B = ((a & (b >> 2)) ^ (b & ((a ^ b) >> 2)));
-    C ^= ((a & (c >> 2)) ^ (b & (d >> 2)));
-    D ^= ((b & (c >> 2)) ^ ((a ^ b) & (d >> 2)));
-
-    a = A; b = B; c = C; d = D;
-    A = ((a & (a >> 4)) ^ (b & (b >> 4)));
-    B = ((a & (b >> 4)) ^ (b & ((a ^ b) >> 4)));
-    C ^= ((a & (c >> 4)) ^ (b & (d >> 4)));
-    D ^= ((b & (c >> 4)) ^ ((a ^ b) & (d >> 4)));
-
-    a = A; b = B; c = C; d = D;
-    C ^= ((a & (c >> 8)) ^ (b & (d >> 8)));
-    D ^= ((b & (c >> 8)) ^ ((a ^ b) & (d >> 8)));
-
-    a = C ^ (C >> 1);
-    b = D ^ (D >> 1);
+  function constFunc(func) {
+    func.prototype = null;
+    return Object.freeze(func);
+  }
 
-    let i0 = x ^ y;
-    let i1 = b | (0xFFFF ^ (i0 | a));
+  var calledAsFunctionWarningDone = false;
+  function calledAsFunctionWarning() {
+    // Future ES6 WeakMap is currently (2013-09-10) expected to reject WeakMap()
+    // but we used to permit it and do it ourselves, so warn only.
+    if (!calledAsFunctionWarningDone && typeof console !== 'undefined') {
+      calledAsFunctionWarningDone = true;
+      console.warn('WeakMap should be invoked as new WeakMap(), not ' +
+          'WeakMap(). This will be an error in the future.');
+    }
+  }
 
-    i0 = (i0 | (i0 << 8)) & 0x00FF00FF;
-    i0 = (i0 | (i0 << 4)) & 0x0F0F0F0F;
-    i0 = (i0 | (i0 << 2)) & 0x33333333;
-    i0 = (i0 | (i0 << 1)) & 0x55555555;
+  var nextId = 0;
 
-    i1 = (i1 | (i1 << 8)) & 0x00FF00FF;
-    i1 = (i1 | (i1 << 4)) & 0x0F0F0F0F;
-    i1 = (i1 | (i1 << 2)) & 0x33333333;
-    i1 = (i1 | (i1 << 1)) & 0x55555555;
+  var OurWeakMap = function() {
+    if (!(this instanceof OurWeakMap)) {  // approximate test for new ...()
+      calledAsFunctionWarning();
+    }
 
-    return ((i1 << 1) | i0) >>> 0;
-}
+    // We are currently (12/25/2012) never encountering any prematurely
+    // non-extensible keys.
+    var keys = []; // brute force for prematurely non-extensible keys.
+    var values = []; // brute force for corresponding values.
+    var id = nextId++;
 
-var flatbush = /*#__PURE__*/Object.freeze({
-    __proto__: null,
-    'default': Flatbush
-});
+    function get___(key, opt_default) {
+      var index;
+      var hiddenRecord = getHiddenRecord(key);
+      if (hiddenRecord) {
+        return id in hiddenRecord ? hiddenRecord[id] : opt_default;
+      } else {
+        index = keys.indexOf(key);
+        return index >= 0 ? values[index] : opt_default;
+      }
+    }
 
-function quickselect(arr, k, left, right, compare) {
-    quickselectStep(arr, k, left || 0, right || (arr.length - 1), compare || defaultCompare);
-}
+    function has___(key) {
+      var hiddenRecord = getHiddenRecord(key);
+      if (hiddenRecord) {
+        return id in hiddenRecord;
+      } else {
+        return keys.indexOf(key) >= 0;
+      }
+    }
 
-function quickselectStep(arr, k, left, right, compare) {
+    function set___(key, value) {
+      var index;
+      var hiddenRecord = getHiddenRecord(key);
+      if (hiddenRecord) {
+        hiddenRecord[id] = value;
+      } else {
+        index = keys.indexOf(key);
+        if (index >= 0) {
+          values[index] = value;
+        } else {
+          // Since some browsers preemptively terminate slow turns but
+          // then continue computing with presumably corrupted heap
+          // state, we here defensively get keys.length first and then
+          // use it to update both the values and keys arrays, keeping
+          // them in sync.
+          index = keys.length;
+          values[index] = value;
+          // If we crash here, values will be one longer than keys.
+          keys[index] = key;
+        }
+      }
+      return this;
+    }
 
-    while (right > left) {
-        if (right - left > 600) {
-            var n = right - left + 1;
-            var m = k - left + 1;
-            var z = Math.log(n);
-            var s = 0.5 * Math.exp(2 * z / 3);
-            var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
-            var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
-            var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
-            quickselectStep(arr, k, newLeft, newRight, compare);
+    function delete___(key) {
+      var hiddenRecord = getHiddenRecord(key);
+      var index, lastIndex;
+      if (hiddenRecord) {
+        return id in hiddenRecord && delete hiddenRecord[id];
+      } else {
+        index = keys.indexOf(key);
+        if (index < 0) {
+          return false;
         }
+        // Since some browsers preemptively terminate slow turns but
+        // then continue computing with potentially corrupted heap
+        // state, we here defensively get keys.length first and then use
+        // it to update both the keys and the values array, keeping
+        // them in sync. We update the two with an order of assignments,
+        // such that any prefix of these assignments will preserve the
+        // key/value correspondence, either before or after the delete.
+        // Note that this needs to work correctly when index === lastIndex.
+        lastIndex = keys.length - 1;
+        keys[index] = void 0;
+        // If we crash here, there's a void 0 in the keys array, but
+        // no operation will cause a "keys.indexOf(void 0)", since
+        // getHiddenRecord(void 0) will always throw an error first.
+        values[index] = values[lastIndex];
+        // If we crash here, values[index] cannot be found here,
+        // because keys[index] is void 0.
+        keys[index] = keys[lastIndex];
+        // If index === lastIndex and we crash here, then keys[index]
+        // is still void 0, since the aliasing killed the previous key.
+        keys.length = lastIndex;
+        // If we crash here, keys will be one shorter than values.
+        values.length = lastIndex;
+        return true;
+      }
+    }
 
-        var t = arr[k];
-        var i = left;
-        var j = right;
+    return Object.create(OurWeakMap.prototype, {
+      get___:    { value: constFunc(get___) },
+      has___:    { value: constFunc(has___) },
+      set___:    { value: constFunc(set___) },
+      delete___: { value: constFunc(delete___) }
+    });
+  };
 
-        swap$1(arr, left, k);
-        if (compare(arr[right], t) > 0) swap$1(arr, left, right);
+  OurWeakMap.prototype = Object.create(Object.prototype, {
+    get: {
+      /**
+       * Return the value most recently associated with key, or
+       * opt_default if none.
+       */
+      value: function get(key, opt_default) {
+        return this.get___(key, opt_default);
+      },
+      writable: true,
+      configurable: true
+    },
 
-        while (i < j) {
-            swap$1(arr, i, j);
-            i++;
-            j--;
-            while (compare(arr[i], t) < 0) i++;
-            while (compare(arr[j], t) > 0) j--;
-        }
+    has: {
+      /**
+       * Is there a value associated with key in this WeakMap?
+       */
+      value: function has(key) {
+        return this.has___(key);
+      },
+      writable: true,
+      configurable: true
+    },
 
-        if (compare(arr[left], t) === 0) swap$1(arr, left, j);
-        else {
-            j++;
-            swap$1(arr, j, right);
-        }
+    set: {
+      /**
+       * Associate value with key in this WeakMap, overwriting any
+       * previous association if present.
+       */
+      value: function set(key, value) {
+        return this.set___(key, value);
+      },
+      writable: true,
+      configurable: true
+    },
 
-        if (j <= k) left = j + 1;
-        if (k <= j) right = j - 1;
+    'delete': {
+      /**
+       * Remove any association for key in this WeakMap, returning
+       * whether there was one.
+       *
+       * <p>Note that the boolean return here does not work like the
+       * {@code delete} operator. The {@code delete} operator returns
+       * whether the deletion succeeds at bringing about a state in
+       * which the deleted property is absent. The {@code delete}
+       * operator therefore returns true if the property was already
+       * absent, whereas this {@code delete} method returns false if
+       * the association was already absent.
+       */
+      value: function remove(key) {
+        return this.delete___(key);
+      },
+      writable: true,
+      configurable: true
     }
-}
+  });
 
-function swap$1(arr, i, j) {
-    var tmp = arr[i];
-    arr[i] = arr[j];
-    arr[j] = tmp;
-}
+  if (typeof HostWeakMap === 'function') {
+    (function() {
+      // If we got here, then the platform has a WeakMap but we are concerned
+      // that it may refuse to store some key types. Therefore, make a map
+      // implementation which makes use of both as possible.
 
-function defaultCompare(a, b) {
-    return a < b ? -1 : a > b ? 1 : 0;
-}
+      // In this mode we are always using double maps, so we are not proxy-safe.
+      // This combination does not occur in any known browser, but we had best
+      // be safe.
+      if (doubleWeakMapCheckSilentFailure && typeof Proxy !== 'undefined') {
+        Proxy = undefined;
+      }
 
-class RBush {
-    constructor(maxEntries = 9) {
-        // max entries in a node is 9 by default; min node fill is 40% for best performance
-        this._maxEntries = Math.max(4, maxEntries);
-        this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4));
-        this.clear();
-    }
+      function DoubleWeakMap() {
+        if (!(this instanceof OurWeakMap)) {  // approximate test for new ...()
+          calledAsFunctionWarning();
+        }
 
-    all() {
-        return this._all(this.data, []);
-    }
-
-    search(bbox) {
-        let node = this.data;
-        const result = [];
-
-        if (!intersects(bbox, node)) return result;
+        // Preferable, truly weak map.
+        var hmap = new HostWeakMap();
 
-        const toBBox = this.toBBox;
-        const nodesToSearch = [];
+        // Our hidden-property-based pseudo-weak-map. Lazily initialized in the
+        // 'set' implementation; thus we can avoid performing extra lookups if
+        // we know all entries actually stored are entered in 'hmap'.
+        var omap = undefined;
 
-        while (node) {
-            for (let i = 0; i < node.children.length; i++) {
-                const child = node.children[i];
-                const childBBox = node.leaf ? toBBox(child) : child;
+        // Hidden-property maps are not compatible with proxies because proxies
+        // can observe the hidden name and either accidentally expose it or fail
+        // to allow the hidden property to be set. Therefore, we do not allow
+        // arbitrary WeakMaps to switch to using hidden properties, but only
+        // those which need the ability, and unprivileged code is not allowed
+        // to set the flag.
+        //
+        // (Except in doubleWeakMapCheckSilentFailure mode in which case we
+        // disable proxies.)
+        var enableSwitching = false;
 
-                if (intersects(bbox, childBBox)) {
-                    if (node.leaf) result.push(child);
-                    else if (contains(bbox, childBBox)) this._all(child, result);
-                    else nodesToSearch.push(child);
-                }
-            }
-            node = nodesToSearch.pop();
+        function dget(key, opt_default) {
+          if (omap) {
+            return hmap.has(key) ? hmap.get(key)
+                : omap.get___(key, opt_default);
+          } else {
+            return hmap.get(key, opt_default);
+          }
         }
 
-        return result;
-    }
-
-    collides(bbox) {
-        let node = this.data;
-
-        if (!intersects(bbox, node)) return false;
-
-        const nodesToSearch = [];
-        while (node) {
-            for (let i = 0; i < node.children.length; i++) {
-                const child = node.children[i];
-                const childBBox = node.leaf ? this.toBBox(child) : child;
-
-                if (intersects(bbox, childBBox)) {
-                    if (node.leaf || contains(bbox, childBBox)) return true;
-                    nodesToSearch.push(child);
-                }
-            }
-            node = nodesToSearch.pop();
+        function dhas(key) {
+          return hmap.has(key) || (omap ? omap.has___(key) : false);
         }
 
-        return false;
-    }
-
-    load(data) {
-        if (!(data && data.length)) return this;
-
-        if (data.length < this._minEntries) {
-            for (let i = 0; i < data.length; i++) {
-                this.insert(data[i]);
+        var dset;
+        if (doubleWeakMapCheckSilentFailure) {
+          dset = function(key, value) {
+            hmap.set(key, value);
+            if (!hmap.has(key)) {
+              if (!omap) { omap = new OurWeakMap(); }
+              omap.set(key, value);
+            }
+            return this;
+          };
+        } else {
+          dset = function(key, value) {
+            if (enableSwitching) {
+              try {
+                hmap.set(key, value);
+              } catch (e) {
+                if (!omap) { omap = new OurWeakMap(); }
+                omap.set___(key, value);
+              }
+            } else {
+              hmap.set(key, value);
             }
             return this;
+          };
         }
 
-        // recursively build the tree with the given data from scratch using OMT algorithm
-        let node = this._build(data.slice(), 0, data.length - 1, 0);
-
-        if (!this.data.children.length) {
-            // save as is if tree is empty
-            this.data = node;
-
-        } else if (this.data.height === node.height) {
-            // split root if trees have the same height
-            this._splitRoot(this.data, node);
+        function ddelete(key) {
+          var result = !!hmap['delete'](key);
+          if (omap) { return omap.delete___(key) || result; }
+          return result;
+        }
 
-        } else {
-            if (this.data.height < node.height) {
-                // swap trees if inserted one is bigger
-                const tmpNode = this.data;
-                this.data = node;
-                node = tmpNode;
+        return Object.create(OurWeakMap.prototype, {
+          get___:    { value: constFunc(dget) },
+          has___:    { value: constFunc(dhas) },
+          set___:    { value: constFunc(dset) },
+          delete___: { value: constFunc(ddelete) },
+          permitHostObjects___: { value: constFunc(function(token) {
+            if (token === weakMapPermitHostObjects) {
+              enableSwitching = true;
+            } else {
+              throw new Error('bogus call to permitHostObjects___');
             }
+          })}
+        });
+      }
+      DoubleWeakMap.prototype = OurWeakMap.prototype;
+      module.exports = DoubleWeakMap;
 
-            // insert the small tree into the large tree at appropriate level
-            this._insert(node, this.data.height - node.height - 1, true);
-        }
+      // define .constructor to hide OurWeakMap ctor
+      Object.defineProperty(WeakMap.prototype, 'constructor', {
+        value: WeakMap,
+        enumerable: false,  // as default .constructor is
+        configurable: true,
+        writable: true
+      });
+    })();
+  } else {
+    // There is no host WeakMap, so we must use the emulation.
 
-        return this;
+    // Emulated WeakMaps are incompatible with native proxies (because proxies
+    // can observe the hidden name), so we must disable Proxy usage (in
+    // ArrayLike and Domado, currently).
+    if (typeof Proxy !== 'undefined') {
+      Proxy = undefined;
     }
 
-    insert(item) {
-        if (item) this._insert(item, this.data.height - 1);
-        return this;
-    }
+    module.exports = OurWeakMap;
+  }
+})();
+});
 
-    clear() {
-        this.data = createNode([]);
-        return this;
-    }
+var weakMap$1 = (typeof WeakMap !== 'undefined') ? WeakMap : weakMap;
 
-    remove(item, equalsFn) {
-        if (!item) return this;
+var shimObject = Object;
 
-        let node = this.data;
-        const bbox = this.toBBox(item);
-        const path = [];
-        const indexes = [];
-        let i, parent, goingUp;
+/*
+    Based in part on extras from Motorola Mobility’s Montage
+    Copyright (c) 2012, Motorola Mobility LLC. All Rights Reserved.
+    3-Clause BSD License
+    https://github.com/motorola-mobility/montage/blob/master/LICENSE.md
+*/
 
-        // depth-first iterative tree traversal
-        while (node || path.length) {
+/**
+    Defines extensions to intrinsic <code>Object</code>.
+    @see [Object class]{@link external:Object}
+*/
 
-            if (!node) { // go up
-                node = path.pop();
-                parent = path[path.length - 1];
-                i = indexes.pop();
-                goingUp = true;
-            }
+/**
+    A utility object to avoid unnecessary allocations of an empty object
+    <code>{}</code>.  This object is frozen so it is safe to share.
 
-            if (node.leaf) { // check current node
-                const index = findItem(item, node.children, equalsFn);
+    @object external:Object.empty
+*/
+Object.empty = Object.freeze(Object.create(null));
 
-                if (index !== -1) {
-                    // item found, remove the item and condense tree upwards
-                    node.children.splice(index, 1);
-                    path.push(node);
-                    this._condense(path);
-                    return this;
-                }
-            }
+/**
+    Returns whether the given value is an object, as opposed to a value.
+    Unboxed numbers, strings, true, false, undefined, and null are not
+    objects.  Arrays are objects.
 
-            if (!goingUp && !node.leaf && contains(node, bbox)) { // go down
-                path.push(node);
-                indexes.push(i);
-                i = 0;
-                parent = node;
-                node = node.children[0];
+    @function external:Object.isObject
+    @param {Any} value
+    @returns {Boolean} whether the given value is an object
+*/
+Object.isObject = function (object) {
+    return Object(object) === object;
+};
 
-            } else if (parent) { // go right
-                i++;
-                node = parent.children[i];
-                goingUp = false;
+/**
+    Returns the value of an any value, particularly objects that
+    implement <code>valueOf</code>.
 
-            } else node = null; // nothing found
-        }
+    <p>Note that, unlike the precedent of methods like
+    <code>Object.equals</code> and <code>Object.compare</code> would suggest,
+    this method is named <code>Object.getValueOf</code> instead of
+    <code>valueOf</code>.  This is a delicate issue, but the basis of this
+    decision is that the JavaScript runtime would be far more likely to
+    accidentally call this method with no arguments, assuming that it would
+    return the value of <code>Object</code> itself in various situations,
+    whereas <code>Object.equals(Object, null)</code> protects against this case
+    by noting that <code>Object</code> owns the <code>equals</code> property
+    and therefore does not delegate to it.
 
-        return this;
+    @function external:Object.getValueOf
+    @param {Any} value a value or object wrapping a value
+    @returns {Any} the primitive value of that object, if one exists, or passes
+    the value through
+*/
+Object.getValueOf = function (value) {
+    if (value && typeof value.valueOf === "function") {
+        value = value.valueOf();
     }
+    return value;
+};
 
-    toBBox(item) { return item; }
-
-    compareMinX(a, b) { return a.minX - b.minX; }
-    compareMinY(a, b) { return a.minY - b.minY; }
-
-    toJSON() { return this.data; }
-
-    fromJSON(data) {
-        this.data = data;
-        return this;
-    }
-
-    _all(node, result) {
-        const nodesToSearch = [];
-        while (node) {
-            if (node.leaf) result.push(...node.children);
-            else nodesToSearch.push(...node.children);
-
-            node = nodesToSearch.pop();
+var hashMap = new weakMap$1();
+Object.hash = function (object) {
+    if (object && typeof object.hash === "function") {
+        return "" + object.hash();
+    } else if (Object(object) === object) {
+        if (!hashMap.has(object)) {
+            hashMap.set(object, Math.random().toString(36).slice(2));
         }
-        return result;
+        return hashMap.get(object);
+    } else {
+        return "" + object;
     }
+};
 
-    _build(items, left, right, height) {
-
-        const N = right - left + 1;
-        let M = this._maxEntries;
-        let node;
-
-        if (N <= M) {
-            // reached leaf level; return leaf
-            node = createNode(items.slice(left, right + 1));
-            calcBBox(node, this.toBBox);
-            return node;
-        }
-
-        if (!height) {
-            // target height of the bulk-loaded tree
-            height = Math.ceil(Math.log(N) / Math.log(M));
-
-            // target number of root entries to maximize storage utilization
-            M = Math.ceil(N / Math.pow(M, height - 1));
-        }
-
-        node = createNode([]);
-        node.leaf = false;
-        node.height = height;
-
-        // split the items into M mostly square tiles
+/**
+    A shorthand for <code>Object.prototype.hasOwnProperty.call(object,
+    key)</code>.  Returns whether the object owns a property for the given key.
+    It does not consult the prototype chain and works for any string (including
+    "hasOwnProperty") except "__proto__".
 
-        const N2 = Math.ceil(N / M);
-        const N1 = N2 * Math.ceil(Math.sqrt(M));
+    @function external:Object.owns
+    @param {Object} object
+    @param {String} key
+    @returns {Boolean} whether the object owns a property wfor the given key.
+*/
+var owns = Object.prototype.hasOwnProperty;
+Object.owns = function (object, key) {
+    return owns.call(object, key);
+};
 
-        multiSelect(items, left, right, N1, this.compareMinX);
+/**
+    A utility that is like Object.owns but is also useful for finding
+    properties on the prototype chain, provided that they do not refer to
+    methods on the Object prototype.  Works for all strings except "__proto__".
 
-        for (let i = left; i <= right; i += N1) {
+    <p>Alternately, you could use the "in" operator as long as the object
+    descends from "null" instead of the Object.prototype, as with
+    <code>Object.create(null)</code>.  However,
+    <code>Object.create(null)</code> only works in fully compliant EcmaScript 5
+    JavaScript engines and cannot be faithfully shimmed.
 
-            const right2 = Math.min(i + N1 - 1, right);
+    <p>If the given object is an instance of a type that implements a method
+    named "has", this function defers to the collection, so this method can be
+    used to generically handle objects, arrays, or other collections.  In that
+    case, the domain of the key depends on the instance.
 
-            multiSelect(items, i, right2, N2, this.compareMinY);
+    @param {Object} object
+    @param {String} key
+    @returns {Boolean} whether the object, or any of its prototypes except
+    <code>Object.prototype</code>
+    @function external:Object.has
+*/
+Object.has = function (object, key) {
+    if (typeof object !== "object") {
+        throw new Error("Object.has can't accept non-object: " + typeof object);
+    }
+    // forward to mapped collections that implement "has"
+    if (object && typeof object.has === "function") {
+        return object.has(key);
+    // otherwise report whether the key is on the prototype chain,
+    // as long as it is not one of the methods on object.prototype
+    } else if (typeof key === "string") {
+        return key in object && object[key] !== Object.prototype[key];
+    } else {
+        throw new Error("Key must be a string for Object.has on plain objects");
+    }
+};
 
-            for (let j = i; j <= right2; j += N2) {
+/**
+    Gets the value for a corresponding key from an object.
 
-                const right3 = Math.min(j + N2 - 1, right2);
+    <p>Uses Object.has to determine whether there is a corresponding value for
+    the given key.  As such, <code>Object.get</code> is capable of retriving
+    values from the prototype chain as long as they are not from the
+    <code>Object.prototype</code>.
 
-                // pack each entry recursively
-                node.children.push(this._build(items, j, right3, height - 1));
-            }
-        }
+    <p>If there is no corresponding value, returns the given default, which may
+    be <code>undefined</code>.
 
-        calcBBox(node, this.toBBox);
+    <p>If the given object is an instance of a type that implements a method
+    named "get", this function defers to the collection, so this method can be
+    used to generically handle objects, arrays, or other collections.  In that
+    case, the domain of the key depends on the implementation.  For a `Map`,
+    for example, the key might be any object.
 
-        return node;
+    @param {Object} object
+    @param {String} key
+    @param {Any} value a default to return, <code>undefined</code> if omitted
+    @returns {Any} value for key, or default value
+    @function external:Object.get
+*/
+Object.get = function (object, key, value) {
+    if (typeof object !== "object") {
+        throw new Error("Object.get can't accept non-object: " + typeof object);
     }
+    // forward to mapped collections that implement "get"
+    if (object && typeof object.get === "function") {
+        return object.get(key, value);
+    } else if (Object.has(object, key)) {
+        return object[key];
+    } else {
+        return value;
+    }
+};
 
-    _chooseSubtree(bbox, node, level, path) {
-        while (true) {
-            path.push(node);
-
-            if (node.leaf || path.length - 1 === level) break;
-
-            let minArea = Infinity;
-            let minEnlargement = Infinity;
-            let targetNode;
+/**
+    Sets the value for a given key on an object.
 
-            for (let i = 0; i < node.children.length; i++) {
-                const child = node.children[i];
-                const area = bboxArea(child);
-                const enlargement = enlargedArea(bbox, child) - area;
+    <p>If the given object is an instance of a type that implements a method
+    named "set", this function defers to the collection, so this method can be
+    used to generically handle objects, arrays, or other collections.  As such,
+    the key domain varies by the object type.
 
-                // choose entry with the least area enlargement
-                if (enlargement < minEnlargement) {
-                    minEnlargement = enlargement;
-                    minArea = area < minArea ? area : minArea;
-                    targetNode = child;
+    @param {Object} object
+    @param {String} key
+    @param {Any} value
+    @returns <code>undefined</code>
+    @function external:Object.set
+*/
+Object.set = function (object, key, value) {
+    if (object && typeof object.set === "function") {
+        object.set(key, value);
+    } else {
+        object[key] = value;
+    }
+};
 
-                } else if (enlargement === minEnlargement) {
-                    // otherwise choose one with the smallest area
-                    if (area < minArea) {
-                        minArea = area;
-                        targetNode = child;
-                    }
-                }
+Object.addEach = function (target, source, overrides) {
+    var overridesExistingProperty = arguments.length === 3 ? overrides : true;
+    if (!source) ; else if (typeof source.forEach === "function" && !source.hasOwnProperty("forEach")) {
+        // copy map-alikes
+        if (source.isMap === true) {
+            source.forEach(function (value, key) {
+                target[key] = value;
+            });
+        // iterate key value pairs of other iterables
+        } else {
+            source.forEach(function (pair) {
+                target[pair[0]] = pair[1];
+            });
+        }
+    } else if (typeof source.length === "number") {
+        // arguments, strings
+        for (var index = 0; index < source.length; index++) {
+            target[index] = source[index];
+        }
+    } else {
+        // copy other objects as map-alikes
+        for(var keys = Object.keys(source), i = 0, key;(key = keys[i]); i++) {
+            if(overridesExistingProperty || !Object.owns(target,key)) {
+                target[key] = source[key];
             }
-
-            node = targetNode || node.children[0];
         }
-
-        return node;
     }
+    return target;
+};
 
-    _insert(item, level, isNode) {
-        const bbox = isNode ? item : this.toBBox(item);
-        const insertPath = [];
-
-        // find the best node for accommodating the item, saving all nodes along the path too
-        const node = this._chooseSubtree(bbox, this.data, level, insertPath);
-
-        // put the item into the node
-        node.children.push(item);
-        extend(node, bbox);
 
-        // split on node overflow; propagate upwards if necessary
-        while (level >= 0) {
-            if (insertPath[level].children.length > this._maxEntries) {
-                this._split(insertPath, level);
-                level--;
-            } else break;
+/*
+var defineEach = function defineEach(target, prototype) {
+    // console.log("Map defineEach: ",Object.keys(prototype));
+    var proto = Map.prototype;
+    for (var name in prototype) {
+        if(!proto.hasOwnProperty(name)) {
+            Object.defineProperty(proto, name, {
+                value: prototype[name],
+                writable: writable,
+                configurable: configurable,
+                enumerable: enumerable
+            });
         }
-
-        // adjust bboxes along the insertion path
-        this._adjustParentBBoxes(bbox, insertPath, level);
     }
+}
+*/
+Object.defineEach = function (target, source, overrides, configurable, enumerable, writable) {
+    var overridesExistingProperty = arguments.length === 3 ? overrides : true;
+    if (!source) ; else if (typeof source.forEach === "function" && !source.hasOwnProperty("forEach")) {
+        // copy map-alikes
+        if (source.isMap === true) {
+            source.forEach(function (value, key) {
+                Object.defineProperty(target, key, {
+                    value: value,
+                    writable: writable,
+                    configurable: configurable,
+                    enumerable: enumerable
+                });
+            });
+        // iterate key value pairs of other iterables
+        } else {
+            source.forEach(function (pair) {
+                Object.defineProperty(target, pair[0], {
+                    value: pair[1],
+                    writable: writable,
+                    configurable: configurable,
+                    enumerable: enumerable
+                });
 
-    // split overflowed node into two
-    _split(insertPath, level) {
-        const node = insertPath[level];
-        const M = node.children.length;
-        const m = this._minEntries;
-
-        this._chooseSplitAxis(node, m, M);
-
-        const splitIndex = this._chooseSplitIndex(node, m, M);
-
-        const newNode = createNode(node.children.splice(splitIndex, node.children.length - splitIndex));
-        newNode.height = node.height;
-        newNode.leaf = node.leaf;
-
-        calcBBox(node, this.toBBox);
-        calcBBox(newNode, this.toBBox);
-
-        if (level) insertPath[level - 1].children.push(newNode);
-        else this._splitRoot(node, newNode);
-    }
-
-    _splitRoot(node, newNode) {
-        // split root node
-        this.data = createNode([node, newNode]);
-        this.data.height = node.height + 1;
-        this.data.leaf = false;
-        calcBBox(this.data, this.toBBox);
-    }
-
-    _chooseSplitIndex(node, m, M) {
-        let index;
-        let minOverlap = Infinity;
-        let minArea = Infinity;
-
-        for (let i = m; i <= M - m; i++) {
-            const bbox1 = distBBox(node, 0, i, this.toBBox);
-            const bbox2 = distBBox(node, i, M, this.toBBox);
-
-            const overlap = intersectionArea(bbox1, bbox2);
-            const area = bboxArea(bbox1) + bboxArea(bbox2);
-
-            // choose distribution with minimum overlap
-            if (overlap < minOverlap) {
-                minOverlap = overlap;
-                index = i;
+            });
+        }
+    } else if (typeof source.length === "number") {
+        // arguments, strings
+        for (var index = 0; index < source.length; index++) {
+            Object.defineProperty(target, index, {
+                value: source[index],
+                writable: writable,
+                configurable: configurable,
+                enumerable: enumerable
+            });
 
-                minArea = area < minArea ? area : minArea;
+        }
+    } else {
+        // copy other objects as map-alikes
+        for(var keys = Object.keys(source), i = 0, key;(key = keys[i]); i++) {
+            if(overridesExistingProperty || !Object.owns(target,key)) {
+                Object.defineProperty(target, key, {
+                    value: source[key],
+                    writable: writable,
+                    configurable: configurable,
+                    enumerable: enumerable
+                });
 
-            } else if (overlap === minOverlap) {
-                // otherwise choose distribution with minimum area
-                if (area < minArea) {
-                    minArea = area;
-                    index = i;
-                }
             }
         }
-
-        return index || M - m;
-    }
-
-    // sorts node children by the best axis for split
-    _chooseSplitAxis(node, m, M) {
-        const compareMinX = node.leaf ? this.compareMinX : compareNodeMinX;
-        const compareMinY = node.leaf ? this.compareMinY : compareNodeMinY;
-        const xMargin = this._allDistMargin(node, m, M, compareMinX);
-        const yMargin = this._allDistMargin(node, m, M, compareMinY);
-
-        // if total distributions margin value is minimal for x, sort by minX,
-        // otherwise it's already sorted by minY
-        if (xMargin < yMargin) node.children.sort(compareMinX);
     }
+    return target;
+};
 
-    // total margin of all possible split distributions where each node is at least m full
-    _allDistMargin(node, m, M, compare) {
-        node.children.sort(compare);
+/**
+    Iterates over the owned properties of an object.
 
-        const toBBox = this.toBBox;
-        const leftBBox = distBBox(node, 0, m, toBBox);
-        const rightBBox = distBBox(node, M - m, M, toBBox);
-        let margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);
+    @function external:Object.forEach
+    @param {Object} object an object to iterate.
+    @param {Function} callback a function to call for every key and value
+    pair in the object.  Receives <code>value</code>, <code>key</code>,
+    and <code>object</code> as arguments.
+    @param {Object} thisp the <code>this</code> to pass through to the
+    callback
+*/
+Object.forEach = function (object, callback, thisp) {
 
-        for (let i = m; i < M - m; i++) {
-            const child = node.children[i];
-            extend(leftBBox, node.leaf ? toBBox(child) : child);
-            margin += bboxMargin(leftBBox);
-        }
+    var keys = Object.keys(object), i = 0, iKey;
+    for(;(iKey = keys[i]);i++) {
+        callback.call(thisp, object[iKey], iKey, object);
+    }
 
-        for (let i = M - m - 1; i >= m; i--) {
-            const child = node.children[i];
-            extend(rightBBox, node.leaf ? toBBox(child) : child);
-            margin += bboxMargin(rightBBox);
-        }
+};
 
-        return margin;
-    }
+/**
+    Iterates over the owned properties of a map, constructing a new array of
+    mapped values.
 
-    _adjustParentBBoxes(bbox, path, level) {
-        // adjust bboxes along the given tree path
-        for (let i = level; i >= 0; i--) {
-            extend(path[i], bbox);
-        }
+    @function external:Object.map
+    @param {Object} object an object to iterate.
+    @param {Function} callback a function to call for every key and value
+    pair in the object.  Receives <code>value</code>, <code>key</code>,
+    and <code>object</code> as arguments.
+    @param {Object} thisp the <code>this</code> to pass through to the
+    callback
+    @returns {Array} the respective values returned by the callback for each
+    item in the object.
+*/
+Object.map = function (object, callback, thisp) {
+    var keys = Object.keys(object), i = 0, result = [], iKey;
+    for(;(iKey = keys[i]);i++) {
+        result.push(callback.call(thisp, object[iKey], iKey, object));
     }
+    return result;
+};
 
-    _condense(path) {
-        // go through the path, removing empty nodes and updating bboxes
-        for (let i = path.length - 1, siblings; i >= 0; i--) {
-            if (path[i].children.length === 0) {
-                if (i > 0) {
-                    siblings = path[i - 1].children;
-                    siblings.splice(siblings.indexOf(path[i]), 1);
+/**
+    Returns the values for owned properties of an object.
 
-                } else this.clear();
+    @function external:Object.map
+    @param {Object} object
+    @returns {Array} the respective value for each owned property of the
+    object.
+*/
+Object.values = function (object) {
+    return Object.map(object, Function.identity);
+};
 
-            } else calcBBox(path[i], this.toBBox);
-        }
+// TODO inline document concat
+Object.concat = function () {
+    var object = {};
+    for (var i = 0; i < arguments.length; i++) {
+        Object.addEach(object, arguments[i]);
     }
-}
+    return object;
+};
 
-function findItem(item, items, equalsFn) {
-    if (!equalsFn) return items.indexOf(item);
+Object.from = Object.concat;
 
-    for (let i = 0; i < items.length; i++) {
-        if (equalsFn(item, items[i])) return i;
+/**
+    Returns whether two values are identical.  Any value is identical to itself
+    and only itself.  This is much more restictive than equivalence and subtly
+    different than strict equality, <code>===</code> because of edge cases
+    including negative zero and <code>NaN</code>.  Identity is useful for
+    resolving collisions among keys in a mapping where the domain is any value.
+    This method does not delgate to any method on an object and cannot be
+    overridden.
+    @see http://wiki.ecmascript.org/doku.php?id=harmony:egal
+    @param {Any} this
+    @param {Any} that
+    @returns {Boolean} whether this and that are identical
+    @function external:Object.is
+*/
+Object.is = function (x, y) {
+    if (x === y) {
+        // 0 === -0, but they are not identical
+        return x !== 0 || 1 / x === 1 / y;
     }
-    return -1;
-}
-
-// calculate node's bbox from bboxes of its children
-function calcBBox(node, toBBox) {
-    distBBox(node, 0, node.children.length, toBBox, node);
-}
+    // NaN !== NaN, but they are identical.
+    // NaNs are the only non-reflexive value, i.e., if x !== x,
+    // then x is a NaN.
+    // isNaN is broken: it converts its argument to number, so
+    // isNaN("foo") => true
+    return x !== x && y !== y;
+};
 
-// min bounding rectangle of node children from k to p-1
-function distBBox(node, k, p, toBBox, destNode) {
-    if (!destNode) destNode = createNode(null);
-    destNode.minX = Infinity;
-    destNode.minY = Infinity;
-    destNode.maxX = -Infinity;
-    destNode.maxY = -Infinity;
+/**
+    Performs a polymorphic, type-sensitive deep equivalence comparison of any
+    two values.
 
-    for (let i = k; i < p; i++) {
-        const child = node.children[i];
-        extend(destNode, node.leaf ? toBBox(child) : child);
-    }
+    <p>As a basic principle, any value is equivalent to itself (as in
+    identity), any boxed version of itself (as a <code>new Number(10)</code> is
+    to 10), and any deep clone of itself.
 
-    return destNode;
-}
+    <p>Equivalence has the following properties:
 
-function extend(a, b) {
-    a.minX = Math.min(a.minX, b.minX);
-    a.minY = Math.min(a.minY, b.minY);
-    a.maxX = Math.max(a.maxX, b.maxX);
-    a.maxY = Math.max(a.maxY, b.maxY);
-    return a;
-}
-
-function compareNodeMinX(a, b) { return a.minX - b.minX; }
-function compareNodeMinY(a, b) { return a.minY - b.minY; }
-
-function bboxArea(a)   { return (a.maxX - a.minX) * (a.maxY - a.minY); }
-function bboxMargin(a) { return (a.maxX - a.minX) + (a.maxY - a.minY); }
-
-function enlargedArea(a, b) {
-    return (Math.max(b.maxX, a.maxX) - Math.min(b.minX, a.minX)) *
-           (Math.max(b.maxY, a.maxY) - Math.min(b.minY, a.minY));
-}
+    <ul>
+        <li><strong>polymorphic:</strong>
+            If the given object is an instance of a type that implements a
+            methods named "equals", this function defers to the method.  So,
+            this function can safely compare any values regardless of type,
+            including undefined, null, numbers, strings, any pair of objects
+            where either implements "equals", or object literals that may even
+            contain an "equals" key.
+        <li><strong>type-sensitive:</strong>
+            Incomparable types are not equal.  No object is equivalent to any
+            array.  No string is equal to any other number.
+        <li><strong>deep:</strong>
+            Collections with equivalent content are equivalent, recursively.
+        <li><strong>equivalence:</strong>
+            Identical values and objects are equivalent, but so are collections
+            that contain equivalent content.  Whether order is important varies
+            by type.  For Arrays and lists, order is important.  For Objects,
+            maps, and sets, order is not important.  Boxed objects are mutally
+            equivalent with their unboxed values, by virtue of the standard
+            <code>valueOf</code> method.
+    </ul>
+    @param this
+    @param that
+    @returns {Boolean} whether the values are deeply equivalent
+    @function external:Object.equals
+*/
+Object.equals = function (a, b, equals, memo) {
+    equals = equals || Object.equals;
+    //console.log("Object.equals: a:",a, "b:",b, "equals:",equals);
+    // unbox objects, but do not confuse object literals
+    a = Object.getValueOf(a);
+    b = Object.getValueOf(b);
+    if (a === b)
+        return true;
+    if (Object.isObject(a)) {
+        memo = memo || new weakMap$1();
+        if (memo.has(a)) {
+            return true;
+        }
+        memo.set(a, true);
+    }
+    if (Object.isObject(a) && typeof a.equals === "function") {
+        return a.equals(b, equals, memo);
+    }
+    // commutative
+    if (Object.isObject(b) && typeof b.equals === "function") {
+        return b.equals(a, equals, memo);
+    }
+    if (Object.isObject(a) && Object.isObject(b)) {
+        if (Object.getPrototypeOf(a) === Object.prototype && Object.getPrototypeOf(b) === Object.prototype) {
+            for (var name in a) {
+                if (!equals(a[name], b[name], equals, memo)) {
+                    return false;
+                }
+            }
+            for (var name in b) {
+                if (!(name in a) || !equals(b[name], a[name], equals, memo)) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+    // NaN !== NaN, but they are equal.
+    // NaNs are the only non-reflexive value, i.e., if x !== x,
+    // then x is a NaN.
+    // isNaN is broken: it converts its argument to number, so
+    // isNaN("foo") => true
+    // We have established that a !== b, but if a !== a && b !== b, they are
+    // both NaN.
+    if (a !== a && b !== b)
+        return true;
+    if (!a || !b)
+        return a === b;
+    return false;
+};
 
-function intersectionArea(a, b) {
-    const minX = Math.max(a.minX, b.minX);
-    const minY = Math.max(a.minY, b.minY);
-    const maxX = Math.min(a.maxX, b.maxX);
-    const maxY = Math.min(a.maxY, b.maxY);
+// Because a return value of 0 from a `compare` function  may mean either
+// "equals" or "is incomparable", `equals` cannot be defined in terms of
+// `compare`.  However, `compare` *can* be defined in terms of `equals` and
+// `lessThan`.  Again however, more often it would be desirable to implement
+// all of the comparison functions in terms of compare rather than the other
+// way around.
 
-    return Math.max(0, maxX - minX) *
-           Math.max(0, maxY - minY);
-}
+/**
+    Determines the order in which any two objects should be sorted by returning
+    a number that has an analogous relationship to zero as the left value to
+    the right.  That is, if the left is "less than" the right, the returned
+    value will be "less than" zero, where "less than" may be any other
+    transitive relationship.
 
-function contains(a, b) {
-    return a.minX <= b.minX &&
-           a.minY <= b.minY &&
-           b.maxX <= a.maxX &&
-           b.maxY <= a.maxY;
-}
+    <p>Arrays are compared by the first diverging values, or by length.
 
-function intersects(a, b) {
-    return b.minX <= a.maxX &&
-           b.minY <= a.maxY &&
-           b.maxX >= a.minX &&
-           b.maxY >= a.minY;
-}
+    <p>Any two values that are incomparable return zero.  As such,
+    <code>equals</code> should not be implemented with <code>compare</code>
+    since incomparability is indistinguishable from equality.
 
-function createNode(children) {
-    return {
-        children,
-        height: 1,
-        leaf: true,
-        minX: Infinity,
-        minY: Infinity,
-        maxX: -Infinity,
-        maxY: -Infinity
-    };
-}
+    <p>Sorts strings lexicographically.  This is not suitable for any
+    particular international setting.  Different locales sort their phone books
+    in very different ways, particularly regarding diacritics and ligatures.
 
-// sort an array so that items come in groups of n unsorted items, with groups sorted between each other;
-// combines selection algorithm with binary divide & conquer approach
+    <p>If the given object is an instance of a type that implements a method
+    named "compare", this function defers to the instance.  The method does not
+    need to be an owned property to distinguish it from an object literal since
+    object literals are incomparable.  Unlike <code>Object</code> however,
+    <code>Array</code> implements <code>compare</code>.
 
-function multiSelect(arr, left, right, n, compare) {
-    const stack = [left, right];
+    @param {Any} left
+    @param {Any} right
+    @returns {Number} a value having the same transitive relationship to zero
+    as the left and right values.
+    @function external:Object.compare
+*/
+Object.compare = function (a, b) {
+    // unbox objects, but do not confuse object literals
+    // mercifully handles the Date case
+    a = Object.getValueOf(a);
+    b = Object.getValueOf(b);
+    if (a === b)
+        return 0;
+    var aType = typeof a;
+    var bType = typeof b;
+    if (aType === "number" && bType === "number")
+        return a - b;
+    if (aType === "string" && bType === "string")
+        return a < b ? -Infinity : Infinity;
+        // the possibility of equality elimiated above
+    if (a && typeof a.compare === "function")
+        return a.compare(b);
+    // not commutative, the relationship is reversed
+    if (b && typeof b.compare === "function")
+        return -b.compare(a);
+    return 0;
+};
 
-    while (stack.length) {
-        right = stack.pop();
-        left = stack.pop();
+/**
+    Creates a deep copy of any value.  Values, being immutable, are
+    returned without alternation.  Forwards to <code>clone</code> on
+    objects and arrays.
 
-        if (right - left <= n) continue;
+    @function external:Object.clone
+    @param {Any} value a value to clone
+    @param {Number} depth an optional traversal depth, defaults to infinity.
+    A value of <code>0</code> means to make no clone and return the value
+    directly.
+    @param {Map} memo an optional memo of already visited objects to preserve
+    reference cycles.  The cloned object will have the exact same shape as the
+    original, but no identical objects.  Te map may be later used to associate
+    all objects in the original object graph with their corresponding member of
+    the cloned graph.
+    @returns a copy of the value
+*/
+Object.clone = function (value, depth, memo) {
+    value = Object.getValueOf(value);
+    memo = memo || new weakMap$1();
+    if (depth === undefined) {
+        depth = Infinity;
+    } else if (depth === 0) {
+        return value;
+    }
+    if (Object.isObject(value)) {
+        if (!memo.has(value)) {
+            if (value && typeof value.clone === "function") {
+                memo.set(value, value.clone(depth, memo));
+            } else {
+                var prototype = Object.getPrototypeOf(value);
+                if (prototype === null || prototype === Object.prototype) {
+                    var clone = Object.create(prototype);
+                    memo.set(value, clone);
+                    for (var key in value) {
+                        clone[key] = Object.clone(value[key], depth - 1, memo);
+                    }
+                } else {
+                    throw new Error("Can't clone " + value);
+                }
+            }
+        }
+        return memo.get(value);
+    }
+    return value;
+};
 
-        const mid = left + Math.ceil((right - left) / n / 2) * n;
-        quickselect(arr, mid, left, right, compare);
+/**
+    Removes all properties owned by this object making the object suitable for
+    reuse.
 
-        stack.push(left, mid, mid, right);
+    @function external:Object.clear
+    @returns this
+*/
+Object.clear = function (object) {
+    if (object && typeof object.clear === "function") {
+        object.clear();
+    } else {
+        var keys = Object.keys(object),
+            i = keys.length;
+        while (i) {
+            i--;
+            delete object[keys[i]];
+        }
     }
+    return object;
+};
+
+var genericOrder = GenericOrder;
+function GenericOrder() {
+    throw new Error("Can't construct. GenericOrder is a mixin.");
 }
 
-var rbush = /*#__PURE__*/Object.freeze({
-    __proto__: null,
-    'default': RBush
-});
+GenericOrder.prototype.equals = function (that, equals) {
+    equals = equals || this.contentEquals || shimObject.equals;
 
-var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
+    if (this === that) {
+        return true;
+    }
+    if (!that) {
+        return false;
+    }
+    return (
+        this.length === that.length &&
+        this.zip(that).every(function (pair) {
+            return equals(pair[0], pair[1]);
+        })
+    );
+};
 
-function unwrapExports (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
+GenericOrder.prototype.compare = function (that, compare) {
+    compare = compare || this.contentCompare || shimObject.compare;
 
-function createCommonjsModule(fn, module) {
-	return module = { exports: {} }, fn(module, module.exports), module.exports;
-}
+    if (this === that) {
+        return 0;
+    }
+    if (!that) {
+        return 1;
+    }
 
-function getCjsExportFromNamespace (n) {
-	return n && n['default'] || n;
-}
+    var length = Math.min(this.length, that.length);
+    var comparison = this.zip(that).reduce(function (comparison, pair, index) {
+        if (comparison === 0) {
+            if (index >= length) {
+                return comparison;
+            } else {
+                return compare(pair[0], pair[1]);
+            }
+        } else {
+            return comparison;
+        }
+    }, 0);
+    if (comparison === 0) {
+        return this.length - that.length;
+    }
+    return comparison;
+};
 
-var quickselect$1 = createCommonjsModule(function (module, exports) {
-(function (global, factory) {
-	 module.exports = factory() ;
-}(commonjsGlobal, (function () {
-function quickselect(arr, k, left, right, compare) {
-    quickselectStep(arr, k, left || 0, right || (arr.length - 1), compare || defaultCompare);
-}
+GenericOrder.prototype.toJSON = function () {
+    return this.toArray();
+};
 
-function quickselectStep(arr, k, left, right, compare) {
+var array_splice = Array.prototype.splice;
+var array_slice = Array.prototype.slice;
 
-    while (right > left) {
-        if (right - left > 600) {
-            var n = right - left + 1;
-            var m = k - left + 1;
-            var z = Math.log(n);
-            var s = 0.5 * Math.exp(2 * z / 3);
-            var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
-            var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
-            var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
-            quickselectStep(arr, k, newLeft, newRight, compare);
-        }
+Array.empty = [];
 
-        var t = arr[k];
-        var i = left;
-        var j = right;
+if (Object.freeze) {
+    Object.freeze(Array.empty);
+}
 
-        swap(arr, left, k);
-        if (compare(arr[right], t) > 0) swap(arr, left, right);
+Array.nativeFrom = Array.from;
 
-        while (i < j) {
-            swap(arr, i, j);
-            i++;
-            j--;
-            while (compare(arr[i], t) < 0) i++;
-            while (compare(arr[j], t) > 0) j--;
-        }
+var isSymbolDefined = typeof Symbol !== "undefined";
+Array.from = function (values, mapFn, thisArg) {
+    if (isSymbolDefined && values && typeof values[Symbol.iterator] === "function") {
+        return Array.nativeFrom(values, mapFn, thisArg);
+    }
+    //Now we add support for values that implement forEach:
+    var array = [];
+    array.addEach(values);
+    return array;
+};
 
-        if (compare(arr[left], t) === 0) swap(arr, left, j);
-        else {
-            j++;
-            swap(arr, j, right);
+Array.unzip = function (table) {
+    var transpose = [];
+    var length = Infinity;
+    // compute shortest row
+    for (var i = 0; i < table.length; i++) {
+        var row = table[i];
+        table[i] = row.toArray();
+        if (row.length < length) {
+            length = row.length;
         }
-
-        if (j <= k) left = j + 1;
-        if (k <= j) right = j - 1;
     }
-}
-
-function swap(arr, i, j) {
-    var tmp = arr[i];
-    arr[i] = arr[j];
-    arr[j] = tmp;
-}
+    for (var i = 0; i < table.length; i++) {
+        var row = table[i];
+        for (var j = 0; j < row.length; j++) {
+            if (j < length && j in row) {
+                transpose[j] = transpose[j] || [];
+                transpose[j][i] = row[j];
+            }
+        }
+    }
+    return transpose;
+};
 
-function defaultCompare(a, b) {
-    return a < b ? -1 : a > b ? 1 : 0;
+function define(key, value) {
+    Object.defineProperty(Array.prototype, key, {
+        value: value,
+        writable: true,
+        configurable: true,
+        enumerable: false
+    });
 }
 
-return quickselect;
+define("addEach", genericCollection.prototype.addEach);
+define("deleteEach", genericCollection.prototype.deleteEach);
+define("toArray", genericCollection.prototype.toArray);
+define("toObject", genericCollection.prototype.toObject);
+define("all", genericCollection.prototype.all);
+define("any", genericCollection.prototype.any);
+define("min", genericCollection.prototype.min);
+define("max", genericCollection.prototype.max);
+define("sum", genericCollection.prototype.sum);
+define("average", genericCollection.prototype.average);
+define("only", genericCollection.prototype.only);
+define("flatten", genericCollection.prototype.flatten);
+define("zip", genericCollection.prototype.zip);
+define("enumerate", genericCollection.prototype.enumerate);
+define("group", genericCollection.prototype.group);
+define("sorted", genericCollection.prototype.sorted);
+define("reversed", genericCollection.prototype.reversed);
 
-})));
+define("constructClone", function (values) {
+    var clone = new this.constructor();
+    clone.addEach(values);
+    return clone;
 });
 
-var dist = createCommonjsModule(function (module, exports) {
-Object.defineProperty(exports, "__esModule", { value: true });
+define("has", function (value, equals) {
+    return this.findValue(value, equals) !== -1;
+});
 
-var nodePool = [];
-var freeNode = function (node) { return nodePool.push(node); };
-var freeAllNode = function (node) {
-    if (node) {
-        freeNode(node);
-        if (!isLeaf(node)) {
-            node.children.forEach(freeAllNode);
-        }
-    }
-};
-var allowNode = function (children) {
-    var node = nodePool.pop();
-    if (node) {
-        node.children = children;
-        node.height = 1;
-        node.leaf = true;
-        node.minX = Infinity;
-        node.minY = Infinity;
-        node.minZ = Infinity;
-        node.maxX = -Infinity;
-        node.maxY = -Infinity;
-        node.maxZ = -Infinity;
-    }
-    else {
-        node = {
-            children: children,
-            height: 1,
-            leaf: true,
-            minX: Infinity,
-            minY: Infinity,
-            minZ: Infinity,
-            maxX: -Infinity,
-            maxY: -Infinity,
-            maxZ: -Infinity,
-        };
-    }
-    return node;
-};
-var distNodePool = [];
-var freeDistNode = function (node) { return distNodePool.push(node); };
-var allowDistNode = function (dist, node) {
-    var heapNode = distNodePool.pop();
-    if (heapNode) {
-        heapNode.dist = dist;
-        heapNode.node = node;
-    }
-    else {
-        heapNode = { dist: dist, node: node };
-    }
-    return heapNode;
-};
-var isLeaf = function (node) {
-    return node.leaf;
-};
-var isLeafChild = function (node, child) {
-    return node.leaf;
-};
-var findItem = function (item, items, equalsFn) {
-    if (!equalsFn)
-        return items.indexOf(item);
-    for (var i = 0; i < items.length; i++) {
-        if (equalsFn(item, items[i]))
-            return i;
-    }
-    return -1;
-};
-var calcBBox = function (node) {
-    distBBox(node, 0, node.children.length, node);
-};
-var distBBox = function (node, k, p, destNode) {
-    var dNode = destNode;
-    if (dNode) {
-        dNode.minX = Infinity;
-        dNode.minY = Infinity;
-        dNode.minZ = Infinity;
-        dNode.maxX = -Infinity;
-        dNode.maxY = -Infinity;
-        dNode.maxZ = -Infinity;
-    }
-    else {
-        dNode = allowNode([]);
-    }
-    for (var i = k, child = void 0; i < p; i++) {
-        child = node.children[i];
-        extend(dNode, child);
+define("get", function (index, defaultValue) {
+    if (+index !== index) {
+        throw new Error("Indicies must be numbers");
+    } else if (!index in this) {
+        return defaultValue;
+    } else {
+        return this[index];
     }
-    return dNode;
-};
-var extend = function (a, b) {
-    a.minX = Math.min(a.minX, b.minX);
-    a.minY = Math.min(a.minY, b.minY);
-    a.minZ = Math.min(a.minZ, b.minZ);
-    a.maxX = Math.max(a.maxX, b.maxX);
-    a.maxY = Math.max(a.maxY, b.maxY);
-    a.maxZ = Math.max(a.maxZ, b.maxZ);
-    return a;
-};
-var bboxVolume = function (a) {
-    return (a.maxX - a.minX) *
-        (a.maxY - a.minY) *
-        (a.maxZ - a.minZ);
-};
-var bboxMargin = function (a) {
-    return (a.maxX - a.minX) +
-        (a.maxY - a.minY) +
-        (a.maxZ - a.minZ);
-};
-var enlargedVolume = function (a, b) {
-    var minX = Math.min(a.minX, b.minX), minY = Math.min(a.minY, b.minY), minZ = Math.min(a.minZ, b.minZ), maxX = Math.max(a.maxX, b.maxX), maxY = Math.max(a.maxY, b.maxY), maxZ = Math.max(a.maxZ, b.maxZ);
-    return (maxX - minX) *
-        (maxY - minY) *
-        (maxZ - minZ);
-};
-var intersectionVolume = function (a, b) {
-    var minX = Math.max(a.minX, b.minX), minY = Math.max(a.minY, b.minY), minZ = Math.max(a.minZ, b.minZ), maxX = Math.min(a.maxX, b.maxX), maxY = Math.min(a.maxY, b.maxY), maxZ = Math.min(a.maxZ, b.maxZ);
-    return Math.max(0, maxX - minX) *
-        Math.max(0, maxY - minY) *
-        Math.max(0, maxZ - minZ);
-};
-var contains = function (a, b) {
-    return a.minX <= b.minX &&
-        a.minY <= b.minY &&
-        a.minZ <= b.minZ &&
-        b.maxX <= a.maxX &&
-        b.maxY <= a.maxY &&
-        b.maxZ <= a.maxZ;
-};
-exports.intersects = function (a, b) {
-    return b.minX <= a.maxX &&
-        b.minY <= a.maxY &&
-        b.minZ <= a.maxZ &&
-        b.maxX >= a.minX &&
-        b.maxY >= a.minY &&
-        b.maxZ >= a.minZ;
-};
-exports.boxRayIntersects = function (box, ox, oy, oz, idx, idy, idz) {
-    var tx0 = (box.minX - ox) * idx;
-    var tx1 = (box.maxX - ox) * idx;
-    var ty0 = (box.minY - oy) * idy;
-    var ty1 = (box.maxY - oy) * idy;
-    var tz0 = (box.minZ - oz) * idz;
-    var tz1 = (box.maxZ - oz) * idz;
-    var z0 = Math.min(tz0, tz1);
-    var z1 = Math.max(tz0, tz1);
-    var y0 = Math.min(ty0, ty1);
-    var y1 = Math.max(ty0, ty1);
-    var x0 = Math.min(tx0, tx1);
-    var x1 = Math.max(tx0, tx1);
-    var tmin = Math.max(0, x0, y0, z0);
-    var tmax = Math.min(x1, y1, z1);
-    return tmax >= tmin ? tmin : Infinity;
-};
-var multiSelect = function (arr, left, right, n, compare) {
-    var stack = [left, right];
-    var mid;
-    while (stack.length) {
-        right = stack.pop();
-        left = stack.pop();
-        if (right - left <= n)
-            continue;
-        mid = left + Math.ceil((right - left) / n / 2) * n;
-        quickselect$1(arr, mid, left, right, compare);
-        stack.push(left, mid, mid, right);
+});
+
+define("set", function (index, value) {
+    this[index] = value;
+    return true;
+});
+
+define("add", function (value) {
+    this.push(value);
+    return true;
+});
+
+define("delete", function (value, equals) {
+    var index = this.findValue(value, equals);
+    if (index !== -1) {
+        this.spliceOne(index);
+        return true;
     }
-};
-var compareMinX = function (a, b) { return a.minX - b.minX; };
-var compareMinY = function (a, b) { return a.minY - b.minY; };
-var compareMinZ = function (a, b) { return a.minZ - b.minZ; };
-var RBush3D = (function () {
-    function RBush3D(maxEntries) {
-        if (maxEntries === void 0) { maxEntries = 16; }
-        this.maxEntries = Math.max(maxEntries, 8);
-        this.minEntries = Math.max(4, Math.ceil(this.maxEntries * 0.4));
-        this.clear();
+    return false;
+});
+
+define("deleteAll", function (value, equals) {
+    equals = equals || this.contentEquals || Object.equals;
+    var count = 0;
+    for (var index = 0; index < this.length;) {
+        if (equals(value, this[index])) {
+            this.swap(index, 1);
+            count++;
+        } else {
+            index++;
+        }
     }
-    RBush3D.alloc = function () {
-        return this.pool.pop() || new this();
-    };
-    RBush3D.free = function (rbush) {
-        rbush.clear();
-        this.pool.push(rbush);
-    };
-    RBush3D.prototype.search = function (bbox) {
-        var node = this.data;
-        var result = [];
-        if (!exports.intersects(bbox, node))
-            return result;
-        var nodesToSearch = [];
-        while (node) {
-            for (var i = 0, len = node.children.length; i < len; i++) {
-                var child = node.children[i];
-                if (exports.intersects(bbox, child)) {
-                    if (isLeafChild(node))
-                        result.push(child);
-                    else if (contains(bbox, child))
-                        this._all(child, result);
-                    else
-                        nodesToSearch.push(child);
-                }
-            }
-            node = nodesToSearch.pop();
+    return count;
+});
+
+// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find
+// https://tc39.github.io/ecma262/#sec-array.prototype.find
+if (!Array.prototype.find) {
+    define("find", function(predicate) {
+        // 1. Let O be ? ToObject(this value).
+        if (this == null) {
+            throw new TypeError('"this" is null or not defined');
         }
-        return result;
-    };
-    RBush3D.prototype.collides = function (bbox) {
-        var node = this.data;
-        if (!exports.intersects(bbox, node))
-            return false;
-        var nodesToSearch = [];
-        while (node) {
-            for (var i = 0, len = node.children.length; i < len; i++) {
-                var child = node.children[i];
-                if (exports.intersects(bbox, child)) {
-                    if (isLeafChild(node) || contains(bbox, child))
-                        return true;
-                    nodesToSearch.push(child);
-                }
-            }
-            node = nodesToSearch.pop();
+
+        var o = Object(this);
+
+        // 2. Let len be ? ToLength(? Get(O, "length")).
+        var len = o.length >>> 0;
+
+        // 3. If IsCallable(predicate) is false, throw a TypeError exception.
+        if (typeof predicate !== 'function') {
+            throw new TypeError('predicate must be a function');
         }
-        return false;
-    };
-    RBush3D.prototype.raycastInv = function (ox, oy, oz, idx, idy, idz, maxLen) {
-        if (maxLen === void 0) { maxLen = Infinity; }
-        var node = this.data;
-        if (idx === Infinity && idy === Infinity && idz === Infinity)
-            return allowDistNode(Infinity, undefined);
-        if (exports.boxRayIntersects(node, ox, oy, oz, idx, idy, idz) === Infinity)
-            return allowDistNode(Infinity, undefined);
-        var heap = [allowDistNode(0, node)];
-        var swap = function (a, b) {
-            var t = heap[a];
-            heap[a] = heap[b];
-            heap[b] = t;
-        };
-        var pop = function () {
-            var top = heap[0];
-            var newLen = heap.length - 1;
-            heap[0] = heap[newLen];
-            heap.length = newLen;
-            var idx = 0;
-            while (true) {
-                var left = (idx << 1) | 1;
-                if (left >= newLen)
-                    break;
-                var right = left + 1;
-                if (right < newLen && heap[right].dist < heap[left].dist) {
-                    left = right;
-                }
-                if (heap[idx].dist < heap[left].dist)
-                    break;
-                swap(idx, left);
-                idx = left;
-            }
-            freeDistNode(top);
-            return top.node;
-        };
-        var push = function (dist, node) {
-            var idx = heap.length;
-            heap.push(allowDistNode(dist, node));
-            while (idx > 0) {
-                var p = (idx - 1) >> 1;
-                if (heap[p].dist <= heap[idx].dist)
-                    break;
-                swap(idx, p);
-                idx = p;
-            }
-        };
-        var dist = maxLen;
-        var result;
-        while (heap.length && heap[0].dist < dist) {
-            node = pop();
-            for (var i = 0, len = node.children.length; i < len; i++) {
-                var child = node.children[i];
-                var d = exports.boxRayIntersects(child, ox, oy, oz, idx, idy, idz);
-                if (!isLeafChild(node)) {
-                    push(d, child);
-                }
-                else if (d < dist) {
-                    if (d === 0) {
-                        return allowDistNode(d, child);
-                    }
-                    dist = d;
-                    result = child;
-                }
+
+        // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
+        var thisArg = arguments[1];
+
+        // 5. Let k be 0.
+        var k = 0;
+
+        // 6. Repeat, while k < len
+        while (k < len) {
+            // a. Let Pk be ! ToString(k).
+            // b. Let kValue be ? Get(O, Pk).
+            // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
+            // d. If testResult is true, return kValue.
+            var kValue = o[k];
+            if (predicate.call(thisArg, kValue, k, o)) {
+                return kValue;
             }
+            // e. Increase k by 1.
+            k++;
         }
-        return allowDistNode(dist < maxLen ? dist : Infinity, result);
-    };
-    RBush3D.prototype.raycast = function (ox, oy, oz, dx, dy, dz, maxLen) {
-        if (maxLen === void 0) { maxLen = Infinity; }
-        return this.raycastInv(ox, oy, oz, 1 / dx, 1 / dy, 1 / dz, maxLen);
-    };
-    RBush3D.prototype.all = function () {
-        return this._all(this.data, []);
-    };
-    RBush3D.prototype.load = function (data) {
-        if (!(data && data.length))
-            return this;
-        if (data.length < this.minEntries) {
-            for (var i = 0, len = data.length; i < len; i++) {
-                this.insert(data[i]);
-            }
-            return this;
+    });
+}
+
+// TODO remove in v6 (not present in v2)
+var deprecatedWarnNonce = {};
+function deprecatedWarn(msg, notOnce) {
+    if (
+        typeof console !== 'undefined' &&
+            typeof console.warn === 'function' &&
+                (notOnce !== true && deprecatedWarnNonce.hasOwnProperty(msg) === false)
+    ) {
+        console.warn(msg);
+        deprecatedWarnNonce[msg]++;
+    }
+}
+
+// Save Array.prototype.find in order to support legacy and display warning.
+// TODO remove in v6 (not present in v2)
+var ArrayFindPrototype = Object.getOwnPropertyDescriptor(Array.prototype, 'find').value;
+define("find", function (value, equals, index) {
+    if (
+        typeof arguments[0] === 'function' &&
+            this instanceof Array
+    ) {
+        return ArrayFindPrototype.apply(this, arguments);
+    } else {
+        deprecatedWarn('Array#find usage is deprecated please use Array#findValue');
+        return this.findValue.apply(this, arguments);
+    }
+});
+
+define("findValue", function (value, equals, index) {
+    if (index) {
+        throw new Error("Array#findValue does not support third argument: index");
+    }
+    equals = equals || this.contentEquals || Object.equals;
+    for (var index = 0; index < this.length; index++) {
+        if (index in this && equals(value, this[index])) {
+            return index;
         }
-        var node = this.build(data.slice(), 0, data.length - 1, 0);
-        if (!this.data.children.length) {
-            this.data = node;
+    }
+    return -1;
+});
+
+// TODO remove in v6 (not present in v2)
+define("findLast", function (value, equals) {
+    deprecatedWarn('Array#findLast function is deprecated please use Array#findLastValue instead.');
+    return this.findLastValue.apply(this, arguments);
+});
+
+define("findLastValue", function (value, equals) {
+    equals = equals || this.contentEquals || Object.equals;
+    var index = this.length;
+    do {
+        index--;
+        if (index in this && equals(this[index], value)) {
+            return index;
         }
-        else if (this.data.height === node.height) {
-            this.splitRoot(this.data, node);
+    } while (index > 0);
+    return -1;
+});
+
+define("swap", function (start, length, plus) {
+    var args, plusLength, i, j, returnValue;
+    if (start > this.length) {
+        this.length = start;
+    }
+    if (typeof plus !== "undefined") {
+        args = [start, length];
+        if (!Array.isArray(plus)) {
+            plus = array_slice.call(plus);
         }
-        else {
-            if (this.data.height < node.height) {
-                var tmpNode = this.data;
-                this.data = node;
-                node = tmpNode;
+        i = 0;
+        plusLength = plus.length;
+        // 1000 is a magic number, presumed to be smaller than the remaining
+        // stack length. For swaps this small, we take the fast path and just
+        // use the underlying Array splice. We could measure the exact size of
+        // the remaining stack using a try/catch around an unbounded recursive
+        // function, but this would defeat the purpose of short-circuiting in
+        // the common case.
+        if (plusLength < 1000) {
+            for (i; i < plusLength; i++) {
+                args[i+2] = plus[i];
             }
-            this._insert(node, this.data.height - node.height - 1, true);
+            return array_splice.apply(this, args);
+        } else {
+            // Avoid maximum call stack error.
+            // First delete the desired entries.
+            returnValue = array_splice.apply(this, args);
+            // Second batch in 1000s.
+            for (i; i < plusLength;) {
+                args = [start+i, 0];
+                for (j = 2; j < 1002 && i < plusLength; j++, i++) {
+                    args[j] = plus[i];
+                }
+                array_splice.apply(this, args);
+            }
+            return returnValue;
         }
-        return this;
-    };
-    RBush3D.prototype.insert = function (item) {
-        if (item)
-            this._insert(item, this.data.height - 1);
-        return this;
-    };
-    RBush3D.prototype.clear = function () {
-        if (this.data) {
-            freeAllNode(this.data);
+    // using call rather than apply to cut down on transient objects
+    } else if (typeof length !== "undefined") {
+        return array_splice.call(this, start, length);
+    }  else if (typeof start !== "undefined") {
+        return array_splice.call(this, start);
+    } else {
+        return [];
+    }
+});
+
+define("peek", function () {
+    return this[0];
+});
+
+define("poke", function (value) {
+    if (this.length > 0) {
+        this[0] = value;
+    }
+});
+
+define("peekBack", function () {
+    if (this.length > 0) {
+        return this[this.length - 1];
+    }
+});
+
+define("pokeBack", function (value) {
+    if (this.length > 0) {
+        this[this.length - 1] = value;
+    }
+});
+
+define("one", function () {
+    for (var i in this) {
+        if (Object.owns(this, i)) {
+            return this[i];
         }
-        this.data = allowNode([]);
+    }
+});
+
+if (!Array.prototype.clear) {
+    define("clear", function () {
+        this.length = 0;
         return this;
-    };
-    RBush3D.prototype.remove = function (item, equalsFn) {
-        if (!item)
-            return this;
-        var node = this.data;
-        var i = 0;
-        var goingUp = false;
-        var index;
-        var parent;
-        var path = [];
-        var indexes = [];
-        while (node || path.length) {
-            if (!node) {
-                node = path.pop();
-                i = indexes.pop();
-                parent = path[path.length - 1];
-                goingUp = true;
-            }
-            if (isLeaf(node)) {
-                index = findItem(item, node.children, equalsFn);
-                if (index !== -1) {
-                    node.children.splice(index, 1);
-                    path.push(node);
-                    this.condense(path);
-                    return this;
+    });
+}
+
+define("compare", function (that, compare) {
+    compare = compare || Object.compare;
+    var i;
+    var length;
+    var lhs;
+    var rhs;
+    var relative;
+
+    if (this === that) {
+        return 0;
+    }
+
+    if (!that || !Array.isArray(that)) {
+        return genericOrder.prototype.compare.call(this, that, compare);
+    }
+
+    length = (this.length < that.length) ? this.length : that.length;
+
+    for (i = 0; i < length; i++) {
+        if (i in this) {
+            if (!(i in that)) {
+                return -1;
+            } else {
+                lhs = this[i];
+                rhs = that[i];
+                relative = compare(lhs, rhs);
+                if (relative) {
+                    return relative;
                 }
             }
-            if (!goingUp && !isLeaf(node) && contains(node, item)) {
-                path.push(node);
-                indexes.push(i);
-                i = 0;
-                parent = node;
-                node = node.children[0];
-            }
-            else if (parent) {
-                i++;
-                node = parent.children[i];
-                goingUp = false;
-            }
-            else {
-                node = undefined;
-            }
-        }
-        return this;
-    };
-    RBush3D.prototype.toJSON = function () {
-        return this.data;
-    };
-    RBush3D.prototype.fromJSON = function (data) {
-        freeAllNode(this.data);
-        this.data = data;
-        return this;
-    };
-    RBush3D.prototype.build = function (items, left, right, height) {
-        var N = right - left + 1;
-        var M = this.maxEntries;
-        var node;
-        if (N <= M) {
-            node = allowNode(items.slice(left, right + 1));
-            calcBBox(node);
-            return node;
-        }
-        if (!height) {
-            height = Math.ceil(Math.log(N) / Math.log(M));
-            M = Math.ceil(N / Math.pow(M, height - 1));
-        }
-        node = allowNode([]);
-        node.leaf = false;
-        node.height = height;
-        var N3 = Math.ceil(N / M), N2 = N3 * Math.ceil(Math.pow(M, 2 / 3)), N1 = N3 * Math.ceil(Math.pow(M, 1 / 3));
-        multiSelect(items, left, right, N1, compareMinX);
-        for (var i = left; i <= right; i += N1) {
-            var right2 = Math.min(i + N1 - 1, right);
-            multiSelect(items, i, right2, N2, compareMinY);
-            for (var j = i; j <= right2; j += N2) {
-                var right3 = Math.min(j + N2 - 1, right2);
-                multiSelect(items, j, right3, N3, compareMinZ);
-                for (var k = j; k <= right3; k += N3) {
-                    var right4 = Math.min(k + N3 - 1, right3);
-                    node.children.push(this.build(items, k, right4, height - 1));
-                }
-            }
-        }
-        calcBBox(node);
-        return node;
-    };
-    RBush3D.prototype._all = function (node, result) {
-        var nodesToSearch = [];
-        while (node) {
-            if (isLeaf(node))
-                result.push.apply(result, node.children);
-            else
-                nodesToSearch.push.apply(nodesToSearch, node.children);
-            node = nodesToSearch.pop();
-        }
-        return result;
-    };
-    RBush3D.prototype.chooseSubtree = function (bbox, node, level, path) {
-        var minVolume;
-        var minEnlargement;
-        var targetNode;
-        while (true) {
-            path.push(node);
-            if (isLeaf(node) || path.length - 1 === level)
-                break;
-            minVolume = minEnlargement = Infinity;
-            for (var i = 0, len = node.children.length; i < len; i++) {
-                var child = node.children[i];
-                var volume = bboxVolume(child);
-                var enlargement = enlargedVolume(bbox, child) - volume;
-                if (enlargement < minEnlargement) {
-                    minEnlargement = enlargement;
-                    minVolume = volume < minVolume ? volume : minVolume;
-                    targetNode = child;
-                }
-                else if (enlargement === minEnlargement) {
-                    if (volume < minVolume) {
-                        minVolume = volume;
-                        targetNode = child;
-                    }
-                }
-            }
-            node = targetNode || node.children[0];
+        } else if (i in that) {
+            return 1;
         }
-        return node;
-    };
-    RBush3D.prototype.split = function (insertPath, level) {
-        var node = insertPath[level];
-        var M = node.children.length;
-        var m = this.minEntries;
-        this.chooseSplitAxis(node, m, M);
-        var splitIndex = this.chooseSplitIndex(node, m, M);
-        var newNode = allowNode(node.children.splice(splitIndex, node.children.length - splitIndex));
-        newNode.height = node.height;
-        newNode.leaf = node.leaf;
-        calcBBox(node);
-        calcBBox(newNode);
-        if (level)
-            insertPath[level - 1].children.push(newNode);
-        else
-            this.splitRoot(node, newNode);
-    };
-    RBush3D.prototype.splitRoot = function (node, newNode) {
-        this.data = allowNode([node, newNode]);
-        this.data.height = node.height + 1;
-        this.data.leaf = false;
-        calcBBox(this.data);
-    };
-    RBush3D.prototype.chooseSplitIndex = function (node, m, M) {
-        var minOverlap = Infinity;
-        var minVolume = Infinity;
-        var index;
-        for (var i = m; i <= M - m; i++) {
-            var bbox1 = distBBox(node, 0, i);
-            var bbox2 = distBBox(node, i, M);
-            var overlap = intersectionVolume(bbox1, bbox2);
-            var volume = bboxVolume(bbox1) + bboxVolume(bbox2);
-            if (overlap < minOverlap) {
-                minOverlap = overlap;
-                index = i;
-                minVolume = volume < minVolume ? volume : minVolume;
-            }
-            else if (overlap === minOverlap) {
-                if (volume < minVolume) {
-                    minVolume = volume;
-                    index = i;
+    }
+
+    return this.length - that.length;
+});
+
+define("equals", function (that, equals) {
+    equals = equals || Object.equals;
+    var i = 0;
+    var length = this.length;
+    var left;
+    var right;
+
+    if (this === that) {
+        return true;
+    }
+    if (!that || !Array.isArray(that)) {
+        return genericOrder.prototype.equals.call(this, that);
+    }
+
+    if (length !== that.length) {
+        return false;
+    } else {
+        for (; i < length; ++i) {
+            if (i in this) {
+                if (!(i in that)) {
+                    return false;
                 }
-            }
-        }
-        return index;
-    };
-    RBush3D.prototype.chooseSplitAxis = function (node, m, M) {
-        var xMargin = this.allDistMargin(node, m, M, compareMinX);
-        var yMargin = this.allDistMargin(node, m, M, compareMinY);
-        var zMargin = this.allDistMargin(node, m, M, compareMinZ);
-        if (xMargin < yMargin && xMargin < zMargin) {
-            node.children.sort(compareMinX);
-        }
-        else if (yMargin < xMargin && yMargin < zMargin) {
-            node.children.sort(compareMinY);
-        }
-    };
-    RBush3D.prototype.allDistMargin = function (node, m, M, compare) {
-        node.children.sort(compare);
-        var leftBBox = distBBox(node, 0, m);
-        var rightBBox = distBBox(node, M - m, M);
-        var margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);
-        for (var i = m; i < M - m; i++) {
-            var child = node.children[i];
-            extend(leftBBox, child);
-            margin += bboxMargin(leftBBox);
-        }
-        for (var i = M - m - 1; i >= m; i--) {
-            var child = node.children[i];
-            extend(rightBBox, child);
-            margin += bboxMargin(rightBBox);
-        }
-        return margin;
-    };
-    RBush3D.prototype.adjustParentBBoxes = function (bbox, path, level) {
-        for (var i = level; i >= 0; i--) {
-            extend(path[i], bbox);
-        }
-    };
-    RBush3D.prototype.condense = function (path) {
-        for (var i = path.length - 1, siblings = void 0; i >= 0; i--) {
-            if (path[i].children.length === 0) {
-                if (i > 0) {
-                    siblings = path[i - 1].children;
-                    siblings.splice(siblings.indexOf(path[i]), 1);
-                    freeNode(path[i]);
+                left = this[i];
+                right = that[i];
+                if (!equals(left, right)) {
+                    return false;
                 }
-                else {
-                    this.clear();
+            } else {
+                if (i in that) {
+                    return false;
                 }
             }
-            else {
-                calcBBox(path[i]);
-            }
-        }
-    };
-    RBush3D.prototype._insert = function (item, level, isNode) {
-        var insertPath = [];
-        var node = this.chooseSubtree(item, this.data, level, insertPath);
-        node.children.push(item);
-        extend(node, item);
-        while (level >= 0) {
-            if (insertPath[level].children.length > this.maxEntries) {
-                this.split(insertPath, level);
-                level--;
-            }
-            else
-                break;
         }
-        this.adjustParentBBoxes(item, insertPath, level);
-    };
-    RBush3D.pool = [];
-    return RBush3D;
-}());
-exports.RBush3D = RBush3D;
+    }
+    return true;
 });
 
-unwrapExports(dist);
-var dist_1 = dist.intersects;
-var dist_2 = dist.boxRayIntersects;
-var dist_3 = dist.RBush3D;
-
-const REarth = 6371;
+define("clone", function (depth, memo) {
+    if (depth == null) {
+        depth = Infinity;
+    } else if (depth === 0) {
+        return this;
+    }
+    memo = memo || new weakMap$1();
+    if (memo.has(this)) {
+        return memo.get(this);
+    }
+    var clone = new Array(this.length);
+    memo.set(this, clone);
+    for (var i in this) {
+        clone[i] = Object.clone(this[i], depth - 1, memo);
+    }    return clone;
+});
 
-const WGS84 = {
-    a: 6378.137,
-    b: 6356.752314245,
-    f: 1 / 298.257223563
-};
+define("iterate", function (start, end) {
+    return new ArrayIterator(this, start, end);
+});
 
-function radians(degrees) {
-    return degrees / (180 / Math.PI);
+if(Array.prototype.spliceOne === void 0) {
+    define("spliceOne", function (index,itemToAdd) {
+        var len=this.length;
+        if (!len) { return }
+        if(arguments.length === 1) {
+            while (index<len) {
+                this[index] = this[index+1];
+                index++;
+            }
+            this.length--;
+        }
+        else {
+            this[index] = itemToAdd;
+        }
+    });
 }
 
-function degrees(radians) {
-    return radians * (180 / Math.PI);
+define("Iterator", ArrayIterator);
+
+function ArrayIterator(array, start, end) {
+    this.array = array;
+    this.start = start == null ? 0 : start;
+    this.end = end;
 }
 
-const consoleColors = {
-    reset: '\x1b[0m',
-    bright: '\x1b[1m',
-    dim: '\x1b[2m',
-    underscore: '\x1b[4m',
-    blink: '\x1b[5m',
-    reverse: '\x1b[7m',
-    hidden: '\x1b[8m',
-    fg: {
-        black: '\x1b[30m',
-        red: '\x1b[31m',
-        green: '\x1b[32m',
-        yellow: '\x1b[33m',
-        blue: '\x1b[34m',
-        magenta: '\x1b[35m',
-        cyan: '\x1b[36m',
-        white: '\x1b[37m',
-        crimson: '\x1b[38m'
-    },
-    bg: {
-        black: '\x1b[40m',
-        red: '\x1b[41m',
-        green: '\x1b[42m',
-        yellow: '\x1b[43m',
-        blue: '\x1b[44m',
-        magenta: '\x1b[45m',
-        cyan: '\x1b[46m',
-        white: '\x1b[47m',
-        crimson: '\x1b[48m'
+ArrayIterator.prototype.__iterationObject = null;
+Object.defineProperty(ArrayIterator.prototype,"_iterationObject", {
+    get: function() {
+        return this.__iterationObject || (this.__iterationObject = { done: false, value:null});
     }
-};
+});
 
-var util = {
-    radians,
-    degrees,
-    REarth,
-    WGS84,
-    consoleColors
+ArrayIterator.prototype.next = function () {
+    if (this.start === (this.end == null ? this.array.length : this.end)) {
+        this._iterationObject.done = true;
+        this._iterationObject.value = void 0;
+    } else {
+        this._iterationObject.value = this.array[this.start++];
+    }
+    return this._iterationObject;
 };
 
-// Vincenty's Algorithm, courtesy of Movable Type Ltd
-// https://www.movable-type.co.uk/scripts/latlong-vincenty.html
-// Published and included here under an MIT licence
-function inverse(p1, p2) {
-    const φ1 = util.radians(p1.y), λ1 = util.radians(p1.x);
-    const φ2 = util.radians(p2.y), λ2 = util.radians(p2.x);
+/**
+    accepts a string; returns the string with regex metacharacters escaped.
+    the returned string can safely be used within a regex to match a literal
+    string. escaped characters are [, ], {, }, (, ), -, *, +, ?, ., \, ^, $,
+    |, #, [comma], and whitespace.
+*/
+if (!RegExp.escape) {
+    var special = /[-[\]{}()*+?.\\^$|,#\s]/g;
+    RegExp.escape = function (string) {
+        return string.replace(special, "\\$&");
+    };
+}
 
-    const { a, b, f } = util.WGS84;
+var shimRegexp = /*#__PURE__*/Object.freeze({
+	__proto__: null
+});
 
-    const L = λ2 - λ1; // L = difference in longitude, U = reduced latitude, defined by tan U = (1-f)·tanφ.
-    const tanU1 = (1 - f) * Math.tan(φ1), cosU1 = 1 / Math.sqrt((1 + tanU1 * tanU1)), sinU1 = tanU1 * cosU1;
-    const tanU2 = (1 - f) * Math.tan(φ2), cosU2 = 1 / Math.sqrt((1 + tanU2 * tanU2)), sinU2 = tanU2 * cosU2;
+getCjsExportFromNamespace(shimRegexp);
 
-    const antipodal = Math.abs(L) > Math.PI / 2 || Math.abs(φ2 - φ1) > Math.PI / 2;
+var genericSet = GenericSet;
+function GenericSet() {
+    throw new Error("Can't construct. GenericSet is a mixin.");
+}
 
-    let λ = L, sinλ = null, cosλ = null; // λ = difference in longitude on an auxiliary sphere
-    let σ = antipodal ? Math.PI : 0, sinσ = 0, cosσ = antipodal ? -1 : 1, sinSqσ = null; // σ = angular distance P₁ P₂ on the sphere
-    let cos2σₘ = 1;                      // σₘ = angular distance on the sphere from the equator to the midpoint of the line
-    let sinα = null, cosSqα = 1;         // α = azimuth of the geodesic at the equator
-    let C = null;
+GenericSet.prototype.isSet = true;
 
-    let λʹ = null, iterations = 0;
-    do {
-        sinλ = Math.sin(λ);
-        cosλ = Math.cos(λ);
-        sinSqσ = (cosU2 * sinλ) * (cosU2 * sinλ) + (cosU1 * sinU2 - sinU1 * cosU2 * cosλ) * (cosU1 * sinU2 - sinU1 * cosU2 * cosλ);
-        if (Math.abs(sinSqσ) < Number.EPSILON) break;  // co-incident/antipodal points (falls back on λ/σ = L)
-        sinσ = Math.sqrt(sinSqσ);
-        cosσ = sinU1 * sinU2 + cosU1 * cosU2 * cosλ;
-        σ = Math.atan2(sinσ, cosσ);
-        sinα = cosU1 * cosU2 * sinλ / sinσ;
-        cosSqα = 1 - sinα * sinα;
-        cos2σₘ = (cosSqα != 0) ? (cosσ - 2 * sinU1 * sinU2 / cosSqα) : 0; // on equatorial line cos²α = 0 (§6)
-        C = f / 16 * cosSqα * (4 + f * (4 - 3 * cosSqα));
-        λʹ = λ;
-        λ = L + (1 - C) * f * sinα * (σ + C * sinσ * (cos2σₘ + C * cosσ * (-1 + 2 * cos2σₘ * cos2σₘ)));
-        const iterationCheck = antipodal ? Math.abs(λ) - Math.PI : Math.abs(λ);
-        if (iterationCheck > Math.PI) throw new EvalError('λ > π');
-    } while (Math.abs(λ - λʹ) > 1e-7 && ++iterations < 1000);
-    if (iterations >= 1000) throw new EvalError('Vincenty formula failed to converge');
-
-    const uSq = cosSqα * (a * a - b * b) / (b * b);
-    const A = 1 + uSq / 16384 * (4096 + uSq * (-768 + uSq * (320 - 175 * uSq)));
-    const B = uSq / 1024 * (256 + uSq * (-128 + uSq * (74 - 47 * uSq)));
-    const Δσ = B * sinσ * (cos2σₘ + B / 4 * (cosσ * (-1 + 2 * cos2σₘ * cos2σₘ) -
-        B / 6 * cos2σₘ * (-3 + 4 * sinσ * sinσ) * (-3 + 4 * cos2σₘ * cos2σₘ)));
+GenericSet.prototype.union = function (that) {
+    var union =  this.constructClone(this);
+    union.addEach(that);
+    return union;
+};
 
-    const s = b * A * (σ - Δσ); // s = length of the geodesic
+GenericSet.prototype.intersection = function (that) {
+    return this.constructClone(this.filter(function (value) {
+        return that.has(value);
+    }));
+};
 
-    // note special handling of exactly antipodal points where sin²σ = 0 (due to discontinuity
-    // atan2(0, 0) = 0 but atan2(ε, 0) = π/2 / 90°) - in which case bearing is always meridional,
-    // due north (or due south!)
-    // α = azimuths of the geodesic; α2 the direction P₁ P₂ produced
-    const α1 = Math.abs(sinSqσ) < Number.EPSILON ? 0 : Math.atan2(cosU2 * sinλ, cosU1 * sinU2 - sinU1 * cosU2 * cosλ);
-    const α2 = Math.abs(sinSqσ) < Number.EPSILON ? Math.PI : Math.atan2(cosU1 * sinλ, -sinU1 * cosU2 + cosU1 * sinU2 * cosλ);
+GenericSet.prototype.difference = function (that) {
+    var union =  this.constructClone(this);
+    union.deleteEach(that);
+    return union;
+};
 
-    return {
-        distance: s,
-        initialBearing: Math.abs(s) < Number.EPSILON ? NaN : util.degrees(α1),
-        finalBearing: Math.abs(s) < Number.EPSILON ? NaN : util.degrees(α2),
-        iterations: iterations,
-    };
-}
+GenericSet.prototype.symmetricDifference = function (that) {
+    var union = this.union(that);
+    var intersection = this.intersection(that);
+    return union.difference(intersection);
+};
 
-var vincentys = {
-    inverse
+GenericSet.prototype.deleteAll = function (value) {
+    // deleteAll is equivalent to delete for sets since they guarantee that
+    // only one value exists for an equivalence class, but deleteAll returns
+    // the count of deleted values instead of whether a value was deleted.
+    return +this["delete"](value);
 };
 
-class Point {
-    constructor(x, y) {
-        if (Array.isArray(x))
-            [this.x, this.y, this.r] = [x[y].longitude, x[y].latitude, y];
-        else
-            [this.x, this.y] = [x, y];
-    }
+GenericSet.prototype.equals = function (that, equals) {
+    var self = this;
+    return (
+        that && typeof that.reduce === "function" &&
+        this.length === that.length &&
+        that.reduce(function (equal, value) {
+            return equal && self.has(value, equals);
+        }, true)
+    );
+};
 
-    geojson(id, properties) {
-        const feature = {
-            type: 'Feature',
-            id,
-            properties: properties || {},
-            geometry: {
-                type: 'Point',
-                coordinates: [this.x, this.y]
-            }
-        };
-        return feature;
-    }
+GenericSet.prototype.forEach = function (callback /*, thisp*/) {
+    var thisp = arguments[1];
+    return this.reduce(function (undefined$1, value, key, object, depth) {
+        //ECMASCRIPT Sets send value twice in callback to forEach
+        callback.call(thisp, value, value, object, depth);
+    }, undefined);
+};
 
-    /* c8 ignore next 3 */
-    toString() {
-        return JSON.stringify(this.geojson());
-    }
 
-    intersects(other) {
-        if (other instanceof Point)
-            return (this.x == other.x && this.y == other.y);
-        if (other instanceof Box)
-            return other.intersects(this);
-        throw ('other must be either Point or Box');
-    }
+GenericSet.prototype.toJSON = function () {
+    return this.toArray();
+};
 
-    distanceEarth(p) {
-        return this.distanceEarthFCC(p);
-    }
+// W3C DOMTokenList API overlap (does not handle variadic arguments)
 
-    distanceEarthFCC(p) {
-        const df = (p.y - this.y);
-        const dg = (p.x - this.x);
-        const fm = util.radians((this.y + p.y) / 2);
-        const k1 = 111.13209 - 0.566605 * Math.cos(2 * fm) + 0.00120 * Math.cos(4 * fm);
-        const k2 = 111.41513 * Math.cos(fm) - 0.09455 * Math.cos(3 * fm) + 0.00012 * Math.cos(5 * fm);
-        const d = Math.sqrt((k1 * df) * (k1 * df) + (k2 * dg) * (k2 * dg));
-        return d;
-    }
+GenericSet.prototype.contains = function (value) {
+    return this.has(value);
+};
 
-    /* c8 ignore next 5 */
-    distanceEarthRev(dx, dy) {
-        const lon = this.x + util.degrees((dx / util.REarth) / Math.cos(util.radians(this.y)));
-        const lat = this.y + util.degrees(dy / util.REarth);
-        return new Point(lon, lat);
-    }
+GenericSet.prototype.remove = function (value) {
+    return this["delete"](value);
+};
 
-    distanceEarthVincentys(p) {
-        return vincentys.inverse(this, p).distance;
+GenericSet.prototype.toggle = function (value) {
+    if (this.has(value)) {
+        this["delete"](value);
+    } else {
+        this.add(value);
     }
-}
+};
 
-class Range {
-    constructor(a, b) {
-        [this.a, this.b] = [a, b];
-    }
+var _valuesArrayFunction = function(value,key) {return value;};
+GenericSet.prototype.valuesArray = function() {
+    return this.map(_valuesArrayFunction);
+};
+var _entriesArrayFunction = function(value,key) {return [key,value];};
+GenericSet.prototype.entriesArray = function() {
+    return this.map(_entriesArrayFunction);
+};
 
-    count() {
-        return Math.abs(this.a - this.b) + 1;
-    }
+var _list = List;
 
-    center() {
-        return Math.min(this.a, this.b) + Math.floor(Math.abs(this.a - this.b) / 2);
-    }
 
-    left() {
-        return new Range(Math.min(this.a, this.b), Math.min(this.a, this.b) + Math.floor(Math.abs(this.a - this.b) / 2));
-    }
 
-    right() {
-        return new Range(Math.min(this.a, this.b) + Math.ceil(Math.abs(this.a - this.b) / 2), Math.max(this.a, this.b));
-    }
 
-    contains(p) {
-        return this.a <= p && p <= this.b;
-    }
 
-    /* c8 ignore next 3 */
-    toString() {
-        return `${this.a}:${this.b}`;
-    }
+function List(values, equals, getDefault) {
+    return List._init(List, this, values, equals, getDefault);
 }
 
-class Box {
-    constructor(a, b, c, d) {
-        if (a instanceof Range) {
-            [this.x1, this.y1, this.x2, this.y2] = [Infinity, Infinity, -Infinity, -Infinity];
-            for (let i = a.a; i <= a.b; i++) {
-                this.x1 = Math.min(b.flightPoints[i].x, this.x1);
-                this.y1 = Math.min(b.flightPoints[i].y, this.y1);
-                this.x2 = Math.max(b.flightPoints[i].x, this.x2);
-                this.y2 = Math.max(b.flightPoints[i].y, this.y2);
-            }
-        } else {
-            [this.x1, this.y1, this.x2, this.y2] = [a, b, c, d];
-        }
+List._init = function (constructor, object, values, equals, getDefault) {
+    if (!(object instanceof constructor)) {
+        return new constructor(values, equals, getDefault);
     }
+    var head = object.head = new object.Node();
+    head.next = head;
+    head.prev = head;
+    object.contentEquals = equals || Object.equals;
+    object.getDefault = getDefault || Function.noop;
+    object.length = 0;
+    object.addEach(values);
+};
 
-    vertices() {
-        return [
-            new Point(this.x1, this.y1),
-            new Point(this.x2, this.y1),
-            new Point(this.x2, this.y2),
-            new Point(this.x1, this.y2)
-        ];
-    }
+List.List = List; // hack so require("list").List will work in MontageJS
 
-    intersects(other) {
-        if (other instanceof Point)
-            return (this.x1 <= other.x && this.y1 <= other.y && this.x2 >= other.x && this.y2 >= other.y);
-        if (this.x1 > other.x2 || this.x2 < other.x1 || this.y1 > other.y2 || this.y2 < other.y1)
-            return false;
-        return true;
+Object.addEach(List.prototype, genericCollection.prototype);
+Object.addEach(List.prototype, genericOrder.prototype);
+
+List.from = genericCollection.from;
+
+List.prototype.constructClone = function (values) {
+    return new this.constructor(values, this.contentEquals, this.getDefault);
+};
+
+List.prototype.find = function (value, equals, index) {
+    equals = equals || this.contentEquals;
+    var head = this.head;
+    var at = this.scan(index, head.next);
+    while (at !== head) {
+        if (equals(at.value, value)) {
+            return at;
+        }
+        at = at.next;
     }
+};
 
-    area() {
-        const h = Math.abs(this.x2 - this.x1);
-        const w = Math.abs(this.y2 - this.y1);
-        return h * w;
+List.prototype.findLast = function (value, equals, index) {
+    equals = equals || this.contentEquals;
+    var head = this.head;
+    var at = this.scan(index, head.prev);
+    while (at !== head) {
+        if (equals(at.value, value)) {
+            return at;
+        }
+        at = at.prev;
     }
+};
 
-    /* c8 ignore next 25 */
-    distance(other) {
-        if (this.intersects(other))
-            return 0;
-        let x1, y1, x2, y2;
-        if (this.x1 > other.x2)
-            x1 = this.x1;
-        x2 = other.x2;
-        if (this.x2 < other.x1)
-            x1 = this.x2;
-        x2 = other.x1;
-        if (this.y1 < other.y2)
-            y1 = this.y1;
-        y2 = other.y2;
-        if (this.y2 > other.y1)
-            y1 = this.y2;
-        y2 = other.y1;
-        if (x1 === undefined) {
-            x1 = this.x1;
-            x2 = this.x1;
-        }
-        if (y1 === undefined) {
-            y1 = this.y1;
-            y2 = this.y1;
-        }
-        return new Point(x1, y1).distanceEarth(new Point(x2, y2));
-    }
+List.prototype.has = function (value, equals) {
+    return !!this.find(value, equals);
+};
 
-    geojson(id, properties) {
-        const feature = {
-            type: 'Feature',
-            id,
-            properties: properties || {},
-            geometry: {
-                type: 'Polygon',
-                coordinates: [[
-                    [this.x1, this.y1],
-                    [this.x1, this.y2],
-                    [this.x2, this.y2],
-                    [this.x2, this.y1],
-                    [this.x1, this.y1],
-                ]]
-            }
-        };
-        return feature;
+List.prototype.get = function (value, equals) {
+    var found = this.find(value, equals);
+    if (found) {
+        return found.value;
     }
+    return this.getDefault(value);
+};
 
-    /* c8 ignore next 11 */
-    geojson_collection(boxes) {
-        let features = [];
-        for (let b in boxes) {
-            features.push(boxes[b].geojson(b, { id: b }));
-        }
-        let collection = {
-            type: 'FeatureCollection',
-            features
-        };
-        return collection;
+// LIFO (delete removes the most recently added equivalent value)
+List.prototype["delete"] = function (value, equals) {
+    var found = this.findLast(value, equals);
+    if (found) {
+        found["delete"]();
+        this.length--;
+        return true;
     }
+    return false;
+};
 
-    toString() {
-        return JSON.stringify(this.geojson());
+List.prototype.deleteAll = function (value, equals) {
+    equals = equals || this.contentEquals;
+    var head = this.head;
+    var at = head.next;
+    var count = 0;
+    while (at !== head) {
+        if (equals(value, at.value)) {
+            at["delete"]();
+            count++;
+        }
+        at = at.next;
     }
-}
-
-var foundation = {
-    Point,
-    Range,
-    Box
+    this.length -= count;
+    return count;
 };
 
-var _Flatbush = getCjsExportFromNamespace(flatbush);
-
-var RBush$1 = getCjsExportFromNamespace(rbush);
-
-const Flatbush$1 = _Flatbush.default ? _Flatbush.default : _Flatbush;
+List.prototype.clear = function () {
+    this.head.next = this.head.prev = this.head;
+    this.length = 0;
+};
 
-const RBush3D = dist.RBush3D;
+List.prototype.add = function (value) {
+    var node = new this.Node(value);
+    return this._addNode(node);
+};
 
-const { Box: Box$1, Point: Point$1 } = foundation;
+List.prototype._addNode = function (node) {
+    this.head.addBefore(node);
+    this.length++;
+    return true;
+};
 
-/* Paragliding Competition Tracklog Optimization, Ondˇrej Palkovsk´y
- * http://www.penguin.cz/~ondrap/algorithm.pdf
- * Refer for a proof that the maximum path between rectangles always
- * passes through their vertices
- * 
- * My addition :
- * With 3 rectanges, for each rectangle, the maximum path between them always includes:
- * a) only the vertices that lie on the vertices of the minimum bounding box if there are such vertices
- * b) if there are no such vertices, any vertices that lie on the edges of the bounding box
- * c) or potentially any vertice if no vertices lie on the edges of the bounding box
- */
-function maxDistance3Rectangles(boxes, distance_fn) {
-    let vertices = [];
-    let minx, miny, maxx, maxy;
-    for (let r of [0, 1, 2]) {
-        vertices[r] = boxes[r].vertices();
-        minx = Math.min(minx || Infinity, boxes[r].x1);
-        miny = Math.min(miny || Infinity, boxes[r].y1);
-        maxx = Math.max(maxx || -Infinity, boxes[r].x2);
-        maxy = Math.max(maxy || -Infinity, boxes[r].y2);
+List.prototype.push = function () {
+    var head = this.head;
+    for (var i = 0; i < arguments.length; i++) {
+        var value = arguments[i];
+        var node = new this.Node(value);
+        head.addBefore(node);
     }
+    this.length += arguments.length;
+};
 
-    let intersecting = false;
-    for (let i of [0, 1, 2])
-        if (boxes[i].intersects(boxes[(i + 1) % 3])) {
-            intersecting = true;
-            break;
-        }
-
-    let path = [[], [], []];
-    for (let i of [0, 1, 2]) {
-        for (let v of vertices[i])
-            if ((v.x == minx || v.x == maxx) && (v.y == miny || v.y == maxy))
-                path[i].push(v);
-        if (path[i].length == 0)
-            for (let v of vertices[i])
-                if (v.x == minx || v.x == maxx || v.y == miny || v.y == maxy)
-                    path[i].push(v);
-        if (path[i].length == 0 || intersecting)
-            path[i] = vertices[i];
+List.prototype.unshift = function () {
+    var at = this.head;
+    for (var i = 0; i < arguments.length; i++) {
+        var value = arguments[i];
+        var node = new this.Node(value);
+        at.addAfter(node);
+        at = node;
     }
+    this.length += arguments.length;
+};
 
-    let distanceMax = 0;
-    for (let i of path[0])
-        for (let j of path[1])
-            for (let k of path[2]) {
-                const distance = distance_fn(i, j, k);
-                distanceMax = Math.max(distanceMax, distance);
-            }
-
-    return distanceMax;
-}
-
-function minDistance3Rectangles(boxes, distance_fn) {
-    let vertices = [];
-    let minx, miny, maxx, maxy;
-    for (let r of [0, 1, 2]) {
-        vertices[r] = boxes[r].vertices();
-        minx = Math.min(minx || Infinity, boxes[r].x1);
-        miny = Math.min(miny || Infinity, boxes[r].y1);
-        maxx = Math.max(maxx || -Infinity, boxes[r].x2);
-        maxy = Math.max(maxy || -Infinity, boxes[r].y2);
+List.prototype._shouldPop = function () {
+    var value;
+    var head = this.head;
+    if (head.prev !== head) {
+        value = head.prev.value;
     }
+    return value;
+};
 
-    let path = [[], [], []];
-    for (let i of [0, 1, 2]) {
-        path[i] = vertices[i];
+List.prototype.pop = function (_before, _after) {
+    var value;
+    var head = this.head;
+    if (head.prev !== head) {
+        value = head.prev.value;
+        var index = this.length - 1;
+        var popDispatchValueArray = _before ? _before.call(this,value,index) : void 0;
+        head.prev['delete']();
+        this.length--;
+        _after ? _after.call(this,value,index, popDispatchValueArray) : void 0;
     }
+    return value;
+};
 
-    let distanceMin = Infinity;
-    for (let i of path[0])
-        for (let j of path[1])
-            for (let k of path[2]) {
-                const distance = distance_fn(i, j, k);
-                distanceMin = Math.min(distanceMin, distance);
-            }
-
-    return distanceMin;
-}
+List.prototype.shift = function (_before, _after) {
+    var value;
+    var head = this.head;
+    if (head.prev !== head) {
+        value = head.next.value;
+        var dispatchValueArray = _before ? _before.call(this,value,0) : void 0;
+        head.next['delete']();
+        this.length--;
+        _after ? _after.call(this,value,0,dispatchValueArray) : void 0;
+    }
+    return value;
+};
 
-function maxDistance2Rectangles(boxes) {
-    let vertices = [];
-    let minx, miny, maxx, maxy;
-    for (let r of [0, 1]) {
-        vertices[r] = boxes[r].vertices();
-        minx = Math.min(minx || Infinity, boxes[r].x1);
-        miny = Math.min(miny || Infinity, boxes[r].y1);
-        maxx = Math.max(maxx || -Infinity, boxes[r].x2);
-        maxy = Math.max(maxy || -Infinity, boxes[r].y2);
+List.prototype.peek = function () {
+    if (this.head !== this.head.next) {
+        return this.head.next.value;
     }
+};
 
-    let path = [[], []];
-    for (let i of [0, 1]) {
-        path[i] = vertices[i];
+List.prototype.poke = function (value) {
+    if (this.head !== this.head.next) {
+        this.head.next.value = value;
+    } else {
+        this.push(value);
     }
+};
 
-    let distanceMax = 0;
-    for (let i of path[0])
-        for (let j of path[1]) {
-            const distance = i.distanceEarth(j);
-            distanceMax = Math.max(distanceMax, distance);
-        }
-
-    return distanceMax;
-}
-
-function maxDistancePath(origin, path, pathStart) {
-    let distanceMax = 0;
-    for (let i of path[pathStart]) {
-        const distance1 = origin !== undefined ? i.distanceEarth(origin) : 0;
-        const distance2 = path.length > pathStart + 1 ? maxDistancePath(i, path, pathStart + 1) : 0;
-        distanceMax = Math.max(distanceMax, distance1 + distance2);
-    }
-    return distanceMax;
-}
-
-function maxDistanceNRectangles(boxes) {
-    let vertices = [];
-    let minx, miny, maxx, maxy;
-    let path = [];
-    for (let r in boxes) {
-        if (boxes[r] instanceof Box$1) {
-            vertices[r] = boxes[r].vertices();
-            minx = Math.min(minx || Infinity, boxes[r].x1);
-            miny = Math.min(miny || Infinity, boxes[r].y1);
-            maxx = Math.max(maxx || -Infinity, boxes[r].x2);
-            maxy = Math.max(maxy || -Infinity, boxes[r].y2);
-        } else if (boxes[r] instanceof Point$1) {
-            vertices[r] = [boxes[r]];
-            minx = Math.min(minx || Infinity, boxes[r].x);
-            miny = Math.min(miny || Infinity, boxes[r].y);
-            maxx = Math.max(maxx || -Infinity, boxes[r].x);
-            maxy = Math.max(maxy || -Infinity, boxes[r].y);
-        } else
-            throw new TypeError('boxes must contain only Box or Point');
-        path[r] = [];
-    }
-
-    for (let i in boxes)
-        if (i > 0) {
-            const intersecting = boxes[i - 1].intersects(boxes[i]);
-            if (intersecting) {
-                boxes[i - 1].intersecting = true;
-                boxes[i].intersecting = true;
-            }
-        }
-
-    for (let i in boxes) {
-        if (boxes[i].intersecting) {
-            path[i] = vertices[i];
-            continue;
-        }
-        for (let v of vertices[i])
-            if ((v.x == minx || v.x == maxx) && (v.y == miny || v.y == maxy))
-                path[i].push(v);
-        if (path[i].length == 0)
-            for (let v of vertices[i])
-                if (v.x == minx || v.x == maxx || v.y == miny || v.y == maxy)
-                    path[i].push(v);
-        if (path[i].length == 0)
-            path[i] = vertices[i];
-    }
-
-    let distanceMax = maxDistancePath(undefined, path, 0);
-    return distanceMax;
-}
-
-function findClosestPairIn2Segments(p1, p2, opt) {
-    let precomputedAll = opt.flight.closestPairs.search({ minX: p1, minY: p2, maxX: p1, maxY: p2 });
-    let precomputed = precomputedAll.reduce((a, x) => (!a || x.in > a.in) ? x : a, undefined);
-    precomputed = precomputedAll.reduce((a, x) => (!a || x.out < a.out) ? x : a, precomputed);
-    if (precomputed !== undefined)
-        return precomputed.o;
-
-    const rtree = new Flatbush$1(p1 + 1 - opt.launch, 8);
-    const lc = Math.abs(Math.cos(util.radians(opt.flight.flightPoints[p1].y)));
-    for (let i = opt.launch; i <= p1; i++) {
-        const r = opt.flight.flightPoints[i];
-        rtree.add(r.x * lc, r.y, r.x * lc, r.y);
-    }
-    rtree.finish();
-
-    precomputedAll = opt.flight.closestPairs.search({ minX: p1, minY: p2, maxX: p1, maxY: opt.landing });
-    const precomputedNext = precomputedAll.reduce((a, x) => (!a || x.out < a.out) ? x : a, undefined);
-    const lastUnknown = precomputedNext !== undefined ? precomputedNext.maxY : opt.landing;
-    let min = { d: Infinity };
-    for (let i = p2; i < lastUnknown; i++) {
-        const pout = opt.flight.flightPoints[i];
-        const n = rtree.neighbors(pout.x * lc, pout.y, 1)[0] + opt.launch;
-        if (n !== undefined) {
-            const pin = opt.flight.flightPoints[n];
-            const d = pout.distanceEarth(pin);
-            if (d < min.d) {
-                min.d = d;
-                min.out = pout;
-                min.in = pin;
-            }
-        }
-    }
-    if (precomputedNext !== undefined) {
-        const pout = precomputedNext.o.out;
-        const pin = precomputedNext.o.in;
-        const d = pout.distanceEarth(pin);
-        if (d < min.d) {
-            min.d = d;
-            min.out = pout;
-            min.in = pin;
-        }
-    }
-
-    opt.flight.closestPairs.insert({ minX: min.in.r, minY: p2, maxX: p1, maxY: min.out.r, o: min });
-    return min;
-}
-
-function findFurthestPointInSegment(sega, segb, target, opt) {
-    let points;
-    if (target instanceof Box$1)
-        points = target.vertices();
-    else if (target instanceof Point$1)
-        points = [target];
-    else
-        throw new TypeError('target must be either Point or Box');
-    
-    let pos;
-    let zSearch;
-    if (sega === opt.launch) {
-        pos = 0;
-        zSearch = { minZ: +opt.launch, maxZ: +segb };
-    } else if (segb === opt.landing) {
-        pos = 1;
-        zSearch = { minZ: +sega, maxZ: +opt.landing };
-    } else
-        throw new RangeError('this function supports seeking only from the launch or the landing point');
-
-    let distanceMax = -Infinity;
-    let fpoint;
-    for (let v of points) {
-        let distanceVMax = -Infinity;
-        let fVpoint;
-
-        const precomputed = opt.flight.furthestPoints[pos].search({ minX: v.x, minY: v.y, maxX: v.x, maxY: v.y, ...zSearch });
-        if (precomputed.length > 1)
-            throw new Error('furthestPoints cache inconsistency');
+List.prototype.one = function () {
+    return this.peek();
+};
 
-        if (precomputed[0])
-            if (sega <= precomputed[0].o.r && precomputed[0].o.r <= segb) {
-                distanceVMax = v.distanceEarth(precomputed[0].o);
-                fVpoint = precomputed[0].o;
-            } else
-                throw new Error('furthestPoints cache inconsistency');
+// TODO
+// List.prototype.indexOf = function (value) {
+// };
 
-        if (fVpoint === undefined) {
-            let intersecting = false;
-            let canCache = false;
+// TODO
+// List.prototype.lastIndexOf = function (value) {
+// };
 
-            for (let p = sega; p <= segb; p++) {
-                const f = opt.flight.flightPoints[p];
-                if (target instanceof Box$1 && target.intersects(f)) {
-                    intersecting = true;
-                    continue;
-                }
-                const d = v.distanceEarth(f);
-                if (d > distanceVMax) {
-                    distanceVMax = d;
-                    fVpoint = f;
-                    canCache = true;
-                }
-            }
-            if (intersecting) {
-                for (let p of points) {
-                    const d = v.distanceEarth(p);
-                    if (d > distanceVMax) {
-                        distanceVMax = d;
-                        fVpoint = target;
-                        canCache = false;
-                    }
+// an internal utility for coercing index offsets to nodes
+List.prototype.scan = function (at, fallback) {
+    var head = this.head;
+    if (typeof at === "number") {
+        var count = at;
+        if (count >= 0) {
+            at = head.next;
+            while (count) {
+                count--;
+                at = at.next;
+                if (at == head) {
+                    break;
                 }
             }
-            if (canCache) {
-                let zCache;
-                if (sega === opt.launch) {
-                    zCache = { minZ: +fVpoint.r, maxZ: +segb };
-                } else if (segb === opt.landing) {
-                    zCache = { minZ: +sega, maxZ: +fVpoint.r };
+        } else {
+            at = head;
+            while (count < 0) {
+                count++;
+                at = at.prev;
+                if (at == head) {
+                    break;
                 }
-
-                opt.flight.furthestPoints[pos].insert({ minX: v.x, maxX: v.x, minY: v.y, maxY: v.y, ...zCache, o: fVpoint });
             }
         }
-        if (distanceVMax > distanceMax) {
-            distanceMax = distanceVMax;
-            fpoint = fVpoint;
-        }
+        return at;
+    } else {
+        return at || fallback;
     }
-    if (fpoint === undefined)
-        fpoint = target;
-
-    return fpoint;
-}
-
-function isTriangleClosed(p1, p2, distance, opt) {
-    const fastCandidates = opt.flight.closestPairs.search({ minX: opt.launch, minY: p2, maxX: p1, maxY: opt.landing });
-    for (let f of fastCandidates)
-        if (f.o.d <= opt.scoring.closingDistanceFree)
-            return f.o;
-
-    const min = findClosestPairIn2Segments(p1, p2, opt);
-
-    if (min.d <= opt.scoring.closingDistance(distance, opt))
-        return min;
-    return false;
-}
-
-function init(opt) {
-    opt.flight.closestPairs = new RBush$1();
-    opt.flight.furthestPoints = [new RBush3D(), new RBush3D()];
-    opt.flight.flightPoints = new Array(opt.flight.filtered.length);
-    for (let r in opt.flight.filtered)
-        opt.flight.flightPoints[r] = new Point$1(opt.flight.filtered, r);
-}
-
-var geom = {
-    maxDistance3Rectangles,
-    maxDistance2Rectangles,
-    minDistance3Rectangles,
-    maxDistanceNRectangles,
-    findFurthestPointInSegment,
-    isTriangleClosed,
-    init
 };
 
-function closingPenalty(cd, opt) {
-    return (cd > (opt.scoring.closingDistanceFree || 0) ? cd : 0);
-}
-
-function closingWithLimit(distance, opt) {
-    return Math.max(opt.scoring.closingDistanceFixed || 0, distance * (opt.scoring.closingDistanceRelative || 0));
-}
+// at and end may both be positive or negative numbers (in which cases they
+// correspond to numeric indicies, or nodes)
+List.prototype.slice = function (at, end) {
+    var sliced = [];
+    var head = this.head;
+    at = this.scan(at, head.next);
+    end = this.scan(end, head);
 
-/*eslint no-unused-vars: ["error", { "args": "none" }]*/
-function closingWithPenalty(distance, opt) {
-    return Infinity;
-}
-
-function boundDistance3Points(ranges, boxes, opt) {
-    const pin = geom.findFurthestPointInSegment(opt.launch, ranges[0].a, boxes[0], opt);
-    const pout = geom.findFurthestPointInSegment(ranges[2].b, opt.landing, boxes[2], opt);
-    const maxDistance = geom.maxDistanceNRectangles([pin, boxes[0], boxes[1], boxes[2], pout]);
-    return maxDistance * opt.scoring.multiplier;
-}
-
-function scoreDistance3Points(tp, opt) {
-    let distance = 0;
-    const pin = geom.findFurthestPointInSegment(opt.launch, tp[0].r, tp[0], opt);
-    const pout = geom.findFurthestPointInSegment(tp[2].r, opt.landing, tp[2], opt);
-    const all = [pin, tp[0], tp[1], tp[2], pout];
-    for (let i of [0, 1, 2, 3])
-        distance += all[i].distanceEarth(all[i + 1]);
-    const score = distance * opt.scoring.multiplier;
-    return { distance, score, tp: tp, ep: { start: pin, finish: pout } };
-}
-
-function maxFAIDistance(maxTriDistance, boxes, opt) {
-    const minTriDistance = geom.minDistance3Rectangles(boxes, (i, j, k) => {
-        return i.distanceEarth(j) + j.distanceEarth(k) + k.distanceEarth(i);
-    });
-
-    const maxAB = geom.maxDistance2Rectangles([boxes[0], boxes[1]]);
-    const maxBC = geom.maxDistance2Rectangles([boxes[1], boxes[2]]);
-    const maxCA = geom.maxDistance2Rectangles([boxes[2], boxes[0]]);
-    const maxDistance = Math.min(maxAB / opt.scoring.minSide,
-        maxBC / opt.scoring.minSide, maxCA / opt.scoring.minSide, maxTriDistance);
-    if (maxDistance < minTriDistance)
-        return 0;
-    return maxDistance;
-}
-
-function boundOpenTriangle(ranges, boxes, opt) {
-    const pin = geom.findFurthestPointInSegment(opt.launch, ranges[0].a, boxes[0], opt);
-    const pout = geom.findFurthestPointInSegment(ranges[2].b, opt.landing, boxes[2], opt);
-    const maxD3PDistance = geom.maxDistanceNRectangles([pin, boxes[0], boxes[1], boxes[2], pout]);
-    const maxTriDistance = geom.maxDistance3Rectangles(boxes, (i, j, k) => {
-        return i.distanceEarth(j) + j.distanceEarth(k) + k.distanceEarth(i);
-    });
-    if (opt.scoring.minSide !== undefined) {
-        if (maxFAIDistance(maxTriDistance, boxes, opt) === 0)
-            return 0;
-    }
-
-    let cp = { d: 0 };
-    if (ranges[0].b < ranges[2].a) {
-        cp = geom.isTriangleClosed(ranges[0].b, ranges[2].a, maxTriDistance, opt);
-        if (!cp)
-            return 0;
-        return (maxD3PDistance - closingPenalty(cp.d, opt)) * opt.scoring.multiplier;
-    }
-
-    return maxD3PDistance * opt.scoring.multiplier;
-}
-
-function scoreOpenTriangle(tp, opt) {
-    const d0 = tp[0].distanceEarth(tp[1]);
-    const d1 = tp[1].distanceEarth(tp[2]);
-    const d2 = tp[2].distanceEarth(tp[0]);
-    const triDistance = d0 + d1 + d2;
-
-    if (opt.scoring.minSide !== undefined) {
-        const minSide = opt.scoring.minSide * triDistance;
-        if (d0 < minSide || d1 < minSide || d2 < minSide)
-            return { score: 0 };
-    }
-
-    let cp = geom.isTriangleClosed(tp[0].r, tp[2].r, triDistance, opt);
-    if (!cp)
-        return { score: 0 };
-
-    let d3pDistance = 0;
-    const pin = geom.findFurthestPointInSegment(opt.launch, tp[0].r, tp[0], opt);
-    const pout = geom.findFurthestPointInSegment(tp[2].r, opt.landing, tp[2], opt);
-    const all = [pin, tp[0], tp[1], tp[2], pout];
-    for (let i of [0, 1, 2, 3])
-        d3pDistance += all[i].distanceEarth(all[i + 1]);
-    
-    const distance = d3pDistance;
-    const score = distance * opt.scoring.multiplier - closingPenalty(cp.d, opt);
-    return { distance, score, tp: tp, ep: { start: pin, finish: pout }, cp };
-}
-
-function boundTriangle(ranges, boxes, opt) {
-    const maxTriDistance = geom.maxDistance3Rectangles(boxes, (i, j, k) => {
-        return i.distanceEarth(j) + j.distanceEarth(k) + k.distanceEarth(i);
-    });
-
-    const maxDistance = (opt.scoring.minSide !== undefined)
-        ? maxFAIDistance(maxTriDistance, boxes, opt)
-        : maxTriDistance;
-    
-    if (maxDistance === 0)
-        return 0;
-
-    let cp = { d: 0 };
-    if (ranges[0].b < ranges[2].a) {
-        cp = geom.isTriangleClosed(ranges[0].b, ranges[2].a, maxDistance, opt);
-        if (!cp)
-            return 0;
-        return (maxDistance - closingPenalty(cp.d, opt)) * opt.scoring.multiplier;
-    }
-
-    return maxDistance * opt.scoring.multiplier;
-}
-
-function scoreTriangle(tp, opt) {
-    const d0 = tp[0].distanceEarth(tp[1]);
-    const d1 = tp[1].distanceEarth(tp[2]);
-    const d2 = tp[2].distanceEarth(tp[0]);
-    const distance = d0 + d1 + d2;
-    
-    if (opt.scoring.minSide !== undefined) {
-        const minSide = opt.scoring.minSide * distance;
-        if (d0 < minSide || d1 < minSide || d2 < minSide)
-            return { score: 0 };
-    }
-
-    let cp = geom.isTriangleClosed(tp[0].r, tp[2].r, distance, opt);
-    if (!cp)
-        return { score: 0 };
-
-    let score = (distance - closingPenalty(cp.d, opt)) * opt.scoring.multiplier;
-
-    return { distance, score, tp, cp };
-}
-
-var scoring = {
-    closingWithLimit,
-    closingWithPenalty,
-    boundTriangle,
-    scoreTriangle,
-    boundDistance3Points,
-    scoreDistance3Points,
-    boundOpenTriangle,
-    scoreOpenTriangle
-};
-
-/**
- * These are the scoring types
- * @enum {object[][]} scoringRules
- *
- * The differences are mostly in the mutipliers and the way the closing distances of the triangles are calculated
- * 
- * These are the tools that are already implemented in scoring.js/geom.js:
- * @param {function} closingDistance is the triangle closing type, you choose between two types:
- *      closingWithLimit - closing distance is limited
- *      closingWithPenalty - closing distance is unlimited but incurs a penalty
- * @param {number} closingDistanceFixed is the fixed closing distance that is always accepted
- * @param {number} closingDistanceFree is the closing distance that does not incur any scoring penalty
- * @param {number} closingDistanceRelative is the closing distance that is relative to the full triangle length but incurs a penalty
- */
-const scoringRules = {
-    /**
-     * @constant {object[]}
-     */
-    'FFVL': [
-        {
-            name: 'Distance 3 points',
-            multiplier: 1,
-            bound: scoring.boundDistance3Points,
-            score: scoring.scoreDistance3Points,
-            rounding: round2,
-            cardinality: 3,
-            code: 'od'
-        },
-        {
-            name: 'Triangle plat',
-            multiplier: 1.2,
-            bound: scoring.boundTriangle,
-            score: scoring.scoreTriangle,
-            closingDistance: scoring.closingWithLimit,
-            closingDistanceFixed: 3,
-            closingDistanceFree: 3,
-            closingDistanceRelative: 0.05,
-            rounding: round2,
-            cardinality: 3,
-            code: 'tri'
-        },
-        {
-            name: 'Triangle FAI',
-            multiplier: 1.4,
-            bound: scoring.boundTriangle,
-            score: scoring.scoreTriangle,
-            minSide: 0.28,
-            closingDistance: scoring.closingWithLimit,
-            closingDistanceFixed: 3,
-            closingDistanceFree: 3,
-            closingDistanceRelative: 0.05,
-            rounding: round2,
-            cardinality: 3,
-            code: 'fai'
-        }
-    ],
-    /**
-     * @constant {object[]}
-     */
-    'XContest': [
-        {
-            name: 'Free flight',
-            multiplier: 1,
-            bound: scoring.boundDistance3Points,
-            score: scoring.scoreDistance3Points,
-            rounding: round2,
-            cardinality: 3,
-            code: 'od'
-        },
-        {
-            name: 'Free triangle',
-            multiplier: 1.2,
-            bound: scoring.boundTriangle,
-            score: scoring.scoreTriangle,
-            closingDistance: scoring.closingWithLimit,
-            closingDistanceRelative: 0.2,
-            rounding: round2,
-            cardinality: 3,
-            code: 'tri'
-        },
-        {
-            name: 'FAI triangle',
-            multiplier: 1.4,
-            bound: scoring.boundTriangle,
-            score: scoring.scoreTriangle,
-            minSide: 0.28,
-            closingDistance: scoring.closingWithLimit,
-            closingDistanceRelative: 0.2,
-            rounding: round2,
-            cardinality: 3,
-            code: 'fai'
-        },
-        {
-            name: 'Closed free triangle',
-            multiplier: 1.4,
-            bound: scoring.boundTriangle,
-            score: scoring.scoreTriangle,
-            closingDistance: scoring.closingWithLimit,
-            closingDistanceFixed: 0,
-            closingDistanceFree: 0,
-            closingDistanceRelative: 0.05,
-            rounding: round2,
-            cardinality: 3,
-            code: 'tri'
-        },
-        {
-            name: 'Closed FAI triangle',
-            multiplier: 1.6,
-            bound: scoring.boundTriangle,
-            score: scoring.scoreTriangle,
-            minSide: 0.28,
-            closingDistance: scoring.closingWithLimit,
-            closingDistanceFixed: 0,
-            closingDistanceFree: 0,
-            closingDistanceRelative: 0.05,
-            rounding: round2,
-            cardinality: 3,
-            code: 'fai'
-        }
-    ]
-};
-
-function round2(score) {
-    return parseFloat(parseFloat(score).toFixed(2));
-}
-
-var scoringRules_config = scoringRules;
-
-/**
-    A utility to reduce unnecessary allocations of <code>function () {}</code>
-    in its many colorful variations.  It does nothing and returns
-    <code>undefined</code> thus makes a suitable default in some circumstances.
-
-    @function external:Function.noop
-*/
-Function.noop = function () {
-};
-
-/**
-    A utility to reduce unnecessary allocations of <code>function (x) {return
-    x}</code> in its many colorful but ultimately wasteful parameter name
-    variations.
-
-    @function external:Function.identity
-    @param {Any} any value
-    @returns {Any} that value
-*/
-Function.identity = function (value) {
-    return value;
-};
-
-/**
-    A utility for creating a comparator function for a particular aspect of a
-    figurative class of objects.
-
-    @function external:Function.by
-    @param {Function} relation A function that accepts a value and returns a
-    corresponding value to use as a representative when sorting that object.
-    @param {Function} compare an alternate comparator for comparing the
-    represented values.  The default is <code>Object.compare</code>, which
-    does a deep, type-sensitive, polymorphic comparison.
-    @returns {Function} a comparator that has been annotated with
-    <code>by</code> and <code>compare</code> properties so
-    <code>sorted</code> can perform a transform that reduces the need to call
-    <code>by</code> on each sorted object to just once.
- */
-Function.by = function (by , compare) {
-    compare = compare || Object.compare;
-    by = by || Function.identity;
-    var compareBy = function (a, b) {
-        return compare(by(a), by(b));
-    };
-    compareBy.compare = compare;
-    compareBy.by = by;
-    return compareBy;
-};
-
-// TODO document
-Function.get = function (key) {
-    return function (object) {
-        return Object.get(object, key);
-    };
-};
-
-var genericCollection = GenericCollection;
-function GenericCollection() {
-    throw new Error("Can't construct. GenericCollection is a mixin.");
-}
-
-var DOMTokenList = commonjsGlobal.DOMTokenList || function(){};
-
-GenericCollection.EmptyArray = Object.freeze([]);
-
-GenericCollection.prototype.addEach = function (values, mapFn, thisp) {
-    //We want to eliminate everything but array like: Strings, Arrays, DOMTokenList
-    if(values && (values instanceof Array || (values instanceof DOMTokenList) || values instanceof String)) {
-        if(mapFn) {
-            for (var i = 0; i < values.length; i++) {
-                this.add(mapFn.call(thisp,values[i]), i);
-            }
-        } else {
-            for (var i = 0; i < values.length; i++) {
-                this.add(values[i], i);
-            }
-        }
-    }
-    else if (values && Object(values) === values) {
-        if (typeof values.forEach === "function") {
-            if(mapFn) {
-                values.map(mapFn, thisp).forEach(this.add, this);
-            } else {
-                values.forEach(this.add, this);
-            }
-        } else if(typeof values.next === "function") {
-            var value, i=0;
-            if(mapFn) {
-                while ((value = values.next().value)) {
-                    this.add(mapFn.call(thisp,value), i++);
-                }
-            }
-            else {
-                while ((value = values.next().value)) {
-                    this.add(value, i++);
-                }
-            }
-        } else if (typeof values.length === "number") {
-            // Array-like objects that do not implement forEach, ergo,
-            // Arguments
-            if(mapFn) {
-                for (var i = 0; i < values.length; i++) {
-                    this.add(mapFn.call(thisp,values[i]), i);
-                }
-            }
-            else {
-                for (var i = 0; i < values.length; i++) {
-                    this.add(values[i], i);
-                }
-            }
-        } else {
-            if(mapFn) {
-                Object.keys(values).forEach(function (key) {
-                    this.add(mapFn.call(thisp,values[key]), key);
-                }, this);
-            } else {
-                Object.keys(values).forEach(function (key) {
-                    this.add(values[key], key);
-                }, this);
-            }
-        }
-    }
-    return this;
-};
-
-// This is sufficiently generic for Map (since the value may be a key)
-// and ordered collections (since it forwards the equals argument)
-GenericCollection.prototype.deleteEach = function (values, equals) {
-    values.forEach(function (value) {
-        this["delete"](value, equals);
-    }, this);
-    return this;
-};
-
-// all of the following functions are implemented in terms of "reduce".
-// some need "constructClone".
-
-GenericCollection.prototype.forEach = function (callback /*, thisp*/) {
-    var thisp = arguments[1];
-    return this.reduce(function (undefined$1, value, key, object, depth) {
-        callback.call(thisp, value, key, object, depth);
-    }, undefined);
-};
-
-GenericCollection.prototype.map = function (callback /*, thisp*/) {
-    var thisp = arguments[1];
-    var result = [];
-    this.reduce(function (undefined$1, value, key, object, depth) {
-        result.push(callback.call(thisp, value, key, object, depth));
-    }, undefined);
-    return result;
-};
-
-GenericCollection.prototype.enumerate = function (start) {
-    if (start == null) {
-        start = 0;
-    }
-    var result = [];
-    this.reduce(function (undefined$1, value) {
-        result.push([start++, value]);
-    }, undefined);
-    return result;
-};
-
-GenericCollection.prototype.group = function (callback, thisp, equals) {
-    equals = equals || Object.equals;
-    var groups = [];
-    var keys = [];
-    this.forEach(function (value, key, object) {
-        var key = callback.call(thisp, value, key, object);
-        var index = keys.indexOf(key, equals);
-        var group;
-        if (index === -1) {
-            group = [];
-            groups.push([key, group]);
-            keys.push(key);
-        } else {
-            group = groups[index][1];
-        }
-        group.push(value);
-    });
-    return groups;
-};
-
-GenericCollection.prototype.toArray = function () {
-    return this.map(Function.identity);
-};
-
-// this depends on stringable keys, which apply to Array and Iterator
-// because they have numeric keys and all Maps since they may use
-// strings as keys.  List, Set, and SortedSet have nodes for keys, so
-// toObject would not be meaningful.
-GenericCollection.prototype.toObject = function () {
-    var object = {};
-    this.reduce(function (undefined$1, value, key) {
-        object[key] = value;
-    }, undefined);
-    return object;
-};
-
-GenericCollection.from = function () {
-    return this.apply(this,arguments);
-};
-
-GenericCollection.prototype.filter = function (callback /*, thisp*/) {
-    var thisp = arguments[1];
-    var result = this.constructClone();
-    this.reduce(function (undefined$1, value, key, object, depth) {
-        if (callback.call(thisp, value, key, object, depth)) {
-            result.add(value, key);
-        }
-    }, undefined);
-    return result;
-};
-
-GenericCollection.prototype.every = function (callback /*, thisp*/) {
-    var thisp = arguments[1];
-    return this.reduce(function (result, value, key, object, depth) {
-        return result && callback.call(thisp, value, key, object, depth);
-    }, true);
-};
-
-GenericCollection.prototype.some = function (callback /*, thisp*/) {
-    var thisp = arguments[1];
-    return this.reduce(function (result, value, key, object, depth) {
-        return result || callback.call(thisp, value, key, object, depth);
-    }, false);
-};
-
-GenericCollection.prototype.all = function () {
-    return this.every(Boolean);
-};
-
-GenericCollection.prototype.any = function () {
-    return this.some(Boolean);
-};
-
-GenericCollection.prototype.min = function (compare) {
-    compare = compare || this.contentCompare || Object.compare;
-    var first = true;
-    return this.reduce(function (result, value) {
-        if (first) {
-            first = false;
-            return value;
-        } else {
-            return compare(value, result) < 0 ? value : result;
-        }
-    }, undefined);
-};
-
-GenericCollection.prototype.max = function (compare) {
-    compare = compare || this.contentCompare || Object.compare;
-    var first = true;
-    return this.reduce(function (result, value) {
-        if (first) {
-            first = false;
-            return value;
-        } else {
-            return compare(value, result) > 0 ? value : result;
-        }
-    }, undefined);
-};
-
-GenericCollection.prototype.sum = function (zero) {
-    zero = zero === undefined ? 0 : zero;
-    return this.reduce(function (a, b) {
-        return a + b;
-    }, zero);
-};
-
-GenericCollection.prototype.average = function (zero) {
-    var sum = zero === undefined ? 0 : zero;
-    var count = zero === undefined ? 0 : zero;
-    this.reduce(function (undefined$1, value) {
-        sum += value;
-        count += 1;
-    }, undefined);
-    return sum / count;
-};
-
-GenericCollection.prototype.concat = function () {
-    var result = this.constructClone(this);
-    for (var i = 0; i < arguments.length; i++) {
-        result.addEach(arguments[i]);
-    }
-    return result;
-};
-
-GenericCollection.prototype.flatten = function () {
-    var self = this;
-    return this.reduce(function (result, array) {
-        array.forEach(function (value) {
-            this.push(value);
-        }, result, self);
-        return result;
-    }, []);
-};
-
-GenericCollection.prototype.zip = function () {
-    var table = Array.prototype.slice.call(arguments);
-    table.unshift(this);
-    return Array.unzip(table);
-};
-
-GenericCollection.prototype.join = function (delimiter) {
-    return this.reduce(function (result, string) {
-        // work-around for reduce that does not support no-basis form
-        if (result === void 0) {
-            return string;
-        } else {
-            return result + delimiter + string;
-        }
-    }, void 0);
-};
-
-GenericCollection.prototype.sorted = function (compare, by, order) {
-    compare = compare || this.contentCompare || Object.compare;
-    // account for comparators generated by Function.by
-    if (compare.by) {
-        by = compare.by;
-        compare = compare.compare || this.contentCompare || Object.compare;
-    } else {
-        by = by || Function.identity;
-    }
-    if (order === undefined)
-        order = 1;
-    return this.map(function (item) {
-        return {
-            by: by(item),
-            value: item
-        };
-    })
-    .sort(function (a, b) {
-        return compare(a.by, b.by) * order;
-    })
-    .map(function (pair) {
-        return pair.value;
-    });
-};
-
-GenericCollection.prototype.reversed = function () {
-    return this.constructClone(this).reverse();
-};
-
-GenericCollection.prototype.clone = function (depth, memo) {
-    if (depth === undefined) {
-        depth = Infinity;
-    } else if (depth === 0) {
-        return this;
-    }
-    var clone = this.constructClone();
-    this.forEach(function (value, key) {
-        clone.add(Object.clone(value, depth - 1, memo), key);
-    }, this);
-    return clone;
-};
-
-GenericCollection.prototype.only = function () {
-    if (this.length === 1) {
-        return this.one();
-    }
-};
-
-GenericCollection.prototype.iterator = function () {
-    return this.iterate.apply(this, arguments);
-};
-
-GenericCollection._sizePropertyDescriptor = {
-    get: function() {
-        return this.length;
-    },
-    enumerable: false,
-    configurable: true
-};
-
-Object.defineProperty(GenericCollection.prototype,"size",GenericCollection._sizePropertyDescriptor);
-
-var weakMap = createCommonjsModule(function (module) {
-// Copyright (C) 2011 Google Inc.
-//
-// Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-// http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-
-/**
- * @fileoverview Install a leaky WeakMap emulation on platforms that
- * don't provide a built-in one.
- *
- * <p>Assumes that an ES5 platform where, if {@code WeakMap} is
- * already present, then it conforms to the anticipated ES6
- * specification. To run this file on an ES5 or almost ES5
- * implementation where the {@code WeakMap} specification does not
- * quite conform, run <code>repairES5.js</code> first.
- *
- * <p>Even though WeakMapModule is not global, the linter thinks it
- * is, which is why it is in the overrides list below.
- *
- * <p>NOTE: Before using this WeakMap emulation in a non-SES
- * environment, see the note below about hiddenRecord.
- *
- * @author Mark S. Miller
- * @requires crypto, ArrayBuffer, Uint8Array, navigator, console
- * @overrides WeakMap, ses, Proxy
- * @overrides WeakMapModule
- */
-
-/**
- * This {@code WeakMap} emulation is observably equivalent to the
- * ES-Harmony WeakMap, but with leakier garbage collection properties.
- *
- * <p>As with true WeakMaps, in this emulation, a key does not
- * retain maps indexed by that key and (crucially) a map does not
- * retain the keys it indexes. A map by itself also does not retain
- * the values associated with that map.
- *
- * <p>However, the values associated with a key in some map are
- * retained so long as that key is retained and those associations are
- * not overridden. For example, when used to support membranes, all
- * values exported from a given membrane will live for the lifetime
- * they would have had in the absence of an interposed membrane. Even
- * when the membrane is revoked, all objects that would have been
- * reachable in the absence of revocation will still be reachable, as
- * far as the GC can tell, even though they will no longer be relevant
- * to ongoing computation.
- *
- * <p>The API implemented here is approximately the API as implemented
- * in FF6.0a1 and agreed to by MarkM, Andreas Gal, and Dave Herman,
- * rather than the offially approved proposal page. TODO(erights):
- * upgrade the ecmascript WeakMap proposal page to explain this API
- * change and present to EcmaScript committee for their approval.
- *
- * <p>The first difference between the emulation here and that in
- * FF6.0a1 is the presence of non enumerable {@code get___, has___,
- * set___, and delete___} methods on WeakMap instances to represent
- * what would be the hidden internal properties of a primitive
- * implementation. Whereas the FF6.0a1 WeakMap.prototype methods
- * require their {@code this} to be a genuine WeakMap instance (i.e.,
- * an object of {@code [[Class]]} "WeakMap}), since there is nothing
- * unforgeable about the pseudo-internal method names used here,
- * nothing prevents these emulated prototype methods from being
- * applied to non-WeakMaps with pseudo-internal methods of the same
- * names.
- *
- * <p>Another difference is that our emulated {@code
- * WeakMap.prototype} is not itself a WeakMap. A problem with the
- * current FF6.0a1 API is that WeakMap.prototype is itself a WeakMap
- * providing ambient mutability and an ambient communications
- * channel. Thus, if a WeakMap is already present and has this
- * problem, repairES5.js wraps it in a safe wrappper in order to
- * prevent access to this channel. (See
- * PATCH_MUTABLE_FROZEN_WEAKMAP_PROTO in repairES5.js).
- */
-
-/**
- * If this is a full <a href=
- * "http://code.google.com/p/es-lab/wiki/SecureableES5"
- * >secureable ES5</a> platform and the ES-Harmony {@code WeakMap} is
- * absent, install an approximate emulation.
- *
- * <p>If WeakMap is present but cannot store some objects, use our approximate
- * emulation as a wrapper.
- *
- * <p>If this is almost a secureable ES5 platform, then WeakMap.js
- * should be run after repairES5.js.
- *
- * <p>See {@code WeakMap} for documentation of the garbage collection
- * properties of this WeakMap emulation.
- */
-(function WeakMapModule() {
-
-  if (typeof ses !== 'undefined' && ses.ok && !ses.ok()) {
-    // already too broken, so give up
-    return;
-  }
-
-  /**
-   * In some cases (current Firefox), we must make a choice betweeen a
-   * WeakMap which is capable of using all varieties of host objects as
-   * keys and one which is capable of safely using proxies as keys. See
-   * comments below about HostWeakMap and DoubleWeakMap for details.
-   *
-   * This function (which is a global, not exposed to guests) marks a
-   * WeakMap as permitted to do what is necessary to index all host
-   * objects, at the cost of making it unsafe for proxies.
-   *
-   * Do not apply this function to anything which is not a genuine
-   * fresh WeakMap.
-   */
-  function weakMapPermitHostObjects(map) {
-    // identity of function used as a secret -- good enough and cheap
-    if (map.permitHostObjects___) {
-      map.permitHostObjects___(weakMapPermitHostObjects);
-    }
-  }
-  if (typeof ses !== 'undefined') {
-    ses.weakMapPermitHostObjects = weakMapPermitHostObjects;
-  }
-
-  // IE 11 has no Proxy but has a broken WeakMap such that we need to patch
-  // it using DoubleWeakMap; this flag tells DoubleWeakMap so.
-  var doubleWeakMapCheckSilentFailure = false;
-
-  // Check if there is already a good-enough WeakMap implementation, and if so
-  // exit without replacing it.
-  if (typeof WeakMap === 'function') {
-    var HostWeakMap = WeakMap;
-    // There is a WeakMap -- is it good enough?
-    if (typeof navigator !== 'undefined' &&
-        /Firefox/.test(navigator.userAgent)) ; else {
-      // IE 11 bug: WeakMaps silently fail to store frozen objects.
-      var testMap = new HostWeakMap();
-      var testObject = Object.freeze({});
-      testMap.set(testObject, 1);
-      if (testMap.get(testObject) !== 1) {
-        doubleWeakMapCheckSilentFailure = true;
-        // Fall through to installing our WeakMap.
-      } else {
-        module.exports = WeakMap;
-        return;
-      }
-    }
-  }
-  var gopn = Object.getOwnPropertyNames;
-  var defProp = Object.defineProperty;
-  var isExtensible = Object.isExtensible;
-
-  /**
-   * Security depends on HIDDEN_NAME being both <i>unguessable</i> and
-   * <i>undiscoverable</i> by untrusted code.
-   *
-   * <p>Given the known weaknesses of Math.random() on existing
-   * browsers, it does not generate unguessability we can be confident
-   * of.
-   *
-   * <p>It is the monkey patching logic in this file that is intended
-   * to ensure undiscoverability. The basic idea is that there are
-   * three fundamental means of discovering properties of an object:
-   * The for/in loop, Object.keys(), and Object.getOwnPropertyNames(),
-   * as well as some proposed ES6 extensions that appear on our
-   * whitelist. The first two only discover enumerable properties, and
-   * we only use HIDDEN_NAME to name a non-enumerable property, so the
-   * only remaining threat should be getOwnPropertyNames and some
-   * proposed ES6 extensions that appear on our whitelist. We monkey
-   * patch them to remove HIDDEN_NAME from the list of properties they
-   * returns.
-   *
-   * <p>TODO(erights): On a platform with built-in Proxies, proxies
-   * could be used to trap and thereby discover the HIDDEN_NAME, so we
-   * need to monkey patch Proxy.create, Proxy.createFunction, etc, in
-   * order to wrap the provided handler with the real handler which
-   * filters out all traps using HIDDEN_NAME.
-   *
-   * <p>TODO(erights): Revisit Mike Stay's suggestion that we use an
-   * encapsulated function at a not-necessarily-secret name, which
-   * uses the Stiegler shared-state rights amplification pattern to
-   * reveal the associated value only to the WeakMap in which this key
-   * is associated with that value. Since only the key retains the
-   * function, the function can also remember the key without causing
-   * leakage of the key, so this doesn't violate our general gc
-   * goals. In addition, because the name need not be a guarded
-   * secret, we could efficiently handle cross-frame frozen keys.
-   */
-  var HIDDEN_NAME_PREFIX = 'weakmap:';
-  var HIDDEN_NAME = HIDDEN_NAME_PREFIX + 'ident:' + Math.random() + '___';
-
-  if (typeof crypto !== 'undefined' &&
-      typeof crypto.getRandomValues === 'function' &&
-      typeof ArrayBuffer === 'function' &&
-      typeof Uint8Array === 'function') {
-    var ab = new ArrayBuffer(25);
-    var u8s = new Uint8Array(ab);
-    crypto.getRandomValues(u8s);
-    HIDDEN_NAME = HIDDEN_NAME_PREFIX + 'rand:' +
-      Array.prototype.map.call(u8s, function(u8) {
-        return (u8 % 36).toString(36);
-      }).join('') + '___';
-  }
+    while (at !== end && at !== head) {
+        sliced.push(at.value);
+        at = at.next;
+    }
 
-  function isNotHiddenName(name) {
-    return !(
-        name.substr(0, HIDDEN_NAME_PREFIX.length) == HIDDEN_NAME_PREFIX &&
-        name.substr(name.length - 3) === '___');
-  }
+    return sliced;
+};
 
-  /**
-   * Monkey patch getOwnPropertyNames to avoid revealing the
-   * HIDDEN_NAME.
-   *
-   * <p>The ES5.1 spec requires each name to appear only once, but as
-   * of this writing, this requirement is controversial for ES6, so we
-   * made this code robust against this case. If the resulting extra
-   * search turns out to be expensive, we can probably relax this once
-   * ES6 is adequately supported on all major browsers, iff no browser
-   * versions we support at that time have relaxed this constraint
-   * without providing built-in ES6 WeakMaps.
-   */
-  defProp(Object, 'getOwnPropertyNames', {
-    value: function fakeGetOwnPropertyNames(obj) {
-      return gopn(obj).filter(isNotHiddenName);
+List.prototype.splice = function (at, length /*...plus*/) {
+    return this.swap(at, length, Array.prototype.slice.call(arguments, 2));
+};
+
+List.prototype.swap = function (start, length, plus, _before, _after) {
+    var initial = start;
+    // start will be head if start is null or -1 (meaning from the end), but
+    // will be head.next if start is 0 (meaning from the beginning)
+    start = this.scan(start, this.head);
+    if (length == null) {
+        length = Infinity;
     }
-  });
+    plus = Array.from(plus);
 
-  /**
-   * getPropertyNames is not in ES5 but it is proposed for ES6 and
-   * does appear in our whitelist, so we need to clean it too.
-   */
-  if ('getPropertyNames' in Object) {
-    var originalGetPropertyNames = Object.getPropertyNames;
-    defProp(Object, 'getPropertyNames', {
-      value: function fakeGetPropertyNames(obj) {
-        return originalGetPropertyNames(obj).filter(isNotHiddenName);
-      }
-    });
-  }
+    // collect the minus array
+    var minus = [];
+    var at = start;
+    while (length-- && length >= 0 && at !== this.head) {
+        minus.push(at.value);
+        at = at.next;
+    }
 
-  /**
-   * <p>To treat objects as identity-keys with reasonable efficiency
-   * on ES5 by itself (i.e., without any object-keyed collections), we
-   * need to add a hidden property to such key objects when we
-   * can. This raises several issues:
-   * <ul>
-   * <li>Arranging to add this property to objects before we lose the
-   *     chance, and
-   * <li>Hiding the existence of this new property from most
-   *     JavaScript code.
-   * <li>Preventing <i>certification theft</i>, where one object is
-   *     created falsely claiming to be the key of an association
-   *     actually keyed by another object.
-   * <li>Preventing <i>value theft</i>, where untrusted code with
-   *     access to a key object but not a weak map nevertheless
-   *     obtains access to the value associated with that key in that
-   *     weak map.
-   * </ul>
-   * We do so by
-   * <ul>
-   * <li>Making the name of the hidden property unguessable, so "[]"
-   *     indexing, which we cannot intercept, cannot be used to access
-   *     a property without knowing the name.
-   * <li>Making the hidden property non-enumerable, so we need not
-   *     worry about for-in loops or {@code Object.keys},
-   * <li>monkey patching those reflective methods that would
-   *     prevent extensions, to add this hidden property first,
-   * <li>monkey patching those methods that would reveal this
-   *     hidden property.
-   * </ul>
-   * Unfortunately, because of same-origin iframes, we cannot reliably
-   * add this hidden property before an object becomes
-   * non-extensible. Instead, if we encounter a non-extensible object
-   * without a hidden record that we can detect (whether or not it has
-   * a hidden record stored under a name secret to us), then we just
-   * use the key object itself to represent its identity in a brute
-   * force leaky map stored in the weak map, losing all the advantages
-   * of weakness for these.
-   */
-  function getHiddenRecord(key) {
-    if (key !== Object(key)) {
-      throw new TypeError('Not an object: ' + key);
+    // before range change
+    var index;
+    index = _before ? _before.call(this, start, plus, minus) : void 0;
+
+    // delete minus
+    var at = start;
+    for (var i = 0, at = start; i < minus.length; i++, at = at.next) {
+        at["delete"]();
     }
-    var hiddenRecord = key[HIDDEN_NAME];
-    if (hiddenRecord && hiddenRecord.key === key) { return hiddenRecord; }
-    if (!isExtensible(key)) {
-      // Weak map must brute force, as explained in doc-comment above.
-      return void 0;
+    // add plus
+    if (initial == null && at === this.head) {
+        at = this.head.next;
+    }
+    for (var i = 0; i < plus.length; i++) {
+        var node = new this.Node(plus[i]);
+        at.addBefore(node);
     }
+    // adjust length
+    this.length += plus.length - minus.length;
 
-    // The hiddenRecord and the key point directly at each other, via
-    // the "key" and HIDDEN_NAME properties respectively. The key
-    // field is for quickly verifying that this hidden record is an
-    // own property, not a hidden record from up the prototype chain.
-    //
-    // NOTE: Because this WeakMap emulation is meant only for systems like
-    // SES where Object.prototype is frozen without any numeric
-    // properties, it is ok to use an object literal for the hiddenRecord.
-    // This has two advantages:
-    // * It is much faster in a performance critical place
-    // * It avoids relying on Object.create(null), which had been
-    //   problematic on Chrome 28.0.1480.0. See
-    //   https://code.google.com/p/google-caja/issues/detail?id=1687
-    hiddenRecord = { key: key };
+    _after ? _after.call(this, start, plus, minus) : void 0;
 
-    // When using this WeakMap emulation on platforms where
-    // Object.prototype might not be frozen and Object.create(null) is
-    // reliable, use the following two commented out lines instead.
-    // hiddenRecord = Object.create(null);
-    // hiddenRecord.key = key;
+    return minus;
+};
 
-    // Please contact us if you need this to work on platforms where
-    // Object.prototype might not be frozen and
-    // Object.create(null) might not be reliable.
+List.prototype.reverse = function () {
+    var at = this.head;
+    do {
+        var temp = at.next;
+        at.next = at.prev;
+        at.prev = temp;
+        at = at.next;
+    } while (at !== this.head);
+    return this;
+};
 
-    try {
-      defProp(key, HIDDEN_NAME, {
-        value: hiddenRecord,
-        writable: false,
-        enumerable: false,
-        configurable: false
-      });
-      return hiddenRecord;
-    } catch (error) {
-      // Under some circumstances, isExtensible seems to misreport whether
-      // the HIDDEN_NAME can be defined.
-      // The circumstances have not been isolated, but at least affect
-      // Node.js v0.10.26 on TravisCI / Linux, but not the same version of
-      // Node.js on OS X.
-      return void 0;
+List.prototype.sort = function () {
+    this.swap(0, this.length, this.sorted.apply(this, arguments));
+};
+
+// TODO account for missing basis argument
+List.prototype.reduce = function (callback, basis /*, thisp*/) {
+    var thisp = arguments[2];
+    var head = this.head;
+    var at = head.next;
+    while (at !== head) {
+        basis = callback.call(thisp, basis, at.value, at, this);
+        at = at.next;
     }
-  }
+    return basis;
+};
 
-  /**
-   * Monkey patch operations that would make their argument
-   * non-extensible.
-   *
-   * <p>The monkey patched versions throw a TypeError if their
-   * argument is not an object, so it should only be done to functions
-   * that should throw a TypeError anyway if their argument is not an
-   * object.
-   */
-  (function(){
-    var oldFreeze = Object.freeze;
-    defProp(Object, 'freeze', {
-      value: function identifyingFreeze(obj) {
-        getHiddenRecord(obj);
-        return oldFreeze(obj);
-      }
-    });
-    var oldSeal = Object.seal;
-    defProp(Object, 'seal', {
-      value: function identifyingSeal(obj) {
-        getHiddenRecord(obj);
-        return oldSeal(obj);
-      }
-    });
-    var oldPreventExtensions = Object.preventExtensions;
-    defProp(Object, 'preventExtensions', {
-      value: function identifyingPreventExtensions(obj) {
-        getHiddenRecord(obj);
-        return oldPreventExtensions(obj);
-      }
-    });
-  })();
+List.prototype.reduceRight = function (callback, basis /*, thisp*/) {
+    var thisp = arguments[2];
+    var head = this.head;
+    var at = head.prev;
+    while (at !== head) {
+        basis = callback.call(thisp, basis, at.value, at, this);
+        at = at.prev;
+    }
+    return basis;
+};
 
-  function constFunc(func) {
-    func.prototype = null;
-    return Object.freeze(func);
-  }
+List.prototype.updateIndexes = function (node, index) {
+    while (node !== this.head) {
+        node.index = index++;
+        node = node.next;
+    }
+};
 
-  var calledAsFunctionWarningDone = false;
-  function calledAsFunctionWarning() {
-    // Future ES6 WeakMap is currently (2013-09-10) expected to reject WeakMap()
-    // but we used to permit it and do it ourselves, so warn only.
-    if (!calledAsFunctionWarningDone && typeof console !== 'undefined') {
-      calledAsFunctionWarningDone = true;
-      console.warn('WeakMap should be invoked as new WeakMap(), not ' +
-          'WeakMap(). This will be an error in the future.');
+
+List.prototype.iterate = function () {
+    return new ListIterator(this.head);
+};
+
+function ListIterator(head) {
+    this.head = head;
+    this.at = head.next;
+}
+ListIterator.prototype.__iterationObject = null;
+Object.defineProperty(ListIterator.prototype,"_iterationObject", {
+    get: function() {
+        return this.__iterationObject || (this.__iterationObject = { done: false, value:null});
     }
-  }
+});
 
-  var nextId = 0;
 
-  var OurWeakMap = function() {
-    if (!(this instanceof OurWeakMap)) {  // approximate test for new ...()
-      calledAsFunctionWarning();
+ListIterator.prototype.next = function () {
+    if (this.at === this.head) {
+        this._iterationObject.done = true;
+        this._iterationObject.value = void 0;
+    } else {
+        var value = this.at.value;
+        this.at = this.at.next;
+        this._iterationObject.value = value;
     }
+    return this._iterationObject;
+};
 
-    // We are currently (12/25/2012) never encountering any prematurely
-    // non-extensible keys.
-    var keys = []; // brute force for prematurely non-extensible keys.
-    var values = []; // brute force for corresponding values.
-    var id = nextId++;
+List.prototype.Node = Node;
 
-    function get___(key, opt_default) {
-      var index;
-      var hiddenRecord = getHiddenRecord(key);
-      if (hiddenRecord) {
-        return id in hiddenRecord ? hiddenRecord[id] : opt_default;
-      } else {
-        index = keys.indexOf(key);
-        return index >= 0 ? values[index] : opt_default;
-      }
-    }
+function Node(value) {
+    this.value = value;
+    this.prev = null;
+    this.next = null;
+}
+Node.prototype["delete"] = function () {
+    this.prev.next = this.next;
+    this.next.prev = this.prev;
+};
 
-    function has___(key) {
-      var hiddenRecord = getHiddenRecord(key);
-      if (hiddenRecord) {
-        return id in hiddenRecord;
-      } else {
-        return keys.indexOf(key) >= 0;
-      }
-    }
+Node.prototype.addBefore = function (node) {
+    var prev = this.prev;
+    this.prev = node;
+    node.prev = prev;
+    prev.next = node;
+    node.next = this;
+};
 
-    function set___(key, value) {
-      var index;
-      var hiddenRecord = getHiddenRecord(key);
-      if (hiddenRecord) {
-        hiddenRecord[id] = value;
-      } else {
-        index = keys.indexOf(key);
-        if (index >= 0) {
-          values[index] = value;
-        } else {
-          // Since some browsers preemptively terminate slow turns but
-          // then continue computing with presumably corrupted heap
-          // state, we here defensively get keys.length first and then
-          // use it to update both the values and keys arrays, keeping
-          // them in sync.
-          index = keys.length;
-          values[index] = value;
-          // If we crash here, values will be one longer than keys.
-          keys[index] = key;
-        }
-      }
-      return this;
-    }
+Node.prototype.addAfter = function (node) {
+    var next = this.next;
+    this.next = node;
+    node.next = next;
+    next.prev = node;
+    node.prev = this;
+};
 
-    function delete___(key) {
-      var hiddenRecord = getHiddenRecord(key);
-      var index, lastIndex;
-      if (hiddenRecord) {
-        return id in hiddenRecord && delete hiddenRecord[id];
-      } else {
-        index = keys.indexOf(key);
-        if (index < 0) {
-          return false;
-        }
-        // Since some browsers preemptively terminate slow turns but
-        // then continue computing with potentially corrupted heap
-        // state, we here defensively get keys.length first and then use
-        // it to update both the keys and the values array, keeping
-        // them in sync. We update the two with an order of assignments,
-        // such that any prefix of these assignments will preserve the
-        // key/value correspondence, either before or after the delete.
-        // Note that this needs to work correctly when index === lastIndex.
-        lastIndex = keys.length - 1;
-        keys[index] = void 0;
-        // If we crash here, there's a void 0 in the keys array, but
-        // no operation will cause a "keys.indexOf(void 0)", since
-        // getHiddenRecord(void 0) will always throw an error first.
-        values[index] = values[lastIndex];
-        // If we crash here, values[index] cannot be found here,
-        // because keys[index] is void 0.
-        keys[index] = keys[lastIndex];
-        // If index === lastIndex and we crash here, then keys[index]
-        // is still void 0, since the aliasing killed the previous key.
-        keys.length = lastIndex;
-        // If we crash here, keys will be one shorter than values.
-        values.length = lastIndex;
-        return true;
-      }
-    }
+var iterator = Iterator;
 
-    return Object.create(OurWeakMap.prototype, {
-      get___:    { value: constFunc(get___) },
-      has___:    { value: constFunc(has___) },
-      set___:    { value: constFunc(set___) },
-      delete___: { value: constFunc(delete___) }
-    });
-  };
 
-  OurWeakMap.prototype = Object.create(Object.prototype, {
-    get: {
-      /**
-       * Return the value most recently associated with key, or
-       * opt_default if none.
-       */
-      value: function get(key, opt_default) {
-        return this.get___(key, opt_default);
-      },
-      writable: true,
-      configurable: true
-    },
 
-    has: {
-      /**
-       * Is there a value associated with key in this WeakMap?
-       */
-      value: function has(key) {
-        return this.has___(key);
-      },
-      writable: true,
-      configurable: true
-    },
 
-    set: {
-      /**
-       * Associate value with key in this WeakMap, overwriting any
-       * previous association if present.
-       */
-      value: function set(key, value) {
-        return this.set___(key, value);
-      },
-      writable: true,
-      configurable: true
-    },
+// upgrades an iterable to a Iterator
+function Iterator(iterable, standardMode) {
 
-    'delete': {
-      /**
-       * Remove any association for key in this WeakMap, returning
-       * whether there was one.
-       *
-       * <p>Note that the boolean return here does not work like the
-       * {@code delete} operator. The {@code delete} operator returns
-       * whether the deletion succeeds at bringing about a state in
-       * which the deleted property is absent. The {@code delete}
-       * operator therefore returns true if the property was already
-       * absent, whereas this {@code delete} method returns false if
-       * the association was already absent.
-       */
-      value: function remove(key) {
-        return this.delete___(key);
-      },
-      writable: true,
-      configurable: true
+    /*
+        standardMode should be passed as true by a collection that uses Iterator
+        to provide a polyfill of standard iterations methods like entries() and values(),
+        as Collection's iterator behaves differently than standards ones when it comes to sparse arrays.
+        without passing standardMode, new Iterator instances will behave as intended independently of standards.
+    */
+    var values = standardMode && iterable && iterable.values && iterable.values();
+    if(values && typeof values.next === "function" ) {
+        return values;
     }
-  });
 
-  if (typeof HostWeakMap === 'function') {
-    (function() {
-      // If we got here, then the platform has a WeakMap but we are concerned
-      // that it may refuse to store some key types. Therefore, make a map
-      // implementation which makes use of both as possible.
+    if (!(this instanceof Iterator)) {
+        return new Iterator(iterable);
+    }
 
-      // In this mode we are always using double maps, so we are not proxy-safe.
-      // This combination does not occur in any known browser, but we had best
-      // be safe.
-      if (doubleWeakMapCheckSilentFailure && typeof Proxy !== 'undefined') {
-        Proxy = undefined;
-      }
+    if (Array.isArray(iterable) || typeof iterable === "string")
+        return Iterator.iterate(iterable);
+
+    iterable = shimObject(iterable);
+
+    if (iterable instanceof Iterator) {
+        return iterable;
+    } else if (iterable.next) {
+        this.next = function () {
+            return iterable.next();
+        };
+    } else if (iterable.iterate) {
+        var iterator = iterable.iterate();
+        this.next = function () {
+            return iterator.next();
+        };
+    } else if (shimObject.prototype.toString.call(iterable) === "[object Function]") {
+        this.next = iterable;
+    } else {
+        throw new TypeError("Can't iterate " + iterable);
+    }
+
+}
+
+Iterator.prototype.forEach = genericCollection.prototype.forEach;
+Iterator.prototype.map = genericCollection.prototype.map;
+Iterator.prototype.filter = genericCollection.prototype.filter;
+Iterator.prototype.every = genericCollection.prototype.every;
+Iterator.prototype.some = genericCollection.prototype.some;
+Iterator.prototype.any = genericCollection.prototype.any;
+Iterator.prototype.all = genericCollection.prototype.all;
+Iterator.prototype.min = genericCollection.prototype.min;
+Iterator.prototype.max = genericCollection.prototype.max;
+Iterator.prototype.sum = genericCollection.prototype.sum;
+Iterator.prototype.average = genericCollection.prototype.average;
+Iterator.prototype.flatten = genericCollection.prototype.flatten;
+Iterator.prototype.zip = genericCollection.prototype.zip;
+Iterator.prototype.enumerate = genericCollection.prototype.enumerate;
+Iterator.prototype.sorted = genericCollection.prototype.sorted;
+Iterator.prototype.group = genericCollection.prototype.group;
+Iterator.prototype.reversed = genericCollection.prototype.reversed;
+Iterator.prototype.toArray = genericCollection.prototype.toArray;
+Iterator.prototype.toObject = genericCollection.prototype.toObject;
+Iterator.prototype.iterator = genericCollection.prototype.iterator;
+
+Iterator.prototype.__iterationObject = null;
+shimObject.defineProperty(Iterator.prototype,"_iterationObject", {
+    get: function() {
+        return this.__iterationObject || (this.__iterationObject = { done: false, value:void 0});
+    }
+});
 
-      function DoubleWeakMap() {
-        if (!(this instanceof OurWeakMap)) {  // approximate test for new ...()
-          calledAsFunctionWarning();
-        }
 
-        // Preferable, truly weak map.
-        var hmap = new HostWeakMap();
+// this is a bit of a cheat so flatten and such work with the generic
+// reducible
+Iterator.prototype.constructClone = function (values) {
+    var clone = [];
+    clone.addEach(values);
+    return clone;
+};
 
-        // Our hidden-property-based pseudo-weak-map. Lazily initialized in the
-        // 'set' implementation; thus we can avoid performing extra lookups if
-        // we know all entries actually stored are entered in 'hmap'.
-        var omap = undefined;
+Iterator.prototype.mapIterator = function (callback /*, thisp*/) {
+    var self = Iterator(this),
+        thisp = arguments[1],
+        i = 0;
 
-        // Hidden-property maps are not compatible with proxies because proxies
-        // can observe the hidden name and either accidentally expose it or fail
-        // to allow the hidden property to be set. Therefore, we do not allow
-        // arbitrary WeakMaps to switch to using hidden properties, but only
-        // those which need the ability, and unprivileged code is not allowed
-        // to set the flag.
-        //
-        // (Except in doubleWeakMapCheckSilentFailure mode in which case we
-        // disable proxies.)
-        var enableSwitching = false;
+    if (shimObject.prototype.toString.call(callback) != "[object Function]")
+        throw new TypeError();
 
-        function dget(key, opt_default) {
-          if (omap) {
-            return hmap.has(key) ? hmap.get(key)
-                : omap.get___(key, opt_default);
-          } else {
-            return hmap.get(key, opt_default);
-          }
+    return new self.constructor(function () {
+        if(self._iterationObject.done !== true) {
+            var callbackValue = callback.call(thisp, self.next().value, i++, self);
+            self._iterationObject.value = callbackValue;
         }
+        return self._iterationObject;
+    });
+};
 
-        function dhas(key) {
-          return hmap.has(key) || (omap ? omap.has___(key) : false);
-        }
+Iterator.prototype.filterIterator = function (callback /*, thisp*/) {
+    var self = Iterator(this),
+        thisp = arguments[1],
+        i = 0;
 
-        var dset;
-        if (doubleWeakMapCheckSilentFailure) {
-          dset = function(key, value) {
-            hmap.set(key, value);
-            if (!hmap.has(key)) {
-              if (!omap) { omap = new OurWeakMap(); }
-              omap.set(key, value);
+    if (shimObject.prototype.toString.call(callback) != "[object Function]")
+        throw new TypeError();
+
+    return new self.constructor(function () {
+        var nextEntry;
+        while (true) {
+            nextEntry = self.next();
+            if(nextEntry.done !== true) {
+                if (callback.call(thisp, nextEntry.value, i++, self))
+                    return nextEntry;
             }
-            return this;
-          };
-        } else {
-          dset = function(key, value) {
-            if (enableSwitching) {
-              try {
-                hmap.set(key, value);
-              } catch (e) {
-                if (!omap) { omap = new OurWeakMap(); }
-                omap.set___(key, value);
-              }
-            } else {
-              hmap.set(key, value);
+            else {
+                //done true and value undefined at this point
+                return nextEntry;
             }
-            return this;
-          };
         }
+    });
+};
 
-        function ddelete(key) {
-          var result = !!hmap['delete'](key);
-          if (omap) { return omap.delete___(key) || result; }
-          return result;
+Iterator.prototype.reduce = function (callback /*, initial, thisp*/) {
+    var self = Iterator(this),
+        result = arguments[1],
+        thisp = arguments[2],
+        i = 0,
+        nextEntry;
+
+    if (shimObject.prototype.toString.call(callback) != "[object Function]")
+        throw new TypeError();
+
+    // first iteration unrolled
+    nextEntry = self.next();
+    if(nextEntry.done === true) {
+        if (arguments.length > 1) {
+            return arguments[1]; // initial
+        } else {
+            throw TypeError("cannot reduce a value from an empty iterator with no initial value");
+        }
+    }
+    if (arguments.length > 1) {
+        result = callback.call(thisp, result, nextEntry.value, i, self);
+    } else {
+        result = nextEntry.value;
+    }
+    i++;
+    // remaining entries
+    while (true) {
+        nextEntry = self.next();
+        if(nextEntry.done === true) {
+            return result;
         }
+        result = callback.call(thisp, result, nextEntry.value, i, self);
+        i++;
+    }
 
-        return Object.create(OurWeakMap.prototype, {
-          get___:    { value: constFunc(dget) },
-          has___:    { value: constFunc(dhas) },
-          set___:    { value: constFunc(dset) },
-          delete___: { value: constFunc(ddelete) },
-          permitHostObjects___: { value: constFunc(function(token) {
-            if (token === weakMapPermitHostObjects) {
-              enableSwitching = true;
-            } else {
-              throw new Error('bogus call to permitHostObjects___');
-            }
-          })}
-        });
-      }
-      DoubleWeakMap.prototype = OurWeakMap.prototype;
-      module.exports = DoubleWeakMap;
+};
 
-      // define .constructor to hide OurWeakMap ctor
-      Object.defineProperty(WeakMap.prototype, 'constructor', {
-        value: WeakMap,
-        enumerable: false,  // as default .constructor is
-        configurable: true,
-        writable: true
-      });
-    })();
-  } else {
-    // There is no host WeakMap, so we must use the emulation.
+Iterator.prototype.concat = function () {
+    return Iterator.concat(
+        Array.prototype.concat.apply(this, arguments)
+    );
+};
 
-    // Emulated WeakMaps are incompatible with native proxies (because proxies
-    // can observe the hidden name), so we must disable Proxy usage (in
-    // ArrayLike and Domado, currently).
-    if (typeof Proxy !== 'undefined') {
-      Proxy = undefined;
+Iterator.prototype.dropWhile = function (callback /*, thisp */) {
+    var self = Iterator(this),
+        thisp = arguments[1],
+        stopped = false,
+        stopValue,
+        nextEntry,
+        i = 0;
+
+    if (shimObject.prototype.toString.call(callback) != "[object Function]")
+        throw new TypeError();
+
+    while (true) {
+        nextEntry = self.next();
+        if(nextEntry.done === true) {
+            break;
+        }
+        if (!callback.call(thisp, nextEntry.value, i, self)) {
+            stopped = true;
+            stopValue = nextEntry.value;
+            break;
+        }
+        i++;
     }
 
-    module.exports = OurWeakMap;
-  }
-})();
-});
+    if (stopped) {
+        return self.constructor([stopValue]).concat(self);
+    } else {
+        return self.constructor([]);
+    }
+};
 
-var weakMap$1 = (typeof WeakMap !== 'undefined') ? WeakMap : weakMap;
+Iterator.prototype.takeWhile = function (callback /*, thisp*/) {
+    var self = Iterator(this),
+        thisp = arguments[1],
+        i = 0;
 
-var shimObject = Object;
+    if (shimObject.prototype.toString.call(callback) != "[object Function]")
+        throw new TypeError();
 
-/*
-    Based in part on extras from Motorola Mobility’s Montage
-    Copyright (c) 2012, Motorola Mobility LLC. All Rights Reserved.
-    3-Clause BSD License
-    https://github.com/motorola-mobility/montage/blob/master/LICENSE.md
-*/
+    return new self.constructor(function () {
+        if(self._iterationObject.done !== true) {
+            var value = self.next().value;
+            if(callback.call(thisp, value, i++, self)) {
+                self._iterationObject.value = value;
+            }
+            else {
+                self._iterationObject.done = true;
+                self._iterationObject.value = void 0;
+            }
+        }
+        return self._iterationObject;
+    });
+
+};
+
+Iterator.prototype.zipIterator = function () {
+    return Iterator.unzip(
+        Array.prototype.concat.apply(this, arguments)
+    );
+};
+
+Iterator.prototype.enumerateIterator = function (start) {
+    return Iterator.count(start).zipIterator(this);
+};
+
+// creates an iterator for Array and String
+Iterator.iterate = function (iterable) {
+    var start;
+    start = 0;
+    return new Iterator(function () {
+        // advance to next owned entry
+        if (typeof iterable === "object") {
+            while (!(start in iterable)) {
+                // deliberately late bound
+                if (start >= iterable.length) {
+                    this._iterationObject.done = true;
+                    this._iterationObject.value = void 0;
+                    break;
+                }
+                else start += 1;
+            }
+        } else if (start >= iterable.length) {
+            this._iterationObject.done = true;
+            this._iterationObject.value = void 0;
+        }
 
-/**
-    Defines extensions to intrinsic <code>Object</code>.
-    @see [Object class]{@link external:Object}
-*/
+        if(!this._iterationObject.done) {
+            this._iterationObject.value = iterable[start];
+            start += 1;
+        }
+        return this._iterationObject;
+    });
+};
 
-/**
-    A utility object to avoid unnecessary allocations of an empty object
-    <code>{}</code>.  This object is frozen so it is safe to share.
+Iterator.cycle = function (cycle, times) {
+    var next;
+    if (arguments.length < 2)
+        times = Infinity;
+    //cycle = Iterator(cycle).toArray();
+    return new Iterator(function () {
+        var iteration, nextEntry;
 
-    @object external:Object.empty
-*/
-Object.empty = Object.freeze(Object.create(null));
+        if(next) {
+            nextEntry = next();
+        }
 
-/**
-    Returns whether the given value is an object, as opposed to a value.
-    Unboxed numbers, strings, true, false, undefined, and null are not
-    objects.  Arrays are objects.
+        if(!next || nextEntry.done === true) {
+            if (times > 0) {
+                times--;
+                iteration = Iterator.iterate(cycle);
+                nextEntry = (next = iteration.next.bind(iteration))();
+            }
+            else {
+                this._iterationObject.done = true;
+                nextEntry = this._iterationObject;            }
+        }
+        return nextEntry;
+    });
+};
 
-    @function external:Object.isObject
-    @param {Any} value
-    @returns {Boolean} whether the given value is an object
-*/
-Object.isObject = function (object) {
-    return Object(object) === object;
+Iterator.concat = function (iterators) {
+    iterators = Iterator(iterators);
+    var next;
+    return new Iterator(function (){
+        var iteration, nextEntry;
+        if(next) nextEntry = next();
+        if(!nextEntry || nextEntry.done === true) {
+            nextEntry = iterators.next();
+            if(nextEntry.done === false) {
+                iteration = Iterator(nextEntry.value);
+                next = iteration.next.bind(iteration);
+                return next();
+            }
+            else {
+                return nextEntry;
+            }
+        }
+        else return nextEntry;
+    });
 };
 
-/**
-    Returns the value of an any value, particularly objects that
-    implement <code>valueOf</code>.
+Iterator.unzip = function (iterators) {
+    iterators = Iterator(iterators).map(Iterator);
+    if (iterators.length === 0)
+        return new Iterator([]);
+    return new Iterator(function () {
+        var stopped, nextEntry;
+        var result = iterators.map(function (iterator) {
+            nextEntry = iterator.next();
+            if (nextEntry.done === true ) {
+                stopped = true;
+            }
+            return nextEntry.value;
+        });
+        if (stopped) {
+            this._iterationObject.done = true;
+            this._iterationObject.value = void 0;
+        }
+        else {
+            this._iterationObject.value = result;
+        }
+        return this._iterationObject;
+    });
+};
 
-    <p>Note that, unlike the precedent of methods like
-    <code>Object.equals</code> and <code>Object.compare</code> would suggest,
-    this method is named <code>Object.getValueOf</code> instead of
-    <code>valueOf</code>.  This is a delicate issue, but the basis of this
-    decision is that the JavaScript runtime would be far more likely to
-    accidentally call this method with no arguments, assuming that it would
-    return the value of <code>Object</code> itself in various situations,
-    whereas <code>Object.equals(Object, null)</code> protects against this case
-    by noting that <code>Object</code> owns the <code>equals</code> property
-    and therefore does not delegate to it.
+Iterator.zip = function () {
+    return Iterator.unzip(
+        Array.prototype.slice.call(arguments)
+    );
+};
 
-    @function external:Object.getValueOf
-    @param {Any} value a value or object wrapping a value
-    @returns {Any} the primitive value of that object, if one exists, or passes
-    the value through
-*/
-Object.getValueOf = function (value) {
-    if (value && typeof value.valueOf === "function") {
-        value = value.valueOf();
-    }
-    return value;
+Iterator.chain = function () {
+    return Iterator.concat(
+        Array.prototype.slice.call(arguments)
+    );
 };
 
-var hashMap = new weakMap$1();
-Object.hash = function (object) {
-    if (object && typeof object.hash === "function") {
-        return "" + object.hash();
-    } else if (Object(object) === object) {
-        if (!hashMap.has(object)) {
-            hashMap.set(object, Math.random().toString(36).slice(2));
-        }
-        return hashMap.get(object);
-    } else {
-        return "" + object;
+Iterator.range = function (start, stop, step) {
+    if (arguments.length < 3) {
+        step = 1;
+    }
+    if (arguments.length < 2) {
+        stop = start;
+        start = 0;
     }
+    start = start || 0;
+    step = step || 1;
+    return new Iterator(function () {
+        if (start >= stop) {
+            this._iterationObject.done = true;
+            this._iterationObject.value = void 0;
+        }
+        var result = start;
+        start += step;
+        this._iterationObject.value = result;
+
+        return this._iterationObject;
+    });
 };
 
-/**
-    A shorthand for <code>Object.prototype.hasOwnProperty.call(object,
-    key)</code>.  Returns whether the object owns a property for the given key.
-    It does not consult the prototype chain and works for any string (including
-    "hasOwnProperty") except "__proto__".
+Iterator.count = function (start, step) {
+    return Iterator.range(start, Infinity, step);
+};
 
-    @function external:Object.owns
-    @param {Object} object
-    @param {String} key
-    @returns {Boolean} whether the object owns a property wfor the given key.
-*/
-var owns = Object.prototype.hasOwnProperty;
-Object.owns = function (object, key) {
-    return owns.call(object, key);
+Iterator.repeat = function (value, times) {
+    return new Iterator.range(times).mapIterator(function () {
+        return value;
+    });
 };
 
-/**
-    A utility that is like Object.owns but is also useful for finding
-    properties on the prototype chain, provided that they do not refer to
-    methods on the Object prototype.  Works for all strings except "__proto__".
+var genericMap = GenericMap;
+function GenericMap() {
+    throw new Error("Can't construct. GenericMap is a mixin.");
+}
 
-    <p>Alternately, you could use the "in" operator as long as the object
-    descends from "null" instead of the Object.prototype, as with
-    <code>Object.create(null)</code>.  However,
-    <code>Object.create(null)</code> only works in fully compliant EcmaScript 5
-    JavaScript engines and cannot be faithfully shimmed.
+// all of these methods depend on the constructor providing a `store` set
 
-    <p>If the given object is an instance of a type that implements a method
-    named "has", this function defers to the collection, so this method can be
-    used to generically handle objects, arrays, or other collections.  In that
-    case, the domain of the key depends on the instance.
+GenericMap.prototype.isMap = true;
 
-    @param {Object} object
-    @param {String} key
-    @returns {Boolean} whether the object, or any of its prototypes except
-    <code>Object.prototype</code>
-    @function external:Object.has
-*/
-Object.has = function (object, key) {
-    if (typeof object !== "object") {
-        throw new Error("Object.has can't accept non-object: " + typeof object);
+GenericMap.prototype.addEach = function (values) {
+    var i;
+    if (values && shimObject(values) === values) {
+        if (typeof values.forEach === "function") {
+            // copy map-alikes
+            if (values.isMap === true) {
+                values.forEach(function (value, key) {
+                    this.set(key, value);
+                }, this);
+            // iterate key value pairs of other iterables
+            } else {
+                values.forEach(function (pair) {
+                    this.set(pair[0], pair[1]);
+                }, this);
+            }
+        } else if (typeof values.length === "number") {
+            // Array-like objects that do not implement forEach, ergo,
+            // Arguments
+            for (i = 0; i < values.length; i++) {
+                this.add(values[i], i);
+            }
+        } else {
+            // copy other objects as map-alikes
+            shimObject.keys(values).forEach(function (key) {
+                this.set(key, values[key]);
+            }, this);
+        }
+    } else if (values && typeof values.length === "number") {
+        // String
+        for (i = 0; i < values.length; i++) {
+            this.add(values[i], i);
+        }
     }
-    // forward to mapped collections that implement "has"
-    if (object && typeof object.has === "function") {
-        return object.has(key);
-    // otherwise report whether the key is on the prototype chain,
-    // as long as it is not one of the methods on object.prototype
-    } else if (typeof key === "string") {
-        return key in object && object[key] !== Object.prototype[key];
+    return this;
+};
+
+GenericMap.prototype.get = function (key, defaultValue) {
+    var item = this.store.get(new this.Item(key));
+    if (item) {
+        return item.value;
+    } else if (arguments.length > 1) {
+        console.log("Use of a second argument as default value is deprecated to match standards");
+        return defaultValue;
     } else {
-        throw new Error("Key must be a string for Object.has on plain objects");
+        return this.getDefault(key);
     }
 };
 
-/**
-    Gets the value for a corresponding key from an object.
+GenericMap.prototype.set = function (key, value) {
+    var item = new this.Item(key, value);
+    var found = this.store.get(item);
+    if (found) { // update
+        if (this.dispatchesMapChanges) {
+            this.dispatchBeforeMapChange(key, found.value);
+        }
+        found.value = value;
+        if (this.dispatchesMapChanges) {
+            this.dispatchMapChange(key, value);
+        }
+    } else { // create
+        if (this.dispatchesMapChanges) {
+            this.dispatchBeforeMapChange(key, undefined);
+        }
+        if (this.store.add(item)) {
+            this.length++;
+        }
+        if (this.dispatchesMapChanges) {
+            this.dispatchMapChange(key, value);
+        }
+    }
+    return this;
+};
 
-    <p>Uses Object.has to determine whether there is a corresponding value for
-    the given key.  As such, <code>Object.get</code> is capable of retriving
-    values from the prototype chain as long as they are not from the
-    <code>Object.prototype</code>.
+GenericMap.prototype.add = function (value, key) {
+    return this.set(key, value);
+};
 
-    <p>If there is no corresponding value, returns the given default, which may
-    be <code>undefined</code>.
+GenericMap.prototype.has = function (key) {
+    return this.store.has(new this.Item(key));
+};
 
-    <p>If the given object is an instance of a type that implements a method
-    named "get", this function defers to the collection, so this method can be
-    used to generically handle objects, arrays, or other collections.  In that
-    case, the domain of the key depends on the implementation.  For a `Map`,
-    for example, the key might be any object.
+GenericMap.prototype['delete'] = function (key) {
+    var item = new this.Item(key);
+    if (this.store.has(item)) {
+        var from = this.store.get(item).value;
+        if (this.dispatchesMapChanges) {
+            this.dispatchBeforeMapChange(key, from);
+        }
+        this.store["delete"](item);
+        this.length--;
+        if (this.dispatchesMapChanges) {
+            this.dispatchMapChange(key, undefined);
+        }
+        return true;
+    }
+    return false;
+};
 
-    @param {Object} object
-    @param {String} key
-    @param {Any} value a default to return, <code>undefined</code> if omitted
-    @returns {Any} value for key, or default value
-    @function external:Object.get
-*/
-Object.get = function (object, key, value) {
-    if (typeof object !== "object") {
-        throw new Error("Object.get can't accept non-object: " + typeof object);
+GenericMap.prototype.clear = function () {
+    var keys, key;
+    if (this.dispatchesMapChanges) {
+        this.forEach(function (value, key) {
+            this.dispatchBeforeMapChange(key, value);
+        }, this);
+        keys = this.keysArray();
     }
-    // forward to mapped collections that implement "get"
-    if (object && typeof object.get === "function") {
-        return object.get(key, value);
-    } else if (Object.has(object, key)) {
-        return object[key];
-    } else {
-        return value;
+    this.store.clear();
+    this.length = 0;
+    if (this.dispatchesMapChanges) {
+        for(var i=0;(key = keys[i]);i++) {
+            this.dispatchMapChange(key);
+        }
+        // keys.forEach(function (key) {
+        //     this.dispatchMapChange(key);
+        // }, this);
     }
 };
 
-/**
-    Sets the value for a given key on an object.
-
-    <p>If the given object is an instance of a type that implements a method
-    named "set", this function defers to the collection, so this method can be
-    used to generically handle objects, arrays, or other collections.  As such,
-    the key domain varies by the object type.
+GenericMap.prototype.reduce = function (callback, basis, thisp) {
+    return this.store.reduce(function (basis, item) {
+        return callback.call(thisp, basis, item.value, item.key, this);
+    }, basis, this);
+};
 
-    @param {Object} object
-    @param {String} key
-    @param {Any} value
-    @returns <code>undefined</code>
-    @function external:Object.set
-*/
-Object.set = function (object, key, value) {
-    if (object && typeof object.set === "function") {
-        object.set(key, value);
-    } else {
-        object[key] = value;
-    }
+GenericMap.prototype.reduceRight = function (callback, basis, thisp) {
+    return this.store.reduceRight(function (basis, item) {
+        return callback.call(thisp, basis, item.value, item.key, this);
+    }, basis, this);
 };
 
-Object.addEach = function (target, source, overrides) {
-    var overridesExistingProperty = arguments.length === 3 ? overrides : true;
-    if (!source) ; else if (typeof source.forEach === "function" && !source.hasOwnProperty("forEach")) {
-        // copy map-alikes
-        if (source.isMap === true) {
-            source.forEach(function (value, key) {
-                target[key] = value;
-            });
-        // iterate key value pairs of other iterables
-        } else {
-            source.forEach(function (pair) {
-                target[pair[0]] = pair[1];
-            });
-        }
-    } else if (typeof source.length === "number") {
-        // arguments, strings
-        for (var index = 0; index < source.length; index++) {
-            target[index] = source[index];
-        }
-    } else {
-        // copy other objects as map-alikes
-        for(var keys = Object.keys(source), i = 0, key;(key = keys[i]); i++) {
-            if(overridesExistingProperty || !Object.owns(target,key)) {
-                target[key] = source[key];
-            }
-        }
-    }
-    return target;
+GenericMap.prototype.keysArray = function () {
+    return this.map(function (value, key) {
+        return key;
+    });
+};
+GenericMap.prototype.keys = function () {
+    return new iterator(this.keysArray(), true);
 };
 
+GenericMap.prototype.valuesArray = function () {
+    return this.map(Function.identity);
+};
+GenericMap.prototype.values = function () {
+    return new iterator(this.valuesArray(), true);
+};
 
-/*
-var defineEach = function defineEach(target, prototype) {
-    // console.log("Map defineEach: ",Object.keys(prototype));
-    var proto = Map.prototype;
-    for (var name in prototype) {
-        if(!proto.hasOwnProperty(name)) {
-            Object.defineProperty(proto, name, {
-                value: prototype[name],
-                writable: writable,
-                configurable: configurable,
-                enumerable: enumerable
-            });
-        }
-    }
-}
-*/
-Object.defineEach = function (target, source, overrides, configurable, enumerable, writable) {
-    var overridesExistingProperty = arguments.length === 3 ? overrides : true;
-    if (!source) ; else if (typeof source.forEach === "function" && !source.hasOwnProperty("forEach")) {
-        // copy map-alikes
-        if (source.isMap === true) {
-            source.forEach(function (value, key) {
-                Object.defineProperty(target, key, {
-                    value: value,
-                    writable: writable,
-                    configurable: configurable,
-                    enumerable: enumerable
-                });
-            });
-        // iterate key value pairs of other iterables
-        } else {
-            source.forEach(function (pair) {
-                Object.defineProperty(target, pair[0], {
-                    value: pair[1],
-                    writable: writable,
-                    configurable: configurable,
-                    enumerable: enumerable
-                });
+GenericMap.prototype.entriesArray = function () {
+    return this.map(function (value, key) {
+        return [key, value];
+    });
+};
+GenericMap.prototype.entries = function () {
+    return new iterator(this.entriesArray(), true);
+};
 
-            });
-        }
-    } else if (typeof source.length === "number") {
-        // arguments, strings
-        for (var index = 0; index < source.length; index++) {
-            Object.defineProperty(target, index, {
-                value: source[index],
-                writable: writable,
-                configurable: configurable,
-                enumerable: enumerable
-            });
+// XXX deprecated
+GenericMap.prototype.items = function () {
+    return this.entriesArray();
+};
 
-        }
+GenericMap.prototype.equals = function (that, equals) {
+    equals = equals || shimObject.equals;
+    if (this === that) {
+        return true;
+    } else if (that && typeof that.every === "function") {
+        return that.length === this.length && that.every(function (value, key) {
+            return equals(this.get(key), value);
+        }, this);
     } else {
-        // copy other objects as map-alikes
-        for(var keys = Object.keys(source), i = 0, key;(key = keys[i]); i++) {
-            if(overridesExistingProperty || !Object.owns(target,key)) {
-                Object.defineProperty(target, key, {
-                    value: source[key],
-                    writable: writable,
-                    configurable: configurable,
-                    enumerable: enumerable
-                });
-
-            }
-        }
+        var keys = shimObject.keys(that);
+        return keys.length === this.length && shimObject.keys(that).every(function (key) {
+            return equals(this.get(key), that[key]);
+        }, this);
     }
-    return target;
 };
 
-/**
-    Iterates over the owned properties of an object.
+GenericMap.prototype.toJSON = function () {
+    return this.entriesArray();
+};
+
+
+GenericMap.prototype.Item = Item;
 
-    @function external:Object.forEach
-    @param {Object} object an object to iterate.
-    @param {Function} callback a function to call for every key and value
-    pair in the object.  Receives <code>value</code>, <code>key</code>,
-    and <code>object</code> as arguments.
-    @param {Object} thisp the <code>this</code> to pass through to the
-    callback
-*/
-Object.forEach = function (object, callback, thisp) {
+function Item(key, value) {
+    this.key = key;
+    this.value = value;
+}
 
-    var keys = Object.keys(object), i = 0, iKey;
-    for(;(iKey = keys[i]);i++) {
-        callback.call(thisp, object[iKey], iKey, object);
-    }
+Item.prototype.equals = function (that) {
+    return shimObject.equals(this.key, that.key) && shimObject.equals(this.value, that.value);
+};
 
+Item.prototype.compare = function (that) {
+    return shimObject.compare(this.key, that.key);
 };
 
-/**
-    Iterates over the owned properties of a map, constructing a new array of
-    mapped values.
+// Burgled from https://github.com/domenic/dict
 
-    @function external:Object.map
-    @param {Object} object an object to iterate.
-    @param {Function} callback a function to call for every key and value
-    pair in the object.  Receives <code>value</code>, <code>key</code>,
-    and <code>object</code> as arguments.
-    @param {Object} thisp the <code>this</code> to pass through to the
-    callback
-    @returns {Array} the respective values returned by the callback for each
-    item in the object.
-*/
-Object.map = function (object, callback, thisp) {
-    var keys = Object.keys(object), i = 0, result = [], iKey;
-    for(;(iKey = keys[i]);i++) {
-        result.push(callback.call(thisp, object[iKey], iKey, object));
+var _dict = Dict;
+function Dict(values, getDefault) {
+    if (!(this instanceof Dict)) {
+        return new Dict(values, getDefault);
     }
-    return result;
-};
+    getDefault = getDefault || Function.noop;
+    this.getDefault = getDefault;
+    this.store = Object.create(null);
+    this.length = 0;
+    this.addEach(values);
+}
 
-/**
-    Returns the values for owned properties of an object.
+Dict.Dict = Dict; // hack so require("dict").Dict will work in MontageJS.
 
-    @function external:Object.map
-    @param {Object} object
-    @returns {Array} the respective value for each owned property of the
-    object.
-*/
-Object.values = function (object) {
-    return Object.map(object, Function.identity);
+Object.addEach(Dict.prototype, genericCollection.prototype);
+Object.addEach(Dict.prototype, genericMap.prototype);
+
+Dict.from = genericCollection.from;
+
+Dict.prototype.constructClone = function (values) {
+    return new this.constructor(values, this.getDefault);
 };
 
-// TODO inline document concat
-Object.concat = function () {
-    var object = {};
-    for (var i = 0; i < arguments.length; i++) {
-        Object.addEach(object, arguments[i]);
+Dict.prototype.assertString = function (key) {
+    if (typeof key !== "string") {
+        throw new TypeError("key must be a string but Got " + key);
     }
-    return object;
 };
 
-Object.from = Object.concat;
+Object.defineProperty(Dict.prototype,"$__proto__",{writable:true});
+Object.defineProperty(Dict.prototype,"_hasProto",{
+    get:function() {
+        return this.hasOwnProperty("$__proto__") && typeof this._protoValue !== "undefined";
+    }
+});
+Object.defineProperty(Dict.prototype,"_protoValue",{
+    get:function() {
+        return this["$__proto__"];
+    },
+    set: function(value) {
+        this["$__proto__"] = value;
+    }
+});
 
-/**
-    Returns whether two values are identical.  Any value is identical to itself
-    and only itself.  This is much more restictive than equivalence and subtly
-    different than strict equality, <code>===</code> because of edge cases
-    including negative zero and <code>NaN</code>.  Identity is useful for
-    resolving collisions among keys in a mapping where the domain is any value.
-    This method does not delgate to any method on an object and cannot be
-    overridden.
-    @see http://wiki.ecmascript.org/doku.php?id=harmony:egal
-    @param {Any} this
-    @param {Any} that
-    @returns {Boolean} whether this and that are identical
-    @function external:Object.is
-*/
-Object.is = function (x, y) {
-    if (x === y) {
-        // 0 === -0, but they are not identical
-        return x !== 0 || 1 / x === 1 / y;
+Object.defineProperty(Dict.prototype,"size",genericCollection._sizePropertyDescriptor);
+
+
+Dict.prototype.get = function (key, defaultValue) {
+    this.assertString(key);
+    if (key === "__proto__") {
+        if (this._hasProto) {
+            return this._protoValue;
+        } else if (arguments.length > 1) {
+            return defaultValue;
+        } else {
+            return this.getDefault(key);
+        }
+    }
+    else {
+        if (key in this.store) {
+            return this.store[key];
+        } else if (arguments.length > 1) {
+            return defaultValue;
+        } else {
+            return this.getDefault(key);
+        }
     }
-    // NaN !== NaN, but they are identical.
-    // NaNs are the only non-reflexive value, i.e., if x !== x,
-    // then x is a NaN.
-    // isNaN is broken: it converts its argument to number, so
-    // isNaN("foo") => true
-    return x !== x && y !== y;
 };
 
-/**
-    Performs a polymorphic, type-sensitive deep equivalence comparison of any
-    two values.
+Dict.prototype.set = function (key, value) {
+    this.assertString(key);
+    var isProtoKey = (key === "__proto__");
 
-    <p>As a basic principle, any value is equivalent to itself (as in
-    identity), any boxed version of itself (as a <code>new Number(10)</code> is
-    to 10), and any deep clone of itself.
+    if (isProtoKey ? this._hasProto : key in this.store) { // update
+        if (this.dispatchesMapChanges) {
+            this.dispatchBeforeMapChange(key, isProtoKey ? this._protoValue : this.store[key]);
+        }
 
-    <p>Equivalence has the following properties:
+        isProtoKey
+            ? this._protoValue = value
+            : this.store[key] = value;
 
-    <ul>
-        <li><strong>polymorphic:</strong>
-            If the given object is an instance of a type that implements a
-            methods named "equals", this function defers to the method.  So,
-            this function can safely compare any values regardless of type,
-            including undefined, null, numbers, strings, any pair of objects
-            where either implements "equals", or object literals that may even
-            contain an "equals" key.
-        <li><strong>type-sensitive:</strong>
-            Incomparable types are not equal.  No object is equivalent to any
-            array.  No string is equal to any other number.
-        <li><strong>deep:</strong>
-            Collections with equivalent content are equivalent, recursively.
-        <li><strong>equivalence:</strong>
-            Identical values and objects are equivalent, but so are collections
-            that contain equivalent content.  Whether order is important varies
-            by type.  For Arrays and lists, order is important.  For Objects,
-            maps, and sets, order is not important.  Boxed objects are mutally
-            equivalent with their unboxed values, by virtue of the standard
-            <code>valueOf</code> method.
-    </ul>
-    @param this
-    @param that
-    @returns {Boolean} whether the values are deeply equivalent
-    @function external:Object.equals
-*/
-Object.equals = function (a, b, equals, memo) {
-    equals = equals || Object.equals;
-    //console.log("Object.equals: a:",a, "b:",b, "equals:",equals);
-    // unbox objects, but do not confuse object literals
-    a = Object.getValueOf(a);
-    b = Object.getValueOf(b);
-    if (a === b)
+        if (this.dispatchesMapChanges) {
+            this.dispatchMapChange(key, value);
+        }
+        return false;
+    } else { // create
+        if (this.dispatchesMapChanges) {
+            this.dispatchBeforeMapChange(key, undefined);
+        }
+        this.length++;
+
+        isProtoKey
+            ? this._protoValue = value
+            : this.store[key] = value;
+
+        if (this.dispatchesMapChanges) {
+            this.dispatchMapChange(key, value);
+        }
         return true;
-    if (Object.isObject(a)) {
-        memo = memo || new weakMap$1();
-        if (memo.has(a)) {
+    }
+};
+
+Dict.prototype.has = function (key) {
+    this.assertString(key);
+    return key === "__proto__" ? this._hasProto : key in this.store;
+};
+
+Dict.prototype["delete"] = function (key) {
+    this.assertString(key);
+    if (key === "__proto__") {
+        if (this._hasProto) {
+            if (this.dispatchesMapChanges) {
+                this.dispatchBeforeMapChange(key, this._protoValue);
+            }
+            this._protoValue = undefined;
+            this.length--;
+            if (this.dispatchesMapChanges) {
+                this.dispatchMapChange(key, undefined);
+            }
+            return true;
+        }
+        return false;
+    }
+    else {
+        if (key in this.store) {
+            if (this.dispatchesMapChanges) {
+                this.dispatchBeforeMapChange(key, this.store[key]);
+            }
+            delete this.store[key];
+            this.length--;
+            if (this.dispatchesMapChanges) {
+                this.dispatchMapChange(key, undefined);
+            }
             return true;
         }
-        memo.set(a, true);
+        return false;
+    }
+};
+
+Dict.prototype.clear = function () {
+    var key;
+    if (this._hasProto) {
+        if (this.dispatchesMapChanges) {
+            this.dispatchBeforeMapChange("__proto__", this._protoValue);
+        }
+        this._protoValue = undefined;
+        if (this.dispatchesMapChanges) {
+            this.dispatchMapChange("__proto__", undefined);
+        }
     }
-    if (Object.isObject(a) && typeof a.equals === "function") {
-        return a.equals(b, equals, memo);
+    for (key in this.store) {
+        if (this.dispatchesMapChanges) {
+            this.dispatchBeforeMapChange(key, this.store[key]);
+        }
+        delete this.store[key];
+        if (this.dispatchesMapChanges) {
+            this.dispatchMapChange(key, undefined);
+        }
     }
-    // commutative
-    if (Object.isObject(b) && typeof b.equals === "function") {
-        return b.equals(a, equals, memo);
+    this.length = 0;
+};
+
+Dict.prototype.reduce = function (callback, basis, thisp) {
+    if(this._hasProto) {
+        basis = callback.call(thisp, basis, "$__proto__", "__proto__", this);
     }
-    if (Object.isObject(a) && Object.isObject(b)) {
-        if (Object.getPrototypeOf(a) === Object.prototype && Object.getPrototypeOf(b) === Object.prototype) {
-            for (var name in a) {
-                if (!equals(a[name], b[name], equals, memo)) {
-                    return false;
-                }
-            }
-            for (var name in b) {
-                if (!(name in a) || !equals(b[name], a[name], equals, memo)) {
-                    return false;
-                }
-            }
-            return true;
-        }
+    var store = this.store;
+    for (var key in this.store) {
+        basis = callback.call(thisp, basis, store[key], key, this);
     }
-    // NaN !== NaN, but they are equal.
-    // NaNs are the only non-reflexive value, i.e., if x !== x,
-    // then x is a NaN.
-    // isNaN is broken: it converts its argument to number, so
-    // isNaN("foo") => true
-    // We have established that a !== b, but if a !== a && b !== b, they are
-    // both NaN.
-    if (a !== a && b !== b)
-        return true;
-    if (!a || !b)
-        return a === b;
-    return false;
+    return basis;
 };
 
-// Because a return value of 0 from a `compare` function  may mean either
-// "equals" or "is incomparable", `equals` cannot be defined in terms of
-// `compare`.  However, `compare` *can* be defined in terms of `equals` and
-// `lessThan`.  Again however, more often it would be desirable to implement
-// all of the comparison functions in terms of compare rather than the other
-// way around.
+Dict.prototype.reduceRight = function (callback, basis, thisp) {
+    var self = this;
+    var store = this.store;
+    basis = Object.keys(this.store).reduceRight(function (basis, key) {
+        return callback.call(thisp, basis, store[key], key, self);
+    }, basis);
 
-/**
-    Determines the order in which any two objects should be sorted by returning
-    a number that has an analogous relationship to zero as the left value to
-    the right.  That is, if the left is "less than" the right, the returned
-    value will be "less than" zero, where "less than" may be any other
-    transitive relationship.
+    if(this._hasProto) {
+        return callback.call(thisp, basis, this._protoValue, "__proto__", self);
+    }
+    return basis;
+};
 
-    <p>Arrays are compared by the first diverging values, or by length.
+Dict.prototype.one = function () {
+    var key;
+    for (key in this.store) {
+        return this.store[key];
+    }
+    return this._protoValue;
+};
 
-    <p>Any two values that are incomparable return zero.  As such,
-    <code>equals</code> should not be implemented with <code>compare</code>
-    since incomparability is indistinguishable from equality.
+Dict.prototype.toJSON = function () {
+    return this.toObject();
+};
 
-    <p>Sorts strings lexicographically.  This is not suitable for any
-    particular international setting.  Different locales sort their phone books
-    in very different ways, particularly regarding diacritics and ligatures.
+var treeLog = TreeLog;
 
-    <p>If the given object is an instance of a type that implements a method
-    named "compare", this function defers to the instance.  The method does not
-    need to be an owned property to distinguish it from an object literal since
-    object literals are incomparable.  Unlike <code>Object</code> however,
-    <code>Array</code> implements <code>compare</code>.
+function TreeLog() {
+}
 
-    @param {Any} left
-    @param {Any} right
-    @returns {Number} a value having the same transitive relationship to zero
-    as the left and right values.
-    @function external:Object.compare
-*/
-Object.compare = function (a, b) {
-    // unbox objects, but do not confuse object literals
-    // mercifully handles the Date case
-    a = Object.getValueOf(a);
-    b = Object.getValueOf(b);
-    if (a === b)
-        return 0;
-    var aType = typeof a;
-    var bType = typeof b;
-    if (aType === "number" && bType === "number")
-        return a - b;
-    if (aType === "string" && bType === "string")
-        return a < b ? -Infinity : Infinity;
-        // the possibility of equality elimiated above
-    if (a && typeof a.compare === "function")
-        return a.compare(b);
-    // not commutative, the relationship is reversed
-    if (b && typeof b.compare === "function")
-        return -b.compare(a);
-    return 0;
+TreeLog.ascii = {
+    intersection: "+",
+    through: "-",
+    branchUp: "+",
+    branchDown: "+",
+    fromBelow: ".",
+    fromAbove: "'",
+    fromBoth: "+",
+    strafe: "|"
 };
 
-/**
-    Creates a deep copy of any value.  Values, being immutable, are
-    returned without alternation.  Forwards to <code>clone</code> on
-    objects and arrays.
+TreeLog.unicodeRound = {
+    intersection: "\u254b",
+    through: "\u2501",
+    branchUp: "\u253b",
+    branchDown: "\u2533",
+    fromBelow: "\u256d", // round corner
+    fromAbove: "\u2570", // round corner
+    fromBoth: "\u2523",
+    strafe: "\u2503"
+};
 
-    @function external:Object.clone
-    @param {Any} value a value to clone
-    @param {Number} depth an optional traversal depth, defaults to infinity.
-    A value of <code>0</code> means to make no clone and return the value
-    directly.
-    @param {Map} memo an optional memo of already visited objects to preserve
-    reference cycles.  The cloned object will have the exact same shape as the
-    original, but no identical objects.  Te map may be later used to associate
-    all objects in the original object graph with their corresponding member of
-    the cloned graph.
-    @returns a copy of the value
-*/
-Object.clone = function (value, depth, memo) {
-    value = Object.getValueOf(value);
-    memo = memo || new weakMap$1();
-    if (depth === undefined) {
-        depth = Infinity;
-    } else if (depth === 0) {
-        return value;
-    }
-    if (Object.isObject(value)) {
-        if (!memo.has(value)) {
-            if (value && typeof value.clone === "function") {
-                memo.set(value, value.clone(depth, memo));
-            } else {
-                var prototype = Object.getPrototypeOf(value);
-                if (prototype === null || prototype === Object.prototype) {
-                    var clone = Object.create(prototype);
-                    memo.set(value, clone);
-                    for (var key in value) {
-                        clone[key] = Object.clone(value[key], depth - 1, memo);
-                    }
-                } else {
-                    throw new Error("Can't clone " + value);
-                }
-            }
-        }
-        return memo.get(value);
-    }
-    return value;
+TreeLog.unicodeSharp = {
+    intersection: "\u254b",
+    through: "\u2501",
+    branchUp: "\u253b",
+    branchDown: "\u2533",
+    fromBelow: "\u250f", // sharp corner
+    fromAbove: "\u2517", // sharp corner
+    fromBoth: "\u2523",
+    strafe: "\u2503"
 };
 
-/**
-    Removes all properties owned by this object making the object suitable for
-    reuse.
+var _fastSet = FastSet;
 
-    @function external:Object.clear
-    @returns this
-*/
-Object.clear = function (object) {
-    if (object && typeof object.clear === "function") {
-        object.clear();
-    } else {
-        var keys = Object.keys(object),
-            i = keys.length;
-        while (i) {
-            i--;
-            delete object[keys[i]];
-        }
+function FastSet(values, equals, hash, getDefault) {
+    if (!(this instanceof FastSet)) {
+        return new FastSet(values, equals, hash, getDefault);
     }
-    return object;
-};
-
-var genericOrder = GenericOrder;
-function GenericOrder() {
-    throw new Error("Can't construct. GenericOrder is a mixin.");
+    equals = equals || Object.equals;
+    hash = hash || Object.hash;
+    getDefault = getDefault || Function.noop;
+    this.contentEquals = equals;
+    this.contentHash = hash;
+    this.getDefault = getDefault;
+    var self = this;
+    this.buckets = new this.Buckets(null, function getDefaultBucket() {
+        return new self.Bucket();
+    });
+    this.length = 0;
+    this.addEach(values);
 }
 
-GenericOrder.prototype.equals = function (that, equals) {
-    equals = equals || this.contentEquals || shimObject.equals;
+FastSet.FastSet = FastSet; // hack so require("fast-set").FastSet will work in MontageJS
 
-    if (this === that) {
-        return true;
-    }
-    if (!that) {
-        return false;
-    }
-    return (
-        this.length === that.length &&
-        this.zip(that).every(function (pair) {
-            return equals(pair[0], pair[1]);
-        })
+Object.addEach(FastSet.prototype, genericCollection.prototype);
+Object.addEach(FastSet.prototype, genericSet.prototype);
+FastSet.from = genericCollection.from;
+
+FastSet.prototype.Buckets = _dict;
+FastSet.prototype.Bucket = _list;
+
+FastSet.prototype.constructClone = function (values) {
+    return new this.constructor(
+        values,
+        this.contentEquals,
+        this.contentHash,
+        this.getDefault
     );
 };
 
-GenericOrder.prototype.compare = function (that, compare) {
-    compare = compare || this.contentCompare || shimObject.compare;
+FastSet.prototype.has = function (value) {
+    var hash = this.contentHash(value);
+    return this.buckets.get(hash).has(value);
+};
 
-    if (this === that) {
-        return 0;
+FastSet.prototype.get = function (value, equals) {
+    if (equals) {
+        throw new Error("FastSet#get does not support second argument: equals");
     }
-    if (!that) {
-        return 1;
+    var hash = this.contentHash(value);
+    var buckets = this.buckets;
+    if (buckets.has(hash)) {
+        return buckets.get(hash).get(value);
+    } else {
+        return this.getDefault(value);
     }
+};
 
-    var length = Math.min(this.length, that.length);
-    var comparison = this.zip(that).reduce(function (comparison, pair, index) {
-        if (comparison === 0) {
-            if (index >= length) {
-                return comparison;
-            } else {
-                return compare(pair[0], pair[1]);
+FastSet.prototype["delete"] = function (value, equals) {
+    if (equals) {
+        throw new Error("FastSet#delete does not support second argument: equals");
+    }
+    var hash = this.contentHash(value);
+    var buckets = this.buckets;
+    if (buckets.has(hash)) {
+        var bucket = buckets.get(hash);
+        if (bucket["delete"](value)) {
+            this.length--;
+            if (bucket.length === 0) {
+                buckets["delete"](hash);
             }
-        } else {
-            return comparison;
+            return true;
         }
-    }, 0);
-    if (comparison === 0) {
-        return this.length - that.length;
     }
-    return comparison;
+    return false;
 };
 
-GenericOrder.prototype.toJSON = function () {
-    return this.toArray();
+FastSet.prototype.clear = function () {
+    this.buckets.clear();
+    this.length = 0;
 };
 
-var array_splice = Array.prototype.splice;
-var array_slice = Array.prototype.slice;
-
-Array.empty = [];
-
-if (Object.freeze) {
-    Object.freeze(Array.empty);
-}
+FastSet.prototype.add = function (value) {
+    var hash = this.contentHash(value);
+    var buckets = this.buckets;
+    if (!buckets.has(hash)) {
+        buckets.set(hash, new this.Bucket(null, this.contentEquals));
+    }
+    if (!buckets.get(hash).has(value)) {
+        buckets.get(hash).add(value);
+        this.length++;
+        return true;
+    }
+    return false;
+};
 
-Array.nativeFrom = Array.from;
+FastSet.prototype.reduce = function (callback, basis /*, thisp*/) {
+    var thisp = arguments[2];
+    var buckets = this.buckets;
+    var index = 0;
+    return buckets.reduce(function (basis, bucket) {
+        return bucket.reduce(function (basis, value) {
+            return callback.call(thisp, basis, value, index++, this);
+        }, basis, this);
+    }, basis, this);
+};
 
-var isSymbolDefined = typeof Symbol !== "undefined";
-Array.from = function (values, mapFn, thisArg) {
-    if (isSymbolDefined && values && typeof values[Symbol.iterator] === "function") {
-        return Array.nativeFrom(values, mapFn, thisArg);
+FastSet.prototype.one = function () {
+    if (this.length > 0) {
+        return this.buckets.one().one();
     }
-    //Now we add support for values that implement forEach:
-    var array = [];
-    array.addEach(values);
-    return array;
 };
 
-Array.unzip = function (table) {
-    var transpose = [];
-    var length = Infinity;
-    // compute shortest row
-    for (var i = 0; i < table.length; i++) {
-        var row = table[i];
-        table[i] = row.toArray();
-        if (row.length < length) {
-            length = row.length;
-        }
-    }
-    for (var i = 0; i < table.length; i++) {
-        var row = table[i];
-        for (var j = 0; j < row.length; j++) {
-            if (j < length && j in row) {
-                transpose[j] = transpose[j] || [];
-                transpose[j][i] = row[j];
-            }
-        }
-    }
-    return transpose;
+FastSet.prototype.iterate = function () {
+    return this.buckets.valuesArray().flatten().iterate();
 };
 
-function define(key, value) {
-    Object.defineProperty(Array.prototype, key, {
-        value: value,
-        writable: true,
-        configurable: true,
-        enumerable: false
-    });
-}
+FastSet.prototype.log = function (charmap, logNode, callback, thisp) {
+    charmap = charmap || treeLog.unicodeSharp;
+    logNode = logNode || this.logNode;
+    if (!callback) {
+        callback = console.log;
+        thisp = console;
+    }
+    callback = callback.bind(thisp);
 
-define("addEach", genericCollection.prototype.addEach);
-define("deleteEach", genericCollection.prototype.deleteEach);
-define("toArray", genericCollection.prototype.toArray);
-define("toObject", genericCollection.prototype.toObject);
-define("all", genericCollection.prototype.all);
-define("any", genericCollection.prototype.any);
-define("min", genericCollection.prototype.min);
-define("max", genericCollection.prototype.max);
-define("sum", genericCollection.prototype.sum);
-define("average", genericCollection.prototype.average);
-define("only", genericCollection.prototype.only);
-define("flatten", genericCollection.prototype.flatten);
-define("zip", genericCollection.prototype.zip);
-define("enumerate", genericCollection.prototype.enumerate);
-define("group", genericCollection.prototype.group);
-define("sorted", genericCollection.prototype.sorted);
-define("reversed", genericCollection.prototype.reversed);
+    var buckets = this.buckets, bucketsSize = buckets.size,
+        mapIter = buckets.keys(), hash, index = 0,
+        branch, leader, bucket;
 
-define("constructClone", function (values) {
-    var clone = new this.constructor();
-    clone.addEach(values);
-    return clone;
-});
+    while (hash = mapIter.next().value) {
+        if (index === bucketsSize - 1) {
+            branch = charmap.fromAbove;
+            leader = ' ';
+        } else if (index === 0) {
+            branch = charmap.branchDown;
+            leader = charmap.strafe;
+        } else {
+            branch = charmap.fromBoth;
+            leader = charmap.strafe;
+        }
+        bucket = buckets.get(hash);
+        callback.call(thisp, branch + charmap.through + charmap.branchDown + ' ' + hash);
+        bucket.forEach(function (value, node) {
+            var branch, below, written;
+            if (node === bucket.head.prev) {
+                branch = charmap.fromAbove;
+                below = ' ';
+            } else {
+                branch = charmap.fromBoth;
+                below = charmap.strafe;
+            }
+            logNode(
+                node,
+                function (line) {
+                    if (!written) {
+                        callback.call(thisp, leader + ' ' + branch + charmap.through + charmap.through + line);
+                        written = true;
+                    } else {
+                        callback.call(thisp, leader + ' ' + below + '  ' + line);
+                    }
+                },
+                function (line) {
+                    callback.call(thisp, leader + ' ' + charmap.strafe + '  ' + line);
+                }
+            );
+        });
+        index++;
+    }
 
-define("has", function (value, equals) {
-    return this.findValue(value, equals) !== -1;
-});
+    //var hashes = buckets.keysArray();
+    // hashes.forEach(function (hash, index) {
+    //     var branch;
+    //     var leader;
+    //     if (index === hashes.length - 1) {
+    //         branch = charmap.fromAbove;
+    //         leader = ' ';
+    //     } else if (index === 0) {
+    //         branch = charmap.branchDown;
+    //         leader = charmap.strafe;
+    //     } else {
+    //         branch = charmap.fromBoth;
+    //         leader = charmap.strafe;
+    //     }
+    //     var bucket = buckets.get(hash);
+    //     callback.call(thisp, branch + charmap.through + charmap.branchDown + ' ' + hash);
+    //     bucket.forEach(function (value, node) {
+    //         var branch, below;
+    //         if (node === bucket.head.prev) {
+    //             branch = charmap.fromAbove;
+    //             below = ' ';
+    //         } else {
+    //             branch = charmap.fromBoth;
+    //             below = charmap.strafe;
+    //         }
+    //         var written;
+    //         logNode(
+    //             node,
+    //             function (line) {
+    //                 if (!written) {
+    //                     callback.call(thisp, leader + ' ' + branch + charmap.through + charmap.through + line);
+    //                     written = true;
+    //                 } else {
+    //                     callback.call(thisp, leader + ' ' + below + '  ' + line);
+    //                 }
+    //             },
+    //             function (line) {
+    //                 callback.call(thisp, leader + ' ' + charmap.strafe + '  ' + line);
+    //             }
+    //         );
+    //     });
+    // });
+};
 
-define("get", function (index, defaultValue) {
-    if (+index !== index) {
-        throw new Error("Indicies must be numbers");
-    } else if (!index in this) {
-        return defaultValue;
+FastSet.prototype.logNode = function (node, write) {
+    var value = node.value;
+    if (Object(value) === value) {
+        JSON.stringify(value, null, 4).split("\n").forEach(function (line) {
+            write(" " + line);
+        });
     } else {
-        return this[index];
+        write(" " + value);
     }
-});
+};
 
-define("set", function (index, value) {
-    this[index] = value;
-    return true;
-});
+var _set = createCommonjsModule(function (module) {
 
-define("add", function (value) {
-    this.push(value);
-    return true;
-});
 
-define("delete", function (value, equals) {
-    var index = this.findValue(value, equals);
-    if (index !== -1) {
-        this.spliceOne(index);
-        return true;
-    }
-    return false;
-});
 
-define("deleteAll", function (value, equals) {
-    equals = equals || this.contentEquals || Object.equals;
-    var count = 0;
-    for (var index = 0; index < this.length;) {
-        if (equals(value, this[index])) {
-            this.swap(index, 1);
-            count++;
-        } else {
-            index++;
-        }
-    }
-    return count;
-});
 
-// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/find
-// https://tc39.github.io/ecma262/#sec-array.prototype.find
-if (!Array.prototype.find) {
-    define("find", function(predicate) {
-        // 1. Let O be ? ToObject(this value).
-        if (this == null) {
-            throw new TypeError('"this" is null or not defined');
-        }
+var GlobalSet, CollectionsSet;
 
-        var o = Object(this);
 
-        // 2. Let len be ? ToLength(? Get(O, "length")).
-        var len = o.length >>> 0;
+if((commonjsGlobal.Set !== void 0) && (typeof commonjsGlobal.Set.prototype.values === "function")) {
 
-        // 3. If IsCallable(predicate) is false, throw a TypeError exception.
-        if (typeof predicate !== 'function') {
-            throw new TypeError('predicate must be a function');
+    GlobalSet = module.exports = commonjsGlobal.Set;
+    GlobalSet.Set = GlobalSet; // hack so require("set").Set will work in MontageJS
+
+    GlobalSet.prototype.reduce = function (callback, basis /*, thisp*/) {
+        var thisp = arguments[2];
+        this.forEach(function(value) {
+            basis = callback.call(thisp, basis, value, this);
+        });
+        return basis;
+    };
+
+    GlobalSet.prototype.reduceRight = function (callback, basis /*, thisp*/) {
+        var thisp = arguments[2];
+        var setIterator = this.values();
+        var size = this.size;
+        var reverseOrder = new Array(this.size);
+        var value, i = size;
+        // Fill 'reverseOrder' with values of Set in inverted order.
+        while ((value = setIterator.next().value)) {
+            reverseOrder[--i] = value;
+        }
+        // Iterate over reversed values and callback.
+        while (i < size) {
+            basis = callback.call(thisp, basis, reverseOrder[i++], this);
         }
+        return basis;
+    };
 
-        // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
-        var thisArg = arguments[1];
+    GlobalSet.prototype.equals = function (that, equals) {
+        var self = this;
+        return (
+            that && typeof that.reduce === "function" &&
+            this.size === (that.size || that.length) &&
+            that.reduce(function (equal, value) {
+                return equal && self.has(value, equals);
+            }, true)
+        );
+    };
 
-        // 5. Let k be 0.
-        var k = 0;
+    GlobalSet.prototype.constructClone = function (values) {
+        return new this.constructor(values, this.contentEquals, this.contentHash, this.getDefault);
+    };
 
-        // 6. Repeat, while k < len
-        while (k < len) {
-            // a. Let Pk be ! ToString(k).
-            // b. Let kValue be ? Get(O, Pk).
-            // c. Let testResult be ToBoolean(? Call(predicate, T, « kValue, k, O »)).
-            // d. If testResult is true, return kValue.
-            var kValue = o[k];
-            if (predicate.call(thisArg, kValue, k, o)) {
-                return kValue;
+    GlobalSet.prototype.toJSON = function () {
+        return this.entriesArray();
+    };
+
+    GlobalSet.prototype.one = function () {
+        if (this.size > 0) {
+            return this.values().next().value;
+        }
+        return undefined;
+    };
+
+    GlobalSet.prototype.pop = function () {
+        if (this.size) {
+            var setIterator = this.values(), aValue, value;
+            while(aValue = setIterator.next().value) {
+                value = aValue;
             }
-            // e. Increase k by 1.
-            k++;
+            this["delete"](value,this.size-1);
+            return value;
         }
+    };
+
+    GlobalSet.prototype.shift = function () {
+        if (this.size) {
+            var firstValue = this.values().next().value;
+            this["delete"](firstValue,0);
+            return firstValue;
+        }
+    };
+
+    //Backward compatibility:
+    Object.defineProperty(GlobalSet.prototype,"length",{
+        get: function() {
+            return this.size;
+        },
+        enumerable: true,
+        configurable:true
     });
-}
 
-// TODO remove in v6 (not present in v2)
-var deprecatedWarnNonce = {};
-function deprecatedWarn(msg, notOnce) {
-    if (
-        typeof console !== 'undefined' &&
-            typeof console.warn === 'function' &&
-                (notOnce !== true && deprecatedWarnNonce.hasOwnProperty(msg) === false)
-    ) {
-        console.warn(msg);
-        deprecatedWarnNonce[msg]++;
-    }
+    GlobalSet.from = function (value) {
+        var result = (new this);
+        result.addEach(value);
+        return result;
+    };
+
+    Object.addEach(GlobalSet.prototype, genericCollection.prototype, false);
+    Object.addEach(GlobalSet.prototype, genericSet.prototype, false);
+
 }
 
-// Save Array.prototype.find in order to support legacy and display warning.
-// TODO remove in v6 (not present in v2)
-var ArrayFindPrototype = Object.getOwnPropertyDescriptor(Array.prototype, 'find').value;
-define("find", function (value, equals, index) {
-    if (
-        typeof arguments[0] === 'function' &&
-            this instanceof Array
-    ) {
-        return ArrayFindPrototype.apply(this, arguments);
-    } else {
-        deprecatedWarn('Array#find usage is deprecated please use Array#findValue');
-        return this.findValue.apply(this, arguments);
-    }
-});
 
-define("findValue", function (value, equals, index) {
-    if (index) {
-        throw new Error("Array#findValue does not support third argument: index");
-    }
-    equals = equals || this.contentEquals || Object.equals;
-    for (var index = 0; index < this.length; index++) {
-        if (index in this && equals(value, this[index])) {
-            return index;
-        }
-    }
-    return -1;
-});
 
-// TODO remove in v6 (not present in v2)
-define("findLast", function (value, equals) {
-    deprecatedWarn('Array#findLast function is deprecated please use Array#findLastValue instead.');
-    return this.findLastValue.apply(this, arguments);
-});
+    
+    
+    
 
-define("findLastValue", function (value, equals) {
-    equals = equals || this.contentEquals || Object.equals;
-    var index = this.length;
-    do {
-        index--;
-        if (index in this && equals(this[index], value)) {
-            return index;
+    CollectionsSet = function CollectionsSet(values, equals, hash, getDefault) {
+        return CollectionsSet._init(CollectionsSet, this, values, equals, hash, getDefault);
+    };
+
+    CollectionsSet._init = function (constructor, object, values, equals, hash, getDefault) {
+        if (!(object instanceof constructor)) {
+            return new constructor(values, equals, hash, getDefault);
         }
-    } while (index > 0);
-    return -1;
-});
+        equals = equals || Object.equals;
+        hash = hash || Object.hash;
+        getDefault = getDefault || Function.noop;
+        object.contentEquals = equals;
+        object.contentHash = hash;
+        object.getDefault = getDefault;
+        // a list of values in insertion order, used for all operations that depend
+        // on iterating in insertion order
+        object.order = new object.Order(undefined, equals);
+        // a set of nodes from the order list, indexed by the corresponding value,
+        // used for all operations that need to quickly seek  value in the list
+        object.store = new object.Store(
+            undefined,
+            function (a, b) {
+                return equals(a.value, b.value);
+            },
+            function (node) {
+                return hash(node.value);
+            }
+        );
+        object.length = 0;
+        object.addEach(values);
+
+    };
+
+    CollectionsSet.Set = CollectionsSet; // hack so require("set").Set will work in MontageJS
+    CollectionsSet.CollectionsSet = CollectionsSet;
+
+    Object.addEach(CollectionsSet.prototype, genericCollection.prototype);
+    Object.addEach(CollectionsSet.prototype, genericSet.prototype);
+
+    CollectionsSet.from = genericCollection.from;
+
+    Object.defineProperty(CollectionsSet.prototype,"size",genericCollection._sizePropertyDescriptor);
+
+    //Overrides for consistency:
+    // Set.prototype.forEach = GenericCollection.prototype.forEach;
+
+
+    CollectionsSet.prototype.Order = _list;
+    CollectionsSet.prototype.Store = _fastSet;
 
-define("swap", function (start, length, plus) {
-    var args, plusLength, i, j, returnValue;
-    if (start > this.length) {
-        this.length = start;
-    }
-    if (typeof plus !== "undefined") {
-        args = [start, length];
-        if (!Array.isArray(plus)) {
-            plus = array_slice.call(plus);
+    CollectionsSet.prototype.constructClone = function (values) {
+        return new this.constructor(values, this.contentEquals, this.contentHash, this.getDefault);
+    };
+
+    CollectionsSet.prototype.has = function (value) {
+        var node = new this.order.Node(value);
+        return this.store.has(node);
+    };
+
+    CollectionsSet.prototype.get = function (value, equals) {
+        if (equals) {
+            throw new Error("Set#get does not support second argument: equals");
         }
-        i = 0;
-        plusLength = plus.length;
-        // 1000 is a magic number, presumed to be smaller than the remaining
-        // stack length. For swaps this small, we take the fast path and just
-        // use the underlying Array splice. We could measure the exact size of
-        // the remaining stack using a try/catch around an unbounded recursive
-        // function, but this would defeat the purpose of short-circuiting in
-        // the common case.
-        if (plusLength < 1000) {
-            for (i; i < plusLength; i++) {
-                args[i+2] = plus[i];
-            }
-            return array_splice.apply(this, args);
+        var node = new this.order.Node(value);
+        node = this.store.get(node);
+        if (node) {
+            return node.value;
         } else {
-            // Avoid maximum call stack error.
-            // First delete the desired entries.
-            returnValue = array_splice.apply(this, args);
-            // Second batch in 1000s.
-            for (i; i < plusLength;) {
-                args = [start+i, 0];
-                for (j = 2; j < 1002 && i < plusLength; j++, i++) {
-                    args[j] = plus[i];
-                }
-                array_splice.apply(this, args);
-            }
-            return returnValue;
+            return this.getDefault(value);
         }
-    // using call rather than apply to cut down on transient objects
-    } else if (typeof length !== "undefined") {
-        return array_splice.call(this, start, length);
-    }  else if (typeof start !== "undefined") {
-        return array_splice.call(this, start);
-    } else {
-        return [];
-    }
-});
+    };
 
-define("peek", function () {
-    return this[0];
-});
+    CollectionsSet.prototype.add = function (value) {
+        var node = new this.order.Node(value);
+        if (!this.store.has(node)) {
+            var index = this.length;
+            this.order.add(value);
+            node = this.order.head.prev;
+            this.store.add(node);
+            this.length++;
+            return true;
+        }
+        return false;
+    };
 
-define("poke", function (value) {
-    if (this.length > 0) {
-        this[0] = value;
-    }
-});
+    CollectionsSet.prototype["delete"] = function (value, equals) {
+        if (equals) {
+            throw new Error("Set#delete does not support second argument: equals");
+        }
+        var node = new this.order.Node(value);
+        if (this.store.has(node)) {
+            node = this.store.get(node);
+            this.store["delete"](node); // removes from the set
+            this.order.splice(node, 1); // removes the node from the list
+            this.length--;
+            return true;
+        }
+        return false;
+    };
 
-define("peekBack", function () {
-    if (this.length > 0) {
-        return this[this.length - 1];
-    }
-});
+    CollectionsSet.prototype.pop = function () {
+        if (this.length) {
+            var result = this.order.head.prev.value;
+            this["delete"](result);
+            return result;
+        }
+    };
 
-define("pokeBack", function (value) {
-    if (this.length > 0) {
-        this[this.length - 1] = value;
-    }
-});
+    CollectionsSet.prototype.shift = function () {
+        if (this.length) {
+            var result = this.order.head.next.value;
+            this["delete"](result);
+            return result;
+        }
+    };
 
-define("one", function () {
-    for (var i in this) {
-        if (Object.owns(this, i)) {
-            return this[i];
+    CollectionsSet.prototype.one = function () {
+        if (this.length > 0) {
+            return this.store.one().value;
         }
-    }
-});
+    };
 
-if (!Array.prototype.clear) {
-    define("clear", function () {
+    CollectionsSet.prototype.clear = function () {
+        this.store.clear();
+        this.order.clear();
         this.length = 0;
-        return this;
+    };
+    Object.defineProperty(CollectionsSet.prototype,"_clear", {
+        value: CollectionsSet.prototype.clear
     });
-}
 
-define("compare", function (that, compare) {
-    compare = compare || Object.compare;
-    var i;
-    var length;
-    var lhs;
-    var rhs;
-    var relative;
+    CollectionsSet.prototype.reduce = function (callback, basis /*, thisp*/) {
+        var thisp = arguments[2];
+        var list = this.order;
+        var index = 0;
+        return list.reduce(function (basis, value) {
+            return callback.call(thisp, basis, value, index++, this);
+        }, basis, this);
+    };
 
-    if (this === that) {
-        return 0;
-    }
+    CollectionsSet.prototype.reduceRight = function (callback, basis /*, thisp*/) {
+        var thisp = arguments[2];
+        var list = this.order;
+        var index = this.length - 1;
+        return list.reduceRight(function (basis, value) {
+            return callback.call(thisp, basis, value, index--, this);
+        }, basis, this);
+    };
 
-    if (!that || !Array.isArray(that)) {
-        return genericOrder.prototype.compare.call(this, that, compare);
-    }
+    CollectionsSet.prototype.iterate = function () {
+        return this.order.iterate();
+    };
 
-    length = (this.length < that.length) ? this.length : that.length;
+    CollectionsSet.prototype.values = function () {
+        return new iterator(this.valuesArray(), true);
+    };
 
-    for (i = 0; i < length; i++) {
-        if (i in this) {
-            if (!(i in that)) {
-                return -1;
-            } else {
-                lhs = this[i];
-                rhs = that[i];
-                relative = compare(lhs, rhs);
-                if (relative) {
-                    return relative;
-                }
-            }
-        } else if (i in that) {
-            return 1;
-        }
-    }
+    CollectionsSet.prototype.log = function () {
+        var set = this.store;
+        return set.log.apply(set, arguments);
+    };
 
-    return this.length - that.length;
+
+
+if(!GlobalSet) {
+    module.exports = CollectionsSet;
+}
+else {
+    GlobalSet.prototype.valuesArray = genericSet.prototype.valuesArray;
+    GlobalSet.prototype.entriesArray = genericSet.prototype.entriesArray;
+    module.exports = GlobalSet;
+    GlobalSet.CollectionsSet = CollectionsSet;
+}
 });
 
-define("equals", function (that, equals) {
-    equals = equals || Object.equals;
-    var i = 0;
-    var length = this.length;
-    var left;
-    var right;
+var _map = createCommonjsModule(function (module) {
 
-    if (this === that) {
-        return true;
-    }
-    if (!that || !Array.isArray(that)) {
-        return genericOrder.prototype.equals.call(this, that);
+
+
+var Map, GlobalMap, CollectionsMap;
+
+if((commonjsGlobal.Map !== void 0) && (typeof commonjsGlobal.Set.prototype.values === "function")) {
+
+    Map = module.exports = commonjsGlobal.Map,
+    GlobalMap = Map;
+    Map.Map = Map; // hack so require("map").Map will work in MontageJS
+
+    // use different strategies for making sets observable between Internet
+    // Explorer and other browsers.
+    var protoIsSupported = {}.__proto__ === Object.prototype,
+        map_makeObservable;
+
+    if (protoIsSupported) {
+        map_makeObservable = function () {
+            this.__proto__ = ChangeDispatchMap;
+        };
+    } else {
+        map_makeObservable = function () {
+            Object.defineProperties(this, observableSetProperties);
+        };
     }
 
-    if (length !== that.length) {
-        return false;
-    } else {
-        for (; i < length; ++i) {
-            if (i in this) {
-                if (!(i in that)) {
-                    return false;
+    Object.defineProperty(Map.prototype, "makeObservable", {
+        value: map_makeObservable,
+        writable: true,
+        configurable: true,
+        enumerable: false
+    });
+
+    //This is a no-op test in property-changes.js - PropertyChanges.prototype.makePropertyObservable, so might as well not pay the price every time....
+    Object.defineProperty(Map.prototype, "makePropertyObservable", {
+        value: function(){},
+        writable: true,
+        configurable: true,
+        enumerable: false
+    });
+
+
+    Map.prototype.constructClone = function (values) {
+        return new this.constructor(values);
+    };
+
+    Map.prototype.isMap = true;
+    Map.prototype.addEach = function (values) {
+        if (values && Object(values) === values) {
+            if (typeof values.forEach === "function") {
+                // copy map-alikes
+                if (values.isMap === true) {
+                    values.forEach(function (value, key) {
+                        this.set(key, value);
+                    }, this);
+                // iterate key value pairs of other iterables
+                } else {
+                    values.forEach(function (pair) {
+                        this.set(pair[0], pair[1]);
+                    }, this);
                 }
-                left = this[i];
-                right = that[i];
-                if (!equals(left, right)) {
-                    return false;
+            } else if (typeof values.length === "number") {
+                // Array-like objects that do not implement forEach, ergo,
+                // Arguments
+                for (var i = 0; i < values.length; i++) {
+                    this.add(values[i], i);
                 }
             } else {
-                if (i in that) {
-                    return false;
-                }
+                // copy other objects as map-alikes
+                Object.keys(values).forEach(function (key) {
+                    this.set(key, values[key]);
+                }, this);
+            }
+        } else if (values && typeof values.length === "number") {
+            // String
+            for (var i = 0; i < values.length; i++) {
+                this.add(values[i], i);
             }
         }
-    }
-    return true;
-});
-
-define("clone", function (depth, memo) {
-    if (depth == null) {
-        depth = Infinity;
-    } else if (depth === 0) {
         return this;
-    }
-    memo = memo || new weakMap$1();
-    if (memo.has(this)) {
-        return memo.get(this);
-    }
-    var clone = new Array(this.length);
-    memo.set(this, clone);
-    for (var i in this) {
-        clone[i] = Object.clone(this[i], depth - 1, memo);
-    }    return clone;
-});
+    };
 
-define("iterate", function (start, end) {
-    return new ArrayIterator(this, start, end);
-});
+    Map.prototype.add = function (value, key) {
+        return this.set(key, value);
+    };
 
-if(Array.prototype.spliceOne === void 0) {
-    define("spliceOne", function (index,itemToAdd) {
-        var len=this.length;
-        if (!len) { return }
-        if(arguments.length === 1) {
-            while (index<len) {
-                this[index] = this[index+1];
-                index++;
-            }
-            this.length--;
+    Map.prototype.reduce = function (callback, basis /*, thisp*/) {
+        var thisp = arguments[2];
+        this.forEach(function(value, key, map) {
+            basis = callback.call(thisp, basis, value, key, this);
+        });
+        return basis;
+    };
+
+    Map.prototype.reduceRight = function (callback, basis /*, thisp*/) {
+        var thisp = arguments[2];
+        var keysIterator = this.keys();
+        var size = this.size;
+        var reverseOrder = new Array(this.size);
+        var aKey, i = 0;
+        while ((aKey = keysIterator.next().value)) {
+            reverseOrder[--size] = aKey;
         }
-        else {
-            this[index] = itemToAdd;
+        while (i++ < size) {
+            basis = callback.call(thisp, basis, this.get(reverseOrder[i]), reverseOrder[i], this);
         }
-    });
-}
-
-define("Iterator", ArrayIterator);
-
-function ArrayIterator(array, start, end) {
-    this.array = array;
-    this.start = start == null ? 0 : start;
-    this.end = end;
-}
-
-ArrayIterator.prototype.__iterationObject = null;
-Object.defineProperty(ArrayIterator.prototype,"_iterationObject", {
-    get: function() {
-        return this.__iterationObject || (this.__iterationObject = { done: false, value:null});
-    }
-});
-
-ArrayIterator.prototype.next = function () {
-    if (this.start === (this.end == null ? this.array.length : this.end)) {
-        this._iterationObject.done = true;
-        this._iterationObject.value = void 0;
-    } else {
-        this._iterationObject.value = this.array[this.start++];
-    }
-    return this._iterationObject;
-};
+        return basis;
+    };
 
-/**
-    accepts a string; returns the string with regex metacharacters escaped.
-    the returned string can safely be used within a regex to match a literal
-    string. escaped characters are [, ], {, }, (, ), -, *, +, ?, ., \, ^, $,
-    |, #, [comma], and whitespace.
-*/
-if (!RegExp.escape) {
-    var special = /[-[\]{}()*+?.\\^$|,#\s]/g;
-    RegExp.escape = function (string) {
-        return string.replace(special, "\\$&");
+    Map.prototype.equals = function (that, equals) {
+        equals = equals || Object.equals;
+        if (this === that) {
+            return true;
+        } else if (that && typeof that.every === "function") {
+            return that.size === this.size && that.every(function (value, key) {
+                return equals(this.get(key), value);
+            }, this);
+        } else {
+            var keys = Object.keys(that);
+            return keys.length === this.size && Object.keys(that).every(function (key) {
+                return equals(this.get(key), that[key]);
+            }, this);
+        }
     };
-}
 
-var shimRegexp = /*#__PURE__*/Object.freeze({
-    __proto__: null
-});
+    var _keysArrayFunction = function(value,key) {return key;};
+    Map.prototype.keysArray = function() {
+        return this.map(_keysArrayFunction);
+    };
+    var _valuesArrayFunction = function(value,key) {return value;};
+    Map.prototype.valuesArray = function() {
+        return this.map(_valuesArrayFunction);
+    };
+    var _entriesArrayFunction = function(value,key) {return [key,value];};
+    Map.prototype.entriesArray = function() {
+        return this.map(_entriesArrayFunction);
+    };
+    Map.prototype.toJSON = function () {
+        return this.entriesArray();
+    };
 
-getCjsExportFromNamespace(shimRegexp);
+    // XXX deprecated
+    Map.prototype.items = function () {
+        return this.entriesArray();
+    };
 
-var genericSet = GenericSet;
-function GenericSet() {
-    throw new Error("Can't construct. GenericSet is a mixin.");
-}
+    // Map.prototype.contentEquals = Object.equals;
+    // Map.prototype.contentHash = Object.hash;
 
-GenericSet.prototype.isSet = true;
 
-GenericSet.prototype.union = function (that) {
-    var union =  this.constructClone(this);
-    union.addEach(that);
-    return union;
-};
+    Map.from = function (value) {
+        var result = new this;
+        result.addEach(value);
+        return result;
+    };
 
-GenericSet.prototype.intersection = function (that) {
-    return this.constructClone(this.filter(function (value) {
-        return that.has(value);
-    }));
-};
 
-GenericSet.prototype.difference = function (that) {
-    var union =  this.constructClone(this);
-    union.deleteEach(that);
-    return union;
-};
+    //Backward compatibility:
+    Object.defineProperty(Map.prototype,"length",{
+        get: function() {
+            return this.size;
+        },
+        enumerable: true,
+        configurable:true
+    });
 
-GenericSet.prototype.symmetricDifference = function (that) {
-    var union = this.union(that);
-    var intersection = this.intersection(that);
-    return union.difference(intersection);
-};
 
-GenericSet.prototype.deleteAll = function (value) {
-    // deleteAll is equivalent to delete for sets since they guarantee that
-    // only one value exists for an equivalence class, but deleteAll returns
-    // the count of deleted values instead of whether a value was deleted.
-    return +this["delete"](value);
-};
+    var map_clear = Map.prototype.clear,
+        map_set = Map.prototype.set,
+        map_delete = Map.prototype.delete;
 
-GenericSet.prototype.equals = function (that, equals) {
-    var self = this;
-    return (
-        that && typeof that.reduce === "function" &&
-        this.length === that.length &&
-        that.reduce(function (equal, value) {
-            return equal && self.has(value, equals);
-        }, true)
-    );
-};
+    var observableMapProperties = {
+        clear : {
+            value: function () {
+                var keys;
+                if (this.dispatchesMapChanges) {
+                    this.forEach(function (value, key) {
+                        this.dispatchBeforeMapChange(key, value);
+                    }, this);
+                    keys = this.keysArray();
+                }
+                map_clear.call(this);
+                if (this.dispatchesMapChanges) {
+                    keys.forEach(function (key) {
+                        this.dispatchMapChange(key);
+                    }, this);
+                }
+            },
+            writable: true,
+            configurable: true
 
-GenericSet.prototype.forEach = function (callback /*, thisp*/) {
-    var thisp = arguments[1];
-    return this.reduce(function (undefined$1, value, key, object, depth) {
-        //ECMASCRIPT Sets send value twice in callback to forEach
-        callback.call(thisp, value, value, object, depth);
-    }, undefined);
-};
+        },
+        set : {
+            value: function (key, value) {
+                var found = this.get(key);
+                if (found) { // update
+                    if (this.dispatchesMapChanges) {
+                        this.dispatchBeforeMapChange(key, found);
+                    }
 
+                    map_set.call(this,key, value);
 
-GenericSet.prototype.toJSON = function () {
-    return this.toArray();
-};
+                    if (this.dispatchesMapChanges) {
+                        this.dispatchMapChange(key, value);
+                    }
+                } else { // create
+                    if (this.dispatchesMapChanges) {
+                        this.dispatchBeforeMapChange(key, undefined);
+                    }
 
-// W3C DOMTokenList API overlap (does not handle variadic arguments)
+                    map_set.call(this,key, value);
 
-GenericSet.prototype.contains = function (value) {
-    return this.has(value);
-};
+                    if (this.dispatchesMapChanges) {
+                        this.dispatchMapChange(key, value);
+                    }
+                }
+                return this;
+            },
+            writable: true,
+            configurable: true
+        },
 
-GenericSet.prototype.remove = function (value) {
-    return this["delete"](value);
-};
+        "delete": {
+            value: function (key) {
+                if (this.has(key)) {
+                    if (this.dispatchesMapChanges) {
+                        this.dispatchBeforeMapChange(key, this.get(key));
+                    }
+                    map_delete.call(this,key);
 
-GenericSet.prototype.toggle = function (value) {
-    if (this.has(value)) {
-        this["delete"](value);
-    } else {
-        this.add(value);
-    }
-};
+                    if (this.dispatchesMapChanges) {
+                        this.dispatchMapChange(key, undefined);
+                    }
+                    return true;
+                }
+                return false;
+            }
+        }
+    };
 
-var _valuesArrayFunction = function(value,key) {return value;};
-GenericSet.prototype.valuesArray = function() {
-    return this.map(_valuesArrayFunction);
-};
-var _entriesArrayFunction = function(value,key) {return [key,value];};
-GenericSet.prototype.entriesArray = function() {
-    return this.map(_entriesArrayFunction);
-};
 
-var _list = List;
 
+    Object.addEach(Map.prototype, genericCollection.prototype, false);
 
+    var ChangeDispatchMap = Object.create(Map.prototype, observableMapProperties);
+}
 
+    var Set = _set.CollectionsSet;
+    
 
+    CollectionsMap = Map = function Map(values, equals, hash, getDefault) {
+        if (!(this instanceof Map)) {
+            return new Map(values, equals, hash, getDefault);
+        }
+        equals = equals || Object.equals;
+        hash = hash || Object.hash;
+        getDefault = getDefault || Function.noop;
+        this.contentEquals = equals;
+        this.contentHash = hash;
+        this.getDefault = getDefault;
+        this.store = new Set(
+            undefined,
+            function keysEqual(a, b) {
+                return equals(a.key, b.key);
+            },
+            function keyHash(item) {
+                return hash(item.key);
+            }
+        );
+        this.length = 0;
+        this.addEach(values);
+    };
 
-function List(values, equals, getDefault) {
-    return List._init(List, this, values, equals, getDefault);
-}
+    Map.Map = Map; // hack so require("map").Map will work in MontageJS
 
-List._init = function (constructor, object, values, equals, getDefault) {
-    if (!(object instanceof constructor)) {
-        return new constructor(values, equals, getDefault);
-    }
-    var head = object.head = new object.Node();
-    head.next = head;
-    head.prev = head;
-    object.contentEquals = equals || Object.equals;
-    object.getDefault = getDefault || Function.noop;
-    object.length = 0;
-    object.addEach(values);
-};
+    Object.addEach(Map.prototype, genericCollection.prototype);
+    Object.addEach(Map.prototype, genericMap.prototype); // overrides GenericCollection
+    Object.defineProperty(Map.prototype,"size",genericCollection._sizePropertyDescriptor);
 
-List.List = List; // hack so require("list").List will work in MontageJS
+    Map.from = genericCollection.from;
 
-Object.addEach(List.prototype, genericCollection.prototype);
-Object.addEach(List.prototype, genericOrder.prototype);
+    Map.prototype.constructClone = function (values) {
+        return new this.constructor(
+            values,
+            this.contentEquals,
+            this.contentHash,
+            this.getDefault
+        );
+    };
 
-List.from = genericCollection.from;
+    Map.prototype.log = function (charmap, logNode, callback, thisp) {
+        logNode = logNode || this.logNode;
+        this.store.log(charmap, function (node, log, logBefore) {
+            logNode(node.value.value, log, logBefore);
+        }, callback, thisp);
+    };
 
-List.prototype.constructClone = function (values) {
-    return new this.constructor(values, this.contentEquals, this.getDefault);
-};
+    Map.prototype.logNode = function (node, log) {
+        log(' key: ' + node.key);
+        log(' value: ' + node.value);
+    };
 
-List.prototype.find = function (value, equals, index) {
-    equals = equals || this.contentEquals;
-    var head = this.head;
-    var at = this.scan(index, head.next);
-    while (at !== head) {
-        if (equals(at.value, value)) {
-            return at;
-        }
-        at = at.next;
+    if(!GlobalMap) {
+        module.exports = CollectionsMap;
     }
-};
-
-List.prototype.findLast = function (value, equals, index) {
-    equals = equals || this.contentEquals;
-    var head = this.head;
-    var at = this.scan(index, head.prev);
-    while (at !== head) {
-        if (equals(at.value, value)) {
-            return at;
-        }
-        at = at.prev;
+    else {
+        module.exports = GlobalMap;
+        GlobalMap.CollectionsMap = CollectionsMap;
     }
-};
+});
 
-List.prototype.has = function (value, equals) {
-    return !!this.find(value, equals);
-};
+var changeDescriptor = createCommonjsModule(function (module) {
+/*
+    Copyright (c) 2016, Montage Studio Inc. All Rights Reserved.
+    3-Clause BSD License
+    https://github.com/montagejs/montage/blob/master/LICENSE.md
+*/
 
-List.prototype.get = function (value, equals) {
-    var found = this.find(value, equals);
-    if (found) {
-        return found.value;
-    }
-    return this.getDefault(value);
-};
 
-// LIFO (delete removes the most recently added equivalent value)
-List.prototype["delete"] = function (value, equals) {
-    var found = this.findLast(value, equals);
-    if (found) {
-        found["delete"]();
-        this.length--;
-        return true;
-    }
-    return false;
-};
 
-List.prototype.deleteAll = function (value, equals) {
-    equals = equals || this.contentEquals;
-    var head = this.head;
-    var at = head.next;
-    var count = 0;
-    while (at !== head) {
-        if (equals(value, at.value)) {
-            at["delete"]();
-            count++;
-        }
-        at = at.next;
-    }
-    this.length -= count;
-    return count;
+var ObjectChangeDescriptor = module.exports.ObjectChangeDescriptor = function ObjectChangeDescriptor(name) {
+    this.name = name;
+    this.isActive = false;
+    this._willChangeListeners = null;
+    this._changeListeners = null;
+	return this;
 };
 
-List.prototype.clear = function () {
-    this.head.next = this.head.prev = this.head;
-    this.length = 0;
-};
+Object.defineProperties(ObjectChangeDescriptor.prototype,{
+    name: {
+		value:null,
+		writable: true
+	},
+    isActive: {
+		value:false,
+		writable: true
+	},
+	_willChangeListeners: {
+		value:null,
+		writable: true
+	},
+	willChangeListeners: {
+		get: function() {
+			return this._willChangeListeners || (this._willChangeListeners = new this.willChangeListenersRecordConstructor(this.name));
+		}
+	},
+	_changeListeners: {
+		value:null,
+		writable: true
+	},
+    changeListeners: {
+		get: function() {
+			return this._changeListeners || (this._changeListeners = new this.changeListenersRecordConstructor(this.name));
+		}
+	},
+    changeListenersRecordConstructor: {
+        value: ChangeListenersRecord,
+        writable: true
+    },
+    willChangeListenersRecordConstructor: {
+        value: WillChangeListenersRecord,
+        writable: true
+    }
 
-List.prototype.add = function (value) {
-    var node = new this.Node(value);
-    return this._addNode(node);
-};
+});
 
-List.prototype._addNode = function (node) {
-    this.head.addBefore(node);
-    this.length++;
-    return true;
-};
+var ListenerGhost = module.exports.ListenerGhost = Object.create(null);
+var ChangeListenerSpecificHandlerMethodName = new _map();
 
-List.prototype.push = function () {
-    var head = this.head;
-    for (var i = 0; i < arguments.length; i++) {
-        var value = arguments[i];
-        var node = new this.Node(value);
-        head.addBefore(node);
+ module.exports.ChangeListenersRecord = ChangeListenersRecord;
+function ChangeListenersRecord(name) {
+    var specificHandlerMethodName = ChangeListenerSpecificHandlerMethodName.get(name);
+    if(!specificHandlerMethodName) {
+        specificHandlerMethodName = "handle";
+        specificHandlerMethodName += name;
+        specificHandlerMethodName += "Change";
+        ChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName);
     }
-    this.length += arguments.length;
-};
+    this._current = null;
+    this._current = null;
+    this.specificHandlerMethodName = specificHandlerMethodName;
+    return this;
+}
 
-List.prototype.unshift = function () {
-    var at = this.head;
-    for (var i = 0; i < arguments.length; i++) {
-        var value = arguments[i];
-        var node = new this.Node(value);
-        at.addAfter(node);
-        at = node;
-    }
-    this.length += arguments.length;
-};
+Object.defineProperties(ChangeListenersRecord.prototype,{
+    _current: {
+		value: null,
+		writable: true
+	},
+	current: {
+		get: function() {
+            // if(this._current) {
+            //     console.log(this.constructor.name," with ",this._current.length," listeners: ", this._current);
+            // }
+            return this._current;
+            //return this._current || (this._current = []);
+		},
+        set: function(value) {
+            this._current = value;
+        }
+	},
+    ListenerGhost: {
+        value:ListenerGhost,
+        writable: true
+    },
+    ghostCount: {
+        value:0,
+        writable: true
+    },
+    maxListenerGhostRatio: {
+        value:0.3,
+        writable: true
+    },
+    listenerGhostFilter: {
+        value: function listenerGhostFilter(value) {
+          return value !== this.ListenerGhost;
+      }
+    },
+    removeCurrentGostListenersIfNeeded: {
+        value: function() {
+            if(this._current && this.ghostCount/this._current.length>this.maxListenerGhostRatio) {
+                this.ghostCount = 0;
+                this._current = this._current.filter(this.listenerGhostFilter,this);
+            }
+            return this._current;
+        }
+    },
+    dispatchBeforeChange: {
+        value: false,
+        writable: true
+    },
+    genericHandlerMethodName: {
+		value: "handlePropertyChange",
+        writable: true
+	}
+});
 
-List.prototype._shouldPop = function () {
-    var value;
-    var head = this.head;
-    if (head.prev !== head) {
-        value = head.prev.value;
+module.exports.WillChangeListenersRecord = WillChangeListenersRecord;
+var WillChangeListenerSpecificHandlerMethodName = new _map();
+function WillChangeListenersRecord(name) {
+    var specificHandlerMethodName = WillChangeListenerSpecificHandlerMethodName.get(name);
+    if(!specificHandlerMethodName) {
+        specificHandlerMethodName = "handle";
+        specificHandlerMethodName += name;
+        specificHandlerMethodName += "WillChange";
+        WillChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName);
     }
-    return value;
-};
+    this.specificHandlerMethodName = specificHandlerMethodName;
+	return this;
+}
+WillChangeListenersRecord.prototype = new ChangeListenersRecord();
+WillChangeListenersRecord.prototype.constructor = WillChangeListenersRecord;
+WillChangeListenersRecord.prototype.genericHandlerMethodName = "handlePropertyWillChange";
+});
+var changeDescriptor_1 = changeDescriptor.ObjectChangeDescriptor;
+var changeDescriptor_2 = changeDescriptor.ListenerGhost;
+var changeDescriptor_3 = changeDescriptor.ChangeListenersRecord;
+var changeDescriptor_4 = changeDescriptor.WillChangeListenersRecord;
 
-List.prototype.pop = function (_before, _after) {
-    var value;
-    var head = this.head;
-    if (head.prev !== head) {
-        value = head.prev.value;
-        var index = this.length - 1;
-        var popDispatchValueArray = _before ? _before.call(this,value,index) : void 0;
-        head.prev['delete']();
-        this.length--;
-        _after ? _after.call(this,value,index, popDispatchValueArray) : void 0;
-    }
-    return value;
-};
+// Object property descriptors carry information necessary for adding,
+// removing, dispatching, and shorting events to listeners for property changes
+// for a particular key on a particular object.  These descriptors are used
+// here for shallow property changes.  The current listeners are the ones
+// modified by add and remove own property change listener methods.  During
+// property change dispatch, we capture a snapshot of the current listeners in
+// the active change listeners array.  The descriptor also keeps a memo of the
+// corresponding handler method names.
+//
+// {
+//     willChangeListeners:{current, active:Array<Function>, ...method names}
+//     changeListeners:{current, active:Array<Function>, ...method names}
+// }
 
-List.prototype.shift = function (_before, _after) {
-    var value;
-    var head = this.head;
-    if (head.prev !== head) {
-        value = head.next.value;
-        var dispatchValueArray = _before ? _before.call(this,value,0) : void 0;
-        head.next['delete']();
-        this.length--;
-        _after ? _after.call(this,value,0,dispatchValueArray) : void 0;
-    }
-    return value;
-};
+// Maybe remove entries from this table if the corresponding object no longer
+// has any property change listeners for any key.  However, the cost of
+// book-keeping is probably not warranted since it would be rare for an
+// observed object to no longer be observed unless it was about to be disposed
+// of or reused as an observable.  The only benefit would be in avoiding bulk
+// calls to dispatchOwnPropertyChange events on objects that have no listeners.
 
-List.prototype.peek = function () {
-    if (this.head !== this.head.next) {
-        return this.head.next.value;
-    }
-};
+//  To observe shallow property changes for a particular key of a particular
+//  object, we install a property descriptor on the object that overrides the previous
+//  descriptor.  The overridden descriptors are stored in this weak map.  The
+//  weak map associates an object with another object that maps property names
+//  to property descriptors.
+//
+//  object.__overriddenPropertyDescriptors__[key]
+//
+//  We retain the old descriptor for various purposes.  For one, if the property
+//  is no longer being observed by anyone, we revert the property descriptor to
+//  the original.  For "value" descriptors, we store the actual value of the
+//  descriptor on the overridden descriptor, so when the property is reverted, it
+//  retains the most recently set value.  For "get" and "set" descriptors,
+//  we observe then forward "get" and "set" operations to the original descriptor.
 
-List.prototype.poke = function (value) {
-    if (this.head !== this.head.next) {
-        this.head.next.value = value;
-    } else {
-        this.push(value);
-    }
-};
+var propertyChanges = PropertyChanges;
 
-List.prototype.one = function () {
-    return this.peek();
-};
+function PropertyChanges() {
+    throw new Error("This is an abstract interface. Mix it. Don't construct it");
+}
 
-// TODO
-// List.prototype.indexOf = function (value) {
-// };
 
-// TODO
-// List.prototype.lastIndexOf = function (value) {
-// };
 
-// an internal utility for coercing index offsets to nodes
-List.prototype.scan = function (at, fallback) {
-    var head = this.head;
-    if (typeof at === "number") {
-        var count = at;
-        if (count >= 0) {
-            at = head.next;
-            while (count) {
-                count--;
-                at = at.next;
-                if (at == head) {
-                    break;
-                }
-            }
-        } else {
-            at = head;
-            while (count < 0) {
-                count++;
-                at = at.prev;
-                if (at == head) {
-                    break;
-                }
-            }
-        }
-        return at;
-    } else {
-        return at || fallback;
-    }
-};
 
-// at and end may both be positive or negative numbers (in which cases they
-// correspond to numeric indicies, or nodes)
-List.prototype.slice = function (at, end) {
-    var sliced = [];
-    var head = this.head;
-    at = this.scan(at, head.next);
-    end = this.scan(end, head);
+var ObjectChangeDescriptor = changeDescriptor.ObjectChangeDescriptor,
+    ListenerGhost = changeDescriptor.ListenerGhost;
+
+PropertyChanges.debug = true;
+
+var ObjectsPropertyChangeListeners = new weakMap$1();
+
+var ObjectChangeDescriptorName = new _map();
 
-    while (at !== end && at !== head) {
-        sliced.push(at.value);
-        at = at.next;
-    }
+PropertyChanges.ObjectChangeDescriptor = function() {
 
-    return sliced;
 };
 
-List.prototype.splice = function (at, length /*...plus*/) {
-    return this.swap(at, length, Array.prototype.slice.call(arguments, 2));
+PropertyChanges.prototype.getOwnPropertyChangeDescriptor = function (key) {
+    var objectPropertyChangeDescriptors = ObjectsPropertyChangeListeners.get(this), keyChangeDescriptor;
+    if (!objectPropertyChangeDescriptors) {
+        objectPropertyChangeDescriptors = Object.create(null);
+        ObjectsPropertyChangeListeners.set(this,objectPropertyChangeDescriptors);
+    }
+    if ( (keyChangeDescriptor = objectPropertyChangeDescriptors[key]) === void 0) {
+        var propertyName = ObjectChangeDescriptorName.get(key);
+        if(!propertyName) {
+            propertyName = String(key);
+            propertyName = propertyName && propertyName[0].toUpperCase() + propertyName.slice(1);
+            ObjectChangeDescriptorName.set(key,propertyName);
+        }
+        return objectPropertyChangeDescriptors[key] = new ObjectChangeDescriptor(propertyName);
+    }
+    else return keyChangeDescriptor;
 };
 
-List.prototype.swap = function (start, length, plus, _before, _after) {
-    var initial = start;
-    // start will be head if start is null or -1 (meaning from the end), but
-    // will be head.next if start is 0 (meaning from the beginning)
-    start = this.scan(start, this.head);
-    if (length == null) {
-        length = Infinity;
+PropertyChanges.prototype.hasOwnPropertyChangeDescriptor = function (key) {
+    var objectPropertyChangeDescriptors = ObjectsPropertyChangeListeners.get(this);
+    if (!objectPropertyChangeDescriptors) {
+        return false;
     }
-    plus = Array.from(plus);
+    if (!key) {
+        return true;
+    }
+    if (objectPropertyChangeDescriptors[key] === void 0) {
+        return false;
+    }
+    return true;
+};
 
-    // collect the minus array
-    var minus = [];
-    var at = start;
-    while (length-- && length >= 0 && at !== this.head) {
-        minus.push(at.value);
-        at = at.next;
+PropertyChanges.prototype.addOwnPropertyChangeListener = function (key, listener, beforeChange) {
+    if (this.makeObservable && !this.isObservable) {
+        this.makeObservable(); // particularly for observable arrays, for
+        // their length property
     }
+    var descriptor = PropertyChanges.getOwnPropertyChangeDescriptor(this, key),
+        listeners = beforeChange ? descriptor.willChangeListeners : descriptor.changeListeners;
 
-    // before range change
-    var index;
-    index = _before ? _before.call(this, start, plus, minus) : void 0;
+    PropertyChanges.makePropertyObservable(this, key);
 
-    // delete minus
-    var at = start;
-    for (var i = 0, at = start; i < minus.length; i++, at = at.next) {
-        at["delete"]();
+    if(!listeners._current) {
+        listeners._current = listener;
     }
-    // add plus
-    if (initial == null && at === this.head) {
-        at = this.head.next;
+    else if(!Array.isArray(listeners._current)) {
+        listeners._current = [listeners._current,listener];
     }
-    for (var i = 0; i < plus.length; i++) {
-        var node = new this.Node(plus[i]);
-        at.addBefore(node);
+    else {
+        listeners._current.push(listener);
     }
-    // adjust length
-    this.length += plus.length - minus.length;
-
-    _after ? _after.call(this, start, plus, minus) : void 0;
 
-    return minus;
+    var self = this;
+    return function cancelOwnPropertyChangeListener() {
+        PropertyChanges.removeOwnPropertyChangeListener(self, key, listener, beforeChange);
+        self = null;
+    };
 };
 
-List.prototype.reverse = function () {
-    var at = this.head;
-    do {
-        var temp = at.next;
-        at.next = at.prev;
-        at.prev = temp;
-        at = at.next;
-    } while (at !== this.head);
-    return this;
+PropertyChanges.prototype.addBeforeOwnPropertyChangeListener = function (key, listener) {
+    return PropertyChanges.addOwnPropertyChangeListener(this, key, listener, true);
 };
 
-List.prototype.sort = function () {
-    this.swap(0, this.length, this.sorted.apply(this, arguments));
-};
+PropertyChanges.prototype.removeOwnPropertyChangeListener = function removeOwnPropertyChangeListener(key, listener, beforeChange) {
+    var descriptor = PropertyChanges.getOwnPropertyChangeDescriptor(this, key);
 
-// TODO account for missing basis argument
-List.prototype.reduce = function (callback, basis /*, thisp*/) {
-    var thisp = arguments[2];
-    var head = this.head;
-    var at = head.next;
-    while (at !== head) {
-        basis = callback.call(thisp, basis, at.value, at, this);
-        at = at.next;
+    var listeners;
+    if (beforeChange) {
+        listeners = descriptor._willChangeListeners;
+    } else {
+        listeners = descriptor._changeListeners;
     }
-    return basis;
-};
 
-List.prototype.reduceRight = function (callback, basis /*, thisp*/) {
-    var thisp = arguments[2];
-    var head = this.head;
-    var at = head.prev;
-    while (at !== head) {
-        basis = callback.call(thisp, basis, at.value, at, this);
-        at = at.prev;
-    }
-    return basis;
-};
+    if(listeners) {
+        if(listeners._current) {
+            if(listeners._current === listener) {
+                listeners._current = null;
+            }
+            else {
 
-List.prototype.updateIndexes = function (node, index) {
-    while (node !== this.head) {
-        node.index = index++;
-        node = node.next;
+                var index = listeners._current.lastIndexOf(listener);
+                if (index === -1) {
+                    throw new Error("Can't remove property change listener: does not exist: property name" + JSON.stringify(key));
+                }
+                if(descriptor.isActive) {
+                    listeners.ghostCount = listeners.ghostCount+1;
+                    listeners._current[index]=removeOwnPropertyChangeListener.ListenerGhost;
+                }
+                else {
+                    listeners._current.spliceOne(index);
+                }
+            }
+        }
     }
 };
+PropertyChanges.prototype.removeOwnPropertyChangeListener.ListenerGhost = ListenerGhost;
 
-
-List.prototype.iterate = function () {
-    return new ListIterator(this.head);
+PropertyChanges.prototype.removeBeforeOwnPropertyChangeListener = function (key, listener) {
+    return PropertyChanges.removeOwnPropertyChangeListener(this, key, listener, true);
 };
 
-function ListIterator(head) {
-    this.head = head;
-    this.at = head.next;
-}
-ListIterator.prototype.__iterationObject = null;
-Object.defineProperty(ListIterator.prototype,"_iterationObject", {
-    get: function() {
-        return this.__iterationObject || (this.__iterationObject = { done: false, value:null});
-    }
-});
-
+PropertyChanges.prototype.dispatchOwnPropertyChange = function dispatchOwnPropertyChange(key, value, beforeChange) {
+    var descriptor = PropertyChanges.getOwnPropertyChangeDescriptor(this, key),
+        listeners;
 
-ListIterator.prototype.next = function () {
-    if (this.at === this.head) {
-        this._iterationObject.done = true;
-        this._iterationObject.value = void 0;
-    } else {
-        var value = this.at.value;
-        this.at = this.at.next;
-        this._iterationObject.value = value;
+    if (!descriptor.isActive) {
+        descriptor.isActive = true;
+        listeners = beforeChange ? descriptor._willChangeListeners: descriptor._changeListeners;
+        try {
+            dispatchOwnPropertyChange.dispatchEach(listeners, key, value, this);
+        } finally {
+            descriptor.isActive = false;
+        }
     }
-    return this._iterationObject;
 };
+PropertyChanges.prototype.dispatchOwnPropertyChange.dispatchEach = dispatchEach;
 
-List.prototype.Node = Node;
-
-function Node(value) {
-    this.value = value;
-    this.prev = null;
-    this.next = null;
-}
-Node.prototype["delete"] = function () {
-    this.prev.next = this.next;
-    this.next.prev = this.prev;
-};
+function dispatchEach(listeners, key, value, object) {
+    if(listeners && listeners._current) {
+        // copy snapshot of current listeners to active listeners
+        var current,
+            listener,
+            i,
+            countI,
+            thisp,
+            specificHandlerMethodName = listeners.specificHandlerMethodName,
+            genericHandlerMethodName = listeners.genericHandlerMethodName,
+            Ghost = ListenerGhost;
 
-Node.prototype.addBefore = function (node) {
-    var prev = this.prev;
-    this.prev = node;
-    node.prev = prev;
-    prev.next = node;
-    node.next = this;
-};
+        if(Array.isArray(listeners._current)) {
+            //removeGostListenersIfNeeded returns listeners.current or a new filtered one when conditions are met
+            current = listeners.removeCurrentGostListenersIfNeeded();
+            //We use a for to guarantee we won't dispatch to listeners that would be added after we started
+            for(i=0, countI = current.length;i<countI;i++) {
+                if ((thisp = current[i]) !== Ghost) {
+                    //This is fixing the issue causing a regression in Montage's repetition
+                    listener = (
+                        thisp[specificHandlerMethodName] ||
+                        thisp[genericHandlerMethodName] ||
+                        thisp
+                    );
+                    if (!listener.call) {
+                        throw new Error("No event listener for " + listeners.specificHandlerName + " or " + listeners.genericHandlerName + " or call on " + listener);
+                    }
+                    listener.call(thisp, value, key, object);
+                }
+            }
+        }
+        else {
+            thisp = listeners._current;
+            listener = (
+                thisp[specificHandlerMethodName] ||
+                thisp[genericHandlerMethodName] ||
+                thisp
+            );
+            if (!listener.call) {
+                throw new Error("No event listener for " + listeners.specificHandlerName + " or " + listeners.genericHandlerName + " or call on " + listener);
+            }
+            listener.call(thisp, value, key, object);
+        }
 
-Node.prototype.addAfter = function (node) {
-    var next = this.next;
-    this.next = node;
-    node.next = next;
-    next.prev = node;
-    node.prev = this;
-};
+    }
+}
 
-var iterator = Iterator;
+dispatchEach.ListenerGhost = ListenerGhost;
 
 
+PropertyChanges.prototype.dispatchBeforeOwnPropertyChange = function (key, listener) {
+    return PropertyChanges.dispatchOwnPropertyChange(this, key, listener, true);
+};
 
+var ObjectsOverriddenPropertyDescriptors = new weakMap$1(),
+    Objects__state__ = new weakMap$1(),
+    propertyListener = {
+        get: void 0,
+        set: void 0,
+        configurable: true,
+        enumerable: false
+    };
 
-// upgrades an iterable to a Iterator
-function Iterator(iterable, standardMode) {
+PropertyChanges.prototype.makePropertyObservable = function (key) {
+    // arrays are special.  we do not support direct setting of properties
+    // on an array.  instead, call .set(index, value).  this is observable.
+    // 'length' property is observable for all mutating methods because
+    // our overrides explicitly dispatch that change.
 
-    /*
-        standardMode should be passed as true by a collection that uses Iterator
-        to provide a polyfill of standard iterations methods like entries() and values(),
-        as Collection's iterator behaves differently than standards ones when it comes to sparse arrays.
-        without passing standardMode, new Iterator instances will behave as intended independently of standards.
-    */
-    var values = standardMode && iterable && iterable.values && iterable.values();
-    if(values && typeof values.next === "function" ) {
-        return values;
+
+    var overriddenPropertyDescriptors = ObjectsOverriddenPropertyDescriptors.get(this);
+    if (overriddenPropertyDescriptors && overriddenPropertyDescriptors.get(key) !== void 0) {
+        // if we have already recorded an overridden property descriptor,
+        // we have already installed the observer, so short-here
+        return;
     }
 
-    if (!(this instanceof Iterator)) {
-        return new Iterator(iterable);
+    // memoize overridden property descriptor table
+    if (!overriddenPropertyDescriptors) {
+        if (Array.isArray(this)) {
+            return;
+        }
+        if (!Object.isExtensible(this)) {
+            throw new Error("Can't make property " + JSON.stringify(key) + " observable on " + this + " because object is not extensible");
+        }
+        overriddenPropertyDescriptors = new _map();
+        ObjectsOverriddenPropertyDescriptors.set(this,overriddenPropertyDescriptors);
     }
 
-    if (Array.isArray(iterable) || typeof iterable === "string")
-        return Iterator.iterate(iterable);
+    // var state = Objects__state__.get(this);
+    // if (typeof state !== "object") {
+    //     Objects__state__.set(this,(state = {}));
+    // }
+    // state[key] = this[key];
 
-    iterable = shimObject(iterable);
 
-    if (iterable instanceof Iterator) {
-        return iterable;
-    } else if (iterable.next) {
-        this.next = function () {
-            return iterable.next();
-        };
-    } else if (iterable.iterate) {
-        var iterator = iterable.iterate();
-        this.next = function () {
-            return iterator.next();
+
+    // walk up the prototype chain to find a property descriptor for
+    // the property name
+    var overriddenDescriptor;
+    var attached = this;
+    do {
+        overriddenDescriptor = Object.getOwnPropertyDescriptor(attached, key);
+        if (overriddenDescriptor) {
+            break;
+        }
+        attached = Object.getPrototypeOf(attached);
+    } while (attached);
+    // or default to an undefined value
+    if (!overriddenDescriptor) {
+        overriddenDescriptor = {
+            value: void 0,
+            enumerable: true,
+            writable: true,
+            configurable: true
         };
-    } else if (shimObject.prototype.toString.call(iterable) === "[object Function]") {
-        this.next = iterable;
     } else {
-        throw new TypeError("Can't iterate " + iterable);
+        if (!overriddenDescriptor.configurable) {
+            return;
+        }
+        if (!overriddenDescriptor.writable && !overriddenDescriptor.set) {
+            return;
+        }
     }
 
-}
+    // memoize the descriptor so we know not to install another layer,
+    // and so we can reuse the overridden descriptor when uninstalling
+    overriddenPropertyDescriptors.set(key,overriddenDescriptor);
 
-Iterator.prototype.forEach = genericCollection.prototype.forEach;
-Iterator.prototype.map = genericCollection.prototype.map;
-Iterator.prototype.filter = genericCollection.prototype.filter;
-Iterator.prototype.every = genericCollection.prototype.every;
-Iterator.prototype.some = genericCollection.prototype.some;
-Iterator.prototype.any = genericCollection.prototype.any;
-Iterator.prototype.all = genericCollection.prototype.all;
-Iterator.prototype.min = genericCollection.prototype.min;
-Iterator.prototype.max = genericCollection.prototype.max;
-Iterator.prototype.sum = genericCollection.prototype.sum;
-Iterator.prototype.average = genericCollection.prototype.average;
-Iterator.prototype.flatten = genericCollection.prototype.flatten;
-Iterator.prototype.zip = genericCollection.prototype.zip;
-Iterator.prototype.enumerate = genericCollection.prototype.enumerate;
-Iterator.prototype.sorted = genericCollection.prototype.sorted;
-Iterator.prototype.group = genericCollection.prototype.group;
-Iterator.prototype.reversed = genericCollection.prototype.reversed;
-Iterator.prototype.toArray = genericCollection.prototype.toArray;
-Iterator.prototype.toObject = genericCollection.prototype.toObject;
-Iterator.prototype.iterator = genericCollection.prototype.iterator;
 
-Iterator.prototype.__iterationObject = null;
-shimObject.defineProperty(Iterator.prototype,"_iterationObject", {
-    get: function() {
-        return this.__iterationObject || (this.__iterationObject = { done: false, value:void 0});
-    }
-});
+    // TODO reflect current value on a displayed property
+
+    // in both of these new descriptor variants, we reuse the overridden
+    // descriptor to either store the current value or apply getters
+    // and setters.  this is handy since we can reuse the overridden
+    // descriptor if we uninstall the observer.  We even preserve the
+    // assignment semantics, where we get the value from up the
+    // prototype chain, and set as an owned property.
+    if ('value' in overriddenDescriptor) {
+        propertyListener.get = function dispatchingGetter() {
+            return dispatchingGetter.overriddenDescriptor.value;
+        };
+        propertyListener.set = function dispatchingSetter(value) {
+            var descriptor,
+                isActive,
+                overriddenDescriptor = dispatchingSetter.overriddenDescriptor;
 
+            if (value !== overriddenDescriptor.value) {
+                if (!(isActive = (descriptor = dispatchingSetter.descriptor).isActive)) {
+                    descriptor.isActive = true;
+                    try {
+                        dispatchingSetter.dispatchEach(descriptor._willChangeListeners, dispatchingSetter.key, overriddenDescriptor.value, this);
+                    } finally {}
+                }
+                overriddenDescriptor.value = value;
+                if (!isActive) {
+                    try {
+                        dispatchingSetter.dispatchEach(descriptor._changeListeners, dispatchingSetter.key, value, this);
+                    } finally {
+                        descriptor.isActive = false;
+                    }
+                }
+            }
+        };
+        propertyListener.set.dispatchEach = dispatchEach;
+        propertyListener.set.key = key;
+        propertyListener.get.overriddenDescriptor = propertyListener.set.overriddenDescriptor = overriddenDescriptor;
+        propertyListener.set.descriptor = ObjectsPropertyChangeListeners.get(this)[key];
 
-// this is a bit of a cheat so flatten and such work with the generic
-// reducible
-Iterator.prototype.constructClone = function (values) {
-    var clone = [];
-    clone.addEach(values);
-    return clone;
-};
+        propertyListener.enumerable = overriddenDescriptor.enumerable;
 
-Iterator.prototype.mapIterator = function (callback /*, thisp*/) {
-    var self = Iterator(this),
-        thisp = arguments[1],
-        i = 0;
+        propertyListener.configurable = true;
 
-    if (shimObject.prototype.toString.call(callback) != "[object Function]")
-        throw new TypeError();
+    } else { // 'get' or 'set', but not necessarily both
+            propertyListener.get = overriddenDescriptor.get;
+            propertyListener.set = function dispatchingSetter() {
+                var formerValue = dispatchingSetter.overriddenGetter.call(this),
+                    descriptor,
+                    isActive,
+                    newValue;
 
-    return new self.constructor(function () {
-        if(self._iterationObject.done !== true) {
-            var callbackValue = callback.call(thisp, self.next().value, i++, self);
-            self._iterationObject.value = callbackValue;
-        }
-        return self._iterationObject;
-    });
-};
 
-Iterator.prototype.filterIterator = function (callback /*, thisp*/) {
-    var self = Iterator(this),
-        thisp = arguments[1],
-        i = 0;
+                    if(arguments.length === 1) {
+                        dispatchingSetter.overriddenSetter.call(this,arguments[0]);
+                    }
+                    else if(arguments.length === 2) {
+                        dispatchingSetter.overriddenSetter.call(this,arguments[0],arguments[1]);
+                    }
+                    else {
+                        dispatchingSetter.overriddenSetter.apply(this, arguments);
+                    }
 
-    if (shimObject.prototype.toString.call(callback) != "[object Function]")
-        throw new TypeError();
+                if ((newValue = dispatchingSetter.overriddenGetter.call(this)) !== formerValue) {
+                    descriptor = dispatchingSetter.descriptor;
+                    if (!(isActive = descriptor.isActive)) {
+                        descriptor.isActive = true;
+                        try {
+                            dispatchingSetter.dispatchEach(descriptor._willChangeListeners, key, formerValue, this);
+                        } finally {}
+                    }
+                    if (!isActive) {
+                        try {
+                            dispatchingSetter.dispatchEach(descriptor._changeListeners, key, newValue, this);
+                        } finally {
+                            descriptor.isActive = false;
+                        }
+                    }
+                }
+            };
+            propertyListener.enumerable = overriddenDescriptor.enumerable;
+            propertyListener.configurable = true;
+        propertyListener.set.dispatchEach = dispatchEach;
+        propertyListener.set.overriddenSetter = overriddenDescriptor.set;
+        propertyListener.set.overriddenGetter = overriddenDescriptor.get;
+        propertyListener.set.descriptor = ObjectsPropertyChangeListeners.get(this)[key];
+    }
 
-    return new self.constructor(function () {
-        var nextEntry;
-        while (true) {
-            nextEntry = self.next();
-            if(nextEntry.done !== true) {
-                if (callback.call(thisp, nextEntry.value, i++, self))
-                    return nextEntry;
-            }
-            else {
-                //done true and value undefined at this point
-                return nextEntry;
-            }
-        }
-    });
+    Object.defineProperty(this, key, propertyListener);
 };
 
-Iterator.prototype.reduce = function (callback /*, initial, thisp*/) {
-    var self = Iterator(this),
-        result = arguments[1],
-        thisp = arguments[2],
-        i = 0,
-        nextEntry;
+// constructor functions
+
+PropertyChanges.getOwnPropertyChangeDescriptor = function (object, key) {
+    if (object.getOwnPropertyChangeDescriptor) {
+        return object.getOwnPropertyChangeDescriptor(key);
+    } else {
+        return PropertyChanges.prototype.getOwnPropertyChangeDescriptor.call(object, key);
+    }
+};
 
-    if (shimObject.prototype.toString.call(callback) != "[object Function]")
-        throw new TypeError();
+PropertyChanges.hasOwnPropertyChangeDescriptor = function (object, key) {
+    if (object.hasOwnPropertyChangeDescriptor) {
+        return object.hasOwnPropertyChangeDescriptor(key);
+    } else {
+        return PropertyChanges.prototype.hasOwnPropertyChangeDescriptor.call(object, key);
+    }
+};
 
-    // first iteration unrolled
-    nextEntry = self.next();
-    if(nextEntry.done === true) {
-        if (arguments.length > 1) {
-            return arguments[1]; // initial
-        } else {
-            throw TypeError("cannot reduce a value from an empty iterator with no initial value");
-        }
+PropertyChanges.addOwnPropertyChangeListener = function (object, key, listener, beforeChange) {
+    if (Object.isObject(object)) {
+        return object.addOwnPropertyChangeListener
+            ? object.addOwnPropertyChangeListener(key, listener, beforeChange)
+            : this.prototype.addOwnPropertyChangeListener.call(object, key, listener, beforeChange);
     }
-    if (arguments.length > 1) {
-        result = callback.call(thisp, result, nextEntry.value, i, self);
+};
+
+PropertyChanges.removeOwnPropertyChangeListener = function (object, key, listener, beforeChange) {
+    if (!Object.isObject(object)) ; else if (object.removeOwnPropertyChangeListener) {
+        return object.removeOwnPropertyChangeListener(key, listener, beforeChange);
     } else {
-        result = nextEntry.value;
+        return PropertyChanges.prototype.removeOwnPropertyChangeListener.call(object, key, listener, beforeChange);
     }
-    i++;
-    // remaining entries
-    while (true) {
-        nextEntry = self.next();
-        if(nextEntry.done === true) {
-            return result;
-        }
-        result = callback.call(thisp, result, nextEntry.value, i, self);
-        i++;
+};
+
+PropertyChanges.dispatchOwnPropertyChange = function (object, key, value, beforeChange) {
+    if (!Object.isObject(object)) ; else if (object.dispatchOwnPropertyChange) {
+        return object.dispatchOwnPropertyChange(key, value, beforeChange);
+    } else {
+        return PropertyChanges.prototype.dispatchOwnPropertyChange.call(object, key, value, beforeChange);
     }
+};
 
+PropertyChanges.addBeforeOwnPropertyChangeListener = function (object, key, listener) {
+    return PropertyChanges.addOwnPropertyChangeListener(object, key, listener, true);
 };
 
-Iterator.prototype.concat = function () {
-    return Iterator.concat(
-        Array.prototype.concat.apply(this, arguments)
-    );
+PropertyChanges.removeBeforeOwnPropertyChangeListener = function (object, key, listener) {
+    return PropertyChanges.removeOwnPropertyChangeListener(object, key, listener, true);
 };
 
-Iterator.prototype.dropWhile = function (callback /*, thisp */) {
-    var self = Iterator(this),
-        thisp = arguments[1],
-        stopped = false,
-        stopValue,
-        nextEntry,
-        i = 0;
+PropertyChanges.dispatchBeforeOwnPropertyChange = function (object, key, value) {
+    return PropertyChanges.dispatchOwnPropertyChange(object, key, value, true);
+};
 
-    if (shimObject.prototype.toString.call(callback) != "[object Function]")
-        throw new TypeError();
+PropertyChanges.makePropertyObservable = function (object, key) {
+    if (object.makePropertyObservable) {
+        return object.makePropertyObservable(key);
+    } else {
+        return PropertyChanges.prototype.makePropertyObservable.call(object, key);
+    }
+};
 
-    while (true) {
-        nextEntry = self.next();
-        if(nextEntry.done === true) {
-            break;
-        }
-        if (!callback.call(thisp, nextEntry.value, i, self)) {
-            stopped = true;
-            stopValue = nextEntry.value;
-            break;
-        }
-        i++;
+var ObjectChangeDescriptor$1 = changeDescriptor.ObjectChangeDescriptor,
+    ChangeListenersRecord = changeDescriptor.ChangeListenersRecord,
+    ListenerGhost$1 = changeDescriptor.ListenerGhost;
+
+var mapChanges = MapChanges;
+function MapChanges() {
+    throw new Error("Can't construct. MapChanges is a mixin.");
+}
+
+/*
+    Object map change descriptors carry information necessary for adding,
+    removing, dispatching, and shorting events to listeners for map changes
+    for a particular key on a particular object.  These descriptors are used
+    here for shallow map changes.
+
+    {
+        willChangeListeners:Array(Fgunction)
+        changeListeners:Array(Function)
     }
+*/
 
-    if (stopped) {
-        return self.constructor([stopValue]).concat(self);
-    } else {
-        return self.constructor([]);
+var mapChangeDescriptors = new weakMap$1();
+
+function MapChangeDescriptor(name) {
+    this.name = name;
+    this.isActive = false;
+    this._willChangeListeners = null;
+    this._changeListeners = null;
+}
+MapChangeDescriptor.prototype = new ObjectChangeDescriptor$1();
+MapChangeDescriptor.prototype.constructor = MapChangeDescriptor;
+
+MapChangeDescriptor.prototype.changeListenersRecordConstructor = MapChangeListenersRecord;
+MapChangeDescriptor.prototype.willChangeListenersRecordConstructor = MapWillChangeListenersRecord;
+
+var MapChangeListenersSpecificHandlerMethodName = new _map();
+
+function MapChangeListenersRecord(name) {
+    var specificHandlerMethodName = MapChangeListenersSpecificHandlerMethodName.get(name);
+    if(!specificHandlerMethodName) {
+        specificHandlerMethodName = "handle";
+        specificHandlerMethodName += name.slice(0, 1).toUpperCase();
+        specificHandlerMethodName += name.slice(1);
+        specificHandlerMethodName += "MapChange";
+        MapChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName);
     }
-};
+    this.specificHandlerMethodName = specificHandlerMethodName;
+	return this;
+}
+MapChangeListenersRecord.prototype = new ChangeListenersRecord();
+MapChangeListenersRecord.prototype.constructor = MapChangeListenersRecord;
+MapChangeListenersRecord.prototype.genericHandlerMethodName = "handleMapChange";
 
-Iterator.prototype.takeWhile = function (callback /*, thisp*/) {
-    var self = Iterator(this),
-        thisp = arguments[1],
-        i = 0;
+var MapWillChangeListenersSpecificHandlerMethodName = new _map();
 
-    if (shimObject.prototype.toString.call(callback) != "[object Function]")
-        throw new TypeError();
+function MapWillChangeListenersRecord(name) {
+    var specificHandlerMethodName = MapWillChangeListenersSpecificHandlerMethodName.get(name);
+    if(!specificHandlerMethodName) {
+        specificHandlerMethodName = "handle";
+        specificHandlerMethodName += name.slice(0, 1).toUpperCase();
+        specificHandlerMethodName += name.slice(1);
+        specificHandlerMethodName += "MapWillChange";
+        MapWillChangeListenersSpecificHandlerMethodName.set(name,specificHandlerMethodName);
+    }
+    this.specificHandlerMethodName = specificHandlerMethodName;
+    return this;
+}
+MapWillChangeListenersRecord.prototype = new ChangeListenersRecord();
+MapWillChangeListenersRecord.prototype.constructor = MapWillChangeListenersRecord;
+MapWillChangeListenersRecord.prototype.genericHandlerMethodName = "handleMapWillChange";
 
-    return new self.constructor(function () {
-        if(self._iterationObject.done !== true) {
-            var value = self.next().value;
-            if(callback.call(thisp, value, i++, self)) {
-                self._iterationObject.value = value;
-            }
-            else {
-                self._iterationObject.done = true;
-                self._iterationObject.value = void 0;
-            }
-        }
-        return self._iterationObject;
-    });
 
+MapChanges.prototype.getAllMapChangeDescriptors = function () {
+    if (!mapChangeDescriptors.has(this)) {
+        mapChangeDescriptors.set(this, new _map());
+    }
+    return mapChangeDescriptors.get(this);
 };
 
-Iterator.prototype.zipIterator = function () {
-    return Iterator.unzip(
-        Array.prototype.concat.apply(this, arguments)
-    );
+MapChanges.prototype.getMapChangeDescriptor = function (token) {
+    var tokenChangeDescriptors = this.getAllMapChangeDescriptors();
+    token = token || "";
+    if (!tokenChangeDescriptors.has(token)) {
+        tokenChangeDescriptors.set(token, new MapChangeDescriptor(token));
+    }
+    return tokenChangeDescriptors.get(token);
 };
 
-Iterator.prototype.enumerateIterator = function (start) {
-    return Iterator.count(start).zipIterator(this);
-};
+var ObjectsDispatchesMapChanges = new weakMap$1(),
+    dispatchesMapChangesGetter = function() {
+        return ObjectsDispatchesMapChanges.get(this);
+    },
+    dispatchesMapChangesSetter = function(value) {
+        return ObjectsDispatchesMapChanges.set(this,value);
+    },
+    dispatchesChangesMethodName = "dispatchesMapChanges",
+    dispatchesChangesPropertyDescriptor = {
+        get: dispatchesMapChangesGetter,
+        set: dispatchesMapChangesSetter,
+        configurable: true,
+        enumerable: false
+    };
 
-// creates an iterator for Array and String
-Iterator.iterate = function (iterable) {
-    var start;
-    start = 0;
-    return new Iterator(function () {
-        // advance to next owned entry
-        if (typeof iterable === "object") {
-            while (!(start in iterable)) {
-                // deliberately late bound
-                if (start >= iterable.length) {
-                    this._iterationObject.done = true;
-                    this._iterationObject.value = void 0;
-                    break;
-                }
-                else start += 1;
-            }
-        } else if (start >= iterable.length) {
-            this._iterationObject.done = true;
-            this._iterationObject.value = void 0;
-        }
+MapChanges.prototype.addMapChangeListener = function addMapChangeListener(listener, token, beforeChange) {
+    //console.log("this:",this," addMapChangeListener(",listener,",",token,",",beforeChange);
 
-        if(!this._iterationObject.done) {
-            this._iterationObject.value = iterable[start];
-            start += 1;
+    if (!this.isObservable && this.makeObservable) {
+        // for Array
+        this.makeObservable();
+    }
+    var descriptor = this.getMapChangeDescriptor(token);
+    var listeners;
+    if (beforeChange) {
+        listeners = descriptor.willChangeListeners;
+    } else {
+        listeners = descriptor.changeListeners;
+    }
+
+    // console.log("addMapChangeListener()",listener, token);
+    //console.log("this:",this," addMapChangeListener()  listeners._current is ",listeners._current);
+
+    if(!listeners._current) {
+        listeners._current = listener;
+    }
+    else if(!Array.isArray(listeners._current)) {
+        listeners._current = [listeners._current,listener];
+    }
+    else {
+        listeners._current.push(listener);
+    }
+
+    if(Object.getOwnPropertyDescriptor((this.__proto__||Object.getPrototypeOf(this)),dispatchesChangesMethodName) === void 0) {
+        Object.defineProperty((this.__proto__||Object.getPrototypeOf(this)), dispatchesChangesMethodName, dispatchesChangesPropertyDescriptor);
+    }
+    this.dispatchesMapChanges = true;
+
+    var self = this;
+    return function cancelMapChangeListener() {
+        if (!self) {
+            // TODO throw new Error("Can't remove map change listener again");
+            return;
         }
-        return this._iterationObject;
-    });
+        self.removeMapChangeListener(listener, token, beforeChange);
+        self = null;
+    };
 };
 
-Iterator.cycle = function (cycle, times) {
-    var next;
-    if (arguments.length < 2)
-        times = Infinity;
-    //cycle = Iterator(cycle).toArray();
-    return new Iterator(function () {
-        var iteration, nextEntry;
+MapChanges.prototype.removeMapChangeListener = function (listener, token, beforeChange) {
+    var descriptor = this.getMapChangeDescriptor(token);
 
-        if(next) {
-            nextEntry = next();
-        }
+    var listeners;
+    if (beforeChange) {
+        listeners = descriptor.willChangeListeners;
+    } else {
+        listeners = descriptor.changeListeners;
+    }
 
-        if(!next || nextEntry.done === true) {
-            if (times > 0) {
-                times--;
-                iteration = Iterator.iterate(cycle);
-                nextEntry = (next = iteration.next.bind(iteration))();
+    if(listeners._current) {
+        if(listeners._current === listener) {
+            listeners._current = null;
+        }
+        else {
+            var index = listeners._current.lastIndexOf(listener);
+            if (index === -1) {
+                throw new Error("Can't remove map change listener: does not exist: token " + JSON.stringify(token));
+            }
+            else {
+                if(descriptor.isActive) {
+                    listeners.ghostCount = listeners.ghostCount+1;
+                    listeners._current[index]=ListenerGhost$1;
+                }
+                else {
+                    listeners._current.spliceOne(index);
+                }
             }
-            else {
-                this._iterationObject.done = true;
-                nextEntry = this._iterationObject;            }
         }
-        return nextEntry;
-    });
+    }
+
+
 };
 
-Iterator.concat = function (iterators) {
-    iterators = Iterator(iterators);
-    var next;
-    return new Iterator(function (){
-        var iteration, nextEntry;
-        if(next) nextEntry = next();
-        if(!nextEntry || nextEntry.done === true) {
-            nextEntry = iterators.next();
-            if(nextEntry.done === false) {
-                iteration = Iterator(nextEntry.value);
-                next = iteration.next.bind(iteration);
-                return next();
+MapChanges.prototype.dispatchMapChange = function (key, value, beforeChange) {
+    var descriptors = this.getAllMapChangeDescriptors(),
+        Ghost = ListenerGhost$1;
+
+    descriptors.forEach(function (descriptor, token) {
+
+        if (descriptor.isActive) {
+            return;
+        }
+
+        var listeners = beforeChange ? descriptor.willChangeListeners : descriptor.changeListeners;
+        if(listeners && listeners._current) {
+
+            var tokenName = listeners.specificHandlerMethodName;
+            if(Array.isArray(listeners._current)) {
+                if(listeners._current.length) {
+                    //removeGostListenersIfNeeded returns listeners.current or a new filtered one when conditions are met
+                    var currentListeners = listeners.removeCurrentGostListenersIfNeeded(),
+                        i, countI, listener;
+                    descriptor.isActive = true;
+
+                    try {
+                        for(i=0, countI = currentListeners.length;i<countI;i++) {
+                            // dispatch to each listener
+                            if ((listener = currentListeners[i]) !== Ghost) {
+                                if (listener[tokenName]) {
+                                    listener[tokenName](value, key, this);
+                                } else if (listener.call) {
+                                    listener.call(listener, value, key, this);
+                                } else {
+                                    throw new Error("Handler " + listener + " has no method " + tokenName + " and is not callable");
+                                }
+                            }
+                        }
+                    } finally {
+                        descriptor.isActive = false;
+                    }
+                }
             }
             else {
-                return nextEntry;
+                descriptor.isActive = true;
+                // dispatch each listener
+
+                try {
+                    listener = listeners._current;
+                    if (listener[tokenName]) {
+                        listener[tokenName](value, key, this);
+                    } else if (listener.call) {
+                        listener.call(listener, value, key, this);
+                    } else {
+                        throw new Error("Handler " + listener + " has no method " + tokenName + " and is not callable");
+                    }
+                } finally {
+                    descriptor.isActive = false;
+                }
+
             }
         }
-        else return nextEntry;
-    });
+
+    }, this);
 };
 
-Iterator.unzip = function (iterators) {
-    iterators = Iterator(iterators).map(Iterator);
-    if (iterators.length === 0)
-        return new Iterator([]);
-    return new Iterator(function () {
-        var stopped, nextEntry;
-        var result = iterators.map(function (iterator) {
-            nextEntry = iterator.next();
-            if (nextEntry.done === true ) {
-                stopped = true;
-            }
-            return nextEntry.value;
-        });
-        if (stopped) {
-            this._iterationObject.done = true;
-            this._iterationObject.value = void 0;
-        }
-        else {
-            this._iterationObject.value = result;
-        }
-        return this._iterationObject;
-    });
+MapChanges.prototype.addBeforeMapChangeListener = function (listener, token) {
+    return this.addMapChangeListener(listener, token, true);
 };
 
-Iterator.zip = function () {
-    return Iterator.unzip(
-        Array.prototype.slice.call(arguments)
-    );
+MapChanges.prototype.removeBeforeMapChangeListener = function (listener, token) {
+    return this.removeMapChangeListener(listener, token, true);
 };
 
-Iterator.chain = function () {
-    return Iterator.concat(
-        Array.prototype.slice.call(arguments)
-    );
+MapChanges.prototype.dispatchBeforeMapChange = function (key, value) {
+    return this.dispatchMapChange(key, value, true);
 };
 
-Iterator.range = function (start, stop, step) {
-    if (arguments.length < 3) {
-        step = 1;
+var map = _map;
+
+if((commonjsGlobal.Map === void 0) || (typeof commonjsGlobal.Set.prototype.values !== "function")) {
+    Object.addEach(_map.prototype, propertyChanges.prototype);
+    Object.addEach(_map.prototype, mapChanges.prototype);
+}
+else {
+    Object.defineEach(_map.prototype, propertyChanges.prototype, false, /*configurable*/true, /*enumerable*/ false, /*writable*/true);
+    Object.defineEach(_map.prototype, mapChanges.prototype, false, /*configurable*/true, /*enumerable*/ false, /*writable*/true);
+}
+
+class FlatQueue {
+
+    constructor() {
+        this.ids = [];
+        this.values = [];
+        this.length = 0;
     }
-    if (arguments.length < 2) {
-        stop = start;
-        start = 0;
+
+    clear() {
+        this.length = 0;
     }
-    start = start || 0;
-    step = step || 1;
-    return new Iterator(function () {
-        if (start >= stop) {
-            this._iterationObject.done = true;
-            this._iterationObject.value = void 0;
+
+    push(id, value) {
+        let pos = this.length++;
+        this.ids[pos] = id;
+        this.values[pos] = value;
+
+        while (pos > 0) {
+            const parent = (pos - 1) >> 1;
+            const parentValue = this.values[parent];
+            if (value >= parentValue) break;
+            this.ids[pos] = this.ids[parent];
+            this.values[pos] = parentValue;
+            pos = parent;
         }
-        var result = start;
-        start += step;
-        this._iterationObject.value = result;
 
-        return this._iterationObject;
-    });
-};
+        this.ids[pos] = id;
+        this.values[pos] = value;
+    }
 
-Iterator.count = function (start, step) {
-    return Iterator.range(start, Infinity, step);
-};
+    pop() {
+        if (this.length === 0) return undefined;
 
-Iterator.repeat = function (value, times) {
-    return new Iterator.range(times).mapIterator(function () {
-        return value;
-    });
-};
+        const top = this.ids[0];
+        this.length--;
 
-var genericMap = GenericMap;
-function GenericMap() {
-    throw new Error("Can't construct. GenericMap is a mixin.");
-}
+        if (this.length > 0) {
+            const id = this.ids[0] = this.ids[this.length];
+            const value = this.values[0] = this.values[this.length];
+            const halfLength = this.length >> 1;
+            let pos = 0;
 
-// all of these methods depend on the constructor providing a `store` set
+            while (pos < halfLength) {
+                let left = (pos << 1) + 1;
+                const right = left + 1;
+                let bestIndex = this.ids[left];
+                let bestValue = this.values[left];
+                const rightValue = this.values[right];
 
-GenericMap.prototype.isMap = true;
+                if (right < this.length && rightValue < bestValue) {
+                    left = right;
+                    bestIndex = this.ids[right];
+                    bestValue = rightValue;
+                }
+                if (bestValue >= value) break;
 
-GenericMap.prototype.addEach = function (values) {
-    var i;
-    if (values && shimObject(values) === values) {
-        if (typeof values.forEach === "function") {
-            // copy map-alikes
-            if (values.isMap === true) {
-                values.forEach(function (value, key) {
-                    this.set(key, value);
-                }, this);
-            // iterate key value pairs of other iterables
-            } else {
-                values.forEach(function (pair) {
-                    this.set(pair[0], pair[1]);
-                }, this);
-            }
-        } else if (typeof values.length === "number") {
-            // Array-like objects that do not implement forEach, ergo,
-            // Arguments
-            for (i = 0; i < values.length; i++) {
-                this.add(values[i], i);
+                this.ids[pos] = bestIndex;
+                this.values[pos] = bestValue;
+                pos = left;
             }
-        } else {
-            // copy other objects as map-alikes
-            shimObject.keys(values).forEach(function (key) {
-                this.set(key, values[key]);
-            }, this);
-        }
-    } else if (values && typeof values.length === "number") {
-        // String
-        for (i = 0; i < values.length; i++) {
-            this.add(values[i], i);
+
+            this.ids[pos] = id;
+            this.values[pos] = value;
         }
+
+        return top;
     }
-    return this;
-};
 
-GenericMap.prototype.get = function (key, defaultValue) {
-    var item = this.store.get(new this.Item(key));
-    if (item) {
-        return item.value;
-    } else if (arguments.length > 1) {
-        console.log("Use of a second argument as default value is deprecated to match standards");
-        return defaultValue;
-    } else {
-        return this.getDefault(key);
+    peek() {
+        return this.ids[0];
     }
-};
 
-GenericMap.prototype.set = function (key, value) {
-    var item = new this.Item(key, value);
-    var found = this.store.get(item);
-    if (found) { // update
-        if (this.dispatchesMapChanges) {
-            this.dispatchBeforeMapChange(key, found.value);
-        }
-        found.value = value;
-        if (this.dispatchesMapChanges) {
-            this.dispatchMapChange(key, value);
-        }
-    } else { // create
-        if (this.dispatchesMapChanges) {
-            this.dispatchBeforeMapChange(key, undefined);
+    peekValue() {
+        return this.values[0];
+    }
+}
+
+const ARRAY_TYPES = [
+    Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array,
+    Int32Array, Uint32Array, Float32Array, Float64Array
+];
+
+const VERSION = 3; // serialized format version
+
+class Flatbush {
+
+    static from(data) {
+        if (!(data instanceof ArrayBuffer)) {
+            throw new Error('Data must be an instance of ArrayBuffer.');
         }
-        if (this.store.add(item)) {
-            this.length++;
+        const [magic, versionAndType] = new Uint8Array(data, 0, 2);
+        if (magic !== 0xfb) {
+            throw new Error('Data does not appear to be in a Flatbush format.');
         }
-        if (this.dispatchesMapChanges) {
-            this.dispatchMapChange(key, value);
+        if (versionAndType >> 4 !== VERSION) {
+            throw new Error(`Got v${versionAndType >> 4} data when expected v${VERSION}.`);
         }
+        const [nodeSize] = new Uint16Array(data, 2, 1);
+        const [numItems] = new Uint32Array(data, 4, 1);
+
+        return new Flatbush(numItems, nodeSize, ARRAY_TYPES[versionAndType & 0x0f], data);
     }
-    return this;
-};
 
-GenericMap.prototype.add = function (value, key) {
-    return this.set(key, value);
-};
+    constructor(numItems, nodeSize = 16, ArrayType = Float64Array, data) {
+        if (numItems === undefined) throw new Error('Missing required argument: numItems.');
+        if (isNaN(numItems) || numItems <= 0) throw new Error(`Unpexpected numItems value: ${numItems}.`);
 
-GenericMap.prototype.has = function (key) {
-    return this.store.has(new this.Item(key));
-};
+        this.numItems = +numItems;
+        this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);
 
-GenericMap.prototype['delete'] = function (key) {
-    var item = new this.Item(key);
-    if (this.store.has(item)) {
-        var from = this.store.get(item).value;
-        if (this.dispatchesMapChanges) {
-            this.dispatchBeforeMapChange(key, from);
+        // calculate the total number of nodes in the R-tree to allocate space for
+        // and the index of each tree level (used in search later)
+        let n = numItems;
+        let numNodes = n;
+        this._levelBounds = [n * 4];
+        do {
+            n = Math.ceil(n / this.nodeSize);
+            numNodes += n;
+            this._levelBounds.push(numNodes * 4);
+        } while (n !== 1);
+
+        this.ArrayType = ArrayType || Float64Array;
+        this.IndexArrayType = numNodes < 16384 ? Uint16Array : Uint32Array;
+
+        const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);
+        const nodesByteSize = numNodes * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+
+        if (arrayTypeIndex < 0) {
+            throw new Error(`Unexpected typed array class: ${ArrayType}.`);
         }
-        this.store["delete"](item);
-        this.length--;
-        if (this.dispatchesMapChanges) {
-            this.dispatchMapChange(key, undefined);
+
+        if (data && (data instanceof ArrayBuffer)) {
+            this.data = data;
+            this._boxes = new this.ArrayType(this.data, 8, numNodes * 4);
+            this._indices = new this.IndexArrayType(this.data, 8 + nodesByteSize, numNodes);
+
+            this._pos = numNodes * 4;
+            this.minX = this._boxes[this._pos - 4];
+            this.minY = this._boxes[this._pos - 3];
+            this.maxX = this._boxes[this._pos - 2];
+            this.maxY = this._boxes[this._pos - 1];
+
+        } else {
+            this.data = new ArrayBuffer(8 + nodesByteSize + numNodes * this.IndexArrayType.BYTES_PER_ELEMENT);
+            this._boxes = new this.ArrayType(this.data, 8, numNodes * 4);
+            this._indices = new this.IndexArrayType(this.data, 8 + nodesByteSize, numNodes);
+            this._pos = 0;
+            this.minX = Infinity;
+            this.minY = Infinity;
+            this.maxX = -Infinity;
+            this.maxY = -Infinity;
+
+            new Uint8Array(this.data, 0, 2).set([0xfb, (VERSION << 4) + arrayTypeIndex]);
+            new Uint16Array(this.data, 2, 1)[0] = nodeSize;
+            new Uint32Array(this.data, 4, 1)[0] = numItems;
         }
-        return true;
+
+        // a priority queue for k-nearest-neighbors queries
+        this._queue = new FlatQueue();
     }
-    return false;
-};
 
-GenericMap.prototype.clear = function () {
-    var keys, key;
-    if (this.dispatchesMapChanges) {
-        this.forEach(function (value, key) {
-            this.dispatchBeforeMapChange(key, value);
-        }, this);
-        keys = this.keysArray();
+    add(minX, minY, maxX, maxY) {
+        const index = this._pos >> 2;
+        this._indices[index] = index;
+        this._boxes[this._pos++] = minX;
+        this._boxes[this._pos++] = minY;
+        this._boxes[this._pos++] = maxX;
+        this._boxes[this._pos++] = maxY;
+
+        if (minX < this.minX) this.minX = minX;
+        if (minY < this.minY) this.minY = minY;
+        if (maxX > this.maxX) this.maxX = maxX;
+        if (maxY > this.maxY) this.maxY = maxY;
+
+        return index;
     }
-    this.store.clear();
-    this.length = 0;
-    if (this.dispatchesMapChanges) {
-        for(var i=0;(key = keys[i]);i++) {
-            this.dispatchMapChange(key);
+
+    finish() {
+        if (this._pos >> 2 !== this.numItems) {
+            throw new Error(`Added ${this._pos >> 2} items when expected ${this.numItems}.`);
         }
-        // keys.forEach(function (key) {
-        //     this.dispatchMapChange(key);
-        // }, this);
-    }
-};
 
-GenericMap.prototype.reduce = function (callback, basis, thisp) {
-    return this.store.reduce(function (basis, item) {
-        return callback.call(thisp, basis, item.value, item.key, this);
-    }, basis, this);
-};
+        if (this.numItems <= this.nodeSize) {
+            // only one node, skip sorting and just fill the root box
+            this._boxes[this._pos++] = this.minX;
+            this._boxes[this._pos++] = this.minY;
+            this._boxes[this._pos++] = this.maxX;
+            this._boxes[this._pos++] = this.maxY;
+            return;
+        }
 
-GenericMap.prototype.reduceRight = function (callback, basis, thisp) {
-    return this.store.reduceRight(function (basis, item) {
-        return callback.call(thisp, basis, item.value, item.key, this);
-    }, basis, this);
-};
+        const width = this.maxX - this.minX;
+        const height = this.maxY - this.minY;
+        const hilbertValues = new Uint32Array(this.numItems);
+        const hilbertMax = (1 << 16) - 1;
 
-GenericMap.prototype.keysArray = function () {
-    return this.map(function (value, key) {
-        return key;
-    });
-};
-GenericMap.prototype.keys = function () {
-    return new iterator(this.keysArray(), true);
-};
+        // map item centers into Hilbert coordinate space and calculate Hilbert values
+        for (let i = 0; i < this.numItems; i++) {
+            let pos = 4 * i;
+            const minX = this._boxes[pos++];
+            const minY = this._boxes[pos++];
+            const maxX = this._boxes[pos++];
+            const maxY = this._boxes[pos++];
+            const x = Math.floor(hilbertMax * ((minX + maxX) / 2 - this.minX) / width);
+            const y = Math.floor(hilbertMax * ((minY + maxY) / 2 - this.minY) / height);
+            hilbertValues[i] = hilbert(x, y);
+        }
 
-GenericMap.prototype.valuesArray = function () {
-    return this.map(Function.identity);
-};
-GenericMap.prototype.values = function () {
-    return new iterator(this.valuesArray(), true);
-};
+        // sort items by their Hilbert value (for packing later)
+        sort(hilbertValues, this._boxes, this._indices, 0, this.numItems - 1, this.nodeSize);
 
-GenericMap.prototype.entriesArray = function () {
-    return this.map(function (value, key) {
-        return [key, value];
-    });
-};
-GenericMap.prototype.entries = function () {
-    return new iterator(this.entriesArray(), true);
-};
+        // generate nodes at each tree level, bottom-up
+        for (let i = 0, pos = 0; i < this._levelBounds.length - 1; i++) {
+            const end = this._levelBounds[i];
 
-// XXX deprecated
-GenericMap.prototype.items = function () {
-    return this.entriesArray();
-};
+            // generate a parent node for each block of consecutive <nodeSize> nodes
+            while (pos < end) {
+                const nodeIndex = pos;
 
-GenericMap.prototype.equals = function (that, equals) {
-    equals = equals || shimObject.equals;
-    if (this === that) {
-        return true;
-    } else if (that && typeof that.every === "function") {
-        return that.length === this.length && that.every(function (value, key) {
-            return equals(this.get(key), value);
-        }, this);
-    } else {
-        var keys = shimObject.keys(that);
-        return keys.length === this.length && shimObject.keys(that).every(function (key) {
-            return equals(this.get(key), that[key]);
-        }, this);
+                // calculate bbox for the new node
+                let nodeMinX = Infinity;
+                let nodeMinY = Infinity;
+                let nodeMaxX = -Infinity;
+                let nodeMaxY = -Infinity;
+                for (let i = 0; i < this.nodeSize && pos < end; i++) {
+                    nodeMinX = Math.min(nodeMinX, this._boxes[pos++]);
+                    nodeMinY = Math.min(nodeMinY, this._boxes[pos++]);
+                    nodeMaxX = Math.max(nodeMaxX, this._boxes[pos++]);
+                    nodeMaxY = Math.max(nodeMaxY, this._boxes[pos++]);
+                }
+
+                // add the new node to the tree data
+                this._indices[this._pos >> 2] = nodeIndex;
+                this._boxes[this._pos++] = nodeMinX;
+                this._boxes[this._pos++] = nodeMinY;
+                this._boxes[this._pos++] = nodeMaxX;
+                this._boxes[this._pos++] = nodeMaxY;
+            }
+        }
     }
-};
 
-GenericMap.prototype.toJSON = function () {
-    return this.entriesArray();
-};
+    search(minX, minY, maxX, maxY, filterFn) {
+        if (this._pos !== this._boxes.length) {
+            throw new Error('Data not yet indexed - call index.finish().');
+        }
 
+        let nodeIndex = this._boxes.length - 4;
+        const queue = [];
+        const results = [];
 
-GenericMap.prototype.Item = Item;
+        while (nodeIndex !== undefined) {
+            // find the end index of the node
+            const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
 
-function Item(key, value) {
-    this.key = key;
-    this.value = value;
-}
+            // search through child nodes
+            for (let pos = nodeIndex; pos < end; pos += 4) {
+                const index = this._indices[pos >> 2] | 0;
 
-Item.prototype.equals = function (that) {
-    return shimObject.equals(this.key, that.key) && shimObject.equals(this.value, that.value);
-};
+                // check if node bbox intersects with query bbox
+                if (maxX < this._boxes[pos]) continue; // maxX < nodeMinX
+                if (maxY < this._boxes[pos + 1]) continue; // maxY < nodeMinY
+                if (minX > this._boxes[pos + 2]) continue; // minX > nodeMaxX
+                if (minY > this._boxes[pos + 3]) continue; // minY > nodeMaxY
 
-Item.prototype.compare = function (that) {
-    return shimObject.compare(this.key, that.key);
-};
+                if (nodeIndex < this.numItems * 4) {
+                    if (filterFn === undefined || filterFn(index)) {
+                        results.push(index); // leaf item
+                    }
 
-// Burgled from https://github.com/domenic/dict
+                } else {
+                    queue.push(index); // node; add it to the search queue
+                }
+            }
 
-var _dict = Dict;
-function Dict(values, getDefault) {
-    if (!(this instanceof Dict)) {
-        return new Dict(values, getDefault);
+            nodeIndex = queue.pop();
+        }
+
+        return results;
     }
-    getDefault = getDefault || Function.noop;
-    this.getDefault = getDefault;
-    this.store = Object.create(null);
-    this.length = 0;
-    this.addEach(values);
-}
 
-Dict.Dict = Dict; // hack so require("dict").Dict will work in MontageJS.
+    neighbors(x, y, maxResults = Infinity, maxDistance = Infinity, filterFn) {
+        if (this._pos !== this._boxes.length) {
+            throw new Error('Data not yet indexed - call index.finish().');
+        }
 
-Object.addEach(Dict.prototype, genericCollection.prototype);
-Object.addEach(Dict.prototype, genericMap.prototype);
+        let nodeIndex = this._boxes.length - 4;
+        const q = this._queue;
+        const results = [];
+        const maxDistSquared = maxDistance * maxDistance;
 
-Dict.from = genericCollection.from;
+        while (nodeIndex !== undefined) {
+            // find the end index of the node
+            const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
 
-Dict.prototype.constructClone = function (values) {
-    return new this.constructor(values, this.getDefault);
-};
+            // add child nodes to the queue
+            for (let pos = nodeIndex; pos < end; pos += 4) {
+                const index = this._indices[pos >> 2] | 0;
 
-Dict.prototype.assertString = function (key) {
-    if (typeof key !== "string") {
-        throw new TypeError("key must be a string but Got " + key);
-    }
-};
+                const dx = axisDist(x, this._boxes[pos], this._boxes[pos + 2]);
+                const dy = axisDist(y, this._boxes[pos + 1], this._boxes[pos + 3]);
+                const dist = dx * dx + dy * dy;
 
-Object.defineProperty(Dict.prototype,"$__proto__",{writable:true});
-Object.defineProperty(Dict.prototype,"_hasProto",{
-    get:function() {
-        return this.hasOwnProperty("$__proto__") && typeof this._protoValue !== "undefined";
-    }
-});
-Object.defineProperty(Dict.prototype,"_protoValue",{
-    get:function() {
-        return this["$__proto__"];
-    },
-    set: function(value) {
-        this["$__proto__"] = value;
-    }
-});
+                if (nodeIndex < this.numItems * 4) { // leaf node
+                    if (filterFn === undefined || filterFn(index)) {
+                        // put a negative index if it's an item rather than a node, to recognize later
+                        q.push(-index - 1, dist);
+                    }
+                } else {
+                    q.push(index, dist);
+                }
+            }
 
-Object.defineProperty(Dict.prototype,"size",genericCollection._sizePropertyDescriptor);
+            // pop items from the queue
+            while (q.length && q.peek() < 0) {
+                const dist = q.peekValue();
+                if (dist > maxDistSquared) {
+                    q.clear();
+                    return results;
+                }
+                results.push(-q.pop() - 1);
 
+                if (results.length === maxResults) {
+                    q.clear();
+                    return results;
+                }
+            }
 
-Dict.prototype.get = function (key, defaultValue) {
-    this.assertString(key);
-    if (key === "__proto__") {
-        if (this._hasProto) {
-            return this._protoValue;
-        } else if (arguments.length > 1) {
-            return defaultValue;
-        } else {
-            return this.getDefault(key);
-        }
-    }
-    else {
-        if (key in this.store) {
-            return this.store[key];
-        } else if (arguments.length > 1) {
-            return defaultValue;
-        } else {
-            return this.getDefault(key);
+            nodeIndex = q.pop();
         }
+
+        q.clear();
+        return results;
     }
-};
+}
 
-Dict.prototype.set = function (key, value) {
-    this.assertString(key);
-    var isProtoKey = (key === "__proto__");
+function axisDist(k, min, max) {
+    return k < min ? min - k : k <= max ? 0 : k - max;
+}
 
-    if (isProtoKey ? this._hasProto : key in this.store) { // update
-        if (this.dispatchesMapChanges) {
-            this.dispatchBeforeMapChange(key, isProtoKey ? this._protoValue : this.store[key]);
+// binary search for the first value in the array bigger than the given
+function upperBound(value, arr) {
+    let i = 0;
+    let j = arr.length - 1;
+    while (i < j) {
+        const m = (i + j) >> 1;
+        if (arr[m] > value) {
+            j = m;
+        } else {
+            i = m + 1;
         }
+    }
+    return arr[i];
+}
 
-        isProtoKey
-            ? this._protoValue = value
-            : this.store[key] = value;
-
-        if (this.dispatchesMapChanges) {
-            this.dispatchMapChange(key, value);
-        }
-        return false;
-    } else { // create
-        if (this.dispatchesMapChanges) {
-            this.dispatchBeforeMapChange(key, undefined);
-        }
-        this.length++;
+// custom quicksort that partially sorts bbox data alongside the hilbert values
+function sort(values, boxes, indices, left, right, nodeSize) {
+    if (Math.floor(left / nodeSize) >= Math.floor(right / nodeSize)) return;
 
-        isProtoKey
-            ? this._protoValue = value
-            : this.store[key] = value;
+    const pivot = values[(left + right) >> 1];
+    let i = left - 1;
+    let j = right + 1;
 
-        if (this.dispatchesMapChanges) {
-            this.dispatchMapChange(key, value);
-        }
-        return true;
+    while (true) {
+        do i++; while (values[i] < pivot);
+        do j--; while (values[j] > pivot);
+        if (i >= j) break;
+        swap(values, boxes, indices, i, j);
     }
-};
 
-Dict.prototype.has = function (key) {
-    this.assertString(key);
-    return key === "__proto__" ? this._hasProto : key in this.store;
-};
+    sort(values, boxes, indices, left, j, nodeSize);
+    sort(values, boxes, indices, j + 1, right, nodeSize);
+}
 
-Dict.prototype["delete"] = function (key) {
-    this.assertString(key);
-    if (key === "__proto__") {
-        if (this._hasProto) {
-            if (this.dispatchesMapChanges) {
-                this.dispatchBeforeMapChange(key, this._protoValue);
-            }
-            this._protoValue = undefined;
-            this.length--;
-            if (this.dispatchesMapChanges) {
-                this.dispatchMapChange(key, undefined);
-            }
-            return true;
-        }
-        return false;
-    }
-    else {
-        if (key in this.store) {
-            if (this.dispatchesMapChanges) {
-                this.dispatchBeforeMapChange(key, this.store[key]);
-            }
-            delete this.store[key];
-            this.length--;
-            if (this.dispatchesMapChanges) {
-                this.dispatchMapChange(key, undefined);
-            }
-            return true;
-        }
-        return false;
-    }
-};
+// swap two values and two corresponding boxes
+function swap(values, boxes, indices, i, j) {
+    const temp = values[i];
+    values[i] = values[j];
+    values[j] = temp;
 
-Dict.prototype.clear = function () {
-    var key;
-    if (this._hasProto) {
-        if (this.dispatchesMapChanges) {
-            this.dispatchBeforeMapChange("__proto__", this._protoValue);
-        }
-        this._protoValue = undefined;
-        if (this.dispatchesMapChanges) {
-            this.dispatchMapChange("__proto__", undefined);
-        }
-    }
-    for (key in this.store) {
-        if (this.dispatchesMapChanges) {
-            this.dispatchBeforeMapChange(key, this.store[key]);
-        }
-        delete this.store[key];
-        if (this.dispatchesMapChanges) {
-            this.dispatchMapChange(key, undefined);
-        }
-    }
-    this.length = 0;
-};
+    const k = 4 * i;
+    const m = 4 * j;
 
-Dict.prototype.reduce = function (callback, basis, thisp) {
-    if(this._hasProto) {
-        basis = callback.call(thisp, basis, "$__proto__", "__proto__", this);
-    }
-    var store = this.store;
-    for (var key in this.store) {
-        basis = callback.call(thisp, basis, store[key], key, this);
-    }
-    return basis;
-};
+    const a = boxes[k];
+    const b = boxes[k + 1];
+    const c = boxes[k + 2];
+    const d = boxes[k + 3];
+    boxes[k] = boxes[m];
+    boxes[k + 1] = boxes[m + 1];
+    boxes[k + 2] = boxes[m + 2];
+    boxes[k + 3] = boxes[m + 3];
+    boxes[m] = a;
+    boxes[m + 1] = b;
+    boxes[m + 2] = c;
+    boxes[m + 3] = d;
 
-Dict.prototype.reduceRight = function (callback, basis, thisp) {
-    var self = this;
-    var store = this.store;
-    basis = Object.keys(this.store).reduceRight(function (basis, key) {
-        return callback.call(thisp, basis, store[key], key, self);
-    }, basis);
+    const e = indices[i];
+    indices[i] = indices[j];
+    indices[j] = e;
+}
 
-    if(this._hasProto) {
-        return callback.call(thisp, basis, this._protoValue, "__proto__", self);
-    }
-    return basis;
-};
+// Fast Hilbert curve algorithm by http://threadlocalmutex.com/
+// Ported from C++ https://github.com/rawrunprotected/hilbert_curves (public domain)
+function hilbert(x, y) {
+    let a = x ^ y;
+    let b = 0xFFFF ^ a;
+    let c = 0xFFFF ^ (x | y);
+    let d = x & (y ^ 0xFFFF);
 
-Dict.prototype.one = function () {
-    var key;
-    for (key in this.store) {
-        return this.store[key];
-    }
-    return this._protoValue;
-};
+    let A = a | (b >> 1);
+    let B = (a >> 1) ^ a;
+    let C = ((c >> 1) ^ (b & (d >> 1))) ^ c;
+    let D = ((a & (c >> 1)) ^ (d >> 1)) ^ d;
 
-Dict.prototype.toJSON = function () {
-    return this.toObject();
-};
+    a = A; b = B; c = C; d = D;
+    A = ((a & (a >> 2)) ^ (b & (b >> 2)));
+    B = ((a & (b >> 2)) ^ (b & ((a ^ b) >> 2)));
+    C ^= ((a & (c >> 2)) ^ (b & (d >> 2)));
+    D ^= ((b & (c >> 2)) ^ ((a ^ b) & (d >> 2)));
 
-var treeLog = TreeLog;
+    a = A; b = B; c = C; d = D;
+    A = ((a & (a >> 4)) ^ (b & (b >> 4)));
+    B = ((a & (b >> 4)) ^ (b & ((a ^ b) >> 4)));
+    C ^= ((a & (c >> 4)) ^ (b & (d >> 4)));
+    D ^= ((b & (c >> 4)) ^ ((a ^ b) & (d >> 4)));
 
-function TreeLog() {
-}
+    a = A; b = B; c = C; d = D;
+    C ^= ((a & (c >> 8)) ^ (b & (d >> 8)));
+    D ^= ((b & (c >> 8)) ^ ((a ^ b) & (d >> 8)));
 
-TreeLog.ascii = {
-    intersection: "+",
-    through: "-",
-    branchUp: "+",
-    branchDown: "+",
-    fromBelow: ".",
-    fromAbove: "'",
-    fromBoth: "+",
-    strafe: "|"
-};
+    a = C ^ (C >> 1);
+    b = D ^ (D >> 1);
 
-TreeLog.unicodeRound = {
-    intersection: "\u254b",
-    through: "\u2501",
-    branchUp: "\u253b",
-    branchDown: "\u2533",
-    fromBelow: "\u256d", // round corner
-    fromAbove: "\u2570", // round corner
-    fromBoth: "\u2523",
-    strafe: "\u2503"
-};
+    let i0 = x ^ y;
+    let i1 = b | (0xFFFF ^ (i0 | a));
 
-TreeLog.unicodeSharp = {
-    intersection: "\u254b",
-    through: "\u2501",
-    branchUp: "\u253b",
-    branchDown: "\u2533",
-    fromBelow: "\u250f", // sharp corner
-    fromAbove: "\u2517", // sharp corner
-    fromBoth: "\u2523",
-    strafe: "\u2503"
-};
+    i0 = (i0 | (i0 << 8)) & 0x00FF00FF;
+    i0 = (i0 | (i0 << 4)) & 0x0F0F0F0F;
+    i0 = (i0 | (i0 << 2)) & 0x33333333;
+    i0 = (i0 | (i0 << 1)) & 0x55555555;
 
-var _fastSet = FastSet;
+    i1 = (i1 | (i1 << 8)) & 0x00FF00FF;
+    i1 = (i1 | (i1 << 4)) & 0x0F0F0F0F;
+    i1 = (i1 | (i1 << 2)) & 0x33333333;
+    i1 = (i1 | (i1 << 1)) & 0x55555555;
 
-function FastSet(values, equals, hash, getDefault) {
-    if (!(this instanceof FastSet)) {
-        return new FastSet(values, equals, hash, getDefault);
-    }
-    equals = equals || Object.equals;
-    hash = hash || Object.hash;
-    getDefault = getDefault || Function.noop;
-    this.contentEquals = equals;
-    this.contentHash = hash;
-    this.getDefault = getDefault;
-    var self = this;
-    this.buckets = new this.Buckets(null, function getDefaultBucket() {
-        return new self.Bucket();
-    });
-    this.length = 0;
-    this.addEach(values);
+    return ((i1 << 1) | i0) >>> 0;
 }
 
-FastSet.FastSet = FastSet; // hack so require("fast-set").FastSet will work in MontageJS
+var flatbush = /*#__PURE__*/Object.freeze({
+	__proto__: null,
+	'default': Flatbush
+});
 
-Object.addEach(FastSet.prototype, genericCollection.prototype);
-Object.addEach(FastSet.prototype, genericSet.prototype);
-FastSet.from = genericCollection.from;
+function quickselect(arr, k, left, right, compare) {
+    quickselectStep(arr, k, left || 0, right || (arr.length - 1), compare || defaultCompare);
+}
 
-FastSet.prototype.Buckets = _dict;
-FastSet.prototype.Bucket = _list;
+function quickselectStep(arr, k, left, right, compare) {
 
-FastSet.prototype.constructClone = function (values) {
-    return new this.constructor(
-        values,
-        this.contentEquals,
-        this.contentHash,
-        this.getDefault
-    );
-};
+    while (right > left) {
+        if (right - left > 600) {
+            var n = right - left + 1;
+            var m = k - left + 1;
+            var z = Math.log(n);
+            var s = 0.5 * Math.exp(2 * z / 3);
+            var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);
+            var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));
+            var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));
+            quickselectStep(arr, k, newLeft, newRight, compare);
+        }
 
-FastSet.prototype.has = function (value) {
-    var hash = this.contentHash(value);
-    return this.buckets.get(hash).has(value);
-};
+        var t = arr[k];
+        var i = left;
+        var j = right;
 
-FastSet.prototype.get = function (value, equals) {
-    if (equals) {
-        throw new Error("FastSet#get does not support second argument: equals");
-    }
-    var hash = this.contentHash(value);
-    var buckets = this.buckets;
-    if (buckets.has(hash)) {
-        return buckets.get(hash).get(value);
-    } else {
-        return this.getDefault(value);
-    }
-};
+        swap$1(arr, left, k);
+        if (compare(arr[right], t) > 0) swap$1(arr, left, right);
 
-FastSet.prototype["delete"] = function (value, equals) {
-    if (equals) {
-        throw new Error("FastSet#delete does not support second argument: equals");
-    }
-    var hash = this.contentHash(value);
-    var buckets = this.buckets;
-    if (buckets.has(hash)) {
-        var bucket = buckets.get(hash);
-        if (bucket["delete"](value)) {
-            this.length--;
-            if (bucket.length === 0) {
-                buckets["delete"](hash);
-            }
-            return true;
+        while (i < j) {
+            swap$1(arr, i, j);
+            i++;
+            j--;
+            while (compare(arr[i], t) < 0) i++;
+            while (compare(arr[j], t) > 0) j--;
+        }
+
+        if (compare(arr[left], t) === 0) swap$1(arr, left, j);
+        else {
+            j++;
+            swap$1(arr, j, right);
         }
+
+        if (j <= k) left = j + 1;
+        if (k <= j) right = j - 1;
     }
-    return false;
-};
+}
 
-FastSet.prototype.clear = function () {
-    this.buckets.clear();
-    this.length = 0;
-};
+function swap$1(arr, i, j) {
+    var tmp = arr[i];
+    arr[i] = arr[j];
+    arr[j] = tmp;
+}
 
-FastSet.prototype.add = function (value) {
-    var hash = this.contentHash(value);
-    var buckets = this.buckets;
-    if (!buckets.has(hash)) {
-        buckets.set(hash, new this.Bucket(null, this.contentEquals));
+function defaultCompare(a, b) {
+    return a < b ? -1 : a > b ? 1 : 0;
+}
+
+class RBush {
+    constructor(maxEntries = 9) {
+        // max entries in a node is 9 by default; min node fill is 40% for best performance
+        this._maxEntries = Math.max(4, maxEntries);
+        this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4));
+        this.clear();
     }
-    if (!buckets.get(hash).has(value)) {
-        buckets.get(hash).add(value);
-        this.length++;
-        return true;
+
+    all() {
+        return this._all(this.data, []);
     }
-    return false;
-};
 
-FastSet.prototype.reduce = function (callback, basis /*, thisp*/) {
-    var thisp = arguments[2];
-    var buckets = this.buckets;
-    var index = 0;
-    return buckets.reduce(function (basis, bucket) {
-        return bucket.reduce(function (basis, value) {
-            return callback.call(thisp, basis, value, index++, this);
-        }, basis, this);
-    }, basis, this);
-};
+    search(bbox) {
+        let node = this.data;
+        const result = [];
+
+        if (!intersects(bbox, node)) return result;
+
+        const toBBox = this.toBBox;
+        const nodesToSearch = [];
+
+        while (node) {
+            for (let i = 0; i < node.children.length; i++) {
+                const child = node.children[i];
+                const childBBox = node.leaf ? toBBox(child) : child;
 
-FastSet.prototype.one = function () {
-    if (this.length > 0) {
-        return this.buckets.one().one();
+                if (intersects(bbox, childBBox)) {
+                    if (node.leaf) result.push(child);
+                    else if (contains(bbox, childBBox)) this._all(child, result);
+                    else nodesToSearch.push(child);
+                }
+            }
+            node = nodesToSearch.pop();
+        }
+
+        return result;
     }
-};
 
-FastSet.prototype.iterate = function () {
-    return this.buckets.valuesArray().flatten().iterate();
-};
+    collides(bbox) {
+        let node = this.data;
 
-FastSet.prototype.log = function (charmap, logNode, callback, thisp) {
-    charmap = charmap || treeLog.unicodeSharp;
-    logNode = logNode || this.logNode;
-    if (!callback) {
-        callback = console.log;
-        thisp = console;
-    }
-    callback = callback.bind(thisp);
+        if (!intersects(bbox, node)) return false;
 
-    var buckets = this.buckets, bucketsSize = buckets.size,
-        mapIter = buckets.keys(), hash, index = 0,
-        branch, leader, bucket;
+        const nodesToSearch = [];
+        while (node) {
+            for (let i = 0; i < node.children.length; i++) {
+                const child = node.children[i];
+                const childBBox = node.leaf ? this.toBBox(child) : child;
 
-    while (hash = mapIter.next().value) {
-        if (index === bucketsSize - 1) {
-            branch = charmap.fromAbove;
-            leader = ' ';
-        } else if (index === 0) {
-            branch = charmap.branchDown;
-            leader = charmap.strafe;
-        } else {
-            branch = charmap.fromBoth;
-            leader = charmap.strafe;
-        }
-        bucket = buckets.get(hash);
-        callback.call(thisp, branch + charmap.through + charmap.branchDown + ' ' + hash);
-        bucket.forEach(function (value, node) {
-            var branch, below, written;
-            if (node === bucket.head.prev) {
-                branch = charmap.fromAbove;
-                below = ' ';
-            } else {
-                branch = charmap.fromBoth;
-                below = charmap.strafe;
-            }
-            logNode(
-                node,
-                function (line) {
-                    if (!written) {
-                        callback.call(thisp, leader + ' ' + branch + charmap.through + charmap.through + line);
-                        written = true;
-                    } else {
-                        callback.call(thisp, leader + ' ' + below + '  ' + line);
-                    }
-                },
-                function (line) {
-                    callback.call(thisp, leader + ' ' + charmap.strafe + '  ' + line);
+                if (intersects(bbox, childBBox)) {
+                    if (node.leaf || contains(bbox, childBBox)) return true;
+                    nodesToSearch.push(child);
                 }
-            );
-        });
-        index++;
+            }
+            node = nodesToSearch.pop();
+        }
+
+        return false;
     }
 
-    //var hashes = buckets.keysArray();
-    // hashes.forEach(function (hash, index) {
-    //     var branch;
-    //     var leader;
-    //     if (index === hashes.length - 1) {
-    //         branch = charmap.fromAbove;
-    //         leader = ' ';
-    //     } else if (index === 0) {
-    //         branch = charmap.branchDown;
-    //         leader = charmap.strafe;
-    //     } else {
-    //         branch = charmap.fromBoth;
-    //         leader = charmap.strafe;
-    //     }
-    //     var bucket = buckets.get(hash);
-    //     callback.call(thisp, branch + charmap.through + charmap.branchDown + ' ' + hash);
-    //     bucket.forEach(function (value, node) {
-    //         var branch, below;
-    //         if (node === bucket.head.prev) {
-    //             branch = charmap.fromAbove;
-    //             below = ' ';
-    //         } else {
-    //             branch = charmap.fromBoth;
-    //             below = charmap.strafe;
-    //         }
-    //         var written;
-    //         logNode(
-    //             node,
-    //             function (line) {
-    //                 if (!written) {
-    //                     callback.call(thisp, leader + ' ' + branch + charmap.through + charmap.through + line);
-    //                     written = true;
-    //                 } else {
-    //                     callback.call(thisp, leader + ' ' + below + '  ' + line);
-    //                 }
-    //             },
-    //             function (line) {
-    //                 callback.call(thisp, leader + ' ' + charmap.strafe + '  ' + line);
-    //             }
-    //         );
-    //     });
-    // });
-};
+    load(data) {
+        if (!(data && data.length)) return this;
 
-FastSet.prototype.logNode = function (node, write) {
-    var value = node.value;
-    if (Object(value) === value) {
-        JSON.stringify(value, null, 4).split("\n").forEach(function (line) {
-            write(" " + line);
-        });
-    } else {
-        write(" " + value);
-    }
-};
+        if (data.length < this._minEntries) {
+            for (let i = 0; i < data.length; i++) {
+                this.insert(data[i]);
+            }
+            return this;
+        }
 
-var _set = createCommonjsModule(function (module) {
+        // recursively build the tree with the given data from scratch using OMT algorithm
+        let node = this._build(data.slice(), 0, data.length - 1, 0);
 
+        if (!this.data.children.length) {
+            // save as is if tree is empty
+            this.data = node;
 
+        } else if (this.data.height === node.height) {
+            // split root if trees have the same height
+            this._splitRoot(this.data, node);
 
+        } else {
+            if (this.data.height < node.height) {
+                // swap trees if inserted one is bigger
+                const tmpNode = this.data;
+                this.data = node;
+                node = tmpNode;
+            }
 
-var GlobalSet, CollectionsSet;
+            // insert the small tree into the large tree at appropriate level
+            this._insert(node, this.data.height - node.height - 1, true);
+        }
 
+        return this;
+    }
 
-if((commonjsGlobal.Set !== void 0) && (typeof commonjsGlobal.Set.prototype.values === "function")) {
+    insert(item) {
+        if (item) this._insert(item, this.data.height - 1);
+        return this;
+    }
 
-    GlobalSet = module.exports = commonjsGlobal.Set;
-    GlobalSet.Set = GlobalSet; // hack so require("set").Set will work in MontageJS
+    clear() {
+        this.data = createNode([]);
+        return this;
+    }
 
-    GlobalSet.prototype.reduce = function (callback, basis /*, thisp*/) {
-        var thisp = arguments[2];
-        this.forEach(function(value) {
-            basis = callback.call(thisp, basis, value, this);
-        });
-        return basis;
-    };
+    remove(item, equalsFn) {
+        if (!item) return this;
 
-    GlobalSet.prototype.reduceRight = function (callback, basis /*, thisp*/) {
-        var thisp = arguments[2];
-        var setIterator = this.values();
-        var size = this.size;
-        var reverseOrder = new Array(this.size);
-        var value, i = size;
-        // Fill 'reverseOrder' with values of Set in inverted order.
-        while ((value = setIterator.next().value)) {
-            reverseOrder[--i] = value;
-        }
-        // Iterate over reversed values and callback.
-        while (i < size) {
-            basis = callback.call(thisp, basis, reverseOrder[i++], this);
-        }
-        return basis;
-    };
+        let node = this.data;
+        const bbox = this.toBBox(item);
+        const path = [];
+        const indexes = [];
+        let i, parent, goingUp;
 
-    GlobalSet.prototype.equals = function (that, equals) {
-        var self = this;
-        return (
-            that && typeof that.reduce === "function" &&
-            this.size === (that.size || that.length) &&
-            that.reduce(function (equal, value) {
-                return equal && self.has(value, equals);
-            }, true)
-        );
-    };
+        // depth-first iterative tree traversal
+        while (node || path.length) {
 
-    GlobalSet.prototype.constructClone = function (values) {
-        return new this.constructor(values, this.contentEquals, this.contentHash, this.getDefault);
-    };
+            if (!node) { // go up
+                node = path.pop();
+                parent = path[path.length - 1];
+                i = indexes.pop();
+                goingUp = true;
+            }
 
-    GlobalSet.prototype.toJSON = function () {
-        return this.entriesArray();
-    };
+            if (node.leaf) { // check current node
+                const index = findItem(item, node.children, equalsFn);
 
-    GlobalSet.prototype.one = function () {
-        if (this.size > 0) {
-            return this.values().next().value;
-        }
-        return undefined;
-    };
+                if (index !== -1) {
+                    // item found, remove the item and condense tree upwards
+                    node.children.splice(index, 1);
+                    path.push(node);
+                    this._condense(path);
+                    return this;
+                }
+            }
+
+            if (!goingUp && !node.leaf && contains(node, bbox)) { // go down
+                path.push(node);
+                indexes.push(i);
+                i = 0;
+                parent = node;
+                node = node.children[0];
+
+            } else if (parent) { // go right
+                i++;
+                node = parent.children[i];
+                goingUp = false;
 
-    GlobalSet.prototype.pop = function () {
-        if (this.size) {
-            var setIterator = this.values(), aValue, value;
-            while(aValue = setIterator.next().value) {
-                value = aValue;
-            }
-            this["delete"](value,this.size-1);
-            return value;
+            } else node = null; // nothing found
         }
-    };
 
-    GlobalSet.prototype.shift = function () {
-        if (this.size) {
-            var firstValue = this.values().next().value;
-            this["delete"](firstValue,0);
-            return firstValue;
-        }
-    };
+        return this;
+    }
 
-    //Backward compatibility:
-    Object.defineProperty(GlobalSet.prototype,"length",{
-        get: function() {
-            return this.size;
-        },
-        enumerable: true,
-        configurable:true
-    });
+    toBBox(item) { return item; }
 
-    GlobalSet.from = function (value) {
-        var result = (new this);
-        result.addEach(value);
-        return result;
-    };
+    compareMinX(a, b) { return a.minX - b.minX; }
+    compareMinY(a, b) { return a.minY - b.minY; }
 
-    Object.addEach(GlobalSet.prototype, genericCollection.prototype, false);
-    Object.addEach(GlobalSet.prototype, genericSet.prototype, false);
+    toJSON() { return this.data; }
 
-}
+    fromJSON(data) {
+        this.data = data;
+        return this;
+    }
 
+    _all(node, result) {
+        const nodesToSearch = [];
+        while (node) {
+            if (node.leaf) result.push(...node.children);
+            else nodesToSearch.push(...node.children);
 
+            node = nodesToSearch.pop();
+        }
+        return result;
+    }
 
-    
-    
-    
+    _build(items, left, right, height) {
 
-    CollectionsSet = function CollectionsSet(values, equals, hash, getDefault) {
-        return CollectionsSet._init(CollectionsSet, this, values, equals, hash, getDefault);
-    };
+        const N = right - left + 1;
+        let M = this._maxEntries;
+        let node;
 
-    CollectionsSet._init = function (constructor, object, values, equals, hash, getDefault) {
-        if (!(object instanceof constructor)) {
-            return new constructor(values, equals, hash, getDefault);
+        if (N <= M) {
+            // reached leaf level; return leaf
+            node = createNode(items.slice(left, right + 1));
+            calcBBox(node, this.toBBox);
+            return node;
         }
-        equals = equals || Object.equals;
-        hash = hash || Object.hash;
-        getDefault = getDefault || Function.noop;
-        object.contentEquals = equals;
-        object.contentHash = hash;
-        object.getDefault = getDefault;
-        // a list of values in insertion order, used for all operations that depend
-        // on iterating in insertion order
-        object.order = new object.Order(undefined, equals);
-        // a set of nodes from the order list, indexed by the corresponding value,
-        // used for all operations that need to quickly seek  value in the list
-        object.store = new object.Store(
-            undefined,
-            function (a, b) {
-                return equals(a.value, b.value);
-            },
-            function (node) {
-                return hash(node.value);
-            }
-        );
-        object.length = 0;
-        object.addEach(values);
 
-    };
+        if (!height) {
+            // target height of the bulk-loaded tree
+            height = Math.ceil(Math.log(N) / Math.log(M));
 
-    CollectionsSet.Set = CollectionsSet; // hack so require("set").Set will work in MontageJS
-    CollectionsSet.CollectionsSet = CollectionsSet;
+            // target number of root entries to maximize storage utilization
+            M = Math.ceil(N / Math.pow(M, height - 1));
+        }
 
-    Object.addEach(CollectionsSet.prototype, genericCollection.prototype);
-    Object.addEach(CollectionsSet.prototype, genericSet.prototype);
+        node = createNode([]);
+        node.leaf = false;
+        node.height = height;
 
-    CollectionsSet.from = genericCollection.from;
+        // split the items into M mostly square tiles
 
-    Object.defineProperty(CollectionsSet.prototype,"size",genericCollection._sizePropertyDescriptor);
+        const N2 = Math.ceil(N / M);
+        const N1 = N2 * Math.ceil(Math.sqrt(M));
 
-    //Overrides for consistency:
-    // Set.prototype.forEach = GenericCollection.prototype.forEach;
+        multiSelect(items, left, right, N1, this.compareMinX);
 
+        for (let i = left; i <= right; i += N1) {
 
-    CollectionsSet.prototype.Order = _list;
-    CollectionsSet.prototype.Store = _fastSet;
+            const right2 = Math.min(i + N1 - 1, right);
 
-    CollectionsSet.prototype.constructClone = function (values) {
-        return new this.constructor(values, this.contentEquals, this.contentHash, this.getDefault);
-    };
+            multiSelect(items, i, right2, N2, this.compareMinY);
 
-    CollectionsSet.prototype.has = function (value) {
-        var node = new this.order.Node(value);
-        return this.store.has(node);
-    };
+            for (let j = i; j <= right2; j += N2) {
 
-    CollectionsSet.prototype.get = function (value, equals) {
-        if (equals) {
-            throw new Error("Set#get does not support second argument: equals");
-        }
-        var node = new this.order.Node(value);
-        node = this.store.get(node);
-        if (node) {
-            return node.value;
-        } else {
-            return this.getDefault(value);
-        }
-    };
+                const right3 = Math.min(j + N2 - 1, right2);
 
-    CollectionsSet.prototype.add = function (value) {
-        var node = new this.order.Node(value);
-        if (!this.store.has(node)) {
-            var index = this.length;
-            this.order.add(value);
-            node = this.order.head.prev;
-            this.store.add(node);
-            this.length++;
-            return true;
+                // pack each entry recursively
+                node.children.push(this._build(items, j, right3, height - 1));
+            }
         }
-        return false;
-    };
 
-    CollectionsSet.prototype["delete"] = function (value, equals) {
-        if (equals) {
-            throw new Error("Set#delete does not support second argument: equals");
-        }
-        var node = new this.order.Node(value);
-        if (this.store.has(node)) {
-            node = this.store.get(node);
-            this.store["delete"](node); // removes from the set
-            this.order.splice(node, 1); // removes the node from the list
-            this.length--;
-            return true;
-        }
-        return false;
-    };
+        calcBBox(node, this.toBBox);
 
-    CollectionsSet.prototype.pop = function () {
-        if (this.length) {
-            var result = this.order.head.prev.value;
-            this["delete"](result);
-            return result;
-        }
-    };
+        return node;
+    }
 
-    CollectionsSet.prototype.shift = function () {
-        if (this.length) {
-            var result = this.order.head.next.value;
-            this["delete"](result);
-            return result;
-        }
-    };
+    _chooseSubtree(bbox, node, level, path) {
+        while (true) {
+            path.push(node);
 
-    CollectionsSet.prototype.one = function () {
-        if (this.length > 0) {
-            return this.store.one().value;
-        }
-    };
+            if (node.leaf || path.length - 1 === level) break;
 
-    CollectionsSet.prototype.clear = function () {
-        this.store.clear();
-        this.order.clear();
-        this.length = 0;
-    };
-    Object.defineProperty(CollectionsSet.prototype,"_clear", {
-        value: CollectionsSet.prototype.clear
-    });
+            let minArea = Infinity;
+            let minEnlargement = Infinity;
+            let targetNode;
 
-    CollectionsSet.prototype.reduce = function (callback, basis /*, thisp*/) {
-        var thisp = arguments[2];
-        var list = this.order;
-        var index = 0;
-        return list.reduce(function (basis, value) {
-            return callback.call(thisp, basis, value, index++, this);
-        }, basis, this);
-    };
+            for (let i = 0; i < node.children.length; i++) {
+                const child = node.children[i];
+                const area = bboxArea(child);
+                const enlargement = enlargedArea(bbox, child) - area;
 
-    CollectionsSet.prototype.reduceRight = function (callback, basis /*, thisp*/) {
-        var thisp = arguments[2];
-        var list = this.order;
-        var index = this.length - 1;
-        return list.reduceRight(function (basis, value) {
-            return callback.call(thisp, basis, value, index--, this);
-        }, basis, this);
-    };
+                // choose entry with the least area enlargement
+                if (enlargement < minEnlargement) {
+                    minEnlargement = enlargement;
+                    minArea = area < minArea ? area : minArea;
+                    targetNode = child;
 
-    CollectionsSet.prototype.iterate = function () {
-        return this.order.iterate();
-    };
+                } else if (enlargement === minEnlargement) {
+                    // otherwise choose one with the smallest area
+                    if (area < minArea) {
+                        minArea = area;
+                        targetNode = child;
+                    }
+                }
+            }
 
-    CollectionsSet.prototype.values = function () {
-        return new iterator(this.valuesArray(), true);
-    };
+            node = targetNode || node.children[0];
+        }
 
-    CollectionsSet.prototype.log = function () {
-        var set = this.store;
-        return set.log.apply(set, arguments);
-    };
+        return node;
+    }
+
+    _insert(item, level, isNode) {
+        const bbox = isNode ? item : this.toBBox(item);
+        const insertPath = [];
 
+        // find the best node for accommodating the item, saving all nodes along the path too
+        const node = this._chooseSubtree(bbox, this.data, level, insertPath);
 
+        // put the item into the node
+        node.children.push(item);
+        extend(node, bbox);
 
-if(!GlobalSet) {
-    module.exports = CollectionsSet;
-}
-else {
-    GlobalSet.prototype.valuesArray = genericSet.prototype.valuesArray;
-    GlobalSet.prototype.entriesArray = genericSet.prototype.entriesArray;
-    module.exports = GlobalSet;
-    GlobalSet.CollectionsSet = CollectionsSet;
-}
-});
+        // split on node overflow; propagate upwards if necessary
+        while (level >= 0) {
+            if (insertPath[level].children.length > this._maxEntries) {
+                this._split(insertPath, level);
+                level--;
+            } else break;
+        }
 
-var _map = createCommonjsModule(function (module) {
+        // adjust bboxes along the insertion path
+        this._adjustParentBBoxes(bbox, insertPath, level);
+    }
 
+    // split overflowed node into two
+    _split(insertPath, level) {
+        const node = insertPath[level];
+        const M = node.children.length;
+        const m = this._minEntries;
 
+        this._chooseSplitAxis(node, m, M);
 
-var Map, GlobalMap, CollectionsMap;
+        const splitIndex = this._chooseSplitIndex(node, m, M);
 
-if((commonjsGlobal.Map !== void 0) && (typeof commonjsGlobal.Set.prototype.values === "function")) {
+        const newNode = createNode(node.children.splice(splitIndex, node.children.length - splitIndex));
+        newNode.height = node.height;
+        newNode.leaf = node.leaf;
 
-    Map = module.exports = commonjsGlobal.Map,
-    GlobalMap = Map;
-    Map.Map = Map; // hack so require("map").Map will work in MontageJS
+        calcBBox(node, this.toBBox);
+        calcBBox(newNode, this.toBBox);
 
-    // use different strategies for making sets observable between Internet
-    // Explorer and other browsers.
-    var protoIsSupported = {}.__proto__ === Object.prototype,
-        map_makeObservable;
+        if (level) insertPath[level - 1].children.push(newNode);
+        else this._splitRoot(node, newNode);
+    }
 
-    if (protoIsSupported) {
-        map_makeObservable = function () {
-            this.__proto__ = ChangeDispatchMap;
-        };
-    } else {
-        map_makeObservable = function () {
-            Object.defineProperties(this, observableSetProperties);
-        };
+    _splitRoot(node, newNode) {
+        // split root node
+        this.data = createNode([node, newNode]);
+        this.data.height = node.height + 1;
+        this.data.leaf = false;
+        calcBBox(this.data, this.toBBox);
     }
 
-    Object.defineProperty(Map.prototype, "makeObservable", {
-        value: map_makeObservable,
-        writable: true,
-        configurable: true,
-        enumerable: false
-    });
+    _chooseSplitIndex(node, m, M) {
+        let index;
+        let minOverlap = Infinity;
+        let minArea = Infinity;
 
-    //This is a no-op test in property-changes.js - PropertyChanges.prototype.makePropertyObservable, so might as well not pay the price every time....
-    Object.defineProperty(Map.prototype, "makePropertyObservable", {
-        value: function(){},
-        writable: true,
-        configurable: true,
-        enumerable: false
-    });
+        for (let i = m; i <= M - m; i++) {
+            const bbox1 = distBBox(node, 0, i, this.toBBox);
+            const bbox2 = distBBox(node, i, M, this.toBBox);
 
+            const overlap = intersectionArea(bbox1, bbox2);
+            const area = bboxArea(bbox1) + bboxArea(bbox2);
 
-    Map.prototype.constructClone = function (values) {
-        return new this.constructor(values);
-    };
+            // choose distribution with minimum overlap
+            if (overlap < minOverlap) {
+                minOverlap = overlap;
+                index = i;
 
-    Map.prototype.isMap = true;
-    Map.prototype.addEach = function (values) {
-        if (values && Object(values) === values) {
-            if (typeof values.forEach === "function") {
-                // copy map-alikes
-                if (values.isMap === true) {
-                    values.forEach(function (value, key) {
-                        this.set(key, value);
-                    }, this);
-                // iterate key value pairs of other iterables
-                } else {
-                    values.forEach(function (pair) {
-                        this.set(pair[0], pair[1]);
-                    }, this);
-                }
-            } else if (typeof values.length === "number") {
-                // Array-like objects that do not implement forEach, ergo,
-                // Arguments
-                for (var i = 0; i < values.length; i++) {
-                    this.add(values[i], i);
+                minArea = area < minArea ? area : minArea;
+
+            } else if (overlap === minOverlap) {
+                // otherwise choose distribution with minimum area
+                if (area < minArea) {
+                    minArea = area;
+                    index = i;
                 }
-            } else {
-                // copy other objects as map-alikes
-                Object.keys(values).forEach(function (key) {
-                    this.set(key, values[key]);
-                }, this);
-            }
-        } else if (values && typeof values.length === "number") {
-            // String
-            for (var i = 0; i < values.length; i++) {
-                this.add(values[i], i);
             }
         }
-        return this;
-    };
 
-    Map.prototype.add = function (value, key) {
-        return this.set(key, value);
-    };
+        return index || M - m;
+    }
 
-    Map.prototype.reduce = function (callback, basis /*, thisp*/) {
-        var thisp = arguments[2];
-        this.forEach(function(value, key, map) {
-            basis = callback.call(thisp, basis, value, key, this);
-        });
-        return basis;
-    };
+    // sorts node children by the best axis for split
+    _chooseSplitAxis(node, m, M) {
+        const compareMinX = node.leaf ? this.compareMinX : compareNodeMinX;
+        const compareMinY = node.leaf ? this.compareMinY : compareNodeMinY;
+        const xMargin = this._allDistMargin(node, m, M, compareMinX);
+        const yMargin = this._allDistMargin(node, m, M, compareMinY);
 
-    Map.prototype.reduceRight = function (callback, basis /*, thisp*/) {
-        var thisp = arguments[2];
-        var keysIterator = this.keys();
-        var size = this.size;
-        var reverseOrder = new Array(this.size);
-        var aKey, i = 0;
-        while ((aKey = keysIterator.next().value)) {
-            reverseOrder[--size] = aKey;
+        // if total distributions margin value is minimal for x, sort by minX,
+        // otherwise it's already sorted by minY
+        if (xMargin < yMargin) node.children.sort(compareMinX);
+    }
+
+    // total margin of all possible split distributions where each node is at least m full
+    _allDistMargin(node, m, M, compare) {
+        node.children.sort(compare);
+
+        const toBBox = this.toBBox;
+        const leftBBox = distBBox(node, 0, m, toBBox);
+        const rightBBox = distBBox(node, M - m, M, toBBox);
+        let margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);
+
+        for (let i = m; i < M - m; i++) {
+            const child = node.children[i];
+            extend(leftBBox, node.leaf ? toBBox(child) : child);
+            margin += bboxMargin(leftBBox);
         }
-        while (i++ < size) {
-            basis = callback.call(thisp, basis, this.get(reverseOrder[i]), reverseOrder[i], this);
+
+        for (let i = M - m - 1; i >= m; i--) {
+            const child = node.children[i];
+            extend(rightBBox, node.leaf ? toBBox(child) : child);
+            margin += bboxMargin(rightBBox);
         }
-        return basis;
-    };
 
-    Map.prototype.equals = function (that, equals) {
-        equals = equals || Object.equals;
-        if (this === that) {
-            return true;
-        } else if (that && typeof that.every === "function") {
-            return that.size === this.size && that.every(function (value, key) {
-                return equals(this.get(key), value);
-            }, this);
-        } else {
-            var keys = Object.keys(that);
-            return keys.length === this.size && Object.keys(that).every(function (key) {
-                return equals(this.get(key), that[key]);
-            }, this);
+        return margin;
+    }
+
+    _adjustParentBBoxes(bbox, path, level) {
+        // adjust bboxes along the given tree path
+        for (let i = level; i >= 0; i--) {
+            extend(path[i], bbox);
         }
-    };
+    }
+
+    _condense(path) {
+        // go through the path, removing empty nodes and updating bboxes
+        for (let i = path.length - 1, siblings; i >= 0; i--) {
+            if (path[i].children.length === 0) {
+                if (i > 0) {
+                    siblings = path[i - 1].children;
+                    siblings.splice(siblings.indexOf(path[i]), 1);
+
+                } else this.clear();
+
+            } else calcBBox(path[i], this.toBBox);
+        }
+    }
+}
+
+function findItem(item, items, equalsFn) {
+    if (!equalsFn) return items.indexOf(item);
+
+    for (let i = 0; i < items.length; i++) {
+        if (equalsFn(item, items[i])) return i;
+    }
+    return -1;
+}
+
+// calculate node's bbox from bboxes of its children
+function calcBBox(node, toBBox) {
+    distBBox(node, 0, node.children.length, toBBox, node);
+}
+
+// min bounding rectangle of node children from k to p-1
+function distBBox(node, k, p, toBBox, destNode) {
+    if (!destNode) destNode = createNode(null);
+    destNode.minX = Infinity;
+    destNode.minY = Infinity;
+    destNode.maxX = -Infinity;
+    destNode.maxY = -Infinity;
+
+    for (let i = k; i < p; i++) {
+        const child = node.children[i];
+        extend(destNode, node.leaf ? toBBox(child) : child);
+    }
+
+    return destNode;
+}
+
+function extend(a, b) {
+    a.minX = Math.min(a.minX, b.minX);
+    a.minY = Math.min(a.minY, b.minY);
+    a.maxX = Math.max(a.maxX, b.maxX);
+    a.maxY = Math.max(a.maxY, b.maxY);
+    return a;
+}
 
-    var _keysArrayFunction = function(value,key) {return key;};
-    Map.prototype.keysArray = function() {
-        return this.map(_keysArrayFunction);
-    };
-    var _valuesArrayFunction = function(value,key) {return value;};
-    Map.prototype.valuesArray = function() {
-        return this.map(_valuesArrayFunction);
-    };
-    var _entriesArrayFunction = function(value,key) {return [key,value];};
-    Map.prototype.entriesArray = function() {
-        return this.map(_entriesArrayFunction);
-    };
-    Map.prototype.toJSON = function () {
-        return this.entriesArray();
-    };
+function compareNodeMinX(a, b) { return a.minX - b.minX; }
+function compareNodeMinY(a, b) { return a.minY - b.minY; }
 
-    // XXX deprecated
-    Map.prototype.items = function () {
-        return this.entriesArray();
-    };
+function bboxArea(a)   { return (a.maxX - a.minX) * (a.maxY - a.minY); }
+function bboxMargin(a) { return (a.maxX - a.minX) + (a.maxY - a.minY); }
 
-    // Map.prototype.contentEquals = Object.equals;
-    // Map.prototype.contentHash = Object.hash;
+function enlargedArea(a, b) {
+    return (Math.max(b.maxX, a.maxX) - Math.min(b.minX, a.minX)) *
+           (Math.max(b.maxY, a.maxY) - Math.min(b.minY, a.minY));
+}
 
+function intersectionArea(a, b) {
+    const minX = Math.max(a.minX, b.minX);
+    const minY = Math.max(a.minY, b.minY);
+    const maxX = Math.min(a.maxX, b.maxX);
+    const maxY = Math.min(a.maxY, b.maxY);
 
-    Map.from = function (value) {
-        var result = new this;
-        result.addEach(value);
-        return result;
+    return Math.max(0, maxX - minX) *
+           Math.max(0, maxY - minY);
+}
+
+function contains(a, b) {
+    return a.minX <= b.minX &&
+           a.minY <= b.minY &&
+           b.maxX <= a.maxX &&
+           b.maxY <= a.maxY;
+}
+
+function intersects(a, b) {
+    return b.minX <= a.maxX &&
+           b.minY <= a.maxY &&
+           b.maxX >= a.minX &&
+           b.maxY >= a.minY;
+}
+
+function createNode(children) {
+    return {
+        children,
+        height: 1,
+        leaf: true,
+        minX: Infinity,
+        minY: Infinity,
+        maxX: -Infinity,
+        maxY: -Infinity
     };
+}
 
+// sort an array so that items come in groups of n unsorted items, with groups sorted between each other;
+// combines selection algorithm with binary divide & conquer approach
 
-    //Backward compatibility:
-    Object.defineProperty(Map.prototype,"length",{
-        get: function() {
-            return this.size;
-        },
-        enumerable: true,
-        configurable:true
-    });
+function multiSelect(arr, left, right, n, compare) {
+    const stack = [left, right];
 
+    while (stack.length) {
+        right = stack.pop();
+        left = stack.pop();
 
-    var map_clear = Map.prototype.clear,
-        map_set = Map.prototype.set,
-        map_delete = Map.prototype.delete;
+        if (right - left <= n) continue;
 
-    var observableMapProperties = {
-        clear : {
-            value: function () {
-                var keys;
-                if (this.dispatchesMapChanges) {
-                    this.forEach(function (value, key) {
-                        this.dispatchBeforeMapChange(key, value);
-                    }, this);
-                    keys = this.keysArray();
-                }
-                map_clear.call(this);
-                if (this.dispatchesMapChanges) {
-                    keys.forEach(function (key) {
-                        this.dispatchMapChange(key);
-                    }, this);
-                }
-            },
-            writable: true,
-            configurable: true
+        const mid = left + Math.ceil((right - left) / n / 2) * n;
+        quickselect(arr, mid, left, right, compare);
 
-        },
-        set : {
-            value: function (key, value) {
-                var found = this.get(key);
-                if (found) { // update
-                    if (this.dispatchesMapChanges) {
-                        this.dispatchBeforeMapChange(key, found);
-                    }
+        stack.push(left, mid, mid, right);
+    }
+}
 
-                    map_set.call(this,key, value);
+var rbush = /*#__PURE__*/Object.freeze({
+	__proto__: null,
+	'default': RBush
+});
 
-                    if (this.dispatchesMapChanges) {
-                        this.dispatchMapChange(key, value);
-                    }
-                } else { // create
-                    if (this.dispatchesMapChanges) {
-                        this.dispatchBeforeMapChange(key, undefined);
-                    }
+const REarth = 6371;
 
-                    map_set.call(this,key, value);
+const WGS84 = {
+    a: 6378.137,
+    b: 6356.752314245,
+    f: 1 / 298.257223563
+};
 
-                    if (this.dispatchesMapChanges) {
-                        this.dispatchMapChange(key, value);
-                    }
-                }
-                return this;
-            },
-            writable: true,
-            configurable: true
-        },
+function radians(degrees) {
+    return degrees / (180 / Math.PI);
+}
 
-        "delete": {
-            value: function (key) {
-                if (this.has(key)) {
-                    if (this.dispatchesMapChanges) {
-                        this.dispatchBeforeMapChange(key, this.get(key));
-                    }
-                    map_delete.call(this,key);
+function degrees(radians) {
+    return radians * (180 / Math.PI);
+}
 
-                    if (this.dispatchesMapChanges) {
-                        this.dispatchMapChange(key, undefined);
-                    }
-                    return true;
-                }
-                return false;
-            }
-        }
-    };
+const consoleColors = {
+    bright: '\x1b[1m',
+    dim: '\x1b[2m',
+    underscore: '\x1b[4m',
+    blink: '\x1b[5m',
+    reverse: '\x1b[7m',
+    hidden: '\x1b[8m',
+    fg: {
+        black: '\x1b[30m',
+        red: '\x1b[31m',
+        green: '\x1b[32m',
+        yellow: '\x1b[33m',
+        blue: '\x1b[34m',
+        magenta: '\x1b[35m',
+        cyan: '\x1b[36m',
+        white: '\x1b[37m',
+        crimson: '\x1b[38m'
+    },
+    bg: {
+        black: '\x1b[40m',
+        red: '\x1b[41m',
+        green: '\x1b[42m',
+        yellow: '\x1b[43m',
+        blue: '\x1b[44m',
+        magenta: '\x1b[45m',
+        cyan: '\x1b[46m',
+        white: '\x1b[47m',
+        crimson: '\x1b[48m'
+    },
+    reset: '\x1b[0m'
+};
 
+var util = {
+    radians,
+    degrees,
+    REarth,
+    WGS84,
+    consoleColors
+};
 
+// Vincenty's Algorithm, courtesy of Movable Type Ltd
+// https://www.movable-type.co.uk/scripts/latlong-vincenty.html
+// Published and included here under an MIT licence
+function inverse(p1, p2) {
+    const φ1 = util.radians(p1.y), λ1 = util.radians(p1.x);
+    const φ2 = util.radians(p2.y), λ2 = util.radians(p2.x);
 
-    Object.addEach(Map.prototype, genericCollection.prototype, false);
+    const { a, b, f } = util.WGS84;
 
-    var ChangeDispatchMap = Object.create(Map.prototype, observableMapProperties);
-}
+    const L = λ2 - λ1; // L = difference in longitude, U = reduced latitude, defined by tan U = (1-f)·tanφ.
+    const tanU1 = (1 - f) * Math.tan(φ1), cosU1 = 1 / Math.sqrt((1 + tanU1 * tanU1)), sinU1 = tanU1 * cosU1;
+    const tanU2 = (1 - f) * Math.tan(φ2), cosU2 = 1 / Math.sqrt((1 + tanU2 * tanU2)), sinU2 = tanU2 * cosU2;
 
-    var Set = _set.CollectionsSet;
-    
+    const antipodal = Math.abs(L) > Math.PI / 2 || Math.abs(φ2 - φ1) > Math.PI / 2;
 
-    CollectionsMap = Map = function Map(values, equals, hash, getDefault) {
-        if (!(this instanceof Map)) {
-            return new Map(values, equals, hash, getDefault);
-        }
-        equals = equals || Object.equals;
-        hash = hash || Object.hash;
-        getDefault = getDefault || Function.noop;
-        this.contentEquals = equals;
-        this.contentHash = hash;
-        this.getDefault = getDefault;
-        this.store = new Set(
-            undefined,
-            function keysEqual(a, b) {
-                return equals(a.key, b.key);
-            },
-            function keyHash(item) {
-                return hash(item.key);
-            }
-        );
-        this.length = 0;
-        this.addEach(values);
-    };
+    let λ = L, sinλ = null, cosλ = null; // λ = difference in longitude on an auxiliary sphere
+    let σ = antipodal ? Math.PI : 0, sinσ = 0, cosσ = antipodal ? -1 : 1, sinSqσ = null; // σ = angular distance P₁ P₂ on the sphere
+    let cos2σₘ = 1;                      // σₘ = angular distance on the sphere from the equator to the midpoint of the line
+    let sinα = null, cosSqα = 1;         // α = azimuth of the geodesic at the equator
+    let C = null;
+
+    let λʹ = null, iterations = 0;
+    do {
+        sinλ = Math.sin(λ);
+        cosλ = Math.cos(λ);
+        sinSqσ = (cosU2 * sinλ) * (cosU2 * sinλ) + (cosU1 * sinU2 - sinU1 * cosU2 * cosλ) * (cosU1 * sinU2 - sinU1 * cosU2 * cosλ);
+        if (Math.abs(sinSqσ) < Number.EPSILON) break;  // co-incident/antipodal points (falls back on λ/σ = L)
+        sinσ = Math.sqrt(sinSqσ);
+        cosσ = sinU1 * sinU2 + cosU1 * cosU2 * cosλ;
+        σ = Math.atan2(sinσ, cosσ);
+        sinα = cosU1 * cosU2 * sinλ / sinσ;
+        cosSqα = 1 - sinα * sinα;
+        cos2σₘ = (cosSqα != 0) ? (cosσ - 2 * sinU1 * sinU2 / cosSqα) : 0; // on equatorial line cos²α = 0 (§6)
+        C = f / 16 * cosSqα * (4 + f * (4 - 3 * cosSqα));
+        λʹ = λ;
+        λ = L + (1 - C) * f * sinα * (σ + C * sinσ * (cos2σₘ + C * cosσ * (-1 + 2 * cos2σₘ * cos2σₘ)));
+        const iterationCheck = antipodal ? Math.abs(λ) - Math.PI : Math.abs(λ);
+        if (iterationCheck > Math.PI) throw new EvalError('λ > π');
+    } while (Math.abs(λ - λʹ) > 1e-7 && ++iterations < 1000);
+    if (iterations >= 1000) throw new EvalError('Vincenty formula failed to converge');
 
-    Map.Map = Map; // hack so require("map").Map will work in MontageJS
+    const uSq = cosSqα * (a * a - b * b) / (b * b);
+    const A = 1 + uSq / 16384 * (4096 + uSq * (-768 + uSq * (320 - 175 * uSq)));
+    const B = uSq / 1024 * (256 + uSq * (-128 + uSq * (74 - 47 * uSq)));
+    const Δσ = B * sinσ * (cos2σₘ + B / 4 * (cosσ * (-1 + 2 * cos2σₘ * cos2σₘ) -
+        B / 6 * cos2σₘ * (-3 + 4 * sinσ * sinσ) * (-3 + 4 * cos2σₘ * cos2σₘ)));
 
-    Object.addEach(Map.prototype, genericCollection.prototype);
-    Object.addEach(Map.prototype, genericMap.prototype); // overrides GenericCollection
-    Object.defineProperty(Map.prototype,"size",genericCollection._sizePropertyDescriptor);
+    const s = b * A * (σ - Δσ); // s = length of the geodesic
 
-    Map.from = genericCollection.from;
+    // note special handling of exactly antipodal points where sin²σ = 0 (due to discontinuity
+    // atan2(0, 0) = 0 but atan2(ε, 0) = π/2 / 90°) - in which case bearing is always meridional,
+    // due north (or due south!)
+    // α = azimuths of the geodesic; α2 the direction P₁ P₂ produced
+    const α1 = Math.abs(sinSqσ) < Number.EPSILON ? 0 : Math.atan2(cosU2 * sinλ, cosU1 * sinU2 - sinU1 * cosU2 * cosλ);
+    const α2 = Math.abs(sinSqσ) < Number.EPSILON ? Math.PI : Math.atan2(cosU1 * sinλ, -sinU1 * cosU2 + cosU1 * sinU2 * cosλ);
 
-    Map.prototype.constructClone = function (values) {
-        return new this.constructor(
-            values,
-            this.contentEquals,
-            this.contentHash,
-            this.getDefault
-        );
+    return {
+        distance: s,
+        initialBearing: Math.abs(s) < Number.EPSILON ? NaN : util.degrees(α1),
+        finalBearing: Math.abs(s) < Number.EPSILON ? NaN : util.degrees(α2),
+        iterations: iterations,
     };
+}
 
-    Map.prototype.log = function (charmap, logNode, callback, thisp) {
-        logNode = logNode || this.logNode;
-        this.store.log(charmap, function (node, log, logBefore) {
-            logNode(node.value.value, log, logBefore);
-        }, callback, thisp);
-    };
+var vincentys = {
+    inverse
+};
 
-    Map.prototype.logNode = function (node, log) {
-        log(' key: ' + node.key);
-        log(' value: ' + node.value);
-    };
+class Point {
+    constructor(x, y) {
+        if (Array.isArray(x))
+            [this.x, this.y, this.r] = [x[y].longitude, x[y].latitude, y];
+        else
+            [this.x, this.y] = [x, y];
+    }
 
-    if(!GlobalMap) {
-        module.exports = CollectionsMap;
+    geojson(id, properties) {
+        const feature = {
+            type: 'Feature',
+            id,
+            properties: properties || {},
+            geometry: {
+                type: 'Point',
+                coordinates: [this.x, this.y]
+            }
+        };
+        return feature;
     }
-    else {
-        module.exports = GlobalMap;
-        GlobalMap.CollectionsMap = CollectionsMap;
+
+    /* c8 ignore next 3 */
+    toString() {
+        return JSON.stringify(this.geojson());
     }
-});
 
-var changeDescriptor = createCommonjsModule(function (module) {
-/*
-    Copyright (c) 2016, Montage Studio Inc. All Rights Reserved.
-    3-Clause BSD License
-    https://github.com/montagejs/montage/blob/master/LICENSE.md
-*/
+    intersects(other) {
+        if (other instanceof Point)
+            return (this.x == other.x && this.y == other.y);
+        if (other instanceof Box)
+            return other.intersects(this);
+        throw ('other must be either Point or Box');
+    }
 
+    distanceEarth(p) {
+        return this.distanceEarthFCC(p);
+    }
 
+    distanceEarthFCC(p) {
+        const df = (p.y - this.y);
+        const dg = (p.x - this.x);
+        const fm = util.radians((this.y + p.y) / 2);
+        const k1 = 111.13209 - 0.566605 * Math.cos(2 * fm) + 0.00120 * Math.cos(4 * fm);
+        const k2 = 111.41513 * Math.cos(fm) - 0.09455 * Math.cos(3 * fm) + 0.00012 * Math.cos(5 * fm);
+        const d = Math.sqrt((k1 * df) * (k1 * df) + (k2 * dg) * (k2 * dg));
+        return d;
+    }
 
-var ObjectChangeDescriptor = module.exports.ObjectChangeDescriptor = function ObjectChangeDescriptor(name) {
-    this.name = name;
-    this.isActive = false;
-    this._willChangeListeners = null;
-    this._changeListeners = null;
-	return this;
-};
+    /* c8 ignore next 5 */
+    distanceEarthRev(dx, dy) {
+        const lon = this.x + util.degrees((dx / util.REarth) / Math.cos(util.radians(this.y)));
+        const lat = this.y + util.degrees(dy / util.REarth);
+        return new Point(lon, lat);
+    }
 
-Object.defineProperties(ObjectChangeDescriptor.prototype,{
-    name: {
-		value:null,
-		writable: true
-	},
-    isActive: {
-		value:false,
-		writable: true
-	},
-	_willChangeListeners: {
-		value:null,
-		writable: true
-	},
-	willChangeListeners: {
-		get: function() {
-			return this._willChangeListeners || (this._willChangeListeners = new this.willChangeListenersRecordConstructor(this.name));
-		}
-	},
-	_changeListeners: {
-		value:null,
-		writable: true
-	},
-    changeListeners: {
-		get: function() {
-			return this._changeListeners || (this._changeListeners = new this.changeListenersRecordConstructor(this.name));
-		}
-	},
-    changeListenersRecordConstructor: {
-        value: ChangeListenersRecord,
-        writable: true
-    },
-    willChangeListenersRecordConstructor: {
-        value: WillChangeListenersRecord,
-        writable: true
+    distanceEarthVincentys(p) {
+        return vincentys.inverse(this, p).distance;
     }
+}
 
-});
+class Range {
+    constructor(a, b) {
+        [this.a, this.b] = [a, b];
+    }
 
-var ListenerGhost = module.exports.ListenerGhost = Object.create(null);
-var ChangeListenerSpecificHandlerMethodName = new _map();
+    count() {
+        return Math.abs(this.a - this.b) + 1;
+    }
 
- module.exports.ChangeListenersRecord = ChangeListenersRecord;
-function ChangeListenersRecord(name) {
-    var specificHandlerMethodName = ChangeListenerSpecificHandlerMethodName.get(name);
-    if(!specificHandlerMethodName) {
-        specificHandlerMethodName = "handle";
-        specificHandlerMethodName += name;
-        specificHandlerMethodName += "Change";
-        ChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName);
+    center() {
+        return Math.min(this.a, this.b) + Math.floor(Math.abs(this.a - this.b) / 2);
     }
-    this._current = null;
-    this._current = null;
-    this.specificHandlerMethodName = specificHandlerMethodName;
-    return this;
-}
 
-Object.defineProperties(ChangeListenersRecord.prototype,{
-    _current: {
-		value: null,
-		writable: true
-	},
-	current: {
-		get: function() {
-            // if(this._current) {
-            //     console.log(this.constructor.name," with ",this._current.length," listeners: ", this._current);
-            // }
-            return this._current;
-            //return this._current || (this._current = []);
-		},
-        set: function(value) {
-            this._current = value;
-        }
-	},
-    ListenerGhost: {
-        value:ListenerGhost,
-        writable: true
-    },
-    ghostCount: {
-        value:0,
-        writable: true
-    },
-    maxListenerGhostRatio: {
-        value:0.3,
-        writable: true
-    },
-    listenerGhostFilter: {
-        value: function listenerGhostFilter(value) {
-          return value !== this.ListenerGhost;
-      }
-    },
-    removeCurrentGostListenersIfNeeded: {
-        value: function() {
-            if(this._current && this.ghostCount/this._current.length>this.maxListenerGhostRatio) {
-                this.ghostCount = 0;
-                this._current = this._current.filter(this.listenerGhostFilter,this);
-            }
-            return this._current;
-        }
-    },
-    dispatchBeforeChange: {
-        value: false,
-        writable: true
-    },
-    genericHandlerMethodName: {
-		value: "handlePropertyChange",
-        writable: true
-	}
-});
+    left() {
+        return new Range(Math.min(this.a, this.b), Math.min(this.a, this.b) + Math.floor(Math.abs(this.a - this.b) / 2));
+    }
 
-module.exports.WillChangeListenersRecord = WillChangeListenersRecord;
-var WillChangeListenerSpecificHandlerMethodName = new _map();
-function WillChangeListenersRecord(name) {
-    var specificHandlerMethodName = WillChangeListenerSpecificHandlerMethodName.get(name);
-    if(!specificHandlerMethodName) {
-        specificHandlerMethodName = "handle";
-        specificHandlerMethodName += name;
-        specificHandlerMethodName += "WillChange";
-        WillChangeListenerSpecificHandlerMethodName.set(name,specificHandlerMethodName);
+    right() {
+        return new Range(Math.min(this.a, this.b) + Math.ceil(Math.abs(this.a - this.b) / 2), Math.max(this.a, this.b));
+    }
+
+    contains(p) {
+        return this.a <= p && p <= this.b;
+    }
+
+    /* c8 ignore next 3 */
+    toString() {
+        return `${this.a}:${this.b}`;
     }
-    this.specificHandlerMethodName = specificHandlerMethodName;
-	return this;
 }
-WillChangeListenersRecord.prototype = new ChangeListenersRecord();
-WillChangeListenersRecord.prototype.constructor = WillChangeListenersRecord;
-WillChangeListenersRecord.prototype.genericHandlerMethodName = "handlePropertyWillChange";
-});
-var changeDescriptor_1 = changeDescriptor.ObjectChangeDescriptor;
-var changeDescriptor_2 = changeDescriptor.ListenerGhost;
-var changeDescriptor_3 = changeDescriptor.ChangeListenersRecord;
-var changeDescriptor_4 = changeDescriptor.WillChangeListenersRecord;
 
-// Object property descriptors carry information necessary for adding,
-// removing, dispatching, and shorting events to listeners for property changes
-// for a particular key on a particular object.  These descriptors are used
-// here for shallow property changes.  The current listeners are the ones
-// modified by add and remove own property change listener methods.  During
-// property change dispatch, we capture a snapshot of the current listeners in
-// the active change listeners array.  The descriptor also keeps a memo of the
-// corresponding handler method names.
-//
-// {
-//     willChangeListeners:{current, active:Array<Function>, ...method names}
-//     changeListeners:{current, active:Array<Function>, ...method names}
-// }
+class Box {
+    constructor(a, b, c, d) {
+        if (a instanceof Range) {
+            [this.x1, this.y1, this.x2, this.y2] = [Infinity, Infinity, -Infinity, -Infinity];
+            for (let i = a.a; i <= a.b; i++) {
+                this.x1 = Math.min(b.flightPoints[i].x, this.x1);
+                this.y1 = Math.min(b.flightPoints[i].y, this.y1);
+                this.x2 = Math.max(b.flightPoints[i].x, this.x2);
+                this.y2 = Math.max(b.flightPoints[i].y, this.y2);
+            }
+        } else {
+            [this.x1, this.y1, this.x2, this.y2] = [a, b, c, d];
+        }
+    }
 
-// Maybe remove entries from this table if the corresponding object no longer
-// has any property change listeners for any key.  However, the cost of
-// book-keeping is probably not warranted since it would be rare for an
-// observed object to no longer be observed unless it was about to be disposed
-// of or reused as an observable.  The only benefit would be in avoiding bulk
-// calls to dispatchOwnPropertyChange events on objects that have no listeners.
+    vertices() {
+        return [
+            new Point(this.x1, this.y1),
+            new Point(this.x2, this.y1),
+            new Point(this.x2, this.y2),
+            new Point(this.x1, this.y2)
+        ];
+    }
 
-//  To observe shallow property changes for a particular key of a particular
-//  object, we install a property descriptor on the object that overrides the previous
-//  descriptor.  The overridden descriptors are stored in this weak map.  The
-//  weak map associates an object with another object that maps property names
-//  to property descriptors.
-//
-//  object.__overriddenPropertyDescriptors__[key]
-//
-//  We retain the old descriptor for various purposes.  For one, if the property
-//  is no longer being observed by anyone, we revert the property descriptor to
-//  the original.  For "value" descriptors, we store the actual value of the
-//  descriptor on the overridden descriptor, so when the property is reverted, it
-//  retains the most recently set value.  For "get" and "set" descriptors,
-//  we observe then forward "get" and "set" operations to the original descriptor.
+    intersects(other) {
+        if (other instanceof Point)
+            return (this.x1 <= other.x && this.y1 <= other.y && this.x2 >= other.x && this.y2 >= other.y);
+        if (this.x1 > other.x2 || this.x2 < other.x1 || this.y1 > other.y2 || this.y2 < other.y1)
+            return false;
+        return true;
+    }
 
-var propertyChanges = PropertyChanges;
+    area() {
+        const h = Math.abs(this.x2 - this.x1);
+        const w = Math.abs(this.y2 - this.y1);
+        return h * w;
+    }
 
-function PropertyChanges() {
-    throw new Error("This is an abstract interface. Mix it. Don't construct it");
-}
+    /* c8 ignore next 25 */
+    distance(other) {
+        if (this.intersects(other))
+            return 0;
+        let x1, y1, x2, y2;
+        if (this.x1 > other.x2)
+            x1 = this.x1;
+        x2 = other.x2;
+        if (this.x2 < other.x1)
+            x1 = this.x2;
+        x2 = other.x1;
+        if (this.y1 < other.y2)
+            y1 = this.y1;
+        y2 = other.y2;
+        if (this.y2 > other.y1)
+            y1 = this.y2;
+        y2 = other.y1;
+        if (x1 === undefined) {
+            x1 = this.x1;
+            x2 = this.x1;
+        }
+        if (y1 === undefined) {
+            y1 = this.y1;
+            y2 = this.y1;
+        }
+        return new Point(x1, y1).distanceEarth(new Point(x2, y2));
+    }
 
+    geojson(id, properties) {
+        const feature = {
+            type: 'Feature',
+            id,
+            properties: properties || {},
+            geometry: {
+                type: 'Polygon',
+                coordinates: [[
+                    [this.x1, this.y1],
+                    [this.x1, this.y2],
+                    [this.x2, this.y2],
+                    [this.x2, this.y1],
+                    [this.x1, this.y1],
+                ]]
+            }
+        };
+        return feature;
+    }
 
+    /* c8 ignore next 11 */
+    geojson_collection(boxes) {
+        let features = [];
+        for (let b in boxes) {
+            features.push(boxes[b].geojson(b, { id: b }));
+        }
+        let collection = {
+            type: 'FeatureCollection',
+            features
+        };
+        return collection;
+    }
 
+    toString() {
+        return JSON.stringify(this.geojson());
+    }
+}
 
-var ObjectChangeDescriptor = changeDescriptor.ObjectChangeDescriptor,
-    ListenerGhost = changeDescriptor.ListenerGhost;
+var foundation = {
+    Point,
+    Range,
+    Box
+};
 
-PropertyChanges.debug = true;
+var _Flatbush = getCjsExportFromNamespace(flatbush);
 
-var ObjectsPropertyChangeListeners = new weakMap$1();
+var RBush$1 = getCjsExportFromNamespace(rbush);
 
-var ObjectChangeDescriptorName = new _map();
+const Flatbush$1 = _Flatbush.default ? _Flatbush.default : _Flatbush;
 
-PropertyChanges.ObjectChangeDescriptor = function() {
 
-};
+const { Box: Box$1, Point: Point$1 } = foundation;
 
-PropertyChanges.prototype.getOwnPropertyChangeDescriptor = function (key) {
-    var objectPropertyChangeDescriptors = ObjectsPropertyChangeListeners.get(this), keyChangeDescriptor;
-    if (!objectPropertyChangeDescriptors) {
-        objectPropertyChangeDescriptors = Object.create(null);
-        ObjectsPropertyChangeListeners.set(this,objectPropertyChangeDescriptors);
+/* Paragliding Competition Tracklog Optimization, Ondˇrej Palkovsk´y
+ * http://www.penguin.cz/~ondrap/algorithm.pdf
+ * Refer for a proof that the maximum path between rectangles always
+ * passes through their vertices
+ * 
+ * My addition :
+ * With 3 rectanges, for each rectangle, the maximum path between them always includes:
+ * a) only the vertices that lie on the vertices of the minimum bounding box if there are such vertices
+ * b) if there are no such vertices, any vertices that lie on the edges of the bounding box
+ * c) or potentially any vertice if no vertices lie on the edges of the bounding box
+ */
+function maxDistance3Rectangles(boxes, distance_fn) {
+    let vertices = [];
+    let minx, miny, maxx, maxy;
+    for (let r of [0, 1, 2]) {
+        vertices[r] = boxes[r].vertices();
+        minx = Math.min(minx || Infinity, boxes[r].x1);
+        miny = Math.min(miny || Infinity, boxes[r].y1);
+        maxx = Math.max(maxx || -Infinity, boxes[r].x2);
+        maxy = Math.max(maxy || -Infinity, boxes[r].y2);
     }
-    if ( (keyChangeDescriptor = objectPropertyChangeDescriptors[key]) === void 0) {
-        var propertyName = ObjectChangeDescriptorName.get(key);
-        if(!propertyName) {
-            propertyName = String(key);
-            propertyName = propertyName && propertyName[0].toUpperCase() + propertyName.slice(1);
-            ObjectChangeDescriptorName.set(key,propertyName);
+
+    let intersecting = false;
+    for (let i of [0, 1, 2])
+        if (boxes[i].intersects(boxes[(i + 1) % 3])) {
+            intersecting = true;
+            break;
         }
-        return objectPropertyChangeDescriptors[key] = new ObjectChangeDescriptor(propertyName);
-    }
-    else return keyChangeDescriptor;
-};
 
-PropertyChanges.prototype.hasOwnPropertyChangeDescriptor = function (key) {
-    var objectPropertyChangeDescriptors = ObjectsPropertyChangeListeners.get(this);
-    if (!objectPropertyChangeDescriptors) {
-        return false;
-    }
-    if (!key) {
-        return true;
+    let path = [[], [], []];
+    for (let i of [0, 1, 2]) {
+        for (let v of vertices[i])
+            if ((v.x == minx || v.x == maxx) && (v.y == miny || v.y == maxy))
+                path[i].push(v);
+        if (path[i].length == 0)
+            for (let v of vertices[i])
+                if (v.x == minx || v.x == maxx || v.y == miny || v.y == maxy)
+                    path[i].push(v);
+        if (path[i].length == 0 || intersecting)
+            path[i] = vertices[i];
     }
-    if (objectPropertyChangeDescriptors[key] === void 0) {
-        return false;
+
+    let distanceMax = 0;
+    for (let i of path[0])
+        for (let j of path[1])
+            for (let k of path[2]) {
+                const distance = distance_fn(i, j, k);
+                distanceMax = Math.max(distanceMax, distance);
+            }
+
+    return distanceMax;
+}
+
+function minDistance3Rectangles(boxes, distance_fn) {
+    let vertices = [];
+    let minx, miny, maxx, maxy;
+    for (let r of [0, 1, 2]) {
+        vertices[r] = boxes[r].vertices();
+        minx = Math.min(minx || Infinity, boxes[r].x1);
+        miny = Math.min(miny || Infinity, boxes[r].y1);
+        maxx = Math.max(maxx || -Infinity, boxes[r].x2);
+        maxy = Math.max(maxy || -Infinity, boxes[r].y2);
     }
-    return true;
-};
 
-PropertyChanges.prototype.addOwnPropertyChangeListener = function (key, listener, beforeChange) {
-    if (this.makeObservable && !this.isObservable) {
-        this.makeObservable(); // particularly for observable arrays, for
-        // their length property
+    let path = [[], [], []];
+    for (let i of [0, 1, 2]) {
+        path[i] = vertices[i];
     }
-    var descriptor = PropertyChanges.getOwnPropertyChangeDescriptor(this, key),
-        listeners = beforeChange ? descriptor.willChangeListeners : descriptor.changeListeners;
 
-    PropertyChanges.makePropertyObservable(this, key);
+    let distanceMin = Infinity;
+    for (let i of path[0])
+        for (let j of path[1])
+            for (let k of path[2]) {
+                const distance = distance_fn(i, j, k);
+                distanceMin = Math.min(distanceMin, distance);
+            }
+
+    return distanceMin;
+}
 
-    if(!listeners._current) {
-        listeners._current = listener;
-    }
-    else if(!Array.isArray(listeners._current)) {
-        listeners._current = [listeners._current,listener];
+function maxDistance2Rectangles(boxes) {
+    let vertices = [];
+    let minx, miny, maxx, maxy;
+    for (let r of [0, 1]) {
+        vertices[r] = boxes[r].vertices();
+        minx = Math.min(minx || Infinity, boxes[r].x1);
+        miny = Math.min(miny || Infinity, boxes[r].y1);
+        maxx = Math.max(maxx || -Infinity, boxes[r].x2);
+        maxy = Math.max(maxy || -Infinity, boxes[r].y2);
     }
-    else {
-        listeners._current.push(listener);
+
+    let path = [[], []];
+    for (let i of [0, 1]) {
+        path[i] = vertices[i];
     }
 
-    var self = this;
-    return function cancelOwnPropertyChangeListener() {
-        PropertyChanges.removeOwnPropertyChangeListener(self, key, listener, beforeChange);
-        self = null;
-    };
-};
+    let distanceMax = 0;
+    for (let i of path[0])
+        for (let j of path[1]) {
+            const distance = i.distanceEarth(j);
+            distanceMax = Math.max(distanceMax, distance);
+        }
 
-PropertyChanges.prototype.addBeforeOwnPropertyChangeListener = function (key, listener) {
-    return PropertyChanges.addOwnPropertyChangeListener(this, key, listener, true);
-};
+    return distanceMax;
+}
 
-PropertyChanges.prototype.removeOwnPropertyChangeListener = function removeOwnPropertyChangeListener(key, listener, beforeChange) {
-    var descriptor = PropertyChanges.getOwnPropertyChangeDescriptor(this, key);
+function maxDistancePath(origin, path, pathStart) {
+    let distanceMax = 0;
+    for (let i of path[pathStart]) {
+        const distance1 = origin !== undefined ? i.distanceEarth(origin) : 0;
+        const distance2 = path.length > pathStart + 1 ? maxDistancePath(i, path, pathStart + 1) : 0;
+        distanceMax = Math.max(distanceMax, distance1 + distance2);
+    }
+    return distanceMax;
+}
 
-    var listeners;
-    if (beforeChange) {
-        listeners = descriptor._willChangeListeners;
-    } else {
-        listeners = descriptor._changeListeners;
+function maxDistanceNRectangles(boxes) {
+    let vertices = [];
+    let minx, miny, maxx, maxy;
+    let path = [];
+    for (let r in boxes) {
+        if (boxes[r] instanceof Box$1) {
+            vertices[r] = boxes[r].vertices();
+            minx = Math.min(minx || Infinity, boxes[r].x1);
+            miny = Math.min(miny || Infinity, boxes[r].y1);
+            maxx = Math.max(maxx || -Infinity, boxes[r].x2);
+            maxy = Math.max(maxy || -Infinity, boxes[r].y2);
+        } else if (boxes[r] instanceof Point$1) {
+            vertices[r] = [boxes[r]];
+            minx = Math.min(minx || Infinity, boxes[r].x);
+            miny = Math.min(miny || Infinity, boxes[r].y);
+            maxx = Math.max(maxx || -Infinity, boxes[r].x);
+            maxy = Math.max(maxy || -Infinity, boxes[r].y);
+        } else
+            throw new TypeError('boxes must contain only Box or Point');
+        path[r] = [];
     }
 
-    if(listeners) {
-        if(listeners._current) {
-            if(listeners._current === listener) {
-                listeners._current = null;
+    for (let i in boxes)
+        if (i > 0) {
+            const intersecting = boxes[i - 1].intersects(boxes[i]);
+            if (intersecting) {
+                boxes[i - 1].intersecting = true;
+                boxes[i].intersecting = true;
             }
-            else {
+        }
 
-                var index = listeners._current.lastIndexOf(listener);
-                if (index === -1) {
-                    throw new Error("Can't remove property change listener: does not exist: property name" + JSON.stringify(key));
-                }
-                if(descriptor.isActive) {
-                    listeners.ghostCount = listeners.ghostCount+1;
-                    listeners._current[index]=removeOwnPropertyChangeListener.ListenerGhost;
-                }
-                else {
-                    listeners._current.spliceOne(index);
-                }
-            }
+    for (let i in boxes) {
+        if (boxes[i].intersecting) {
+            path[i] = vertices[i];
+            continue;
         }
+        for (let v of vertices[i])
+            if ((v.x == minx || v.x == maxx) && (v.y == miny || v.y == maxy))
+                path[i].push(v);
+        if (path[i].length == 0)
+            for (let v of vertices[i])
+                if (v.x == minx || v.x == maxx || v.y == miny || v.y == maxy)
+                    path[i].push(v);
+        if (path[i].length == 0)
+            path[i] = vertices[i];
     }
-};
-PropertyChanges.prototype.removeOwnPropertyChangeListener.ListenerGhost = ListenerGhost;
 
-PropertyChanges.prototype.removeBeforeOwnPropertyChangeListener = function (key, listener) {
-    return PropertyChanges.removeOwnPropertyChangeListener(this, key, listener, true);
-};
+    let distanceMax = maxDistancePath(undefined, path, 0);
+    return distanceMax;
+}
 
-PropertyChanges.prototype.dispatchOwnPropertyChange = function dispatchOwnPropertyChange(key, value, beforeChange) {
-    var descriptor = PropertyChanges.getOwnPropertyChangeDescriptor(this, key),
-        listeners;
+function findClosestPairIn2Segments(p1, p2, opt) {
+    let precomputedAll = opt.flight.closestPairs.search({ minX: p1, minY: p2, maxX: p1, maxY: p2 });
+    let precomputed = precomputedAll.reduce((a, x) => (!a || x.in > a.in) ? x : a, undefined);
+    precomputed = precomputedAll.reduce((a, x) => (!a || x.out < a.out) ? x : a, precomputed);
+    if (precomputed !== undefined)
+        return precomputed.o;
 
-    if (!descriptor.isActive) {
-        descriptor.isActive = true;
-        listeners = beforeChange ? descriptor._willChangeListeners: descriptor._changeListeners;
-        try {
-            dispatchOwnPropertyChange.dispatchEach(listeners, key, value, this);
-        } finally {
-            descriptor.isActive = false;
-        }
+    const rtree = new Flatbush$1(p1 + 1 - opt.launch, 8);
+    const lc = Math.abs(Math.cos(util.radians(opt.flight.flightPoints[p1].y)));
+    for (let i = opt.launch; i <= p1; i++) {
+        const r = opt.flight.flightPoints[i];
+        rtree.add(r.x * lc, r.y, r.x * lc, r.y);
     }
-};
-PropertyChanges.prototype.dispatchOwnPropertyChange.dispatchEach = dispatchEach;
-
-function dispatchEach(listeners, key, value, object) {
-    if(listeners && listeners._current) {
-        // copy snapshot of current listeners to active listeners
-        var current,
-            listener,
-            i,
-            countI,
-            thisp,
-            specificHandlerMethodName = listeners.specificHandlerMethodName,
-            genericHandlerMethodName = listeners.genericHandlerMethodName,
-            Ghost = ListenerGhost;
+    rtree.finish();
 
-        if(Array.isArray(listeners._current)) {
-            //removeGostListenersIfNeeded returns listeners.current or a new filtered one when conditions are met
-            current = listeners.removeCurrentGostListenersIfNeeded();
-            //We use a for to guarantee we won't dispatch to listeners that would be added after we started
-            for(i=0, countI = current.length;i<countI;i++) {
-                if ((thisp = current[i]) !== Ghost) {
-                    //This is fixing the issue causing a regression in Montage's repetition
-                    listener = (
-                        thisp[specificHandlerMethodName] ||
-                        thisp[genericHandlerMethodName] ||
-                        thisp
-                    );
-                    if (!listener.call) {
-                        throw new Error("No event listener for " + listeners.specificHandlerName + " or " + listeners.genericHandlerName + " or call on " + listener);
-                    }
-                    listener.call(thisp, value, key, object);
-                }
+    precomputedAll = opt.flight.closestPairs.search({ minX: p1, minY: p2, maxX: p1, maxY: opt.landing });
+    const precomputedNext = precomputedAll.reduce((a, x) => (!a || x.out < a.out) ? x : a, undefined);
+    const lastUnknown = precomputedNext !== undefined ? precomputedNext.maxY : opt.landing;
+    let min = { d: Infinity };
+    for (let i = p2; i < lastUnknown; i++) {
+        const pout = opt.flight.flightPoints[i];
+        const n = rtree.neighbors(pout.x * lc, pout.y, 1)[0] + opt.launch;
+        if (n !== undefined) {
+            const pin = opt.flight.flightPoints[n];
+            const d = pout.distanceEarth(pin);
+            if (d < min.d) {
+                min.d = d;
+                min.out = pout;
+                min.in = pin;
             }
         }
-        else {
-            thisp = listeners._current;
-            listener = (
-                thisp[specificHandlerMethodName] ||
-                thisp[genericHandlerMethodName] ||
-                thisp
-            );
-            if (!listener.call) {
-                throw new Error("No event listener for " + listeners.specificHandlerName + " or " + listeners.genericHandlerName + " or call on " + listener);
-            }
-            listener.call(thisp, value, key, object);
+    }
+    if (precomputedNext !== undefined) {
+        const pout = precomputedNext.o.out;
+        const pin = precomputedNext.o.in;
+        const d = pout.distanceEarth(pin);
+        if (d < min.d) {
+            min.d = d;
+            min.out = pout;
+            min.in = pin;
         }
-
     }
-}
-
-dispatchEach.ListenerGhost = ListenerGhost;
 
+    opt.flight.closestPairs.insert({ minX: min.in.r, minY: p2, maxX: p1, maxY: min.out.r, o: min });
+    return min;
+}
 
-PropertyChanges.prototype.dispatchBeforeOwnPropertyChange = function (key, listener) {
-    return PropertyChanges.dispatchOwnPropertyChange(this, key, listener, true);
-};
+function findFurthestPointInSegment(sega, segb, target, opt) {
+    let points;
+    if (target instanceof Box$1)
+        points = target.vertices();
+    else if (target instanceof Point$1)
+        points = [target];
+    else
+        throw new TypeError('target must be either Point or Box');
+    
+    let pos;
+    let zSearch;
+    if (sega === opt.launch) {
+        pos = 0;
+        zSearch = +segb;
+    } else if (segb === opt.landing) {
+        pos = 1;
+        zSearch = +sega;
+    } else
+        throw new RangeError('this function supports seeking only from the launch or the landing point');
 
-var ObjectsOverriddenPropertyDescriptors = new weakMap$1(),
-    Objects__state__ = new weakMap$1(),
-    propertyListener = {
-        get: void 0,
-        set: void 0,
-        configurable: true,
-        enumerable: false
-    };
+    let distanceMax = -Infinity;
+    let fpoint;
+    for (let v of points) {
+        let distanceVMax = -Infinity;
+        let fVpoint;
 
-PropertyChanges.prototype.makePropertyObservable = function (key) {
-    // arrays are special.  we do not support direct setting of properties
-    // on an array.  instead, call .set(index, value).  this is observable.
-    // 'length' property is observable for all mutating methods because
-    // our overrides explicitly dispatch that change.
+        let precomputed;
+        const precomputedAll = opt.flight.furthestPoints[pos].get(v.x + ':' + v.y);
+        for (const p of precomputedAll || []) {
+            if (zSearch >= p.min && zSearch <= p.max) {
+                precomputed = p;
+                break;
+            }
+        }
 
+        if (precomputed)
+            if (sega <= precomputed.o.r && precomputed.o.r <= segb) {
+                distanceVMax = v.distanceEarth(precomputed.o);
+                fVpoint = precomputed.o;
+            } else
+                throw new Error('furthestPoints cache inconsistency');
 
-    var overriddenPropertyDescriptors = ObjectsOverriddenPropertyDescriptors.get(this);
-    if (overriddenPropertyDescriptors && overriddenPropertyDescriptors.get(key) !== void 0) {
-        // if we have already recorded an overridden property descriptor,
-        // we have already installed the observer, so short-here
-        return;
-    }
+        if (fVpoint === undefined) {
+            let intersecting = false;
+            let canCache = false;
 
-    // memoize overridden property descriptor table
-    if (!overriddenPropertyDescriptors) {
-        if (Array.isArray(this)) {
-            return;
+            for (let p = sega; p <= segb; p++) {
+                const f = opt.flight.flightPoints[p];
+                if (target instanceof Box$1 && target.intersects(f)) {
+                    intersecting = true;
+                    continue;
+                }
+                const d = v.distanceEarth(f);
+                if (d > distanceVMax) {
+                    distanceVMax = d;
+                    fVpoint = f;
+                    canCache = true;
+                }
+            }
+            if (intersecting) {
+                for (let p of points) {
+                    const d = v.distanceEarth(p);
+                    if (d > distanceVMax) {
+                        distanceVMax = d;
+                        fVpoint = target;
+                        canCache = false;
+                    }
+                }
+            }
+            if (canCache) {
+                let zCache;
+                if (sega === opt.launch) {
+                    zCache = { min: +fVpoint.r, max: +segb };
+                } else if (segb === opt.landing) {
+                    zCache = { min: +sega, max: +fVpoint.r };
+                }
+
+                let c = precomputedAll;
+                if (!c) {
+                    c = [];
+                    opt.flight.furthestPoints[pos].set(v.x + ':' + v.y, c);
+                }
+                const existing = c.filter(x => x.o.r == fVpoint.r && !(zCache.max <= x.min || zCache.min >= x.max))[0];
+                if (existing) {
+                    existing.min = Math.min(zCache.min, existing.min);
+                    existing.max = Math.max(zCache.max, existing.max);
+                } else
+                    c.push({ ...zCache, o: fVpoint });
+            }
         }
-        if (!Object.isExtensible(this)) {
-            throw new Error("Can't make property " + JSON.stringify(key) + " observable on " + this + " because object is not extensible");
+        if (distanceVMax > distanceMax) {
+            distanceMax = distanceVMax;
+            fpoint = fVpoint;
         }
-        overriddenPropertyDescriptors = new _map();
-        ObjectsOverriddenPropertyDescriptors.set(this,overriddenPropertyDescriptors);
     }
+    if (fpoint === undefined)
+        fpoint = target;
 
-    // var state = Objects__state__.get(this);
-    // if (typeof state !== "object") {
-    //     Objects__state__.set(this,(state = {}));
-    // }
-    // state[key] = this[key];
+    return fpoint;
+}
 
+function isTriangleClosed(p1, p2, distance, opt) {
+    const fastCandidates = opt.flight.closestPairs.search({ minX: opt.launch, minY: p2, maxX: p1, maxY: opt.landing });
+    for (let f of fastCandidates)
+        if (f.o.d <= opt.scoring.closingDistanceFree)
+            return f.o;
 
+    const min = findClosestPairIn2Segments(p1, p2, opt);
 
-    // walk up the prototype chain to find a property descriptor for
-    // the property name
-    var overriddenDescriptor;
-    var attached = this;
-    do {
-        overriddenDescriptor = Object.getOwnPropertyDescriptor(attached, key);
-        if (overriddenDescriptor) {
-            break;
-        }
-        attached = Object.getPrototypeOf(attached);
-    } while (attached);
-    // or default to an undefined value
-    if (!overriddenDescriptor) {
-        overriddenDescriptor = {
-            value: void 0,
-            enumerable: true,
-            writable: true,
-            configurable: true
-        };
-    } else {
-        if (!overriddenDescriptor.configurable) {
-            return;
-        }
-        if (!overriddenDescriptor.writable && !overriddenDescriptor.set) {
-            return;
-        }
-    }
+    if (min.d <= opt.scoring.closingDistance(distance, opt))
+        return min;
+    return false;
+}
 
-    // memoize the descriptor so we know not to install another layer,
-    // and so we can reuse the overridden descriptor when uninstalling
-    overriddenPropertyDescriptors.set(key,overriddenDescriptor);
+function init(opt) {
+    opt.flight.closestPairs = new RBush$1();
+    opt.flight.furthestPoints = [new map(), new map()];
+    opt.flight.flightPoints = new Array(opt.flight.filtered.length);
+    for (let r in opt.flight.filtered)
+        opt.flight.flightPoints[r] = new Point$1(opt.flight.filtered, r);
+}
 
+var geom = {
+    maxDistance3Rectangles,
+    maxDistance2Rectangles,
+    minDistance3Rectangles,
+    maxDistanceNRectangles,
+    findFurthestPointInSegment,
+    isTriangleClosed,
+    init
+};
 
-    // TODO reflect current value on a displayed property
+function closingPenalty(cd, opt) {
+    return (cd > (opt.scoring.closingDistanceFree || 0) ? cd : 0);
+}
 
-    // in both of these new descriptor variants, we reuse the overridden
-    // descriptor to either store the current value or apply getters
-    // and setters.  this is handy since we can reuse the overridden
-    // descriptor if we uninstall the observer.  We even preserve the
-    // assignment semantics, where we get the value from up the
-    // prototype chain, and set as an owned property.
-    if ('value' in overriddenDescriptor) {
-        propertyListener.get = function dispatchingGetter() {
-            return dispatchingGetter.overriddenDescriptor.value;
-        };
-        propertyListener.set = function dispatchingSetter(value) {
-            var descriptor,
-                isActive,
-                overriddenDescriptor = dispatchingSetter.overriddenDescriptor;
+function closingWithLimit(distance, opt) {
+    return Math.max(opt.scoring.closingDistanceFixed || 0, distance * (opt.scoring.closingDistanceRelative || 0));
+}
 
-            if (value !== overriddenDescriptor.value) {
-                if (!(isActive = (descriptor = dispatchingSetter.descriptor).isActive)) {
-                    descriptor.isActive = true;
-                    try {
-                        dispatchingSetter.dispatchEach(descriptor._willChangeListeners, dispatchingSetter.key, overriddenDescriptor.value, this);
-                    } finally {}
-                }
-                overriddenDescriptor.value = value;
-                if (!isActive) {
-                    try {
-                        dispatchingSetter.dispatchEach(descriptor._changeListeners, dispatchingSetter.key, value, this);
-                    } finally {
-                        descriptor.isActive = false;
-                    }
-                }
-            }
-        };
-        propertyListener.set.dispatchEach = dispatchEach;
-        propertyListener.set.key = key;
-        propertyListener.get.overriddenDescriptor = propertyListener.set.overriddenDescriptor = overriddenDescriptor;
-        propertyListener.set.descriptor = ObjectsPropertyChangeListeners.get(this)[key];
+/*eslint no-unused-vars: ["error", { "args": "none" }]*/
+function closingWithPenalty(distance, opt) {
+    return Infinity;
+}
 
-        propertyListener.enumerable = overriddenDescriptor.enumerable;
+function boundDistance3Points(ranges, boxes, opt) {
+    const pin = geom.findFurthestPointInSegment(opt.launch, ranges[0].a, boxes[0], opt);
+    const pout = geom.findFurthestPointInSegment(ranges[2].b, opt.landing, boxes[2], opt);
+    const maxDistance = geom.maxDistanceNRectangles([pin, boxes[0], boxes[1], boxes[2], pout]);
+    return maxDistance * opt.scoring.multiplier;
+}
 
-        propertyListener.configurable = true;
+function scoreDistance3Points(tp, opt) {
+    let distance = 0;
+    const pin = geom.findFurthestPointInSegment(opt.launch, tp[0].r, tp[0], opt);
+    const pout = geom.findFurthestPointInSegment(tp[2].r, opt.landing, tp[2], opt);
+    const all = [pin, tp[0], tp[1], tp[2], pout];
+    for (let i of [0, 1, 2, 3])
+        distance += all[i].distanceEarth(all[i + 1]);
+    const score = distance * opt.scoring.multiplier;
+    return { distance, score, tp: tp, ep: { start: pin, finish: pout } };
+}
 
-    } else { // 'get' or 'set', but not necessarily both
-            propertyListener.get = overriddenDescriptor.get;
-            propertyListener.set = function dispatchingSetter() {
-                var formerValue = dispatchingSetter.overriddenGetter.call(this),
-                    descriptor,
-                    isActive,
-                    newValue;
+function maxFAIDistance(maxTriDistance, boxes, opt) {
+    const minTriDistance = geom.minDistance3Rectangles(boxes, (i, j, k) => {
+        return i.distanceEarth(j) + j.distanceEarth(k) + k.distanceEarth(i);
+    });
 
+    const maxAB = geom.maxDistance2Rectangles([boxes[0], boxes[1]]);
+    const maxBC = geom.maxDistance2Rectangles([boxes[1], boxes[2]]);
+    const maxCA = geom.maxDistance2Rectangles([boxes[2], boxes[0]]);
+    const maxDistance = Math.min(maxAB / opt.scoring.minSide,
+        maxBC / opt.scoring.minSide, maxCA / opt.scoring.minSide, maxTriDistance);
+    if (maxDistance < minTriDistance)
+        return 0;
+    return maxDistance;
+}
 
-                    if(arguments.length === 1) {
-                        dispatchingSetter.overriddenSetter.call(this,arguments[0]);
-                    }
-                    else if(arguments.length === 2) {
-                        dispatchingSetter.overriddenSetter.call(this,arguments[0],arguments[1]);
-                    }
-                    else {
-                        dispatchingSetter.overriddenSetter.apply(this, arguments);
-                    }
+function boundOpenTriangle(ranges, boxes, opt) {
+    const pin = geom.findFurthestPointInSegment(opt.launch, ranges[0].a, boxes[0], opt);
+    const pout = geom.findFurthestPointInSegment(ranges[2].b, opt.landing, boxes[2], opt);
+    const maxD3PDistance = geom.maxDistanceNRectangles([pin, boxes[0], boxes[1], boxes[2], pout]);
+    const maxTriDistance = geom.maxDistance3Rectangles(boxes, (i, j, k) => {
+        return i.distanceEarth(j) + j.distanceEarth(k) + k.distanceEarth(i);
+    });
+    if (opt.scoring.minSide !== undefined) {
+        if (maxFAIDistance(maxTriDistance, boxes, opt) === 0)
+            return 0;
+    }
 
-                if ((newValue = dispatchingSetter.overriddenGetter.call(this)) !== formerValue) {
-                    descriptor = dispatchingSetter.descriptor;
-                    if (!(isActive = descriptor.isActive)) {
-                        descriptor.isActive = true;
-                        try {
-                            dispatchingSetter.dispatchEach(descriptor._willChangeListeners, key, formerValue, this);
-                        } finally {}
-                    }
-                    if (!isActive) {
-                        try {
-                            dispatchingSetter.dispatchEach(descriptor._changeListeners, key, newValue, this);
-                        } finally {
-                            descriptor.isActive = false;
-                        }
-                    }
-                }
-            };
-            propertyListener.enumerable = overriddenDescriptor.enumerable;
-            propertyListener.configurable = true;
-        propertyListener.set.dispatchEach = dispatchEach;
-        propertyListener.set.overriddenSetter = overriddenDescriptor.set;
-        propertyListener.set.overriddenGetter = overriddenDescriptor.get;
-        propertyListener.set.descriptor = ObjectsPropertyChangeListeners.get(this)[key];
+    let cp = { d: 0 };
+    if (ranges[0].b < ranges[2].a) {
+        cp = geom.isTriangleClosed(ranges[0].b, ranges[2].a, maxTriDistance, opt);
+        if (!cp)
+            return 0;
+        return (maxD3PDistance - closingPenalty(cp.d, opt)) * opt.scoring.multiplier;
     }
 
-    Object.defineProperty(this, key, propertyListener);
-};
+    return maxD3PDistance * opt.scoring.multiplier;
+}
 
-// constructor functions
+function scoreOpenTriangle(tp, opt) {
+    const d0 = tp[0].distanceEarth(tp[1]);
+    const d1 = tp[1].distanceEarth(tp[2]);
+    const d2 = tp[2].distanceEarth(tp[0]);
+    const triDistance = d0 + d1 + d2;
 
-PropertyChanges.getOwnPropertyChangeDescriptor = function (object, key) {
-    if (object.getOwnPropertyChangeDescriptor) {
-        return object.getOwnPropertyChangeDescriptor(key);
-    } else {
-        return PropertyChanges.prototype.getOwnPropertyChangeDescriptor.call(object, key);
+    if (opt.scoring.minSide !== undefined) {
+        const minSide = opt.scoring.minSide * triDistance;
+        if (d0 < minSide || d1 < minSide || d2 < minSide)
+            return { score: 0 };
     }
-};
 
-PropertyChanges.hasOwnPropertyChangeDescriptor = function (object, key) {
-    if (object.hasOwnPropertyChangeDescriptor) {
-        return object.hasOwnPropertyChangeDescriptor(key);
-    } else {
-        return PropertyChanges.prototype.hasOwnPropertyChangeDescriptor.call(object, key);
-    }
-};
+    let cp = geom.isTriangleClosed(tp[0].r, tp[2].r, triDistance, opt);
+    if (!cp)
+        return { score: 0 };
 
-PropertyChanges.addOwnPropertyChangeListener = function (object, key, listener, beforeChange) {
-    if (Object.isObject(object)) {
-        return object.addOwnPropertyChangeListener
-            ? object.addOwnPropertyChangeListener(key, listener, beforeChange)
-            : this.prototype.addOwnPropertyChangeListener.call(object, key, listener, beforeChange);
-    }
-};
+    let d3pDistance = 0;
+    const pin = geom.findFurthestPointInSegment(opt.launch, tp[0].r, tp[0], opt);
+    const pout = geom.findFurthestPointInSegment(tp[2].r, opt.landing, tp[2], opt);
+    const all = [pin, tp[0], tp[1], tp[2], pout];
+    for (let i of [0, 1, 2, 3])
+        d3pDistance += all[i].distanceEarth(all[i + 1]);
+    
+    const distance = d3pDistance;
+    const score = distance * opt.scoring.multiplier - closingPenalty(cp.d, opt);
+    return { distance, score, tp: tp, ep: { start: pin, finish: pout }, cp };
+}
 
-PropertyChanges.removeOwnPropertyChangeListener = function (object, key, listener, beforeChange) {
-    if (!Object.isObject(object)) ; else if (object.removeOwnPropertyChangeListener) {
-        return object.removeOwnPropertyChangeListener(key, listener, beforeChange);
-    } else {
-        return PropertyChanges.prototype.removeOwnPropertyChangeListener.call(object, key, listener, beforeChange);
+function boundTriangle(ranges, boxes, opt) {
+    const maxTriDistance = geom.maxDistance3Rectangles(boxes, (i, j, k) => {
+        return i.distanceEarth(j) + j.distanceEarth(k) + k.distanceEarth(i);
+    });
+
+    const maxDistance = (opt.scoring.minSide !== undefined)
+        ? maxFAIDistance(maxTriDistance, boxes, opt)
+        : maxTriDistance;
+    
+    if (maxDistance === 0)
+        return 0;
+
+    let cp = { d: 0 };
+    if (ranges[0].b < ranges[2].a) {
+        cp = geom.isTriangleClosed(ranges[0].b, ranges[2].a, maxDistance, opt);
+        if (!cp)
+            return 0;
+        return (maxDistance - closingPenalty(cp.d, opt)) * opt.scoring.multiplier;
     }
-};
 
-PropertyChanges.dispatchOwnPropertyChange = function (object, key, value, beforeChange) {
-    if (!Object.isObject(object)) ; else if (object.dispatchOwnPropertyChange) {
-        return object.dispatchOwnPropertyChange(key, value, beforeChange);
-    } else {
-        return PropertyChanges.prototype.dispatchOwnPropertyChange.call(object, key, value, beforeChange);
+    return maxDistance * opt.scoring.multiplier;
+}
+
+function scoreTriangle(tp, opt) {
+    const d0 = tp[0].distanceEarth(tp[1]);
+    const d1 = tp[1].distanceEarth(tp[2]);
+    const d2 = tp[2].distanceEarth(tp[0]);
+    const distance = d0 + d1 + d2;
+    
+    if (opt.scoring.minSide !== undefined) {
+        const minSide = opt.scoring.minSide * distance;
+        if (d0 < minSide || d1 < minSide || d2 < minSide)
+            return { score: 0 };
     }
-};
 
-PropertyChanges.addBeforeOwnPropertyChangeListener = function (object, key, listener) {
-    return PropertyChanges.addOwnPropertyChangeListener(object, key, listener, true);
-};
+    let cp = geom.isTriangleClosed(tp[0].r, tp[2].r, distance, opt);
+    if (!cp)
+        return { score: 0 };
 
-PropertyChanges.removeBeforeOwnPropertyChangeListener = function (object, key, listener) {
-    return PropertyChanges.removeOwnPropertyChangeListener(object, key, listener, true);
-};
+    let score = (distance - closingPenalty(cp.d, opt)) * opt.scoring.multiplier;
 
-PropertyChanges.dispatchBeforeOwnPropertyChange = function (object, key, value) {
-    return PropertyChanges.dispatchOwnPropertyChange(object, key, value, true);
+    return { distance, score, tp, cp };
+}
+
+var scoring = {
+    closingWithLimit,
+    closingWithPenalty,
+    boundTriangle,
+    scoreTriangle,
+    boundDistance3Points,
+    scoreDistance3Points,
+    boundOpenTriangle,
+    scoreOpenTriangle
 };
 
-PropertyChanges.makePropertyObservable = function (object, key) {
-    if (object.makePropertyObservable) {
-        return object.makePropertyObservable(key);
-    } else {
-        return PropertyChanges.prototype.makePropertyObservable.call(object, key);
-    }
+/**
+ * These are the scoring types
+ * @enum {object[][]} scoringRules
+ *
+ * The differences are mostly in the mutipliers and the way the closing distances of the triangles are calculated
+ * 
+ * These are the tools that are already implemented in scoring.js/geom.js:
+ * @param {function} closingDistance is the triangle closing type, you choose between two types:
+ *      closingWithLimit - closing distance is limited
+ *      closingWithPenalty - closing distance is unlimited but incurs a penalty
+ * @param {number} closingDistanceFixed is the fixed closing distance that is always accepted
+ * @param {number} closingDistanceFree is the closing distance that does not incur any scoring penalty
+ * @param {number} closingDistanceRelative is the closing distance that is relative to the full triangle length but incurs a penalty
+ */
+const scoringRules = {
+    /**
+     * @constant {object[]}
+     */
+    'FFVL': [
+        {
+            name: 'Distance 3 points',
+            multiplier: 1,
+            bound: scoring.boundDistance3Points,
+            score: scoring.scoreDistance3Points,
+            rounding: round2,
+            cardinality: 3,
+            code: 'od'
+        },
+        {
+            name: 'Triangle plat',
+            multiplier: 1.2,
+            bound: scoring.boundTriangle,
+            score: scoring.scoreTriangle,
+            closingDistance: scoring.closingWithLimit,
+            closingDistanceFixed: 3,
+            closingDistanceFree: 3,
+            closingDistanceRelative: 0.05,
+            rounding: round2,
+            cardinality: 3,
+            code: 'tri'
+        },
+        {
+            name: 'Triangle FAI',
+            multiplier: 1.4,
+            bound: scoring.boundTriangle,
+            score: scoring.scoreTriangle,
+            minSide: 0.28,
+            closingDistance: scoring.closingWithLimit,
+            closingDistanceFixed: 3,
+            closingDistanceFree: 3,
+            closingDistanceRelative: 0.05,
+            rounding: round2,
+            cardinality: 3,
+            code: 'fai'
+        }
+    ],
+    /**
+     * @constant {object[]}
+     */
+    'XContest': [
+        {
+            name: 'Free flight',
+            multiplier: 1,
+            bound: scoring.boundDistance3Points,
+            score: scoring.scoreDistance3Points,
+            rounding: round2,
+            cardinality: 3,
+            code: 'od'
+        },
+        {
+            name: 'Free triangle',
+            multiplier: 1.2,
+            bound: scoring.boundTriangle,
+            score: scoring.scoreTriangle,
+            closingDistance: scoring.closingWithLimit,
+            closingDistanceRelative: 0.2,
+            rounding: round2,
+            cardinality: 3,
+            code: 'tri'
+        },
+        {
+            name: 'FAI triangle',
+            multiplier: 1.4,
+            bound: scoring.boundTriangle,
+            score: scoring.scoreTriangle,
+            minSide: 0.28,
+            closingDistance: scoring.closingWithLimit,
+            closingDistanceRelative: 0.2,
+            rounding: round2,
+            cardinality: 3,
+            code: 'fai'
+        },
+        {
+            name: 'Closed free triangle',
+            multiplier: 1.4,
+            bound: scoring.boundTriangle,
+            score: scoring.scoreTriangle,
+            closingDistance: scoring.closingWithLimit,
+            closingDistanceFixed: 0,
+            closingDistanceFree: 0,
+            closingDistanceRelative: 0.05,
+            rounding: round2,
+            cardinality: 3,
+            code: 'tri'
+        },
+        {
+            name: 'Closed FAI triangle',
+            multiplier: 1.6,
+            bound: scoring.boundTriangle,
+            score: scoring.scoreTriangle,
+            minSide: 0.28,
+            closingDistance: scoring.closingWithLimit,
+            closingDistanceFixed: 0,
+            closingDistanceFree: 0,
+            closingDistanceRelative: 0.05,
+            rounding: round2,
+            cardinality: 3,
+            code: 'fai'
+        }
+    ]
 };
 
+function round2(score) {
+    return parseFloat(parseFloat(score).toFixed(2));
+}
+
+var scoringRules_config = scoringRules;
+
 //TODO:
 // Remove Dict and use native Map as much as possible here
 //Use ObjectChangeDescriptor to avoid creating useless arrays and benefit from similar gains made in property-changes
 
 
-var ObjectChangeDescriptor$1 = changeDescriptor.ObjectChangeDescriptor,
-    ChangeListenersRecord = changeDescriptor.ChangeListenersRecord,
-    ListenerGhost$1 = changeDescriptor.ListenerGhost;
+var ObjectChangeDescriptor$2 = changeDescriptor.ObjectChangeDescriptor,
+    ChangeListenersRecord$1 = changeDescriptor.ChangeListenersRecord,
+    ListenerGhost$2 = changeDescriptor.ListenerGhost;
 
 var rangeChangeDescriptors = new weakMap$1(); // {isActive, willChangeListeners, changeListeners}
 
@@ -7536,7 +7166,7 @@ function RangeChangeDescriptor(name) {
     this._willChangeListeners = null;
     this._changeListeners = null;
 }
-RangeChangeDescriptor.prototype = new ObjectChangeDescriptor$1();
+RangeChangeDescriptor.prototype = new ObjectChangeDescriptor$2();
 RangeChangeDescriptor.prototype.constructor = RangeChangeDescriptor;
 
 RangeChangeDescriptor.prototype.changeListenersRecordConstructor = RangeChangeListenersRecord;
@@ -7562,7 +7192,7 @@ function RangeChangeListenersRecord(name) {
     this.specificHandlerMethodName = specificHandlerMethodName;
 	return this;
 }
-RangeChangeListenersRecord.prototype = new ChangeListenersRecord();
+RangeChangeListenersRecord.prototype = new ChangeListenersRecord$1();
 RangeChangeListenersRecord.prototype.constructor = RangeChangeListenersRecord;
 
 var RangeWillChangeListenersSpecificHandlerMethodName = new _map();
@@ -7579,7 +7209,7 @@ function RangeWillChangeListenersRecord(name) {
     this.specificHandlerMethodName = specificHandlerMethodName;
     return this;
 }
-RangeWillChangeListenersRecord.prototype = new ChangeListenersRecord();
+RangeWillChangeListenersRecord.prototype = new ChangeListenersRecord$1();
 RangeWillChangeListenersRecord.prototype.constructor = RangeWillChangeListenersRecord;
 
 var rangeChanges = RangeChanges;
@@ -7610,8 +7240,8 @@ var ObjectsDispatchesRangeChanges = new weakMap$1(),
     dispatchesRangeChangesSetter = function(value) {
         return ObjectsDispatchesRangeChanges.set(this,value);
     },
-    dispatchesChangesMethodName = "dispatchesRangeChanges",
-    dispatchesChangesPropertyDescriptor = {
+    dispatchesChangesMethodName$1 = "dispatchesRangeChanges",
+    dispatchesChangesPropertyDescriptor$1 = {
         get: dispatchesRangeChangesGetter,
         set: dispatchesRangeChangesSetter,
         configurable: true,
@@ -7644,8 +7274,8 @@ RangeChanges.prototype.addRangeChangeListener = function addRangeChangeListener(
         listeners._current.push(listener);
     }
 
-    if(Object.getOwnPropertyDescriptor((this.__proto__||Object.getPrototypeOf(this)),dispatchesChangesMethodName) === void 0) {
-        Object.defineProperty((this.__proto__||Object.getPrototypeOf(this)), dispatchesChangesMethodName, dispatchesChangesPropertyDescriptor);
+    if(Object.getOwnPropertyDescriptor((this.__proto__||Object.getPrototypeOf(this)),dispatchesChangesMethodName$1) === void 0) {
+        Object.defineProperty((this.__proto__||Object.getPrototypeOf(this)), dispatchesChangesMethodName$1, dispatchesChangesPropertyDescriptor$1);
     }
     this.dispatchesRangeChanges = true;
 
@@ -7683,7 +7313,7 @@ RangeChanges.prototype.removeRangeChangeListener = function (listener, token, be
             else {
                 if(descriptor.isActive) {
                     listeners.ghostCount = listeners.ghostCount+1;
-                    listeners._current[index]=ListenerGhost$1;
+                    listeners._current[index]=ListenerGhost$2;
                 }
                 else {
                     listeners._current.spliceOne(index);
@@ -7728,7 +7358,7 @@ RangeChanges.prototype.dispatchRangeChange = function (plus, minus, index, befor
                     try {
                             //removeGostListenersIfNeeded returns listeners.current or a new filtered one when conditions are met
                             currentListeners = listeners.removeCurrentGostListenersIfNeeded();
-                            Ghost = ListenerGhost$1;
+                            Ghost = ListenerGhost$2;
                         for(i=0, countI = currentListeners.length;i<countI;i++) {
                             if ((listener = currentListeners[i]) !== Ghost) {
                                 if (listener[tokenName]) {
@@ -9134,7 +8764,7 @@ function* solver(flight$1, _scoringTypes, _config) {
 var solver_1 = solver;
 
 var manufacturers = /*#__PURE__*/Object.freeze({
-    __proto__: null
+	__proto__: null
 });
 
 var MANUFACTURERS = getCjsExportFromNamespace(manufacturers);
diff --git a/package-lock.json b/package-lock.json
index 120f936..0e8c13f 100644
--- a/package-lock.json
+++ b/package-lock.json
@@ -1,6 +1,6 @@
 {
   "name": "igc-xc-score",
-  "version": "1.5.1",
+  "version": "1.5.2",
   "lockfileVersion": 1,
   "requires": true,
   "dependencies": {
diff --git a/package.json b/package.json
index f19b747..59ca2e0 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "igc-xc-score",
-  "version": "1.5.1",
+  "version": "1.5.2",
   "description": "igc-xc-score is a paragliding and hang-gliding XC scoring program in vanilla JS",
   "main": "index.cjs.js",
   "module": "index.es.js",