@performant-software/geospatial 3.1.28 → 3.1.30-beta.0

package/dist/index.es350.js

@@ -0,0 +1,251 @@
+import I from "./index.es423.js";
+class k {
+  constructor(t = 9) {
+    this._maxEntries = Math.max(4, t), this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4)), this.clear();
+  }
+  all() {
+    return this._all(this.data, []);
+  }
+  search(t) {
+    let i = this.data;
+    const n = [];
+    if (!X(t, i)) return n;
+    const h = this.toBBox, s = [];
+    for (; i; ) {
+      for (let r = 0; r < i.children.length; r++) {
+        const l = i.children[r], a = i.leaf ? h(l) : l;
+        X(t, a) && (i.leaf ? n.push(l) : M(t, a) ? this._all(l, n) : s.push(l));
+      }
+      i = s.pop();
+    }
+    return n;
+  }
+  collides(t) {
+    let i = this.data;
+    if (!X(t, i)) return !1;
+    const n = [];
+    for (; i; ) {
+      for (let h = 0; h < i.children.length; h++) {
+        const s = i.children[h], r = i.leaf ? this.toBBox(s) : s;
+        if (X(t, r)) {
+          if (i.leaf || M(t, r)) return !0;
+          n.push(s);
+        }
+      }
+      i = n.pop();
+    }
+    return !1;
+  }
+  load(t) {
+    if (!(t && t.length)) return this;
+    if (t.length < this._minEntries) {
+      for (let n = 0; n < t.length; n++)
+        this.insert(t[n]);
+      return this;
+    }
+    let i = this._build(t.slice(), 0, t.length - 1, 0);
+    if (!this.data.children.length)
+      this.data = i;
+    else if (this.data.height === i.height)
+      this._splitRoot(this.data, i);
+    else {
+      if (this.data.height < i.height) {
+        const n = this.data;
+        this.data = i, i = n;
+      }
+      this._insert(i, this.data.height - i.height - 1, !0);
+    }
+    return this;
+  }
+  insert(t) {
+    return t && this._insert(t, this.data.height - 1), this;
+  }
+  clear() {
+    return this.data = u([]), this;
+  }
+  remove(t, i) {
+    if (!t) return this;
+    let n = this.data;
+    const h = this.toBBox(t), s = [], r = [];
+    let l, a, c;
+    for (; n || s.length; ) {
+      if (n || (n = s.pop(), a = s[s.length - 1], l = r.pop(), c = !0), n.leaf) {
+        const o = y(t, n.children, i);
+        if (o !== -1)
+          return n.children.splice(o, 1), s.push(n), this._condense(s), this;
+      }
+      !c && !n.leaf && M(n, h) ? (s.push(n), r.push(l), l = 0, a = n, n = n.children[0]) : a ? (l++, n = a.children[l], c = !1) : n = null;
+    }
+    return this;
+  }
+  toBBox(t) {
+    return t;
+  }
+  compareMinX(t, i) {
+    return t.minX - i.minX;
+  }
+  compareMinY(t, i) {
+    return t.minY - i.minY;
+  }
+  toJSON() {
+    return this.data;
+  }
+  fromJSON(t) {
+    return this.data = t, this;
+  }
+  _all(t, i) {
+    const n = [];
+    for (; t; )
+      t.leaf ? i.push(...t.children) : n.push(...t.children), t = n.pop();
+    return i;
+  }
+  _build(t, i, n, h) {
+    const s = n - i + 1;
+    let r = this._maxEntries, l;
+    if (s <= r)
+      return l = u(t.slice(i, n + 1)), f(l, this.toBBox), l;
+    h || (h = Math.ceil(Math.log(s) / Math.log(r)), r = Math.ceil(s / Math.pow(r, h - 1))), l = u([]), l.leaf = !1, l.height = h;
+    const a = Math.ceil(s / r), c = a * Math.ceil(Math.sqrt(r));
+    g(t, i, n, c, this.compareMinX);
+    for (let o = i; o <= n; o += c) {
+      const m = Math.min(o + c - 1, n);
+      g(t, o, m, a, this.compareMinY);
+      for (let d = o; d <= m; d += a) {
+        const _ = Math.min(d + a - 1, m);
+        l.children.push(this._build(t, d, _, h - 1));
+      }
+    }
+    return f(l, this.toBBox), l;
+  }
+  _chooseSubtree(t, i, n, h) {
+    for (; h.push(i), !(i.leaf || h.length - 1 === n); ) {
+      let s = 1 / 0, r = 1 / 0, l;
+      for (let a = 0; a < i.children.length; a++) {
+        const c = i.children[a], o = Y(c), m = E(t, c) - o;
+        m < r ? (r = m, s = o < s ? o : s, l = c) : m === r && o < s && (s = o, l = c);
+      }
+      i = l || i.children[0];
+    }
+    return i;
+  }
+  _insert(t, i, n) {
+    const h = n ? t : this.toBBox(t), s = [], r = this._chooseSubtree(h, this.data, i, s);
+    for (r.children.push(t), p(r, h); i >= 0 && s[i].children.length > this._maxEntries; )
+      this._split(s, i), i--;
+    this._adjustParentBBoxes(h, s, i);
+  }
+  // split overflowed node into two
+  _split(t, i) {
+    const n = t[i], h = n.children.length, s = this._minEntries;
+    this._chooseSplitAxis(n, s, h);
+    const r = this._chooseSplitIndex(n, s, h), l = u(n.children.splice(r, n.children.length - r));
+    l.height = n.height, l.leaf = n.leaf, f(n, this.toBBox), f(l, this.toBBox), i ? t[i - 1].children.push(l) : this._splitRoot(n, l);
+  }
+  _splitRoot(t, i) {
+    this.data = u([t, i]), this.data.height = t.height + 1, this.data.leaf = !1, f(this.data, this.toBBox);
+  }
+  _chooseSplitIndex(t, i, n) {
+    let h, s = 1 / 0, r = 1 / 0;
+    for (let l = i; l <= n - i; l++) {
+      const a = x(t, 0, l, this.toBBox), c = x(t, l, n, this.toBBox), o = A(a, c), m = Y(a) + Y(c);
+      o < s ? (s = o, h = l, r = m < r ? m : r) : o === s && m < r && (r = m, h = l);
+    }
+    return h || n - i;
+  }
+  // sorts node children by the best axis for split
+  _chooseSplitAxis(t, i, n) {
+    const h = t.leaf ? this.compareMinX : S, s = t.leaf ? this.compareMinY : w, r = this._allDistMargin(t, i, n, h), l = this._allDistMargin(t, i, n, s);
+    r < l && t.children.sort(h);
+  }
+  // total margin of all possible split distributions where each node is at least m full
+  _allDistMargin(t, i, n, h) {
+    t.children.sort(h);
+    const s = this.toBBox, r = x(t, 0, i, s), l = x(t, n - i, n, s);
+    let a = B(r) + B(l);
+    for (let c = i; c < n - i; c++) {
+      const o = t.children[c];
+      p(r, t.leaf ? s(o) : o), a += B(r);
+    }
+    for (let c = n - i - 1; c >= i; c--) {
+      const o = t.children[c];
+      p(l, t.leaf ? s(o) : o), a += B(l);
+    }
+    return a;
+  }
+  _adjustParentBBoxes(t, i, n) {
+    for (let h = n; h >= 0; h--)
+      p(i[h], t);
+  }
+  _condense(t) {
+    for (let i = t.length - 1, n; i >= 0; i--)
+      t[i].children.length === 0 ? i > 0 ? (n = t[i - 1].children, n.splice(n.indexOf(t[i]), 1)) : this.clear() : f(t[i], this.toBBox);
+  }
+}
+function y(e, t, i) {
+  if (!i) return t.indexOf(e);
+  for (let n = 0; n < t.length; n++)
+    if (i(e, t[n])) return n;
+  return -1;
+}
+function f(e, t) {
+  x(e, 0, e.children.length, t, e);
+}
+function x(e, t, i, n, h) {
+  h || (h = u(null)), h.minX = 1 / 0, h.minY = 1 / 0, h.maxX = -1 / 0, h.maxY = -1 / 0;
+  for (let s = t; s < i; s++) {
+    const r = e.children[s];
+    p(h, e.leaf ? n(r) : r);
+  }
+  return h;
+}
+function p(e, t) {
+  return e.minX = Math.min(e.minX, t.minX), e.minY = Math.min(e.minY, t.minY), e.maxX = Math.max(e.maxX, t.maxX), e.maxY = Math.max(e.maxY, t.maxY), e;
+}
+function S(e, t) {
+  return e.minX - t.minX;
+}
+function w(e, t) {
+  return e.minY - t.minY;
+}
+function Y(e) {
+  return (e.maxX - e.minX) * (e.maxY - e.minY);
+}
+function B(e) {
+  return e.maxX - e.minX + (e.maxY - e.minY);
+}
+function E(e, t) {
+  return (Math.max(t.maxX, e.maxX) - Math.min(t.minX, e.minX)) * (Math.max(t.maxY, e.maxY) - Math.min(t.minY, e.minY));
+}
+function A(e, t) {
+  const i = Math.max(e.minX, t.minX), n = Math.max(e.minY, t.minY), h = Math.min(e.maxX, t.maxX), s = Math.min(e.maxY, t.maxY);
+  return Math.max(0, h - i) * Math.max(0, s - n);
+}
+function M(e, t) {
+  return e.minX <= t.minX && e.minY <= t.minY && t.maxX <= e.maxX && t.maxY <= e.maxY;
+}
+function X(e, t) {
+  return t.minX <= e.maxX && t.minY <= e.maxY && t.maxX >= e.minX && t.maxY >= e.minY;
+}
+function u(e) {
+  return {
+    children: e,
+    height: 1,
+    leaf: !0,
+    minX: 1 / 0,
+    minY: 1 / 0,
+    maxX: -1 / 0,
+    maxY: -1 / 0
+  };
+}
+function g(e, t, i, n, h) {
+  const s = [t, i];
+  for (; s.length; ) {
+    if (i = s.pop(), t = s.pop(), i - t <= n) continue;
+    const r = t + Math.ceil((i - t) / n / 2) * n;
+    I(e, r, t, i, h), s.push(t, r, r, i);
+  }
+}
+export {
+  k as default
+};
+//# sourceMappingURL=index.es350.js.map

package/dist/index.es350.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es350.js","sources":["../../../node_modules/@allmaps/render/node_modules/rbush/index.js"],"sourcesContent":["import quickselect from 'quickselect';\n\nexport default class RBush {\n    constructor(maxEntries = 9) {\n        // max entries in a node is 9 by default; min node fill is 40% for best performance\n        this._maxEntries = Math.max(4, maxEntries);\n        this._minEntries = Math.max(2, Math.ceil(this._maxEntries * 0.4));\n        this.clear();\n    }\n\n    all() {\n        return this._all(this.data, []);\n    }\n\n    search(bbox) {\n        let node = this.data;\n        const result = [];\n\n        if (!intersects(bbox, node)) return result;\n\n        const toBBox = this.toBBox;\n        const nodesToSearch = [];\n\n        while (node) {\n            for (let i = 0; i < node.children.length; i++) {\n                const child = node.children[i];\n                const childBBox = node.leaf ? toBBox(child) : child;\n\n                if (intersects(bbox, childBBox)) {\n                    if (node.leaf) result.push(child);\n                    else if (contains(bbox, childBBox)) this._all(child, result);\n                    else nodesToSearch.push(child);\n                }\n            }\n            node = nodesToSearch.pop();\n        }\n\n        return result;\n    }\n\n    collides(bbox) {\n        let node = this.data;\n\n        if (!intersects(bbox, node)) return false;\n\n        const nodesToSearch = [];\n        while (node) {\n            for (let i = 0; i < node.children.length; i++) {\n                const child = node.children[i];\n                const childBBox = node.leaf ? this.toBBox(child) : child;\n\n                if (intersects(bbox, childBBox)) {\n                    if (node.leaf || contains(bbox, childBBox)) return true;\n                    nodesToSearch.push(child);\n                }\n            }\n            node = nodesToSearch.pop();\n        }\n\n        return false;\n    }\n\n    load(data) {\n        if (!(data && data.length)) return this;\n\n        if (data.length < this._minEntries) {\n            for (let i = 0; i < data.length; i++) {\n                this.insert(data[i]);\n            }\n            return this;\n        }\n\n        // recursively build the tree with the given data from scratch using OMT algorithm\n        let node = this._build(data.slice(), 0, data.length - 1, 0);\n\n        if (!this.data.children.length) {\n            // save as is if tree is empty\n            this.data = node;\n\n        } else if (this.data.height === node.height) {\n            // split root if trees have the same height\n            this._splitRoot(this.data, node);\n\n        } else {\n            if (this.data.height < node.height) {\n                // swap trees if inserted one is bigger\n                const tmpNode = this.data;\n                this.data = node;\n                node = tmpNode;\n            }\n\n            // insert the small tree into the large tree at appropriate level\n            this._insert(node, this.data.height - node.height - 1, true);\n        }\n\n        return this;\n    }\n\n    insert(item) {\n        if (item) this._insert(item, this.data.height - 1);\n        return this;\n    }\n\n    clear() {\n        this.data = createNode([]);\n        return this;\n    }\n\n    remove(item, equalsFn) {\n        if (!item) return this;\n\n        let node = this.data;\n        const bbox = this.toBBox(item);\n        const path = [];\n        const indexes = [];\n        let i, parent, goingUp;\n\n        // depth-first iterative tree traversal\n        while (node || path.length) {\n\n            if (!node) { // go up\n                node = path.pop();\n                parent = path[path.length - 1];\n                i = indexes.pop();\n                goingUp = true;\n            }\n\n            if (node.leaf) { // check current node\n                const index = findItem(item, node.children, equalsFn);\n\n                if (index !== -1) {\n                    // item found, remove the item and condense tree upwards\n                    node.children.splice(index, 1);\n                    path.push(node);\n                    this._condense(path);\n                    return this;\n                }\n            }\n\n            if (!goingUp && !node.leaf && contains(node, bbox)) { // go down\n                path.push(node);\n                indexes.push(i);\n                i = 0;\n                parent = node;\n                node = node.children[0];\n\n            } else if (parent) { // go right\n                i++;\n                node = parent.children[i];\n                goingUp = false;\n\n            } else node = null; // nothing found\n        }\n\n        return this;\n    }\n\n    toBBox(item) { return item; }\n\n    compareMinX(a, b) { return a.minX - b.minX; }\n    compareMinY(a, b) { return a.minY - b.minY; }\n\n    toJSON() { return this.data; }\n\n    fromJSON(data) {\n        this.data = data;\n        return this;\n    }\n\n    _all(node, result) {\n        const nodesToSearch = [];\n        while (node) {\n            if (node.leaf) result.push(...node.children);\n            else nodesToSearch.push(...node.children);\n\n            node = nodesToSearch.pop();\n        }\n        return result;\n    }\n\n    _build(items, left, right, height) {\n\n        const N = right - left + 1;\n        let M = this._maxEntries;\n        let node;\n\n        if (N <= M) {\n            // reached leaf level; return leaf\n            node = createNode(items.slice(left, right + 1));\n            calcBBox(node, this.toBBox);\n            return node;\n        }\n\n        if (!height) {\n            // target height of the bulk-loaded tree\n            height = Math.ceil(Math.log(N) / Math.log(M));\n\n            // target number of root entries to maximize storage utilization\n            M = Math.ceil(N / Math.pow(M, height - 1));\n        }\n\n        node = createNode([]);\n        node.leaf = false;\n        node.height = height;\n\n        // split the items into M mostly square tiles\n\n        const N2 = Math.ceil(N / M);\n        const N1 = N2 * Math.ceil(Math.sqrt(M));\n\n        multiSelect(items, left, right, N1, this.compareMinX);\n\n        for (let i = left; i <= right; i += N1) {\n\n            const right2 = Math.min(i + N1 - 1, right);\n\n            multiSelect(items, i, right2, N2, this.compareMinY);\n\n            for (let j = i; j <= right2; j += N2) {\n\n                const right3 = Math.min(j + N2 - 1, right2);\n\n                // pack each entry recursively\n                node.children.push(this._build(items, j, right3, height - 1));\n            }\n        }\n\n        calcBBox(node, this.toBBox);\n\n        return node;\n    }\n\n    _chooseSubtree(bbox, node, level, path) {\n        while (true) {\n            path.push(node);\n\n            if (node.leaf || path.length - 1 === level) break;\n\n            let minArea = Infinity;\n            let minEnlargement = Infinity;\n            let targetNode;\n\n            for (let i = 0; i < node.children.length; i++) {\n                const child = node.children[i];\n                const area = bboxArea(child);\n                const enlargement = enlargedArea(bbox, child) - area;\n\n                // choose entry with the least area enlargement\n                if (enlargement < minEnlargement) {\n                    minEnlargement = enlargement;\n                    minArea = area < minArea ? area : minArea;\n                    targetNode = child;\n\n                } else if (enlargement === minEnlargement) {\n                    // otherwise choose one with the smallest area\n                    if (area < minArea) {\n                        minArea = area;\n                        targetNode = child;\n                    }\n                }\n            }\n\n            node = targetNode || node.children[0];\n        }\n\n        return node;\n    }\n\n    _insert(item, level, isNode) {\n        const bbox = isNode ? item : this.toBBox(item);\n        const insertPath = [];\n\n        // find the best node for accommodating the item, saving all nodes along the path too\n        const node = this._chooseSubtree(bbox, this.data, level, insertPath);\n\n        // put the item into the node\n        node.children.push(item);\n        extend(node, bbox);\n\n        // split on node overflow; propagate upwards if necessary\n        while (level >= 0) {\n            if (insertPath[level].children.length > this._maxEntries) {\n                this._split(insertPath, level);\n                level--;\n            } else break;\n        }\n\n        // adjust bboxes along the insertion path\n        this._adjustParentBBoxes(bbox, insertPath, level);\n    }\n\n    // split overflowed node into two\n    _split(insertPath, level) {\n        const node = insertPath[level];\n        const M = node.children.length;\n        const m = this._minEntries;\n\n        this._chooseSplitAxis(node, m, M);\n\n        const splitIndex = this._chooseSplitIndex(node, m, M);\n\n        const newNode = createNode(node.children.splice(splitIndex, node.children.length - splitIndex));\n        newNode.height = node.height;\n        newNode.leaf = node.leaf;\n\n        calcBBox(node, this.toBBox);\n        calcBBox(newNode, this.toBBox);\n\n        if (level) insertPath[level - 1].children.push(newNode);\n        else this._splitRoot(node, newNode);\n    }\n\n    _splitRoot(node, newNode) {\n        // split root node\n        this.data = createNode([node, newNode]);\n        this.data.height = node.height + 1;\n        this.data.leaf = false;\n        calcBBox(this.data, this.toBBox);\n    }\n\n    _chooseSplitIndex(node, m, M) {\n        let index;\n        let minOverlap = Infinity;\n        let minArea = Infinity;\n\n        for (let i = m; i <= M - m; i++) {\n            const bbox1 = distBBox(node, 0, i, this.toBBox);\n            const bbox2 = distBBox(node, i, M, this.toBBox);\n\n            const overlap = intersectionArea(bbox1, bbox2);\n            const area = bboxArea(bbox1) + bboxArea(bbox2);\n\n            // choose distribution with minimum overlap\n            if (overlap < minOverlap) {\n                minOverlap = overlap;\n                index = i;\n\n                minArea = area < minArea ? area : minArea;\n\n            } else if (overlap === minOverlap) {\n                // otherwise choose distribution with minimum area\n                if (area < minArea) {\n                    minArea = area;\n                    index = i;\n                }\n            }\n        }\n\n        return index || M - m;\n    }\n\n    // sorts node children by the best axis for split\n    _chooseSplitAxis(node, m, M) {\n        const compareMinX = node.leaf ? this.compareMinX : compareNodeMinX;\n        const compareMinY = node.leaf ? this.compareMinY : compareNodeMinY;\n        const xMargin = this._allDistMargin(node, m, M, compareMinX);\n        const yMargin = this._allDistMargin(node, m, M, compareMinY);\n\n        // if total distributions margin value is minimal for x, sort by minX,\n        // otherwise it's already sorted by minY\n        if (xMargin < yMargin) node.children.sort(compareMinX);\n    }\n\n    // total margin of all possible split distributions where each node is at least m full\n    _allDistMargin(node, m, M, compare) {\n        node.children.sort(compare);\n\n        const toBBox = this.toBBox;\n        const leftBBox = distBBox(node, 0, m, toBBox);\n        const rightBBox = distBBox(node, M - m, M, toBBox);\n        let margin = bboxMargin(leftBBox) + bboxMargin(rightBBox);\n\n        for (let i = m; i < M - m; i++) {\n            const child = node.children[i];\n            extend(leftBBox, node.leaf ? toBBox(child) : child);\n            margin += bboxMargin(leftBBox);\n        }\n\n        for (let i = M - m - 1; i >= m; i--) {\n            const child = node.children[i];\n            extend(rightBBox, node.leaf ? toBBox(child) : child);\n            margin += bboxMargin(rightBBox);\n        }\n\n        return margin;\n    }\n\n    _adjustParentBBoxes(bbox, path, level) {\n        // adjust bboxes along the given tree path\n        for (let i = level; i >= 0; i--) {\n            extend(path[i], bbox);\n        }\n    }\n\n    _condense(path) {\n        // go through the path, removing empty nodes and updating bboxes\n        for (let i = path.length - 1, siblings; i >= 0; i--) {\n            if (path[i].children.length === 0) {\n                if (i > 0) {\n                    siblings = path[i - 1].children;\n                    siblings.splice(siblings.indexOf(path[i]), 1);\n\n                } else this.clear();\n\n            } else calcBBox(path[i], this.toBBox);\n        }\n    }\n}\n\nfunction findItem(item, items, equalsFn) {\n    if (!equalsFn) return items.indexOf(item);\n\n    for (let i = 0; i < items.length; i++) {\n        if (equalsFn(item, items[i])) return i;\n    }\n    return -1;\n}\n\n// calculate node's bbox from bboxes of its children\nfunction calcBBox(node, toBBox) {\n    distBBox(node, 0, node.children.length, toBBox, node);\n}\n\n// min bounding rectangle of node children from k to p-1\nfunction distBBox(node, k, p, toBBox, destNode) {\n    if (!destNode) destNode = createNode(null);\n    destNode.minX = Infinity;\n    destNode.minY = Infinity;\n    destNode.maxX = -Infinity;\n    destNode.maxY = -Infinity;\n\n    for (let i = k; i < p; i++) {\n        const child = node.children[i];\n        extend(destNode, node.leaf ? toBBox(child) : child);\n    }\n\n    return destNode;\n}\n\nfunction extend(a, b) {\n    a.minX = Math.min(a.minX, b.minX);\n    a.minY = Math.min(a.minY, b.minY);\n    a.maxX = Math.max(a.maxX, b.maxX);\n    a.maxY = Math.max(a.maxY, b.maxY);\n    return a;\n}\n\nfunction compareNodeMinX(a, b) { return a.minX - b.minX; }\nfunction compareNodeMinY(a, b) { return a.minY - b.minY; }\n\nfunction bboxArea(a)   { return (a.maxX - a.minX) * (a.maxY - a.minY); }\nfunction bboxMargin(a) { return (a.maxX - a.minX) + (a.maxY - a.minY); }\n\nfunction enlargedArea(a, b) {\n    return (Math.max(b.maxX, a.maxX) - Math.min(b.minX, a.minX)) *\n           (Math.max(b.maxY, a.maxY) - Math.min(b.minY, a.minY));\n}\n\nfunction intersectionArea(a, b) {\n    const minX = Math.max(a.minX, b.minX);\n    const minY = Math.max(a.minY, b.minY);\n    const maxX = Math.min(a.maxX, b.maxX);\n    const maxY = Math.min(a.maxY, b.maxY);\n\n    return Math.max(0, maxX - minX) *\n           Math.max(0, maxY - minY);\n}\n\nfunction contains(a, b) {\n    return a.minX <= b.minX &&\n           a.minY <= b.minY &&\n           b.maxX <= a.maxX &&\n           b.maxY <= a.maxY;\n}\n\nfunction intersects(a, b) {\n    return b.minX <= a.maxX &&\n           b.minY <= a.maxY &&\n           b.maxX >= a.minX &&\n           b.maxY >= a.minY;\n}\n\nfunction createNode(children) {\n    return {\n        children,\n        height: 1,\n        leaf: true,\n        minX: Infinity,\n        minY: Infinity,\n        maxX: -Infinity,\n        maxY: -Infinity\n    };\n}\n\n// sort an array so that items come in groups of n unsorted items, with groups sorted between each other;\n// combines selection algorithm with binary divide & conquer approach\n\nfunction multiSelect(arr, left, right, n, compare) {\n    const stack = [left, right];\n\n    while (stack.length) {\n        right = stack.pop();\n        left = stack.pop();\n\n        if (right - left <= n) continue;\n\n        const mid = left + Math.ceil((right - left) / n / 2) * n;\n        quickselect(arr, mid, left, right, compare);\n\n        stack.push(left, mid, mid, right);\n    }\n}\n"],"names":["RBush","maxEntries","bbox","node","result","intersects","toBBox","nodesToSearch","i","child","childBBox","contains","data","tmpNode","item","createNode","equalsFn","path","indexes","parent","goingUp","index","findItem","a","b","items","left","right","height","N","M","calcBBox","N2","N1","multiSelect","right2","j","right3","level","minArea","minEnlargement","targetNode","area","bboxArea","enlargement","enlargedArea","isNode","insertPath","extend","m","splitIndex","newNode","minOverlap","bbox1","distBBox","bbox2","overlap","intersectionArea","compareMinX","compareNodeMinX","compareMinY","compareNodeMinY","xMargin","yMargin","compare","leftBBox","rightBBox","margin","bboxMargin","siblings","k","p","destNode","minX","minY","maxX","maxY","children","arr","stack","mid","quickselect"],"mappings":";AAEA,MAAqBA,EAAM;AAAA,EACvB,YAAYC,IAAa,GAAG;AAExB,SAAK,cAAc,KAAK,IAAI,GAAGA,CAAU,GACzC,KAAK,cAAc,KAAK,IAAI,GAAG,KAAK,KAAK,KAAK,cAAc,GAAG,CAAC,GAChE,KAAK,MAAA;AAAA,EACT;AAAA,EAEA,MAAM;AACF,WAAO,KAAK,KAAK,KAAK,MAAM,CAAA,CAAE;AAAA,EAClC;AAAA,EAEA,OAAOC,GAAM;AACT,QAAIC,IAAO,KAAK;AAChB,UAAMC,IAAS,CAAA;AAEf,QAAI,CAACC,EAAWH,GAAMC,CAAI,EAAG,QAAOC;AAEpC,UAAME,IAAS,KAAK,QACdC,IAAgB,CAAA;AAEtB,WAAOJ,KAAM;AACT,eAASK,IAAI,GAAGA,IAAIL,EAAK,SAAS,QAAQK,KAAK;AAC3C,cAAMC,IAAQN,EAAK,SAASK,CAAC,GACvBE,IAAYP,EAAK,OAAOG,EAAOG,CAAK,IAAIA;AAE9C,QAAIJ,EAAWH,GAAMQ,CAAS,MACtBP,EAAK,OAAMC,EAAO,KAAKK,CAAK,IACvBE,EAAST,GAAMQ,CAAS,IAAG,KAAK,KAAKD,GAAOL,CAAM,IACtDG,EAAc,KAAKE,CAAK;AAAA,MAErC;AACA,MAAAN,IAAOI,EAAc,IAAA;AAAA,IACzB;AAEA,WAAOH;AAAA,EACX;AAAA,EAEA,SAASF,GAAM;AACX,QAAIC,IAAO,KAAK;AAEhB,QAAI,CAACE,EAAWH,GAAMC,CAAI,EAAG,QAAO;AAEpC,UAAMI,IAAgB,CAAA;AACtB,WAAOJ,KAAM;AACT,eAASK,IAAI,GAAGA,IAAIL,EAAK,SAAS,QAAQK,KAAK;AAC3C,cAAMC,IAAQN,EAAK,SAASK,CAAC,GACvBE,IAAYP,EAAK,OAAO,KAAK,OAAOM,CAAK,IAAIA;AAEnD,YAAIJ,EAAWH,GAAMQ,CAAS,GAAG;AAC7B,cAAIP,EAAK,QAAQQ,EAAST,GAAMQ,CAAS,EAAG,QAAO;AACnD,UAAAH,EAAc,KAAKE,CAAK;AAAA,QAC5B;AAAA,MACJ;AACA,MAAAN,IAAOI,EAAc,IAAA;AAAA,IACzB;AAEA,WAAO;AAAA,EACX;AAAA,EAEA,KAAKK,GAAM;AACP,QAAI,EAAEA,KAAQA,EAAK,QAAS,QAAO;AAEnC,QAAIA,EAAK,SAAS,KAAK,aAAa;AAChC,eAASJ,IAAI,GAAGA,IAAII,EAAK,QAAQJ;AAC7B,aAAK,OAAOI,EAAKJ,CAAC,CAAC;AAEvB,aAAO;AAAA,IACX;AAGA,QAAIL,IAAO,KAAK,OAAOS,EAAK,SAAS,GAAGA,EAAK,SAAS,GAAG,CAAC;AAE1D,QAAI,CAAC,KAAK,KAAK,SAAS;AAEpB,WAAK,OAAOT;AAAA,aAEL,KAAK,KAAK,WAAWA,EAAK;AAEjC,WAAK,WAAW,KAAK,MAAMA,CAAI;AAAA,SAE5B;AACH,UAAI,KAAK,KAAK,SAASA,EAAK,QAAQ;AAEhC,cAAMU,IAAU,KAAK;AACrB,aAAK,OAAOV,GACZA,IAAOU;AAAA,MACX;AAGA,WAAK,QAAQV,GAAM,KAAK,KAAK,SAASA,EAAK,SAAS,GAAG,EAAI;AAAA,IAC/D;AAEA,WAAO;AAAA,EACX;AAAA,EAEA,OAAOW,GAAM;AACT,WAAIA,KAAM,KAAK,QAAQA,GAAM,KAAK,KAAK,SAAS,CAAC,GAC1C;AAAA,EACX;AAAA,EAEA,QAAQ;AACJ,gBAAK,OAAOC,EAAW,EAAE,GAClB;AAAA,EACX;AAAA,EAEA,OAAOD,GAAME,GAAU;AACnB,QAAI,CAACF,EAAM,QAAO;AAElB,QAAIX,IAAO,KAAK;AAChB,UAAMD,IAAO,KAAK,OAAOY,CAAI,GACvBG,IAAO,CAAA,GACPC,IAAU,CAAA;AAChB,QAAIV,GAAGW,GAAQC;AAGf,WAAOjB,KAAQc,EAAK,UAAQ;AASxB,UAPKd,MACDA,IAAOc,EAAK,IAAA,GACZE,IAASF,EAAKA,EAAK,SAAS,CAAC,GAC7BT,IAAIU,EAAQ,IAAA,GACZE,IAAU,KAGVjB,EAAK,MAAM;AACX,cAAMkB,IAAQC,EAASR,GAAMX,EAAK,UAAUa,CAAQ;AAEpD,YAAIK,MAAU;AAEV,iBAAAlB,EAAK,SAAS,OAAOkB,GAAO,CAAC,GAC7BJ,EAAK,KAAKd,CAAI,GACd,KAAK,UAAUc,CAAI,GACZ;AAAA,MAEf;AAEA,MAAI,CAACG,KAAW,CAACjB,EAAK,QAAQQ,EAASR,GAAMD,CAAI,KAC7Ce,EAAK,KAAKd,CAAI,GACde,EAAQ,KAAKV,CAAC,GACdA,IAAI,GACJW,IAAShB,GACTA,IAAOA,EAAK,SAAS,CAAC,KAEfgB,KACPX,KACAL,IAAOgB,EAAO,SAASX,CAAC,GACxBY,IAAU,MAEPjB,IAAO;AAAA,IAClB;AAEA,WAAO;AAAA,EACX;AAAA,EAEA,OAAOW,GAAM;AAAE,WAAOA;AAAA,EAAM;AAAA,EAE5B,YAAYS,GAAGC,GAAG;AAAE,WAAOD,EAAE,OAAOC,EAAE;AAAA,EAAM;AAAA,EAC5C,YAAYD,GAAGC,GAAG;AAAE,WAAOD,EAAE,OAAOC,EAAE;AAAA,EAAM;AAAA,EAE5C,SAAS;AAAE,WAAO,KAAK;AAAA,EAAM;AAAA,EAE7B,SAASZ,GAAM;AACX,gBAAK,OAAOA,GACL;AAAA,EACX;AAAA,EAEA,KAAKT,GAAMC,GAAQ;AACf,UAAMG,IAAgB,CAAA;AACtB,WAAOJ;AACH,MAAIA,EAAK,OAAMC,EAAO,KAAK,GAAGD,EAAK,QAAQ,IACtCI,EAAc,KAAK,GAAGJ,EAAK,QAAQ,GAExCA,IAAOI,EAAc,IAAA;AAEzB,WAAOH;AAAA,EACX;AAAA,EAEA,OAAOqB,GAAOC,GAAMC,GAAOC,GAAQ;AAE/B,UAAMC,IAAIF,IAAQD,IAAO;AACzB,QAAII,IAAI,KAAK,aACT3B;AAEJ,QAAI0B,KAAKC;AAEL,aAAA3B,IAAOY,EAAWU,EAAM,MAAMC,GAAMC,IAAQ,CAAC,CAAC,GAC9CI,EAAS5B,GAAM,KAAK,MAAM,GACnBA;AAGX,IAAKyB,MAEDA,IAAS,KAAK,KAAK,KAAK,IAAIC,CAAC,IAAI,KAAK,IAAIC,CAAC,CAAC,GAG5CA,IAAI,KAAK,KAAKD,IAAI,KAAK,IAAIC,GAAGF,IAAS,CAAC,CAAC,IAG7CzB,IAAOY,EAAW,EAAE,GACpBZ,EAAK,OAAO,IACZA,EAAK,SAASyB;AAId,UAAMI,IAAK,KAAK,KAAKH,IAAIC,CAAC,GACpBG,IAAKD,IAAK,KAAK,KAAK,KAAK,KAAKF,CAAC,CAAC;AAEtC,IAAAI,EAAYT,GAAOC,GAAMC,GAAOM,GAAI,KAAK,WAAW;AAEpD,aAASzB,IAAIkB,GAAMlB,KAAKmB,GAAOnB,KAAKyB,GAAI;AAEpC,YAAME,IAAS,KAAK,IAAI3B,IAAIyB,IAAK,GAAGN,CAAK;AAEzC,MAAAO,EAAYT,GAAOjB,GAAG2B,GAAQH,GAAI,KAAK,WAAW;AAElD,eAASI,IAAI5B,GAAG4B,KAAKD,GAAQC,KAAKJ,GAAI;AAElC,cAAMK,IAAS,KAAK,IAAID,IAAIJ,IAAK,GAAGG,CAAM;AAG1C,QAAAhC,EAAK,SAAS,KAAK,KAAK,OAAOsB,GAAOW,GAAGC,GAAQT,IAAS,CAAC,CAAC;AAAA,MAChE;AAAA,IACJ;AAEA,WAAAG,EAAS5B,GAAM,KAAK,MAAM,GAEnBA;AAAA,EACX;AAAA,EAEA,eAAeD,GAAMC,GAAMmC,GAAOrB,GAAM;AACpC,WACIA,EAAK,KAAKd,CAAI,GAEV,EAAAA,EAAK,QAAQc,EAAK,SAAS,MAAMqB,MAH5B;AAKT,UAAIC,IAAU,OACVC,IAAiB,OACjBC;AAEJ,eAASjC,IAAI,GAAGA,IAAIL,EAAK,SAAS,QAAQK,KAAK;AAC3C,cAAMC,IAAQN,EAAK,SAASK,CAAC,GACvBkC,IAAOC,EAASlC,CAAK,GACrBmC,IAAcC,EAAa3C,GAAMO,CAAK,IAAIiC;AAGhD,QAAIE,IAAcJ,KACdA,IAAiBI,GACjBL,IAAUG,IAAOH,IAAUG,IAAOH,GAClCE,IAAahC,KAENmC,MAAgBJ,KAEnBE,IAAOH,MACPA,IAAUG,GACVD,IAAahC;AAAA,MAGzB;AAEA,MAAAN,IAAOsC,KAActC,EAAK,SAAS,CAAC;AAAA,IACxC;AAEA,WAAOA;AAAA,EACX;AAAA,EAEA,QAAQW,GAAMwB,GAAOQ,GAAQ;AACzB,UAAM5C,IAAO4C,IAAShC,IAAO,KAAK,OAAOA,CAAI,GACvCiC,IAAa,CAAA,GAGb5C,IAAO,KAAK,eAAeD,GAAM,KAAK,MAAMoC,GAAOS,CAAU;AAOnE,SAJA5C,EAAK,SAAS,KAAKW,CAAI,GACvBkC,EAAO7C,GAAMD,CAAI,GAGVoC,KAAS,KACRS,EAAWT,CAAK,EAAE,SAAS,SAAS,KAAK;AACzC,WAAK,OAAOS,GAAYT,CAAK,GAC7BA;AAKR,SAAK,oBAAoBpC,GAAM6C,GAAYT,CAAK;AAAA,EACpD;AAAA;AAAA,EAGA,OAAOS,GAAYT,GAAO;AACtB,UAAMnC,IAAO4C,EAAWT,CAAK,GACvBR,IAAI3B,EAAK,SAAS,QAClB8C,IAAI,KAAK;AAEf,SAAK,iBAAiB9C,GAAM8C,GAAGnB,CAAC;AAEhC,UAAMoB,IAAa,KAAK,kBAAkB/C,GAAM8C,GAAGnB,CAAC,GAE9CqB,IAAUpC,EAAWZ,EAAK,SAAS,OAAO+C,GAAY/C,EAAK,SAAS,SAAS+C,CAAU,CAAC;AAC9F,IAAAC,EAAQ,SAAShD,EAAK,QACtBgD,EAAQ,OAAOhD,EAAK,MAEpB4B,EAAS5B,GAAM,KAAK,MAAM,GAC1B4B,EAASoB,GAAS,KAAK,MAAM,GAEzBb,IAAOS,EAAWT,IAAQ,CAAC,EAAE,SAAS,KAAKa,CAAO,IACjD,KAAK,WAAWhD,GAAMgD,CAAO;AAAA,EACtC;AAAA,EAEA,WAAWhD,GAAMgD,GAAS;AAEtB,SAAK,OAAOpC,EAAW,CAACZ,GAAMgD,CAAO,CAAC,GACtC,KAAK,KAAK,SAAShD,EAAK,SAAS,GACjC,KAAK,KAAK,OAAO,IACjB4B,EAAS,KAAK,MAAM,KAAK,MAAM;AAAA,EACnC;AAAA,EAEA,kBAAkB5B,GAAM8C,GAAGnB,GAAG;AAC1B,QAAIT,GACA+B,IAAa,OACbb,IAAU;AAEd,aAAS/B,IAAIyC,GAAGzC,KAAKsB,IAAImB,GAAGzC,KAAK;AAC7B,YAAM6C,IAAQC,EAASnD,GAAM,GAAGK,GAAG,KAAK,MAAM,GACxC+C,IAAQD,EAASnD,GAAMK,GAAGsB,GAAG,KAAK,MAAM,GAExC0B,IAAUC,EAAiBJ,GAAOE,CAAK,GACvCb,IAAOC,EAASU,CAAK,IAAIV,EAASY,CAAK;AAG7C,MAAIC,IAAUJ,KACVA,IAAaI,GACbnC,IAAQb,GAER+B,IAAUG,IAAOH,IAAUG,IAAOH,KAE3BiB,MAAYJ,KAEfV,IAAOH,MACPA,IAAUG,GACVrB,IAAQb;AAAA,IAGpB;AAEA,WAAOa,KAASS,IAAImB;AAAA,EACxB;AAAA;AAAA,EAGA,iBAAiB9C,GAAM8C,GAAGnB,GAAG;AACzB,UAAM4B,IAAcvD,EAAK,OAAO,KAAK,cAAcwD,GAC7CC,IAAczD,EAAK,OAAO,KAAK,cAAc0D,GAC7CC,IAAU,KAAK,eAAe3D,GAAM8C,GAAGnB,GAAG4B,CAAW,GACrDK,IAAU,KAAK,eAAe5D,GAAM8C,GAAGnB,GAAG8B,CAAW;AAI3D,IAAIE,IAAUC,KAAS5D,EAAK,SAAS,KAAKuD,CAAW;AAAA,EACzD;AAAA;AAAA,EAGA,eAAevD,GAAM8C,GAAGnB,GAAGkC,GAAS;AAChC,IAAA7D,EAAK,SAAS,KAAK6D,CAAO;AAE1B,UAAM1D,IAAS,KAAK,QACd2D,IAAWX,EAASnD,GAAM,GAAG8C,GAAG3C,CAAM,GACtC4D,IAAYZ,EAASnD,GAAM2B,IAAImB,GAAGnB,GAAGxB,CAAM;AACjD,QAAI6D,IAASC,EAAWH,CAAQ,IAAIG,EAAWF,CAAS;AAExD,aAAS1D,IAAIyC,GAAGzC,IAAIsB,IAAImB,GAAGzC,KAAK;AAC5B,YAAMC,IAAQN,EAAK,SAASK,CAAC;AAC7B,MAAAwC,EAAOiB,GAAU9D,EAAK,OAAOG,EAAOG,CAAK,IAAIA,CAAK,GAClD0D,KAAUC,EAAWH,CAAQ;AAAA,IACjC;AAEA,aAASzD,IAAIsB,IAAImB,IAAI,GAAGzC,KAAKyC,GAAGzC,KAAK;AACjC,YAAMC,IAAQN,EAAK,SAASK,CAAC;AAC7B,MAAAwC,EAAOkB,GAAW/D,EAAK,OAAOG,EAAOG,CAAK,IAAIA,CAAK,GACnD0D,KAAUC,EAAWF,CAAS;AAAA,IAClC;AAEA,WAAOC;AAAA,EACX;AAAA,EAEA,oBAAoBjE,GAAMe,GAAMqB,GAAO;AAEnC,aAAS9B,IAAI8B,GAAO9B,KAAK,GAAGA;AACxB,MAAAwC,EAAO/B,EAAKT,CAAC,GAAGN,CAAI;AAAA,EAE5B;AAAA,EAEA,UAAUe,GAAM;AAEZ,aAAS,IAAIA,EAAK,SAAS,GAAGoD,GAAU,KAAK,GAAG;AAC5C,MAAIpD,EAAK,CAAC,EAAE,SAAS,WAAW,IACxB,IAAI,KACJoD,IAAWpD,EAAK,IAAI,CAAC,EAAE,UACvBoD,EAAS,OAAOA,EAAS,QAAQpD,EAAK,CAAC,CAAC,GAAG,CAAC,UAEpC,MAAA,IAETc,EAASd,EAAK,CAAC,GAAG,KAAK,MAAM;AAAA,EAE5C;AACJ;AAEA,SAASK,EAASR,GAAMW,GAAOT,GAAU;AACrC,MAAI,CAACA,EAAU,QAAOS,EAAM,QAAQX,CAAI;AAExC,WAASN,IAAI,GAAGA,IAAIiB,EAAM,QAAQjB;AAC9B,QAAIQ,EAASF,GAAMW,EAAMjB,CAAC,CAAC,EAAG,QAAOA;AAEzC,SAAO;AACX;AAGA,SAASuB,EAAS5B,GAAMG,GAAQ;AAC5B,EAAAgD,EAASnD,GAAM,GAAGA,EAAK,SAAS,QAAQG,GAAQH,CAAI;AACxD;AAGA,SAASmD,EAASnD,GAAMmE,GAAGC,GAAGjE,GAAQkE,GAAU;AAC5C,EAAKA,MAAUA,IAAWzD,EAAW,IAAI,IACzCyD,EAAS,OAAO,OAChBA,EAAS,OAAO,OAChBA,EAAS,OAAO,QAChBA,EAAS,OAAO;AAEhB,WAAShE,IAAI8D,GAAG9D,IAAI+D,GAAG/D,KAAK;AACxB,UAAMC,IAAQN,EAAK,SAASK,CAAC;AAC7B,IAAAwC,EAAOwB,GAAUrE,EAAK,OAAOG,EAAOG,CAAK,IAAIA,CAAK;AAAA,EACtD;AAEA,SAAO+D;AACX;AAEA,SAASxB,EAAOzB,GAAGC,GAAG;AAClB,SAAAD,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAMC,EAAE,IAAI,GAChCD,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAMC,EAAE,IAAI,GAChCD,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAMC,EAAE,IAAI,GAChCD,EAAE,OAAO,KAAK,IAAIA,EAAE,MAAMC,EAAE,IAAI,GACzBD;AACX;AAEA,SAASoC,EAAgBpC,GAAGC,GAAG;AAAE,SAAOD,EAAE,OAAOC,EAAE;AAAM;AACzD,SAASqC,EAAgBtC,GAAGC,GAAG;AAAE,SAAOD,EAAE,OAAOC,EAAE;AAAM;AAEzD,SAASmB,EAASpB,GAAK;AAAE,UAAQA,EAAE,OAAOA,EAAE,SAASA,EAAE,OAAOA,EAAE;AAAO;AACvE,SAAS6C,EAAW7C,GAAG;AAAE,SAAQA,EAAE,OAAOA,EAAE,QAASA,EAAE,OAAOA,EAAE;AAAO;AAEvE,SAASsB,EAAatB,GAAGC,GAAG;AACxB,UAAQ,KAAK,IAAIA,EAAE,MAAMD,EAAE,IAAI,IAAI,KAAK,IAAIC,EAAE,MAAMD,EAAE,IAAI,MAClD,KAAK,IAAIC,EAAE,MAAMD,EAAE,IAAI,IAAI,KAAK,IAAIC,EAAE,MAAMD,EAAE,IAAI;AAC9D;AAEA,SAASkC,EAAiBlC,GAAGC,GAAG;AAC5B,QAAMiD,IAAO,KAAK,IAAIlD,EAAE,MAAMC,EAAE,IAAI,GAC9BkD,IAAO,KAAK,IAAInD,EAAE,MAAMC,EAAE,IAAI,GAC9BmD,IAAO,KAAK,IAAIpD,EAAE,MAAMC,EAAE,IAAI,GAC9BoD,IAAO,KAAK,IAAIrD,EAAE,MAAMC,EAAE,IAAI;AAEpC,SAAO,KAAK,IAAI,GAAGmD,IAAOF,CAAI,IACvB,KAAK,IAAI,GAAGG,IAAOF,CAAI;AAClC;AAEA,SAAS/D,EAASY,GAAGC,GAAG;AACpB,SAAOD,EAAE,QAAQC,EAAE,QACZD,EAAE,QAAQC,EAAE,QACZA,EAAE,QAAQD,EAAE,QACZC,EAAE,QAAQD,EAAE;AACvB;AAEA,SAASlB,EAAWkB,GAAGC,GAAG;AACtB,SAAOA,EAAE,QAAQD,EAAE,QACZC,EAAE,QAAQD,EAAE,QACZC,EAAE,QAAQD,EAAE,QACZC,EAAE,QAAQD,EAAE;AACvB;AAEA,SAASR,EAAW8D,GAAU;AAC1B,SAAO;AAAA,IACH,UAAAA;AAAA,IACA,QAAQ;AAAA,IACR,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,IACN,MAAM;AAAA,EAAA;AAEd;AAKA,SAAS3C,EAAY4C,GAAKpD,GAAMC,GAAO,GAAGqC,GAAS;AAC/C,QAAMe,IAAQ,CAACrD,GAAMC,CAAK;AAE1B,SAAOoD,EAAM,UAAQ;AAIjB,QAHApD,IAAQoD,EAAM,IAAA,GACdrD,IAAOqD,EAAM,IAAA,GAETpD,IAAQD,KAAQ,EAAG;AAEvB,UAAMsD,IAAMtD,IAAO,KAAK,MAAMC,IAAQD,KAAQ,IAAI,CAAC,IAAI;AACvD,IAAAuD,EAAYH,GAAKE,GAAKtD,GAAMC,GAAOqC,CAAO,GAE1Ce,EAAM,KAAKrD,GAAMsD,GAAKA,GAAKrD,CAAK;AAAA,EACpC;AACJ;","x_google_ignoreList":[0]}

package/dist/index.es351.js

@@ -0,0 +1,30 @@
+function b(c, s) {
+  return (c << s | c >>> 32 - s) >>> 0;
+}
+function S(c) {
+  const s = new TextEncoder().encode(c), r = s.length, x = r * 8, y = (r + 9 + 63 & -64) - r, d = new Uint8Array(r + y);
+  d.set(s), d[r] = 128;
+  const h = new DataView(d.buffer), m = d.length;
+  h.setUint32(m - 8, Math.floor(x / 4294967296), !1), h.setUint32(m - 4, x >>> 0, !1);
+  let g = 1732584193, p = 4023233417, w = 2562383102, H = 271733878, u = 3285377520;
+  const o = new Uint32Array(80);
+  for (let a = 0; a < m; a += 64) {
+    for (let t = 0; t < 16; t++)
+      o[t] = h.getUint32(a + t * 4, !1);
+    for (let t = 16; t < 80; t++)
+      o[t] = b(o[t - 3] ^ o[t - 8] ^ o[t - 14] ^ o[t - 16], 1);
+    let U = g, e = p, n = w, l = H, L = u;
+    for (let t = 0; t < 80; t++) {
+      let f, i;
+      t < 20 ? (f = (e & n | ~e & l) >>> 0, i = 1518500249) : t < 40 ? (f = e ^ n ^ l, i = 1859775393) : t < 60 ? (f = e & n | e & l | n & l, i = 2400959708) : (f = e ^ n ^ l, i = 3395469782);
+      const A = b(U, 5) + f + L + i + o[t] >>> 0;
+      L = l, l = n, n = b(e, 30), e = U, U = A;
+    }
+    g = g + U >>> 0, p = p + e >>> 0, w = w + n >>> 0, H = H + l >>> 0, u = u + L >>> 0;
+  }
+  return [g, p, w, H, u].map((a) => a.toString(16).padStart(8, "0")).join("");
+}
+export {
+  S as sha1Hex
+};
+//# sourceMappingURL=index.es351.js.map

package/dist/index.es351.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es351.js","sources":["../../../node_modules/@allmaps/id/dist/sha1.js"],"sourcesContent":["/**\n * Pure TypeScript SHA-1 implementation.\n * No external dependencies — works in all environments including Cloudflare Workers.\n *\n * Based on the SHA-1 specification (FIPS PUB 180-4).\n */\nfunction rotl(n, s) {\n    return ((n << s) | (n >>> (32 - s))) >>> 0;\n}\n/**\n * Computes the SHA-1 hash of a UTF-8 string and returns it as a hex string.\n *\n * @param message - Input string.\n * @returns Hex-encoded SHA-1 digest.\n */\nexport function sha1Hex(message) {\n    // Encode string to UTF-8 bytes\n    const msgBytes = new TextEncoder().encode(message);\n    const msgLen = msgBytes.length;\n    // Pre-processing: adding padding bits\n    // Message length in bits\n    const bitLen = msgLen * 8;\n    // Padding: 1 byte 0x80, then zeros, then 8 bytes for the 64-bit length.\n    // Total padded length must be a multiple of 64 bytes.\n    const padLen = ((msgLen + 9 + 63) & ~63) - msgLen;\n    const padded = new Uint8Array(msgLen + padLen);\n    padded.set(msgBytes);\n    padded[msgLen] = 0x80;\n    // Append original length in bits as big-endian 64-bit integer.\n    // JavaScript's bit ops are 32-bit, so split into two 32-bit words.\n    const dataView = new DataView(padded.buffer);\n    const totalLen = padded.length;\n    dataView.setUint32(totalLen - 8, Math.floor(bitLen / 0x100000000), false);\n    dataView.setUint32(totalLen - 4, bitLen >>> 0, false);\n    // Initial hash values (H0–H4)\n    let H0 = 0x67452301;\n    let H1 = 0xefcdab89;\n    let H2 = 0x98badcfe;\n    let H3 = 0x10325476;\n    let H4 = 0xc3d2e1f0;\n    // Process each 512-bit (64-byte) block\n    const W = new Uint32Array(80);\n    for (let offset = 0; offset < totalLen; offset += 64) {\n        // Prepare message schedule\n        for (let i = 0; i < 16; i++) {\n            W[i] = dataView.getUint32(offset + i * 4, false);\n        }\n        for (let i = 16; i < 80; i++) {\n            W[i] = rotl(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n        }\n        let a = H0;\n        let b = H1;\n        let c = H2;\n        let d = H3;\n        let e = H4;\n        for (let i = 0; i < 80; i++) {\n            let f;\n            let k;\n            if (i < 20) {\n                f = ((b & c) | (~b & d)) >>> 0;\n                k = 0x5a827999;\n            }\n            else if (i < 40) {\n                f = b ^ c ^ d;\n                k = 0x6ed9eba1;\n            }\n            else if (i < 60) {\n                f = (b & c) | (b & d) | (c & d);\n                k = 0x8f1bbcdc;\n            }\n            else {\n                f = b ^ c ^ d;\n                k = 0xca62c1d6;\n            }\n            const temp = (rotl(a, 5) + f + e + k + W[i]) >>> 0;\n            e = d;\n            d = c;\n            c = rotl(b, 30);\n            b = a;\n            a = temp;\n        }\n        H0 = (H0 + a) >>> 0;\n        H1 = (H1 + b) >>> 0;\n        H2 = (H2 + c) >>> 0;\n        H3 = (H3 + d) >>> 0;\n        H4 = (H4 + e) >>> 0;\n    }\n    return [H0, H1, H2, H3, H4]\n        .map((h) => h.toString(16).padStart(8, '0'))\n        .join('');\n}\n"],"names":["rotl","n","sha1Hex","message","msgBytes","msgLen","bitLen","padLen","padded","dataView","totalLen","H0","H1","H2","H3","H4","W","offset","i","a","b","c","d","e","k","temp","h"],"mappings":"AAMA,SAASA,EAAKC,GAAG,GAAG;AAChB,UAASA,KAAK,IAAMA,MAAO,KAAK,OAAS;AAC7C;AAOO,SAASC,EAAQC,GAAS;AAE7B,QAAMC,IAAW,IAAI,cAAc,OAAOD,CAAO,GAC3CE,IAASD,EAAS,QAGlBE,IAASD,IAAS,GAGlBE,KAAWF,IAAS,IAAI,KAAM,OAAOA,GACrCG,IAAS,IAAI,WAAWH,IAASE,CAAM;AAC7C,EAAAC,EAAO,IAAIJ,CAAQ,GACnBI,EAAOH,CAAM,IAAI;AAGjB,QAAMI,IAAW,IAAI,SAASD,EAAO,MAAM,GACrCE,IAAWF,EAAO;AACxB,EAAAC,EAAS,UAAUC,IAAW,GAAG,KAAK,MAAMJ,IAAS,UAAW,GAAG,EAAK,GACxEG,EAAS,UAAUC,IAAW,GAAGJ,MAAW,GAAG,EAAK;AAEpD,MAAIK,IAAK,YACLC,IAAK,YACLC,IAAK,YACLC,IAAK,WACLC,IAAK;AAET,QAAMC,IAAI,IAAI,YAAY,EAAE;AAC5B,WAASC,IAAS,GAAGA,IAASP,GAAUO,KAAU,IAAI;AAElD,aAASC,IAAI,GAAGA,IAAI,IAAIA;AACpB,MAAAF,EAAEE,CAAC,IAAIT,EAAS,UAAUQ,IAASC,IAAI,GAAG,EAAK;AAEnD,aAASA,IAAI,IAAIA,IAAI,IAAIA;AACrB,MAAAF,EAAEE,CAAC,IAAIlB,EAAKgB,EAAEE,IAAI,CAAC,IAAIF,EAAEE,IAAI,CAAC,IAAIF,EAAEE,IAAI,EAAE,IAAIF,EAAEE,IAAI,EAAE,GAAG,CAAC;AAE9D,QAAIC,IAAIR,GACJS,IAAIR,GACJS,IAAIR,GACJS,IAAIR,GACJS,IAAIR;AACR,aAASG,IAAI,GAAGA,IAAI,IAAIA,KAAK;AACzB,UAAI,GACAM;AACJ,MAAIN,IAAI,MACJ,KAAME,IAAIC,IAAM,CAACD,IAAIE,OAAQ,GAC7BE,IAAI,cAECN,IAAI,MACT,IAAIE,IAAIC,IAAIC,GACZE,IAAI,cAECN,IAAI,MACT,IAAKE,IAAIC,IAAMD,IAAIE,IAAMD,IAAIC,GAC7BE,IAAI,eAGJ,IAAIJ,IAAIC,IAAIC,GACZE,IAAI;AAER,YAAMC,IAAQzB,EAAKmB,GAAG,CAAC,IAAI,IAAII,IAAIC,IAAIR,EAAEE,CAAC,MAAO;AACjD,MAAAK,IAAID,GACJA,IAAID,GACJA,IAAIrB,EAAKoB,GAAG,EAAE,GACdA,IAAID,GACJA,IAAIM;AAAA,IACR;AACA,IAAAd,IAAMA,IAAKQ,MAAO,GAClBP,IAAMA,IAAKQ,MAAO,GAClBP,IAAMA,IAAKQ,MAAO,GAClBP,IAAMA,IAAKQ,MAAO,GAClBP,IAAMA,IAAKQ,MAAO;AAAA,EACtB;AACA,SAAO,CAACZ,GAAIC,GAAIC,GAAIC,GAAIC,CAAE,EACrB,IAAI,CAACW,MAAMA,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG,GAAG,CAAC,EAC1C,KAAK,EAAE;AAChB;","x_google_ignoreList":[0]}

package/dist/index.es352.js

@@ -0,0 +1,7 @@
+function t(e) {
+  return Array.isArray(e) ? `[${e.map((r) => t(r)).join(",")}]` : typeof e == "number" ? `${e}` : typeof e == "string" ? `"${e}"` : typeof e == "object" && e !== null ? Object.keys(e).sort().map((r) => `${r}:${t(e[r])}`).join("|") : String(e);
+}
+export {
+  t as serialize
+};
+//# sourceMappingURL=index.es352.js.map

package/dist/index.es352.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es352.js","sources":["../../../node_modules/@allmaps/id/dist/checksum.js"],"sourcesContent":["/**\n * Serializes any JavaScript type to a string. If the\n * type is an object, first sortthe object by its keys.\n *\n * @param obj - JavaScript type to serialize.\n * @returns `obj` serialized to a string.\n */\nexport function serialize(obj) {\n    if (Array.isArray(obj)) {\n        return `[${obj.map((i) => serialize(i)).join(',')}]`;\n    }\n    else if (typeof obj === 'number') {\n        return `${obj}`;\n    }\n    else if (typeof obj === 'string') {\n        return `\"${obj}\"`;\n    }\n    else if (typeof obj === 'object' && obj !== null) {\n        return Object.keys(obj)\n            .sort()\n            .map((key) => `${key}:${serialize(obj[key])}`)\n            .join('|');\n    }\n    return String(obj);\n}\n"],"names":["serialize","obj","i","key"],"mappings":"AAOO,SAASA,EAAUC,GAAK;AAC3B,SAAI,MAAM,QAAQA,CAAG,IACV,IAAIA,EAAI,IAAI,CAACC,MAAMF,EAAUE,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,MAE5C,OAAOD,KAAQ,WACb,GAAGA,CAAG,KAER,OAAOA,KAAQ,WACb,IAAIA,CAAG,MAET,OAAOA,KAAQ,YAAYA,MAAQ,OACjC,OAAO,KAAKA,CAAG,EACjB,OACA,IAAI,CAACE,MAAQ,GAAGA,CAAG,IAAIH,EAAUC,EAAIE,CAAG,CAAC,CAAC,EAAE,EAC5C,KAAK,GAAG,IAEV,OAAOF,CAAG;AACrB;","x_google_ignoreList":[0]}

package/dist/index.es353.js

@@ -0,0 +1,286 @@
+import { WarpedMapEventType as l, WarpedMapEvent as a } from "./index.es213.js";
+import { equalSet as n } from "./index.es216.js";
+var o = 4, d = 2, c = 100, E = class extends EventTarget {
+  cacheableTileFactory;
+  fetchFn;
+  tileCacheForTilesFromSprites;
+  tilesByTileUrl = /* @__PURE__ */ new Map();
+  mapIdsByTileUrl = /* @__PURE__ */ new Map();
+  tileUrlsByMapId = /* @__PURE__ */ new Map();
+  tilesFetchingCount = 0;
+  tileRemoveQueue = [];
+  fetchableTiles = [];
+  #e = this.tileFetched.bind(this);
+  #t = this.tileFetchError.bind(this);
+  #i = this.tilesFromSpriteTile.bind(this);
+  constructor(e, t) {
+    super(), this.setOptions(t), this.cacheableTileFactory = e;
+  }
+  /**
+  * Get the tiles in this cache
+  *
+  * @returns
+  */
+  getCacheableTiles() {
+    return this.tilesByTileUrl.values();
+  }
+  /**
+  * Get a specific tile in this cache
+  *
+  * @param tileUrl - the URL of the requested tile
+  * @returns
+  */
+  getCacheableTile(e) {
+    return this.tilesByTileUrl.get(e);
+  }
+  /**
+  * Get the tiles in this cache, corresponding to a specific map
+  *
+  * @param mapId - ID of the map
+  * @returns
+  */
+  getMapCacheableTiles(e) {
+    const t = [], i = this.tileUrlsByMapId.get(e);
+    if (i) for (const s of i) {
+      const r = this.tilesByTileUrl.get(s);
+      r && t.push(r);
+    }
+    return t;
+  }
+  /**
+  * Get the tiles in this cache that have been fetched
+  *
+  * @returns
+  */
+  getCachedTiles() {
+    const e = [];
+    for (const t of this.tilesByTileUrl.values()) t.isCachedTile() && e.push(t);
+    return e;
+  }
+  /**
+  * Get a specific cached tile in this cache that has been fetched
+  *
+  * @param tileUrl - the URL of the requested tile
+  * @returns
+  */
+  getCachedTile(e) {
+    const t = this.tilesByTileUrl.get(e);
+    if (t && t.isCachedTile()) return t;
+  }
+  /**
+  * Get the tiles in this cache, corresponding to a specific map, that have been fetched
+  *
+  * @param mapId - ID of the map
+  * @returns
+  */
+  getMapCachedTiles(e) {
+    const t = [], i = this.tileUrlsByMapId.get(e);
+    if (i) for (const s of i) {
+      const r = this.tilesByTileUrl.get(s);
+      r && r.isCachedTile() && t.push(r);
+    }
+    return t;
+  }
+  /**
+  * Get the URLs of tiles in this cache
+  *
+  * @returns
+  */
+  getTileUrls() {
+    return this.tilesByTileUrl.keys();
+  }
+  /**
+  * Get the URLs of tiles in this cache, corresponding to a specific map
+  *
+  * @param mapId - ID of the map
+  * @returns
+  */
+  getMapTileUrls(e) {
+    return this.tileUrlsByMapId.get(e) || /* @__PURE__ */ new Set();
+  }
+  /**
+  * Get the Tile Cache options
+  *
+  * @param partialTileCacheOptions - Options
+  */
+  setOptions(e) {
+    this.fetchFn = e?.fetchFn, this.tileCacheForTilesFromSprites = e?.tileCacheForSprites;
+  }
+  /**
+  * Process the request for new tiles to be added to this cache
+  *
+  * @param fetchableTiles
+  */
+  requestFetchableTiles(e) {
+    if (!n(new Set(this.fetchableTiles.map((t) => t.fetchableTileKey)), new Set(e.map((t) => t.fetchableTileKey)))) {
+      for (const t of e) this.requestFetchableTile(t);
+      this.fetchableTiles = e;
+    }
+  }
+  /**
+  * Returns a promise that resolves when all requested tiles are loaded.
+  * This could happen immidiately, in case there are no ongoing requests and the tilesFetchingCount is zero,
+  * or in a while, when the count reaches zero and the ALLREQUESTEDTILESLOADED event is fired.
+  */
+  async allRequestedTilesLoaded() {
+    return new Promise((e) => {
+      if (this.finished) e();
+      else {
+        const t = () => {
+          this.removeEventListener(l.ALLREQUESTEDTILESLOADED, t), e();
+        };
+        this.addEventListener(l.ALLREQUESTEDTILESLOADED, t);
+      }
+    });
+  }
+  /**
+  * Prune tiles in this cache using the provided prune info
+  */
+  prune(e) {
+    for (const [t, i] of this.mapIdsByTileUrl.entries()) for (const s of i) {
+      const r = e.get(s), h = this.tilesByTileUrl.get(t);
+      h && h.shouldPrune(r, {
+        maxHigherLog2ScaleFactorDiff: o,
+        maxLowerLog2ScaleFactorDiff: d
+      }) && this.delayedRemoveCacheableTileForMapId(t, s);
+    }
+  }
+  clear() {
+    for (const e of this.getCacheableTiles())
+      e.abort(), this.removeEventListenersFromCacheableTile(e);
+    this.tilesByTileUrl = /* @__PURE__ */ new Map(), this.mapIdsByTileUrl = /* @__PURE__ */ new Map(), this.tileUrlsByMapId = /* @__PURE__ */ new Map(), this.tilesFetchingCount = 0;
+  }
+  destroy() {
+    this.clear();
+  }
+  requestFetchableTile(e) {
+    const t = e.mapId, i = e.tileUrl;
+    if (this.tilesByTileUrl.has(i))
+      this.tilesByTileUrl.get(i)?.isCachedTile() && this.dispatchEvent(new a(l.MAPTILELOADED, {
+        mapIds: [t],
+        tileUrl: i
+      }));
+    else {
+      const s = this.cacheableTileFactory(e, this.fetchFn);
+      this.addEventListenersToCacheableTile(s), this.addCacheableTile(s);
+    }
+    this.addTileUrlForMapId(i, t), this.addMapIdForTileUrl(t, i), this.cancelDelayedRemoveCacheableTileForMapId(i, t);
+  }
+  addCacheableTile(e) {
+    this.tilesByTileUrl.set(e.fetchableTile.tileUrl, e), e.fetch(), this.updateTilesFetchingCount(1);
+  }
+  addCachedTile(e) {
+    const t = e.fetchableTile.mapId, i = e.fetchableTile.tileUrl;
+    this.tilesByTileUrl.has(i) || (this.tilesByTileUrl.set(i, e), this.addTileUrlForMapId(i, t), this.addMapIdForTileUrl(t, i), this.cancelDelayedRemoveCacheableTileForMapId(i, t), this.dispatchEvent(new a(l.MAPTILELOADED, {
+      mapIds: [t],
+      tileUrl: i
+    })));
+  }
+  delayedRemoveCacheableTileForMapId(e, t) {
+    if (!this.tileRemoveQueue.some((i) => i.tileUrl === e && i.mapId === t) && (this.tileRemoveQueue.push({
+      tileUrl: e,
+      mapId: t
+    }), this.tileRemoveQueue.length > c)) {
+      const i = this.tileRemoveQueue.shift();
+      i && this.removeCacheableTileForMapId(i.tileUrl, i.mapId);
+    }
+  }
+  cancelDelayedRemoveCacheableTileForMapId(e, t) {
+    const i = this.tileRemoveQueue.findIndex((s) => s.tileUrl === e && s.mapId === t);
+    i !== -1 && this.tileRemoveQueue.splice(i, 1);
+  }
+  removeCacheableTileForMapId(e, t) {
+    const i = this.tilesByTileUrl.get(e);
+    if (!i) return;
+    const s = this.removeMapIdForTileUrl(t, e);
+    this.removeTileUrlForMapId(e, t), s.size || (i.isCachedTile() || (i.abort(), this.updateTilesFetchingCount(-1)), this.tilesByTileUrl.delete(e)), this.dispatchEvent(new a(l.MAPTILEDELETED, {
+      mapIds: [t],
+      tileUrl: e
+    }));
+  }
+  tileFetched(e) {
+    if (e instanceof a) {
+      if (!e.data?.tileUrl) throw new Error("Event data missing");
+      const { tileUrl: t } = e.data;
+      this.updateTilesFetchingCount(-1);
+      for (const i of this.mapIdsByTileUrl.get(t) || [])
+        this.dispatchEvent(new a(l.MAPTILELOADED, {
+          mapIds: [i],
+          tileUrl: t
+        })), this.tileUrlsByMapId.get(i)?.values().next().value === t && this.dispatchEvent(new a(l.FIRSTMAPTILELOADED, {
+          mapIds: [i],
+          tileUrl: t
+        }));
+      this.tileCacheForTilesFromSprites && this.tilesByTileUrl.get(t)?.applySprites();
+    }
+  }
+  tileFetchError(e) {
+    if (e instanceof a) {
+      if (!e.data?.tileUrl) throw new Error("Event data missing");
+      const { tileUrl: t } = e.data;
+      this.tilesByTileUrl.has(t) && this.updateTilesFetchingCount(-1);
+    }
+  }
+  tilesFromSpriteTile(e) {
+    if (e instanceof a) {
+      if (!e.data?.tileUrl) throw new Error("Event data missing");
+      const { tileUrl: t } = e.data;
+      this.passTilesFromSprites(t);
+    }
+  }
+  passTilesFromSprites(e) {
+    let t;
+    if (!e) t = Array.from(this.getCacheableTiles());
+    else {
+      const i = this.tilesByTileUrl.get(e);
+      t = i ? [i] : [];
+    }
+    for (const i of t) {
+      const s = i.getCachedTilesFromSprites();
+      if (!s) throw new Error("Cached tiles from sprites not found");
+      for (const h of s) {
+        if (!h.isCachedTile()) break;
+        this.tileCacheForTilesFromSprites?.addCachedTile(h);
+      }
+      const r = s.map((h) => h.fetchableTile.mapId);
+      this.dispatchEvent(new a(l.MAPTILESLOADEDFROMSPRITES, {
+        mapIds: r,
+        spritesInfo: i.fetchableTile.options?.spritesInfo
+      }));
+    }
+  }
+  addMapIdForTileUrl(e, t) {
+    let i = this.mapIdsByTileUrl.get(t);
+    return i ? i.add(e) : i = /* @__PURE__ */ new Set([e]), this.mapIdsByTileUrl.set(t, i), i;
+  }
+  removeMapIdForTileUrl(e, t) {
+    const i = this.mapIdsByTileUrl.get(t);
+    if (i) i.delete(e);
+    else return /* @__PURE__ */ new Set();
+    return i.size ? this.mapIdsByTileUrl.set(t, i) : this.mapIdsByTileUrl.delete(t), i;
+  }
+  addTileUrlForMapId(e, t) {
+    let i = this.tileUrlsByMapId.get(t);
+    return i ? i.add(e) : i = /* @__PURE__ */ new Set([e]), this.tileUrlsByMapId.set(t, i), i;
+  }
+  removeTileUrlForMapId(e, t) {
+    const i = this.tileUrlsByMapId.get(t);
+    return i ? (i.delete(e), i.size ? this.tileUrlsByMapId.set(t, i) : this.tileUrlsByMapId.delete(t), i) : /* @__PURE__ */ new Set();
+  }
+  get finished() {
+    return this.tilesFetchingCount === 0;
+  }
+  updateTilesFetchingCount(e) {
+    this.tilesFetchingCount += e, this.tilesFetchingCount === 0 && this.dispatchEvent(new a(l.ALLREQUESTEDTILESLOADED));
+  }
+  addEventListenersToCacheableTile(e) {
+    e.addEventListener(l.TILEFETCHED, this.#e), e.addEventListener(l.TILEFETCHERROR, this.#t), e.addEventListener(l.TILESFROMSPRITETILE, this.#i);
+  }
+  removeEventListenersFromCacheableTile(e) {
+    e.removeEventListener(l.TILEFETCHED, this.#e), e.removeEventListener(l.TILEFETCHERROR, this.#t), e.removeEventListener(l.TILESFROMSPRITETILE, this.#i);
+  }
+};
+export {
+  E as TileCache
+};
+//# sourceMappingURL=index.es353.js.map