langsmith 0.5.16 → 0.5.18

package/dist/anonymizer/index.cjs

@@ -1,37 +1,50 @@
 "use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.createAnonymizer = createAnonymizer;
-const set_js_1 = __importDefault(require("../utils/lodash/set.cjs"));
 function extractStringNodes(data, options) {
     const parsedOptions = { ...options, maxDepth: options.maxDepth ?? 10 };
-    const queue = [
-        [data, 0, ""],
-    ];
+    const queue = [[data, 0, "", null, ""]];
+    let nextId = 0;
     const result = [];
     while (queue.length > 0) {
         const task = queue.shift();
         if (task == null)
             continue;
-        const [value, depth, path] = task;
-        if (typeof value === "object" && value != null) {
-            if (depth >= parsedOptions.maxDepth)
-                continue;
-            for (const [key, nestedValue] of Object.entries(value)) {
-                queue.push([nestedValue, depth + 1, path ? `${path}.${key}` : key]);
-            }
+        const [value, depth, path, parent, key] = task;
+        if (typeof value === "string") {
+            result.push({
+                value,
+                path,
+                parent: parent,
+                key,
+                _id: nextId++,
+            });
         }
         else if (Array.isArray(value)) {
             if (depth >= parsedOptions.maxDepth)
                 continue;
             for (let i = 0; i < value.length; i++) {
-                queue.push([value[i], depth + 1, `${path}[${i}]`]);
+                queue.push([
+                    value[i],
+                    depth + 1,
+                    `${path}[${i}]`,
+                    value,
+                    String(i),
+                ]);
             }
         }
-        else if (typeof value === "string") {
-            result.push({ value, path });
+        else if (typeof value === "object" && value != null) {
+            if (depth >= parsedOptions.maxDepth)
+                continue;
+            for (const [k, nestedValue] of Object.entries(value)) {
+                queue.push([
+                    nestedValue,
+                    depth + 1,
+                    path ? `${path}.${k}` : k,
+                    value,
+                    k,
+                ]);
+            }
         }
     }
     return result;
@@ -69,7 +82,7 @@ function createAnonymizer(replacer, options) {
                                 return result;
                             }, item.value);
                             if (newValue !== item.value) {
-                                memo.push({ value: newValue, path: item.path });
+                                memo.push({ ...item, value: newValue });
                             }
                             return memo;
                         }, []);
@@ -81,19 +94,32 @@ function createAnonymizer(replacer, options) {
                     maskNodes: (nodes) => nodes.reduce((memo, item) => {
                         const newValue = replacer(item.value, item.path);
                         if (newValue !== item.value) {
-                            memo.push({ value: newValue, path: item.path });
+                            memo.push({ ...item, value: newValue });
                         }
                         return memo;
                     }, []),
                 }
                 : replacer;
+        // Build a lookup from _id to internal node for direct write-back.
+        const nodesById = new Map();
+        for (const node of nodes) {
+            nodesById.set(node._id, node);
+        }
         const toUpdate = processor.maskNodes(nodes);
         for (const node of toUpdate) {
             if (node.path === "") {
                 mutateValue = node.value;
             }
             else {
-                (0, set_js_1.default)(mutateValue, node.path, node.value);
+                // Match by _id if available (built-in replacers propagate it from
+                // the input nodes), otherwise fall back to path matching.
+                const asInternal = node;
+                const internal = asInternal._id !== undefined
+                    ? nodesById.get(asInternal._id)
+                    : nodes.find((n) => n.path === node.path);
+                if (internal) {
+                    internal.parent[internal.key] = node.value;
+                }
             }
         }
         return mutateValue;

package/dist/anonymizer/index.js

@@ -1,31 +1,47 @@
-import set from "../utils/lodash/set.js";
 function extractStringNodes(data, options) {
     const parsedOptions = { ...options, maxDepth: options.maxDepth ?? 10 };
-    const queue = [
-        [data, 0, ""],
-    ];
+    const queue = [[data, 0, "", null, ""]];
+    let nextId = 0;
     const result = [];
     while (queue.length > 0) {
         const task = queue.shift();
         if (task == null)
             continue;
-        const [value, depth, path] = task;
-        if (typeof value === "object" && value != null) {
-            if (depth >= parsedOptions.maxDepth)
-                continue;
-            for (const [key, nestedValue] of Object.entries(value)) {
-                queue.push([nestedValue, depth + 1, path ? `${path}.${key}` : key]);
-            }
+        const [value, depth, path, parent, key] = task;
+        if (typeof value === "string") {
+            result.push({
+                value,
+                path,
+                parent: parent,
+                key,
+                _id: nextId++,
+            });
         }
         else if (Array.isArray(value)) {
             if (depth >= parsedOptions.maxDepth)
                 continue;
             for (let i = 0; i < value.length; i++) {
-                queue.push([value[i], depth + 1, `${path}[${i}]`]);
+                queue.push([
+                    value[i],
+                    depth + 1,
+                    `${path}[${i}]`,
+                    value,
+                    String(i),
+                ]);
             }
         }
-        else if (typeof value === "string") {
-            result.push({ value, path });
+        else if (typeof value === "object" && value != null) {
+            if (depth >= parsedOptions.maxDepth)
+                continue;
+            for (const [k, nestedValue] of Object.entries(value)) {
+                queue.push([
+                    nestedValue,
+                    depth + 1,
+                    path ? `${path}.${k}` : k,
+                    value,
+                    k,
+                ]);
+            }
         }
     }
     return result;
@@ -63,7 +79,7 @@ export function createAnonymizer(replacer, options) {
                                 return result;
                             }, item.value);
                             if (newValue !== item.value) {
-                                memo.push({ value: newValue, path: item.path });
+                                memo.push({ ...item, value: newValue });
                             }
                             return memo;
                         }, []);
@@ -75,19 +91,32 @@ export function createAnonymizer(replacer, options) {
                     maskNodes: (nodes) => nodes.reduce((memo, item) => {
                         const newValue = replacer(item.value, item.path);
                         if (newValue !== item.value) {
-                            memo.push({ value: newValue, path: item.path });
+                            memo.push({ ...item, value: newValue });
                         }
                         return memo;
                     }, []),
                 }
                 : replacer;
+        // Build a lookup from _id to internal node for direct write-back.
+        const nodesById = new Map();
+        for (const node of nodes) {
+            nodesById.set(node._id, node);
+        }
         const toUpdate = processor.maskNodes(nodes);
         for (const node of toUpdate) {
             if (node.path === "") {
                 mutateValue = node.value;
             }
             else {
-                set(mutateValue, node.path, node.value);
+                // Match by _id if available (built-in replacers propagate it from
+                // the input nodes), otherwise fall back to path matching.
+                const asInternal = node;
+                const internal = asInternal._id !== undefined
+                    ? nodesById.get(asInternal._id)
+                    : nodes.find((n) => n.path === node.path);
+                if (internal) {
+                    internal.parent[internal.key] = node.value;
+                }
             }
         }
         return mutateValue;