@kalyptos/narcissus 0.1.3 → 0.2.1

package/dist/synthetic-BeGCzYIv.js

@@ -1,383 +0,0 @@
-import { F as e, L as t, f as n, h as r, k as i, m as a, r as o, v as s } from "./format-C3Vn0c2b.js";
-import { t as c } from "./ports-DZRKjdYD.js";
-//#region src/format/encode.ts
-var l = 5e-4, u = 2048, d = 256, f = (e, t, n) => Math.min(n, Math.max(t, e));
-function p(e, t, n) {
-	return n > t ? f(Math.round((e - t) / (n - t) * 255), 0, 255) : 0;
-}
-function m(e, t) {
-	return t > 0 ? f(Math.round(e / t * 127), -127, 127) : 0;
-}
-function h(e) {
-	return e &= 1023, e = (e | e << 16) & 50331903, e = (e | e << 8) & 50393103, e = (e | e << 4) & 51130563, (e | e << 2) & 153391689;
-}
-function g(e, t, n) {
-	return h(e >> 6) | h(t >> 6) << 1 | h(n >> 6) << 2;
-}
-function _(e, t) {
-	let n = /* @__PURE__ */ new Float32Array(9);
-	for (let r = 0; r < t; r++) for (let t = 0; t < 9; t++) n[t] = Math.max(n[t], Math.abs(e[r * 9 + t]));
-	return n;
-}
-function v(e, t, n) {
-	let r = new Int8Array(t * 9);
-	for (let i = 0; i < t; i++) for (let t = 0; t < 9; t++) r[i * 9 + t] = m(e[i * 9 + t], n[t]);
-	let i = (e) => r.subarray(e * 9, (e + 1) * 9), a = /* @__PURE__ */ new Map(), o = [], s = new Uint16Array(t);
-	for (let e = 0; e < t; e++) {
-		let t = i(e).join(), n = a.get(t);
-		n === void 0 && (n = o.length, a.set(t, n), o.push(e)), s[e] = n;
-	}
-	if (o.length > u) {
-		let e = o.length / d, n = Array.from({ length: d }, (t, n) => o[Math.floor(n * e)]);
-		o.splice(0, o.length, ...n);
-		for (let e = 0; e < t; e++) {
-			let t = Infinity;
-			for (let n = 0; n < d; n++) {
-				let i = 0;
-				for (let t = 0; t < 9; t++) i += (r[e * 9 + t] - r[o[n] * 9 + t]) ** 2;
-				i < t && (t = i, s[e] = n);
-			}
-		}
-	}
-	let c = new Int8Array(o.length * 9);
-	return o.forEach((e, t) => c.set(i(e), t * 9)), {
-		book: c,
-		labels: s
-	};
-}
-function y(n, r) {
-	let { count: i, position: a, rotation: s, scale: c, alpha: u, dc: d, sh: m } = n, h = [
-		Infinity,
-		Infinity,
-		Infinity
-	], y = [
-		-Infinity,
-		-Infinity,
-		-Infinity
-	], b = [...h], x = [...y], S = [...h], C = [...y];
-	for (let e = 0; e < i; e++) for (let t = 0; t < 3; t++) h[t] = Math.min(h[t], a[e * 3 + t]), y[t] = Math.max(y[t], a[e * 3 + t]), b[t] = Math.min(b[t], c[e * 3 + t]), x[t] = Math.max(x[t], c[e * 3 + t]), S[t] = Math.min(S[t], d[e * 3 + t]), C[t] = Math.max(C[t], d[e * 3 + t]);
-	let w = l * 2 ** r.g, T = Float32Array.from(h), E = Float32Array.from(h, (e, t) => Math.max(w, (y[t] - e) / 65535)), D = new Uint16Array(i * 3);
-	for (let e = 0; e < i; e++) for (let t = 0; t < 3; t++) {
-		let n = (a[e * 3 + t] - T[t]) / E[t];
-		D[e * 3 + t] = f(Math.round(n), 0, 65535);
-	}
-	let O = e * 2 ** r.g, k = (r.i + .5) * O, A = (r.j + .5) * O, j = new Uint8Array(i), M = new Float64Array(i);
-	for (let e = 0; e < i; e++) {
-		let t = +(a[e * 3] >= k), n = +(a[e * 3 + 1] >= A);
-		j[e] = t + 2 * n, M[e] = j[e] * 2 ** 30 + g(D[e * 3], D[e * 3 + 1], D[e * 3 + 2]);
-	}
-	let N = Uint32Array.from({ length: i }, (e, t) => t).sort((e, t) => M[e] - M[t]), P = [
-		0,
-		0,
-		0
-	];
-	for (let e = 1; e < 4; e++) P[e - 1] = j.filter((t) => t < e).length;
-	let F = m ? _(m, i) : /* @__PURE__ */ new Float32Array(9), { book: I, labels: L } = m ? v(m, i, F) : {
-		book: null,
-		labels: null
-	}, R = I ? I.length / 9 : 0, z = 17 + (R > 0 ? 2 : 0), B = new Uint8Array(128 + z * i + R * 9), V = new DataView(B.buffer);
-	V.setUint32(0, i, !0), P.forEach((e, t) => V.setUint32(4 + 4 * t, e, !0)), V.setUint16(16, R, !0), [
-		...T,
-		...E,
-		...b,
-		...x,
-		...S,
-		...C,
-		...F
-	].forEach((e, t) => V.setFloat32(20 + 4 * t, e, !0));
-	let H = (e) => 128 + e * i, U = new Float32Array([...h, ...y]), W = /* @__PURE__ */ new Float64Array(4), G = /* @__PURE__ */ new Float64Array(3), K = [
-		0,
-		0,
-		0
-	];
-	for (let e = 0; e < i; e++) {
-		let n = N[e];
-		for (let r = 0; r < 3; r++) {
-			let i = D[n * 3 + r] - K[r] << 16 >> 16, a = i < 0 ? -2 * i - 1 : 2 * i;
-			K[r] = D[n * 3 + r], B[H(t.position + 2 * r) + e] = a & 255, B[H(t.position + 2 * r + 1) + e] = a >> 8;
-		}
-		B[H(t.alpha) + e] = f(Math.round(u[n] * 255), 0, 255);
-		let r = Math.hypot(...s.subarray(n * 4, n * 4 + 4));
-		for (let e = 0; e < 4; e++) W[e] = s[n * 4 + e] / r;
-		let i = 0;
-		for (let e = 1; e < 4; e++) Math.abs(W[e]) > Math.abs(W[i]) && (i = e);
-		let l = W[i] < 0 ? -1 : 1;
-		B[H(t.rotationIndex) + e] = i;
-		for (let n = 0, r = 0; n < 4; n++) {
-			if (n === i) continue;
-			let a = Math.round((l * W[n] / Math.SQRT2 + .5) * 255);
-			B[H(t.rotation + r++) + e] = f(a, 0, 255);
-		}
-		for (let r = 0; r < 3; r++) B[H(t.scale + r) + e] = p(c[n * 3 + r], b[r], x[r]), B[H(t.dc + r) + e] = p(d[n * 3 + r], S[r], C[r]);
-		L && (B[H(t.label) + e] = L[n] & 255, B[H(t.label + 1) + e] = L[n] >> 8);
-		let [m, h, g] = [
-			0,
-			1,
-			2
-		].map((e) => Math.exp(c[n * 3 + e]));
-		o(W, m, h, g, G);
-		for (let e = 0; e < 3; e++) U[e] = Math.min(U[e], a[n * 3 + e] - G[e]), U[3 + e] = Math.max(U[3 + e], a[n * 3 + e] + G[e]);
-	}
-	return I && B.set(new Uint8Array(I.buffer), H(z)), {
-		payload: B,
-		row: {
-			g: r.g,
-			i: r.i,
-			j: r.j,
-			count: i,
-			quadrants: P,
-			box: U,
-			offset: 0,
-			length: 0
-		}
-	};
-}
-function b(e, t, n) {
-	e.setUint8(t, n.g), e.setUint8(t + 1, n.i), e.setUint8(t + 2, n.j), e.setUint32(t + 4, n.count, !0), n.quadrants.forEach((n, r) => e.setUint32(t + 8 + 4 * r, n, !0)), n.box.forEach((n, r) => e.setFloat32(t + 20 + 4 * r, n, !0)), e.setUint32(t + 44, n.offset, !0), e.setUint32(t + 48, n.length, !0);
-}
-function x(e, t, n) {
-	for (let r = 0; r < 4; r++) e[t + r] = n.charCodeAt(r);
-}
-function S(e) {
-	return Uint8Array.from({ length: 8 }, (t, n) => parseInt(e.slice(2 * n, 2 * n + 2), 16));
-}
-async function C(e, t) {
-	let n = await r(e), i = new Uint8Array(8 + n.length);
-	return x(i, 0, t), new DataView(i.buffer).setUint16(4, 1, !0), i.set(n, 8), i;
-}
-async function w(e) {
-	let { rows: t, children: n, descendants: r } = e, a = new Uint8Array(40 + t.length * 52 + n.length * 9 + r.length * 11), o = new DataView(a.buffer);
-	o.setUint8(0, e.level), o.setInt32(4, e.e, !0), o.setInt32(8, e.n, !0), a.set(S(e.pack), 12), o.setUint32(20, e.packSize, !0), e.col && a.set(S(e.col), 24), o.setUint16(32, t.length, !0), o.setUint8(34, n.length), o.setUint16(36, r.length, !0);
-	let s = 40;
-	for (let e of t) b(o, s, e), s += 52;
-	for (let e of n) o.setUint8(s, e.quadrant), a.set(S(e.idx), s + 1), s += 9;
-	for (let e of r) o.setUint8(s, e.depth), o.setUint8(s + 1, e.column), o.setUint8(s + 2, e.row), a.set(S(e.idx), s + 3), s += 11;
-	return C(a, i);
-}
-function T(e) {
-	let t = 3421674724, n = 2216829733;
-	for (let r = 0; r < e.length; r++) {
-		n = (n ^ e[r]) >>> 0;
-		let i = n * 435;
-		t = t * 435 + (n << 8 >>> 0) + Math.floor(i / 4294967296) >>> 0, n = i >>> 0;
-	}
-	return t.toString(16).padStart(8, "0") + n.toString(16).padStart(8, "0");
-}
-function E(e) {
-	return () => {
-		e = e + 1831565813 | 0;
-		let t = Math.imul(e ^ e >>> 15, 1 | e);
-		return t = t + Math.imul(t ^ t >>> 7, 61 | t) ^ t, ((t ^ t >>> 14) >>> 0) / 2 ** 32;
-	};
-}
-//#endregion
-//#region src/engine/stream/synthetic.ts
-var D = 128, O = 16384, k = Math.min(O, 2048, Math.max(256, Math.ceil(O / 12 / 64) * 64)), A = 128 + 19 * O + k * 9, j = 65535, M = 5, N = A + Math.ceil(A / j) * M, P = 12, F = .4, I = .6, L = 1.2, R = .15, z = .1, B = .04, V = [
-	[
-		12,
-		1 / 7e3,
-		0,
-		1 / 9e3,
-		.7
-	],
-	[
-		9,
-		1 / 2300,
-		1.1,
-		1 / 3100,
-		.4
-	],
-	[
-		6,
-		1 / 800,
-		.3,
-		1 / 1100,
-		2
-	],
-	[
-		3,
-		1 / 150,
-		.9,
-		1 / 210,
-		1.7
-	]
-], H = 30, U = V.reduce((e, [t, n, , r]) => e + t * (n + r), 0), W = Float32Array.from({ length: k * 9 }, (e, t) => {
-	let n = Math.floor(t / 9), r = t % 9, i = (n * (37 + 2 * r) + 11 * r) % 255 - 127;
-	return r === 0 && (i = n % 255 - 127), r === 1 && (i = 20 * Math.floor(n / 255) - 50), i / 127 * B;
-}), G = new TextEncoder(), K = {
-	version: 1,
-	crs: "synthetic",
-	height: "synthetic",
-	leaf: 250,
-	roots: [512e4, 6144e3].map((e) => ({
-		level: P,
-		e: 0,
-		n: e
-	})).map((e) => ({
-		...e,
-		idx: a(e, Y(e, "idx"), "idx")
-	})),
-	extent: {
-		e: [44e4, 9e5],
-		n: [605e4, 641e4],
-		h: [0, 80]
-	}
-}, ee = G.encode(JSON.stringify(K));
-function te() {
-	return async (e, t) => {
-		if (e.endsWith("world.json")) return J(ee, t);
-		let r = n(e), i = e.slice(e.lastIndexOf(".") + 1);
-		if (!r || i !== "idx" && i !== "pack" || !ne(r) || r.hash !== Y(r, i)) throw new c(`no file ${e}`);
-		return i === "idx" ? J(await ae(r), t) : oe(r, t, e);
-	};
-}
-function q(e, t) {
-	let n = H;
-	for (let [r, i, a, o, s] of V) n += r * Math.sin(i * e + a) * Math.sin(o * t + s);
-	return n;
-}
-function J(e, t) {
-	return t ? e.slice(t[0], t[1]) : e.slice();
-}
-function Y(e, t) {
-	return T(G.encode(`${e.level}/${e.e}/${e.n}.${t}`));
-}
-function X(e, t, n) {
-	let { e: r, n: i } = K.extent;
-	return e < r[1] && e + n > r[0] && t < i[1] && t + n > i[0];
-}
-function ne({ level: e, e: t, n }) {
-	let r = 250 * 2 ** e;
-	return e <= P && t % r === 0 && n % r === 0 && X(t, n, r);
-}
-function re(e) {
-	return e === 0 ? [1, 0] : e === P ? [
-		16,
-		15,
-		14,
-		13
-	] : [e + 1];
-}
-function Z(e) {
-	let t = 0;
-	for (let n = 0; n < 8; n++) t |= (e >> 2 * n & 1) << n;
-	return t;
-}
-function Q(t) {
-	let n = [];
-	for (let r of re(t.level)) {
-		let i = e * 2 ** r, a = 250 * 2 ** t.level / i;
-		for (let e = 0; e < a * a; e++) {
-			let a = Z(e), o = Z(e >> 1);
-			X(t.e + a * i, t.n + o * i, i) && n.push({
-				g: r,
-				i: a,
-				j: o
-			});
-		}
-	}
-	return n;
-}
-function $(e, t) {
-	let n = e.level - t, r = 250 * 2 ** n, i = [];
-	for (let a = 0; n >= 0 && a < 2 ** t; a++) for (let o = 0; o < 2 ** t; o++) {
-		let t = {
-			level: n,
-			e: e.e + o * r,
-			n: e.n + a * r
-		};
-		X(t.e, t.n, r) && i.push({
-			column: o,
-			row: a,
-			unit: t
-		});
-	}
-	return i;
-}
-function ie(t, { g: n, i: r, j: i }, a) {
-	let o = e * 2 ** n, s = o / D, c = 3 * L * s, l = 1.17 * s, u = q(t.e + (r + .5) * o, t.n + (i + .5) * o), d = U * o / 2, f = Float32Array.of(r * o - c, i * o - c, Math.max(0, u - d) - l, (r + 1) * o + c, (i + 1) * o + c, Math.min(60, u + d) + l), p = O / 4;
-	return {
-		g: n,
-		i: r,
-		j: i,
-		count: O,
-		quadrants: [
-			p,
-			2 * p,
-			3 * p
-		],
-		box: f,
-		offset: a,
-		length: N
-	};
-}
-function ae(e) {
-	let t = Q(e), n = [];
-	for (let { column: t, row: r, unit: i } of $(e, 1)) n.push({
-		quadrant: t + 2 * r,
-		idx: Y(i, "idx")
-	});
-	let r = [];
-	for (let t of [2, 3]) for (let { column: n, row: i, unit: a } of $(e, t)) r.push({
-		depth: t,
-		column: n,
-		row: i,
-		idx: Y(a, "idx")
-	});
-	return w({
-		level: e.level,
-		e: e.e,
-		n: e.n,
-		pack: Y(e, "pack"),
-		packSize: t.length * (N + 52) + 16,
-		col: null,
-		rows: t.map((t, n) => ie(e, t, n * N)),
-		children: n,
-		descendants: r
-	});
-}
-function oe(e, t, n) {
-	let r = Q(e);
-	if (!t || t[0] % N !== 0 || t[1] % N !== 0 || t[0] >= t[1] || t[1] > r.length * N) throw Error(`${n}: the synthetic world serves whole pages only`);
-	let i = new Uint8Array(t[1] - t[0]);
-	for (let n = 0; n < i.length; n += N) se(le(e, r[(t[0] + n) / N]), i, n);
-	return i;
-}
-function se(e, t, n) {
-	let r = n;
-	for (let n = 0; n < e.length; n += j) {
-		let i = Math.min(j, e.length - n);
-		t[r] = +(n + i === e.length), t[r + 1] = i & 255, t[r + 2] = i >> 8, t[r + 3] = ~i & 255, t[r + 4] = ~i >> 8 & 255, t.set(e.subarray(n, n + i), r + M), r += M + i;
-	}
-}
-var ce = (e) => E(parseInt(T(G.encode(e)).slice(8), 16));
-function le(t, { g: n, i: r, j: i }) {
-	let a = O, o = e * 2 ** n / D, c = ce(`${t.level}/${t.e}/${t.n}/${n}/${r}/${i}`), l = new Float64Array(3 * a), u = new Float32Array(4 * a), d = new Float32Array(3 * a), f = new Float32Array(a), p = new Float32Array(3 * a), m = new Float32Array(9 * a);
-	for (let e = 0; e < a; e++) {
-		let n = (r * D + e % D + .5 + F * (2 * c() - 1)) * o, a = (i * D + Math.floor(e / D) + .5 + F * (2 * c() - 1)) * o, h = q(t.e + n, t.n + a);
-		l[3 * e] = n, l[3 * e + 1] = a, l[3 * e + 2] = h;
-		let g = Math.PI * c(), _ = z / 2 * (2 * c() - 1);
-		u[4 * e] = Math.cos(g) * Math.cos(_), u[4 * e + 1] = Math.cos(g) * Math.sin(_), u[4 * e + 2] = Math.sin(g) * Math.sin(_), u[4 * e + 3] = Math.sin(g) * Math.cos(_);
-		for (let t = 0; t < 2; t++) d[3 * e + t] = Math.log(o * (I + .6 * c()));
-		d[3 * e + 2] = Math.log(o * R * (.5 + .5 * c())), f[e] = .35 + .65 * c();
-		let v = h / 60, y = .5 + .5 * Math.sin((t.e + n) / 410) * Math.sin((t.n + a) / 330);
-		p[3 * e] = (.32 + .2 * v + .1 * y - .5) / s, p[3 * e + 1] = (.42 + .15 * y - .1 * v - .5) / s, p[3 * e + 2] = (.25 + .1 * v + .04 * c() - .5) / s;
-		let b = e % k;
-		m.set(W.subarray(9 * b, 9 * (b + 1)), 9 * e);
-	}
-	return y({
-		count: a,
-		position: l,
-		rotation: u,
-		scale: d,
-		alpha: f,
-		dc: p,
-		sh: m
-	}, {
-		g: n,
-		i: r,
-		j: i
-	}).payload;
-}
-//#endregion
-export { te as synthetic };

package/dist/tools-NykPVccD.js

@@ -1,242 +0,0 @@
-import { a as e, c as t, d as n, f as r, g as i, l as a, m as o, n as s, o as c, p as l, t as u, u as d, v as f } from "./format-C3Vn0c2b.js";
-import { t as p } from "./ports-DZRKjdYD.js";
-//#region src/tools/walk.ts
-var m = 16;
-async function h(e, t) {
-	let n = await e(t, null);
-	return a(JSON.parse(new TextDecoder().decode(n)));
-}
-async function* g(e, r, i, a) {
-	let s = t(r), c = async (t) => {
-		try {
-			let r = await e(s + t, null);
-			return {
-				path: t,
-				idx: await n(r),
-				bytes: r
-			};
-		} catch (e) {
-			if (!a) throw e;
-			return a(t, e), null;
-		}
-	}, l = i.roots.map((e) => e.idx);
-	for (; l.length > 0;) {
-		let e = [];
-		for (let t = 0; t < l.length; t += m) for (let n of await Promise.all(l.slice(t, t + m).map(c))) if (n) {
-			yield n;
-			for (let { key: t, hash: r } of d(n.idx).slice(0, n.idx.children.length)) e.push(o(t, r, "idx"));
-		}
-		l = e;
-	}
-}
-//#endregion
-//#region src/tools/validate.ts
-var _ = (e) => e instanceof Error ? e.message : String(e), v = (e) => e instanceof p ? "is missing" : _(e);
-async function y(e, n, r = {}) {
-	let i = {
-		units: 0,
-		files: 0,
-		bytes: 0,
-		faults: []
-	}, a = (e, t) => i.faults.push({
-		path: e,
-		fault: v(t)
-	}), s;
-	try {
-		s = await h(e, n);
-	} catch (e) {
-		return a("world.json", e), i;
-	}
-	let c = t(n), l = async (t) => {
-		await b(e, c, t, r.deep ?? !1, i), r.progress?.(i);
-	}, u = r.deep ? 2 : 8, d = !r.server, f = [];
-	for await (let t of g(e, n, s, a)) {
-		if (!d) {
-			d = !0;
-			let e = o(t.idx, t.idx.pack, "pack");
-			for (let t of await C(c + e)) i.faults.push({
-				path: e,
-				fault: t
-			});
-		}
-		f.push(l(t)), !(f.length < u) && (await Promise.all(f), f = []);
-	}
-	return await Promise.all(f), i;
-}
-async function b(e, t, n, i, a) {
-	let { idx: s, path: l, bytes: d } = n, f = (e, t) => a.faults.push({
-		path: e,
-		fault: t
-	});
-	a.units++, a.files++, a.bytes += d.length;
-	let p = r(l);
-	if ((p.level !== s.level || p.e !== s.e || p.n !== s.n) && f(l, `holds unit ${s.level}/${s.e}/${s.n}`), i && u(d) !== p.hash && f(l, "does not have the hash in its name"), s.col) {
-		let n = o(s, s.col, "col");
-		try {
-			let r = await e(t + n, null);
-			a.files++, a.bytes += r.length, await c(r), i && u(r) !== s.col && f(n, "does not have the hash in its name");
-		} catch (e) {
-			f(n, v(e));
-		}
-	}
-	let m = o(s, s.pack, "pack");
-	try {
-		a.files++, a.bytes += s.packSize;
-		let n = i ? await e(t + m, null) : null;
-		if (n && n.length !== s.packSize) throw Error(`holds ${n.length} bytes, its .idx gives ${s.packSize}`);
-		n && u(n) !== s.pack && f(m, "does not have the hash in its name");
-		let r = async (r, i) => {
-			let a = n ? n.subarray(r, i) : await e(t + m, [r, i]);
-			if (a.length !== i - r) throw Error(`gives ${a.length} bytes for ${r}-${i}`);
-			return a;
-		}, o = await x(r, s.packSize);
-		for (let e of s.rows) {
-			let t = `${e.g}/${e.i}/${e.j}`, i = `page ${t}`, a = o.get(t);
-			if (!a || a.offset !== e.offset || a.length !== e.length) f(m, `does not list ${i} as its .idx does`);
-			else if (n) {
-				let t = await S(await r(e.offset, e.offset + e.length), e);
-				t && f(m, `${i} ${t}`);
-			}
-		}
-	} catch (e) {
-		f(m, v(e));
-	}
-}
-async function x(e, t) {
-	if (t < 16) throw Error("is shorter than a pack trailer");
-	let n = await e(t - 16, t), r = new DataView(n.buffer, n.byteOffset, n.byteLength);
-	if (String.fromCharCode(...n.subarray(8, 12)) !== "GMPK") throw Error("does not end in a pack trailer");
-	let i = r.getUint16(12, !0);
-	if (i !== 1) throw Error(`is version ${i}; narcissus reads 1`);
-	let a = r.getUint32(0, !0), o = r.getUint32(4, !0);
-	if (a + o * 52 !== t - 16) throw Error("has a page table that does not end at its trailer");
-	let s = await e(a, t - 16), c = new DataView(s.buffer, s.byteOffset, s.byteLength), u = /* @__PURE__ */ new Map();
-	for (let e = 0; e < o; e++) {
-		let t = l(c, e * 52);
-		u.set(`${t.g}/${t.i}/${t.j}`, t);
-	}
-	return u;
-}
-async function S(e, t) {
-	let n;
-	try {
-		n = await i(e);
-	} catch {
-		return "is not a valid deflate stream";
-	}
-	try {
-		let e = s(n, null);
-		if (e.count !== t.count) return `holds ${e.count} splats, its row ${t.count}`;
-		if (e.quadrants.some((e, n) => e !== t.quadrants[n])) return "does not start its quadrants where its row does";
-	} catch (e) {
-		return `does not decode: ${_(e)}`;
-	}
-}
-async function C(e) {
-	let t = "https://narcissus.example", n = [], r;
-	try {
-		r = await fetch(e, { headers: {
-			Range: "bytes=0-0",
-			Origin: t
-		} }), await r.arrayBuffer();
-	} catch (e) {
-		return [`the server did not answer: ${_(e)}`];
-	}
-	r.status !== 206 && n.push(`the server answers a range request with status ${r.status}, not 206`);
-	let i = r.headers.get("access-control-allow-origin");
-	return i !== "*" && i !== t && n.push("the server sends no access-control-allow-origin for another origin"), n;
-}
-//#endregion
-//#region src/tools/info.ts
-async function w(e, t) {
-	let n = await h(e, t), r = {
-		world: n,
-		units: [],
-		levels: [],
-		bytes: 0
-	};
-	for await (let { idx: i } of g(e, t, n)) {
-		r.units[i.level] = (r.units[i.level] ?? 0) + 1, r.bytes += i.packSize;
-		for (let e of i.rows) {
-			let t = r.levels[e.g] ??= {
-				pages: 0,
-				splats: 0
-			};
-			t.pages++, t.splats += e.count;
-		}
-	}
-	return r.units = Array.from(r.units, (e) => e ?? 0), r.levels = Array.from(r.levels, (e) => e ?? {
-		pages: 0,
-		splats: 0
-	}), r;
-}
-//#endregion
-//#region src/tools/ply.ts
-var T = [
-	"x",
-	"y",
-	"z",
-	...[
-		0,
-		1,
-		2
-	].map((e) => `f_dc_${e}`),
-	...Array.from({ length: 9 }, (e, t) => `f_rest_${t}`),
-	"opacity",
-	...[
-		0,
-		1,
-		2
-	].map((e) => `scale_${e}`),
-	...[
-		0,
-		1,
-		2,
-		3
-	].map((e) => `rot_${e}`)
-], E = Math.SQRT1_2, D = [.5 / 255, 254.5 / 255];
-function O(e, t, n) {
-	let [r, i, a, o] = e.rotation, s = Math.min(D[1], Math.max(D[0], e.alpha));
-	n[0] = e.position[0] - t[0], n[1] = -e.position[2], n[2] = e.position[1] - t[1];
-	for (let t = 0; t < 3; t++) n[3 + t] = (e.colour[t] - .5) / f, n[6 + 3 * t] = e.sh[3 * t + 1], n[7 + 3 * t] = -e.sh[3 * t], n[8 + 3 * t] = e.sh[3 * t + 2], n[16 + t] = Math.log(e.scale[t]);
-	n[15] = Math.log(s / (1 - s)), n[19] = E * (r - i), n[20] = E * (r + i), n[21] = E * (a - o), n[22] = E * (a + o);
-}
-async function* k(n, r, a = {}) {
-	let { level: l = 0, box: u } = a, d = await h(n, r), f = t(r), p = (e, { box: t }) => !u || e.e + t[0] <= u[2] && e.e + t[3] >= u[0] && e.n + t[1] <= u[3] && e.n + t[4] >= u[1], m = [], _ = 0;
-	for await (let { idx: e } of g(n, r, d)) {
-		let t = e.rows.filter((t) => t.g === l && p(e, t));
-		if (t.length !== 0) {
-			m.push({
-				idx: e,
-				rows: t
-			});
-			for (let e of t) _ += e.count;
-		}
-	}
-	let v = [Math.floor(u ? u[0] : d.extent.e[0]), Math.floor(u ? u[1] : d.extent.n[0])];
-	yield new TextEncoder().encode([
-		"ply",
-		"format binary_little_endian 1.0",
-		`comment level ${l} of a guldmund tree in ${d.crs}, heights in ${d.height}`,
-		"comment x east, y down, z north, in metres",
-		`comment origin ${v[0]} ${v[1]}: add it to x and z for easting and northing`,
-		`element vertex ${_}`,
-		...T.map((e) => `property float ${e}`),
-		"end_header",
-		""
-	].join("\n"));
-	let y = T.length;
-	for (let { idx: t, rows: r } of m) {
-		let a = f + o(t, t.pack, "pack"), l = t.col ? await c(await n(f + o(t, t.col, "col"), null)) : null;
-		for (let o of r) {
-			let r = await n(a, [o.offset, o.offset + o.length]), c = s(await i(r), l), u = new Float32Array(c.count * y);
-			for (let n = 0; n < c.count; n++) {
-				let r = e(c, n);
-				r.position[0] += t.e, r.position[1] += t.n, O(r, v, u.subarray(n * y, (n + 1) * y));
-			}
-			yield new Uint8Array(u.buffer);
-		}
-	}
-}
-//#endregion
-export { y as a, C as i, O as n, h as o, w as r, g as s, k as t };