npm - langgraph-ui-components - Versions diffs - 0.0.27 → 0.0.28 - Mend

langgraph-ui-components 0.0.27 → 0.0.28

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (442) hide show

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/_uuid.cjs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_uuid.cjs.js","sources":["../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/_uuid.js"],"sourcesContent":["// Relaxed UUID validation regex (allows any valid UUID format including nil UUIDs)\nconst UUID_REGEX = /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$/i;\nimport { v7 as uuidv7 } from \"uuid\";\nimport { warnOnce } from \"./warn.js\";\nimport { XXH3_128, xxh128ToBytes } from \"./xxhash/xxhash.js\";\nlet UUID7_WARNING_EMITTED = false;\nexport function assertUuid(str, which) {\n // Use relaxed regex validation instead of strict uuid.validate()\n // This allows edge cases like nil UUIDs or test UUIDs that might not pass strict validation\n if (!UUID_REGEX.test(str)) {\n const msg = which !== undefined\n ? `Invalid UUID for ${which}: ${str}`\n : `Invalid UUID: ${str}`;\n throw new Error(msg);\n }\n return str;\n}\n/**\n * Generate a UUID v7 from a timestamp.\n *\n * @param timestamp - The timestamp in milliseconds\n * @returns A UUID v7 string\n */\nexport function uuid7FromTime(timestamp) {\n const msecs = typeof timestamp === \"string\" ? Date.parse(timestamp) : timestamp;\n // Work around uuid@10 behavior where providing only { msecs }\n // may not set the internal timestamp used for stringification.\n // Providing a seq ensures the implementation updates its internal state\n // and encodes the provided milliseconds into the UUID bytes.\n return uuidv7({ msecs, seq: 0 });\n}\n/**\n * Get the version of a UUID string.\n * @param uuidStr - The UUID string to check\n * @returns The version number (1-7) or null if invalid\n */\nexport function getUuidVersion(uuidStr) {\n if (!UUID_REGEX.test(uuidStr)) {\n return null;\n }\n // Version is in bits 48-51\n // Format: xxxxxxxx-xxxx-Vxxx-xxxx-xxxxxxxxxxxx\n const versionChar = uuidStr[14];\n return parseInt(versionChar, 16);\n}\n/**\n * Warn if a UUID is not version 7.\n *\n * @param uuidStr - The UUID string to check\n * @param idType - The type of ID (e.g., \"run_id\", \"trace_id\") for the warning message\n */\nexport function warnIfNotUuidV7(uuidStr, _idType) {\n const version = getUuidVersion(uuidStr);\n if (version !== null && version !== 7 && !UUID7_WARNING_EMITTED) {\n UUID7_WARNING_EMITTED = true;\n warnOnce(`LangSmith now uses UUID v7 for run and trace identifiers. ` +\n `This warning appears when passing custom IDs. ` +\n `Please use: import { uuidv7 } from 'langsmith'; const id = uuidv7(); ` +\n `Future versions will require UUID v7.`);\n }\n}\n/**\n * Convert a UUID string to its 16-byte representation.\n * @param uuidStr - The UUID string (with or without dashes)\n * @returns A Uint8Array containing the 16 bytes of the UUID\n */\nfunction uuidToBytes(uuidStr) {\n const hex = uuidStr.replace(/-/g, \"\");\n const bytes = new Uint8Array(16);\n for (let i = 0; i < 16; i++) {\n bytes[i] = parseInt(hex.slice(i * 2, i * 2 + 2), 16);\n }\n return bytes;\n}\n/**\n * Convert 16 bytes to a UUID string.\n * @param bytes - A Uint8Array containing 16 bytes\n * @returns A UUID string in standard format\n */\nfunction bytesToUuid(bytes) {\n const hex = Array.from(bytes)\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\");\n return `${hex.slice(0, 8)}-${hex.slice(8, 12)}-${hex.slice(12, 16)}-${hex.slice(16, 20)}-${hex.slice(20)}`;\n}\n// Reuse TextEncoder instance for performance\nconst _textEncoder = new TextEncoder();\n/**\n * Generates a 16-byte fingerprint for deterministic UUID generation using XXH3-128.\n *\n * XXH3 is an extremely fast, non-cryptographic hash function that provides excellent\n * collision resistance. It's widely used in production systems and compatible with\n * xxHash implementations in other languages.\n *\n * See: https://github.com/Cyan4973/xxHash\n *\n * @param str - The input string to hash\n * @returns A Uint8Array containing 16 bytes of hash output\n */\nfunction _fastHash128(str) {\n const data = _textEncoder.encode(str);\n // Compute XXH3-128 hash and convert to bytes\n const hash128 = XXH3_128(data);\n return xxh128ToBytes(hash128);\n}\n/**\n * Generate a deterministic UUID v7 derived from an original UUID and a key.\n *\n * This function creates a new UUID that:\n * - Preserves the timestamp from the original UUID if it's UUID v7\n * - Uses current time if the original is not UUID v7\n * - Uses deterministic \"random\" bits derived from hashing the original + key\n * - Is valid UUID v7 format\n *\n * This is used for creating replica IDs that maintain time-ordering properties\n * while being deterministic across distributed systems.\n *\n * @param originalId - The source UUID string (ideally UUID v7 to preserve timestamp)\n * @param key - A string key used for deterministic derivation (e.g., project name)\n * @returns A new UUID v7 string with preserved timestamp (if original is v7) and\n * deterministic random bits\n *\n * @example\n * ```typescript\n * const original = uuidv7();\n * const replicaId = nonCryptographicUuid7Deterministic(original, \"replica-project\");\n * // Same inputs always produce same output\n * assert(nonCryptographicUuid7Deterministic(original, \"replica-project\") === replicaId);\n * ```\n */\nexport function nonCryptographicUuid7Deterministic(originalId, key) {\n // Generate deterministic bytes from hash of original + key\n const hashInput = `${originalId}:${key}`;\n const h = _fastHash128(hashInput);\n // Build new UUID7:\n // UUID7 structure (RFC 9562):\n // [0-5] 48 bits: unix_ts_ms (timestamp in milliseconds)\n // [6] 4 bits: version (0111 = 7) + 4 bits rand_a\n // [7] 8 bits: rand_a (continued)\n // [8] 2 bits: variant (10) + 6 bits rand_b\n // [9-15] 56 bits: rand_b (continued)\n const b = new Uint8Array(16);\n // Check if original is UUID v7 - if so, preserve its timestamp\n // If not, use current time to ensure the derived UUID has a valid timestamp\n const version = getUuidVersion(originalId);\n if (version === 7) {\n // Preserve timestamp from original UUID7 (bytes 0-5)\n const originalBytes = uuidToBytes(originalId);\n b.set(originalBytes.slice(0, 6), 0);\n }\n else {\n // Generate fresh timestamp for non-UUID7 inputs\n // This matches the uuid npm package's v7 implementation:\n // https://github.com/uuidjs/uuid/blob/main/src/v7.ts\n const msecs = Date.now();\n b[0] = (msecs / 0x10000000000) & 0xff;\n b[1] = (msecs / 0x100000000) & 0xff;\n b[2] = (msecs / 0x1000000) & 0xff;\n b[3] = (msecs / 0x10000) & 0xff;\n b[4] = (msecs / 0x100) & 0xff;\n b[5] = msecs & 0xff;\n }\n // Set version 7 (0111) in high nibble + 4 bits from hash\n b[6] = 0x70 | (h[0] & 0x0f);\n // rand_a continued (8 bits from hash)\n b[7] = h[1];\n // Set variant (10) in high 2 bits + 6 bits from hash\n b[8] = 0x80 | (h[2] & 0x3f);\n // rand_b (56 bits = 7 bytes from hash)\n b.set(h.slice(3, 10), 9);\n return bytesToUuid(b);\n}\n"],"names":[],"mappings":"+CAsFqB,IAAI","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/_uuid.es.js DELETED Viewed

@@ -1,3 +0,0 @@
-import "./xxhash/xxhash.es.js";
-new TextEncoder();
-//# sourceMappingURL=_uuid.es.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/_uuid.es.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_uuid.es.js","sources":["../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/_uuid.js"],"sourcesContent":["// Relaxed UUID validation regex (allows any valid UUID format including nil UUIDs)\nconst UUID_REGEX = /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$/i;\nimport { v7 as uuidv7 } from \"uuid\";\nimport { warnOnce } from \"./warn.js\";\nimport { XXH3_128, xxh128ToBytes } from \"./xxhash/xxhash.js\";\nlet UUID7_WARNING_EMITTED = false;\nexport function assertUuid(str, which) {\n // Use relaxed regex validation instead of strict uuid.validate()\n // This allows edge cases like nil UUIDs or test UUIDs that might not pass strict validation\n if (!UUID_REGEX.test(str)) {\n const msg = which !== undefined\n ? `Invalid UUID for ${which}: ${str}`\n : `Invalid UUID: ${str}`;\n throw new Error(msg);\n }\n return str;\n}\n/**\n * Generate a UUID v7 from a timestamp.\n *\n * @param timestamp - The timestamp in milliseconds\n * @returns A UUID v7 string\n */\nexport function uuid7FromTime(timestamp) {\n const msecs = typeof timestamp === \"string\" ? Date.parse(timestamp) : timestamp;\n // Work around uuid@10 behavior where providing only { msecs }\n // may not set the internal timestamp used for stringification.\n // Providing a seq ensures the implementation updates its internal state\n // and encodes the provided milliseconds into the UUID bytes.\n return uuidv7({ msecs, seq: 0 });\n}\n/**\n * Get the version of a UUID string.\n * @param uuidStr - The UUID string to check\n * @returns The version number (1-7) or null if invalid\n */\nexport function getUuidVersion(uuidStr) {\n if (!UUID_REGEX.test(uuidStr)) {\n return null;\n }\n // Version is in bits 48-51\n // Format: xxxxxxxx-xxxx-Vxxx-xxxx-xxxxxxxxxxxx\n const versionChar = uuidStr[14];\n return parseInt(versionChar, 16);\n}\n/**\n * Warn if a UUID is not version 7.\n *\n * @param uuidStr - The UUID string to check\n * @param idType - The type of ID (e.g., \"run_id\", \"trace_id\") for the warning message\n */\nexport function warnIfNotUuidV7(uuidStr, _idType) {\n const version = getUuidVersion(uuidStr);\n if (version !== null && version !== 7 && !UUID7_WARNING_EMITTED) {\n UUID7_WARNING_EMITTED = true;\n warnOnce(`LangSmith now uses UUID v7 for run and trace identifiers. ` +\n `This warning appears when passing custom IDs. ` +\n `Please use: import { uuidv7 } from 'langsmith'; const id = uuidv7(); ` +\n `Future versions will require UUID v7.`);\n }\n}\n/**\n * Convert a UUID string to its 16-byte representation.\n * @param uuidStr - The UUID string (with or without dashes)\n * @returns A Uint8Array containing the 16 bytes of the UUID\n */\nfunction uuidToBytes(uuidStr) {\n const hex = uuidStr.replace(/-/g, \"\");\n const bytes = new Uint8Array(16);\n for (let i = 0; i < 16; i++) {\n bytes[i] = parseInt(hex.slice(i * 2, i * 2 + 2), 16);\n }\n return bytes;\n}\n/**\n * Convert 16 bytes to a UUID string.\n * @param bytes - A Uint8Array containing 16 bytes\n * @returns A UUID string in standard format\n */\nfunction bytesToUuid(bytes) {\n const hex = Array.from(bytes)\n .map((b) => b.toString(16).padStart(2, \"0\"))\n .join(\"\");\n return `${hex.slice(0, 8)}-${hex.slice(8, 12)}-${hex.slice(12, 16)}-${hex.slice(16, 20)}-${hex.slice(20)}`;\n}\n// Reuse TextEncoder instance for performance\nconst _textEncoder = new TextEncoder();\n/**\n * Generates a 16-byte fingerprint for deterministic UUID generation using XXH3-128.\n *\n * XXH3 is an extremely fast, non-cryptographic hash function that provides excellent\n * collision resistance. It's widely used in production systems and compatible with\n * xxHash implementations in other languages.\n *\n * See: https://github.com/Cyan4973/xxHash\n *\n * @param str - The input string to hash\n * @returns A Uint8Array containing 16 bytes of hash output\n */\nfunction _fastHash128(str) {\n const data = _textEncoder.encode(str);\n // Compute XXH3-128 hash and convert to bytes\n const hash128 = XXH3_128(data);\n return xxh128ToBytes(hash128);\n}\n/**\n * Generate a deterministic UUID v7 derived from an original UUID and a key.\n *\n * This function creates a new UUID that:\n * - Preserves the timestamp from the original UUID if it's UUID v7\n * - Uses current time if the original is not UUID v7\n * - Uses deterministic \"random\" bits derived from hashing the original + key\n * - Is valid UUID v7 format\n *\n * This is used for creating replica IDs that maintain time-ordering properties\n * while being deterministic across distributed systems.\n *\n * @param originalId - The source UUID string (ideally UUID v7 to preserve timestamp)\n * @param key - A string key used for deterministic derivation (e.g., project name)\n * @returns A new UUID v7 string with preserved timestamp (if original is v7) and\n * deterministic random bits\n *\n * @example\n * ```typescript\n * const original = uuidv7();\n * const replicaId = nonCryptographicUuid7Deterministic(original, \"replica-project\");\n * // Same inputs always produce same output\n * assert(nonCryptographicUuid7Deterministic(original, \"replica-project\") === replicaId);\n * ```\n */\nexport function nonCryptographicUuid7Deterministic(originalId, key) {\n // Generate deterministic bytes from hash of original + key\n const hashInput = `${originalId}:${key}`;\n const h = _fastHash128(hashInput);\n // Build new UUID7:\n // UUID7 structure (RFC 9562):\n // [0-5] 48 bits: unix_ts_ms (timestamp in milliseconds)\n // [6] 4 bits: version (0111 = 7) + 4 bits rand_a\n // [7] 8 bits: rand_a (continued)\n // [8] 2 bits: variant (10) + 6 bits rand_b\n // [9-15] 56 bits: rand_b (continued)\n const b = new Uint8Array(16);\n // Check if original is UUID v7 - if so, preserve its timestamp\n // If not, use current time to ensure the derived UUID has a valid timestamp\n const version = getUuidVersion(originalId);\n if (version === 7) {\n // Preserve timestamp from original UUID7 (bytes 0-5)\n const originalBytes = uuidToBytes(originalId);\n b.set(originalBytes.slice(0, 6), 0);\n }\n else {\n // Generate fresh timestamp for non-UUID7 inputs\n // This matches the uuid npm package's v7 implementation:\n // https://github.com/uuidjs/uuid/blob/main/src/v7.ts\n const msecs = Date.now();\n b[0] = (msecs / 0x10000000000) & 0xff;\n b[1] = (msecs / 0x100000000) & 0xff;\n b[2] = (msecs / 0x1000000) & 0xff;\n b[3] = (msecs / 0x10000) & 0xff;\n b[4] = (msecs / 0x100) & 0xff;\n b[5] = msecs & 0xff;\n }\n // Set version 7 (0111) in high nibble + 4 bits from hash\n b[6] = 0x70 | (h[0] & 0x0f);\n // rand_a continued (8 bits from hash)\n b[7] = h[1];\n // Set variant (10) in high 2 bits + 6 bits from hash\n b[8] = 0x80 | (h[2] & 0x3f);\n // rand_b (56 bits = 7 bytes from hash)\n b.set(h.slice(3, 10), 9);\n return bytesToUuid(b);\n}\n"],"names":[],"mappings":";AAsFqB,IAAI,YAAW;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fast-safe-stringify/index.cjs.js DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";require("../p-queue.cjs.js");require("../_uuid.cjs.js");require("../../../../../../../../_virtual/index.cjs2.js");require("../prompt_cache/index.cjs.js");new TextEncoder;
2	- //# sourceMappingURL=index.cjs.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fast-safe-stringify/index.cjs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.cjs.js","sources":["../../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.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":"uKAOgB,IAAI","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fast-safe-stringify/index.es.js DELETED Viewed

@@ -1,6 +0,0 @@
-import "../p-queue.es.js";
-import "../_uuid.es.js";
-import "../../../../../../../../_virtual/index.es2.js";
-import "../prompt_cache/index.es.js";
-new TextEncoder();
-//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fast-safe-stringify/index.es.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.es.js","sources":["../../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.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":";;;;AAOgB,IAAI,YAAW;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fs.browser.cjs.js DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const t={join:(...e)=>e.join("/"),dirname:e=>e.split("/").slice(0,-1).join("/")};function i(e,n){}function o(e,n){}exports.path=t;exports.renameSync=o;exports.writeFileSync=i;
2	- //# sourceMappingURL=fs.browser.cjs.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fs.browser.cjs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"fs.browser.cjs.js","sources":["../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fs.browser.js"],"sourcesContent":["/**\n * File system abstraction (browser stub).\n *\n * This stub is used in browser/bundler builds via the package.json browser\n * field. Async operations are no-ops; sync operations are no-ops that return\n * safe defaults. Higher-level consumers (e.g. prompt_cache/fs.browser.ts) may\n * still throw on their own if browser use is unsupported at that layer.\n */\nexport const path = {\n join: (...parts) => parts.join(\"/\"),\n dirname: (p) => p.split(\"/\").slice(0, -1).join(\"/\"),\n};\n// ---------------------------------------------------------------------------\n// Async operations – no-op in browser\n// ---------------------------------------------------------------------------\nexport async function mkdir(_dir) { }\nexport async function writeFileAtomic(_filePath, _content) { }\nexport async function readdir(_dir) {\n return [];\n}\nexport async function stat(_filePath) {\n return { size: 0 };\n}\nexport async function unlink(_filePath) { }\n// ---------------------------------------------------------------------------\n// Sync operations – no-op / safe defaults in browser\n// ---------------------------------------------------------------------------\nexport function existsSync(_p) {\n return false;\n}\nexport function mkdirSync(_dir) { }\nexport function writeFileSync(_filePath, _content) { }\nexport function renameSync(_oldPath, _newPath) { }\nexport function unlinkSync(_filePath) { }\nexport function readFileSync(_filePath) {\n return \"\";\n}\n"],"names":["path","parts","p","writeFileSync","_filePath","_content","renameSync","_oldPath","_newPath"],"mappings":"gFAQY,MAACA,EAAO,CAChB,KAAM,IAAIC,IAAUA,EAAM,KAAK,GAAG,EAClC,QAAUC,GAAMA,EAAE,MAAM,GAAG,EAAE,MAAM,EAAG,EAAE,EAAE,KAAK,GAAG,CACtD,EAoBO,SAASC,EAAcC,EAAWC,EAAU,CAAE,CAC9C,SAASC,EAAWC,EAAUC,EAAU,CAAE","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fs.browser.es.js DELETED Viewed

@@ -1,14 +0,0 @@
-const i = {
-  join: (...n) => n.join("/"),
-  dirname: (n) => n.split("/").slice(0, -1).join("/")
-};
-function e(n, t) {
-}
-function o(n, t) {
-}
-export {
-  i as path,
-  o as renameSync,
-  e as writeFileSync
-};
-//# sourceMappingURL=fs.browser.es.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fs.browser.es.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"fs.browser.es.js","sources":["../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/fs.browser.js"],"sourcesContent":["/**\n * File system abstraction (browser stub).\n *\n * This stub is used in browser/bundler builds via the package.json browser\n * field. Async operations are no-ops; sync operations are no-ops that return\n * safe defaults. Higher-level consumers (e.g. prompt_cache/fs.browser.ts) may\n * still throw on their own if browser use is unsupported at that layer.\n */\nexport const path = {\n join: (...parts) => parts.join(\"/\"),\n dirname: (p) => p.split(\"/\").slice(0, -1).join(\"/\"),\n};\n// ---------------------------------------------------------------------------\n// Async operations – no-op in browser\n// ---------------------------------------------------------------------------\nexport async function mkdir(_dir) { }\nexport async function writeFileAtomic(_filePath, _content) { }\nexport async function readdir(_dir) {\n return [];\n}\nexport async function stat(_filePath) {\n return { size: 0 };\n}\nexport async function unlink(_filePath) { }\n// ---------------------------------------------------------------------------\n// Sync operations – no-op / safe defaults in browser\n// ---------------------------------------------------------------------------\nexport function existsSync(_p) {\n return false;\n}\nexport function mkdirSync(_dir) { }\nexport function writeFileSync(_filePath, _content) { }\nexport function renameSync(_oldPath, _newPath) { }\nexport function unlinkSync(_filePath) { }\nexport function readFileSync(_filePath) {\n return \"\";\n}\n"],"names":["path","parts","p","writeFileSync","_filePath","_content","renameSync","_oldPath","_newPath"],"mappings":"AAQY,MAACA,IAAO;AAAA,EAChB,MAAM,IAAIC,MAAUA,EAAM,KAAK,GAAG;AAAA,EAClC,SAAS,CAACC,MAAMA,EAAE,MAAM,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,GAAG;AACtD;AAoBO,SAASC,EAAcC,GAAWC,GAAU;AAAE;AAC9C,SAASC,EAAWC,GAAUC,GAAU;AAAE;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/p-queue.cjs.js DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";const e=require("../../../../../../../_virtual/index.cjs3.js");"default"in e&&e.default;
2	- //# sourceMappingURL=p-queue.cjs.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/p-queue.cjs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"p-queue.cjs.js","sources":["../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/p-queue.js"],"sourcesContent":["import PQueueMod from \"p-queue\";\n// Helper to handle both default and named exports of p-queue\nexport const PQueue = (\"default\" in PQueueMod ? PQueueMod.default : PQueueMod);\n"],"names":["PQueueMod"],"mappings":"4EAEuB,YAAaA,GAAYA,EAAU","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/p-queue.es.js DELETED Viewed

@@ -1,3 +0,0 @@
-import e from "../../../../../../../_virtual/index.es3.js";
-"default" in e ? e.default : e;
-//# sourceMappingURL=p-queue.es.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/p-queue.es.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"p-queue.es.js","sources":["../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/p-queue.js"],"sourcesContent":["import PQueueMod from \"p-queue\";\n// Helper to handle both default and named exports of p-queue\nexport const PQueue = (\"default\" in PQueueMod ? PQueueMod.default : PQueueMod);\n"],"names":["PQueueMod"],"mappings":";AAEuB,aAAaA,IAAYA,EAAU,UAAUA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/prompt_cache/index.cjs.js DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("../fs.browser.cjs.js");function a(h,e){return e===null?!1:Date.now()-h.createdAt>e1e3}class c{constructor(e={}){Object.defineProperty(this,"cache",{enumerable:!0,configurable:!0,writable:!0,value:new Map}),Object.defineProperty(this,"maxSize",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"ttlSeconds",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"refreshIntervalSeconds",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"refreshTimer",{enumerable:!0,configurable:!0,writable:!0,value:void 0}),Object.defineProperty(this,"_metrics",{enumerable:!0,configurable:!0,writable:!0,value:{hits:0,misses:0,refreshes:0,refreshErrors:0}}),this.configure(e)}get metrics(){return{...this._metrics}}get totalRequests(){return this._metrics.hits+this._metrics.misses}get hitRate(){const e=this.totalRequests;return e>0?this._metrics.hits/e:0}resetMetrics(){this._metrics={hits:0,misses:0,refreshes:0,refreshErrors:0}}get(e,r){if(this.maxSize===0)return;const t=this.cache.get(e);if(!t){this._metrics.misses+=1;return}return this.cache.delete(e),this.cache.set(e,{...t,refreshFunc:r}),this._metrics.hits+=1,t.value}set(e,r,t){if(this.maxSize===0)return;if(this.refreshTimer===void 0&&this.startRefreshLoop(),!this.cache.has(e)&&this.cache.size>=this.maxSize){const i=this.cache.keys().next().value;i!==void 0&&this.cache.delete(i)}const s={value:r,createdAt:Date.now(),refreshFunc:t};this.cache.delete(e),this.cache.set(e,s)}invalidate(e){this.cache.delete(e)}clear(){this.cache.clear()}get size(){return this.cache.size}stop(){this.refreshTimer&&(clearInterval(this.refreshTimer),this.refreshTimer=void 0)}dump(e){const r={};for(const[s,i]of this.cache.entries())r[s]=i.value;n.path.dirname(e);const t=`${e}.tmp`;try{n.writeFileSync(t,JSON.stringify({entries:r},null,2)),n.renameSync(t,e)}catch(s){throw s}}load(e){return 0}startRefreshLoop(){this.stop(),this.ttlSeconds!==null&&(this.refreshTimer=setInterval(()=>{this.refreshStaleEntries().catch(e=>{console.warn("Unexpected error in cache refresh loop:",e)})},this.refreshIntervalSeconds1e3),this.refreshTimer.unref&&this.refreshTimer.unref())}getStaleEntries(){const e=[];for(const[r,t]of this.cache.entries())a(t,this.ttlSeconds)&&e.push([r,t]);return e}async refreshStaleEntries(){const e=this.getStaleEntries();if(e.length!==0){for(const[r,t]of e)if(t.refreshFunc!==void 0)try{const s=await t.refreshFunc();this.set(r,s,t.refreshFunc),this._metrics.refreshes+=1}catch(s){this._metrics.refreshErrors+=1,console.warn(`Failed to refresh cache entry ${r}:`,s)}}}configure(e){this.stop(),this.refreshIntervalSeconds=e.refreshIntervalSeconds??60,this.maxSize=e.maxSize??100,this.ttlSeconds=e.ttlSeconds??300}}new c;exports.PromptCache=c;
2	- //# sourceMappingURL=index.cjs.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/prompt_cache/index.cjs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.cjs.js","sources":["../../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/prompt_cache/index.js"],"sourcesContent":["/**\n * Prompt caching module for LangSmith SDK.\n *\n * Provides an LRU cache with background refresh for prompt caching.\n * Uses stale-while-revalidate pattern for optimal performance.\n *\n * Works in all environments. File operations (dump/load) use the shared\n * fs abstraction which is swapped for browser builds via package.json\n * browser field (no-ops in browser — cache just doesn't persist).\n */\nimport { path, existsSync, mkdirSync, writeFileSync, renameSync, unlinkSync, readFileSync, } from \"../fs.js\";\n/**\n * Check if a cache entry is stale based on TTL.\n */\nfunction isStale(entry, ttlSeconds) {\n if (ttlSeconds === null) {\n return false; // Infinite TTL, never stale\n }\n const ageMs = Date.now() - entry.createdAt;\n return ageMs > ttlSeconds * 1000;\n}\n/**\n * LRU cache with background refresh for prompts.\n *\n * Features:\n * - In-memory LRU cache with configurable max size\n * - Background refresh using setInterval\n * - Stale-while-revalidate: returns stale data while refresh happens\n * - Uses the most recently used client for a key for refreshes\n * - JSON dump/load for offline use\n *\n * @example\n * ```typescript\n * const cache = new Cache({\n * maxSize: 100,\n * ttlSeconds: 3600,\n * });\n *\n * // Use the cache\n * cache.set(\"my-prompt:latest\", promptCommit);\n * const cached = cache.get(\"my-prompt:latest\");\n *\n * // Cleanup\n * cache.stop();\n * ```\n */\nexport class PromptCache {\n constructor(config = {}) {\n Object.defineProperty(this, \"cache\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: new Map()\n });\n Object.defineProperty(this, \"maxSize\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"ttlSeconds\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"refreshIntervalSeconds\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"refreshTimer\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"_metrics\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: {\n hits: 0,\n misses: 0,\n refreshes: 0,\n refreshErrors: 0,\n }\n });\n this.configure(config);\n }\n /**\n * Get cache performance metrics.\n */\n get metrics() {\n return { ...this._metrics };\n }\n /**\n * Get total cache requests (hits + misses).\n */\n get totalRequests() {\n return this._metrics.hits + this._metrics.misses;\n }\n /**\n * Get cache hit rate (0.0 to 1.0).\n */\n get hitRate() {\n const total = this.totalRequests;\n return total > 0 ? this._metrics.hits / total : 0;\n }\n /**\n * Reset all metrics to zero.\n */\n resetMetrics() {\n this._metrics = {\n hits: 0,\n misses: 0,\n refreshes: 0,\n refreshErrors: 0,\n };\n }\n /**\n * Get a value from cache.\n *\n * Returns the cached value or undefined if not found.\n * Stale entries are still returned (background refresh handles updates).\n */\n get(key, refreshFunc) {\n // If max_size is 0, cache is disabled\n if (this.maxSize === 0) {\n return undefined;\n }\n const entry = this.cache.get(key);\n if (!entry) {\n this._metrics.misses += 1;\n return undefined;\n }\n // Move to end for LRU (delete and re-add)\n this.cache.delete(key);\n this.cache.set(key, { ...entry, refreshFunc });\n this._metrics.hits += 1;\n return entry.value;\n }\n /**\n * Set a value in the cache.\n */\n set(key, value, refreshFunc) {\n // If max_size is 0, cache is disabled - do nothing\n if (this.maxSize === 0) {\n return;\n }\n if (this.refreshTimer === undefined) {\n this.startRefreshLoop();\n }\n // Check if we need to evict (and key is new)\n if (!this.cache.has(key) && this.cache.size >= this.maxSize) {\n // Evict oldest (first item in Map)\n const oldestKey = this.cache.keys().next().value;\n if (oldestKey !== undefined) {\n this.cache.delete(oldestKey);\n }\n }\n const entry = {\n value,\n createdAt: Date.now(),\n refreshFunc,\n };\n // Delete first to ensure it's at the end\n this.cache.delete(key);\n this.cache.set(key, entry);\n }\n /**\n * Remove a specific entry from cache.\n */\n invalidate(key) {\n this.cache.delete(key);\n }\n /**\n * Clear all cache entries.\n */\n clear() {\n this.cache.clear();\n }\n /**\n * Get the number of entries in the cache.\n */\n get size() {\n return this.cache.size;\n }\n /**\n * Stop background refresh.\n * Should be called when the client is being cleaned up.\n */\n stop() {\n if (this.refreshTimer) {\n clearInterval(this.refreshTimer);\n this.refreshTimer = undefined;\n }\n }\n /**\n * Dump cache contents to a JSON file for offline use.\n */\n dump(filePath) {\n const entries = {};\n for (const [key, entry] of this.cache.entries()) {\n entries[key] = entry.value;\n }\n const dir = path.dirname(filePath);\n if (!existsSync(dir)) {\n mkdirSync(dir);\n }\n const tempPath = `${filePath}.tmp`;\n try {\n writeFileSync(tempPath, JSON.stringify({ entries }, null, 2));\n renameSync(tempPath, filePath);\n }\n catch (e) {\n if (existsSync(tempPath)) {\n unlinkSync(tempPath);\n }\n throw e;\n }\n }\n /**\n * Load cache contents from a JSON file.\n *\n * Loaded entries get a fresh TTL starting from load time.\n *\n * @returns Number of entries loaded.\n */\n load(filePath) {\n if (!existsSync(filePath)) {\n return 0;\n }\n let entries;\n try {\n const content = readFileSync(filePath);\n const data = JSON.parse(content);\n entries = data.entries ?? null;\n }\n catch {\n return 0;\n }\n if (!entries) {\n return 0;\n }\n let loaded = 0;\n const now = Date.now();\n for (const [key, value] of Object.entries(entries)) {\n if (this.cache.size >= this.maxSize) {\n break;\n }\n const entry = {\n value: value,\n createdAt: now, // Fresh TTL from load time\n };\n this.cache.set(key, entry);\n loaded += 1;\n }\n return loaded;\n }\n /**\n * Start the background refresh loop.\n */\n startRefreshLoop() {\n this.stop();\n if (this.ttlSeconds !== null) {\n this.refreshTimer = setInterval(() => {\n this.refreshStaleEntries().catch((e) => {\n // Log but don't die - keep the refresh loop running\n console.warn(\"Unexpected error in cache refresh loop:\", e);\n });\n }, this.refreshIntervalSeconds * 1000);\n // Don't block Node.js from exiting\n if (this.refreshTimer.unref) {\n this.refreshTimer.unref();\n }\n }\n }\n /**\n * Get list of stale cache keys.\n */\n getStaleEntries() {\n const staleEntries = [];\n for (const [key, value] of this.cache.entries()) {\n if (isStale(value, this.ttlSeconds)) {\n staleEntries.push([key, value]);\n }\n }\n return staleEntries;\n }\n /**\n * Check for stale entries and refresh them.\n */\n async refreshStaleEntries() {\n const staleEntries = this.getStaleEntries();\n if (staleEntries.length === 0) {\n return;\n }\n for (const [key, value] of staleEntries) {\n if (value.refreshFunc !== undefined) {\n try {\n const newValue = await value.refreshFunc();\n this.set(key, newValue, value.refreshFunc);\n this._metrics.refreshes += 1;\n }\n catch (e) {\n // Keep stale data on refresh failure\n this._metrics.refreshErrors += 1;\n console.warn(`Failed to refresh cache entry ${key}:`, e);\n }\n }\n }\n }\n configure(config) {\n this.stop();\n this.refreshIntervalSeconds = config.refreshIntervalSeconds ?? 60;\n this.maxSize = config.maxSize ?? 100;\n this.ttlSeconds = config.ttlSeconds ?? 5 * 60;\n }\n}\n/**\n * Global singleton instance of PromptCache.\n * Use configureGlobalPromptCache(), enableGlobalPromptCache(), or disableGlobalPromptCache() instead.\n */\nexport const promptCacheSingleton = new PromptCache();\n/**\n * Configure the global prompt cache.\n *\n * This should be called before any cache instances are created.\n *\n * @param config - Cache configuration options\n *\n * @example\n * ```typescript\n * import { configureGlobalPromptCache } from 'langsmith';\n *\n * configureGlobalPromptCache({ maxSize: 200, ttlSeconds: 7200 });\n * ```\n */\nexport function configureGlobalPromptCache(config) {\n promptCacheSingleton.configure(config);\n}\n/**\n * @deprecated Use `PromptCache` instead. This is a deprecated alias.\n *\n * Deprecated alias for PromptCache. Use PromptCache instead.\n */\nexport class Cache extends PromptCache {\n constructor(config = {}) {\n console.warn(\"The 'Cache' class is deprecated and will be removed in a future version. \" +\n \"Use 'PromptCache' instead.\");\n super(config);\n }\n}\n"],"names":["isStale","entry","ttlSeconds","PromptCache","config","total","key","refreshFunc","value","oldestKey","filePath","entries","path","tempPath","writeFileSync","renameSync","e","staleEntries","newValue"],"mappings":"wHAcA,SAASA,EAAQC,EAAOC,EAAY,CAChC,OAAIA,IAAe,KACR,GAEG,KAAK,IAAG,EAAKD,EAAM,UAClBC,EAAa,GAChC,CA0BO,MAAMC,CAAY,CACrB,YAAYC,EAAS,GAAI,CACrB,OAAO,eAAe,KAAM,QAAS,CACjC,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,IAAI,GACvB,CAAS,EACD,OAAO,eAAe,KAAM,UAAW,CACnC,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,MACnB,CAAS,EACD,OAAO,eAAe,KAAM,aAAc,CACtC,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,MACnB,CAAS,EACD,OAAO,eAAe,KAAM,yBAA0B,CAClD,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,MACnB,CAAS,EACD,OAAO,eAAe,KAAM,eAAgB,CACxC,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,MACnB,CAAS,EACD,OAAO,eAAe,KAAM,WAAY,CACpC,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,CACH,KAAM,EACN,OAAQ,EACR,UAAW,EACX,cAAe,CAC/B,CACA,CAAS,EACD,KAAK,UAAUA,CAAM,CACzB,CAIA,IAAI,SAAU,CACV,MAAO,CAAE,GAAG,KAAK,QAAQ,CAC7B,CAIA,IAAI,eAAgB,CAChB,OAAO,KAAK,SAAS,KAAO,KAAK,SAAS,MAC9C,CAIA,IAAI,SAAU,CACV,MAAMC,EAAQ,KAAK,cACnB,OAAOA,EAAQ,EAAI,KAAK,SAAS,KAAOA,EAAQ,CACpD,CAIA,cAAe,CACX,KAAK,SAAW,CACZ,KAAM,EACN,OAAQ,EACR,UAAW,EACX,cAAe,CAC3B,CACI,CAOA,IAAIC,EAAKC,EAAa,CAElB,GAAI,KAAK,UAAY,EACjB,OAEJ,MAAMN,EAAQ,KAAK,MAAM,IAAIK,CAAG,EAChC,GAAI,CAACL,EAAO,CACR,KAAK,SAAS,QAAU,EACxB,MACJ,CAEA,YAAK,MAAM,OAAOK,CAAG,EACrB,KAAK,MAAM,IAAIA,EAAK,CAAE,GAAGL,EAAO,YAAAM,EAAa,EAC7C,KAAK,SAAS,MAAQ,EACfN,EAAM,KACjB,CAIA,IAAIK,EAAKE,EAAOD,EAAa,CAEzB,GAAI,KAAK,UAAY,EACjB,OAMJ,GAJI,KAAK,eAAiB,QACtB,KAAK,iBAAgB,EAGrB,CAAC,KAAK,MAAM,IAAID,CAAG,GAAK,KAAK,MAAM,MAAQ,KAAK,QAAS,CAEzD,MAAMG,EAAY,KAAK,MAAM,KAAI,EAAG,KAAI,EAAG,MACvCA,IAAc,QACd,KAAK,MAAM,OAAOA,CAAS,CAEnC,CACA,MAAMR,EAAQ,CACV,MAAAO,EACA,UAAW,KAAK,IAAG,EACnB,YAAAD,CACZ,EAEQ,KAAK,MAAM,OAAOD,CAAG,EACrB,KAAK,MAAM,IAAIA,EAAKL,CAAK,CAC7B,CAIA,WAAWK,EAAK,CACZ,KAAK,MAAM,OAAOA,CAAG,CACzB,CAIA,OAAQ,CACJ,KAAK,MAAM,MAAK,CACpB,CAIA,IAAI,MAAO,CACP,OAAO,KAAK,MAAM,IACtB,CAKA,MAAO,CACC,KAAK,eACL,cAAc,KAAK,YAAY,EAC/B,KAAK,aAAe,OAE5B,CAIA,KAAKI,EAAU,CACX,MAAMC,EAAU,CAAA,EAChB,SAAW,CAACL,EAAKL,CAAK,IAAK,KAAK,MAAM,UAClCU,EAAQL,CAAG,EAAIL,EAAM,MAEbW,EAAAA,KAAK,QAAQF,CAAQ,EAIjC,MAAMG,EAAW,GAAGH,CAAQ,OAC5B,GAAI,CACAI,gBAAcD,EAAU,KAAK,UAAU,CAAE,QAAAF,GAAW,KAAM,CAAC,CAAC,EAC5DI,EAAAA,WAAWF,EAAUH,CAAQ,CACjC,OACOM,EAAG,CAIN,MAAMA,CACV,CACJ,CAQA,KAAKN,EAAU,CAEP,MAAO,EA4Bf,CAIA,kBAAmB,CACf,KAAK,KAAI,EACL,KAAK,aAAe,OACpB,KAAK,aAAe,YAAY,IAAM,CAClC,KAAK,oBAAmB,EAAG,MAAO,GAAM,CAEpC,QAAQ,KAAK,0CAA2C,CAAC,CAC7D,CAAC,CACL,EAAG,KAAK,uBAAyB,GAAI,EAEjC,KAAK,aAAa,OAClB,KAAK,aAAa,MAAK,EAGnC,CAIA,iBAAkB,CACd,MAAMO,EAAe,CAAA,EACrB,SAAW,CAACX,EAAKE,CAAK,IAAK,KAAK,MAAM,UAC9BR,EAAQQ,EAAO,KAAK,UAAU,GAC9BS,EAAa,KAAK,CAACX,EAAKE,CAAK,CAAC,EAGtC,OAAOS,CACX,CAIA,MAAM,qBAAsB,CACxB,MAAMA,EAAe,KAAK,gBAAe,EACzC,GAAIA,EAAa,SAAW,GAG5B,SAAW,CAACX,EAAKE,CAAK,IAAKS,EACvB,GAAIT,EAAM,cAAgB,OACtB,GAAI,CACA,MAAMU,EAAW,MAAMV,EAAM,YAAW,EACxC,KAAK,IAAIF,EAAKY,EAAUV,EAAM,WAAW,EACzC,KAAK,SAAS,WAAa,CAC/B,OACOQ,EAAG,CAEN,KAAK,SAAS,eAAiB,EAC/B,QAAQ,KAAK,iCAAiCV,CAAG,IAAKU,CAAC,CAC3D,EAGZ,CACA,UAAUZ,EAAQ,CACd,KAAK,KAAI,EACT,KAAK,uBAAyBA,EAAO,wBAA0B,GAC/D,KAAK,QAAUA,EAAO,SAAW,IACjC,KAAK,WAAaA,EAAO,YAAc,GAC3C,CACJ,CAKoC,IAAID","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/prompt_cache/index.es.js DELETED Viewed

@@ -1,200 +0,0 @@
-import { path as h, writeFileSync as c, renameSync as a } from "../fs.browser.es.js";
-function u(n, e) {
-  return e === null ? !1 : Date.now() - n.createdAt > e * 1e3;
-}
-class o {
-  constructor(e = {}) {
-    Object.defineProperty(this, "cache", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: /* @__PURE__ */ new Map()
-    }), Object.defineProperty(this, "maxSize", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "ttlSeconds", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "refreshIntervalSeconds", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "refreshTimer", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: void 0
-    }), Object.defineProperty(this, "_metrics", {
-      enumerable: !0,
-      configurable: !0,
-      writable: !0,
-      value: {
-        hits: 0,
-        misses: 0,
-        refreshes: 0,
-        refreshErrors: 0
-      }
-    }), this.configure(e);
-  }
-  /**
-   * Get cache performance metrics.
-   */
-  get metrics() {
-    return { ...this._metrics };
-  }
-  /**
-   * Get total cache requests (hits + misses).
-   */
-  get totalRequests() {
-    return this._metrics.hits + this._metrics.misses;
-  }
-  /**
-   * Get cache hit rate (0.0 to 1.0).
-   */
-  get hitRate() {
-    const e = this.totalRequests;
-    return e > 0 ? this._metrics.hits / e : 0;
-  }
-  /**
-   * Reset all metrics to zero.
-   */
-  resetMetrics() {
-    this._metrics = {
-      hits: 0,
-      misses: 0,
-      refreshes: 0,
-      refreshErrors: 0
-    };
-  }
-  /**
-   * Get a value from cache.
-   *
-   * Returns the cached value or undefined if not found.
-   * Stale entries are still returned (background refresh handles updates).
-   */
-  get(e, r) {
-    if (this.maxSize === 0)
-      return;
-    const t = this.cache.get(e);
-    if (!t) {
-      this._metrics.misses += 1;
-      return;
-    }
-    return this.cache.delete(e), this.cache.set(e, { ...t, refreshFunc: r }), this._metrics.hits += 1, t.value;
-  }
-  /**
-   * Set a value in the cache.
-   */
-  set(e, r, t) {
-    if (this.maxSize === 0)
-      return;
-    if (this.refreshTimer === void 0 && this.startRefreshLoop(), !this.cache.has(e) && this.cache.size >= this.maxSize) {
-      const i = this.cache.keys().next().value;
-      i !== void 0 && this.cache.delete(i);
-    }
-    const s = {
-      value: r,
-      createdAt: Date.now(),
-      refreshFunc: t
-    };
-    this.cache.delete(e), this.cache.set(e, s);
-  }
-  /**
-   * Remove a specific entry from cache.
-   */
-  invalidate(e) {
-    this.cache.delete(e);
-  }
-  /**
-   * Clear all cache entries.
-   */
-  clear() {
-    this.cache.clear();
-  }
-  /**
-   * Get the number of entries in the cache.
-   */
-  get size() {
-    return this.cache.size;
-  }
-  /**
-   * Stop background refresh.
-   * Should be called when the client is being cleaned up.
-   */
-  stop() {
-    this.refreshTimer && (clearInterval(this.refreshTimer), this.refreshTimer = void 0);
-  }
-  /**
-   * Dump cache contents to a JSON file for offline use.
-   */
-  dump(e) {
-    const r = {};
-    for (const [s, i] of this.cache.entries())
-      r[s] = i.value;
-    h.dirname(e);
-    const t = `${e}.tmp`;
-    try {
-      c(t, JSON.stringify({ entries: r }, null, 2)), a(t, e);
-    } catch (s) {
-      throw s;
-    }
-  }
-  /**
-   * Load cache contents from a JSON file.
-   *
-   * Loaded entries get a fresh TTL starting from load time.
-   *
-   * @returns Number of entries loaded.
-   */
-  load(e) {
-    return 0;
-  }
-  /**
-   * Start the background refresh loop.
-   */
-  startRefreshLoop() {
-    this.stop(), this.ttlSeconds !== null && (this.refreshTimer = setInterval(() => {
-      this.refreshStaleEntries().catch((e) => {
-        console.warn("Unexpected error in cache refresh loop:", e);
-      });
-    }, this.refreshIntervalSeconds * 1e3), this.refreshTimer.unref && this.refreshTimer.unref());
-  }
-  /**
-   * Get list of stale cache keys.
-   */
-  getStaleEntries() {
-    const e = [];
-    for (const [r, t] of this.cache.entries())
-      u(t, this.ttlSeconds) && e.push([r, t]);
-    return e;
-  }
-  /**
-   * Check for stale entries and refresh them.
-   */
-  async refreshStaleEntries() {
-    const e = this.getStaleEntries();
-    if (e.length !== 0) {
-      for (const [r, t] of e)
-        if (t.refreshFunc !== void 0)
-          try {
-            const s = await t.refreshFunc();
-            this.set(r, s, t.refreshFunc), this._metrics.refreshes += 1;
-          } catch (s) {
-            this._metrics.refreshErrors += 1, console.warn(`Failed to refresh cache entry ${r}:`, s);
-          }
-    }
-  }
-  configure(e) {
-    this.stop(), this.refreshIntervalSeconds = e.refreshIntervalSeconds ?? 60, this.maxSize = e.maxSize ?? 100, this.ttlSeconds = e.ttlSeconds ?? 300;
-  }
-}
-new o();
-export {
-  o as PromptCache
-};
-//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/prompt_cache/index.es.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.es.js","sources":["../../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/prompt_cache/index.js"],"sourcesContent":["/**\n * Prompt caching module for LangSmith SDK.\n *\n * Provides an LRU cache with background refresh for prompt caching.\n * Uses stale-while-revalidate pattern for optimal performance.\n *\n * Works in all environments. File operations (dump/load) use the shared\n * fs abstraction which is swapped for browser builds via package.json\n * browser field (no-ops in browser — cache just doesn't persist).\n */\nimport { path, existsSync, mkdirSync, writeFileSync, renameSync, unlinkSync, readFileSync, } from \"../fs.js\";\n/**\n * Check if a cache entry is stale based on TTL.\n */\nfunction isStale(entry, ttlSeconds) {\n if (ttlSeconds === null) {\n return false; // Infinite TTL, never stale\n }\n const ageMs = Date.now() - entry.createdAt;\n return ageMs > ttlSeconds * 1000;\n}\n/**\n * LRU cache with background refresh for prompts.\n *\n * Features:\n * - In-memory LRU cache with configurable max size\n * - Background refresh using setInterval\n * - Stale-while-revalidate: returns stale data while refresh happens\n * - Uses the most recently used client for a key for refreshes\n * - JSON dump/load for offline use\n *\n * @example\n * ```typescript\n * const cache = new Cache({\n * maxSize: 100,\n * ttlSeconds: 3600,\n * });\n *\n * // Use the cache\n * cache.set(\"my-prompt:latest\", promptCommit);\n * const cached = cache.get(\"my-prompt:latest\");\n *\n * // Cleanup\n * cache.stop();\n * ```\n */\nexport class PromptCache {\n constructor(config = {}) {\n Object.defineProperty(this, \"cache\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: new Map()\n });\n Object.defineProperty(this, \"maxSize\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"ttlSeconds\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"refreshIntervalSeconds\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"refreshTimer\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"_metrics\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: {\n hits: 0,\n misses: 0,\n refreshes: 0,\n refreshErrors: 0,\n }\n });\n this.configure(config);\n }\n /**\n * Get cache performance metrics.\n */\n get metrics() {\n return { ...this._metrics };\n }\n /**\n * Get total cache requests (hits + misses).\n */\n get totalRequests() {\n return this._metrics.hits + this._metrics.misses;\n }\n /**\n * Get cache hit rate (0.0 to 1.0).\n */\n get hitRate() {\n const total = this.totalRequests;\n return total > 0 ? this._metrics.hits / total : 0;\n }\n /**\n * Reset all metrics to zero.\n */\n resetMetrics() {\n this._metrics = {\n hits: 0,\n misses: 0,\n refreshes: 0,\n refreshErrors: 0,\n };\n }\n /**\n * Get a value from cache.\n *\n * Returns the cached value or undefined if not found.\n * Stale entries are still returned (background refresh handles updates).\n */\n get(key, refreshFunc) {\n // If max_size is 0, cache is disabled\n if (this.maxSize === 0) {\n return undefined;\n }\n const entry = this.cache.get(key);\n if (!entry) {\n this._metrics.misses += 1;\n return undefined;\n }\n // Move to end for LRU (delete and re-add)\n this.cache.delete(key);\n this.cache.set(key, { ...entry, refreshFunc });\n this._metrics.hits += 1;\n return entry.value;\n }\n /**\n * Set a value in the cache.\n */\n set(key, value, refreshFunc) {\n // If max_size is 0, cache is disabled - do nothing\n if (this.maxSize === 0) {\n return;\n }\n if (this.refreshTimer === undefined) {\n this.startRefreshLoop();\n }\n // Check if we need to evict (and key is new)\n if (!this.cache.has(key) && this.cache.size >= this.maxSize) {\n // Evict oldest (first item in Map)\n const oldestKey = this.cache.keys().next().value;\n if (oldestKey !== undefined) {\n this.cache.delete(oldestKey);\n }\n }\n const entry = {\n value,\n createdAt: Date.now(),\n refreshFunc,\n };\n // Delete first to ensure it's at the end\n this.cache.delete(key);\n this.cache.set(key, entry);\n }\n /**\n * Remove a specific entry from cache.\n */\n invalidate(key) {\n this.cache.delete(key);\n }\n /**\n * Clear all cache entries.\n */\n clear() {\n this.cache.clear();\n }\n /**\n * Get the number of entries in the cache.\n */\n get size() {\n return this.cache.size;\n }\n /**\n * Stop background refresh.\n * Should be called when the client is being cleaned up.\n */\n stop() {\n if (this.refreshTimer) {\n clearInterval(this.refreshTimer);\n this.refreshTimer = undefined;\n }\n }\n /**\n * Dump cache contents to a JSON file for offline use.\n */\n dump(filePath) {\n const entries = {};\n for (const [key, entry] of this.cache.entries()) {\n entries[key] = entry.value;\n }\n const dir = path.dirname(filePath);\n if (!existsSync(dir)) {\n mkdirSync(dir);\n }\n const tempPath = `${filePath}.tmp`;\n try {\n writeFileSync(tempPath, JSON.stringify({ entries }, null, 2));\n renameSync(tempPath, filePath);\n }\n catch (e) {\n if (existsSync(tempPath)) {\n unlinkSync(tempPath);\n }\n throw e;\n }\n }\n /**\n * Load cache contents from a JSON file.\n *\n * Loaded entries get a fresh TTL starting from load time.\n *\n * @returns Number of entries loaded.\n */\n load(filePath) {\n if (!existsSync(filePath)) {\n return 0;\n }\n let entries;\n try {\n const content = readFileSync(filePath);\n const data = JSON.parse(content);\n entries = data.entries ?? null;\n }\n catch {\n return 0;\n }\n if (!entries) {\n return 0;\n }\n let loaded = 0;\n const now = Date.now();\n for (const [key, value] of Object.entries(entries)) {\n if (this.cache.size >= this.maxSize) {\n break;\n }\n const entry = {\n value: value,\n createdAt: now, // Fresh TTL from load time\n };\n this.cache.set(key, entry);\n loaded += 1;\n }\n return loaded;\n }\n /**\n * Start the background refresh loop.\n */\n startRefreshLoop() {\n this.stop();\n if (this.ttlSeconds !== null) {\n this.refreshTimer = setInterval(() => {\n this.refreshStaleEntries().catch((e) => {\n // Log but don't die - keep the refresh loop running\n console.warn(\"Unexpected error in cache refresh loop:\", e);\n });\n }, this.refreshIntervalSeconds * 1000);\n // Don't block Node.js from exiting\n if (this.refreshTimer.unref) {\n this.refreshTimer.unref();\n }\n }\n }\n /**\n * Get list of stale cache keys.\n */\n getStaleEntries() {\n const staleEntries = [];\n for (const [key, value] of this.cache.entries()) {\n if (isStale(value, this.ttlSeconds)) {\n staleEntries.push([key, value]);\n }\n }\n return staleEntries;\n }\n /**\n * Check for stale entries and refresh them.\n */\n async refreshStaleEntries() {\n const staleEntries = this.getStaleEntries();\n if (staleEntries.length === 0) {\n return;\n }\n for (const [key, value] of staleEntries) {\n if (value.refreshFunc !== undefined) {\n try {\n const newValue = await value.refreshFunc();\n this.set(key, newValue, value.refreshFunc);\n this._metrics.refreshes += 1;\n }\n catch (e) {\n // Keep stale data on refresh failure\n this._metrics.refreshErrors += 1;\n console.warn(`Failed to refresh cache entry ${key}:`, e);\n }\n }\n }\n }\n configure(config) {\n this.stop();\n this.refreshIntervalSeconds = config.refreshIntervalSeconds ?? 60;\n this.maxSize = config.maxSize ?? 100;\n this.ttlSeconds = config.ttlSeconds ?? 5 * 60;\n }\n}\n/**\n * Global singleton instance of PromptCache.\n * Use configureGlobalPromptCache(), enableGlobalPromptCache(), or disableGlobalPromptCache() instead.\n */\nexport const promptCacheSingleton = new PromptCache();\n/**\n * Configure the global prompt cache.\n *\n * This should be called before any cache instances are created.\n *\n * @param config - Cache configuration options\n *\n * @example\n * ```typescript\n * import { configureGlobalPromptCache } from 'langsmith';\n *\n * configureGlobalPromptCache({ maxSize: 200, ttlSeconds: 7200 });\n * ```\n */\nexport function configureGlobalPromptCache(config) {\n promptCacheSingleton.configure(config);\n}\n/**\n * @deprecated Use `PromptCache` instead. This is a deprecated alias.\n *\n * Deprecated alias for PromptCache. Use PromptCache instead.\n */\nexport class Cache extends PromptCache {\n constructor(config = {}) {\n console.warn(\"The 'Cache' class is deprecated and will be removed in a future version. \" +\n \"Use 'PromptCache' instead.\");\n super(config);\n }\n}\n"],"names":["isStale","entry","ttlSeconds","PromptCache","config","total","key","refreshFunc","value","oldestKey","filePath","entries","path","tempPath","writeFileSync","renameSync","e","staleEntries","newValue"],"mappings":";AAcA,SAASA,EAAQC,GAAOC,GAAY;AAChC,SAAIA,MAAe,OACR,KAEG,KAAK,IAAG,IAAKD,EAAM,YAClBC,IAAa;AAChC;AA0BO,MAAMC,EAAY;AAAA,EACrB,YAAYC,IAAS,IAAI;AACrB,WAAO,eAAe,MAAM,SAAS;AAAA,MACjC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO,oBAAI,IAAG;AAAA,IAC1B,CAAS,GACD,OAAO,eAAe,MAAM,WAAW;AAAA,MACnC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO;AAAA,IACnB,CAAS,GACD,OAAO,eAAe,MAAM,cAAc;AAAA,MACtC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO;AAAA,IACnB,CAAS,GACD,OAAO,eAAe,MAAM,0BAA0B;AAAA,MAClD,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO;AAAA,IACnB,CAAS,GACD,OAAO,eAAe,MAAM,gBAAgB;AAAA,MACxC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO;AAAA,IACnB,CAAS,GACD,OAAO,eAAe,MAAM,YAAY;AAAA,MACpC,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,UAAU;AAAA,MACV,OAAO;AAAA,QACH,MAAM;AAAA,QACN,QAAQ;AAAA,QACR,WAAW;AAAA,QACX,eAAe;AAAA,MAC/B;AAAA,IACA,CAAS,GACD,KAAK,UAAUA,CAAM;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,UAAU;AACV,WAAO,EAAE,GAAG,KAAK,SAAQ;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,gBAAgB;AAChB,WAAO,KAAK,SAAS,OAAO,KAAK,SAAS;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,UAAU;AACV,UAAMC,IAAQ,KAAK;AACnB,WAAOA,IAAQ,IAAI,KAAK,SAAS,OAAOA,IAAQ;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA,EAIA,eAAe;AACX,SAAK,WAAW;AAAA,MACZ,MAAM;AAAA,MACN,QAAQ;AAAA,MACR,WAAW;AAAA,MACX,eAAe;AAAA,IAC3B;AAAA,EACI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAIC,GAAKC,GAAa;AAElB,QAAI,KAAK,YAAY;AACjB;AAEJ,UAAMN,IAAQ,KAAK,MAAM,IAAIK,CAAG;AAChC,QAAI,CAACL,GAAO;AACR,WAAK,SAAS,UAAU;AACxB;AAAA,IACJ;AAEA,gBAAK,MAAM,OAAOK,CAAG,GACrB,KAAK,MAAM,IAAIA,GAAK,EAAE,GAAGL,GAAO,aAAAM,GAAa,GAC7C,KAAK,SAAS,QAAQ,GACfN,EAAM;AAAA,EACjB;AAAA;AAAA;AAAA;AAAA,EAIA,IAAIK,GAAKE,GAAOD,GAAa;AAEzB,QAAI,KAAK,YAAY;AACjB;AAMJ,QAJI,KAAK,iBAAiB,UACtB,KAAK,iBAAgB,GAGrB,CAAC,KAAK,MAAM,IAAID,CAAG,KAAK,KAAK,MAAM,QAAQ,KAAK,SAAS;AAEzD,YAAMG,IAAY,KAAK,MAAM,KAAI,EAAG,KAAI,EAAG;AAC3C,MAAIA,MAAc,UACd,KAAK,MAAM,OAAOA,CAAS;AAAA,IAEnC;AACA,UAAMR,IAAQ;AAAA,MACV,OAAAO;AAAA,MACA,WAAW,KAAK,IAAG;AAAA,MACnB,aAAAD;AAAA,IACZ;AAEQ,SAAK,MAAM,OAAOD,CAAG,GACrB,KAAK,MAAM,IAAIA,GAAKL,CAAK;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA,EAIA,WAAWK,GAAK;AACZ,SAAK,MAAM,OAAOA,CAAG;AAAA,EACzB;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQ;AACJ,SAAK,MAAM,MAAK;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAIA,IAAI,OAAO;AACP,WAAO,KAAK,MAAM;AAAA,EACtB;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,OAAO;AACH,IAAI,KAAK,iBACL,cAAc,KAAK,YAAY,GAC/B,KAAK,eAAe;AAAA,EAE5B;AAAA;AAAA;AAAA;AAAA,EAIA,KAAKI,GAAU;AACX,UAAMC,IAAU,CAAA;AAChB,eAAW,CAACL,GAAKL,CAAK,KAAK,KAAK,MAAM;AAClC,MAAAU,EAAQL,CAAG,IAAIL,EAAM;AAEb,IAAAW,EAAK,QAAQF,CAAQ;AAIjC,UAAMG,IAAW,GAAGH,CAAQ;AAC5B,QAAI;AACA,MAAAI,EAAcD,GAAU,KAAK,UAAU,EAAE,SAAAF,KAAW,MAAM,CAAC,CAAC,GAC5DI,EAAWF,GAAUH,CAAQ;AAAA,IACjC,SACOM,GAAG;AAIN,YAAMA;AAAA,IACV;AAAA,EACJ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAKN,GAAU;AAEP,WAAO;AAAA,EA4Bf;AAAA;AAAA;AAAA;AAAA,EAIA,mBAAmB;AACf,SAAK,KAAI,GACL,KAAK,eAAe,SACpB,KAAK,eAAe,YAAY,MAAM;AAClC,WAAK,oBAAmB,EAAG,MAAM,CAAC,MAAM;AAEpC,gBAAQ,KAAK,2CAA2C,CAAC;AAAA,MAC7D,CAAC;AAAA,IACL,GAAG,KAAK,yBAAyB,GAAI,GAEjC,KAAK,aAAa,SAClB,KAAK,aAAa,MAAK;AAAA,EAGnC;AAAA;AAAA;AAAA;AAAA,EAIA,kBAAkB;AACd,UAAMO,IAAe,CAAA;AACrB,eAAW,CAACX,GAAKE,CAAK,KAAK,KAAK,MAAM;AAClC,MAAIR,EAAQQ,GAAO,KAAK,UAAU,KAC9BS,EAAa,KAAK,CAACX,GAAKE,CAAK,CAAC;AAGtC,WAAOS;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,MAAM,sBAAsB;AACxB,UAAMA,IAAe,KAAK,gBAAe;AACzC,QAAIA,EAAa,WAAW;AAG5B,iBAAW,CAACX,GAAKE,CAAK,KAAKS;AACvB,YAAIT,EAAM,gBAAgB;AACtB,cAAI;AACA,kBAAMU,IAAW,MAAMV,EAAM,YAAW;AACxC,iBAAK,IAAIF,GAAKY,GAAUV,EAAM,WAAW,GACzC,KAAK,SAAS,aAAa;AAAA,UAC/B,SACOQ,GAAG;AAEN,iBAAK,SAAS,iBAAiB,GAC/B,QAAQ,KAAK,iCAAiCV,CAAG,KAAKU,CAAC;AAAA,UAC3D;AAAA;AAAA,EAGZ;AAAA,EACA,UAAUZ,GAAQ;AACd,SAAK,KAAI,GACT,KAAK,yBAAyBA,EAAO,0BAA0B,IAC/D,KAAK,UAAUA,EAAO,WAAW,KACjC,KAAK,aAAaA,EAAO,cAAc;AAAA,EAC3C;AACJ;AAKoC,IAAID,EAAW;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/xxhash/xxhash.cjs.js DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";const c=e=>BigInt(e);c("0x9E3779B1");c("0x85EBCA77");c("0xC2B2AE3D");c("0x9E3779B185EBCA87");c("0xC2B2AE3D27D4EB4F");c("0x165667B19E3779F9");c("0x85EBCA77C2B2AE63");c("0x27D4EB2F165667C5");c("0x165667919E3779F9");c("0x9FB21C651E98DF25");function f(e){const d=new Uint8Array(e.length/2);for(let b=0;b<e.length;b+=2)d[b/2]=parseInt(e.substring(b,b+2),16);return d}f("b8fe6c3923a44bbe7c01812cf721ad1cded46de9839097db7240a4a4b7b3671fcb79e64eccc0e578825ad07dccff7221b8084674f743248ee03590e6813a264c3c2852bb91c300cb88d0658b1b532ea371644897a20df94e3819ef46a9deacd8a8fa763fe39c343ff9dcbbc7c70b4f1d8a51e04bcdb45931c89f7ec9d9787364eac5ac8334d3ebc3c581a0fffa1363eb170ddd51b7f0da49d316552629d4689e2b16be587d47a1fc8ff8b8d17ad031ce45cb3a8f95160428afd7fbcabb4b407e");(c(1)<<c(128))-c(1);(c(1)<<c(64))-c(1);(c(1)<<c(32))-c(1);
2	- //# sourceMappingURL=xxhash.cjs.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/xxhash/xxhash.cjs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"xxhash.cjs.js","sources":["../../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/xxhash/xxhash.js"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-nocheck\n// Original from: https://github.com/i404788/xxh3-ts\n// Vendored for compatibility (remove Buffer use in favor of Uint8Array)\nconst n = (n) => BigInt(n);\nconst PRIME32_1 = n(\"0x9E3779B1\"); // 0b10011110001101110111100110110001\nconst PRIME32_2 = n(\"0x85EBCA77\"); // 0b10000101111010111100101001110111\nconst PRIME32_3 = n(\"0xC2B2AE3D\"); // 0b11000010101100101010111000111101\nconst PRIME64_1 = n(\"0x9E3779B185EBCA87\"); // 0b1001111000110111011110011011000110000101111010111100101010000111\nconst PRIME64_2 = n(\"0xC2B2AE3D27D4EB4F\"); // 0b1100001010110010101011100011110100100111110101001110101101001111\nconst PRIME64_3 = n(\"0x165667B19E3779F9\"); // 0b0001011001010110011001111011000110011110001101110111100111111001\nconst PRIME64_4 = n(\"0x85EBCA77C2B2AE63\"); // 0b1000010111101011110010100111011111000010101100101010111001100011\nconst PRIME64_5 = n(\"0x27D4EB2F165667C5\"); // 0b0010011111010100111010110010111100010110010101100110011111000101\nconst PRIME_MX1 = n(\"0x165667919E3779F9\"); // 0b0001011001010110011001111001000110011110001101110111100111111001\nconst PRIME_MX2 = n(\"0x9FB21C651E98DF25\"); // 0b1001111110110010000111000110010100011110100110001101111100100101\n// Convert hex string to Uint8Array\nfunction hexToBytes(hex) {\n const bytes = new Uint8Array(hex.length / 2);\n for (let i = 0; i < hex.length; i += 2) {\n bytes[i / 2] = parseInt(hex.substring(i, i + 2), 16);\n }\n return bytes;\n}\nconst kkey = hexToBytes(\"b8fe6c3923a44bbe7c01812cf721ad1cded46de9839097db7240a4a4b7b3671fcb79e64eccc0e578825ad07dccff7221b8084674f743248ee03590e6813a264c3c2852bb91c300cb88d0658b1b532ea371644897a20df94e3819ef46a9deacd8a8fa763fe39c343ff9dcbbc7c70b4f1d8a51e04bcdb45931c89f7ec9d9787364eac5ac8334d3ebc3c581a0fffa1363eb170ddd51b7f0da49d316552629d4689e2b16be587d47a1fc8ff8b8d17ad031ce45cb3a8f95160428afd7fbcabb4b407e\");\nconst mask128 = (n(1) << n(128)) - n(1);\nconst mask64 = (n(1) << n(64)) - n(1);\nconst mask32 = (n(1) << n(32)) - n(1);\nconst STRIPE_LEN = 64;\nconst ACC_NB = STRIPE_LEN / 8;\nconst _U64 = 8;\nconst _U32 = 4;\n// Create a view into a Uint8Array at an offset\nfunction getView(buf, offset = 0) {\n return new Uint8Array(buf.buffer, buf.byteOffset + offset, buf.length - offset);\n}\n// Read BigInt from Uint8Array in little-endian\nfunction readBigUInt64LE(buf, offset = 0) {\n const view = new DataView(buf.buffer, buf.byteOffset + offset);\n return view.getBigUint64(0, true);\n}\n// Read UInt32 from Uint8Array in little-endian\nfunction readUInt32LE(buf, offset = 0) {\n const view = new DataView(buf.buffer, buf.byteOffset + offset);\n return view.getUint32(0, true);\n}\n// Read UInt8 from Uint8Array\nfunction readUInt8(buf, offset = 0) {\n return buf[offset];\n}\nconst bswap64 = (a) => {\n return (((a & n(0xff)) << n(56)) |\n ((a & n(0xff00)) << n(40)) |\n ((a & n(0xff0000)) << n(24)) |\n ((a & n(0xff000000)) << n(8)) |\n ((a & n(0xff00000000)) >> n(8)) |\n ((a & n(0xff0000000000)) >> n(24)) |\n ((a & n(0xff000000000000)) >> n(40)) |\n ((a & n(0xff00000000000000)) >> n(56)));\n};\nconst bswap32 = (a) => {\n a = ((a & n(0x0000ffff)) << n(16)) | ((a & n(0xffff0000)) >> n(16));\n a = ((a & n(0x00ff00ff)) << n(8)) | ((a & n(0xff00ff00)) >> n(8));\n return a;\n};\nconst XXH_mult32to64 = (a, b) => ((a & mask32) * (b & mask32)) & mask64;\nconst assert = (a) => {\n if (!a)\n throw new Error(\"Assert failed\");\n};\nfunction rotl32(a, b) {\n return ((a << b) | (a >> (n(32) - b))) & mask32;\n}\nfunction XXH3_accumulate_512(acc, data, key) {\n for (let i = 0; i < ACC_NB; i++) {\n const data_val = readBigUInt64LE(data, i * 8);\n const data_key = data_val ^ readBigUInt64LE(key, i * 8);\n acc[i ^ 1] += data_val;\n acc[i] += XXH_mult32to64(data_key, data_key >> n(32));\n }\n return acc;\n}\nfunction XXH3_accumulate(acc, data, key, nbStripes) {\n for (let n = 0; n < nbStripes; n++) {\n XXH3_accumulate_512(acc, getView(data, n * STRIPE_LEN), getView(key, n * 8));\n }\n return acc;\n}\nfunction XXH3_scrambleAcc(acc, key) {\n for (let i = 0; i < ACC_NB; i++) {\n const key64 = readBigUInt64LE(key, i * 8);\n let acc64 = acc[i];\n acc64 = xorshift64(acc64, n(47));\n acc64 ^= key64;\n acc64 *= PRIME32_1;\n acc[i] = acc64 & mask64;\n }\n return acc;\n}\nfunction XXH3_mix2Accs(acc, key) {\n return XXH3_mul128_fold64(acc[0] ^ readBigUInt64LE(key, 0), acc[1] ^ readBigUInt64LE(key, _U64));\n}\nfunction XXH3_mergeAccs(acc, key, start) {\n let result64 = start;\n result64 += XXH3_mix2Accs(acc.slice(0), getView(key, 0 * _U32));\n result64 += XXH3_mix2Accs(acc.slice(2), getView(key, 4 * _U32));\n result64 += XXH3_mix2Accs(acc.slice(4), getView(key, 8 * _U32));\n result64 += XXH3_mix2Accs(acc.slice(6), getView(key, 12 * _U32));\n return XXH3_avalanche(result64 & mask64);\n}\nfunction XXH3_hashLong(acc, data, secret, f_acc, f_scramble) {\n const nbStripesPerBlock = Math.floor((secret.byteLength - STRIPE_LEN) / 8);\n const block_len = STRIPE_LEN * nbStripesPerBlock;\n const nb_blocks = Math.floor((data.byteLength - 1) / block_len);\n for (let n = 0; n < nb_blocks; n++) {\n acc = XXH3_accumulate(acc, getView(data, n * block_len), secret, nbStripesPerBlock);\n acc = f_scramble(acc, getView(secret, secret.byteLength - STRIPE_LEN));\n }\n {\n // Partial block\n const nbStripes = Math.floor((data.byteLength - 1 - block_len * nb_blocks) / STRIPE_LEN);\n acc = XXH3_accumulate(acc, getView(data, nb_blocks * block_len), secret, nbStripes);\n // Last Stripe\n acc = f_acc(acc, getView(data, data.byteLength - STRIPE_LEN), getView(secret, secret.byteLength - STRIPE_LEN - 7));\n }\n return acc;\n}\nfunction XXH3_hashLong_128b(data, secret, seed) {\n let acc = new BigUint64Array([\n PRIME32_3,\n PRIME64_1,\n PRIME64_2,\n PRIME64_3,\n PRIME64_4,\n PRIME32_2,\n PRIME64_5,\n PRIME32_1,\n ]);\n assert(data.length > 128);\n acc = XXH3_hashLong(acc, data, secret, XXH3_accumulate_512, XXH3_scrambleAcc);\n /* converge into final hash */\n assert(acc.length * 8 == 64);\n {\n const low64 = XXH3_mergeAccs(acc, getView(secret, 11), (n(data.byteLength) * PRIME64_1) & mask64);\n const high64 = XXH3_mergeAccs(acc, getView(secret, secret.byteLength - STRIPE_LEN - 11), ~(n(data.byteLength) * PRIME64_2) & mask64);\n return (high64 << n(64)) | low64;\n }\n}\nfunction XXH3_mul128_fold64(a, b) {\n const lll = (a * b) & mask128;\n return (lll & mask64) ^ (lll >> n(64));\n}\nfunction XXH3_mix16B(data, key, seed) {\n return XXH3_mul128_fold64((readBigUInt64LE(data, 0) ^ (readBigUInt64LE(key, 0) + seed)) & mask64, (readBigUInt64LE(data, 8) ^ (readBigUInt64LE(key, 8) - seed)) & mask64);\n}\nfunction XXH3_mix32B(acc, data1, data2, key, seed) {\n let accl = acc & mask64;\n let acch = (acc >> n(64)) & mask64;\n accl += XXH3_mix16B(data1, key, seed);\n accl ^= readBigUInt64LE(data2, 0) + readBigUInt64LE(data2, 8);\n accl &= mask64;\n acch += XXH3_mix16B(data2, getView(key, 16), seed);\n acch ^= readBigUInt64LE(data1, 0) + readBigUInt64LE(data1, 8);\n acch &= mask64;\n return (acch << n(64)) | accl;\n}\nfunction XXH3_avalanche(h64) {\n h64 ^= h64 >> n(37);\n h64 *= PRIME_MX1;\n h64 &= mask64;\n h64 ^= h64 >> n(32);\n return h64;\n}\nfunction XXH3_avalanche64(h64) {\n h64 ^= h64 >> n(33);\n h64 *= PRIME64_2;\n h64 &= mask64;\n h64 ^= h64 >> n(29);\n h64 *= PRIME64_3;\n h64 &= mask64;\n h64 ^= h64 >> n(32);\n return h64;\n}\nfunction XXH3_len_1to3_128b(data, key32, seed) {\n const len = data.byteLength;\n assert(len > 0 && len <= 3);\n const combined = n(readUInt8(data, len - 1)) |\n n(len << 8) |\n n(readUInt8(data, 0) << 16) |\n n(readUInt8(data, len >> 1) << 24);\n const blow = (n(readUInt32LE(key32, 0)) ^ n(readUInt32LE(key32, 4))) + seed;\n const low = (combined ^ blow) & mask64;\n const bhigh = (n(readUInt32LE(key32, 8)) ^ n(readUInt32LE(key32, 12))) - seed;\n const high = (rotl32(bswap32(combined), n(13)) ^ bhigh) & mask64;\n return ((XXH3_avalanche64(high) & mask64) << n(64)) | XXH3_avalanche64(low);\n}\nfunction xorshift64(b, shift) {\n return b ^ (b >> shift);\n}\nfunction XXH3_len_4to8_128b(data, key32, seed) {\n const len = data.byteLength;\n assert(len >= 4 && len <= 8);\n {\n const l1 = readUInt32LE(data, 0);\n const l2 = readUInt32LE(data, len - 4);\n const l64 = n(l1) | (n(l2) << n(32));\n const bitflip = ((readBigUInt64LE(key32, 16) ^ readBigUInt64LE(key32, 24)) + seed) &\n mask64;\n const keyed = l64 ^ bitflip;\n let m128 = (keyed * (PRIME64_1 + (n(len) << n(2)))) & mask128;\n m128 += (m128 & mask64) << n(65);\n m128 &= mask128;\n m128 ^= m128 >> n(67);\n return (xorshift64((xorshift64(m128 & mask64, n(35)) * PRIME_MX2) & mask64, n(28)) |\n (XXH3_avalanche(m128 >> n(64)) << n(64)));\n }\n}\nfunction XXH3_len_9to16_128b(data, key64, seed) {\n const len = data.byteLength;\n assert(len >= 9 && len <= 16);\n {\n const bitflipl = ((readBigUInt64LE(key64, 32) ^ readBigUInt64LE(key64, 40)) + seed) &\n mask64;\n const bitfliph = ((readBigUInt64LE(key64, 48) ^ readBigUInt64LE(key64, 56)) - seed) &\n mask64;\n const ll1 = readBigUInt64LE(data);\n let ll2 = readBigUInt64LE(data, len - 8);\n let m128 = (ll1 ^ ll2 ^ bitflipl) * PRIME64_1;\n const m128_l = (m128 & mask64) + (n(len - 1) << n(54));\n m128 = (m128 & (mask128 ^ mask64)) | m128_l; // eqv. to adding only to lower 64b\n ll2 ^= bitfliph;\n m128 += (ll2 + (ll2 & mask32) * (PRIME32_2 - n(1))) << n(64);\n m128 &= mask128;\n m128 ^= bswap64(m128 >> n(64));\n let h128 = (m128 & mask64) * PRIME64_2;\n h128 += ((m128 >> n(64)) * PRIME64_2) << n(64);\n h128 &= mask128;\n return (XXH3_avalanche(h128 & mask64) | (XXH3_avalanche(h128 >> n(64)) << n(64)));\n }\n}\nfunction XXH3_len_0to16_128b(data, seed) {\n const len = data.byteLength;\n assert(len <= 16);\n if (len > 8)\n return XXH3_len_9to16_128b(data, kkey, seed);\n if (len >= 4)\n return XXH3_len_4to8_128b(data, kkey, seed);\n if (len > 0)\n return XXH3_len_1to3_128b(data, kkey, seed);\n return (XXH3_avalanche64(seed ^ readBigUInt64LE(kkey, 64) ^ readBigUInt64LE(kkey, 72)) |\n (XXH3_avalanche64(seed ^ readBigUInt64LE(kkey, 80) ^ readBigUInt64LE(kkey, 88)) <<\n n(64)));\n}\nfunction inv64(x) {\n // NOTE: `AND` fixes signedness (but because of 2's complement we need to re-add 1)\n return (~x + n(1)) & mask64;\n}\nfunction XXH3_len_17to128_128b(data, secret, seed) {\n let acc = (n(data.byteLength) * PRIME64_1) & mask64;\n let i = n(data.byteLength - 1) / n(32);\n while (i >= 0) {\n const ni = Number(i);\n acc = XXH3_mix32B(acc, getView(data, 16 * ni), getView(data, data.byteLength - 16 * (ni + 1)), getView(secret, 32 * ni), seed);\n i--;\n }\n let h128l = (acc + (acc >> n(64))) & mask64;\n h128l = XXH3_avalanche(h128l);\n let h128h = (acc & mask64) * PRIME64_1 +\n (acc >> n(64)) * PRIME64_4 +\n ((n(data.byteLength) - seed) & mask64) * PRIME64_2;\n h128h &= mask64;\n h128h = inv64(XXH3_avalanche(h128h));\n return h128l | (h128h << n(64));\n}\nfunction XXH3_len_129to240_128b(data, secret, seed) {\n let acc = (n(data.byteLength) * PRIME64_1) & mask64;\n for (let i = 32; i < 160; i += 32) {\n acc = XXH3_mix32B(acc, getView(data, i - 32), getView(data, i - 16), getView(secret, i - 32), seed);\n }\n acc = XXH3_avalanche(acc & mask64) | (XXH3_avalanche(acc >> n(64)) << n(64));\n for (let i = 160; i <= data.byteLength; i += 32) {\n acc = XXH3_mix32B(acc, getView(data, i - 32), getView(data, i - 16), getView(secret, 3 + i - 160), seed);\n }\n acc = XXH3_mix32B(acc, getView(data, data.byteLength - 16), getView(data, data.byteLength - 32), getView(secret, 136 - 17 - 16), inv64(seed));\n let h128l = (acc + (acc >> n(64))) & mask64;\n h128l = XXH3_avalanche(h128l);\n let h128h = (acc & mask64) * PRIME64_1 +\n (acc >> n(64)) * PRIME64_4 +\n ((n(data.byteLength) - seed) & mask64) * PRIME64_2;\n h128h &= mask64;\n h128h = inv64(XXH3_avalanche(h128h));\n return h128l | (h128h << n(64));\n}\n/**\n * Compute XXH3 128-bit hash of the input data.\n *\n * @param data - Input data as Uint8Array\n * @param seed - Optional seed value (default: 0)\n * @returns 128-bit hash as a single BigInt (high 64 bits << 64 | low 64 bits)\n */\nexport function XXH3_128(data, seed = n(0)) {\n const len = data.byteLength;\n if (len <= 16)\n return XXH3_len_0to16_128b(data, seed);\n if (len <= 128)\n return XXH3_len_17to128_128b(data, kkey, seed);\n if (len <= 240)\n return XXH3_len_129to240_128b(data, kkey, seed);\n return XXH3_hashLong_128b(data, kkey, seed);\n}\n/**\n * Convert a 128-bit hash (BigInt) to a 16-byte Uint8Array.\n *\n * @param hash128 - 128-bit hash as BigInt\n * @returns 16-byte Uint8Array in little-endian byte order\n */\nexport function xxh128ToBytes(hash128) {\n const result = new Uint8Array(16);\n const view = new DataView(result.buffer);\n // Extract low and high 64-bit values\n const low64 = hash128 & mask64;\n const high64 = hash128 >> n(64);\n // Write in big-endian order to match Python's xxhash.digest() output\n // Python outputs: [high64 bytes][low64 bytes], each in big-endian\n view.setBigUint64(0, high64, false); // high 64 bits, big-endian\n view.setBigUint64(8, low64, false); // low 64 bits, big-endian\n return result;\n}\n"],"names":["n","hexToBytes","hex","bytes","i"],"mappings":"aAIA,MAAMA,EAAKA,GAAM,OAAOA,CAAC,EACPA,EAAE,YAAY,EACdA,EAAE,YAAY,EACdA,EAAE,YAAY,EACdA,EAAE,oBAAoB,EACtBA,EAAE,oBAAoB,EACtBA,EAAE,oBAAoB,EACtBA,EAAE,oBAAoB,EACtBA,EAAE,oBAAoB,EACtBA,EAAE,oBAAoB,EACtBA,EAAE,oBAAoB,EAExC,SAASC,EAAWC,EAAK,CACrB,MAAMC,EAAQ,IAAI,WAAWD,EAAI,OAAS,CAAC,EAC3C,QAASE,EAAI,EAAGA,EAAIF,EAAI,OAAQE,GAAK,EACjCD,EAAMC,EAAI,CAAC,EAAI,SAASF,EAAI,UAAUE,EAAGA,EAAI,CAAC,EAAG,EAAE,EAEvD,OAAOD,CACX,CACaF,EAAW,kYAAkY,GACzYD,EAAE,CAAC,GAAKA,EAAE,GAAG,GAAKA,EAAE,CAAC,GACtBA,EAAE,CAAC,GAAKA,EAAE,EAAE,GAAKA,EAAE,CAAC,GACpBA,EAAE,CAAC,GAAKA,EAAE,EAAE,GAAKA,EAAE,CAAC","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/xxhash/xxhash.es.js DELETED Viewed

@@ -1,22 +0,0 @@
-const c = (b) => BigInt(b);
-c("0x9E3779B1");
-c("0x85EBCA77");
-c("0xC2B2AE3D");
-c("0x9E3779B185EBCA87");
-c("0xC2B2AE3D27D4EB4F");
-c("0x165667B19E3779F9");
-c("0x85EBCA77C2B2AE63");
-c("0x27D4EB2F165667C5");
-c("0x165667919E3779F9");
-c("0x9FB21C651E98DF25");
-function f(b) {
-  const d = new Uint8Array(b.length / 2);
-  for (let e = 0; e < b.length; e += 2)
-    d[e / 2] = parseInt(b.substring(e, e + 2), 16);
-  return d;
-}
-f("b8fe6c3923a44bbe7c01812cf721ad1cded46de9839097db7240a4a4b7b3671fcb79e64eccc0e578825ad07dccff7221b8084674f743248ee03590e6813a264c3c2852bb91c300cb88d0658b1b532ea371644897a20df94e3819ef46a9deacd8a8fa763fe39c343ff9dcbbc7c70b4f1d8a51e04bcdb45931c89f7ec9d9787364eac5ac8334d3ebc3c581a0fffa1363eb170ddd51b7f0da49d316552629d4689e2b16be587d47a1fc8ff8b8d17ad031ce45cb3a8f95160428afd7fbcabb4b407e");
-(c(1) << c(128)) - c(1);
-(c(1) << c(64)) - c(1);
-(c(1) << c(32)) - c(1);
-//# sourceMappingURL=xxhash.es.js.map

package/dist/node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/xxhash/xxhash.es.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"xxhash.es.js","sources":["../../../../../../../../../node_modules/.pnpm/langsmith@0.5.10_openai@6.16.0_zod@4.3.5_/node_modules/langsmith/dist/utils/xxhash/xxhash.js"],"sourcesContent":["// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-nocheck\n// Original from: https://github.com/i404788/xxh3-ts\n// Vendored for compatibility (remove Buffer use in favor of Uint8Array)\nconst n = (n) => BigInt(n);\nconst PRIME32_1 = n(\"0x9E3779B1\"); // 0b10011110001101110111100110110001\nconst PRIME32_2 = n(\"0x85EBCA77\"); // 0b10000101111010111100101001110111\nconst PRIME32_3 = n(\"0xC2B2AE3D\"); // 0b11000010101100101010111000111101\nconst PRIME64_1 = n(\"0x9E3779B185EBCA87\"); // 0b1001111000110111011110011011000110000101111010111100101010000111\nconst PRIME64_2 = n(\"0xC2B2AE3D27D4EB4F\"); // 0b1100001010110010101011100011110100100111110101001110101101001111\nconst PRIME64_3 = n(\"0x165667B19E3779F9\"); // 0b0001011001010110011001111011000110011110001101110111100111111001\nconst PRIME64_4 = n(\"0x85EBCA77C2B2AE63\"); // 0b1000010111101011110010100111011111000010101100101010111001100011\nconst PRIME64_5 = n(\"0x27D4EB2F165667C5\"); // 0b0010011111010100111010110010111100010110010101100110011111000101\nconst PRIME_MX1 = n(\"0x165667919E3779F9\"); // 0b0001011001010110011001111001000110011110001101110111100111111001\nconst PRIME_MX2 = n(\"0x9FB21C651E98DF25\"); // 0b1001111110110010000111000110010100011110100110001101111100100101\n// Convert hex string to Uint8Array\nfunction hexToBytes(hex) {\n const bytes = new Uint8Array(hex.length / 2);\n for (let i = 0; i < hex.length; i += 2) {\n bytes[i / 2] = parseInt(hex.substring(i, i + 2), 16);\n }\n return bytes;\n}\nconst kkey = hexToBytes(\"b8fe6c3923a44bbe7c01812cf721ad1cded46de9839097db7240a4a4b7b3671fcb79e64eccc0e578825ad07dccff7221b8084674f743248ee03590e6813a264c3c2852bb91c300cb88d0658b1b532ea371644897a20df94e3819ef46a9deacd8a8fa763fe39c343ff9dcbbc7c70b4f1d8a51e04bcdb45931c89f7ec9d9787364eac5ac8334d3ebc3c581a0fffa1363eb170ddd51b7f0da49d316552629d4689e2b16be587d47a1fc8ff8b8d17ad031ce45cb3a8f95160428afd7fbcabb4b407e\");\nconst mask128 = (n(1) << n(128)) - n(1);\nconst mask64 = (n(1) << n(64)) - n(1);\nconst mask32 = (n(1) << n(32)) - n(1);\nconst STRIPE_LEN = 64;\nconst ACC_NB = STRIPE_LEN / 8;\nconst _U64 = 8;\nconst _U32 = 4;\n// Create a view into a Uint8Array at an offset\nfunction getView(buf, offset = 0) {\n return new Uint8Array(buf.buffer, buf.byteOffset + offset, buf.length - offset);\n}\n// Read BigInt from Uint8Array in little-endian\nfunction readBigUInt64LE(buf, offset = 0) {\n const view = new DataView(buf.buffer, buf.byteOffset + offset);\n return view.getBigUint64(0, true);\n}\n// Read UInt32 from Uint8Array in little-endian\nfunction readUInt32LE(buf, offset = 0) {\n const view = new DataView(buf.buffer, buf.byteOffset + offset);\n return view.getUint32(0, true);\n}\n// Read UInt8 from Uint8Array\nfunction readUInt8(buf, offset = 0) {\n return buf[offset];\n}\nconst bswap64 = (a) => {\n return (((a & n(0xff)) << n(56)) |\n ((a & n(0xff00)) << n(40)) |\n ((a & n(0xff0000)) << n(24)) |\n ((a & n(0xff000000)) << n(8)) |\n ((a & n(0xff00000000)) >> n(8)) |\n ((a & n(0xff0000000000)) >> n(24)) |\n ((a & n(0xff000000000000)) >> n(40)) |\n ((a & n(0xff00000000000000)) >> n(56)));\n};\nconst bswap32 = (a) => {\n a = ((a & n(0x0000ffff)) << n(16)) | ((a & n(0xffff0000)) >> n(16));\n a = ((a & n(0x00ff00ff)) << n(8)) | ((a & n(0xff00ff00)) >> n(8));\n return a;\n};\nconst XXH_mult32to64 = (a, b) => ((a & mask32) * (b & mask32)) & mask64;\nconst assert = (a) => {\n if (!a)\n throw new Error(\"Assert failed\");\n};\nfunction rotl32(a, b) {\n return ((a << b) | (a >> (n(32) - b))) & mask32;\n}\nfunction XXH3_accumulate_512(acc, data, key) {\n for (let i = 0; i < ACC_NB; i++) {\n const data_val = readBigUInt64LE(data, i * 8);\n const data_key = data_val ^ readBigUInt64LE(key, i * 8);\n acc[i ^ 1] += data_val;\n acc[i] += XXH_mult32to64(data_key, data_key >> n(32));\n }\n return acc;\n}\nfunction XXH3_accumulate(acc, data, key, nbStripes) {\n for (let n = 0; n < nbStripes; n++) {\n XXH3_accumulate_512(acc, getView(data, n * STRIPE_LEN), getView(key, n * 8));\n }\n return acc;\n}\nfunction XXH3_scrambleAcc(acc, key) {\n for (let i = 0; i < ACC_NB; i++) {\n const key64 = readBigUInt64LE(key, i * 8);\n let acc64 = acc[i];\n acc64 = xorshift64(acc64, n(47));\n acc64 ^= key64;\n acc64 *= PRIME32_1;\n acc[i] = acc64 & mask64;\n }\n return acc;\n}\nfunction XXH3_mix2Accs(acc, key) {\n return XXH3_mul128_fold64(acc[0] ^ readBigUInt64LE(key, 0), acc[1] ^ readBigUInt64LE(key, _U64));\n}\nfunction XXH3_mergeAccs(acc, key, start) {\n let result64 = start;\n result64 += XXH3_mix2Accs(acc.slice(0), getView(key, 0 * _U32));\n result64 += XXH3_mix2Accs(acc.slice(2), getView(key, 4 * _U32));\n result64 += XXH3_mix2Accs(acc.slice(4), getView(key, 8 * _U32));\n result64 += XXH3_mix2Accs(acc.slice(6), getView(key, 12 * _U32));\n return XXH3_avalanche(result64 & mask64);\n}\nfunction XXH3_hashLong(acc, data, secret, f_acc, f_scramble) {\n const nbStripesPerBlock = Math.floor((secret.byteLength - STRIPE_LEN) / 8);\n const block_len = STRIPE_LEN * nbStripesPerBlock;\n const nb_blocks = Math.floor((data.byteLength - 1) / block_len);\n for (let n = 0; n < nb_blocks; n++) {\n acc = XXH3_accumulate(acc, getView(data, n * block_len), secret, nbStripesPerBlock);\n acc = f_scramble(acc, getView(secret, secret.byteLength - STRIPE_LEN));\n }\n {\n // Partial block\n const nbStripes = Math.floor((data.byteLength - 1 - block_len * nb_blocks) / STRIPE_LEN);\n acc = XXH3_accumulate(acc, getView(data, nb_blocks * block_len), secret, nbStripes);\n // Last Stripe\n acc = f_acc(acc, getView(data, data.byteLength - STRIPE_LEN), getView(secret, secret.byteLength - STRIPE_LEN - 7));\n }\n return acc;\n}\nfunction XXH3_hashLong_128b(data, secret, seed) {\n let acc = new BigUint64Array([\n PRIME32_3,\n PRIME64_1,\n PRIME64_2,\n PRIME64_3,\n PRIME64_4,\n PRIME32_2,\n PRIME64_5,\n PRIME32_1,\n ]);\n assert(data.length > 128);\n acc = XXH3_hashLong(acc, data, secret, XXH3_accumulate_512, XXH3_scrambleAcc);\n /* converge into final hash */\n assert(acc.length * 8 == 64);\n {\n const low64 = XXH3_mergeAccs(acc, getView(secret, 11), (n(data.byteLength) * PRIME64_1) & mask64);\n const high64 = XXH3_mergeAccs(acc, getView(secret, secret.byteLength - STRIPE_LEN - 11), ~(n(data.byteLength) * PRIME64_2) & mask64);\n return (high64 << n(64)) | low64;\n }\n}\nfunction XXH3_mul128_fold64(a, b) {\n const lll = (a * b) & mask128;\n return (lll & mask64) ^ (lll >> n(64));\n}\nfunction XXH3_mix16B(data, key, seed) {\n return XXH3_mul128_fold64((readBigUInt64LE(data, 0) ^ (readBigUInt64LE(key, 0) + seed)) & mask64, (readBigUInt64LE(data, 8) ^ (readBigUInt64LE(key, 8) - seed)) & mask64);\n}\nfunction XXH3_mix32B(acc, data1, data2, key, seed) {\n let accl = acc & mask64;\n let acch = (acc >> n(64)) & mask64;\n accl += XXH3_mix16B(data1, key, seed);\n accl ^= readBigUInt64LE(data2, 0) + readBigUInt64LE(data2, 8);\n accl &= mask64;\n acch += XXH3_mix16B(data2, getView(key, 16), seed);\n acch ^= readBigUInt64LE(data1, 0) + readBigUInt64LE(data1, 8);\n acch &= mask64;\n return (acch << n(64)) | accl;\n}\nfunction XXH3_avalanche(h64) {\n h64 ^= h64 >> n(37);\n h64 *= PRIME_MX1;\n h64 &= mask64;\n h64 ^= h64 >> n(32);\n return h64;\n}\nfunction XXH3_avalanche64(h64) {\n h64 ^= h64 >> n(33);\n h64 *= PRIME64_2;\n h64 &= mask64;\n h64 ^= h64 >> n(29);\n h64 *= PRIME64_3;\n h64 &= mask64;\n h64 ^= h64 >> n(32);\n return h64;\n}\nfunction XXH3_len_1to3_128b(data, key32, seed) {\n const len = data.byteLength;\n assert(len > 0 && len <= 3);\n const combined = n(readUInt8(data, len - 1)) |\n n(len << 8) |\n n(readUInt8(data, 0) << 16) |\n n(readUInt8(data, len >> 1) << 24);\n const blow = (n(readUInt32LE(key32, 0)) ^ n(readUInt32LE(key32, 4))) + seed;\n const low = (combined ^ blow) & mask64;\n const bhigh = (n(readUInt32LE(key32, 8)) ^ n(readUInt32LE(key32, 12))) - seed;\n const high = (rotl32(bswap32(combined), n(13)) ^ bhigh) & mask64;\n return ((XXH3_avalanche64(high) & mask64) << n(64)) | XXH3_avalanche64(low);\n}\nfunction xorshift64(b, shift) {\n return b ^ (b >> shift);\n}\nfunction XXH3_len_4to8_128b(data, key32, seed) {\n const len = data.byteLength;\n assert(len >= 4 && len <= 8);\n {\n const l1 = readUInt32LE(data, 0);\n const l2 = readUInt32LE(data, len - 4);\n const l64 = n(l1) | (n(l2) << n(32));\n const bitflip = ((readBigUInt64LE(key32, 16) ^ readBigUInt64LE(key32, 24)) + seed) &\n mask64;\n const keyed = l64 ^ bitflip;\n let m128 = (keyed * (PRIME64_1 + (n(len) << n(2)))) & mask128;\n m128 += (m128 & mask64) << n(65);\n m128 &= mask128;\n m128 ^= m128 >> n(67);\n return (xorshift64((xorshift64(m128 & mask64, n(35)) * PRIME_MX2) & mask64, n(28)) |\n (XXH3_avalanche(m128 >> n(64)) << n(64)));\n }\n}\nfunction XXH3_len_9to16_128b(data, key64, seed) {\n const len = data.byteLength;\n assert(len >= 9 && len <= 16);\n {\n const bitflipl = ((readBigUInt64LE(key64, 32) ^ readBigUInt64LE(key64, 40)) + seed) &\n mask64;\n const bitfliph = ((readBigUInt64LE(key64, 48) ^ readBigUInt64LE(key64, 56)) - seed) &\n mask64;\n const ll1 = readBigUInt64LE(data);\n let ll2 = readBigUInt64LE(data, len - 8);\n let m128 = (ll1 ^ ll2 ^ bitflipl) * PRIME64_1;\n const m128_l = (m128 & mask64) + (n(len - 1) << n(54));\n m128 = (m128 & (mask128 ^ mask64)) | m128_l; // eqv. to adding only to lower 64b\n ll2 ^= bitfliph;\n m128 += (ll2 + (ll2 & mask32) * (PRIME32_2 - n(1))) << n(64);\n m128 &= mask128;\n m128 ^= bswap64(m128 >> n(64));\n let h128 = (m128 & mask64) * PRIME64_2;\n h128 += ((m128 >> n(64)) * PRIME64_2) << n(64);\n h128 &= mask128;\n return (XXH3_avalanche(h128 & mask64) | (XXH3_avalanche(h128 >> n(64)) << n(64)));\n }\n}\nfunction XXH3_len_0to16_128b(data, seed) {\n const len = data.byteLength;\n assert(len <= 16);\n if (len > 8)\n return XXH3_len_9to16_128b(data, kkey, seed);\n if (len >= 4)\n return XXH3_len_4to8_128b(data, kkey, seed);\n if (len > 0)\n return XXH3_len_1to3_128b(data, kkey, seed);\n return (XXH3_avalanche64(seed ^ readBigUInt64LE(kkey, 64) ^ readBigUInt64LE(kkey, 72)) |\n (XXH3_avalanche64(seed ^ readBigUInt64LE(kkey, 80) ^ readBigUInt64LE(kkey, 88)) <<\n n(64)));\n}\nfunction inv64(x) {\n // NOTE: `AND` fixes signedness (but because of 2's complement we need to re-add 1)\n return (~x + n(1)) & mask64;\n}\nfunction XXH3_len_17to128_128b(data, secret, seed) {\n let acc = (n(data.byteLength) * PRIME64_1) & mask64;\n let i = n(data.byteLength - 1) / n(32);\n while (i >= 0) {\n const ni = Number(i);\n acc = XXH3_mix32B(acc, getView(data, 16 * ni), getView(data, data.byteLength - 16 * (ni + 1)), getView(secret, 32 * ni), seed);\n i--;\n }\n let h128l = (acc + (acc >> n(64))) & mask64;\n h128l = XXH3_avalanche(h128l);\n let h128h = (acc & mask64) * PRIME64_1 +\n (acc >> n(64)) * PRIME64_4 +\n ((n(data.byteLength) - seed) & mask64) * PRIME64_2;\n h128h &= mask64;\n h128h = inv64(XXH3_avalanche(h128h));\n return h128l | (h128h << n(64));\n}\nfunction XXH3_len_129to240_128b(data, secret, seed) {\n let acc = (n(data.byteLength) * PRIME64_1) & mask64;\n for (let i = 32; i < 160; i += 32) {\n acc = XXH3_mix32B(acc, getView(data, i - 32), getView(data, i - 16), getView(secret, i - 32), seed);\n }\n acc = XXH3_avalanche(acc & mask64) | (XXH3_avalanche(acc >> n(64)) << n(64));\n for (let i = 160; i <= data.byteLength; i += 32) {\n acc = XXH3_mix32B(acc, getView(data, i - 32), getView(data, i - 16), getView(secret, 3 + i - 160), seed);\n }\n acc = XXH3_mix32B(acc, getView(data, data.byteLength - 16), getView(data, data.byteLength - 32), getView(secret, 136 - 17 - 16), inv64(seed));\n let h128l = (acc + (acc >> n(64))) & mask64;\n h128l = XXH3_avalanche(h128l);\n let h128h = (acc & mask64) * PRIME64_1 +\n (acc >> n(64)) * PRIME64_4 +\n ((n(data.byteLength) - seed) & mask64) * PRIME64_2;\n h128h &= mask64;\n h128h = inv64(XXH3_avalanche(h128h));\n return h128l | (h128h << n(64));\n}\n/**\n * Compute XXH3 128-bit hash of the input data.\n *\n * @param data - Input data as Uint8Array\n * @param seed - Optional seed value (default: 0)\n * @returns 128-bit hash as a single BigInt (high 64 bits << 64 | low 64 bits)\n */\nexport function XXH3_128(data, seed = n(0)) {\n const len = data.byteLength;\n if (len <= 16)\n return XXH3_len_0to16_128b(data, seed);\n if (len <= 128)\n return XXH3_len_17to128_128b(data, kkey, seed);\n if (len <= 240)\n return XXH3_len_129to240_128b(data, kkey, seed);\n return XXH3_hashLong_128b(data, kkey, seed);\n}\n/**\n * Convert a 128-bit hash (BigInt) to a 16-byte Uint8Array.\n *\n * @param hash128 - 128-bit hash as BigInt\n * @returns 16-byte Uint8Array in little-endian byte order\n */\nexport function xxh128ToBytes(hash128) {\n const result = new Uint8Array(16);\n const view = new DataView(result.buffer);\n // Extract low and high 64-bit values\n const low64 = hash128 & mask64;\n const high64 = hash128 >> n(64);\n // Write in big-endian order to match Python's xxhash.digest() output\n // Python outputs: [high64 bytes][low64 bytes], each in big-endian\n view.setBigUint64(0, high64, false); // high 64 bits, big-endian\n view.setBigUint64(8, low64, false); // low 64 bits, big-endian\n return result;\n}\n"],"names":["n","hexToBytes","hex","bytes","i"],"mappings":"AAIA,MAAMA,IAAI,CAACA,MAAM,OAAOA,CAAC;AACPA,EAAE,YAAY;AACdA,EAAE,YAAY;AACdA,EAAE,YAAY;AACdA,EAAE,oBAAoB;AACtBA,EAAE,oBAAoB;AACtBA,EAAE,oBAAoB;AACtBA,EAAE,oBAAoB;AACtBA,EAAE,oBAAoB;AACtBA,EAAE,oBAAoB;AACtBA,EAAE,oBAAoB;AAExC,SAASC,EAAWC,GAAK;AACrB,QAAMC,IAAQ,IAAI,WAAWD,EAAI,SAAS,CAAC;AAC3C,WAASE,IAAI,GAAGA,IAAIF,EAAI,QAAQE,KAAK;AACjC,IAAAD,EAAMC,IAAI,CAAC,IAAI,SAASF,EAAI,UAAUE,GAAGA,IAAI,CAAC,GAAG,EAAE;AAEvD,SAAOD;AACX;AACaF,EAAW,kYAAkY;AAAA,CACzYD,EAAE,CAAC,KAAKA,EAAE,GAAG,KAAKA,EAAE,CAAC;AAAA,CACtBA,EAAE,CAAC,KAAKA,EAAE,EAAE,KAAKA,EAAE,CAAC;AAAA,CACpBA,EAAE,CAAC,KAAKA,EAAE,EAAE,KAAKA,EAAE,CAAC;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.cjs.js DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var i,u;function a(){return u\|\|(u=1,i=(n,e)=>(e=e\|\|(()=>{}),n.then(r=>new Promise(t=>{t(e())}).then(()=>r),r=>new Promise(t=>{t(e())}).then(()=>{throw r})))),i}exports.__require=a;
2	- //# sourceMappingURL=index.cjs.js.map

package/dist/node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.cjs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.cjs.js","sources":["../../../../../../node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.js"],"sourcesContent":["'use strict';\nmodule.exports = (promise, onFinally) => {\n\tonFinally = onFinally || (() => {});\n\n\treturn promise.then(\n\t\tval => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => val),\n\t\terr => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => {\n\t\t\tthrow err;\n\t\t})\n\t);\n};\n"],"names":["pFinally","promise","onFinally","val","resolve","err"],"mappings":"oHACAA,EAAiB,CAACC,EAASC,KAC1BA,EAAYA,IAAc,IAAM,IAEzBD,EAAQ,KACdE,GAAO,IAAI,QAAQC,GAAW,CAC7BA,EAAQF,EAAS,CAAE,CACtB,CAAG,EAAE,KAAK,IAAMC,CAAG,EACjBE,GAAO,IAAI,QAAQD,GAAW,CAC7BA,EAAQF,EAAS,CAAE,CACtB,CAAG,EAAE,KAAK,IAAM,CACb,MAAMG,CACT,CAAG","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.es.js DELETED Viewed

@@ -1,18 +0,0 @@
-var i, n;
-function h() {
-  return n || (n = 1, i = (u, e) => (e = e || (() => {
-  }), u.then(
-    (r) => new Promise((t) => {
-      t(e());
-    }).then(() => r),
-    (r) => new Promise((t) => {
-      t(e());
-    }).then(() => {
-      throw r;
-    })
-  ))), i;
-}
-export {
-  h as __require
-};
-//# sourceMappingURL=index.es.js.map

package/dist/node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.es.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.es.js","sources":["../../../../../../node_modules/.pnpm/p-finally@1.0.0/node_modules/p-finally/index.js"],"sourcesContent":["'use strict';\nmodule.exports = (promise, onFinally) => {\n\tonFinally = onFinally || (() => {});\n\n\treturn promise.then(\n\t\tval => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => val),\n\t\terr => new Promise(resolve => {\n\t\t\tresolve(onFinally());\n\t\t}).then(() => {\n\t\t\tthrow err;\n\t\t})\n\t);\n};\n"],"names":["pFinally","promise","onFinally","val","resolve","err"],"mappings":";;sBACAA,IAAiB,CAACC,GAASC,OAC1BA,IAAYA,MAAc,MAAM;AAAA,MAEzBD,EAAQ;AAAA,IACd,CAAAE,MAAO,IAAI,QAAQ,CAAAC,MAAW;AAC7B,MAAAA,EAAQF,EAAS,CAAE;AAAA,IACtB,CAAG,EAAE,KAAK,MAAMC,CAAG;AAAA,IACjB,CAAAE,MAAO,IAAI,QAAQ,CAAAD,MAAW;AAC7B,MAAAA,EAAQF,EAAS,CAAE;AAAA,IACtB,CAAG,EAAE,KAAK,MAAM;AACb,YAAMG;AAAA,IACT,CAAG;AAAA;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/p-queue@6.6.2/node_modules/p-queue/dist/index.cjs.js DELETED Viewed

	@@ -1,2 +0,0 @@
1	- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const u=require("../../../../../../_virtual/index.cjs5.js"),c=require("../../../../eventemitter3@4.0.7/node_modules/eventemitter3/index.cjs.js"),f=require("../../../../p-timeout@3.2.0/node_modules/p-timeout/index.cjs.js"),m=require("./priority-queue.cjs.js");var l;function y(){if(l)return u.__exports;l=1,Object.defineProperty(u.__exports,"__esModule",{value:!0});const _=c.__require(),o=f.__require(),h=m.__require(),s=()=>{},d=new o.TimeoutError;class v extends _{constructor(e){var t,r,i,n;if(super(),this._intervalCount=0,this._intervalEnd=0,this._pendingCount=0,this._resolveEmpty=s,this._resolveIdle=s,e=Object.assign({carryoverConcurrencyCount:!1,intervalCap:1/0,interval:0,concurrency:1/0,autoStart:!0,queueClass:h.default},e),!(typeof e.intervalCap=="number"&&e.intervalCap>=1))throw new TypeError(`Expected \`intervalCap\` to be a number from 1 and up, got \`${(r=(t=e.intervalCap)===null\|\|t===void 0?void 0:t.toString())!==null&&r!==void 0?r:""}\` (${typeof e.intervalCap})`);if(e.interval===void 0\|\|!(Number.isFinite(e.interval)&&e.interval>=0))throw new TypeError(`Expected \`interval\` to be a finite number >= 0, got \`${(n=(i=e.interval)===null\|\|i===void 0?void 0:i.toString())!==null&&n!==void 0?n:""}\` (${typeof e.interval})`);this._carryoverConcurrencyCount=e.carryoverConcurrencyCount,this._isIntervalIgnored=e.intervalCap===1/0\|\|e.interval===0,this._intervalCap=e.intervalCap,this._interval=e.interval,this._queue=new e.queueClass,this._queueClass=e.queueClass,this.concurrency=e.concurrency,this._timeout=e.timeout,this._throwOnTimeout=e.throwOnTimeout===!0,this._isPaused=e.autoStart===!1}get _doesIntervalAllowAnother(){return this._isIntervalIgnored\|\|this._intervalCount<this._intervalCap}get _doesConcurrentAllowAnother(){return this._pendingCount<this._concurrency}_next(){this._pendingCount--,this._tryToStartAnother(),this.emit("next")}_resolvePromises(){this._resolveEmpty(),this._resolveEmpty=s,this._pendingCount===0&&(this._resolveIdle(),this._resolveIdle=s,this.emit("idle"))}_onResumeInterval(){this._onInterval(),this._initializeIntervalIfNeeded(),this._timeoutId=void 0}_isIntervalPaused(){const e=Date.now();if(this._intervalId===void 0){const t=this._intervalEnd-e;if(t<0)this._intervalCount=this._carryoverConcurrencyCount?this._pendingCount:0;else return this._timeoutId===void 0&&(this._timeoutId=setTimeout(()=>{this._onResumeInterval()},t)),!0}return!1}_tryToStartAnother(){if(this._queue.size===0)return this._intervalId&&clearInterval(this._intervalId),this._intervalId=void 0,this._resolvePromises(),!1;if(!this._isPaused){const e=!this._isIntervalPaused();if(this._doesIntervalAllowAnother&&this._doesConcurrentAllowAnother){const t=this._queue.dequeue();return t?(this.emit("active"),t(),e&&this._initializeIntervalIfNeeded(),!0):!1}}return!1}_initializeIntervalIfNeeded(){this._isIntervalIgnored\|\|this._intervalId!==void 0\|\|(this._intervalId=setInterval(()=>{this._onInterval()},this._interval),this._intervalEnd=Date.now()+this._interval)}_onInterval(){this._intervalCount===0&&this._pendingCount===0&&this._intervalId&&(clearInterval(this._intervalId),this._intervalId=void 0),this._intervalCount=this._carryoverConcurrencyCount?this._pendingCount:0,this._processQueue()}_processQueue(){for(;this._tryToStartAnother(););}get concurrency(){return this._concurrency}set concurrency(e){if(!(typeof e=="number"&&e>=1))throw new TypeError(`Expected \`concurrency\` to be a number from 1 and up, got \`${e}\` (${typeof e})`);this._concurrency=e,this._processQueue()}async add(e,t={}){return new Promise((r,i)=>{const n=async()=>{this._pendingCount++,this._intervalCount++;try{const a=this._timeout===void 0&&t.timeout===void 0?e():o.default(Promise.resolve(e()),t.timeout===void 0?this._timeout:t.timeout,()=>{(t.throwOnTimeout===void 0?this._throwOnTimeout:t.throwOnTimeout)&&i(d)});r(await a)}catch(a){i(a)}this._next()};this._queue.enqueue(n,t),this._tryToStartAnother(),this.emit("add")})}async addAll(e,t){return Promise.all(e.map(async r=>this.add(r,t)))}start(){return this._isPaused?(this._isPaused=!1,this._processQueue(),this):this}pause(){this._isPaused=!0}clear(){this._queue=new this._queueClass}async onEmpty(){if(this._queue.size!==0)return new Promise(e=>{const t=this._resolveEmpty;this._resolveEmpty=()=>{t(),e()}})}async onIdle(){if(!(this._pendingCount===0&&this._queue.size===0))return new Promise(e=>{const t=this._resolveIdle;this._resolveIdle=()=>{t(),e()}})}get size(){return this._queue.size}sizeBy(e){return this._queue.filter(e).length}get pending(){return this._pendingCount}get isPaused(){return this._isPaused}get timeout(){return this._timeout}set timeout(e){this._timeout=e}}return u.__exports.default=v,u.__exports}exports.__require=y;
2	- //# sourceMappingURL=index.cjs.js.map