scip-query 0.21.0 → 0.22.0

package/CHANGELOG.md

@@ -4,6 +4,78 @@ All notable changes to `scip-query` are documented here. This file starts at 0.1
 
 ## [Unreleased]
 
+## [0.22.0]
+
+### Bounded indexing for large TypeScript repositories
+
+- Single-project TypeScript repositories above ~3,000 compiler inputs are now
+  indexed as balanced compiler shards: path-sorted, byte-weighted partitions,
+  each running as its own scip-typescript process in a memory-gated pool and
+  streamed together byte-for-byte. A repository whose monolithic program
+  exceeded the default child heap now indexes with every child bounded near
+  5 GB. Shard planning also learns from measured shard durations
+  (`typescript-shard-costs.json` in the cache directory), so partitions
+  converge toward equal wall time rather than equal bytes.
+- `reindex --force` now rebuilds everything by design: cached language shards,
+  per-project shards, and incremental materialization are all bypassed, and
+  the force flag implies the whole-project rebuild permission.
+- The reindex coordinator no longer deserializes the whole SCIP index to
+  sanitize, read metadata, or rebase project roots — those paths stream over
+  the protobuf wire format, so forced full reindexes complete within the
+  default Node.js heap.
+
+### SCIP to SQLite conversion in-process
+
+- The external `scip expt-convert` binary is no longer required: a streaming
+  converter ports the Go tool's exact relational output (canonical occurrence
+  ordering, chunking, mentions, enclosing ranges, byte-identical schema) and
+  runs in-process, faster than the spawned CLI. Set
+  `SCIP_QUERY_SQLITE_CONVERTER=scip-cli` to restore the previous behavior.
+
+### Bounded and faster health analysis
+
+- `health --full` semantic prewarm computes callee evidence in persisted file
+  batches and releases its compiler session only under measured heap
+  pressure, so the prewarm converges across runs instead of losing all work
+  to one out-of-memory crash. Consumer classification reads its persisted
+  usage product before parsing, and whole-repository sweeps use cursor
+  traversal, keeping every health phase worker bounded.
+
+### Runtime-boundary extraction reuse
+
+- Direct per-file extraction results persist as a content-addressed evidence
+  product that names every consulted file (imported constants, resolved call
+  targets, definition owners) with its content hash and revalidates them on
+  every read. Warm full rebuilds skip the extraction sweep entirely, and the
+  cross-file staleness hole in incremental per-file reuse is closed.
+- Extraction yields the event loop during whole-repository sweeps so
+  tree-sitter's native memory is released mid-sweep instead of at phase exit.
+- A forced rebuild with an unchanged input snapshot no longer runs the
+  affected-set shadow's whole-index digest oracle, which could misreport tool
+  drift as predictor failure; reused indexes keep their drift oracle.
+
+### Watch service resilience under edit churn
+
+- Rapid consecutive edits could fill the TypeScript index-service mailbox
+  with responses whose cancelled requesters would never read them, and the
+  resulting backpressure fatally stopped the watch service. Responses now
+  expire shortly after their requester's deadline, capacity pressure reclaims
+  abandoned responses and sheds individual completions instead of stopping
+  the service, and a requester that stops waiting removes its own pending
+  request.
+
+## [0.21.1]
+
+### Query service resource efficiency
+
+- Concurrent cold clients now elect one startup owner per query-service lane
+  before spawning Node.js. This prevents duplicate contenders from loading the
+  full query runtime while the lane's durable server state is still being
+  published.
+- The default query-service pool is capped at four lanes instead of six. The
+  `SCIP_QUERY_QUERY_SERVICE_POOL_SIZE` override remains available for workloads
+  that deliberately trade additional memory for higher parallel throughput.
+
 ## [0.21.0]
 
 ### Faster indexing and warm queries

package/dist/augment-vue-worker.js

@@ -1,2 +1,2 @@
-import{c as t}from"./chunk-UNORWZIJ.js";import"./chunk-YUKYB54I.js";import"./chunk-GFLTPNWV.js";import"./chunk-7IOAZRVL.js";import"./chunk-VWLIOEEF.js";import"./chunk-4DCKBY6T.js";import{writeFileSync as s}from"fs";import{workerData as o}from"worker_threads";var r=o;try{let e=t({projectRoot:r.projectRoot,dbPath:r.dbPath,tsconfig:r.tsconfig,vueFiles:r.vueFiles,tasks:r.tasks});s(r.resultPath,JSON.stringify({version:1,runId:r.runId,workerId:r.workerId,taskIds:r.taskIds,ok:!0,result:e}))}catch(e){s(r.resultPath,JSON.stringify({version:1,runId:r.runId,workerId:r.workerId,taskIds:r.taskIds,ok:!1,error:e instanceof Error?e.message:String(e)}))}
+import{d as t}from"./chunk-FFJQZG6J.js";import"./chunk-YUKYB54I.js";import"./chunk-BJT7LSPK.js";import"./chunk-YXPUP5G2.js";import"./chunk-NRBNAECH.js";import"./chunk-IW5XQG5G.js";import"./chunk-AK3PYTIK.js";import{writeFileSync as s}from"fs";import{workerData as o}from"worker_threads";var r=o;try{let e=t({projectRoot:r.projectRoot,dbPath:r.dbPath,tsconfig:r.tsconfig,vueFiles:r.vueFiles,tasks:r.tasks});s(r.resultPath,JSON.stringify({version:1,runId:r.runId,workerId:r.workerId,taskIds:r.taskIds,ok:!0,result:e}))}catch(e){s(r.resultPath,JSON.stringify({version:1,runId:r.runId,workerId:r.workerId,taskIds:r.taskIds,ok:!1,error:e instanceof Error?e.message:String(e)}))}
 //# sourceMappingURL=augment-vue-worker.js.map

package/dist/by-kind-4IYG2SKW.js

@@ -0,0 +1,2 @@
+import{a,b}from"./chunk-JAT6C3VX.js";import"./chunk-MTDBHTSF.js";import"./chunk-C7IJMOFP.js";import"./chunk-YXPUP5G2.js";import"./chunk-DRENNWRG.js";import"./chunk-DKM723YF.js";import"./chunk-K3XFWJI2.js";import"./chunk-IW5XQG5G.js";import"./chunk-H5EXS3HM.js";import"./chunk-HGFDYOVB.js";import"./chunk-AK3PYTIK.js";export{a as byKind,b as kindCounts};
+//# sourceMappingURL=by-kind-4IYG2SKW.js.map

package/dist/call-graph-WQNXMNNN.js

@@ -0,0 +1,2 @@
+import{a}from"./chunk-GQIDEID3.js";import"./chunk-7KCZELVM.js";import"./chunk-BGBBVSH4.js";import"./chunk-6NC3YSPY.js";import"./chunk-MTDBHTSF.js";import"./chunk-IXESDH3J.js";import"./chunk-OXYAWIEA.js";import"./chunk-FKGQOTKD.js";import"./chunk-2XCGSDIT.js";import"./chunk-WRQXLNYE.js";import"./chunk-T6QD2ZQB.js";import"./chunk-EELPBR7E.js";import"./chunk-BJT7LSPK.js";import"./chunk-WSLEJSFR.js";import"./chunk-VUSKPCUB.js";import"./chunk-F4FNK44D.js";import"./chunk-HCVJR2V4.js";import"./chunk-EETGXQY7.js";import"./chunk-TQZV7KV4.js";import"./chunk-C7IJMOFP.js";import"./chunk-YXPUP5G2.js";import"./chunk-DRENNWRG.js";import"./chunk-BVFYEEBH.js";import"./chunk-JHH5SCZ3.js";import"./chunk-ENWQWA2R.js";import"./chunk-DKM723YF.js";import"./chunk-K3XFWJI2.js";import"./chunk-IW5XQG5G.js";import"./chunk-JT6XX7QY.js";import"./chunk-H5EXS3HM.js";import"./chunk-HGFDYOVB.js";import"./chunk-SB25YMEQ.js";import"./chunk-AK3PYTIK.js";export{a as callGraph};
+//# sourceMappingURL=call-graph-WQNXMNNN.js.map

package/dist/{chunk-AQDWTCDC.js → chunk-25GWKRUZ.js}

@@ -1,2 +1,2 @@
-import{a as d,b as m}from"./chunk-5SE323LF.js";import{c as u}from"./chunk-KMVGRIO2.js";import{b as c}from"./chunk-7COHFNJK.js";function y(t,e={}){let{minSimilarity:o=.5,limit:l=20,scope:n,filePattern:p}=e,r=e.minDeps??(p?1:3),{profiles:i,distinctiveDeps:f}=D(t,{scope:n,minDeps:r}),s=d(i,a=>a.deps);return m({profiles:i,limit:l,filePattern:p,overrunFactor:5,candidateIndex:s,profile:{name:"similar-files"},compare:(a,g)=>F(a,g,o,f)})}function D(t,e){let{scope:o,minDeps:l}=e,n=c(t,o),{universalDeps:p,distinctiveDeps:r}=S(n),i=[];for(let[f,s]of n)s.size>=l&&i.push({file:f,deps:new Set([...s].filter(a=>!p.has(a)))});return{profiles:i,distinctiveDeps:r}}function S(t){let e=new Set,o=new Set,l=t.size;if(l===0)return{universalDeps:e,distinctiveDeps:o};let n=new Map;for(let r of t.values())for(let i of r)n.set(i,(n.get(i)??0)+1);let p=Math.max(3,Math.ceil(l*.03));for(let[r,i]of n)i>=5&&i/l>.3?e.add(r):i<=p&&o.add(r);return{universalDeps:e,distinctiveDeps:o}}function F(t,e,o,l){let n=new Set;for(let s of t.deps)e.deps.has(s)&&n.add(s);if(n.size<3||t.deps.size<4||e.deps.size<4)return null;let p=0;for(let s of n)l.has(s)&&p++;if(p<2)return null;let r=u(t.deps,e.deps);if(r<o)return null;let i=[];for(let s of t.deps)e.deps.has(s)||i.push(s);let f=[];for(let s of e.deps)t.deps.has(s)||f.push(s);return{fileA:t.file,fileB:e.file,similarity:r,sharedDeps:[...n],uniqueToA:i,uniqueToB:f}}export{y as a};
-//# sourceMappingURL=chunk-AQDWTCDC.js.map
+import{a as d,b as m}from"./chunk-FGNCOQUX.js";import{c as u}from"./chunk-KMVGRIO2.js";import{b as c}from"./chunk-4GAQ6FI4.js";function y(t,e={}){let{minSimilarity:o=.5,limit:l=20,scope:n,filePattern:p}=e,r=e.minDeps??(p?1:3),{profiles:i,distinctiveDeps:f}=D(t,{scope:n,minDeps:r}),s=d(i,a=>a.deps);return m({profiles:i,limit:l,filePattern:p,overrunFactor:5,candidateIndex:s,profile:{name:"similar-files"},compare:(a,g)=>F(a,g,o,f)})}function D(t,e){let{scope:o,minDeps:l}=e,n=c(t,o),{universalDeps:p,distinctiveDeps:r}=S(n),i=[];for(let[f,s]of n)s.size>=l&&i.push({file:f,deps:new Set([...s].filter(a=>!p.has(a)))});return{profiles:i,distinctiveDeps:r}}function S(t){let e=new Set,o=new Set,l=t.size;if(l===0)return{universalDeps:e,distinctiveDeps:o};let n=new Map;for(let r of t.values())for(let i of r)n.set(i,(n.get(i)??0)+1);let p=Math.max(3,Math.ceil(l*.03));for(let[r,i]of n)i>=5&&i/l>.3?e.add(r):i<=p&&o.add(r);return{universalDeps:e,distinctiveDeps:o}}function F(t,e,o,l){let n=new Set;for(let s of t.deps)e.deps.has(s)&&n.add(s);if(n.size<3||t.deps.size<4||e.deps.size<4)return null;let p=0;for(let s of n)l.has(s)&&p++;if(p<2)return null;let r=u(t.deps,e.deps);if(r<o)return null;let i=[];for(let s of t.deps)e.deps.has(s)||i.push(s);let f=[];for(let s of e.deps)t.deps.has(s)||f.push(s);return{fileA:t.file,fileB:e.file,similarity:r,sharedDeps:[...n],uniqueToA:i,uniqueToB:f}}export{y as a};
+//# sourceMappingURL=chunk-25GWKRUZ.js.map