@agrotools1/at-components 0.2.1 → 0.2.3

package/dist/Octree-78797046.js

@@ -0,0 +1,495 @@
+import { bp as w, bo as C, gd as ft, ge as Tt, fg as mt, b9 as E, aQ as Ot, bH as $, br as Y, bm as tt, gc as Rt, bg as m } from "./index-01c737ed.js";
+import { s as at } from "./ObjectStack-10d91171.js";
+import { z as pt } from "./vec42-36edeb73.js";
+import { r as M } from "./vec4f64-043e974c.js";
+import { d as et, k as bt, O as k, p as nt, Z as f, V as q, I as ot, w as P } from "./sphere-908cd9aa.js";
+import { E as b, A as At, f as Et, r as Ft, b as H, H as Nt } from "./plane-3398eec1.js";
+import { i as rt } from "./Util-002f5109.js";
+function X(o) {
+  return o ? { ray: et(o.ray), c0: o.c0, c1: o.c1 } : { ray: et(), c0: 0, c1: Number.MAX_VALUE };
+}
+function Ct(o, t = X()) {
+  return bt(o, t.ray), t.c0 = 0, t.c1 = Number.MAX_VALUE, t;
+}
+function kt(o, t) {
+  return dt(o, o.c0, t);
+}
+function qt(o, t) {
+  return dt(o, o.c1, t);
+}
+function dt(o, t, e) {
+  return w(e, o.ray.origin, C(e, o.ray.direction, t));
+}
+new at(() => X());
+function Kt(o) {
+  return o ? [b(o[0]), b(o[1]), b(o[2]), b(o[3]), b(o[4]), b(o[5])] : [b(), b(), b(), b(), b(), b()];
+}
+function gt() {
+  return [E(), E(), E(), E(), E(), E(), E(), E()];
+}
+function Wt(o, t) {
+  for (let e = 0; e < Q; e++)
+    At(o[e], t[e]);
+  return o;
+}
+function Vt(o, t, e, n = xt) {
+  const r = ft(Et.get(), t, o);
+  Tt(r, r);
+  for (let i = 0; i < St; ++i) {
+    const s = pt(Ft.get(), Bt[i], r);
+    mt(n[i], s[0] / s[3], s[1] / s[3], s[2] / s[3]);
+  }
+  Mt(e, n);
+}
+function Mt(o, t) {
+  H(t[h.FAR_BOTTOM_LEFT], t[h.NEAR_BOTTOM_LEFT], t[h.NEAR_TOP_LEFT], o[S.LEFT]), H(t[h.NEAR_BOTTOM_RIGHT], t[h.FAR_BOTTOM_RIGHT], t[h.FAR_TOP_RIGHT], o[S.RIGHT]), H(t[h.FAR_BOTTOM_LEFT], t[h.FAR_BOTTOM_RIGHT], t[h.NEAR_BOTTOM_RIGHT], o[S.BOTTOM]), H(t[h.NEAR_TOP_LEFT], t[h.NEAR_TOP_RIGHT], t[h.FAR_TOP_RIGHT], o[S.TOP]), H(t[h.NEAR_BOTTOM_LEFT], t[h.NEAR_BOTTOM_RIGHT], t[h.NEAR_TOP_RIGHT], o[S.NEAR]), H(t[h.FAR_BOTTOM_RIGHT], t[h.FAR_BOTTOM_LEFT], t[h.FAR_TOP_LEFT], o[S.FAR]);
+}
+function D(o, t) {
+  for (let e = 0; e < Q; e++) {
+    const n = o[e];
+    if (n[0] * t[0] + n[1] * t[1] + n[2] * t[2] + n[3] >= t[3])
+      return !1;
+  }
+  return !0;
+}
+function Jt(o, t) {
+  for (let e = 0; e < Q; e++) {
+    const n = o[e];
+    if (!Nt(n, t))
+      return !1;
+  }
+  return !0;
+}
+var S, h;
+(function(o) {
+  o[o.LEFT = 0] = "LEFT", o[o.RIGHT = 1] = "RIGHT", o[o.BOTTOM = 2] = "BOTTOM", o[o.TOP = 3] = "TOP", o[o.NEAR = 4] = "NEAR", o[o.FAR = 5] = "FAR";
+})(S || (S = {})), function(o) {
+  o[o.NEAR_BOTTOM_LEFT = 0] = "NEAR_BOTTOM_LEFT", o[o.NEAR_BOTTOM_RIGHT = 1] = "NEAR_BOTTOM_RIGHT", o[o.NEAR_TOP_RIGHT = 2] = "NEAR_TOP_RIGHT", o[o.NEAR_TOP_LEFT = 3] = "NEAR_TOP_LEFT", o[o.FAR_BOTTOM_LEFT = 4] = "FAR_BOTTOM_LEFT", o[o.FAR_BOTTOM_RIGHT = 5] = "FAR_BOTTOM_RIGHT", o[o.FAR_TOP_RIGHT = 6] = "FAR_TOP_RIGHT", o[o.FAR_TOP_LEFT = 7] = "FAR_TOP_LEFT";
+}(h || (h = {}));
+h.FAR_BOTTOM_RIGHT, h.NEAR_BOTTOM_RIGHT, h.NEAR_BOTTOM_LEFT, h.FAR_BOTTOM_LEFT, h.NEAR_BOTTOM_LEFT, h.NEAR_BOTTOM_RIGHT, h.NEAR_TOP_RIGHT, h.NEAR_TOP_LEFT, h.FAR_BOTTOM_RIGHT, h.FAR_BOTTOM_LEFT, h.FAR_TOP_LEFT, h.FAR_TOP_RIGHT, h.NEAR_BOTTOM_RIGHT, h.FAR_BOTTOM_RIGHT, h.FAR_TOP_RIGHT, h.NEAR_TOP_RIGHT, h.FAR_BOTTOM_LEFT, h.NEAR_BOTTOM_LEFT, h.NEAR_TOP_LEFT, h.FAR_TOP_LEFT, h.FAR_TOP_LEFT, h.NEAR_TOP_LEFT, h.NEAR_TOP_RIGHT, h.FAR_TOP_RIGHT;
+const Q = 6, St = 8, Bt = [M(-1, -1, -1, 1), M(1, -1, -1, 1), M(1, 1, -1, 1), M(-1, 1, -1, 1), M(-1, -1, 1, 1), M(1, -1, 1, 1), M(1, 1, 1, 1), M(-1, 1, 1, 1)];
+new at(X);
+const xt = gt();
+class I {
+  get bounds() {
+    return this._root.bounds;
+  }
+  get halfSize() {
+    return this._root.halfSize;
+  }
+  get root() {
+    return this._root.node;
+  }
+  get maximumObjectsPerNode() {
+    return this._maximumObjectsPerNode;
+  }
+  get maximumDepth() {
+    return this._maximumDepth;
+  }
+  get objectCount() {
+    return this._objectCount;
+  }
+  constructor(t, e) {
+    this.objectToBoundingSphere = t, this._maximumObjectsPerNode = 10, this._maximumDepth = 20, this._degenerateObjects = /* @__PURE__ */ new Set(), this._root = new l(), this._objectCount = 0, e && (e.maximumObjectsPerNode !== void 0 && (this._maximumObjectsPerNode = e.maximumObjectsPerNode), e.maximumDepth !== void 0 && (this._maximumDepth = e.maximumDepth));
+  }
+  destroy() {
+    this._degenerateObjects.clear(), l.clearPool(), U[0] = null, x.prune(), j.prune();
+  }
+  add(t, e = t.length) {
+    this._objectCount += e, this._grow(t, e);
+    const n = l.acquire();
+    for (let r = 0; r < e; r++) {
+      const i = t[r];
+      this._isDegenerate(i) ? this._degenerateObjects.add(i) : (n.init(this._root), this._add(i, n));
+    }
+    l.release(n);
+  }
+  remove(t, e = null) {
+    this._objectCount -= t.length;
+    const n = l.acquire();
+    for (const r of t) {
+      const i = e ?? k(this.objectToBoundingSphere(r), Lt);
+      G(i[3]) ? (n.init(this._root), this._remove(r, i, n)) : this._degenerateObjects.delete(r);
+    }
+    l.release(n), this._shrink();
+  }
+  update(t, e) {
+    if (!G(e[3]) && this._isDegenerate(t))
+      return;
+    const n = Pt(t);
+    this.remove(n, e), this.add(n);
+  }
+  forEachAlongRay(t, e, n) {
+    const r = nt(t, e);
+    this._forEachNode(this._root, (i) => {
+      if (!this._intersectsNode(r, i))
+        return !1;
+      const s = i.node;
+      return s.terminals.forAll((d) => {
+        this._intersectsObject(r, d) && n(d);
+      }), s.residents !== null && s.residents.forAll((d) => {
+        this._intersectsObject(r, d) && n(d);
+      }), !0;
+    });
+  }
+  forEachAlongRayWithVerticalOffset(t, e, n, r) {
+    const i = nt(t, e);
+    this._forEachNode(this._root, (s) => {
+      if (!this._intersectsNodeWithOffset(i, s, r))
+        return !1;
+      const d = s.node;
+      return d.terminals.forAll((a) => {
+        this._intersectsObjectWithOffset(i, a, r) && n(a);
+      }), d.residents !== null && d.residents.forAll((a) => {
+        this._intersectsObjectWithOffset(i, a, r) && n(a);
+      }), !0;
+    });
+  }
+  forEach(t) {
+    this._forEachNode(this._root, (e) => {
+      const n = e.node;
+      return n.terminals.forAll(t), n.residents !== null && n.residents.forAll(t), !0;
+    }), this._degenerateObjects.forEach(t);
+  }
+  forEachDegenerateObject(t) {
+    this._degenerateObjects.forEach(t);
+  }
+  findClosest(t, e, n, r = () => !0, i = 1 / 0) {
+    let s = 1 / 0, d = 1 / 0, a = null;
+    const c = K(t, e), T = (u) => {
+      if (--i, !r(u))
+        return;
+      const O = this.objectToBoundingSphere(u);
+      if (!D(n, O))
+        return;
+      const F = B(t, e, f(O)), L = F - O[3], _ = F + O[3];
+      L < s && (s = L, d = _, a = u);
+    };
+    return this._forEachNodeDepthOrdered(this._root, (u) => {
+      if (i <= 0 || !D(n, u.bounds) || (C(A, c, u.halfSize), w(A, A, f(u.bounds)), B(t, e, A) > d))
+        return !1;
+      const O = u.node;
+      return O.terminals.forAll((F) => T(F)), O.residents !== null && O.residents.forAll((F) => T(F)), !0;
+    }, t, e), a;
+  }
+  forEachInDepthRange(t, e, n, r, i, s, d) {
+    let a = -1 / 0, c = 1 / 0;
+    const T = { setRange: (_) => {
+      n === I.DepthOrder.FRONT_TO_BACK ? (a = Math.max(a, _.near), c = Math.min(c, _.far)) : (a = Math.max(a, -_.far), c = Math.min(c, -_.near));
+    } };
+    T.setRange(r);
+    const u = B(e, n, t), O = K(e, n), F = K(e, -n), L = (_) => {
+      if (!d(_))
+        return;
+      const g = this.objectToBoundingSphere(_), z = f(g), Z = B(e, n, z) - u, ct = Z - g[3], _t = Z + g[3];
+      ct > c || _t < a || !D(s, g) || i(_, T);
+    };
+    this._forEachNodeDepthOrdered(this._root, (_) => {
+      if (!D(s, _.bounds) || (C(A, O, _.halfSize), w(A, A, f(_.bounds)), B(e, n, A) - u > c) || (C(A, F, _.halfSize), w(A, A, f(_.bounds)), B(e, n, A) - u < a))
+        return !1;
+      const g = _.node;
+      return g.terminals.forAll((z) => L(z)), g.residents !== null && g.residents.forAll((z) => L(z)), !0;
+    }, e, n);
+  }
+  forEachNode(t) {
+    this._forEachNode(this._root, (e) => t(e.node, e.bounds, e.halfSize, e.depth));
+  }
+  forEachNeighbor(t, e) {
+    const n = q(e), r = f(e), i = (a) => {
+      const c = this.objectToBoundingSphere(a), T = q(c), u = n + T;
+      return !(Y(f(c), r) - u * u <= 0) || t(a);
+    };
+    let s = !0;
+    const d = (a) => {
+      s && (s = i(a));
+    };
+    this._forEachNode(this._root, (a) => {
+      const c = q(a.bounds), T = n + c;
+      if (Y(f(a.bounds), r) - T * T > 0)
+        return !1;
+      const u = a.node;
+      return u.terminals.forAll(d), s && u.residents !== null && u.residents.forAll(d), s;
+    }), s && this.forEachDegenerateObject(d);
+  }
+  _intersectsNode(t, e) {
+    return y(f(e.bounds), 2 * -e.halfSize, R), y(f(e.bounds), 2 * e.halfSize, p), rt(t.origin, t.direction, R, p);
+  }
+  _intersectsNodeWithOffset(t, e, n) {
+    return y(f(e.bounds), 2 * -e.halfSize, R), y(f(e.bounds), 2 * e.halfSize, p), n.applyToMinMax(R, p), rt(t.origin, t.direction, R, p);
+  }
+  _intersectsObject(t, e) {
+    const n = this.objectToBoundingSphere(e);
+    return !(n[3] > 0) || ot(n, t);
+  }
+  _intersectsObjectWithOffset(t, e, n) {
+    const r = this.objectToBoundingSphere(e);
+    return !(r[3] > 0) || ot(n.applyToBoundingSphere(r), t);
+  }
+  _forEachNode(t, e) {
+    let n = l.acquire().init(t);
+    const r = [n];
+    for (; r.length !== 0; ) {
+      if (n = r.pop(), e(n) && !n.isLeaf())
+        for (let i = 0; i < n.node.children.length; i++)
+          n.node.children[i] && r.push(l.acquire().init(n).advance(i));
+      l.release(n);
+    }
+  }
+  _forEachNodeDepthOrdered(t, e, n, r = I.DepthOrder.FRONT_TO_BACK) {
+    let i = l.acquire().init(t);
+    const s = [i];
+    for (Ht(n, r, ht); s.length !== 0; ) {
+      if (i = s.pop(), e(i) && !i.isLeaf())
+        for (let d = 7; d >= 0; --d) {
+          const a = ht[d];
+          i.node.children[a] && s.push(l.acquire().init(i).advance(a));
+        }
+      l.release(i);
+    }
+  }
+  _remove(t, e, n) {
+    x.clear();
+    const r = n.advanceTo(e, (i, s) => {
+      x.push(i.node), x.push(s);
+    }) ? n.node.terminals : n.node.residents;
+    if (r.removeUnordered(t), r.length === 0)
+      for (let i = x.length - 2; i >= 0; i -= 2) {
+        const s = x.data[i], d = x.data[i + 1];
+        if (!this._purge(s, d))
+          break;
+      }
+  }
+  _nodeIsEmpty(t) {
+    if (t.terminals.length !== 0)
+      return !1;
+    if (t.residents !== null)
+      return t.residents.length === 0;
+    for (let e = 0; e < t.children.length; e++)
+      if (t.children[e])
+        return !1;
+    return !0;
+  }
+  _purge(t, e) {
+    return e >= 0 && (t.children[e] = null), !!this._nodeIsEmpty(t) && (t.residents === null && (t.residents = new $({ shrink: !0 })), !0);
+  }
+  _add(t, e) {
+    e.advanceTo(this.objectToBoundingSphere(t)) ? e.node.terminals.push(t) : (e.node.residents.push(t), e.node.residents.length > this._maximumObjectsPerNode && e.depth < this._maximumDepth && this._split(e));
+  }
+  _split(t) {
+    const e = t.node.residents;
+    t.node.residents = null;
+    for (let n = 0; n < e.length; n++) {
+      const r = l.acquire().init(t);
+      this._add(e.at(n), r), l.release(r);
+    }
+  }
+  _grow(t, e) {
+    if (e !== 0 && (it(t, e, (n) => this.objectToBoundingSphere(n), N), G(N[3]) && !this._fitsInsideTree(N)))
+      if (this._nodeIsEmpty(this._root.node))
+        k(N, this._root.bounds), this._root.halfSize = 1.25 * this._root.bounds[3], this._root.updateBoundsRadiusFromHalfSize();
+      else {
+        const n = this._rootBoundsForRootAsSubNode(N);
+        this._placingRootViolatesMaxDepth(n) ? this._rebuildTree(N, n) : this._growRootAsSubNode(n), l.release(n);
+      }
+  }
+  _rebuildTree(t, e) {
+    tt(f(V), f(e.bounds)), V[3] = e.halfSize, it([t, V], 2, (r) => r, J);
+    const n = l.acquire().init(this._root);
+    this._root.initFrom(null, J, J[3]), this._root.increaseHalfSize(1.25), this._forEachNode(n, (r) => (this.add(r.node.terminals.data, r.node.terminals.length), r.node.residents !== null && this.add(r.node.residents.data, r.node.residents.length), !0)), l.release(n);
+  }
+  _placingRootViolatesMaxDepth(t) {
+    const e = Math.log(t.halfSize / this._root.halfSize) * Math.LOG2E;
+    let n = 0;
+    return this._forEachNode(this._root, (r) => (n = Math.max(n, r.depth), n + e <= this._maximumDepth)), n + e > this._maximumDepth;
+  }
+  _rootBoundsForRootAsSubNode(t) {
+    const e = t[3], n = t;
+    let r = -1 / 0;
+    const i = this._root.bounds, s = this._root.halfSize;
+    for (let a = 0; a < 3; a++) {
+      const c = i[a] - s - (n[a] - e), T = n[a] + e - (i[a] + s), u = Math.max(0, Math.ceil(c / (2 * s))), O = Math.max(0, Math.ceil(T / (2 * s))) + 1, F = 2 ** Math.ceil(Math.log(u + O) * Math.LOG2E);
+      r = Math.max(r, F), v[a].min = u, v[a].max = O;
+    }
+    for (let a = 0; a < 3; a++) {
+      let c = v[a].min, T = v[a].max;
+      const u = (r - (c + T)) / 2;
+      c += Math.ceil(u), T += Math.floor(u);
+      const O = i[a] - s - c * s * 2;
+      W[a] = O + (T + c) * s;
+    }
+    const d = r * s;
+    return W[3] = d * ut, l.acquire().initFrom(null, W, d, 0);
+  }
+  _growRootAsSubNode(t) {
+    const e = this._root.node;
+    tt(f(N), f(this._root.bounds)), N[3] = this._root.halfSize, this._root.init(t), t.advanceTo(N, null, !0), t.node.children = e.children, t.node.residents = e.residents, t.node.terminals = e.terminals;
+  }
+  _shrink() {
+    for (; ; ) {
+      const t = this._findShrinkIndex();
+      if (t === -1)
+        break;
+      this._root.advance(t), this._root.depth = 0;
+    }
+  }
+  _findShrinkIndex() {
+    if (this._root.node.terminals.length !== 0 || this._root.isLeaf())
+      return -1;
+    let t = null;
+    const e = this._root.node.children;
+    let n = 0, r = 0;
+    for (; r < e.length && t == null; )
+      n = r++, t = e[n];
+    for (; r < e.length; )
+      if (e[r++])
+        return -1;
+    return n;
+  }
+  _isDegenerate(t) {
+    return !G(this.objectToBoundingSphere(t)[3]);
+  }
+  _fitsInsideTree(t) {
+    const e = this._root.bounds, n = this._root.halfSize;
+    return t[3] <= n && t[0] >= e[0] - n && t[0] <= e[0] + n && t[1] >= e[1] - n && t[1] <= e[1] + n && t[2] >= e[2] - n && t[2] <= e[2] + n;
+  }
+  toJSON() {
+    const { maximumDepth: t, maximumObjectsPerNode: e, _objectCount: n } = this, r = this._nodeToJSON(this._root.node);
+    return { maximumDepth: t, maximumObjectsPerNode: e, objectCount: n, root: { bounds: this._root.bounds, halfSize: this._root.halfSize, depth: this._root.depth, node: r } };
+  }
+  _nodeToJSON(t) {
+    var i, s;
+    const e = t.children.map((d) => d ? this._nodeToJSON(d) : null), n = (i = t.residents) == null ? void 0 : i.map((d) => this.objectToBoundingSphere(d)), r = (s = t.terminals) == null ? void 0 : s.map((d) => this.objectToBoundingSphere(d));
+    return { children: e, residents: n, terminals: r };
+  }
+  static fromJSON(t) {
+    const e = new I((n) => n, { maximumDepth: t.maximumDepth, maximumObjectsPerNode: t.maximumObjectsPerNode });
+    return e._objectCount = t.objectCount, e._root.initFrom(t.root.node, t.root.bounds, t.root.halfSize, t.root.depth), e;
+  }
+}
+class l {
+  constructor() {
+    this.bounds = P(), this.halfSize = 0, this.initFrom(null, null, 0, 0);
+  }
+  init(t) {
+    return this.initFrom(t.node, t.bounds, t.halfSize, t.depth);
+  }
+  initFrom(t, e, n, r = this.depth) {
+    return this.node = t ?? l.createEmptyNode(), e && k(e, this.bounds), this.halfSize = n, this.depth = r, this;
+  }
+  increaseHalfSize(t) {
+    this.halfSize *= t, this.updateBoundsRadiusFromHalfSize();
+  }
+  updateBoundsRadiusFromHalfSize() {
+    this.bounds[3] = this.halfSize * ut;
+  }
+  advance(t) {
+    let e = this.node.children[t];
+    e || (e = l.createEmptyNode(), this.node.children[t] = e), this.node = e, this.halfSize /= 2, this.depth++;
+    const n = lt[t];
+    return this.bounds[0] += n[0] * this.halfSize, this.bounds[1] += n[1] * this.halfSize, this.bounds[2] += n[2] * this.halfSize, this.updateBoundsRadiusFromHalfSize(), this;
+  }
+  advanceTo(t, e, n = !1) {
+    for (; ; ) {
+      if (this.isTerminalFor(t))
+        return e && e(this, -1), !0;
+      if (this.isLeaf()) {
+        if (!n)
+          return e && e(this, -1), !1;
+        this.node.residents = null;
+      }
+      const r = this._childIndex(t);
+      e && e(this, r), this.advance(r);
+    }
+  }
+  isLeaf() {
+    return this.node.residents != null;
+  }
+  isTerminalFor(t) {
+    return t[3] > this.halfSize / 2;
+  }
+  _childIndex(t) {
+    const e = this.bounds;
+    return (e[0] < t[0] ? 1 : 0) + (e[1] < t[1] ? 2 : 0) + (e[2] < t[2] ? 4 : 0);
+  }
+  static createEmptyNode() {
+    return { children: [null, null, null, null, null, null, null, null], terminals: new $({ shrink: !0 }), residents: new $({ shrink: !0 }) };
+  }
+  static acquire() {
+    return l._pool.acquire();
+  }
+  static release(t) {
+    l._pool.release(t);
+  }
+  static clearPool() {
+    l._pool.prune();
+  }
+}
+function jt(o, t) {
+  o[0] = Math.min(o[0], t[0] - t[3]), o[1] = Math.min(o[1], t[1] - t[3]), o[2] = Math.min(o[2], t[2] - t[3]);
+}
+function It(o, t) {
+  o[0] = Math.max(o[0], t[0] + t[3]), o[1] = Math.max(o[1], t[1] + t[3]), o[2] = Math.max(o[2], t[2] + t[3]);
+}
+function y(o, t, e) {
+  e[0] = o[0] + t, e[1] = o[1] + t, e[2] = o[2] + t;
+}
+function it(o, t, e, n) {
+  if (t === 1) {
+    const r = e(o[0]);
+    k(r, n);
+  } else {
+    R[0] = 1 / 0, R[1] = 1 / 0, R[2] = 1 / 0, p[0] = -1 / 0, p[1] = -1 / 0, p[2] = -1 / 0;
+    for (let r = 0; r < t; r++) {
+      const i = e(o[r]);
+      G(i[3]) && (jt(R, i), It(p, i));
+    }
+    Rt(f(n), R, p, 0.5), n[3] = Math.max(p[0] - R[0], p[1] - R[1], p[2] - R[2]) / 2;
+  }
+}
+function Ht(o, t, e) {
+  if (!j.length)
+    for (let n = 0; n < 8; ++n)
+      j.push({ index: 0, distance: 0 });
+  for (let n = 0; n < 8; ++n) {
+    const r = lt[n];
+    j.data[n].index = n, j.data[n].distance = B(o, t, r);
+  }
+  j.sort((n, r) => n.distance - r.distance);
+  for (let n = 0; n < 8; ++n)
+    e[n] = j.data[n].index;
+}
+function K(o, t) {
+  let e, n = 1 / 0;
+  for (let r = 0; r < 8; ++r) {
+    const i = B(o, t, st[r]);
+    i < n && (n = i, e = st[r]);
+  }
+  return e;
+}
+function B(o, t, e) {
+  return t * (o[0] * e[0] + o[1] * e[1] + o[2] * e[2]);
+}
+function G(o) {
+  return !isNaN(o) && o !== -1 / 0 && o !== 1 / 0 && o > 0;
+}
+l._pool = new Ot(l), function(o) {
+  var t;
+  (t = o.DepthOrder || (o.DepthOrder = {}))[t.FRONT_TO_BACK = 1] = "FRONT_TO_BACK", t[t.BACK_TO_FRONT = -1] = "BACK_TO_FRONT";
+}(I || (I = {}));
+const lt = [m(-1, -1, -1), m(1, -1, -1), m(-1, 1, -1), m(1, 1, -1), m(-1, -1, 1), m(1, -1, 1), m(-1, 1, 1), m(1, 1, 1)], st = [m(-1, -1, -1), m(-1, -1, 1), m(-1, 1, -1), m(-1, 1, 1), m(1, -1, -1), m(1, -1, 1), m(1, 1, -1), m(1, 1, 1)], ut = Math.sqrt(3), U = [null];
+function Pt(o) {
+  return U[0] = o, U;
+}
+const W = P(), A = E(), R = E(), p = E(), x = new $(), Lt = P(), N = P(), V = P(), J = P(), v = [{ min: 0, max: 0 }, { min: 0, max: 0 }, { min: 0, max: 0 }], j = new $(), ht = [0, 0, 0, 0, 0, 0, 0, 0], Ut = I;
+export {
+  Kt as H,
+  Vt as L,
+  Wt as N,
+  Ut as W,
+  X as a,
+  qt as g,
+  S as j,
+  Jt as m,
+  kt as p,
+  Ct as y
+};

package/dist/OpenStreetMapLayer-b0a17790.js

@@ -0,0 +1,30 @@
+import { e as t, y as r, bM as i, cZ as s, c as a, a$ as p, bR as l, eg as e, b3 as c } from "./index-01c737ed.js";
+import { I as u } from "./WebTileLayer-45c563ff.js";
+import "vue";
+import "./MultiOriginJSONSupport-bb258670.js";
+import "./BlendLayer-a792edf6.js";
+import "./jsonUtils-913fa1bd.js";
+import "./parser-0701286c.js";
+import "./OperationalLayer-55af27d6.js";
+import "./commonProperties-f9559903.js";
+import "./ElevationInfo-fad03d5e.js";
+import "./unitConversionUtils-f0ebaf75.js";
+import "./lengthUtils-695e744c.js";
+import "./PortalLayer-07b3c53e.js";
+import "./portalItemUtils-4c4caad0.js";
+import "./RefreshableLayer-9550b85a.js";
+import "./ScaleRangeLayer-7ddf00b4.js";
+import "./imageBitmapUtils-881d8c64.js";
+let o = class extends u {
+  constructor(...n) {
+    super(...n), this.portalItem = null, this.isReference = null, this.tileInfo = new s({ size: [256, 256], dpi: 96, format: "png8", compressionQuality: 0, origin: new p({ x: -20037508342787e-6, y: 20037508342787e-6, spatialReference: l.WebMercator }), spatialReference: l.WebMercator, lods: [new e({ level: 0, scale: 591657527591555e-6, resolution: 156543.033928 }), new e({ level: 1, scale: 295828763795777e-6, resolution: 78271.5169639999 }), new e({ level: 2, scale: 147914381897889e-6, resolution: 39135.7584820001 }), new e({ level: 3, scale: 73957190948944e-6, resolution: 19567.8792409999 }), new e({ level: 4, scale: 36978595474472e-6, resolution: 9783.93962049996 }), new e({ level: 5, scale: 18489297737236e-6, resolution: 4891.96981024998 }), new e({ level: 6, scale: 9244648868618e-6, resolution: 2445.98490512499 }), new e({ level: 7, scale: 4622324434309e-6, resolution: 1222.99245256249 }), new e({ level: 8, scale: 2311162217155e-6, resolution: 611.49622628138 }), new e({ level: 9, scale: 1155581108577e-6, resolution: 305.748113140558 }), new e({ level: 10, scale: 577790.554289, resolution: 152.874056570411 }), new e({ level: 11, scale: 288895.277144, resolution: 76.4370282850732 }), new e({ level: 12, scale: 144447.638572, resolution: 38.2185141425366 }), new e({ level: 13, scale: 72223.819286, resolution: 19.1092570712683 }), new e({ level: 14, scale: 36111.909643, resolution: 9.55462853563415 }), new e({ level: 15, scale: 18055.954822, resolution: 4.77731426794937 }), new e({ level: 16, scale: 9027.977411, resolution: 2.38865713397468 }), new e({ level: 17, scale: 4513.988705, resolution: 1.19432856685505 }), new e({ level: 18, scale: 2256.994353, resolution: 0.597164283559817 }), new e({ level: 19, scale: 1128.497176, resolution: 0.298582141647617 })] }), this.subDomains = ["a", "b", "c"], this.fullExtent = new c(-20037508342787e-6, -2003750834278e-5, 2003750834278e-5, 20037508342787e-6, l.WebMercator), this.urlTemplate = "https://{subDomain}.tile.openstreetmap.org/{level}/{col}/{row}.png", this.operationalLayerType = "OpenStreetMap", this.type = "open-street-map", this.copyright = "Map data © OpenStreetMap contributors, CC-BY-SA";
+  }
+  get refreshInterval() {
+    return 0;
+  }
+};
+t([r({ type: i, json: { read: !1, write: !1, origins: { "web-document": { read: !1, write: !1 } } } })], o.prototype, "portalItem", void 0), t([r({ type: Boolean, json: { read: !1, write: !1 } })], o.prototype, "isReference", void 0), t([r({ type: Number, readOnly: !0, json: { read: !1, write: !1, origins: { "web-document": { read: !1, write: !1 } } } })], o.prototype, "refreshInterval", null), t([r({ type: s, json: { write: !1 } })], o.prototype, "tileInfo", void 0), t([r({ type: ["show", "hide"] })], o.prototype, "listMode", void 0), t([r({ readOnly: !0, json: { read: !1, write: !1 } })], o.prototype, "subDomains", void 0), t([r({ readOnly: !0, json: { read: !1, write: !1 }, nonNullable: !0 })], o.prototype, "fullExtent", void 0), t([r({ readOnly: !0, json: { read: !1, write: !1 } })], o.prototype, "urlTemplate", void 0), t([r({ type: ["OpenStreetMap"] })], o.prototype, "operationalLayerType", void 0), t([r({ json: { read: !1 } })], o.prototype, "type", void 0), t([r({ json: { read: !1, write: !1 } })], o.prototype, "copyright", void 0), t([r({ json: { read: !1, write: !1 } })], o.prototype, "wmtsInfo", void 0), o = t([a("esri.layers.OpenStreetMapLayer")], o);
+const T = o;
+export {
+  T as default
+};

package/dist/OperationalLayer-55af27d6.js

@@ -0,0 +1,44 @@
+import { e as n, y as l, c5 as m, c2 as s, c as b, eN as v, eO as w, W as c, e3 as A } from "./index-01c737ed.js";
+import { C as T, a as d, g as h } from "./commonProperties-f9559903.js";
+const g = { ArcGISAnnotationLayer: !0, ArcGISDimensionLayer: !0, ArcGISFeatureLayer: !0, ArcGISImageServiceLayer: !0, ArcGISImageServiceVectorLayer: !0, ArcGISMapServiceLayer: !0, ArcGISStreamLayer: !0, ArcGISTiledImageServiceLayer: !0, ArcGISTiledMapServiceLayer: !0, BingMapsAerial: !0, BingMapsHybrid: !0, BingMapsRoad: !0, CatalogLayer: !0, CSV: !0, GeoRSS: !0, GeoJSON: !0, GroupLayer: !0, KML: !0, KnowledgeGraphLayer: !0, MediaLayer: !0, OGCFeatureLayer: !0, OrientedImageryLayer: !0, SubtypeGroupLayer: !0, VectorTileLayer: !0, WFS: !0, WMS: !0, WebTiledLayer: !0 }, u = { ArcGISImageServiceLayer: !0, ArcGISImageServiceVectorLayer: !0, ArcGISMapServiceLayer: !0, ArcGISTiledImageServiceLayer: !0, ArcGISTiledMapServiceLayer: !0, OpenStreetMap: !0, VectorTileLayer: !0, WMS: !0, WebTiledLayer: !0, BingMapsAerial: !0, BingMapsRoad: !0, BingMapsHybrid: !0 }, I = { ArcGISFeatureLayer: !0, SubtypeGroupTable: !0 }, M = { "web-scene/operational-layers": { ArcGISDimensionLayer: !0, ArcGISFeatureLayer: !0, ArcGISImageServiceLayer: !0, ArcGISMapServiceLayer: !0, ArcGISSceneServiceLayer: !0, ArcGISTiledElevationServiceLayer: !0, ArcGISTiledImageServiceLayer: !0, ArcGISTiledMapServiceLayer: !0, BuildingSceneLayer: !0, GroupLayer: !0, IntegratedMeshLayer: !0, OGCFeatureLayer: !0, PointCloudLayer: !0, WebTiledLayer: !0, CSV: !0, GeoJSON: !0, VectorTileLayer: !0, WFS: !0, WMS: !0, KML: !0, RasterDataLayer: !0, Voxel: !0, LineOfSightLayer: !0, IntegratedMesh3DTilesLayer: !0 }, "web-scene/basemap": { ArcGISTiledImageServiceLayer: !0, ArcGISTiledMapServiceLayer: !0, WebTiledLayer: !0, OpenStreetMap: !0, VectorTileLayer: !0, ArcGISImageServiceLayer: !0, WMS: !0, ArcGISMapServiceLayer: !0, ArcGISSceneServiceLayer: !0 }, "web-scene/ground": { ArcGISTiledElevationServiceLayer: !0, RasterDataElevationLayer: !0 }, "web-scene/tables": { ArcGISFeatureLayer: !0 }, "web-map/operational-layers": g, "web-map/basemap": u, "web-map/tables": I, "link-chart/operational-layers": { ...g, LinkChartLayer: !0 }, "link-chart/basemap": u, "link-chart/tables": I, "portal-item/operational-layers": { ArcGISFeatureLayer: !0, ArcGISSceneServiceLayer: !0, ArcGISStreamLayer: !0, ArcGISImageServiceLayer: !0, ArcGISTiledImageServiceLayer: !0, PointCloudLayer: !0, BuildingSceneLayer: !0, IntegratedMeshLayer: !0, IntegratedMesh3DTilesLayer: !0, MediaLayer: !0, OrientedImageryLayer: !0, SubtypeGroupLayer: !0 } }, $ = (G) => {
+  let r = class extends G {
+    constructor() {
+      super(...arguments), this.persistenceEnabled = !0, this.title = null;
+    }
+    readId(a, e, i) {
+      var t;
+      return ((t = i == null ? void 0 : i.portalItem) == null ? void 0 : t.type) === "Group Layer" ? void 0 : a;
+    }
+    writeListMode(a, e, i, t) {
+      (t && t.layerContainerType === "ground" || a && v(this, i, {}, t)) && (e[i] = a);
+    }
+    writeOperationalLayerType(a, e, i, t) {
+      a && (t == null ? void 0 : t.layerContainerType) !== "tables" && (e.layerType = a);
+    }
+    writeTitle(a, e) {
+      e.title = a ?? "Layer";
+    }
+    read(a, e) {
+      e && (e.layer = this), w(this, a, (i) => super.read(a, i), e);
+    }
+    write(a, e) {
+      var S, L;
+      if (!this.persistenceEnabled)
+        return null;
+      if (e != null && e.origin) {
+        const y = `${e.origin}/${e.layerContainerType || "operational-layers"}`, o = M[y];
+        let p = !!(o != null && o[this.operationalLayerType]);
+        if (this.operationalLayerType === "ArcGISTiledElevationServiceLayer" && y === "web-scene/operational-layers" && (p = !1), this.operationalLayerType === "ArcGISDimensionLayer" && y === "web-map/operational-layers" && (p = !1), !p)
+          return (S = e.messages) == null || S.push(new c("layer:unsupported", `Layers (${this.title}, ${this.id}) of type '${this.declaredClass}' are not supported in the context of '${y}'`, { layer: this })), null;
+      }
+      const i = super.write(a, { ...e, layer: this }), t = !!e && !!e.messages && !!e.messages.filter((y) => y instanceof c && y.name === "web-document-write:property-required").length;
+      return A(i == null ? void 0 : i.url) ? ((L = e == null ? void 0 : e.messages) == null || L.push(new c("layer:invalid-url", `Layer (${this.title}, ${this.id}) of type '${this.declaredClass}' using a Blob URL cannot be written to web scenes and web maps`, { layer: this })), null) : !this.url && t ? null : i;
+    }
+    beforeSave() {
+    }
+  };
+  return n([l({ type: String, json: { write: { ignoreOrigin: !0 }, origins: { "web-scene": { write: { isRequired: !0, ignoreOrigin: !0 } }, "portal-item": { write: !1 } } } })], r.prototype, "id", void 0), n([m("id", ["id"])], r.prototype, "readId", null), n([l(T)], r.prototype, "listMode", void 0), n([s("listMode")], r.prototype, "writeListMode", null), n([l({ type: String, readOnly: !0, json: { read: !1, write: { target: "layerType", ignoreOrigin: !0 }, origins: { "portal-item": { write: !1 }, "web-scene": { name: "layerType", read: !1, write: { enabled: !0, ignoreOrigin: !0, layerContainerTypes: d } } } } })], r.prototype, "operationalLayerType", void 0), n([s("operationalLayerType")], r.prototype, "writeOperationalLayerType", null), n([l(h)], r.prototype, "opacity", void 0), n([l({ type: Boolean, readOnly: !1 })], r.prototype, "persistenceEnabled", void 0), n([l({ type: String, json: { write: { ignoreOrigin: !0, writerEnsuresNonNull: !0 }, origins: { "web-scene": { write: { isRequired: !0, ignoreOrigin: !0, writerEnsuresNonNull: !0 } }, "portal-item": { write: !1 } } }, value: "Layer" })], r.prototype, "title", void 0), n([s("title"), s(["web-scene"], "title")], r.prototype, "writeTitle", null), n([l({ type: Boolean, json: { origins: { "web-scene": { name: "visibility", write: { enabled: !0, layerContainerTypes: d } } }, name: "visibility", write: !0 } })], r.prototype, "visible", void 0), r = n([b("esri.layers.mixins.OperationalLayer")], r), r;
+};
+export {
+  $ as u
+};

package/dist/OptimizedFeatureSet-54e095c4.js

@@ -0,0 +1,12 @@
+class t {
+  constructor() {
+    this.objectIdFieldName = null, this.globalIdFieldName = null, this.geohashFieldName = null, this.geometryProperties = null, this.geometryType = null, this.spatialReference = null, this.hasZ = !1, this.hasM = !1, this.features = [], this.fields = [], this.transform = null, this.exceededTransferLimit = !1, this.uniqueIdField = null, this.queryGeometryType = null, this.queryGeometry = null;
+  }
+  weakClone() {
+    const e = new t();
+    return e.objectIdFieldName = this.objectIdFieldName, e.globalIdFieldName = this.globalIdFieldName, e.geohashFieldName = this.geohashFieldName, e.geometryProperties = this.geometryProperties, e.geometryType = this.geometryType, e.spatialReference = this.spatialReference, e.hasZ = this.hasZ, e.hasM = this.hasM, e.features = this.features, e.fields = this.fields, e.transform = this.transform, e.exceededTransferLimit = this.exceededTransferLimit, e.uniqueIdField = this.uniqueIdField, e.queryGeometry = this.queryGeometry, e.queryGeometryType = this.queryGeometryType, e;
+  }
+}
+export {
+  t as e
+};

package/dist/OptimizedGeometry-3b808152.js

@@ -0,0 +1,68 @@
+let a = class c {
+  constructor(t = null, s = {}, e, h) {
+    this.geometry = t, this.attributes = s, this.centroid = e, this.objectId = h, this.displayId = 0, this.geohashX = 0, this.geohashY = 0;
+  }
+  weakClone() {
+    const t = new c(this.geometry, this.attributes, this.centroid, this.objectId);
+    return t.displayId = this.displayId, t.geohashX = this.geohashX, t.geohashY = this.geohashY, t;
+  }
+  clone() {
+    var e, h;
+    const t = (e = this.geometry) == null ? void 0 : e.clone(), s = new c(t, { ...this.attributes }, (h = this.centroid) == null ? void 0 : h.clone(), this.objectId);
+    return s.displayId = this.displayId, s.geohashX = this.geohashX, s.geohashY = this.geohashY, s;
+  }
+};
+function d(g) {
+  var t, s;
+  return !!((s = (t = g.geometry) == null ? void 0 : t.coords) != null && s.length);
+}
+const i = 2;
+class o {
+  constructor(t = [], s = [], e = !1) {
+    this.lengths = t ?? [], this.coords = s ?? [], this.hasIndeterminateRingOrder = e;
+  }
+  static fromRect(t) {
+    const [s, e, h, r] = t, n = h - s, l = r - e;
+    return new o([5], [s, e, n, 0, 0, l, -n, 0, 0, -l]);
+  }
+  get isPoint() {
+    return this.lengths.length === 0;
+  }
+  get maxLength() {
+    return Math.max(...this.lengths);
+  }
+  get size() {
+    return this.lengths.reduce((t, s) => t + s);
+  }
+  forEachVertex(t) {
+    let s = 0;
+    this.lengths.length || t(this.coords[0], this.coords[1]);
+    for (let e = 0; e < this.lengths.length; e++) {
+      const h = this.lengths[e];
+      for (let r = 0; r < h; r++)
+        t(this.coords[i * (r + s)], this.coords[i * (r + s) + 1]);
+      s += h;
+    }
+  }
+  deltaDecode() {
+    const t = this.clone(), { coords: s, lengths: e } = t;
+    let h = 0;
+    for (const r of e) {
+      for (let n = 1; n < r; n++)
+        s[2 * (h + n)] += s[2 * (h + n) - 2], s[2 * (h + n) + 1] += s[2 * (h + n) - 1];
+      h += r;
+    }
+    return t;
+  }
+  clone(t) {
+    if (this.lengths.length === 0)
+      return new o([], [this.coords[0], this.coords[1]]);
+    const s = (this.lengths.length === 0 ? 1 : this.lengths.reduce((h, r) => h + r)) * i, e = this.coords.slice(0, s);
+    return t ? (t.set(e), new o(this.lengths, t, this.hasIndeterminateRingOrder)) : new o(Array.from(this.lengths), Array.from(e), this.hasIndeterminateRingOrder);
+  }
+}
+export {
+  o as e,
+  d as s,
+  a as t
+};

package/dist/OrderByInfo-22e3c805.js

@@ -0,0 +1,16 @@
+import { bu as n, e as r, y as s, c as d, bx as p } from "./index-01c737ed.js";
+var i;
+const t = new n({ asc: "ascending", desc: "descending" });
+let e = i = class extends p {
+  constructor(o) {
+    super(o), this.field = null, this.valueExpression = null, this.order = "ascending";
+  }
+  clone() {
+    return new i({ field: this.field, valueExpression: this.valueExpression, order: this.order });
+  }
+};
+r([s({ type: String, json: { write: !0 } })], e.prototype, "field", void 0), r([s({ type: String, json: { write: !0 } })], e.prototype, "valueExpression", void 0), r([s({ type: t.apiValues, json: { read: t.read, write: t.write } })], e.prototype, "order", void 0), e = i = r([d("esri.layers.support.OrderByInfo")], e);
+const l = e;
+export {
+  l as c
+};