@agrotools1/at-components 0.2.1 → 0.2.3

package/dist/earcut-6fa1a128.js

@@ -0,0 +1,292 @@
+import { aR as Y } from "./index-01c737ed.js";
+var _, D, E, F = { exports: {} };
+_ = F, D = function() {
+  function m(t, r, n) {
+    n = n || 2;
+    var x, i, e, u, v, f, c, l = r && r.length, s = l ? r[0] * n : t.length, a = B(t, 0, s, n, !0), y = [];
+    if (!a || a.next === a.prev)
+      return y;
+    if (l && (a = L(t, r, a, n)), t.length > 80 * n) {
+      x = e = t[0], i = u = t[1];
+      for (var o = n; o < s; o += n)
+        (v = t[o]) < x && (x = v), (f = t[o + 1]) < i && (i = f), v > e && (e = v), f > u && (u = f);
+      c = (c = Math.max(e - x, u - i)) !== 0 ? 1 / c : 0;
+    }
+    return g(a, y, n, x, i, c), y;
+  }
+  function B(t, r, n, x, i) {
+    var e, u;
+    if (i === A(t, r, n, x) > 0)
+      for (e = r; e < n; e += x)
+        u = R(e, t[e], t[e + 1], u);
+    else
+      for (e = n - x; e >= r; e -= x)
+        u = R(e, t[e], t[e + 1], u);
+    if (u && M(u, u.next)) {
+      var v = u.next;
+      w(u), u = v;
+    }
+    return u;
+  }
+  function h(t, r) {
+    if (!t)
+      return t;
+    r || (r = t);
+    var n, x = t;
+    do
+      if (n = !1, x.steiner || !M(x, x.next) && p(x.prev, x, x.next) !== 0)
+        x = x.next;
+      else {
+        var i = x.prev;
+        if (w(x), (x = r = i) === x.next)
+          break;
+        n = !0;
+      }
+    while (n || x !== r);
+    return r;
+  }
+  function g(t, r, n, x, i, e, u) {
+    if (t) {
+      !u && e && S(t, x, i, e);
+      for (var v, f, c = t; t.prev !== t.next; )
+        if (v = t.prev, f = t.next, e ? I(t, x, i, e) : G(t))
+          r.push(v.i / n), r.push(t.i / n), r.push(f.i / n), w(t), t = f.next, c = f.next;
+        else if ((t = f) === c) {
+          u ? u === 1 ? g(t = J(h(t), r, n), r, n, x, i, e, 2) : u === 2 && K(t, r, n, x, i, e) : g(h(t), r, n, x, i, e, 1);
+          break;
+        }
+    }
+  }
+  function G(t) {
+    var r = t.prev, n = t, x = t.next;
+    if (p(r, n, x) >= 0)
+      return !1;
+    for (var i = t.next.next; i !== t.prev; ) {
+      if (Z(r.x, r.y, n.x, n.y, x.x, x.y, i.x, i.y) && p(i.prev, i, i.next) >= 0)
+        return !1;
+      i = i.next;
+    }
+    return !0;
+  }
+  function I(t, r, n, x) {
+    var i = t.prev, e = t, u = t.next;
+    if (p(i, e, u) >= 0)
+      return !1;
+    for (var v = i.x < e.x ? i.x < u.x ? i.x : u.x : e.x < u.x ? e.x : u.x, f = i.y < e.y ? i.y < u.y ? i.y : u.y : e.y < u.y ? e.y : u.y, c = i.x > e.x ? i.x > u.x ? i.x : u.x : e.x > u.x ? e.x : u.x, l = i.y > e.y ? i.y > u.y ? i.y : u.y : e.y > u.y ? e.y : u.y, s = j(v, f, r, n, x), a = j(c, l, r, n, x), y = t.prevZ, o = t.nextZ; y && y.z >= s && o && o.z <= a; ) {
+      if (y !== t.prev && y !== t.next && Z(i.x, i.y, e.x, e.y, u.x, u.y, y.x, y.y) && p(y.prev, y, y.next) >= 0 || (y = y.prevZ, o !== t.prev && o !== t.next && Z(i.x, i.y, e.x, e.y, u.x, u.y, o.x, o.y) && p(o.prev, o, o.next) >= 0))
+        return !1;
+      o = o.nextZ;
+    }
+    for (; y && y.z >= s; ) {
+      if (y !== t.prev && y !== t.next && Z(i.x, i.y, e.x, e.y, u.x, u.y, y.x, y.y) && p(y.prev, y, y.next) >= 0)
+        return !1;
+      y = y.prevZ;
+    }
+    for (; o && o.z <= a; ) {
+      if (o !== t.prev && o !== t.next && Z(i.x, i.y, e.x, e.y, u.x, u.y, o.x, o.y) && p(o.prev, o, o.next) >= 0)
+        return !1;
+      o = o.nextZ;
+    }
+    return !0;
+  }
+  function J(t, r, n) {
+    var x = t;
+    do {
+      var i = x.prev, e = x.next.next;
+      !M(i, e) && C(i, x, x.next, e) && d(i, e) && d(e, i) && (r.push(i.i / n), r.push(x.i / n), r.push(e.i / n), w(x), w(x.next), x = t = e), x = x.next;
+    } while (x !== t);
+    return h(x);
+  }
+  function K(t, r, n, x, i, e) {
+    var u = t;
+    do {
+      for (var v = u.next.next; v !== u.prev; ) {
+        if (u.i !== v.i && V(u, v)) {
+          var f = H(u, v);
+          return u = h(u, u.next), f = h(f, f.next), g(u, r, n, x, i, e), void g(f, r, n, x, i, e);
+        }
+        v = v.next;
+      }
+      u = u.next;
+    } while (u !== t);
+  }
+  function L(t, r, n, x) {
+    var i, e, u, v = [];
+    for (i = 0, e = r.length; i < e; i++)
+      (u = B(t, r[i] * x, i < e - 1 ? r[i + 1] * x : t.length, x, !1)) === u.next && (u.steiner = !0), v.push(U(u));
+    for (v.sort(N), i = 0; i < v.length; i++)
+      n = h(n = O(v[i], n), n.next);
+    return n;
+  }
+  function N(t, r) {
+    return t.x - r.x;
+  }
+  function k(t) {
+    if (t.next.prev === t)
+      return t;
+    let r = t;
+    for (; ; ) {
+      const n = r.next;
+      if (n.prev === r || n === r || n === t)
+        break;
+      r = n;
+    }
+    return r;
+  }
+  function O(t, r) {
+    var n = P(t, r);
+    if (!n)
+      return r;
+    var x = H(n, t), i = h(n, n.next);
+    let e = k(x);
+    return h(e, e.next), i = k(i), k(r === n ? i : r);
+  }
+  function P(t, r) {
+    var n, x = r, i = t.x, e = t.y, u = -1 / 0;
+    do {
+      if (e <= x.y && e >= x.next.y && x.next.y !== x.y) {
+        var v = x.x + (e - x.y) * (x.next.x - x.x) / (x.next.y - x.y);
+        if (v <= i && v > u) {
+          if (u = v, v === i) {
+            if (e === x.y)
+              return x;
+            if (e === x.next.y)
+              return x.next;
+          }
+          n = x.x < x.next.x ? x : x.next;
+        }
+      }
+      x = x.next;
+    } while (x !== r);
+    if (!n)
+      return null;
+    if (i === u)
+      return n;
+    var f, c = n, l = n.x, s = n.y, a = 1 / 0;
+    x = n;
+    do
+      i >= x.x && x.x >= l && i !== x.x && Z(e < s ? i : u, e, l, s, e < s ? u : i, e, x.x, x.y) && (f = Math.abs(e - x.y) / (i - x.x), d(x, t) && (f < a || f === a && (x.x > n.x || x.x === n.x && Q(n, x))) && (n = x, a = f)), x = x.next;
+    while (x !== c);
+    return n;
+  }
+  function Q(t, r) {
+    return p(t.prev, t, r.prev) < 0 && p(r.next, t, t.next) < 0;
+  }
+  function S(t, r, n, x) {
+    var i = t;
+    do
+      i.z === null && (i.z = j(i.x, i.y, r, n, x)), i.prevZ = i.prev, i.nextZ = i.next, i = i.next;
+    while (i !== t);
+    i.prevZ.nextZ = null, i.prevZ = null, T(i);
+  }
+  function T(t) {
+    var r, n, x, i, e, u, v, f, c = 1;
+    do {
+      for (n = t, t = null, e = null, u = 0; n; ) {
+        for (u++, x = n, v = 0, r = 0; r < c && (v++, x = x.nextZ); r++)
+          ;
+        for (f = c; v > 0 || f > 0 && x; )
+          v !== 0 && (f === 0 || !x || n.z <= x.z) ? (i = n, n = n.nextZ, v--) : (i = x, x = x.nextZ, f--), e ? e.nextZ = i : t = i, i.prevZ = e, e = i;
+        n = x;
+      }
+      e.nextZ = null, c *= 2;
+    } while (u > 1);
+    return t;
+  }
+  function j(t, r, n, x, i) {
+    return (t = 1431655765 & ((t = 858993459 & ((t = 252645135 & ((t = 16711935 & ((t = 32767 * (t - n) * i) | t << 8)) | t << 4)) | t << 2)) | t << 1)) | (r = 1431655765 & ((r = 858993459 & ((r = 252645135 & ((r = 16711935 & ((r = 32767 * (r - x) * i) | r << 8)) | r << 4)) | r << 2)) | r << 1)) << 1;
+  }
+  function U(t) {
+    var r = t, n = t;
+    do
+      (r.x < n.x || r.x === n.x && r.y < n.y) && (n = r), r = r.next;
+    while (r !== t);
+    return n;
+  }
+  function Z(t, r, n, x, i, e, u, v) {
+    return (i - u) * (r - v) - (t - u) * (e - v) >= 0 && (t - u) * (x - v) - (n - u) * (r - v) >= 0 && (n - u) * (e - v) - (i - u) * (x - v) >= 0;
+  }
+  function V(t, r) {
+    return t.next.i !== r.i && t.prev.i !== r.i && !W(t, r) && (d(t, r) && d(r, t) && X(t, r) && (p(t.prev, t, r.prev) || p(t, r.prev, r)) || M(t, r) && p(t.prev, t, t.next) > 0 && p(r.prev, r, r.next) > 0);
+  }
+  function p(t, r, n) {
+    return (r.y - t.y) * (n.x - r.x) - (r.x - t.x) * (n.y - r.y);
+  }
+  function M(t, r) {
+    return t.x === r.x && t.y === r.y;
+  }
+  function C(t, r, n, x) {
+    var i = b(p(t, r, n)), e = b(p(t, r, x)), u = b(p(n, x, t)), v = b(p(n, x, r));
+    return i !== e && u !== v || !(i !== 0 || !z(t, n, r)) || !(e !== 0 || !z(t, x, r)) || !(u !== 0 || !z(n, t, x)) || !(v !== 0 || !z(n, r, x));
+  }
+  function z(t, r, n) {
+    return r.x <= Math.max(t.x, n.x) && r.x >= Math.min(t.x, n.x) && r.y <= Math.max(t.y, n.y) && r.y >= Math.min(t.y, n.y);
+  }
+  function b(t) {
+    return t > 0 ? 1 : t < 0 ? -1 : 0;
+  }
+  function W(t, r) {
+    var n = t;
+    do {
+      if (n.i !== t.i && n.next.i !== t.i && n.i !== r.i && n.next.i !== r.i && C(n, n.next, t, r))
+        return !0;
+      n = n.next;
+    } while (n !== t);
+    return !1;
+  }
+  function d(t, r) {
+    return p(t.prev, t, t.next) < 0 ? p(t, r, t.next) >= 0 && p(t, t.prev, r) >= 0 : p(t, r, t.prev) < 0 || p(t, t.next, r) < 0;
+  }
+  function X(t, r) {
+    var n = t, x = !1, i = (t.x + r.x) / 2, e = (t.y + r.y) / 2;
+    do
+      n.y > e != n.next.y > e && n.next.y !== n.y && i < (n.next.x - n.x) * (e - n.y) / (n.next.y - n.y) + n.x && (x = !x), n = n.next;
+    while (n !== t);
+    return x;
+  }
+  function H(t, r) {
+    var n = new q(t.i, t.x, t.y), x = new q(r.i, r.x, r.y), i = t.next, e = r.prev;
+    return t.next = r, r.prev = t, n.next = i, i.prev = n, x.next = n, n.prev = x, e.next = x, x.prev = e, x;
+  }
+  function R(t, r, n, x) {
+    var i = new q(t, r, n);
+    return x ? (i.next = x.next, i.prev = x, x.next.prev = i, x.next = i) : (i.prev = i, i.next = i), i;
+  }
+  function w(t) {
+    t.next.prev = t.prev, t.prev.next = t.next, t.prevZ && (t.prevZ.nextZ = t.nextZ), t.nextZ && (t.nextZ.prevZ = t.prevZ);
+  }
+  function q(t, r, n) {
+    this.i = t, this.x = r, this.y = n, this.prev = null, this.next = null, this.z = null, this.prevZ = null, this.nextZ = null, this.steiner = !1;
+  }
+  function A(t, r, n, x) {
+    for (var i = 0, e = r, u = n - x; e < n; e += x)
+      i += (t[u] - t[e]) * (t[e + 1] + t[u + 1]), u = e;
+    return i;
+  }
+  return m.deviation = function(t, r, n, x) {
+    var i = r && r.length, e = i ? r[0] * n : t.length, u = Math.abs(A(t, 0, e, n));
+    if (i)
+      for (var v = 0, f = r.length; v < f; v++) {
+        var c = r[v] * n, l = v < f - 1 ? r[v + 1] * n : t.length;
+        u -= Math.abs(A(t, c, l, n));
+      }
+    var s = 0;
+    for (v = 0; v < x.length; v += 3) {
+      var a = x[v] * n, y = x[v + 1] * n, o = x[v + 2] * n;
+      s += Math.abs((t[a] - t[o]) * (t[y + 1] - t[a + 1]) - (t[a] - t[y]) * (t[o + 1] - t[a + 1]));
+    }
+    return u === 0 && s === 0 ? 0 : Math.abs((s - u) / u);
+  }, m.flatten = function(t) {
+    for (var r = t[0][0].length, n = { vertices: [], holes: [], dimensions: r }, x = 0, i = 0; i < t.length; i++) {
+      for (var e = 0; e < t[i].length; e++)
+        for (var u = 0; u < r; u++)
+          n.vertices.push(t[i][e][u]);
+      i > 0 && (x += t[i - 1].length, n.holes.push(x));
+    }
+    return n;
+  }, m;
+}, (E = D()) !== void 0 && (_.exports = E);
+const tt = Y(F.exports);
+export {
+  tt as i
+};

package/dist/edgeProcessing-2ff1f201.js

@@ -0,0 +1,252 @@
+import { e as It } from "./deduplicate-59fb9cac.js";
+import { H as x } from "./InterleavedLayout-32973c8a.js";
+import { e as u } from "./VertexAttribute-faad30bf.js";
+import { r as J } from "./glUtil-8f8bce6b.js";
+import { bF as nt, hV as ht, fs as St, fg as X, bm as ot, bc as U, g8 as Ot, hW as At, bd as ut, bn as rt, bf as gt, b9 as T, b as Et, bp as wt, hN as Tt } from "./index-01c737ed.js";
+const vt = x().vec3f(u.POSITION).u16(u.COMPONENTINDEX), $t = x().vec2u8(u.SIDENESS);
+J($t);
+const z = x().vec3f(u.POSITION0).vec3f(u.POSITION1).vec2i16(u.NORMALCOMPRESSED).u16(u.COMPONENTINDEX).u8(u.VARIANTOFFSET, { glNormalized: !0 }).u8(u.VARIANTSTROKE).u8(u.VARIANTEXTENSION, { glNormalized: !0 }), K = x().vec3f(u.POSITION0).vec3f(u.POSITION1).vec2i16(u.NORMALCOMPRESSED).vec2i16(u.NORMAL2COMPRESSED).u16(u.COMPONENTINDEX).u8(u.VARIANTOFFSET, { glNormalized: !0 }).u8(u.VARIANTSTROKE).u8(u.VARIANTEXTENSION, { glNormalized: !0 });
+u.POSITION0, u.POSITION1, u.COMPONENTINDEX, u.VARIANTOFFSET, u.VARIANTSTROKE, u.VARIANTEXTENSION, u.NORMALCOMPRESSED, u.NORMAL2COMPRESSED, u.SIDENESS;
+const P = -1;
+var st;
+function Mt(t, e, n, s = Dt) {
+  const r = t.vertices.position, i = t.vertices.componentIndex, g = nt(s.anglePlanar), a = nt(s.angleSignificantEdge), p = Math.cos(a), f = Math.cos(g), l = k.edge, d = l.position0, h = l.position1, I = l.faceNormal0, v = l.faceNormal1, S = Vt(t), $ = bt(t), o = $.length / 4, c = e.allocate(o);
+  let m = 0;
+  const N = o, O = n.allocate(N);
+  let w = 0, M = 0, A = 0;
+  const Y = ht(0, o), L = new Float32Array(o);
+  L.forEach((R, E, C) => {
+    r.getVec($[4 * E], d), r.getVec($[4 * E + 1], h), C[E] = St(d, h);
+  }), Y.sort((R, E) => L[E] - L[R]);
+  const Z = new Array(), tt = new Array();
+  for (let R = 0; R < o; R++) {
+    const E = Y[R], C = L[E], W = $[4 * E], dt = $[4 * E + 1], b = $[4 * E + 2], F = $[4 * E + 3], et = F === P;
+    if (r.getVec(W, d), r.getVec(dt, h), et)
+      X(I, S[3 * b], S[3 * b + 1], S[3 * b + 2]), ot(v, I), l.componentIndex = i.get(W), l.cosAngle = U(I, v);
+    else {
+      if (X(I, S[3 * b], S[3 * b + 1], S[3 * b + 2]), X(v, S[3 * F], S[3 * F + 1], S[3 * F + 2]), l.componentIndex = i.get(W), l.cosAngle = U(I, v), Pt(l, f))
+        continue;
+      l.cosAngle < -0.9999 && ot(v, I);
+    }
+    M += C, A++, et || yt(l, p) ? (e.write(c, m++, l), Z.push(C)) : Rt(l, g) && (n.write(O, w++, l), tt.push(C));
+  }
+  const Nt = new Float32Array(Z.reverse()), pt = new Float32Array(tt.reverse());
+  return { regular: { instancesData: e.trim(c, m), lodInfo: { lengths: Nt } }, silhouette: { instancesData: n.trim(O, w), lodInfo: { lengths: pt } }, averageEdgeLength: M / A };
+}
+function yt(t, e) {
+  return t.cosAngle < e;
+}
+function Pt(t, e) {
+  return t.cosAngle > e;
+}
+function Rt(t, e) {
+  const n = Ot(t.cosAngle), s = k.fwd, r = k.ortho;
+  return At(s, t.position1, t.position0), n * (U(ut(r, t.faceNormal0, t.faceNormal1), s) > 0 ? -1 : 1) > e;
+}
+function bt(t) {
+  const e = t.faces.length / 3, n = t.faces, s = t.neighbors;
+  let r = 0;
+  for (let a = 0; a < e; a++) {
+    const p = s[3 * a], f = s[3 * a + 1], l = s[3 * a + 2], d = n[3 * a], h = n[3 * a + 1], I = n[3 * a + 2];
+    r += p === P || d < h ? 1 : 0, r += f === P || h < I ? 1 : 0, r += l === P || I < d ? 1 : 0;
+  }
+  const i = new Int32Array(4 * r);
+  let g = 0;
+  for (let a = 0; a < e; a++) {
+    const p = s[3 * a], f = s[3 * a + 1], l = s[3 * a + 2], d = n[3 * a], h = n[3 * a + 1], I = n[3 * a + 2];
+    (p === P || d < h) && (i[g++] = d, i[g++] = h, i[g++] = a, i[g++] = p), (f === P || h < I) && (i[g++] = h, i[g++] = I, i[g++] = a, i[g++] = f), (l === P || I < d) && (i[g++] = I, i[g++] = d, i[g++] = a, i[g++] = l);
+  }
+  return i;
+}
+function Vt(t) {
+  const e = t.faces.length / 3, n = t.vertices.position, s = t.faces, r = H.v0, i = H.v1, g = H.v2, a = new Float32Array(3 * e);
+  for (let p = 0; p < e; p++) {
+    const f = s[3 * p], l = s[3 * p + 1], d = s[3 * p + 2];
+    n.getVec(f, r), n.getVec(l, i), n.getVec(d, g), rt(i, i, r), rt(g, g, r), ut(r, i, g), gt(r, r), a[3 * p] = r[0], a[3 * p + 1] = r[1], a[3 * p + 2] = r[2];
+  }
+  return a;
+}
+(function(t) {
+  t[t.SOLID = 0] = "SOLID", t[t.SKETCH = 1] = "SKETCH";
+})(st || (st = {}));
+const k = { edge: { position0: T(), position1: T(), faceNormal0: T(), faceNormal1: T(), componentIndex: 0, cosAngle: 0 }, ortho: T(), fwd: T() }, H = { v0: T(), v1: T(), v2: T() }, Dt = { anglePlanar: 4, angleSignificantEdge: 35 };
+function it(t, e, n) {
+  const s = e / 3, r = new Uint32Array(n + 1), i = new Uint32Array(n + 1), g = (o, c) => {
+    o < c ? r[o + 1]++ : i[c + 1]++;
+  };
+  for (let o = 0; o < s; o++) {
+    const c = t[3 * o], m = t[3 * o + 1], N = t[3 * o + 2];
+    g(c, m), g(m, N), g(N, c);
+  }
+  let a = 0, p = 0;
+  for (let o = 0; o < n; o++) {
+    const c = r[o + 1], m = i[o + 1];
+    r[o + 1] = a, i[o + 1] = p, a += c, p += m;
+  }
+  const f = new Uint32Array(6 * s), l = r[n], d = (o, c, m) => {
+    if (o < c) {
+      const N = r[o + 1]++;
+      f[2 * N] = c, f[2 * N + 1] = m;
+    } else {
+      const N = i[c + 1]++;
+      f[2 * l + 2 * N] = o, f[2 * l + 2 * N + 1] = m;
+    }
+  };
+  for (let o = 0; o < s; o++) {
+    const c = t[3 * o], m = t[3 * o + 1], N = t[3 * o + 2];
+    d(c, m, o), d(m, N, o), d(N, c, o);
+  }
+  const h = (o, c) => {
+    const m = 2 * o, N = c - o;
+    for (let O = 1; O < N; O++) {
+      const w = f[m + 2 * O], M = f[m + 2 * O + 1];
+      let A = O - 1;
+      for (; A >= 0 && f[m + 2 * A] > w; A--)
+        f[m + 2 * A + 2] = f[m + 2 * A], f[m + 2 * A + 3] = f[m + 2 * A + 1];
+      f[m + 2 * A + 2] = w, f[m + 2 * A + 3] = M;
+    }
+  };
+  for (let o = 0; o < n; o++)
+    h(r[o], r[o + 1]), h(l + i[o], l + i[o + 1]);
+  const I = new Int32Array(3 * s), v = (o, c) => o === t[3 * c] ? 0 : o === t[3 * c + 1] ? 1 : o === t[3 * c + 2] ? 2 : -1, S = (o, c) => {
+    const m = v(o, c);
+    I[3 * c + m] = -1;
+  }, $ = (o, c, m, N) => {
+    const O = v(o, c);
+    I[3 * c + O] = N;
+    const w = v(m, N);
+    I[3 * N + w] = c;
+  };
+  for (let o = 0; o < n; o++) {
+    let c = r[o];
+    const m = r[o + 1];
+    let N = i[o];
+    const O = i[o + 1];
+    for (; c < m && N < O; ) {
+      const w = f[2 * c], M = f[2 * l + 2 * N];
+      w === M ? ($(o, f[2 * c + 1], M, f[2 * l + 2 * N + 1]), c++, N++) : w < M ? (S(o, f[2 * c + 1]), c++) : (S(M, f[2 * l + 2 * N + 1]), N++);
+    }
+    for (; c < m; )
+      S(o, f[2 * c + 1]), c++;
+    for (; N < O; )
+      S(f[2 * l + 2 * N], f[2 * l + 2 * N + 1]), N++;
+  }
+  return I;
+}
+function q(t, e, n, s, r, i = 2) {
+  const g = 1 / (Math.abs(n) + Math.abs(s) + Math.abs(r)), a = n * g, p = s * g, f = r <= 0 ? (a >= 0 ? 1 : -1) * (1 - Math.abs(p)) : a, l = r <= 0 ? (p >= 0 ? 1 : -1) * (1 - Math.abs(a)) : p, d = e * i;
+  t[d] = ct(f), t[d + 1] = ct(l);
+}
+function ct(t) {
+  return Et(Math.round(32767 * t), -32767, 32767);
+}
+class mt {
+  updateSettings(e) {
+    this.settings = e, this._edgeHashFunction = e.reducedPrecision ? Ct : xt;
+  }
+  write(e, n, s) {
+    const r = this._edgeHashFunction(s);
+    _.seed = r;
+    const i = _.getIntRange(0, 255), g = _.getIntRange(0, this.settings.variants - 1), a = 0.7, p = _.getFloat(), f = 255 * (0.5 * Lt(-(1 - Math.min(p / a, 1)) + Math.max(0, p - a) / (1 - a), 1.2) + 0.5);
+    e.position0.setVec(n, s.position0), e.position1.setVec(n, s.position1), e.componentIndex.set(n, s.componentIndex), e.variantOffset.set(n, i), e.variantStroke.set(n, g), e.variantExtension.set(n, f);
+  }
+  trim(e, n) {
+    return e.slice(0, n);
+  }
+}
+const Q = new Float32Array(6), B = new Uint32Array(Q.buffer), y = new Uint32Array(1);
+function xt(t) {
+  const e = Q;
+  e[0] = t.position0[0], e[1] = t.position0[1], e[2] = t.position0[2], e[3] = t.position1[0], e[4] = t.position1[1], e[5] = t.position1[2], y[0] = 5381;
+  for (let n = 0; n < B.length; n++)
+    y[0] = 31 * y[0] + B[n];
+  return y[0];
+}
+function Ct(t) {
+  const e = Q;
+  e[0] = V(t.position0[0]), e[1] = V(t.position0[1]), e[2] = V(t.position0[2]), e[3] = V(t.position1[0]), e[4] = V(t.position1[1]), e[5] = V(t.position1[2]), y[0] = 5381;
+  for (let n = 0; n < B.length; n++)
+    y[0] = 31 * y[0] + B[n];
+  return y[0];
+}
+const at = 1e4;
+function V(t) {
+  return Math.round(t * at) / at;
+}
+function Lt(t, e) {
+  const n = t < 0 ? -1 : 1;
+  return Math.abs(t) ** e * n;
+}
+class j {
+  constructor() {
+    this._commonWriter = new mt();
+  }
+  updateSettings(e) {
+    this._commonWriter.updateSettings(e);
+  }
+  allocate(e) {
+    return z.createBuffer(e);
+  }
+  write(e, n, s) {
+    this._commonWriter.write(e, n, s), wt(D, s.faceNormal0, s.faceNormal1), gt(D, D);
+    const { typedBuffer: r, typedBufferStride: i } = e.normalCompressed;
+    q(r, n, D[0], D[1], D[2], i);
+  }
+  trim(e, n) {
+    return this._commonWriter.trim(e, n);
+  }
+}
+j.Layout = z, j.glLayout = J(z, 1);
+class G {
+  constructor() {
+    this._commonWriter = new mt();
+  }
+  updateSettings(e) {
+    this._commonWriter.updateSettings(e);
+  }
+  allocate(e) {
+    return K.createBuffer(e);
+  }
+  write(e, n, s) {
+    this._commonWriter.write(e, n, s);
+    {
+      const { typedBuffer: r, typedBufferStride: i } = e.normalCompressed;
+      q(r, n, s.faceNormal0[0], s.faceNormal0[1], s.faceNormal0[2], i);
+    }
+    {
+      const { typedBuffer: r, typedBufferStride: i } = e.normal2Compressed;
+      q(r, n, s.faceNormal1[0], s.faceNormal1[1], s.faceNormal1[2], i);
+    }
+  }
+  trim(e, n) {
+    return this._commonWriter.trim(e, n);
+  }
+}
+G.Layout = K, G.glLayout = J(K, 1);
+const D = T(), _ = new Tt();
+function zt(t) {
+  const e = Ft(t.data, t.skipDeduplicate, t.indices, t.indicesLength);
+  return ft.updateSettings(t.writerSettings), lt.updateSettings(t.writerSettings), Mt(e, ft, lt);
+}
+function Ft(t, e, n, s) {
+  if (e) {
+    const g = it(n, s, t.count);
+    return new _t(n, s, g, t);
+  }
+  const r = It(t.buffer, t.stride / 4, { originalIndices: n, originalIndicesLength: s }), i = it(r.indices, s, r.uniqueCount);
+  return { faces: r.indices, facesLength: r.indices.length, neighbors: i, vertices: vt.createView(r.buffer) };
+}
+class _t {
+  constructor(e, n, s, r) {
+    this.faces = e, this.facesLength = n, this.neighbors = s, this.vertices = r;
+  }
+}
+const ft = new j(), lt = new G(), Kt = x().vec3f(u.POSITION0).vec3f(u.POSITION1), kt = x().vec3f(u.POSITION0).vec3f(u.POSITION1).u16(u.COMPONENTINDEX);
+export {
+  vt as I,
+  Mt as a,
+  Kt as d,
+  zt as f,
+  kt as m,
+  Ft as u
+};