@deck.gl/aggregation-layers 8.6.0 → 8.6.4

package/dist/es5/utils/aggregation-operation-utils.js

@@ -10,7 +10,7 @@ exports.getMin = getMin;
 exports.getValueFunc = getValueFunc;
 exports.wrapGetValueFunc = wrapGetValueFunc;
 exports.AGGREGATION_OPERATION = void 0;
-var AGGREGATION_OPERATION = {
+const AGGREGATION_OPERATION = {
   SUM: 1,
   MEAN: 2,
   MIN: 3,
@@ -35,7 +35,7 @@ function getMean(pts, accessor) {
     return pts.length ? accessor : null;
   }
 
-  var filtered = pts.map(accessor).filter(Number.isFinite);
+  const filtered = pts.map(accessor).filter(Number.isFinite);
   return filtered.length ? filtered.reduce(sumReducer, 0) / filtered.length : null;
 }
 
@@ -44,7 +44,7 @@ function getSum(pts, accessor) {
     return pts.length ? pts.length * accessor : null;
   }
 
-  var filtered = pts.map(accessor).filter(Number.isFinite);
+  const filtered = pts.map(accessor).filter(Number.isFinite);
   return filtered.length ? filtered.reduce(sumReducer, 0) : null;
 }
 
@@ -53,7 +53,7 @@ function getMax(pts, accessor) {
     return pts.length ? accessor : null;
   }
 
-  var filtered = pts.map(accessor).filter(Number.isFinite);
+  const filtered = pts.map(accessor).filter(Number.isFinite);
   return filtered.length ? filtered.reduce(maxReducer, -Infinity) : null;
 }
 
@@ -62,62 +62,47 @@ function getMin(pts, accessor) {
     return pts.length ? accessor : null;
   }
 
-  var filtered = pts.map(accessor).filter(Number.isFinite);
+  const filtered = pts.map(accessor).filter(Number.isFinite);
   return filtered.length ? filtered.reduce(minReducer, Infinity) : null;
 }
 
 function getValueFunc(aggregation, accessor, context) {
-  var op = AGGREGATION_OPERATION[aggregation] || AGGREGATION_OPERATION.SUM;
+  const op = AGGREGATION_OPERATION[aggregation] || AGGREGATION_OPERATION.SUM;
   accessor = wrapAccessor(accessor, context);
 
   switch (op) {
     case AGGREGATION_OPERATION.MIN:
-      return function (pts) {
-        return getMin(pts, accessor);
-      };
+      return pts => getMin(pts, accessor);
 
     case AGGREGATION_OPERATION.SUM:
-      return function (pts) {
-        return getSum(pts, accessor);
-      };
+      return pts => getSum(pts, accessor);
 
     case AGGREGATION_OPERATION.MEAN:
-      return function (pts) {
-        return getMean(pts, accessor);
-      };
+      return pts => getMean(pts, accessor);
 
     case AGGREGATION_OPERATION.MAX:
-      return function (pts) {
-        return getMax(pts, accessor);
-      };
+      return pts => getMax(pts, accessor);
 
     default:
       return null;
   }
 }
 
-function wrapAccessor(accessor) {
-  var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
-
+function wrapAccessor(accessor, context = {}) {
   if (Number.isFinite(accessor)) {
     return accessor;
   }
 
-  return function (pt) {
+  return pt => {
     context.index = pt.index;
     return accessor(pt.source, context);
   };
 }
 
-function wrapGetValueFunc(getValue) {
-  var context = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};
-  return function (pts) {
-    context.indices = pts.map(function (pt) {
-      return pt.index;
-    });
-    return getValue(pts.map(function (pt) {
-      return pt.source;
-    }), context);
+function wrapGetValueFunc(getValue, context = {}) {
+  return pts => {
+    context.indices = pts.map(pt => pt.index);
+    return getValue(pts.map(pt => pt.source), context);
   };
 }
 //# sourceMappingURL=aggregation-operation-utils.js.map

package/dist/es5/utils/aggregation-operation-utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/utils/aggregation-operation-utils.js"],"names":["AGGREGATION_OPERATION","SUM","MEAN","MIN","MAX","sumReducer","accu","cur","maxReducer","minReducer","getMean","pts","accessor","Number","isFinite","length","filtered","map","filter","reduce","getSum","getMax","Infinity","getMin","getValueFunc","aggregation","context","op","wrapAccessor","pt","index","source","wrapGetValueFunc","getValue","indices"],"mappings":";;;;;;;;;;;;AAoBO,IAAMA,qBAAqB,GAAG;AACnCC,EAAAA,GAAG,EAAE,CAD8B;AAEnCC,EAAAA,IAAI,EAAE,CAF6B;AAGnCC,EAAAA,GAAG,EAAE,CAH8B;AAInCC,EAAAA,GAAG,EAAE;AAJ8B,CAA9B;;;AAOP,SAASC,UAAT,CAAoBC,IAApB,EAA0BC,GAA1B,EAA+B;AAC7B,SAAOD,IAAI,GAAGC,GAAd;AACD;;AAED,SAASC,UAAT,CAAoBF,IAApB,EAA0BC,GAA1B,EAA+B;AAC7B,SAAOA,GAAG,GAAGD,IAAN,GAAaC,GAAb,GAAmBD,IAA1B;AACD;;AAED,SAASG,UAAT,CAAoBH,IAApB,EAA0BC,GAA1B,EAA+B;AAC7B,SAAOA,GAAG,GAAGD,IAAN,GAAaC,GAAb,GAAmBD,IAA1B;AACD;;AAEM,SAASI,OAAT,CAAiBC,GAAjB,EAAsBC,QAAtB,EAAgC;AACrC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaH,QAAb,GAAwB,IAA/B;AACD;;AACD,MAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBd,UAAhB,EAA4B,CAA5B,IAAiCW,QAAQ,CAACD,MAA5D,GAAqE,IAA5E;AACD;;AAEM,SAASK,MAAT,CAAgBT,GAAhB,EAAqBC,QAArB,EAA+B;AACpC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaJ,GAAG,CAACI,MAAJ,GAAaH,QAA1B,GAAqC,IAA5C;AACD;;AACD,MAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBd,UAAhB,EAA4B,CAA5B,CAAlB,GAAmD,IAA1D;AACD;;AAEM,SAASgB,MAAT,CAAgBV,GAAhB,EAAqBC,QAArB,EAA+B;AACpC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaH,QAAb,GAAwB,IAA/B;AACD;;AACD,MAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBX,UAAhB,EAA4B,CAACc,QAA7B,CAAlB,GAA2D,IAAlE;AACD;;AAEM,SAASC,MAAT,CAAgBZ,GAAhB,EAAqBC,QAArB,EAA+B;AACpC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaH,QAAb,GAAwB,IAA/B;AACD;;AACD,MAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBV,UAAhB,EAA4Ba,QAA5B,CAAlB,GAA0D,IAAjE;AACD;;AAGM,SAASE,YAAT,CAAsBC,WAAtB,EAAmCb,QAAnC,EAA6Cc,OAA7C,EAAsD;AAC3D,MAAMC,EAAE,GAAG3B,qBAAqB,CAACyB,WAAD,CAArB,IAAsCzB,qBAAqB,CAACC,GAAvE;AACAW,EAAAA,QAAQ,GAAGgB,YAAY,CAAChB,QAAD,EAAWc,OAAX,CAAvB;;AACA,UAAQC,EAAR;AACE,SAAK3B,qBAAqB,CAACG,GAA3B;AACE,aAAO,UAAAQ,GAAG;AAAA,eAAIY,MAAM,CAACZ,GAAD,EAAMC,QAAN,CAAV;AAAA,OAAV;;AACF,SAAKZ,qBAAqB,CAACC,GAA3B;AACE,aAAO,UAAAU,GAAG;AAAA,eAAIS,MAAM,CAACT,GAAD,EAAMC,QAAN,CAAV;AAAA,OAAV;;AACF,SAAKZ,qBAAqB,CAACE,IAA3B;AACE,aAAO,UAAAS,GAAG;AAAA,eAAID,OAAO,CAACC,GAAD,EAAMC,QAAN,CAAX;AAAA,OAAV;;AACF,SAAKZ,qBAAqB,CAACI,GAA3B;AACE,aAAO,UAAAO,GAAG;AAAA,eAAIU,MAAM,CAACV,GAAD,EAAMC,QAAN,CAAV;AAAA,OAAV;;AACF;AACE,aAAO,IAAP;AAVJ;AAYD;;AAED,SAASgB,YAAT,CAAsBhB,QAAtB,EAA8C;AAAA,MAAdc,OAAc,uEAAJ,EAAI;;AAC5C,MAAIb,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOA,QAAP;AACD;;AACD,SAAO,UAAAiB,EAAE,EAAI;AACXH,IAAAA,OAAO,CAACI,KAAR,GAAgBD,EAAE,CAACC,KAAnB;AACA,WAAOlB,QAAQ,CAACiB,EAAE,CAACE,MAAJ,EAAYL,OAAZ,CAAf;AACD,GAHD;AAID;;AAEM,SAASM,gBAAT,CAA0BC,QAA1B,EAAkD;AAAA,MAAdP,OAAc,uEAAJ,EAAI;AACvD,SAAO,UAAAf,GAAG,EAAI;AACZe,IAAAA,OAAO,CAACQ,OAAR,GAAkBvB,GAAG,CAACM,GAAJ,CAAQ,UAAAY,EAAE;AAAA,aAAIA,EAAE,CAACC,KAAP;AAAA,KAAV,CAAlB;AACA,WAAOG,QAAQ,CAACtB,GAAG,CAACM,GAAJ,CAAQ,UAAAY,EAAE;AAAA,aAAIA,EAAE,CAACE,MAAP;AAAA,KAAV,CAAD,EAA2BL,OAA3B,CAAf;AACD,GAHD;AAID","sourcesContent":["// Copyright (c) 2015 - 2019 Uber Technologies, Inc.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nexport const AGGREGATION_OPERATION = {\n  SUM: 1,\n  MEAN: 2,\n  MIN: 3,\n  MAX: 4\n};\n\nfunction sumReducer(accu, cur) {\n  return accu + cur;\n}\n\nfunction maxReducer(accu, cur) {\n  return cur > accu ? cur : accu;\n}\n\nfunction minReducer(accu, cur) {\n  return cur < accu ? cur : accu;\n}\n\nexport function getMean(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(sumReducer, 0) / filtered.length : null;\n}\n\nexport function getSum(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? pts.length * accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(sumReducer, 0) : null;\n}\n\nexport function getMax(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(maxReducer, -Infinity) : null;\n}\n\nexport function getMin(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(minReducer, Infinity) : null;\n}\n\n// Function to convert from aggregation/accessor props (like colorAggregation and getColorWeight) to getValue prop (like getColorValue)\nexport function getValueFunc(aggregation, accessor, context) {\n  const op = AGGREGATION_OPERATION[aggregation] || AGGREGATION_OPERATION.SUM;\n  accessor = wrapAccessor(accessor, context);\n  switch (op) {\n    case AGGREGATION_OPERATION.MIN:\n      return pts => getMin(pts, accessor);\n    case AGGREGATION_OPERATION.SUM:\n      return pts => getSum(pts, accessor);\n    case AGGREGATION_OPERATION.MEAN:\n      return pts => getMean(pts, accessor);\n    case AGGREGATION_OPERATION.MAX:\n      return pts => getMax(pts, accessor);\n    default:\n      return null;\n  }\n}\n\nfunction wrapAccessor(accessor, context = {}) {\n  if (Number.isFinite(accessor)) {\n    return accessor;\n  }\n  return pt => {\n    context.index = pt.index;\n    return accessor(pt.source, context);\n  };\n}\n\nexport function wrapGetValueFunc(getValue, context = {}) {\n  return pts => {\n    context.indices = pts.map(pt => pt.index);\n    return getValue(pts.map(pt => pt.source), context);\n  };\n}\n"],"file":"aggregation-operation-utils.js"}
+{"version":3,"sources":["../../../src/utils/aggregation-operation-utils.js"],"names":["AGGREGATION_OPERATION","SUM","MEAN","MIN","MAX","sumReducer","accu","cur","maxReducer","minReducer","getMean","pts","accessor","Number","isFinite","length","filtered","map","filter","reduce","getSum","getMax","Infinity","getMin","getValueFunc","aggregation","context","op","wrapAccessor","pt","index","source","wrapGetValueFunc","getValue","indices"],"mappings":";;;;;;;;;;;;AAoBO,MAAMA,qBAAqB,GAAG;AACnCC,EAAAA,GAAG,EAAE,CAD8B;AAEnCC,EAAAA,IAAI,EAAE,CAF6B;AAGnCC,EAAAA,GAAG,EAAE,CAH8B;AAInCC,EAAAA,GAAG,EAAE;AAJ8B,CAA9B;;;AAOP,SAASC,UAAT,CAAoBC,IAApB,EAA0BC,GAA1B,EAA+B;AAC7B,SAAOD,IAAI,GAAGC,GAAd;AACD;;AAED,SAASC,UAAT,CAAoBF,IAApB,EAA0BC,GAA1B,EAA+B;AAC7B,SAAOA,GAAG,GAAGD,IAAN,GAAaC,GAAb,GAAmBD,IAA1B;AACD;;AAED,SAASG,UAAT,CAAoBH,IAApB,EAA0BC,GAA1B,EAA+B;AAC7B,SAAOA,GAAG,GAAGD,IAAN,GAAaC,GAAb,GAAmBD,IAA1B;AACD;;AAEM,SAASI,OAAT,CAAiBC,GAAjB,EAAsBC,QAAtB,EAAgC;AACrC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaH,QAAb,GAAwB,IAA/B;AACD;;AACD,QAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBd,UAAhB,EAA4B,CAA5B,IAAiCW,QAAQ,CAACD,MAA5D,GAAqE,IAA5E;AACD;;AAEM,SAASK,MAAT,CAAgBT,GAAhB,EAAqBC,QAArB,EAA+B;AACpC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaJ,GAAG,CAACI,MAAJ,GAAaH,QAA1B,GAAqC,IAA5C;AACD;;AACD,QAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBd,UAAhB,EAA4B,CAA5B,CAAlB,GAAmD,IAA1D;AACD;;AAEM,SAASgB,MAAT,CAAgBV,GAAhB,EAAqBC,QAArB,EAA+B;AACpC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaH,QAAb,GAAwB,IAA/B;AACD;;AACD,QAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBX,UAAhB,EAA4B,CAACc,QAA7B,CAAlB,GAA2D,IAAlE;AACD;;AAEM,SAASC,MAAT,CAAgBZ,GAAhB,EAAqBC,QAArB,EAA+B;AACpC,MAAIC,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOD,GAAG,CAACI,MAAJ,GAAaH,QAAb,GAAwB,IAA/B;AACD;;AACD,QAAMI,QAAQ,GAAGL,GAAG,CAACM,GAAJ,CAAQL,QAAR,EAAkBM,MAAlB,CAAyBL,MAAM,CAACC,QAAhC,CAAjB;AAEA,SAAOE,QAAQ,CAACD,MAAT,GAAkBC,QAAQ,CAACG,MAAT,CAAgBV,UAAhB,EAA4Ba,QAA5B,CAAlB,GAA0D,IAAjE;AACD;;AAGM,SAASE,YAAT,CAAsBC,WAAtB,EAAmCb,QAAnC,EAA6Cc,OAA7C,EAAsD;AAC3D,QAAMC,EAAE,GAAG3B,qBAAqB,CAACyB,WAAD,CAArB,IAAsCzB,qBAAqB,CAACC,GAAvE;AACAW,EAAAA,QAAQ,GAAGgB,YAAY,CAAChB,QAAD,EAAWc,OAAX,CAAvB;;AACA,UAAQC,EAAR;AACE,SAAK3B,qBAAqB,CAACG,GAA3B;AACE,aAAOQ,GAAG,IAAIY,MAAM,CAACZ,GAAD,EAAMC,QAAN,CAApB;;AACF,SAAKZ,qBAAqB,CAACC,GAA3B;AACE,aAAOU,GAAG,IAAIS,MAAM,CAACT,GAAD,EAAMC,QAAN,CAApB;;AACF,SAAKZ,qBAAqB,CAACE,IAA3B;AACE,aAAOS,GAAG,IAAID,OAAO,CAACC,GAAD,EAAMC,QAAN,CAArB;;AACF,SAAKZ,qBAAqB,CAACI,GAA3B;AACE,aAAOO,GAAG,IAAIU,MAAM,CAACV,GAAD,EAAMC,QAAN,CAApB;;AACF;AACE,aAAO,IAAP;AAVJ;AAYD;;AAED,SAASgB,YAAT,CAAsBhB,QAAtB,EAAgCc,OAAO,GAAG,EAA1C,EAA8C;AAC5C,MAAIb,MAAM,CAACC,QAAP,CAAgBF,QAAhB,CAAJ,EAA+B;AAC7B,WAAOA,QAAP;AACD;;AACD,SAAOiB,EAAE,IAAI;AACXH,IAAAA,OAAO,CAACI,KAAR,GAAgBD,EAAE,CAACC,KAAnB;AACA,WAAOlB,QAAQ,CAACiB,EAAE,CAACE,MAAJ,EAAYL,OAAZ,CAAf;AACD,GAHD;AAID;;AAEM,SAASM,gBAAT,CAA0BC,QAA1B,EAAoCP,OAAO,GAAG,EAA9C,EAAkD;AACvD,SAAOf,GAAG,IAAI;AACZe,IAAAA,OAAO,CAACQ,OAAR,GAAkBvB,GAAG,CAACM,GAAJ,CAAQY,EAAE,IAAIA,EAAE,CAACC,KAAjB,CAAlB;AACA,WAAOG,QAAQ,CAACtB,GAAG,CAACM,GAAJ,CAAQY,EAAE,IAAIA,EAAE,CAACE,MAAjB,CAAD,EAA2BL,OAA3B,CAAf;AACD,GAHD;AAID","sourcesContent":["// Copyright (c) 2015 - 2019 Uber Technologies, Inc.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nexport const AGGREGATION_OPERATION = {\n  SUM: 1,\n  MEAN: 2,\n  MIN: 3,\n  MAX: 4\n};\n\nfunction sumReducer(accu, cur) {\n  return accu + cur;\n}\n\nfunction maxReducer(accu, cur) {\n  return cur > accu ? cur : accu;\n}\n\nfunction minReducer(accu, cur) {\n  return cur < accu ? cur : accu;\n}\n\nexport function getMean(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(sumReducer, 0) / filtered.length : null;\n}\n\nexport function getSum(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? pts.length * accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(sumReducer, 0) : null;\n}\n\nexport function getMax(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(maxReducer, -Infinity) : null;\n}\n\nexport function getMin(pts, accessor) {\n  if (Number.isFinite(accessor)) {\n    return pts.length ? accessor : null;\n  }\n  const filtered = pts.map(accessor).filter(Number.isFinite);\n\n  return filtered.length ? filtered.reduce(minReducer, Infinity) : null;\n}\n\n// Function to convert from aggregation/accessor props (like colorAggregation and getColorWeight) to getValue prop (like getColorValue)\nexport function getValueFunc(aggregation, accessor, context) {\n  const op = AGGREGATION_OPERATION[aggregation] || AGGREGATION_OPERATION.SUM;\n  accessor = wrapAccessor(accessor, context);\n  switch (op) {\n    case AGGREGATION_OPERATION.MIN:\n      return pts => getMin(pts, accessor);\n    case AGGREGATION_OPERATION.SUM:\n      return pts => getSum(pts, accessor);\n    case AGGREGATION_OPERATION.MEAN:\n      return pts => getMean(pts, accessor);\n    case AGGREGATION_OPERATION.MAX:\n      return pts => getMax(pts, accessor);\n    default:\n      return null;\n  }\n}\n\nfunction wrapAccessor(accessor, context = {}) {\n  if (Number.isFinite(accessor)) {\n    return accessor;\n  }\n  return pt => {\n    context.index = pt.index;\n    return accessor(pt.source, context);\n  };\n}\n\nexport function wrapGetValueFunc(getValue, context = {}) {\n  return pts => {\n    context.indices = pts.map(pt => pt.index);\n    return getValue(pts.map(pt => pt.source), context);\n  };\n}\n"],"file":"aggregation-operation-utils.js"}

package/dist/es5/utils/bin-sorter.js

@@ -1,56 +1,31 @@
 "use strict";
 
-var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = void 0;
 
-var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/slicedToArray"));
-
-var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
-
-var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-
 var _scaleUtils = require("./scale-utils");
 
-function _createForOfIteratorHelper(o, allowArrayLike) { var it; if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (it = _unsupportedIterableToArray(o)) || allowArrayLike && o && typeof o.length === "number") { if (it) o = it; var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it.return != null) it.return(); } finally { if (didErr) throw err; } } }; }
-
-function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(o); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
+const defaultGetValue = points => points.length;
 
-function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
+const MAX_32_BIT_FLOAT = 3.402823466e38;
 
-var defaultGetValue = function defaultGetValue(points) {
-  return points.length;
-};
+const defaultGetPoints = bin => bin.points;
 
-var MAX_32_BIT_FLOAT = 3.402823466e38;
+const defaultGetIndex = bin => bin.index;
 
-var defaultGetPoints = function defaultGetPoints(bin) {
-  return bin.points;
-};
-
-var defaultGetIndex = function defaultGetIndex(bin) {
-  return bin.index;
-};
-
-var ascending = function ascending(a, b) {
-  return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
-};
+const ascending = (a, b) => a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
 
-var defaultProps = {
+const defaultProps = {
   getValue: defaultGetValue,
   getPoints: defaultGetPoints,
   getIndex: defaultGetIndex,
   filterData: null
 };
 
-var BinSorter = function () {
-  function BinSorter() {
-    var bins = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : [];
-    var props = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : defaultProps;
-    (0, _classCallCheck2.default)(this, BinSorter);
+class BinSorter {
+  constructor(bins = [], props = defaultProps) {
     this.aggregatedBins = this.getAggregatedBins(bins, props);
 
     this._updateMinMaxValues();
@@ -58,192 +33,137 @@ var BinSorter = function () {
     this.binMap = this.getBinMap();
   }
 
-  (0, _createClass2.default)(BinSorter, [{
-    key: "getAggregatedBins",
-    value: function getAggregatedBins(bins, props) {
-      var _props$getValue = props.getValue,
-          getValue = _props$getValue === void 0 ? defaultGetValue : _props$getValue,
-          _props$getPoints = props.getPoints,
-          getPoints = _props$getPoints === void 0 ? defaultGetPoints : _props$getPoints,
-          _props$getIndex = props.getIndex,
-          getIndex = _props$getIndex === void 0 ? defaultGetIndex : _props$getIndex,
-          filterData = props.filterData;
-      var hasFilter = typeof filterData === 'function';
-      var binCount = bins.length;
-      var aggregatedBins = [];
-      var index = 0;
-
-      for (var binIndex = 0; binIndex < binCount; binIndex++) {
-        var bin = bins[binIndex];
-        var points = getPoints(bin);
-        var i = getIndex(bin);
-        var filteredPoints = hasFilter ? points.filter(filterData) : points;
-        bin.filteredPoints = hasFilter ? filteredPoints : null;
-        var value = filteredPoints.length ? getValue(filteredPoints) : null;
-
-        if (value !== null && value !== undefined) {
-          aggregatedBins[index] = {
-            i: Number.isFinite(i) ? i : binIndex,
-            value: value,
-            counts: filteredPoints.length
-          };
-          index++;
-        }
+  getAggregatedBins(bins, props) {
+    const {
+      getValue = defaultGetValue,
+      getPoints = defaultGetPoints,
+      getIndex = defaultGetIndex,
+      filterData
+    } = props;
+    const hasFilter = typeof filterData === 'function';
+    const binCount = bins.length;
+    const aggregatedBins = [];
+    let index = 0;
+
+    for (let binIndex = 0; binIndex < binCount; binIndex++) {
+      const bin = bins[binIndex];
+      const points = getPoints(bin);
+      const i = getIndex(bin);
+      const filteredPoints = hasFilter ? points.filter(filterData) : points;
+      bin.filteredPoints = hasFilter ? filteredPoints : null;
+      const value = filteredPoints.length ? getValue(filteredPoints) : null;
+
+      if (value !== null && value !== undefined) {
+        aggregatedBins[index] = {
+          i: Number.isFinite(i) ? i : binIndex,
+          value,
+          counts: filteredPoints.length
+        };
+        index++;
       }
-
-      return aggregatedBins;
     }
-  }, {
-    key: "_percentileToIndex",
-    value: function _percentileToIndex(percentileRange) {
-      var len = this.sortedBins.length;
 
-      if (len < 2) {
-        return [0, 0];
-      }
+    return aggregatedBins;
+  }
 
-      var _percentileRange$map = percentileRange.map(function (n) {
-        return (0, _scaleUtils.clamp)(n, 0, 100);
-      }),
-          _percentileRange$map2 = (0, _slicedToArray2.default)(_percentileRange$map, 2),
-          lower = _percentileRange$map2[0],
-          upper = _percentileRange$map2[1];
+  _percentileToIndex(percentileRange) {
+    const len = this.sortedBins.length;
 
-      var lowerIdx = Math.ceil(lower / 100 * (len - 1));
-      var upperIdx = Math.floor(upper / 100 * (len - 1));
-      return [lowerIdx, upperIdx];
+    if (len < 2) {
+      return [0, 0];
     }
-  }, {
-    key: "getBinMap",
-    value: function getBinMap() {
-      var binMap = {};
-
-      var _iterator = _createForOfIteratorHelper(this.aggregatedBins),
-          _step;
-
-      try {
-        for (_iterator.s(); !(_step = _iterator.n()).done;) {
-          var bin = _step.value;
-          binMap[bin.i] = bin;
-        }
-      } catch (err) {
-        _iterator.e(err);
-      } finally {
-        _iterator.f();
-      }
 
-      return binMap;
+    const [lower, upper] = percentileRange.map(n => (0, _scaleUtils.clamp)(n, 0, 100));
+    const lowerIdx = Math.ceil(lower / 100 * (len - 1));
+    const upperIdx = Math.floor(upper / 100 * (len - 1));
+    return [lowerIdx, upperIdx];
+  }
+
+  getBinMap() {
+    const binMap = {};
+
+    for (const bin of this.aggregatedBins) {
+      binMap[bin.i] = bin;
     }
-  }, {
-    key: "_updateMinMaxValues",
-    value: function _updateMinMaxValues() {
-      var maxCount = 0;
-      var maxValue = 0;
-      var minValue = MAX_32_BIT_FLOAT;
-      var totalCount = 0;
-
-      var _iterator2 = _createForOfIteratorHelper(this.aggregatedBins),
-          _step2;
-
-      try {
-        for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
-          var x = _step2.value;
-          maxCount = maxCount > x.counts ? maxCount : x.counts;
-          maxValue = maxValue > x.value ? maxValue : x.value;
-          minValue = minValue < x.value ? minValue : x.value;
-          totalCount += x.counts;
-        }
-      } catch (err) {
-        _iterator2.e(err);
-      } finally {
-        _iterator2.f();
-      }
 
-      this.maxCount = maxCount;
-      this.maxValue = maxValue;
-      this.minValue = minValue;
-      this.totalCount = totalCount;
+    return binMap;
+  }
+
+  _updateMinMaxValues() {
+    let maxCount = 0;
+    let maxValue = 0;
+    let minValue = MAX_32_BIT_FLOAT;
+    let totalCount = 0;
+
+    for (const x of this.aggregatedBins) {
+      maxCount = maxCount > x.counts ? maxCount : x.counts;
+      maxValue = maxValue > x.value ? maxValue : x.value;
+      minValue = minValue < x.value ? minValue : x.value;
+      totalCount += x.counts;
     }
-  }, {
-    key: "getValueRange",
-    value: function getValueRange(percentileRange) {
-      if (!this.sortedBins) {
-        this.sortedBins = this.aggregatedBins.sort(function (a, b) {
-          return ascending(a.value, b.value);
-        });
-      }
 
-      if (!this.sortedBins.length) {
-        return [];
-      }
+    this.maxCount = maxCount;
+    this.maxValue = maxValue;
+    this.minValue = minValue;
+    this.totalCount = totalCount;
+  }
+
+  getValueRange(percentileRange) {
+    if (!this.sortedBins) {
+      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));
+    }
 
-      var lowerIdx = 0;
-      var upperIdx = this.sortedBins.length - 1;
+    if (!this.sortedBins.length) {
+      return [];
+    }
 
-      if (Array.isArray(percentileRange)) {
-        var idxRange = this._percentileToIndex(percentileRange);
+    let lowerIdx = 0;
+    let upperIdx = this.sortedBins.length - 1;
 
-        lowerIdx = idxRange[0];
-        upperIdx = idxRange[1];
-      }
+    if (Array.isArray(percentileRange)) {
+      const idxRange = this._percentileToIndex(percentileRange);
 
-      return [this.sortedBins[lowerIdx].value, this.sortedBins[upperIdx].value];
+      lowerIdx = idxRange[0];
+      upperIdx = idxRange[1];
     }
-  }, {
-    key: "getValueDomainByScale",
-    value: function getValueDomainByScale(scale) {
-      var _ref = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : [],
-          _ref2 = (0, _slicedToArray2.default)(_ref, 2),
-          _ref2$ = _ref2[0],
-          lower = _ref2$ === void 0 ? 0 : _ref2$,
-          _ref2$2 = _ref2[1],
-          upper = _ref2$2 === void 0 ? 100 : _ref2$2;
-
-      if (!this.sortedBins) {
-        this.sortedBins = this.aggregatedBins.sort(function (a, b) {
-          return ascending(a.value, b.value);
-        });
-      }
 
-      if (!this.sortedBins.length) {
-        return [];
-      }
+    return [this.sortedBins[lowerIdx].value, this.sortedBins[upperIdx].value];
+  }
 
-      var indexEdge = this._percentileToIndex([lower, upper]);
+  getValueDomainByScale(scale, [lower = 0, upper = 100] = []) {
+    if (!this.sortedBins) {
+      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));
+    }
 
-      return this._getScaleDomain(scale, indexEdge);
+    if (!this.sortedBins.length) {
+      return [];
     }
-  }, {
-    key: "_getScaleDomain",
-    value: function _getScaleDomain(scaleType, _ref3) {
-      var _ref4 = (0, _slicedToArray2.default)(_ref3, 2),
-          lowerIdx = _ref4[0],
-          upperIdx = _ref4[1];
-
-      var bins = this.sortedBins;
-
-      switch (scaleType) {
-        case 'quantize':
-        case 'linear':
-          return [bins[lowerIdx].value, bins[upperIdx].value];
-
-        case 'quantile':
-          return (0, _scaleUtils.getQuantileDomain)(bins.slice(lowerIdx, upperIdx + 1), function (d) {
-            return d.value;
-          });
-
-        case 'ordinal':
-          return (0, _scaleUtils.getOrdinalDomain)(bins, function (d) {
-            return d.value;
-          });
-
-        default:
-          return [bins[lowerIdx].value, bins[upperIdx].value];
-      }
+
+    const indexEdge = this._percentileToIndex([lower, upper]);
+
+    return this._getScaleDomain(scale, indexEdge);
+  }
+
+  _getScaleDomain(scaleType, [lowerIdx, upperIdx]) {
+    const bins = this.sortedBins;
+
+    switch (scaleType) {
+      case 'quantize':
+      case 'linear':
+        return [bins[lowerIdx].value, bins[upperIdx].value];
+
+      case 'quantile':
+        return (0, _scaleUtils.getQuantileDomain)(bins.slice(lowerIdx, upperIdx + 1), d => d.value);
+
+      case 'ordinal':
+        return (0, _scaleUtils.getOrdinalDomain)(bins, d => d.value);
+
+      default:
+        return [bins[lowerIdx].value, bins[upperIdx].value];
     }
-  }]);
-  return BinSorter;
-}();
+  }
+
+}
 
 exports.default = BinSorter;
 //# sourceMappingURL=bin-sorter.js.map

package/dist/es5/utils/bin-sorter.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/utils/bin-sorter.js"],"names":["defaultGetValue","points","length","MAX_32_BIT_FLOAT","defaultGetPoints","bin","defaultGetIndex","index","ascending","a","b","NaN","defaultProps","getValue","getPoints","getIndex","filterData","BinSorter","bins","props","aggregatedBins","getAggregatedBins","_updateMinMaxValues","binMap","getBinMap","hasFilter","binCount","binIndex","i","filteredPoints","filter","value","undefined","Number","isFinite","counts","percentileRange","len","sortedBins","map","n","lower","upper","lowerIdx","Math","ceil","upperIdx","floor","maxCount","maxValue","minValue","totalCount","x","sort","Array","isArray","idxRange","_percentileToIndex","scale","indexEdge","_getScaleDomain","scaleType","slice","d"],"mappings":";;;;;;;;;;;;;;;AA0BA;;;;;;;;AAFA,IAAMA,eAAe,GAAG,SAAlBA,eAAkB,CAAAC,MAAM;AAAA,SAAIA,MAAM,CAACC,MAAX;AAAA,CAA9B;;AAIA,IAAMC,gBAAgB,GAAG,cAAzB;;AAGA,IAAMC,gBAAgB,GAAG,SAAnBA,gBAAmB,CAAAC,GAAG;AAAA,SAAIA,GAAG,CAACJ,MAAR;AAAA,CAA5B;;AAEA,IAAMK,eAAe,GAAG,SAAlBA,eAAkB,CAAAD,GAAG;AAAA,SAAIA,GAAG,CAACE,KAAR;AAAA,CAA3B;;AAGA,IAAMC,SAAS,GAAG,SAAZA,SAAY,CAACC,CAAD,EAAIC,CAAJ;AAAA,SAAWD,CAAC,GAAGC,CAAJ,GAAQ,CAAC,CAAT,GAAaD,CAAC,GAAGC,CAAJ,GAAQ,CAAR,GAAYD,CAAC,IAAIC,CAAL,GAAS,CAAT,GAAaC,GAAjD;AAAA,CAAlB;;AAEA,IAAMC,YAAY,GAAG;AACnBC,EAAAA,QAAQ,EAAEb,eADS;AAEnBc,EAAAA,SAAS,EAAEV,gBAFQ;AAGnBW,EAAAA,QAAQ,EAAET,eAHS;AAInBU,EAAAA,UAAU,EAAE;AAJO,CAArB;;IAOqBC,S;AACnB,uBAA6C;AAAA,QAAjCC,IAAiC,uEAA1B,EAA0B;AAAA,QAAtBC,KAAsB,uEAAdP,YAAc;AAAA;AAC3C,SAAKQ,cAAL,GAAsB,KAAKC,iBAAL,CAAuBH,IAAvB,EAA6BC,KAA7B,CAAtB;;AACA,SAAKG,mBAAL;;AACA,SAAKC,MAAL,GAAc,KAAKC,SAAL,EAAd;AACD;;;;sCASiBN,I,EAAMC,K,EAAO;AAAA,4BAMzBA,KANyB,CAE3BN,QAF2B;AAAA,UAE3BA,QAF2B,gCAEhBb,eAFgB;AAAA,6BAMzBmB,KANyB,CAG3BL,SAH2B;AAAA,UAG3BA,SAH2B,iCAGfV,gBAHe;AAAA,4BAMzBe,KANyB,CAI3BJ,QAJ2B;AAAA,UAI3BA,QAJ2B,gCAIhBT,eAJgB;AAAA,UAK3BU,UAL2B,GAMzBG,KANyB,CAK3BH,UAL2B;AAQ7B,UAAMS,SAAS,GAAG,OAAOT,UAAP,KAAsB,UAAxC;AACA,UAAMU,QAAQ,GAAGR,IAAI,CAAChB,MAAtB;AACA,UAAMkB,cAAc,GAAG,EAAvB;AACA,UAAIb,KAAK,GAAG,CAAZ;;AAEA,WAAK,IAAIoB,QAAQ,GAAG,CAApB,EAAuBA,QAAQ,GAAGD,QAAlC,EAA4CC,QAAQ,EAApD,EAAwD;AACtD,YAAMtB,GAAG,GAAGa,IAAI,CAACS,QAAD,CAAhB;AACA,YAAM1B,MAAM,GAAGa,SAAS,CAACT,GAAD,CAAxB;AACA,YAAMuB,CAAC,GAAGb,QAAQ,CAACV,GAAD,CAAlB;AAEA,YAAMwB,cAAc,GAAGJ,SAAS,GAAGxB,MAAM,CAAC6B,MAAP,CAAcd,UAAd,CAAH,GAA+Bf,MAA/D;AAEAI,QAAAA,GAAG,CAACwB,cAAJ,GAAqBJ,SAAS,GAAGI,cAAH,GAAoB,IAAlD;AAEA,YAAME,KAAK,GAAGF,cAAc,CAAC3B,MAAf,GAAwBW,QAAQ,CAACgB,cAAD,CAAhC,GAAmD,IAAjE;;AAEA,YAAIE,KAAK,KAAK,IAAV,IAAkBA,KAAK,KAAKC,SAAhC,EAA2C;AAEzCZ,UAAAA,cAAc,CAACb,KAAD,CAAd,GAAwB;AACtBqB,YAAAA,CAAC,EAAEK,MAAM,CAACC,QAAP,CAAgBN,CAAhB,IAAqBA,CAArB,GAAyBD,QADN;AAEtBI,YAAAA,KAAK,EAALA,KAFsB;AAGtBI,YAAAA,MAAM,EAAEN,cAAc,CAAC3B;AAHD,WAAxB;AAKAK,UAAAA,KAAK;AACN;AACF;;AACD,aAAOa,cAAP;AACD;;;uCAEkBgB,e,EAAiB;AAClC,UAAMC,GAAG,GAAG,KAAKC,UAAL,CAAgBpC,MAA5B;;AACA,UAAImC,GAAG,GAAG,CAAV,EAAa;AACX,eAAO,CAAC,CAAD,EAAI,CAAJ,CAAP;AACD;;AAJiC,iCAMXD,eAAe,CAACG,GAAhB,CAAoB,UAAAC,CAAC;AAAA,eAAI,uBAAMA,CAAN,EAAS,CAAT,EAAY,GAAZ,CAAJ;AAAA,OAArB,CANW;AAAA;AAAA,UAM3BC,KAN2B;AAAA,UAMpBC,KANoB;;AAQlC,UAAMC,QAAQ,GAAGC,IAAI,CAACC,IAAL,CAAWJ,KAAK,GAAG,GAAT,IAAiBJ,GAAG,GAAG,CAAvB,CAAV,CAAjB;AACA,UAAMS,QAAQ,GAAGF,IAAI,CAACG,KAAL,CAAYL,KAAK,GAAG,GAAT,IAAiBL,GAAG,GAAG,CAAvB,CAAX,CAAjB;AAEA,aAAO,CAACM,QAAD,EAAWG,QAAX,CAAP;AACD;;;gCAOW;AACV,UAAMvB,MAAM,GAAG,EAAf;;AADU,iDAEQ,KAAKH,cAFb;AAAA;;AAAA;AAEV,4DAAuC;AAAA,cAA5Bf,GAA4B;AACrCkB,UAAAA,MAAM,CAAClB,GAAG,CAACuB,CAAL,CAAN,GAAgBvB,GAAhB;AACD;AAJS;AAAA;AAAA;AAAA;AAAA;;AAKV,aAAOkB,MAAP;AACD;;;0CAQqB;AACpB,UAAIyB,QAAQ,GAAG,CAAf;AACA,UAAIC,QAAQ,GAAG,CAAf;AACA,UAAIC,QAAQ,GAAG/C,gBAAf;AACA,UAAIgD,UAAU,GAAG,CAAjB;;AAJoB,kDAKJ,KAAK/B,cALD;AAAA;;AAAA;AAKpB,+DAAqC;AAAA,cAA1BgC,CAA0B;AACnCJ,UAAAA,QAAQ,GAAGA,QAAQ,GAAGI,CAAC,CAACjB,MAAb,GAAsBa,QAAtB,GAAiCI,CAAC,CAACjB,MAA9C;AACAc,UAAAA,QAAQ,GAAGA,QAAQ,GAAGG,CAAC,CAACrB,KAAb,GAAqBkB,QAArB,GAAgCG,CAAC,CAACrB,KAA7C;AACAmB,UAAAA,QAAQ,GAAGA,QAAQ,GAAGE,CAAC,CAACrB,KAAb,GAAqBmB,QAArB,GAAgCE,CAAC,CAACrB,KAA7C;AACAoB,UAAAA,UAAU,IAAIC,CAAC,CAACjB,MAAhB;AACD;AAVmB;AAAA;AAAA;AAAA;AAAA;;AAWpB,WAAKa,QAAL,GAAgBA,QAAhB;AACA,WAAKC,QAAL,GAAgBA,QAAhB;AACA,WAAKC,QAAL,GAAgBA,QAAhB;AACA,WAAKC,UAAL,GAAkBA,UAAlB;AACD;;;kCASaf,e,EAAiB;AAC7B,UAAI,CAAC,KAAKE,UAAV,EAAsB;AACpB,aAAKA,UAAL,GAAkB,KAAKlB,cAAL,CAAoBiC,IAApB,CAAyB,UAAC5C,CAAD,EAAIC,CAAJ;AAAA,iBAAUF,SAAS,CAACC,CAAC,CAACsB,KAAH,EAAUrB,CAAC,CAACqB,KAAZ,CAAnB;AAAA,SAAzB,CAAlB;AACD;;AACD,UAAI,CAAC,KAAKO,UAAL,CAAgBpC,MAArB,EAA6B;AAC3B,eAAO,EAAP;AACD;;AACD,UAAIyC,QAAQ,GAAG,CAAf;AACA,UAAIG,QAAQ,GAAG,KAAKR,UAAL,CAAgBpC,MAAhB,GAAyB,CAAxC;;AAEA,UAAIoD,KAAK,CAACC,OAAN,CAAcnB,eAAd,CAAJ,EAAoC;AAClC,YAAMoB,QAAQ,GAAG,KAAKC,kBAAL,CAAwBrB,eAAxB,CAAjB;;AACAO,QAAAA,QAAQ,GAAGa,QAAQ,CAAC,CAAD,CAAnB;AACAV,QAAAA,QAAQ,GAAGU,QAAQ,CAAC,CAAD,CAAnB;AACD;;AAED,aAAO,CAAC,KAAKlB,UAAL,CAAgBK,QAAhB,EAA0BZ,KAA3B,EAAkC,KAAKO,UAAL,CAAgBQ,QAAhB,EAA0Bf,KAA5D,CAAP;AACD;;;0CAEqB2B,K,EAAsC;AAAA,qFAAJ,EAAI;AAAA;AAAA;AAAA,UAA9BjB,KAA8B,uBAAtB,CAAsB;AAAA;AAAA,UAAnBC,KAAmB,wBAAX,GAAW;;AAC1D,UAAI,CAAC,KAAKJ,UAAV,EAAsB;AACpB,aAAKA,UAAL,GAAkB,KAAKlB,cAAL,CAAoBiC,IAApB,CAAyB,UAAC5C,CAAD,EAAIC,CAAJ;AAAA,iBAAUF,SAAS,CAACC,CAAC,CAACsB,KAAH,EAAUrB,CAAC,CAACqB,KAAZ,CAAnB;AAAA,SAAzB,CAAlB;AACD;;AACD,UAAI,CAAC,KAAKO,UAAL,CAAgBpC,MAArB,EAA6B;AAC3B,eAAO,EAAP;AACD;;AACD,UAAMyD,SAAS,GAAG,KAAKF,kBAAL,CAAwB,CAAChB,KAAD,EAAQC,KAAR,CAAxB,CAAlB;;AAEA,aAAO,KAAKkB,eAAL,CAAqBF,KAArB,EAA4BC,SAA5B,CAAP;AACD;;;oCAEeE,S,SAAiC;AAAA;AAAA,UAArBlB,QAAqB;AAAA,UAAXG,QAAW;;AAC/C,UAAM5B,IAAI,GAAG,KAAKoB,UAAlB;;AAEA,cAAQuB,SAAR;AACE,aAAK,UAAL;AACA,aAAK,QAAL;AACE,iBAAO,CAAC3C,IAAI,CAACyB,QAAD,CAAJ,CAAeZ,KAAhB,EAAuBb,IAAI,CAAC4B,QAAD,CAAJ,CAAef,KAAtC,CAAP;;AAEF,aAAK,UAAL;AACE,iBAAO,mCAAkBb,IAAI,CAAC4C,KAAL,CAAWnB,QAAX,EAAqBG,QAAQ,GAAG,CAAhC,CAAlB,EAAsD,UAAAiB,CAAC;AAAA,mBAAIA,CAAC,CAAChC,KAAN;AAAA,WAAvD,CAAP;;AAEF,aAAK,SAAL;AACE,iBAAO,kCAAiBb,IAAjB,EAAuB,UAAA6C,CAAC;AAAA,mBAAIA,CAAC,CAAChC,KAAN;AAAA,WAAxB,CAAP;;AAEF;AACE,iBAAO,CAACb,IAAI,CAACyB,QAAD,CAAJ,CAAeZ,KAAhB,EAAuBb,IAAI,CAAC4B,QAAD,CAAJ,CAAef,KAAtC,CAAP;AAZJ;AAcD","sourcesContent":["// Copyright (c) 2015 - 2017 Uber Technologies, Inc.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n// getValue takes an array of points returns a value to sort the bins on.\n// by default it returns the number of points\n// this is where to pass in a function to color the bins by\n// avg/mean/max of specific value of the point\nconst defaultGetValue = points => points.length;\n\nimport {clamp, getQuantileDomain, getOrdinalDomain} from './scale-utils';\n\nconst MAX_32_BIT_FLOAT = 3.402823466e38;\n\n// access array of points in each bin\nconst defaultGetPoints = bin => bin.points;\n// access index of each bin\nconst defaultGetIndex = bin => bin.index;\n\n// d3-scending\nconst ascending = (a, b) => (a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN);\n\nconst defaultProps = {\n  getValue: defaultGetValue,\n  getPoints: defaultGetPoints,\n  getIndex: defaultGetIndex,\n  filterData: null\n};\n\nexport default class BinSorter {\n  constructor(bins = [], props = defaultProps) {\n    this.aggregatedBins = this.getAggregatedBins(bins, props);\n    this._updateMinMaxValues();\n    this.binMap = this.getBinMap();\n  }\n\n  /**\n   * Get an array of object with aggregated values and index of bins\n   * Array object will be sorted by value optionally.\n   * @param {Array} bins\n   * @param {Function} getValue\n   * @return {Array} array of values and index lookup\n   */\n  getAggregatedBins(bins, props) {\n    const {\n      getValue = defaultGetValue,\n      getPoints = defaultGetPoints,\n      getIndex = defaultGetIndex,\n      filterData\n    } = props;\n\n    const hasFilter = typeof filterData === 'function';\n    const binCount = bins.length;\n    const aggregatedBins = [];\n    let index = 0;\n\n    for (let binIndex = 0; binIndex < binCount; binIndex++) {\n      const bin = bins[binIndex];\n      const points = getPoints(bin);\n      const i = getIndex(bin);\n\n      const filteredPoints = hasFilter ? points.filter(filterData) : points;\n\n      bin.filteredPoints = hasFilter ? filteredPoints : null;\n\n      const value = filteredPoints.length ? getValue(filteredPoints) : null;\n\n      if (value !== null && value !== undefined) {\n        // filter bins if value is null or undefined\n        aggregatedBins[index] = {\n          i: Number.isFinite(i) ? i : binIndex,\n          value,\n          counts: filteredPoints.length\n        };\n        index++;\n      }\n    }\n    return aggregatedBins;\n  }\n\n  _percentileToIndex(percentileRange) {\n    const len = this.sortedBins.length;\n    if (len < 2) {\n      return [0, 0];\n    }\n\n    const [lower, upper] = percentileRange.map(n => clamp(n, 0, 100));\n\n    const lowerIdx = Math.ceil((lower / 100) * (len - 1));\n    const upperIdx = Math.floor((upper / 100) * (len - 1));\n\n    return [lowerIdx, upperIdx];\n  }\n\n  /**\n   * Get a mapping from cell/hexagon index to sorted bin\n   * This is used to retrieve bin value for color calculation\n   * @return {Object} bin index to aggregatedBins\n   */\n  getBinMap() {\n    const binMap = {};\n    for (const bin of this.aggregatedBins) {\n      binMap[bin.i] = bin;\n    }\n    return binMap;\n  }\n\n  // Private\n\n  /**\n   * Get ths max count of all bins\n   * @return {Number | Boolean} max count\n   */\n  _updateMinMaxValues() {\n    let maxCount = 0;\n    let maxValue = 0;\n    let minValue = MAX_32_BIT_FLOAT;\n    let totalCount = 0;\n    for (const x of this.aggregatedBins) {\n      maxCount = maxCount > x.counts ? maxCount : x.counts;\n      maxValue = maxValue > x.value ? maxValue : x.value;\n      minValue = minValue < x.value ? minValue : x.value;\n      totalCount += x.counts;\n    }\n    this.maxCount = maxCount;\n    this.maxValue = maxValue;\n    this.minValue = minValue;\n    this.totalCount = totalCount;\n  }\n\n  /**\n   * Get range of values of all bins\n   * @param {Number[]} range\n   * @param {Number} range[0] - lower bound\n   * @param {Number} range[1] - upper bound\n   * @return {Array} array of new value range\n   */\n  getValueRange(percentileRange) {\n    if (!this.sortedBins) {\n      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));\n    }\n    if (!this.sortedBins.length) {\n      return [];\n    }\n    let lowerIdx = 0;\n    let upperIdx = this.sortedBins.length - 1;\n\n    if (Array.isArray(percentileRange)) {\n      const idxRange = this._percentileToIndex(percentileRange);\n      lowerIdx = idxRange[0];\n      upperIdx = idxRange[1];\n    }\n\n    return [this.sortedBins[lowerIdx].value, this.sortedBins[upperIdx].value];\n  }\n\n  getValueDomainByScale(scale, [lower = 0, upper = 100] = []) {\n    if (!this.sortedBins) {\n      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));\n    }\n    if (!this.sortedBins.length) {\n      return [];\n    }\n    const indexEdge = this._percentileToIndex([lower, upper]);\n\n    return this._getScaleDomain(scale, indexEdge);\n  }\n\n  _getScaleDomain(scaleType, [lowerIdx, upperIdx]) {\n    const bins = this.sortedBins;\n\n    switch (scaleType) {\n      case 'quantize':\n      case 'linear':\n        return [bins[lowerIdx].value, bins[upperIdx].value];\n\n      case 'quantile':\n        return getQuantileDomain(bins.slice(lowerIdx, upperIdx + 1), d => d.value);\n\n      case 'ordinal':\n        return getOrdinalDomain(bins, d => d.value);\n\n      default:\n        return [bins[lowerIdx].value, bins[upperIdx].value];\n    }\n  }\n}\n"],"file":"bin-sorter.js"}
+{"version":3,"sources":["../../../src/utils/bin-sorter.js"],"names":["defaultGetValue","points","length","MAX_32_BIT_FLOAT","defaultGetPoints","bin","defaultGetIndex","index","ascending","a","b","NaN","defaultProps","getValue","getPoints","getIndex","filterData","BinSorter","constructor","bins","props","aggregatedBins","getAggregatedBins","_updateMinMaxValues","binMap","getBinMap","hasFilter","binCount","binIndex","i","filteredPoints","filter","value","undefined","Number","isFinite","counts","_percentileToIndex","percentileRange","len","sortedBins","lower","upper","map","n","lowerIdx","Math","ceil","upperIdx","floor","maxCount","maxValue","minValue","totalCount","x","getValueRange","sort","Array","isArray","idxRange","getValueDomainByScale","scale","indexEdge","_getScaleDomain","scaleType","slice","d"],"mappings":";;;;;;;AA0BA;;AAFA,MAAMA,eAAe,GAAGC,MAAM,IAAIA,MAAM,CAACC,MAAzC;;AAIA,MAAMC,gBAAgB,GAAG,cAAzB;;AAGA,MAAMC,gBAAgB,GAAGC,GAAG,IAAIA,GAAG,CAACJ,MAApC;;AAEA,MAAMK,eAAe,GAAGD,GAAG,IAAIA,GAAG,CAACE,KAAnC;;AAGA,MAAMC,SAAS,GAAG,CAACC,CAAD,EAAIC,CAAJ,KAAWD,CAAC,GAAGC,CAAJ,GAAQ,CAAC,CAAT,GAAaD,CAAC,GAAGC,CAAJ,GAAQ,CAAR,GAAYD,CAAC,IAAIC,CAAL,GAAS,CAAT,GAAaC,GAAnE;;AAEA,MAAMC,YAAY,GAAG;AACnBC,EAAAA,QAAQ,EAAEb,eADS;AAEnBc,EAAAA,SAAS,EAAEV,gBAFQ;AAGnBW,EAAAA,QAAQ,EAAET,eAHS;AAInBU,EAAAA,UAAU,EAAE;AAJO,CAArB;;AAOe,MAAMC,SAAN,CAAgB;AAC7BC,EAAAA,WAAW,CAACC,IAAI,GAAG,EAAR,EAAYC,KAAK,GAAGR,YAApB,EAAkC;AAC3C,SAAKS,cAAL,GAAsB,KAAKC,iBAAL,CAAuBH,IAAvB,EAA6BC,KAA7B,CAAtB;;AACA,SAAKG,mBAAL;;AACA,SAAKC,MAAL,GAAc,KAAKC,SAAL,EAAd;AACD;;AASDH,EAAAA,iBAAiB,CAACH,IAAD,EAAOC,KAAP,EAAc;AAC7B,UAAM;AACJP,MAAAA,QAAQ,GAAGb,eADP;AAEJc,MAAAA,SAAS,GAAGV,gBAFR;AAGJW,MAAAA,QAAQ,GAAGT,eAHP;AAIJU,MAAAA;AAJI,QAKFI,KALJ;AAOA,UAAMM,SAAS,GAAG,OAAOV,UAAP,KAAsB,UAAxC;AACA,UAAMW,QAAQ,GAAGR,IAAI,CAACjB,MAAtB;AACA,UAAMmB,cAAc,GAAG,EAAvB;AACA,QAAId,KAAK,GAAG,CAAZ;;AAEA,SAAK,IAAIqB,QAAQ,GAAG,CAApB,EAAuBA,QAAQ,GAAGD,QAAlC,EAA4CC,QAAQ,EAApD,EAAwD;AACtD,YAAMvB,GAAG,GAAGc,IAAI,CAACS,QAAD,CAAhB;AACA,YAAM3B,MAAM,GAAGa,SAAS,CAACT,GAAD,CAAxB;AACA,YAAMwB,CAAC,GAAGd,QAAQ,CAACV,GAAD,CAAlB;AAEA,YAAMyB,cAAc,GAAGJ,SAAS,GAAGzB,MAAM,CAAC8B,MAAP,CAAcf,UAAd,CAAH,GAA+Bf,MAA/D;AAEAI,MAAAA,GAAG,CAACyB,cAAJ,GAAqBJ,SAAS,GAAGI,cAAH,GAAoB,IAAlD;AAEA,YAAME,KAAK,GAAGF,cAAc,CAAC5B,MAAf,GAAwBW,QAAQ,CAACiB,cAAD,CAAhC,GAAmD,IAAjE;;AAEA,UAAIE,KAAK,KAAK,IAAV,IAAkBA,KAAK,KAAKC,SAAhC,EAA2C;AAEzCZ,QAAAA,cAAc,CAACd,KAAD,CAAd,GAAwB;AACtBsB,UAAAA,CAAC,EAAEK,MAAM,CAACC,QAAP,CAAgBN,CAAhB,IAAqBA,CAArB,GAAyBD,QADN;AAEtBI,UAAAA,KAFsB;AAGtBI,UAAAA,MAAM,EAAEN,cAAc,CAAC5B;AAHD,SAAxB;AAKAK,QAAAA,KAAK;AACN;AACF;;AACD,WAAOc,cAAP;AACD;;AAEDgB,EAAAA,kBAAkB,CAACC,eAAD,EAAkB;AAClC,UAAMC,GAAG,GAAG,KAAKC,UAAL,CAAgBtC,MAA5B;;AACA,QAAIqC,GAAG,GAAG,CAAV,EAAa;AACX,aAAO,CAAC,CAAD,EAAI,CAAJ,CAAP;AACD;;AAED,UAAM,CAACE,KAAD,EAAQC,KAAR,IAAiBJ,eAAe,CAACK,GAAhB,CAAoBC,CAAC,IAAI,uBAAMA,CAAN,EAAS,CAAT,EAAY,GAAZ,CAAzB,CAAvB;AAEA,UAAMC,QAAQ,GAAGC,IAAI,CAACC,IAAL,CAAWN,KAAK,GAAG,GAAT,IAAiBF,GAAG,GAAG,CAAvB,CAAV,CAAjB;AACA,UAAMS,QAAQ,GAAGF,IAAI,CAACG,KAAL,CAAYP,KAAK,GAAG,GAAT,IAAiBH,GAAG,GAAG,CAAvB,CAAX,CAAjB;AAEA,WAAO,CAACM,QAAD,EAAWG,QAAX,CAAP;AACD;;AAODvB,EAAAA,SAAS,GAAG;AACV,UAAMD,MAAM,GAAG,EAAf;;AACA,SAAK,MAAMnB,GAAX,IAAkB,KAAKgB,cAAvB,EAAuC;AACrCG,MAAAA,MAAM,CAACnB,GAAG,CAACwB,CAAL,CAAN,GAAgBxB,GAAhB;AACD;;AACD,WAAOmB,MAAP;AACD;;AAQDD,EAAAA,mBAAmB,GAAG;AACpB,QAAI2B,QAAQ,GAAG,CAAf;AACA,QAAIC,QAAQ,GAAG,CAAf;AACA,QAAIC,QAAQ,GAAGjD,gBAAf;AACA,QAAIkD,UAAU,GAAG,CAAjB;;AACA,SAAK,MAAMC,CAAX,IAAgB,KAAKjC,cAArB,EAAqC;AACnC6B,MAAAA,QAAQ,GAAGA,QAAQ,GAAGI,CAAC,CAAClB,MAAb,GAAsBc,QAAtB,GAAiCI,CAAC,CAAClB,MAA9C;AACAe,MAAAA,QAAQ,GAAGA,QAAQ,GAAGG,CAAC,CAACtB,KAAb,GAAqBmB,QAArB,GAAgCG,CAAC,CAACtB,KAA7C;AACAoB,MAAAA,QAAQ,GAAGA,QAAQ,GAAGE,CAAC,CAACtB,KAAb,GAAqBoB,QAArB,GAAgCE,CAAC,CAACtB,KAA7C;AACAqB,MAAAA,UAAU,IAAIC,CAAC,CAAClB,MAAhB;AACD;;AACD,SAAKc,QAAL,GAAgBA,QAAhB;AACA,SAAKC,QAAL,GAAgBA,QAAhB;AACA,SAAKC,QAAL,GAAgBA,QAAhB;AACA,SAAKC,UAAL,GAAkBA,UAAlB;AACD;;AASDE,EAAAA,aAAa,CAACjB,eAAD,EAAkB;AAC7B,QAAI,CAAC,KAAKE,UAAV,EAAsB;AACpB,WAAKA,UAAL,GAAkB,KAAKnB,cAAL,CAAoBmC,IAApB,CAAyB,CAAC/C,CAAD,EAAIC,CAAJ,KAAUF,SAAS,CAACC,CAAC,CAACuB,KAAH,EAAUtB,CAAC,CAACsB,KAAZ,CAA5C,CAAlB;AACD;;AACD,QAAI,CAAC,KAAKQ,UAAL,CAAgBtC,MAArB,EAA6B;AAC3B,aAAO,EAAP;AACD;;AACD,QAAI2C,QAAQ,GAAG,CAAf;AACA,QAAIG,QAAQ,GAAG,KAAKR,UAAL,CAAgBtC,MAAhB,GAAyB,CAAxC;;AAEA,QAAIuD,KAAK,CAACC,OAAN,CAAcpB,eAAd,CAAJ,EAAoC;AAClC,YAAMqB,QAAQ,GAAG,KAAKtB,kBAAL,CAAwBC,eAAxB,CAAjB;;AACAO,MAAAA,QAAQ,GAAGc,QAAQ,CAAC,CAAD,CAAnB;AACAX,MAAAA,QAAQ,GAAGW,QAAQ,CAAC,CAAD,CAAnB;AACD;;AAED,WAAO,CAAC,KAAKnB,UAAL,CAAgBK,QAAhB,EAA0Bb,KAA3B,EAAkC,KAAKQ,UAAL,CAAgBQ,QAAhB,EAA0BhB,KAA5D,CAAP;AACD;;AAED4B,EAAAA,qBAAqB,CAACC,KAAD,EAAQ,CAACpB,KAAK,GAAG,CAAT,EAAYC,KAAK,GAAG,GAApB,IAA2B,EAAnC,EAAuC;AAC1D,QAAI,CAAC,KAAKF,UAAV,EAAsB;AACpB,WAAKA,UAAL,GAAkB,KAAKnB,cAAL,CAAoBmC,IAApB,CAAyB,CAAC/C,CAAD,EAAIC,CAAJ,KAAUF,SAAS,CAACC,CAAC,CAACuB,KAAH,EAAUtB,CAAC,CAACsB,KAAZ,CAA5C,CAAlB;AACD;;AACD,QAAI,CAAC,KAAKQ,UAAL,CAAgBtC,MAArB,EAA6B;AAC3B,aAAO,EAAP;AACD;;AACD,UAAM4D,SAAS,GAAG,KAAKzB,kBAAL,CAAwB,CAACI,KAAD,EAAQC,KAAR,CAAxB,CAAlB;;AAEA,WAAO,KAAKqB,eAAL,CAAqBF,KAArB,EAA4BC,SAA5B,CAAP;AACD;;AAEDC,EAAAA,eAAe,CAACC,SAAD,EAAY,CAACnB,QAAD,EAAWG,QAAX,CAAZ,EAAkC;AAC/C,UAAM7B,IAAI,GAAG,KAAKqB,UAAlB;;AAEA,YAAQwB,SAAR;AACE,WAAK,UAAL;AACA,WAAK,QAAL;AACE,eAAO,CAAC7C,IAAI,CAAC0B,QAAD,CAAJ,CAAeb,KAAhB,EAAuBb,IAAI,CAAC6B,QAAD,CAAJ,CAAehB,KAAtC,CAAP;;AAEF,WAAK,UAAL;AACE,eAAO,mCAAkBb,IAAI,CAAC8C,KAAL,CAAWpB,QAAX,EAAqBG,QAAQ,GAAG,CAAhC,CAAlB,EAAsDkB,CAAC,IAAIA,CAAC,CAAClC,KAA7D,CAAP;;AAEF,WAAK,SAAL;AACE,eAAO,kCAAiBb,IAAjB,EAAuB+C,CAAC,IAAIA,CAAC,CAAClC,KAA9B,CAAP;;AAEF;AACE,eAAO,CAACb,IAAI,CAAC0B,QAAD,CAAJ,CAAeb,KAAhB,EAAuBb,IAAI,CAAC6B,QAAD,CAAJ,CAAehB,KAAtC,CAAP;AAZJ;AAcD;;AA5J4B","sourcesContent":["// Copyright (c) 2015 - 2017 Uber Technologies, Inc.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n// getValue takes an array of points returns a value to sort the bins on.\n// by default it returns the number of points\n// this is where to pass in a function to color the bins by\n// avg/mean/max of specific value of the point\nconst defaultGetValue = points => points.length;\n\nimport {clamp, getQuantileDomain, getOrdinalDomain} from './scale-utils';\n\nconst MAX_32_BIT_FLOAT = 3.402823466e38;\n\n// access array of points in each bin\nconst defaultGetPoints = bin => bin.points;\n// access index of each bin\nconst defaultGetIndex = bin => bin.index;\n\n// d3-scending\nconst ascending = (a, b) => (a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN);\n\nconst defaultProps = {\n  getValue: defaultGetValue,\n  getPoints: defaultGetPoints,\n  getIndex: defaultGetIndex,\n  filterData: null\n};\n\nexport default class BinSorter {\n  constructor(bins = [], props = defaultProps) {\n    this.aggregatedBins = this.getAggregatedBins(bins, props);\n    this._updateMinMaxValues();\n    this.binMap = this.getBinMap();\n  }\n\n  /**\n   * Get an array of object with aggregated values and index of bins\n   * Array object will be sorted by value optionally.\n   * @param {Array} bins\n   * @param {Function} getValue\n   * @return {Array} array of values and index lookup\n   */\n  getAggregatedBins(bins, props) {\n    const {\n      getValue = defaultGetValue,\n      getPoints = defaultGetPoints,\n      getIndex = defaultGetIndex,\n      filterData\n    } = props;\n\n    const hasFilter = typeof filterData === 'function';\n    const binCount = bins.length;\n    const aggregatedBins = [];\n    let index = 0;\n\n    for (let binIndex = 0; binIndex < binCount; binIndex++) {\n      const bin = bins[binIndex];\n      const points = getPoints(bin);\n      const i = getIndex(bin);\n\n      const filteredPoints = hasFilter ? points.filter(filterData) : points;\n\n      bin.filteredPoints = hasFilter ? filteredPoints : null;\n\n      const value = filteredPoints.length ? getValue(filteredPoints) : null;\n\n      if (value !== null && value !== undefined) {\n        // filter bins if value is null or undefined\n        aggregatedBins[index] = {\n          i: Number.isFinite(i) ? i : binIndex,\n          value,\n          counts: filteredPoints.length\n        };\n        index++;\n      }\n    }\n    return aggregatedBins;\n  }\n\n  _percentileToIndex(percentileRange) {\n    const len = this.sortedBins.length;\n    if (len < 2) {\n      return [0, 0];\n    }\n\n    const [lower, upper] = percentileRange.map(n => clamp(n, 0, 100));\n\n    const lowerIdx = Math.ceil((lower / 100) * (len - 1));\n    const upperIdx = Math.floor((upper / 100) * (len - 1));\n\n    return [lowerIdx, upperIdx];\n  }\n\n  /**\n   * Get a mapping from cell/hexagon index to sorted bin\n   * This is used to retrieve bin value for color calculation\n   * @return {Object} bin index to aggregatedBins\n   */\n  getBinMap() {\n    const binMap = {};\n    for (const bin of this.aggregatedBins) {\n      binMap[bin.i] = bin;\n    }\n    return binMap;\n  }\n\n  // Private\n\n  /**\n   * Get ths max count of all bins\n   * @return {Number | Boolean} max count\n   */\n  _updateMinMaxValues() {\n    let maxCount = 0;\n    let maxValue = 0;\n    let minValue = MAX_32_BIT_FLOAT;\n    let totalCount = 0;\n    for (const x of this.aggregatedBins) {\n      maxCount = maxCount > x.counts ? maxCount : x.counts;\n      maxValue = maxValue > x.value ? maxValue : x.value;\n      minValue = minValue < x.value ? minValue : x.value;\n      totalCount += x.counts;\n    }\n    this.maxCount = maxCount;\n    this.maxValue = maxValue;\n    this.minValue = minValue;\n    this.totalCount = totalCount;\n  }\n\n  /**\n   * Get range of values of all bins\n   * @param {Number[]} range\n   * @param {Number} range[0] - lower bound\n   * @param {Number} range[1] - upper bound\n   * @return {Array} array of new value range\n   */\n  getValueRange(percentileRange) {\n    if (!this.sortedBins) {\n      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));\n    }\n    if (!this.sortedBins.length) {\n      return [];\n    }\n    let lowerIdx = 0;\n    let upperIdx = this.sortedBins.length - 1;\n\n    if (Array.isArray(percentileRange)) {\n      const idxRange = this._percentileToIndex(percentileRange);\n      lowerIdx = idxRange[0];\n      upperIdx = idxRange[1];\n    }\n\n    return [this.sortedBins[lowerIdx].value, this.sortedBins[upperIdx].value];\n  }\n\n  getValueDomainByScale(scale, [lower = 0, upper = 100] = []) {\n    if (!this.sortedBins) {\n      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));\n    }\n    if (!this.sortedBins.length) {\n      return [];\n    }\n    const indexEdge = this._percentileToIndex([lower, upper]);\n\n    return this._getScaleDomain(scale, indexEdge);\n  }\n\n  _getScaleDomain(scaleType, [lowerIdx, upperIdx]) {\n    const bins = this.sortedBins;\n\n    switch (scaleType) {\n      case 'quantize':\n      case 'linear':\n        return [bins[lowerIdx].value, bins[upperIdx].value];\n\n      case 'quantile':\n        return getQuantileDomain(bins.slice(lowerIdx, upperIdx + 1), d => d.value);\n\n      case 'ordinal':\n        return getOrdinalDomain(bins, d => d.value);\n\n      default:\n        return [bins[lowerIdx].value, bins[upperIdx].value];\n    }\n  }\n}\n"],"file":"bin-sorter.js"}

package/dist/es5/utils/color-utils.js

@@ -5,22 +5,20 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.colorRangeToFlatArray = colorRangeToFlatArray;
 exports.defaultColorRange = void 0;
-var defaultColorRange = [[255, 255, 178], [254, 217, 118], [254, 178, 76], [253, 141, 60], [240, 59, 32], [189, 0, 38]];
+const defaultColorRange = [[255, 255, 178], [254, 217, 118], [254, 178, 76], [253, 141, 60], [240, 59, 32], [189, 0, 38]];
 exports.defaultColorRange = defaultColorRange;
 
-function colorRangeToFlatArray(colorRange) {
-  var normalize = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : false;
-  var ArrayType = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : Float32Array;
-  var flatArray;
+function colorRangeToFlatArray(colorRange, normalize = false, ArrayType = Float32Array) {
+  let flatArray;
 
   if (Number.isFinite(colorRange[0])) {
     flatArray = new ArrayType(colorRange);
   } else {
     flatArray = new ArrayType(colorRange.length * 4);
-    var index = 0;
+    let index = 0;
 
-    for (var i = 0; i < colorRange.length; i++) {
-      var color = colorRange[i];
+    for (let i = 0; i < colorRange.length; i++) {
+      const color = colorRange[i];
       flatArray[index++] = color[0];
       flatArray[index++] = color[1];
       flatArray[index++] = color[2];
@@ -29,8 +27,8 @@ function colorRangeToFlatArray(colorRange) {
   }
 
   if (normalize) {
-    for (var _i = 0; _i < flatArray.length; _i++) {
-      flatArray[_i] /= 255;
+    for (let i = 0; i < flatArray.length; i++) {
+      flatArray[i] /= 255;
     }
   }
 

package/dist/es5/utils/color-utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/utils/color-utils.js"],"names":["defaultColorRange","colorRangeToFlatArray","colorRange","normalize","ArrayType","Float32Array","flatArray","Number","isFinite","length","index","i","color"],"mappings":";;;;;;;AAoBO,IAAMA,iBAAiB,GAAG,CAC/B,CAAC,GAAD,EAAM,GAAN,EAAW,GAAX,CAD+B,EAE/B,CAAC,GAAD,EAAM,GAAN,EAAW,GAAX,CAF+B,EAG/B,CAAC,GAAD,EAAM,GAAN,EAAW,EAAX,CAH+B,EAI/B,CAAC,GAAD,EAAM,GAAN,EAAW,EAAX,CAJ+B,EAK/B,CAAC,GAAD,EAAM,EAAN,EAAU,EAAV,CAL+B,EAM/B,CAAC,GAAD,EAAM,CAAN,EAAS,EAAT,CAN+B,CAA1B;;;AAUA,SAASC,qBAAT,CAA+BC,UAA/B,EAAwF;AAAA,MAA7CC,SAA6C,uEAAjC,KAAiC;AAAA,MAA1BC,SAA0B,uEAAdC,YAAc;AAC7F,MAAIC,SAAJ;;AAEA,MAAIC,MAAM,CAACC,QAAP,CAAgBN,UAAU,CAAC,CAAD,CAA1B,CAAJ,EAAoC;AAElCI,IAAAA,SAAS,GAAG,IAAIF,SAAJ,CAAcF,UAAd,CAAZ;AACD,GAHD,MAGO;AAELI,IAAAA,SAAS,GAAG,IAAIF,SAAJ,CAAcF,UAAU,CAACO,MAAX,GAAoB,CAAlC,CAAZ;AACA,QAAIC,KAAK,GAAG,CAAZ;;AAEA,SAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,UAAU,CAACO,MAA/B,EAAuCE,CAAC,EAAxC,EAA4C;AAC1C,UAAMC,KAAK,GAAGV,UAAU,CAACS,CAAD,CAAxB;AACAL,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBE,KAAK,CAAC,CAAD,CAA1B;AACAN,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBE,KAAK,CAAC,CAAD,CAA1B;AACAN,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBE,KAAK,CAAC,CAAD,CAA1B;AACAN,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBH,MAAM,CAACC,QAAP,CAAgBI,KAAK,CAAC,CAAD,CAArB,IAA4BA,KAAK,CAAC,CAAD,CAAjC,GAAuC,GAA5D;AACD;AACF;;AAED,MAAIT,SAAJ,EAAe;AACb,SAAK,IAAIQ,EAAC,GAAG,CAAb,EAAgBA,EAAC,GAAGL,SAAS,CAACG,MAA9B,EAAsCE,EAAC,EAAvC,EAA2C;AACzCL,MAAAA,SAAS,CAACK,EAAD,CAAT,IAAgB,GAAhB;AACD;AACF;;AACD,SAAOL,SAAP;AACD","sourcesContent":["// Copyright (c) 2015 - 2017 Uber Technologies, Inc.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nexport const defaultColorRange = [\n  [255, 255, 178],\n  [254, 217, 118],\n  [254, 178, 76],\n  [253, 141, 60],\n  [240, 59, 32],\n  [189, 0, 38]\n];\n\n// Converts a colorRange array to a flat array with 4 components per color\nexport function colorRangeToFlatArray(colorRange, normalize = false, ArrayType = Float32Array) {\n  let flatArray;\n\n  if (Number.isFinite(colorRange[0])) {\n    // its already a flat array.\n    flatArray = new ArrayType(colorRange);\n  } else {\n    // flatten it\n    flatArray = new ArrayType(colorRange.length * 4);\n    let index = 0;\n\n    for (let i = 0; i < colorRange.length; i++) {\n      const color = colorRange[i];\n      flatArray[index++] = color[0];\n      flatArray[index++] = color[1];\n      flatArray[index++] = color[2];\n      flatArray[index++] = Number.isFinite(color[3]) ? color[3] : 255;\n    }\n  }\n\n  if (normalize) {\n    for (let i = 0; i < flatArray.length; i++) {\n      flatArray[i] /= 255;\n    }\n  }\n  return flatArray;\n}\n"],"file":"color-utils.js"}
+{"version":3,"sources":["../../../src/utils/color-utils.js"],"names":["defaultColorRange","colorRangeToFlatArray","colorRange","normalize","ArrayType","Float32Array","flatArray","Number","isFinite","length","index","i","color"],"mappings":";;;;;;;AAoBO,MAAMA,iBAAiB,GAAG,CAC/B,CAAC,GAAD,EAAM,GAAN,EAAW,GAAX,CAD+B,EAE/B,CAAC,GAAD,EAAM,GAAN,EAAW,GAAX,CAF+B,EAG/B,CAAC,GAAD,EAAM,GAAN,EAAW,EAAX,CAH+B,EAI/B,CAAC,GAAD,EAAM,GAAN,EAAW,EAAX,CAJ+B,EAK/B,CAAC,GAAD,EAAM,EAAN,EAAU,EAAV,CAL+B,EAM/B,CAAC,GAAD,EAAM,CAAN,EAAS,EAAT,CAN+B,CAA1B;;;AAUA,SAASC,qBAAT,CAA+BC,UAA/B,EAA2CC,SAAS,GAAG,KAAvD,EAA8DC,SAAS,GAAGC,YAA1E,EAAwF;AAC7F,MAAIC,SAAJ;;AAEA,MAAIC,MAAM,CAACC,QAAP,CAAgBN,UAAU,CAAC,CAAD,CAA1B,CAAJ,EAAoC;AAElCI,IAAAA,SAAS,GAAG,IAAIF,SAAJ,CAAcF,UAAd,CAAZ;AACD,GAHD,MAGO;AAELI,IAAAA,SAAS,GAAG,IAAIF,SAAJ,CAAcF,UAAU,CAACO,MAAX,GAAoB,CAAlC,CAAZ;AACA,QAAIC,KAAK,GAAG,CAAZ;;AAEA,SAAK,IAAIC,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGT,UAAU,CAACO,MAA/B,EAAuCE,CAAC,EAAxC,EAA4C;AAC1C,YAAMC,KAAK,GAAGV,UAAU,CAACS,CAAD,CAAxB;AACAL,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBE,KAAK,CAAC,CAAD,CAA1B;AACAN,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBE,KAAK,CAAC,CAAD,CAA1B;AACAN,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBE,KAAK,CAAC,CAAD,CAA1B;AACAN,MAAAA,SAAS,CAACI,KAAK,EAAN,CAAT,GAAqBH,MAAM,CAACC,QAAP,CAAgBI,KAAK,CAAC,CAAD,CAArB,IAA4BA,KAAK,CAAC,CAAD,CAAjC,GAAuC,GAA5D;AACD;AACF;;AAED,MAAIT,SAAJ,EAAe;AACb,SAAK,IAAIQ,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGL,SAAS,CAACG,MAA9B,EAAsCE,CAAC,EAAvC,EAA2C;AACzCL,MAAAA,SAAS,CAACK,CAAD,CAAT,IAAgB,GAAhB;AACD;AACF;;AACD,SAAOL,SAAP;AACD","sourcesContent":["// Copyright (c) 2015 - 2017 Uber Technologies, Inc.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\nexport const defaultColorRange = [\n  [255, 255, 178],\n  [254, 217, 118],\n  [254, 178, 76],\n  [253, 141, 60],\n  [240, 59, 32],\n  [189, 0, 38]\n];\n\n// Converts a colorRange array to a flat array with 4 components per color\nexport function colorRangeToFlatArray(colorRange, normalize = false, ArrayType = Float32Array) {\n  let flatArray;\n\n  if (Number.isFinite(colorRange[0])) {\n    // its already a flat array.\n    flatArray = new ArrayType(colorRange);\n  } else {\n    // flatten it\n    flatArray = new ArrayType(colorRange.length * 4);\n    let index = 0;\n\n    for (let i = 0; i < colorRange.length; i++) {\n      const color = colorRange[i];\n      flatArray[index++] = color[0];\n      flatArray[index++] = color[1];\n      flatArray[index++] = color[2];\n      flatArray[index++] = Number.isFinite(color[3]) ? color[3] : 255;\n    }\n  }\n\n  if (normalize) {\n    for (let i = 0; i < flatArray.length; i++) {\n      flatArray[i] /= 255;\n    }\n  }\n  return flatArray;\n}\n"],"file":"color-utils.js"}