logixia 2.0.0 → 2.0.6

package/dist/{safe-stringify-DWo3aZp_.js → safe-stringify-J3sh-7YM.js}

@@ -1,5 +1,27 @@
-
-//#region src/utils/safe-stringify.ts
+const require_own_property = require("./own-property-BWkibepN.js");
+// src/utils/safe-stringify.ts
+/**
+* logixia — robust JSON serialization for log payloads.
+*
+* Modern Winston/Pino already neutralize circular refs to `[Circular]` (via
+* safe-stable-stringify / fast-safe-stringify), so merely "surviving cycles" is
+* not a differentiator. This goes one notch further:
+*
+*  - **BigInt** → serialized (as a string by default; JSON.stringify throws on
+*    BigInt, which silently breaks logging of e.g. DB bigint ids).
+*  - **Deterministic key order** (optional) so identical objects hash/diff equal.
+*  - **True decycle** (optional) — replace repeated references with JSONPath
+*    `$ref` pointers that round-trip back to the original object graph, instead
+*    of the lossy `[Circular]` tag. Useful when you need to reconstruct shared
+*    structure downstream.
+*
+* @example
+* ```ts
+* safeStringify({ id: 10n, self: obj });          // → BigInt + cycle safe
+* safeStringify(graph, { decycle: true });         // → round-trippable $ref pointers
+* const back = retrocycle(JSON.parse(json));       // → reconstruct shared refs
+* ```
+*/
 /** Build a JSONPath like `$["a"][0]["b"]` for a decycle pointer. */
 function jsonPath(parts) {
 	let path = "$";
@@ -29,10 +51,7 @@ function safeStringify(value, options = {}) {
 			const rec = val;
 			const keys = deterministic ? Object.keys(rec).sort() : Object.keys(rec);
 			const obj = {};
-			for (const k of keys) {
-				if (k === "__proto__" || k === "constructor" || k === "prototype") continue;
-				obj[k] = transform(rec[k]);
-			}
+			for (const k of keys) require_own_property.assignOwn(obj, k, transform(rec[k]));
 			out = obj;
 		}
 		seen.delete(val);
@@ -57,10 +76,7 @@ function decycleValue(value, bigint = "string") {
 		if (Array.isArray(val)) return val.map((item, i) => walk(item, [...path, i]));
 		const rec = val;
 		const obj = {};
-		for (const k of Object.keys(rec)) {
-			if (k === "__proto__" || k === "constructor" || k === "prototype") continue;
-			obj[k] = walk(rec[k], [...path, k]);
-		}
+		for (const k of Object.keys(rec)) require_own_property.assignOwn(obj, k, walk(rec[k], [...path, k]));
 		return obj;
 	};
 	return walk(value, []);
@@ -71,6 +87,7 @@ function decycleValue(value, bigint = "string") {
 */
 function retrocycle(root) {
 	const refRe = /^\$(?:\[(?:\d+|"(?:[^"\\]|\\.)*")\])*$/;
+	const UNRESOLVED = Symbol("unresolved");
 	const resolve = (path) => {
 		const segs = [];
 		const partRe = /\[(\d+|"(?:[^"\\]|\\.)*")\]/g;
@@ -80,7 +97,11 @@ function retrocycle(root) {
 			segs.push(raw.startsWith("\"") ? JSON.parse(raw) : Number(raw));
 		}
 		let node = root;
-		for (const s of segs) node = node[s];
+		for (const s of segs) {
+			if (node === null || typeof node !== "object") return UNRESOLVED;
+			if (!Object.prototype.hasOwnProperty.call(node, s)) return UNRESOLVED;
+			node = node[s];
+		}
 		return node;
 	};
 	const walk = (val) => {
@@ -88,8 +109,11 @@ function retrocycle(root) {
 		const rec = val;
 		for (const k of Object.keys(rec)) {
 			const child = rec[k];
-			if (child !== null && typeof child === "object" && typeof child.$ref === "string" && refRe.test(child.$ref)) rec[k] = resolve(child.$ref);
-			else walk(child);
+			if (child !== null && typeof child === "object" && typeof child.$ref === "string" && refRe.test(child.$ref)) {
+				const target = resolve(child.$ref);
+				if (target === UNRESOLVED) walk(child);
+				else require_own_property.assignOwn(rec, k, target);
+			} else walk(child);
 		}
 	};
 	walk(root);
@@ -113,30 +137,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-J3sh-7YM.js.map

package/dist/safe-stringify-J3sh-7YM.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"safe-stringify-J3sh-7YM.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\nimport { assignOwn } from './own-property';\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        assignOwn(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      assignOwn(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 UNRESOLVED = Symbol('unresolved');\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      if (node === null || typeof node !== 'object') return UNRESOLVED;\n      if (!Object.prototype.hasOwnProperty.call(node, s)) return UNRESOLVED;\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        const target = resolve((child as { $ref: string }).$ref);\n        if (target === UNRESOLVED) walk(child);\n        else assignOwn(rec, k, target);\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":";;;;;;;;;;;;;;;;;;;;;;;;;AAwCA,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,MACd,qBAAA,UAAU,KAAK,GAAG,UAAU,IAAI,EAAE,CAAC;GAErC,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,GAC7B,qBAAA,UAAU,KAAK,GAAG,KAAK,IAAI,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;EAE9C,OAAO;CACT;CAEA,OAAO,KAAK,OAAO,CAAC,CAAC;AACvB;;;;;AAMA,SAAgB,WAAc,MAAY;CACxC,MAAM,QAAQ;CAEd,MAAM,aAAa,OAAO,YAAY;CACtC,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,MAAM;GACpB,IAAI,SAAS,QAAQ,OAAO,SAAS,UAAU,OAAO;GACtD,IAAI,CAAC,OAAO,UAAU,eAAe,KAAK,MAAM,CAAC,GAAG,OAAO;GAC3D,OAAQ,KAA0C;EACpD;EACA,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,GAC3C;IACA,MAAM,SAAS,QAAS,MAA2B,IAAI;IACvD,IAAI,WAAW,YAAY,KAAK,KAAK;SAChC,qBAAA,UAAU,KAAK,GAAG,MAAM;GAC/B,OACE,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"}