@copilotkit/aimock 1.37.1 → 1.37.2

package/CHANGELOG.md

@@ -1,5 +1,15 @@
 # @copilotkit/aimock
 
+## [1.37.2] - 2026-07-17
+
+### Fixed
+
+- Prevent `Invalid string length` crash on `GET /__aimock/journal` by capping retained request bodies at 64 KB (#308)
+
+### Changed
+
+- Log full error stack on unhandled request errors for prod diagnosis (#308)
+
 ## [1.37.1] - 2026-07-16
 
 ### Fixed

package/dist/config-loader.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"config-loader.d.cts","names":[],"sources":["../src/config-loader.ts"],"sourcesContent":[],"mappings":";;;;;;;;UAeiB,aAAA,SAAsB;;AAAvC;AAIiB,UAAA,iBAAA,CAAiB;EASjB,GAAA,EAAA,MAAA;EAAgB,IAAA,EAAA,MAAA;UAEnB,CAAA,EAAA,MAAA;aAF2B,CAAA,EAAA,MAAA;EAAmB,IAAA,CAAA,EAAA,MAAA;EAM3C,IAAA,CAAA,EAAA,MAAS;;AAGhB,UATO,eAAA,SAAwB,mBAS/B,CAAA;QACI,CAAA,EAAA;IACF,QAAA,EATE,KASF,CAAA;MAAe,IAAA,EAAA,MAAA;MAGV,OAAA,EAAA;QAAgB,IAAA,EAAA,MAAA;QAEvB,IAAA,EAAA,MAAA;MACI,CAAA;IACH,CAAA,CAAA;EAAc,CAAA;AAIzB;AAAgC,UAhBf,SAAA,CAgBe;MACnB,CAAA,EAAA,MAAA;YACH,CAAA,EAAA;IACS,IAAA,EAAA,MAAA;IAHqB,OAAA,EAAA,MAAA;EAAkB,CAAA;EAMzC,KAAA,CAAA,EAnBP,aAmBgB,EAAA;EAKT,SAAA,CAAA,EAvBH,iBAuBoB,EAAA;EAOjB,OAAA,CAAA,EA7BL,eA+BC,EAAA;AAGb;AAAuC,UA/BtB,gBAAA,CA+BsB;SAMxB,EAAA,MAAA;OAHH,CAAA,EAhCF,OAgCE,EAAA;WAKK,CAAA,EApCH,WAoCG,EAAA;EAAW,MAAA,CAAA,EAnCjB,cAmCiB,EAAA;EAGX,OAAA,CAAA,EAAA,MAAY;AAK7B;AAA6B,UAvCZ,cAAA,SAAuB,kBAuCX,CAAA;UAOjB,CAAA,EA7CC,gBA6CD,EAAA;OACC,CAAA,EA7CH,gBA6CG,EAAA;gBAEL,CAAA,EA9CW,gBA8CX,EAAA;;AAEC,UA7CQ,SAAA,CA6CR;MACE,CAAA,EAAA,MAAA;EAAY,MAAA,CAAA,EA5CZ,cA4CY,EAAA;AAQvB;AAKsB,UAtDL,iBAAA,CAsDoB;EAAA,KAAA,EAAA;IAC3B,OAAA,CAAA,EAAA,MAAA;IAEW,UAAA,CAAA,EAAA,MAAA;IAAlB,QAAA,CAAA,EAAA,MAAA;IAAO,QAAA,CAAA,EAAA,MAAA;;;WAtDC;;;UAIM,UAAA;;aAEJ;;UAGI,sBAAA;;;YAGL;;;eAGG;;iBAEE;;UAGA,YAAA;;gBAED;;UAGC,YAAA;;;;;;;YAOL;aACC;;QAEL;QACA;SACC;WACE;;;;;;;;;;;iBAQK,UAAA,sBAAgC;iBAK1B,eAAA,SACZ;;;IAEP;UAAkB"}
+{"version":3,"file":"config-loader.d.cts","names":[],"sources":["../src/config-loader.ts"],"sourcesContent":[],"mappings":";;;;;;;;UAeiB,aAAA,SAAsB;;AAAvC;AAIiB,UAAA,iBAAA,CAAiB;EASjB,GAAA,EAAA,MAAA;EAAgB,IAAA,EAAA,MAAA;UAEnB,CAAA,EAAA,MAAA;aAF2B,CAAA,EAAA,MAAA;EAAmB,IAAA,CAAA,EAAA,MAAA;EAM3C,IAAA,CAAA,EAAA,MAAS;;AAGhB,UATO,eAAA,SAAwB,mBAS/B,CAAA;QACI,CAAA,EAAA;IACF,QAAA,EATE,KASF,CAAA;MAAe,IAAA,EAAA,MAAA;MAGV,OAAA,EAAA;QAAgB,IAAA,EAAA,MAAA;QAEvB,IAAA,EAAA,MAAA;MACI,CAAA;IACH,CAAA,CAAA;EAAc,CAAA;AAIzB;AAAgC,UAhBf,SAAA,CAgBe;MACnB,CAAA,EAAA,MAAA;YACH,CAAA,EAAA;IACS,IAAA,EAAA,MAAA;IAHqB,OAAA,EAAA,MAAA;EAAkB,CAAA;EAMzC,KAAA,CAAA,EAnBP,aAmBgB,EAEf;EAGM,SAAA,CAAA,EAvBH,iBAuBoB,EAGvB;EAIM,OAAA,CAAA,EA7BL,eA+BC,EAAA;AAGb;AAAuC,UA/BtB,gBAAA,CA+BsB;SAMxB,EAAA,MAAA;OAHH,CAAA,EAhCF,OAgCE,EAAA;WAKK,CAAA,EApCH,WAoCG,EAAA;EAAW,MAAA,CAAA,EAnCjB,cAmCiB,EAAA;EAGX,OAAA,CAAA,EAAA,MAAY;AAK7B;AAA6B,UAvCZ,cAAA,SAAuB,kBAuCX,CAAA;UAOjB,CAAA,EA7CC,gBA6CD,EAAA;OACC,CAAA,EA7CH,gBA6CG,EAAA;gBAEL,CAAA,EA9CW,gBA8CX,EAAA;;AAEC,UA7CQ,SAAA,CA6CR;MACE,CAAA,EAAA,MAAA;EAAY,MAAA,CAAA,EA5CZ,cA4CY,EAAA;AAQvB;AAKsB,UAtDL,iBAAA,CAsDoB;EAAA,KAAA,EAAA;IAC3B,OAAA,CAAA,EAAA,MAAA;IAEW,UAAA,CAAA,EAAA,MAAA;IAAlB,QAAA,CAAA,EAAA,MAAA;IAAO,QAAA,CAAA,EAAA,MAAA;;;WAtDC;;;UAIM,UAAA;;aAEJ;;UAGI,sBAAA;;;YAGL;;;eAGG;;iBAEE;;UAGA,YAAA;;gBAED;;UAGC,YAAA;;;;;;;YAOL;aACC;;QAEL;QACA;SACC;WACE;;;;;;;;;;;iBAQK,UAAA,sBAAgC;iBAK1B,eAAA,SACZ;;;IAEP;UAAkB"}

package/dist/config-loader.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"config-loader.d.ts","names":[],"sources":["../src/config-loader.ts"],"sourcesContent":[],"mappings":";;;;;;;;UAeiB,aAAA,SAAsB;;AAAvC;AAIiB,UAAA,iBAAA,CAAiB;EASjB,GAAA,EAAA,MAAA;EAAgB,IAAA,EAAA,MAAA;UAEnB,CAAA,EAAA,MAAA;aAF2B,CAAA,EAAA,MAAA;EAAmB,IAAA,CAAA,EAAA,MAAA;EAM3C,IAAA,CAAA,EAAA,MAAS;;AAGhB,UATO,eAAA,SAAwB,mBAS/B,CAAA;QACI,CAAA,EAAA;IACF,QAAA,EATE,KASF,CAAA;MAAe,IAAA,EAAA,MAAA;MAGV,OAAA,EAAA;QAAgB,IAAA,EAAA,MAAA;QAEvB,IAAA,EAAA,MAAA;MACI,CAAA;IACH,CAAA,CAAA;EAAc,CAAA;AAIzB;AAAgC,UAhBf,SAAA,CAgBe;MACnB,CAAA,EAAA,MAAA;YACH,CAAA,EAAA;IACS,IAAA,EAAA,MAAA;IAHqB,OAAA,EAAA,MAAA;EAAkB,CAAA;EAMzC,KAAA,CAAA,EAnBP,aAmBgB,EAEf;EAGM,SAAA,CAAA,EAvBH,iBAuBoB,EAGvB;EAIM,OAAA,CAAA,EA7BL,eA+BC,EAAA;AAGb;AAAuC,UA/BtB,gBAAA,CA+BsB;SAMxB,EAAA,MAAA;OAHH,CAAA,EAhCF,OAgCE,EAAA;WAKK,CAAA,EApCH,WAoCG,EAAA;EAAW,MAAA,CAAA,EAnCjB,cAmCiB,EAAA;EAGX,OAAA,CAAA,EAAA,MAAY;AAK7B;AAA6B,UAvCZ,cAAA,SAAuB,kBAuCX,CAAA;UAOjB,CAAA,EA7CC,gBA6CD,EAAA;OACC,CAAA,EA7CH,gBA6CG,EAAA;gBAEL,CAAA,EA9CW,gBA8CX,EAAA;;AAEC,UA7CQ,SAAA,CA6CR;MACE,CAAA,EAAA,MAAA;EAAY,MAAA,CAAA,EA5CZ,cA4CY,EAAA;AAQvB;AAKsB,UAtDL,iBAAA,CAsDoB;EAAA,KAAA,EAAA;IAC3B,OAAA,CAAA,EAAA,MAAA;IAEW,UAAA,CAAA,EAAA,MAAA;IAAlB,QAAA,CAAA,EAAA,MAAA;IAAO,QAAA,CAAA,EAAA,MAAA;;;WAtDC;;;UAIM,UAAA;;aAEJ;;UAGI,sBAAA;;;YAGL;;;eAGG;;iBAEE;;UAGA,YAAA;;gBAED;;UAGC,YAAA;;;;;;;YAOL;aACC;;QAEL;QACA;SACC;WACE;;;;;;;;;;;iBAQK,UAAA,sBAAgC;iBAK1B,eAAA,SACZ;;;IAEP;UAAkB"}
+{"version":3,"file":"config-loader.d.ts","names":[],"sources":["../src/config-loader.ts"],"sourcesContent":[],"mappings":";;;;;;;;UAeiB,aAAA,SAAsB;;AAAvC;AAIiB,UAAA,iBAAA,CAAiB;EASjB,GAAA,EAAA,MAAA;EAAgB,IAAA,EAAA,MAAA;UAEnB,CAAA,EAAA,MAAA;aAF2B,CAAA,EAAA,MAAA;EAAmB,IAAA,CAAA,EAAA,MAAA;EAM3C,IAAA,CAAA,EAAA,MAAS;;AAGhB,UATO,eAAA,SAAwB,mBAS/B,CAAA;QACI,CAAA,EAAA;IACF,QAAA,EATE,KASF,CAAA;MAAe,IAAA,EAAA,MAAA;MAGV,OAAA,EAAA;QAAgB,IAAA,EAAA,MAAA;QAEvB,IAAA,EAAA,MAAA;MACI,CAAA;IACH,CAAA,CAAA;EAAc,CAAA;AAIzB;AAAgC,UAhBf,SAAA,CAgBe;MACnB,CAAA,EAAA,MAAA;YACH,CAAA,EAAA;IACS,IAAA,EAAA,MAAA;IAHqB,OAAA,EAAA,MAAA;EAAkB,CAAA;EAMzC,KAAA,CAAA,EAnBP,aAmBgB,EAAA;EAKT,SAAA,CAAA,EAvBH,iBAuBoB,EAAA;EAOjB,OAAA,CAAA,EA7BL,eA+BC,EAAA;AAGb;AAAuC,UA/BtB,gBAAA,CA+BsB;SAMxB,EAAA,MAAA;OAHH,CAAA,EAhCF,OAgCE,EAAA;WAKK,CAAA,EApCH,WAoCG,EAAA;EAAW,MAAA,CAAA,EAnCjB,cAmCiB,EAAA;EAGX,OAAA,CAAA,EAAA,MAAY;AAK7B;AAA6B,UAvCZ,cAAA,SAAuB,kBAuCX,CAAA;UAOjB,CAAA,EA7CC,gBA6CD,EAAA;OACC,CAAA,EA7CH,gBA6CG,EAAA;gBAEL,CAAA,EA9CW,gBA8CX,EAAA;;AAEC,UA7CQ,SAAA,CA6CR;MACE,CAAA,EAAA,MAAA;EAAY,MAAA,CAAA,EA5CZ,cA4CY,EAAA;AAQvB;AAKsB,UAtDL,iBAAA,CAsDoB;EAAA,KAAA,EAAA;IAC3B,OAAA,CAAA,EAAA,MAAA;IAEW,UAAA,CAAA,EAAA,MAAA;IAAlB,QAAA,CAAA,EAAA,MAAA;IAAO,QAAA,CAAA,EAAA,MAAA;;;WAtDC;;;UAIM,UAAA;;aAEJ;;UAGI,sBAAA;;;YAGL;;;eAGG;;iBAEE;;UAGA,YAAA;;gBAED;;UAGC,YAAA;;;;;;;YAOL;aACC;;QAEL;QACA;SACC;WACE;;;;;;;;;;;iBAQK,UAAA,sBAAgC;iBAK1B,eAAA,SACZ;;;IAEP;UAAkB"}

package/dist/journal.cjs

@@ -3,6 +3,39 @@ const require_helpers = require('./helpers.cjs');
 
 //#region src/journal.ts
 /**
+* Maximum UTF-8 byte length of a serialized request body retained in a
+* journal entry. Bodies whose JSON serialization exceeds this byte size are
+* replaced with a truncation marker.
+*
+* Only the request `body` field is capped here. `headers` and `path` are
+* retained uncapped, but they are naturally bounded by Node's default ~16 KB
+* maximum HTTP header size, so the per-entry overhead beyond the body cap
+* remains small. Combined with the journal's maxEntries limit (default 1000),
+* the total `JSON.stringify(journal.getAll())` output stays well under V8's
+* ~512 MB string limit even at maximum capacity.
+*/
+const JOURNAL_BODY_CAP_BYTES = 64 * 1024;
+/**
+* If `body` serializes to more than JOURNAL_BODY_CAP_BYTES (in UTF-8 bytes),
+* replace it with a truncation marker. Returns the original body when within
+* the cap, or null when `body` is null.
+*
+* The gate uses Buffer.byteLength (UTF-8 bytes) rather than .length (UTF-16
+* code units) to match the constant name and to correctly cap multibyte
+* content (e.g. CJK/emoji) whose code-unit count falls under the threshold
+* but whose byte size does not.
+*/
+function capBody(body) {
+	if (body === null) return null;
+	const serialized = JSON.stringify(body);
+	if (Buffer.byteLength(serialized, "utf8") <= JOURNAL_BODY_CAP_BYTES) return body;
+	return {
+		__aimock_truncated: true,
+		originalByteSize: Buffer.byteLength(serialized, "utf8"),
+		note: "body truncated by aimock journal cap (64 KB limit)"
+	};
+}
+/**
 * Compare two field values, handling RegExp by source+flags rather than reference.
 */
 function fieldEqual(a, b) {
@@ -47,7 +80,8 @@ var Journal = class {
 		const full = {
 			id: require_helpers.generateId("req"),
 			timestamp: Date.now(),
-			...entry
+			...entry,
+			body: capBody(entry.body)
 		};
 		this.entries.push(full);
 		if (this.maxEntries > 0 && this.entries.length > this.maxEntries) this.entries.shift();

package/dist/journal.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"journal.cjs","names":["DEFAULT_TEST_ID","generateId"],"sources":["../src/journal.ts"],"sourcesContent":["import { generateId } from \"./helpers.js\";\nimport type { Fixture, FixtureMatch, JournalEntry } from \"./types.js\";\nimport { DEFAULT_TEST_ID } from \"./constants.js\";\nexport { DEFAULT_TEST_ID } from \"./constants.js\";\n\n/**\n * Compare two field values, handling RegExp by source+flags rather than reference.\n */\nfunction fieldEqual(a: unknown, b: unknown): boolean {\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return a === b;\n}\n\n/**\n * Compare two systemMessage values. Handles string, string[], and RegExp.\n * Both-undefined is treated as equal.\n */\nfunction systemMessageEqual(\n  a: string | string[] | RegExp | undefined,\n  b: string | string[] | RegExp | undefined,\n): boolean {\n  if (a === undefined && b === undefined) return true;\n  if (a === undefined || b === undefined) return false;\n  if (typeof a === \"string\" && typeof b === \"string\") return a === b;\n  if (Array.isArray(a) && Array.isArray(b))\n    return a.length === b.length && a.every((v, i) => v === b[i]);\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return false;\n}\n\n/**\n * Check whether two fixture match objects have the same criteria\n * (ignoring sequenceIndex). Used to group sequenced fixtures.\n */\nfunction matchCriteriaEqual(a: FixtureMatch, b: FixtureMatch): boolean {\n  return (\n    fieldEqual(a.userMessage, b.userMessage) &&\n    systemMessageEqual(a.systemMessage, b.systemMessage) &&\n    fieldEqual(a.inputText, b.inputText) &&\n    fieldEqual(a.toolCallId, b.toolCallId) &&\n    fieldEqual(a.toolName, b.toolName) &&\n    fieldEqual(a.model, b.model) &&\n    fieldEqual(a.responseFormat, b.responseFormat) &&\n    fieldEqual(a.predicate, b.predicate) &&\n    fieldEqual(a.endpoint, b.endpoint) &&\n    fieldEqual(a.turnIndex, b.turnIndex) &&\n    fieldEqual(a.hasToolResult, b.hasToolResult)\n  );\n}\n\nexport interface JournalOptions {\n  /**\n   * Maximum number of entries to retain. When exceeded, oldest entries are\n   * dropped FIFO. Set to 0 (or omit) for unbounded retention (the historical\n   * default — suitable for short-lived test runs only). Negative values are\n   * rejected at the CLI parse layer; programmatically they are treated as 0\n   * (unbounded) for back-compat.\n   *\n   * Long-running servers (e.g. mock proxies in CI/demo environments) should\n   * always set a finite cap: every request appends an entry holding the\n   * request body + headers + fixture reference, and without a cap the\n   * journal grows until the process OOMs.\n   */\n  maxEntries?: number;\n  /**\n   * Maximum number of unique testIds retained in the fixture match-count\n   * map (`fixtureMatchCountsByTestId`). When exceeded, the oldest testId\n   * (by first-insertion order) is evicted FIFO. Set to 0 (or omit) for\n   * unbounded retention. Negative values are rejected at the CLI parse\n   * layer; programmatically they are treated as 0 (unbounded) for\n   * back-compat. Without a cap this map can grow over time in long-running\n   * servers that see many unique testIds.\n   */\n  fixtureCountsMaxTestIds?: number;\n}\n\nexport class Journal {\n  private entries: JournalEntry[] = [];\n  private readonly fixtureMatchCountsByTestId: Map<string, Map<Fixture, number>> = new Map();\n  private readonly maxEntries: number;\n  private readonly fixtureCountsMaxTestIds: number;\n\n  constructor(options: JournalOptions = {}) {\n    // Treat 0 or negative as \"unbounded\" to preserve prior behavior when\n    // the option is omitted or explicitly disabled.\n    const cap = options.maxEntries;\n    this.maxEntries = cap !== undefined && cap > 0 ? cap : 0;\n    const testIdCap = options.fixtureCountsMaxTestIds;\n    this.fixtureCountsMaxTestIds = testIdCap !== undefined && testIdCap > 0 ? testIdCap : 0;\n  }\n\n  /** Backwards-compatible accessor — returns the default (no testId) count map. */\n  get fixtureMatchCounts(): Map<Fixture, number> {\n    return this.getFixtureMatchCountsForTest(DEFAULT_TEST_ID);\n  }\n\n  add(entry: Omit<JournalEntry, \"id\" | \"timestamp\">): JournalEntry {\n    const full: JournalEntry = {\n      id: generateId(\"req\"),\n      timestamp: Date.now(),\n      ...entry,\n    };\n    this.entries.push(full);\n    // FIFO eviction when over capacity. Array.prototype.shift() is O(n)\n    // regardless of how many we drop per add; we accept it at small caps\n    // (default 1000) because the constant factor is tiny and this runs once\n    // per request. For much larger caps, switch to a ring buffer for true\n    // O(1) eviction.\n    if (this.maxEntries > 0 && this.entries.length > this.maxEntries) {\n      this.entries.shift();\n    }\n    return full;\n  }\n\n  getAll(opts?: { limit?: number }): JournalEntry[] {\n    if (opts?.limit !== undefined) {\n      return this.entries.slice(-opts.limit);\n    }\n    return this.entries.slice();\n  }\n\n  getLast(): JournalEntry | null {\n    return this.entries.length > 0 ? this.entries[this.entries.length - 1] : null;\n  }\n\n  findByFixture(fixture: Fixture): JournalEntry[] {\n    return this.entries.filter((e) => e.response.fixture === fixture);\n  }\n\n  /**\n   * READ-ONLY accessor. Returns the existing count map for `testId`, or an\n   * empty transient Map if none exists. Does NOT insert into the cache and\n   * does NOT trigger FIFO eviction — callers may read freely without\n   * perturbing cache state. For the write path, see\n   * `getOrCreateFixtureMatchCountsForTest`.\n   */\n  getFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    return this.fixtureMatchCountsByTestId.get(testId) ?? new Map();\n  }\n\n  /**\n   * WRITE path: get the count map for `testId`, inserting a fresh empty Map\n   * if missing and running FIFO eviction when the testId cap is exceeded.\n   * Only callers that intend to mutate the map (e.g. incrementing a count)\n   * should use this.\n   */\n  private getOrCreateFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    let counts = this.fixtureMatchCountsByTestId.get(testId);\n    if (!counts) {\n      counts = new Map();\n      this.fixtureMatchCountsByTestId.set(testId, counts);\n      // FIFO eviction when over capacity. JS Map preserves insertion order,\n      // so the first key returned by keys() is the oldest. Same O(n) shift\n      // caveat as `entries`: acceptable at small caps (default 500).\n      if (\n        this.fixtureCountsMaxTestIds > 0 &&\n        this.fixtureMatchCountsByTestId.size > this.fixtureCountsMaxTestIds\n      ) {\n        const oldest = this.fixtureMatchCountsByTestId.keys().next().value;\n        if (oldest !== undefined) {\n          this.fixtureMatchCountsByTestId.delete(oldest);\n        }\n      }\n    }\n    return counts;\n  }\n\n  getFixtureMatchCount(fixture: Fixture, testId = DEFAULT_TEST_ID): number {\n    return this.getFixtureMatchCountsForTest(testId).get(fixture) ?? 0;\n  }\n\n  incrementFixtureMatchCount(\n    fixture: Fixture,\n    allFixtures?: readonly Fixture[],\n    testId = DEFAULT_TEST_ID,\n  ): void {\n    const counts = this.getOrCreateFixtureMatchCountsForTest(testId);\n    counts.set(fixture, (counts.get(fixture) ?? 0) + 1);\n    // When a sequenced fixture matches, also increment all siblings with matching criteria\n    if (fixture.match.sequenceIndex !== undefined && allFixtures) {\n      for (const sibling of allFixtures) {\n        if (sibling === fixture) continue;\n        if (sibling.match.sequenceIndex === undefined) continue;\n        if (matchCriteriaEqual(fixture.match, sibling.match)) {\n          counts.set(sibling, (counts.get(sibling) ?? 0) + 1);\n        }\n      }\n    }\n  }\n\n  clearMatchCounts(testId?: string): void {\n    if (testId !== undefined) {\n      this.fixtureMatchCountsByTestId.delete(testId);\n    } else {\n      this.fixtureMatchCountsByTestId.clear();\n    }\n  }\n\n  /**\n   * Clear ONLY the request journal entries, preserving fixture match-counts.\n   * Match-counts are fixture-matching/sequencing state, not journal data, so\n   * clearing the journal must not silently rewind sequenced fixtures. Used by\n   * `POST /__aimock/reset/journal`. For a full reset (entries + match-counts),\n   * use `clear()` instead.\n   */\n  clearEntries(): void {\n    this.entries = [];\n  }\n\n  clear(): void {\n    this.entries = [];\n    this.fixtureMatchCountsByTestId.clear();\n  }\n\n  get size(): number {\n    return this.entries.length;\n  }\n}\n"],"mappings":";;;;;;;AAQA,SAAS,WAAW,GAAY,GAAqB;AACnD,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO,MAAM;;;;;;AAOf,SAAS,mBACP,GACA,GACS;AACT,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,MAAM;AACjE,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,CACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,MAAM,EAAE,GAAG;AAC/D,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO;;;;;;AAOT,SAAS,mBAAmB,GAAiB,GAA0B;AACrE,QACE,WAAW,EAAE,aAAa,EAAE,YAAY,IACxC,mBAAmB,EAAE,eAAe,EAAE,cAAc,IACpD,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,YAAY,EAAE,WAAW,IACtC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,OAAO,EAAE,MAAM,IAC5B,WAAW,EAAE,gBAAgB,EAAE,eAAe,IAC9C,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,eAAe,EAAE,cAAc;;AA8BhD,IAAa,UAAb,MAAqB;CACnB,AAAQ,UAA0B,EAAE;CACpC,AAAiB,6CAAgE,IAAI,KAAK;CAC1F,AAAiB;CACjB,AAAiB;CAEjB,YAAY,UAA0B,EAAE,EAAE;EAGxC,MAAM,MAAM,QAAQ;AACpB,OAAK,aAAa,QAAQ,UAAa,MAAM,IAAI,MAAM;EACvD,MAAM,YAAY,QAAQ;AAC1B,OAAK,0BAA0B,cAAc,UAAa,YAAY,IAAI,YAAY;;;CAIxF,IAAI,qBAA2C;AAC7C,SAAO,KAAK,6BAA6BA,kCAAgB;;CAG3D,IAAI,OAA6D;EAC/D,MAAM,OAAqB;GACzB,IAAIC,2BAAW,MAAM;GACrB,WAAW,KAAK,KAAK;GACrB,GAAG;GACJ;AACD,OAAK,QAAQ,KAAK,KAAK;AAMvB,MAAI,KAAK,aAAa,KAAK,KAAK,QAAQ,SAAS,KAAK,WACpD,MAAK,QAAQ,OAAO;AAEtB,SAAO;;CAGT,OAAO,MAA2C;AAChD,MAAI,MAAM,UAAU,OAClB,QAAO,KAAK,QAAQ,MAAM,CAAC,KAAK,MAAM;AAExC,SAAO,KAAK,QAAQ,OAAO;;CAG7B,UAA+B;AAC7B,SAAO,KAAK,QAAQ,SAAS,IAAI,KAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK;;CAG3E,cAAc,SAAkC;AAC9C,SAAO,KAAK,QAAQ,QAAQ,MAAM,EAAE,SAAS,YAAY,QAAQ;;;;;;;;;CAUnE,6BAA6B,QAAsC;AACjE,SAAO,KAAK,2BAA2B,IAAI,OAAO,oBAAI,IAAI,KAAK;;;;;;;;CASjE,AAAQ,qCAAqC,QAAsC;EACjF,IAAI,SAAS,KAAK,2BAA2B,IAAI,OAAO;AACxD,MAAI,CAAC,QAAQ;AACX,4BAAS,IAAI,KAAK;AAClB,QAAK,2BAA2B,IAAI,QAAQ,OAAO;AAInD,OACE,KAAK,0BAA0B,KAC/B,KAAK,2BAA2B,OAAO,KAAK,yBAC5C;IACA,MAAM,SAAS,KAAK,2BAA2B,MAAM,CAAC,MAAM,CAAC;AAC7D,QAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;;;AAIpD,SAAO;;CAGT,qBAAqB,SAAkB,SAASD,mCAAyB;AACvE,SAAO,KAAK,6BAA6B,OAAO,CAAC,IAAI,QAAQ,IAAI;;CAGnE,2BACE,SACA,aACA,SAASA,mCACH;EACN,MAAM,SAAS,KAAK,qCAAqC,OAAO;AAChE,SAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;AAEnD,MAAI,QAAQ,MAAM,kBAAkB,UAAa,YAC/C,MAAK,MAAM,WAAW,aAAa;AACjC,OAAI,YAAY,QAAS;AACzB,OAAI,QAAQ,MAAM,kBAAkB,OAAW;AAC/C,OAAI,mBAAmB,QAAQ,OAAO,QAAQ,MAAM,CAClD,QAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;;;CAM3D,iBAAiB,QAAuB;AACtC,MAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;MAE9C,MAAK,2BAA2B,OAAO;;;;;;;;;CAW3C,eAAqB;AACnB,OAAK,UAAU,EAAE;;CAGnB,QAAc;AACZ,OAAK,UAAU,EAAE;AACjB,OAAK,2BAA2B,OAAO;;CAGzC,IAAI,OAAe;AACjB,SAAO,KAAK,QAAQ"}
+{"version":3,"file":"journal.cjs","names":["DEFAULT_TEST_ID","generateId"],"sources":["../src/journal.ts"],"sourcesContent":["import { generateId } from \"./helpers.js\";\nimport type { ChatCompletionRequest, Fixture, FixtureMatch, JournalEntry } from \"./types.js\";\nimport { DEFAULT_TEST_ID } from \"./constants.js\";\nexport { DEFAULT_TEST_ID } from \"./constants.js\";\n\n/**\n * Maximum UTF-8 byte length of a serialized request body retained in a\n * journal entry. Bodies whose JSON serialization exceeds this byte size are\n * replaced with a truncation marker.\n *\n * Only the request `body` field is capped here. `headers` and `path` are\n * retained uncapped, but they are naturally bounded by Node's default ~16 KB\n * maximum HTTP header size, so the per-entry overhead beyond the body cap\n * remains small. Combined with the journal's maxEntries limit (default 1000),\n * the total `JSON.stringify(journal.getAll())` output stays well under V8's\n * ~512 MB string limit even at maximum capacity.\n */\nconst JOURNAL_BODY_CAP_BYTES = 64 * 1024; // 64 KB\n\n/**\n * If `body` serializes to more than JOURNAL_BODY_CAP_BYTES (in UTF-8 bytes),\n * replace it with a truncation marker. Returns the original body when within\n * the cap, or null when `body` is null.\n *\n * The gate uses Buffer.byteLength (UTF-8 bytes) rather than .length (UTF-16\n * code units) to match the constant name and to correctly cap multibyte\n * content (e.g. CJK/emoji) whose code-unit count falls under the threshold\n * but whose byte size does not.\n */\nfunction capBody(body: ChatCompletionRequest | null): ChatCompletionRequest | null {\n  if (body === null) return null;\n  const serialized = JSON.stringify(body);\n  if (Buffer.byteLength(serialized, \"utf8\") <= JOURNAL_BODY_CAP_BYTES) return body;\n  // Cast: the marker is not a real ChatCompletionRequest, but the field type\n  // is already nullable-union and downstream consumers (e.g. GET /journal)\n  // treat the body as opaque JSON — the truncation marker is safe to store.\n  return {\n    __aimock_truncated: true,\n    originalByteSize: Buffer.byteLength(serialized, \"utf8\"),\n    note: \"body truncated by aimock journal cap (64 KB limit)\",\n  } as unknown as ChatCompletionRequest;\n}\n\n/**\n * Compare two field values, handling RegExp by source+flags rather than reference.\n */\nfunction fieldEqual(a: unknown, b: unknown): boolean {\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return a === b;\n}\n\n/**\n * Compare two systemMessage values. Handles string, string[], and RegExp.\n * Both-undefined is treated as equal.\n */\nfunction systemMessageEqual(\n  a: string | string[] | RegExp | undefined,\n  b: string | string[] | RegExp | undefined,\n): boolean {\n  if (a === undefined && b === undefined) return true;\n  if (a === undefined || b === undefined) return false;\n  if (typeof a === \"string\" && typeof b === \"string\") return a === b;\n  if (Array.isArray(a) && Array.isArray(b))\n    return a.length === b.length && a.every((v, i) => v === b[i]);\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return false;\n}\n\n/**\n * Check whether two fixture match objects have the same criteria\n * (ignoring sequenceIndex). Used to group sequenced fixtures.\n */\nfunction matchCriteriaEqual(a: FixtureMatch, b: FixtureMatch): boolean {\n  return (\n    fieldEqual(a.userMessage, b.userMessage) &&\n    systemMessageEqual(a.systemMessage, b.systemMessage) &&\n    fieldEqual(a.inputText, b.inputText) &&\n    fieldEqual(a.toolCallId, b.toolCallId) &&\n    fieldEqual(a.toolName, b.toolName) &&\n    fieldEqual(a.model, b.model) &&\n    fieldEqual(a.responseFormat, b.responseFormat) &&\n    fieldEqual(a.predicate, b.predicate) &&\n    fieldEqual(a.endpoint, b.endpoint) &&\n    fieldEqual(a.turnIndex, b.turnIndex) &&\n    fieldEqual(a.hasToolResult, b.hasToolResult)\n  );\n}\n\nexport interface JournalOptions {\n  /**\n   * Maximum number of entries to retain. When exceeded, oldest entries are\n   * dropped FIFO. Set to 0 (or omit) for unbounded retention (the historical\n   * default — suitable for short-lived test runs only). Negative values are\n   * rejected at the CLI parse layer; programmatically they are treated as 0\n   * (unbounded) for back-compat.\n   *\n   * Long-running servers (e.g. mock proxies in CI/demo environments) should\n   * always set a finite cap: every request appends an entry holding the\n   * request body + headers + fixture reference, and without a cap the\n   * journal grows until the process OOMs.\n   */\n  maxEntries?: number;\n  /**\n   * Maximum number of unique testIds retained in the fixture match-count\n   * map (`fixtureMatchCountsByTestId`). When exceeded, the oldest testId\n   * (by first-insertion order) is evicted FIFO. Set to 0 (or omit) for\n   * unbounded retention. Negative values are rejected at the CLI parse\n   * layer; programmatically they are treated as 0 (unbounded) for\n   * back-compat. Without a cap this map can grow over time in long-running\n   * servers that see many unique testIds.\n   */\n  fixtureCountsMaxTestIds?: number;\n}\n\nexport class Journal {\n  private entries: JournalEntry[] = [];\n  private readonly fixtureMatchCountsByTestId: Map<string, Map<Fixture, number>> = new Map();\n  private readonly maxEntries: number;\n  private readonly fixtureCountsMaxTestIds: number;\n\n  constructor(options: JournalOptions = {}) {\n    // Treat 0 or negative as \"unbounded\" to preserve prior behavior when\n    // the option is omitted or explicitly disabled.\n    const cap = options.maxEntries;\n    this.maxEntries = cap !== undefined && cap > 0 ? cap : 0;\n    const testIdCap = options.fixtureCountsMaxTestIds;\n    this.fixtureCountsMaxTestIds = testIdCap !== undefined && testIdCap > 0 ? testIdCap : 0;\n  }\n\n  /** Backwards-compatible accessor — returns the default (no testId) count map. */\n  get fixtureMatchCounts(): Map<Fixture, number> {\n    return this.getFixtureMatchCountsForTest(DEFAULT_TEST_ID);\n  }\n\n  add(entry: Omit<JournalEntry, \"id\" | \"timestamp\">): JournalEntry {\n    const full: JournalEntry = {\n      id: generateId(\"req\"),\n      timestamp: Date.now(),\n      ...entry,\n      body: capBody(entry.body),\n    };\n    this.entries.push(full);\n    // FIFO eviction when over capacity. Array.prototype.shift() is O(n)\n    // regardless of how many we drop per add; we accept it at small caps\n    // (default 1000) because the constant factor is tiny and this runs once\n    // per request. For much larger caps, switch to a ring buffer for true\n    // O(1) eviction.\n    if (this.maxEntries > 0 && this.entries.length > this.maxEntries) {\n      this.entries.shift();\n    }\n    return full;\n  }\n\n  getAll(opts?: { limit?: number }): JournalEntry[] {\n    if (opts?.limit !== undefined) {\n      return this.entries.slice(-opts.limit);\n    }\n    return this.entries.slice();\n  }\n\n  getLast(): JournalEntry | null {\n    return this.entries.length > 0 ? this.entries[this.entries.length - 1] : null;\n  }\n\n  findByFixture(fixture: Fixture): JournalEntry[] {\n    return this.entries.filter((e) => e.response.fixture === fixture);\n  }\n\n  /**\n   * READ-ONLY accessor. Returns the existing count map for `testId`, or an\n   * empty transient Map if none exists. Does NOT insert into the cache and\n   * does NOT trigger FIFO eviction — callers may read freely without\n   * perturbing cache state. For the write path, see\n   * `getOrCreateFixtureMatchCountsForTest`.\n   */\n  getFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    return this.fixtureMatchCountsByTestId.get(testId) ?? new Map();\n  }\n\n  /**\n   * WRITE path: get the count map for `testId`, inserting a fresh empty Map\n   * if missing and running FIFO eviction when the testId cap is exceeded.\n   * Only callers that intend to mutate the map (e.g. incrementing a count)\n   * should use this.\n   */\n  private getOrCreateFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    let counts = this.fixtureMatchCountsByTestId.get(testId);\n    if (!counts) {\n      counts = new Map();\n      this.fixtureMatchCountsByTestId.set(testId, counts);\n      // FIFO eviction when over capacity. JS Map preserves insertion order,\n      // so the first key returned by keys() is the oldest. Same O(n) shift\n      // caveat as `entries`: acceptable at small caps (default 500).\n      if (\n        this.fixtureCountsMaxTestIds > 0 &&\n        this.fixtureMatchCountsByTestId.size > this.fixtureCountsMaxTestIds\n      ) {\n        const oldest = this.fixtureMatchCountsByTestId.keys().next().value;\n        if (oldest !== undefined) {\n          this.fixtureMatchCountsByTestId.delete(oldest);\n        }\n      }\n    }\n    return counts;\n  }\n\n  getFixtureMatchCount(fixture: Fixture, testId = DEFAULT_TEST_ID): number {\n    return this.getFixtureMatchCountsForTest(testId).get(fixture) ?? 0;\n  }\n\n  incrementFixtureMatchCount(\n    fixture: Fixture,\n    allFixtures?: readonly Fixture[],\n    testId = DEFAULT_TEST_ID,\n  ): void {\n    const counts = this.getOrCreateFixtureMatchCountsForTest(testId);\n    counts.set(fixture, (counts.get(fixture) ?? 0) + 1);\n    // When a sequenced fixture matches, also increment all siblings with matching criteria\n    if (fixture.match.sequenceIndex !== undefined && allFixtures) {\n      for (const sibling of allFixtures) {\n        if (sibling === fixture) continue;\n        if (sibling.match.sequenceIndex === undefined) continue;\n        if (matchCriteriaEqual(fixture.match, sibling.match)) {\n          counts.set(sibling, (counts.get(sibling) ?? 0) + 1);\n        }\n      }\n    }\n  }\n\n  clearMatchCounts(testId?: string): void {\n    if (testId !== undefined) {\n      this.fixtureMatchCountsByTestId.delete(testId);\n    } else {\n      this.fixtureMatchCountsByTestId.clear();\n    }\n  }\n\n  /**\n   * Clear ONLY the request journal entries, preserving fixture match-counts.\n   * Match-counts are fixture-matching/sequencing state, not journal data, so\n   * clearing the journal must not silently rewind sequenced fixtures. Used by\n   * `POST /__aimock/reset/journal`. For a full reset (entries + match-counts),\n   * use `clear()` instead.\n   */\n  clearEntries(): void {\n    this.entries = [];\n  }\n\n  clear(): void {\n    this.entries = [];\n    this.fixtureMatchCountsByTestId.clear();\n  }\n\n  get size(): number {\n    return this.entries.length;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAiBA,MAAM,yBAAyB,KAAK;;;;;;;;;;;AAYpC,SAAS,QAAQ,MAAkE;AACjF,KAAI,SAAS,KAAM,QAAO;CAC1B,MAAM,aAAa,KAAK,UAAU,KAAK;AACvC,KAAI,OAAO,WAAW,YAAY,OAAO,IAAI,uBAAwB,QAAO;AAI5E,QAAO;EACL,oBAAoB;EACpB,kBAAkB,OAAO,WAAW,YAAY,OAAO;EACvD,MAAM;EACP;;;;;AAMH,SAAS,WAAW,GAAY,GAAqB;AACnD,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO,MAAM;;;;;;AAOf,SAAS,mBACP,GACA,GACS;AACT,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,MAAM;AACjE,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,CACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,MAAM,EAAE,GAAG;AAC/D,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO;;;;;;AAOT,SAAS,mBAAmB,GAAiB,GAA0B;AACrE,QACE,WAAW,EAAE,aAAa,EAAE,YAAY,IACxC,mBAAmB,EAAE,eAAe,EAAE,cAAc,IACpD,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,YAAY,EAAE,WAAW,IACtC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,OAAO,EAAE,MAAM,IAC5B,WAAW,EAAE,gBAAgB,EAAE,eAAe,IAC9C,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,eAAe,EAAE,cAAc;;AA8BhD,IAAa,UAAb,MAAqB;CACnB,AAAQ,UAA0B,EAAE;CACpC,AAAiB,6CAAgE,IAAI,KAAK;CAC1F,AAAiB;CACjB,AAAiB;CAEjB,YAAY,UAA0B,EAAE,EAAE;EAGxC,MAAM,MAAM,QAAQ;AACpB,OAAK,aAAa,QAAQ,UAAa,MAAM,IAAI,MAAM;EACvD,MAAM,YAAY,QAAQ;AAC1B,OAAK,0BAA0B,cAAc,UAAa,YAAY,IAAI,YAAY;;;CAIxF,IAAI,qBAA2C;AAC7C,SAAO,KAAK,6BAA6BA,kCAAgB;;CAG3D,IAAI,OAA6D;EAC/D,MAAM,OAAqB;GACzB,IAAIC,2BAAW,MAAM;GACrB,WAAW,KAAK,KAAK;GACrB,GAAG;GACH,MAAM,QAAQ,MAAM,KAAK;GAC1B;AACD,OAAK,QAAQ,KAAK,KAAK;AAMvB,MAAI,KAAK,aAAa,KAAK,KAAK,QAAQ,SAAS,KAAK,WACpD,MAAK,QAAQ,OAAO;AAEtB,SAAO;;CAGT,OAAO,MAA2C;AAChD,MAAI,MAAM,UAAU,OAClB,QAAO,KAAK,QAAQ,MAAM,CAAC,KAAK,MAAM;AAExC,SAAO,KAAK,QAAQ,OAAO;;CAG7B,UAA+B;AAC7B,SAAO,KAAK,QAAQ,SAAS,IAAI,KAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK;;CAG3E,cAAc,SAAkC;AAC9C,SAAO,KAAK,QAAQ,QAAQ,MAAM,EAAE,SAAS,YAAY,QAAQ;;;;;;;;;CAUnE,6BAA6B,QAAsC;AACjE,SAAO,KAAK,2BAA2B,IAAI,OAAO,oBAAI,IAAI,KAAK;;;;;;;;CASjE,AAAQ,qCAAqC,QAAsC;EACjF,IAAI,SAAS,KAAK,2BAA2B,IAAI,OAAO;AACxD,MAAI,CAAC,QAAQ;AACX,4BAAS,IAAI,KAAK;AAClB,QAAK,2BAA2B,IAAI,QAAQ,OAAO;AAInD,OACE,KAAK,0BAA0B,KAC/B,KAAK,2BAA2B,OAAO,KAAK,yBAC5C;IACA,MAAM,SAAS,KAAK,2BAA2B,MAAM,CAAC,MAAM,CAAC;AAC7D,QAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;;;AAIpD,SAAO;;CAGT,qBAAqB,SAAkB,SAASD,mCAAyB;AACvE,SAAO,KAAK,6BAA6B,OAAO,CAAC,IAAI,QAAQ,IAAI;;CAGnE,2BACE,SACA,aACA,SAASA,mCACH;EACN,MAAM,SAAS,KAAK,qCAAqC,OAAO;AAChE,SAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;AAEnD,MAAI,QAAQ,MAAM,kBAAkB,UAAa,YAC/C,MAAK,MAAM,WAAW,aAAa;AACjC,OAAI,YAAY,QAAS;AACzB,OAAI,QAAQ,MAAM,kBAAkB,OAAW;AAC/C,OAAI,mBAAmB,QAAQ,OAAO,QAAQ,MAAM,CAClD,QAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;;;CAM3D,iBAAiB,QAAuB;AACtC,MAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;MAE9C,MAAK,2BAA2B,OAAO;;;;;;;;;CAW3C,eAAqB;AACnB,OAAK,UAAU,EAAE;;CAGnB,QAAc;AACZ,OAAK,UAAU,EAAE;AACjB,OAAK,2BAA2B,OAAO;;CAGzC,IAAI,OAAe;AACjB,SAAO,KAAK,QAAQ"}

package/dist/journal.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"journal.d.cts","names":[],"sources":["../src/journal.ts"],"sourcesContent":[],"mappings":";;;;UAoDiB,cAAA;;AAAjB;AA0BA;;;;;;;;;;YAiDyB,CAAA,EAAA,MAAA;;;;;;;;;;;;cAjDZ,OAAA;;;;;wBAMU;;4BAUK,IAAI;aAInB,KAAK,oCAAoC;;;MAkBjB;aAOxB;yBAIY,UAAU;;;;;;;;gDAWa,IAAI;;;;;;;;gCA+BpB;sCAKnB,gCACc"}
+{"version":3,"file":"journal.d.cts","names":[],"sources":["../src/journal.ts"],"sourcesContent":[],"mappings":";;;;UA0FiB,cAAA;;AAAjB;AA0BA;;;;;;;;;;YAkDyB,CAAA,EAAA,MAAA;;;;;;;;;;;;cAlDZ,OAAA;;;;;wBAMU;;4BAUK,IAAI;aAInB,KAAK,oCAAoC;;;MAmBjB;aAOxB;yBAIY,UAAU;;;;;;;;gDAWa,IAAI;;;;;;;;gCA+BpB;sCAKnB,gCACc"}

package/dist/journal.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"journal.d.ts","names":[],"sources":["../src/journal.ts"],"sourcesContent":[],"mappings":";;;;UAoDiB,cAAA;;AAAjB;AA0BA;;;;;;;;;;YAiDyB,CAAA,EAAA,MAAA;;;;;;;;;;;;cAjDZ,OAAA;;;;;wBAMU;;4BAUK,IAAI;aAInB,KAAK,oCAAoC;;;MAkBjB;aAOxB;yBAIY,UAAU;;;;;;;;gDAWa,IAAI;;;;;;;;gCA+BpB;sCAKnB,gCACc"}
+{"version":3,"file":"journal.d.ts","names":[],"sources":["../src/journal.ts"],"sourcesContent":[],"mappings":";;;;UA0FiB,cAAA;;AAAjB;AA0BA;;;;;;;;;;YAkDyB,CAAA,EAAA,MAAA;;;;;;;;;;;;cAlDZ,OAAA;;;;;wBAMU;;4BAUK,IAAI;aAInB,KAAK,oCAAoC;;;MAmBjB;aAOxB;yBAIY,UAAU;;;;;;;;gDAWa,IAAI;;;;;;;;gCA+BpB;sCAKnB,gCACc"}

package/dist/journal.js

@@ -3,6 +3,39 @@ import { generateId } from "./helpers.js";
 
 //#region src/journal.ts
 /**
+* Maximum UTF-8 byte length of a serialized request body retained in a
+* journal entry. Bodies whose JSON serialization exceeds this byte size are
+* replaced with a truncation marker.
+*
+* Only the request `body` field is capped here. `headers` and `path` are
+* retained uncapped, but they are naturally bounded by Node's default ~16 KB
+* maximum HTTP header size, so the per-entry overhead beyond the body cap
+* remains small. Combined with the journal's maxEntries limit (default 1000),
+* the total `JSON.stringify(journal.getAll())` output stays well under V8's
+* ~512 MB string limit even at maximum capacity.
+*/
+const JOURNAL_BODY_CAP_BYTES = 64 * 1024;
+/**
+* If `body` serializes to more than JOURNAL_BODY_CAP_BYTES (in UTF-8 bytes),
+* replace it with a truncation marker. Returns the original body when within
+* the cap, or null when `body` is null.
+*
+* The gate uses Buffer.byteLength (UTF-8 bytes) rather than .length (UTF-16
+* code units) to match the constant name and to correctly cap multibyte
+* content (e.g. CJK/emoji) whose code-unit count falls under the threshold
+* but whose byte size does not.
+*/
+function capBody(body) {
+	if (body === null) return null;
+	const serialized = JSON.stringify(body);
+	if (Buffer.byteLength(serialized, "utf8") <= JOURNAL_BODY_CAP_BYTES) return body;
+	return {
+		__aimock_truncated: true,
+		originalByteSize: Buffer.byteLength(serialized, "utf8"),
+		note: "body truncated by aimock journal cap (64 KB limit)"
+	};
+}
+/**
 * Compare two field values, handling RegExp by source+flags rather than reference.
 */
 function fieldEqual(a, b) {
@@ -47,7 +80,8 @@ var Journal = class {
 		const full = {
 			id: generateId("req"),
 			timestamp: Date.now(),
-			...entry
+			...entry,
+			body: capBody(entry.body)
 		};
 		this.entries.push(full);
 		if (this.maxEntries > 0 && this.entries.length > this.maxEntries) this.entries.shift();

package/dist/journal.js.map

@@ -1 +1 @@
-{"version":3,"file":"journal.js","names":[],"sources":["../src/journal.ts"],"sourcesContent":["import { generateId } from \"./helpers.js\";\nimport type { Fixture, FixtureMatch, JournalEntry } from \"./types.js\";\nimport { DEFAULT_TEST_ID } from \"./constants.js\";\nexport { DEFAULT_TEST_ID } from \"./constants.js\";\n\n/**\n * Compare two field values, handling RegExp by source+flags rather than reference.\n */\nfunction fieldEqual(a: unknown, b: unknown): boolean {\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return a === b;\n}\n\n/**\n * Compare two systemMessage values. Handles string, string[], and RegExp.\n * Both-undefined is treated as equal.\n */\nfunction systemMessageEqual(\n  a: string | string[] | RegExp | undefined,\n  b: string | string[] | RegExp | undefined,\n): boolean {\n  if (a === undefined && b === undefined) return true;\n  if (a === undefined || b === undefined) return false;\n  if (typeof a === \"string\" && typeof b === \"string\") return a === b;\n  if (Array.isArray(a) && Array.isArray(b))\n    return a.length === b.length && a.every((v, i) => v === b[i]);\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return false;\n}\n\n/**\n * Check whether two fixture match objects have the same criteria\n * (ignoring sequenceIndex). Used to group sequenced fixtures.\n */\nfunction matchCriteriaEqual(a: FixtureMatch, b: FixtureMatch): boolean {\n  return (\n    fieldEqual(a.userMessage, b.userMessage) &&\n    systemMessageEqual(a.systemMessage, b.systemMessage) &&\n    fieldEqual(a.inputText, b.inputText) &&\n    fieldEqual(a.toolCallId, b.toolCallId) &&\n    fieldEqual(a.toolName, b.toolName) &&\n    fieldEqual(a.model, b.model) &&\n    fieldEqual(a.responseFormat, b.responseFormat) &&\n    fieldEqual(a.predicate, b.predicate) &&\n    fieldEqual(a.endpoint, b.endpoint) &&\n    fieldEqual(a.turnIndex, b.turnIndex) &&\n    fieldEqual(a.hasToolResult, b.hasToolResult)\n  );\n}\n\nexport interface JournalOptions {\n  /**\n   * Maximum number of entries to retain. When exceeded, oldest entries are\n   * dropped FIFO. Set to 0 (or omit) for unbounded retention (the historical\n   * default — suitable for short-lived test runs only). Negative values are\n   * rejected at the CLI parse layer; programmatically they are treated as 0\n   * (unbounded) for back-compat.\n   *\n   * Long-running servers (e.g. mock proxies in CI/demo environments) should\n   * always set a finite cap: every request appends an entry holding the\n   * request body + headers + fixture reference, and without a cap the\n   * journal grows until the process OOMs.\n   */\n  maxEntries?: number;\n  /**\n   * Maximum number of unique testIds retained in the fixture match-count\n   * map (`fixtureMatchCountsByTestId`). When exceeded, the oldest testId\n   * (by first-insertion order) is evicted FIFO. Set to 0 (or omit) for\n   * unbounded retention. Negative values are rejected at the CLI parse\n   * layer; programmatically they are treated as 0 (unbounded) for\n   * back-compat. Without a cap this map can grow over time in long-running\n   * servers that see many unique testIds.\n   */\n  fixtureCountsMaxTestIds?: number;\n}\n\nexport class Journal {\n  private entries: JournalEntry[] = [];\n  private readonly fixtureMatchCountsByTestId: Map<string, Map<Fixture, number>> = new Map();\n  private readonly maxEntries: number;\n  private readonly fixtureCountsMaxTestIds: number;\n\n  constructor(options: JournalOptions = {}) {\n    // Treat 0 or negative as \"unbounded\" to preserve prior behavior when\n    // the option is omitted or explicitly disabled.\n    const cap = options.maxEntries;\n    this.maxEntries = cap !== undefined && cap > 0 ? cap : 0;\n    const testIdCap = options.fixtureCountsMaxTestIds;\n    this.fixtureCountsMaxTestIds = testIdCap !== undefined && testIdCap > 0 ? testIdCap : 0;\n  }\n\n  /** Backwards-compatible accessor — returns the default (no testId) count map. */\n  get fixtureMatchCounts(): Map<Fixture, number> {\n    return this.getFixtureMatchCountsForTest(DEFAULT_TEST_ID);\n  }\n\n  add(entry: Omit<JournalEntry, \"id\" | \"timestamp\">): JournalEntry {\n    const full: JournalEntry = {\n      id: generateId(\"req\"),\n      timestamp: Date.now(),\n      ...entry,\n    };\n    this.entries.push(full);\n    // FIFO eviction when over capacity. Array.prototype.shift() is O(n)\n    // regardless of how many we drop per add; we accept it at small caps\n    // (default 1000) because the constant factor is tiny and this runs once\n    // per request. For much larger caps, switch to a ring buffer for true\n    // O(1) eviction.\n    if (this.maxEntries > 0 && this.entries.length > this.maxEntries) {\n      this.entries.shift();\n    }\n    return full;\n  }\n\n  getAll(opts?: { limit?: number }): JournalEntry[] {\n    if (opts?.limit !== undefined) {\n      return this.entries.slice(-opts.limit);\n    }\n    return this.entries.slice();\n  }\n\n  getLast(): JournalEntry | null {\n    return this.entries.length > 0 ? this.entries[this.entries.length - 1] : null;\n  }\n\n  findByFixture(fixture: Fixture): JournalEntry[] {\n    return this.entries.filter((e) => e.response.fixture === fixture);\n  }\n\n  /**\n   * READ-ONLY accessor. Returns the existing count map for `testId`, or an\n   * empty transient Map if none exists. Does NOT insert into the cache and\n   * does NOT trigger FIFO eviction — callers may read freely without\n   * perturbing cache state. For the write path, see\n   * `getOrCreateFixtureMatchCountsForTest`.\n   */\n  getFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    return this.fixtureMatchCountsByTestId.get(testId) ?? new Map();\n  }\n\n  /**\n   * WRITE path: get the count map for `testId`, inserting a fresh empty Map\n   * if missing and running FIFO eviction when the testId cap is exceeded.\n   * Only callers that intend to mutate the map (e.g. incrementing a count)\n   * should use this.\n   */\n  private getOrCreateFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    let counts = this.fixtureMatchCountsByTestId.get(testId);\n    if (!counts) {\n      counts = new Map();\n      this.fixtureMatchCountsByTestId.set(testId, counts);\n      // FIFO eviction when over capacity. JS Map preserves insertion order,\n      // so the first key returned by keys() is the oldest. Same O(n) shift\n      // caveat as `entries`: acceptable at small caps (default 500).\n      if (\n        this.fixtureCountsMaxTestIds > 0 &&\n        this.fixtureMatchCountsByTestId.size > this.fixtureCountsMaxTestIds\n      ) {\n        const oldest = this.fixtureMatchCountsByTestId.keys().next().value;\n        if (oldest !== undefined) {\n          this.fixtureMatchCountsByTestId.delete(oldest);\n        }\n      }\n    }\n    return counts;\n  }\n\n  getFixtureMatchCount(fixture: Fixture, testId = DEFAULT_TEST_ID): number {\n    return this.getFixtureMatchCountsForTest(testId).get(fixture) ?? 0;\n  }\n\n  incrementFixtureMatchCount(\n    fixture: Fixture,\n    allFixtures?: readonly Fixture[],\n    testId = DEFAULT_TEST_ID,\n  ): void {\n    const counts = this.getOrCreateFixtureMatchCountsForTest(testId);\n    counts.set(fixture, (counts.get(fixture) ?? 0) + 1);\n    // When a sequenced fixture matches, also increment all siblings with matching criteria\n    if (fixture.match.sequenceIndex !== undefined && allFixtures) {\n      for (const sibling of allFixtures) {\n        if (sibling === fixture) continue;\n        if (sibling.match.sequenceIndex === undefined) continue;\n        if (matchCriteriaEqual(fixture.match, sibling.match)) {\n          counts.set(sibling, (counts.get(sibling) ?? 0) + 1);\n        }\n      }\n    }\n  }\n\n  clearMatchCounts(testId?: string): void {\n    if (testId !== undefined) {\n      this.fixtureMatchCountsByTestId.delete(testId);\n    } else {\n      this.fixtureMatchCountsByTestId.clear();\n    }\n  }\n\n  /**\n   * Clear ONLY the request journal entries, preserving fixture match-counts.\n   * Match-counts are fixture-matching/sequencing state, not journal data, so\n   * clearing the journal must not silently rewind sequenced fixtures. Used by\n   * `POST /__aimock/reset/journal`. For a full reset (entries + match-counts),\n   * use `clear()` instead.\n   */\n  clearEntries(): void {\n    this.entries = [];\n  }\n\n  clear(): void {\n    this.entries = [];\n    this.fixtureMatchCountsByTestId.clear();\n  }\n\n  get size(): number {\n    return this.entries.length;\n  }\n}\n"],"mappings":";;;;;;;AAQA,SAAS,WAAW,GAAY,GAAqB;AACnD,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO,MAAM;;;;;;AAOf,SAAS,mBACP,GACA,GACS;AACT,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,MAAM;AACjE,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,CACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,MAAM,EAAE,GAAG;AAC/D,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO;;;;;;AAOT,SAAS,mBAAmB,GAAiB,GAA0B;AACrE,QACE,WAAW,EAAE,aAAa,EAAE,YAAY,IACxC,mBAAmB,EAAE,eAAe,EAAE,cAAc,IACpD,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,YAAY,EAAE,WAAW,IACtC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,OAAO,EAAE,MAAM,IAC5B,WAAW,EAAE,gBAAgB,EAAE,eAAe,IAC9C,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,eAAe,EAAE,cAAc;;AA8BhD,IAAa,UAAb,MAAqB;CACnB,AAAQ,UAA0B,EAAE;CACpC,AAAiB,6CAAgE,IAAI,KAAK;CAC1F,AAAiB;CACjB,AAAiB;CAEjB,YAAY,UAA0B,EAAE,EAAE;EAGxC,MAAM,MAAM,QAAQ;AACpB,OAAK,aAAa,QAAQ,UAAa,MAAM,IAAI,MAAM;EACvD,MAAM,YAAY,QAAQ;AAC1B,OAAK,0BAA0B,cAAc,UAAa,YAAY,IAAI,YAAY;;;CAIxF,IAAI,qBAA2C;AAC7C,SAAO,KAAK,6BAA6B,gBAAgB;;CAG3D,IAAI,OAA6D;EAC/D,MAAM,OAAqB;GACzB,IAAI,WAAW,MAAM;GACrB,WAAW,KAAK,KAAK;GACrB,GAAG;GACJ;AACD,OAAK,QAAQ,KAAK,KAAK;AAMvB,MAAI,KAAK,aAAa,KAAK,KAAK,QAAQ,SAAS,KAAK,WACpD,MAAK,QAAQ,OAAO;AAEtB,SAAO;;CAGT,OAAO,MAA2C;AAChD,MAAI,MAAM,UAAU,OAClB,QAAO,KAAK,QAAQ,MAAM,CAAC,KAAK,MAAM;AAExC,SAAO,KAAK,QAAQ,OAAO;;CAG7B,UAA+B;AAC7B,SAAO,KAAK,QAAQ,SAAS,IAAI,KAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK;;CAG3E,cAAc,SAAkC;AAC9C,SAAO,KAAK,QAAQ,QAAQ,MAAM,EAAE,SAAS,YAAY,QAAQ;;;;;;;;;CAUnE,6BAA6B,QAAsC;AACjE,SAAO,KAAK,2BAA2B,IAAI,OAAO,oBAAI,IAAI,KAAK;;;;;;;;CASjE,AAAQ,qCAAqC,QAAsC;EACjF,IAAI,SAAS,KAAK,2BAA2B,IAAI,OAAO;AACxD,MAAI,CAAC,QAAQ;AACX,4BAAS,IAAI,KAAK;AAClB,QAAK,2BAA2B,IAAI,QAAQ,OAAO;AAInD,OACE,KAAK,0BAA0B,KAC/B,KAAK,2BAA2B,OAAO,KAAK,yBAC5C;IACA,MAAM,SAAS,KAAK,2BAA2B,MAAM,CAAC,MAAM,CAAC;AAC7D,QAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;;;AAIpD,SAAO;;CAGT,qBAAqB,SAAkB,SAAS,iBAAyB;AACvE,SAAO,KAAK,6BAA6B,OAAO,CAAC,IAAI,QAAQ,IAAI;;CAGnE,2BACE,SACA,aACA,SAAS,iBACH;EACN,MAAM,SAAS,KAAK,qCAAqC,OAAO;AAChE,SAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;AAEnD,MAAI,QAAQ,MAAM,kBAAkB,UAAa,YAC/C,MAAK,MAAM,WAAW,aAAa;AACjC,OAAI,YAAY,QAAS;AACzB,OAAI,QAAQ,MAAM,kBAAkB,OAAW;AAC/C,OAAI,mBAAmB,QAAQ,OAAO,QAAQ,MAAM,CAClD,QAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;;;CAM3D,iBAAiB,QAAuB;AACtC,MAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;MAE9C,MAAK,2BAA2B,OAAO;;;;;;;;;CAW3C,eAAqB;AACnB,OAAK,UAAU,EAAE;;CAGnB,QAAc;AACZ,OAAK,UAAU,EAAE;AACjB,OAAK,2BAA2B,OAAO;;CAGzC,IAAI,OAAe;AACjB,SAAO,KAAK,QAAQ"}
+{"version":3,"file":"journal.js","names":[],"sources":["../src/journal.ts"],"sourcesContent":["import { generateId } from \"./helpers.js\";\nimport type { ChatCompletionRequest, Fixture, FixtureMatch, JournalEntry } from \"./types.js\";\nimport { DEFAULT_TEST_ID } from \"./constants.js\";\nexport { DEFAULT_TEST_ID } from \"./constants.js\";\n\n/**\n * Maximum UTF-8 byte length of a serialized request body retained in a\n * journal entry. Bodies whose JSON serialization exceeds this byte size are\n * replaced with a truncation marker.\n *\n * Only the request `body` field is capped here. `headers` and `path` are\n * retained uncapped, but they are naturally bounded by Node's default ~16 KB\n * maximum HTTP header size, so the per-entry overhead beyond the body cap\n * remains small. Combined with the journal's maxEntries limit (default 1000),\n * the total `JSON.stringify(journal.getAll())` output stays well under V8's\n * ~512 MB string limit even at maximum capacity.\n */\nconst JOURNAL_BODY_CAP_BYTES = 64 * 1024; // 64 KB\n\n/**\n * If `body` serializes to more than JOURNAL_BODY_CAP_BYTES (in UTF-8 bytes),\n * replace it with a truncation marker. Returns the original body when within\n * the cap, or null when `body` is null.\n *\n * The gate uses Buffer.byteLength (UTF-8 bytes) rather than .length (UTF-16\n * code units) to match the constant name and to correctly cap multibyte\n * content (e.g. CJK/emoji) whose code-unit count falls under the threshold\n * but whose byte size does not.\n */\nfunction capBody(body: ChatCompletionRequest | null): ChatCompletionRequest | null {\n  if (body === null) return null;\n  const serialized = JSON.stringify(body);\n  if (Buffer.byteLength(serialized, \"utf8\") <= JOURNAL_BODY_CAP_BYTES) return body;\n  // Cast: the marker is not a real ChatCompletionRequest, but the field type\n  // is already nullable-union and downstream consumers (e.g. GET /journal)\n  // treat the body as opaque JSON — the truncation marker is safe to store.\n  return {\n    __aimock_truncated: true,\n    originalByteSize: Buffer.byteLength(serialized, \"utf8\"),\n    note: \"body truncated by aimock journal cap (64 KB limit)\",\n  } as unknown as ChatCompletionRequest;\n}\n\n/**\n * Compare two field values, handling RegExp by source+flags rather than reference.\n */\nfunction fieldEqual(a: unknown, b: unknown): boolean {\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return a === b;\n}\n\n/**\n * Compare two systemMessage values. Handles string, string[], and RegExp.\n * Both-undefined is treated as equal.\n */\nfunction systemMessageEqual(\n  a: string | string[] | RegExp | undefined,\n  b: string | string[] | RegExp | undefined,\n): boolean {\n  if (a === undefined && b === undefined) return true;\n  if (a === undefined || b === undefined) return false;\n  if (typeof a === \"string\" && typeof b === \"string\") return a === b;\n  if (Array.isArray(a) && Array.isArray(b))\n    return a.length === b.length && a.every((v, i) => v === b[i]);\n  if (a instanceof RegExp && b instanceof RegExp)\n    return a.source === b.source && a.flags === b.flags;\n  return false;\n}\n\n/**\n * Check whether two fixture match objects have the same criteria\n * (ignoring sequenceIndex). Used to group sequenced fixtures.\n */\nfunction matchCriteriaEqual(a: FixtureMatch, b: FixtureMatch): boolean {\n  return (\n    fieldEqual(a.userMessage, b.userMessage) &&\n    systemMessageEqual(a.systemMessage, b.systemMessage) &&\n    fieldEqual(a.inputText, b.inputText) &&\n    fieldEqual(a.toolCallId, b.toolCallId) &&\n    fieldEqual(a.toolName, b.toolName) &&\n    fieldEqual(a.model, b.model) &&\n    fieldEqual(a.responseFormat, b.responseFormat) &&\n    fieldEqual(a.predicate, b.predicate) &&\n    fieldEqual(a.endpoint, b.endpoint) &&\n    fieldEqual(a.turnIndex, b.turnIndex) &&\n    fieldEqual(a.hasToolResult, b.hasToolResult)\n  );\n}\n\nexport interface JournalOptions {\n  /**\n   * Maximum number of entries to retain. When exceeded, oldest entries are\n   * dropped FIFO. Set to 0 (or omit) for unbounded retention (the historical\n   * default — suitable for short-lived test runs only). Negative values are\n   * rejected at the CLI parse layer; programmatically they are treated as 0\n   * (unbounded) for back-compat.\n   *\n   * Long-running servers (e.g. mock proxies in CI/demo environments) should\n   * always set a finite cap: every request appends an entry holding the\n   * request body + headers + fixture reference, and without a cap the\n   * journal grows until the process OOMs.\n   */\n  maxEntries?: number;\n  /**\n   * Maximum number of unique testIds retained in the fixture match-count\n   * map (`fixtureMatchCountsByTestId`). When exceeded, the oldest testId\n   * (by first-insertion order) is evicted FIFO. Set to 0 (or omit) for\n   * unbounded retention. Negative values are rejected at the CLI parse\n   * layer; programmatically they are treated as 0 (unbounded) for\n   * back-compat. Without a cap this map can grow over time in long-running\n   * servers that see many unique testIds.\n   */\n  fixtureCountsMaxTestIds?: number;\n}\n\nexport class Journal {\n  private entries: JournalEntry[] = [];\n  private readonly fixtureMatchCountsByTestId: Map<string, Map<Fixture, number>> = new Map();\n  private readonly maxEntries: number;\n  private readonly fixtureCountsMaxTestIds: number;\n\n  constructor(options: JournalOptions = {}) {\n    // Treat 0 or negative as \"unbounded\" to preserve prior behavior when\n    // the option is omitted or explicitly disabled.\n    const cap = options.maxEntries;\n    this.maxEntries = cap !== undefined && cap > 0 ? cap : 0;\n    const testIdCap = options.fixtureCountsMaxTestIds;\n    this.fixtureCountsMaxTestIds = testIdCap !== undefined && testIdCap > 0 ? testIdCap : 0;\n  }\n\n  /** Backwards-compatible accessor — returns the default (no testId) count map. */\n  get fixtureMatchCounts(): Map<Fixture, number> {\n    return this.getFixtureMatchCountsForTest(DEFAULT_TEST_ID);\n  }\n\n  add(entry: Omit<JournalEntry, \"id\" | \"timestamp\">): JournalEntry {\n    const full: JournalEntry = {\n      id: generateId(\"req\"),\n      timestamp: Date.now(),\n      ...entry,\n      body: capBody(entry.body),\n    };\n    this.entries.push(full);\n    // FIFO eviction when over capacity. Array.prototype.shift() is O(n)\n    // regardless of how many we drop per add; we accept it at small caps\n    // (default 1000) because the constant factor is tiny and this runs once\n    // per request. For much larger caps, switch to a ring buffer for true\n    // O(1) eviction.\n    if (this.maxEntries > 0 && this.entries.length > this.maxEntries) {\n      this.entries.shift();\n    }\n    return full;\n  }\n\n  getAll(opts?: { limit?: number }): JournalEntry[] {\n    if (opts?.limit !== undefined) {\n      return this.entries.slice(-opts.limit);\n    }\n    return this.entries.slice();\n  }\n\n  getLast(): JournalEntry | null {\n    return this.entries.length > 0 ? this.entries[this.entries.length - 1] : null;\n  }\n\n  findByFixture(fixture: Fixture): JournalEntry[] {\n    return this.entries.filter((e) => e.response.fixture === fixture);\n  }\n\n  /**\n   * READ-ONLY accessor. Returns the existing count map for `testId`, or an\n   * empty transient Map if none exists. Does NOT insert into the cache and\n   * does NOT trigger FIFO eviction — callers may read freely without\n   * perturbing cache state. For the write path, see\n   * `getOrCreateFixtureMatchCountsForTest`.\n   */\n  getFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    return this.fixtureMatchCountsByTestId.get(testId) ?? new Map();\n  }\n\n  /**\n   * WRITE path: get the count map for `testId`, inserting a fresh empty Map\n   * if missing and running FIFO eviction when the testId cap is exceeded.\n   * Only callers that intend to mutate the map (e.g. incrementing a count)\n   * should use this.\n   */\n  private getOrCreateFixtureMatchCountsForTest(testId: string): Map<Fixture, number> {\n    let counts = this.fixtureMatchCountsByTestId.get(testId);\n    if (!counts) {\n      counts = new Map();\n      this.fixtureMatchCountsByTestId.set(testId, counts);\n      // FIFO eviction when over capacity. JS Map preserves insertion order,\n      // so the first key returned by keys() is the oldest. Same O(n) shift\n      // caveat as `entries`: acceptable at small caps (default 500).\n      if (\n        this.fixtureCountsMaxTestIds > 0 &&\n        this.fixtureMatchCountsByTestId.size > this.fixtureCountsMaxTestIds\n      ) {\n        const oldest = this.fixtureMatchCountsByTestId.keys().next().value;\n        if (oldest !== undefined) {\n          this.fixtureMatchCountsByTestId.delete(oldest);\n        }\n      }\n    }\n    return counts;\n  }\n\n  getFixtureMatchCount(fixture: Fixture, testId = DEFAULT_TEST_ID): number {\n    return this.getFixtureMatchCountsForTest(testId).get(fixture) ?? 0;\n  }\n\n  incrementFixtureMatchCount(\n    fixture: Fixture,\n    allFixtures?: readonly Fixture[],\n    testId = DEFAULT_TEST_ID,\n  ): void {\n    const counts = this.getOrCreateFixtureMatchCountsForTest(testId);\n    counts.set(fixture, (counts.get(fixture) ?? 0) + 1);\n    // When a sequenced fixture matches, also increment all siblings with matching criteria\n    if (fixture.match.sequenceIndex !== undefined && allFixtures) {\n      for (const sibling of allFixtures) {\n        if (sibling === fixture) continue;\n        if (sibling.match.sequenceIndex === undefined) continue;\n        if (matchCriteriaEqual(fixture.match, sibling.match)) {\n          counts.set(sibling, (counts.get(sibling) ?? 0) + 1);\n        }\n      }\n    }\n  }\n\n  clearMatchCounts(testId?: string): void {\n    if (testId !== undefined) {\n      this.fixtureMatchCountsByTestId.delete(testId);\n    } else {\n      this.fixtureMatchCountsByTestId.clear();\n    }\n  }\n\n  /**\n   * Clear ONLY the request journal entries, preserving fixture match-counts.\n   * Match-counts are fixture-matching/sequencing state, not journal data, so\n   * clearing the journal must not silently rewind sequenced fixtures. Used by\n   * `POST /__aimock/reset/journal`. For a full reset (entries + match-counts),\n   * use `clear()` instead.\n   */\n  clearEntries(): void {\n    this.entries = [];\n  }\n\n  clear(): void {\n    this.entries = [];\n    this.fixtureMatchCountsByTestId.clear();\n  }\n\n  get size(): number {\n    return this.entries.length;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAiBA,MAAM,yBAAyB,KAAK;;;;;;;;;;;AAYpC,SAAS,QAAQ,MAAkE;AACjF,KAAI,SAAS,KAAM,QAAO;CAC1B,MAAM,aAAa,KAAK,UAAU,KAAK;AACvC,KAAI,OAAO,WAAW,YAAY,OAAO,IAAI,uBAAwB,QAAO;AAI5E,QAAO;EACL,oBAAoB;EACpB,kBAAkB,OAAO,WAAW,YAAY,OAAO;EACvD,MAAM;EACP;;;;;AAMH,SAAS,WAAW,GAAY,GAAqB;AACnD,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO,MAAM;;;;;;AAOf,SAAS,mBACP,GACA,GACS;AACT,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,MAAM,UAAa,MAAM,OAAW,QAAO;AAC/C,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SAAU,QAAO,MAAM;AACjE,KAAI,MAAM,QAAQ,EAAE,IAAI,MAAM,QAAQ,EAAE,CACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,GAAG,MAAM,MAAM,EAAE,GAAG;AAC/D,KAAI,aAAa,UAAU,aAAa,OACtC,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;AAChD,QAAO;;;;;;AAOT,SAAS,mBAAmB,GAAiB,GAA0B;AACrE,QACE,WAAW,EAAE,aAAa,EAAE,YAAY,IACxC,mBAAmB,EAAE,eAAe,EAAE,cAAc,IACpD,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,YAAY,EAAE,WAAW,IACtC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,OAAO,EAAE,MAAM,IAC5B,WAAW,EAAE,gBAAgB,EAAE,eAAe,IAC9C,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,UAAU,EAAE,SAAS,IAClC,WAAW,EAAE,WAAW,EAAE,UAAU,IACpC,WAAW,EAAE,eAAe,EAAE,cAAc;;AA8BhD,IAAa,UAAb,MAAqB;CACnB,AAAQ,UAA0B,EAAE;CACpC,AAAiB,6CAAgE,IAAI,KAAK;CAC1F,AAAiB;CACjB,AAAiB;CAEjB,YAAY,UAA0B,EAAE,EAAE;EAGxC,MAAM,MAAM,QAAQ;AACpB,OAAK,aAAa,QAAQ,UAAa,MAAM,IAAI,MAAM;EACvD,MAAM,YAAY,QAAQ;AAC1B,OAAK,0BAA0B,cAAc,UAAa,YAAY,IAAI,YAAY;;;CAIxF,IAAI,qBAA2C;AAC7C,SAAO,KAAK,6BAA6B,gBAAgB;;CAG3D,IAAI,OAA6D;EAC/D,MAAM,OAAqB;GACzB,IAAI,WAAW,MAAM;GACrB,WAAW,KAAK,KAAK;GACrB,GAAG;GACH,MAAM,QAAQ,MAAM,KAAK;GAC1B;AACD,OAAK,QAAQ,KAAK,KAAK;AAMvB,MAAI,KAAK,aAAa,KAAK,KAAK,QAAQ,SAAS,KAAK,WACpD,MAAK,QAAQ,OAAO;AAEtB,SAAO;;CAGT,OAAO,MAA2C;AAChD,MAAI,MAAM,UAAU,OAClB,QAAO,KAAK,QAAQ,MAAM,CAAC,KAAK,MAAM;AAExC,SAAO,KAAK,QAAQ,OAAO;;CAG7B,UAA+B;AAC7B,SAAO,KAAK,QAAQ,SAAS,IAAI,KAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK;;CAG3E,cAAc,SAAkC;AAC9C,SAAO,KAAK,QAAQ,QAAQ,MAAM,EAAE,SAAS,YAAY,QAAQ;;;;;;;;;CAUnE,6BAA6B,QAAsC;AACjE,SAAO,KAAK,2BAA2B,IAAI,OAAO,oBAAI,IAAI,KAAK;;;;;;;;CASjE,AAAQ,qCAAqC,QAAsC;EACjF,IAAI,SAAS,KAAK,2BAA2B,IAAI,OAAO;AACxD,MAAI,CAAC,QAAQ;AACX,4BAAS,IAAI,KAAK;AAClB,QAAK,2BAA2B,IAAI,QAAQ,OAAO;AAInD,OACE,KAAK,0BAA0B,KAC/B,KAAK,2BAA2B,OAAO,KAAK,yBAC5C;IACA,MAAM,SAAS,KAAK,2BAA2B,MAAM,CAAC,MAAM,CAAC;AAC7D,QAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;;;AAIpD,SAAO;;CAGT,qBAAqB,SAAkB,SAAS,iBAAyB;AACvE,SAAO,KAAK,6BAA6B,OAAO,CAAC,IAAI,QAAQ,IAAI;;CAGnE,2BACE,SACA,aACA,SAAS,iBACH;EACN,MAAM,SAAS,KAAK,qCAAqC,OAAO;AAChE,SAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;AAEnD,MAAI,QAAQ,MAAM,kBAAkB,UAAa,YAC/C,MAAK,MAAM,WAAW,aAAa;AACjC,OAAI,YAAY,QAAS;AACzB,OAAI,QAAQ,MAAM,kBAAkB,OAAW;AAC/C,OAAI,mBAAmB,QAAQ,OAAO,QAAQ,MAAM,CAClD,QAAO,IAAI,UAAU,OAAO,IAAI,QAAQ,IAAI,KAAK,EAAE;;;CAM3D,iBAAiB,QAAuB;AACtC,MAAI,WAAW,OACb,MAAK,2BAA2B,OAAO,OAAO;MAE9C,MAAK,2BAA2B,OAAO;;;;;;;;;CAW3C,eAAqB;AACnB,OAAK,UAAU,EAAE;;CAGnB,QAAc;AACZ,OAAK,UAAU,EAAE;AACjB,OAAK,2BAA2B,OAAO;;CAGzC,IAAI,OAAe;AACjB,SAAO,KAAK,QAAQ"}

package/dist/server.cjs

@@ -779,7 +779,10 @@ async function createServer(fixtures, options, mounts, serviceFixtures) {
 	const server = node_http.createServer((req, res) => {
 		handleHttpRequest(req, res).catch((err) => {
 			const msg = err instanceof Error ? err.message : "Internal error";
-			defaults.logger.warn(`Unhandled request error: ${msg}`);
+			const stack = err instanceof Error ? err.stack ?? msg : msg;
+			const method = req.method ?? "?";
+			const url = req.url ?? "?";
+			defaults.logger.warn(`Unhandled request error on ${method} ${url}: ${msg}\n${stack}`);
 			if (!res.headersSent) {
 				res.writeHead(500, { "Content-Type": "application/json" });
 				res.end(JSON.stringify({ error: {