@agrotools1/at-components 0.6.16 → 0.6.17

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/views/3d/webgl-engine/lib/GeometryUtil.js

@@ -1,80 +1,315 @@
-import { create as q } from "../../../../core/libs/gl-matrix-2/factories/vec2f64.js";
-import { f as N, b as v, n as D } from "../../../../chunks/vec32.js";
-import { fromValues as U, create as C } from "../../../../core/libs/gl-matrix-2/factories/vec3f32.js";
-import { clone as Y, create as tt, fromValues as et } from "../../../../core/libs/gl-matrix-2/factories/vec3f64.js";
-import { newDoubleArray as rt } from "../../../../geometry/support/DoubleArray.js";
-import { newFloatArray as V } from "../../../../geometry/support/FloatArray.js";
-import { getZeroIndexArray as _, getContinuousIndexArray as ot } from "../../../../geometry/support/Indices.js";
-import "../../../../geometry/support/plane.js";
-import "../../../../geometry/support/ray.js";
-import { Attribute as a } from "./Attribute.js";
-import "./BufferVectorMath.js";
-import { ContentObjectType as k } from "./ContentObjectType.js";
-import { Geometry as H } from "./Geometry.js";
-import { assert as L } from "./Util.js";
-import { VertexAttribute as n } from "./VertexAttribute.js";
-const nt = new Array(36);
-for (let t = 0; t < 6; t++)
+import { create as bt } from "../../../../core/libs/gl-matrix-2/factories/vec2f64.js";
+import { f as B, b as q, n as x, s as rt, e as dt, h as U, g as F, k as At, c as X } from "../../../../chunks/vec32.js";
+import { fromValues as E, create as D, clone as mt } from "../../../../core/libs/gl-matrix-2/factories/vec3f32.js";
+import { create as L, clone as gt, fromValues as Gt } from "../../../../core/libs/gl-matrix-2/factories/vec3f64.js";
+import { newDoubleArray as Rt } from "../../../../geometry/support/DoubleArray.js";
+import { newFloatArray as v, floatArrayFrom as Ot } from "../../../../geometry/support/FloatArray.js";
+import { getZeroIndexArray as Mt, getContinuousIndexArray as Et } from "../../../../geometry/support/Indices.js";
+import { create as Lt, fromPositionAndNormal as xt, intersectRay as Ct } from "../../../../geometry/support/plane.js";
+import { wrap as Ft } from "../../../../geometry/support/ray.js";
+import { Attribute as S } from "./Attribute.js";
+import { Vec3Compact as Vt } from "./BufferVectorMath.js";
+import { ContentObjectType as It } from "./ContentObjectType.js";
+import { Geometry as k } from "./Geometry.js";
+import { assert as _ } from "./Util.js";
+import { VertexAttribute as N } from "./VertexAttribute.js";
+const Z = Vt, ut = [[-0.5, -0.5, 0.5], [0.5, -0.5, 0.5], [0.5, 0.5, 0.5], [-0.5, 0.5, 0.5], [-0.5, -0.5, -0.5], [0.5, -0.5, -0.5], [0.5, 0.5, -0.5], [-0.5, 0.5, -0.5]], Ut = [0, 0, 1, -1, 0, 0, 1, 0, 0, 0, -1, 0, 0, 1, 0, 0, 0, -1], Dt = [0, 0, 1, 0, 1, 1, 0, 1], vt = [0, 1, 2, 2, 3, 0, 4, 0, 3, 3, 7, 4, 1, 5, 6, 6, 2, 1, 1, 0, 4, 4, 5, 1, 3, 2, 6, 6, 7, 3, 5, 4, 7, 7, 6, 5], Pt = new Array(36);
+for (let h = 0; h < 6; h++)
+  for (let r = 0; r < 6; r++)
+    Pt[6 * h + r] = h;
+const z = new Array(36);
+for (let h = 0; h < 6; h++)
+  z[6 * h] = 0, z[6 * h + 1] = 1, z[6 * h + 2] = 2, z[6 * h + 3] = 2, z[6 * h + 4] = 3, z[6 * h + 5] = 0;
+function le(h, r) {
+  Array.isArray(r) || (r = [r, r, r]);
+  const o = new Array(24);
+  for (let t = 0; t < 8; t++)
+    o[3 * t] = ut[t][0] * r[0], o[3 * t + 1] = ut[t][1] * r[1], o[3 * t + 2] = ut[t][2] * r[2];
+  return new k(h, [[N.POSITION, new S(o, vt, 3, !0)], [N.NORMAL, new S(Ut, Pt, 3)], [N.UV0, new S(Dt, z, 2)]]);
+}
+const ct = [[-0.5, 0, -0.5], [0.5, 0, -0.5], [0.5, 0, 0.5], [-0.5, 0, 0.5], [0, -0.5, 0], [0, 0.5, 0]], kt = [0, 1, -1, 1, 1, 0, 0, 1, 1, -1, 1, 0, 0, -1, -1, 1, -1, 0, 0, -1, 1, -1, -1, 0], Bt = [5, 1, 0, 5, 2, 1, 5, 3, 2, 5, 0, 3, 4, 0, 1, 4, 1, 2, 4, 2, 3, 4, 3, 0], jt = [0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7];
+function ue(h, r) {
+  Array.isArray(r) || (r = [r, r, r]);
+  const o = new Array(18);
+  for (let t = 0; t < 6; t++)
+    o[3 * t] = ct[t][0] * r[0], o[3 * t + 1] = ct[t][1] * r[1], o[3 * t + 2] = ct[t][2] * r[2];
+  return new k(h, [[N.POSITION, new S(o, Bt, 3, !0)], [N.NORMAL, new S(kt, jt, 3)]]);
+}
+const tt = E(-0.5, 0, -0.5), et = E(0.5, 0, -0.5), nt = E(0, 0, 0.5), ot = E(0, 0.5, 0), $ = D(), H = D(), K = D(), Q = D(), W = D();
+B($, tt, ot), B(H, tt, et), q(K, $, H), x(K, K), B($, et, ot), B(H, et, nt), q(Q, $, H), x(Q, Q), B($, nt, ot), B(H, nt, tt), q(W, $, H), x(W, W);
+const ft = [tt, et, nt, ot], qt = [0, -1, 0, K[0], K[1], K[2], Q[0], Q[1], Q[2], W[0], W[1], W[2]], zt = [0, 1, 2, 3, 1, 0, 3, 2, 1, 3, 0, 2], Zt = [0, 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 3];
+function ce(h, r) {
+  Array.isArray(r) || (r = [r, r, r]);
+  const o = new Array(12);
+  for (let t = 0; t < 4; t++)
+    o[3 * t] = ft[t][0] * r[0], o[3 * t + 1] = ft[t][1] * r[1], o[3 * t + 2] = ft[t][2] * r[2];
+  return new k(h, [[N.POSITION, new S(o, zt, 3, !0)], [N.NORMAL, new S(qt, Zt, 3)]]);
+}
+function fe(h, r, o, t, n = { uv: !0 }) {
+  const l = -Math.PI, c = 2 * Math.PI, O = -Math.PI / 2, P = Math.PI, e = Math.max(3, Math.floor(o)), u = Math.max(2, Math.floor(t)), m = (e + 1) * (u + 1), w = v(3 * m), T = v(3 * m), y = v(2 * m), p = [];
+  let f = 0;
+  for (let s = 0; s <= u; s++) {
+    const G = [], I = s / u, b = O + I * P, a = Math.cos(b);
+    for (let R = 0; R <= e; R++) {
+      const V = R / e, i = l + V * c, C = Math.cos(i) * a, d = Math.sin(b), Y = -Math.sin(i) * a;
+      w[3 * f] = C * r, w[3 * f + 1] = d * r, w[3 * f + 2] = Y * r, T[3 * f] = C, T[3 * f + 1] = d, T[3 * f + 2] = Y, y[2 * f] = V, y[2 * f + 1] = I, G.push(f), ++f;
+    }
+    p.push(G);
+  }
+  const A = new Array();
+  for (let s = 0; s < u; s++)
+    for (let G = 0; G < e; G++) {
+      const I = p[s][G], b = p[s][G + 1], a = p[s + 1][G + 1], R = p[s + 1][G];
+      s === 0 ? (A.push(I), A.push(a), A.push(R)) : s === u - 1 ? (A.push(I), A.push(b), A.push(a)) : (A.push(I), A.push(b), A.push(a), A.push(a), A.push(R), A.push(I));
+    }
+  const M = [[N.POSITION, new S(w, A, 3, !0)], [N.NORMAL, new S(T, A, 3, !0)]];
+  return n.uv && M.push([N.UV0, new S(y, A, 2, !0)]), n.offset && (M[0][0] = N.OFFSET, M.push([N.POSITION, new S(Float64Array.from(n.offset), Mt(A.length), 3, !0)])), new k(h, M);
+}
+function ie(h, r, o, t) {
+  const n = $t(r, o, t);
+  return new k(h, n);
+}
+function $t(h, r, o) {
+  const t = h;
+  let n, l;
+  if (o)
+    n = [0, -1, 0, 1, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, -1, 0, 1, 0], l = [0, 1, 2, 0, 2, 3, 0, 3, 4, 0, 4, 1, 1, 5, 2, 2, 5, 3, 3, 5, 4, 4, 5, 1];
+  else {
+    const e = t * (1 + Math.sqrt(5)) / 2;
+    n = [-t, e, 0, t, e, 0, -t, -e, 0, t, -e, 0, 0, -t, e, 0, t, e, 0, -t, -e, 0, t, -e, e, 0, -t, e, 0, t, -e, 0, -t, -e, 0, t], l = [0, 11, 5, 0, 5, 1, 0, 1, 7, 0, 7, 10, 0, 10, 11, 1, 5, 9, 5, 11, 4, 11, 10, 2, 10, 7, 6, 7, 1, 8, 3, 9, 4, 3, 4, 2, 3, 2, 6, 3, 6, 8, 3, 8, 9, 4, 9, 5, 2, 4, 11, 6, 2, 10, 8, 6, 7, 9, 8, 1];
+  }
+  for (let e = 0; e < n.length; e += 3)
+    Z.scale(n, e, h / Z.length(n, e));
+  let c = {};
+  function O(e, u) {
+    e > u && ([e, u] = [u, e]);
+    const m = e.toString() + "." + u.toString();
+    if (c[m])
+      return c[m];
+    let w = n.length;
+    return n.length += 3, Z.add(n, 3 * e, n, 3 * u, n, w), Z.scale(n, w, h / Z.length(n, w)), w /= 3, c[m] = w, w;
+  }
+  for (let e = 0; e < r; e++) {
+    const u = l.length, m = new Array(4 * u);
+    for (let w = 0; w < u; w += 3) {
+      const T = l[w], y = l[w + 1], p = l[w + 2], f = O(T, y), A = O(y, p), M = O(p, T), s = 4 * w;
+      m[s] = T, m[s + 1] = f, m[s + 2] = M, m[s + 3] = y, m[s + 4] = A, m[s + 5] = f, m[s + 6] = p, m[s + 7] = M, m[s + 8] = A, m[s + 9] = f, m[s + 10] = A, m[s + 11] = M;
+    }
+    l = m, c = {};
+  }
+  const P = Ot(n);
+  for (let e = 0; e < P.length; e += 3)
+    Z.normalize(P, e);
+  return [[N.POSITION, new S(Ot(n), l, 3, !0)], [N.NORMAL, new S(P, l, 3, !0)]];
+}
+function pe(h, r, o, t, n, l, c, O, P = null) {
+  const e = o ? gt(o) : L(), u = r ? gt(r) : Gt(0, 0, 1);
+  c ?? (c = bt());
+  const m = t ? [255 * t[0], 255 * t[1], 255 * t[2], t.length > 3 ? 255 * t[3] : 255] : [255, 255, 255, 255], w = n != null && n.length === 2 ? n : [1, 1], T = Mt(1), y = [[N.POSITION, new S(e, T, 3, !0)], [N.NORMAL, new S(u, T, 3, !0)], [N.UV0, new S(c, T, c.length)], [N.COLOR, new S(m, T, 4, !0)], [N.SIZE, new S(w, T, 2)]];
+  if (l != null && (l = [l[0], l[1], l[2], l[3]], y.push([N.CENTEROFFSETANDDISTANCE, new S(l, T, 4)])), O) {
+    const p = [O[0], O[1], O[2], O[3]];
+    y.push([N.FEATUREATTRIBUTE, new S(p, T, 4)]);
+  }
+  return new k(h, y, null, It.Point, P);
+}
+function me(h, r, o, t, n, l = !0, c = !0) {
+  let O = 0;
+  const P = o, e = r;
+  let u = E(0, O, 0), m = E(0, O + e, 0), w = E(0, -1, 0), T = E(0, 1, 0);
+  n && (O = e, m = E(0, 0, 0), u = E(0, O, 0), w = E(0, 1, 0), T = E(0, -1, 0));
+  const y = [m, u], p = [w, T], f = t + 2, A = Math.sqrt(e * e + P * P);
+  if (n)
+    for (let a = t - 1; a >= 0; a--) {
+      const R = a * (2 * Math.PI / t), V = E(Math.cos(R) * P, O, Math.sin(R) * P);
+      y.push(V);
+      const i = E(e * Math.cos(R) / A, -P / A, e * Math.sin(R) / A);
+      p.push(i);
+    }
+  else
+    for (let a = 0; a < t; a++) {
+      const R = a * (2 * Math.PI / t), V = E(Math.cos(R) * P, O, Math.sin(R) * P);
+      y.push(V);
+      const i = E(e * Math.cos(R) / A, P / A, e * Math.sin(R) / A);
+      p.push(i);
+    }
+  const M = new Array(), s = new Array();
+  if (l) {
+    for (let a = 3; a < y.length; a++)
+      M.push(1), M.push(a - 1), M.push(a), s.push(0), s.push(0), s.push(0);
+    M.push(y.length - 1), M.push(2), M.push(1), s.push(0), s.push(0), s.push(0);
+  }
+  if (c) {
+    for (let a = 3; a < y.length; a++)
+      M.push(a), M.push(a - 1), M.push(0), s.push(a), s.push(a - 1), s.push(1);
+    M.push(0), M.push(2), M.push(y.length - 1), s.push(1), s.push(2), s.push(p.length - 1);
+  }
+  const G = v(3 * f);
+  for (let a = 0; a < f; a++)
+    G[3 * a] = y[a][0], G[3 * a + 1] = y[a][1], G[3 * a + 2] = y[a][2];
+  const I = v(3 * f);
+  for (let a = 0; a < f; a++)
+    I[3 * a] = p[a][0], I[3 * a + 1] = p[a][1], I[3 * a + 2] = p[a][2];
+  const b = [[N.POSITION, new S(G, M, 3, !0)], [N.NORMAL, new S(I, s, 3, !0)]];
+  return new k(h, b);
+}
+function ge(h, r, o, t, n, l, c) {
+  const O = n ? mt(n) : E(1, 0, 0), P = l ? mt(l) : E(0, 0, 0);
+  c ?? (c = !0);
+  const e = D();
+  x(e, O);
+  const u = D();
+  U(u, e, Math.abs(r));
+  const m = D();
+  U(m, u, -0.5), F(m, m, P);
+  const w = E(0, 1, 0);
+  Math.abs(1 - At(e, w)) < 0.2 && rt(w, 0, 0, 1);
+  const T = D();
+  q(T, e, w), x(T, T), q(w, T, e);
+  const y = 2 * t + (c ? 2 : 0), p = t + (c ? 2 : 0), f = v(3 * y), A = v(3 * p), M = v(2 * y), s = new Array(3 * t * (c ? 4 : 2)), G = new Array(3 * t * (c ? 4 : 2));
+  c && (f[3 * (y - 2)] = m[0], f[3 * (y - 2) + 1] = m[1], f[3 * (y - 2) + 2] = m[2], M[2 * (y - 2)] = 0, M[2 * (y - 2) + 1] = 0, f[3 * (y - 1)] = f[3 * (y - 2)] + u[0], f[3 * (y - 1) + 1] = f[3 * (y - 2) + 1] + u[1], f[3 * (y - 1) + 2] = f[3 * (y - 2) + 2] + u[2], M[2 * (y - 1)] = 1, M[2 * (y - 1) + 1] = 1, A[3 * (p - 2)] = -e[0], A[3 * (p - 2) + 1] = -e[1], A[3 * (p - 2) + 2] = -e[2], A[3 * (p - 1)] = e[0], A[3 * (p - 1) + 1] = e[1], A[3 * (p - 1) + 2] = e[2]);
+  const I = (i, C, d) => {
+    s[i] = C, G[i] = d;
+  };
+  let b = 0;
+  const a = D(), R = D();
+  for (let i = 0; i < t; i++) {
+    const C = i * (2 * Math.PI / t);
+    U(a, w, Math.sin(C)), U(R, T, Math.cos(C)), F(a, a, R), A[3 * i] = a[0], A[3 * i + 1] = a[1], A[3 * i + 2] = a[2], U(a, a, o), F(a, a, m), f[3 * i] = a[0], f[3 * i + 1] = a[1], f[3 * i + 2] = a[2], M[2 * i] = i / t, M[2 * i + 1] = 0, f[3 * (i + t)] = f[3 * i] + u[0], f[3 * (i + t) + 1] = f[3 * i + 1] + u[1], f[3 * (i + t) + 2] = f[3 * i + 2] + u[2], M[2 * (i + t)] = i / t, M[2 * i + 1] = 1;
+    const d = (i + 1) % t;
+    I(b++, i, i), I(b++, i + t, i), I(b++, d, d), I(b++, d, d), I(b++, i + t, i), I(b++, d + t, d);
+  }
+  if (c) {
+    for (let i = 0; i < t; i++) {
+      const C = (i + 1) % t;
+      I(b++, y - 2, p - 2), I(b++, i, p - 2), I(b++, C, p - 2);
+    }
+    for (let i = 0; i < t; i++) {
+      const C = (i + 1) % t;
+      I(b++, i + t, p - 1), I(b++, y - 1, p - 1), I(b++, C + t, p - 1);
+    }
+  }
+  const V = [[N.POSITION, new S(f, s, 3, !0)], [N.NORMAL, new S(A, G, 3, !0)], [N.UV0, new S(M, s, 2, !0)]];
+  return new k(h, V);
+}
+function Oe(h, r, o, t, n, l) {
+  t = t || 10, n = n == null || n, _(r.length > 1);
+  const c = [[0, 0, 0]], O = [], P = [];
+  for (let e = 0; e < t; e++) {
+    O.push([0, -e - 1, -(e + 1) % t - 1]);
+    const u = e / t * 2 * Math.PI;
+    P.push([Math.cos(u) * o, Math.sin(u) * o]);
+  }
+  return Ht(h, P, r, c, O, n, l);
+}
+function Ht(h, r, o, t, n, l, c = E(0, 0, 0)) {
+  const O = r.length, P = v(o.length * O * 3 + (6 * t.length || 0)), e = v(o.length * O * 3 + (t ? 6 : 0)), u = new Array(), m = new Array();
+  let w = 0, T = 0;
+  const y = L(), p = L(), f = L(), A = L(), M = L(), s = L(), G = L(), I = L(), b = L(), a = L(), R = L(), V = L(), i = L(), C = Lt();
+  rt(b, 0, 1, 0), B(p, o[1], o[0]), x(p, p), l ? (F(I, o[0], c), x(f, I)) : rt(f, 0, 0, 1), wt(p, f, b, b, M, f, yt), X(A, f), X(V, M);
+  for (let g = 0; g < t.length; g++)
+    U(s, M, t[g][0]), U(I, f, t[g][2]), F(s, s, I), F(s, s, o[0]), P[w++] = s[0], P[w++] = s[1], P[w++] = s[2];
+  e[T++] = -p[0], e[T++] = -p[1], e[T++] = -p[2];
+  for (let g = 0; g < n.length; g++)
+    u.push(n[g][0] > 0 ? n[g][0] : -n[g][0] - 1 + t.length), u.push(n[g][1] > 0 ? n[g][1] : -n[g][1] - 1 + t.length), u.push(n[g][2] > 0 ? n[g][2] : -n[g][2] - 1 + t.length), m.push(0), m.push(0), m.push(0);
+  let d = t.length;
+  const Y = t.length - 1;
+  for (let g = 0; g < o.length; g++) {
+    let pt = !1;
+    g > 0 && (X(y, p), g < o.length - 1 ? (B(p, o[g + 1], o[g]), x(p, p)) : pt = !0, F(a, y, p), x(a, a), F(R, o[g - 1], A), xt(o[g], a, C), Ct(C, Ft(R, y), I) ? (B(I, I, o[g]), x(f, I), q(M, a, f), x(M, M)) : wt(a, A, V, b, M, f, yt), X(A, f), X(V, M)), l && (F(I, o[g], c), x(i, I));
+    for (let j = 0; j < O; j++)
+      if (U(s, M, r[j][0]), U(I, f, r[j][1]), F(s, s, I), x(G, s), e[T++] = G[0], e[T++] = G[1], e[T++] = G[2], F(s, s, o[g]), P[w++] = s[0], P[w++] = s[1], P[w++] = s[2], !pt) {
+        const ht = (j + 1) % O;
+        u.push(d + j), u.push(d + O + j), u.push(d + ht), u.push(d + ht), u.push(d + O + j), u.push(d + O + ht);
+        for (let lt = 0; lt < 6; lt++) {
+          const St = u.length - 6;
+          m.push(u[St + lt] - Y);
+        }
+      }
+    d += O;
+  }
+  const Nt = o[o.length - 1];
+  for (let g = 0; g < t.length; g++)
+    U(s, M, t[g][0]), U(I, f, t[g][1]), F(s, s, I), F(s, s, Nt), P[w++] = s[0], P[w++] = s[1], P[w++] = s[2];
+  const st = T / 3;
+  e[T++] = p[0], e[T++] = p[1], e[T++] = p[2];
+  const at = d - O;
+  for (let g = 0; g < n.length; g++)
+    u.push(n[g][0] >= 0 ? d + n[g][0] : -n[g][0] - 1 + at), u.push(n[g][2] >= 0 ? d + n[g][2] : -n[g][2] - 1 + at), u.push(n[g][1] >= 0 ? d + n[g][1] : -n[g][1] - 1 + at), m.push(st), m.push(st), m.push(st);
+  const Tt = [[N.POSITION, new S(P, u, 3, !0)], [N.NORMAL, new S(e, m, 3, !0)]];
+  return new k(h, Tt);
+}
+function we(h, r, o, t) {
+  _(r.length > 1, "createPolylineGeometry(): polyline needs at least 2 points"), _(r[0].length === 3, "createPolylineGeometry(): malformed vertex"), _(o == null || o.length === r.length, "createPolylineGeometry: need same number of points and normals"), _(o == null || o[0].length === 3, "createPolylineGeometry(): malformed normal");
+  const n = Rt(3 * r.length), l = new Array(2 * (r.length - 1));
+  let c = 0, O = 0;
+  for (let e = 0; e < r.length; e++) {
+    for (let u = 0; u < 3; u++)
+      n[c++] = r[e][u];
+    e > 0 && (l[O++] = e - 1, l[O++] = e);
+  }
+  const P = [[N.POSITION, new S(n, l, 3, !0)]];
+  if (o) {
+    const e = v(3 * o.length);
+    let u = 0;
+    for (let m = 0; m < r.length; m++)
+      for (let w = 0; w < 3; w++)
+        e[u++] = o[m][w];
+    P.push([N.NORMAL, new S(e, l, 3, !0)]);
+  }
+  return t && P.push([N.COLOR, new S(t, Et(t.length / 4), 4)]), new k(h, P, null, It.Line);
+}
+function ye(h, r, o, t, n, l = 0) {
+  const c = new Array(18), O = [[-o, l, n / 2], [t, l, n / 2], [0, r + l, n / 2], [-o, l, -n / 2], [t, l, -n / 2], [0, r + l, -n / 2]], P = [0, 1, 2, 3, 0, 2, 2, 5, 3, 1, 4, 5, 5, 2, 1, 1, 0, 3, 3, 4, 1, 4, 3, 5];
   for (let e = 0; e < 6; e++)
-    nt[6 * t + e] = t;
-const E = new Array(36);
-for (let t = 0; t < 6; t++)
-  E[6 * t] = 0, E[6 * t + 1] = 1, E[6 * t + 2] = 2, E[6 * t + 3] = 2, E[6 * t + 4] = 3, E[6 * t + 5] = 0;
-const Z = U(-0.5, 0, -0.5), j = U(0.5, 0, -0.5), z = U(0, 0, 0.5), B = U(0, 0.5, 0), S = C(), F = C(), G = C(), R = C(), d = C();
-N(S, Z, B), N(F, Z, j), v(G, S, F), D(G, G), N(S, j, B), N(F, j, z), v(R, S, F), D(R, R), N(S, z, B), N(F, z, Z), v(d, S, F), D(d, d);
-G[0], G[1], G[2], R[0], R[1], R[2], d[0], d[1], d[2];
-function It(t, e, h, m, u = { uv: !0 }) {
-  const s = -Math.PI, g = 2 * Math.PI, i = -Math.PI / 2, A = Math.PI, r = Math.max(3, Math.floor(h)), l = Math.max(2, Math.floor(m)), y = (r + 1) * (l + 1), c = V(3 * y), f = V(3 * y), I = V(2 * y), M = [];
-  let w = 0;
-  for (let p = 0; p <= l; p++) {
-    const O = [], P = p / l, x = i + P * A, $ = Math.cos(x);
-    for (let T = 0; T <= r; T++) {
-      const J = T / r, K = s + J * g, Q = Math.cos(K) * $, W = Math.sin(x), X = -Math.sin(K) * $;
-      c[3 * w] = Q * e, c[3 * w + 1] = W * e, c[3 * w + 2] = X * e, f[3 * w] = Q, f[3 * w + 1] = W, f[3 * w + 2] = X, I[2 * w] = J, I[2 * w + 1] = P, O.push(w), ++w;
+    c[3 * e] = O[e][0], c[3 * e + 1] = O[e][1], c[3 * e + 2] = O[e][2];
+  return new k(h, [[N.POSITION, new S(c, P, 3, !0)]]);
+}
+function Ae(h, r) {
+  const o = h.getMutableAttribute(N.POSITION).data;
+  for (let t = 0; t < o.length; t += 3) {
+    const n = o[t], l = o[t + 1], c = o[t + 2];
+    rt(J, n, l, c), dt(J, J, r), o[t] = J[0], o[t + 1] = J[1], o[t + 2] = J[2];
+  }
+}
+function Me(h, r = h) {
+  const o = h.attributes, t = o.get(N.POSITION).data, n = o.get(N.NORMAL).data;
+  if (n) {
+    const l = r.getMutableAttribute(N.NORMAL).data;
+    for (let c = 0; c < n.length; c += 3) {
+      const O = n[c + 1];
+      l[c + 1] = -n[c + 2], l[c + 2] = O;
     }
-    M.push(O);
   }
-  const o = new Array();
-  for (let p = 0; p < l; p++)
-    for (let O = 0; O < r; O++) {
-      const P = M[p][O], x = M[p][O + 1], $ = M[p + 1][O + 1], T = M[p + 1][O];
-      p === 0 ? (o.push(P), o.push($), o.push(T)) : p === l - 1 ? (o.push(P), o.push(x), o.push($)) : (o.push(P), o.push(x), o.push($), o.push($), o.push(T), o.push(P));
+  if (t) {
+    const l = r.getMutableAttribute(N.POSITION).data;
+    for (let c = 0; c < t.length; c += 3) {
+      const O = t[c + 1];
+      l[c + 1] = -t[c + 2], l[c + 2] = O;
     }
-  const b = [[n.POSITION, new a(c, o, 3, !0)], [n.NORMAL, new a(f, o, 3, !0)]];
-  return u.uv && b.push([n.UV0, new a(I, o, 2, !0)]), u.offset && (b[0][0] = n.OFFSET, b.push([n.POSITION, new a(Float64Array.from(u.offset), _(o.length), 3, !0)])), new H(t, b);
-}
-function Mt(t, e, h, m, u, s, g, i, A = null) {
-  const r = h ? Y(h) : tt(), l = e ? Y(e) : et(0, 0, 1);
-  g ?? (g = q());
-  const y = m ? [255 * m[0], 255 * m[1], 255 * m[2], m.length > 3 ? 255 * m[3] : 255] : [255, 255, 255, 255], c = u != null && u.length === 2 ? u : [1, 1], f = _(1), I = [[n.POSITION, new a(r, f, 3, !0)], [n.NORMAL, new a(l, f, 3, !0)], [n.UV0, new a(g, f, g.length)], [n.COLOR, new a(y, f, 4, !0)], [n.SIZE, new a(c, f, 2)]];
-  if (s != null && (s = [s[0], s[1], s[2], s[3]], I.push([n.CENTEROFFSETANDDISTANCE, new a(s, f, 4)])), i) {
-    const M = [i[0], i[1], i[2], i[3]];
-    I.push([n.FEATUREATTRIBUTE, new a(M, f, 4)]);
-  }
-  return new H(t, I, null, k.Point, A);
-}
-function Pt(t, e, h, m) {
-  L(e.length > 1, "createPolylineGeometry(): polyline needs at least 2 points"), L(e[0].length === 3, "createPolylineGeometry(): malformed vertex"), L(h == null || h.length === e.length, "createPolylineGeometry: need same number of points and normals"), L(h == null || h[0].length === 3, "createPolylineGeometry(): malformed normal");
-  const u = rt(3 * e.length), s = new Array(2 * (e.length - 1));
-  let g = 0, i = 0;
-  for (let r = 0; r < e.length; r++) {
-    for (let l = 0; l < 3; l++)
-      u[g++] = e[r][l];
-    r > 0 && (s[i++] = r - 1, s[i++] = r);
-  }
-  const A = [[n.POSITION, new a(u, s, 3, !0)]];
-  if (h) {
-    const r = V(3 * h.length);
-    let l = 0;
-    for (let y = 0; y < e.length; y++)
-      for (let c = 0; c < 3; c++)
-        r[l++] = h[y][c];
-    A.push([n.NORMAL, new a(r, s, 3, !0)]);
-  }
-  return m && A.push([n.COLOR, new a(m, ot(m.length / 4), 4)]), new H(t, A, null, k.Line);
+  }
+}
+function it(h, r, o, t, n) {
+  return !(Math.abs(At(r, h)) > n) && (q(o, h, r), x(o, o), q(t, o, h), x(t, t), !0);
+}
+function wt(h, r, o, t, n, l, c) {
+  return it(h, r, n, l, c) || it(h, o, n, l, c) || it(h, t, n, l, c);
 }
+const yt = 0.99619469809, J = L();
 export {
-  Mt as createPointGeometry,
-  Pt as createPolylineGeometry,
-  It as createSphereGeometry
+  Me as cgToGIS,
+  le as createBoxGeometry,
+  me as createConeGeometry,
+  ge as createCylinderGeometry,
+  ue as createDiamondGeometry,
+  ye as createExtrudedTriangle,
+  Ht as createPathExtrusionGeometry,
+  pe as createPointGeometry,
+  $t as createPolySphereData,
+  ie as createPolySphereGeometry,
+  we as createPolylineGeometry,
+  fe as createSphereGeometry,
+  ce as createTetrahedronGeometry,
+  Oe as createTubeGeometry,
+  wt as makeOrthoBasisDirUpFallback,
+  Ae as transformInPlace
 };

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/views/3d/webgl-engine/lib/GeometryWithMapPositions.js

@@ -0,0 +1,19 @@
+import "../../../../core/libs/gl-matrix-2/factories/mat4f64.js";
+import "../../../../chunks/vec32.js";
+import "../../../../geometry/support/Indices.js";
+import "../../../../core/has.js";
+import "./basicInterfaces.js";
+import "./BoundingInfo.js";
+import "./ContentObjectType.js";
+import "../../../../core/libs/gl-matrix-2/factories/vec3f64.js";
+import "../../../../geometry/support/triangle.js";
+import "../../../../core/libs/gl-matrix-2/factories/vec2f64.js";
+import "../../../../chunks/vec42.js";
+import "../../../../core/libs/gl-matrix-2/factories/vec4f64.js";
+import "./VertexAttribute.js";
+function f(i) {
+  return i.mapPositions != null;
+}
+export {
+  f as isGeometryWithMapPositions
+};

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/views/3d/webgl-engine/lib/Intersector.js

@@ -1,19 +1,19 @@
 import { copy as b } from "../../../../core/libs/gl-matrix-2/math/mat4.js";
 import { create as U, IDENTITY as N } from "../../../../core/libs/gl-matrix-2/factories/mat4f64.js";
-import { h as x, l as z, g as V, c as T, n as C, e as A } from "../../../../chunks/vec32.js";
+import { g as V, e as x, h as A, l as z, c as T, n as C } from "../../../../chunks/vec32.js";
 import { create as p, UNIT_Z as H } from "../../../../core/libs/gl-matrix-2/factories/vec3f64.js";
 import { t as J } from "../../../../chunks/vec42.js";
 import { create as S } from "../../../../core/libs/gl-matrix-2/factories/vec4f64.js";
-import { create as l, copy as v, fromPoints as W } from "../../../../geometry/support/ray.js";
+import { create as l, fromPoints as W, copy as v } from "../../../../geometry/support/ray.js";
 import { ViewingMode as R } from "../../../ViewingMode.js";
-import { IntersectorType as g, IntersectorOptions as X, StoreResults as B } from "./IntersectorInterfaces.js";
-import { HudTarget as k } from "./IntersectorTarget.js";
-import { isValidIntersectorResult as Q } from "./intersectorUtils.js";
-import { IntersectorTransform as Y, getVerticalOffsetObject3D as j } from "./verticalOffsetUtils.js";
+import { IntersectorOptions as $, StoreResults as B, IntersectorType as g } from "./IntersectorInterfaces.js";
+import { HudTarget as X } from "./IntersectorTarget.js";
+import { isValidIntersectorResult as k } from "./intersectorUtils.js";
+import { IntersectorTransform as Q, getVerticalOffsetObject3D as j } from "./verticalOffsetUtils.js";
 const G = 1e-5;
-class Z {
+class Y {
   constructor(t) {
-    this.options = new X(), this._results = new q(), this.transform = new Y(), this.tolerance = G, this.verticalOffset = null, this._ray = l(), this._rayEnd = p(), this._rayBeginTransformed = p(), this._rayEndTransformed = p(), this.viewingMode = t ?? R.Global;
+    this.options = new $(), this._results = new Z(), this.transform = new Q(), this.tolerance = G, this.verticalOffset = null, this._ray = l(), this._rayEnd = p(), this._rayBeginTransformed = p(), this._rayEndTransformed = p(), this.viewingMode = t ?? R.Global;
   }
   get results() {
     return this._results;
@@ -59,14 +59,14 @@ class Z {
       if (!n.visible)
         continue;
       const { material: f, id: h } = n;
-      this.transform.setAndInvalidateLazyTransforms(i, n.transformation), A(this._rayBeginTransformed, this.rayBegin, this.transform.inverse), A(this._rayEndTransformed, this.rayEnd, this.transform.inverse);
+      this.transform.setAndInvalidateLazyTransforms(i, n.transformation), x(this._rayBeginTransformed, this.rayBegin, this.transform.inverse), x(this._rayEndTransformed, this.rayEnd, this.transform.inverse);
       const m = this.transform.transform;
       c != null && (c.objectTransform = this.transform), f.intersect(n, this.transform.transform, this, this._rayBeginTransformed, this._rayEndTransformed, (s, d, _, E, O, D) => {
         if (s >= 0) {
           if (this.filterPredicate != null && !this.filterPredicate(this._ray.origin, this._rayEnd, s))
             return;
           const e = E ? this._results.hud : this._results, L = E ? (o) => {
-            const P = new k(t, h, _, D);
+            const P = new X(t, h, _, D);
             o.set(g.HUD, P, s, d, N, O);
           } : (o) => o.set(g.OBJECT, { object: t, geometryId: h, triangleNr: _ }, s, d, m, O);
           if ((e.min.drapedLayerOrder == null || O >= e.min.drapedLayerOrder) && (e.min.dist == null || s < e.min.dist) && L(e.min), this.options.store !== B.MIN && (e.max.drapedLayerOrder == null || O < e.max.drapedLayerOrder) && (e.max.dist == null || s > e.max.dist) && L(e.max), this.options.store === B.ALL)
@@ -89,9 +89,9 @@ function M(a, t) {
   return (t ?? -Number.MAX_VALUE) - (a ?? -Number.MAX_VALUE);
 }
 function dt(a) {
-  return new Z(a);
+  return new Y(a);
 }
-class q {
+class Z {
   constructor() {
     this.min = new y(l()), this.max = new y(l()), this.hud = { min: new I(l()), max: new I(l()), all: new Array() }, this.ground = new y(l()), this.all = [];
   }
@@ -104,10 +104,10 @@ class y {
     return this._ray;
   }
   get distanceInRenderSpace() {
-    return this.dist != null ? (x(w, this.ray.direction, this.dist), z(w)) : null;
+    return this.dist != null ? (A(w, this.ray.direction, this.dist), z(w)) : null;
   }
   getIntersectionPoint(t) {
-    return !!Q(this) && (x(w, this.ray.direction, this.dist), V(t, this.ray.origin, w), !0);
+    return !!k(this) && (A(w, this.ray.direction, this.dist), V(t, this.ray.origin, w), !0);
   }
   getTransformedNormal(t) {
     return T(u, this.normal), u[3] = 0, J(u, u, this.transformation), T(t, u), C(t, t);

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/views/3d/webgl-engine/lib/Normals.js

@@ -1,15 +1,23 @@
-import { clamp as b } from "../../../../core/mathUtils.js";
+import { clamp as u } from "../../../../core/mathUtils.js";
 import "../../../../chunks/vec32.js";
 import "../../../../core/libs/gl-matrix-2/factories/vec3f64.js";
 import "../../../../core/has.js";
-function x(t, h, r, n, a, i = 2) {
-  const m = 1 / (Math.abs(r) + Math.abs(n) + Math.abs(a)), o = r * m, s = n * m, p = a <= 0 ? (o >= 0 ? 1 : -1) * (1 - Math.abs(s)) : o, M = a <= 0 ? (s >= 0 ? 1 : -1) * (1 - Math.abs(o)) : s, c = h * i;
-  t[c] = e(p), t[c + 1] = e(M);
+function f(t, n, r, o, a, i = 2) {
+  const c = 1 / (Math.abs(r) + Math.abs(o) + Math.abs(a)), s = r * c, e = o * c, p = a <= 0 ? (s >= 0 ? 1 : -1) * (1 - Math.abs(e)) : s, l = a <= 0 ? (e >= 0 ? 1 : -1) * (1 - Math.abs(s)) : e, m = n * i;
+  t[m] = h(p), t[m + 1] = h(l);
 }
-function e(t) {
-  return b(Math.round(32767 * t), -32767, 32767);
+function N(t) {
+  const n = t.length / 3, r = new Int16Array(2 * n);
+  let o = 0;
+  for (let a = 0; a < n; ++a)
+    f(r, a, t[o++], t[o++], t[o++]);
+  return r;
+}
+function h(t) {
+  return u(Math.round(32767 * t), -32767, 32767);
 }
 export {
-  x as compressNormal,
-  e as encodeInt16
+  f as compressNormal,
+  N as compressNormals,
+  h as encodeInt16
 };

package/dist/node_modules/.pnpm/@arcgis_core@4.29.10/node_modules/@arcgis/core/views/3d/webgl-engine/lib/Object3D.js

@@ -1,8 +1,8 @@
 import { copy as u, multiply as g, hasIdentityRotation as L } from "../../../../core/libs/gl-matrix-2/math/mat4.js";
 import { IDENTITY as C, create as d } from "../../../../core/libs/gl-matrix-2/factories/mat4f64.js";
-import { m as B, e as h, q as D, s as U, g as f, j as W, c as b } from "../../../../chunks/vec32.js";
+import { m as B, e as h, q as $, s as D, g as f, j as U, c as b } from "../../../../chunks/vec32.js";
 import { fromValues as _, create as l } from "../../../../core/libs/gl-matrix-2/factories/vec3f64.js";
-import { g as p, c as $ } from "../../../../chunks/sphere.js";
+import { g as p, c as W } from "../../../../chunks/sphere.js";
 import { maxScale as E } from "../../support/mathUtils.js";
 import { Object3DState as v } from "./basicInterfaces.js";
 import { ContentObject as G } from "./ContentObject.js";
@@ -10,8 +10,8 @@ import { ContentObjectType as w } from "./ContentObjectType.js";
 import { Object3DStateID as y } from "./Object3DStateID.js";
 import { assert as I } from "./Util.js";
 import { affectsGeometry as N } from "./VertexAttribute.js";
-import { addObject3DStateID as S, removeObject3DStateID as x } from "../materials/renderers/utils.js";
-class it extends G {
+import { addObject3DStateID as S, removeObject3DStateID as O } from "../materials/renderers/utils.js";
+let it = class extends G {
   get geometries() {
     return this._geometries;
   }
@@ -75,7 +75,7 @@ class it extends G {
   }
   removeOcclude(t) {
     for (const e of this._geometries)
-      e.occludees = x(e.occludees, t);
+      e.occludees = O(e.occludees, t);
     this._emit("occlusionChanged", this);
   }
   highlight() {
@@ -86,7 +86,7 @@ class it extends G {
   }
   removeHighlight(t) {
     for (const e of this._geometries)
-      e.highlights = x(e.highlights, t);
+      e.highlights = O(e.highlights, t);
     this._emit("highlightChanged", this);
   }
   getCombinedStaticTransformation(t, e) {
@@ -96,10 +96,10 @@ class it extends G {
     return g(e, this.effectiveTransformation, t.transformation);
   }
   get boundingVolumeWorldSpace() {
-    return this._bvWorldSpace || (this._bvWorldSpace = this._bvWorldSpace || new O(), this._validateBoundingVolume(this._bvWorldSpace, c.WorldSpace)), this._bvWorldSpace;
+    return this._bvWorldSpace || (this._bvWorldSpace = this._bvWorldSpace || new x(), this._validateBoundingVolume(this._bvWorldSpace, c.WorldSpace)), this._bvWorldSpace;
   }
   get boundingVolumeObjectSpace() {
-    return this._bvObjectSpace || (this._bvObjectSpace = this._bvObjectSpace || new O(), this._validateBoundingVolume(this._bvObjectSpace, c.ObjectSpace)), this._bvObjectSpace;
+    return this._bvObjectSpace || (this._bvObjectSpace = this._bvObjectSpace || new x(), this._validateBoundingVolume(this._bvObjectSpace, c.ObjectSpace)), this._bvObjectSpace;
   }
   _validateBoundingVolume(t, e) {
     const m = e === c.ObjectSpace;
@@ -114,7 +114,7 @@ class it extends G {
         continue;
       const s = m ? o.transformation : this.getCombinedShaderTransformation(o), T = E(s);
       h(j, i.center, s);
-      const A = D(j, p(t.bounds)), M = i.radius * T;
+      const A = $(j, p(t.bounds)), M = i.radius * T;
       t.bounds[3] = Math.max(t.bounds[3], A + M);
     }
   }
@@ -130,7 +130,7 @@ class it extends G {
     const t = this;
     return { hasGeometry: (e) => t._geometries.includes(e), getGeometryIndex: (e) => t._geometries.indexOf(e) };
   }
-}
+};
 class V {
   constructor() {
     this.min = _(Number.MAX_VALUE, Number.MAX_VALUE, Number.MAX_VALUE), this.max = _(-Number.MAX_VALUE, -Number.MAX_VALUE, -Number.MAX_VALUE);
@@ -139,19 +139,19 @@ class V {
     return this.max[0] < this.min[0] && this.max[1] < this.min[1] && this.max[2] < this.min[2];
   }
 }
-class O extends V {
+class x extends V {
   constructor() {
-    super(...arguments), this.bounds = $();
+    super(...arguments), this.bounds = W();
   }
 }
 function X(n, t, e) {
   const m = n.bbMin, o = n.bbMax;
   if (L(e)) {
-    const i = U(H, e[12], e[13], e[14]);
+    const i = D(H, e[12], e[13], e[14]);
     f(r, m, i), f(a, o, i);
     for (let s = 0; s < 3; ++s)
       t.min[s] = Math.min(t.min[s], r[s]), t.max[s] = Math.max(t.max[s], a[s]);
-  } else if (h(r, m, e), W(m, o))
+  } else if (h(r, m, e), U(m, o))
     for (let i = 0; i < 3; ++i)
       t.min[i] = Math.min(t.min[i], r[i]), t.max[i] = Math.max(t.max[i], r[i]);
   else {