akm-cli 0.9.17-alpha.7 → 0.9.17-alpha.9

package/dist/indexer/graph/graph-related.js

@@ -1,131 +0,0 @@
-// This Source Code Form is subject to the terms of the Mozilla Public
-// License, v. 2.0. If a copy of the MPL was not distributed with this
-// file, You can obtain one at https://mozilla.org/MPL/2.0/.
-/**
- * Find graph files that share entities with the given file.
- *
- * Implementation: SQL self-join on graph_file_entities, scoped by stash_root,
- * grouped by file_path, ordered by shared-entity count desc. Touches ~50-200
- * rows instead of loading the entire snapshot into memory. Cold-call latency
- * drops from ~30-60ms (full snapshot parse) to ~2-5ms on typical stashes.
- *
- * #624-P1: the graph tables are keyed on (stash_root, file_path, body_hash) —
- * NOT entries.id — so candidates are identified by file_path (the unique index
- * idx_graph_files_path guarantees one graph_files row per path).
- *
- * The returned `ref` field carries the canonical indexed `concept_id`, never a
- * value re-derived from presentation fields. It is undefined
- * when the graph row has no matching entry with current indexed provenance.
- */
-export function listRelatedPathsForFile(stashRoot, filePath, limit = 5, db) {
-    if (!db) {
-        // Fallback: opening a transient DB here is not currently a use case (all
-        // callers pass a handle), so degrade to empty rather than reopening.
-        return [];
-    }
-    // Confirm the target file has a graph row; without it there is nothing to
-    // relate. (Identity is file_path within the stash — one row per path.)
-    const row = db
-        .prepare("SELECT 1 AS present FROM graph_files WHERE stash_root = ? AND file_path = ? LIMIT 1")
-        .get(stashRoot, filePath);
-    if (row === undefined)
-        return [];
-    const effectiveLimit = Math.max(1, limit);
-    // Distinct shared entities per candidate file_path. The target's entities
-    // are the rows for `filePath`; candidates are any OTHER file_path in the
-    // stash that shares a normalized entity. Counting distinct keys keeps two
-    // stored forms of one entity (rows older extractors wrote) from counting twice.
-    const candidateRows = db
-        .prepare(`SELECT gf.file_path   AS file_path,
-              gf.file_type   AS file_type,
-              COUNT(DISTINCT e.entity_norm) AS shared
-          FROM graph_file_entities target
-          JOIN graph_file_entities e
-            ON e.stash_root = target.stash_root
-           AND e.entity_norm = target.entity_norm
-           AND e.file_path  != target.file_path
-          JOIN graph_files gf
-            ON gf.stash_root = e.stash_root
-           AND gf.file_path = e.file_path
-           AND gf.body_hash = e.body_hash
-        WHERE target.file_path  = ?
-          AND target.stash_root = ?
-        GROUP BY gf.file_path
-        ORDER BY shared DESC, gf.file_path ASC
-        LIMIT ?`)
-        .all(filePath, stashRoot, effectiveLimit);
-    if (candidateRows.length === 0)
-        return [];
-    const candidatePaths = candidateRows.map((r) => r.file_path);
-    const placeholders = candidatePaths.map(() => "?").join(",");
-    // Pull the shared entity names (joined by normalized casing) for display, in
-    // a fixed order so identical calls return identical results.
-    const sharedRows = db
-        .prepare(`SELECT e.file_path AS file_path, e.entity AS entity
-         FROM graph_file_entities e
-         JOIN graph_file_entities target
-           ON target.stash_root = e.stash_root
-           AND target.entity_norm = e.entity_norm
-         WHERE e.file_path IN (${placeholders})
-           AND e.stash_root = ?
-           AND target.file_path = ?
-           AND target.stash_root = ?
-         ORDER BY e.file_path, e.entity`)
-        .all(...candidatePaths, stashRoot, filePath, stashRoot);
-    const sharedByPath = new Map();
-    for (const row of sharedRows) {
-        let bucket = sharedByPath.get(row.file_path);
-        if (!bucket) {
-            bucket = new Set();
-            sharedByPath.set(row.file_path, bucket);
-        }
-        bucket.add(row.entity);
-    }
-    // Relation count for each candidate (relations where either endpoint
-    // matches one of the shared entities).
-    const relationCountByPath = new Map();
-    const relationRows = db
-        .prepare(`SELECT file_path, from_entity, to_entity
-         FROM graph_file_relations
-        WHERE file_path IN (${placeholders})
-          AND stash_root = ?`)
-        .all(...candidatePaths, stashRoot);
-    for (const row of relationRows) {
-        const shared = sharedByPath.get(row.file_path);
-        if (!shared)
-            continue;
-        if (shared.has(row.from_entity) || shared.has(row.to_entity)) {
-            relationCountByPath.set(row.file_path, (relationCountByPath.get(row.file_path) ?? 0) + 1);
-        }
-    }
-    // This related list is scoped to one source root, so the user-facing ref is
-    // the indexed bundle-less conceptId.
-    const refByPath = new Map();
-    try {
-        const entryRows = db
-            .prepare(`SELECT file_path, concept_id FROM entries
-          WHERE file_path IN (${placeholders})
-          ORDER BY file_path, concept_id`)
-            .all(...candidatePaths);
-        // Several entries can index one file; the first concept id wins.
-        for (const row of entryRows) {
-            if (!refByPath.has(row.file_path))
-                refByPath.set(row.file_path, row.concept_id);
-        }
-    }
-    catch {
-        /* ignore — refs are best-effort */
-    }
-    return candidateRows.map((row) => {
-        const sharedSet = sharedByPath.get(row.file_path) ?? new Set();
-        const sharedEntities = [...sharedSet].sort((a, b) => a.localeCompare(b));
-        const ref = refByPath.get(row.file_path);
-        return {
-            ...(ref ? { ref } : {}),
-            path: row.file_path,
-            type: row.file_type,
-            sharedEntities,
-            relationCount: relationCountByPath.get(row.file_path) ?? 0,
-        };
-    });
-}

package/dist/indexer/graph/graph-types.js

@@ -1,4 +0,0 @@
-// This Source Code Form is subject to the terms of the Mozilla Public
-// License, v. 2.0. If a copy of the MPL was not distributed with this
-// file, You can obtain one at https://mozilla.org/MPL/2.0/.
-export {};