logixia 1.13.3 → 2.0.4

package/dist/{safe-stringify-DJ66tW5I.mjs → safe-stringify-BMRl3EX3.mjs}

@@ -1,4 +1,4 @@
-//#region src/utils/safe-stringify.ts
+// src/utils/safe-stringify.ts
 /** Build a JSONPath like `$["a"][0]["b"]` for a decycle pointer. */
 function jsonPath(parts) {
 	let path = "$";
@@ -112,7 +112,6 @@ function stringifyForLog(value) {
 		}
 	}
 }
-
-//#endregion
 export { stringifyForLog as i, retrocycle as n, safeStringify as r, decycleValue as t };
-//# sourceMappingURL=safe-stringify-DJ66tW5I.mjs.map
+
+//# sourceMappingURL=safe-stringify-BMRl3EX3.mjs.map

package/dist/safe-stringify-BMRl3EX3.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-stringify-BMRl3EX3.mjs","names":[],"sources":["../src/utils/safe-stringify.ts"],"sourcesContent":["/**\n * logixia — robust JSON serialization for log payloads.\n *\n * Modern Winston/Pino already neutralize circular refs to `[Circular]` (via\n * safe-stable-stringify / fast-safe-stringify), so merely \"surviving cycles\" is\n * not a differentiator. This goes one notch further:\n *\n *  - **BigInt** → serialized (as a string by default; JSON.stringify throws on\n *    BigInt, which silently breaks logging of e.g. DB bigint ids).\n *  - **Deterministic key order** (optional) so identical objects hash/diff equal.\n *  - **True decycle** (optional) — replace repeated references with JSONPath\n *    `$ref` pointers that round-trip back to the original object graph, instead\n *    of the lossy `[Circular]` tag. Useful when you need to reconstruct shared\n *    structure downstream.\n *\n * @example\n * ```ts\n * safeStringify({ id: 10n, self: obj });          // → BigInt + cycle safe\n * safeStringify(graph, { decycle: true });         // → round-trippable $ref pointers\n * const back = retrocycle(JSON.parse(json));       // → reconstruct shared refs\n * ```\n */\n\nexport interface SafeStringifyOptions {\n  /** Indentation passed to JSON.stringify (number of spaces or a string). */\n  indent?: number | string;\n  /** Sort object keys for deterministic output. Default: false. */\n  deterministic?: boolean;\n  /**\n   * Use round-trippable `$ref` JSONPath pointers for repeated references instead\n   * of the lossy \"[Circular]\" tag. Default: false.\n   */\n  decycle?: boolean;\n  /** How to render BigInt: 'string' (default) or 'number' (may lose precision). */\n  bigint?: 'string' | 'number';\n}\n\n/** Build a JSONPath like `$[\"a\"][0][\"b\"]` for a decycle pointer. */\nfunction jsonPath(parts: Array<string | number>): string {\n  let path = '$';\n  for (const p of parts) {\n    path += typeof p === 'number' ? `[${p}]` : `[${JSON.stringify(p)}]`;\n  }\n  return path;\n}\n\n/**\n * Serialize any value to JSON without throwing on circular references or BigInt.\n * Circular refs become `\"[Circular]\"` (or `{ $ref }` pointers when `decycle`).\n */\nexport function safeStringify(value: unknown, options: SafeStringifyOptions = {}): string {\n  const { indent, deterministic = false, decycle = false, bigint = 'string' } = options;\n\n  if (decycle) {\n    return JSON.stringify(decycleValue(value, bigint), undefined, indent);\n  }\n\n  const seen = new WeakSet<object>();\n\n  const transform = (val: unknown): unknown => {\n    if (typeof val === 'bigint') return bigint === 'number' ? Number(val) : val.toString();\n    if (typeof val === 'function') return `[Function: ${val.name || 'anonymous'}]`;\n    if (typeof val === 'symbol') return val.toString();\n    if (val === null || typeof val !== 'object') return val;\n\n    if (seen.has(val)) return '[Circular]';\n    seen.add(val);\n\n    let out: unknown;\n    const toJSON = (val as { toJSON?: unknown }).toJSON;\n    if (Array.isArray(val)) {\n      out = val.map((item) => transform(item));\n    } else if (typeof toJSON === 'function') {\n      // Dates, URLs, Buffers and classes with their own toJSON print the way\n      // JSON.stringify would; a toJSON that returns `this` hits the cycle check.\n      out = transform(toJSON.call(val));\n    } else {\n      const rec = val as Record<string, unknown>;\n      const keys = deterministic ? Object.keys(rec).sort() : Object.keys(rec);\n      const obj: Record<string, unknown> = {};\n      for (const k of keys) {\n        if (k === '__proto__' || k === 'constructor' || k === 'prototype') continue;\n        obj[k] = transform(rec[k]);\n      }\n      out = obj;\n    }\n    // Allow the same object to appear in sibling branches (not a true cycle):\n    // remove from `seen` after we finish its subtree.\n    seen.delete(val);\n    return out;\n  };\n\n  return JSON.stringify(transform(value), undefined, indent);\n}\n\n/**\n * Replace repeated object references with round-trippable `{ \"$ref\": \"$...\" }`\n * JSONPath pointers (the classic Crockford decycle). Pair with {@link retrocycle}\n * to reconstruct the original shared/circular graph.\n */\nexport function decycleValue(value: unknown, bigint: 'string' | 'number' = 'string'): unknown {\n  const paths = new WeakMap<object, string>();\n\n  const walk = (val: unknown, path: Array<string | number>): unknown => {\n    if (typeof val === 'bigint') return bigint === 'number' ? Number(val) : val.toString();\n    if (val === null || typeof val !== 'object') return val;\n    if (val instanceof Date) return val.toISOString();\n\n    const existing = paths.get(val);\n    if (existing !== undefined) return { $ref: existing };\n    paths.set(val, jsonPath(path));\n\n    if (Array.isArray(val)) {\n      return val.map((item, i) => walk(item, [...path, i]));\n    }\n    const rec = val as Record<string, unknown>;\n    const obj: Record<string, unknown> = {};\n    for (const k of Object.keys(rec)) {\n      if (k === '__proto__' || k === 'constructor' || k === 'prototype') continue;\n      obj[k] = walk(rec[k], [...path, k]);\n    }\n    return obj;\n  };\n\n  return walk(value, []);\n}\n\n/**\n * Inverse of {@link decycleValue}: resolve `{ \"$ref\": \"$...\" }` pointers back\n * into the live object graph (mutates and returns the parsed input).\n */\nexport function retrocycle<T>(root: T): T {\n  const refRe = /^\\$(?:\\[(?:\\d+|\"(?:[^\"\\\\]|\\\\.)*\")\\])*$/;\n\n  const resolve = (path: string): unknown => {\n    // Parse the JSONPath segments back out.\n    const segs: Array<string | number> = [];\n    const partRe = /\\[(\\d+|\"(?:[^\"\\\\]|\\\\.)*\")\\]/g;\n    let m: RegExpExecArray | null;\n    while ((m = partRe.exec(path)) !== null) {\n      const raw = m[1]!;\n      segs.push(raw.startsWith('\"') ? (JSON.parse(raw) as string) : Number(raw));\n    }\n    let node: unknown = root;\n    for (const s of segs) {\n      node = (node as Record<string | number, unknown>)[s];\n    }\n    return node;\n  };\n\n  const walk = (val: unknown): void => {\n    if (val === null || typeof val !== 'object') return;\n    const rec = val as Record<string, unknown>;\n    for (const k of Object.keys(rec)) {\n      const child = rec[k];\n      if (\n        child !== null &&\n        typeof child === 'object' &&\n        typeof (child as { $ref?: unknown }).$ref === 'string' &&\n        refRe.test((child as { $ref: string }).$ref)\n      ) {\n        rec[k] = resolve((child as { $ref: string }).$ref);\n      } else {\n        walk(child);\n      }\n    }\n  };\n\n  walk(root);\n  return root;\n}\n\n/**\n * `JSON.stringify` for log output. Takes the plain fast path first and only\n * falls back to {@link safeStringify} when that throws (a cycle, a BigInt, a\n * throwing `toJSON`), so a bad payload costs nothing until it shows up.\n * Never throws: if even the safe walk fails, the value is replaced by a marker.\n */\nexport function stringifyForLog(value: unknown): string {\n  try {\n    return JSON.stringify(value);\n  } catch {\n    try {\n      return safeStringify(value);\n    } catch (error) {\n      const reason = error instanceof Error ? error.message : String(error);\n      return JSON.stringify(`[Unserializable: ${reason}]`);\n    }\n  }\n}\n"],"mappings":";;AAsCA,SAAS,SAAS,OAAuC;CACvD,IAAI,OAAO;CACX,KAAK,MAAM,KAAK,OACd,QAAQ,OAAO,MAAM,WAAW,IAAI,EAAE,KAAK,IAAI,KAAK,UAAU,CAAC,EAAE;CAEnE,OAAO;AACT;;;;;AAMA,SAAgB,cAAc,OAAgB,UAAgC,CAAC,GAAW;CACxF,MAAM,EAAE,QAAQ,gBAAgB,OAAO,UAAU,OAAO,SAAS,aAAa;CAE9E,IAAI,SACF,OAAO,KAAK,UAAU,aAAa,OAAO,MAAM,GAAG,KAAA,GAAW,MAAM;CAGtE,MAAM,uBAAO,IAAI,QAAgB;CAEjC,MAAM,aAAa,QAA0B;EAC3C,IAAI,OAAO,QAAQ,UAAU,OAAO,WAAW,WAAW,OAAO,GAAG,IAAI,IAAI,SAAS;EACrF,IAAI,OAAO,QAAQ,YAAY,OAAO,cAAc,IAAI,QAAQ,YAAY;EAC5E,IAAI,OAAO,QAAQ,UAAU,OAAO,IAAI,SAAS;EACjD,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO;EAEpD,IAAI,KAAK,IAAI,GAAG,GAAG,OAAO;EAC1B,KAAK,IAAI,GAAG;EAEZ,IAAI;EACJ,MAAM,SAAU,IAA6B;EAC7C,IAAI,MAAM,QAAQ,GAAG,GACnB,MAAM,IAAI,KAAK,SAAS,UAAU,IAAI,CAAC;OAClC,IAAI,OAAO,WAAW,YAG3B,MAAM,UAAU,OAAO,KAAK,GAAG,CAAC;OAC3B;GACL,MAAM,MAAM;GACZ,MAAM,OAAO,gBAAgB,OAAO,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,OAAO,KAAK,GAAG;GACtE,MAAM,MAA+B,CAAC;GACtC,KAAK,MAAM,KAAK,MAAM;IACpB,IAAI,MAAM,eAAe,MAAM,iBAAiB,MAAM,aAAa;IACnE,IAAI,KAAK,UAAU,IAAI,EAAE;GAC3B;GACA,MAAM;EACR;EAGA,KAAK,OAAO,GAAG;EACf,OAAO;CACT;CAEA,OAAO,KAAK,UAAU,UAAU,KAAK,GAAG,KAAA,GAAW,MAAM;AAC3D;;;;;;AAOA,SAAgB,aAAa,OAAgB,SAA8B,UAAmB;CAC5F,MAAM,wBAAQ,IAAI,QAAwB;CAE1C,MAAM,QAAQ,KAAc,SAA0C;EACpE,IAAI,OAAO,QAAQ,UAAU,OAAO,WAAW,WAAW,OAAO,GAAG,IAAI,IAAI,SAAS;EACrF,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO;EACpD,IAAI,eAAe,MAAM,OAAO,IAAI,YAAY;EAEhD,MAAM,WAAW,MAAM,IAAI,GAAG;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO,EAAE,MAAM,SAAS;EACpD,MAAM,IAAI,KAAK,SAAS,IAAI,CAAC;EAE7B,IAAI,MAAM,QAAQ,GAAG,GACnB,OAAO,IAAI,KAAK,MAAM,MAAM,KAAK,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;EAEtD,MAAM,MAAM;EACZ,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,KAAK,OAAO,KAAK,GAAG,GAAG;GAChC,IAAI,MAAM,eAAe,MAAM,iBAAiB,MAAM,aAAa;GACnE,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;EACpC;EACA,OAAO;CACT;CAEA,OAAO,KAAK,OAAO,CAAC,CAAC;AACvB;;;;;AAMA,SAAgB,WAAc,MAAY;CACxC,MAAM,QAAQ;CAEd,MAAM,WAAW,SAA0B;EAEzC,MAAM,OAA+B,CAAC;EACtC,MAAM,SAAS;EACf,IAAI;EACJ,QAAQ,IAAI,OAAO,KAAK,IAAI,OAAO,MAAM;GACvC,MAAM,MAAM,EAAE;GACd,KAAK,KAAK,IAAI,WAAW,IAAG,IAAK,KAAK,MAAM,GAAG,IAAe,OAAO,GAAG,CAAC;EAC3E;EACA,IAAI,OAAgB;EACpB,KAAK,MAAM,KAAK,MACd,OAAQ,KAA0C;EAEpD,OAAO;CACT;CAEA,MAAM,QAAQ,QAAuB;EACnC,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;EAC7C,MAAM,MAAM;EACZ,KAAK,MAAM,KAAK,OAAO,KAAK,GAAG,GAAG;GAChC,MAAM,QAAQ,IAAI;GAClB,IACE,UAAU,QACV,OAAO,UAAU,YACjB,OAAQ,MAA6B,SAAS,YAC9C,MAAM,KAAM,MAA2B,IAAI,GAE3C,IAAI,KAAK,QAAS,MAA2B,IAAI;QAEjD,KAAK,KAAK;EAEd;CACF;CAEA,KAAK,IAAI;CACT,OAAO;AACT;;;;;;;AAQA,SAAgB,gBAAgB,OAAwB;CACtD,IAAI;EACF,OAAO,KAAK,UAAU,KAAK;CAC7B,QAAQ;EACN,IAAI;GACF,OAAO,cAAc,KAAK;EAC5B,SAAS,OAAO;GACd,MAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GACpE,OAAO,KAAK,UAAU,oBAAoB,OAAO,EAAE;EACrD;CACF;AACF"}

package/dist/{safe-stringify-DWo3aZp_.js → safe-stringify-DLz1Kz3o.js}

@@ -1,5 +1,4 @@
-
-//#region src/utils/safe-stringify.ts
+// src/utils/safe-stringify.ts
 /** Build a JSONPath like `$["a"][0]["b"]` for a decycle pointer. */
 function jsonPath(parts) {
 	let path = "$";
@@ -113,30 +112,29 @@ function stringifyForLog(value) {
 		}
 	}
 }
-
-//#endregion
-Object.defineProperty(exports, 'decycleValue', {
-  enumerable: true,
-  get: function () {
-    return decycleValue;
-  }
+Object.defineProperty(exports, "decycleValue", {
+	enumerable: true,
+	get: function() {
+		return decycleValue;
+	}
 });
-Object.defineProperty(exports, 'retrocycle', {
-  enumerable: true,
-  get: function () {
-    return retrocycle;
-  }
+Object.defineProperty(exports, "retrocycle", {
+	enumerable: true,
+	get: function() {
+		return retrocycle;
+	}
 });
-Object.defineProperty(exports, 'safeStringify', {
-  enumerable: true,
-  get: function () {
-    return safeStringify;
-  }
+Object.defineProperty(exports, "safeStringify", {
+	enumerable: true,
+	get: function() {
+		return safeStringify;
+	}
 });
-Object.defineProperty(exports, 'stringifyForLog', {
-  enumerable: true,
-  get: function () {
-    return stringifyForLog;
-  }
+Object.defineProperty(exports, "stringifyForLog", {
+	enumerable: true,
+	get: function() {
+		return stringifyForLog;
+	}
 });
-//# sourceMappingURL=safe-stringify-DWo3aZp_.js.map
+
+//# sourceMappingURL=safe-stringify-DLz1Kz3o.js.map

package/dist/safe-stringify-DLz1Kz3o.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-stringify-DLz1Kz3o.js","names":[],"sources":["../src/utils/safe-stringify.ts"],"sourcesContent":["/**\n * logixia — robust JSON serialization for log payloads.\n *\n * Modern Winston/Pino already neutralize circular refs to `[Circular]` (via\n * safe-stable-stringify / fast-safe-stringify), so merely \"surviving cycles\" is\n * not a differentiator. This goes one notch further:\n *\n *  - **BigInt** → serialized (as a string by default; JSON.stringify throws on\n *    BigInt, which silently breaks logging of e.g. DB bigint ids).\n *  - **Deterministic key order** (optional) so identical objects hash/diff equal.\n *  - **True decycle** (optional) — replace repeated references with JSONPath\n *    `$ref` pointers that round-trip back to the original object graph, instead\n *    of the lossy `[Circular]` tag. Useful when you need to reconstruct shared\n *    structure downstream.\n *\n * @example\n * ```ts\n * safeStringify({ id: 10n, self: obj });          // → BigInt + cycle safe\n * safeStringify(graph, { decycle: true });         // → round-trippable $ref pointers\n * const back = retrocycle(JSON.parse(json));       // → reconstruct shared refs\n * ```\n */\n\nexport interface SafeStringifyOptions {\n  /** Indentation passed to JSON.stringify (number of spaces or a string). */\n  indent?: number | string;\n  /** Sort object keys for deterministic output. Default: false. */\n  deterministic?: boolean;\n  /**\n   * Use round-trippable `$ref` JSONPath pointers for repeated references instead\n   * of the lossy \"[Circular]\" tag. Default: false.\n   */\n  decycle?: boolean;\n  /** How to render BigInt: 'string' (default) or 'number' (may lose precision). */\n  bigint?: 'string' | 'number';\n}\n\n/** Build a JSONPath like `$[\"a\"][0][\"b\"]` for a decycle pointer. */\nfunction jsonPath(parts: Array<string | number>): string {\n  let path = '$';\n  for (const p of parts) {\n    path += typeof p === 'number' ? `[${p}]` : `[${JSON.stringify(p)}]`;\n  }\n  return path;\n}\n\n/**\n * Serialize any value to JSON without throwing on circular references or BigInt.\n * Circular refs become `\"[Circular]\"` (or `{ $ref }` pointers when `decycle`).\n */\nexport function safeStringify(value: unknown, options: SafeStringifyOptions = {}): string {\n  const { indent, deterministic = false, decycle = false, bigint = 'string' } = options;\n\n  if (decycle) {\n    return JSON.stringify(decycleValue(value, bigint), undefined, indent);\n  }\n\n  const seen = new WeakSet<object>();\n\n  const transform = (val: unknown): unknown => {\n    if (typeof val === 'bigint') return bigint === 'number' ? Number(val) : val.toString();\n    if (typeof val === 'function') return `[Function: ${val.name || 'anonymous'}]`;\n    if (typeof val === 'symbol') return val.toString();\n    if (val === null || typeof val !== 'object') return val;\n\n    if (seen.has(val)) return '[Circular]';\n    seen.add(val);\n\n    let out: unknown;\n    const toJSON = (val as { toJSON?: unknown }).toJSON;\n    if (Array.isArray(val)) {\n      out = val.map((item) => transform(item));\n    } else if (typeof toJSON === 'function') {\n      // Dates, URLs, Buffers and classes with their own toJSON print the way\n      // JSON.stringify would; a toJSON that returns `this` hits the cycle check.\n      out = transform(toJSON.call(val));\n    } else {\n      const rec = val as Record<string, unknown>;\n      const keys = deterministic ? Object.keys(rec).sort() : Object.keys(rec);\n      const obj: Record<string, unknown> = {};\n      for (const k of keys) {\n        if (k === '__proto__' || k === 'constructor' || k === 'prototype') continue;\n        obj[k] = transform(rec[k]);\n      }\n      out = obj;\n    }\n    // Allow the same object to appear in sibling branches (not a true cycle):\n    // remove from `seen` after we finish its subtree.\n    seen.delete(val);\n    return out;\n  };\n\n  return JSON.stringify(transform(value), undefined, indent);\n}\n\n/**\n * Replace repeated object references with round-trippable `{ \"$ref\": \"$...\" }`\n * JSONPath pointers (the classic Crockford decycle). Pair with {@link retrocycle}\n * to reconstruct the original shared/circular graph.\n */\nexport function decycleValue(value: unknown, bigint: 'string' | 'number' = 'string'): unknown {\n  const paths = new WeakMap<object, string>();\n\n  const walk = (val: unknown, path: Array<string | number>): unknown => {\n    if (typeof val === 'bigint') return bigint === 'number' ? Number(val) : val.toString();\n    if (val === null || typeof val !== 'object') return val;\n    if (val instanceof Date) return val.toISOString();\n\n    const existing = paths.get(val);\n    if (existing !== undefined) return { $ref: existing };\n    paths.set(val, jsonPath(path));\n\n    if (Array.isArray(val)) {\n      return val.map((item, i) => walk(item, [...path, i]));\n    }\n    const rec = val as Record<string, unknown>;\n    const obj: Record<string, unknown> = {};\n    for (const k of Object.keys(rec)) {\n      if (k === '__proto__' || k === 'constructor' || k === 'prototype') continue;\n      obj[k] = walk(rec[k], [...path, k]);\n    }\n    return obj;\n  };\n\n  return walk(value, []);\n}\n\n/**\n * Inverse of {@link decycleValue}: resolve `{ \"$ref\": \"$...\" }` pointers back\n * into the live object graph (mutates and returns the parsed input).\n */\nexport function retrocycle<T>(root: T): T {\n  const refRe = /^\\$(?:\\[(?:\\d+|\"(?:[^\"\\\\]|\\\\.)*\")\\])*$/;\n\n  const resolve = (path: string): unknown => {\n    // Parse the JSONPath segments back out.\n    const segs: Array<string | number> = [];\n    const partRe = /\\[(\\d+|\"(?:[^\"\\\\]|\\\\.)*\")\\]/g;\n    let m: RegExpExecArray | null;\n    while ((m = partRe.exec(path)) !== null) {\n      const raw = m[1]!;\n      segs.push(raw.startsWith('\"') ? (JSON.parse(raw) as string) : Number(raw));\n    }\n    let node: unknown = root;\n    for (const s of segs) {\n      node = (node as Record<string | number, unknown>)[s];\n    }\n    return node;\n  };\n\n  const walk = (val: unknown): void => {\n    if (val === null || typeof val !== 'object') return;\n    const rec = val as Record<string, unknown>;\n    for (const k of Object.keys(rec)) {\n      const child = rec[k];\n      if (\n        child !== null &&\n        typeof child === 'object' &&\n        typeof (child as { $ref?: unknown }).$ref === 'string' &&\n        refRe.test((child as { $ref: string }).$ref)\n      ) {\n        rec[k] = resolve((child as { $ref: string }).$ref);\n      } else {\n        walk(child);\n      }\n    }\n  };\n\n  walk(root);\n  return root;\n}\n\n/**\n * `JSON.stringify` for log output. Takes the plain fast path first and only\n * falls back to {@link safeStringify} when that throws (a cycle, a BigInt, a\n * throwing `toJSON`), so a bad payload costs nothing until it shows up.\n * Never throws: if even the safe walk fails, the value is replaced by a marker.\n */\nexport function stringifyForLog(value: unknown): string {\n  try {\n    return JSON.stringify(value);\n  } catch {\n    try {\n      return safeStringify(value);\n    } catch (error) {\n      const reason = error instanceof Error ? error.message : String(error);\n      return JSON.stringify(`[Unserializable: ${reason}]`);\n    }\n  }\n}\n"],"mappings":";;AAsCA,SAAS,SAAS,OAAuC;CACvD,IAAI,OAAO;CACX,KAAK,MAAM,KAAK,OACd,QAAQ,OAAO,MAAM,WAAW,IAAI,EAAE,KAAK,IAAI,KAAK,UAAU,CAAC,EAAE;CAEnE,OAAO;AACT;;;;;AAMA,SAAgB,cAAc,OAAgB,UAAgC,CAAC,GAAW;CACxF,MAAM,EAAE,QAAQ,gBAAgB,OAAO,UAAU,OAAO,SAAS,aAAa;CAE9E,IAAI,SACF,OAAO,KAAK,UAAU,aAAa,OAAO,MAAM,GAAG,KAAA,GAAW,MAAM;CAGtE,MAAM,uBAAO,IAAI,QAAgB;CAEjC,MAAM,aAAa,QAA0B;EAC3C,IAAI,OAAO,QAAQ,UAAU,OAAO,WAAW,WAAW,OAAO,GAAG,IAAI,IAAI,SAAS;EACrF,IAAI,OAAO,QAAQ,YAAY,OAAO,cAAc,IAAI,QAAQ,YAAY;EAC5E,IAAI,OAAO,QAAQ,UAAU,OAAO,IAAI,SAAS;EACjD,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO;EAEpD,IAAI,KAAK,IAAI,GAAG,GAAG,OAAO;EAC1B,KAAK,IAAI,GAAG;EAEZ,IAAI;EACJ,MAAM,SAAU,IAA6B;EAC7C,IAAI,MAAM,QAAQ,GAAG,GACnB,MAAM,IAAI,KAAK,SAAS,UAAU,IAAI,CAAC;OAClC,IAAI,OAAO,WAAW,YAG3B,MAAM,UAAU,OAAO,KAAK,GAAG,CAAC;OAC3B;GACL,MAAM,MAAM;GACZ,MAAM,OAAO,gBAAgB,OAAO,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,OAAO,KAAK,GAAG;GACtE,MAAM,MAA+B,CAAC;GACtC,KAAK,MAAM,KAAK,MAAM;IACpB,IAAI,MAAM,eAAe,MAAM,iBAAiB,MAAM,aAAa;IACnE,IAAI,KAAK,UAAU,IAAI,EAAE;GAC3B;GACA,MAAM;EACR;EAGA,KAAK,OAAO,GAAG;EACf,OAAO;CACT;CAEA,OAAO,KAAK,UAAU,UAAU,KAAK,GAAG,KAAA,GAAW,MAAM;AAC3D;;;;;;AAOA,SAAgB,aAAa,OAAgB,SAA8B,UAAmB;CAC5F,MAAM,wBAAQ,IAAI,QAAwB;CAE1C,MAAM,QAAQ,KAAc,SAA0C;EACpE,IAAI,OAAO,QAAQ,UAAU,OAAO,WAAW,WAAW,OAAO,GAAG,IAAI,IAAI,SAAS;EACrF,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU,OAAO;EACpD,IAAI,eAAe,MAAM,OAAO,IAAI,YAAY;EAEhD,MAAM,WAAW,MAAM,IAAI,GAAG;EAC9B,IAAI,aAAa,KAAA,GAAW,OAAO,EAAE,MAAM,SAAS;EACpD,MAAM,IAAI,KAAK,SAAS,IAAI,CAAC;EAE7B,IAAI,MAAM,QAAQ,GAAG,GACnB,OAAO,IAAI,KAAK,MAAM,MAAM,KAAK,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;EAEtD,MAAM,MAAM;EACZ,MAAM,MAA+B,CAAC;EACtC,KAAK,MAAM,KAAK,OAAO,KAAK,GAAG,GAAG;GAChC,IAAI,MAAM,eAAe,MAAM,iBAAiB,MAAM,aAAa;GACnE,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;EACpC;EACA,OAAO;CACT;CAEA,OAAO,KAAK,OAAO,CAAC,CAAC;AACvB;;;;;AAMA,SAAgB,WAAc,MAAY;CACxC,MAAM,QAAQ;CAEd,MAAM,WAAW,SAA0B;EAEzC,MAAM,OAA+B,CAAC;EACtC,MAAM,SAAS;EACf,IAAI;EACJ,QAAQ,IAAI,OAAO,KAAK,IAAI,OAAO,MAAM;GACvC,MAAM,MAAM,EAAE;GACd,KAAK,KAAK,IAAI,WAAW,IAAG,IAAK,KAAK,MAAM,GAAG,IAAe,OAAO,GAAG,CAAC;EAC3E;EACA,IAAI,OAAgB;EACpB,KAAK,MAAM,KAAK,MACd,OAAQ,KAA0C;EAEpD,OAAO;CACT;CAEA,MAAM,QAAQ,QAAuB;EACnC,IAAI,QAAQ,QAAQ,OAAO,QAAQ,UAAU;EAC7C,MAAM,MAAM;EACZ,KAAK,MAAM,KAAK,OAAO,KAAK,GAAG,GAAG;GAChC,MAAM,QAAQ,IAAI;GAClB,IACE,UAAU,QACV,OAAO,UAAU,YACjB,OAAQ,MAA6B,SAAS,YAC9C,MAAM,KAAM,MAA2B,IAAI,GAE3C,IAAI,KAAK,QAAS,MAA2B,IAAI;QAEjD,KAAK,KAAK;EAEd;CACF;CAEA,KAAK,IAAI;CACT,OAAO;AACT;;;;;;;AAQA,SAAgB,gBAAgB,OAAwB;CACtD,IAAI;EACF,OAAO,KAAK,UAAU,KAAK;CAC7B,QAAQ;EACN,IAAI;GACF,OAAO,cAAc,KAAK;EAC5B,SAAS,OAAO;GACd,MAAM,SAAS,iBAAiB,QAAQ,MAAM,UAAU,OAAO,KAAK;GACpE,OAAO,KAAK,UAAU,oBAAoB,OAAO,EAAE;EACrD;CACF;AACF"}

package/dist/{search-CHUZPl0h.d.ts → search-BH33XhuU.d.mts}

@@ -1,7 +1,4 @@
-import { h as LogEntry } from "./index-nZEeCr3X.js";
-
-//#region src/search/types/search.types.d.ts
-
+import { h as LogEntry } from "./index-xqaJtAZn.mjs";
 /**
  * Search filter options
  */
@@ -261,8 +258,6 @@ interface ExportOptions {
   filename?: string;
   fields?: string[];
 }
-//#endregion
-//#region src/search/search-manager.d.ts
 /**
  * Configuration for search manager
  */
@@ -395,8 +390,6 @@ declare class SearchManager {
   private filterFields;
   private getNestedValue;
 }
-//#endregion
-//#region src/search/core/log-indexer.interface.d.ts
 /**
  * Log indexer interface
  */
@@ -446,8 +439,6 @@ interface ILogIndexer {
    */
   removeOldLogs(olderThan: Date): Promise<number>;
 }
-//#endregion
-//#region src/search/core/basic-log-indexer.d.ts
 /**
  * Basic log indexer implementation
  */
@@ -528,8 +519,6 @@ declare class BasicLogIndexer implements ILogIndexer {
   private removeOldestLogs;
   private clusterLogs;
 }
-//#endregion
-//#region src/search/core/search-engine.interface.d.ts
 /**
  * Main search engine interface
  */
@@ -597,8 +586,6 @@ interface ILogSearchEngine {
    */
   deletePreset(presetId: string): Promise<void>;
 }
-//#endregion
-//#region src/search/core/basic-search-engine.d.ts
 /**
  * Basic search engine implementation
  */
@@ -687,8 +674,6 @@ declare class BasicSearchEngine implements ILogSearchEngine {
   private getTopTerms;
   private generateId;
 }
-//#endregion
-//#region src/search/engines/correlation-engine.d.ts
 /**
  * Correlation engine for log analysis
  */
@@ -740,8 +725,6 @@ declare class CorrelationEngine {
   private convertToCorrelatedLogs;
   private generateSummary;
 }
-//#endregion
-//#region src/search/engines/nlp-search-engine.d.ts
 /**
  * NLP-enhanced search engine
  */
@@ -766,8 +749,6 @@ declare class NLPSearchEngine extends BasicSearchEngine {
   private getOptionsForIntent;
   private extractCleanQuery;
 }
-//#endregion
-//#region src/search/engines/pattern-recognition-engine.d.ts
 /**
  * Pattern recognition engine for log analysis
  */
@@ -810,6 +791,5 @@ declare class PatternRecognitionEngine {
   private findDeviations;
   private doesLogMatchPattern;
 }
-//#endregion
 export { SearchStats as A, SearchFilters as C, SearchPreset as D, SearchOptions as E, SuggestionType as F, TimeRange as I, TimelineEvent as L, SemanticIndex as M, SimilarLog as N, SearchQuery as O, SortField as P, RelativeTime as S, SearchMatch as T, ParsedNLQuery as _, ILogSearchEngine as a, RelatedLog as b, SearchManager as c, CorrelatedLogs as d, EntityType as f, LogPattern as g, LogCorrelationSummary as h, BasicSearchEngine as i, SearchSuggestion as j, SearchResult as k, SearchManagerConfig as l, LogCluster as m, NLPSearchEngine as n, BasicLogIndexer as o, ExportOptions as p, CorrelationEngine as r, ILogIndexer as s, PatternRecognitionEngine as t, AnomalyDetection as u, QueryEntity as v, SearchHighlight as w, RelationshipType as x, QueryIntent as y };
-//# sourceMappingURL=search-CHUZPl0h.d.ts.map
+//# sourceMappingURL=search-BH33XhuU.d.mts.map

package/dist/search-BH33XhuU.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"search-BH33XhuU.d.mts","names":[],"sources":["../src/search/types/search.types.ts","../src/search/search-manager.ts","../src/search/core/log-indexer.interface.ts","../src/search/core/basic-log-indexer.ts","../src/search/core/search-engine.interface.ts","../src/search/core/basic-search-engine.ts","../src/search/engines/correlation-engine.ts","../src/search/engines/nlp-search-engine.ts","../src/search/engines/pattern-recognition-engine.ts"],"mappings":";;;;UASiB;EACf;EACA;EACA;EACA,YAAY;EACZ;EACA;EACA;EACA;EACA;EACA;EACA,eAAe;;;;;UAMA;EACf,OAAO;EACP,MAAM;EACN,WAAW;;;;;UAMI;EACf;EACA;;;;;UAMe;EACf,KAAK;EACL;EACA,aAAa;EACb,UAAU;EACV,UAAU;EACV,cAAc;;;;;UAMC;EACf;EACA;EACA;;;;;UAMe;EACf;EACA;EACA;EACA;;;;;UAMe;EACf,KAAK;EACL,cAAc;EACd;;;;;KAMU;;;;UAWK;EACf;EACA;EACA,MAAM;EACN,UAAU;EACV,UAAU;;;;;UAMK;EACf,WAAW;EACX,KAAK;EACL;EACA;;;;;UAMe;EACf;EACA;EACA;EACA;EACA;EACA,eAAe;;;;;UAMA;EACf,KAAK;EACL;EACA;EACA;;;;;UAMe;EACf;EACA,UAAU;EACV,UAAU;EACV,WAAW;EACX;;;;;UAMe;EACf;EACA;EACA,SAAS;EACT;EACA;EACA;EACA;EACA;EACA;EACA;;;;;KAMU;;;;UAKK;EACf;EACA,MAAM;EACN;EACA;EACA,WAAW;;;;;KAMD;;;;UAMK;EACf;EACA;EACA;EACA;EACA;;;;;UAMe;EACf;EACA;EACA,aAAa;EACb,aAAa;EACb,WAAW;;;;;UAMI;EACf;EACA;EACA,MAAM;EACN;EACA;EACA;;;;;UAMe;EACf;EACA;EACA,QAAQ;EACR,UAAU;EACV;EACA,UAAU;EACV;EACA;;;;;UAMe;EACf,KAAK;EACL;EACA;EACA;EACA;;;;;UAMe;EACf;EACA,QAAQ;EACR,UAAU;EACV,SAAS;EACT,YAAY;EACZ;;;;;KAMU;;;;UAaK;EACf,MAAM;EACN;EACA;EACA;;;;;KAMU;;;;UAMK;EACf;EACA;EACA;EACA;EACA,SAAS;EACT,SAAS;EACT,WAAW;EACX,WAAW;EACX;EACA;;;;;UAMe;EACf;EACA;EACA;EACA;;;;;UCpRe;EACf;EACA;EACA;EACA;EACA;;;;;cAMW;UACH;UACA;UACA;UACA;UACA;EAEI,YAAA,SAAS;;;;EA8Bf,UAAU,MAAM,aAAa;;;;EAa7B,SAAS,KAAK,WAAW;;;;EAQzB,OACJ,eACA,UAAU,eACV,UAAU,gBACT,QAAQ;;;;EAOL,sBAAsB,gBAAgB,QAAQ;;;;EAO9C,mBAAmB,kBAAkB,QAAQ;;;;EAO7C,gBAAgB,UAAU,UAAU,iBAAiB,QAAQ;;;;EAO7D,gBAAgB,KAAK,UAAU,iBAAiB,QAAQ;;;;EAYxD,eAAe,sBAAsB,iBAAiB,QAAQ;;;;EAO9D,YAAY,QAAQ;;;;EAOpB,0BAA0B,gBAAgB,QAAQ;;;;EAOlD,WACJ,QAAQ,KAAK,kDACZ,QAAQ;;;;EAOL,WAAW,kBAAkB,QAAQ;;;;EAOrC,aAAa,mBAAmB;;;;EAOhC,kBAAkB,QAAQ;;;;EAYhC,eAAe;;;;EAWT,mBAAmB,QAAQ;;;;EAY3B,4BAA4B;IAChC;IACA;IACA;IACA;IACA;MACE,QAAQ,YAAY;;;;EAYlB,oBAAoB,kBAAkB;IAC1C,YAAY;IACZ,SAAS;IACT;;;;;EAaI,cAAc,SAAS,gBAAgB,SAAS,gBAAgB;;;;EAgBhE,cAAc;;;;EAQd,iBAAiB;;;;EAOjB,iBAAiB;IACrB;IACA;IACA,gBAAgB;;;;;EAQZ,cAAc,WAAW,OAAO;UAe9B;UAcA;UAsBA;UAkBA;UAkBA;;;;;UCvXO;;;;;EAKf,SAAS,KAAK,WAAW;;;;;EAMzB,WAAW,MAAM,aAAa;;;;;;EAO9B,mBAAmB,MAAM,aAAa,QAAQ;;;;;EAM9C,wBAAwB,eAAe,gBAAgB;;;;EAKvD,iBAAiB;;;;EAKjB,cAAc;;;;;EAMd,iBAAiB;IACf;IACA;IACA,gBAAgB;;;;;;;EAQlB,cAAc,WAAW,OAAO;;;;;cClDrB,2BAA2B;UAgB5B;UAfF;UACA;UACA;UACA;;;;;;;;UAQA;mBACS;EAGP,YAAA;IACN;IACA;IACA;;;;;EAiBE,SAAS,KAAK,WAAW;;;;EA0BzB,WAAW,MAAM,aAAa;;;;EAgB9B,mBAAmB,MAAM,aAAa,QAAQ;;;;EAiB9C,wBAAwB,eAAe,gBAAgB;;;;EAgBvD,iBAAiB;;;;EAejB,cAAc;;;;EAYd,iBAAiB;IACrB;IACA;IACA,gBAAgB;;;;;EAYZ,cAAc,WAAW,OAAO;;;;EAmB/B,cAAc,eAAe,gBAAgB;;;;EAe7C,cAAc;UAMb;UAOA;UAyBA;UAWA;UAQA;UAKA;;UAOA;;UAYA;UASM;UAWA;;;;;UCvRC;;;;;;;;EAQf,OAAO,eAAe,UAAU,eAAe,UAAU,gBAAgB,QAAQ;;;;;;EAOjF,sBAAsB,gBAAgB,QAAQ;;;;;;EAO9C,mBAAmB,kBAAkB,QAAQ;;;;;;;EAQ7C,gBAAgB,UAAU,UAAU,iBAAiB,QAAQ;;;;;;;EAQ7D,eAAe,sBAAsB,iBAAiB,QAAQ;;;;;EAM9D,YAAY,QAAQ;;;;;;EAOpB,0BAA0B,gBAAgB,QAAQ;;;;;;EAOlD,WAAW,QAAQ,KAAK,kDAAkD,QAAQ;;;;;;EAOlF,WAAW,kBAAkB,QAAQ;;;;;EAMrC,aAAa,mBAAmB;;;;;cCjErB,6BAA6B;UAMpB;UALZ;UACA;UACA;UACA;EAEY,YAAA;IAAY;IAAyB;IAAoB;;;;;;;;;;;EAkBtE,QAAQ,MAAM;;;;EAYd;;;;EAOA,WAAW;;;;EAOZ,OACJ,eACA,UAAU,eACV,UAAU,gBACT,QAAQ;;;;EA2BL,sBAAsB,gBAAgB,QAAQ;;;;EAW9C,mBAAmB,kBAAkB,QAAQ;;;;EAuD7C,gBAAgB,UAAU,UAAU,iBAAqB,QAAQ;;;;EAyBjE,eAAe,sBAAsB,iBAAqB,QAAQ;;;;EAoElE,YAAY,QAAQ;;;;EAYpB,0BAA0B,gBAAgB,QAAQ;;;;EA+ClD,WACJ,QAAQ,KAAK,kDACZ,QAAQ;;;;EAkBL,WAAW,kBAAkB,QAAQ;;;;EAarC,aAAa,mBAAmB;UAM9B;UAqDA;UA+CA;UAUA;UAgBA;UA8BA;UAQM;UAWN;UA8BA;UAUA;UAWA;UAYA;UA8BA;UAUA;UAmBA;;;;;cCroBG;UAED;EAAA,YAAA;IACN;IACA;IACA;;;;;EAcE,gBACJ,KAAK,UACL,SAAS,YACT,iBACC,QAAQ;;;;EA6BL,4BACJ,MAAM,YACN;IACE;IACA;IACA;IACA;IACA;MAED,QAAQ,YAAY;;;;EAiDvB,cAAc,MAAM,aAAa;;;;EAuC3B,oBACJ,MAAM,aACL;IAAU,YAAY;IAAU,SAAS;IAAY;;UA2BhD;UAeA;UAgBA;UAgBA;UAsCA;UAgBA;UA2BA;UA8CA;UAwBA;UAOA;UAQA;UA0BA;UAcA;UAwBA;;;;;cCpcG,wBAAwB;UAC3B;UACA;EAEI,YAAA,UAAU;;;;EAQP,0BAA0B,gBAAgB,QAAQ;;;;EAsClD,sBAAsB,gBAAgB,QAAQ;UAcrD;UA6EA;UAqBA;UAmBA;UA4BA;UAwDA;UAoBA;UAwDA;;;;;cCpVG;UAKD;UAJF;UACA;EAGE,YAAA;IACN;IACA;IACA;;;;;EAcE,gBAAgB,MAAM,aAAa,QAAQ;;;;EAmC3C,gBAAgB,MAAM,aAAa,QAAQ;;;;EAsBjD,qBAAqB,KAAK,WAAW;;;;EAerC,eAAe;;;;EAOf,WAAW,oBAAoB;UAMvB;UA+BA;UAiCA;UA2BA;UAUA;UAOM;UA2BN;UA4BA;UAoBA"}

package/dist/{search-DjXSn6v5.mjs → search-CWMVYC-R.mjs}

@@ -1,6 +1,5 @@
-import { t as safeToString } from "./coerce.utils-Cu6IUTgX.mjs";
-
-//#region src/utils/csv.utils.ts
+import { t as safeToString } from "./coerce.utils-B_rEudCn.mjs";
+// src/utils/csv.utils.ts
 const CSV_FORMULA_PREFIX = /^[=+\-@\t\r]/;
 /**
 * Render one CSV field. String values that a spreadsheet would treat as a
@@ -17,9 +16,7 @@ function csvField(value, alwaysQuote = false) {
 	if (alwaysQuote || /[",\r\n]/.test(str)) return `"${str.replace(/"/g, "\"\"")}"`;
 	return str;
 }
-
-//#endregion
-//#region src/search/core/basic-log-indexer.ts
+// src/search/core/basic-log-indexer.ts
 /**
 * Basic log indexer implementation
 */
@@ -220,9 +217,7 @@ var BasicLogIndexer = class {
 		}));
 	}
 };
-
-//#endregion
-//#region src/search/core/basic-search-engine.ts
+// src/search/core/basic-search-engine.ts
 /**
 * Basic search engine implementation
 */
@@ -541,11 +536,7 @@ var BasicSearchEngine = class {
 				case "level":
 					comparison = a.log.level.localeCompare(b.log.level);
 					break;
-				case "score":
-				case "relevance":
-				default:
-					comparison = a.score - b.score;
-					break;
+				default: comparison = a.score - b.score;
 			}
 			return sortOrder === "asc" ? comparison : -comparison;
 		});
@@ -582,7 +573,7 @@ var BasicSearchEngine = class {
 		const words1 = new Set(text1.toLowerCase().split(/\s+/));
 		const words2 = new Set(text2.toLowerCase().split(/\s+/));
 		const intersection = new Set([...words1].filter((x) => words2.has(x)));
-		const union = new Set([...words1, ...words2]);
+		const union = /* @__PURE__ */ new Set([...words1, ...words2]);
 		return union.size > 0 ? intersection.size / union.size : 0;
 	}
 	findMatchedPatterns(log1, log2) {
@@ -602,7 +593,7 @@ var BasicSearchEngine = class {
 	}
 	extractTimeRange(query) {
 		const lowerQuery = query.toLowerCase();
-		if (lowerQuery.includes("last hour") || lowerQuery.includes("past hour")) return { start: /* @__PURE__ */ new Date(Date.now() - 3600 * 1e3) };
+		if (lowerQuery.includes("last hour") || lowerQuery.includes("past hour")) return { start: /* @__PURE__ */ new Date(Date.now() - 36e5) };
 		const hoursMatch = query.match(/last\s+(\d+)\s+hours?/i);
 		if (hoursMatch) return { start: /* @__PURE__ */ new Date(Date.now() - Number.parseInt(hoursMatch[1] ?? "0") * 60 * 60 * 1e3) };
 		if (lowerQuery.includes("today")) {
@@ -629,9 +620,7 @@ var BasicSearchEngine = class {
 		return `preset_${Date.now()}_${Math.random().toString(36).slice(2, 11)}`;
 	}
 };
-
-//#endregion
-//#region src/search/engines/correlation-engine.ts
+// src/search/engines/correlation-engine.ts
 /**
 * Correlation engine for log analysis
 */
@@ -640,7 +629,7 @@ var CorrelationEngine = class {
 		this.options = options;
 		this.options = {
 			maxCorrelationDistance: 100,
-			temporalWindowMs: 300 * 1e3,
+			temporalWindowMs: 3e5,
 			minSimilarityScore: .3,
 			...options
 		};
@@ -897,9 +886,10 @@ var CorrelationEngine = class {
 		};
 	}
 };
-
-//#endregion
-//#region src/search/engines/nlp-search-engine.ts
+// src/search/engines/nlp-search-engine.ts
+/**
+* Advanced search engine with Natural Language Processing capabilities
+*/
 /**
 * NLP-enhanced search engine
 */
@@ -940,7 +930,7 @@ var NLPSearchEngine = class extends BasicSearchEngine {
 		return this.search(cleanQuery, parsed.filters, options);
 	}
 	initializePatterns() {
-		this.intentPatterns = new Map([
+		this.intentPatterns = /* @__PURE__ */ new Map([
 			["find_errors", [
 				/show.*errors?/i,
 				/find.*errors?/i,
@@ -984,7 +974,7 @@ var NLPSearchEngine = class extends BasicSearchEngine {
 				/after.*occurred/i
 			]]
 		]);
-		this.entityPatterns = new Map([
+		this.entityPatterns = /* @__PURE__ */ new Map([
 			["level", /(error|warn|warning|info|debug|trace|verbose)/i],
 			["service", /(?:from|in)\s+(?:the\s+)?(\w+)\s+(?:service|app|application)/i],
 			["user_id", /user\s+(?:id\s+)?['"]?(\w+)['"]?/i],
@@ -1038,8 +1028,6 @@ var NLPSearchEngine = class extends BasicSearchEngine {
 			case "trace_id":
 				if (!filters.traceIds) filters.traceIds = [];
 				filters.traceIds.push(entity.value);
-				break;
-			case "error_type": break;
 		}
 	}
 	extractAdvancedTimeRange(query) {
@@ -1067,9 +1055,9 @@ var NLPSearchEngine = class extends BasicSearchEngine {
 				const value = Number.parseInt(match[1] ?? "0");
 				const multiplier = {
 					seconds: 1e3,
-					minutes: 60 * 1e3,
-					hours: 3600 * 1e3,
-					days: 1440 * 60 * 1e3
+					minutes: 6e4,
+					hours: 36e5,
+					days: 864e5
 				}[unit];
 				return {
 					start: new Date(Date.now() - value * multiplier),
@@ -1182,9 +1170,15 @@ var NLPSearchEngine = class extends BasicSearchEngine {
 		return cleanQuery || query;
 	}
 };
-
-//#endregion
-//#region src/search/engines/pattern-recognition-engine.ts
+// src/search/engines/pattern-recognition-engine.ts
+const STACK_FRAME_TAIL = /:\d+:\d+\)?$/;
+/** True when any line is a real stack frame, e.g. `    at fn (/app/file.js:10:5)`. */
+function hasStackFrame(message) {
+	return message.split("\n").some((line) => {
+		const t = line.trim();
+		return t.startsWith("at ") && STACK_FRAME_TAIL.test(t);
+	});
+}
 /**
 * Pattern recognition engine for log analysis
 */
@@ -1284,6 +1278,7 @@ var PatternRecognitionEngine = class {
 	}
 	extractErrorPatterns(logs) {
 		const errorLogs = logs.filter((log) => log.level === "error" || log.error);
+		this.patternFrequencies.clear();
 		const patternMap = /* @__PURE__ */ new Map();
 		for (const log of errorLogs) {
 			const errorPattern = this.extractErrorPattern(log);
@@ -1294,6 +1289,7 @@ var PatternRecognitionEngine = class {
 			const pattern = patternMap.get(errorPattern);
 			if (pattern.examples.length < 3) pattern.examples.push(log);
 			pattern.count++;
+			this.patternFrequencies.set(errorPattern, pattern.count);
 		}
 		return Array.from(patternMap.entries()).map(([pattern, data], index) => {
 			var _data$examples2;
@@ -1327,7 +1323,7 @@ var PatternRecognitionEngine = class {
 		return patterns;
 	}
 	normalizeMessage(message) {
-		return message.replace(/\d+/g, "<NUM>").replace(/[a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12}/gi, "<UUID>").replace(/[a-f0-9]{32}/gi, "<HASH>").replace(/"[^"]*"/g, "<STRING>").replace(/\b\w+@\w+\.\w+\b/g, "<EMAIL>").trim();
+		return message.replace(/[a-f0-9]{8}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{4}-[a-f0-9]{12}/gi, "<UUID>").replace(/[a-f0-9]{32}/gi, "<HASH>").replace(/\d+/g, "<NUM>").replace(/"[^"]*"/g, "<STRING>").replace(/\b\w+@\w+\.\w+\b/g, "<EMAIL>").trim();
 	}
 	extractErrorPattern(log) {
 		if (log.error) return `${log.error.name}: ${this.normalizeMessage(log.error.message || "")}`;
@@ -1360,7 +1356,7 @@ var PatternRecognitionEngine = class {
 		if (!log.traceId) deviations.push("Missing trace ID");
 		if (!log.context) deviations.push("Missing context");
 		if (log.payload && Object.keys(log.payload).length > 20) deviations.push("Unusually large payload");
-		if (log.level !== "error" && log.message.includes("at ")) deviations.push("Stack trace in non-error log");
+		if (log.level !== "error" && hasStackFrame(log.message)) deviations.push("Stack trace in non-error log");
 		return deviations;
 	}
 	doesLogMatchPattern(log, pattern) {
@@ -1369,9 +1365,7 @@ var PatternRecognitionEngine = class {
 		return normalizedMessage === pattern.pattern;
 	}
 };
-
-//#endregion
-//#region src/search/search-manager.ts
+// src/search/search-manager.ts
 /**
 * Main search manager class
 */
@@ -1603,7 +1597,6 @@ var SearchManager = class {
 		}, obj);
 	}
 };
-
-//#endregion
 export { BasicSearchEngine as a, CorrelationEngine as i, PatternRecognitionEngine as n, BasicLogIndexer as o, NLPSearchEngine as r, SearchManager as t };
-//# sourceMappingURL=search-DjXSn6v5.mjs.map
+
+//# sourceMappingURL=search-CWMVYC-R.mjs.map