langgraph-ui-components 0.0.1 → 0.0.2

package/dist/index.es112.js

@@ -0,0 +1,149 @@
+import { getLangSmithEnvironmentVariable } from "./index.es171.js";
+var LIMIT_REPLACE_NODE = "[...]";
+var CIRCULAR_REPLACE_NODE = { result: "[Circular]" };
+var arr = [];
+var replacerStack = [];
+const encoder = new TextEncoder();
+function defaultOptions() {
+  return {
+    depthLimit: Number.MAX_SAFE_INTEGER,
+    edgesLimit: Number.MAX_SAFE_INTEGER
+  };
+}
+function encodeString(str) {
+  return encoder.encode(str);
+}
+function serializeWellKnownTypes(val) {
+  if (val && typeof val === "object" && val !== null) {
+    if (val instanceof Map) {
+      return Object.fromEntries(val);
+    } else if (val instanceof Set) {
+      return Array.from(val);
+    } else if (val instanceof Date) {
+      return val.toISOString();
+    } else if (val instanceof RegExp) {
+      return val.toString();
+    } else if (val instanceof Error) {
+      return {
+        name: val.name,
+        message: val.message
+      };
+    }
+  } else if (typeof val === "bigint") {
+    return val.toString();
+  }
+  return val;
+}
+function createDefaultReplacer(userReplacer) {
+  return function(key, val) {
+    return serializeWellKnownTypes(val);
+  };
+}
+function serialize(obj, errorContext, replacer, spacer, options) {
+  try {
+    const str = JSON.stringify(obj, createDefaultReplacer(replacer), spacer);
+    return encodeString(str);
+  } catch (e) {
+    if (!e.message?.includes("Converting circular structure to JSON")) {
+      console.warn(`[WARNING]: LangSmith received unserializable value.${errorContext ? `
+Context: ${errorContext}` : ""}`);
+      return encodeString("[Unserializable]");
+    }
+    getLangSmithEnvironmentVariable("SUPPRESS_CIRCULAR_JSON_WARNINGS") !== "true" && console.warn(`[WARNING]: LangSmith received circular JSON. This will decrease tracer performance. ${errorContext ? `
+Context: ${errorContext}` : ""}`);
+    if (typeof options === "undefined") {
+      options = defaultOptions();
+    }
+    decirc(obj, "", 0, [], void 0, 0, options);
+    let res;
+    try {
+      if (replacerStack.length === 0) {
+        res = JSON.stringify(obj, replacer, spacer);
+      } else {
+        res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);
+      }
+    } catch (_) {
+      return encodeString("[unable to serialize, circular reference is too complex to analyze]");
+    } finally {
+      while (arr.length !== 0) {
+        const part = arr.pop();
+        if (part.length === 4) {
+          Object.defineProperty(part[0], part[1], part[3]);
+        } else {
+          part[0][part[1]] = part[2];
+        }
+      }
+    }
+    return encodeString(res);
+  }
+}
+function setReplace(replace, val, k, parent) {
+  var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);
+  if (propertyDescriptor.get !== void 0) {
+    if (propertyDescriptor.configurable) {
+      Object.defineProperty(parent, k, { value: replace });
+      arr.push([parent, k, val, propertyDescriptor]);
+    } else {
+      replacerStack.push([val, k, replace]);
+    }
+  } else {
+    parent[k] = replace;
+    arr.push([parent, k, val]);
+  }
+}
+function decirc(val, k, edgeIndex, stack, parent, depth, options) {
+  depth += 1;
+  var i;
+  if (typeof val === "object" && val !== null) {
+    for (i = 0; i < stack.length; i++) {
+      if (stack[i] === val) {
+        setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);
+        return;
+      }
+    }
+    if (typeof options.depthLimit !== "undefined" && depth > options.depthLimit) {
+      setReplace(LIMIT_REPLACE_NODE, val, k, parent);
+      return;
+    }
+    if (typeof options.edgesLimit !== "undefined" && edgeIndex + 1 > options.edgesLimit) {
+      setReplace(LIMIT_REPLACE_NODE, val, k, parent);
+      return;
+    }
+    stack.push(val);
+    if (Array.isArray(val)) {
+      for (i = 0; i < val.length; i++) {
+        decirc(val[i], i, i, stack, val, depth, options);
+      }
+    } else {
+      val = serializeWellKnownTypes(val);
+      var keys = Object.keys(val);
+      for (i = 0; i < keys.length; i++) {
+        var key = keys[i];
+        decirc(val[key], key, i, stack, val, depth, options);
+      }
+    }
+    stack.pop();
+  }
+}
+function replaceGetterValues(replacer) {
+  replacer = typeof replacer !== "undefined" ? replacer : function(k, v) {
+    return v;
+  };
+  return function(key, val) {
+    if (replacerStack.length > 0) {
+      for (var i = 0; i < replacerStack.length; i++) {
+        var part = replacerStack[i];
+        if (part[1] === key && part[0] === val) {
+          val = part[2];
+          replacerStack.splice(i, 1);
+          break;
+        }
+      }
+    }
+    return replacer.call(this, key, val);
+  };
+}
+export {
+  serialize
+};
+//# sourceMappingURL=index.es112.js.map

package/dist/index.es112.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.es112.js","sources":["../node_modules/.pnpm/langsmith@0.4.4_openai@6.15.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fast-safe-stringify/index.js"],"sourcesContent":["/* eslint-disable */\n// @ts-nocheck\nimport { getLangSmithEnvironmentVariable } from \"../../utils/env.js\";\nvar LIMIT_REPLACE_NODE = \"[...]\";\nvar CIRCULAR_REPLACE_NODE = { result: \"[Circular]\" };\nvar arr = [];\nvar replacerStack = [];\nconst encoder = new TextEncoder();\nfunction defaultOptions() {\n    return {\n        depthLimit: Number.MAX_SAFE_INTEGER,\n        edgesLimit: Number.MAX_SAFE_INTEGER,\n    };\n}\nfunction encodeString(str) {\n    return encoder.encode(str);\n}\n// Shared function to handle well-known types\nfunction serializeWellKnownTypes(val) {\n    if (val && typeof val === \"object\" && val !== null) {\n        if (val instanceof Map) {\n            return Object.fromEntries(val);\n        }\n        else if (val instanceof Set) {\n            return Array.from(val);\n        }\n        else if (val instanceof Date) {\n            return val.toISOString();\n        }\n        else if (val instanceof RegExp) {\n            return val.toString();\n        }\n        else if (val instanceof Error) {\n            return {\n                name: val.name,\n                message: val.message,\n            };\n        }\n    }\n    else if (typeof val === \"bigint\") {\n        return val.toString();\n    }\n    return val;\n}\n// Default replacer function to handle well-known types\nfunction createDefaultReplacer(userReplacer) {\n    return function (key, val) {\n        // Apply user replacer first if provided\n        if (userReplacer) {\n            const userResult = userReplacer.call(this, key, val);\n            // If user replacer returned undefined, fall back to our serialization\n            if (userResult !== undefined) {\n                return userResult;\n            }\n        }\n        // Fall back to our well-known type handling\n        return serializeWellKnownTypes(val);\n    };\n}\n// Regular stringify\nexport function serialize(obj, errorContext, replacer, spacer, options) {\n    try {\n        const str = JSON.stringify(obj, createDefaultReplacer(replacer), spacer);\n        return encodeString(str);\n    }\n    catch (e) {\n        // Fall back to more complex stringify if circular reference\n        if (!e.message?.includes(\"Converting circular structure to JSON\")) {\n            console.warn(`[WARNING]: LangSmith received unserializable value.${errorContext ? `\\nContext: ${errorContext}` : \"\"}`);\n            return encodeString(\"[Unserializable]\");\n        }\n        getLangSmithEnvironmentVariable(\"SUPPRESS_CIRCULAR_JSON_WARNINGS\") !==\n            \"true\" &&\n            console.warn(`[WARNING]: LangSmith received circular JSON. This will decrease tracer performance. ${errorContext ? `\\nContext: ${errorContext}` : \"\"}`);\n        if (typeof options === \"undefined\") {\n            options = defaultOptions();\n        }\n        decirc(obj, \"\", 0, [], undefined, 0, options);\n        let res;\n        try {\n            if (replacerStack.length === 0) {\n                res = JSON.stringify(obj, replacer, spacer);\n            }\n            else {\n                res = JSON.stringify(obj, replaceGetterValues(replacer), spacer);\n            }\n        }\n        catch (_) {\n            return encodeString(\"[unable to serialize, circular reference is too complex to analyze]\");\n        }\n        finally {\n            while (arr.length !== 0) {\n                const part = arr.pop();\n                if (part.length === 4) {\n                    Object.defineProperty(part[0], part[1], part[3]);\n                }\n                else {\n                    part[0][part[1]] = part[2];\n                }\n            }\n        }\n        return encodeString(res);\n    }\n}\nfunction setReplace(replace, val, k, parent) {\n    var propertyDescriptor = Object.getOwnPropertyDescriptor(parent, k);\n    if (propertyDescriptor.get !== undefined) {\n        if (propertyDescriptor.configurable) {\n            Object.defineProperty(parent, k, { value: replace });\n            arr.push([parent, k, val, propertyDescriptor]);\n        }\n        else {\n            replacerStack.push([val, k, replace]);\n        }\n    }\n    else {\n        parent[k] = replace;\n        arr.push([parent, k, val]);\n    }\n}\nfunction decirc(val, k, edgeIndex, stack, parent, depth, options) {\n    depth += 1;\n    var i;\n    if (typeof val === \"object\" && val !== null) {\n        for (i = 0; i < stack.length; i++) {\n            if (stack[i] === val) {\n                setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n                return;\n            }\n        }\n        if (typeof options.depthLimit !== \"undefined\" &&\n            depth > options.depthLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        if (typeof options.edgesLimit !== \"undefined\" &&\n            edgeIndex + 1 > options.edgesLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        stack.push(val);\n        // Optimize for Arrays. Big arrays could kill the performance otherwise!\n        if (Array.isArray(val)) {\n            for (i = 0; i < val.length; i++) {\n                decirc(val[i], i, i, stack, val, depth, options);\n            }\n        }\n        else {\n            // Handle well-known types before Object.keys iteration\n            val = serializeWellKnownTypes(val);\n            var keys = Object.keys(val);\n            for (i = 0; i < keys.length; i++) {\n                var key = keys[i];\n                decirc(val[key], key, i, stack, val, depth, options);\n            }\n        }\n        stack.pop();\n    }\n}\n// Stable-stringify\nfunction compareFunction(a, b) {\n    if (a < b) {\n        return -1;\n    }\n    if (a > b) {\n        return 1;\n    }\n    return 0;\n}\nfunction deterministicStringify(obj, replacer, spacer, options) {\n    if (typeof options === \"undefined\") {\n        options = defaultOptions();\n    }\n    var tmp = deterministicDecirc(obj, \"\", 0, [], undefined, 0, options) || obj;\n    var res;\n    try {\n        if (replacerStack.length === 0) {\n            res = JSON.stringify(tmp, replacer, spacer);\n        }\n        else {\n            res = JSON.stringify(tmp, replaceGetterValues(replacer), spacer);\n        }\n    }\n    catch (_) {\n        return JSON.stringify(\"[unable to serialize, circular reference is too complex to analyze]\");\n    }\n    finally {\n        // Ensure that we restore the object as it was.\n        while (arr.length !== 0) {\n            var part = arr.pop();\n            if (part.length === 4) {\n                Object.defineProperty(part[0], part[1], part[3]);\n            }\n            else {\n                part[0][part[1]] = part[2];\n            }\n        }\n    }\n    return res;\n}\nfunction deterministicDecirc(val, k, edgeIndex, stack, parent, depth, options) {\n    depth += 1;\n    var i;\n    if (typeof val === \"object\" && val !== null) {\n        for (i = 0; i < stack.length; i++) {\n            if (stack[i] === val) {\n                setReplace(CIRCULAR_REPLACE_NODE, val, k, parent);\n                return;\n            }\n        }\n        try {\n            if (typeof val.toJSON === \"function\") {\n                return;\n            }\n        }\n        catch (_) {\n            return;\n        }\n        if (typeof options.depthLimit !== \"undefined\" &&\n            depth > options.depthLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        if (typeof options.edgesLimit !== \"undefined\" &&\n            edgeIndex + 1 > options.edgesLimit) {\n            setReplace(LIMIT_REPLACE_NODE, val, k, parent);\n            return;\n        }\n        stack.push(val);\n        // Optimize for Arrays. Big arrays could kill the performance otherwise!\n        if (Array.isArray(val)) {\n            for (i = 0; i < val.length; i++) {\n                deterministicDecirc(val[i], i, i, stack, val, depth, options);\n            }\n        }\n        else {\n            // Handle well-known types before Object.keys iteration\n            val = serializeWellKnownTypes(val);\n            // Create a temporary object in the required way\n            var tmp = {};\n            var keys = Object.keys(val).sort(compareFunction);\n            for (i = 0; i < keys.length; i++) {\n                var key = keys[i];\n                deterministicDecirc(val[key], key, i, stack, val, depth, options);\n                tmp[key] = val[key];\n            }\n            if (typeof parent !== \"undefined\") {\n                arr.push([parent, k, val]);\n                parent[k] = tmp;\n            }\n            else {\n                return tmp;\n            }\n        }\n        stack.pop();\n    }\n}\n// wraps replacer function to handle values we couldn't replace\n// and mark them as replaced value\nfunction replaceGetterValues(replacer) {\n    replacer =\n        typeof replacer !== \"undefined\"\n            ? replacer\n            : function (k, v) {\n                return v;\n            };\n    return function (key, val) {\n        if (replacerStack.length > 0) {\n            for (var i = 0; i < replacerStack.length; i++) {\n                var part = replacerStack[i];\n                if (part[1] === key && part[0] === val) {\n                    val = part[2];\n                    replacerStack.splice(i, 1);\n                    break;\n                }\n            }\n        }\n        return replacer.call(this, key, val);\n    };\n}\n"],"names":[],"mappings":";AAGA,IAAI,qBAAqB;AACzB,IAAI,wBAAwB,EAAE,QAAQ,aAAY;AAClD,IAAI,MAAM,CAAA;AACV,IAAI,gBAAgB,CAAA;AACpB,MAAM,UAAU,IAAI,YAAW;AAC/B,SAAS,iBAAiB;AACtB,SAAO;AAAA,IACH,YAAY,OAAO;AAAA,IACnB,YAAY,OAAO;AAAA,EAC3B;AACA;AACA,SAAS,aAAa,KAAK;AACvB,SAAO,QAAQ,OAAO,GAAG;AAC7B;AAEA,SAAS,wBAAwB,KAAK;AAClC,MAAI,OAAO,OAAO,QAAQ,YAAY,QAAQ,MAAM;AAChD,QAAI,eAAe,KAAK;AACpB,aAAO,OAAO,YAAY,GAAG;AAAA,IACjC,WACS,eAAe,KAAK;AACzB,aAAO,MAAM,KAAK,GAAG;AAAA,IACzB,WACS,eAAe,MAAM;AAC1B,aAAO,IAAI,YAAW;AAAA,IAC1B,WACS,eAAe,QAAQ;AAC5B,aAAO,IAAI,SAAQ;AAAA,IACvB,WACS,eAAe,OAAO;AAC3B,aAAO;AAAA,QACH,MAAM,IAAI;AAAA,QACV,SAAS,IAAI;AAAA,MAC7B;AAAA,IACQ;AAAA,EACJ,WACS,OAAO,QAAQ,UAAU;AAC9B,WAAO,IAAI,SAAQ;AAAA,EACvB;AACA,SAAO;AACX;AAEA,SAAS,sBAAsB,cAAc;AACzC,SAAO,SAAU,KAAK,KAAK;AAUvB,WAAO,wBAAwB,GAAG;AAAA,EACtC;AACJ;AAEO,SAAS,UAAU,KAAK,cAAc,UAAU,QAAQ,SAAS;AACpE,MAAI;AACA,UAAM,MAAM,KAAK,UAAU,KAAK,sBAAsB,QAAQ,GAAG,MAAM;AACvE,WAAO,aAAa,GAAG;AAAA,EAC3B,SACO,GAAG;AAEN,QAAI,CAAC,EAAE,SAAS,SAAS,uCAAuC,GAAG;AAC/D,cAAQ,KAAK,sDAAsD,eAAe;AAAA,WAAc,YAAY,KAAK,EAAE,EAAE;AACrH,aAAO,aAAa,kBAAkB;AAAA,IAC1C;AACA,oCAAgC,iCAAiC,MAC7D,UACA,QAAQ,KAAK,uFAAuF,eAAe;AAAA,WAAc,YAAY,KAAK,EAAE,EAAE;AAC1J,QAAI,OAAO,YAAY,aAAa;AAChC,gBAAU,eAAc;AAAA,IAC5B;AACA,WAAO,KAAK,IAAI,GAAG,CAAA,GAAI,QAAW,GAAG,OAAO;AAC5C,QAAI;AACJ,QAAI;AACA,UAAI,cAAc,WAAW,GAAG;AAC5B,cAAM,KAAK,UAAU,KAAK,UAAU,MAAM;AAAA,MAC9C,OACK;AACD,cAAM,KAAK,UAAU,KAAK,oBAAoB,QAAQ,GAAG,MAAM;AAAA,MACnE;AAAA,IACJ,SACO,GAAG;AACN,aAAO,aAAa,qEAAqE;AAAA,IAC7F,UACR;AACY,aAAO,IAAI,WAAW,GAAG;AACrB,cAAM,OAAO,IAAI,IAAG;AACpB,YAAI,KAAK,WAAW,GAAG;AACnB,iBAAO,eAAe,KAAK,CAAC,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,QACnD,OACK;AACD,eAAK,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,KAAK,CAAC;AAAA,QAC7B;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,aAAa,GAAG;AAAA,EAC3B;AACJ;AACA,SAAS,WAAW,SAAS,KAAK,GAAG,QAAQ;AACzC,MAAI,qBAAqB,OAAO,yBAAyB,QAAQ,CAAC;AAClE,MAAI,mBAAmB,QAAQ,QAAW;AACtC,QAAI,mBAAmB,cAAc;AACjC,aAAO,eAAe,QAAQ,GAAG,EAAE,OAAO,SAAS;AACnD,UAAI,KAAK,CAAC,QAAQ,GAAG,KAAK,kBAAkB,CAAC;AAAA,IACjD,OACK;AACD,oBAAc,KAAK,CAAC,KAAK,GAAG,OAAO,CAAC;AAAA,IACxC;AAAA,EACJ,OACK;AACD,WAAO,CAAC,IAAI;AACZ,QAAI,KAAK,CAAC,QAAQ,GAAG,GAAG,CAAC;AAAA,EAC7B;AACJ;AACA,SAAS,OAAO,KAAK,GAAG,WAAW,OAAO,QAAQ,OAAO,SAAS;AAC9D,WAAS;AACT,MAAI;AACJ,MAAI,OAAO,QAAQ,YAAY,QAAQ,MAAM;AACzC,SAAK,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;AAC/B,UAAI,MAAM,CAAC,MAAM,KAAK;AAClB,mBAAW,uBAAuB,KAAK,GAAG,MAAM;AAChD;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,OAAO,QAAQ,eAAe,eAC9B,QAAQ,QAAQ,YAAY;AAC5B,iBAAW,oBAAoB,KAAK,GAAG,MAAM;AAC7C;AAAA,IACJ;AACA,QAAI,OAAO,QAAQ,eAAe,eAC9B,YAAY,IAAI,QAAQ,YAAY;AACpC,iBAAW,oBAAoB,KAAK,GAAG,MAAM;AAC7C;AAAA,IACJ;AACA,UAAM,KAAK,GAAG;AAEd,QAAI,MAAM,QAAQ,GAAG,GAAG;AACpB,WAAK,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AAC7B,eAAO,IAAI,CAAC,GAAG,GAAG,GAAG,OAAO,KAAK,OAAO,OAAO;AAAA,MACnD;AAAA,IACJ,OACK;AAED,YAAM,wBAAwB,GAAG;AACjC,UAAI,OAAO,OAAO,KAAK,GAAG;AAC1B,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AAC9B,YAAI,MAAM,KAAK,CAAC;AAChB,eAAO,IAAI,GAAG,GAAG,KAAK,GAAG,OAAO,KAAK,OAAO,OAAO;AAAA,MACvD;AAAA,IACJ;AACA,UAAM,IAAG;AAAA,EACb;AACJ;AAqGA,SAAS,oBAAoB,UAAU;AACnC,aACI,OAAO,aAAa,cACd,WACA,SAAU,GAAG,GAAG;AACd,WAAO;AAAA,EACX;AACR,SAAO,SAAU,KAAK,KAAK;AACvB,QAAI,cAAc,SAAS,GAAG;AAC1B,eAAS,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK;AAC3C,YAAI,OAAO,cAAc,CAAC;AAC1B,YAAI,KAAK,CAAC,MAAM,OAAO,KAAK,CAAC,MAAM,KAAK;AACpC,gBAAM,KAAK,CAAC;AACZ,wBAAc,OAAO,GAAG,CAAC;AACzB;AAAA,QACJ;AAAA,MACJ;AAAA,IACJ;AACA,WAAO,SAAS,KAAK,MAAM,KAAK,GAAG;AAAA,EACvC;AACJ;","x_google_ignoreList":[0]}