@equinor/videx-3d 1.1.1 → 3.0.0

package/dist/sdk.js

@@ -1,785 +1,2 @@
-import { wrap as Y } from "comlink";
-import R from "p-limit";
-import { d as K } from "./chunk-iY0wQ9Z6.js";
-import { x as xt, D as bt, P as vt, b as Mt, a as Ct, c as Et, T as Bt, y as At, z as zt, A as Ft, B as It, p as St, E as Lt, F as Vt, G as Tt, H as Pt, I as Dt, J as Gt, K as qt, L as jt, M as kt, e as Nt, N as Ot, o as Qt, O as Ut, Q as Wt, R as Ht, i as Zt, S as $t, U as Jt, V as Kt, X as Xt, g as Yt, Y as Rt, Z as te, _ as ee, $ as se, h as ie, m as ne, a0 as re, a1 as ae, a2 as oe, n as le, a3 as he, f as ce, a4 as fe, a5 as ue, a6 as de, a7 as ge, a8 as me, a9 as pe, aa as ye, ab as _e, ac as we, ad as xe, ae as be, af as ve, ag as Me, s as Ce, ah as Ee, ai as Be, aj as Ae, u as ze, ak as Fe } from "./chunk-iY0wQ9Z6.js";
-import { C as Se, T as Le, c as Ve, b as Te, a as Pe, d as De, e as Ge, g as qe, f as je, t as ke, h as Ne, w as Oe } from "./chunk-CnY6Tmof.js";
-import { D as Ue, c as We, a as He, b as Ze, d as $e, m as Je, t as Ke, e as Xe, f as Ye } from "./chunk-BlPg4RjP.js";
-import { Vector2 as N, Shape as tt, Path as et } from "three";
-const st = 10, it = 25;
-class lt {
-  store;
-  config;
-  cached = /* @__PURE__ */ new Map();
-  _activeLoaders = {};
-  _batchqueue = /* @__PURE__ */ new Map();
-  _flushScheduled = null;
-  constructor(t, e = {}) {
-    this.store = t, this.config = { ...e }, this.config.batched && (this.config.batchSize === void 0 && (this.config.batchSize = st), this.config.batchMaxDelay === void 0 && (this.config.batchMaxDelay = it)), this._flushScheduled = null;
-  }
-  async init(...t) {
-    if (this.config.init)
-      try {
-        const e = await this.config.init(...t);
-        if (Array.isArray(e))
-          return this.cached = new Map(e), !0;
-      } catch (e) {
-        console.warn("Init failed", e);
-      }
-    return this.clear(), !1;
-  }
-  async all() {
-    if (this.config.preloaded) {
-      if (this.config.transform) {
-        const t = this.config.transform;
-        return Array.from(this.cached.values()).map((e) => t(e));
-      }
-      return Array.from(this.cached.values());
-    } else
-      console.warn('Data Loader: "all" called on non-preloaded dataset!');
-    return [];
-  }
-  async _enqueueRequest(t) {
-    if (this._batchqueue.has(t))
-      return this._batchqueue.get(t).promise;
-    let e = null;
-    const s = new Promise((r) => {
-      e = r;
-    }), i = {
-      key: t,
-      promise: s,
-      _resolve: e
-    };
-    return this._batchqueue.set(t, i), this._flushScheduled || (this._flushScheduled = setTimeout(() => {
-      this._processBatchQueue();
-    }, this.config.batchMaxDelay)), s;
-  }
-  async _processBatch(t) {
-    const e = t.map((s) => s.key);
-    if (!this.config.batchLoad) return null;
-    this.config.batchLoad(e).then((s) => {
-      Array.isArray(s) && s.forEach(([i, r]) => {
-        this.set(i, r);
-      });
-    }).catch((s) => {
-      console.warn("Batch load failed", s);
-    }).finally(() => {
-      t.forEach((s) => {
-        const i = this.cached.get(s.key) || null;
-        s._resolve(i);
-      });
-    });
-  }
-  async _processBatchQueue() {
-    let t = [];
-    for (const e of this._batchqueue.values())
-      t.push(e), this._batchqueue.delete(e.key), (t.length >= this.config.batchSize || this._batchqueue.size === 0) && (this._processBatch(t), t = []);
-    this._batchqueue.size ? this._flushScheduled = setTimeout(() => this._processBatchQueue(), 1) : this._flushScheduled = null;
-  }
-  async get(t, e) {
-    if (this.cached.has(t))
-      return this.config.transform ? this.config.transform(this.cached.get(t)) : this.cached.get(t);
-    if (this.config.preloaded) return null;
-    if (!this.config.batched && this.config.load) {
-      if (this.config.noCache)
-        return this.config.load(t, e);
-      let s = this._activeLoaders[t];
-      if (!s) {
-        if (e)
-          throw Error(
-            "DataLoader: A load function with additional args may not be cached. Set noCache to true in config."
-          );
-        s = this.config.load(t).then((i) => {
-          i && this.cached.set(t, i);
-        }).catch((i) => {
-          console.warn("Load failed", i);
-        }).finally(() => {
-          delete this._activeLoaders[t];
-        }), this._activeLoaders[t] = s;
-      }
-      return await s, this.config.transform ? this.config.transform(this.cached.get(t)) : this.cached.get(t);
-    }
-    return this.config.batched && this.config.batchLoad ? this._enqueueRequest(t) : null;
-  }
-  set(t, e) {
-    this.cached.set(t, e);
-  }
-  clear() {
-    this.cached.clear();
-  }
-}
-class ht {
-  store = null;
-  config;
-  generators = /* @__PURE__ */ new Map();
-  constructor(t = {}, e) {
-    this.config = { concurrentStoreCalls: 0, ...t }, e && this.setStore(e);
-  }
-  add(t, e) {
-    this.generators.set(t, e);
-  }
-  setStore(t) {
-    if (t && this.config.concurrentStoreCalls) {
-      const e = R(this.config.concurrentStoreCalls), s = {
-        get: (i, r, n) => e(() => t.get(i, r, n)),
-        all: (i) => e(() => t.all(i)),
-        query: (i, r) => e(() => t.query(i, r))
-      };
-      this.store = s;
-    } else
-      this.store = t;
-  }
-  async connectRemoteStore(t) {
-    const e = Y(t);
-    this.setStore(e);
-  }
-  async invoke(t, ...e) {
-    if (!this.store) throw Error("No available store!");
-    if (!this.generators.has(t))
-      throw Error(`Generator with key '${t}' not found!`);
-    return this.generators.get(t).bind(this.store)(...e);
-  }
-}
-class W {
-  type;
-  coordinates;
-  _min = null;
-  _max = null;
-  _size = null;
-  _offset = [0, 0];
-  constructor(t, e, s) {
-    this.type = t, this.coordinates = e, s && (this._offset[0] = s[0], this._offset[1] = s[1]);
-  }
-  static fromPointCoordinates(t, e) {
-    const s = e ? t.map(e) : t;
-    return new H(s);
-  }
-  static fromLineCoordinates(t, e) {
-    const s = e ? t.map((i) => i.map(e)) : t;
-    return new Z(s);
-  }
-  static fromPolygonCoordinates(t, e) {
-    const s = e ? t.map((i) => i.map((r) => r.map(e))) : t;
-    return new $(s);
-  }
-  _calculateBounds() {
-    const t = [1 / 0, 1 / 0], e = [-1 / 0, -1 / 0], s = (i) => {
-      i[0] < t[0] && (t[0] = i[0]), i[0] > e[0] && (e[0] = i[0]), i[1] < t[1] && (t[1] = i[1]), i[1] > e[1] && (e[1] = i[1]);
-    };
-    this.forEachCoordinate(s), this._min = t, this._max = e, this._size = [e[0] - t[0], e[1] - t[1]];
-  }
-  get min() {
-    return this._min || this._calculateBounds(), [...this._min];
-  }
-  get max() {
-    return this._max || this._calculateBounds(), [...this._max];
-  }
-  get center() {
-    return (!this._min || !this._max || !this._size) && this._calculateBounds(), [
-      this.min[0] + this.size[0] / 2,
-      this.min[1] + this.size[1] / 2
-    ];
-  }
-  get size() {
-    return this._size || this._calculateBounds(), [...this._size];
-  }
-  get offset() {
-    return [...this._offset];
-  }
-  setOffset(t) {
-    this.forEachCoordinate((e) => {
-      e[0] -= t[0], e[1] -= t[1];
-    }), this._min && (this._min[0] -= t[0], this._min[1] -= t[1]), this._max && (this._max[0] -= t[0], this._max[1] -= t[1]), this._offset[0] += t[0], this._offset[1] += t[1];
-  }
-  removeOffset() {
-    (this._offset[0] !== 0 || this._offset[1] !== 0) && (this.forEachCoordinate((t) => {
-      t[0] += this._offset[0], t[1] += this._offset[1];
-    }), this._min = null, this._max = null, this._size = null, this._offset = [0, 0]);
-  }
-  centralize() {
-    this.setOffset(this.center);
-  }
-  normalize(t = [1, 1], e = [0, 0]) {
-    this.centralize();
-    const s = this.getBounds();
-    this.forEachCoordinate((i) => {
-      i[0] = K((i[0] - s.min[0]) / s.size[0]) * t[0] + e[0], i[1] = K((i[1] - s.min[1]) / s.size[1]) * t[1] + e[1];
-    });
-  }
-  transform(t) {
-    (this._offset[0] !== 0 || this._offset[1] !== 0) && this.removeOffset(), this.forEachCoordinate((e) => {
-      const s = t(e);
-      e[0] = s[0], e[1] = s[1];
-    }), this._min = null, this._max = null, this._size = null;
-  }
-  toObject() {
-    return {
-      type: this.type.toString(),
-      coordinates: structuredClone(this.coordinates),
-      offset: this.offset
-    };
-  }
-  getPointsFlattened() {
-    const t = [];
-    return this.forEachCoordinate((e) => {
-      t.push(new N(e[0], e[1]));
-    }), t;
-  }
-  getBounds() {
-    return {
-      min: this.min,
-      max: this.max,
-      size: this.size
-    };
-  }
-}
-class H extends W {
-  constructor(t, e) {
-    super("point2d", t, e);
-  }
-  forEachCoordinate(t) {
-    this.coordinates.forEach((s) => t(s));
-  }
-  getPoints() {
-    return this.coordinates.map((e) => [new N(e[0], e[1])]);
-  }
-  clone() {
-    return new H(
-      structuredClone(this.coordinates),
-      this.offset
-    );
-  }
-}
-class Z extends W {
-  constructor(t, e) {
-    super("line2d", t, e);
-  }
-  forEachCoordinate(t) {
-    this.coordinates.forEach((s) => s.forEach((i) => t(i)));
-  }
-  getPoints() {
-    return this.coordinates.map((e) => e.map((s) => new N(s[0], s[1])));
-  }
-  clone() {
-    return new Z(
-      structuredClone(this.coordinates),
-      this.offset
-    );
-  }
-}
-class $ extends W {
-  constructor(t, e) {
-    super("polygon2d", t, e);
-  }
-  forEachCoordinate(t) {
-    this.coordinates.forEach((s) => s.forEach((i) => i.forEach((r) => t(r))));
-  }
-  getPoints() {
-    return this.coordinates.map(
-      (e) => e.reduce(
-        (s, i) => s.concat(i.map((r) => new N(r[0], r[1]))),
-        []
-      )
-    );
-  }
-  clone() {
-    return new $(
-      structuredClone(this.coordinates),
-      this._offset
-    );
-  }
-  toShapes() {
-    const t = [], e = (i, r) => {
-      i.moveTo(r[0][0], r[0][1]);
-      for (let n = 1; n < r.length; n++)
-        i.lineTo(r[n][0], r[n][1]);
-      i.closePath();
-    };
-    return this.coordinates.forEach((i) => {
-      const r = new tt(), n = i[0];
-      e(r, n);
-      for (let a = 1; a < i.length; a++) {
-        const c = new et();
-        e(c, i[a]), r.holes.push(c);
-      }
-      t.push(r);
-    }), t;
-  }
-}
-function ct(u, t, e = 1, s = 1, i = (r) => r) {
-  console.time("triangulate");
-  const r = [], n = [], a = [], c = [], h = u.length / t;
-  let o, l, d, g, b, y, _, v, C, A, x, z, M, E, B, G, f, O, V, T, P, m, w, Q, X = 0, U = 0, J = 0, I = new Array(t).fill(null), q = new Array(t).fill(null);
-  const p = new Array(t - 1).fill(null);
-  function j(F, L, D) {
-    return r.push({ x: F * e, y: D, z: L * s, edge: null }), a.push(F / (t - 1), 1 - L / (h - 1)), X++;
-  }
-  function S(F, L, D) {
-    V = {
-      index: U++,
-      tail: F,
-      head: L,
-      twin: null,
-      prev: null,
-      next: null
-    }, T = {
-      index: U++,
-      tail: L,
-      head: D,
-      twin: null,
-      prev: null,
-      next: null
-    }, P = {
-      index: U++,
-      tail: D,
-      head: F,
-      twin: null,
-      prev: null,
-      next: null
-    }, V.next = T, T.next = P, P.next = V, V.prev = P, T.prev = V, P.prev = T, r[F].edge || (r[F].edge = V), r[L].edge || (r[L].edge = T), r[D].edge || (r[D].edge = P), n.push(V, T, P), c.push(F, L, D);
-  }
-  for (G = 1; G < h - 1; G++) {
-    Q = !1;
-    const F = I;
-    for (I = q, q = F.fill(null), m = null, O = G - 1, J += t, B = 1; B < t - 1; B++)
-      f = B - 1, A = J + B, C = A - 1, v = A - t, _ = v - 1, x = i(u[_]), z = i(u[v]), M = i(u[C]), E = i(u[A]), x !== null && z !== null && M !== null && E !== null ? w = 1 : x !== null && z !== null && M !== null ? w = 2 : x !== null && z !== null && E !== null ? w = 3 : x !== null && M !== null && E !== null ? w = 4 : z !== null && M !== null && E !== null ? w = 5 : w = 0, d = null, g = null, w !== 0 ? (Q ? (o = I[f], d = q[f]) : (w !== 5 && (I[f] === null ? (o = j(f, O, x), I[f] = o) : o = I[f]), w !== 3 && (d = j(f, G, M)), q[f] = d), w !== 4 && (I[B] === null ? (l = j(B, O, z), I[B] = l) : l = I[B]), w !== 2 && (g = j(B, G, E)), w === 1 ? (b = Math.abs(r[o].y - r[g].y), y = Math.abs(r[l].y - r[d].y), b < y ? (S(o, d, g), m !== null && (n[n.length - 3].twin = m, m.twin = n[n.length - 3]), S(g, l, o), p[f] !== null && (n[n.length - 2].twin = p[f], p[f].twin = n[n.length - 2]), n[n.length - 4].twin = n[n.length - 1], n[n.length - 1].twin = n[n.length - 4], p[f] = n[n.length - 5], m = n[n.length - 3]) : (S(o, d, l), p[f] !== null && (n[n.length - 1].twin = p[f], p[f].twin = n[n.length - 1]), m !== null && (n[n.length - 3].twin = m, m.twin = n[n.length - 3]), S(l, d, g), n[n.length - 5].twin = n[n.length - 3], n[n.length - 3].twin = n[n.length - 5], p[f] = n[n.length - 2], m = n[n.length - 1])) : w === 2 ? (S(o, d, l), p[f] !== null && (n[n.length - 1].twin = p[f], p[f].twin = n[n.length - 1]), m !== null && (n[n.length - 3].twin = m, m.twin = n[n.length - 3]), p[f] = null, m = null) : w === 5 ? (S(l, d, g), p[f] = n[n.length - 2], m = n[n.length - 1]) : w === 3 ? (S(l, o, g), p[f] !== null && (n[n.length - 3].twin = p[f], p[f].twin = n[n.length - 3]), p[f] = null, m = n[n.length - 1]) : (S(o, d, g), m !== null && (n[n.length - 3].twin = m, m.twin = n[n.length - 3]), p[f] = n[n.length - 2], m = null)) : (p[f] = null, m = null), q[B] = g, Q = !!w;
-  }
-  return console.timeEnd("triangulate"), console.log(c.length / 3), { vertices: r, indices: c, uvs: a, edges: n };
-}
-const ft = (u) => `#${u.toString(16).padStart(6, "0")}`;
-function ut() {
-  const u = "123456789ABCDEF";
-  let t = "#";
-  for (let e = 0; e < 6; e++)
-    t += u[Math.floor(Math.random() * 16)];
-  return t;
-}
-async function dt(u, t = -1, e = null) {
-  const s = await u.arrayBuffer(), i = new DataView(s), r = {
-    ny: i.getInt32(8, !1),
-    xori: i.getFloat32(12, !1),
-    xmax: i.getFloat32(16, !1),
-    yori: i.getFloat32(20, !1),
-    ymax: i.getFloat32(24, !1),
-    xinc: i.getFloat32(28, !1),
-    yinc: i.getFloat32(32, !1),
-    nx: i.getInt32(44, !1),
-    rot: i.getFloat32(48, !1)
-  }, n = 1e30, a = 1e-30, c = new Float32Array(r.nx * r.ny);
-  let h, o, l, d, g, b = 0, y = 100;
-  for (; y < i.byteLength; ) {
-    o = i.getInt32(y), y += 4;
-    for (let _ = 0; _ < o; _ += 4)
-      h = i.getFloat32(y + _, !1), l = b % r.nx, d = r.ny - Math.floor(b / r.nx), g = (d - 1) * r.nx + l, c[g] = h < a || h > n ? t : e ? e - h : h, b++;
-    y += o + 4;
-  }
-  return { header: r, data: c };
-}
-function gt(u) {
-  return u.map((t) => -t);
-}
-function mt(u, t) {
-  return u.map((e) => e * t);
-}
-function pt(u, t, e) {
-  const s = (i) => {
-    if (i.userData[u] && i.userData[u] === t)
-      return i;
-    if (i.children && i.children.length)
-      for (let r = 0; r < i.children.length; r++) {
-        const n = s(i.children[r]);
-        if (n)
-          return n;
-      }
-    return null;
-  };
-  return s(e);
-}
-class k {
-  data;
-  columns;
-  rows;
-  stride;
-  _rowLength;
-  _lerpFn = [];
-  arrayConstructor;
-  constructor(t, e, s = 1) {
-    this.data = t, this.columns = e, this.stride = s, this._rowLength = e * s, this.rows = this.data.length / this._rowLength, this.arrayConstructor = (i) => new this.data.constructor(
-      i
-    );
-  }
-  static readWriteBlock(t, e, s, i, r, n, a, c, h, o, l = null) {
-    if (!(t instanceof k && n instanceof k))
-      throw Error("Source and target must be of type Typed2dArray");
-    if (a < 0 || a + h > n.columns || c < 0 || c + o > n.rows)
-      throw Error("Invalid target block dimensions!");
-    if (e < 0 || e + i > t.columns || s < 0 || s + r > t.rows)
-      throw Error("Invalid source block dimensions!");
-    const d = Math.max(1, h - 1), g = Math.max(1, o - 1), b = Math.max(1, i - 1), y = Math.max(1, r - 1);
-    for (let _ = 0; _ < o; _++) {
-      const v = n.index(0, _ + c), C = _ / g * y + s;
-      for (let A = 0; A < h; A++) {
-        const x = v + (A + a) * n.stride, z = A / d * b + e;
-        let M = t.valueAt(z, C);
-        if (l && (M = l(M)), n.stride === 1)
-          n.data[x] = M;
-        else if (Array.isArray(M))
-          for (let E = 0; E < M.length; E++)
-            n.data[x + E] = M[E];
-      }
-    }
-    return this;
-  }
-  // built-in interpolation methods
-  static logInterp(t, e, s, i, r, n) {
-    const a = (e * e - t * t) * r + t * t, c = (i * i - s * s) * r + s * s;
-    return Math.sqrt((c - a) * n + a);
-  }
-  static linearInterp(t, e, s, i, r, n) {
-    const a = (e - t) * r + t;
-    return ((i - s) * r + s - a) * n + a;
-  }
-  static nearestInterp(t, e, s, i, r, n) {
-    const a = r <= 0.5 ? t : e, c = r <= 0.5 ? s : i;
-    return n <= 0.5 ? a : c;
-  }
-  // // create a new Typed2DArray instance using an existing data array
-  // static from<ArrayType>(source: ArrayType, columns: number, stride = 1, copyData = false) {
-  //   const data = source instanceof Typed2DArray ? source.data : source;
-  //   const array = new Typed2DArray(data.constructor, columns,  data.length / (columns * stride), stride, false);
-  //   array.data = copyData ? new array.type(data) : data;
-  //   if (source instanceof Typed2DArray) {
-  //     array.setInterpolator(...source._lerpFn);
-  //   }
-  //   return array;
-  // }
-  // alias for columns
-  get width() {
-    return this.columns;
-  }
-  // alias for rows
-  get height() {
-    return this.rows;
-  }
-  // get the array index to the first component from the provided column and row indices
-  index(t, e) {
-    if (t < 0 || e < 0 || t >= this.columns || e >= this.rows)
-      throw Error("Index out of bounds!");
-    return e * this._rowLength + t * this.stride;
-  }
-  // get the column and row at the beginning of the item according to stride from an index into the data array
-  positionOf(t) {
-    if (t < 0 || t > this.data.length) return;
-    const e = t % this.stride, s = Math.floor((t - e) / this._rowLength), i = Math.floor((t - s * this._rowLength) / this.stride);
-    return { row: s, col: i };
-  }
-  // allow you to set a custom interpolation function per component, which are used when interpolating values
-  setInterpolator(...t) {
-    return this._lerpFn = t, this;
-  }
-  // get the configured interpolation function for the given component index
-  getInterpolator(t) {
-    return this._lerpFn.length > 0 ? this._lerpFn[Math.min(t, this._lerpFn.length - 1)] : k.linearInterp;
-  }
-  // convenience function for reading an entire column
-  col(t, e) {
-    return this.readBlock(
-      Math.floor(t),
-      0,
-      1,
-      this.rows,
-      void 0,
-      void 0,
-      e
-    );
-  }
-  // convenience function for reading an entire row
-  row(t, e) {
-    const s = this.index(0, Math.floor(t));
-    if (e) {
-      for (let i = 0; i < this._rowLength; i++)
-        e[i] = this.data[s + i];
-      return e;
-    }
-    return this.data.subarray(s, s + this._rowLength);
-  }
-  // set a single value into the provided column and row
-  setValue(t, e, ...s) {
-    const i = this.index(t, e);
-    for (let r = 0; r < Math.min(s.length, this.stride); r++)
-      this.data[i + r] = s[r];
-    return this;
-  }
-  // read all the values within the provided block dimension
-  readBlock(t, e, s, i, r, n, a) {
-    if (t < 0 || t + s > this.columns || e < 0 || e + i > this.rows)
-      throw Error("Invalid block dimensions!");
-    r = Number.isFinite(r) ? r : s, n = Number.isFinite(n) ? n : i, a = a || this.arrayConstructor(r * n * this.stride);
-    const c = Math.max(1, r - 1), h = Math.max(1, n - 1), o = Math.max(1, s - 1), l = Math.max(1, i - 1);
-    let d = 0;
-    for (let g = 0; g < n; g++) {
-      const b = g / h * l + e;
-      for (let y = 0; y < r; y++) {
-        const _ = y / c * o + t, v = this.valueAt(_, b);
-        if (this.stride === 1)
-          a[d++] = v;
-        else if (Array.isArray(v))
-          for (let C = 0; C < v.length; C++)
-            a[d++] = v[C];
-      }
-    }
-    return a;
-  }
-  // upscale grid using the current interpolation method
-  upscale(t, e) {
-    if (t < this.columns || e < this.rows)
-      throw Error(
-        "New column and row size must be equal or bigger than the current sizes!"
-      );
-    const s = this.readBlock(
-      0,
-      0,
-      this.columns,
-      this.rows,
-      t,
-      e
-    );
-    return this.columns = t, this.rows = e, this._rowLength = t * this.stride, this.data = s, this;
-  }
-  // write values into a given block dimension
-  writeBlock(t, e, s, i, r) {
-    if (r.length !== s * i * this.stride)
-      throw Error("Incorrect number of values");
-    if (t < 0 || t + s > this.columns || e < 0 || e + i > this.rows)
-      throw Error("Invalid block dimensions!");
-    let n = 0;
-    for (let a = e; a < e + i; a++) {
-      const c = this.index(t, a);
-      for (let h = 0; h < s; h++) {
-        const o = c + h * this.stride;
-        for (let l = 0; l < this.stride; l++)
-          this.data[o + l] = r[n++];
-      }
-    }
-    return this;
-  }
-  // fills the block with a single value
-  fillBlock(t, e, s, i, r) {
-    if (t < 0 || t + s > this.columns || e < 0 || e + i > this.rows)
-      throw Error("Invalid block dimensions!");
-    let n = (a, c, h) => {
-      this.data[h] = r;
-    };
-    typeof r == "function" ? n = (a, c, h) => {
-      const o = r(a, c, h);
-      if (Array.isArray(o) && o.length && o.length > 0)
-        for (let l = 0; l < Math.min(o.length, this.stride); l++)
-          this.data[h + l] = o[l];
-      else
-        this.data[h] = o;
-    } : this.stride > 1 && Array.isArray(r) && (n = (a, c, h) => {
-      for (let o = 0; o < Math.min(r.length, this.stride); o++)
-        this.data[h + o] = r[o];
-    });
-    for (let a = e; a < e + i; a++) {
-      const c = this.index(t, a);
-      for (let h = 0; h < s; h++) {
-        const o = c + h * this.stride;
-        n(h, a, o);
-      }
-    }
-    return this;
-  }
-  // get the value corresponding to the specified index according to stride
-  valueOf(t, e) {
-    const { stride: s, data: i } = this;
-    if (s > 1) {
-      t = t % s, e = e || this.arrayConstructor(s);
-      for (let r = 0; r < s; r++)
-        e[r] = i[t + r];
-      return e;
-    }
-    return i[t];
-  }
-  // get the calue at the requested column and row, which may be given as fractions, which in case
-  // bilinear filtering will be applied to interpolate values (for each component) in between columns and rows
-  valueAt(t, e, s) {
-    const { columns: i, rows: r, stride: n, data: a } = this, c = t % 1, h = e % 1;
-    if (c > 0 || h > 0) {
-      const l = (t < 0 ? 0 : t >= i ? i - 1 : t) | 0, d = (e < 0 ? 0 : e >= r ? r - 1 : e) | 0, g = l === i - 1 ? l : l + 1, b = d === r - 1 ? d : d + 1;
-      let y = this.index(l, d), _ = this.index(g, d), v = this.index(l, b), C = this.index(g, b);
-      if (n > 1) {
-        s = s || this.arrayConstructor(n);
-        for (let x = 0; x < n; x++) {
-          const z = this.getInterpolator(x);
-          s[x] = z(a[y++], a[_++], a[v++], a[C++], c, h);
-        }
-        return s;
-      }
-      return this.getInterpolator(0)(a[y], a[_], a[v], a[C], c, h);
-    }
-    const o = this.index(t, e);
-    if (n > 1) {
-      s = s || this.arrayConstructor(n);
-      for (let l = 0; l < n; l++)
-        s[l] = a[o + l];
-      return s;
-    }
-    return a[o];
-  }
-  // swap all values from one row with all values from another row
-  swapRows(t, e, s) {
-    s = s || this.arrayConstructor(this._rowLength), this.row(t, s);
-    const i = this.index(0, t), r = this.index(0, e);
-    for (let n = 0; n < this._rowLength; n++)
-      this.data[i + n] = this.data[r + n], this.data[r + n] = s[n];
-    return this;
-  }
-  // invert all rows (top-bottom to bottom-top)
-  invertRows() {
-    const t = Math.floor(this.rows / 2), e = this.arrayConstructor(this._rowLength);
-    for (let s = this.rows - 1, i = 0; s > t; s--, i++)
-      this.swapRows(s, i, e);
-    return this;
-  }
-  copyInto(t, e = 0, s = 0, i = this.columns - e, r = this.rows - s) {
-    if (t.length !== i * r * this.stride)
-      throw Error("Target is not of the correct size!");
-    let n = 0;
-    for (let a = s; a < s + r; a++) {
-      const c = this.index(0, a);
-      for (let h = e; h < e + i; h++) {
-        const o = c + h * this.stride;
-        for (let l = 0; l < this.stride; l++)
-          t[n++] = this.data[o + l];
-      }
-    }
-    return this;
-  }
-  // return a multi-dimensional javascript array of the data (main purpose for debugging)
-  toJsArray() {
-    const t = new Array(this.rows);
-    for (let e = 0; e < this.rows; e++) {
-      const s = this.index(0, e);
-      t[e] = new Array(this.columns);
-      for (let i = 0; i < this.columns; i++)
-        if (this.stride > 1) {
-          t[e][i] = new Array(this.stride);
-          for (let r = 0; r < this.stride; r++)
-            t[e][i][r] = this.data[s + i * this.stride + r];
-        } else
-          t[e][i] = this.data[s + i * this.stride];
-    }
-    return t;
-  }
-}
-function yt(u) {
-  const t = new Float32Array(u.length * 3);
-  for (let e = 0; e < u.length; e++) {
-    const s = e * 3;
-    t[s + 0] = u[e][0], t[s + 1] = u[e][1], t[s + 2] = u[e][2];
-  }
-  return t;
-}
-export {
-  Se as CRS,
-  xt as CameraManager,
-  lt as DataLoader,
-  Ue as Delatin,
-  bt as DepthReadMaterial,
-  ht as GeneratorRegistry,
-  vt as PI,
-  Mt as PI2,
-  Ct as PI4,
-  Et as PI8,
-  W as PlanarGeometry,
-  Z as PlanarLineGeometry,
-  H as PlanarPointGeometry,
-  $ as PlanarPolygonGeometry,
-  Bt as TAU,
-  Le as TubeMaterial,
-  k as Typed2DArray,
-  At as WellboreManager,
-  zt as addVec2,
-  Ft as addVec3,
-  It as angleVec3,
-  St as calculateFrenetFrames,
-  We as calculateHashValue,
-  Ve as calculateWellSegments,
-  K as clamp,
-  Lt as copyVec3,
-  Te as createConfig,
-  Pe as createElevationTexture,
-  He as createFenceGeometry,
-  De as createNormalTexture,
-  Ze as createTubeGeometries,
-  $e as createTubeGeometry,
-  Vt as crossVec3,
-  Tt as degreesToRadians,
-  Pt as directionVec2,
-  Dt as directionVec3,
-  Gt as distanceVec2,
-  qt as distanceVec3,
-  jt as dotVec2,
-  kt as dotVec3,
-  Nt as edgeOfRectangle,
-  Ge as elevationMapNormalsToRGBA,
-  Ot as feetToMeters,
-  Qt as getCurvePositions,
-  Ut as getFormationMarkers,
-  pt as getObjectByCustomProperty,
-  Wt as getProjectedTrajectory,
-  qe as getProjectionDefFromUtmZone,
-  Ht as getSplineCurve,
-  Zt as getTrajectory,
-  $t as getTypedArrayFromBuffer,
-  Jt as getTypedArrayType,
-  je as getUtmZoneFromLatLng,
-  Kt as getVec2,
-  Xt as getVec3,
-  Yt as getWellboreFormations,
-  ft as idToHexColor,
-  Rt as inverseLerp,
-  te as lengthVec2,
-  ee as lengthVec3,
-  se as lerp,
-  ie as mergeFormationIntervals,
-  Je as mergeGeometries,
-  ne as mixVec2,
-  re as mixVec3,
-  mt as multiply,
-  gt as negate,
-  ae as negateVec2,
-  oe as negateVec3,
-  le as normalizeVec2,
-  he as normalizeVec3,
-  ce as normalizedDeviceToScreen,
-  fe as packAttribute,
-  ue as packBufferGeometries,
-  de as packBufferGeometry,
-  ge as packBufferGeometryLike,
-  dt as parseIrapbin,
-  ut as randomColor,
-  me as readDepth,
-  pe as remap,
-  ye as rotateVec3,
-  _e as scaleVec2,
-  we as scaleVec3,
-  xe as screenToNormalizedDevice,
-  be as setVec2,
-  ve as setVec3,
-  Me as simplifyCurve2D,
-  Ce as subVec2,
-  Ee as subVec3,
-  Ke as titleCase,
-  Xe as toBufferGeometry,
-  yt as toFloat32Array,
-  Be as toRGB,
-  ke as toSegments,
-  Ne as triangleNormal,
-  ct as triangulateGrid,
-  Ye as triangulateGridDelaunay,
-  Ae as unpackBufferGeometries,
-  ze as unpackBufferGeometry,
-  Fe as uvMaterial,
-  Oe as wgs84Def
-};
+import { $ as e, $t as t, A as n, At as r, Bt as i, C as a, Cn as o, Ct as s, D as c, Dn as l, Dt as u, E as d, En as f, Et as p, F as m, Ft as h, Gt as g, H as _, Ht as v, It as y, J as b, Jt as x, Kt as S, Lt as C, M as w, Mt as T, N as E, Nt as D, O, Ot as k, P as A, Pt as j, Q as M, Qt as N, Rt as P, S as F, Sn as I, St as L, T as R, Tn as z, Tt as B, Ut as V, Vt as H, Wt as U, X as W, Xt as G, Y as K, Yt as q, Z as J, Zt as Y, _ as X, _n as Z, _t as Q, an as $, at as ee, b as te, bn as ne, bt as re, c as ie, cn as ae, ct as oe, d as se, dn as ce, dt as le, en as ue, et as de, f as fe, fn as pe, ft as me, g as he, gn as ge, gt as _e, h as ve, hn as ye, ht as be, in as xe, it as Se, j as Ce, jt as we, k as Te, kt as Ee, l as De, ln as Oe, lt as ke, m as Ae, mn as je, mt as Me, n as Ne, nn as Pe, nt as Fe, on as Ie, ot as Le, p as Re, pn as ze, pt as Be, q as Ve, qt as He, rn as Ue, rt as We, s as Ge, sn as Ke, st as qe, t as Je, tn as Ye, tt as Xe, u as Ze, un as Qe, ut as $e, v as et, vn as tt, vt as nt, w as rt, wn as it, wt as at, x as ot, xn as st, xt as ct, y as lt, yn as ut, yt as dt, zt as ft } from "./chunk-DKAquGKk.js";
+export { Ce as CRS, _ as CameraManager, l as DataLoader, B as Delatin, rt as DepthReadMaterial, f as GeneratorRegistry, ae as PI, Oe as PI2, Qe as PI4, ce as PI8, b as PlanarGeometry, K as PlanarLineGeometry, W as PlanarPointGeometry, J as PlanarPolygonGeometry, pe as TAU, Ne as TubeMaterial, ie as Typed2DArray, m as WellboreManager, D as addVec2, j as addVec3, h as angleVec3, y as asVec2, Me as buildMaskedGridPlane, r as calculateFrenetFrames, De as calculateHashValue, I as calculateWellSegments, je as clamp, Q as computePlanarXZUv, X as computeSurfaceNormalsRG, nt as computeUpwardNormals, C as copyVec3, he as createConfig, et as createElevationTexture, ct as createFenceGeometry, dt as createIndexedGeometry, lt as createNormalTexture, Le as createOceanBox, qe as createOceanBoxFromPolygon, oe as createOceanBoxFromSurface, ke as createOceanEllipseBox, $e as createOceanPlane, te as createPackedNormalTexture, p as createTubeGeometries, u as createTubeGeometry, P as crossVec3, R as degreesToRadians, ft as directionVec2, i as directionVec3, H as distanceVec2, v as distanceVec3, V as dotVec2, U as dotVec3, ze as edgeOfRectangle, ot as elevationMapNormalsToRGBA, ut as extractBoundaryLoops, d as feetToMeters, be as floodFillExternalHoles, we as getCurvePositions, o as getFormationMarkers, fe as getObjectByCustomProperty, L as getProjectedTrajectory, w as getProjectionDefFromUtmZone, T as getSplineCurve, s as getTrajectory, M as getTypedArrayFromBuffer, e as getTypedArrayType, E as getUtmZoneFromLatLng, g as getVec2, S as getVec3, it as getWellboreFormations, Te as idToHexColor, ye as inverseLerp, He as lengthVec2, x as lengthVec3, ge as lerp, z as mergeFormationIntervals, k as mergeGeometries, q as mixVec2, G as mixVec3, Re as multiply, Ae as negate, Y as negateVec2, N as negateVec3, t as normalizeVec2, ue as normalizeVec3, c as normalizedDeviceToScreen, de as packAttribute, Xe as packBufferGeometries, Fe as packBufferGeometry, We as packBufferGeometryLike, ve as parseIrapbin, n as randomColor, a as readDepth, me as refineInteriorEdges, Z as remap, re as rotateGeometryY, Ye as rotateVec3, _e as sampleValidGrid, Pe as scaleVec2, Ue as scaleVec3, O as screenToNormalizedDevice, xe as setVec2, $ as setVec3, at as simplifyCurve2D, ne as smoothBoundaryLoops, st as snapBoundaryToOutline, Ie as subVec2, Ke as subVec3, Be as subdivideGeometry, Ze as titleCase, Ee as toBufferGeometry, Ge as toFloat32Array, tt as toRGB, se as toSegments, F as triangleNormal, Ve as triangulateGrid, le as triangulateGridDelaunay, Se as unpackBufferGeometries, ee as unpackBufferGeometry, Je as uvMaterial, A as wgs84Def };