ccsniff 1.1.18 → 1.1.19

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "ccsniff",
-  "version": "1.1.18",
+  "version": "1.1.19",
   "description": "Watch Claude Code JSONL output files and emit structured events as a Node.js EventEmitter",
   "type": "module",
   "main": "./src/index.js",

package/src/index.js

@@ -195,7 +195,7 @@ export function watch(projectsDir) {
 export class JsonlReplayer extends JsonlWatcher {
   constructor(projectsDir = DEFAULT_DIR) { super(projectsDir); }
 
-  replay({ since = 0, files: fileFilter = null } = {}) {
+  replay({ since = 0, files: fileFilter = null, maxEvents = 0 } = {}) {
     const all = [];
     const collect = (dir, depth) => {
       if (depth > 5) return;
@@ -208,9 +208,19 @@ export class JsonlReplayer extends JsonlWatcher {
       } catch {}
     };
     if (fs.existsSync(this._dir)) collect(this._dir, 0);
-    const chosen = fileFilter ? all.filter(fileFilter) : all;
+    let chosen = fileFilter ? all.filter(fileFilter) : all;
+    // When a maxEvents budget is set, read newest files first and stop once the
+    // budget is met — so a huge projects tree never has its full backlog parsed
+    // into the heap at once (the load-time memory peak this guards against).
+    if (maxEvents > 0) {
+      chosen = chosen
+        .map(fp => { try { return { fp, m: fs.statSync(fp).mtimeMs }; } catch { return { fp, m: 0 }; } })
+        .sort((a, b) => b.m - a.m)
+        .map(x => x.fp);
+    }
     let emitted = 0;
     for (const fp of chosen) {
+      if (maxEvents > 0 && emitted >= maxEvents) break;
       const fallbackSid = path.basename(fp, '.jsonl');
       let data;
       try { data = fs.readFileSync(fp, 'utf8'); } catch { continue; }

package/src/store.js

@@ -97,8 +97,16 @@ export class Store {
       if (this.events.length > softCap) this.events.splice(0, this.events.length - this.maxEvents);
     });
     r.on('streaming_error', ev => { this.errors.push({ ts: ev.timestamp, sid: ev.conversationId, error: ev.error, recoverable: ev.recoverable }); });
-    const stats = r.replay({});
+    // Bound the replay to a little above the retention cap and read newest-first,
+    // so a large projects tree never parses its entire backlog into the heap at
+    // once. The post-replay trim then lands exactly on maxEvents.
+    const stats = r.replay({ maxEvents: Math.floor(this.maxEvents * 1.2) });
     this.fileCount = stats.files;
+    // Newest-first file read can leave events out of chronological order; restore
+    // it (downstream sessions/search/snippet logic assumes ascending ts) and
+    // renumber the positional index the BM25 index keys on.
+    this.events.sort((a, b) => (a.ts || 0) - (b.ts || 0));
+    this.events.forEach((e, k) => { e.i = k; });
     this.trimEvents();
     this.rebuildIndex();
     return stats;