@takram/three-geospatial 0.1.0 → 0.2.1

package/build/index.js

@@ -1,22 +1,22 @@
-import { Loader as Vt, FileLoader as _i, BufferGeometry as bi, BufferAttribute as Zr, Box3 as Ni, Vector3 as Re, Sphere as Oi, ByteType as Ui, UnsignedByteType as Hr, ShortType as mi, UnsignedShortType as Ci, IntType as Ri, UnsignedIntType as xi, HalfFloatType as lt, FloatType as ft, LinearFilter as kt, RGBAFormat as hn, Data3DTexture as fn, DataTexture as Fi, MathUtils as ye, Material as Jt, REVISION as Li, DataTextureLoader as Pi, RedFormat as vn, DataUtils as Gr, Quaternion as Mi, Matrix4 as Di, Ray as Bi, RepeatWrapping as or, NearestFilter as Wr, Vector2 as yn } from "three";
-import { E as Xr, G as st } from "./shared.js";
-import { a as la } from "./shared.js";
-var zi = process.env.NODE_ENV === "production", Yr = "Invariant failed";
-function _r(r, e) {
+import { Loader as qt, FileLoader as _i, BufferGeometry as bi, BufferAttribute as zr, Box3 as Ni, Vector3 as Re, Sphere as Oi, ByteType as mi, UnsignedByteType as kr, ShortType as Ui, UnsignedShortType as Ci, IntType as Ri, UnsignedIntType as xi, HalfFloatType as lt, FloatType as ft, LinearFilter as zt, RGBAFormat as ln, Data3DTexture as un, DataTexture as Fi, MathUtils as ye, Material as Vt, REVISION as Li, DataTextureLoader as Pi, RedFormat as hn, DataUtils as Zr, Quaternion as Mi, Matrix4 as Di, Ray as Bi, RepeatWrapping as sr, NearestFilter as Hr, Vector2 as fn } from "three";
+import { E as Gr, G as st } from "./shared.js";
+import { a as oa } from "./shared.js";
+var zi = "production" === "production", Wr = "Invariant failed";
+function vn(r, e) {
   if (!r) {
     if (zi)
-      throw new Error(Yr);
-    var i = Yr;
+      throw new Error(Wr);
+    var i = Wr;
     throw new Error(i);
   }
 }
-class ki extends Vt {
+class ki extends qt {
   load(e, i, s, o) {
     const c = new _i(this.manager);
     c.setResponseType("arraybuffer"), c.setRequestHeader(this.requestHeader), c.setPath(this.path), c.setWithCredentials(this.withCredentials), c.load(
       e,
       (l) => {
-        _r(l instanceof ArrayBuffer);
+        vn(l instanceof ArrayBuffer);
         try {
           i(l);
         } catch (v) {
@@ -28,9 +28,9 @@ class ki extends Vt {
     );
   }
 }
-function To(r) {
+function go(r) {
 }
-function Eo(r) {
+function So(r) {
   var c;
   const { attributes: e, index: i, boundingBox: s, boundingSphere: o } = r;
   return [
@@ -43,17 +43,17 @@ function Eo(r) {
     ].filter((l) => l != null)
   ];
 }
-function Io(r, e = new bi()) {
+function To(r, e = new bi()) {
   for (const [i, s] of Object.entries(r.attributes))
     e.setAttribute(
       i,
-      new Zr(
+      new zr(
         s.array,
         s.itemSize,
         s.normalized
       )
     );
-  if (e.index = r.index != null ? new Zr(
+  if (e.index = r.index != null ? new zr(
     r.index.array,
     r.index.itemSize,
     r.index.normalized
@@ -73,7 +73,7 @@ function Io(r, e = new bi()) {
   }
   return e;
 }
-const Zi = 128, Hi = 128, Gi = 64, _o = "https://media.githubusercontent.com/media/takram-design-engineering/three-geospatial/9627216cc50057994c98a2118f3c4a23765d43b9/packages/core/assets/stbn.bin", Wi = "This is not an object", Xi = "This is not a Float16Array object", qr = "This constructor is not a subclass of Float16Array", pn = "The constructor property value is not an object", Yi = "Species constructor didn't return TypedArray object", qi = "Derived constructor created TypedArray object which was too small length", vt = "Attempting to access detached ArrayBuffer", pr = "Cannot convert undefined or null to object", dr = "Cannot mix BigInt and other types, use explicit conversions", Vr = "@@iterator property is not callable", Jr = "Reduce of empty array with no initial value", Vi = "The comparison function must be either a function or undefined", ar = "Offset is out of bounds";
+const Zi = 128, Hi = 128, Gi = 64, Wi = "9627216cc50057994c98a2118f3c4a23765d43b9", Eo = `https://media.githubusercontent.com/media/takram-design-engineering/three-geospatial/${Wi}/packages/core/assets/stbn.bin`, Xi = "This is not an object", Yi = "This is not a Float16Array object", Xr = "This constructor is not a subclass of Float16Array", yn = "The constructor property value is not an object", qi = "Species constructor didn't return TypedArray object", Vi = "Derived constructor created TypedArray object which was too small length", vt = "Attempting to access detached ArrayBuffer", yr = "Cannot convert undefined or null to object", pr = "Cannot mix BigInt and other types, use explicit conversions", Yr = "@@iterator property is not callable", qr = "Reduce of empty array with no initial value", Ji = "The comparison function must be either a function or undefined", or = "Offset is out of bounds";
 function Z(r) {
   return (e, ...i) => ie(r, e, i);
 }
@@ -88,38 +88,38 @@ function $e(r, e) {
 const {
   apply: ie,
   construct: ut,
-  defineProperty: $r,
-  get: cr,
+  defineProperty: Vr,
+  get: ar,
   getOwnPropertyDescriptor: Ye,
   getPrototypeOf: At,
-  has: wr,
-  ownKeys: dn,
-  set: Qr,
-  setPrototypeOf: wn
-} = Reflect, Ji = Proxy, {
-  EPSILON: $i,
-  MAX_SAFE_INTEGER: jr,
-  isFinite: An,
+  has: dr,
+  ownKeys: pn,
+  set: Jr,
+  setPrototypeOf: dn
+} = Reflect, $i = Proxy, {
+  EPSILON: Qi,
+  MAX_SAFE_INTEGER: $r,
+  isFinite: wn,
   isNaN: qe
 } = Number, {
   iterator: Ie,
-  species: Qi,
-  toStringTag: br,
-  for: ji
+  species: ji,
+  toStringTag: Ir,
+  for: Ki
 } = Symbol, Ve = Object, {
-  create: $t,
+  create: Jt,
   defineProperty: gt,
-  freeze: Ki,
-  is: Kr
-} = Ve, Ar = Ve.prototype, es = (
+  freeze: es,
+  is: Qr
+} = Ve, wr = Ve.prototype, ts = (
   /** @type {any} */
-  Ar.__lookupGetter__ ? Z(
+  wr.__lookupGetter__ ? Z(
     /** @type {any} */
-    Ar.__lookupGetter__
+    wr.__lookupGetter__
   ) : (r, e) => {
     if (r == null)
       throw X(
-        pr
+        yr
       );
     let i = Ve(r);
     do {
@@ -130,21 +130,21 @@ const {
   }
 ), Ce = (
   /** @type {any} */
-  Ve.hasOwn || Z(Ar.hasOwnProperty)
-), gn = Array, Sn = gn.isArray, Qt = gn.prototype, ts = Z(Qt.join), rs = Z(Qt.push), ns = Z(
-  Qt.toLocaleString
-), Nr = Qt[Ie], is = Z(Nr), {
-  abs: ss,
-  trunc: Tn
-} = Math, jt = ArrayBuffer, os = jt.isView, En = jt.prototype, as = Z(En.slice), cs = $e(En, "byteLength"), gr = typeof SharedArrayBuffer < "u" ? SharedArrayBuffer : null, ls = gr && $e(gr.prototype, "byteLength"), Or = At(Uint8Array), us = Or.from, Q = Or.prototype, hs = Q[Ie], fs = Z(Q.keys), vs = Z(
+  Ve.hasOwn || Z(wr.hasOwnProperty)
+), An = Array, gn = An.isArray, $t = An.prototype, rs = Z($t.join), ns = Z($t.push), is = Z(
+  $t.toLocaleString
+), _r = $t[Ie], ss = Z(_r), {
+  abs: os,
+  trunc: Sn
+} = Math, Qt = ArrayBuffer, as = Qt.isView, Tn = Qt.prototype, cs = Z(Tn.slice), ls = $e(Tn, "byteLength"), Ar = typeof SharedArrayBuffer < "u" ? SharedArrayBuffer : null, us = Ar && $e(Ar.prototype, "byteLength"), br = At(Uint8Array), hs = br.from, Q = br.prototype, fs = Q[Ie], vs = Z(Q.keys), ys = Z(
   Q.values
-), ys = Z(
+), ps = Z(
   Q.entries
-), ps = Z(Q.set), en = Z(
+), ds = Z(Q.set), jr = Z(
   Q.reverse
-), ds = Z(Q.fill), ws = Z(
+), ws = Z(Q.fill), As = Z(
   Q.copyWithin
-), tn = Z(Q.sort), ot = Z(Q.slice), As = Z(
+), Kr = Z(Q.sort), ot = Z(Q.slice), gs = Z(
   Q.subarray
 ), $ = $e(
   Q,
@@ -155,17 +155,17 @@ const {
 ), x = $e(
   Q,
   "length"
-), In = $e(
+), En = $e(
   Q,
-  br
-), gs = Uint8Array, ce = Uint16Array, rn = (...r) => ie(us, ce, r), Ur = Uint32Array, Ss = Float32Array, ze = At([][Ie]()), Kt = Z(ze.next), Ts = Z(function* () {
-}().next), Es = At(ze), Is = DataView.prototype, _s = Z(
-  Is.getUint16
-), X = TypeError, lr = RangeError, _n = WeakSet, bn = _n.prototype, bs = Z(bn.add), Ns = Z(bn.has), er = WeakMap, mr = er.prototype, Zt = Z(mr.get), Os = Z(mr.has), Cr = Z(mr.set), Nn = new er(), Us = $t(null, {
+  Ir
+), Ss = Uint8Array, ce = Uint16Array, en = (...r) => ie(hs, ce, r), Nr = Uint32Array, Ts = Float32Array, ze = At([][Ie]()), jt = Z(ze.next), Es = Z(function* () {
+}().next), Is = At(ze), _s = DataView.prototype, bs = Z(
+  _s.getUint16
+), X = TypeError, cr = RangeError, In = WeakSet, _n = In.prototype, Ns = Z(_n.add), Os = Z(_n.has), Kt = WeakMap, Or = Kt.prototype, kt = Z(Or.get), ms = Z(Or.has), mr = Z(Or.set), bn = new Kt(), Us = Jt(null, {
   next: {
     value: function() {
-      const e = Zt(Nn, this);
-      return Kt(e);
+      const e = kt(bn, this);
+      return jt(e);
     }
   },
   [Ie]: {
@@ -175,43 +175,43 @@ const {
   }
 });
 function ht(r) {
-  if (r[Ie] === Nr && ze.next === Kt)
+  if (r[Ie] === _r && ze.next === jt)
     return r;
-  const e = $t(Us);
-  return Cr(Nn, e, is(r)), e;
+  const e = Jt(Us);
+  return mr(bn, e, ss(r)), e;
 }
-const On = new er(), Un = $t(Es, {
+const Nn = new Kt(), On = Jt(Is, {
   next: {
     value: function() {
-      const e = Zt(On, this);
-      return Ts(e);
+      const e = kt(Nn, this);
+      return Es(e);
     },
     writable: !0,
     configurable: !0
   }
 });
-for (const r of dn(ze))
-  r !== "next" && gt(Un, r, Ye(ze, r));
-function nn(r) {
-  const e = $t(Un);
-  return Cr(On, e, r), e;
+for (const r of pn(ze))
+  r !== "next" && gt(On, r, Ye(ze, r));
+function tn(r) {
+  const e = Jt(On);
+  return mr(Nn, e, r), e;
 }
-function Ht(r) {
+function Zt(r) {
   return r !== null && typeof r == "object" || typeof r == "function";
 }
-function sn(r) {
+function rn(r) {
   return r !== null && typeof r == "object";
 }
-function Gt(r) {
-  return In(r) !== void 0;
+function Ht(r) {
+  return En(r) !== void 0;
 }
-function Sr(r) {
-  const e = In(r);
+function gr(r) {
+  const e = En(r);
   return e === "BigInt64Array" || e === "BigUint64Array";
 }
-function ms(r) {
+function Cs(r) {
   try {
-    return Sn(r) ? !1 : (cs(
+    return gn(r) ? !1 : (ls(
       /** @type {any} */
       r
     ), !0);
@@ -220,10 +220,10 @@ function ms(r) {
   }
 }
 function mn(r) {
-  if (gr === null)
+  if (Ar === null)
     return !1;
   try {
-    return ls(
+    return us(
       /** @type {any} */
       r
     ), !0;
@@ -231,70 +231,70 @@ function mn(r) {
     return !1;
   }
 }
-function Cs(r) {
-  return ms(r) || mn(r);
+function Rs(r) {
+  return Cs(r) || mn(r);
 }
-function on(r) {
-  return Sn(r) ? r[Ie] === Nr && ze.next === Kt : !1;
+function nn(r) {
+  return gn(r) ? r[Ie] === _r && ze.next === jt : !1;
 }
-function Rs(r) {
-  return Gt(r) ? r[Ie] === hs && ze.next === Kt : !1;
+function xs(r) {
+  return Ht(r) ? r[Ie] === fs && ze.next === jt : !1;
 }
-function Ft(r) {
+function xt(r) {
   if (typeof r != "string")
     return !1;
   const e = +r;
-  return r !== e + "" || !An(e) ? !1 : e === Tn(e);
+  return r !== e + "" || !wn(e) ? !1 : e === Sn(e);
 }
-const Wt = ji("__Float16Array__");
-function xs(r) {
-  if (!sn(r))
+const Gt = Ki("__Float16Array__");
+function Fs(r) {
+  if (!rn(r))
     return !1;
   const e = At(r);
-  if (!sn(e))
+  if (!rn(e))
     return !1;
   const i = e.constructor;
   if (i === void 0)
     return !1;
-  if (!Ht(i))
-    throw X(pn);
-  return wr(i, Wt);
+  if (!Zt(i))
+    throw X(yn);
+  return dr(i, Gt);
 }
-const Tr = 1 / $i;
-function Fs(r) {
-  return r + Tr - Tr;
+const Sr = 1 / Qi;
+function Ls(r) {
+  return r + Sr - Sr;
 }
-const Cn = 6103515625e-14, Ls = 65504, Rn = 9765625e-10, an = Rn * Cn, Ps = Rn * Tr;
-function Ms(r) {
+const Un = 6103515625e-14, Ps = 65504, Cn = 9765625e-10, sn = Cn * Un, Ms = Cn * Sr;
+function Ds(r) {
   const e = +r;
-  if (!An(e) || e === 0)
+  if (!wn(e) || e === 0)
     return e;
-  const i = e > 0 ? 1 : -1, s = ss(e);
-  if (s < Cn)
-    return i * Fs(s / an) * an;
-  const o = (1 + Ps) * s, c = o - (o - s);
-  return c > Ls || qe(c) ? i * (1 / 0) : i * c;
+  const i = e > 0 ? 1 : -1, s = os(e);
+  if (s < Un)
+    return i * Ls(s / sn) * sn;
+  const o = (1 + Ms) * s, c = o - (o - s);
+  return c > Ps || qe(c) ? i * (1 / 0) : i * c;
 }
-const xn = new jt(4), Fn = new Ss(xn), Ln = new Ur(xn), we = new ce(512), Ae = new gs(512);
+const Rn = new Qt(4), xn = new Ts(Rn), Fn = new Nr(Rn), we = new ce(512), Ae = new Ss(512);
 for (let r = 0; r < 256; ++r) {
   const e = r - 127;
   e < -24 ? (we[r] = 0, we[r | 256] = 32768, Ae[r] = 24, Ae[r | 256] = 24) : e < -14 ? (we[r] = 1024 >> -e - 14, we[r | 256] = 1024 >> -e - 14 | 32768, Ae[r] = -e - 1, Ae[r | 256] = -e - 1) : e <= 15 ? (we[r] = e + 15 << 10, we[r | 256] = e + 15 << 10 | 32768, Ae[r] = 13, Ae[r | 256] = 13) : e < 128 ? (we[r] = 31744, we[r | 256] = 64512, Ae[r] = 24, Ae[r | 256] = 24) : (we[r] = 31744, we[r | 256] = 64512, Ae[r] = 13, Ae[r | 256] = 13);
 }
 function Ee(r) {
-  Fn[0] = Ms(r);
-  const e = Ln[0], i = e >> 23 & 511;
+  xn[0] = Ds(r);
+  const e = Fn[0], i = e >> 23 & 511;
   return we[i] + ((e & 8388607) >> Ae[i]);
 }
-const Rr = new Ur(2048);
+const Ur = new Nr(2048);
 for (let r = 1; r < 1024; ++r) {
   let e = r << 13, i = 0;
-  for (; !(e & 8388608); )
+  for (; (e & 8388608) === 0; )
     e <<= 1, i -= 8388608;
-  e &= -8388609, i += 947912704, Rr[r] = e | i;
+  e &= -8388609, i += 947912704, Ur[r] = e | i;
 }
 for (let r = 1024; r < 2048; ++r)
-  Rr[r] = 939524096 + (r - 1024 << 13);
-const Qe = new Ur(64);
+  Ur[r] = 939524096 + (r - 1024 << 13);
+const Qe = new Nr(64);
 for (let r = 1; r < 31; ++r)
   Qe[r] = r << 23;
 Qe[31] = 1199570944;
@@ -302,42 +302,42 @@ Qe[32] = 2147483648;
 for (let r = 33; r < 63; ++r)
   Qe[r] = 2147483648 + (r - 32 << 23);
 Qe[63] = 3347054592;
-const Pn = new ce(64);
+const Ln = new ce(64);
 for (let r = 1; r < 64; ++r)
-  r !== 32 && (Pn[r] = 1024);
+  r !== 32 && (Ln[r] = 1024);
 function L(r) {
   const e = r >> 10;
-  return Ln[0] = Rr[Pn[e] + (r & 1023)] + Qe[e], Fn[0];
+  return Fn[0] = Ur[Ln[e] + (r & 1023)] + Qe[e], xn[0];
 }
-function me(r) {
+function Ue(r) {
   const e = +r;
-  return qe(e) || e === 0 ? 0 : Tn(e);
+  return qe(e) || e === 0 ? 0 : Sn(e);
 }
-function ur(r) {
-  const e = me(r);
-  return e < 0 ? 0 : e < jr ? e : jr;
+function lr(r) {
+  const e = Ue(r);
+  return e < 0 ? 0 : e < $r ? e : $r;
 }
-function Lt(r, e) {
-  if (!Ht(r))
-    throw X(Wi);
+function Ft(r, e) {
+  if (!Zt(r))
+    throw X(Xi);
   const i = r.constructor;
   if (i === void 0)
     return e;
-  if (!Ht(i))
-    throw X(pn);
-  const s = i[Qi];
+  if (!Zt(i))
+    throw X(yn);
+  const s = i[ji];
   return s ?? e;
 }
 function yt(r) {
   if (mn(r))
     return !1;
   try {
-    return as(r, 0, 0), !1;
+    return cs(r, 0, 0), !1;
   } catch {
   }
   return !0;
 }
-function cn(r, e) {
+function on(r, e) {
   const i = qe(r), s = qe(e);
   if (i && s)
     return 0;
@@ -348,7 +348,7 @@ function cn(r, e) {
   if (r > e)
     return 1;
   if (r === 0 && e === 0) {
-    const o = Kr(r, 0), c = Kr(e, 0);
+    const o = Qr(r, 0), c = Qr(e, 0);
     if (!o && c)
       return -1;
     if (o && !c)
@@ -356,18 +356,18 @@ function cn(r, e) {
   }
   return 0;
 }
-const xr = 2, Xt = new er();
+const Cr = 2, Wt = new Kt();
 function Xe(r) {
-  return Os(Xt, r) || !os(r) && xs(r);
+  return ms(Wt, r) || !as(r) && Fs(r);
 }
 function R(r) {
   if (!Xe(r))
-    throw X(Xi);
+    throw X(Yi);
 }
-function Pt(r, e) {
-  const i = Xe(r), s = Gt(r);
+function Lt(r, e) {
+  const i = Xe(r), s = Ht(r);
   if (!i && !s)
-    throw X(Yi);
+    throw X(qi);
   if (typeof e == "number") {
     let o;
     if (i) {
@@ -377,14 +377,14 @@ function Pt(r, e) {
       o = x(r);
     if (o < e)
       throw X(
-        qi
+        Vi
       );
   }
-  if (Sr(r))
-    throw X(dr);
+  if (gr(r))
+    throw X(pr);
 }
 function O(r) {
-  const e = Zt(Xt, r);
+  const e = kt(Wt, r);
   if (e !== void 0) {
     const o = $(e);
     if (yt(o))
@@ -397,75 +397,75 @@ function O(r) {
   );
   if (yt(i))
     throw X(vt);
-  const s = ut(P, [
+  const s = ut(B, [
     i,
     /** @type {any} */
     r.byteOffset,
     /** @type {any} */
     r.length
   ], r.constructor);
-  return Zt(Xt, s);
+  return kt(Wt, s);
 }
-function ln(r) {
+function an(r) {
   const e = x(r), i = [];
   for (let s = 0; s < e; ++s)
     i[s] = L(r[s]);
   return i;
 }
-const Mn = new _n();
-for (const r of dn(Q)) {
-  if (r === br)
+const Pn = new In();
+for (const r of pn(Q)) {
+  if (r === Ir)
     continue;
   const e = Ye(Q, r);
-  Ce(e, "get") && typeof e.get == "function" && bs(Mn, e.get);
+  Ce(e, "get") && typeof e.get == "function" && Ns(Pn, e.get);
 }
-const Ds = Ki(
+const Bs = es(
   /** @type {ProxyHandler<Float16BitsArray>} */
   {
     get(r, e, i) {
-      return Ft(e) && Ce(r, e) ? L(cr(r, e)) : Ns(Mn, es(r, e)) ? cr(r, e) : cr(r, e, i);
+      return xt(e) && Ce(r, e) ? L(ar(r, e)) : Os(Pn, ts(r, e)) ? ar(r, e) : ar(r, e, i);
     },
     set(r, e, i, s) {
-      return Ft(e) && Ce(r, e) ? Qr(r, e, Ee(i)) : Qr(r, e, i, s);
+      return xt(e) && Ce(r, e) ? Jr(r, e, Ee(i)) : Jr(r, e, i, s);
     },
     getOwnPropertyDescriptor(r, e) {
-      if (Ft(e) && Ce(r, e)) {
+      if (xt(e) && Ce(r, e)) {
         const i = Ye(r, e);
         return i.value = L(i.value), i;
       }
       return Ye(r, e);
     },
     defineProperty(r, e, i) {
-      return Ft(e) && Ce(r, e) && Ce(i, "value") && (i.value = Ee(i.value)), $r(r, e, i);
+      return xt(e) && Ce(r, e) && Ce(i, "value") && (i.value = Ee(i.value)), Vr(r, e, i);
     }
   }
 );
-class P {
+class B {
   /** @see https://tc39.es/ecma262/#sec-typedarray */
   constructor(e, i, s) {
     let o;
     if (Xe(e))
       o = ut(ce, [O(e)], new.target);
-    else if (Ht(e) && !Cs(e)) {
+    else if (Zt(e) && !Rs(e)) {
       let l, v;
-      if (Gt(e)) {
+      if (Ht(e)) {
         l = e, v = x(e);
         const y = $(e);
         if (yt(y))
           throw X(vt);
-        if (Sr(e))
-          throw X(dr);
-        const E = new jt(
-          v * xr
+        if (gr(e))
+          throw X(pr);
+        const E = new Qt(
+          v * Cr
         );
         o = ut(ce, [E], new.target);
       } else {
         const y = e[Ie];
         if (y != null && typeof y != "function")
-          throw X(Vr);
-        y != null ? on(e) ? (l = e, v = e.length) : (l = [.../** @type {Iterable<unknown>} */
+          throw X(Yr);
+        y != null ? nn(e) ? (l = e, v = e.length) : (l = [.../** @type {Iterable<unknown>} */
         e], v = l.length) : (l = /** @type {ArrayLike<unknown>} */
-        e, v = ur(l.length)), o = ut(ce, [v], new.target);
+        e, v = lr(l.length)), o = ut(ce, [v], new.target);
       }
       for (let y = 0; y < v; ++y)
         o[y] = Ee(l[y]);
@@ -473,9 +473,9 @@ class P {
       o = ut(ce, arguments, new.target);
     const c = (
       /** @type {any} */
-      new Ji(o, Ds)
+      new $i(o, Bs)
     );
-    return Cr(Xt, c, o), c;
+    return mr(Wt, c, o), c;
   }
   /**
    * limitation: `Object.getOwnPropertyNames(Float16Array)` or `Reflect.ownKeys(Float16Array)` include this key
@@ -483,33 +483,33 @@ class P {
    */
   static from(e, ...i) {
     const s = this;
-    if (!wr(s, Wt))
+    if (!dr(s, Gt))
       throw X(
-        qr
+        Xr
       );
-    if (s === P) {
+    if (s === B) {
       if (Xe(e) && i.length === 0) {
-        const b = O(e), m = new ce(
+        const b = O(e), U = new ce(
           $(b),
           Be(b),
           x(b)
         );
-        return new P(
-          $(ot(m))
+        return new B(
+          $(ot(U))
         );
       }
       if (i.length === 0)
-        return new P(
+        return new B(
           $(
-            rn(e, Ee)
+            en(e, Ee)
           )
         );
       const y = i[0], E = i[1];
-      return new P(
+      return new B(
         $(
-          rn(e, function(b, ...m) {
+          en(e, function(b, ...U) {
             return Ee(
-              ie(y, this, [b, ...ht(m)])
+              ie(y, this, [b, ...ht(U)])
             );
           }, E)
         )
@@ -518,15 +518,15 @@ class P {
     let o, c;
     const l = e[Ie];
     if (l != null && typeof l != "function")
-      throw X(Vr);
+      throw X(Yr);
     if (l != null)
-      on(e) ? (o = e, c = e.length) : Rs(e) ? (o = e, c = x(e)) : (o = [...e], c = o.length);
+      nn(e) ? (o = e, c = e.length) : xs(e) ? (o = e, c = x(e)) : (o = [...e], c = o.length);
     else {
       if (e == null)
         throw X(
-          pr
+          yr
         );
-      o = Ve(e), c = ur(o.length);
+      o = Ve(e), c = lr(o.length);
     }
     const v = new s(c);
     if (i.length === 0)
@@ -546,13 +546,13 @@ class P {
    */
   static of(...e) {
     const i = this;
-    if (!wr(i, Wt))
+    if (!dr(i, Gt))
       throw X(
-        qr
+        Xr
       );
     const s = e.length;
-    if (i === P) {
-      const c = new P(s), l = O(c);
+    if (i === B) {
+      const c = new B(s), l = O(c);
       for (let v = 0; v < s; ++v)
         l[v] = Ee(e[v]);
       return c;
@@ -566,7 +566,7 @@ class P {
   keys() {
     R(this);
     const e = O(this);
-    return fs(e);
+    return vs(e);
   }
   /**
    * limitation: returns a object whose prototype is not `%ArrayIteratorPrototype%`
@@ -575,8 +575,8 @@ class P {
   values() {
     R(this);
     const e = O(this);
-    return nn(function* () {
-      for (const i of vs(e))
+    return tn(function* () {
+      for (const i of ys(e))
         yield L(i);
     }());
   }
@@ -587,8 +587,8 @@ class P {
   entries() {
     R(this);
     const e = O(this);
-    return nn(function* () {
-      for (const [i, s] of ys(e))
+    return tn(function* () {
+      for (const [i, s] of ps(e))
         yield (
           /** @type {[number, number]} */
           [i, L(s)]
@@ -598,21 +598,21 @@ class P {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.at */
   at(e) {
     R(this);
-    const i = O(this), s = x(i), o = me(e), c = o >= 0 ? o : s + o;
+    const i = O(this), s = x(i), o = Ue(e), c = o >= 0 ? o : s + o;
     if (!(c < 0 || c >= s))
       return L(i[c]);
   }
   /** @see https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.with */
   with(e, i) {
     R(this);
-    const s = O(this), o = x(s), c = me(e), l = c >= 0 ? c : o + c, v = +i;
+    const s = O(this), o = x(s), c = Ue(e), l = c >= 0 ? c : o + c, v = +i;
     if (l < 0 || l >= o)
-      throw lr(ar);
+      throw cr(or);
     const y = new ce(
       $(s),
       Be(s),
       x(s)
-    ), E = new P(
+    ), E = new B(
       $(
         ot(y)
       )
@@ -622,19 +622,19 @@ class P {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.map */
   map(e, ...i) {
     R(this);
-    const s = O(this), o = x(s), c = i[0], l = Lt(s, P);
-    if (l === P) {
-      const y = new P(o), E = O(y);
+    const s = O(this), o = x(s), c = i[0], l = Ft(s, B);
+    if (l === B) {
+      const y = new B(o), E = O(y);
       for (let b = 0; b < o; ++b) {
-        const m = L(s[b]);
+        const U = L(s[b]);
         E[b] = Ee(
-          ie(e, c, [m, b, this])
+          ie(e, c, [U, b, this])
         );
       }
       return y;
     }
     const v = new l(o);
-    Pt(v, o);
+    Lt(v, o);
     for (let y = 0; y < o; ++y) {
       const E = L(s[y]);
       v[y] = ie(e, c, [E, y, this]);
@@ -650,10 +650,10 @@ class P {
     const s = O(this), o = x(s), c = i[0], l = [];
     for (let E = 0; E < o; ++E) {
       const b = L(s[E]);
-      ie(e, c, [b, E, this]) && rs(l, b);
+      ie(e, c, [b, E, this]) && ns(l, b);
     }
-    const v = Lt(s, P), y = new v(l);
-    return Pt(y), /** @type {any} */
+    const v = Ft(s, B), y = new v(l);
+    return Lt(y), /** @type {any} */
     y;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.reduce */
@@ -661,7 +661,7 @@ class P {
     R(this);
     const s = O(this), o = x(s);
     if (o === 0 && i.length === 0)
-      throw X(Jr);
+      throw X(qr);
     let c, l;
     i.length === 0 ? (c = L(s[0]), l = 1) : (c = i[0], l = 0);
     for (let v = l; v < o; ++v)
@@ -678,7 +678,7 @@ class P {
     R(this);
     const s = O(this), o = x(s);
     if (o === 0 && i.length === 0)
-      throw X(Jr);
+      throw X(qr);
     let c, l;
     i.length === 0 ? (c = L(s[o - 1]), l = o - 2) : (c = i[0], l = o - 1);
     for (let v = l; v >= 0; --v)
@@ -772,31 +772,31 @@ class P {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.set */
   set(e, ...i) {
     R(this);
-    const s = O(this), o = me(i[0]);
+    const s = O(this), o = Ue(i[0]);
     if (o < 0)
-      throw lr(ar);
+      throw cr(or);
     if (e == null)
       throw X(
-        pr
+        yr
       );
-    if (Sr(e))
+    if (gr(e))
       throw X(
-        dr
+        pr
       );
     if (Xe(e))
-      return ps(
+      return ds(
         O(this),
         O(e),
         o
       );
-    if (Gt(e)) {
+    if (Ht(e)) {
       const y = $(e);
       if (yt(y))
         throw X(vt);
     }
-    const c = x(s), l = Ve(e), v = ur(l.length);
+    const c = x(s), l = Ve(e), v = lr(l.length);
     if (o === 1 / 0 || v + o > c)
-      throw lr(ar);
+      throw cr(or);
     for (let y = 0; y < v; ++y)
       s[y + o] = Ee(l[y]);
   }
@@ -804,7 +804,7 @@ class P {
   reverse() {
     R(this);
     const e = O(this);
-    return en(e), this;
+    return jr(e), this;
   }
   /** @see https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.toReversed */
   toReversed() {
@@ -813,18 +813,18 @@ class P {
       $(e),
       Be(e),
       x(e)
-    ), s = new P(
+    ), s = new B(
       $(
         ot(i)
       )
     ), o = O(s);
-    return en(o), s;
+    return jr(o), s;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.fill */
   fill(e, ...i) {
     R(this);
     const s = O(this);
-    return ds(
+    return ws(
       s,
       Ee(e),
       ...ht(i)
@@ -834,86 +834,86 @@ class P {
   copyWithin(e, i, ...s) {
     R(this);
     const o = O(this);
-    return ws(o, e, i, ...ht(s)), this;
+    return As(o, e, i, ...ht(s)), this;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.sort */
   sort(e) {
     R(this);
-    const i = O(this), s = e !== void 0 ? e : cn;
-    return tn(i, (o, c) => s(L(o), L(c))), this;
+    const i = O(this), s = e !== void 0 ? e : on;
+    return Kr(i, (o, c) => s(L(o), L(c))), this;
   }
   /** @see https://tc39.es/proposal-change-array-by-copy/#sec-%typedarray%.prototype.toSorted */
   toSorted(e) {
     R(this);
     const i = O(this);
     if (e !== void 0 && typeof e != "function")
-      throw new X(Vi);
-    const s = e !== void 0 ? e : cn, o = new ce(
+      throw new X(Ji);
+    const s = e !== void 0 ? e : on, o = new ce(
       $(i),
       Be(i),
       x(i)
-    ), c = new P(
+    ), c = new B(
       $(
         ot(o)
       )
     ), l = O(c);
-    return tn(l, (v, y) => s(L(v), L(y))), c;
+    return Kr(l, (v, y) => s(L(v), L(y))), c;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.slice */
   slice(e, i) {
     R(this);
-    const s = O(this), o = Lt(s, P);
-    if (o === P) {
+    const s = O(this), o = Ft(s, B);
+    if (o === B) {
       const Ze = new ce(
         $(s),
         Be(s),
         x(s)
       );
-      return new P(
+      return new B(
         $(
           ot(Ze, e, i)
         )
       );
     }
-    const c = x(s), l = me(e), v = i === void 0 ? c : me(i);
+    const c = x(s), l = Ue(e), v = i === void 0 ? c : Ue(i);
     let y;
     l === -1 / 0 ? y = 0 : l < 0 ? y = c + l > 0 ? c + l : 0 : y = c < l ? c : l;
     let E;
     v === -1 / 0 ? E = 0 : v < 0 ? E = c + v > 0 ? c + v : 0 : E = c < v ? c : v;
-    const b = E - y > 0 ? E - y : 0, m = new o(b);
-    if (Pt(m, b), b === 0)
-      return m;
+    const b = E - y > 0 ? E - y : 0, U = new o(b);
+    if (Lt(U, b), b === 0)
+      return U;
     const q = $(s);
     if (yt(q))
       throw X(vt);
     let se = 0;
     for (; y < E; )
-      m[se] = L(s[y]), ++y, ++se;
+      U[se] = L(s[y]), ++y, ++se;
     return (
       /** @type {any} */
-      m
+      U
     );
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.subarray */
   subarray(e, i) {
     R(this);
-    const s = O(this), o = Lt(s, P), c = new ce(
+    const s = O(this), o = Ft(s, B), c = new ce(
       $(s),
       Be(s),
       x(s)
-    ), l = As(c, e, i), v = new o(
+    ), l = gs(c, e, i), v = new o(
       $(l),
       Be(l),
       x(l)
     );
-    return Pt(v), /** @type {any} */
+    return Lt(v), /** @type {any} */
     v;
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.indexof */
   indexOf(e, ...i) {
     R(this);
     const s = O(this), o = x(s);
-    let c = me(i[0]);
+    let c = Ue(i[0]);
     if (c === 1 / 0)
       return -1;
     c < 0 && (c += o, c < 0 && (c = 0));
@@ -926,7 +926,7 @@ class P {
   lastIndexOf(e, ...i) {
     R(this);
     const s = O(this), o = x(s);
-    let c = i.length >= 1 ? me(i[0]) : o - 1;
+    let c = i.length >= 1 ? Ue(i[0]) : o - 1;
     if (c === -1 / 0)
       return -1;
     c >= 0 ? c = c < o - 1 ? c : o - 1 : c += o;
@@ -939,7 +939,7 @@ class P {
   includes(e, ...i) {
     R(this);
     const s = O(this), o = x(s);
-    let c = me(i[0]);
+    let c = Ue(i[0]);
     if (c === 1 / 0)
       return !1;
     c < 0 && (c += o, c < 0 && (c = 0));
@@ -954,17 +954,17 @@ class P {
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.join */
   join(e) {
     R(this);
-    const i = O(this), s = ln(i);
-    return ts(s, e);
+    const i = O(this), s = an(i);
+    return rs(s, e);
   }
   /** @see https://tc39.es/ecma262/#sec-%typedarray%.prototype.tolocalestring */
   toLocaleString(...e) {
     R(this);
-    const i = O(this), s = ln(i);
-    return ns(s, ...ht(e));
+    const i = O(this), s = an(i);
+    return is(s, ...ht(e));
   }
   /** @see https://tc39.es/ecma262/#sec-get-%typedarray%.prototype-@@tostringtag */
-  get [br]() {
+  get [Ir]() {
     if (Xe(this))
       return (
         /** @type {any} */
@@ -972,54 +972,30 @@ class P {
       );
   }
 }
-gt(P, "BYTES_PER_ELEMENT", {
-  value: xr
+gt(B, "BYTES_PER_ELEMENT", {
+  value: Cr
 });
-gt(P, Wt, {});
-wn(P, Or);
-const Yt = P.prototype;
-gt(Yt, "BYTES_PER_ELEMENT", {
-  value: xr
+gt(B, Gt, {});
+dn(B, br);
+const Xt = B.prototype;
+gt(Xt, "BYTES_PER_ELEMENT", {
+  value: Cr
 });
-gt(Yt, Ie, {
-  value: Yt.values,
+gt(Xt, Ie, {
+  value: Xt.values,
   writable: !0,
   configurable: !0
 });
-wn(Yt, Q);
-function Bs(r, e, ...i) {
+dn(Xt, Q);
+function zs(r, e, ...i) {
   return L(
-    _s(r, e, ...ht(i))
+    bs(r, e, ...ht(i))
   );
 }
-function bo(r) {
-  const e = r instanceof Int8Array ? "int8" : r instanceof Uint8Array || r instanceof Uint8ClampedArray ? "uint8" : r instanceof Int16Array ? "int16" : r instanceof Uint16Array ? "uint16" : r instanceof Int32Array ? "int32" : r instanceof Uint32Array ? "uint32" : r instanceof P ? "float16" : r instanceof Float32Array ? "float32" : r instanceof Float64Array ? "float64" : null;
-  return _r(e != null), e;
-}
-function No(r) {
-  return r instanceof Int8Array || r instanceof Uint8Array || r instanceof Uint8ClampedArray || r instanceof Int16Array || r instanceof Uint16Array || r instanceof Int32Array || r instanceof Uint32Array || r instanceof P || r instanceof Float32Array || r instanceof Float64Array;
-}
-let Mt;
-function zs() {
-  if (Mt != null)
-    return Mt;
-  const r = new Uint32Array([268435456]);
-  return Mt = new Uint8Array(r.buffer, r.byteOffset, r.byteLength)[0] === 0, Mt;
-}
-function ke(r, e, i, s = !0) {
-  if (s === zs())
-    return new e(r);
-  const o = Object.assign(new DataView(r), {
-    getFloat16(l, v) {
-      return Bs(this, l, v);
-    }
-  }), c = new e(o.byteLength / e.BYTES_PER_ELEMENT);
-  for (let l = 0, v = 0; l < c.length; ++l, v += e.BYTES_PER_ELEMENT)
-    c[l] = o[i](v, s);
-  return c;
+function Io(r) {
+  return r instanceof Int8Array || r instanceof Uint8Array || r instanceof Uint8ClampedArray || r instanceof Int16Array || r instanceof Uint16Array || r instanceof Int32Array || r instanceof Uint32Array || r instanceof B || r instanceof Float32Array || r instanceof Float64Array;
 }
-const ks = (r) => new Uint8Array(r), Oo = (r) => new Int8Array(r), Zs = (r, e) => ke(r, Uint16Array, "getUint16", e), Hs = (r, e) => ke(r, Int16Array, "getInt16", e), Uo = (r, e) => ke(r, Int32Array, "getInt32", e), mo = (r, e) => ke(r, Uint32Array, "getUint32", e), Co = (r, e) => ke(r, P, "getFloat16", e), Gs = (r, e) => ke(r, Float32Array, "getFloat32", e), Ro = (r, e) => ke(r, Float64Array, "getFloat64", e);
-class Ws extends Vt {
+class ks extends qt {
   load(e, i, s, o) {
     const c = new ki(this.manager);
     c.setRequestHeader(this.requestHeader), c.setPath(this.path), c.setWithCredentials(this.withCredentials), c.load(
@@ -1036,27 +1012,26 @@ class Ws extends Vt {
     );
   }
 }
-function St(r) {
-  return class extends Ws {
+function Mn(r) {
+  return class extends ks {
     constructor() {
       super(...arguments), this.parseTypedArray = r;
     }
   };
 }
-function xo(r) {
-  return new (St(r))();
+function _o(r) {
+  return new (Mn(r))();
 }
-const Fo = /* @__PURE__ */ St(Hs), Lo = /* @__PURE__ */ St(Zs), Po = /* @__PURE__ */ St(Gs);
-function Xs(r) {
-  const e = r instanceof Int8Array ? Ui : r instanceof Uint8Array ? Hr : r instanceof Uint8ClampedArray ? Hr : r instanceof Int16Array ? mi : r instanceof Uint16Array ? Ci : r instanceof Int32Array ? Ri : r instanceof Uint32Array ? xi : r instanceof P ? lt : r instanceof Float32Array ? ft : r instanceof Float64Array ? ft : null;
-  return _r(e != null), e;
+function Zs(r) {
+  const e = r instanceof Int8Array ? mi : r instanceof Uint8Array ? kr : r instanceof Uint8ClampedArray ? kr : r instanceof Int16Array ? Ui : r instanceof Uint16Array ? Ci : r instanceof Int32Array ? Ri : r instanceof Uint32Array ? xi : r instanceof B ? lt : r instanceof Float32Array ? ft : r instanceof Float64Array ? ft : null;
+  return vn(e != null), e;
 }
-const Ys = {
-  format: hn,
-  minFilter: kt,
-  magFilter: kt
+const Hs = {
+  format: ln,
+  minFilter: zt,
+  magFilter: zt
 };
-class qs extends Vt {
+class Gs extends qt {
   constructor() {
     super(...arguments), this.parameters = {};
   }
@@ -1065,9 +1040,9 @@ class qs extends Vt {
     l.setRequestHeader(this.requestHeader), l.setPath(this.path), l.setWithCredentials(this.withCredentials), l.load(
       e,
       (v) => {
-        c.image.data = v instanceof P ? new Uint16Array(v.buffer) : v;
-        const { width: y, height: E, depth: b, ...m } = this.parameters;
-        y != null && (c.image.width = y), E != null && (c.image.height = E), "depth" in c.image && b != null && (c.image.depth = b), c.type = Xs(v), Object.assign(c, m), c.needsUpdate = !0, i(c);
+        c.image.data = v instanceof B ? new Uint16Array(v.buffer) : v;
+        const { width: y, height: E, depth: b, ...U } = this.parameters;
+        y != null && (c.image.width = y), E != null && (c.image.height = E), "depth" in c.image && b != null && (c.image.depth = b), c.type = Zs(v), Object.assign(c, U), c.needsUpdate = !0, i(c);
       },
       s,
       o
@@ -1075,47 +1050,47 @@ class qs extends Vt {
   }
 }
 function Dn(r, e, i) {
-  return class extends qs {
+  return class extends Gs {
     constructor() {
-      super(...arguments), this.Texture = r, this.TypedArrayLoader = St(e), this.parameters = {
-        ...Ys,
+      super(...arguments), this.Texture = r, this.TypedArrayLoader = Mn(e), this.parameters = {
+        ...Hs,
         ...i
       };
     }
   };
 }
 function Bn(r, e) {
-  return Dn(fn, r, e);
+  return Dn(un, r, e);
 }
-function Vs(r, e) {
+function Ws(r, e) {
   return Dn(Fi, r, e);
 }
-function Mo(r, e) {
+function bo(r, e) {
   return new (Bn(r, e))();
 }
-function Do(r, e) {
-  return new (Vs(r, e))();
+function No(r, e) {
+  return new (Ws(r, e))();
 }
-const Je = ye.clamp, Bo = ye.euclideanModulo, zo = ye.inverseLerp, ko = ye.lerp, Zo = ye.degToRad, Ho = ye.radToDeg, Go = ye.isPowerOfTwo, Wo = ye.ceilPowerOfTwo, Xo = ye.floorPowerOfTwo, Yo = ye.normalize;
-function qo(r, e, i, s = 0, o = 1) {
+const Je = ye.clamp, Oo = ye.euclideanModulo, mo = ye.inverseLerp, Uo = ye.lerp, Co = ye.degToRad, Ro = ye.radToDeg, xo = ye.isPowerOfTwo, Fo = ye.ceilPowerOfTwo, Lo = ye.floorPowerOfTwo, Po = ye.normalize;
+function Mo(r, e, i, s = 0, o = 1) {
   return ye.mapLinear(r, e, i, s, o);
 }
-function Vo(r, e, i, s = 0, o = 1) {
+function Do(r, e, i, s = 0, o = 1) {
   return Je(ye.mapLinear(r, e, i, s, o), s, o);
 }
-function Jo(r, e, i) {
+function Bo(r, e, i) {
   return i <= r ? 0 : i >= e ? 1 : (i = (i - r) / (e - r), i * i * (3 - 2 * i));
 }
-function $o(r) {
+function zo(r) {
   return Math.min(Math.max(r, 0), 1);
 }
-function Qo(r, e, i, s = i) {
+function ko(r, e, i, s = i) {
   const o = Math.abs(r - e);
   return o <= s || o <= i * Math.max(Math.abs(r), Math.abs(e));
 }
-function jo(r) {
+function Zo(r) {
   return (e, i) => {
-    e instanceof Jt ? Object.defineProperty(e, i, {
+    e instanceof Vt ? Object.defineProperty(e, i, {
       enumerable: !0,
       get() {
         var s;
@@ -1136,12 +1111,12 @@ function jo(r) {
     });
   };
 }
-function Ko(r, {
+function Ho(r, {
   min: e = Number.MIN_SAFE_INTEGER,
   max: i = Number.MAX_SAFE_INTEGER
 } = {}) {
   return (s, o) => {
-    s instanceof Jt ? Object.defineProperty(s, o, {
+    s instanceof Vt ? Object.defineProperty(s, o, {
       enumerable: !0,
       get() {
         var l;
@@ -1165,13 +1140,13 @@ function Ko(r, {
     });
   };
 }
-function ea(r, {
+function Go(r, {
   min: e = -1 / 0,
   max: i = 1 / 0,
   precision: s = 7
 } = {}) {
   return (o, c) => {
-    o instanceof Jt ? Object.defineProperty(o, c, {
+    o instanceof Vt ? Object.defineProperty(o, c, {
       enumerable: !0,
       get() {
         var v;
@@ -1195,9 +1170,9 @@ function ea(r, {
     });
   };
 }
-function ta(r, { validate: e } = {}) {
+function Wo(r, { validate: e } = {}) {
   return (i, s) => {
-    i instanceof Jt ? Object.defineProperty(i, s, {
+    i instanceof Vt ? Object.defineProperty(i, s, {
       enumerable: !0,
       get() {
         var o;
@@ -1229,7 +1204,7 @@ function ta(r, { validate: e } = {}) {
     });
   };
 }
-function ra(r, ...e) {
+function Xo(r, ...e) {
   const i = {};
   for (let s = 0; s < e.length; s += 2) {
     const o = e[s], c = e[s + 1];
@@ -1244,7 +1219,7 @@ function ra(r, ...e) {
   }
   return Object.defineProperties(r, i), r;
 }
-function na(r, e, i) {
+function Yo(r, e, i) {
   const s = {};
   for (const o of i)
     s[o] = {
@@ -1256,8 +1231,8 @@ function na(r, e, i) {
     };
   return Object.defineProperties(r, s), r;
 }
-const Js = parseInt(Li.replace(/\D+/g, ""));
-var ve = Uint8Array, Le = Uint16Array, Er = Uint32Array, zn = new ve([
+const Xs = parseInt(Li.replace(/\D+/g, ""));
+var ve = Uint8Array, Le = Uint16Array, Tr = Uint32Array, zn = new ve([
   0,
   0,
   0,
@@ -1326,19 +1301,19 @@ var ve = Uint8Array, Le = Uint16Array, Er = Uint32Array, zn = new ve([
   /* unused */
   0,
   0
-]), $s = new ve([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Zn = function(r, e) {
+]), Ys = new ve([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]), Zn = function(r, e) {
   for (var i = new Le(31), s = 0; s < 31; ++s)
     i[s] = e += 1 << r[s - 1];
-  for (var o = new Er(i[30]), s = 1; s < 30; ++s)
+  for (var o = new Tr(i[30]), s = 1; s < 30; ++s)
     for (var c = i[s]; c < i[s + 1]; ++c)
       o[c] = c - i[s] << 5 | s;
   return [i, o];
-}, Hn = Zn(zn, 2), Gn = Hn[0], Qs = Hn[1];
-Gn[28] = 258, Qs[258] = 28;
-var js = Zn(kn, 0), Ks = js[0], Ir = new Le(32768);
+}, Hn = Zn(zn, 2), Gn = Hn[0], qs = Hn[1];
+Gn[28] = 258, qs[258] = 28;
+var Vs = Zn(kn, 0), Js = Vs[0], Er = new Le(32768);
 for (var G = 0; G < 32768; ++G) {
   var Fe = (G & 43690) >>> 1 | (G & 21845) << 1;
-  Fe = (Fe & 52428) >>> 2 | (Fe & 13107) << 2, Fe = (Fe & 61680) >>> 4 | (Fe & 3855) << 4, Ir[G] = ((Fe & 65280) >>> 8 | (Fe & 255) << 8) >>> 1;
+  Fe = (Fe & 52428) >>> 2 | (Fe & 13107) << 2, Fe = (Fe & 61680) >>> 4 | (Fe & 3855) << 4, Er[G] = ((Fe & 65280) >>> 8 | (Fe & 255) << 8) >>> 1;
 }
 var pt = function(r, e, i) {
   for (var s = r.length, o = 0, c = new Le(e); o < s; ++o)
@@ -1352,68 +1327,68 @@ var pt = function(r, e, i) {
     var y = 15 - e;
     for (o = 0; o < s; ++o)
       if (r[o])
-        for (var E = o << 4 | r[o], b = e - r[o], m = l[r[o] - 1]++ << b, q = m | (1 << b) - 1; m <= q; ++m)
-          v[Ir[m] >>> y] = E;
+        for (var E = o << 4 | r[o], b = e - r[o], U = l[r[o] - 1]++ << b, q = U | (1 << b) - 1; U <= q; ++U)
+          v[Er[U] >>> y] = E;
   } else
     for (v = new Le(s), o = 0; o < s; ++o)
-      r[o] && (v[o] = Ir[l[r[o] - 1]++] >>> 15 - r[o]);
+      r[o] && (v[o] = Er[l[r[o] - 1]++] >>> 15 - r[o]);
   return v;
-}, Tt = new ve(288);
+}, St = new ve(288);
 for (var G = 0; G < 144; ++G)
-  Tt[G] = 8;
+  St[G] = 8;
 for (var G = 144; G < 256; ++G)
-  Tt[G] = 9;
+  St[G] = 9;
 for (var G = 256; G < 280; ++G)
-  Tt[G] = 7;
+  St[G] = 7;
 for (var G = 280; G < 288; ++G)
-  Tt[G] = 8;
+  St[G] = 8;
 var Wn = new ve(32);
 for (var G = 0; G < 32; ++G)
   Wn[G] = 5;
-var eo = /* @__PURE__ */ pt(Tt, 9, 1), to = /* @__PURE__ */ pt(Wn, 5, 1), hr = function(r) {
+var $s = /* @__PURE__ */ pt(St, 9, 1), Qs = /* @__PURE__ */ pt(Wn, 5, 1), ur = function(r) {
   for (var e = r[0], i = 1; i < r.length; ++i)
     r[i] > e && (e = r[i]);
   return e;
 }, de = function(r, e, i) {
   var s = e / 8 | 0;
   return (r[s] | r[s + 1] << 8) >> (e & 7) & i;
-}, fr = function(r, e) {
+}, hr = function(r, e) {
   var i = e / 8 | 0;
   return (r[i] | r[i + 1] << 8 | r[i + 2] << 16) >> (e & 7);
-}, ro = function(r) {
+}, js = function(r) {
   return (r / 8 | 0) + (r & 7 && 1);
-}, no = function(r, e, i) {
+}, Ks = function(r, e, i) {
   (i == null || i > r.length) && (i = r.length);
-  var s = new (r instanceof Le ? Le : r instanceof Er ? Er : ve)(i - e);
+  var s = new (r instanceof Le ? Le : r instanceof Tr ? Tr : ve)(i - e);
   return s.set(r.subarray(e, i)), s;
-}, io = function(r, e, i) {
+}, eo = function(r, e, i) {
   var s = r.length;
   if (!s || i && !i.l && s < 5)
     return e || new ve(0);
   var o = !e || i, c = !i || i.i;
   i || (i = {}), e || (e = new ve(s * 3));
-  var l = function(M) {
+  var l = function(P) {
     var be = e.length;
-    if (M > be) {
-      var Ne = new ve(Math.max(be * 2, M));
+    if (P > be) {
+      var Ne = new ve(Math.max(be * 2, P));
       Ne.set(e), e = Ne;
     }
-  }, v = i.f || 0, y = i.p || 0, E = i.b || 0, b = i.l, m = i.d, q = i.m, se = i.n, Ze = s * 8;
+  }, v = i.f || 0, y = i.p || 0, E = i.b || 0, b = i.l, U = i.d, q = i.m, se = i.n, Ze = s * 8;
   do {
     if (!b) {
       i.f = v = de(r, y, 1);
-      var Et = de(r, y + 1, 3);
-      if (y += 3, Et)
-        if (Et == 1)
-          b = eo, m = to, q = 9, se = 5;
-        else if (Et == 2) {
-          var bt = de(r, y, 31) + 257, tr = de(r, y + 10, 15) + 4, rr = bt + de(r, y + 5, 31) + 1;
+      var Tt = de(r, y + 1, 3);
+      if (y += 3, Tt)
+        if (Tt == 1)
+          b = $s, U = Qs, q = 9, se = 5;
+        else if (Tt == 2) {
+          var _t = de(r, y, 31) + 257, er = de(r, y + 10, 15) + 4, tr = _t + de(r, y + 5, 31) + 1;
           y += 14;
-          for (var He = new ve(rr), Nt = new ve(19), oe = 0; oe < tr; ++oe)
-            Nt[$s[oe]] = de(r, y + oe * 3, 7);
-          y += tr * 3;
-          for (var Ot = hr(Nt), nr = (1 << Ot) - 1, ir = pt(Nt, Ot, 1), oe = 0; oe < rr; ) {
-            var le = ir[de(r, y, nr)];
+          for (var He = new ve(tr), bt = new ve(19), oe = 0; oe < er; ++oe)
+            bt[Ys[oe]] = de(r, y + oe * 3, 7);
+          y += er * 3;
+          for (var Nt = ur(bt), rr = (1 << Nt) - 1, nr = pt(bt, Nt, 1), oe = 0; oe < tr; ) {
+            var le = nr[de(r, y, rr)];
             y += le & 15;
             var pe = le >>> 4;
             if (pe < 16)
@@ -1424,18 +1399,18 @@ var eo = /* @__PURE__ */ pt(Tt, 9, 1), to = /* @__PURE__ */ pt(Wn, 5, 1), hr = f
                 He[oe++] = _e;
             }
           }
-          var Ut = He.subarray(0, bt), Se = He.subarray(bt);
-          q = hr(Ut), se = hr(Se), b = pt(Ut, q, 1), m = pt(Se, se, 1);
+          var Ot = He.subarray(0, _t), Se = He.subarray(_t);
+          q = ur(Ot), se = ur(Se), b = pt(Ot, q, 1), U = pt(Se, se, 1);
         } else
           throw "invalid block type";
       else {
-        var pe = ro(y) + 4, It = r[pe - 4] | r[pe - 3] << 8, _t = pe + It;
-        if (_t > s) {
+        var pe = js(y) + 4, Et = r[pe - 4] | r[pe - 3] << 8, It = pe + Et;
+        if (It > s) {
           if (c)
             throw "unexpected EOF";
           break;
         }
-        o && l(E + It), e.set(r.subarray(pe, _t), E), i.b = E += It, i.p = y = _t * 8;
+        o && l(E + Et), e.set(r.subarray(pe, It), E), i.b = E += Et, i.p = y = It * 8;
         continue;
       }
       if (y > Ze) {
@@ -1445,8 +1420,8 @@ var eo = /* @__PURE__ */ pt(Tt, 9, 1), to = /* @__PURE__ */ pt(Wn, 5, 1), hr = f
       }
     }
     o && l(E + 131072);
-    for (var mt = (1 << q) - 1, Ct = (1 << se) - 1, je = y; ; je = y) {
-      var _e = b[fr(r, y) & mt], ee = _e >>> 4;
+    for (var mt = (1 << q) - 1, Ut = (1 << se) - 1, je = y; ; je = y) {
+      var _e = b[hr(r, y) & mt], ee = _e >>> 4;
       if (y += _e & 15, y > Ze) {
         if (c)
           throw "unexpected EOF";
@@ -1465,14 +1440,14 @@ var eo = /* @__PURE__ */ pt(Tt, 9, 1), to = /* @__PURE__ */ pt(Wn, 5, 1), hr = f
           var oe = ee - 257, re = zn[oe];
           Ge = de(r, y, (1 << re) - 1) + Gn[oe], y += re;
         }
-        var Pe = m[fr(r, y) & Ct], Me = Pe >>> 4;
+        var Pe = U[hr(r, y) & Ut], Me = Pe >>> 4;
         if (!Pe)
           throw "invalid distance";
         y += Pe & 15;
-        var Se = Ks[Me];
+        var Se = Js[Me];
         if (Me > 3) {
           var re = kn[Me];
-          Se += fr(r, y) & (1 << re) - 1, y += re;
+          Se += hr(r, y) & (1 << re) - 1, y += re;
         }
         if (y > Ze) {
           if (c)
@@ -1485,49 +1460,49 @@ var eo = /* @__PURE__ */ pt(Tt, 9, 1), to = /* @__PURE__ */ pt(Wn, 5, 1), hr = f
         E = Ke;
       }
     }
-    i.l = b, i.p = je, i.b = E, b && (v = 1, i.m = q, i.d = m, i.n = se);
+    i.l = b, i.p = je, i.b = E, b && (v = 1, i.m = q, i.d = U, i.n = se);
   } while (!v);
-  return E == e.length ? e : no(e, 0, E);
-}, so = /* @__PURE__ */ new ve(0), oo = function(r) {
+  return E == e.length ? e : Ks(e, 0, E);
+}, to = /* @__PURE__ */ new ve(0), ro = function(r) {
   if ((r[0] & 15) != 8 || r[0] >>> 4 > 7 || (r[0] << 8 | r[1]) % 31)
     throw "invalid zlib data";
   if (r[1] & 32)
     throw "invalid zlib data: preset dictionaries not supported";
 };
-function Dt(r, e) {
-  return io((oo(r), r.subarray(2, -4)), e);
+function Pt(r, e) {
+  return eo((ro(r), r.subarray(2, -4)), e);
 }
-var ao = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), co = 0;
+var no = typeof TextDecoder < "u" && /* @__PURE__ */ new TextDecoder(), io = 0;
 try {
-  ao.decode(so, { stream: !0 }), co = 1;
+  no.decode(to, { stream: !0 }), io = 1;
 } catch {
 }
-const at = Js >= 152;
-class lo extends Pi {
+const at = Xs >= 152;
+class so extends Pi {
   constructor(e) {
     super(e), this.type = lt;
   }
   parse(e) {
-    const Ot = Math.pow(2.7182818, 2.2);
-    function nr(t, n) {
+    const Nt = Math.pow(2.7182818, 2.2);
+    function rr(t, n) {
       for (var a = 0, u = 0; u < 65536; ++u)
         (u == 0 || t[u >> 3] & 1 << (u & 7)) && (n[a++] = u);
       for (var h = a - 1; a < 65536; )
         n[a++] = 0;
       return h;
     }
-    function ir(t) {
+    function nr(t) {
       for (var n = 0; n < 16384; n++)
         t[n] = {}, t[n].len = 0, t[n].lit = 0, t[n].p = null;
     }
     const le = { l: 0, c: 0, lc: 0 };
     function _e(t, n, a, u, h) {
       for (; a < t; )
-        n = n << 8 | zr(u, h), a += 8;
+        n = n << 8 | Dr(u, h), a += 8;
       a -= t, le.l = n >> a & (1 << t) - 1, le.c = n, le.lc = a;
     }
     const ge = new Array(59);
-    function Ut(t) {
+    function Ot(t) {
       for (var n = 0; n <= 58; ++n)
         ge[n] = 0;
       for (var n = 0; n < 65537; ++n)
@@ -1566,17 +1541,17 @@ class lo extends Pi {
           h--;
         }
       }
-      Ut(d);
+      Ot(d);
     }
     function mt(t) {
       return t & 63;
     }
-    function Ct(t) {
+    function Ut(t) {
       return t >> 6;
     }
     function je(t, n, a, u) {
       for (; n <= a; n++) {
-        var h = Ct(t[n]), f = mt(t[n]);
+        var h = Ut(t[n]), f = mt(t[n]);
         if (h >> f)
           throw "Invalid table entry";
         if (f > 14) {
@@ -1603,7 +1578,7 @@ class lo extends Pi {
     }
     const ee = { c: 0, lc: 0 };
     function Ge(t, n, a, u) {
-      t = t << 8 | zr(a, u), n += 8, ee.c = t, ee.lc = n;
+      t = t << 8 | Dr(a, u), n += 8, ee.c = t, ee.lc = n;
     }
     const re = { c: 0, lc: 0 };
     function Pe(t, n, a, u, h, f, d, p, g, A) {
@@ -1627,33 +1602,33 @@ class lo extends Pi {
       var n = Me(t);
       return n > 32767 ? n - 65536 : n;
     }
-    const M = { a: 0, b: 0 };
+    const P = { a: 0, b: 0 };
     function be(t, n) {
       var a = Ke(t), u = Ke(n), h = u, f = a + (h & 1) + (h >> 1), d = f, p = f - h;
-      M.a = d, M.b = p;
+      P.a = d, P.b = p;
     }
     function Ne(t, n) {
       var a = Me(t), u = Me(n), h = a - (u >> 1) & 65535, f = u + h - 32768 & 65535;
-      M.a = f, M.b = h;
+      P.a = f, P.b = h;
     }
     function Vn(t, n, a, u, h, f, d) {
       for (var p = d < 16384, g = a > h ? h : a, A = 1, S; A <= g; )
         A <<= 1;
       for (A >>= 1, S = A, A >>= 1; A >= 1; ) {
-        for (var w = 0, Y = w + f * (h - S), I = f * A, _ = f * S, N = u * A, U = u * S, D, z, V, te; w <= Y; w += _) {
-          for (var k = w, Te = w + u * (a - S); k <= Te; k += U) {
+        for (var w = 0, Y = w + f * (h - S), I = f * A, _ = f * S, N = u * A, m = u * S, M, z, V, te; w <= Y; w += _) {
+          for (var k = w, Te = w + u * (a - S); k <= Te; k += m) {
             var H = k + N, J = k + I, Oe = J + N;
-            p ? (be(t[k + n], t[J + n]), D = M.a, V = M.b, be(t[H + n], t[Oe + n]), z = M.a, te = M.b, be(D, z), t[k + n] = M.a, t[H + n] = M.b, be(V, te), t[J + n] = M.a, t[Oe + n] = M.b) : (Ne(t[k + n], t[J + n]), D = M.a, V = M.b, Ne(t[H + n], t[Oe + n]), z = M.a, te = M.b, Ne(D, z), t[k + n] = M.a, t[H + n] = M.b, Ne(V, te), t[J + n] = M.a, t[Oe + n] = M.b);
+            p ? (be(t[k + n], t[J + n]), M = P.a, V = P.b, be(t[H + n], t[Oe + n]), z = P.a, te = P.b, be(M, z), t[k + n] = P.a, t[H + n] = P.b, be(V, te), t[J + n] = P.a, t[Oe + n] = P.b) : (Ne(t[k + n], t[J + n]), M = P.a, V = P.b, Ne(t[H + n], t[Oe + n]), z = P.a, te = P.b, Ne(M, z), t[k + n] = P.a, t[H + n] = P.b, Ne(V, te), t[J + n] = P.a, t[Oe + n] = P.b);
           }
           if (a & A) {
             var J = k + I;
-            p ? be(t[k + n], t[J + n]) : Ne(t[k + n], t[J + n]), D = M.a, t[J + n] = M.b, t[k + n] = D;
+            p ? be(t[k + n], t[J + n]) : Ne(t[k + n], t[J + n]), M = P.a, t[J + n] = P.b, t[k + n] = M;
           }
         }
         if (h & A)
-          for (var k = w, Te = w + u * (a - S); k <= Te; k += U) {
+          for (var k = w, Te = w + u * (a - S); k <= Te; k += m) {
             var H = k + N;
-            p ? be(t[k + n], t[H + n]) : Ne(t[k + n], t[H + n]), D = M.a, t[H + n] = M.b, t[k + n] = D;
+            p ? be(t[k + n], t[H + n]) : Ne(t[k + n], t[H + n]), M = P.a, t[H + n] = P.b, t[k + n] = M;
           }
         S = A, A >>= 1;
       }
@@ -1668,13 +1643,13 @@ class lo extends Pi {
           else {
             if (!N.p)
               throw "hufDecode issues";
-            var U;
-            for (U = 0; U < N.lit; U++) {
-              for (var D = mt(t[N.p[U]]); w < D && h.value < I; )
+            var m;
+            for (m = 0; m < N.lit; m++) {
+              for (var M = mt(t[N.p[m]]); w < M && h.value < I; )
                 Ge(S, w, a, h), S = ee.c, w = ee.lc;
-              if (w >= D && Ct(t[N.p[U]]) == (S >> w - D & (1 << D) - 1)) {
-                w -= D, Pe(
-                  N.p[U],
+              if (w >= M && Ut(t[N.p[m]]) == (S >> w - M & (1 << M) - 1)) {
+                w -= M, Pe(
+                  N.p[m],
                   d,
                   S,
                   w,
@@ -1688,7 +1663,7 @@ class lo extends Pi {
                 break;
               }
             }
-            if (U == N.lit)
+            if (m == N.lit)
               throw "hufDecode issues";
           }
         }
@@ -1702,14 +1677,14 @@ class lo extends Pi {
       }
       return !0;
     }
-    function Fr(t, n, a, u, h, f) {
+    function Rr(t, n, a, u, h, f) {
       var d = { value: 0 }, p = a.value, g = ne(n, a), A = ne(n, a);
       a.value += 4;
       var S = ne(n, a);
       if (a.value += 4, g < 0 || g >= 65537 || A < 0 || A >= 65537)
         throw "Something wrong with HUF_ENCSIZE";
       var w = new Array(65537), Y = new Array(16384);
-      ir(Y);
+      nr(Y);
       var I = u - (a.value - p);
       if (Se(t, n, a, I, g, A, w), S > 8 * (u - (a.value - p)))
         throw "Something wrong with hufUncompress";
@@ -1719,17 +1694,17 @@ class lo extends Pi {
       for (var u = 0; u < a; ++u)
         n[u] = t[n[u]];
     }
-    function Lr(t) {
+    function xr(t) {
       for (var n = 1; n < t.length; n++) {
         var a = t[n - 1] + t[n] - 128;
         t[n] = a;
       }
     }
-    function Pr(t, n) {
+    function Fr(t, n) {
       for (var a = 0, u = Math.floor((t.length + 1) / 2), h = 0, f = t.length - 1; !(h > f || (n[h++] = t[a++], h > f)); )
         n[h++] = t[u++];
     }
-    function Mr(t) {
+    function Lr(t) {
       for (var n = t.byteLength, a = new Array(), u = 0, h = new DataView(t); n > 0; ) {
         var f = h.getInt8(u++);
         if (f < 0) {
@@ -1747,25 +1722,25 @@ class lo extends Pi {
       return a;
     }
     function Qn(t, n, a, u, h, f) {
-      var H = new DataView(f.buffer), d = a[t.idx[0]].width, p = a[t.idx[0]].height, g = 3, A = Math.floor(d / 8), S = Math.ceil(d / 8), w = Math.ceil(p / 8), Y = d - (S - 1) * 8, I = p - (w - 1) * 8, _ = { value: 0 }, N = new Array(g), U = new Array(g), D = new Array(g), z = new Array(g), V = new Array(g);
-      for (let B = 0; B < g; ++B)
-        V[B] = n[t.idx[B]], N[B] = B < 1 ? 0 : N[B - 1] + S * w, U[B] = new Float32Array(64), D[B] = new Uint16Array(64), z[B] = new Uint16Array(S * 64);
-      for (let B = 0; B < w; ++B) {
+      var H = new DataView(f.buffer), d = a[t.idx[0]].width, p = a[t.idx[0]].height, g = 3, A = Math.floor(d / 8), S = Math.ceil(d / 8), w = Math.ceil(p / 8), Y = d - (S - 1) * 8, I = p - (w - 1) * 8, _ = { value: 0 }, N = new Array(g), m = new Array(g), M = new Array(g), z = new Array(g), V = new Array(g);
+      for (let D = 0; D < g; ++D)
+        V[D] = n[t.idx[D]], N[D] = D < 1 ? 0 : N[D - 1] + S * w, m[D] = new Float32Array(64), M[D] = new Uint16Array(64), z[D] = new Uint16Array(S * 64);
+      for (let D = 0; D < w; ++D) {
         var te = 8;
-        B == w - 1 && (te = I);
+        D == w - 1 && (te = I);
         var k = 8;
         for (let W = 0; W < S; ++W) {
           W == S - 1 && (k = Y);
           for (let F = 0; F < g; ++F)
-            D[F].fill(0), D[F][0] = h[N[F]++], jn(_, u, D[F]), Kn(D[F], U[F]), ei(U[F]);
-          ti(U);
+            M[F].fill(0), M[F][0] = h[N[F]++], jn(_, u, M[F]), Kn(M[F], m[F]), ei(m[F]);
+          ti(m);
           for (let F = 0; F < g; ++F)
-            ri(U[F], z[F], W * 64);
+            ri(m[F], z[F], W * 64);
         }
         let K = 0;
         for (let W = 0; W < g; ++W) {
           const F = a[t.idx[W]].type;
-          for (let fe = 8 * B; fe < 8 * B + te; ++fe) {
+          for (let fe = 8 * D; fe < 8 * D + te; ++fe) {
             K = V[W][fe];
             for (let De = 0; De < A; ++De) {
               const ae = De * 64 + (fe & 7) * 8;
@@ -1773,7 +1748,7 @@ class lo extends Pi {
             }
           }
           if (A != S)
-            for (let fe = 8 * B; fe < 8 * B + te; ++fe) {
+            for (let fe = 8 * D; fe < 8 * D + te; ++fe) {
               const De = V[W][fe] + 8 * A * 2 * F, ae = A * 64 + (fe & 7) * 8;
               for (let xe = 0; xe < k; ++xe)
                 H.setUint16(De + xe * 2 * F, z[W][ae + xe], !0);
@@ -1785,11 +1760,11 @@ class lo extends Pi {
         var Oe = a[t.idx[J]].type;
         if (a[J].type == 2)
           for (var it = 0; it < p; ++it) {
-            const B = V[J][it];
+            const D = V[J][it];
             for (var he = 0; he < d; ++he)
-              Te[he] = H.getUint16(B + he * 2 * Oe, !0);
+              Te[he] = H.getUint16(D + he * 2 * Oe, !0);
             for (var he = 0; he < d; ++he)
-              H.setFloat32(B + he * 2 * Oe, T(Te[he]), !0);
+              H.setFloat32(D + he * 2 * Oe, T(Te[he]), !0);
           }
       }
     }
@@ -1817,21 +1792,21 @@ class lo extends Pi {
     }
     function ri(t, n, a) {
       for (var u = 0; u < 64; ++u)
-        n[a + u] = Gr.toHalfFloat(ni(t[u]));
+        n[a + u] = Zr.toHalfFloat(ni(t[u]));
     }
     function ni(t) {
-      return t <= 1 ? Math.sign(t) * Math.pow(Math.abs(t), 2.2) : Math.sign(t) * Math.pow(Ot, Math.abs(t) - 1);
+      return t <= 1 ? Math.sign(t) * Math.pow(Math.abs(t), 2.2) : Math.sign(t) * Math.pow(Nt, Math.abs(t) - 1);
     }
-    function Dr(t) {
+    function Pr(t) {
       return new DataView(t.array.buffer, t.offset.value, t.size);
     }
     function ii(t) {
-      var n = t.viewer.buffer.slice(t.offset.value, t.offset.value + t.size), a = new Uint8Array(Mr(n)), u = new Uint8Array(a.length);
-      return Lr(a), Pr(a, u), new DataView(u.buffer);
+      var n = t.viewer.buffer.slice(t.offset.value, t.offset.value + t.size), a = new Uint8Array(Lr(n)), u = new Uint8Array(a.length);
+      return xr(a), Fr(a, u), new DataView(u.buffer);
     }
-    function sr(t) {
-      var n = t.array.slice(t.offset.value, t.offset.value + t.size), a = Dt(n), u = new Uint8Array(a.length);
-      return Lr(a), Pr(a, u), new DataView(u.buffer);
+    function ir(t) {
+      var n = t.array.slice(t.offset.value, t.offset.value + t.size), a = Pt(n), u = new Uint8Array(a.length);
+      return xr(a), Fr(a, u), new DataView(u.buffer);
     }
     function si(t) {
       for (var n = t.viewer, a = { value: t.offset.value }, u = new Uint16Array(t.width * t.scanlineBlockSize * (t.channels * t.type)), h = new Uint8Array(8192), f = 0, d = new Array(t.channels), p = 0; p < t.channels; p++)
@@ -1842,21 +1817,21 @@ class lo extends Pi {
       if (g <= A)
         for (var p = 0; p < A - g + 1; p++)
           h[p + g] = We(n, a);
-      var S = new Uint16Array(65536), w = nr(h, S), Y = ne(n, a);
-      Fr(t.array, n, a, Y, u, f);
+      var S = new Uint16Array(65536), w = rr(h, S), Y = ne(n, a);
+      Rr(t.array, n, a, Y, u, f);
       for (var p = 0; p < t.channels; ++p)
         for (var I = d[p], _ = 0; _ < d[p].size; ++_)
           Vn(u, I.start + _, I.nx, I.size, I.ny, I.nx * I.size, w);
       $n(S, u, f);
-      for (var N = 0, U = new Uint8Array(u.buffer.byteLength), D = 0; D < t.lines; D++)
+      for (var N = 0, m = new Uint8Array(u.buffer.byteLength), M = 0; M < t.lines; M++)
         for (var z = 0; z < t.channels; z++) {
           var I = d[z], V = I.nx * I.size, te = new Uint8Array(u.buffer, I.end * 2, V * 2);
-          U.set(te, N), N += V * 2, I.end += V;
+          m.set(te, N), N += V * 2, I.end += V;
         }
-      return new DataView(U.buffer);
+      return new DataView(m.buffer);
     }
     function oi(t) {
-      var n = t.array.slice(t.offset.value, t.offset.value + t.size), a = Dt(n);
+      var n = t.array.slice(t.offset.value, t.offset.value + t.size), a = Pt(n);
       const u = t.lines * t.channels * t.width, h = t.type == 1 ? new Uint16Array(u) : new Uint32Array(u);
       let f = 0, d = 0;
       const p = new Array(4);
@@ -1882,7 +1857,7 @@ class lo extends Pi {
         }
       return new DataView(h.buffer);
     }
-    function Br(t) {
+    function Mr(t) {
       var n = t.viewer, a = { value: t.offset.value }, u = new Uint8Array(t.width * t.lines * (t.channels * t.type * 2)), h = {
         version: ue(n, a),
         unknownUncompressedSize: ue(n, a),
@@ -1899,7 +1874,7 @@ class lo extends Pi {
       if (h.version < 2)
         throw "EXRLoader.parse: " + nt.compression + " version " + h.version + " is unsupported";
       for (var f = new Array(), d = tt(n, a) - 2; d > 0; ) {
-        var p = Rt(n.buffer, a), g = We(n, a), A = g >> 2 & 3, S = (g >> 4) - 1, w = new Int8Array([S])[0], Y = We(n, a);
+        var p = Ct(n.buffer, a), g = We(n, a), A = g >> 2 & 3, S = (g >> 4) - 1, w = new Int8Array([S])[0], Y = We(n, a);
         f.push({
           name: p,
           index: w,
@@ -1908,21 +1883,21 @@ class lo extends Pi {
         }), d -= p.length + 3;
       }
       for (var I = nt.channels, _ = new Array(t.channels), N = 0; N < t.channels; ++N) {
-        var U = _[N] = {}, D = I[N];
-        U.name = D.name, U.compression = 0, U.decoded = !1, U.type = D.pixelType, U.pLinear = D.pLinear, U.width = t.width, U.height = t.lines;
+        var m = _[N] = {}, M = I[N];
+        m.name = M.name, m.compression = 0, m.decoded = !1, m.type = M.pixelType, m.pLinear = M.pLinear, m.width = t.width, m.height = t.lines;
       }
       for (var z = {
         idx: new Array(3)
       }, V = 0; V < t.channels; ++V)
-        for (var U = _[V], N = 0; N < f.length; ++N) {
+        for (var m = _[V], N = 0; N < f.length; ++N) {
           var te = f[N];
-          U.name == te.name && (U.compression = te.compression, te.index >= 0 && (z.idx[te.index] = V), U.offset = V);
+          m.name == te.name && (m.compression = te.compression, te.index >= 0 && (z.idx[te.index] = V), m.offset = V);
         }
       if (h.acCompressedSize > 0)
         switch (h.acCompression) {
           case 0:
             var H = new Uint16Array(h.totalAcUncompressedCount);
-            Fr(
+            Rr(
               t.array,
               n,
               a,
@@ -1932,7 +1907,7 @@ class lo extends Pi {
             );
             break;
           case 1:
-            var k = t.array.slice(a.value, a.value + h.totalAcUncompressedCount), Te = Dt(k), H = new Uint16Array(Te.buffer);
+            var k = t.array.slice(a.value, a.value + h.totalAcUncompressedCount), Te = Pt(k), H = new Uint16Array(Te.buffer);
             a.value += h.totalAcUncompressedCount;
             break;
         }
@@ -1941,28 +1916,28 @@ class lo extends Pi {
           array: t.array,
           offset: a,
           size: h.dcCompressedSize
-        }, Oe = new Uint16Array(sr(J).buffer);
+        }, Oe = new Uint16Array(ir(J).buffer);
         a.value += h.dcCompressedSize;
       }
       if (h.rleRawSize > 0) {
-        var k = t.array.slice(a.value, a.value + h.rleCompressedSize), Te = Dt(k), it = Mr(Te.buffer);
+        var k = t.array.slice(a.value, a.value + h.rleCompressedSize), Te = Pt(k), it = Lr(Te.buffer);
         a.value += h.rleCompressedSize;
       }
-      for (var he = 0, B = new Array(_.length), N = 0; N < B.length; ++N)
-        B[N] = new Array();
+      for (var he = 0, D = new Array(_.length), N = 0; N < D.length; ++N)
+        D[N] = new Array();
       for (var K = 0; K < t.lines; ++K)
         for (var W = 0; W < _.length; ++W)
-          B[W].push(he), he += _[W].width * t.type * 2;
-      Qn(z, B, _, H, Oe, u);
+          D[W].push(he), he += _[W].width * t.type * 2;
+      Qn(z, D, _, H, Oe, u);
       for (var N = 0; N < _.length; ++N) {
-        var U = _[N];
-        if (!U.decoded)
-          switch (U.compression) {
+        var m = _[N];
+        if (!m.decoded)
+          switch (m.compression) {
             case 2:
               for (var F = 0, fe = 0, K = 0; K < t.lines; ++K) {
-                for (var De = B[N][F], ae = 0; ae < U.width; ++ae) {
-                  for (var xe = 0; xe < 2 * U.type; ++xe)
-                    u[De++] = it[fe + xe * U.width * U.height];
+                for (var De = D[N][F], ae = 0; ae < m.width; ++ae) {
+                  for (var xe = 0; xe < 2 * m.type; ++xe)
+                    u[De++] = it[fe + xe * m.width * m.height];
                   fe++;
                 }
                 F++;
@@ -1975,7 +1950,7 @@ class lo extends Pi {
       }
       return new DataView(u.buffer);
     }
-    function Rt(t, n) {
+    function Ct(t, n) {
       for (var a = new Uint8Array(t), u = 0; a[n.value + u] != 0; )
         u += 1;
       var h = new TextDecoder().decode(a.slice(n.value, n.value + u));
@@ -2001,7 +1976,7 @@ class lo extends Pi {
       var a = t.getUint32(n.value, !0);
       return n.value = n.value + 4, a;
     }
-    function zr(t, n) {
+    function Dr(t, n) {
       var a = t[n.value];
       return n.value = n.value + 1, a;
     }
@@ -2018,7 +1993,7 @@ class lo extends Pi {
       return n.value += 4, a;
     }
     function ui(t, n) {
-      return Gr.toHalfFloat(j(t, n));
+      return Zr.toHalfFloat(j(t, n));
     }
     function T(t) {
       var n = (t & 31744) >> 10, a = t & 1023;
@@ -2033,7 +2008,7 @@ class lo extends Pi {
     }
     function fi(t, n, a, u) {
       for (var h = a.value, f = []; a.value < h + u - 1; ) {
-        var d = Rt(n, a), p = et(t, a), g = We(t, a);
+        var d = Ct(n, a), p = et(t, a), g = We(t, a);
         a.value += 3;
         var A = et(t, a), S = et(t, a);
         f.push({
@@ -2132,15 +2107,15 @@ class lo extends Pi {
         multiPart: !!(h & 16)
       }, a.value = 8;
       for (var f = !0; f; ) {
-        var d = Rt(n, a);
+        var d = Ct(n, a);
         if (d == 0)
           f = !1;
         else {
-          var p = Rt(n, a), g = ne(t, a), A = gi(t, n, a, p, g);
+          var p = Ct(n, a), g = ne(t, a), A = gi(t, n, a, p, g);
           A === void 0 ? console.warn(`EXRLoader.parse: skipped unknown header attribute type '${p}'.`) : u[d] = A;
         }
       }
-      if (h & -5)
+      if ((h & -5) != 0)
         throw console.error("EXRHeader:", u), "THREE.EXRLoader: provided file is currently unsupported.";
       return u;
     }
@@ -2164,16 +2139,16 @@ class lo extends Pi {
       };
       switch (t.compression) {
         case "NO_COMPRESSION":
-          f.lines = 1, f.uncompress = Dr;
+          f.lines = 1, f.uncompress = Pr;
           break;
         case "RLE_COMPRESSION":
           f.lines = 1, f.uncompress = ii;
           break;
         case "ZIPS_COMPRESSION":
-          f.lines = 1, f.uncompress = sr;
+          f.lines = 1, f.uncompress = ir;
           break;
         case "ZIP_COMPRESSION":
-          f.lines = 16, f.uncompress = sr;
+          f.lines = 16, f.uncompress = ir;
           break;
         case "PIZ_COMPRESSION":
           f.lines = 32, f.uncompress = si;
@@ -2182,10 +2157,10 @@ class lo extends Pi {
           f.lines = 16, f.uncompress = oi;
           break;
         case "DWAA_COMPRESSION":
-          f.lines = 32, f.uncompress = Br;
+          f.lines = 32, f.uncompress = Mr;
           break;
         case "DWAB_COMPRESSION":
-          f.lines = 256, f.uncompress = Br;
+          f.lines = 256, f.uncompress = Mr;
           break;
         default:
           throw "EXRLoader.parse: " + t.compression + " is unsupported";
@@ -2225,13 +2200,13 @@ class lo extends Pi {
           console.error("THREE.EXRLoader: unsupported type: ", h);
           break;
       }
-      return f.bytesPerLine = f.width * f.inputSize * f.channels, f.outputChannels == 4 ? f.format = hn : f.format = vn, at ? f.colorSpace = "srgb-linear" : f.encoding = 3e3, f;
+      return f.bytesPerLine = f.width * f.inputSize * f.channels, f.outputChannels == 4 ? f.format = ln : f.format = hn, at ? f.colorSpace = "srgb-linear" : f.encoding = 3e3, f;
     }
-    const xt = new DataView(e), Ei = new Uint8Array(e), rt = { value: 0 }, nt = Si(xt, e, rt), C = Ti(nt, xt, Ei, rt, this.type), kr = { value: 0 }, Ii = { R: 0, G: 1, B: 2, A: 3, Y: 0 };
+    const Rt = new DataView(e), Ei = new Uint8Array(e), rt = { value: 0 }, nt = Si(Rt, e, rt), C = Ti(nt, Rt, Ei, rt, this.type), Br = { value: 0 }, Ii = { R: 0, G: 1, B: 2, A: 3, Y: 0 };
     for (let t = 0; t < C.height / C.scanlineBlockSize; t++) {
-      const n = ne(xt, rt);
-      C.size = ne(xt, rt), C.lines = n + C.scanlineBlockSize > C.height ? C.height - n : C.scanlineBlockSize;
-      const u = C.size < C.lines * C.bytesPerLine ? C.uncompress(C) : Dr(C);
+      const n = ne(Rt, rt);
+      C.size = ne(Rt, rt), C.lines = n + C.scanlineBlockSize > C.height ? C.height - n : C.scanlineBlockSize;
+      const u = C.size < C.lines * C.bytesPerLine ? C.uncompress(C) : Pr(C);
       rt.value += C.size;
       for (let h = 0; h < C.scanlineBlockSize; h++) {
         const f = h + t * C.scanlineBlockSize;
@@ -2240,9 +2215,9 @@ class lo extends Pi {
         for (let d = 0; d < C.channels; d++) {
           const p = Ii[nt.channels[d].name];
           for (let g = 0; g < C.width; g++) {
-            kr.value = (h * (C.channels * C.width) + d * C.width + g) * C.inputSize;
+            Br.value = (h * (C.channels * C.width) + d * C.width + g) * C.inputSize;
             const A = (C.height - 1 - f) * (C.width * C.outputChannels) + g * C.outputChannels + p;
-            C.byteArray[A] = C.getter(u, kr);
+            C.byteArray[A] = C.getter(u, Br);
           }
         }
       }
@@ -2262,24 +2237,24 @@ class lo extends Pi {
   }
   load(e, i, s, o) {
     function c(l, v) {
-      at ? l.colorSpace = v.colorSpace : l.encoding = v.encoding, l.minFilter = kt, l.magFilter = kt, l.generateMipmaps = !1, l.flipY = !1, i && i(l, v);
+      at ? l.colorSpace = v.colorSpace : l.encoding = v.encoding, l.minFilter = zt, l.magFilter = zt, l.generateMipmaps = !1, l.flipY = !1, i && i(l, v);
     }
     return super.load(e, c, s, o);
   }
 }
-class ia extends Vt {
+class qo extends qt {
   setDepth(e) {
     return this.depth = e, this;
   }
   load(e, i, s, o) {
-    const c = new lo(this.manager);
+    const c = new so(this.manager);
     c.setRequestHeader(this.requestHeader), c.setPath(this.path), c.setWithCredentials(this.withCredentials), c.load(
       e,
       (l) => {
-        const { data: v, width: y, height: E } = l.image, b = this.depth ?? Math.sqrt(E), m = new fn(v, y, E / b, b);
-        m.type = l.type, m.format = l.format, m.colorSpace = l.colorSpace, m.needsUpdate = !0;
+        const { data: v, width: y, height: E } = l.image, b = this.depth ?? Math.sqrt(E), U = new un(v, y, E / b, b);
+        U.type = l.type, U.format = l.format, U.colorSpace = l.colorSpace, U.needsUpdate = !0;
         try {
-          i(m);
+          i(U);
         } catch (q) {
           o != null ? o(q) : console.error(q), this.manager.itemError(e);
         }
@@ -2289,7 +2264,7 @@ class ia extends Vt {
     );
   }
 }
-const vr = 1e-6, Bt = /* @__PURE__ */ new Re(), zt = /* @__PURE__ */ new Re(), Ue = /* @__PURE__ */ new Re(), ct = /* @__PURE__ */ new Re(), yr = /* @__PURE__ */ new Re(), uo = /* @__PURE__ */ new Re(), ho = /* @__PURE__ */ new Di(), fo = /* @__PURE__ */ new Mi(), vo = /* @__PURE__ */ new Bi();
+const fr = 1e-6, Mt = /* @__PURE__ */ new Re(), Dt = /* @__PURE__ */ new Re(), me = /* @__PURE__ */ new Re(), ct = /* @__PURE__ */ new Re(), vr = /* @__PURE__ */ new Re(), oo = /* @__PURE__ */ new Re(), ao = /* @__PURE__ */ new Di(), co = /* @__PURE__ */ new Mi(), lo = /* @__PURE__ */ new Bi();
 class Xn {
   constructor(e = 0, i = 0, s = 0, o = 0) {
     this.distance = e, this.heading = i, this.pitch = s, this.roll = o;
@@ -2298,13 +2273,13 @@ class Xn {
     return this._distance;
   }
   set distance(e) {
-    this._distance = Math.max(e, vr);
+    this._distance = Math.max(e, fr);
   }
   get pitch() {
     return this._pitch;
   }
   set pitch(e) {
-    this._pitch = Je(e, -Math.PI / 2 + vr, Math.PI / 2 - vr);
+    this._pitch = Je(e, -Math.PI / 2 + fr, Math.PI / 2 - fr);
   }
   set(e, i, s, o) {
     return this.distance = e, this.heading = i, this.pitch = s, o != null && (this.roll = o), this;
@@ -2318,40 +2293,40 @@ class Xn {
   equals(e) {
     return e.distance === this.distance && e.heading === this.heading && e.pitch === this.pitch && e.roll === this.roll;
   }
-  decompose(e, i, s, o, c = Xr.WGS84) {
+  decompose(e, i, s, o, c = Gr.WGS84) {
     c.getEastNorthUpVectors(
       e,
-      Bt,
-      zt,
-      Ue
-    ), o == null || o.copy(Ue);
-    const l = ct.copy(Bt).multiplyScalar(Math.cos(this.heading)).add(
-      yr.copy(zt).multiplyScalar(Math.sin(this.heading))
-    ).multiplyScalar(Math.cos(this.pitch)).add(yr.copy(Ue).multiplyScalar(Math.sin(this.pitch))).normalize().multiplyScalar(this.distance);
+      Mt,
+      Dt,
+      me
+    ), o == null || o.copy(me);
+    const l = ct.copy(Mt).multiplyScalar(Math.cos(this.heading)).add(
+      vr.copy(Dt).multiplyScalar(Math.sin(this.heading))
+    ).multiplyScalar(Math.cos(this.pitch)).add(vr.copy(me).multiplyScalar(Math.sin(this.pitch))).normalize().multiplyScalar(this.distance);
     if (i.copy(e).sub(l), this.roll !== 0) {
       const v = ct.copy(e).sub(i).normalize();
-      Ue.applyQuaternion(
-        fo.setFromAxisAngle(v, this.roll)
+      me.applyQuaternion(
+        co.setFromAxisAngle(v, this.roll)
       );
     }
     s.setFromRotationMatrix(
-      ho.lookAt(i, e, Ue)
+      ao.lookAt(i, e, me)
     );
   }
-  setFromCamera(e, i = Xr.WGS84) {
-    const s = ct.setFromMatrixPosition(e.matrixWorld), o = yr.set(0, 0, 0.5).unproject(e).sub(s).normalize(), c = i.getIntersection(vo.set(s, o));
+  setFromCamera(e, i = Gr.WGS84) {
+    const s = ct.setFromMatrixPosition(e.matrixWorld), o = vr.set(0, 0, 0.5).unproject(e).sub(s).normalize(), c = i.getIntersection(lo.set(s, o));
     if (c == null)
       return;
     this.distance = s.distanceTo(c), i.getEastNorthUpVectors(
       c,
-      Bt,
-      zt,
-      Ue
+      Mt,
+      Dt,
+      me
     ), this.heading = Math.atan2(
-      zt.dot(o),
-      Bt.dot(o)
-    ), this.pitch = Math.asin(Ue.dot(o));
-    const l = ct.copy(e.up).applyQuaternion(e.quaternion), v = uo.copy(o).multiplyScalar(-l.dot(o)).add(l).normalize(), y = ct.copy(o).multiplyScalar(-Ue.dot(o)).add(Ue).normalize(), E = y.dot(v), b = o.dot(y.cross(v));
+      Dt.dot(o),
+      Mt.dot(o)
+    ), this.pitch = Math.asin(me.dot(o));
+    const l = ct.copy(e.up).applyQuaternion(e.quaternion), v = oo.copy(o).multiplyScalar(-l.dot(o)).add(l).normalize(), y = ct.copy(o).multiplyScalar(-me.dot(o)).add(me).normalize(), E = y.dot(v), b = o.dot(y.cross(v));
     return this.roll = Math.atan2(b, E), this;
   }
 }
@@ -2400,26 +2375,45 @@ dt.MAX = /* @__PURE__ */ new dt(
   st.MAX_LONGITUDE,
   st.MAX_LATITUDE
 );
-let qt = dt;
-const yo = /^[ \t]*#include +"([\w\d./]+)"/gm;
-function po(r, e) {
-  return r.replace(yo, (i, s) => {
+let Yt = dt;
+const uo = /^[ \t]*#include +"([\w\d./]+)"/gm;
+function ho(r, e) {
+  return r.replace(uo, (i, s) => {
     const c = s.split("/").reduce(
       (l, v) => typeof l != "string" && l != null ? l[v] : void 0,
       e
     );
     if (typeof c != "string")
       throw new Error(`Could not find include for ${s}.`);
-    return po(c, e);
+    return ho(c, e);
   });
 }
-const sa = Bn(ks, {
-  format: vn,
-  minFilter: Wr,
-  magFilter: Wr,
-  wrapS: or,
-  wrapT: or,
-  wrapR: or,
+let Bt;
+function fo() {
+  if (Bt != null)
+    return Bt;
+  const r = new Uint32Array([268435456]);
+  return Bt = new Uint8Array(r.buffer, r.byteOffset, r.byteLength)[0] === 0, Bt;
+}
+function ke(r, e, i, s = !0) {
+  if (s === fo())
+    return new e(r);
+  const o = Object.assign(new DataView(r), {
+    getFloat16(l, v) {
+      return zs(this, l, v);
+    }
+  }), c = new e(o.byteLength / e.BYTES_PER_ELEMENT);
+  for (let l = 0, v = 0; l < c.length; ++l, v += e.BYTES_PER_ELEMENT)
+    c[l] = o[i](v, s);
+  return c;
+}
+const vo = (r) => new Uint8Array(r), Vo = (r) => new Int8Array(r), Jo = (r, e) => ke(r, Uint16Array, "getUint16", e), $o = (r, e) => ke(r, Int16Array, "getInt16", e), Qo = (r, e) => ke(r, Int32Array, "getInt32", e), jo = (r, e) => ke(r, Uint32Array, "getUint32", e), Ko = (r, e) => ke(r, B, "getFloat16", e), ea = (r, e) => ke(r, Float32Array, "getFloat32", e), ta = (r, e) => ke(r, Float64Array, "getFloat64", e), ra = Bn(vo, {
+  format: hn,
+  minFilter: Hr,
+  magFilter: Hr,
+  wrapS: sr,
+  wrapT: sr,
+  wrapR: sr,
   width: Zi,
   height: Hi,
   depth: Gi
@@ -2434,12 +2428,12 @@ function* Yn(r, e, i, s, o) {
     [y + 1, E + 1, l]
   ];
   if (l < s)
-    for (const m of b)
-      for (const q of Yn(...m, s, o))
+    for (const U of b)
+      for (const q of Yn(...U, s, o))
         yield q;
   else
-    for (const m of b)
-      yield (o ?? new wt()).set(...m);
+    for (const U of b)
+      yield (o ?? new wt()).set(...U);
 }
 class wt {
   constructor(e = 0, i = 0, s = 0) {
@@ -2476,9 +2470,9 @@ class wt {
     yield this.x, yield this.y, yield this.z;
   }
 }
-const un = /* @__PURE__ */ new yn();
+const cn = /* @__PURE__ */ new fn();
 class qn {
-  constructor(e = 2, i = 1, s = qt.MAX) {
+  constructor(e = 2, i = 1, s = Yt.MAX) {
     this.width = e, this.height = i, this.rectangle = s;
   }
   clone() {
@@ -2487,98 +2481,94 @@ class qn {
   copy(e) {
     return this.width = e.width, this.height = e.height, this.rectangle.copy(e.rectangle), this;
   }
-  getSize(e, i = new yn()) {
+  getSize(e, i = new fn()) {
     return i.set(this.width << e, this.height << e);
   }
   // Reference: https://github.com/CesiumGS/cesium/blob/1.122/packages/engine/Source/Core/GeographicTilingScheme.js#L210
   getTile(e, i, s = new wt()) {
-    const o = this.getSize(i, un), { rectangle: c } = this, l = c.width / o.x, v = c.height / o.y, { west: y, south: E, east: b } = c;
-    let m = e.longitude;
-    b < y && (m += Math.PI * 2);
-    let q = Math.floor((m - y) / l);
+    const o = this.getSize(i, cn), { rectangle: c } = this, l = c.width / o.x, v = c.height / o.y, { west: y, south: E, east: b } = c;
+    let U = e.longitude;
+    b < y && (U += Math.PI * 2);
+    let q = Math.floor((U - y) / l);
     q >= o.x && (q = o.x - 1);
     let se = Math.floor((e.latitude - E) / v);
     return se >= o.y && (se = o.y - 1), s.x = q, s.y = se, s.z = i, s;
   }
   // Reference: https://github.com/CesiumGS/cesium/blob/1.122/packages/engine/Source/Core/GeographicTilingScheme.js#L169
-  getRectangle(e, i = new qt()) {
-    const s = this.getSize(e.z, un), { rectangle: o } = this, c = o.width / s.x, l = o.height / s.y, { west: v, north: y } = o;
+  getRectangle(e, i = new Yt()) {
+    const s = this.getSize(e.z, cn), { rectangle: o } = this, c = o.width / s.x, l = o.height / s.y, { west: v, north: y } = o;
     return i.west = e.x * c + v, i.east = (e.x + 1) * c + v, i.north = y - (s.y - e.y - 1) * l, i.south = y - (s.y - e.y) * l, i;
   }
 }
-const wo = /#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 Ao(r, e, i, s) {
+const yo = /#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 po(r, e, i, s) {
   let o = "";
   for (let c = parseInt(e); c < parseInt(i); ++c)
     o += s.replace(/\[\s*i\s*\]/g, "[" + c + "]").replace(/UNROLLED_LOOP_INDEX/g, `${c}`);
   return o;
 }
-function oa(r) {
-  return r.replace(wo, Ao);
+function na(r) {
+  return r.replace(yo, po);
 }
 export {
   ki as ArrayBufferLoader,
-  _o as DEFAULT_STBN_URL,
-  qs as DataLoader,
-  ia as EXR3DLoader,
-  Xr as Ellipsoid,
-  la as EllipsoidGeometry,
-  P as Float16Array,
-  Po as Float32ArrayLoader,
+  Eo as DEFAULT_STBN_URL,
+  Gs as DataLoader,
+  qo as EXR3DLoader,
+  Gr as Ellipsoid,
+  oa as EllipsoidGeometry,
+  B as Float16Array,
   st as Geodetic,
-  Fo as Int16ArrayLoader,
   Xn as PointOfView,
-  qt as Rectangle,
-  sa as STBNLoader,
+  Yt as Rectangle,
+  ra as STBNLoader,
   Gi as STBN_TEXTURE_DEPTH,
   Hi as STBN_TEXTURE_HEIGHT,
   Zi as STBN_TEXTURE_WIDTH,
   wt as TileCoordinate,
   qn as TilingScheme,
-  Ws as TypedArrayLoader,
-  Lo as Uint16ArrayLoader,
-  To as assertType,
-  Wo as ceilPowerOfTwo,
+  ks as TypedArrayLoader,
+  go as assertType,
+  Fo as ceilPowerOfTwo,
   Je as clamp,
-  Qo as closeTo,
-  Mo as createData3DTextureLoader,
+  ko as closeTo,
+  bo as createData3DTextureLoader,
   Bn as createData3DTextureLoaderClass,
-  Do as createDataTextureLoader,
-  Vs as createDataTextureLoaderClass,
-  xo as createTypedArrayLoader,
-  St as createTypedArrayLoaderClass,
-  jo as define,
-  ta as defineExpression,
-  ea as defineFloat,
-  Ko as defineInt,
-  ra as definePropertyShorthand,
-  na as defineUniformShorthand,
-  Ho as degrees,
-  Bo as euclideanModulo,
-  Xo as floorPowerOfTwo,
-  Io as fromBufferGeometryLike,
-  bo as getTypedArrayElementType,
-  zo as inverseLerp,
-  Go as isPowerOfTwo,
-  No as isTypedArray,
-  ko as lerp,
-  Yo as normalize,
-  Co as parseFloat16Array,
-  Gs as parseFloat32Array,
-  Ro as parseFloat64Array,
-  Hs as parseInt16Array,
-  Uo as parseInt32Array,
-  Oo as parseInt8Array,
-  Zs as parseUint16Array,
-  mo as parseUint32Array,
-  ks as parseUint8Array,
-  Zo as radians,
-  qo as remap,
-  Vo as remapClamped,
-  po as resolveIncludes,
-  $o as saturate,
-  Jo as smoothstep,
-  Eo as toBufferGeometryLike,
-  oa as unrollLoops
+  No as createDataTextureLoader,
+  Ws as createDataTextureLoaderClass,
+  _o as createTypedArrayLoader,
+  Mn as createTypedArrayLoaderClass,
+  Zo as define,
+  Wo as defineExpression,
+  Go as defineFloat,
+  Ho as defineInt,
+  Xo as definePropertyShorthand,
+  Yo as defineUniformShorthand,
+  Ro as degrees,
+  Oo as euclideanModulo,
+  Lo as floorPowerOfTwo,
+  To as fromBufferGeometryLike,
+  mo as inverseLerp,
+  xo as isPowerOfTwo,
+  Io as isTypedArray,
+  Uo as lerp,
+  Po as normalize,
+  Ko as parseFloat16Array,
+  ea as parseFloat32Array,
+  ta as parseFloat64Array,
+  $o as parseInt16Array,
+  Qo as parseInt32Array,
+  Vo as parseInt8Array,
+  Jo as parseUint16Array,
+  jo as parseUint32Array,
+  vo as parseUint8Array,
+  Co as radians,
+  Mo as remap,
+  Do as remapClamped,
+  ho as resolveIncludes,
+  zo as saturate,
+  Bo as smoothstep,
+  So as toBufferGeometryLike,
+  na as unrollLoops
 };
 //# sourceMappingURL=index.js.map