@voluma/vlam 0.2.3 → 0.3.0

package/dist/streaming.js

@@ -0,0 +1,2877 @@
+var Me = Object.defineProperty;
+var Fe = (o, i, e) => i in o ? Me(o, i, { enumerable: !0, configurable: !0, writable: !0, value: e }) : o[i] = e;
+var d = (o, i, e) => Fe(o, typeof i != "symbol" ? i + "" : i, e);
+import { h as Be, f as W, a as Ee, l as ke } from "./splat-budget-DuVZspPQ.js";
+import * as w from "three/webgpu";
+import { S as Pe, a as se, y as xe } from "./splat-mesh-aQdcWA6v.js";
+import { L as We, r as C } from "./lod-scheduler-B0a_uBlv.js";
+import { S as q, t as ee, r as Ae, i as G, a as _ } from "./loading-wLo8vRbA.js";
+import { y as Le } from "./relighting-CSQF3UcL.js";
+import { C as Ve } from "./chunk-loader-DlNwggfG.js";
+import { s as Ie } from "./sh-pack-D5wAe5gg.js";
+import { w as P } from "./logging-BfPdd7NJ.js";
+import { r as Ne, M as De, a as ne, i as j } from "./splat-mesh-types-BZIko-_9.js";
+const Ge = 32e3;
+function _e(o) {
+  return o.map((i) => ({
+    adds: [i],
+    removes: [],
+    leafStart: i.leafStart,
+    leafEnd: i.leafEnd,
+    addCount: i.count
+  })).sort((i, e) => i.leafStart - e.leafStart);
+}
+function ze(o, i) {
+  const e = [...o, ...i.map(([, n]) => n.run)];
+  if (e.length > 0 && e.every((n) => n.coverageGroup !== void 0)) {
+    const n = /* @__PURE__ */ new Map(), r = (l) => {
+      let c = n.get(l);
+      return c || (c = { adds: [], removes: [] }, n.set(l, c)), c;
+    };
+    for (const l of o)
+      r(l.coverageGroup).adds.push(l);
+    for (const l of i)
+      r(l[1].run.coverageGroup).removes.push(l);
+    const a = [];
+    for (const l of n.values()) {
+      const c = /* @__PURE__ */ new Map(), h = (u, g) => `${u}:${g}`, f = (u, g) => {
+        const v = h(u, g);
+        let m = c.get(v);
+        return m || (m = { adds: [], removes: [], leafStart: u, leafEnd: g, addCount: 0 }, c.set(v, m)), m;
+      };
+      for (const u of l.adds) {
+        const g = f(u.leafStart, u.leafEnd);
+        g.adds.push(u), g.addCount += u.count;
+      }
+      for (const u of l.removes) {
+        const g = u[1].run, v = f(g.leafStart, g.leafEnd);
+        v.removes.push(u), v.leafStart = Math.min(v.leafStart, g.leafStart), v.leafEnd = Math.max(v.leafEnd, g.leafEnd);
+      }
+      a.push(...c.values());
+    }
+    return a.sort((l, c) => l.leafStart - c.leafStart);
+  }
+  const t = [
+    ...o.map((n) => ({
+      start: n.leafStart,
+      end: n.leafEnd,
+      add: n,
+      remove: void 0
+    })),
+    ...i.map((n) => ({
+      start: n[1].run.leafStart,
+      end: n[1].run.leafEnd,
+      add: void 0,
+      remove: n
+    }))
+  ].sort((n, r) => n.start - r.start || r.end - n.end), s = [];
+  for (const n of t) {
+    const r = s[s.length - 1];
+    (!r || n.start >= r.leafEnd) && s.push({
+      adds: [],
+      removes: [],
+      leafStart: n.start,
+      leafEnd: n.end,
+      addCount: 0
+    });
+    const a = s[s.length - 1];
+    a.leafEnd = Math.max(a.leafEnd, n.end), n.add && (a.adds.push(n.add), a.addCount += n.add.count), n.remove && a.removes.push(n.remove);
+  }
+  return s;
+}
+function re(o) {
+  if (o.adds.length === 0) return 1e3;
+  const i = -Math.max(...o.adds.map((e) => e.level));
+  return o.removes.length === 0 ? -1e3 + i : i;
+}
+function Oe(o) {
+  return o.length > 0 && o.every(
+    (i) => [...i.adds, ...i.removes.map(([, e]) => e.run)].every(
+      (e) => e.coverageGroup !== void 0
+    )
+  );
+}
+function Ue(o, i) {
+  const e = (n) => {
+    const r = [...n.adds, ...n.removes.map(([, a]) => a.run)];
+    return {
+      removeOnly: n.adds.length === 0 ? 1 : 0,
+      view: r.some((a) => a.inView !== !1) ? 0 : 1,
+      finest: n.adds.some((a) => a.level === 0) ? 0 : 1,
+      screen: Math.min(...r.map((a) => a.screenImportance ?? Number.POSITIVE_INFINITY)),
+      distance: Math.min(...r.map((a) => a.distance ?? Number.POSITIVE_INFINITY))
+    };
+  }, t = e(o), s = e(i);
+  return t.removeOnly - s.removeOnly || t.view - s.view || t.finest - s.finest || t.screen - s.screen || t.distance - s.distance || o.leafStart - i.leafStart;
+}
+function ae(o) {
+  switch (o) {
+    case "environment":
+      return -1;
+    case "finest-target":
+      return 0;
+    case "coverage":
+      return 1;
+    case "target":
+      return 2;
+    default:
+      return 3;
+  }
+}
+function He(o) {
+  return o === "background" ? "base" : "priority";
+}
+function D(o, i) {
+  return o.coverageGroup < 0 ? `file:${i}` : o.phase === "finest-target" ? `cell:${o.coverageGroup}` : `slice:${o.coverageGroup}:${o.leafStart}:${o.leafEnd}`;
+}
+function $e(o, i = 10, e = !1) {
+  const t = te(i), s = /* @__PURE__ */ new Map();
+  for (const [n, r] of o) {
+    if (r.phase === "environment") continue;
+    const a = D(r, n), l = s.get(a);
+    if (!l) {
+      s.set(a, {
+        distance: r.distance,
+        count: 1,
+        inView: r.inView,
+        screenImportance: r.screenImportance,
+        finest: r.phase === "finest-target"
+      });
+      continue;
+    }
+    r.distance < l.distance && (l.distance = r.distance), r.inView && (l.inView = !0), r.screenImportance < l.screenImportance && (l.screenImportance = r.screenImportance), r.phase === "finest-target" && (l.finest = !0), l.count++;
+  }
+  for (const [n, r] of o) {
+    if (r.phase === "environment") {
+      r.kind = "priority", r.groupDistance = 0, r.groupPending = 1, r.groupInView = !0, r.groupScreenImportance = Number.NEGATIVE_INFINITY, r.groupFinest = !0, r.groupId = "environment", r.groupClass = 0;
+      continue;
+    }
+    const a = D(r, n), l = s.get(a);
+    if (!l) continue;
+    const c = l.inView ? 0 : l.distance <= t ? 1 : 2, h = c === 0 || c === 1 && e ? "priority" : "base";
+    r.groupDistance = l.distance, r.groupPending = l.count, r.groupInView = l.inView, r.groupScreenImportance = l.screenImportance, r.groupFinest = l.finest, r.groupId = a, r.groupClass = c, r.kind = h;
+  }
+}
+function te(o, i = 2) {
+  return o;
+}
+function Ye(o) {
+  return o.adds.some((i) => i.level === 0);
+}
+function qe(o, i, e = 2) {
+  if (o.level === 0) return "finest-target";
+  const t = o.distance ?? Number.POSITIVE_INFINITY;
+  return o.inView === !1 && t > te(i) ? "background" : "target";
+}
+function je(o, i, e = 2) {
+  const t = o.distance ?? Number.POSITIVE_INFINITY;
+  return o.inView === !1 && t > te(i) ? "background" : "coverage";
+}
+function oe(o, i, e, t) {
+  const s = t.distance ?? Number.POSITIVE_INFINITY, n = t.level, r = t.inView !== !1, a = t.coverageGroup ?? -1, l = t.screenImportance ?? Number.POSITIVE_INFINITY, c = He(e), h = o.get(i);
+  if (!h) {
+    const v = D(
+      { phase: e, coverageGroup: a, leafStart: t.leafStart, leafEnd: t.leafEnd },
+      i
+    );
+    o.set(i, {
+      kind: c,
+      phase: e,
+      distance: s,
+      level: n,
+      inView: r,
+      coverageGroup: a,
+      leafStart: t.leafStart,
+      leafEnd: t.leafEnd,
+      screenImportance: l,
+      groupDistance: s,
+      groupPending: 1,
+      groupInView: r,
+      groupScreenImportance: l,
+      groupFinest: e === "finest-target",
+      groupId: v,
+      // Provisional; finalized in stampClassicFetchGroups().
+      groupClass: 2
+    });
+    return;
+  }
+  const f = ae(e) < ae(h.phase), u = e === h.phase && (s < h.distance || s === h.distance && n < h.level), g = e === h.phase && s === h.distance && n === h.level && r && !h.inView;
+  (f || u || g) && o.set(i, {
+    kind: c,
+    phase: e,
+    distance: s,
+    level: n,
+    inView: r || h.inView,
+    coverageGroup: a >= 0 ? a : h.coverageGroup,
+    leafStart: t.leafStart,
+    leafEnd: t.leafEnd,
+    screenImportance: l,
+    groupDistance: Math.min(s, h.groupDistance),
+    groupPending: h.groupPending,
+    groupInView: r || h.groupInView,
+    groupScreenImportance: Math.min(l, h.groupScreenImportance),
+    groupFinest: e === "finest-target" || h.groupFinest,
+    groupId: h.groupId,
+    groupClass: h.groupClass
+  });
+}
+function X(o, i, e, t) {
+  const s = o.groupDistance ?? o.distance, n = i.groupDistance ?? i.distance, r = o.groupPending ?? 1, a = i.groupPending ?? 1, l = o.groupId ?? D(o, e), c = i.groupId ?? D(i, t), h = o.groupClass ?? (o.inView ? 0 : 2), f = i.groupClass ?? (i.inView ? 0 : 2), u = o.groupScreenImportance ?? o.screenImportance, g = i.groupScreenImportance ?? i.screenImportance, v = o.groupFinest ? 0 : 1, m = i.groupFinest ? 0 : 1, b = (y) => y === "coverage" ? 0 : y === "background" ? 2 : 1, T = o.phase === "environment" ? 0 : 1, I = i.phase === "environment" ? 0 : 1;
+  return T - I || h - f || v - m || u - g || s - n || a - r || (l < c ? -1 : l > c ? 1 : 0) || b(o.phase) - b(i.phase) || o.level - i.level || e - t;
+}
+function K(o, i, e) {
+  if (i < 0 || e < 0 || i + e > o.count)
+    throw new Error(
+      `Splat range [${i}, ${i + e}) exceeds its chunk's ${o.count} splats; the manifest and chunk data disagree.`
+    );
+  const t = o.shPacked;
+  return {
+    count: e,
+    positions: o.positions.subarray(i * 3, (i + e) * 3),
+    colors: o.colors.subarray(i * 4, (i + e) * 4),
+    covariances: o.covariances.subarray(i * 6, (i + e) * 6),
+    // Per-splat SH is splat-major, so it slices like everything else. Palette
+    // shN (`chunk.sh`) is deliberately not carried: its labels index a
+    // per-file codebook the shared pool has no way to hold.
+    ...t ? {
+      shPacked: {
+        ...t,
+        packed: t.packed.subarray(
+          i * le(t.bands),
+          (i + e) * le(t.bands)
+        )
+      }
+    } : {},
+    // Per-splat frontier `parent_size` (foveated `.rad`) slices splat-major like
+    // the rest; uploaded into `covarianceB.w` by the pool.
+    ...o.frontierParent ? { frontierParent: o.frontierParent.subarray(i, i + e) } : {}
+  };
+}
+function le(o) {
+  return o === 1 ? 3 : o === 2 ? 8 : 15;
+}
+function Xe(o) {
+  var i;
+  return o.positions.byteLength + o.colors.byteLength + o.covariances.byteLength + // SH is the largest part of an LCC Quality chunk (64 B/splat against the
+  // base 32); omitting it would let the CPU cache run ~3x over its cap.
+  (((i = o.shPacked) == null ? void 0 : i.packed.byteLength) ?? 0);
+}
+function Ke(o) {
+  const i = o.reason;
+  return i instanceof Error ? i : new DOMException("Aborted", "AbortError");
+}
+function Qe(o) {
+  const i = o ?? Ge;
+  if (!Number.isInteger(i) || i <= 0)
+    throw new RangeError("StreamedSplatMesh maxSplatsPerSwap must be a positive integer.");
+  return i;
+}
+function ce(o) {
+  const i = o ?? 1;
+  if (!Number.isFinite(i) || i <= 0)
+    throw new RangeError("StreamedSplatMesh lodScale must be a positive finite number.");
+  return i;
+}
+function Je() {
+  return Be();
+}
+function Ze(o, i) {
+  const e = o;
+  if (typeof e != "object" || e === null)
+    throw new Error("Streamed SOG manifest is not a JSON object.");
+  if (e.version !== 1)
+    throw new Error(`Unsupported Streamed SOG manifest version: ${e.version} (expected 1).`);
+  if (!Array.isArray(e.filenames) || e.filenames.some((l) => typeof l != "string"))
+    throw new Error('Streamed SOG manifest "filenames" must be an array of strings.');
+  if (!Array.isArray(e.counts) || e.counts.some((l) => !Number.isSafeInteger(l) || l < 0))
+    throw new Error('Streamed SOG manifest "counts" must be an array of non-negative integers.');
+  if (!Number.isSafeInteger(e.lodLevels) || e.lodLevels < 1 || e.lodLevels > 64)
+    throw new Error(`Streamed SOG manifest declares an invalid lodLevels: ${e.lodLevels}.`);
+  const t = e.filenames.map((l) => l.replace(/\/?meta\.json$/, "/")), s = t.map(
+    (l) => i.resolve(l) ?? `${i.manifestUrl}#${l}`
+  ), n = [], r = e.lodLevels, a = [e.tree];
+  for (; a.length > 0; ) {
+    const l = a.pop();
+    if (typeof l != "object" || l === null)
+      throw new Error("Streamed SOG manifest tree contains a malformed node.");
+    if (l.children) {
+      if (!Array.isArray(l.children) || l.children.length !== 2)
+        throw new Error("Streamed SOG manifest tree node must have exactly two children.");
+      a.push(l.children[1], l.children[0]);
+      continue;
+    }
+    const c = new Array(r).fill(
+      void 0
+    );
+    for (const [h, f] of Object.entries(l.lods ?? {})) {
+      const u = Number(h);
+      u >= 0 && u < r && (et(f, e.filenames.length), c[u] = f);
+    }
+    n.push({ bounds: he(l.bound), lods: c });
+  }
+  return {
+    leaves: n,
+    chunkUrls: s,
+    chunkDirectories: t,
+    counts: e.counts,
+    lodLevels: r,
+    bounds: he(e.tree.bound)
+  };
+}
+function et(o, i) {
+  if (typeof o != "object" || o === null || !Number.isSafeInteger(o.file) || o.file < 0 || o.file >= i || !Number.isSafeInteger(o.offset) || o.offset < 0 || !Number.isSafeInteger(o.count) || o.count < 0)
+    throw new Error(
+      `Streamed SOG manifest leaf declares an invalid LOD range (file ${o == null ? void 0 : o.file}, offset ${o == null ? void 0 : o.offset}, count ${o == null ? void 0 : o.count}).`
+    );
+}
+function he(o) {
+  return new w.Box3(
+    new w.Vector3(o.min[0], o.min[1], o.min[2]),
+    new w.Vector3(o.max[0], o.max[1], o.max[2])
+  );
+}
+function tt(o, i, e, t = 0) {
+  const s = Ze(o, i), n = t >= 1 ? t : void 0, r = s.chunkUrls.map((a, l) => {
+    var f;
+    const c = (f = s.chunkDirectories) == null ? void 0 : f[l], h = c ? i.directoryFiles(c) : null;
+    if (!(!h && !n))
+      return {
+        format: "sog",
+        ...h ? { files: h } : {},
+        ...n ? { sog: { packShBands: n } } : {}
+      };
+  });
+  return {
+    source: new We(s, e),
+    chunkUrls: s.chunkUrls,
+    ...r.some(Boolean) ? { chunkOptions: r } : {},
+    ...n ? { shBands: n } : {},
+    chunkKind: "directory",
+    // Streamed SOG chunks are unbundled directories
+    bounds: s.bounds,
+    pinnedFiles: st(s),
+    maxResidentSplats: s.counts[0] ?? e.budget,
+    minimumCoverageSplats: it(s)
+  };
+}
+function it(o) {
+  let i = 0;
+  for (const e of o.leaves)
+    for (let t = e.lods.length - 1; t >= 0; t--) {
+      const s = e.lods[t];
+      if (s) {
+        i += s.count;
+        break;
+      }
+    }
+  return Math.max(1, i);
+}
+function st(o) {
+  const i = /* @__PURE__ */ new Set();
+  for (const e of o.leaves)
+    for (let t = e.lods.length - 1; t >= 0; t--) {
+      const s = e.lods[t];
+      if (s) {
+        i.add(s.file);
+        break;
+      }
+    }
+  return i;
+}
+function nt(o, i) {
+  return {
+    manifestUrl: o,
+    resolve: (e) => new URL(e, o).href,
+    size: (e) => rt(new URL(e, o).href, i),
+    directoryFiles: () => null,
+    dispose: () => {
+    }
+  };
+}
+async function rt(o, i) {
+  var e;
+  try {
+    const t = await fetch(o, { ...ee(i), method: "HEAD" });
+    if (await ue(t), t.ok) {
+      const s = t.headers.get("content-length");
+      if (s !== null) return de(Number(s));
+    } else if (t.status === 404)
+      return null;
+  } catch {
+  }
+  try {
+    const t = await fetch(o, {
+      ...ee(i),
+      headers: { ...(i == null ? void 0 : i.headers) ?? {}, Range: "bytes=0-0" }
+    });
+    if (await ue(t), t.status !== 206) return null;
+    const s = (e = t.headers.get("content-range")) == null ? void 0 : e.split("/")[1];
+    return s === void 0 || s === "*" ? null : de(Number(s));
+  } catch {
+    return null;
+  }
+}
+async function ue(o) {
+  var i;
+  try {
+    await ((i = o.body) == null ? void 0 : i.cancel());
+  } catch {
+  }
+}
+function de(o) {
+  return Number.isSafeInteger(o) && o >= 0 ? o : null;
+}
+const at = [
+  { test: (o) => o.endsWith(".lcc2"), format: "lcc2" },
+  { test: (o) => o.endsWith(".lcc"), format: "lcc" },
+  // The `.rad` header of a `--rad-chunked` set; `.radc` chunk files are not
+  // manifests (they end in `.radc`, so `endsWith('.rad')` excludes them).
+  { test: (o) => o.endsWith(".rad"), format: "rad" },
+  { test: (o) => o === "lod-meta.json", format: "streamed-sog" }
+];
+function ot(o) {
+  const i = [];
+  for (const a of o.keys()) {
+    const l = $(a).toLowerCase(), c = at.find((h) => h.test(l));
+    c && Re(a) === lt(o, c) && i.push({ path: a, format: c.format });
+  }
+  if (i.length === 0)
+    throw new q(
+      "That folder has no streamed-scene manifest in it (expected a .lcc, .lcc2 or lod-meta.json file).",
+      { phase: "manifest", url: "local-folder", retryable: !1 }
+    );
+  if (i.length > 1) {
+    const a = i.map((l) => $(l.path)).join(", ");
+    throw new q(
+      `That folder holds more than one scene manifest (${a}) - drop one scene at a time.`,
+      { phase: "manifest", url: "local-folder", retryable: !1 }
+    );
+  }
+  const e = i[0], t = e.path.includes("/") ? e.path.slice(0, e.path.lastIndexOf("/") + 1) : "", s = /* @__PURE__ */ new Map(), n = (a) => {
+    const l = s.get(a);
+    if (l !== void 0) return l;
+    const c = o.get(a);
+    if (!c) return null;
+    const h = URL.createObjectURL(c);
+    return s.set(a, h), h;
+  };
+  return { source: {
+    manifestUrl: n(e.path),
+    resolve: (a) => n(t + Q(a)),
+    size: (a) => {
+      var l;
+      return Promise.resolve(((l = o.get(t + Q(a))) == null ? void 0 : l.size) ?? null);
+    },
+    directoryFiles: (a) => {
+      const l = t + Q(a).replace(/\/?$/, "/"), c = {};
+      for (const h of o.keys()) {
+        if (!h.startsWith(l)) continue;
+        const f = n(h);
+        f && (c[h.slice(l.length)] = f);
+      }
+      return Object.keys(c).length > 0 ? c : null;
+    },
+    dispose: () => {
+      for (const a of s.values()) URL.revokeObjectURL(a);
+      s.clear();
+    }
+  }, format: e.format, name: $(e.path) };
+}
+function Q(o) {
+  return o.replace(/^\.?\//, "");
+}
+function $(o) {
+  return o.slice(o.lastIndexOf("/") + 1);
+}
+function Re(o) {
+  return o.split("/").length - 1;
+}
+function lt(o, i) {
+  let e = 1 / 0;
+  for (const t of o.keys())
+    i.test($(t).toLowerCase()) && (e = Math.min(e, Re(t)));
+  return e;
+}
+const fe = {
+  coneFov0: 90,
+  coneFov: 120,
+  coneFoveate: 0.4,
+  behindFoveate: 0.2
+}, F = 2048, ct = 6e4, ht = 0.25, ut = 8, dt = 600, ft = 250, gt = 4, pt = 500, mt = 3, vt = 4e6, ge = 65536, St = 2 * 1024 * 1024 * 1024;
+function bt(o) {
+  const i = 52 + (o.shBands ? 16 * Math.ceil(Ie(o.shBands) / 4) : 0), t = (o.chunkSize === void 0 ? void 0 : o.chunkSize * o.chunkUrls.length) ?? o.contentSplatCount ?? o.maxResidentSplats;
+  return Math.max(1, t) * i;
+}
+class Y extends Pe {
+  constructor(e, t, s, n, r, a = !1) {
+    var u, g, v;
+    super({ capacity: s }, n);
+    d(this, "scene");
+    d(this, "loader", new Ve());
+    /**
+     * Cap the *classic* (non-page-table) chunk cache evicts against.
+     *
+     * Mutable because a shared {@link ChunkCacheBudget} re-splits it as the camera
+     * moves; without a budget it stays at the value `options.cpuCacheBytes` or the
+     * device default set at construction.
+     */
+    d(this, "cpuCacheBytes");
+    d(this, "budgetValue");
+    d(this, "maximumBudget");
+    /** Spark's per-mesh `lodScale`; divides the page-table cut limit. */
+    d(this, "lodScaleValue");
+    /** Set once the governed budget has been reported as exceeding an explicit
+     * `foveationDrawBudget`, so the warning is issued at most once. */
+    d(this, "warnedDrawTargetCap", !1);
+    d(this, "stagedSwapsEnabled");
+    /** Classic LCC must keep old cell coverage while a replacement is pending. */
+    d(this, "neverRetireCoverageEarly");
+    d(this, "appendCap");
+    d(this, "onPerformanceEvent");
+    d(this, "compactionCount", 0);
+    d(this, "cache", /* @__PURE__ */ new Map());
+    /** Running byte total of {@link cache}; maintained by {@link cacheChunk}, eviction and dispose. */
+    d(this, "cacheBytesTotal", 0);
+    /** In-flight chunk fetches. The kind is kept so a weight change can shed the
+     * speculative ones without touching the detail that is actually on screen. */
+    d(this, "fetching", /* @__PURE__ */ new Map());
+    /** This mesh's camera-projected share of the scene's fetch bandwidth. */
+    d(this, "fetchWeight");
+    /** Scene-wide fetch arbitration, when the host shares one; see `requestChunk`. */
+    d(this, "fetchScheduler");
+    d(this, "fetchHandle");
+    /**
+     * Blob-URL dataset from {@link loadLocal}, owned by this mesh so its object
+     * URLs are revoked on {@link dispose} rather than leaking for the document's
+     * lifetime. Undefined for every network-loaded mesh.
+     */
+    d(this, "localSource");
+    /** Scene-wide chunk-cache ceiling, when the host shares one. */
+    d(this, "cacheBudget");
+    d(this, "cacheBudgetHandle");
+    /**
+     * The cap this mesh's frontier worker is currently evicting against.
+     *
+     * Mirrored on the main thread so `applyCacheAllowance` can skip no-op posts
+     * and so `fetchCounts.cacheLimitBytes` stays truthful between plans.
+     */
+    d(this, "cacheLimitBytes", 0);
+    d(this, "resident", /* @__PURE__ */ new Map());
+    /** Replacement runs hidden while their pool data is uploaded in bounded segments. */
+    d(this, "staged", /* @__PURE__ */ new Map());
+    /** Files awaiting a backoff retry after a transient fetch/decode error. */
+    d(this, "retrying", /* @__PURE__ */ new Map());
+    /** Files given up on after {@link MAX_CHUNK_ATTEMPTS} failures. */
+    d(this, "failedFiles", /* @__PURE__ */ new Set());
+    /**
+     * When true, each resident run writes its LOD `level` into the `lodLevel`
+     * float channel for false-color debug modifiers.
+     */
+    d(this, "lodLevelDebug", !1);
+    d(this, "lodLevelChannelReady", !1);
+    d(this, "lodLevelScratch");
+    /** Desired-but-not-resident files this tick; protected from cache eviction. */
+    d(this, "neededFiles", /* @__PURE__ */ new Set());
+    /** Non-null in `foveationMode: 'page-table'`: the worker that owns the chunk
+     * cache + traversal + pager off the main thread, and the always-active slab it
+     * pages the returned frontier into. */
+    d(this, "frontierWorker");
+    /**
+     * The frontier's slots, as a list of equally sized pages rather than one
+     * contiguous run.
+     *
+     * Slot `i` lives in page `i / slabPageSplats` at offset `i %
+     * slabPageSplats`. The pager only ever addresses slots, so where those
+     * pages sit in the pool is the mesh's business - which is what lets a mesh
+     * hold non-contiguous storage, and ultimately lets several meshes interleave
+     * in one pool instead of each reserving its whole ceiling as one block.
+     * (Spark's pager does the same thing one level down, binding fixed pages to
+     * `(source, chunk)` pairs.)
+     */
+    d(this, "slabPages", []);
+    /** Most slots the slab may ever hold - the construction capacity. */
+    d(this, "slabCeiling", 0);
+    /** Slot count the worker's pager was last told about. */
+    d(this, "pagerSlots", 0);
+    /** Consecutive ticks the wave gate has held retirements back. */
+    d(this, "retireHeldTicks", 0);
+    /** Backing store for {@link planTimings}. */
+    d(this, "planTimingsValue", {
+      applyMs: 0,
+      worstApplyMs: 0,
+      writeMs: 0,
+      residentMs: 0,
+      moves: 0,
+      appends: 0,
+      worstSplats: 0
+    });
+    /**
+     * Backing store for {@link fetchCounts}. Lifetime totals, because the question
+     * they answer is about a *steady state* - "this keeps streaming after the view
+     * settled" - which a per-frame or windowed number cannot express.
+     */
+    d(this, "fetchCountsValue", {
+      priority: 0,
+      base: 0,
+      sweep: 0,
+      evicted: 0,
+      uncovered: 0,
+      retiredEarly: 0,
+      cacheFull: !1,
+      cacheBytes: 0,
+      cacheLimitBytes: 0
+    });
+    /**
+     * The screen-radius band the scene asked for, kept so the band can be scaled
+     * with the solved frontier cut and always relative to the original - scaling
+     * the live values repeatedly would drift. Null when the scene has no band.
+     */
+    d(this, "frontierBandBase", null);
+    /**
+     * Splats per slab page for this mesh: {@link SLAB_PAGE_SPLATS}, or the whole
+     * capacity when that is smaller. Spark can use one fixed page size because
+     * its pool is a single large arena; here a mesh may be smaller than a page,
+     * and rounding it up to one would waste most of the reservation.
+     */
+    d(this, "slabPageSplats", ge);
+    /** Target drawn-splat count for the page-table frontier; see the constructor. */
+    d(this, "pageTableDrawBudget", 0);
+    /** The unclamped draw target (`foveationDrawBudget` or the default), kept so
+     * `setBudget` can re-derive the effective draw budget when the pool budget
+     * moves (e.g. under a `BudgetGovernor`). */
+    d(this, "pageTableDrawTarget", 0);
+    /** Whether {@link pageTableDrawTarget} came from an explicit
+     * `foveationDrawBudget` - a caller-chosen hard cap worth warning about when a
+     * governed budget outgrows it, rather than the library's own default. */
+    d(this, "pageTableDrawTargetExplicit", !1);
+    /** Last frontier's drawn (non-degenerate) splat count - the true on-screen size
+     * in `page-table` mode, where the slab is fully "active" but mostly degenerate. */
+    d(this, "pageTableDrawn", 0);
+    /** Monotonic reschedule id; a stale plan (superseded by a newer request) is
+     * dropped. `pageTableInFlight` coalesces to one outstanding traversal. */
+    d(this, "pageTableSeq", 0);
+    d(this, "pageTableInFlight", !1);
+    d(this, "pageTableDisposed", !1);
+    /** Files whose data has been forwarded to the worker (so we don't refetch). */
+    d(this, "pageTableCachedFiles", /* @__PURE__ */ new Set());
+    /** Chunks the last frontier wanted but did not have, biggest-on-screen first.
+     * These outrank the background sweep - they are the detail actually on screen. */
+    d(this, "pageTableFetchPriority", []);
+    /** Frontier-cut target node size (px) and foveation ramp; see `frontierView`. */
+    d(this, "pageTableTargetPx", se);
+    d(this, "pageTableFoveation", fe);
+    /** Drawing-buffer height, sampled in `update` so `reschedule` can derive the
+     * cut limit the same way the material does (`targetPx / focalY`). */
+    d(this, "pageTableViewportY", 0);
+    /** Frontier cut on foveated `size / distance`. Re-derived each reschedule once
+     * the drawing buffer is known; the initial value only covers the first frame. */
+    d(this, "pageTableLimit", 0.02);
+    /**
+     * Whether the worker's cache is sitting at its cap: sweeping past that point
+     * only evicts what the frontier is using.
+     *
+     * Re-derived from every plan rather than latched. It used to latch on the
+     * first eviction, which was safe only while the cap was sized to the capture
+     * and evictions therefore meant "this will never fit". Under a scene-wide
+     * {@link ChunkCacheBudget} evictions are routine - a far mesh gives bytes back
+     * and is trimmed - and latching would kill its sweep for the session, so a
+     * mesh that went cold could never re-warm when the camera returned.
+     */
+    d(this, "pageTableCacheAtLimit", !1);
+    /** Per-splat channels whose edits survive chunk eviction/reload (M7.6). */
+    d(this, "persistentChannels", /* @__PURE__ */ new Map());
+    /** Chunk-file index of the always-resident environment tile, if the scene ships one. */
+    d(this, "envFile");
+    /** Whether the environment tile should be visible; toggled live. */
+    d(this, "envEnabled");
+    /** Pool handle of the environment tile once it has loaded (kept for toggling). */
+    d(this, "envHandle");
+    /** Env splat count, measured when the tile decodes; 0 until then. */
+    d(this, "envSplatCount", 0);
+    /** Set when the env tile is larger than the whole pool - terminal, warned once. */
+    d(this, "envUnfit", !1);
+    /**
+     * Startup hold. `'capture'` waits for the first schedule after the host
+     * applies the final camera; `'holding'` freezes that coverage set.
+     */
+    d(this, "initialRevealPhase", "off");
+    /** Which hold, if any, was armed at construction. Survives release for recapture. */
+    d(this, "initialRevealHold", "off");
+    /** Frozen nearby-detail / in-view coverage runs for {@link initialRevealPhase} `'holding'`. */
+    d(this, "frozenCriticalRuns", null);
+    /** Timestamp of the final-camera capture that began the current hold. */
+    d(this, "initialRevealStartedAt");
+    d(this, "initialRevealStateValue", { status: "disabled" });
+    /** Fetch settings this mesh was loaded with, reused for collision meshes. */
+    d(this, "requestOptions");
+    /** In-flight or settled collision load; see {@link loadCollisionMeshes}. */
+    d(this, "collisionTiles");
+    d(this, "collisionAbort");
+    d(this, "pendingWork", !0);
+    d(this, "lastScheduleTime", -1 / 0);
+    /** Reused leaf-coverage bitmap for {@link substituteCoverage}; grows only. */
+    d(this, "coverageScratch");
+    d(this, "lastCameraPos", new w.Vector3(1 / 0, 1 / 0, 1 / 0));
+    d(this, "lastCameraQuat", new w.Quaternion());
+    this.scene = e, this.budgetValue = t, this.maximumBudget = n.maxBudget === void 0 ? t : Math.max(t, W(n.maxBudget)), this.lodScaleValue = ce(n.lodScale), this.stagedSwapsEnabled = n.experimentalStagedSwaps !== !1, this.neverRetireCoverageEarly = a, this.appendCap = Qe(n.maxSplatsPerSwap);
+    const l = n.initialReveal === "hold-coverage" && this.scene.source.coverageRunsFor !== void 0, c = n.initialReveal === "hold-near-l0" && a;
+    l || c ? (this.initialRevealHold = l ? "hold-coverage" : "hold-near-l0", this.initialRevealPhase = "capture", this.initialRevealStateValue = {
+      status: "pending",
+      stagedSplats: 0,
+      totalSplats: 0,
+      readyGroups: 0,
+      totalGroups: 0
+    }) : (this.initialRevealHold = "off", this.initialRevealPhase = "off", this.initialRevealStateValue = { status: "disabled" }), this.onPerformanceEvent = n.onPerformanceEvent, this.cpuCacheBytes = n.cpuCacheBytes ?? Je(), this.requestOptions = n.request, this.envFile = (u = e.environment) == null ? void 0 : u.file, this.envEnabled = n.environmentEnabled !== !1, this.fetchWeight = n.fetchWeight, this.fetchScheduler = n.fetchScheduler, this.cacheBudget = n.cacheBudget, this.fetchHandle = (g = this.fetchScheduler) == null ? void 0 : g.register({
+      // No weight supplied: claim an equal share rather than none, so a partly
+      // wired host degrades to round-robin instead of silently starving.
+      weight: () => {
+        var m;
+        return ((m = this.fetchWeight) == null ? void 0 : m.call(this)) ?? 1;
+      },
+      onSlotAvailable: () => {
+        this.pendingWork = !0;
+      },
+      shedFetches: (m) => this.abortFetches(m)
+    });
+    const h = j(n.foveationMode), f = h ? Math.max(
+      this.cpuCacheBytes,
+      Math.min(St, bt(e))
+    ) : this.cpuCacheBytes;
+    if (this.cacheBudgetHandle = (v = this.cacheBudget) == null ? void 0 : v.register({
+      // The governor weight `fetchWeight` already carries, so cache and network
+      // follow the same camera-projected measure. The `1` fallback matches
+      // `requestChunk`: a host that never wired weights gives every mesh an
+      // equal claim rather than none.
+      weight: () => {
+        var m;
+        return ((m = this.fetchWeight) == null ? void 0 : m.call(this)) ?? 1;
+      },
+      ceilingBytes: f,
+      onAllowanceChanged: (m) => this.applyCacheAllowance(m)
+    }), this.cacheLimitBytes = this.cacheBudget && this.cacheBudgetHandle ? this.cacheBudget.allowanceFor(this.cacheBudgetHandle) : f, h || (this.cpuCacheBytes = this.cacheLimitBytes), this.fetchCountsValue.cacheLimitBytes = this.cacheLimitBytes, j(n.foveationMode)) {
+      if (!r)
+        throw new Error("StreamedSplatMesh: page-table foveation requires the frontier worker.");
+      this.pageTableDrawTarget = n.foveationDrawBudget ?? vt, this.pageTableDrawTargetExplicit = n.foveationDrawBudget !== void 0, this.pageTableDrawBudget = Math.min(t, this.pageTableDrawTarget), this.pageTableTargetPx = n.foveationTargetPx ?? se, this.pageTableFoveation = { ...fe, ...n.frontierFoveation }, (n.minSplatScreenRadius !== void 0 || n.maxSplatScreenRadius !== void 0) && (this.frontierBandBase = {
+        min: n.minSplatScreenRadius ?? 0,
+        max: n.maxSplatScreenRadius ?? 0
+      }), this.slabPageSplats = Math.min(ge, s), this.slabCeiling = s, this.syncSlabPages(this.pageTableDrawBudget), this.frontierWorker = new r(), this.frontierWorker.onmessage = (b) => this.applyFrontierPlan(b.data), this.pagerSlots = this.slabSlots, this.postToWorker({
+        type: "init",
+        capacity: this.pagerSlots,
+        chunkSize: e.chunkSize ?? 65536,
+        cpuCacheBytes: this.cacheLimitBytes
+      });
+      const m = e.bootstrapChunk;
+      m && this.forwardChunkToWorker(m.file, m.data);
+    } else
+      this.frontierWorker = null;
+  }
+  /**
+   * Fetches a scene manifest and prepares a mesh sized to the budget.
+   * Accepts a Streamed SOG manifest (`lod-meta.json`) or an XGRIDS `.lcc2` or
+   * `.lcc` (manifest v3–v5) dataset - all stream through the same machinery. Both LCC
+   * generations are normalized to the established XGRIDS/Spark Three.js
+   * coordinate frame; streamed SOG orientation is unchanged.
+   *
+   * A `.lcc` dataset needs a server that answers HTTP range requests: its
+   * splats live in one large `data.bin` that is never fetched whole.
+   *
+   * @param manifestUrl - URL of the scene's `lod-meta.json`, `.lcc2` or `.lcc`
+   * file; relative URLs resolve against `options.baseUrl` (or the page).
+   * @throws Rejects with {@link SplatLoadError} on any resolve/fetch/parse
+   * failure, or a `DOMException` named `AbortError` when `options.signal` fires.
+   */
+  static async load(e, t = {}) {
+    const s = Ae(e, t.baseUrl).href, n = s.toLowerCase(), r = t.format !== void 0 && t.format !== "auto" ? t.format : n.endsWith(".lcc2") ? "lcc2" : n.endsWith(".lcc") ? "lcc" : n.endsWith(".rad") ? "rad" : "streamed-sog";
+    return Y.fromSource(
+      nt(s, t.request),
+      r,
+      t
+    );
+  }
+  /**
+   * Prepares a mesh from a folder dropped into the page - the same streamed
+   * formats, read straight off the user's disk with no server and no upload.
+   *
+   * Every file becomes a `blob:` URL, which answers range requests exactly as
+   * an HTTP origin does, so a multi-hundred-megabyte `.lcc` `data.bin` streams
+   * chunk-by-chunk rather than being read whole.
+   *
+   * @param files - The folder's files, keyed by path relative to its root
+   * (as the demo drop-zone `readDirectory` walk produces).
+   * @throws Rejects with {@link SplatLoadError} - phase `'manifest'` when the
+   * folder holds no (or more than one) recognizable scene manifest - or a
+   * `DOMException` named `AbortError` when `options.signal` fires.
+   */
+  static async loadLocal(e, t = {}) {
+    let s;
+    try {
+      s = ot(e);
+    } catch (n) {
+      throw n instanceof q ? n : new q(n instanceof Error ? n.message : String(n), {
+        phase: "manifest",
+        url: "local-folder",
+        retryable: !1,
+        cause: n
+      });
+    }
+    try {
+      const n = await Y.fromSource(s.source, s.format, t);
+      return n.localSource = s.source, n;
+    } catch (n) {
+      throw s.source.dispose(), n;
+    }
+  }
+  /** Shared load path: fetch the manifest from a source, then build the scene. */
+  static async fromSource(e, t, s) {
+    const n = s.deviceProfile, r = W(s.budget, n, {
+      format: t,
+      ...s.budgetCap === void 0 ? {} : { cap: s.budgetCap }
+    }), a = s.maxBudget === void 0 ? r : W(s.maxBudget, n);
+    if (a < r)
+      throw new RangeError(
+        `StreamedSplatMesh: maxBudget (${a}) must be >= budget (${r}).`
+      );
+    const l = {
+      budget: a,
+      lodBaseDistance: s.lodBaseDistance ?? 10,
+      lodMultiplier: s.lodMultiplier ?? 2
+    }, c = s.shBands ?? (Ne(s.performanceProfile, n) === "smooth" ? 0 : De), h = Ee(n), f = s.budget === void 0 && s.maxBudget === void 0 && s.budgetCap === void 0, u = s.signal;
+    u == null || u.throwIfAborted();
+    let g;
+    if (t === "rad")
+      try {
+        const { buildRadScene: p } = await import("./formats/rad.js");
+        g = await p(e, l, s.request, c, f);
+      } catch (p) {
+        throw G(p) ? p : _(p, { phase: "manifest", url: e.manifestUrl });
+      }
+    else {
+      let p;
+      try {
+        p = await fetch(e.manifestUrl, ee(s.request, u));
+      } catch (S) {
+        throw G(S) ? S : _(S, { phase: "fetch", url: e.manifestUrl });
+      }
+      if (!p.ok)
+        throw _(
+          new Error(`Failed to load manifest ${e.manifestUrl}: HTTP ${p.status}`),
+          { phase: "manifest", url: e.manifestUrl, status: p.status }
+        );
+      try {
+        const S = await p.json();
+        if (t === "lcc2") {
+          const { buildLcc2Scene: M } = await import("./formats/lcc.js");
+          g = M(S, e, l, s.shBands ?? 0);
+        } else if (t === "lcc") {
+          const { buildLccScene: M } = await import("./formats/lcc.js");
+          g = await M(S, e, { ...l, shBands: c });
+        } else
+          g = tt(S, e, l, s.shBands ?? 0);
+      } catch (S) {
+        throw G(S) ? S : _(S, { phase: "manifest", url: e.manifestUrl });
+      }
+    }
+    u == null || u.throwIfAborted();
+    const v = (t === "lcc" || t === "rad") && f ? ke(a, g.maxResidentSplats, n) : a, m = s.maxBudget === void 0 ? v : Math.min(r, v);
+    g.source.budget = m;
+    const b = Math.min(v, g.maxResidentSplats), T = s.experimentalStagedSwaps !== !1 ? 1.5 : 1.4, I = Math.max(
+      1,
+      Math.ceil(b * T / F)
+    ), y = g.foveation ? ne(
+      s.foveationMode,
+      t === "rad" ? "page-table" : "frontier"
+    ) : s.foveationMode === void 0 ? void 0 : ne(s.foveationMode);
+    let A;
+    if (j(y)) {
+      A = (await import("./frontier-worker-CAnK_Cmu.js")).default, u == null || u.throwIfAborted();
+      const S = g.source;
+      S.needsParentSizes !== void 0 && (S.needsParentSizes = !1);
+    }
+    const R = new Y(
+      g,
+      m,
+      I * F,
+      {
+        ...s,
+        // Classic LCC's useful first frame is the bounded nearby-detail set,
+        // not its coarse shell. `.lcc2` waits for in-view coarsest coverage
+        // so empty octree squares do not flash. Keep every other format
+        // progressive, and let a caller explicitly request progressive for A/B.
+        ...t === "lcc" && s.initialReveal === void 0 ? { initialReveal: "hold-near-l0" } : {},
+        ...t === "lcc2" && s.initialReveal === void 0 ? { initialReveal: "hold-coverage" } : {},
+        // The resolved ceiling, not the caller's raw option: it may have been
+        // lifted to a moderate capture's leaf count above.
+        maxBudget: v,
+        // This line overrides `...options` above, so a declined request has to
+        // survive it - that is how `.rad` came to ignore both the `smooth`
+        // profile and an explicit `shBands: 0`. Only *zero* is re-applied here,
+        // never a partial reduction: the builders already honour partial
+        // requests by generating that many bands, whereas forcing a smaller
+        // count past one would mismatch the decoded chunk and degrade to
+        // neutral SH (see `SplatMesh.writePackedSh`).
+        shBands: c === 0 ? 0 : g.shBands ?? 0,
+        // Spark ships Mip-Splatting antialiasing ON (blurAmount 0.3 *with* opacity
+        // compensation `α·√(detRaw/detBlur)`). Match that default for `.rad`: the
+        // 0.3 low-pass without the compensation makes splats too opaque (uniform
+        // blur) and leaves anisotropic splats bright (needle spikes).
+        antialias: s.antialias ?? (t === "rad" ? !0 : void 0),
+        // Older XGRIDS LCC uses a smaller, compensated projected low-pass.
+        ...t === "lcc" ? { projectedFilterProfile: "lcc" } : {},
+        // Match Spark's `.rad` render exactly: the LOD alpha encoding + merged-node
+        // σ-cutoff/super-Gaussian, and the √8 (≈2.83σ) base cutoff Spark defaults to.
+        // An explicit `lodAlpha` (e.g. `?lodAlpha=0`) wins for A/B.
+        //
+        // The √8 cutoff is *desktop only* - see `recommendedRadMaxStdDev`, which
+        // returns undefined on mobile so the `SplatMesh` constructor applies the
+        // same 4 ceiling `.rad` was the only format escaping. An explicit
+        // `maxStdDev` still wins, through `...options` above.
+        ...t === "rad" ? {
+          lodAlpha: s.lodAlpha ?? !0,
+          ...s.maxStdDev === void 0 && h !== void 0 ? { maxStdDev: h } : {}
+        } : {},
+        // A foveated scene renders whole chunks and picks the LOD cut per splat.
+        // `.rad` defaults to Spark's selected-index page table (only the frontier is
+        // paged to the GPU, so the whole device budget buys on-screen detail); other
+        // foveated formats keep the GPU `frontier` cut. `foveationMode: 'band'` (or
+        // `'frontier'`) forces the legacy paths for A/B. Overrides any caller blob cull.
+        ...g.foveation ? {
+          foveationMode: y,
+          minSplatScreenRadius: g.foveation.minScreenRadiusPx,
+          maxSplatScreenRadius: g.foveation.maxScreenRadiusPx
+        } : {}
+      },
+      A,
+      t === "lcc"
+    ), L = g.formatTransform ?? (R.orientation === "y-up" ? xe(t) : null);
+    return L && (R.matrix.copy(L), R.matrix.decompose(R.position, R.quaternion, R.scale), R.matrixWorldNeedsUpdate = !0), u != null && u.aborted && (R.dispose(), u.throwIfAborted()), R;
+  }
+  /** Slots the currently reserved pages can hold. */
+  get slabSlots() {
+    let e = 0;
+    for (const t of this.slabPages) e += t.count;
+    return e;
+  }
+  /**
+   * Reserves or releases slab pages so the slab can hold `wanted` slots, and
+   * tells the worker's pager the new slot count.
+   *
+   * This is the mechanism that makes a shared pool worth having: storage follows
+   * the governed budget, so approaching a mesh grows its pages while the ones
+   * behind you hand theirs back, instead of every mesh holding its ceiling for
+   * the whole session. Growth stops at the construction ceiling and at whatever
+   * the pool can actually spare - a mesh that cannot grow simply stays coarse
+   * rather than throwing.
+   */
+  syncSlabPages(e) {
+    if (this.slabCeiling === 0) return;
+    const t = Math.max(this.slabPageSplats, Math.min(this.slabCeiling, e));
+    let s = this.slabSlots;
+    for (; s < t; ) {
+      const n = Math.min(this.slabPageSplats, this.slabCeiling - s);
+      if (n <= 0) break;
+      try {
+        this.slabPages.push(this.reserveInactiveRange(n));
+      } catch {
+        break;
+      }
+      s += n;
+    }
+    for (; this.slabPages.length > 1; ) {
+      const n = this.slabPages[this.slabPages.length - 1];
+      if (s - n.count < t) break;
+      this.slabPages.pop(), s -= n.count, this.removeRange(n);
+    }
+    s !== this.pagerSlots && (this.pagerSlots = s, this.postToWorker({ type: "resize", capacity: s }), this.pageTableDrawn > s && this.setSlabResident(s), this.pendingWork = !0, this.lastScheduleTime = -1 / 0);
+  }
+  /**
+   * Writes `data` at slot `slot`, splitting the write where it crosses a page
+   * boundary. The pager's runs are contiguous in *slot* space, which page
+   * storage no longer guarantees is contiguous in the pool.
+   */
+  writeSlabSlots(e, t, s) {
+    let n = 0;
+    for (; n < s; ) {
+      const r = t + n, a = this.slabPages[Math.floor(r / this.slabPageSplats)];
+      if (!a) return;
+      const l = r % this.slabPageSplats, c = Math.min(s - n, this.slabPageSplats - l);
+      this.overwriteRangeData(a, K(e, n, c), l), n += c;
+    }
+  }
+  /** Zeros slots `[slot, slot + count)`, splitting at page boundaries like
+   * {@link writeSlabSlots}, so freed slots hold nothing drawable. */
+  degenerateSlabSlots(e, t) {
+    let s = 0;
+    for (; s < t; ) {
+      const n = e + s, r = this.slabPages[Math.floor(n / this.slabPageSplats)];
+      if (!r) return;
+      const a = n % this.slabPageSplats, l = Math.min(t - s, this.slabPageSplats - a);
+      this.degenerateRange(r, a, l), s += l;
+    }
+  }
+  /**
+   * Draws exactly the first `resident` slots: pages below the boundary are
+   * fully active, the page containing it is partially active, the rest are
+   * inactive. Freed tail slots simply leave the active list; they are also
+   * degenerated (see {@link degenerateSlabSlots}) so that even a slot drawn by
+   * mistake shows nothing.
+   */
+  setSlabResident(e) {
+    for (let t = 0; t < this.slabPages.length; t++) {
+      const s = Math.min(
+        this.slabPageSplats,
+        Math.max(0, e - t * this.slabPageSplats)
+      );
+      this.setRangeActivePrefix(this.slabPages[t], s);
+    }
+  }
+  /** Typed post to the frontier worker. */
+  postToWorker(e, t = []) {
+    var s;
+    (s = this.frontierWorker) == null || s.postMessage(e, t);
+  }
+  /**
+   * Applies a new decoded-chunk allowance from the scene's shared
+   * {@link ChunkCacheBudget}.
+   *
+   * Only the cap moves; nothing is dropped here. Both cache implementations
+   * evict lazily against it - the page-table worker inside its next
+   * `reschedule`, against a frontier that is still current, and the classic
+   * path in `evictChunks` on the next tick. Dropping chunks synchronously would
+   * pull them out from under resident splats.
+   *
+   * `pageTableCacheAtLimit` is recomputed here rather than waiting for the next
+   * plan, so a *raised* allowance re-arms the background sweep on this tick
+   * instead of one idle interval later.
+   */
+  applyCacheAllowance(e) {
+    this.disposed || e !== this.cacheLimitBytes && (this.cacheLimitBytes = e, this.frontierWorker ? this.postToWorker({ type: "cacheBudget", cpuCacheBytes: e }) : this.cpuCacheBytes = e, this.fetchCountsValue.cacheLimitBytes = e, this.pageTableCacheAtLimit = this.fetchCountsValue.cacheBytes >= e, this.pendingWork = !0);
+  }
+  /**
+   * Whether this scene ships collision meshes - true for an XGRIDS `.lcc` /
+   * `.lcc2` dataset that carries them, false for a Streamed SOG scene, which
+   * has none.
+   */
+  get hasCollisionMeshes() {
+    var e;
+    return (((e = this.scene.collision) == null ? void 0 : e.meshes.length) ?? 0) > 0;
+  }
+  /**
+   * Fetches and parses this scene's collision geometry: the triangle meshes an
+   * XGRIDS `.lcc` (`collision.lci`) or `.lcc2` (`data/mesh/*.ply`) capture
+   * ships beside its splats, for hosts that want collision, ground probes or
+   * other spatial queries.
+   *
+   * The geometry is source-local, like {@link StreamedScene.bounds} - apply
+   * this mesh's `matrixWorld` to put it in the frame the splats render in.
+   * VLAM! builds no acceleration structure over it and never consults it.
+   *
+   * Tiles are fetched once and cached; concurrent callers share one load, and
+   * a failed load can be retried by calling again. Resolves `[]` for a scene
+   * without collision.
+   *
+   * @throws a `DOMException` named `AbortError` if cancelled, or if
+   * {@link dispose} is called while the load is in flight.
+   */
+  async loadCollisionMeshes(e = {}) {
+    var r;
+    (r = e.signal) == null || r.throwIfAborted();
+    const t = this.scene.collision;
+    if (!t || t.meshes.length === 0) return [];
+    if (!this.collisionTiles) {
+      const a = new AbortController();
+      this.collisionAbort = a, this.collisionTiles = import("./formats/lcc.js").then(
+        ({ loadCollisionMeshTiles: l }) => l(t, {
+          ...this.requestOptions ? { request: this.requestOptions } : {},
+          signal: a.signal
+        })
+      ).catch((l) => {
+        throw this.collisionTiles = void 0, l;
+      });
+    }
+    const { signal: s } = e;
+    if (!s) return this.collisionTiles;
+    let n;
+    try {
+      return await Promise.race([
+        this.collisionTiles,
+        new Promise((a, l) => {
+          n = () => l(Ke(s)), s.addEventListener("abort", n, { once: !0 });
+        })
+      ]);
+    } finally {
+      n && s.removeEventListener("abort", n);
+    }
+  }
+  /**
+   * Whether this scene ships an always-resident environment/background tile -
+   * true for an XGRIDS `.lcc2` capture that carries one (its `env.sog` sky),
+   * false for Streamed SOG, `.lcc`, `.rad`, or an `.lcc2` without one.
+   */
+  get hasEnvironment() {
+    return this.envFile !== void 0;
+  }
+  /** Whether the environment tile is currently set to render. */
+  get environmentEnabled() {
+    return this.envEnabled;
+  }
+  /**
+   * Splats in the environment tile, measured when it decoded - the manifest
+   * does not carry the count. 0 until the tile has loaded (or if the scene
+   * ships none). These sit outside the LOD budget, drawing from the pool's
+   * capacity headroom.
+   */
+  get environmentSplatCount() {
+    return this.envSplatCount;
+  }
+  /**
+   * Shows or hides the scene's environment/background tile. The switch is
+   * instant and never refetches: once loaded, the tile stays in the pool and
+   * only its active flag flips. Enabling before the tile has loaded triggers
+   * its (one-time) load on the next update. No-op on a scene without one.
+   */
+  setEnvironmentEnabled(e) {
+    this.envFile === void 0 || e === this.envEnabled || (this.envEnabled = e, this.envHandle !== void 0 ? this.setRangeActive(this.envHandle, e) : e && (this.pendingWork = !0, this.lastScheduleTime = -1 / 0));
+  }
+  /** The active-splat budget this mesh keeps within. */
+  get budget() {
+    return this.budgetValue;
+  }
+  /**
+   * The ceiling {@link setBudget} clamps to - {@link StreamedSplatMeshOptions.maxBudget}
+   * when one was given, otherwise the construction budget.
+   *
+   * The pool was allocated for this number and cannot grow, so it is a hard
+   * limit on what any governor can hand this mesh. Read it to check that a
+   * shared-budget setup can actually deliver the share it is computing.
+   */
+  get maxBudget() {
+    return this.maximumBudget;
+  }
+  /** Alias used by hosts that manage static and streamed auto-LOD uniformly. */
+  get budgetCeiling() {
+    return this.maximumBudget;
+  }
+  /**
+   * The capture's real content size, when the format declares it (`.rad` reports
+   * its leaf count) - the splat count needed to hold this mesh at full
+   * resolution, independent of the budget it was constructed with.
+   *
+   * A host splitting one budget across several streamed meshes should clamp each
+   * share to this: a mesh cannot spend more than it contains, so budget handed
+   * past it buys nothing and is better given to a mesh that can use it. Note it
+   * is *not* `maxBudget`: a foveated `.rad` reports `maxResidentSplats` as the
+   * requested budget, because its pool holds a camera-directed resident set
+   * rather than the whole tree.
+   *
+   * `undefined` when the format does not declare a content size.
+   */
+  get contentSplatCount() {
+    return this.scene.contentSplatCount;
+  }
+  /**
+   * The drawn-splat target currently driving the `.rad` page-table frontier -
+   * the governed budget, capped by
+   * {@link SplatMeshOptions.foveationDrawBudget}. `0` on a mesh that is not in
+   * `foveationMode: 'page-table'`, which has no frontier to target.
+   *
+   * This is the number that decides how deep the traversal descends, so it is
+   * what to watch when checking that a near mesh really did receive more
+   * detail: {@link budget} is the pool's allowance, this is what is spent.
+   */
+  get drawBudget() {
+    return this.frontierWorker ? this.pageTableDrawBudget : 0;
+  }
+  /**
+   * Spark's per-mesh `lodScale` (see {@link StreamedSplatMeshOptions.lodScale}).
+   * Mutable: raise it to sharpen a focused mesh, lower it to coarsen a
+   * background one. Page-table `.rad` only.
+   *
+   * @throws {RangeError} if set to a value that is not positive and finite.
+   */
+  get lodScale() {
+    return this.lodScaleValue;
+  }
+  set lodScale(e) {
+    const t = ce(e);
+    t !== this.lodScaleValue && (this.lodScaleValue = t, this.pendingWork = !0, this.lastScheduleTime = -1 / 0);
+  }
+  /** In `page-table` mode the slab is fully active but mostly degenerate, so the
+   * base `activeSplatCount` (slab size) is not the on-screen count - report the
+   * frontier's drawn size instead. */
+  get activeSplatCount() {
+    return this.frontierWorker ? this.pageTableDrawn : super.activeSplatCount;
+  }
+  /**
+   * Updates the LOD budget used for future scheduling within allocated capacity.
+   *
+   * @returns the budget actually in effect, which is `budget` clamped to
+   * {@link maxBudget}. A `BudgetGovernor` reads this return value to detect a
+   * capped member and hand the remainder to the others, so the clamp is
+   * reported rather than hidden.
+   */
+  setBudget(e) {
+    const t = Math.min(W(e), this.maximumBudget);
+    return t === this.budgetValue ? this.budgetValue : (this.budgetValue = t, this.scene.source.budget = t, this.frontierWorker && (this.pageTableDrawBudget = Math.min(t, this.pageTableDrawTarget), this.syncSlabPages(this.pageTableDrawBudget), this.pageTableDrawTargetExplicit && this.pageTableDrawTarget < t && !this.warnedDrawTargetCap && (this.warnedDrawTargetCap = !0, P(
+      `StreamedSplatMesh: budget raised to ${t} but foveationDrawBudget caps the drawn frontier at ${this.pageTableDrawTarget}; the extra budget cannot buy detail. Raise or drop foveationDrawBudget to let the shared budget through.`
+    ))), this.pendingWork = !0, this.lastScheduleTime = -1 / 0, t);
+  }
+  /**
+   * What the LOD scheduler last decided, or `undefined` on sources that do not
+   * schedule by leaf (the `.rad` page table, prefix readers).
+   *
+   * Distinct from {@link activeSplatCount}, and the distinction is the whole
+   * point: `desired` is what the scheduler asked for, `activeSplatCount` is
+   * what the pool ended up drawing. Equal means the cut is applied; `desired`
+   * far below the budget means the *scheduler* declined to spend it, which is a
+   * different bug from the mesh failing to apply what it was given.
+   */
+  get lodStats() {
+    return this.scene.source.stats;
+  }
+  /** Number of chunk files currently decoded and held. In page-table mode the
+   * worker owns the cache - the main-thread map is always empty there, so report
+   * what has been forwarded to it instead of a permanent zero. */
+  get residentChunkCount() {
+    return this.frontierWorker ? this.pageTableCachedFiles.size : this.cache.size;
+  }
+  /** Chunk fetches currently in flight. */
+  get pendingChunkCount() {
+    return this.fetching.size;
+  }
+  /**
+   * Main-thread cost of applying paging plans in `foveationMode: 'page-table'`.
+   *
+   * A plan is applied whole, off the render loop's own timing, so its cost does
+   * not appear in {@link getUpdateTimings} - but it lands on the same thread and
+   * a churning frontier can make it the largest stall in a frame. `worst*`
+   * accumulate over the mesh's lifetime; the rest describe the most recent plan.
+   */
+  get planTimings() {
+    return this.planTimingsValue;
+  }
+  /**
+   * Lifetime chunk-fetch totals by kind, plus page-table cache state.
+   *
+   * Diagnostic for the question "why is this still streaming after the view
+   * settled?", which the three fetch sources answer differently and which no
+   * other reading distinguishes:
+   *
+   * - **`sweep` climbing** - speculative file-order pre-warming of the whole
+   *   capture. Declined by the `smooth` profile; see `sweepAllowed`.
+   * - **`priority` / `base` climbing while `evicted` climbs too** - the
+   *   frontier's touched set does not fit the worker cache, so chunks are
+   *   evicted and immediately refetched. Streaming never ends because it cannot.
+   * - **`priority` / `base` climbing with `evicted` flat** - ordinary refinement
+   *   still converging on the cut; it should stop on its own.
+   *
+   * `uncovered` and `retiredEarly` answer a different question - "why are there
+   * holes?" - and between them cover both ways this class can render nothing
+   * where it should render something:
+   *
+   * - **`uncovered` climbing after the scene settles** - `substituteCoverage`
+   *   wanted a leaf's coarsest level as a stand-in and its chunk was not
+   *   cached. Expected briefly during initial load; afterwards it should not
+   *   move, because the coarsest files are pinned against eviction.
+   * - **`retiredEarly` climbing** - coverage was retired before its replacement
+   *   landed, under pool pressure or past the retirement hold bound. This is
+   *   the swap path rather than the substitute path, and it is the one that
+   *   scales with the budget.
+   *
+   * Both are counted in whole leaves/groups, monotonically: they answer "did
+   * this happen, and is it still happening", not "how much is missing now".
+   */
+  get fetchCounts() {
+    return this.fetchCountsValue;
+  }
+  /** Chunk files given up on after repeated fetch/decode failures. */
+  get failedChunkCount() {
+    return this.failedFiles.size;
+  }
+  /**
+   * Forgets all permanent chunk failures so their regions are fetched again.
+   * Failures are otherwise terminal for the mesh's lifetime - call this when
+   * the cause was transient (e.g. connectivity restored, `online` event).
+   */
+  retryFailedChunks() {
+    this.failedFiles.size !== 0 && (this.failedFiles.clear(), this.retrying.clear(), this.pendingWork = !0);
+  }
+  /**
+   * Whether the scene is still resolving toward its target detail - chunks
+   * are fetching, or a retry/append is pending. Goes false once the view
+   * has settled (useful to drive a loading indicator).
+   */
+  get isStreaming() {
+    return this.pendingWork || this.fetching.size > 0 || this.retrying.size > 0;
+  }
+  /** The LOD distance model (mutable; e.g. raise to force the finest level). */
+  get lodBaseDistance() {
+    return this.scene.source.lodBaseDistance;
+  }
+  set lodBaseDistance(e) {
+    this.scene.source.lodBaseDistance = e, this.pendingWork = !0;
+  }
+  update(e, t, s = {}) {
+    const n = performance.now();
+    e.updateMatrixWorld(), this.updateWorldMatrix(!0, !1);
+    const r = Le(e, t);
+    this.frontierWorker && (r ? this.pageTableViewportY = r.height : (t.getDrawingBufferSize(Se), this.pageTableViewportY = Se.y));
+    const a = (r == null ? void 0 : r.head) ?? e, l = this.shouldReschedule(a, n) ? this.reschedule(a, n) : null;
+    if (super.update(e, t, s), l && this.onPerformanceEvent) {
+      const c = this.getUpdateTimings();
+      l.cpuMs += performance.now() - l.timestamp, l.activeListMs = c.activeListMs, l.uploadMs = c.uploadMs, l.sortSubmitMs = c.sortSubmitMs, l.stagingTextureAllocations = c.stagingTextureAllocations, l.activeListUpdateRanges = c.activeListUpdateRanges, this.onPerformanceEvent(l);
+    }
+  }
+  /** Root bounds of the whole scene, valid before any chunk has loaded. */
+  computeSplatBounds() {
+    return this.scene.bounds.clone();
+  }
+  /**
+   * Enables or disables writing each resident run's **resolved** LOD level into
+   * the `lodLevel` float channel (for a false-color debug modifier: 0 = finest).
+   * Values come from applied desired runs after budget resolution - not from
+   * distance ambition alone. Call before assigning a modifier that reads the channel.
+   */
+  setLodLevelDebug(e) {
+    if (e) {
+      this.lodLevelChannelReady || (this.defineChannel("lodLevel", { type: "float", fill: -1 }), this.lodLevelChannelReady = !0), this.lodLevelDebug = !0;
+      for (const { run: t, handle: s } of this.resident.values())
+        this.writeLodLevelChannel(s, t.level);
+      for (const { run: t, handle: s, uploadedCount: n } of this.staged.values())
+        n === t.count && this.writeLodLevelChannel(s, t.level);
+      return;
+    }
+    this.lodLevelDebug = !1;
+  }
+  /** Whether {@link setLodLevelDebug} is currently writing levels. */
+  get isLodLevelDebug() {
+    return this.lodLevelDebug;
+  }
+  /**
+   * Startup-hold progress for {@link StreamedSplatMeshOptions.initialReveal}.
+   * Hosts using `'hold-near-l0'` or `'hold-coverage'` should keep the mesh
+   * invisible while `status === 'pending'`, then reveal on `'ready'` or
+   * `'degraded'`.
+   */
+  get initialRevealState() {
+    return this.initialRevealStateValue;
+  }
+  /**
+   * Captures a fresh startup-hold set on the next {@link update}. Hosts that
+   * apply their final initial camera pose after the mesh first receives frames
+   * should call this before lifting their loading cover. It is a no-op when
+   * the hold was never armed (progressive startup, or a format without the
+   * matching LodSource hook).
+   */
+  recaptureInitialReveal() {
+    this.initialRevealHold !== "off" && (this.frozenCriticalRuns = null, this.initialRevealStartedAt = void 0, this.initialRevealPhase = "capture", this.initialRevealStateValue = {
+      status: "pending",
+      stagedSplats: 0,
+      totalSplats: 0,
+      readyGroups: 0,
+      totalGroups: 0
+    }, this.pendingWork = !0);
+  }
+  writeLodLevelChannel(e, t) {
+    !this.lodLevelDebug || e.count === 0 || ((!this.lodLevelScratch || this.lodLevelScratch.length < e.count) && (this.lodLevelScratch = new Float32Array(e.count)), this.lodLevelScratch.fill(t, 0, e.count), this.writeChannel(e, "lodLevel", this.lodLevelScratch.subarray(0, e.count)));
+  }
+  /**
+   * Declares a per-splat channel whose values **persist across LOD churn**:
+   * edits are stored sparsely keyed by `(chunk file, local index)` - a stable
+   * splat identity in the streaming design - and re-applied whenever a chunk
+   * is (re)appended. Paint a region with {@link paintPersistent}, orbit away
+   * until it is evicted, come back, and the values return. See M7.6.
+   *
+   * Wraps {@link SplatMesh.defineChannel}; read it from a modifier with
+   * `ctx.channel(name)` as usual.
+   */
+  definePersistentChannel(e, t = {}) {
+    this.defineChannel(e, t), this.persistentChannels.set(e, {
+      type: t.type ?? "float",
+      fill: t.fill ?? 0,
+      maxEdits: Math.max(1, Math.floor(t.maxEdits ?? 1e6)),
+      edits: /* @__PURE__ */ new Map(),
+      total: 0,
+      warned: !1
+    });
+  }
+  /**
+   * Sets a persistent channel to `value` for every currently-resident splat
+   * within `radius` (world units) of `worldPoint`, and records the edit so it
+   * survives eviction/reload. Splats whose chunk is not currently decoded on
+   * the CPU cannot be located and are skipped (they are usually far from the
+   * camera); their painted neighbours in resident chunks are unaffected.
+   *
+   * The radius assumes this mesh's world transform is rigid (rotation +
+   * translation, as the built-in format transforms are); a scaled mesh would
+   * distort the brush. Edit a persistent channel only through this method -
+   * direct {@link SplatMesh.writeChannel} writes are not recorded and are
+   * overwritten by the next re-apply.
+   *
+   * @returns the number of splats edited this call.
+   * @throws {Error} if the channel was not declared with
+   *   {@link definePersistentChannel}.
+   */
+  paintPersistent(e, t, s, n) {
+    const r = this.persistentChannels.get(e);
+    if (!r)
+      throw new Error(
+        `StreamedSplatMesh.paintPersistent: channel "${e}" is not a persistent channel. Call definePersistentChannel("${e}") first.`
+      );
+    V.copy(t), this.worldToLocal(V);
+    const a = s * s;
+    let l = 0;
+    const c = /* @__PURE__ */ new Set();
+    for (const { run: h } of this.resident.values()) {
+      const f = this.cache.get(h.file);
+      if (!f) continue;
+      const u = f.data.positions, g = r.edits.get(h.file) ?? /* @__PURE__ */ new Map();
+      let v = !1;
+      for (let m = 0; m < h.count; m++) {
+        const b = h.offset + m, T = u[b * 3 + 0] - V.x, I = u[b * 3 + 1] - V.y, y = u[b * 3 + 2] - V.z;
+        if (!(T * T + I * I + y * y > a) && !g.has(b)) {
+          if (r.total >= r.maxEdits) {
+            r.warned || (r.warned = !0, P(
+              `StreamedSplatMesh.paintPersistent: channel "${e}" hit its maxEdits cap (${r.maxEdits}); further new edits are dropped.`
+            ));
+            continue;
+          }
+          r.total++, g.set(b, n), v = !0, l++;
+        }
+      }
+      v && (r.edits.set(h.file, g), c.add(h.file));
+    }
+    if (c.size > 0)
+      for (const { run: h, handle: f } of this.resident.values())
+        c.has(h.file) && this.applyPersistentRun(e, r, h, f);
+    return l;
+  }
+  /**
+   * Clears every stored edit for a persistent channel and zeroes the value on
+   * all currently-resident splats. Chunks that are not resident are covered by
+   * the emptied store - they reload at the channel's fill value.
+   *
+   * @throws {Error} if the channel is not a persistent channel.
+   */
+  clearPersistentChannel(e) {
+    const t = this.persistentChannels.get(e);
+    if (!t)
+      throw new Error(
+        `StreamedSplatMesh.clearPersistentChannel: channel "${e}" is not a persistent channel.`
+      );
+    t.edits.clear(), t.total = 0;
+    for (const { run: s, handle: n } of this.resident.values()) {
+      const r = t.type === "byte" ? new Uint8Array(s.count) : new Float32Array(s.count);
+      this.writeChannel(n, e, r);
+    }
+  }
+  dispose() {
+    var e, t, s, n, r;
+    if (!this.disposed) {
+      this.loader.dispose(), this.frontierWorker && (this.frontierWorker.onmessage = null, this.frontierWorker.terminate()), this.pageTableDisposed = !0, (e = this.collisionAbort) == null || e.abort(), (t = this.collisionTiles) == null || t.catch(() => {
+      }), this.collisionTiles = void 0;
+      for (const { controller: a } of this.fetching.values()) a.abort();
+      if (this.fetching.clear(), this.fetchHandle && ((s = this.fetchScheduler) == null || s.unregister(this.fetchHandle)), this.cacheBudgetHandle) {
+        const a = this.cacheBudgetHandle;
+        this.cacheBudgetHandle = void 0, (n = this.cacheBudget) == null || n.unregister(a);
+      }
+      (r = this.localSource) == null || r.dispose(), this.localSource = void 0, this.cache.clear(), this.cacheBytesTotal = 0, this.retrying.clear(), this.failedFiles.clear(), this.neededFiles.clear(), this.persistentChannels.clear(), this.resident.clear(), this.staged.clear(), this.pageTableCachedFiles.clear(), this.envHandle = void 0, this.envSplatCount = 0, super.dispose();
+    }
+  }
+  shouldReschedule(e, t) {
+    if (this.pendingWork || t - this.lastScheduleTime > ft) return !0;
+    e.getWorldPosition(pe);
+    const s = this.scene.bounds.getBoundingSphere(wt).radius || 1;
+    return pe.distanceTo(this.lastCameraPos) > s * 25e-4 ? !0 : (e.getWorldQuaternion(me), me.angleTo(this.lastCameraQuat) > 87e-4);
+  }
+  reschedule(e, t) {
+    var L;
+    const s = performance.now();
+    let n = null;
+    if (this.onPerformanceEvent !== void 0) {
+      n = { resident: /* @__PURE__ */ new Map(), staged: /* @__PURE__ */ new Map() };
+      for (const [p, S] of this.resident) n.resident.set(p, S.run.count);
+      for (const [p, S] of this.staged) n.staged.set(p, S.uploadedCount);
+    }
+    const r = this.compactionCount;
+    if (this.pendingWork = !1, this.lastScheduleTime = t, e.getWorldPosition(this.lastCameraPos), e.getWorldQuaternion(this.lastCameraQuat), x.copy(this.lastCameraPos), this.worldToLocal(x), ve.multiplyMatrices(e.projectionMatrix, e.matrixWorldInverse).multiply(this.matrixWorld), z.setFromProjectionMatrix(ve), this.frontierWorker) {
+      e.getWorldDirection(B).add(this.lastCameraPos), this.worldToLocal(B), B.sub(x).normalize();
+      const p = e.projectionMatrix.elements[5] * this.pageTableViewportY / 2;
+      if (p > 0 && (this.pageTableLimit = this.pageTableTargetPx / p), this.reschedulePageTable(x, B, z, t), this.onPerformanceEvent === void 0) return null;
+      const S = performance.now();
+      return {
+        timestamp: S,
+        cpuMs: S - s,
+        activeListMs: 0,
+        uploadMs: 0,
+        sortSubmitMs: 0,
+        stagingTextureAllocations: 0,
+        activeListUpdateRanges: 0,
+        appendedCount: 0,
+        removedCount: 0,
+        stagedCount: 0,
+        uploadCount: 0,
+        activeCount: this.pageTableDrawn,
+        forcedSort: !1,
+        compacted: !1
+      };
+    }
+    e.getWorldDirection(B).add(this.lastCameraPos), this.worldToLocal(B), B.sub(x).normalize();
+    const a = this.scene.source.computeDesiredRuns(
+      x,
+      z,
+      t,
+      B
+    ), l = this.captureOrContinueInitialReveal(
+      a,
+      t,
+      x,
+      z
+    ), c = l !== null, h = l ?? a, f = /* @__PURE__ */ new Map(), u = /* @__PURE__ */ new Set();
+    for (const p of h)
+      f.set(C(p), p), u.add(p.file);
+    for (const [p, S] of this.staged)
+      f.has(p) || c && ((L = this.frozenCriticalRuns) != null && L.some((M) => C(M) === p)) || (this.removeRange(S.handle), this.staged.delete(p));
+    for (const [p, { controller: S }] of this.fetching)
+      !u.has(p) && !this.scene.pinnedFiles.has(p) && S.abort();
+    for (const p of this.retrying.keys())
+      !u.has(p) && !this.scene.pinnedFiles.has(p) && this.retrying.delete(p);
+    this.neededFiles.clear();
+    for (const p of h) {
+      const S = C(p);
+      if (this.resident.has(S)) continue;
+      const M = this.staged.get(S);
+      M && M.uploadedCount === p.count || this.neededFiles.add(p.file);
+    }
+    this.envFile !== void 0 && this.envEnabled && this.envHandle === void 0 && !this.envUnfit && !this.failedFiles.has(this.envFile) && this.neededFiles.add(this.envFile);
+    const g = h.filter((p) => !this.resident.has(C(p))), v = c ? [] : [...this.resident.entries()].filter(([p]) => !f.has(p)), m = c ? (
+      // Mesh is invisible during the hold, so L0 cell-atomicity (no holes) is
+      // irrelevant - commit each frozen slice as it lands so a partial home
+      // cell cannot block reveal behind sibling subchunks still fetching.
+      _e(g)
+    ) : ze(g, v), b = !c && Oe(m);
+    m.sort(
+      (p, S) => b ? Ue(p, S) : re(p) - re(S)
+    );
+    const T = /* @__PURE__ */ new Map();
+    this.updateEnvironment(t, T);
+    let I = 0, y = !1, A = !1, R = !1;
+    for (const p of m) {
+      if (!b && p.removes.length > 0 && y) {
+        if (this.neverRetireCoverageEarly || !A && this.retireHeldTicks < dt) {
+          this.pendingWork = !0, R = !0;
+          continue;
+        }
+        this.fetchCountsValue.retiredEarly++;
+      }
+      if (p.adds.length === 0) {
+        this.applyGroup(p, t);
+        continue;
+      }
+      const S = p.adds.filter((E) => !this.cache.has(E.file)), M = c || Ye(p) && this.initialRevealHold !== "hold-coverage";
+      if (S.length > 0) {
+        let E = !1;
+        for (const k of S)
+          this.failedFiles.has(k.file) || (oe(
+            T,
+            k.file,
+            qe(k, this.scene.source.lodBaseDistance),
+            k
+          ), E = !0);
+        if (c || this.substituteCoverage(p, t, T, M), E && (this.pendingWork = !0, y = !0), !c) continue;
+      }
+      if (c && this.environmentPendingForReveal()) {
+        this.pendingWork = !0, y = !0;
+        continue;
+      }
+      if ((c || this.stagedSwapsEnabled && p.addCount > this.appendCap) && this.canStageGroup(p)) {
+        const E = this.stageGroup(p, t, Math.max(0, this.appendCap - I));
+        if (I += E, !p.adds.every((k) => {
+          var ie;
+          return ((ie = this.staged.get(C(k))) == null ? void 0 : ie.uploadedCount) === k.count;
+        })) {
+          this.pendingWork = !0, y = !0;
+          continue;
+        }
+        if (E > 0 && !c) {
+          this.deferNextSortRequest(), this.pendingWork = !0, y = !0;
+          continue;
+        }
+        this.commitStagedGroup(p);
+        continue;
+      }
+      if (!c && I > 0 && I + p.addCount > this.appendCap) {
+        this.pendingWork = !0, y = !0;
+        continue;
+      }
+      if (c) {
+        this.pendingWork = !0, y = !0;
+        continue;
+      }
+      if (!this.applyGroup(p, t)) {
+        this.pendingWork = !0, A = !0;
+        continue;
+      }
+      I += p.addCount;
+    }
+    return this.flushClassicFetches(T, this.scene.source.lodBaseDistance, c), this.retireHeldTicks = R ? this.retireHeldTicks + 1 : 0, c && (this.finishInitialRevealIfComplete(), this.initialRevealPhase === "holding" && (this.pendingWork = !0)), this.fetchCountsValue.cacheBytes = this.cacheBytesTotal, this.fetchCountsValue.cacheLimitBytes = this.cpuCacheBytes, this.cacheBytesTotal > this.cpuCacheBytes && (this.fetchCountsValue.cacheFull = !0), this.evictChunks(t), n === null ? null : this.createPerformanceEvent(
+      n.resident,
+      n.staged,
+      r,
+      s
+    );
+  }
+  rowAlignedSplats(e) {
+    return Math.ceil(e / F) * F;
+  }
+  /**
+   * Startup hold seeds: the coverage group containing (or nearest to) the
+   * camera within {@link LodSource.lodBaseDistance}. HiRes tiles often fail the
+   * frustum test when most of the cell sits behind the camera - do **not**
+   * require `inView`, or the hold seeds a screen-facing neighbour instead.
+   * Coarser home levels come from {@link LodSource.runsAtLevelFor}.
+   */
+  selectHomeSeedRuns(e) {
+    var r;
+    const t = this.scene.source.lodBaseDistance, s = e.filter(
+      (a) => a.coverageGroup !== void 0 && (a.distance ?? Number.POSITIVE_INFINITY) <= t
+    ).sort(
+      (a, l) => (a.distance ?? Number.POSITIVE_INFINITY) - (l.distance ?? Number.POSITIVE_INFINITY) || // Same distance: prefer in-view, then finer.
+      (a.inView === !0 ? 0 : 1) - (l.inView === !0 ? 0 : 1) || a.level - l.level || a.leafStart - l.leafStart
+    ), n = (r = s[0]) == null ? void 0 : r.coverageGroup;
+    return n === void 0 ? [] : s.filter((a) => a.coverageGroup === n);
+  }
+  coarsenHomeRuns(e, t) {
+    var r;
+    const s = [], n = this.scene.source;
+    for (const a of e) {
+      if (a.level === t) {
+        s.push(a);
+        continue;
+      }
+      const l = ((r = n.runsAtLevelFor) == null ? void 0 : r.call(n, a.leafStart, a.leafEnd, t)) ?? [];
+      if (l.length !== 0)
+        for (const c of l)
+          s.push({
+            ...c,
+            distance: a.distance,
+            inView: a.inView,
+            ...a.coverageGroup === void 0 ? {} : { coverageGroup: a.coverageGroup },
+            ...a.screenImportance === void 0 ? {} : { screenImportance: a.screenImportance }
+          });
+    }
+    return s;
+  }
+  criticalRunsFitCapacity(e) {
+    let t = 0;
+    for (const s of e) t += this.rowAlignedSplats(s.count);
+    return t <= this.freeSplatCapacity;
+  }
+  publishInitialRevealProgress(e) {
+    const t = /* @__PURE__ */ new Map();
+    for (const l of e) {
+      const c = l.coverageGroup !== void 0 ? `g:${l.coverageGroup}` : C(l);
+      let h = t.get(c);
+      h || (h = [], t.set(c, h)), h.push(l);
+    }
+    let s = 0, n = 0, r = 0;
+    for (const l of t.values()) {
+      let c = !0;
+      for (const h of l) {
+        n += h.count;
+        const f = C(h);
+        if (this.resident.has(f)) {
+          s += h.count;
+          continue;
+        }
+        const u = this.staged.get(f);
+        s += (u == null ? void 0 : u.uploadedCount) ?? 0, (!u || u.uploadedCount !== h.count) && (c = !1);
+      }
+      c && r++;
+    }
+    const a = this.initialRevealStateValue;
+    if (a.status === "degraded") {
+      this.initialRevealStateValue = {
+        status: "degraded",
+        reason: a.reason,
+        stagedSplats: s,
+        totalSplats: n,
+        readyGroups: r,
+        totalGroups: t.size
+      };
+      return;
+    }
+    this.initialRevealStateValue = {
+      status: "pending",
+      stagedSplats: s,
+      totalSplats: n,
+      readyGroups: r,
+      totalGroups: t.size
+    };
+  }
+  releaseInitialReveal(e, t) {
+    const s = this.frozenCriticalRuns ?? [];
+    this.publishInitialRevealProgress(s);
+    const n = this.initialRevealStateValue, r = n.status === "pending" || n.status === "degraded" ? n.stagedSplats : 0, a = n.status === "pending" || n.status === "degraded" ? n.totalSplats : 0, l = n.status === "pending" || n.status === "degraded" ? n.readyGroups : 0, c = n.status === "pending" || n.status === "degraded" ? n.totalGroups : 0;
+    e === "ready" ? this.initialRevealStateValue = { status: "ready" } : this.initialRevealStateValue = {
+      status: "degraded",
+      reason: t ?? "fetch-failed",
+      stagedSplats: r,
+      totalSplats: a,
+      readyGroups: l,
+      totalGroups: c
+    }, this.frozenCriticalRuns = null, this.initialRevealPhase = "released", this.pendingWork = !0;
+  }
+  /**
+   * `.lcc2` coverage hold: freeze coarsest covering runs for in-view cells.
+   * Missing `coverageRunsFor` (or an empty result after fallback) releases
+   * immediately so the mesh does not stay hidden with nothing to fetch.
+   */
+  captureCoverageHold(e, t, s) {
+    var r, a;
+    const n = ((a = (r = this.scene.source).coverageRunsFor) == null ? void 0 : a.call(r, e, t)) ?? [];
+    if (n.length === 0) {
+      if (this.environmentPendingForReveal()) {
+        this.frozenCriticalRuns = [], this.initialRevealStartedAt = s, this.initialRevealPhase = "holding", this.publishInitialRevealProgress([]);
+        return;
+      }
+      this.initialRevealStateValue = { status: "ready" }, this.initialRevealPhase = "released";
+      return;
+    }
+    if (!this.criticalRunsFitCapacity(n)) {
+      this.frozenCriticalRuns = n, this.releaseInitialReveal("degraded", "capacity");
+      return;
+    }
+    this.frozenCriticalRuns = n, this.initialRevealStartedAt = s, this.initialRevealPhase = "holding", this.publishInitialRevealProgress(n);
+  }
+  captureOrContinueInitialReveal(e, t, s, n) {
+    if (this.initialRevealPhase === "off" || this.initialRevealPhase === "released") return null;
+    if (this.initialRevealPhase === "capture")
+      if (this.initialRevealHold === "hold-coverage")
+        this.captureCoverageHold(s, n, t);
+      else {
+        const r = this.selectHomeSeedRuns(e);
+        let a = [];
+        if (r.length === 0) {
+          const l = this.scene.source.lodBaseDistance * this.scene.source.lodMultiplier * this.scene.source.lodMultiplier, c = e.filter(
+            (f) => f.level <= 2 && f.coverageGroup !== void 0 && (f.distance ?? Number.POSITIVE_INFINITY) <= l
+          ), h = [...c].sort(
+            (f, u) => (f.distance ?? Number.POSITIVE_INFINITY) - (u.distance ?? Number.POSITIVE_INFINITY) || (f.inView === !0 ? 0 : 1) - (u.inView === !0 ? 0 : 1) || (f.screenImportance ?? Number.POSITIVE_INFINITY) - (u.screenImportance ?? Number.POSITIVE_INFINITY) || f.leafStart - u.leafStart
+          )[0];
+          if (!h)
+            return this.initialRevealStateValue = { status: "ready" }, this.initialRevealPhase = "released", null;
+          if (a = h.coverageGroup !== void 0 ? c.filter((f) => f.coverageGroup === h.coverageGroup) : [h], this.criticalRunsFitCapacity(a) || (a = h.coverageGroup !== void 0 ? c.filter(
+            (f) => f.coverageGroup === h.coverageGroup && this.criticalRunsFitCapacity([f])
+          ).slice(0, 1) : c.filter((f) => this.criticalRunsFitCapacity([f])).slice(0, 1)), a.length === 0 || !this.criticalRunsFitCapacity(a))
+            return this.frozenCriticalRuns = a.length > 0 ? a : [h], this.releaseInitialReveal("degraded", "capacity"), null;
+          this.frozenCriticalRuns = a, this.initialRevealStartedAt = t, this.initialRevealPhase = "holding", this.publishInitialRevealProgress(a);
+        } else {
+          for (const l of [0, 1, 2]) {
+            const c = this.coarsenHomeRuns(r, l);
+            if (c.length !== 0) {
+              if (this.criticalRunsFitCapacity(c)) {
+                a = c;
+                break;
+              }
+              a = c;
+            }
+          }
+          if (a.length === 0)
+            return this.initialRevealStateValue = { status: "ready" }, this.initialRevealPhase = "released", null;
+          if (!this.criticalRunsFitCapacity(a))
+            return this.frozenCriticalRuns = a, this.releaseInitialReveal("degraded", "capacity"), null;
+          this.frozenCriticalRuns = a, this.initialRevealStartedAt = t, this.initialRevealPhase = "holding", this.publishInitialRevealProgress(a);
+        }
+      }
+    if (this.initialRevealPhase !== "holding" || !this.frozenCriticalRuns) return null;
+    if (this.initialRevealStartedAt !== void 0 && t - this.initialRevealStartedAt >= ct)
+      return this.releaseInitialReveal("degraded", "timeout"), null;
+    for (const r of this.frozenCriticalRuns)
+      if (this.failedFiles.has(r.file) && !this.resident.has(C(r))) {
+        const a = this.staged.get(C(r));
+        if (!a || a.uploadedCount !== r.count)
+          return this.releaseInitialReveal("degraded", "fetch-failed"), null;
+      }
+    return this.publishInitialRevealProgress(this.frozenCriticalRuns), this.frozenCriticalRuns;
+  }
+  /** After staging/commits, release the hold when every frozen run is resident. */
+  finishInitialRevealIfComplete() {
+    this.initialRevealPhase !== "holding" || !this.frozenCriticalRuns || (this.publishInitialRevealProgress(this.frozenCriticalRuns), !this.environmentPendingForReveal() && this.frozenCriticalRuns.every((e) => this.resident.has(C(e))) && this.releaseInitialReveal("ready"));
+  }
+  /**
+   * Startup hold still needs the environment tile when the scene ships one
+   * and it starts enabled. Failed / unfit / disabled tiles do not block reveal.
+   */
+  environmentPendingForReveal() {
+    return this.envFile !== void 0 && this.envEnabled && !this.envUnfit && this.envHandle === void 0 && !this.failedFiles.has(this.envFile);
+  }
+  /** Creates a performance event for a changed streamed-LOD tick, if any. */
+  createPerformanceEvent(e, t, s, n) {
+    let r = 0, a = 0;
+    for (const [u, g] of this.resident)
+      a += g.run.count, e.has(u) || (r += g.run.count);
+    let l = 0;
+    for (const [u, g] of e)
+      this.resident.has(u) || (l += g);
+    let c = 0;
+    for (const [u, g] of this.staged)
+      c += Math.max(0, g.uploadedCount - (t.get(u) ?? 0));
+    const h = this.compactionCount !== s;
+    if (r === 0 && l === 0 && c === 0 && !h) return null;
+    const f = performance.now();
+    return {
+      timestamp: f,
+      cpuMs: f - n,
+      activeListMs: 0,
+      uploadMs: 0,
+      sortSubmitMs: 0,
+      stagingTextureAllocations: 0,
+      activeListUpdateRanges: 0,
+      appendedCount: r,
+      removedCount: l,
+      stagedCount: c,
+      uploadCount: r + c,
+      activeCount: a,
+      forcedSort: a === 0 || r + l >= a * ht,
+      compacted: h
+    };
+  }
+  /** Returns whether all new rows can coexist with the currently visible region. */
+  canStageGroup(e) {
+    return e.adds.filter((s) => !this.staged.has(C(s))).reduce((s, n) => s + this.rowAlignedSplats(n.count), 0) <= this.freeSplatCapacity;
+  }
+  /**
+   * Uploads a bounded part of a replacement without rendering it.
+   * Skips runs whose chunks are not yet cached so siblings can stage out of order.
+   */
+  stageGroup(e, t, s) {
+    if (s <= 0) return 0;
+    let n = 0;
+    for (const r of e.adds) {
+      const a = C(r), l = this.cache.get(r.file);
+      if (!l) continue;
+      let c = this.staged.get(a);
+      if (!c) {
+        let f;
+        try {
+          f = this.reserveInactiveRange(r.count);
+        } catch {
+          this.compactionCount++, this.compact();
+          try {
+            f = this.reserveInactiveRange(r.count);
+          } catch {
+            this.pendingWork = !0;
+            break;
+          }
+        }
+        c = { run: r, handle: f, uploadedCount: 0 }, this.staged.set(a, c);
+      }
+      if (c.uploadedCount === r.count) continue;
+      const h = Math.min(r.count - c.uploadedCount, s - n);
+      if (h <= 0) break;
+      if (this.writeInactiveRange(
+        c.handle,
+        K(l.data, r.offset + c.uploadedCount, h),
+        c.uploadedCount
+      ), c.uploadedCount += h, l.lastUsed = t, n += h, c.uploadedCount === r.count) {
+        this.writeLodLevelChannel(c.handle, r.level);
+        for (const [f, u] of this.persistentChannels)
+          this.applyPersistentRun(f, u, r, c.handle);
+      }
+      if (n >= s) break;
+    }
+    return n;
+  }
+  /** Switches a fully staged region from old to new visibility in one tick. */
+  commitStagedGroup(e) {
+    for (const t of e.adds) {
+      const s = this.staged.get(C(t));
+      if (!s || s.uploadedCount !== t.count)
+        throw new Error("StreamedSplatMesh: incomplete staged group commit.");
+    }
+    for (const [t, s] of e.removes)
+      this.resident.has(t) && (this.removeRange(s.handle), this.resident.delete(t));
+    for (const t of e.adds) {
+      const s = C(t), n = this.staged.get(s);
+      this.setRangeActive(n.handle, !0), this.resident.set(s, n), this.staged.delete(s);
+    }
+  }
+  /**
+   * Applies one swap group atomically within this tick: removals first
+   * (freeing pool rows for the replacements), then all adds. Returns false
+   * without touching anything when the group cannot fit even after its own
+   * removals - the caller defers it and the old runs keep rendering.
+   */
+  applyGroup(e, t) {
+    const s = (a) => Math.ceil(a / F) * F, n = e.adds.reduce((a, l) => a + s(l.count), 0), r = e.removes.reduce((a, [, l]) => a + s(l.run.count), 0);
+    if (n > this.freeSplatCapacity + r) return !1;
+    for (const [a, l] of e.removes)
+      this.resident.has(a) && (this.removeRange(l.handle), this.resident.delete(a));
+    for (const a of e.adds)
+      this.appendRun(a, t);
+    return !0;
+  }
+  /** Appends one run from the cache, compacting the pool on fragmentation. */
+  appendRun(e, t) {
+    const s = this.cache.get(e.file);
+    if (!s) return;
+    const n = K(s.data, e.offset, e.count);
+    let r;
+    try {
+      r = this.appendRange(n);
+    } catch {
+      this.compactionCount++, this.compact();
+      try {
+        r = this.appendRange(n);
+      } catch {
+        this.pendingWork = !0;
+        return;
+      }
+    }
+    this.resident.set(C(e), { run: e, handle: r }), s.lastUsed = t, this.writeLodLevelChannel(r, e.level);
+    for (const [a, l] of this.persistentChannels)
+      this.applyPersistentRun(a, l, e, r);
+  }
+  /**
+   * Writes the stored edits for one run's `[offset, offset + count)` splats
+   * into its freshly appended pool range. No-op when the file has no edits.
+   */
+  applyPersistentRun(e, t, s, n) {
+    const r = t.edits.get(s.file);
+    if (!r || r.size === 0) return;
+    const a = t.type === "byte" ? new Uint8Array(s.count) : new Float32Array(s.count);
+    t.fill && a.fill(t.fill);
+    let l = !1;
+    for (let c = 0; c < s.count; c++) {
+      const h = r.get(s.offset + c);
+      h !== void 0 && (a[c] = h, l = !0);
+    }
+    l && this.writeChannel(n, e, a);
+  }
+  /**
+   * Covers a deferred group's leaves that no resident run covers with each
+   * leaf's coarsest (pinned, hence cached) level, so a region waiting on a
+   * fetch shows coarse detail instead of nothing. The substitutes are
+   * intentionally not "desired": the next reschedule swaps them for the
+   * real level once its chunk has arrived.
+   *
+   * Near-camera refinements (`distance <= lodBaseDistance`) skip the coarse
+   * paint and its pin fetch entirely - cold load requests only the target cut
+   * for that cell. Far gaps keep the shell.
+   */
+  substituteCoverage(e, t, s, n) {
+    const r = e.leafEnd - e.leafStart;
+    (this.coverageScratch === void 0 || this.coverageScratch.length < r) && (this.coverageScratch = new Uint8Array(r));
+    const a = this.coverageScratch;
+    a.fill(0, 0, r);
+    for (const { run: h } of this.resident.values()) {
+      const f = Math.max(h.leafStart, e.leafStart), u = Math.min(h.leafEnd, e.leafEnd);
+      u > f && a.fill(1, f - e.leafStart, u - e.leafStart);
+    }
+    const l = a.subarray(0, r);
+    let c = 0;
+    for (; c < r; ) {
+      const h = l.indexOf(0, c);
+      if (h < 0) break;
+      const f = l.indexOf(1, h), u = f < 0 ? r : f, g = e.leafStart + h, v = e.leafStart + u;
+      for (const m of this.scene.source.coarsestRunsFor(g, v))
+        if (!this.resident.has(C(m))) {
+          if (n) {
+            this.fetchCountsValue.uncovered += Math.min(m.leafEnd, v) - Math.max(m.leafStart, g);
+            continue;
+          }
+          if (!this.cache.has(m.file)) {
+            oe(
+              s,
+              m.file,
+              je(m, this.scene.source.lodBaseDistance),
+              m
+            ), this.fetchCountsValue.uncovered += Math.min(m.leafEnd, v) - Math.max(m.leafStart, g);
+            continue;
+          }
+          for (const [b, T] of this.resident)
+            T.run.leafStart < m.leafEnd && T.run.leafEnd > m.leafStart && (this.removeRange(T.handle), this.resident.delete(b));
+          this.appendRun(m, t);
+        }
+      c = u;
+    }
+  }
+  /** Issues pending classic-path chunk wants in group-priority order. */
+  flushClassicFetches(e, t, s = !1) {
+    if (e.size === 0) return;
+    $e(e, t, s);
+    const n = [...e.entries()].sort(
+      (r, a) => X(r[1], a[1], r[0], a[0])
+    );
+    this.preemptClassicFetches(n);
+    for (const [r, a] of n) this.requestChunk(r, a.kind, a);
+  }
+  /**
+   * A camera turn must not wait for all eight old visible requests to finish.
+   * Only classic requests carry a precise rank; page-table work retains its
+   * own scheduler and is never cancelled here.
+   */
+  preemptClassicFetches(e) {
+    var t;
+    for (const [s, n] of e) {
+      if (this.cache.has(s) || this.fetching.has(s)) continue;
+      let r, a;
+      for (const [l, c] of this.fetching)
+        c.classicWant && (!a || X(c.classicWant, a, l, r) > 0) && (r = l, a = c.classicWant);
+      if (a && r !== void 0 && X(n, a, s, r) < 0 && ((t = this.fetching.get(r)) == null || t.controller.abort()), this.fetching.size >= this.maxInflight) return;
+    }
+  }
+  /**
+   * Loads the always-resident environment tile once, on the first update after
+   * it is wanted. The tile has no LOD ladder and no manifest count, so it is
+   * appended whole (measuring its splat count at decode) and thereafter toggled
+   * by flipping its pool range active - never scheduled, refetched, or evicted.
+   * When `pending` is supplied, a miss is ranked as an `'environment'` want so
+   * it issues ahead of LOD coverage.
+   */
+  updateEnvironment(e, t) {
+    const s = this.envFile;
+    if (s === void 0 || this.envHandle !== void 0 || !this.envEnabled || this.envUnfit)
+      return;
+    const n = this.cache.get(s);
+    if (!n) {
+      this.failedFiles.has(s) || (t ? this.enqueueEnvironmentFetch(t, s) : this.requestChunk(s, "priority"), this.pendingWork = !0);
+      return;
+    }
+    const r = Math.ceil(n.data.count / F) * F;
+    if (r > this.capacity) {
+      this.envUnfit = !0, P(
+        `the environment tile (${n.data.count} splats) exceeds the pool capacity (${this.capacity}); it will not be shown. Raise the splat budget to fit it.`
+      );
+      return;
+    }
+    if (r > this.freeSplatCapacity) {
+      this.pendingWork = !0;
+      return;
+    }
+    let a;
+    try {
+      a = this.appendRange(n.data);
+    } catch {
+      this.compactionCount++, this.compact();
+      try {
+        a = this.appendRange(n.data);
+      } catch {
+        this.pendingWork = !0;
+        return;
+      }
+    }
+    this.envHandle = a, this.envSplatCount = n.data.count, n.lastUsed = e;
+  }
+  /** Ranks the env tile ahead of every LOD want in {@link flushClassicFetches}. */
+  enqueueEnvironmentFetch(e, t) {
+    e.has(t) || e.set(t, {
+      kind: "priority",
+      phase: "environment",
+      distance: 0,
+      level: 0,
+      inView: !0,
+      coverageGroup: -1,
+      leafStart: 0,
+      leafEnd: 0,
+      screenImportance: Number.NEGATIVE_INFINITY,
+      groupDistance: 0,
+      groupPending: 1,
+      groupInView: !0,
+      groupScreenImportance: Number.NEGATIVE_INFINITY,
+      groupFinest: !0,
+      groupId: "environment",
+      groupClass: 0
+    });
+  }
+  /**
+   * Page-table reschedule (`foveationMode: 'page-table'`): posts the camera to the
+   * worker, which owns the cache + traversal + pager and replies asynchronously
+   * with a paging plan. Coalesced to one outstanding request so the main thread
+   * never blocks. Also drives chunk fetching, in priority order.
+   */
+  reschedulePageTable(e, t, s, n) {
+    for (const a of this.pageTableFetchPriority) this.requestChunk(a, "priority");
+    const r = new Set(this.pageTableFetchPriority);
+    for (const a of this.scene.source.computeDesiredRuns(e, s, n))
+      r.add(a.file), this.requestChunk(a.file, "base");
+    for (const [a, l] of this.fetching)
+      l.kind !== "sweep" && !r.has(a) && !this.scene.pinnedFiles.has(a) && l.controller.abort();
+    if (!this.pageTableCacheAtLimit && this.sweepAllowed()) {
+      const a = Math.max(1, this.maxInflight - mt), l = this.scene.chunkUrls.length;
+      for (let c = 0; c < l && this.fetching.size < a; c++)
+        this.pageTableCachedFiles.has(c) || this.requestChunk(c, "sweep");
+    }
+    this.pageTableInFlight || (this.pageTableInFlight = !0, this.postToWorker({
+      type: "reschedule",
+      seq: ++this.pageTableSeq,
+      cameraLocal: [e.x, e.y, e.z],
+      cameraForward: [t.x, t.y, t.z],
+      ...this.pageTableFoveation,
+      // Spark's cut is `pixel_scale × lodScale ≤ limit`, and the traversal only
+      // ever sees one side of that - so scaling the limit down by `lodScale` is
+      // the same comparison, with no protocol change.
+      limit: this.pageTableLimit / this.lodScaleValue,
+      budget: this.pageTableDrawBudget
+    }));
+  }
+  /**
+   * Applies a paging plan from the worker to the slab - fast memcpy writes only,
+   * no traversal or gather on the main thread - then fetches the chunks the
+   * frontier wants next, and reschedules again if chunks are still streaming.
+   */
+  applyFrontierPlan(e) {
+    if (this.pageTableInFlight = !1, this.pageTableDisposed || this.slabPages.length === 0) return;
+    const t = this.pagerSlots;
+    e.capacity !== t && (this.pendingWork = !0, this.lastScheduleTime = -1 / 0);
+    const s = performance.now(), n = e.moveSlots;
+    for (let u = 0; u < n.length; ) {
+      let g = 1;
+      for (; u + g < n.length && n[u + g] === n[u] + g; )
+        g++;
+      const v = n[u], m = Math.min(g, t - v);
+      m > 0 && this.writeSlabSlots(yt(e.moves, u, m), v, m), u += g;
+    }
+    if (e.appends.count > 0) {
+      const u = Math.min(e.appends.count, t - e.appendStart);
+      u > 0 && this.writeSlabSlots(e.appends, e.appendStart, u);
+    }
+    const r = performance.now(), a = Math.min(e.residentCount, t);
+    this.setSlabResident(a);
+    const l = Math.min(e.degenerateStart, t), c = Math.min(e.degenerateCount, t - l);
+    c > 0 && this.degenerateSlabSlots(l, c);
+    const h = performance.now();
+    this.pageTableDrawn = a, e.gatherMissing > 0 && P(
+      `StreamedSplatMesh: page-table plan gathered ${e.gatherMissing} splats from evicted chunks; they render as holes.`
+    );
+    const f = this.planTimingsValue;
+    if (f.applyMs = h - s, f.writeMs = r - s, f.residentMs = h - r, f.moves = e.moveSlots.length, f.appends = e.appends.count, f.applyMs > f.worstApplyMs && (f.worstApplyMs = f.applyMs, f.worstSplats = f.moves + f.appends), this.frontierBandBase !== null && e.solvedLimit > 0 && this.pageTableLimit > 0) {
+      const u = Math.min(1, e.solvedLimit / this.pageTableLimit);
+      this.setScreenRadiusBand(
+        this.frontierBandBase.min * u,
+        this.frontierBandBase.max * u
+      );
+    }
+    this.invalidateSort(), e.dropped > 0 && P(
+      `StreamedSplatMesh: page-table slab full, dropped ${e.dropped} frontier splats (draw budget ${this.pageTableDrawBudget} exceeds the pool).`
+    );
+    for (let u = 0; u < e.evicted.length; u++)
+      this.pageTableCachedFiles.delete(e.evicted[u]);
+    this.fetchCountsValue.cacheBytes = e.cacheBytes, this.fetchCountsValue.cacheLimitBytes = e.cacheLimitBytes, this.pageTableCacheAtLimit = e.cacheBytes >= e.cacheLimitBytes, e.evicted.length > 0 && (this.fetchCountsValue.cacheFull = !0, this.fetchCountsValue.evicted += e.evicted.length), this.pageTableFetchPriority = Array.from(e.touched);
+    for (const u of this.pageTableFetchPriority) this.requestChunk(u, "priority");
+    (this.fetching.size > 0 || !e.converged) && (this.pendingWork = !0, e.converged || (this.lastScheduleTime = -1 / 0));
+  }
+  /** Forwards a decoded chunk's arrays to the worker (buffers transferred) so the
+   * worker's cache/traversal/gather can use it. */
+  forwardChunkToWorker(e, t) {
+    const s = t.radTree;
+    if (!s) return;
+    this.pageTableCachedFiles.add(e);
+    const n = this.shBands > 0 ? t.shPacked : void 0;
+    this.postToWorker(
+      {
+        type: "chunk",
+        file: e,
+        count: t.count,
+        positions: t.positions,
+        colors: t.colors,
+        covariances: t.covariances,
+        childCount: s.childCount,
+        childStart: s.childStart,
+        size: s.size,
+        shBands: (n == null ? void 0 : n.bands) ?? 0,
+        ...n ? { shPacked: n.packed, shRange: n.range } : {}
+      },
+      [
+        t.positions.buffer,
+        t.colors.buffer,
+        t.covariances.buffer,
+        s.childCount.buffer,
+        s.childStart.buffer,
+        s.size.buffer,
+        ...n ? [n.packed.buffer] : []
+      ]
+    );
+  }
+  /** Parallel chunk fetches. HTTP/2 multiplexes them; on HTTP/1.1 the browser's
+   * per-host cap simply queues. Same cap for classic and page-table so near
+   * detail is not structurally starved on the non-page-table path. */
+  get maxInflight() {
+    return ut;
+  }
+  /**
+   * Whether this mesh may run its speculative background sweep. A mesh with no
+   * weight is hidden or suspended; a mesh with no `fetchWeight` at all is a
+   * host that never asked for arbitration, and keeps the old behaviour.
+   */
+  /**
+   * Sets this mesh's share of the scene's fetch bandwidth, as
+   * {@link StreamedSplatMeshOptions.fetchWeight} does at load.
+   *
+   * The weight normally closes over the mesh itself (`() =>
+   * governor.weightOf(mesh)`), which a host cannot express until `load`
+   * resolves - hence a setter as well as an option. Pass `undefined` to go back
+   * to unarbitrated sweeping.
+   */
+  setFetchWeight(e) {
+    this.fetchWeight = e;
+  }
+  sweepAllowed() {
+    if (this.performanceProfile === "smooth") return !1;
+    if (this.fetchWeight === void 0) return !0;
+    const e = this.fetchWeight();
+    return Number.isFinite(e) && e > 0;
+  }
+  /** Aborts in-flight fetches of one kind; their slots return through `finally`. */
+  abortFetches(e) {
+    for (const t of this.fetching.values())
+      t.kind === e && t.controller.abort();
+  }
+  requestChunk(e, t, s) {
+    var l, c;
+    if (this.cache.has(e) || this.pageTableCachedFiles.has(e) || this.fetching.has(e) || this.fetching.size >= this.maxInflight || this.failedFiles.has(e)) return;
+    const n = this.retrying.get(e);
+    if (n && performance.now() < n.readyAt) return;
+    this.fetchCountsValue[t]++;
+    const r = this.scene.chunkUrls[e];
+    if (r === void 0) {
+      P(`StreamedSplatMesh: manifest references unknown chunk file #${e}.`), this.failedFiles.add(e);
+      return;
+    }
+    if (this.fetchHandle && !((l = this.fetchScheduler) != null && l.tryAcquire(this.fetchHandle, t))) return;
+    const a = new AbortController();
+    this.fetching.set(e, { controller: a, kind: t, classicWant: s }), this.loader.load(r, {
+      kind: this.scene.chunkKind,
+      signal: a.signal,
+      ...(c = this.scene.chunkOptions) == null ? void 0 : c[e]
+    }).then((h) => {
+      var f, u;
+      this.disposed || (this.retrying.delete(e), (u = (f = this.scene.source).onChunkDecoded) == null || u.call(f, e, h), this.frontierWorker ? (this.forwardChunkToWorker(e, h), this.pendingWork = !0) : this.cacheChunk(e, h));
+    }).catch((h) => {
+      var u;
+      if (G(h)) return;
+      const f = (((u = this.retrying.get(e)) == null ? void 0 : u.attempts) ?? 0) + 1;
+      if (f >= gt)
+        this.retrying.delete(e), this.failedFiles.add(e), P(
+          `StreamedSplatMesh: gave up on chunk #${e} (${r}) after ${f} attempts.`,
+          h
+        );
+      else {
+        const g = pt * 2 ** (f - 1);
+        this.retrying.set(e, { attempts: f, readyAt: performance.now() + g });
+      }
+    }).finally(() => {
+      var h;
+      this.fetching.delete(e), this.fetchHandle && ((h = this.fetchScheduler) == null || h.release(this.fetchHandle)), this.pendingWork = !0;
+    });
+  }
+  /**
+   * Stores a decoded chunk while keeping {@link cacheBytesTotal} in step. The
+   * counter replaces a full-cache re-sum on every reschedule; every mutation
+   * of {@link cache} (this method, eviction, dispose's clear) maintains it.
+   */
+  cacheChunk(e, t) {
+    const s = this.cache.get(e);
+    s !== void 0 && (this.cacheBytesTotal -= s.bytes);
+    const n = Xe(t);
+    this.cache.set(e, { data: t, bytes: n, lastUsed: performance.now() }), this.cacheBytesTotal += n;
+  }
+  evictChunks(e) {
+    let t = this.cacheBytesTotal;
+    if (t <= this.cpuCacheBytes) return;
+    const s = [...this.cache.entries()].filter(
+      ([n, r]) => r.lastUsed !== e && !this.scene.pinnedFiles.has(n) && !this.neededFiles.has(n)
+    ).sort((n, r) => n[1].lastUsed - r[1].lastUsed);
+    for (const [n, r] of s) {
+      if (t <= this.cpuCacheBytes) break;
+      this.cache.delete(n), this.cacheBytesTotal -= r.bytes, t -= r.bytes, this.fetchCountsValue.evicted++;
+    }
+  }
+}
+const V = new w.Vector3(), pe = new w.Vector3(), me = new w.Quaternion(), x = new w.Vector3(), ve = new w.Matrix4(), z = new w.Frustum(), wt = new w.Sphere(), B = new w.Vector3(), Se = new w.Vector2();
+function be(o) {
+  return Math.ceil(3 * Ie(o) / 4);
+}
+function yt(o, i, e) {
+  const t = o.shPacked;
+  return {
+    count: e,
+    positions: o.positions.subarray(i * 3, (i + e) * 3),
+    colors: o.colors.subarray(i * 4, (i + e) * 4),
+    covariances: o.covariances.subarray(i * 6, (i + e) * 6),
+    ...t ? {
+      shPacked: {
+        ...t,
+        packed: t.packed.subarray(
+          i * be(t.bands),
+          (i + e) * be(t.bands)
+        )
+      }
+    } : {}
+  };
+}
+const Ct = 1;
+class Tt {
+  constructor(i = {}) {
+    d(this, "entries", /* @__PURE__ */ new Map());
+    d(this, "total");
+    d(this, "hysteresis");
+    this.total = W(i.totalBudget);
+    const e = i.hysteresis ?? 0.1;
+    if (!Number.isFinite(e) || e < 0)
+      throw new RangeError("BudgetGovernor hysteresis must be a non-negative finite number.");
+    this.hysteresis = e;
+  }
+  /** The shared budget currently being split across members. */
+  get totalBudget() {
+    return this.total;
+  }
+  /** Replaces the shared total and reallocates. */
+  setTotalBudget(i) {
+    const e = W(i);
+    e !== this.total && (this.total = e, this.reallocate());
+  }
+  /** Number of registered members. */
+  get size() {
+    return this.entries.size;
+  }
+  /**
+   * Adds a member and reallocates the shared budget. The member's current
+   * budget is remembered and restored when it leaves the governor.
+   *
+   * @param member - The mesh (or compatible object) to govern.
+   * @param options - `weight` (default `1`): the member's share is
+   * proportional to its weight - e.g. main mesh `7`, additional mesh `3` reproduces
+   * the old 0.7 host split. `0` registers the member suspended.
+   */
+  register(i, e = {}) {
+    if (this.entries.has(i))
+      throw new Error("BudgetGovernor: member is already registered.");
+    const t = J(e.weight ?? 1);
+    this.entries.set(i, {
+      member: i,
+      weight: t,
+      applied: i.budget,
+      restoreBudget: i.budget
+    }), this.reallocate();
+  }
+  /**
+   * Removes a member, restores the budget it had when it registered, and
+   * reallocates the total across the remaining members. No-op for a member
+   * that is not registered (so disposing hosts need not track membership).
+   */
+  unregister(i) {
+    const e = this.entries.get(i);
+    e !== void 0 && (this.entries.delete(i), e.member.setBudget(e.restoreBudget), this.reallocate());
+  }
+  /**
+   * Changes a member's priority weight and reallocates. `0` suspends the
+   * member (see the class doc); any positive weight resumes it.
+   */
+  setWeight(i, e) {
+    const t = this.entryOf(i), s = J(e);
+    s !== t.weight && (t.weight = s, this.reallocate());
+  }
+  /**
+   * Writes several weights, then reallocates **once**.
+   *
+   * Prefer this to a loop of {@link setWeight} whenever more than one weight
+   * changes together - as a camera-driven reweight does. Each reallocation
+   * pushes `setBudget` to every member, and for a streamed mesh that forces an
+   * LOD reschedule, so N separate calls cost N passes over the whole group to
+   * reach a state one pass would have produced.
+   *
+   * @param weights - `[member, weight]` pairs. Every member must be registered;
+   * unlisted members keep their current weight.
+   * @throws {Error} if any member is not registered - checked before anything
+   * is written, so a bad pair leaves every weight untouched.
+   * @throws {RangeError} if any weight is not a non-negative finite number.
+   */
+  setWeights(i) {
+    const e = [...i].map(
+      ([s, n]) => [this.entryOf(s), J(n)]
+    );
+    let t = !1;
+    for (const [s, n] of e)
+      s.weight !== n && (s.weight = n, t = !0);
+    t && this.reallocate();
+  }
+  /** The budget the governor last applied to a member, if registered. */
+  budgetOf(i) {
+    var e;
+    return (e = this.entries.get(i)) == null ? void 0 : e.applied;
+  }
+  /**
+   * Recomputes and applies every member's share. Called automatically by all
+   * mutators; call it manually only if a member's internal ceiling changed
+   * outside the governor's view.
+   */
+  reallocate() {
+    let i = [];
+    for (const t of this.entries.values())
+      t.weight === 0 ? this.applyTarget(t, Ct) : i.push(t);
+    let e = this.total;
+    for (; i.length > 0; ) {
+      const t = i.reduce((r, a) => r + a.weight, 0), s = [];
+      let n = 0;
+      for (const r of i) {
+        const a = Math.max(1, Math.floor(e * r.weight / t));
+        this.applyTarget(r, a) && (s.push(r), n += r.applied);
+      }
+      if (s.length === 0) break;
+      e = Math.max(0, e - n), i = i.filter((r) => !s.includes(r));
+    }
+  }
+  /**
+   * Restores every member's pre-registration budget and empties the governor.
+   * The governor itself stays usable (dispose is just "unregister everyone").
+   */
+  dispose() {
+    for (const i of this.entries.values())
+      i.member.setBudget(i.restoreBudget);
+    this.entries.clear();
+  }
+  /** The entry for a registered member, or a thrown error naming the problem. */
+  entryOf(i) {
+    const e = this.entries.get(i);
+    if (e === void 0)
+      throw new Error("BudgetGovernor: member is not registered.");
+    return e;
+  }
+  /**
+   * Pushes `target` to a member, with the grow dead-band. Returns true when
+   * the member clamped below its target (it is capped and cannot absorb more).
+   */
+  applyTarget(i, e) {
+    if (e > i.applied) {
+      if (e - i.applied <= this.hysteresis * i.applied) return !1;
+    } else if (e === i.applied)
+      return !1;
+    return i.applied = i.member.setBudget(e), i.applied < e;
+  }
+}
+function J(o) {
+  if (!Number.isFinite(o) || o < 0)
+    throw new RangeError(
+      "BudgetGovernor member weight must be a non-negative finite number (0 suspends the member)."
+    );
+  return o;
+}
+const we = new w.Vector3(), ye = new w.Matrix4(), Ce = new w.Frustum(), Z = new w.Box3(), O = new w.Sphere();
+class Ot {
+  constructor(i = {}) {
+    d(this, "entries", /* @__PURE__ */ new Map());
+    d(this, "budgetGovernor");
+    d(this, "minIntervalMs");
+    d(this, "weightDeadband");
+    d(this, "falloff");
+    d(this, "offScreenWeight");
+    d(this, "minWeight");
+    d(this, "maxWeight");
+    d(this, "lastUpdateAt", -1 / 0);
+    /** Set by membership/priority changes: the next update ignores both damps. */
+    d(this, "forceNext", !0);
+    if (this.budgetGovernor = i.governor ?? new Tt(i), this.minIntervalMs = N(i.minIntervalMs ?? 250, "minIntervalMs"), this.weightDeadband = N(i.weightDeadband ?? 0.15, "weightDeadband"), this.falloff = U(i.falloff ?? 1, "falloff"), this.offScreenWeight = U(i.offScreenWeight ?? 0.25, "offScreenWeight"), this.minWeight = U(i.minWeight ?? 0.05, "minWeight"), this.maxWeight = U(i.maxWeight ?? 8, "maxWeight"), this.maxWeight < this.minWeight)
+      throw new RangeError("CameraBudgetGovernor maxWeight must be >= minWeight.");
+  }
+  /** The governor this drives; use it for fixed-weight members and diagnostics. */
+  get governor() {
+    return this.budgetGovernor;
+  }
+  /** The shared total being split, from the underlying governor. */
+  get totalBudget() {
+    return this.budgetGovernor.totalBudget;
+  }
+  /** Replaces the shared total (e.g. the presenting budget on `sessionstart`). */
+  setTotalBudget(i) {
+    this.budgetGovernor.setTotalBudget(i);
+  }
+  /** Number of camera-weighted members. */
+  get size() {
+    return this.entries.size;
+  }
+  /**
+   * Adds a member, registers it with the underlying governor, and forces a
+   * reweight on the next {@link update}.
+   *
+   * @throws {Error} if the member is already registered here.
+   * @throws {RangeError} if `priority` or `fixedWeight` is invalid.
+   */
+  register(i, e = {}) {
+    if (this.entries.has(i))
+      throw new Error("CameraBudgetGovernor: member is already registered.");
+    const t = N(e.priority ?? 1, "priority"), s = e.fixedWeight === void 0 ? void 0 : N(e.fixedWeight, "fixedWeight"), n = s ?? t;
+    this.budgetGovernor.register(i, { weight: n }), this.entries.set(i, { member: i, priority: t, fixedWeight: s, applied: n }), this.forceNext = !0;
+  }
+  /**
+   * Removes a member from this helper and the underlying governor, restoring
+   * the budget it had when it joined. No-op for an unknown member.
+   */
+  unregister(i) {
+    this.entries.delete(i) && (this.budgetGovernor.unregister(i), this.forceNext = !0);
+  }
+  /**
+   * Changes a member's priority tier. Takes effect on the next {@link update},
+   * which is forced - a deliberate focus change should not wait out the
+   * interval or be swallowed by the dead-band.
+   *
+   * @throws {Error} if the member is not registered here.
+   * @throws {RangeError} if `priority` is negative or not finite.
+   */
+  setPriority(i, e) {
+    const t = this.entries.get(i);
+    if (t === void 0)
+      throw new Error("CameraBudgetGovernor: member is not registered.");
+    const s = N(e, "priority");
+    s !== t.priority && (t.priority = s, this.forceNext = !0);
+  }
+  /**
+   * Recomputes every member's weight from the camera and applies them in one
+   * batch. Call once per frame, after the scene graph is up to date.
+   *
+   * Needs no renderer: weights are a ratio, so viewport size cancels out.
+   *
+   * Skipped - returning `false` - when called inside `minIntervalMs` of the
+   * last reweight, or when no member's weight moved by more than
+   * `weightDeadband`. Membership and priority changes force it through both.
+   *
+   * @param camera - The view detail should follow. In an immersive session pass
+   * the head/`ArrayCamera`, not the idle application camera.
+   * @param now - Timestamp in ms on the `performance.now` clock; defaults to it.
+   * @returns whether weights were reapplied.
+   */
+  update(i, e = performance.now()) {
+    if (this.entries.size === 0) return !1;
+    const t = this.forceNext;
+    if (!t && e - this.lastUpdateAt < this.minIntervalMs) return !1;
+    i.updateMatrixWorld(), i.getWorldPosition(we), ye.multiplyMatrices(i.projectionMatrix, i.matrixWorldInverse), Ce.setFromProjectionMatrix(ye);
+    const s = [];
+    let n = !1;
+    for (const r of this.entries.values()) {
+      const a = this.weightFor(r);
+      s.push([r.member, a]), !n && this.isSignificant(r.applied, a) && (n = !0);
+    }
+    if (!t && !n) return !1;
+    this.budgetGovernor.setWeights(s);
+    for (const [r, a] of s) {
+      const l = this.entries.get(r);
+      l !== void 0 && (l.applied = a);
+    }
+    return this.lastUpdateAt = e, this.forceNext = !1, !0;
+  }
+  /** The weight currently written for a member, if registered here. */
+  weightOf(i) {
+    var e;
+    return (e = this.entries.get(i)) == null ? void 0 : e.applied;
+  }
+  /** The budget the underlying governor last applied to a member. */
+  budgetOf(i) {
+    return this.budgetGovernor.budgetOf(i);
+  }
+  /**
+   * Unregisters every member, restoring the budget each had when it joined.
+   * The helper stays usable afterwards. A governor passed in by the host keeps
+   * any members the host registered on it directly.
+   */
+  dispose() {
+    for (const i of [...this.entries.keys()]) this.budgetGovernor.unregister(i);
+    this.entries.clear(), this.lastUpdateAt = -1 / 0, this.forceNext = !0;
+  }
+  /**
+   * A member's weight: `priority × clamp((radius / distance) ^ falloff) ×
+   * offScreen`.
+   *
+   * `radius / distance` is the tangent of the member's half angular size - the
+   * same `size / distance` measure Spark's `pixel_scale` traversal ranks nodes
+   * by, one level up at whole-mesh granularity. Distance is measured to the
+   * bounding sphere's *surface*, so a large mesh is not penalized for having a
+   * distant center, and is floored so a camera inside the bounds saturates at
+   * `maxWeight` rather than dividing by zero.
+   */
+  weightFor(i) {
+    if (i.fixedWeight !== void 0) return i.fixedWeight;
+    const { member: e, priority: t } = i;
+    if (t === 0 || !(e.effectiveVisibility ?? e.visible)) return 0;
+    if (e.updateWorldMatrix(!0, !1), Z.copy(e.computeSplatBounds()), Z.isEmpty()) return t * this.minWeight;
+    Z.applyMatrix4(e.matrixWorld).getBoundingSphere(O);
+    const s = O.radius;
+    if (!(s > 0)) return t * this.minWeight;
+    const n = O.center.distanceTo(we) - s, r = Math.max(n, s * 1e-3, 1e-6), a = It((s / r) ** this.falloff, this.minWeight, this.maxWeight);
+    if (!Number.isFinite(a)) return t * this.minWeight;
+    const l = Ce.intersectsSphere(O) ? 1 : this.offScreenWeight;
+    return t * a * l;
+  }
+  /** Whether a weight moved enough to be worth a reallocation. */
+  isSignificant(i, e) {
+    return i === 0 || e === 0 ? i !== e : Math.abs(e - i) > this.weightDeadband * i;
+  }
+}
+function It(o, i, e) {
+  return Math.min(e, Math.max(i, o));
+}
+function N(o, i) {
+  if (!Number.isFinite(o) || o < 0)
+    throw new RangeError(`CameraBudgetGovernor ${i} must be a non-negative finite number.`);
+  return o;
+}
+function U(o, i) {
+  if (!Number.isFinite(o) || o <= 0)
+    throw new RangeError(`CameraBudgetGovernor ${i} must be a positive finite number.`);
+  return o;
+}
+const Rt = 16, Mt = 1;
+class Ut {
+  constructor(i = {}) {
+    d(this, "entries", /* @__PURE__ */ new Set());
+    d(this, "maxGlobalInflight");
+    d(this, "perMeshFloor");
+    d(this, "inflightCount", 0);
+    d(this, "disposed", !1);
+    this.maxGlobalInflight = Math.max(
+      1,
+      Math.floor(i.maxGlobalInflight ?? Rt)
+    ), this.perMeshFloor = Math.max(0, Math.floor(i.perMeshFloor ?? Mt));
+  }
+  /** Total slots granted and not yet released. */
+  get inflight() {
+    return this.inflightCount;
+  }
+  /** Meshes currently registered. */
+  get clientCount() {
+    return this.entries.size;
+  }
+  register(i) {
+    const e = { client: i, held: 0, demanding: !1, live: !0 };
+    return this.entries.add(e), e;
+  }
+  /**
+   * Drops a mesh. Slots it still holds are released here: a disposing mesh
+   * aborts its fetches, and those aborts land after the handle is gone.
+   */
+  unregister(i) {
+    const e = i;
+    this.entries.delete(e) && (e.live = !1, e.held > 0 && (this.inflightCount -= e.held, e.held = 0, this.wake()));
+  }
+  /**
+   * Grants a fetch slot, or denies and remembers the demand.
+   *
+   * A denial is not a failure and must not feed a mesh's retry backoff - the
+   * mesh simply did not fetch this tick, and will be woken (or reschedule on
+   * its own within the idle interval) to ask again.
+   */
+  tryAcquire(i, e) {
+    const t = i;
+    if (this.disposed || !t.live) return !1;
+    const s = H(t.client.weight());
+    return e === "sweep" && s <= 0 ? (t.demanding = !1, !1) : this.inflightCount >= this.maxGlobalInflight || t.held >= this.shareFor(t, s) ? (t.demanding = !0, !1) : (t.held++, t.demanding = !1, this.inflightCount++, !0);
+  }
+  /**
+   * Returns a slot. Must be called exactly once for every granted acquire -
+   * on success, on failure **and** on abort - or the pipe leaks capacity until
+   * the scene is torn down.
+   */
+  release(i) {
+    const e = i;
+    e.held <= 0 || (e.held--, this.inflightCount--, this.wake());
+  }
+  /**
+   * Re-examines weights after the camera moved. Call it once per frame, right
+   * after the budget governor's own update.
+   *
+   * Meshes that just lost all weight shed their pre-warming sweeps, so a focus
+   * change frees the pipe now rather than when a dozen far requests happen to
+   * finish.
+   */
+  weightsChanged() {
+    if (!this.disposed) {
+      for (const i of this.entries)
+        i.held > 0 && H(i.client.weight()) <= 0 && i.client.shedFetches("sweep");
+      this.wake();
+    }
+  }
+  /**
+   * Releases every registration. Meshes are not disposed - the scheduler is
+   * shared and does not own them, exactly as a shared `SplatPool` does not own
+   * its meshes.
+   */
+  dispose() {
+    this.disposed = !0;
+    for (const i of this.entries)
+      i.live = !1, i.held = 0, i.demanding = !1;
+    this.entries.clear(), this.inflightCount = 0;
+  }
+  /**
+   * The most slots this mesh may hold: its weight-proportional share of the
+   * *whole* pipe, floored so it can always trickle and capped so its siblings
+   * can always reach their own floors.
+   *
+   * This is a ceiling, not a reservation. The global cap does the real
+   * limiting, so a heavy mesh can use capacity its idle siblings are leaving on
+   * the table, while a far mesh's ceiling stays at its floor however early it
+   * asks - which is what keeps the first mesh to reschedule from taking the
+   * pipe and holding it. Dividing the *remainder* after every participant's
+   * floor instead would invert the whole point on a large scene: thirteen
+   * additional meshes and a main at floor 1 consume a 16-slot pipe entirely, leaving the
+   * focused mesh a smaller share than the far ones it is competing with.
+   *
+   * The denominator counts every mesh that plausibly wants the pipe - all
+   * registered meshes except those both weightless and idle, plus the caller.
+   */
+  shareFor(i, e) {
+    let t = 0, s = 0;
+    for (const l of this.entries) {
+      const c = l === i ? e : H(l.client.weight());
+      l !== i && c <= 0 && l.held === 0 && !l.demanding || (t++, s += c);
+    }
+    if (t <= 1) return this.maxGlobalInflight;
+    const n = s > 0 ? this.maxGlobalInflight * e / s : this.maxGlobalInflight / t, r = Math.max(1, this.perMeshFloor, Math.round(n)), a = Math.max(1, this.perMeshFloor) * (t - 1);
+    return Math.max(1, Math.min(r, this.maxGlobalInflight - a));
+  }
+  /** Pokes the heaviest mesh that was denied since its last grant. */
+  wake() {
+    if (this.disposed || this.inflightCount >= this.maxGlobalInflight) return;
+    let i = null, e = -1 / 0;
+    for (const t of this.entries) {
+      if (!t.demanding) continue;
+      const s = H(t.client.weight());
+      s > e && (i = t, e = s);
+    }
+    i && (i.demanding = !1, i.client.onSlotAvailable());
+  }
+}
+function H(o) {
+  return Number.isFinite(o) && o > 0 ? o : 0;
+}
+const Ft = 32 * 1024 * 1024, Bt = 250, Et = 0.15;
+class Ht {
+  constructor(i) {
+    d(this, "entries", /* @__PURE__ */ new Set());
+    d(this, "perMeshFloorBytes");
+    d(this, "minIntervalMs");
+    d(this, "deadband");
+    d(this, "totalBytesValue");
+    d(this, "lastAllocationMs", Number.NEGATIVE_INFINITY);
+    d(this, "disposed", !1);
+    if (!Number.isFinite(i.totalBytes) || i.totalBytes <= 0)
+      throw new RangeError("Chunk cache totalBytes must be a positive finite number.");
+    this.totalBytesValue = Math.floor(i.totalBytes), this.perMeshFloorBytes = Math.max(
+      0,
+      Math.floor(i.perMeshFloorBytes ?? Ft)
+    ), this.minIntervalMs = Math.max(0, i.minIntervalMs ?? Bt), this.deadband = Math.max(0, i.deadband ?? Et);
+  }
+  /** Bytes shared across every registered mesh. */
+  get totalBytes() {
+    return this.totalBytesValue;
+  }
+  /**
+   * Resizes the scene envelope and re-splits immediately. For a host reacting
+   * to a quality change or a device-memory signal.
+   */
+  setTotalBytes(i) {
+    if (!Number.isFinite(i) || i <= 0)
+      throw new RangeError("Chunk cache totalBytes must be a positive finite number.");
+    const e = Math.floor(i);
+    e !== this.totalBytesValue && (this.totalBytesValue = e, this.allocate());
+  }
+  /** Meshes currently registered. */
+  get clientCount() {
+    return this.entries.size;
+  }
+  /**
+   * Adds a mesh and re-splits at once, so the caller can read its opening
+   * allowance out of {@link allowanceFor} before posting worker init.
+   */
+  register(i) {
+    const e = { client: i, allowance: 0, live: !0 };
+    return this.entries.add(e), this.allocate({ force: !0, silentFor: e }), e;
+  }
+  /** Drops a mesh and hands its bytes back to the siblings. */
+  unregister(i) {
+    const e = i;
+    this.entries.delete(e) && (e.live = !1, e.allowance = 0, this.allocate({ force: !0 }));
+  }
+  /** This mesh's current allowance in bytes, or 0 once unregistered. */
+  allowanceFor(i) {
+    const e = i;
+    return e.live ? e.allowance : 0;
+  }
+  /**
+   * Re-splits after the camera moved. Call it once per frame, right beside
+   * {@link ChunkFetchScheduler.weightsChanged} - the two read the same weights,
+   * so cache and network follow the same measure.
+   *
+   * Rate-limited and dead-banded; calling it every frame is the intended use.
+   */
+  weightsChanged(i = Date.now()) {
+    this.disposed || i - this.lastAllocationMs < this.minIntervalMs || (this.lastAllocationMs = i, this.allocate());
+  }
+  /**
+   * Releases every registration. Meshes are not disposed - the budget is shared
+   * and does not own them, exactly as a shared `SplatPool` does not own its
+   * meshes.
+   */
+  dispose() {
+    this.disposed = !0;
+    for (const i of this.entries)
+      i.live = !1, i.allowance = 0;
+    this.entries.clear();
+  }
+  /**
+   * Cap-aware waterfill: weight-proportional shares, floored so every mesh can
+   * hold its coarse base, clamped at each mesh's `ceilingBytes`, and the surplus
+   * from clamped meshes redistributed over the rest until it settles.
+   *
+   * The invariant callers depend on is `Σ allowance <= totalBytes`. It holds in
+   * every branch, including the degenerate one where the floors alone exceed
+   * the envelope - there the floors are scaled down proportionally rather than
+   * silently overcommitting, because a budget that can be exceeded by
+   * registering more meshes is the bug this class exists to fix.
+   */
+  allocate(i = {}) {
+    if (this.disposed) return;
+    const e = [...this.entries];
+    if (e.length === 0) return;
+    const t = this.totalBytesValue, s = Math.min(this.perMeshFloorBytes, Math.floor(t / e.length)), n = /* @__PURE__ */ new Map(), r = new Set(e);
+    let a = t;
+    for (let l = 0; l <= e.length && r.size > 0; l++) {
+      const c = Math.max(0, a - s * r.size);
+      let h = 0;
+      for (const u of r) h += Te(u.client.weight());
+      const f = [];
+      for (const u of r) {
+        const g = Te(u.client.weight()), v = h > 0 ? c * g / h : c / r.size, m = kt(u.client.ceilingBytes), b = Math.floor(s + v);
+        b >= m ? (n.set(u, m), f.push(u)) : n.set(u, b);
+      }
+      if (f.length === 0) break;
+      for (const u of f)
+        r.delete(u), a -= n.get(u) ?? 0;
+      a = Math.max(0, a);
+    }
+    for (const l of e) {
+      const c = n.get(l) ?? 0, h = l.allowance;
+      l.allowance = c, l !== i.silentFor && (!i.force && !this.movedEnough(h, c) || h !== c && l.client.onAllowanceChanged(c));
+    }
+  }
+  /** Suppresses reposts for changes too small to alter any mesh's behaviour. */
+  movedEnough(i, e) {
+    return i === e ? !1 : i === 0 || e === 0 ? !0 : Math.abs(e - i) / i >= this.deadband;
+  }
+}
+function Te(o) {
+  return Number.isFinite(o) && o > 0 ? o : 0;
+}
+function kt(o) {
+  return Number.isFinite(o) && o > 0 ? Math.floor(o) : Number.MAX_SAFE_INTEGER;
+}
+export {
+  Tt as BudgetGovernor,
+  Ot as CameraBudgetGovernor,
+  Ht as ChunkCacheBudget,
+  Ut as ChunkFetchScheduler,
+  q as SplatLoadError,
+  Y as StreamedSplatMesh,
+  ot as createLocalDataset,
+  nt as httpDatasetSource,
+  G as isAbortError,
+  Be as resolveCpuCacheBytes
+};
+//# sourceMappingURL=streaming.js.map