@needle-tools/addressing 0.1.0 → 0.3.0

package/src/hash.ts

@@ -1,113 +1,58 @@
-/**
- * Vendored hash primitives so the package has zero runtime dependencies.
- * md5Hex must produce byte-identical output to `js-md5`'s `md5(str)` (needle-cloud's
- * `hashStringMD5`) — the file fingerprint is part of the deterministic id contract.
- * sha1 backs UUIDv5 (RFC 4122).
- */
-
-const MD5_K = new Uint32Array(64);
-for (let i = 0; i < 64; i++) {
-    MD5_K[i] = Math.floor(Math.abs(Math.sin(i + 1)) * 0x100000000);
-}
-// per-round left-rotate amounts
-const MD5_S = [
-    7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22, 7, 12, 17, 22,
-    5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20, 5, 9, 14, 20,
-    4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23, 4, 11, 16, 23,
-    6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21, 6, 10, 15, 21,
-];
-
-/** MD5 of the UTF-8 encoding of `input`, as a lowercase hex string. */
-export function md5Hex(input: string | Uint8Array): string {
-    const data = typeof input === "string" ? new TextEncoder().encode(input) : input;
-    const padded = padMessage(data, /* littleEndianLength */ true);
-    const dv = new DataView(padded.buffer, padded.byteOffset, padded.byteLength);
-
-    let a0 = 0x67452301, b0 = 0xefcdab89, c0 = 0x98badcfe, d0 = 0x10325476;
-    const m = new Uint32Array(16);
-    for (let off = 0; off < padded.length; off += 64) {
-        for (let i = 0; i < 16; i++) m[i] = dv.getUint32(off + i * 4, true);
-        let a = a0, b = b0, c = c0, d = d0;
-        for (let i = 0; i < 64; i++) {
-            let f: number, g: number;
-            if (i < 16) { f = (b & c) | (~b & d); g = i; }
-            else if (i < 32) { f = (d & b) | (~d & c); g = (5 * i + 1) % 16; }
-            else if (i < 48) { f = b ^ c ^ d; g = (3 * i + 5) % 16; }
-            else { f = c ^ (b | ~d); g = (7 * i) % 16; }
-            const t = (f + a + MD5_K[i] + m[g]) | 0;
-            a = d; d = c; c = b;
-            b = (b + ((t << MD5_S[i]) | (t >>> (32 - MD5_S[i])))) | 0;
-        }
-        a0 = (a0 + a) | 0; b0 = (b0 + b) | 0; c0 = (c0 + c) | 0; d0 = (d0 + d) | 0;
-    }
-
-    const out = new Uint8Array(16);
-    const odv = new DataView(out.buffer);
-    odv.setUint32(0, a0 >>> 0, true);
-    odv.setUint32(4, b0 >>> 0, true);
-    odv.setUint32(8, c0 >>> 0, true);
-    odv.setUint32(12, d0 >>> 0, true);
-    return toHex(out);
-}
-
-/** SHA-1 digest bytes of `data`. */
-export function sha1(data: Uint8Array): Uint8Array {
-    const padded = padMessage(data, /* littleEndianLength */ false);
-    const dv = new DataView(padded.buffer, padded.byteOffset, padded.byteLength);
-
-    let h0 = 0x67452301, h1 = 0xefcdab89, h2 = 0x98badcfe, h3 = 0x10325476, h4 = 0xc3d2e1f0;
-    const w = new Uint32Array(80);
-    for (let off = 0; off < padded.length; off += 64) {
-        for (let i = 0; i < 16; i++) w[i] = dv.getUint32(off + i * 4);
-        for (let i = 16; i < 80; i++) {
-            const n = w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16];
-            w[i] = (n << 1) | (n >>> 31);
-        }
-        let a = h0, b = h1, c = h2, d = h3, e = h4;
-        for (let i = 0; i < 80; i++) {
-            let f: number, k: number;
-            if (i < 20) { f = (b & c) | (~b & d); k = 0x5a827999; }
-            else if (i < 40) { f = b ^ c ^ d; k = 0x6ed9eba1; }
-            else if (i < 60) { f = (b & c) | (b & d) | (c & d); k = 0x8f1bbcdc; }
-            else { f = b ^ c ^ d; k = 0xca62c1d6; }
-            const t = ((((a << 5) | (a >>> 27)) + f + e + k + w[i]) | 0);
-            e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;
-        }
-        h0 = (h0 + a) | 0; h1 = (h1 + b) | 0; h2 = (h2 + c) | 0; h3 = (h3 + d) | 0; h4 = (h4 + e) | 0;
-    }
-
-    const out = new Uint8Array(20);
-    const odv = new DataView(out.buffer);
-    odv.setUint32(0, h0 >>> 0);
-    odv.setUint32(4, h1 >>> 0);
-    odv.setUint32(8, h2 >>> 0);
-    odv.setUint32(12, h3 >>> 0);
-    odv.setUint32(16, h4 >>> 0);
-    return out;
-}
-
-export function toHex(bytes: Uint8Array): string {
-    let s = "";
-    for (let i = 0; i < bytes.length; i++) s += bytes[i].toString(16).padStart(2, "0");
-    return s;
-}
-
-/** append 0x80, zero-pad to 56 mod 64, append 64-bit bit-length (LE for MD5, BE for SHA-1) */
-function padMessage(data: Uint8Array, littleEndianLength: boolean): Uint8Array {
-    const bitLen = data.length * 8;
-    const padded = new Uint8Array((((data.length + 8) >> 6) + 1) * 64);
-    padded.set(data);
-    padded[data.length] = 0x80;
-    const dv = new DataView(padded.buffer);
-    const lo = bitLen >>> 0;
-    const hi = Math.floor(bitLen / 0x100000000);
-    if (littleEndianLength) {
-        dv.setUint32(padded.length - 8, lo, true);
-        dv.setUint32(padded.length - 4, hi, true);
-    }
-    else {
-        dv.setUint32(padded.length - 8, hi);
-        dv.setUint32(padded.length - 4, lo);
-    }
-    return padded;
-}
+/**
+ * Vendored SHA-1 so the package has zero runtime dependencies — it backs UUIDv5
+ * (RFC 4122). Correctness is pinned by golden tests against the `uuid` npm package.
+ */
+
+/** SHA-1 digest bytes of `data`. */
+export function sha1(data: Uint8Array): Uint8Array {
+    const padded = padMessage(data);
+    const dv = new DataView(padded.buffer, padded.byteOffset, padded.byteLength);
+
+    let h0 = 0x67452301, h1 = 0xefcdab89, h2 = 0x98badcfe, h3 = 0x10325476, h4 = 0xc3d2e1f0;
+    const w = new Uint32Array(80);
+    for (let off = 0; off < padded.length; off += 64) {
+        for (let i = 0; i < 16; i++) w[i] = dv.getUint32(off + i * 4);
+        for (let i = 16; i < 80; i++) {
+            const n = w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16];
+            w[i] = (n << 1) | (n >>> 31);
+        }
+        let a = h0, b = h1, c = h2, d = h3, e = h4;
+        for (let i = 0; i < 80; i++) {
+            let f: number, k: number;
+            if (i < 20) { f = (b & c) | (~b & d); k = 0x5a827999; }
+            else if (i < 40) { f = b ^ c ^ d; k = 0x6ed9eba1; }
+            else if (i < 60) { f = (b & c) | (b & d) | (c & d); k = 0x8f1bbcdc; }
+            else { f = b ^ c ^ d; k = 0xca62c1d6; }
+            const t = ((((a << 5) | (a >>> 27)) + f + e + k + w[i]) | 0);
+            e = d; d = c; c = (b << 30) | (b >>> 2); b = a; a = t;
+        }
+        h0 = (h0 + a) | 0; h1 = (h1 + b) | 0; h2 = (h2 + c) | 0; h3 = (h3 + d) | 0; h4 = (h4 + e) | 0;
+    }
+
+    const out = new Uint8Array(20);
+    const odv = new DataView(out.buffer);
+    odv.setUint32(0, h0 >>> 0);
+    odv.setUint32(4, h1 >>> 0);
+    odv.setUint32(8, h2 >>> 0);
+    odv.setUint32(12, h3 >>> 0);
+    odv.setUint32(16, h4 >>> 0);
+    return out;
+}
+
+export function toHex(bytes: Uint8Array): string {
+    let s = "";
+    for (let i = 0; i < bytes.length; i++) s += bytes[i].toString(16).padStart(2, "0");
+    return s;
+}
+
+/** append 0x80, zero-pad to 56 mod 64, append big-endian 64-bit bit-length */
+function padMessage(data: Uint8Array): Uint8Array {
+    const bitLen = data.length * 8;
+    const padded = new Uint8Array((((data.length + 8) >> 6) + 1) * 64);
+    padded.set(data);
+    padded[data.length] = 0x80;
+    const dv = new DataView(padded.buffer);
+    dv.setUint32(padded.length - 8, Math.floor(bitLen / 0x100000000));
+    dv.setUint32(padded.length - 4, bitLen >>> 0);
+    return padded;
+}

package/src/id.ts

@@ -1,32 +1,45 @@
-import { parseAnchorValue } from "./anchor.js";
-import { md5Hex } from "./hash.js";
-import { uuidv5 } from "./uuid.js";
-
-/**
- * Fingerprint of a glTF file for deterministic id computation: MD5 hex of
- * `JSON.stringify(json)`, taken over the file AS-IS **before any ids are injected**
- * (needle-cloud hashes first, then mutates — order is part of the contract).
- */
-export function computeFileHash(json: unknown): string {
-    return md5Hex(JSON.stringify(json));
-}
-
-/**
- * The deterministic needle-id of a glTF element. Byte-identical to needle-cloud's
- * `ensureUUID` (upload-time injection):
- *
- * - anchored name (`… #needle`): `uuidv5("<type>-<anchor>", URL)` — stable across
- *   asset versions.
- * - otherwise: `uuidv5("<type>-<name>-<index>-<fileHash>", URL)` — stable per asset
- *   VERSION only (the file hash is an input by design: same-named elements in
- *   different files must not collide).
- *
- * `name` handling matches the source: absent/empty names contribute `""`.
- */
-export function computeElementId(type: string, name: string | null | undefined, index: number, fileHash: string): string {
-    const anchor = parseAnchorValue(name);
-    const str = anchor !== null
-        ? `${type}-${anchor}`
-        : `${type}-${name ? name : ""}-${index}-${fileHash}`;
-    return uuidv5(str);
-}
+import { parseAnchorValue } from "./anchor.js";
+import { uuidv5 } from "./uuid.js";
+
+/**
+ * The deterministic needle-id of a glTF element.
+ *
+ * - Anchored name (`… #needle`): `uuidv5("<type>-<anchor>")` — survives ANY content
+ *   change while the name stays.
+ * - Otherwise: `uuidv5("<type>-<name>-<occurrence>[-<baseHash>]")` where `occurrence`
+ *   is the element's position among SAME-NAMED elements of its type. Uniquely named
+ *   elements are therefore fully reorder-stable across file versions; duplicates shift
+ *   only when reordered within their own name group; unnamed elements are positional
+ *   among the unnamed.
+ * - `baseHash` is an optional consumer-supplied salt (e.g. an asset/content id) that
+ *   scopes ids to an external identity. Omitted by default, so any tool stamping the
+ *   same element mints the same id with no coordination.
+ *
+ * Ids are persisted in `extras["needle-id"]` and never overwritten once present —
+ * whoever stamps first wins; this rule only governs never-stamped elements.
+ */
+export function computeElementId(type: string, name: string | null | undefined, occurrence: number, baseHash?: string): string {
+    const anchor = parseAnchorValue(name);
+    const str = anchor !== null
+        ? `${type}-${anchor}`
+        : `${type}-${name ? name : ""}-${occurrence}${baseHash ? `-${baseHash}` : ""}`;
+    return uuidv5(str);
+}
+
+/**
+ * The occurrence of the element at `index` among same-named elements of its collection —
+ * the positional input of {@link computeElementId}. Exposed so consumers computing ids
+ * for individual elements (instead of stamping whole files) use the identical rule.
+ */
+export function occurrenceOfName(elements: ReadonlyArray<{ name?: unknown } | null | undefined>, index: number): number {
+    const name = normalizedName(elements[index]);
+    let occurrence = 0;
+    for (let i = 0; i < index; i++) {
+        if (normalizedName(elements[i]) === name) occurrence++;
+    }
+    return occurrence;
+}
+
+function normalizedName(element: { name?: unknown } | null | undefined): string {
+    return typeof element?.name === "string" ? element.name : "";
+}

package/src/index.ts

@@ -1,10 +1,11 @@
 export { ANCHOR_MARKER, ANCHOR_MARKERS, parseAnchor, parseAnchorValue, type ParsedAnchor } from "./anchor.js";
-export { computeElementId, computeFileHash } from "./id.js";
+export { computeElementId, occurrenceOfName } from "./id.js";
 export {
     ensureIds,
     getElementId,
     NEEDLE_ID_KEY,
     STAMPED_COLLECTIONS,
+    type EnsureIdsOptions,
     type EnsureIdsResult,
     type GltfElement,
     type GltfJson,
@@ -26,4 +27,3 @@ export {
     type ReconcileCandidate,
 } from "./resolve.js";
 export { randomUuid, uuidv5, UUID_NAMESPACE_URL } from "./uuid.js";
-export { md5Hex } from "./hash.js";

package/src/resolve.ts

@@ -1,172 +1,172 @@
-import { parseAnchorValue } from "./anchor.js";
-import { collectionKeyForType, GraphNode, NeedleAddress } from "./address.js";
-import { GltfJson, NEEDLE_ID_KEY, STAMPED_COLLECTIONS } from "./gltf.js";
-
-export type GltfResolveResult = {
-    type: string;
-    index: number;
-    element: Record<string, unknown>;
-};
-
-/**
- * Resolve an address inside glTF JSON. Tries id → anchor → namePath (nodes), in that
- * order; returns null when nothing matches exactly (reconciliation is a separate,
- * explicit step — resolution never guesses).
- */
-export function resolveInGltf(address: NeedleAddress, json: GltfJson): GltfResolveResult | null {
-    const searched: Array<readonly [string, string]> = address.type
-        ? [[address.type, collectionKeyForType(address.type)]]
-        : [...STAMPED_COLLECTIONS];
-
-    if (address.id) {
-        for (const [type, key] of searched) {
-            const found = findInCollection(json, key, el => el.extras?.[NEEDLE_ID_KEY] === address.id);
-            if (found) return { type, index: found.index, element: found.element };
-        }
-    }
-    if (address.anchor) {
-        for (const [type, key] of searched) {
-            const found = findInCollection(json, key, el => parseAnchorValue(el.name as string | undefined) === address.anchor);
-            if (found) return { type, index: found.index, element: found.element };
-        }
-    }
-    if (address.namePath?.length && (!address.type || address.type === "node")) {
-        const index = walkGltfNamePath(json, address.namePath);
-        if (index !== null) {
-            const nodes = json["nodes"] as Array<Record<string, unknown>>;
-            return { type: "node", index, element: nodes[index] };
-        }
-    }
-    return null;
-}
-
-/**
- * Resolve an address inside a live scene graph (duck-typed — any three.js).
- * Same order as glTF resolution: id → anchor → namePath.
- */
-export function resolveInGraph(address: NeedleAddress, root: GraphNode): GraphNode | null {
-    if (address.id) {
-        const byId = findInGraph(root, n => n.userData?.[NEEDLE_ID_KEY] === address.id);
-        if (byId) return byId;
-    }
-    if (address.anchor) {
-        const byAnchor = findInGraph(root, n => parseAnchorValue(n.name) === address.anchor);
-        if (byAnchor) return byAnchor;
-    }
-    if (address.namePath?.length) {
-        let current: GraphNode | null = root;
-        for (const segment of address.namePath) {
-            current = current.children?.find(c => (c.name ?? "") === segment) ?? null;
-            if (!current) break;
-        }
-        if (current && current !== root) return current;
-    }
-    return null;
-}
-
-export type ReconcileCandidate = {
-    object: GraphNode;
-    /** 0..1 — heuristic, for ranking and thresholds; 1.0 is reserved for exact resolution */
-    confidence: number;
-    reasons: string[];
-};
-
-/**
- * When exact resolution fails (the asset changed), propose candidates instead of
- * guessing: nodes matching the address's name, ranked by how much of the recorded
- * namePath still matches. Callers decide thresholds and whether to re-anchor.
- */
-export function reconcileInGraph(address: NeedleAddress, root: GraphNode): ReconcileCandidate[] {
-    if (!address.name && !address.namePath?.length) return [];
-    const targetName = address.name ?? address.namePath![address.namePath!.length - 1];
-
-    const candidates: ReconcileCandidate[] = [];
-    collectDescendants(root, (node, namePath) => {
-        if ((node.name ?? "") !== targetName) return;
-        const reasons = [`name matches "${targetName}"`];
-        let confidence = 0.5;
-        if (address.namePath?.length) {
-            const similarity = pathSuffixSimilarity(address.namePath, namePath);
-            confidence += 0.4 * similarity;
-            if (similarity > 0) reasons.push(`path suffix similarity ${(similarity * 100).toFixed(0)}%`);
-        }
-        candidates.push({ object: node, confidence, reasons });
-    });
-    if (candidates.length === 1) {
-        candidates[0].confidence = Math.min(0.95, candidates[0].confidence + 0.1);
-        candidates[0].reasons.push("only candidate with this name");
-    }
-    return candidates.sort((a, b) => b.confidence - a.confidence);
-}
-
-function findInCollection(json: GltfJson, key: string, predicate: (el: Record<string, any>) => boolean): { index: number; element: Record<string, unknown> } | null {
-    const collection = json[key];
-    if (!Array.isArray(collection)) return null;
-    for (let i = 0; i < collection.length; i++) {
-        const element = collection[i];
-        if (element != null && typeof element === "object" && predicate(element)) {
-            return { index: i, element };
-        }
-    }
-    return null;
-}
-
-function walkGltfNamePath(json: GltfJson, namePath: string[]): number | null {
-    const nodes = json["nodes"];
-    const scenes = json["scenes"];
-    if (!Array.isArray(nodes) || !Array.isArray(scenes)) return null;
-    // roots: the union of all scenes' root nodes
-    let candidates: number[] = scenes.flatMap(s => (Array.isArray(s?.nodes) ? s.nodes : []));
-    let match: number | null = null;
-    for (const segment of namePath) {
-        match = candidates.find(i => ((nodes[i]?.name ?? "") === segment)) ?? null;
-        if (match === null) return null;
-        const children = nodes[match]?.children;
-        candidates = Array.isArray(children) ? children : [];
-    }
-    return match;
-}
-
-function findInGraph(root: GraphNode, predicate: (node: GraphNode) => boolean, visited = new Set<GraphNode>()): GraphNode | null {
-    if (visited.has(root)) return null;
-    visited.add(root);
-    if (predicate(root)) return root;
-    if (!root.children) return null;
-    for (let i = 0; i < root.children.length; i++) {
-        const child = root.children[i];
-        if (child == null) continue;
-        const found = findInGraph(child, predicate, visited);
-        if (found) return found;
-    }
-    return null;
-}
-
-/** visit every descendant of root with its root-exclusive name path (including own name) */
-function collectDescendants(root: GraphNode, visit: (node: GraphNode, namePath: string[]) => void): void {
-    const visited = new Set<GraphNode>();
-    const walk = (node: GraphNode, namePath: string[]) => {
-        if (visited.has(node)) return;
-        visited.add(node);
-        if (node !== root) visit(node, namePath);
-        if (!node.children) return;
-        for (let i = 0; i < node.children.length; i++) {
-            const child = node.children[i];
-            if (child == null) continue;
-            walk(child, [...namePath, child.name ?? ""]);
-        }
-    };
-    walk(root, []);
-}
-
-/** how much of the expected path's tail matches the actual path's tail (0..1) */
-function pathSuffixSimilarity(expected: string[], actual: string[]): number {
-    let shared = 0;
-    while (
-        shared < expected.length &&
-        shared < actual.length &&
-        expected[expected.length - 1 - shared] === actual[actual.length - 1 - shared]
-    ) {
-        shared++;
-    }
-    return shared / Math.max(expected.length, actual.length);
-}
+import { parseAnchorValue } from "./anchor.js";
+import { collectionKeyForType, GraphNode, NeedleAddress } from "./address.js";
+import { GltfJson, NEEDLE_ID_KEY, STAMPED_COLLECTIONS } from "./gltf.js";
+
+export type GltfResolveResult = {
+    type: string;
+    index: number;
+    element: Record<string, unknown>;
+};
+
+/**
+ * Resolve an address inside glTF JSON. Tries id → anchor → namePath (nodes), in that
+ * order; returns null when nothing matches exactly (reconciliation is a separate,
+ * explicit step — resolution never guesses).
+ */
+export function resolveInGltf(address: NeedleAddress, json: GltfJson): GltfResolveResult | null {
+    const searched: Array<readonly [string, string]> = address.type
+        ? [[address.type, collectionKeyForType(address.type)]]
+        : [...STAMPED_COLLECTIONS];
+
+    if (address.id) {
+        for (const [type, key] of searched) {
+            const found = findInCollection(json, key, el => el.extras?.[NEEDLE_ID_KEY] === address.id);
+            if (found) return { type, index: found.index, element: found.element };
+        }
+    }
+    if (address.anchor) {
+        for (const [type, key] of searched) {
+            const found = findInCollection(json, key, el => parseAnchorValue(el.name as string | undefined) === address.anchor);
+            if (found) return { type, index: found.index, element: found.element };
+        }
+    }
+    if (address.namePath?.length && (!address.type || address.type === "node")) {
+        const index = walkGltfNamePath(json, address.namePath);
+        if (index !== null) {
+            const nodes = json["nodes"] as Array<Record<string, unknown>>;
+            return { type: "node", index, element: nodes[index] };
+        }
+    }
+    return null;
+}
+
+/**
+ * Resolve an address inside a live scene graph (duck-typed — any three.js).
+ * Same order as glTF resolution: id → anchor → namePath.
+ */
+export function resolveInGraph(address: NeedleAddress, root: GraphNode): GraphNode | null {
+    if (address.id) {
+        const byId = findInGraph(root, n => n.userData?.[NEEDLE_ID_KEY] === address.id);
+        if (byId) return byId;
+    }
+    if (address.anchor) {
+        const byAnchor = findInGraph(root, n => parseAnchorValue(n.name) === address.anchor);
+        if (byAnchor) return byAnchor;
+    }
+    if (address.namePath?.length) {
+        let current: GraphNode | null = root;
+        for (const segment of address.namePath) {
+            current = current.children?.find(c => (c.name ?? "") === segment) ?? null;
+            if (!current) break;
+        }
+        if (current && current !== root) return current;
+    }
+    return null;
+}
+
+export type ReconcileCandidate = {
+    object: GraphNode;
+    /** 0..1 — heuristic, for ranking and thresholds; 1.0 is reserved for exact resolution */
+    confidence: number;
+    reasons: string[];
+};
+
+/**
+ * When exact resolution fails (the asset changed), propose candidates instead of
+ * guessing: nodes matching the address's name, ranked by how much of the recorded
+ * namePath still matches. Callers decide thresholds and whether to re-anchor.
+ */
+export function reconcileInGraph(address: NeedleAddress, root: GraphNode): ReconcileCandidate[] {
+    if (!address.name && !address.namePath?.length) return [];
+    const targetName = address.name ?? address.namePath![address.namePath!.length - 1];
+
+    const candidates: ReconcileCandidate[] = [];
+    collectDescendants(root, (node, namePath) => {
+        if ((node.name ?? "") !== targetName) return;
+        const reasons = [`name matches "${targetName}"`];
+        let confidence = 0.5;
+        if (address.namePath?.length) {
+            const similarity = pathSuffixSimilarity(address.namePath, namePath);
+            confidence += 0.4 * similarity;
+            if (similarity > 0) reasons.push(`path suffix similarity ${(similarity * 100).toFixed(0)}%`);
+        }
+        candidates.push({ object: node, confidence, reasons });
+    });
+    if (candidates.length === 1) {
+        candidates[0].confidence = Math.min(0.95, candidates[0].confidence + 0.1);
+        candidates[0].reasons.push("only candidate with this name");
+    }
+    return candidates.sort((a, b) => b.confidence - a.confidence);
+}
+
+function findInCollection(json: GltfJson, key: string, predicate: (el: Record<string, any>) => boolean): { index: number; element: Record<string, unknown> } | null {
+    const collection = json[key];
+    if (!Array.isArray(collection)) return null;
+    for (let i = 0; i < collection.length; i++) {
+        const element = collection[i];
+        if (element != null && typeof element === "object" && predicate(element)) {
+            return { index: i, element };
+        }
+    }
+    return null;
+}
+
+function walkGltfNamePath(json: GltfJson, namePath: string[]): number | null {
+    const nodes = json["nodes"];
+    const scenes = json["scenes"];
+    if (!Array.isArray(nodes) || !Array.isArray(scenes)) return null;
+    // roots: the union of all scenes' root nodes
+    let candidates: number[] = scenes.flatMap(s => (Array.isArray(s?.nodes) ? s.nodes : []));
+    let match: number | null = null;
+    for (const segment of namePath) {
+        match = candidates.find(i => ((nodes[i]?.name ?? "") === segment)) ?? null;
+        if (match === null) return null;
+        const children = nodes[match]?.children;
+        candidates = Array.isArray(children) ? children : [];
+    }
+    return match;
+}
+
+function findInGraph(root: GraphNode, predicate: (node: GraphNode) => boolean, visited = new Set<GraphNode>()): GraphNode | null {
+    if (visited.has(root)) return null;
+    visited.add(root);
+    if (predicate(root)) return root;
+    if (!root.children) return null;
+    for (let i = 0; i < root.children.length; i++) {
+        const child = root.children[i];
+        if (child == null) continue;
+        const found = findInGraph(child, predicate, visited);
+        if (found) return found;
+    }
+    return null;
+}
+
+/** visit every descendant of root with its root-exclusive name path (including own name) */
+function collectDescendants(root: GraphNode, visit: (node: GraphNode, namePath: string[]) => void): void {
+    const visited = new Set<GraphNode>();
+    const walk = (node: GraphNode, namePath: string[]) => {
+        if (visited.has(node)) return;
+        visited.add(node);
+        if (node !== root) visit(node, namePath);
+        if (!node.children) return;
+        for (let i = 0; i < node.children.length; i++) {
+            const child = node.children[i];
+            if (child == null) continue;
+            walk(child, [...namePath, child.name ?? ""]);
+        }
+    };
+    walk(root, []);
+}
+
+/** how much of the expected path's tail matches the actual path's tail (0..1) */
+function pathSuffixSimilarity(expected: string[], actual: string[]): number {
+    let shared = 0;
+    while (
+        shared < expected.length &&
+        shared < actual.length &&
+        expected[expected.length - 1 - shared] === actual[actual.length - 1 - shared]
+    ) {
+        shared++;
+    }
+    return shared / Math.max(expected.length, actual.length);
+}