@guardian/interactive-component-library 0.2.0-rc1 → 0.2.0-rc2

package/dist/node_modules/.pnpm/dayjs@1.11.12/node_modules/dayjs/dayjs.min.js

@@ -0,0 +1,282 @@
+import { commonjsGlobal, getDefaultExportFromCjs } from "../../../../../_virtual/_commonjsHelpers.js";
+import { __module as dayjs_min } from "../../../../../_virtual/dayjs.min.js";
+(function(module, exports) {
+  !function(t, e) {
+    module.exports = e();
+  }(commonjsGlobal, function() {
+    var t = 1e3, e = 6e4, n = 36e5, r = "millisecond", i = "second", s = "minute", u = "hour", a = "day", o = "week", c = "month", f = "quarter", h = "year", d = "date", l = "Invalid Date", $ = /^(\d{4})[-/]?(\d{1,2})?[-/]?(\d{0,2})[Tt\s]*(\d{1,2})?:?(\d{1,2})?:?(\d{1,2})?[.:]?(\d+)?$/, y = /\[([^\]]+)]|Y{1,4}|M{1,4}|D{1,2}|d{1,4}|H{1,2}|h{1,2}|a|A|m{1,2}|s{1,2}|Z{1,2}|SSS/g, M = { name: "en", weekdays: "Sunday_Monday_Tuesday_Wednesday_Thursday_Friday_Saturday".split("_"), months: "January_February_March_April_May_June_July_August_September_October_November_December".split("_"), ordinal: function(t2) {
+      var e2 = ["th", "st", "nd", "rd"], n2 = t2 % 100;
+      return "[" + t2 + (e2[(n2 - 20) % 10] || e2[n2] || e2[0]) + "]";
+    } }, m = function(t2, e2, n2) {
+      var r2 = String(t2);
+      return !r2 || r2.length >= e2 ? t2 : "" + Array(e2 + 1 - r2.length).join(n2) + t2;
+    }, v = { s: m, z: function(t2) {
+      var e2 = -t2.utcOffset(), n2 = Math.abs(e2), r2 = Math.floor(n2 / 60), i2 = n2 % 60;
+      return (e2 <= 0 ? "+" : "-") + m(r2, 2, "0") + ":" + m(i2, 2, "0");
+    }, m: function t2(e2, n2) {
+      if (e2.date() < n2.date()) return -t2(n2, e2);
+      var r2 = 12 * (n2.year() - e2.year()) + (n2.month() - e2.month()), i2 = e2.clone().add(r2, c), s2 = n2 - i2 < 0, u2 = e2.clone().add(r2 + (s2 ? -1 : 1), c);
+      return +(-(r2 + (n2 - i2) / (s2 ? i2 - u2 : u2 - i2)) || 0);
+    }, a: function(t2) {
+      return t2 < 0 ? Math.ceil(t2) || 0 : Math.floor(t2);
+    }, p: function(t2) {
+      return { M: c, y: h, w: o, d: a, D: d, h: u, m: s, s: i, ms: r, Q: f }[t2] || String(t2 || "").toLowerCase().replace(/s$/, "");
+    }, u: function(t2) {
+      return void 0 === t2;
+    } }, g = "en", D = {};
+    D[g] = M;
+    var p = "$isDayjsObject", S = function(t2) {
+      return t2 instanceof _ || !(!t2 || !t2[p]);
+    }, w = function t2(e2, n2, r2) {
+      var i2;
+      if (!e2) return g;
+      if ("string" == typeof e2) {
+        var s2 = e2.toLowerCase();
+        D[s2] && (i2 = s2), n2 && (D[s2] = n2, i2 = s2);
+        var u2 = e2.split("-");
+        if (!i2 && u2.length > 1) return t2(u2[0]);
+      } else {
+        var a2 = e2.name;
+        D[a2] = e2, i2 = a2;
+      }
+      return !r2 && i2 && (g = i2), i2 || !r2 && g;
+    }, O = function(t2, e2) {
+      if (S(t2)) return t2.clone();
+      var n2 = "object" == typeof e2 ? e2 : {};
+      return n2.date = t2, n2.args = arguments, new _(n2);
+    }, b = v;
+    b.l = w, b.i = S, b.w = function(t2, e2) {
+      return O(t2, { locale: e2.$L, utc: e2.$u, x: e2.$x, $offset: e2.$offset });
+    };
+    var _ = function() {
+      function M2(t2) {
+        this.$L = w(t2.locale, null, true), this.parse(t2), this.$x = this.$x || t2.x || {}, this[p] = true;
+      }
+      var m2 = M2.prototype;
+      return m2.parse = function(t2) {
+        this.$d = function(t3) {
+          var e2 = t3.date, n2 = t3.utc;
+          if (null === e2) return /* @__PURE__ */ new Date(NaN);
+          if (b.u(e2)) return /* @__PURE__ */ new Date();
+          if (e2 instanceof Date) return new Date(e2);
+          if ("string" == typeof e2 && !/Z$/i.test(e2)) {
+            var r2 = e2.match($);
+            if (r2) {
+              var i2 = r2[2] - 1 || 0, s2 = (r2[7] || "0").substring(0, 3);
+              return n2 ? new Date(Date.UTC(r2[1], i2, r2[3] || 1, r2[4] || 0, r2[5] || 0, r2[6] || 0, s2)) : new Date(r2[1], i2, r2[3] || 1, r2[4] || 0, r2[5] || 0, r2[6] || 0, s2);
+            }
+          }
+          return new Date(e2);
+        }(t2), this.init();
+      }, m2.init = function() {
+        var t2 = this.$d;
+        this.$y = t2.getFullYear(), this.$M = t2.getMonth(), this.$D = t2.getDate(), this.$W = t2.getDay(), this.$H = t2.getHours(), this.$m = t2.getMinutes(), this.$s = t2.getSeconds(), this.$ms = t2.getMilliseconds();
+      }, m2.$utils = function() {
+        return b;
+      }, m2.isValid = function() {
+        return !(this.$d.toString() === l);
+      }, m2.isSame = function(t2, e2) {
+        var n2 = O(t2);
+        return this.startOf(e2) <= n2 && n2 <= this.endOf(e2);
+      }, m2.isAfter = function(t2, e2) {
+        return O(t2) < this.startOf(e2);
+      }, m2.isBefore = function(t2, e2) {
+        return this.endOf(e2) < O(t2);
+      }, m2.$g = function(t2, e2, n2) {
+        return b.u(t2) ? this[e2] : this.set(n2, t2);
+      }, m2.unix = function() {
+        return Math.floor(this.valueOf() / 1e3);
+      }, m2.valueOf = function() {
+        return this.$d.getTime();
+      }, m2.startOf = function(t2, e2) {
+        var n2 = this, r2 = !!b.u(e2) || e2, f2 = b.p(t2), l2 = function(t3, e3) {
+          var i2 = b.w(n2.$u ? Date.UTC(n2.$y, e3, t3) : new Date(n2.$y, e3, t3), n2);
+          return r2 ? i2 : i2.endOf(a);
+        }, $2 = function(t3, e3) {
+          return b.w(n2.toDate()[t3].apply(n2.toDate("s"), (r2 ? [0, 0, 0, 0] : [23, 59, 59, 999]).slice(e3)), n2);
+        }, y2 = this.$W, M3 = this.$M, m3 = this.$D, v2 = "set" + (this.$u ? "UTC" : "");
+        switch (f2) {
+          case h:
+            return r2 ? l2(1, 0) : l2(31, 11);
+          case c:
+            return r2 ? l2(1, M3) : l2(0, M3 + 1);
+          case o:
+            var g2 = this.$locale().weekStart || 0, D2 = (y2 < g2 ? y2 + 7 : y2) - g2;
+            return l2(r2 ? m3 - D2 : m3 + (6 - D2), M3);
+          case a:
+          case d:
+            return $2(v2 + "Hours", 0);
+          case u:
+            return $2(v2 + "Minutes", 1);
+          case s:
+            return $2(v2 + "Seconds", 2);
+          case i:
+            return $2(v2 + "Milliseconds", 3);
+          default:
+            return this.clone();
+        }
+      }, m2.endOf = function(t2) {
+        return this.startOf(t2, false);
+      }, m2.$set = function(t2, e2) {
+        var n2, o2 = b.p(t2), f2 = "set" + (this.$u ? "UTC" : ""), l2 = (n2 = {}, n2[a] = f2 + "Date", n2[d] = f2 + "Date", n2[c] = f2 + "Month", n2[h] = f2 + "FullYear", n2[u] = f2 + "Hours", n2[s] = f2 + "Minutes", n2[i] = f2 + "Seconds", n2[r] = f2 + "Milliseconds", n2)[o2], $2 = o2 === a ? this.$D + (e2 - this.$W) : e2;
+        if (o2 === c || o2 === h) {
+          var y2 = this.clone().set(d, 1);
+          y2.$d[l2]($2), y2.init(), this.$d = y2.set(d, Math.min(this.$D, y2.daysInMonth())).$d;
+        } else l2 && this.$d[l2]($2);
+        return this.init(), this;
+      }, m2.set = function(t2, e2) {
+        return this.clone().$set(t2, e2);
+      }, m2.get = function(t2) {
+        return this[b.p(t2)]();
+      }, m2.add = function(r2, f2) {
+        var d2, l2 = this;
+        r2 = Number(r2);
+        var $2 = b.p(f2), y2 = function(t2) {
+          var e2 = O(l2);
+          return b.w(e2.date(e2.date() + Math.round(t2 * r2)), l2);
+        };
+        if ($2 === c) return this.set(c, this.$M + r2);
+        if ($2 === h) return this.set(h, this.$y + r2);
+        if ($2 === a) return y2(1);
+        if ($2 === o) return y2(7);
+        var M3 = (d2 = {}, d2[s] = e, d2[u] = n, d2[i] = t, d2)[$2] || 1, m3 = this.$d.getTime() + r2 * M3;
+        return b.w(m3, this);
+      }, m2.subtract = function(t2, e2) {
+        return this.add(-1 * t2, e2);
+      }, m2.format = function(t2) {
+        var e2 = this, n2 = this.$locale();
+        if (!this.isValid()) return n2.invalidDate || l;
+        var r2 = t2 || "YYYY-MM-DDTHH:mm:ssZ", i2 = b.z(this), s2 = this.$H, u2 = this.$m, a2 = this.$M, o2 = n2.weekdays, c2 = n2.months, f2 = n2.meridiem, h2 = function(t3, n3, i3, s3) {
+          return t3 && (t3[n3] || t3(e2, r2)) || i3[n3].slice(0, s3);
+        }, d2 = function(t3) {
+          return b.s(s2 % 12 || 12, t3, "0");
+        }, $2 = f2 || function(t3, e3, n3) {
+          var r3 = t3 < 12 ? "AM" : "PM";
+          return n3 ? r3.toLowerCase() : r3;
+        };
+        return r2.replace(y, function(t3, r3) {
+          return r3 || function(t4) {
+            switch (t4) {
+              case "YY":
+                return String(e2.$y).slice(-2);
+              case "YYYY":
+                return b.s(e2.$y, 4, "0");
+              case "M":
+                return a2 + 1;
+              case "MM":
+                return b.s(a2 + 1, 2, "0");
+              case "MMM":
+                return h2(n2.monthsShort, a2, c2, 3);
+              case "MMMM":
+                return h2(c2, a2);
+              case "D":
+                return e2.$D;
+              case "DD":
+                return b.s(e2.$D, 2, "0");
+              case "d":
+                return String(e2.$W);
+              case "dd":
+                return h2(n2.weekdaysMin, e2.$W, o2, 2);
+              case "ddd":
+                return h2(n2.weekdaysShort, e2.$W, o2, 3);
+              case "dddd":
+                return o2[e2.$W];
+              case "H":
+                return String(s2);
+              case "HH":
+                return b.s(s2, 2, "0");
+              case "h":
+                return d2(1);
+              case "hh":
+                return d2(2);
+              case "a":
+                return $2(s2, u2, true);
+              case "A":
+                return $2(s2, u2, false);
+              case "m":
+                return String(u2);
+              case "mm":
+                return b.s(u2, 2, "0");
+              case "s":
+                return String(e2.$s);
+              case "ss":
+                return b.s(e2.$s, 2, "0");
+              case "SSS":
+                return b.s(e2.$ms, 3, "0");
+              case "Z":
+                return i2;
+            }
+            return null;
+          }(t3) || i2.replace(":", "");
+        });
+      }, m2.utcOffset = function() {
+        return 15 * -Math.round(this.$d.getTimezoneOffset() / 15);
+      }, m2.diff = function(r2, d2, l2) {
+        var $2, y2 = this, M3 = b.p(d2), m3 = O(r2), v2 = (m3.utcOffset() - this.utcOffset()) * e, g2 = this - m3, D2 = function() {
+          return b.m(y2, m3);
+        };
+        switch (M3) {
+          case h:
+            $2 = D2() / 12;
+            break;
+          case c:
+            $2 = D2();
+            break;
+          case f:
+            $2 = D2() / 3;
+            break;
+          case o:
+            $2 = (g2 - v2) / 6048e5;
+            break;
+          case a:
+            $2 = (g2 - v2) / 864e5;
+            break;
+          case u:
+            $2 = g2 / n;
+            break;
+          case s:
+            $2 = g2 / e;
+            break;
+          case i:
+            $2 = g2 / t;
+            break;
+          default:
+            $2 = g2;
+        }
+        return l2 ? $2 : b.a($2);
+      }, m2.daysInMonth = function() {
+        return this.endOf(c).$D;
+      }, m2.$locale = function() {
+        return D[this.$L];
+      }, m2.locale = function(t2, e2) {
+        if (!t2) return this.$L;
+        var n2 = this.clone(), r2 = w(t2, e2, true);
+        return r2 && (n2.$L = r2), n2;
+      }, m2.clone = function() {
+        return b.w(this.$d, this);
+      }, m2.toDate = function() {
+        return new Date(this.valueOf());
+      }, m2.toJSON = function() {
+        return this.isValid() ? this.toISOString() : null;
+      }, m2.toISOString = function() {
+        return this.$d.toISOString();
+      }, m2.toString = function() {
+        return this.$d.toUTCString();
+      }, M2;
+    }(), k = _.prototype;
+    return O.prototype = k, [["$ms", r], ["$s", i], ["$m", s], ["$H", u], ["$W", a], ["$M", c], ["$y", h], ["$D", d]].forEach(function(t2) {
+      k[t2[1]] = function(e2) {
+        return this.$g(e2, t2[0], t2[1]);
+      };
+    }), O.extend = function(t2, e2) {
+      return t2.$i || (t2(e2, _, O), t2.$i = true), O;
+    }, O.locale = w, O.isDayjs = S, O.unix = function(t2) {
+      return O(1e3 * t2);
+    }, O.en = D[g], O.Ls = D, O.p = {}, O;
+  });
+})(dayjs_min);
+var dayjs_minExports = dayjs_min.exports;
+const dayjs = /* @__PURE__ */ getDefaultExportFromCjs(dayjs_minExports);
+export {
+  dayjs as default
+};

package/dist/node_modules/.pnpm/dayjs@1.11.12/node_modules/dayjs/plugin/relativeTime.js

@@ -0,0 +1,48 @@
+import { commonjsGlobal, getDefaultExportFromCjs } from "../../../../../../_virtual/_commonjsHelpers.js";
+import { __module as relativeTime$1 } from "../../../../../../_virtual/relativeTime.js";
+(function(module, exports) {
+  !function(r, e) {
+    module.exports = e();
+  }(commonjsGlobal, function() {
+    return function(r, e, t) {
+      r = r || {};
+      var n = e.prototype, o = { future: "in %s", past: "%s ago", s: "a few seconds", m: "a minute", mm: "%d minutes", h: "an hour", hh: "%d hours", d: "a day", dd: "%d days", M: "a month", MM: "%d months", y: "a year", yy: "%d years" };
+      function i(r2, e2, t2, o2) {
+        return n.fromToBase(r2, e2, t2, o2);
+      }
+      t.en.relativeTime = o, n.fromToBase = function(e2, n2, i2, d2, u) {
+        for (var f, a, s, l = i2.$locale().relativeTime || o, h = r.thresholds || [{ l: "s", r: 44, d: "second" }, { l: "m", r: 89 }, { l: "mm", r: 44, d: "minute" }, { l: "h", r: 89 }, { l: "hh", r: 21, d: "hour" }, { l: "d", r: 35 }, { l: "dd", r: 25, d: "day" }, { l: "M", r: 45 }, { l: "MM", r: 10, d: "month" }, { l: "y", r: 17 }, { l: "yy", d: "year" }], m = h.length, c = 0; c < m; c += 1) {
+          var y = h[c];
+          y.d && (f = d2 ? t(e2).diff(i2, y.d, true) : i2.diff(e2, y.d, true));
+          var p = (r.rounding || Math.round)(Math.abs(f));
+          if (s = f > 0, p <= y.r || !y.r) {
+            p <= 1 && c > 0 && (y = h[c - 1]);
+            var v = l[y.l];
+            u && (p = u("" + p)), a = "string" == typeof v ? v.replace("%d", p) : v(p, n2, y.l, s);
+            break;
+          }
+        }
+        if (n2) return a;
+        var M = s ? l.future : l.past;
+        return "function" == typeof M ? M(a) : M.replace("%s", a);
+      }, n.to = function(r2, e2) {
+        return i(r2, e2, this, true);
+      }, n.from = function(r2, e2) {
+        return i(r2, e2, this);
+      };
+      var d = function(r2) {
+        return r2.$u ? t.utc() : t();
+      };
+      n.toNow = function(r2) {
+        return this.to(d(this), r2);
+      }, n.fromNow = function(r2) {
+        return this.from(d(this), r2);
+      };
+    };
+  });
+})(relativeTime$1);
+var relativeTimeExports = relativeTime$1.exports;
+const relativeTime = /* @__PURE__ */ getDefaultExportFromCjs(relativeTimeExports);
+export {
+  relativeTime as default
+};

package/dist/node_modules/.pnpm/flatbush@4.4.0/node_modules/flatbush/index.js

@@ -0,0 +1,339 @@
+import FlatQueue from "../../../flatqueue@2.0.3/node_modules/flatqueue/index.js";
+const ARRAY_TYPES = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array];
+const VERSION = 3;
+class Flatbush {
+  /**
+   * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
+   * @param {ArrayBuffer | SharedArrayBuffer} data
+   * @param {number} [byteOffset=0] byte offset to the start of the Flatbush buffer in the referenced ArrayBuffer.
+   * @returns {Flatbush} index
+   */
+  static from(data, byteOffset = 0) {
+    if (byteOffset % 8 !== 0) {
+      throw new Error("byteOffset must be 8-byte aligned.");
+    }
+    if (!data || data.byteLength === void 0 || data.buffer) {
+      throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
+    }
+    const [magic, versionAndType] = new Uint8Array(data, byteOffset + 0, 2);
+    if (magic !== 251) {
+      throw new Error("Data does not appear to be in a Flatbush format.");
+    }
+    const version = versionAndType >> 4;
+    if (version !== VERSION) {
+      throw new Error(`Got v${version} data when expected v${VERSION}.`);
+    }
+    const ArrayType = ARRAY_TYPES[versionAndType & 15];
+    if (!ArrayType) {
+      throw new Error("Unrecognized array type.");
+    }
+    const [nodeSize] = new Uint16Array(data, byteOffset + 2, 1);
+    const [numItems] = new Uint32Array(data, byteOffset + 4, 1);
+    return new Flatbush(numItems, nodeSize, ArrayType, void 0, data, byteOffset);
+  }
+  /**
+   * Create a Flatbush index that will hold a given number of items.
+   * @param {number} numItems
+   * @param {number} [nodeSize=16] Size of the tree node (16 by default).
+   * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
+   * @param {ArrayBufferConstructor | SharedArrayBufferConstructor} [ArrayBufferType=ArrayBuffer] The array buffer type used to store data (`ArrayBuffer` by default).
+   * @param {ArrayBuffer | SharedArrayBuffer} [data] (Only used internally)
+   * @param {number} [byteOffset=0] (Only used internally)
+   */
+  constructor(numItems, nodeSize = 16, ArrayType = Float64Array, ArrayBufferType = ArrayBuffer, data, byteOffset = 0) {
+    if (numItems === void 0) throw new Error("Missing required argument: numItems.");
+    if (isNaN(numItems) || numItems <= 0) throw new Error(`Unexpected numItems value: ${numItems}.`);
+    this.numItems = +numItems;
+    this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);
+    this.byteOffset = byteOffset;
+    let n = numItems;
+    let numNodes = n;
+    this._levelBounds = [n * 4];
+    do {
+      n = Math.ceil(n / this.nodeSize);
+      numNodes += n;
+      this._levelBounds.push(numNodes * 4);
+    } while (n !== 1);
+    this.ArrayType = ArrayType;
+    this.IndexArrayType = numNodes < 16384 ? Uint16Array : Uint32Array;
+    const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);
+    const nodesByteSize = numNodes * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    if (arrayTypeIndex < 0) {
+      throw new Error(`Unexpected typed array class: ${ArrayType}.`);
+    }
+    if (data && data.byteLength !== void 0 && !data.buffer) {
+      this.data = data;
+      this._boxes = new this.ArrayType(this.data, byteOffset + 8, numNodes * 4);
+      this._indices = new this.IndexArrayType(this.data, byteOffset + 8 + nodesByteSize, numNodes);
+      this._pos = numNodes * 4;
+      this.minX = this._boxes[this._pos - 4];
+      this.minY = this._boxes[this._pos - 3];
+      this.maxX = this._boxes[this._pos - 2];
+      this.maxY = this._boxes[this._pos - 1];
+    } else {
+      this.data = new ArrayBufferType(8 + nodesByteSize + numNodes * this.IndexArrayType.BYTES_PER_ELEMENT);
+      this._boxes = new this.ArrayType(this.data, 8, numNodes * 4);
+      this._indices = new this.IndexArrayType(this.data, 8 + nodesByteSize, numNodes);
+      this._pos = 0;
+      this.minX = Infinity;
+      this.minY = Infinity;
+      this.maxX = -Infinity;
+      this.maxY = -Infinity;
+      new Uint8Array(this.data, 0, 2).set([251, (VERSION << 4) + arrayTypeIndex]);
+      new Uint16Array(this.data, 2, 1)[0] = nodeSize;
+      new Uint32Array(this.data, 4, 1)[0] = numItems;
+    }
+    this._queue = new FlatQueue();
+  }
+  /**
+   * Add a given rectangle to the index.
+   * @param {number} minX
+   * @param {number} minY
+   * @param {number} maxX
+   * @param {number} maxY
+   * @returns {number} A zero-based, incremental number that represents the newly added rectangle.
+   */
+  add(minX, minY, maxX = minX, maxY = minY) {
+    const index = this._pos >> 2;
+    const boxes = this._boxes;
+    this._indices[index] = index;
+    boxes[this._pos++] = minX;
+    boxes[this._pos++] = minY;
+    boxes[this._pos++] = maxX;
+    boxes[this._pos++] = maxY;
+    if (minX < this.minX) this.minX = minX;
+    if (minY < this.minY) this.minY = minY;
+    if (maxX > this.maxX) this.maxX = maxX;
+    if (maxY > this.maxY) this.maxY = maxY;
+    return index;
+  }
+  /** Perform indexing of the added rectangles. */
+  finish() {
+    if (this._pos >> 2 !== this.numItems) {
+      throw new Error(`Added ${this._pos >> 2} items when expected ${this.numItems}.`);
+    }
+    const boxes = this._boxes;
+    if (this.numItems <= this.nodeSize) {
+      boxes[this._pos++] = this.minX;
+      boxes[this._pos++] = this.minY;
+      boxes[this._pos++] = this.maxX;
+      boxes[this._pos++] = this.maxY;
+      return;
+    }
+    const width = this.maxX - this.minX || 1;
+    const height = this.maxY - this.minY || 1;
+    const hilbertValues = new Uint32Array(this.numItems);
+    const hilbertMax = (1 << 16) - 1;
+    for (let i = 0, pos = 0; i < this.numItems; i++) {
+      const minX = boxes[pos++];
+      const minY = boxes[pos++];
+      const maxX = boxes[pos++];
+      const maxY = boxes[pos++];
+      const x = Math.floor(hilbertMax * ((minX + maxX) / 2 - this.minX) / width);
+      const y = Math.floor(hilbertMax * ((minY + maxY) / 2 - this.minY) / height);
+      hilbertValues[i] = hilbert(x, y);
+    }
+    sort(hilbertValues, boxes, this._indices, 0, this.numItems - 1, this.nodeSize);
+    for (let i = 0, pos = 0; i < this._levelBounds.length - 1; i++) {
+      const end = this._levelBounds[i];
+      while (pos < end) {
+        const nodeIndex = pos;
+        let nodeMinX = boxes[pos++];
+        let nodeMinY = boxes[pos++];
+        let nodeMaxX = boxes[pos++];
+        let nodeMaxY = boxes[pos++];
+        for (let j = 1; j < this.nodeSize && pos < end; j++) {
+          nodeMinX = Math.min(nodeMinX, boxes[pos++]);
+          nodeMinY = Math.min(nodeMinY, boxes[pos++]);
+          nodeMaxX = Math.max(nodeMaxX, boxes[pos++]);
+          nodeMaxY = Math.max(nodeMaxY, boxes[pos++]);
+        }
+        this._indices[this._pos >> 2] = nodeIndex;
+        boxes[this._pos++] = nodeMinX;
+        boxes[this._pos++] = nodeMinY;
+        boxes[this._pos++] = nodeMaxX;
+        boxes[this._pos++] = nodeMaxY;
+      }
+    }
+  }
+  /**
+   * Search the index by a bounding box.
+   * @param {number} minX
+   * @param {number} minY
+   * @param {number} maxX
+   * @param {number} maxY
+   * @param {(index: number) => boolean} [filterFn] An optional function for filtering the results.
+   * @returns {number[]} An array of indices of items intersecting or touching the given bounding box.
+   */
+  search(minX, minY, maxX, maxY, filterFn) {
+    if (this._pos !== this._boxes.length) {
+      throw new Error("Data not yet indexed - call index.finish().");
+    }
+    let nodeIndex = this._boxes.length - 4;
+    const queue = [];
+    const results = [];
+    while (nodeIndex !== void 0) {
+      const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
+      for (let pos = nodeIndex; pos < end; pos += 4) {
+        if (maxX < this._boxes[pos]) continue;
+        if (maxY < this._boxes[pos + 1]) continue;
+        if (minX > this._boxes[pos + 2]) continue;
+        if (minY > this._boxes[pos + 3]) continue;
+        const index = this._indices[pos >> 2] | 0;
+        if (nodeIndex >= this.numItems * 4) {
+          queue.push(index);
+        } else if (filterFn === void 0 || filterFn(index)) {
+          results.push(index);
+        }
+      }
+      nodeIndex = queue.pop();
+    }
+    return results;
+  }
+  /**
+   * Search items in order of distance from the given point.
+   * @param {number} x
+   * @param {number} y
+   * @param {number} [maxResults=Infinity]
+   * @param {number} [maxDistance=Infinity]
+   * @param {(index: number) => boolean} [filterFn] An optional function for filtering the results.
+   * @returns {number[]} An array of indices of items found.
+   */
+  neighbors(x, y, maxResults = Infinity, maxDistance = Infinity, filterFn) {
+    if (this._pos !== this._boxes.length) {
+      throw new Error("Data not yet indexed - call index.finish().");
+    }
+    let nodeIndex = this._boxes.length - 4;
+    const q = this._queue;
+    const results = [];
+    const maxDistSquared = maxDistance * maxDistance;
+    outer: while (nodeIndex !== void 0) {
+      const end = Math.min(nodeIndex + this.nodeSize * 4, upperBound(nodeIndex, this._levelBounds));
+      for (let pos = nodeIndex; pos < end; pos += 4) {
+        const index = this._indices[pos >> 2] | 0;
+        const dx = axisDist(x, this._boxes[pos], this._boxes[pos + 2]);
+        const dy = axisDist(y, this._boxes[pos + 1], this._boxes[pos + 3]);
+        const dist = dx * dx + dy * dy;
+        if (dist > maxDistSquared) continue;
+        if (nodeIndex >= this.numItems * 4) {
+          q.push(index << 1, dist);
+        } else if (filterFn === void 0 || filterFn(index)) {
+          q.push((index << 1) + 1, dist);
+        }
+      }
+      while (q.length && q.peek() & 1) {
+        const dist = q.peekValue();
+        if (dist > maxDistSquared) break outer;
+        results.push(q.pop() >> 1);
+        if (results.length === maxResults) break outer;
+      }
+      nodeIndex = q.length ? q.pop() >> 1 : void 0;
+    }
+    q.clear();
+    return results;
+  }
+}
+function axisDist(k, min, max) {
+  return k < min ? min - k : k <= max ? 0 : k - max;
+}
+function upperBound(value, arr) {
+  let i = 0;
+  let j = arr.length - 1;
+  while (i < j) {
+    const m = i + j >> 1;
+    if (arr[m] > value) {
+      j = m;
+    } else {
+      i = m + 1;
+    }
+  }
+  return arr[i];
+}
+function sort(values, boxes, indices, left, right, nodeSize) {
+  if (Math.floor(left / nodeSize) >= Math.floor(right / nodeSize)) return;
+  const pivot = values[left + right >> 1];
+  let i = left - 1;
+  let j = right + 1;
+  while (true) {
+    do
+      i++;
+    while (values[i] < pivot);
+    do
+      j--;
+    while (values[j] > pivot);
+    if (i >= j) break;
+    swap(values, boxes, indices, i, j);
+  }
+  sort(values, boxes, indices, left, j, nodeSize);
+  sort(values, boxes, indices, j + 1, right, nodeSize);
+}
+function swap(values, boxes, indices, i, j) {
+  const temp = values[i];
+  values[i] = values[j];
+  values[j] = temp;
+  const k = 4 * i;
+  const m = 4 * j;
+  const a = boxes[k];
+  const b = boxes[k + 1];
+  const c = boxes[k + 2];
+  const d = boxes[k + 3];
+  boxes[k] = boxes[m];
+  boxes[k + 1] = boxes[m + 1];
+  boxes[k + 2] = boxes[m + 2];
+  boxes[k + 3] = boxes[m + 3];
+  boxes[m] = a;
+  boxes[m + 1] = b;
+  boxes[m + 2] = c;
+  boxes[m + 3] = d;
+  const e = indices[i];
+  indices[i] = indices[j];
+  indices[j] = e;
+}
+function hilbert(x, y) {
+  let a = x ^ y;
+  let b = 65535 ^ a;
+  let c = 65535 ^ (x | y);
+  let d = x & (y ^ 65535);
+  let A = a | b >> 1;
+  let B = a >> 1 ^ a;
+  let C = c >> 1 ^ b & d >> 1 ^ c;
+  let D = a & c >> 1 ^ d >> 1 ^ d;
+  a = A;
+  b = B;
+  c = C;
+  d = D;
+  A = a & a >> 2 ^ b & b >> 2;
+  B = a & b >> 2 ^ b & (a ^ b) >> 2;
+  C ^= a & c >> 2 ^ b & d >> 2;
+  D ^= b & c >> 2 ^ (a ^ b) & d >> 2;
+  a = A;
+  b = B;
+  c = C;
+  d = D;
+  A = a & a >> 4 ^ b & b >> 4;
+  B = a & b >> 4 ^ b & (a ^ b) >> 4;
+  C ^= a & c >> 4 ^ b & d >> 4;
+  D ^= b & c >> 4 ^ (a ^ b) & d >> 4;
+  a = A;
+  b = B;
+  c = C;
+  d = D;
+  C ^= a & c >> 8 ^ b & d >> 8;
+  D ^= b & c >> 8 ^ (a ^ b) & d >> 8;
+  a = C ^ C >> 1;
+  b = D ^ D >> 1;
+  let i0 = x ^ y;
+  let i1 = b | 65535 ^ (i0 | a);
+  i0 = (i0 | i0 << 8) & 16711935;
+  i0 = (i0 | i0 << 4) & 252645135;
+  i0 = (i0 | i0 << 2) & 858993459;
+  i0 = (i0 | i0 << 1) & 1431655765;
+  i1 = (i1 | i1 << 8) & 16711935;
+  i1 = (i1 | i1 << 4) & 252645135;
+  i1 = (i1 | i1 << 2) & 858993459;
+  i1 = (i1 | i1 << 1) & 1431655765;
+  return (i1 << 1 | i0) >>> 0;
+}
+export {
+  Flatbush as default
+};