@takram/three-geospatial 0.7.1 → 0.9.0

package/build/index.js

@@ -1,75 +1,75 @@
-import { Loader as K, FileLoader as Ve, BufferGeometry as Ye, BufferAttribute as Wt, Box3 as Xe, Vector3 as U, Sphere as ke, WebGLRenderer as qe, LinearFilter as Vt, RGBAFormat as Je, ByteType as $e, UnsignedByteType as Yt, ShortType as Qe, UnsignedShortType as Ze, IntType as Ke, UnsignedIntType as tn, HalfFloatType as en, FloatType as Xt, MathUtils as _, Material as pt, Data3DTexture as de, DataTexture as nn, Quaternion as rn, Matrix4 as sn, Ray as on, RepeatWrapping as mt, NearestFilter as kt, RedFormat as cn, Vector2 as pe } from "three";
-import { i as Ae } from "./shared.js";
-import { E as qt, G as V } from "./shared2.js";
-import { a as ls } from "./shared2.js";
-import { EXRLoader as ge } from "three/addons/loaders/EXRLoader.js";
-import { Q as ys } from "./shared3.js";
-class an extends K {
-  load(t, n, r, s) {
-    const o = new Ve(this.manager);
-    o.setResponseType("arraybuffer"), o.setRequestHeader(this.requestHeader), o.setPath(this.path), o.setWithCredentials(this.withCredentials), o.load(
+import { Loader as K, FileLoader as ze, BufferGeometry as He, BufferAttribute as Ht, Box3 as We, Vector3 as U, Sphere as Ve, WebGLRenderer as Ye, LinearFilter as Wt, RGBAFormat as Xe, ByteType as qe, UnsignedByteType as Vt, ShortType as ke, UnsignedShortType as Je, IntType as $e, UnsignedIntType as Qe, HalfFloatType as Ze, FloatType as Yt, MathUtils as _, Material as pt, Data3DTexture as Ke, DataTexture as tn, Quaternion as en, Matrix4 as nn, Ray as rn, Vector2 as ue } from "three";
+import { i as ye } from "./shared.js";
+import { D as ns, Q as rs, S as ss, a as os, b as is, c as cs } from "./shared2.js";
+import { E as Xt, G as V } from "./shared3.js";
+import { a as hs } from "./shared3.js";
+import { EXRLoader as de } from "three/addons/loaders/EXRLoader.js";
+class sn extends K {
+  load(t, n, r, o) {
+    const s = new ze(this.manager);
+    s.setResponseType("arraybuffer"), s.setRequestHeader(this.requestHeader), s.setPath(this.path), s.setWithCredentials(this.withCredentials), s.load(
       t,
       (i) => {
-        Ae(i instanceof ArrayBuffer);
+        ye(i instanceof ArrayBuffer);
         try {
           n(i);
         } catch (c) {
-          s != null ? s(c) : console.error(c), this.manager.itemError(t);
+          o != null ? o(c) : console.error(c), this.manager.itemError(t);
         }
       },
       r,
-      s
+      o
     );
   }
 }
-function Ir(e) {
-  const { attributes: t, index: n, boundingBox: r, boundingSphere: s } = e;
+function Ar(e) {
+  const { attributes: t, index: n, boundingBox: r, boundingSphere: o } = e;
   return [
-    { attributes: t, index: n, boundingBox: r, boundingSphere: s },
+    { attributes: t, index: n, boundingBox: r, boundingSphere: o },
     [
       ...Object.values(e.attributes).map(
-        (o) => o.array.buffer
+        (s) => s.array.buffer
       ),
       e.index?.array.buffer
-    ].filter((o) => o != null)
+    ].filter((s) => s != null)
   ];
 }
-function Or(e, t = new Ye()) {
+function gr(e, t = new He()) {
   for (const [n, r] of Object.entries(e.attributes))
     t.setAttribute(
       n,
-      new Wt(
+      new Ht(
         r.array,
         r.itemSize,
         r.normalized
       )
     );
-  if (t.index = e.index != null ? new Wt(
+  if (t.index = e.index != null ? new Ht(
     e.index.array,
     e.index.itemSize,
     e.index.normalized
   ) : null, e.boundingBox != null) {
     const { min: n, max: r } = e.boundingBox;
-    t.boundingBox = new Xe(
+    t.boundingBox = new We(
       new U(n.x, n.y, n.z),
       new U(r.x, r.y, r.z)
     );
   }
   if (e.boundingSphere != null) {
     const { center: n, radius: r } = e.boundingSphere;
-    t.boundingSphere = new ke(
+    t.boundingSphere = new Ve(
       new U(n.x, n.y, n.z),
       r
     );
   }
   return t;
 }
-function Pr(e) {
-  return e instanceof qe ? e.getContext().getExtension("OES_texture_float_linear") != null : e.backend.hasFeature?.("float32-filterable") ?? !1;
+function wr(e) {
+  return e instanceof Ye ? e.getContext().getExtension("OES_texture_float_linear") != null : e.backend.hasFeature?.("float32-filterable") ?? !1;
 }
-const hn = 128, fn = 128, ln = 64, un = "9627216cc50057994c98a2118f3c4a23765d43b9", xr = `https://media.githubusercontent.com/media/takram-design-engineering/three-geospatial/${un}/packages/core/assets/stbn.bin`, yn = "This is not an object", dn = "This is not a Float16Array object", Jt = "This constructor is not a subclass of Float16Array", we = "The constructor property value is not an object", pn = "Species constructor didn't return TypedArray object", An = "Derived constructor created TypedArray object which was too small length", J = "Attempting to access detached ArrayBuffer", xt = "Cannot convert undefined or null to object", Nt = "Cannot mix BigInt and other types, use explicit conversions", $t = "@@iterator property is not callable", Qt = "Reduce of empty array with no initial value", gn = "The comparison function must be either a function or undefined", St = "Offset is out of bounds";
+const on = "This is not an object", cn = "This is not a Float16Array object", qt = "This constructor is not a subclass of Float16Array", pe = "The constructor property value is not an object", an = "Species constructor didn't return TypedArray object", hn = "Derived constructor created TypedArray object which was too small length", J = "Attempting to access detached ArrayBuffer", Pt = "Cannot convert undefined or null to object", xt = "Cannot mix BigInt and other types, use explicit conversions", kt = "@@iterator property is not callable", Jt = "Reduce of empty array with no initial value", fn = "The comparison function must be either a function or undefined", St = "Offset is out of bounds";
 function g(e) {
-  return (t, ...n) => m(e, t, n);
+  return (t, ...n) => S(e, t, n);
 }
 function H(e, t) {
   return g(
@@ -80,32 +80,32 @@ function H(e, t) {
   );
 }
 const {
-  apply: m,
-  construct: k,
-  defineProperty: Zt,
-  get: _t,
+  apply: S,
+  construct: q,
+  defineProperty: $t,
+  get: mt,
   getOwnPropertyDescriptor: v,
   getPrototypeOf: tt,
-  has: Rt,
-  ownKeys: Te,
-  set: Kt,
-  setPrototypeOf: be
-} = Reflect, wn = Proxy, {
-  EPSILON: Tn,
-  MAX_SAFE_INTEGER: te,
-  isFinite: me,
+  has: Nt,
+  ownKeys: Ae,
+  set: Qt,
+  setPrototypeOf: ge
+} = Reflect, ln = Proxy, {
+  EPSILON: un,
+  MAX_SAFE_INTEGER: Zt,
+  isFinite: we,
   isNaN: G
 } = Number, {
   iterator: x,
-  species: bn,
+  species: yn,
   toStringTag: Mt,
-  for: mn
+  for: dn
 } = Symbol, j = Object, {
   create: At,
   defineProperty: et,
-  freeze: Sn,
-  is: ee
-} = j, Lt = j.prototype, _n = (
+  freeze: pn,
+  is: Kt
+} = j, Lt = j.prototype, An = (
   /** @type {any} */
   Lt.__lookupGetter__ ? g(
     /** @type {any} */
@@ -113,32 +113,32 @@ const {
   ) : (e, t) => {
     if (e == null)
       throw w(
-        xt
+        Pt
       );
     let n = j(e);
     do {
       const r = v(n, t);
       if (r !== void 0)
-        return L(r, "get") ? r.get : void 0;
+        return R(r, "get") ? r.get : void 0;
     } while ((n = tt(n)) !== null);
   }
-), L = (
+), R = (
   /** @type {any} */
   j.hasOwn || g(Lt.hasOwnProperty)
-), Se = Array, _e = Se.isArray, gt = Se.prototype, En = g(gt.join), In = g(gt.push), On = g(
+), Te = Array, be = Te.isArray, gt = Te.prototype, gn = g(gt.join), wn = g(gt.push), Tn = g(
   gt.toLocaleString
-), Bt = gt[x], Pn = g(Bt), {
-  abs: xn,
-  trunc: Ee
-} = Math, wt = ArrayBuffer, Nn = wt.isView, Ie = wt.prototype, Rn = g(Ie.slice), Ln = H(Ie, "byteLength"), Ut = typeof SharedArrayBuffer < "u" ? SharedArrayBuffer : null, Un = Ut && H(Ut.prototype, "byteLength"), Dt = tt(Uint8Array), Cn = Dt.from, b = Dt.prototype, Fn = b[x], Mn = g(b.keys), Bn = g(
+), Bt = gt[x], bn = g(Bt), {
+  abs: Sn,
+  trunc: Se
+} = Math, wt = ArrayBuffer, mn = wt.isView, me = wt.prototype, _n = g(me.slice), En = H(me, "byteLength"), Rt = typeof SharedArrayBuffer < "u" ? SharedArrayBuffer : null, In = Rt && H(Rt.prototype, "byteLength"), Ft = tt(Uint8Array), On = Ft.from, b = Ft.prototype, Pn = b[x], xn = g(b.keys), Nn = g(
   b.values
-), Dn = g(
+), Ln = g(
   b.entries
-), vn = g(b.set), ne = g(
+), Rn = g(b.set), te = g(
   b.reverse
-), Gn = g(b.fill), jn = g(
+), Un = g(b.fill), Cn = g(
   b.copyWithin
-), re = g(b.sort), Y = g(b.slice), zn = g(
+), ee = g(b.sort), Y = g(b.slice), Mn = g(
   b.subarray
 ), T = H(
   b,
@@ -149,16 +149,16 @@ const {
 ), y = H(
   b,
   "length"
-), Oe = H(
+), _e = H(
   b,
   Mt
-), Hn = Uint8Array, S = Uint16Array, se = (...e) => m(Cn, S, e), vt = Uint32Array, Wn = Float32Array, F = tt([][x]()), Tt = g(F.next), Vn = g((function* () {
-})().next), Yn = tt(F), Xn = DataView.prototype, kn = g(
-  Xn.getUint16
-), w = TypeError, Et = RangeError, Pe = WeakSet, xe = Pe.prototype, qn = g(xe.add), Jn = g(xe.has), bt = WeakMap, Gt = bt.prototype, at = g(Gt.get), $n = g(Gt.has), jt = g(Gt.set), Ne = new bt(), Qn = At(null, {
+), Bn = Uint8Array, m = Uint16Array, ne = (...e) => S(On, m, e), Dt = Uint32Array, Fn = Float32Array, M = tt([][x]()), Tt = g(M.next), Dn = g((function* () {
+})().next), vn = tt(M), Gn = DataView.prototype, jn = g(
+  Gn.getUint16
+), w = TypeError, _t = RangeError, Ee = WeakSet, Ie = Ee.prototype, zn = g(Ie.add), Hn = g(Ie.has), bt = WeakMap, vt = bt.prototype, at = g(vt.get), Wn = g(vt.has), Gt = g(vt.set), Oe = new bt(), Vn = At(null, {
   next: {
     value: function() {
-      const t = at(Ne, this);
+      const t = at(Oe, this);
       return Tt(t);
     }
   },
@@ -168,44 +168,44 @@ const {
     }
   }
 });
-function q(e) {
-  if (e[x] === Bt && F.next === Tt)
+function k(e) {
+  if (e[x] === Bt && M.next === Tt)
     return e;
-  const t = At(Qn);
-  return jt(Ne, t, Pn(e)), t;
+  const t = At(Vn);
+  return Gt(Oe, t, bn(e)), t;
 }
-const Re = new bt(), Le = At(Yn, {
+const Pe = new bt(), xe = At(vn, {
   next: {
     value: function() {
-      const t = at(Re, this);
-      return Vn(t);
+      const t = at(Pe, this);
+      return Dn(t);
     },
     writable: !0,
     configurable: !0
   }
 });
-for (const e of Te(F))
-  e !== "next" && et(Le, e, v(F, e));
-function oe(e) {
-  const t = At(Le);
-  return jt(Re, t, e), t;
+for (const e of Ae(M))
+  e !== "next" && et(xe, e, v(M, e));
+function re(e) {
+  const t = At(xe);
+  return Gt(Pe, t, e), t;
 }
 function ht(e) {
   return e !== null && typeof e == "object" || typeof e == "function";
 }
-function ie(e) {
+function se(e) {
   return e !== null && typeof e == "object";
 }
 function ft(e) {
-  return Oe(e) !== void 0;
+  return _e(e) !== void 0;
 }
-function Ct(e) {
-  const t = Oe(e);
+function Ut(e) {
+  const t = _e(e);
   return t === "BigInt64Array" || t === "BigUint64Array";
 }
-function Zn(e) {
+function Yn(e) {
   try {
-    return _e(e) ? !1 : (Ln(
+    return be(e) ? !1 : (En(
       /** @type {any} */
       e
     ), !0);
@@ -213,11 +213,11 @@ function Zn(e) {
     return !1;
   }
 }
-function Ue(e) {
-  if (Ut === null)
+function Ne(e) {
+  if (Rt === null)
     return !1;
   try {
-    return Un(
+    return In(
       /** @type {any} */
       e
     ), !0;
@@ -225,70 +225,70 @@ function Ue(e) {
     return !1;
   }
 }
-function Kn(e) {
-  return Zn(e) || Ue(e);
+function Xn(e) {
+  return Yn(e) || Ne(e);
 }
-function ce(e) {
-  return _e(e) ? e[x] === Bt && F.next === Tt : !1;
+function oe(e) {
+  return be(e) ? e[x] === Bt && M.next === Tt : !1;
 }
-function tr(e) {
-  return ft(e) ? e[x] === Fn && F.next === Tt : !1;
+function qn(e) {
+  return ft(e) ? e[x] === Pn && M.next === Tt : !1;
 }
 function nt(e) {
   if (typeof e != "string")
     return !1;
   const t = +e;
-  return e !== t + "" || !me(t) ? !1 : t === Ee(t);
+  return e !== t + "" || !we(t) ? !1 : t === Se(t);
 }
-const lt = mn("__Float16Array__");
-function er(e) {
-  if (!ie(e))
+const lt = dn("__Float16Array__");
+function kn(e) {
+  if (!se(e))
     return !1;
   const t = tt(e);
-  if (!ie(t))
+  if (!se(t))
     return !1;
   const n = t.constructor;
   if (n === void 0)
     return !1;
   if (!ht(n))
-    throw w(we);
-  return Rt(n, lt);
+    throw w(pe);
+  return Nt(n, lt);
 }
-const Ft = 1 / Tn;
-function nr(e) {
-  return e + Ft - Ft;
+const Ct = 1 / un;
+function Jn(e) {
+  return e + Ct - Ct;
 }
-const Ce = 6103515625e-14, rr = 65504, Fe = 9765625e-10, ae = Fe * Ce, sr = Fe * Ft;
-function or(e) {
+const Le = 6103515625e-14, $n = 65504, Re = 9765625e-10, ie = Re * Le, Qn = Re * Ct;
+function Zn(e) {
   const t = +e;
-  if (!me(t) || t === 0)
+  if (!we(t) || t === 0)
     return t;
-  const n = t > 0 ? 1 : -1, r = xn(t);
-  if (r < Ce)
-    return n * nr(r / ae) * ae;
-  const s = (1 + sr) * r, o = s - (s - r);
-  return o > rr || G(o) ? n * (1 / 0) : n * o;
+  const n = t > 0 ? 1 : -1, r = Sn(t);
+  if (r < Le)
+    return n * Jn(r / ie) * ie;
+  const o = (1 + Qn) * r, s = o - (o - r);
+  return s > $n || G(s) ? n * (1 / 0) : n * s;
 }
-const Me = new wt(4), Be = new Wn(Me), De = new vt(Me), E = new S(512), I = new Hn(512);
+const Ue = new wt(4), Ce = new Fn(Ue), Me = new Dt(Ue), E = new m(512), I = new Bn(512);
 for (let e = 0; e < 256; ++e) {
   const t = e - 127;
   t < -24 ? (E[e] = 0, E[e | 256] = 32768, I[e] = 24, I[e | 256] = 24) : t < -14 ? (E[e] = 1024 >> -t - 14, E[e | 256] = 1024 >> -t - 14 | 32768, I[e] = -t - 1, I[e | 256] = -t - 1) : t <= 15 ? (E[e] = t + 15 << 10, E[e | 256] = t + 15 << 10 | 32768, I[e] = 13, I[e | 256] = 13) : t < 128 ? (E[e] = 31744, E[e | 256] = 64512, I[e] = 24, I[e | 256] = 24) : (E[e] = 31744, E[e | 256] = 64512, I[e] = 13, I[e | 256] = 13);
 }
 function P(e) {
-  Be[0] = or(e);
-  const t = De[0], n = t >> 23 & 511;
+  Ce[0] = Zn(e);
+  const t = Me[0], n = t >> 23 & 511;
   return E[n] + ((t & 8388607) >> I[n]);
 }
-const zt = new vt(2048);
+const jt = new Dt(2048);
 for (let e = 1; e < 1024; ++e) {
   let t = e << 13, n = 0;
   for (; (t & 8388608) === 0; )
     t <<= 1, n -= 8388608;
-  t &= -8388609, n += 947912704, zt[e] = t | n;
+  t &= -8388609, n += 947912704, jt[e] = t | n;
 }
 for (let e = 1024; e < 2048; ++e)
-  zt[e] = 939524096 + (e - 1024 << 13);
-const W = new vt(64);
+  jt[e] = 939524096 + (e - 1024 << 13);
+const W = new Dt(64);
 for (let e = 1; e < 31; ++e)
   W[e] = e << 23;
 W[31] = 1199570944;
@@ -296,42 +296,42 @@ W[32] = 2147483648;
 for (let e = 33; e < 63; ++e)
   W[e] = 2147483648 + (e - 32 << 23);
 W[63] = 3347054592;
-const ve = new S(64);
+const Be = new m(64);
 for (let e = 1; e < 64; ++e)
-  e !== 32 && (ve[e] = 1024);
-function d(e) {
+  e !== 32 && (Be[e] = 1024);
+function p(e) {
   const t = e >> 10;
-  return De[0] = zt[ve[t] + (e & 1023)] + W[t], Be[0];
+  return Me[0] = jt[Be[t] + (e & 1023)] + W[t], Ce[0];
 }
-function R(e) {
+function L(e) {
   const t = +e;
-  return G(t) || t === 0 ? 0 : Ee(t);
+  return G(t) || t === 0 ? 0 : Se(t);
 }
-function It(e) {
-  const t = R(e);
-  return t < 0 ? 0 : t < te ? t : te;
+function Et(e) {
+  const t = L(e);
+  return t < 0 ? 0 : t < Zt ? t : Zt;
 }
 function rt(e, t) {
   if (!ht(e))
-    throw w(yn);
+    throw w(on);
   const n = e.constructor;
   if (n === void 0)
     return t;
   if (!ht(n))
-    throw w(we);
-  const r = n[bn];
+    throw w(pe);
+  const r = n[yn];
   return r ?? t;
 }
 function $(e) {
-  if (Ue(e))
+  if (Ne(e))
     return !1;
   try {
-    return Rn(e, 0, 0), !1;
+    return _n(e, 0, 0), !1;
   } catch {
   }
   return !0;
 }
-function he(e, t) {
+function ce(e, t) {
   const n = G(e), r = G(t);
   if (n && r)
     return 0;
@@ -342,46 +342,46 @@ function he(e, t) {
   if (e > t)
     return 1;
   if (e === 0 && t === 0) {
-    const s = ee(e, 0), o = ee(t, 0);
-    if (!s && o)
+    const o = Kt(e, 0), s = Kt(t, 0);
+    if (!o && s)
       return -1;
-    if (s && !o)
+    if (o && !s)
       return 1;
   }
   return 0;
 }
-const Ht = 2, ut = new bt();
+const zt = 2, ut = new bt();
 function D(e) {
-  return $n(ut, e) || !Nn(e) && er(e);
+  return Wn(ut, e) || !mn(e) && kn(e);
 }
 function u(e) {
   if (!D(e))
-    throw w(dn);
+    throw w(cn);
 }
 function st(e, t) {
   const n = D(e), r = ft(e);
   if (!n && !r)
-    throw w(pn);
+    throw w(an);
   if (typeof t == "number") {
-    let s;
+    let o;
     if (n) {
-      const o = l(e);
-      s = y(o);
+      const s = l(e);
+      o = y(s);
     } else
-      s = y(e);
-    if (s < t)
+      o = y(e);
+    if (o < t)
       throw w(
-        An
+        hn
       );
   }
-  if (Ct(e))
-    throw w(Nt);
+  if (Ut(e))
+    throw w(xt);
 }
 function l(e) {
   const t = at(ut, e);
   if (t !== void 0) {
-    const s = T(t);
-    if ($(s))
+    const o = T(t);
+    if ($(o))
       throw w(J);
     return t;
   }
@@ -391,7 +391,7 @@ function l(e) {
   );
   if ($(n))
     throw w(J);
-  const r = k(A, [
+  const r = q(A, [
     n,
     /** @type {any} */
     e.byteOffset,
@@ -400,76 +400,76 @@ function l(e) {
   ], e.constructor);
   return at(ut, r);
 }
-function fe(e) {
+function ae(e) {
   const t = y(e), n = [];
   for (let r = 0; r < t; ++r)
-    n[r] = d(e[r]);
+    n[r] = p(e[r]);
   return n;
 }
-const Ge = new Pe();
-for (const e of Te(b)) {
+const Fe = new Ee();
+for (const e of Ae(b)) {
   if (e === Mt)
     continue;
   const t = v(b, e);
-  L(t, "get") && typeof t.get == "function" && qn(Ge, t.get);
+  R(t, "get") && typeof t.get == "function" && zn(Fe, t.get);
 }
-const ir = Sn(
+const Kn = pn(
   /** @type {ProxyHandler<Float16BitsArray>} */
   {
     get(e, t, n) {
-      return nt(t) && L(e, t) ? d(_t(e, t)) : Jn(Ge, _n(e, t)) ? _t(e, t) : _t(e, t, n);
+      return nt(t) && R(e, t) ? p(mt(e, t)) : Hn(Fe, An(e, t)) ? mt(e, t) : mt(e, t, n);
     },
     set(e, t, n, r) {
-      return nt(t) && L(e, t) ? Kt(e, t, P(n)) : Kt(e, t, n, r);
+      return nt(t) && R(e, t) ? Qt(e, t, P(n)) : Qt(e, t, n, r);
     },
     getOwnPropertyDescriptor(e, t) {
-      if (nt(t) && L(e, t)) {
+      if (nt(t) && R(e, t)) {
         const n = v(e, t);
-        return n.value = d(n.value), n;
+        return n.value = p(n.value), n;
       }
       return v(e, t);
     },
     defineProperty(e, t, n) {
-      return nt(t) && L(e, t) && L(n, "value") && (n.value = P(n.value)), Zt(e, t, n);
+      return nt(t) && R(e, t) && R(n, "value") && (n.value = P(n.value)), $t(e, t, n);
     }
   }
 );
 class A {
   /** @see https://tc39.es/ecma262/#sec-typedarray */
   constructor(t, n, r) {
-    let s;
+    let o;
     if (D(t))
-      s = k(S, [l(t)], new.target);
-    else if (ht(t) && !Kn(t)) {
+      o = q(m, [l(t)], new.target);
+    else if (ht(t) && !Xn(t)) {
       let i, c;
       if (ft(t)) {
         i = t, c = y(t);
         const a = T(t);
         if ($(a))
           throw w(J);
-        if (Ct(t))
-          throw w(Nt);
+        if (Ut(t))
+          throw w(xt);
         const h = new wt(
-          c * Ht
+          c * zt
         );
-        s = k(S, [h], new.target);
+        o = q(m, [h], new.target);
       } else {
         const a = t[x];
         if (a != null && typeof a != "function")
-          throw w($t);
-        a != null ? ce(t) ? (i = t, c = t.length) : (i = [.../** @type {Iterable<unknown>} */
+          throw w(kt);
+        a != null ? oe(t) ? (i = t, c = t.length) : (i = [.../** @type {Iterable<unknown>} */
         t], c = i.length) : (i = /** @type {ArrayLike<unknown>} */
-        t, c = It(i.length)), s = k(S, [c], new.target);
+        t, c = Et(i.length)), o = q(m, [c], new.target);
       }
       for (let a = 0; a < c; ++a)
-        s[a] = P(i[a]);
+        o[a] = P(i[a]);
     } else
-      s = k(S, arguments, new.target);
-    const o = (
+      o = q(m, arguments, new.target);
+    const s = (
       /** @type {any} */
-      new wn(s, ir)
+      new ln(o, Kn)
     );
-    return jt(ut, o, s), o;
+    return Gt(ut, s, o), s;
   }
   /**
    * limitation: `Object.getOwnPropertyNames(Float16Array)` or `Reflect.ownKeys(Float16Array)` include this key
@@ -477,60 +477,60 @@ class A {
    */
   static from(t, ...n) {
     const r = this;
-    if (!Rt(r, lt))
+    if (!Nt(r, lt))
       throw w(
-        Jt
+        qt
       );
     if (r === A) {
       if (D(t) && n.length === 0) {
-        const f = l(t), p = new S(
+        const f = l(t), d = new m(
           T(f),
           C(f),
           y(f)
         );
         return new A(
-          T(Y(p))
+          T(Y(d))
         );
       }
       if (n.length === 0)
         return new A(
           T(
-            se(t, P)
+            ne(t, P)
           )
         );
       const a = n[0], h = n[1];
       return new A(
         T(
-          se(t, function(f, ...p) {
+          ne(t, function(f, ...d) {
             return P(
-              m(a, this, [f, ...q(p)])
+              S(a, this, [f, ...k(d)])
             );
           }, h)
         )
       );
     }
-    let s, o;
+    let o, s;
     const i = t[x];
     if (i != null && typeof i != "function")
-      throw w($t);
+      throw w(kt);
     if (i != null)
-      ce(t) ? (s = t, o = t.length) : tr(t) ? (s = t, o = y(t)) : (s = [...t], o = s.length);
+      oe(t) ? (o = t, s = t.length) : qn(t) ? (o = t, s = y(t)) : (o = [...t], s = o.length);
     else {
       if (t == null)
         throw w(
-          xt
+          Pt
         );
-      s = j(t), o = It(s.length);
+      o = j(t), s = Et(o.length);
     }
-    const c = new r(o);
+    const c = new r(s);
     if (n.length === 0)
-      for (let a = 0; a < o; ++a)
+      for (let a = 0; a < s; ++a)
         c[a] = /** @type {number} */
-        s[a];
+        o[a];
     else {
       const a = n[0], h = n[1];
-      for (let f = 0; f < o; ++f)
-        c[f] = m(a, h, [s[f], f]);
+      for (let f = 0; f < s; ++f)
+        c[f] = S(a, h, [o[f], f]);
     }
     return c;
   }
@@ -540,27 +540,27 @@ class A {
    */
   static of(...t) {
     const n = this;
-    if (!Rt(n, lt))
+    if (!Nt(n, lt))
       throw w(
-        Jt
+        qt
       );
     const r = t.length;
     if (n === A) {
-      const o = new A(r), i = l(o);
+      const s = new A(r), i = l(s);
       for (let c = 0; c < r; ++c)
         i[c] = P(t[c]);
-      return o;
+      return s;
     }
-    const s = new n(r);
-    for (let o = 0; o < r; ++o)
-      s[o] = t[o];
-    return s;
+    const o = new n(r);
+    for (let s = 0; s < r; ++s)
+      o[s] = t[s];
+    return o;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.keys */
   keys() {
     u(this);
     const t = l(this);
-    return Mn(t);
+    return xn(t);
   }
   /**
    * limitation: returns a object whose prototype is not `%ArrayIteratorPrototype%`
@@ -569,9 +569,9 @@ class A {
   values() {
     u(this);
     const t = l(this);
-    return oe((function* () {
-      for (const n of Bn(t))
-        yield d(n);
+    return re((function* () {
+      for (const n of Nn(t))
+        yield p(n);
     })());
   }
   /**
@@ -581,28 +581,28 @@ class A {
   entries() {
     u(this);
     const t = l(this);
-    return oe((function* () {
-      for (const [n, r] of Dn(t))
+    return re((function* () {
+      for (const [n, r] of Ln(t))
         yield (
           /** @type {[number, number]} */
-          [n, d(r)]
+          [n, p(r)]
         );
     })());
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.at */
   at(t) {
     u(this);
-    const n = l(this), r = y(n), s = R(t), o = s >= 0 ? s : r + s;
-    if (!(o < 0 || o >= r))
-      return d(n[o]);
+    const n = l(this), r = y(n), o = L(t), s = o >= 0 ? o : r + o;
+    if (!(s < 0 || s >= r))
+      return p(n[s]);
   }
   /** @see https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.with */
   with(t, n) {
     u(this);
-    const r = l(this), s = y(r), o = R(t), i = o >= 0 ? o : s + o, c = +n;
-    if (i < 0 || i >= s)
-      throw Et(St);
-    const a = new S(
+    const r = l(this), o = y(r), s = L(t), i = s >= 0 ? s : o + s, c = +n;
+    if (i < 0 || i >= o)
+      throw _t(St);
+    const a = new m(
       T(r),
       C(r),
       y(r)
@@ -616,22 +616,22 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.map */
   map(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0], i = rt(r, A);
+    const r = l(this), o = y(r), s = n[0], i = rt(r, A);
     if (i === A) {
-      const a = new A(s), h = l(a);
-      for (let f = 0; f < s; ++f) {
-        const p = d(r[f]);
+      const a = new A(o), h = l(a);
+      for (let f = 0; f < o; ++f) {
+        const d = p(r[f]);
         h[f] = P(
-          m(t, o, [p, f, this])
+          S(t, s, [d, f, this])
         );
       }
       return a;
     }
-    const c = new i(s);
-    st(c, s);
-    for (let a = 0; a < s; ++a) {
-      const h = d(r[a]);
-      c[a] = m(t, o, [h, a, this]);
+    const c = new i(o);
+    st(c, o);
+    for (let a = 0; a < o; ++a) {
+      const h = p(r[a]);
+      c[a] = S(t, s, [h, a, this]);
     }
     return (
       /** @type {any} */
@@ -641,10 +641,10 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.filter */
   filter(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0], i = [];
-    for (let h = 0; h < s; ++h) {
-      const f = d(r[h]);
-      m(t, o, [f, h, this]) && In(i, f);
+    const r = l(this), o = y(r), s = n[0], i = [];
+    for (let h = 0; h < o; ++h) {
+      const f = p(r[h]);
+      S(t, s, [f, h, this]) && wn(i, f);
     }
     const c = rt(r, A), a = new c(i);
     return st(a), /** @type {any} */
@@ -653,44 +653,44 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.reduce */
   reduce(t, ...n) {
     u(this);
-    const r = l(this), s = y(r);
-    if (s === 0 && n.length === 0)
-      throw w(Qt);
-    let o, i;
-    n.length === 0 ? (o = d(r[0]), i = 1) : (o = n[0], i = 0);
-    for (let c = i; c < s; ++c)
-      o = t(
-        o,
-        d(r[c]),
+    const r = l(this), o = y(r);
+    if (o === 0 && n.length === 0)
+      throw w(Jt);
+    let s, i;
+    n.length === 0 ? (s = p(r[0]), i = 1) : (s = n[0], i = 0);
+    for (let c = i; c < o; ++c)
+      s = t(
+        s,
+        p(r[c]),
         c,
         this
       );
-    return o;
+    return s;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.reduceright */
   reduceRight(t, ...n) {
     u(this);
-    const r = l(this), s = y(r);
-    if (s === 0 && n.length === 0)
-      throw w(Qt);
-    let o, i;
-    n.length === 0 ? (o = d(r[s - 1]), i = s - 2) : (o = n[0], i = s - 1);
+    const r = l(this), o = y(r);
+    if (o === 0 && n.length === 0)
+      throw w(Jt);
+    let s, i;
+    n.length === 0 ? (s = p(r[o - 1]), i = o - 2) : (s = n[0], i = o - 1);
     for (let c = i; c >= 0; --c)
-      o = t(
-        o,
-        d(r[c]),
+      s = t(
+        s,
+        p(r[c]),
         c,
         this
       );
-    return o;
+    return s;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.foreach */
   forEach(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0];
-    for (let i = 0; i < s; ++i)
-      m(t, o, [
-        d(r[i]),
+    const r = l(this), o = y(r), s = n[0];
+    for (let i = 0; i < o; ++i)
+      S(t, s, [
+        p(r[i]),
         i,
         this
       ]);
@@ -698,20 +698,20 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.find */
   find(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0];
-    for (let i = 0; i < s; ++i) {
-      const c = d(r[i]);
-      if (m(t, o, [c, i, this]))
+    const r = l(this), o = y(r), s = n[0];
+    for (let i = 0; i < o; ++i) {
+      const c = p(r[i]);
+      if (S(t, s, [c, i, this]))
         return c;
     }
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.findindex */
   findIndex(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0];
-    for (let i = 0; i < s; ++i) {
-      const c = d(r[i]);
-      if (m(t, o, [c, i, this]))
+    const r = l(this), o = y(r), s = n[0];
+    for (let i = 0; i < o; ++i) {
+      const c = p(r[i]);
+      if (S(t, s, [c, i, this]))
         return i;
     }
     return -1;
@@ -719,20 +719,20 @@ class A {
   /** @see https://tc39.es/proposal-array-find-from-last/index.html#sec-%typedarray%.prototype.findlast */
   findLast(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0];
-    for (let i = s - 1; i >= 0; --i) {
-      const c = d(r[i]);
-      if (m(t, o, [c, i, this]))
+    const r = l(this), o = y(r), s = n[0];
+    for (let i = o - 1; i >= 0; --i) {
+      const c = p(r[i]);
+      if (S(t, s, [c, i, this]))
         return c;
     }
   }
   /** @see https://tc39.es/proposal-array-find-from-last/index.html#sec-%typedarray%.prototype.findlastindex */
   findLastIndex(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0];
-    for (let i = s - 1; i >= 0; --i) {
-      const c = d(r[i]);
-      if (m(t, o, [c, i, this]))
+    const r = l(this), o = y(r), s = n[0];
+    for (let i = o - 1; i >= 0; --i) {
+      const c = p(r[i]);
+      if (S(t, s, [c, i, this]))
         return i;
     }
     return -1;
@@ -740,10 +740,10 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.every */
   every(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0];
-    for (let i = 0; i < s; ++i)
-      if (!m(t, o, [
-        d(r[i]),
+    const r = l(this), o = y(r), s = n[0];
+    for (let i = 0; i < o; ++i)
+      if (!S(t, s, [
+        p(r[i]),
         i,
         this
       ]))
@@ -753,10 +753,10 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.some */
   some(t, ...n) {
     u(this);
-    const r = l(this), s = y(r), o = n[0];
-    for (let i = 0; i < s; ++i)
-      if (m(t, o, [
-        d(r[i]),
+    const r = l(this), o = y(r), s = n[0];
+    for (let i = 0; i < o; ++i)
+      if (S(t, s, [
+        p(r[i]),
         i,
         this
       ]))
@@ -766,44 +766,44 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.set */
   set(t, ...n) {
     u(this);
-    const r = l(this), s = R(n[0]);
-    if (s < 0)
-      throw Et(St);
+    const r = l(this), o = L(n[0]);
+    if (o < 0)
+      throw _t(St);
     if (t == null)
       throw w(
-        xt
+        Pt
       );
-    if (Ct(t))
+    if (Ut(t))
       throw w(
-        Nt
+        xt
       );
     if (D(t))
-      return vn(
+      return Rn(
         l(this),
         l(t),
-        s
+        o
       );
     if (ft(t)) {
       const a = T(t);
       if ($(a))
         throw w(J);
     }
-    const o = y(r), i = j(t), c = It(i.length);
-    if (s === 1 / 0 || c + s > o)
-      throw Et(St);
+    const s = y(r), i = j(t), c = Et(i.length);
+    if (o === 1 / 0 || c + o > s)
+      throw _t(St);
     for (let a = 0; a < c; ++a)
-      r[a + s] = P(i[a]);
+      r[a + o] = P(i[a]);
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.reverse */
   reverse() {
     u(this);
     const t = l(this);
-    return ne(t), this;
+    return te(t), this;
   }
   /** @see https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.toReversed */
   toReversed() {
     u(this);
-    const t = l(this), n = new S(
+    const t = l(this), n = new m(
       T(t),
       C(t),
       y(t)
@@ -811,91 +811,91 @@ class A {
       T(
         Y(n)
       )
-    ), s = l(r);
-    return ne(s), r;
+    ), o = l(r);
+    return te(o), r;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.fill */
   fill(t, ...n) {
     u(this);
     const r = l(this);
-    return Gn(
+    return Un(
       r,
       P(t),
-      ...q(n)
+      ...k(n)
     ), this;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.copywithin */
   copyWithin(t, n, ...r) {
     u(this);
-    const s = l(this);
-    return jn(s, t, n, ...q(r)), this;
+    const o = l(this);
+    return Cn(o, t, n, ...k(r)), this;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.sort */
   sort(t) {
     u(this);
-    const n = l(this), r = t !== void 0 ? t : he;
-    return re(n, (s, o) => r(d(s), d(o))), this;
+    const n = l(this), r = t !== void 0 ? t : ce;
+    return ee(n, (o, s) => r(p(o), p(s))), this;
   }
   /** @see https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.toSorted */
   toSorted(t) {
     u(this);
     const n = l(this);
     if (t !== void 0 && typeof t != "function")
-      throw new w(gn);
-    const r = t !== void 0 ? t : he, s = new S(
+      throw new w(fn);
+    const r = t !== void 0 ? t : ce, o = new m(
       T(n),
       C(n),
       y(n)
-    ), o = new A(
+    ), s = new A(
       T(
-        Y(s)
+        Y(o)
       )
-    ), i = l(o);
-    return re(i, (c, a) => r(d(c), d(a))), o;
+    ), i = l(s);
+    return ee(i, (c, a) => r(p(c), p(a))), s;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.slice */
   slice(t, n) {
     u(this);
-    const r = l(this), s = rt(r, A);
-    if (s === A) {
-      const We = new S(
+    const r = l(this), o = rt(r, A);
+    if (o === A) {
+      const je = new m(
         T(r),
         C(r),
         y(r)
       );
       return new A(
         T(
-          Y(We, t, n)
+          Y(je, t, n)
         )
       );
     }
-    const o = y(r), i = R(t), c = n === void 0 ? o : R(n);
+    const s = y(r), i = L(t), c = n === void 0 ? s : L(n);
     let a;
-    i === -1 / 0 ? a = 0 : i < 0 ? a = o + i > 0 ? o + i : 0 : a = o < i ? o : i;
+    i === -1 / 0 ? a = 0 : i < 0 ? a = s + i > 0 ? s + i : 0 : a = s < i ? s : i;
     let h;
-    c === -1 / 0 ? h = 0 : c < 0 ? h = o + c > 0 ? o + c : 0 : h = o < c ? o : c;
-    const f = h - a > 0 ? h - a : 0, p = new s(f);
-    if (st(p, f), f === 0)
-      return p;
+    c === -1 / 0 ? h = 0 : c < 0 ? h = s + c > 0 ? s + c : 0 : h = s < c ? s : c;
+    const f = h - a > 0 ? h - a : 0, d = new o(f);
+    if (st(d, f), f === 0)
+      return d;
     const O = T(r);
     if ($(O))
       throw w(J);
-    let B = 0;
+    let F = 0;
     for (; a < h; )
-      p[B] = d(r[a]), ++a, ++B;
+      d[F] = p(r[a]), ++a, ++F;
     return (
       /** @type {any} */
-      p
+      d
     );
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.subarray */
   subarray(t, n) {
     u(this);
-    const r = l(this), s = rt(r, A), o = new S(
+    const r = l(this), o = rt(r, A), s = new m(
       T(r),
       C(r),
       y(r)
-    ), i = zn(o, t, n), c = new s(
+    ), i = Mn(s, t, n), c = new o(
       T(i),
       C(i),
       y(i)
@@ -906,40 +906,40 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.indexof */
   indexOf(t, ...n) {
     u(this);
-    const r = l(this), s = y(r);
-    let o = R(n[0]);
-    if (o === 1 / 0)
+    const r = l(this), o = y(r);
+    let s = L(n[0]);
+    if (s === 1 / 0)
       return -1;
-    o < 0 && (o += s, o < 0 && (o = 0));
-    for (let i = o; i < s; ++i)
-      if (L(r, i) && d(r[i]) === t)
+    s < 0 && (s += o, s < 0 && (s = 0));
+    for (let i = s; i < o; ++i)
+      if (R(r, i) && p(r[i]) === t)
         return i;
     return -1;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.lastindexof */
   lastIndexOf(t, ...n) {
     u(this);
-    const r = l(this), s = y(r);
-    let o = n.length >= 1 ? R(n[0]) : s - 1;
-    if (o === -1 / 0)
+    const r = l(this), o = y(r);
+    let s = n.length >= 1 ? L(n[0]) : o - 1;
+    if (s === -1 / 0)
       return -1;
-    o >= 0 ? o = o < s - 1 ? o : s - 1 : o += s;
-    for (let i = o; i >= 0; --i)
-      if (L(r, i) && d(r[i]) === t)
+    s >= 0 ? s = s < o - 1 ? s : o - 1 : s += o;
+    for (let i = s; i >= 0; --i)
+      if (R(r, i) && p(r[i]) === t)
         return i;
     return -1;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.includes */
   includes(t, ...n) {
     u(this);
-    const r = l(this), s = y(r);
-    let o = R(n[0]);
-    if (o === 1 / 0)
+    const r = l(this), o = y(r);
+    let s = L(n[0]);
+    if (s === 1 / 0)
       return !1;
-    o < 0 && (o += s, o < 0 && (o = 0));
+    s < 0 && (s += o, s < 0 && (s = 0));
     const i = G(t);
-    for (let c = o; c < s; ++c) {
-      const a = d(r[c]);
+    for (let c = s; c < o; ++c) {
+      const a = p(r[c]);
       if (i && G(a) || a === t)
         return !0;
     }
@@ -948,14 +948,14 @@ class A {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.join */
   join(t) {
     u(this);
-    const n = l(this), r = fe(n);
-    return En(r, t);
+    const n = l(this), r = ae(n);
+    return gn(r, t);
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.tolocalestring */
   toLocaleString(...t) {
     u(this);
-    const n = l(this), r = fe(n);
-    return On(r, ...q(t));
+    const n = l(this), r = ae(n);
+    return Tn(r, ...k(t));
   }
   /** @see https://tc39.es/ecma262/#sec-get-%typedarray%.prototype-@@tostringtag */
   get [Mt]() {
@@ -967,93 +967,93 @@ class A {
   }
 }
 et(A, "BYTES_PER_ELEMENT", {
-  value: Ht
+  value: zt
 });
 et(A, lt, {});
-be(A, Dt);
+ge(A, Ft);
 const yt = A.prototype;
 et(yt, "BYTES_PER_ELEMENT", {
-  value: Ht
+  value: zt
 });
 et(yt, x, {
   value: yt.values,
   writable: !0,
   configurable: !0
 });
-be(yt, b);
-function cr(e, t, ...n) {
-  return d(
-    kn(e, t, ...q(n))
+ge(yt, b);
+function tr(e, t, ...n) {
+  return p(
+    jn(e, t, ...k(n))
   );
 }
-function Nr(e) {
+function Tr(e) {
   return e instanceof Int8Array || e instanceof Uint8Array || e instanceof Uint8ClampedArray || e instanceof Int16Array || e instanceof Uint16Array || e instanceof Int32Array || e instanceof Uint32Array || e instanceof A || e instanceof Float32Array || e instanceof Float64Array;
 }
-class ar extends K {
+class er extends K {
   constructor(t, n) {
     super(n), this.parser = t;
   }
-  load(t, n, r, s) {
-    const o = new an(this.manager);
-    o.setRequestHeader(this.requestHeader), o.setPath(this.path), o.setWithCredentials(this.withCredentials), o.load(
+  load(t, n, r, o) {
+    const s = new sn(this.manager);
+    s.setRequestHeader(this.requestHeader), s.setPath(this.path), s.setWithCredentials(this.withCredentials), s.load(
       t,
       (i) => {
         try {
           n(this.parser(i));
         } catch (c) {
-          s != null ? s(c) : console.error(c), this.manager.itemError(t);
+          o != null ? o(c) : console.error(c), this.manager.itemError(t);
         }
       },
       r,
-      s
+      o
     );
   }
 }
-function hr(e) {
-  const t = e instanceof Int8Array ? $e : e instanceof Uint8Array ? Yt : e instanceof Uint8ClampedArray ? Yt : e instanceof Int16Array ? Qe : e instanceof Uint16Array ? Ze : e instanceof Int32Array ? Ke : e instanceof Uint32Array ? tn : e instanceof A ? en : e instanceof Float32Array ? Xt : e instanceof Float64Array ? Xt : null;
-  return Ae(t != null), t;
-}
-class fr extends K {
-  constructor(t, n, r = {}, s) {
-    super(s), this.textureClass = t, this.parser = n, this.options = {
-      format: Je,
-      minFilter: Vt,
-      magFilter: Vt,
+function nr(e) {
+  const t = e instanceof Int8Array ? qe : e instanceof Uint8Array ? Vt : e instanceof Uint8ClampedArray ? Vt : e instanceof Int16Array ? ke : e instanceof Uint16Array ? Je : e instanceof Int32Array ? $e : e instanceof Uint32Array ? Qe : e instanceof A ? Ze : e instanceof Float32Array ? Yt : e instanceof Float64Array ? Yt : null;
+  return ye(t != null), t;
+}
+class br extends K {
+  constructor(t, n, r = {}, o) {
+    super(o), this.textureClass = t, this.parser = n, this.options = {
+      format: Xe,
+      minFilter: Wt,
+      magFilter: Wt,
       ...r
     };
   }
-  load(t, n, r, s) {
-    const o = new this.textureClass(), i = new ar(this.parser, this.manager);
+  load(t, n, r, o) {
+    const s = new this.textureClass(), i = new er(this.parser, this.manager);
     return i.setRequestHeader(this.requestHeader), i.setPath(this.path), i.setWithCredentials(this.withCredentials), i.load(
       t,
       (c) => {
-        o.image.data = c instanceof A ? new Uint16Array(c.buffer) : c;
-        const { width: a, height: h, depth: f, ...p } = this.options;
-        a != null && (o.image.width = a), h != null && (o.image.height = h), "depth" in o.image && f != null && (o.image.depth = f), o.type = hr(c), Object.assign(o, p), o.needsUpdate = !0, n?.(o);
+        s.image.data = c instanceof A ? new Uint16Array(c.buffer) : c;
+        const { width: a, height: h, depth: f, ...d } = this.options;
+        a != null && (s.image.width = a), h != null && (s.image.height = h), "depth" in s.image && f != null && (s.image.depth = f), s.type = nr(c), Object.assign(s, d), s.needsUpdate = !0, n?.(s);
       },
       r,
-      s
-    ), o;
+      o
+    ), s;
   }
 }
-const z = _.clamp, Rr = _.euclideanModulo, Lr = _.inverseLerp, Ur = _.lerp, Cr = _.degToRad, Fr = _.radToDeg, Mr = _.isPowerOfTwo, Br = _.ceilPowerOfTwo, Dr = _.floorPowerOfTwo, vr = _.normalize;
-function Gr(e, t, n, r = 0, s = 1) {
-  return _.mapLinear(e, t, n, r, s);
+const z = _.clamp, Sr = _.euclideanModulo, mr = _.inverseLerp, _r = _.lerp, Er = _.degToRad, Ir = _.radToDeg, Or = _.isPowerOfTwo, Pr = _.ceilPowerOfTwo, xr = _.floorPowerOfTwo, Nr = _.normalize;
+function Lr(e, t, n, r = 0, o = 1) {
+  return _.mapLinear(e, t, n, r, o);
 }
-function jr(e, t, n, r = 0, s = 1) {
-  return z(_.mapLinear(e, t, n, r, s), r, s);
+function Rr(e, t, n, r = 0, o = 1) {
+  return z(_.mapLinear(e, t, n, r, o), r, o);
 }
-function zr(e, t, n) {
+function Ur(e, t, n) {
   return n <= e ? 0 : n >= t ? 1 : (n = (n - e) / (t - e), n * n * (3 - 2 * n));
 }
-function Hr(e) {
+function Cr(e) {
   return Math.min(Math.max(e, 0), 1);
 }
-function Wr(e, t, n, r = n) {
-  const s = Math.abs(e - t);
-  return s <= r || s <= n * Math.max(Math.abs(e), Math.abs(t));
+function Mr(e, t, n, r = n) {
+  const o = Math.abs(e - t);
+  return o <= r || o <= n * Math.max(Math.abs(e), Math.abs(t));
 }
-function Vr(e) {
+function Br(e) {
   return (t, n) => {
     t instanceof pt ? Object.defineProperty(t, n, {
       enumerable: !0,
@@ -1074,83 +1074,83 @@ function Vr(e) {
     });
   };
 }
-function le(e) {
+function he(e) {
   return typeof e == "number" ? Math.floor(e) : typeof e == "string" ? parseInt(e, 10) : typeof e == "boolean" ? +e : 0;
 }
-function Yr(e, {
+function Fr(e, {
   min: t = Number.MIN_SAFE_INTEGER,
   max: n = Number.MAX_SAFE_INTEGER
 } = {}) {
-  return (r, s) => {
-    r instanceof pt ? Object.defineProperty(r, s, {
+  return (r, o) => {
+    r instanceof pt ? Object.defineProperty(r, o, {
       enumerable: !0,
       get() {
-        const o = this.defines?.[e];
-        return o != null ? le(o) : 0;
+        const s = this.defines?.[e];
+        return s != null ? he(s) : 0;
       },
-      set(o) {
-        const i = this[s];
-        o !== i && (this.defines ??= {}, this.defines[e] = z(o, t, n).toFixed(0), this.needsUpdate = !0);
+      set(s) {
+        const i = this[o];
+        s !== i && (this.defines ??= {}, this.defines[e] = z(s, t, n).toFixed(0), this.needsUpdate = !0);
       }
-    }) : Object.defineProperty(r, s, {
+    }) : Object.defineProperty(r, o, {
       enumerable: !0,
       get() {
-        const o = this.defines.get(e);
-        return o != null ? le(o) : 0;
+        const s = this.defines.get(e);
+        return s != null ? he(s) : 0;
       },
-      set(o) {
-        const i = this[s];
-        o !== i && (this.defines.set(e, z(o, t, n).toFixed(0)), this.setChanged());
+      set(s) {
+        const i = this[o];
+        s !== i && (this.defines.set(e, z(s, t, n).toFixed(0)), this.setChanged());
       }
     });
   };
 }
-function ue(e) {
+function fe(e) {
   return typeof e == "number" ? e : typeof e == "string" ? parseFloat(e) : typeof e == "boolean" ? +e : 0;
 }
-function Xr(e, {
+function Dr(e, {
   min: t = -1 / 0,
   max: n = 1 / 0,
   precision: r = 7
 } = {}) {
-  return (s, o) => {
-    s instanceof pt ? Object.defineProperty(s, o, {
+  return (o, s) => {
+    o instanceof pt ? Object.defineProperty(o, s, {
       enumerable: !0,
       get() {
         const i = this.defines?.[e];
-        return i != null ? ue(i) : 0;
+        return i != null ? fe(i) : 0;
       },
       set(i) {
-        const c = this[o];
+        const c = this[s];
         i !== c && (this.defines ??= {}, this.defines[e] = z(i, t, n).toFixed(r), this.needsUpdate = !0);
       }
-    }) : Object.defineProperty(s, o, {
+    }) : Object.defineProperty(o, s, {
       enumerable: !0,
       get() {
         const i = this.defines.get(e);
-        return i != null ? ue(i) : 0;
+        return i != null ? fe(i) : 0;
       },
       set(i) {
-        const c = this[o];
+        const c = this[s];
         i !== c && (this.defines.set(e, z(i, t, n).toFixed(r)), this.setChanged());
       }
     });
   };
 }
-function kr(e, { validate: t } = {}) {
+function vr(e, { validate: t } = {}) {
   return (n, r) => {
     n instanceof pt ? Object.defineProperty(n, r, {
       enumerable: !0,
       get() {
         return this.defines?.[e];
       },
-      set(s) {
-        if (s !== this[r]) {
-          if (t?.(s) === !1) {
-            console.error(`Expression validation failed: ${s}`);
+      set(o) {
+        if (o !== this[r]) {
+          if (t?.(o) === !1) {
+            console.error(`Expression validation failed: ${o}`);
             return;
           }
-          this.defines ??= {}, this.defines[e] = s, this.needsUpdate = !0;
+          this.defines ??= {}, this.defines[e] = o, this.needsUpdate = !0;
         }
       }
     }) : Object.defineProperty(n, r, {
@@ -1158,120 +1158,120 @@ function kr(e, { validate: t } = {}) {
       get() {
         return this.defines.get(e);
       },
-      set(s) {
-        if (s !== this[r]) {
-          if (t?.(s) === !1) {
-            console.error(`Expression validation failed: ${s}`);
+      set(o) {
+        if (o !== this[r]) {
+          if (t?.(o) === !1) {
+            console.error(`Expression validation failed: ${o}`);
             return;
           }
-          this.defines.set(e, s), this.setChanged();
+          this.defines.set(e, o), this.setChanged();
         }
       }
     });
   };
 }
-function qr(e, ...t) {
+function Gr(e, ...t) {
   const n = {};
   for (let r = 0; r < t.length; r += 2) {
-    const s = t[r], o = t[r + 1];
-    for (const i of o)
+    const o = t[r], s = t[r + 1];
+    for (const i of s)
       n[i] = {
         enumerable: !0,
-        get: () => s[i],
+        get: () => o[i],
         set: (c) => {
-          s[i] = c;
+          o[i] = c;
         }
       };
   }
   return Object.defineProperties(e, n), e;
 }
-function Jr(e, t, n) {
+function jr(e, t, n) {
   const r = {};
-  for (const s of n)
-    r[s] = {
+  for (const o of n)
+    r[o] = {
       enumerable: !0,
-      get: () => t.uniforms[s].value,
-      set: (o) => {
-        t.uniforms[s].value = o;
+      get: () => t.uniforms[o].value,
+      set: (s) => {
+        t.uniforms[o].value = s;
       }
     };
   return Object.defineProperties(e, r), e;
 }
-class $r extends K {
+class zr extends K {
   constructor(t = {}, n) {
     super(n), this.options = t;
   }
-  load(t, n, r, s) {
-    const { width: o, height: i, depth: c } = this.options, a = new de(null, o, i, c), h = new ge(this.manager);
+  load(t, n, r, o) {
+    const { width: s, height: i, depth: c } = this.options, a = new Ke(null, s, i, c), h = new de(this.manager);
     return h.setRequestHeader(this.requestHeader), h.setPath(this.path), h.setWithCredentials(this.withCredentials), h.load(
       t,
       (f) => {
-        const { image: p } = f;
+        const { image: d } = f;
         a.image = {
-          data: p.data,
-          width: o ?? p.width,
-          height: i ?? p.height,
-          depth: c ?? Math.sqrt(p.height)
+          data: d.data,
+          width: s ?? d.width,
+          height: i ?? d.height,
+          depth: c ?? Math.sqrt(d.height)
         }, a.type = f.type, a.format = f.format, a.colorSpace = f.colorSpace, a.needsUpdate = !0;
         try {
           n?.(a);
         } catch (O) {
-          s != null ? s(O) : console.error(O), this.manager.itemError(t);
+          o != null ? o(O) : console.error(O), this.manager.itemError(t);
         }
       },
       r,
-      s
+      o
     ), a;
   }
 }
-class Qr extends K {
+class Hr extends K {
   constructor(t = {}, n) {
     super(n), this.options = t;
   }
-  load(t, n, r, s) {
-    const { width: o, height: i } = this.options, c = new nn(null, o, i), a = new ge(this.manager);
+  load(t, n, r, o) {
+    const { width: s, height: i } = this.options, c = new tn(null, s, i), a = new de(this.manager);
     return a.setRequestHeader(this.requestHeader), a.setPath(this.path), a.setWithCredentials(this.withCredentials), a.load(
       t,
       (h) => {
         const { image: f } = h;
         c.image = {
           data: f.data,
-          width: o ?? f.width,
+          width: s ?? f.width,
           height: i ?? f.height
         }, c.type = h.type, c.format = h.format, c.colorSpace = h.colorSpace, c.needsUpdate = !0;
         try {
           n?.(c);
-        } catch (p) {
-          s != null ? s(p) : console.error(p), this.manager.itemError(t);
+        } catch (d) {
+          o != null ? o(d) : console.error(d), this.manager.itemError(t);
         }
       },
       r,
-      s
+      o
     ), c;
   }
 }
-const Ot = 1e-6, ot = /* @__PURE__ */ new U(), it = /* @__PURE__ */ new U(), N = /* @__PURE__ */ new U(), X = /* @__PURE__ */ new U(), Pt = /* @__PURE__ */ new U(), lr = /* @__PURE__ */ new U(), ur = /* @__PURE__ */ new sn(), yr = /* @__PURE__ */ new rn(), dr = /* @__PURE__ */ new on();
-class je {
-  constructor(t = 0, n = 0, r = 0, s = 0) {
-    this.distance = t, this.heading = n, this.pitch = r, this.roll = s;
+const It = 1e-6, ot = /* @__PURE__ */ new U(), it = /* @__PURE__ */ new U(), N = /* @__PURE__ */ new U(), X = /* @__PURE__ */ new U(), Ot = /* @__PURE__ */ new U(), rr = /* @__PURE__ */ new U(), sr = /* @__PURE__ */ new nn(), or = /* @__PURE__ */ new en(), ir = /* @__PURE__ */ new rn();
+class De {
+  constructor(t = 0, n = 0, r = 0, o = 0) {
+    this.distance = t, this.heading = n, this.pitch = r, this.roll = o;
   }
   get distance() {
     return this._distance;
   }
   set distance(t) {
-    this._distance = Math.max(t, Ot);
+    this._distance = Math.max(t, It);
   }
   get pitch() {
     return this._pitch;
   }
   set pitch(t) {
-    this._pitch = z(t, -Math.PI / 2 + Ot, Math.PI / 2 - Ot);
+    this._pitch = z(t, -Math.PI / 2 + It, Math.PI / 2 - It);
   }
-  set(t, n, r, s) {
-    return this.distance = t, this.heading = n, this.pitch = r, s != null && (this.roll = s), this;
+  set(t, n, r, o) {
+    return this.distance = t, this.heading = n, this.pitch = r, o != null && (this.roll = o), this;
   }
   clone() {
-    return new je(this.distance, this.heading, this.pitch, this.roll);
+    return new De(this.distance, this.heading, this.pitch, this.roll);
   }
   copy(t) {
     return this.distance = t.distance, this.heading = t.heading, this.pitch = t.pitch, this.roll = t.roll, this;
@@ -1279,32 +1279,34 @@ class je {
   equals(t) {
     return t.distance === this.distance && t.heading === this.heading && t.pitch === this.pitch && t.roll === this.roll;
   }
-  decompose(t, n, r, s, o = qt.WGS84) {
-    o.getEastNorthUpVectors(
+  decompose(t, n, r, o, s = Xt.WGS84) {
+    s.getEastNorthUpVectors(
       t,
       ot,
       it,
       N
-    ), s?.copy(N);
+    ), o?.copy(N);
     const i = X.copy(ot).multiplyScalar(Math.cos(this.heading)).add(
-      Pt.copy(it).multiplyScalar(Math.sin(this.heading))
-    ).multiplyScalar(Math.cos(this.pitch)).add(Pt.copy(N).multiplyScalar(Math.sin(this.pitch))).normalize().multiplyScalar(this.distance);
+      Ot.copy(it).multiplyScalar(Math.sin(this.heading))
+    ).multiplyScalar(Math.cos(this.pitch)).add(Ot.copy(N).multiplyScalar(Math.sin(this.pitch))).normalize().multiplyScalar(this.distance);
     if (n.copy(t).sub(i), this.roll !== 0) {
       const c = X.copy(t).sub(n).normalize();
       N.applyQuaternion(
-        yr.setFromAxisAngle(c, this.roll)
+        or.setFromAxisAngle(c, this.roll)
       );
     }
     r.setFromRotationMatrix(
-      ur.lookAt(n, t, N)
+      sr.lookAt(n, t, N)
     );
   }
-  setFromCamera(t, n = qt.WGS84) {
-    const r = X.setFromMatrixPosition(t.matrixWorld), s = Pt.set(0, 0, 0.5).unproject(t).sub(r).normalize(), o = n.getIntersection(dr.set(r, s));
-    if (o == null)
+  setFromCamera(t, n = Xt.WGS84, r) {
+    const o = X.setFromMatrixPosition(t.matrixWorld), s = Ot.set(0, 0, 0.5).unproject(t).sub(o).normalize(), i = n.getIntersection(
+      ir.set(o, s)
+    );
+    if (i == null)
       return;
-    this.distance = r.distanceTo(o), n.getEastNorthUpVectors(
-      o,
+    r?.copy(i), this.distance = o.distanceTo(i), n.getEastNorthUpVectors(
+      i,
       ot,
       it,
       N
@@ -1312,13 +1314,13 @@ class je {
       it.dot(s),
       ot.dot(s)
     ), this.pitch = Math.asin(N.dot(s));
-    const i = X.copy(t.up).applyQuaternion(t.quaternion), c = lr.copy(s).multiplyScalar(-i.dot(s)).add(i).normalize(), a = X.copy(s).multiplyScalar(-N.dot(s)).add(N).normalize(), h = a.dot(c), f = s.dot(a.cross(c));
-    return this.roll = Math.atan2(f, h), this;
+    const c = X.copy(t.up).applyQuaternion(t.quaternion), a = rr.copy(s).multiplyScalar(-c.dot(s)).add(c).normalize(), h = X.copy(s).multiplyScalar(-N.dot(s)).add(N).normalize(), f = h.dot(a), d = s.dot(h.cross(a));
+    return this.roll = Math.atan2(d, f), this;
   }
 }
 const Q = class Q {
-  constructor(t = 0, n = 0, r = 0, s = 0) {
-    this.west = t, this.south = n, this.east = r, this.north = s;
+  constructor(t = 0, n = 0, r = 0, o = 0) {
+    this.west = t, this.south = n, this.east = r, this.north = o;
   }
   get width() {
     let t = this.east;
@@ -1327,8 +1329,8 @@ const Q = class Q {
   get height() {
     return this.north - this.south;
   }
-  set(t, n, r, s) {
-    return this.west = t, this.south = n, this.east = r, this.north = s, this;
+  set(t, n, r, o) {
+    return this.west = t, this.south = n, this.east = r, this.north = o, this;
   }
   clone() {
     return new Q(this.west, this.south, this.east, this.north);
@@ -1362,74 +1364,34 @@ Q.MAX = /* @__PURE__ */ new Q(
   V.MAX_LATITUDE
 );
 let dt = Q;
-const pr = /^[ \t]*#include +"([\w\d./]+)"/gm;
-function Ar(e, t) {
-  return e.replace(pr, (n, r) => {
-    const o = r.split("/").reduce(
+const cr = /^[ \t]*#include +"([\w\d./]+)"/gm;
+function ar(e, t) {
+  return e.replace(cr, (n, r) => {
+    const s = r.split("/").reduce(
       (i, c) => typeof i != "string" && i != null ? i[c] : void 0,
       t
     );
-    if (typeof o != "string")
+    if (typeof s != "string")
       throw new Error(`Could not find include for ${r}.`);
-    return Ar(o, t);
+    return ar(s, t);
   });
 }
-let ct;
-function gr() {
-  if (ct != null)
-    return ct;
-  const e = new Uint32Array([268435456]);
-  return ct = new Uint8Array(e.buffer, e.byteOffset, e.byteLength)[0] === 0, ct;
-}
-function M(e, t, n, r = !0) {
-  if (r === gr())
-    return new t(e);
-  const s = Object.assign(new DataView(e), {
-    getFloat16(i, c) {
-      return cr(this, i, c);
-    }
-  }), o = new t(s.byteLength / t.BYTES_PER_ELEMENT);
-  for (let i = 0, c = 0; i < o.length; ++i, c += t.BYTES_PER_ELEMENT)
-    o[i] = s[n](c, r);
-  return o;
-}
-const wr = (e) => new Uint8Array(e), Zr = (e) => new Int8Array(e), Kr = (e, t) => M(e, Uint16Array, "getUint16", t), ts = (e, t) => M(e, Int16Array, "getInt16", t), es = (e, t) => M(e, Int32Array, "getInt32", t), ns = (e, t) => M(e, Uint32Array, "getUint32", t), rs = (e, t) => M(e, A, "getFloat16", t), ss = (e, t) => M(e, Float32Array, "getFloat32", t), os = (e, t) => M(e, Float64Array, "getFloat64", t);
-class is extends fr {
-  constructor(t) {
-    super(
-      de,
-      wr,
-      {
-        format: cn,
-        minFilter: kt,
-        magFilter: kt,
-        wrapS: mt,
-        wrapT: mt,
-        wrapR: mt,
-        width: hn,
-        height: fn,
-        depth: ln
-      },
-      t
-    );
-  }
-}
-function* ze(e, t, n, r, s) {
+function* ve(e, t, n, r, o) {
   if (n >= r)
     return;
-  const o = 2 ** n, i = n + 1, c = 2 ** i, a = Math.floor(e / o * c), h = Math.floor(t / o * c), f = [
+  const s = 2 ** n, i = n + 1, c = 2 ** i, a = Math.floor(e / s * c), h = Math.floor(t / s * c), f = [
     [a, h, i],
     [a + 1, h, i],
     [a, h + 1, i],
     [a + 1, h + 1, i]
   ];
   if (i < r)
-    for (const p of f)
-      for (const O of ze(...p, r, s))
+    for (const d of f)
+      for (const O of ve(...d, r, o))
         yield O;
   else
-    for (const p of f)
-      yield (s ?? new Z()).set(...p);
+    for (const d of f)
+      yield (o ?? new Z()).set(...d);
 }
 class Z {
   constructor(t = 0, n = 0, r = 0) {
@@ -1448,12 +1410,12 @@ class Z {
     return t.x === this.x && t.y === this.y && t.z === this.z;
   }
   getParent(t = new Z()) {
-    const n = 2 ** this.z, r = this.x / n, s = this.y / n, o = this.z - 1, i = 2 ** o;
-    return t.set(Math.floor(r * i), Math.floor(s * i), o);
+    const n = 2 ** this.z, r = this.x / n, o = this.y / n, s = this.z - 1, i = 2 ** s;
+    return t.set(Math.floor(r * i), Math.floor(o * i), s);
   }
   *traverseChildren(t, n) {
-    const { x: r, y: s, z: o } = this;
-    for (const i of ze(r, s, o, o + t, n))
+    const { x: r, y: o, z: s } = this;
+    for (const i of ve(r, o, s, s + t, n))
       yield i;
   }
   fromArray(t, n = 0) {
@@ -1466,104 +1428,124 @@ class Z {
     yield this.x, yield this.y, yield this.z;
   }
 }
-const ye = /* @__PURE__ */ new pe();
-class He {
+const le = /* @__PURE__ */ new ue();
+class Ge {
   constructor(t = 2, n = 1, r = dt.MAX) {
     this.width = t, this.height = n, this.rectangle = r;
   }
   clone() {
-    return new He(this.width, this.height, this.rectangle.clone());
+    return new Ge(this.width, this.height, this.rectangle.clone());
   }
   copy(t) {
     return this.width = t.width, this.height = t.height, this.rectangle.copy(t.rectangle), this;
   }
-  getSize(t, n = new pe()) {
+  getSize(t, n = new ue()) {
     return n.set(this.width << t, this.height << t);
   }
   // Reference: https://github.com/CesiumGS/cesium/blob/1.122/packages/engine/Source/Core/GeographicTilingScheme.js#L210
   getTile(t, n, r = new Z()) {
-    const s = this.getSize(n, ye), { rectangle: o } = this, i = o.width / s.x, c = o.height / s.y, { west: a, south: h, east: f } = o;
-    let p = t.longitude;
-    f < a && (p += Math.PI * 2);
-    let O = Math.floor((p - a) / i);
-    O >= s.x && (O = s.x - 1);
-    let B = Math.floor((t.latitude - h) / c);
-    return B >= s.y && (B = s.y - 1), r.x = O, r.y = B, r.z = n, r;
+    const o = this.getSize(n, le), { rectangle: s } = this, i = s.width / o.x, c = s.height / o.y, { west: a, south: h, east: f } = s;
+    let d = t.longitude;
+    f < a && (d += Math.PI * 2);
+    let O = Math.floor((d - a) / i);
+    O >= o.x && (O = o.x - 1);
+    let F = Math.floor((t.latitude - h) / c);
+    return F >= o.y && (F = o.y - 1), r.x = O, r.y = F, r.z = n, r;
   }
   // Reference: https://github.com/CesiumGS/cesium/blob/1.122/packages/engine/Source/Core/GeographicTilingScheme.js#L169
   getRectangle(t, n = new dt()) {
-    const r = this.getSize(t.z, ye), { rectangle: s } = this, o = s.width / r.x, i = s.height / r.y, { west: c, north: a } = s;
-    return n.west = t.x * o + c, n.east = (t.x + 1) * o + c, n.north = a - (r.y - t.y - 1) * i, n.south = a - (r.y - t.y) * i, n;
+    const r = this.getSize(t.z, le), { rectangle: o } = this, s = o.width / r.x, i = o.height / r.y, { west: c, north: a } = o;
+    return n.west = t.x * s + c, n.east = (t.x + 1) * s + c, n.north = a - (r.y - t.y - 1) * i, n.south = a - (r.y - t.y) * i, n;
   }
 }
-function cs(e) {
+let ct;
+function hr() {
+  if (ct != null)
+    return ct;
+  const e = new Uint32Array([268435456]);
+  return ct = new Uint8Array(e.buffer, e.byteOffset, e.byteLength)[0] === 0, ct;
 }
-const Tr = /#pragma unroll_loop_start\s+for\s*\(\s*int\s+i\s*=\s*(\d+)\s*;\s*i\s*<\s*(\d+)\s*;\s*(?:i\s*\+\+|\+\+\s*i)\s*\)\s*{([\s\S]+?)}\s+#pragma unroll_loop_end/g;
-function br(e, t, n, r) {
-  let s = "";
-  for (let o = parseInt(t, 10); o < parseInt(n, 10); ++o)
-    s += r.replace(/\[\s*i\s*\]/g, "[" + o + "]").replace(/UNROLLED_LOOP_INDEX/g, `${o}`);
+function B(e, t, n, r = !0) {
+  if (r === hr())
+    return new t(e);
+  const o = Object.assign(new DataView(e), {
+    getFloat16(i, c) {
+      return tr(this, i, c);
+    }
+  }), s = new t(o.byteLength / t.BYTES_PER_ELEMENT);
+  for (let i = 0, c = 0; i < s.length; ++i, c += t.BYTES_PER_ELEMENT)
+    s[i] = o[n](c, r);
   return s;
 }
-function as(e) {
-  return e.replace(Tr, br);
+const Wr = (e) => new Uint8Array(e), Vr = (e) => new Int8Array(e), Yr = (e, t) => B(e, Uint16Array, "getUint16", t), Xr = (e, t) => B(e, Int16Array, "getInt16", t), qr = (e, t) => B(e, Int32Array, "getInt32", t), kr = (e, t) => B(e, Uint32Array, "getUint32", t), Jr = (e, t) => B(e, A, "getFloat16", t), $r = (e, t) => B(e, Float32Array, "getFloat32", t), Qr = (e, t) => B(e, Float64Array, "getFloat64", t);
+function Zr(e) {
+}
+const fr = /#pragma unroll_loop_start\s+for\s*\(\s*int\s+i\s*=\s*(\d+)\s*;\s*i\s*<\s*(\d+)\s*;\s*(?:i\s*\+\+|\+\+\s*i)\s*\)\s*{([\s\S]+?)}\s+#pragma unroll_loop_end/g;
+function lr(e, t, n, r) {
+  let o = "";
+  for (let s = parseInt(t, 10); s < parseInt(n, 10); ++s)
+    o += r.replace(/\[\s*i\s*\]/g, `[${s}]`).replace(/UNROLLED_LOOP_INDEX/g, `${s}`);
+  return o;
+}
+function Kr(e) {
+  return e.replace(fr, lr);
 }
 export {
-  an as ArrayBufferLoader,
-  xr as DEFAULT_STBN_URL,
-  fr as DataTextureLoader,
-  $r as EXR3DTextureLoader,
-  Qr as EXRTextureLoader,
-  qt as Ellipsoid,
-  ls as EllipsoidGeometry,
+  sn as ArrayBufferLoader,
+  ns as DEFAULT_STBN_URL,
+  br as DataTextureLoader,
+  zr as EXR3DTextureLoader,
+  Hr as EXRTextureLoader,
+  Xt as Ellipsoid,
+  hs as EllipsoidGeometry,
   A as Float16Array,
   V as Geodetic,
-  je as PointOfView,
-  ys as QuadGeometry,
+  De as PointOfView,
+  rs as QuadGeometry,
   dt as Rectangle,
-  is as STBNLoader,
-  ln as STBN_TEXTURE_DEPTH,
-  fn as STBN_TEXTURE_HEIGHT,
-  hn as STBN_TEXTURE_WIDTH,
+  ss as STBNLoader,
+  os as STBN_TEXTURE_DEPTH,
+  is as STBN_TEXTURE_HEIGHT,
+  cs as STBN_TEXTURE_WIDTH,
   Z as TileCoordinate,
-  He as TilingScheme,
-  ar as TypedArrayLoader,
-  Br as ceilPowerOfTwo,
+  Ge as TilingScheme,
+  er as TypedArrayLoader,
+  Pr as ceilPowerOfTwo,
   z as clamp,
-  Wr as closeTo,
-  Vr as define,
-  kr as defineExpression,
-  Xr as defineFloat,
-  Yr as defineInt,
-  qr as definePropertyShorthand,
-  Jr as defineUniformShorthand,
-  Fr as degrees,
-  Rr as euclideanModulo,
-  Dr as floorPowerOfTwo,
-  Or as fromBufferGeometryLike,
-  Lr as inverseLerp,
-  Pr as isFloatLinearSupported,
-  Mr as isPowerOfTwo,
-  Nr as isTypedArray,
-  Ur as lerp,
-  vr as normalize,
-  rs as parseFloat16Array,
-  ss as parseFloat32Array,
-  os as parseFloat64Array,
-  ts as parseInt16Array,
-  es as parseInt32Array,
-  Zr as parseInt8Array,
-  Kr as parseUint16Array,
-  ns as parseUint32Array,
-  wr as parseUint8Array,
-  Cr as radians,
-  cs as reinterpretType,
-  Gr as remap,
-  jr as remapClamped,
-  Ar as resolveIncludes,
-  Hr as saturate,
-  zr as smoothstep,
-  Ir as toBufferGeometryLike,
-  as as unrollLoops
+  Mr as closeTo,
+  Br as define,
+  vr as defineExpression,
+  Dr as defineFloat,
+  Fr as defineInt,
+  Gr as definePropertyShorthand,
+  jr as defineUniformShorthand,
+  Ir as degrees,
+  Sr as euclideanModulo,
+  xr as floorPowerOfTwo,
+  gr as fromBufferGeometryLike,
+  mr as inverseLerp,
+  wr as isFloatLinearSupported,
+  Or as isPowerOfTwo,
+  Tr as isTypedArray,
+  _r as lerp,
+  Nr as normalize,
+  Jr as parseFloat16Array,
+  $r as parseFloat32Array,
+  Qr as parseFloat64Array,
+  Xr as parseInt16Array,
+  qr as parseInt32Array,
+  Vr as parseInt8Array,
+  Yr as parseUint16Array,
+  kr as parseUint32Array,
+  Wr as parseUint8Array,
+  Er as radians,
+  Zr as reinterpretType,
+  Lr as remap,
+  Rr as remapClamped,
+  ar as resolveIncludes,
+  Cr as saturate,
+  Ur as smoothstep,
+  Ar as toBufferGeometryLike,
+  Kr as unrollLoops
 };
 //# sourceMappingURL=index.js.map