@wrongstack/tools 0.313.0 → 0.316.1

package/dist/codebase-index/tree-sitter/visitor.d.ts

@@ -30,7 +30,7 @@ import type { Tree } from 'web-tree-sitter';
 import type { Symbol as IndexSymbol, Ref, SymbolLang } from '../schema.js';
 import type { NodeQueries } from './queries.js';
 /** Result of walking one parsed file. */
-export interface VisitResult {
+interface VisitResult {
     symbols: IndexSymbol[];
     refs: Ref[];
 }
@@ -45,4 +45,5 @@ export interface VisitResult {
  *   `queries`  — per-language node-mapping table.
  */
 export declare function visitTree(tree: Tree, content: string, file: string, lang: SymbolLang, queries: NodeQueries): VisitResult;
+export {};
 //# sourceMappingURL=visitor.d.ts.map

package/dist/codebase-index/tree-sitter-parser.d.ts

@@ -23,8 +23,6 @@
  *     file from the index" contract.
  */
 import type { FileSymbols, SymbolLang } from './schema.js';
-/** True when this lang has a tree-sitter grammar available right now. */
-export declare function isTreeSitterSupported(lang: SymbolLang): boolean;
 /** Visible for tests: the absolute path to a vendored grammar WASM. */
 export declare function getGrammarWasmPath(lang: SymbolLang): string | undefined;
 /**

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

@@ -11,7 +11,7 @@
  * assigning unique ids during insertion.
  */
 import type { FileSymbols, SymbolLang } from './schema.js';
-export interface ParseOptions {
+interface ParseOptions {
     file: string;
     content: string;
     lang: SymbolLang;

package/dist/codebase-index/vector-search.d.ts

@@ -55,7 +55,7 @@ export declare function decodeVector(buf: Buffer | Uint8Array): Float32Array;
  * Rank map: symbolId → rank (0-based). Lower rank = more relevant.
  * Built from a search result list (already sorted by relevance).
  */
-export type RankMap = Map<number, number>;
+type RankMap = Map<number, number>;
 /** Build a RankMap from a sorted result list. */
 export declare function buildRankMap(sortedIds: number[]): RankMap;
 /**
@@ -71,4 +71,5 @@ export declare function buildRankMap(sortedIds: number[]): RankMap;
  * @returns sorted [symbolId, rrfScore] pairs, descending by score
  */
 export declare function reciprocalRankFusion(bm25Ranks: RankMap, vectorRanks: RankMap, k?: number): Array<[number, number]>;
+export {};
 //# sourceMappingURL=vector-search.d.ts.map

package/dist/codebase-index/wal-maintenance.d.ts

@@ -17,7 +17,7 @@
  * idle-exit, and firing is harmless at any point because checkpointWal is
  * best-effort.
  */
-export interface WalMaintenanceOptions {
+interface WalMaintenanceOptions {
     /** Idle window after a write completion before maintenance fires. */
     idleMs?: number | undefined;
     /** Run `optimize()` once every N maintenance fires. Default: 8. */
@@ -27,7 +27,7 @@ export interface WalMaintenanceOptions {
     /** Clear for tests. */
     clearTimeoutFn?: typeof clearTimeout | undefined;
 }
-export interface WalMaintenanceHooks {
+interface WalMaintenanceHooks {
     /** Returns true when a checkpoint completed (WAL reset). */
     checkpoint: () => boolean;
     /** Recompute statistics. */
@@ -55,4 +55,5 @@ export declare class WalMaintenance {
     /** Stop all maintenance. Idempotent; safe to call on every shutdown path. */
     dispose(): void;
 }
+export {};
 //# sourceMappingURL=wal-maintenance.d.ts.map