@performant-software/geospatial 3.1.25-beta.1 → 3.1.25

package/dist/index.es336.js

@@ -0,0 +1,251 @@
+import I from "./index.es407.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.es336.js.map

package/dist/index.es336.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es336.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.es337.js

@@ -0,0 +1,65 @@
+import l from "./index.es338.js";
+import { transformInternal as m } from "./index.es343.js";
+import x from "./index.es340.js";
+var g = l("WGS84");
+function c(t, f, n, a) {
+  var e, u, r;
+  return Array.isArray(n) ? (e = m(t, f, x(n), a) || { x: NaN, y: NaN }, n.length > 2 ? (u = typeof t.name < "u" && t.name === "geocent" || typeof f.name < "u" && f.name === "geocent", u ? typeof e.z == "number" ? (
+    /** @type {T} */
+    [e.x, e.y, e.z].concat(n.slice(3))
+  ) : (
+    /** @type {T} */
+    [e.x, e.y, n[2]].concat(n.slice(3))
+  ) : a && typeof e.z == "number" ? (
+    /** @type {T} */
+    [e.x, e.y, e.z].concat(n.slice(3))
+  ) : (
+    /** @type {T} */
+    [e.x, e.y].concat(n.slice(2))
+  )) : (
+    /** @type {T} */
+    [e.x, e.y]
+  )) : (e = m(t, f, { x: n.x, y: n.y, z: n.z, m: n.m }, a) || { x: NaN, y: NaN }, r = Object.keys(n), r.length === 2 || (u = typeof t.name < "u" && t.name === "geocent" || typeof f.name < "u" && f.name === "geocent", r.forEach(function(i) {
+    i === "x" || i === "y" || i === "z" && (u || a) || (e[i] = n[i]);
+  })), /** @type {T} */
+  e);
+}
+function y(t) {
+  return t instanceof l ? t : typeof t == "object" && "oProj" in t ? t.oProj : l(
+    /** @type {string | PROJJSONDefinition} */
+    t
+  );
+}
+function b(t, f, n) {
+  var a, e, u = !1, r;
+  return typeof f > "u" ? (e = y(t), a = g, u = !0) : (typeof /** @type {?} */
+  f.x < "u" || Array.isArray(f)) && (n = /** @type {T} */
+  /** @type {?} */
+  f, e = y(t), a = g, u = !0), a || (a = y(t)), e || (e = y(
+    /** @type {string | PROJJSONDefinition | proj } */
+    f
+  )), n ? c(a, e, n) : (r = {
+    /**
+     * @template {TemplateCoordinates} T
+     * @param {T} coords
+     * @param {boolean=} enforceAxis
+     * @returns {T}
+     */
+    forward: function(i, p) {
+      return c(a, e, i, p);
+    },
+    /**
+     * @template {TemplateCoordinates} T
+     * @param {T} coords
+     * @param {boolean=} enforceAxis
+     * @returns {T}
+     */
+    inverse: function(i, p) {
+      return c(e, a, i, p);
+    }
+  }, u && (r.oProj = e), r);
+}
+export {
+  b as default
+};
+//# sourceMappingURL=index.es337.js.map

package/dist/index.es337.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es337.js","sources":["../../../node_modules/proj4/lib/core.js"],"sourcesContent":["import proj from './Proj';\nimport { transformInternal } from './transform';\nimport toPoint from './common/toPoint';\nvar wgs84 = proj('WGS84');\n\n/**\n * @typedef {{x: number, y: number, z?: number, m?: number}} InterfaceCoordinates\n */\n\n/**\n * @typedef {Array<number> | InterfaceCoordinates} TemplateCoordinates\n */\n\n/**\n * @typedef {Object} Converter\n * @property {<T extends TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} forward\n * @property {<T extends TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} inverse\n * @property {proj} [oProj]\n */\n\n/**\n * @typedef {Object} PROJJSONDefinition\n * @property {string} [$schema]\n * @property {string} type\n * @property {string} [name]\n * @property {{authority: string, code: number}} [id]\n * @property {string} [scope]\n * @property {string} [area]\n * @property {{south_latitude: number, west_longitude: number, north_latitude: number, east_longitude: number}} [bbox]\n * @property {PROJJSONDefinition[]} [components]\n * @property {{type: string, name: string}} [datum]\n * @property {{\n *   name: string,\n *   members: Array<{\n *     name: string,\n *     id?: {authority: string, code: number}\n *   }>,\n *   ellipsoid?: {\n *     name: string,\n *     semi_major_axis: number,\n *     inverse_flattening?: number\n *   },\n *   accuracy?: string,\n *   id?: {authority: string, code: number}\n * }} [datum_ensemble]\n * @property {{\n *   subtype: string,\n *   axis: Array<{\n *     name: string,\n *     abbreviation?: string,\n *     direction: string,\n *     unit: string\n *   }>\n * }} [coordinate_system]\n * @property {{\n *   name: string,\n *   method: {name: string},\n *   parameters: Array<{\n *     name: string,\n *     value: number,\n *     unit?: string\n *   }>\n * }} [conversion]\n * @property {{\n *   name: string,\n *   method: {name: string},\n *   parameters: Array<{\n *     name: string,\n *     value: number,\n *     unit?: string,\n *     type?: string,\n *     file_name?: string\n *   }>\n * }} [transformation]\n */\n\n/**\n * @template {TemplateCoordinates} T\n * @param {proj} from\n * @param {proj} to\n * @param {T} coords\n * @param {boolean} [enforceAxis]\n * @returns {T}\n */\nfunction transformer(from, to, coords, enforceAxis) {\n  var out, geocent, keys;\n  if (Array.isArray(coords)) {\n    out = transformInternal(from, to, toPoint(coords), enforceAxis) || { x: NaN, y: NaN };\n    if (coords.length > 2) {\n      geocent = (typeof from.name !== 'undefined' && from.name === 'geocent') || (typeof to.name !== 'undefined' && to.name === 'geocent');\n      if (geocent) {\n        if (typeof out.z === 'number') {\n          return /** @type {T} */ ([out.x, out.y, out.z].concat(coords.slice(3)));\n        }\n        return /** @type {T} */ ([out.x, out.y, coords[2]].concat(coords.slice(3)));\n      }\n      if (enforceAxis && typeof out.z === 'number') {\n        return /** @type {T} */ ([out.x, out.y, out.z].concat(coords.slice(3)));\n      }\n      return /** @type {T} */ ([out.x, out.y].concat(coords.slice(2)));\n    }\n    return /** @type {T} */ ([out.x, out.y]);\n  } else {\n    out = transformInternal(from, to, { x: coords.x, y: coords.y, z: coords.z, m: coords.m }, enforceAxis) || { x: NaN, y: NaN };\n    keys = Object.keys(coords);\n    if (keys.length === 2) {\n      return /** @type {T} */ (out);\n    }\n    geocent = (typeof from.name !== 'undefined' && from.name === 'geocent') || (typeof to.name !== 'undefined' && to.name === 'geocent');\n    keys.forEach(function (key) {\n      if (key === 'x' || key === 'y') {\n        return;\n      }\n      if (key === 'z' && (geocent || enforceAxis)) {\n        return;\n      }\n      out[key] = coords[key];\n    });\n    return /** @type {T} */ (out);\n  }\n}\n\n/**\n * @param {proj | string | PROJJSONDefinition | Converter} item\n * @returns {import('./Proj').default}\n */\nfunction checkProj(item) {\n  if (item instanceof proj) {\n    return item;\n  }\n  if (typeof item === 'object' && 'oProj' in item) {\n    return item.oProj;\n  }\n  return proj(/** @type {string | PROJJSONDefinition} */ (item));\n}\n\n/**\n * @overload\n * @param {string | PROJJSONDefinition | proj} toProj\n * @returns {Converter}\n */\n/**\n * @overload\n * @param {string | PROJJSONDefinition | proj} fromProj\n * @param {string | PROJJSONDefinition | proj} toProj\n * @returns {Converter}\n */\n/**\n * @template {TemplateCoordinates} T\n * @overload\n * @param {string | PROJJSONDefinition | proj} toProj\n * @param {T} coord\n * @returns {T}\n */\n/**\n * @template {TemplateCoordinates} T\n * @overload\n * @param {string | PROJJSONDefinition | proj} fromProj\n * @param {string | PROJJSONDefinition | proj} toProj\n * @param {T} coord\n * @returns {T}\n */\n/**\n * @template {TemplateCoordinates} T\n * @param {string | PROJJSONDefinition | proj} fromProjOrToProj\n * @param {string | PROJJSONDefinition | proj | TemplateCoordinates} [toProjOrCoord]\n * @param {T} [coord]\n * @returns {T|Converter}\n */\nfunction proj4(fromProjOrToProj, toProjOrCoord, coord) {\n  /** @type {proj} */\n  var fromProj;\n  /** @type {proj} */\n  var toProj;\n  var single = false;\n  /** @type {Converter} */\n  var obj;\n  if (typeof toProjOrCoord === 'undefined') {\n    toProj = checkProj(fromProjOrToProj);\n    fromProj = wgs84;\n    single = true;\n  } else if (typeof /** @type {?} */ (toProjOrCoord).x !== 'undefined' || Array.isArray(toProjOrCoord)) {\n    coord = /** @type {T} */ (/** @type {?} */ (toProjOrCoord));\n    toProj = checkProj(fromProjOrToProj);\n    fromProj = wgs84;\n    single = true;\n  }\n  if (!fromProj) {\n    fromProj = checkProj(fromProjOrToProj);\n  }\n  if (!toProj) {\n    toProj = checkProj(/** @type {string | PROJJSONDefinition | proj } */ (toProjOrCoord));\n  }\n  if (coord) {\n    return transformer(fromProj, toProj, coord);\n  } else {\n    obj = {\n      /**\n       * @template {TemplateCoordinates} T\n       * @param {T} coords\n       * @param {boolean=} enforceAxis\n       * @returns {T}\n       */\n      forward: function (coords, enforceAxis) {\n        return transformer(fromProj, toProj, coords, enforceAxis);\n      },\n      /**\n       * @template {TemplateCoordinates} T\n       * @param {T} coords\n       * @param {boolean=} enforceAxis\n       * @returns {T}\n       */\n      inverse: function (coords, enforceAxis) {\n        return transformer(toProj, fromProj, coords, enforceAxis);\n      }\n    };\n    if (single) {\n      obj.oProj = toProj;\n    }\n    return obj;\n  }\n}\n\nexport default proj4;\n"],"names":["wgs84","proj","transformer","from","to","coords","enforceAxis","out","geocent","keys","transformInternal","toPoint","key","checkProj","item","proj4","fromProjOrToProj","toProjOrCoord","coord","fromProj","toProj","single","obj"],"mappings":";;;AAGA,IAAIA,IAAQC,EAAK,OAAO;AAiFxB,SAASC,EAAYC,GAAMC,GAAIC,GAAQC,GAAa;AAClD,MAAIC,GAAKC,GAASC;AAClB,SAAI,MAAM,QAAQJ,CAAM,KACtBE,IAAMG,EAAkBP,GAAMC,GAAIO,EAAQN,CAAM,GAAGC,CAAW,KAAK,EAAE,GAAG,KAAK,GAAG,IAAA,GAC5ED,EAAO,SAAS,KAClBG,IAAW,OAAOL,EAAK,OAAS,OAAeA,EAAK,SAAS,aAAe,OAAOC,EAAG,OAAS,OAAeA,EAAG,SAAS,WACtHI,IACE,OAAOD,EAAI,KAAM;AAAA;AAAA,IACM,CAACA,EAAI,GAAGA,EAAI,GAAGA,EAAI,CAAC,EAAE,OAAOF,EAAO,MAAM,CAAC,CAAC;AAAA;AAAA;AAAA,IAE9C,CAACE,EAAI,GAAGA,EAAI,GAAGF,EAAO,CAAC,CAAC,EAAE,OAAOA,EAAO,MAAM,CAAC,CAAC;AAAA,MAEvEC,KAAe,OAAOC,EAAI,KAAM;AAAA;AAAA,IACT,CAACA,EAAI,GAAGA,EAAI,GAAGA,EAAI,CAAC,EAAE,OAAOF,EAAO,MAAM,CAAC,CAAC;AAAA;AAAA;AAAA,IAE9C,CAACE,EAAI,GAAGA,EAAI,CAAC,EAAE,OAAOF,EAAO,MAAM,CAAC,CAAC;AAAA;AAAA;AAAA,IAEvC,CAACE,EAAI,GAAGA,EAAI,CAAC;AAAA,QAEtCA,IAAMG,EAAkBP,GAAMC,GAAI,EAAE,GAAGC,EAAO,GAAG,GAAGA,EAAO,GAAG,GAAGA,EAAO,GAAG,GAAGA,EAAO,EAAA,GAAKC,CAAW,KAAK,EAAE,GAAG,KAAK,GAAG,IAAA,GACvHG,IAAO,OAAO,KAAKJ,CAAM,GACrBI,EAAK,WAAW,MAGpBD,IAAW,OAAOL,EAAK,OAAS,OAAeA,EAAK,SAAS,aAAe,OAAOC,EAAG,OAAS,OAAeA,EAAG,SAAS,WAC1HK,EAAK,QAAQ,SAAUG,GAAK;AAC1B,IAAIA,MAAQ,OAAOA,MAAQ,OAGvBA,MAAQ,QAAQJ,KAAWF,OAG/BC,EAAIK,CAAG,IAAIP,EAAOO,CAAG;AAAA,EACvB,CAAC;AAAA,EACwBL;AAE7B;AAMA,SAASM,EAAUC,GAAM;AACvB,SAAIA,aAAgBb,IACXa,IAEL,OAAOA,KAAS,YAAY,WAAWA,IAClCA,EAAK,QAEPb;AAAAA;AAAAA,IAAiDa;AAAA,EAAA;AAC1D;AAmCA,SAASC,EAAMC,GAAkBC,GAAeC,GAAO;AAErD,MAAIC,GAEAC,GACAC,IAAS,IAETC;AAiBJ,SAhBI,OAAOL,IAAkB,OAC3BG,IAASP,EAAUG,CAAgB,GACnCG,IAAWnB,GACXqB,IAAS,OACA;AAAA,EAAyBJ,EAAe,IAAM,OAAe,MAAM,QAAQA,CAAa,OACjGC;AAAA;AAAA,EAA4CD,GAC5CG,IAASP,EAAUG,CAAgB,GACnCG,IAAWnB,GACXqB,IAAS,KAENF,MACHA,IAAWN,EAAUG,CAAgB,IAElCI,MACHA,IAASP;AAAA;AAAA,IAA8DI;AAAA,EAAA,IAErEC,IACKhB,EAAYiB,GAAUC,GAAQF,CAAK,KAE1CI,IAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOJ,SAAS,SAAUjB,GAAQC,GAAa;AACtC,aAAOJ,EAAYiB,GAAUC,GAAQf,GAAQC,CAAW;AAAA,IAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAOA,SAAS,SAAUD,GAAQC,GAAa;AACtC,aAAOJ,EAAYkB,GAAQD,GAAUd,GAAQC,CAAW;AAAA,IAC1D;AAAA,EAAA,GAEEe,MACFC,EAAI,QAAQF,IAEPE;AAEX;","x_google_ignoreList":[0]}

package/dist/index.es338.js

@@ -0,0 +1,47 @@
+import d from "./index.es360.js";
+import p from "./index.es361.js";
+import f from "./index.es362.js";
+import { sphere as l, eccentricity as j } from "./index.es363.js";
+import c from "./index.es364.js";
+import g from "./index.es365.js";
+import v from "./index.es366.js";
+import { getNadgrids as w } from "./index.es342.js";
+function o(a, r) {
+  if (!(this instanceof o))
+    return new o(a);
+  this.forward = null, this.inverse = null, this.init = null, this.name, this.axis, this.names = null, this.title, r = r || function(m) {
+    if (m)
+      throw m;
+  };
+  var t = d(a);
+  if (typeof t != "object") {
+    r("Could not parse to valid json: " + a);
+    return;
+  }
+  var n = o.projections.get(t.projName);
+  if (!n) {
+    r("Could not get projection name from: " + a);
+    return;
+  }
+  if (t.datumCode && t.datumCode !== "none") {
+    var e = v(c, t.datumCode);
+    e && (t.datum_params = t.datum_params || (e.towgs84 ? e.towgs84.split(",") : null), t.ellps = e.ellipse, t.datumName = e.datumName ? e.datumName : t.datumCode);
+  }
+  t.k0 = t.k0 || 1, t.axis = t.axis || "enu", t.ellps = t.ellps || "wgs84", t.lat1 = t.lat1 || t.lat0;
+  var i = l(t.a, t.b, t.rf, t.ellps, t.sphere), s = j(i.a, i.b, i.rf, t.R_A), h = w(t.nadgrids), u = t.datum || g(
+    t.datumCode,
+    t.datum_params,
+    i.a,
+    i.b,
+    s.es,
+    s.ep2,
+    h
+  );
+  p(this, t), p(this, n), this.a = i.a, this.b = i.b, this.rf = i.rf, this.sphere = i.sphere, this.es = s.es, this.e = s.e, this.ep2 = s.ep2, this.datum = u, "init" in this && typeof this.init == "function" && this.init(), r(null, this);
+}
+o.projections = f;
+o.projections.start();
+export {
+  o as default
+};
+//# sourceMappingURL=index.es338.js.map

package/dist/index.es338.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es338.js","sources":["../../../node_modules/proj4/lib/Proj.js"],"sourcesContent":["import parseCode from './parseCode';\nimport extend from './extend';\nimport projections from './projections';\nimport { sphere as dc_sphere, eccentricity as dc_eccentricity } from './deriveConstants';\nimport Datum from './constants/Datum';\nimport datum from './datum';\nimport match from './match';\nimport { getNadgrids } from './nadgrid';\n\n/**\n * @typedef {Object} DatumDefinition\n * @property {number} datum_type - The type of datum.\n * @property {number} a - Semi-major axis of the ellipsoid.\n * @property {number} b - Semi-minor axis of the ellipsoid.\n * @property {number} es - Eccentricity squared of the ellipsoid.\n * @property {number} ep2 - Second eccentricity squared of the ellipsoid.\n */\n\n/**\n * @param {string | import('./core').PROJJSONDefinition | import('./defs').ProjectionDefinition} srsCode\n * @param {(errorMessage?: string, instance?: Projection) => void} [callback]\n */\nfunction Projection(srsCode, callback) {\n  if (!(this instanceof Projection)) {\n    return new Projection(srsCode);\n  }\n  /** @type {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} */\n  this.forward = null;\n  /** @type {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} */\n  this.inverse = null;\n  /** @type {function(): void} */\n  this.init = null;\n  /** @type {string} */\n  this.name;\n  /** @type {string} */\n  this.axis;\n  /** @type {Array<string>} */\n  this.names = null;\n  /** @type {string} */\n  this.title;\n  callback = callback || function (error) {\n    if (error) {\n      throw error;\n    }\n  };\n  var json = parseCode(srsCode);\n  if (typeof json !== 'object') {\n    callback('Could not parse to valid json: ' + srsCode);\n    return;\n  }\n  var ourProj = Projection.projections.get(json.projName);\n  if (!ourProj) {\n    callback('Could not get projection name from: ' + srsCode);\n    return;\n  }\n  if (json.datumCode && json.datumCode !== 'none') {\n    var datumDef = match(Datum, json.datumCode);\n    if (datumDef) {\n      json.datum_params = json.datum_params || (datumDef.towgs84 ? datumDef.towgs84.split(',') : null);\n      json.ellps = datumDef.ellipse;\n      json.datumName = datumDef.datumName ? datumDef.datumName : json.datumCode;\n    }\n  }\n  json.k0 = json.k0 || 1.0;\n  json.axis = json.axis || 'enu';\n  json.ellps = json.ellps || 'wgs84';\n  json.lat1 = json.lat1 || json.lat0; // Lambert_Conformal_Conic_1SP, for example, needs this\n\n  var sphere_ = dc_sphere(json.a, json.b, json.rf, json.ellps, json.sphere);\n  var ecc = dc_eccentricity(sphere_.a, sphere_.b, sphere_.rf, json.R_A);\n  var nadgrids = getNadgrids(json.nadgrids);\n  /** @type {DatumDefinition} */\n  var datumObj = json.datum || datum(json.datumCode, json.datum_params, sphere_.a, sphere_.b, ecc.es, ecc.ep2,\n    nadgrids);\n\n  extend(this, json); // transfer everything over from the projection because we don't know what we'll need\n  extend(this, ourProj); // transfer all the methods from the projection\n\n  // copy the 4 things over we calculated in deriveConstants.sphere\n  this.a = sphere_.a;\n  this.b = sphere_.b;\n  this.rf = sphere_.rf;\n  this.sphere = sphere_.sphere;\n\n  // copy the 3 things we calculated in deriveConstants.eccentricity\n  this.es = ecc.es;\n  this.e = ecc.e;\n  this.ep2 = ecc.ep2;\n\n  // add in the datum object\n  this.datum = datumObj;\n\n  // init the projection\n  if ('init' in this && typeof this.init === 'function') {\n    this.init();\n  }\n\n  // legecy callback from back in the day when it went to spatialreference.org\n  callback(null, this);\n}\nProjection.projections = projections;\nProjection.projections.start();\nexport default Projection;\n"],"names":["Projection","srsCode","callback","error","json","parseCode","ourProj","datumDef","match","Datum","sphere_","dc_sphere","ecc","dc_eccentricity","nadgrids","getNadgrids","datumObj","datum","extend","projections"],"mappings":";;;;;;;;AAsBA,SAASA,EAAWC,GAASC,GAAU;AACrC,MAAI,EAAE,gBAAgBF;AACpB,WAAO,IAAIA,EAAWC,CAAO;AAG/B,OAAK,UAAU,MAEf,KAAK,UAAU,MAEf,KAAK,OAAO,MAEZ,KAAK,MAEL,KAAK,MAEL,KAAK,QAAQ,MAEb,KAAK,OACLC,IAAWA,KAAY,SAAUC,GAAO;AACtC,QAAIA;AACF,YAAMA;AAAA,EAEV;AACA,MAAIC,IAAOC,EAAUJ,CAAO;AAC5B,MAAI,OAAOG,KAAS,UAAU;AAC5B,IAAAF,EAAS,oCAAoCD,CAAO;AACpD;AAAA,EACF;AACA,MAAIK,IAAUN,EAAW,YAAY,IAAII,EAAK,QAAQ;AACtD,MAAI,CAACE,GAAS;AACZ,IAAAJ,EAAS,yCAAyCD,CAAO;AACzD;AAAA,EACF;AACA,MAAIG,EAAK,aAAaA,EAAK,cAAc,QAAQ;AAC/C,QAAIG,IAAWC,EAAMC,GAAOL,EAAK,SAAS;AAC1C,IAAIG,MACFH,EAAK,eAAeA,EAAK,iBAAiBG,EAAS,UAAUA,EAAS,QAAQ,MAAM,GAAG,IAAI,OAC3FH,EAAK,QAAQG,EAAS,SACtBH,EAAK,YAAYG,EAAS,YAAYA,EAAS,YAAYH,EAAK;AAAA,EAEpE;AACA,EAAAA,EAAK,KAAKA,EAAK,MAAM,GACrBA,EAAK,OAAOA,EAAK,QAAQ,OACzBA,EAAK,QAAQA,EAAK,SAAS,SAC3BA,EAAK,OAAOA,EAAK,QAAQA,EAAK;AAE9B,MAAIM,IAAUC,EAAUP,EAAK,GAAGA,EAAK,GAAGA,EAAK,IAAIA,EAAK,OAAOA,EAAK,MAAM,GACpEQ,IAAMC,EAAgBH,EAAQ,GAAGA,EAAQ,GAAGA,EAAQ,IAAIN,EAAK,GAAG,GAChEU,IAAWC,EAAYX,EAAK,QAAQ,GAEpCY,IAAWZ,EAAK,SAASa;AAAA,IAAMb,EAAK;AAAA,IAAWA,EAAK;AAAA,IAAcM,EAAQ;AAAA,IAAGA,EAAQ;AAAA,IAAGE,EAAI;AAAA,IAAIA,EAAI;AAAA,IACtGE;AAAA,EAAA;AAEF,EAAAI,EAAO,MAAMd,CAAI,GACjBc,EAAO,MAAMZ,CAAO,GAGpB,KAAK,IAAII,EAAQ,GACjB,KAAK,IAAIA,EAAQ,GACjB,KAAK,KAAKA,EAAQ,IAClB,KAAK,SAASA,EAAQ,QAGtB,KAAK,KAAKE,EAAI,IACd,KAAK,IAAIA,EAAI,GACb,KAAK,MAAMA,EAAI,KAGf,KAAK,QAAQI,GAGT,UAAU,QAAQ,OAAO,KAAK,QAAS,cACzC,KAAK,KAAA,GAIPd,EAAS,MAAM,IAAI;AACrB;AACAF,EAAW,cAAcmB;AACzBnB,EAAW,YAAY,MAAA;","x_google_ignoreList":[0]}

package/dist/index.es339.js

@@ -0,0 +1,25 @@
+import { toPoint as r, forward as n } from "./index.es344.js";
+function i(t, e, s) {
+  if (!(this instanceof i))
+    return new i(t, e, s);
+  if (Array.isArray(t))
+    this.x = t[0], this.y = t[1], this.z = t[2] || 0;
+  else if (typeof t == "object")
+    this.x = t.x, this.y = t.y, this.z = t.z || 0;
+  else if (typeof t == "string" && typeof e > "u") {
+    var o = t.split(",");
+    this.x = parseFloat(o[0]), this.y = parseFloat(o[1]), this.z = parseFloat(o[2]) || 0;
+  } else
+    this.x = t, this.y = e, this.z = s || 0;
+  console.warn("proj4.Point will be removed in version 3, use proj4.toPoint");
+}
+i.fromMGRS = function(t) {
+  return new i(r(t));
+};
+i.prototype.toMGRS = function(t) {
+  return n([this.x, this.y], t);
+};
+export {
+  i as default
+};
+//# sourceMappingURL=index.es339.js.map

package/dist/index.es339.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es339.js","sources":["../../../node_modules/proj4/lib/Point.js"],"sourcesContent":["import { toPoint, forward } from 'mgrs';\n\n/**\n * @deprecated v3.0.0 - use proj4.toPoint instead\n * @param {number | import('./core').TemplateCoordinates | string} x\n * @param {number} [y]\n * @param {number} [z]\n */\nfunction Point(x, y, z) {\n  if (!(this instanceof Point)) {\n    return new Point(x, y, z);\n  }\n  if (Array.isArray(x)) {\n    this.x = x[0];\n    this.y = x[1];\n    this.z = x[2] || 0.0;\n  } else if (typeof x === 'object') {\n    this.x = x.x;\n    this.y = x.y;\n    this.z = x.z || 0.0;\n  } else if (typeof x === 'string' && typeof y === 'undefined') {\n    var coords = x.split(',');\n    this.x = parseFloat(coords[0]);\n    this.y = parseFloat(coords[1]);\n    this.z = parseFloat(coords[2]) || 0.0;\n  } else {\n    this.x = x;\n    this.y = y;\n    this.z = z || 0.0;\n  }\n  console.warn('proj4.Point will be removed in version 3, use proj4.toPoint');\n}\n\nPoint.fromMGRS = function (mgrsStr) {\n  return new Point(toPoint(mgrsStr));\n};\nPoint.prototype.toMGRS = function (accuracy) {\n  return forward([this.x, this.y], accuracy);\n};\nexport default Point;\n"],"names":["Point","x","y","z","coords","mgrsStr","toPoint","accuracy","forward"],"mappings":";AAQA,SAASA,EAAMC,GAAGC,GAAGC,GAAG;AACtB,MAAI,EAAE,gBAAgBH;AACpB,WAAO,IAAIA,EAAMC,GAAGC,GAAGC,CAAC;AAE1B,MAAI,MAAM,QAAQF,CAAC;AACjB,SAAK,IAAIA,EAAE,CAAC,GACZ,KAAK,IAAIA,EAAE,CAAC,GACZ,KAAK,IAAIA,EAAE,CAAC,KAAK;AAAA,WACR,OAAOA,KAAM;AACtB,SAAK,IAAIA,EAAE,GACX,KAAK,IAAIA,EAAE,GACX,KAAK,IAAIA,EAAE,KAAK;AAAA,WACP,OAAOA,KAAM,YAAY,OAAOC,IAAM,KAAa;AAC5D,QAAIE,IAASH,EAAE,MAAM,GAAG;AACxB,SAAK,IAAI,WAAWG,EAAO,CAAC,CAAC,GAC7B,KAAK,IAAI,WAAWA,EAAO,CAAC,CAAC,GAC7B,KAAK,IAAI,WAAWA,EAAO,CAAC,CAAC,KAAK;AAAA,EACpC;AACE,SAAK,IAAIH,GACT,KAAK,IAAIC,GACT,KAAK,IAAIC,KAAK;AAEhB,UAAQ,KAAK,6DAA6D;AAC5E;AAEAH,EAAM,WAAW,SAAUK,GAAS;AAClC,SAAO,IAAIL,EAAMM,EAAQD,CAAO,CAAC;AACnC;AACAL,EAAM,UAAU,SAAS,SAAUO,GAAU;AAC3C,SAAOC,EAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,GAAGD,CAAQ;AAC3C;","x_google_ignoreList":[0]}

package/dist/index.es34.js

@@ -1,5 +1,5 @@
-import { GenIcon as a } from "./index.es88.js";
-import "./index.es89.js";
+import { GenIcon as a } from "./index.es85.js";
+import "./index.es86.js";
 function l(t) {
   return a({ attr: { fill: "currentColor", viewBox: "0 0 16 16" }, child: [{ tag: "path", attr: { d: "m14.12 10.163 1.715.858c.22.11.22.424 0 .534L8.267 15.34a.6.6 0 0 1-.534 0L.165 11.555a.299.299 0 0 1 0-.534l1.716-.858 5.317 2.659c.505.252 1.1.252 1.604 0l5.317-2.66zM7.733.063a.6.6 0 0 1 .534 0l7.568 3.784a.3.3 0 0 1 0 .535L8.267 8.165a.6.6 0 0 1-.534 0L.165 4.382a.299.299 0 0 1 0-.535z" }, child: [] }, { tag: "path", attr: { d: "m14.12 6.576 1.715.858c.22.11.22.424 0 .534l-7.568 3.784a.6.6 0 0 1-.534 0L.165 7.968a.299.299 0 0 1 0-.534l1.716-.858 5.317 2.659c.505.252 1.1.252 1.604 0z" }, child: [] }] })(t);
 }

package/dist/index.es340.js

@@ -0,0 +1,11 @@
+function e(t) {
+  var n = {
+    x: t[0],
+    y: t[1]
+  };
+  return t.length > 2 && (n.z = t[2]), t.length > 3 && (n.m = t[3]), n;
+}
+export {
+  e as default
+};
+//# sourceMappingURL=index.es340.js.map

package/dist/index.es340.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es340.js","sources":["../../../node_modules/proj4/lib/common/toPoint.js"],"sourcesContent":["/**\n * @param {Array<number>} array\n * @returns {import(\"../core\").InterfaceCoordinates}\n */\nexport default function (array) {\n  var out = {\n    x: array[0],\n    y: array[1]\n  };\n  if (array.length > 2) {\n    out.z = array[2];\n  }\n  if (array.length > 3) {\n    out.m = array[3];\n  }\n  return out;\n}\n"],"names":["common","array","out"],"mappings":"AAIA,SAAAA,EAAyBC,GAAO;AAC9B,MAAIC,IAAM;AAAA,IACR,GAAGD,EAAM,CAAC;AAAA,IACV,GAAGA,EAAM,CAAC;AAAA,EAAA;AAEZ,SAAIA,EAAM,SAAS,MACjBC,EAAI,IAAID,EAAM,CAAC,IAEbA,EAAM,SAAS,MACjBC,EAAI,IAAID,EAAM,CAAC,IAEVC;AACT;","x_google_ignoreList":[0]}

package/dist/index.es341.js

@@ -0,0 +1,40 @@
+import o from "./index.es367.js";
+import f from "./index.es368.js";
+import e from "./index.es369.js";
+function t(r) {
+  var l = this;
+  if (arguments.length === 2) {
+    var i = arguments[1];
+    typeof i == "string" ? i.charAt(0) === "+" ? t[
+      /** @type {string} */
+      r
+    ] = f(arguments[1]) : t[
+      /** @type {string} */
+      r
+    ] = e(arguments[1]) : i && typeof i == "object" && !("projName" in i) ? t[
+      /** @type {string} */
+      r
+    ] = e(arguments[1]) : (t[
+      /** @type {string} */
+      r
+    ] = i, i || delete t[
+      /** @type {string} */
+      r
+    ]);
+  } else if (arguments.length === 1) {
+    if (Array.isArray(r))
+      return r.map(function(s) {
+        return Array.isArray(s) ? t.apply(l, s) : t(s);
+      });
+    if (typeof r == "string") {
+      if (r in t)
+        return t[r];
+    } else "EPSG" in r ? t["EPSG:" + r.EPSG] = r : "ESRI" in r ? t["ESRI:" + r.ESRI] = r : "IAU2000" in r ? t["IAU2000:" + r.IAU2000] = r : console.log(r);
+    return;
+  }
+}
+o(t);
+export {
+  t as default
+};
+//# sourceMappingURL=index.es341.js.map

package/dist/index.es341.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es341.js","sources":["../../../node_modules/proj4/lib/defs.js"],"sourcesContent":["import globals from './global';\nimport parseProj from './projString';\nimport wkt from 'wkt-parser';\n\n/**\n * @typedef {Object} ProjectionDefinition\n * @property {string} title\n * @property {string} [projName]\n * @property {string} [ellps]\n * @property {import('./Proj.js').DatumDefinition} [datum]\n * @property {string} [datumName]\n * @property {number} [rf]\n * @property {number} [lat0]\n * @property {number} [lat1]\n * @property {number} [lat2]\n * @property {number} [lat_ts]\n * @property {number} [long0]\n * @property {number} [long1]\n * @property {number} [long2]\n * @property {number} [alpha]\n * @property {number} [longc]\n * @property {number} [x0]\n * @property {number} [y0]\n * @property {number} [k0]\n * @property {number} [a]\n * @property {number} [b]\n * @property {true} [R_A]\n * @property {number} [zone]\n * @property {true} [utmSouth]\n * @property {string|Array<number>} [datum_params]\n * @property {number} [to_meter]\n * @property {string} [units]\n * @property {number} [from_greenwich]\n * @property {string} [datumCode]\n * @property {string} [nadgrids]\n * @property {string} [axis]\n * @property {boolean} [sphere]\n * @property {number} [rectified_grid_angle]\n * @property {boolean} [approx]\n * @property {boolean} [over]\n * @property {string} [projStr]\n * @property {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} inverse\n * @property {<T extends import('./core').TemplateCoordinates>(coordinates: T, enforceAxis?: boolean) => T} forward\n */\n\n/**\n * @overload\n * @param {string} name\n * @param {string|ProjectionDefinition|import('./core.js').PROJJSONDefinition} projection\n * @returns {void}\n */\n/**\n * @overload\n * @param {Array<[string, string]>} name\n * @returns {Array<ProjectionDefinition|undefined>}\n */\n/**\n * @overload\n * @param {string} name\n * @returns {ProjectionDefinition}\n */\n\n/**\n * @param {string | Array<Array<string>> | Partial<Record<'EPSG'|'ESRI'|'IAU2000', ProjectionDefinition>>} name\n * @returns {ProjectionDefinition | Array<ProjectionDefinition|undefined> | void}\n */\nfunction defs(name) {\n  /* global console */\n  var that = this;\n  if (arguments.length === 2) {\n    var def = arguments[1];\n    if (typeof def === 'string') {\n      if (def.charAt(0) === '+') {\n        defs[/** @type {string} */ (name)] = parseProj(arguments[1]);\n      } else {\n        defs[/** @type {string} */ (name)] = wkt(arguments[1]);\n      }\n    } else if (def && typeof def === 'object' && !('projName' in def)) {\n      // PROJJSON\n      defs[/** @type {string} */ (name)] = wkt(arguments[1]);\n    } else {\n      defs[/** @type {string} */ (name)] = def;\n      if (!def) {\n        delete defs[/** @type {string} */ (name)];\n      }\n    }\n  } else if (arguments.length === 1) {\n    if (Array.isArray(name)) {\n      return name.map(function (v) {\n        if (Array.isArray(v)) {\n          return defs.apply(that, v);\n        } else {\n          return defs(v);\n        }\n      });\n    } else if (typeof name === 'string') {\n      if (name in defs) {\n        return defs[name];\n      }\n    } else if ('EPSG' in name) {\n      defs['EPSG:' + name.EPSG] = name;\n    } else if ('ESRI' in name) {\n      defs['ESRI:' + name.ESRI] = name;\n    } else if ('IAU2000' in name) {\n      defs['IAU2000:' + name.IAU2000] = name;\n    } else {\n      console.log(name);\n    }\n    return;\n  }\n}\nglobals(defs);\nexport default defs;\n"],"names":["defs","name","that","def","parseProj","wkt","v","globals"],"mappings":";;;AAkEA,SAASA,EAAKC,GAAM;AAElB,MAAIC,IAAO;AACX,MAAI,UAAU,WAAW,GAAG;AAC1B,QAAIC,IAAM,UAAU,CAAC;AACrB,IAAI,OAAOA,KAAQ,WACbA,EAAI,OAAO,CAAC,MAAM,MACpBH;AAAA;AAAA,MAA4BC;AAAA,IAAA,IAASG,EAAU,UAAU,CAAC,CAAC,IAE3DJ;AAAA;AAAA,MAA4BC;AAAA,IAAA,IAASI,EAAI,UAAU,CAAC,CAAC,IAE9CF,KAAO,OAAOA,KAAQ,YAAY,EAAE,cAAcA,KAE3DH;AAAA;AAAA,MAA4BC;AAAA,IAAA,IAASI,EAAI,UAAU,CAAC,CAAC,KAErDL;AAAA;AAAA,MAA4BC;AAAA,IAAA,IAASE,GAChCA,KACH,OAAOH;AAAA;AAAA,MAA4BC;AAAA,IAAA;AAAA,EAGzC,WAAW,UAAU,WAAW,GAAG;AACjC,QAAI,MAAM,QAAQA,CAAI;AACpB,aAAOA,EAAK,IAAI,SAAUK,GAAG;AAC3B,eAAI,MAAM,QAAQA,CAAC,IACVN,EAAK,MAAME,GAAMI,CAAC,IAElBN,EAAKM,CAAC;AAAA,MAEjB,CAAC;AACH,QAAW,OAAOL,KAAS;AACzB,UAAIA,KAAQD;AACV,eAAOA,EAAKC,CAAI;AAAA,UAEpB,CAAW,UAAUA,IACnBD,EAAK,UAAUC,EAAK,IAAI,IAAIA,IACnB,UAAUA,IACnBD,EAAK,UAAUC,EAAK,IAAI,IAAIA,IACnB,aAAaA,IACtBD,EAAK,aAAaC,EAAK,OAAO,IAAIA,IAElC,QAAQ,IAAIA,CAAI;AAElB;AAAA,EACF;AACF;AACAM,EAAQP,CAAI;","x_google_ignoreList":[0]}