@deck.gl/aggregation-layers 8.10.0-alpha.4 → 8.10.0-alpha.6

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

@@ -11,10 +11,6 @@ var _slicedToArray2 = _interopRequireDefault(require("@babel/runtime/helpers/sli
 
 var _classCallCheck2 = _interopRequireDefault(require("@babel/runtime/helpers/classCallCheck"));
 
-var _createClass2 = _interopRequireDefault(require("@babel/runtime/helpers/createClass"));
-
-var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
-
 var _scaleUtils = require("./scale-utils");
 
 function _createForOfIteratorHelper(o, allowArrayLike) { var it = typeof Symbol !== "undefined" && o[Symbol.iterator] || o["@@iterator"]; if (!it) { 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 = it.call(o); }, 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; } } }; }
@@ -53,13 +49,13 @@ var BinSorter = function () {
     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);
-    (0, _defineProperty2.default)(this, "maxCount", void 0);
-    (0, _defineProperty2.default)(this, "maxValue", void 0);
-    (0, _defineProperty2.default)(this, "minValue", void 0);
-    (0, _defineProperty2.default)(this, "totalCount", void 0);
-    (0, _defineProperty2.default)(this, "aggregatedBins", void 0);
-    (0, _defineProperty2.default)(this, "sortedBins", void 0);
-    (0, _defineProperty2.default)(this, "binMap", void 0);
+    this.maxCount = void 0;
+    this.maxValue = void 0;
+    this.minValue = void 0;
+    this.totalCount = void 0;
+    this.aggregatedBins = void 0;
+    this.sortedBins = void 0;
+    this.binMap = void 0;
     this.aggregatedBins = this.getAggregatedBins(bins, props);
 
     this._updateMinMaxValues();
@@ -67,190 +63,184 @@ 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++;
-        }
+  var _proto = BinSorter.prototype;
+
+  _proto.getAggregatedBins = 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++;
       }
+    }
+
+    return aggregatedBins;
+  };
 
-      return aggregatedBins;
+  _proto._percentileToIndex = function _percentileToIndex(percentileRange) {
+    var len = this.sortedBins.length;
+
+    if (len < 2) {
+      return [0, 0];
     }
-  }, {
-    key: "_percentileToIndex",
-    value: function _percentileToIndex(percentileRange) {
-      var len = this.sortedBins.length;
 
-      if (len < 2) {
-        return [0, 0];
-      }
+    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];
+
+    var lowerIdx = Math.ceil(lower / 100 * (len - 1));
+    var upperIdx = Math.floor(upper / 100 * (len - 1));
+    return [lowerIdx, upperIdx];
+  };
+
+  _proto.getBinMap = function getBinMap() {
+    var binMap = {};
 
-      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];
+    var _iterator = _createForOfIteratorHelper(this.aggregatedBins),
+        _step;
 
-      var lowerIdx = Math.ceil(lower / 100 * (len - 1));
-      var upperIdx = Math.floor(upper / 100 * (len - 1));
-      return [lowerIdx, upperIdx];
+    try {
+      for (_iterator.s(); !(_step = _iterator.n()).done;) {
+        var bin = _step.value;
+        binMap[bin.i] = bin;
+      }
+    } catch (err) {
+      _iterator.e(err);
+    } finally {
+      _iterator.f();
     }
-  }, {
-    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;
+  };
+
+  _proto._updateMinMaxValues = 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();
+    }
 
-      return binMap;
+    this.maxCount = maxCount;
+    this.maxValue = maxValue;
+    this.minValue = minValue;
+    this.totalCount = totalCount;
+  };
+
+  _proto.getValueRange = function getValueRange(percentileRange) {
+    if (!this.sortedBins) {
+      this.sortedBins = this.aggregatedBins.sort(function (a, b) {
+        return ascending(a.value, b.value);
+      });
     }
-  }, {
-    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;
+    if (!this.sortedBins.length) {
+      return [];
     }
-  }, {
-    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 [];
-      }
+    var lowerIdx = 0;
+    var upperIdx = this.sortedBins.length - 1;
 
-      var lowerIdx = 0;
-      var upperIdx = this.sortedBins.length - 1;
+    if (Array.isArray(percentileRange)) {
+      var idxRange = this._percentileToIndex(percentileRange);
 
-      if (Array.isArray(percentileRange)) {
-        var idxRange = this._percentileToIndex(percentileRange);
+      lowerIdx = idxRange[0];
+      upperIdx = idxRange[1];
+    }
 
-        lowerIdx = idxRange[0];
-        upperIdx = idxRange[1];
-      }
+    return [this.sortedBins[lowerIdx].value, this.sortedBins[upperIdx].value];
+  };
+
+  _proto.getValueDomainByScale = 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);
+      });
+    }
 
-      return [this.sortedBins[lowerIdx].value, this.sortedBins[upperIdx].value];
+    if (!this.sortedBins.length) {
+      return [];
     }
-  }, {
-    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 [];
-      }
+    var indexEdge = this._percentileToIndex([lower, upper]);
 
-      var indexEdge = this._percentileToIndex([lower, upper]);
+    return this._getScaleDomain(scale, indexEdge);
+  };
 
-      return this._getScaleDomain(scale, indexEdge);
-    }
-  }, {
-    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];
-      }
+  _proto._getScaleDomain = 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];
     }
-  }]);
+  };
+
   return BinSorter;
 }();
 

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

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/utils/bin-sorter.ts"],"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;;IAaqBC,S;AAUnB,uBAA2E;AAAA,QAA/DC,IAA+D,uEAAxD,EAAwD;AAAA,QAApDC,KAAoD,uEAAdP,YAAc;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AACzE,SAAKQ,cAAL,GAAsB,KAAKC,iBAAL,CAAuBH,IAAvB,EAA6BC,KAA7B,CAAtB;;AACA,SAAKG,mBAAL;;AACA,SAAKC,MAAL,GAAc,KAAKC,SAAL,EAAd;AACD;;;;WASD,2BAAkBN,IAAlB,EAAwBC,KAAxB,EAAgD;AAC9C,4BAKIA,KALJ,CACEN,QADF;AAAA,UACEA,QADF,gCACab,eADb;AAAA,6BAKImB,KALJ,CAEEL,SAFF;AAAA,UAEEA,SAFF,iCAEcV,gBAFd;AAAA,4BAKIe,KALJ,CAGEJ,QAHF;AAAA,UAGEA,QAHF,gCAGaT,eAHb;AAAA,UAIEU,UAJF,GAKIG,KALJ,CAIEH,UAJF;AAOA,UAAMS,SAAS,GAAG,OAAOT,UAAP,KAAsB,UAAxC;AACA,UAAMU,QAAQ,GAAGR,IAAI,CAAChB,MAAtB;AACA,UAAMkB,cAA+B,GAAG,EAAxC;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;;;WAED,4BAAmBgB,eAAnB,EAAsD;AACpD,UAAMC,GAAG,GAAG,KAAKC,UAAL,CAAgBpC,MAA5B;;AACA,UAAImC,GAAG,GAAG,CAAV,EAAa;AACX,eAAO,CAAC,CAAD,EAAI,CAAJ,CAAP;AACD;;AAED,iCAAuBD,eAAe,CAACG,GAAhB,CAAoB,UAAAC,CAAC;AAAA,eAAI,uBAAMA,CAAN,EAAS,CAAT,EAAY,GAAZ,CAAJ;AAAA,OAArB,CAAvB;AAAA;AAAA,UAAOC,KAAP;AAAA,UAAcC,KAAd;;AAEA,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;;;WAOD,qBAA2C;AACzC,UAAMvB,MAAM,GAAG,EAAf;;AADyC,iDAEvB,KAAKH,cAFkB;AAAA;;AAAA;AAEzC,4DAAuC;AAAA,cAA5Bf,GAA4B;AACrCkB,UAAAA,MAAM,CAAClB,GAAG,CAACuB,CAAL,CAAN,GAAgBvB,GAAhB;AACD;AAJwC;AAAA;AAAA;AAAA;AAAA;;AAKzC,aAAOkB,MAAP;AACD;;;WAOD,+BAA4B;AAC1B,UAAIyB,QAAQ,GAAG,CAAf;AACA,UAAIC,QAAQ,GAAG,CAAf;AACA,UAAIC,QAAQ,GAAG/C,gBAAf;AACA,UAAIgD,UAAU,GAAG,CAAjB;;AAJ0B,kDAKV,KAAK/B,cALK;AAAA;;AAAA;AAK1B,+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;AAVyB;AAAA;AAAA;AAAA;AAAA;;AAW1B,WAAKa,QAAL,GAAgBA,QAAhB;AACA,WAAKC,QAAL,GAAgBA,QAAhB;AACA,WAAKC,QAAL,GAAgBA,QAAhB;AACA,WAAKC,UAAL,GAAkBA,UAAlB;AACD;;;WASD,uBAAcf,eAAd,EAAmE;AACjE,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;AAE3B,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;;;WAED,+BAAsB2B,KAAtB,EAAoE;AAAA,qFAAJ,EAAI;AAAA;AAAA;AAAA,UAA9BjB,KAA8B,uBAAtB,CAAsB;AAAA;AAAA,UAAnBC,KAAmB,wBAAX,GAAW;;AAClE,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;;;WAED,yBAAgBE,SAAhB,SAA6F;AAAA;AAAA,UAAzDlB,QAAyD;AAAA,UAA/CG,QAA+C;;AAC3F,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 type AggregatedBin = {\n  i: number;\n  value: any;\n  counts: number;\n};\n\nexport default class BinSorter {\n  maxCount!: number;\n  maxValue!: number;\n  minValue!: number;\n  totalCount!: number;\n\n  aggregatedBins: AggregatedBin[];\n  sortedBins!: AggregatedBin[];\n  binMap: Record<number, AggregatedBin>;\n\n  constructor(bins = [], props: Partial<typeof defaultProps> = 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): AggregatedBin[] {\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: AggregatedBin[] = [];\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): [number, number] {\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(): Record<number, AggregatedBin> {\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   */\n  _updateMinMaxValues(): void {\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: [number, number]): [number, number] {\n    if (!this.sortedBins) {\n      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));\n    }\n    if (!this.sortedBins.length) {\n      // @ts-expect-error\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: string, [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: string, [lowerIdx, upperIdx]: [number, number]): [number, number] {\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) as [number, number];\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.ts"],"names":["defaultGetValue","points","length","MAX_32_BIT_FLOAT","defaultGetPoints","bin","defaultGetIndex","index","ascending","a","b","NaN","defaultProps","getValue","getPoints","getIndex","filterData","BinSorter","bins","props","maxCount","maxValue","minValue","totalCount","aggregatedBins","sortedBins","binMap","getAggregatedBins","_updateMinMaxValues","getBinMap","hasFilter","binCount","binIndex","i","filteredPoints","filter","value","undefined","Number","isFinite","counts","_percentileToIndex","percentileRange","len","map","n","lower","upper","lowerIdx","Math","ceil","upperIdx","floor","x","getValueRange","sort","Array","isArray","idxRange","getValueDomainByScale","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;;IAaqBC,S;AAUnB,uBAA2E;AAAA,QAA/DC,IAA+D,uEAAxD,EAAwD;AAAA,QAApDC,KAAoD,uEAAdP,YAAc;AAAA;AAAA,SAT3EQ,QAS2E;AAAA,SAR3EC,QAQ2E;AAAA,SAP3EC,QAO2E;AAAA,SAN3EC,UAM2E;AAAA,SAJ3EC,cAI2E;AAAA,SAH3EC,UAG2E;AAAA,SAF3EC,MAE2E;AACzE,SAAKF,cAAL,GAAsB,KAAKG,iBAAL,CAAuBT,IAAvB,EAA6BC,KAA7B,CAAtB;;AACA,SAAKS,mBAAL;;AACA,SAAKF,MAAL,GAAc,KAAKG,SAAL,EAAd;AACD;;;;SASDF,iB,GAAA,2BAAkBT,IAAlB,EAAwBC,KAAxB,EAAgD;AAC9C,0BAKIA,KALJ,CACEN,QADF;AAAA,QACEA,QADF,gCACab,eADb;AAAA,2BAKImB,KALJ,CAEEL,SAFF;AAAA,QAEEA,SAFF,iCAEcV,gBAFd;AAAA,0BAKIe,KALJ,CAGEJ,QAHF;AAAA,QAGEA,QAHF,gCAGaT,eAHb;AAAA,QAIEU,UAJF,GAKIG,KALJ,CAIEH,UAJF;AAOA,QAAMc,SAAS,GAAG,OAAOd,UAAP,KAAsB,UAAxC;AACA,QAAMe,QAAQ,GAAGb,IAAI,CAAChB,MAAtB;AACA,QAAMsB,cAA+B,GAAG,EAAxC;AACA,QAAIjB,KAAK,GAAG,CAAZ;;AAEA,SAAK,IAAIyB,QAAQ,GAAG,CAApB,EAAuBA,QAAQ,GAAGD,QAAlC,EAA4CC,QAAQ,EAApD,EAAwD;AACtD,UAAM3B,GAAG,GAAGa,IAAI,CAACc,QAAD,CAAhB;AACA,UAAM/B,MAAM,GAAGa,SAAS,CAACT,GAAD,CAAxB;AACA,UAAM4B,CAAC,GAAGlB,QAAQ,CAACV,GAAD,CAAlB;AAEA,UAAM6B,cAAc,GAAGJ,SAAS,GAAG7B,MAAM,CAACkC,MAAP,CAAcnB,UAAd,CAAH,GAA+Bf,MAA/D;AAEAI,MAAAA,GAAG,CAAC6B,cAAJ,GAAqBJ,SAAS,GAAGI,cAAH,GAAoB,IAAlD;AAEA,UAAME,KAAK,GAAGF,cAAc,CAAChC,MAAf,GAAwBW,QAAQ,CAACqB,cAAD,CAAhC,GAAmD,IAAjE;;AAEA,UAAIE,KAAK,KAAK,IAAV,IAAkBA,KAAK,KAAKC,SAAhC,EAA2C;AAEzCb,QAAAA,cAAc,CAACjB,KAAD,CAAd,GAAwB;AACtB0B,UAAAA,CAAC,EAAEK,MAAM,CAACC,QAAP,CAAgBN,CAAhB,IAAqBA,CAArB,GAAyBD,QADN;AAEtBI,UAAAA,KAAK,EAALA,KAFsB;AAGtBI,UAAAA,MAAM,EAAEN,cAAc,CAAChC;AAHD,SAAxB;AAKAK,QAAAA,KAAK;AACN;AACF;;AACD,WAAOiB,cAAP;AACD,G;;SAEDiB,kB,GAAA,4BAAmBC,eAAnB,EAAsD;AACpD,QAAMC,GAAG,GAAG,KAAKlB,UAAL,CAAgBvB,MAA5B;;AACA,QAAIyC,GAAG,GAAG,CAAV,EAAa;AACX,aAAO,CAAC,CAAD,EAAI,CAAJ,CAAP;AACD;;AAED,+BAAuBD,eAAe,CAACE,GAAhB,CAAoB,UAAAC,CAAC;AAAA,aAAI,uBAAMA,CAAN,EAAS,CAAT,EAAY,GAAZ,CAAJ;AAAA,KAArB,CAAvB;AAAA;AAAA,QAAOC,KAAP;AAAA,QAAcC,KAAd;;AAEA,QAAMC,QAAQ,GAAGC,IAAI,CAACC,IAAL,CAAWJ,KAAK,GAAG,GAAT,IAAiBH,GAAG,GAAG,CAAvB,CAAV,CAAjB;AACA,QAAMQ,QAAQ,GAAGF,IAAI,CAACG,KAAL,CAAYL,KAAK,GAAG,GAAT,IAAiBJ,GAAG,GAAG,CAAvB,CAAX,CAAjB;AAEA,WAAO,CAACK,QAAD,EAAWG,QAAX,CAAP;AACD,G;;SAODtB,S,GAAA,qBAA2C;AACzC,QAAMH,MAAM,GAAG,EAAf;;AADyC,+CAEvB,KAAKF,cAFkB;AAAA;;AAAA;AAEzC,0DAAuC;AAAA,YAA5BnB,GAA4B;AACrCqB,QAAAA,MAAM,CAACrB,GAAG,CAAC4B,CAAL,CAAN,GAAgB5B,GAAhB;AACD;AAJwC;AAAA;AAAA;AAAA;AAAA;;AAKzC,WAAOqB,MAAP;AACD,G;;SAODE,mB,GAAA,+BAA4B;AAC1B,QAAIR,QAAQ,GAAG,CAAf;AACA,QAAIC,QAAQ,GAAG,CAAf;AACA,QAAIC,QAAQ,GAAGnB,gBAAf;AACA,QAAIoB,UAAU,GAAG,CAAjB;;AAJ0B,gDAKV,KAAKC,cALK;AAAA;;AAAA;AAK1B,6DAAqC;AAAA,YAA1B6B,CAA0B;AACnCjC,QAAAA,QAAQ,GAAGA,QAAQ,GAAGiC,CAAC,CAACb,MAAb,GAAsBpB,QAAtB,GAAiCiC,CAAC,CAACb,MAA9C;AACAnB,QAAAA,QAAQ,GAAGA,QAAQ,GAAGgC,CAAC,CAACjB,KAAb,GAAqBf,QAArB,GAAgCgC,CAAC,CAACjB,KAA7C;AACAd,QAAAA,QAAQ,GAAGA,QAAQ,GAAG+B,CAAC,CAACjB,KAAb,GAAqBd,QAArB,GAAgC+B,CAAC,CAACjB,KAA7C;AACAb,QAAAA,UAAU,IAAI8B,CAAC,CAACb,MAAhB;AACD;AAVyB;AAAA;AAAA;AAAA;AAAA;;AAW1B,SAAKpB,QAAL,GAAgBA,QAAhB;AACA,SAAKC,QAAL,GAAgBA,QAAhB;AACA,SAAKC,QAAL,GAAgBA,QAAhB;AACA,SAAKC,UAAL,GAAkBA,UAAlB;AACD,G;;SASD+B,a,GAAA,uBAAcZ,eAAd,EAAmE;AACjE,QAAI,CAAC,KAAKjB,UAAV,EAAsB;AACpB,WAAKA,UAAL,GAAkB,KAAKD,cAAL,CAAoB+B,IAApB,CAAyB,UAAC9C,CAAD,EAAIC,CAAJ;AAAA,eAAUF,SAAS,CAACC,CAAC,CAAC2B,KAAH,EAAU1B,CAAC,CAAC0B,KAAZ,CAAnB;AAAA,OAAzB,CAAlB;AACD;;AACD,QAAI,CAAC,KAAKX,UAAL,CAAgBvB,MAArB,EAA6B;AAE3B,aAAO,EAAP;AACD;;AACD,QAAI8C,QAAQ,GAAG,CAAf;AACA,QAAIG,QAAQ,GAAG,KAAK1B,UAAL,CAAgBvB,MAAhB,GAAyB,CAAxC;;AAEA,QAAIsD,KAAK,CAACC,OAAN,CAAcf,eAAd,CAAJ,EAAoC;AAClC,UAAMgB,QAAQ,GAAG,KAAKjB,kBAAL,CAAwBC,eAAxB,CAAjB;;AACAM,MAAAA,QAAQ,GAAGU,QAAQ,CAAC,CAAD,CAAnB;AACAP,MAAAA,QAAQ,GAAGO,QAAQ,CAAC,CAAD,CAAnB;AACD;;AAED,WAAO,CAAC,KAAKjC,UAAL,CAAgBuB,QAAhB,EAA0BZ,KAA3B,EAAkC,KAAKX,UAAL,CAAgB0B,QAAhB,EAA0Bf,KAA5D,CAAP;AACD,G;;SAEDuB,qB,GAAA,+BAAsBC,KAAtB,EAAoE;AAAA,mFAAJ,EAAI;AAAA;AAAA;AAAA,QAA9Bd,KAA8B,uBAAtB,CAAsB;AAAA;AAAA,QAAnBC,KAAmB,wBAAX,GAAW;;AAClE,QAAI,CAAC,KAAKtB,UAAV,EAAsB;AACpB,WAAKA,UAAL,GAAkB,KAAKD,cAAL,CAAoB+B,IAApB,CAAyB,UAAC9C,CAAD,EAAIC,CAAJ;AAAA,eAAUF,SAAS,CAACC,CAAC,CAAC2B,KAAH,EAAU1B,CAAC,CAAC0B,KAAZ,CAAnB;AAAA,OAAzB,CAAlB;AACD;;AACD,QAAI,CAAC,KAAKX,UAAL,CAAgBvB,MAArB,EAA6B;AAC3B,aAAO,EAAP;AACD;;AACD,QAAM2D,SAAS,GAAG,KAAKpB,kBAAL,CAAwB,CAACK,KAAD,EAAQC,KAAR,CAAxB,CAAlB;;AAEA,WAAO,KAAKe,eAAL,CAAqBF,KAArB,EAA4BC,SAA5B,CAAP;AACD,G;;SAEDC,e,GAAA,yBAAgBC,SAAhB,SAA6F;AAAA;AAAA,QAAzDf,QAAyD;AAAA,QAA/CG,QAA+C;;AAC3F,QAAMjC,IAAI,GAAG,KAAKO,UAAlB;;AAEA,YAAQsC,SAAR;AACE,WAAK,UAAL;AACA,WAAK,QAAL;AACE,eAAO,CAAC7C,IAAI,CAAC8B,QAAD,CAAJ,CAAeZ,KAAhB,EAAuBlB,IAAI,CAACiC,QAAD,CAAJ,CAAef,KAAtC,CAAP;;AAEF,WAAK,UAAL;AACE,eAAO,mCAAkBlB,IAAI,CAAC8C,KAAL,CAAWhB,QAAX,EAAqBG,QAAQ,GAAG,CAAhC,CAAlB,EAAsD,UAAAc,CAAC;AAAA,iBAAIA,CAAC,CAAC7B,KAAN;AAAA,SAAvD,CAAP;;AAEF,WAAK,SAAL;AACE,eAAO,kCAAiBlB,IAAjB,EAAuB,UAAA+C,CAAC;AAAA,iBAAIA,CAAC,CAAC7B,KAAN;AAAA,SAAxB,CAAP;;AAEF;AACE,eAAO,CAAClB,IAAI,CAAC8B,QAAD,CAAJ,CAAeZ,KAAhB,EAAuBlB,IAAI,CAACiC,QAAD,CAAJ,CAAef,KAAtC,CAAP;AAZJ;AAcD,G","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 type AggregatedBin = {\n  i: number;\n  value: any;\n  counts: number;\n};\n\nexport default class BinSorter {\n  maxCount!: number;\n  maxValue!: number;\n  minValue!: number;\n  totalCount!: number;\n\n  aggregatedBins: AggregatedBin[];\n  sortedBins!: AggregatedBin[];\n  binMap: Record<number, AggregatedBin>;\n\n  constructor(bins = [], props: Partial<typeof defaultProps> = 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): AggregatedBin[] {\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: AggregatedBin[] = [];\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): [number, number] {\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(): Record<number, AggregatedBin> {\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   */\n  _updateMinMaxValues(): void {\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: [number, number]): [number, number] {\n    if (!this.sortedBins) {\n      this.sortedBins = this.aggregatedBins.sort((a, b) => ascending(a.value, b.value));\n    }\n    if (!this.sortedBins.length) {\n      // @ts-expect-error\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: string, [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: string, [lowerIdx, upperIdx]: [number, number]): [number, number] {\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) as [number, number];\n\n      default:\n        return [bins[lowerIdx].value, bins[upperIdx].value];\n    }\n  }\n}\n"],"file":"bin-sorter.js"}