@wrongstack/tools 0.302.2 → 0.305.0

package/dist/codebase-index/writer-bulk-insert.d.ts

@@ -20,6 +20,11 @@ export declare function bulkInsertFtsWithStatement(stmt: PrepareStatement, maxSq
     id: number;
     text: string;
 }>): void;
+export interface BulkVectorRow {
+    id: number;
+    vector: Uint8Array;
+}
+export declare function bulkInsertVectorsWithStatement(stmt: PrepareStatement, maxSqlVars: number, rows: BulkVectorRow[]): void;
 export declare function bulkInsertRefsWithStatement(stmt: PrepareStatement, maxSqlVars: number, refs: Ref[]): void;
 export {};
 //# sourceMappingURL=writer-bulk-insert.d.ts.map

package/dist/codebase-index/writer-graph-reader.d.ts

@@ -25,6 +25,45 @@ export declare function findOutgoingCallsByName(stmt: PrepareStatement, symbolNa
     unresolvedCount: number;
     totalMatches: number;
 };
+/**
+ * Transitive incoming-call tree: all symbols that transitively call the target.
+ *
+ * Anchor: direct callers of the target symbol(s).
+ * Recursive: callers of callers, up to `maxDepth` hops.
+ *
+ * `UNION` (not `UNION ALL`) deduplicates per recursion level, so dependency
+ * cycles (A→B→C→A) terminate instead of looping.
+ */
+export declare function findTransitiveIncomingCallsByName(stmt: PrepareStatement, symbolName: string, file: string | undefined, limit: number): {
+    calls: CallSite[];
+    symbolFound: boolean;
+    ambiguous: boolean;
+    totalMatches: number;
+};
+/**
+ * Transitive outgoing-call tree: all symbols that the target transitively calls.
+ *
+ * Anchor: direct callees of the target symbol(s).
+ * Recursive: callees of callees, up to `maxDepth` hops.
+ */
+export declare function findTransitiveOutgoingCallsByName(stmt: PrepareStatement, symbolName: string, file: string | undefined, limit: number): {
+    calls: CallSite[];
+    symbolFound: boolean;
+    unresolvedCount: number;
+    totalMatches: number;
+};
+/**
+ * Compute the set of symbol IDs reachable from a set of seed IDs using a
+ * recursive CTE. Replaces the in-memory BFS in `dead-code-scan.ts`.
+ *
+ * The `UNION` (not `UNION ALL`) deduplication breaks dependency cycles
+ * automatically: A→B→C→A terminates after 3 rows.
+ *
+ * Returns a `Set<number>` of all transitively-reachable symbol IDs (including
+ * the seeds themselves). Callers subtract this from the full symbol set to
+ * find dead code.
+ */
+export declare function findReachableSymbolIds(stmt: PrepareStatement, seedIds: number[]): Set<number>;
 export declare function findRefsToWithStatement(stmt: PrepareStatement, symbolId: number): Ref[];
 export declare function findRefsFromWithStatement(stmt: PrepareStatement, symbolId: number): Ref[];
 export declare function getPackageGraphWithStatement(stmt: PrepareStatement): CodeMapGraph;

package/dist/codebase-index/writer-schema.d.ts

@@ -1,5 +1,5 @@
 export declare const METADATA_TABLE_SQL = "\n  CREATE TABLE IF NOT EXISTS metadata (\n    key TEXT PRIMARY KEY,\n    value TEXT NOT NULL\n  );\n";
-export declare const CORE_TABLES_SQL = "\n  CREATE TABLE IF NOT EXISTS files (\n    file TEXT PRIMARY KEY,\n    lang TEXT NOT NULL,\n    mtime_ms INTEGER NOT NULL,\n    symbol_count INTEGER NOT NULL DEFAULT 0,\n    last_indexed INTEGER NOT NULL,\n    -- Code Atlas grouping label, computed at index time from the ecosystem's\n    -- own manifests (package.json, go.mod, Cargo.toml, \u2026). Stored rather than\n    -- re-derived per query because the evidence lives on disk, not in the DB.\n    package TEXT NOT NULL DEFAULT ''\n  );\n  CREATE TABLE IF NOT EXISTS symbols (\n    id INTEGER PRIMARY KEY,\n    lang TEXT NOT NULL,\n    kind TEXT NOT NULL,\n    name TEXT NOT NULL,\n    file TEXT NOT NULL,\n    line INTEGER NOT NULL,\n    col INTEGER NOT NULL,\n    signature TEXT NOT NULL DEFAULT '',\n    doc_comment TEXT NOT NULL DEFAULT '',\n    scope TEXT NOT NULL DEFAULT '',\n    text TEXT NOT NULL DEFAULT '',\n    file_fk TEXT NOT NULL\n  );\n";
+export declare const CORE_TABLES_SQL = "\n  CREATE TABLE IF NOT EXISTS files (\n    file TEXT PRIMARY KEY,\n    lang TEXT NOT NULL,\n    mtime_ms INTEGER NOT NULL,\n    -- Phase 2: xxHash64 of the file's UTF-8 bytes. Empty string when the\n    -- indexer hasn't populated it yet (legacy rows, schema repaired by\n    -- repairMissingColumns). Compared on incremental re-index so that a\n    -- touch or branch-switch that leaves content byte-identical skips the\n    -- expensive parse phase entirely (refactoring proposal Phase 2).\n    content_hash TEXT NOT NULL DEFAULT '',\n    symbol_count INTEGER NOT NULL DEFAULT 0,\n    last_indexed INTEGER NOT NULL,\n    -- Code Atlas grouping label, computed at index time from the ecosystem's\n    -- own manifests (package.json, go.mod, Cargo.toml, \u2026). Stored rather than\n    -- re-derived per query because the evidence lives on disk, not in the DB.\n    package TEXT NOT NULL DEFAULT ''\n  );\n  CREATE TABLE IF NOT EXISTS symbols (\n    id INTEGER PRIMARY KEY,\n    lang TEXT NOT NULL,\n    kind TEXT NOT NULL,\n    name TEXT NOT NULL,\n    file TEXT NOT NULL,\n    line INTEGER NOT NULL,\n    col INTEGER NOT NULL,\n    signature TEXT NOT NULL DEFAULT '',\n    doc_comment TEXT NOT NULL DEFAULT '',\n    scope TEXT NOT NULL DEFAULT '',\n    text TEXT NOT NULL DEFAULT '',\n    file_fk TEXT NOT NULL\n  );\n";
 export declare const FILE_INDEX_SQL: readonly ['CREATE INDEX IF NOT EXISTS idx_f_package ON files(package)'];
 export declare const SYMBOL_INDEX_SQL: readonly ['CREATE INDEX IF NOT EXISTS idx_s_name ON symbols(name)', 'CREATE INDEX IF NOT EXISTS idx_s_kind ON symbols(kind)', 'CREATE INDEX IF NOT EXISTS idx_s_lang ON symbols(lang)', 'CREATE INDEX IF NOT EXISTS idx_s_file ON symbols(file)', 'CREATE INDEX IF NOT EXISTS idx_s_lang_kind ON symbols(lang, kind)', 'CREATE INDEX IF NOT EXISTS idx_s_file_fk ON symbols(file_fk)', 'CREATE INDEX IF NOT EXISTS idx_s_name_id ON symbols(name, id)'];
 export declare const REFS_TABLE_SQL = "\n  CREATE TABLE IF NOT EXISTS refs (\n    id INTEGER PRIMARY KEY,\n    from_id INTEGER NOT NULL,\n    to_name TEXT NOT NULL,\n    to_id INTEGER,\n    call_type TEXT NOT NULL,\n    line INTEGER NOT NULL,\n    lang TEXT NOT NULL DEFAULT '',\n    module TEXT,\n    to_file TEXT\n  );\n";
@@ -15,5 +15,12 @@ export declare const REFS_INDEX_SQL: readonly ['CREATE INDEX IF NOT EXISTS idx_r
 export declare const LANG_FAMILY_TABLE_SQL = "\n  CREATE TABLE IF NOT EXISTS lang_family (\n    lang TEXT PRIMARY KEY,\n    family TEXT NOT NULL\n  );\n";
 /** Family value that matches every symbol family, used by language-less refs. */
 export declare const LANG_FAMILY_WILDCARD = "*";
-export declare const SYMBOLS_FTS_SQL = "CREATE VIRTUAL TABLE IF NOT EXISTS symbols_fts USING fts5(text, tokenize = 'unicode61')";
+export declare const SYMBOLS_FTS_SQL = "CREATE VIRTUAL TABLE IF NOT EXISTS symbols_fts USING fts5(text, tokenize = 'trigram')";
+/**
+ * Phase 3: stores 384-dimensional float32 embedding vectors for each symbol.
+ * Vectors are computed from the symbol's indexable text (name + signature +
+ * doc_comment) via the character n-gram hashing embedding in vector-search.ts.
+ * One row per symbol, kept in sync via insertSymbols, delete, and clearAll.
+ */
+export declare const SYMBOL_VECTORS_TABLE_SQL = "\n  CREATE TABLE IF NOT EXISTS symbol_vectors (\n    symbol_id INTEGER PRIMARY KEY,\n    vector BLOB NOT NULL,\n    FOREIGN KEY (symbol_id) REFERENCES symbols(id) ON DELETE CASCADE\n  );\n";
 //# sourceMappingURL=writer-schema.d.ts.map

package/dist/codebase-index/writer.d.ts

@@ -12,6 +12,12 @@ export declare class IndexStore {
      * When false, ranked search falls back to the LIKE + in-process BM25 path.
      */
     private ftsAvailable;
+    /**
+     * Phase 3: true when the `symbol_vectors` table was created successfully.
+     * When false, hybrid search skips the vector pass and falls back to FTS5
+     * (or LIKE) only.
+     */
+    private vectorsAvailable;
     /**
      * Cache of prepared statements keyed by their SQL text. `DatabaseSync`
      * compiles SQL on every `.prepare()` call; for the fixed-SQL methods
@@ -286,6 +292,7 @@ export declare class IndexStore {
         refs: Ref[];
         mtimeMs: number;
         symbolCount: number;
+        contentHash?: string | undefined;
     }>, options?: {
         deleteForFiles?: string[] | undefined;
     }): IndexSymbol[];
@@ -345,6 +352,35 @@ export declare class IndexStore {
         unresolvedCount: number;
         totalMatches: number;
     };
+    /**
+     * Transitive incoming-call tree: all symbols that transitively call the
+     * target, to an unbounded depth (cycle-safe via SQL UNION deduplication).
+     * Used by `codebase-incoming-calls` when the caller wants the full call
+     * chain rather than just direct callers.
+     */
+    findTransitiveIncomingCallsByName(symbolName: string, file?: string, limit?: number): {
+        calls: CallSite[];
+        symbolFound: boolean;
+        ambiguous: boolean;
+        totalMatches: number;
+    };
+    /**
+     * Transitive outgoing-call tree: all symbols the target transitively calls.
+     * Used by `codebase-outgoing-calls` when the caller wants the full
+     * dependency chain rather than just direct callees.
+     */
+    findTransitiveOutgoingCallsByName(symbolName: string, file?: string, limit?: number): {
+        calls: CallSite[];
+        symbolFound: boolean;
+        unresolvedCount: number;
+        totalMatches: number;
+    };
+    /**
+     * Compute the set of symbol IDs reachable from the given seed IDs using a
+     * native SQLite recursive CTE. Used by dead-code detection to replace the
+     * in-memory BFS.
+     */
+    findReachableSymbolIds(seedIds: number[]): Set<number>;
     /**
      * Find all references TO a given symbol (who calls / uses this symbol?).
      */

package/dist/index.d.ts

@@ -5,10 +5,10 @@ export { auditTool } from './audit.js';
 export { bashTool } from './bash.js';
 export { batchToolUseTool } from './batch-tool-use.js';
 export * from './browser/index.js';
-export { builtinTools, OPTIONAL_TOOLS, TIER1_TOOLS, TIER2_TOOLS, TIER3_TOOLS } from './builtin.js';
+export { builtinTools, OFF_ONLY_TOOLS, OPTIONAL_TOOLS, TIER1_TOOLS, TIER2_TOOLS, TIER3_TOOLS, } from './builtin.js';
 export { CircuitBreaker, type CircuitBreakerConfig, type CircuitBreakerSnapshot, } from './circuit-breaker.js';
 export type { CircuitSnapshot, CircuitState, CodeMapGraph, DeadCodeScanInput, DeadCodeScanOutput, DeadFile, DeadPackage, DeadSymbol, GraphEdge, GraphNode, ProjectIndexDaemonAvailability, ProjectIndexServerActivity, ProjectIndexServerClientHealth, ProjectIndexServerConnectionState, ProjectIndexServerConnectionStatus, ProjectIndexServerHealth, } from './codebase-index/index.js';
-export { CircuitOpenError, cancelPendingReindexes, checkCodebaseIndexServerHealth, resolveProjectIndexDaemonAvailability, codebaseIndexStats, codebaseIndexTool, codebaseSearchTool, codebaseStatsTool, deadCodeScanTool, enqueueReindex, ensureCodebaseIndexServer, fileGraphService, getIndexState, IndexCircuitBreaker, IndexTimeoutError, indexCircuitBreaker, isIndexableFile, isIndexing, isIndexReady, onIndexStateChange, packageGraphService, resetIndexCircuitBreaker, runDeadCodeScan, runStartupIndex, searchCodebaseIndex, shutdownCodebaseIndexHost, shutdownCodebaseIndexServer, symbolGraphService, } from './codebase-index/index.js';
+export { CircuitOpenError, cancelPendingReindexes, checkCodebaseIndexServerHealth, codebaseIndexStats, codebaseIndexTool, codebaseSearchTool, codebaseStatsTool, deadCodeScanTool, enqueueReindex, ensureCodebaseIndexServer, fileGraphService, getIndexState, IndexCircuitBreaker, IndexTimeoutError, indexCircuitBreaker, isIndexableFile, isIndexing, isIndexReady, onIndexStateChange, packageGraphService, resetIndexCircuitBreaker, resolveProjectIndexDaemonAvailability, runDeadCodeScan, runStartupIndex, searchCodebaseIndex, shutdownCodebaseIndexHost, shutdownCodebaseIndexServer, symbolGraphService, } from './codebase-index/index.js';
 export { designTool } from './design.js';
 export { diffTool } from './diff.js';
 export { documentTool } from './document.js';
@@ -43,8 +43,9 @@ export { readTool } from './read.js';
 export { replaceTool } from './replace.js';
 export { scaffoldTool } from './scaffold.js';
 export { searchTool } from './search.js';
-export { applySessionKanbanBoardToTodos, applySessionKanbanTaskToSource, attachSessionKanbanMirror, ensureSessionKanbanBoard, hydrateSessionKanban, mirrorSessionPlanToKanban, mirrorSessionTasksToKanban, mirrorSessionTodosToKanban, projectSessionPlanToKanban, projectSessionTasksToKanban, projectSessionTodosToKanban, SESSION_KANBAN_COLUMNS, } from './session-kanban.js';
+export { applySessionKanbanBoardToTodos, applySessionKanbanTaskToSource, attachSessionKanbanMirror, ensureSessionKanbanBoard, hydrateSessionKanban, mirrorSessionPlanToKanban, mirrorSessionTasksToKanban, mirrorSessionTodosToKanban, projectSessionPlanToKanban, projectSessionTasksToKanban, projectSessionTodosToKanban, rebindSessionKanbanTask, SESSION_KANBAN_COLUMNS, } from './session-kanban.js';
 export { makeSkillTool } from './skill.js';
+export { taskTool } from './task.js';
 export { testTool } from './test.js';
 export { todoTool } from './todo.js';
 export { toolHelpTool } from './tool-help.js';