@langchain/core 1.1.24 → 1.1.25

package/dist/utils/json.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"json.cjs","names":["s: string","arr: unknown[]","obj: Record<string, unknown>"],"sources":["../../src/utils/json.ts"],"sourcesContent":["export function parseJsonMarkdown(s: string, parser = parsePartialJson) {\n  // eslint-disable-next-line no-param-reassign\n  s = s.trim();\n\n  const firstFenceIndex = s.indexOf(\"```\");\n  if (firstFenceIndex === -1) {\n    return parser(s);\n  }\n\n  let contentAfterFence = s.substring(firstFenceIndex + 3);\n\n  if (contentAfterFence.startsWith(\"json\\n\")) {\n    contentAfterFence = contentAfterFence.substring(5);\n  } else if (contentAfterFence.startsWith(\"json\")) {\n    contentAfterFence = contentAfterFence.substring(4);\n  } else if (contentAfterFence.startsWith(\"\\n\")) {\n    contentAfterFence = contentAfterFence.substring(1);\n  }\n\n  const closingFenceIndex = contentAfterFence.indexOf(\"```\");\n  let finalContent = contentAfterFence;\n  if (closingFenceIndex !== -1) {\n    finalContent = contentAfterFence.substring(0, closingFenceIndex);\n  }\n\n  return parser(finalContent.trim());\n}\n\n/**\n * Recursive descent partial JSON parser.\n * @param s - The string to parse.\n * @returns The parsed value.\n * @throws Error if the input is a malformed JSON string.\n */\nexport function strictParsePartialJson(s: string): unknown {\n  try {\n    return JSON.parse(s);\n  } catch {\n    // Continue to partial parsing\n  }\n\n  const buffer = s.trim();\n  if (buffer.length === 0) throw new Error(\"Unexpected end of JSON input\");\n\n  let pos = 0;\n\n  function skipWhitespace(): void {\n    while (pos < buffer.length && /\\s/.test(buffer[pos])) {\n      pos += 1;\n    }\n  }\n\n  function parseString(): string {\n    if (buffer[pos] !== '\"') {\n      throw new Error(`Expected '\"' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    pos += 1;\n    let result = \"\";\n    let escaped = false;\n\n    while (pos < buffer.length) {\n      const char = buffer[pos];\n\n      if (escaped) {\n        if (char === \"n\") {\n          result += \"\\n\";\n        } else if (char === \"t\") {\n          result += \"\\t\";\n        } else if (char === \"r\") {\n          result += \"\\r\";\n        } else if (char === \"\\\\\") {\n          result += \"\\\\\";\n        } else if (char === '\"') {\n          result += '\"';\n        } else if (char === \"b\") {\n          result += \"\\b\";\n        } else if (char === \"f\") {\n          result += \"\\f\";\n        } else if (char === \"/\") {\n          result += \"/\";\n        } else if (char === \"u\") {\n          const hex = buffer.substring(pos + 1, pos + 5);\n          if (/^[0-9A-Fa-f]{0,4}$/.test(hex)) {\n            if (hex.length === 4) {\n              result += String.fromCharCode(Number.parseInt(hex, 16));\n            } else {\n              result += `u${hex}`;\n            }\n\n            pos += hex.length;\n          } else {\n            throw new Error(\n              `Invalid unicode escape sequence '\\\\u${hex}' at position ${pos}`\n            );\n          }\n        } else {\n          throw new Error(\n            `Invalid escape sequence '\\\\${char}' at position ${pos}`\n          );\n        }\n        escaped = false;\n      } else if (char === \"\\\\\") {\n        escaped = true;\n      } else if (char === '\"') {\n        pos += 1;\n        return result;\n      } else {\n        result += char;\n      }\n\n      pos += 1;\n    }\n\n    if (escaped) result += \"\\\\\";\n    return result;\n  }\n\n  function parseNumber(): number {\n    const start = pos;\n    let numStr = \"\";\n\n    if (buffer[pos] === \"-\") {\n      numStr += \"-\";\n      pos += 1;\n    }\n\n    if (pos < buffer.length && buffer[pos] === \"0\") {\n      numStr += \"0\";\n      pos += 1;\n\n      if (buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        throw new Error(`Invalid number at position ${start}`);\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] >= \"1\" && buffer[pos] <= \"9\") {\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] === \".\") {\n      numStr += \".\";\n      pos += 1;\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && (buffer[pos] === \"e\" || buffer[pos] === \"E\")) {\n      numStr += buffer[pos];\n      pos += 1;\n      if (pos < buffer.length && (buffer[pos] === \"+\" || buffer[pos] === \"-\")) {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (numStr === \"-\") return -0;\n\n    const num = Number.parseFloat(numStr);\n\n    if (Number.isNaN(num)) {\n      pos = start;\n      throw new Error(`Invalid number '${numStr}' at position ${start}`);\n    }\n\n    return num;\n  }\n\n  function parseValue(): unknown {\n    skipWhitespace();\n\n    if (pos >= buffer.length) {\n      throw new Error(`Unexpected end of input at position ${pos}`);\n    }\n\n    const char = buffer[pos];\n\n    if (char === \"{\") return parseObject();\n    if (char === \"[\") return parseArray();\n    if (char === '\"') return parseString();\n\n    if (\"null\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return null;\n    }\n\n    if (\"true\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return true;\n    }\n\n    if (\"false\".startsWith(buffer.substring(pos, pos + 5))) {\n      pos += Math.min(5, buffer.length - pos);\n      return false;\n    }\n\n    if (char === \"-\" || (char >= \"0\" && char <= \"9\")) {\n      return parseNumber();\n    }\n\n    throw new Error(`Unexpected character '${char}' at position ${pos}`);\n  }\n\n  function parseArray(): unknown[] {\n    if (buffer[pos] !== \"[\") {\n      throw new Error(`Expected '[' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const arr: unknown[] = [];\n\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return arr;\n    if (buffer[pos] === \"]\") {\n      pos += 1;\n      return arr;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      arr.push(parseValue());\n\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      if (buffer[pos] === \"]\") {\n        pos += 1;\n        return arr;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or ']' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return arr;\n  }\n\n  function parseObject(): Record<string, unknown> {\n    if (buffer[pos] !== \"{\") {\n      throw new Error(`Expected '{' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const obj: Record<string, unknown> = {};\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return obj;\n    if (buffer[pos] === \"}\") {\n      pos += 1;\n      return obj;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      const key = parseString();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] !== \":\") {\n        throw new Error(\n          `Expected ':' at position ${pos}, got '${buffer[pos]}'`\n        );\n      }\n      pos += 1;\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      obj[key] = parseValue();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] === \"}\") {\n        pos += 1;\n        return obj;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or '}' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return obj;\n  }\n\n  const value = parseValue();\n  skipWhitespace();\n\n  if (pos < buffer.length) {\n    throw new Error(`Unexpected character '${buffer[pos]}' at position ${pos}`);\n  }\n\n  return value;\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function parsePartialJson(s: string): any | null {\n  // Attempt to parse the modified string as JSON.\n  try {\n    if (typeof s === \"undefined\") return null;\n    return strictParsePartialJson(s);\n  } catch {\n    // If we still can't parse the string as JSON, return null to indicate failure.\n    return null;\n  }\n}\n"],"mappings":";;AAAA,SAAgB,kBAAkBA,GAAW,SAAS,kBAAkB;CAEtE,IAAI,EAAE,MAAM;CAEZ,MAAM,kBAAkB,EAAE,QAAQ,MAAM;AACxC,KAAI,oBAAoB,GACtB,QAAO,OAAO,EAAE;CAGlB,IAAI,oBAAoB,EAAE,UAAU,kBAAkB,EAAE;AAExD,KAAI,kBAAkB,WAAW,SAAS,EACxC,oBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,OAAO,EAC7C,oBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,KAAK,EAC3C,oBAAoB,kBAAkB,UAAU,EAAE;CAGpD,MAAM,oBAAoB,kBAAkB,QAAQ,MAAM;CAC1D,IAAI,eAAe;AACnB,KAAI,sBAAsB,IACxB,eAAe,kBAAkB,UAAU,GAAG,kBAAkB;AAGlE,QAAO,OAAO,aAAa,MAAM,CAAC;AACnC;;;;;;;AAQD,SAAgB,uBAAuBA,GAAoB;AACzD,KAAI;AACF,SAAO,KAAK,MAAM,EAAE;CACrB,QAAO,CAEP;CAED,MAAM,SAAS,EAAE,MAAM;AACvB,KAAI,OAAO,WAAW,EAAG,OAAM,IAAI,MAAM;CAEzC,IAAI,MAAM;CAEV,SAAS,iBAAuB;AAC9B,SAAO,MAAM,OAAO,UAAU,KAAK,KAAK,OAAO,KAAK,EAClD,OAAO;CAEV;CAED,SAAS,cAAsB;AAC7B,MAAI,OAAO,SAAS,KAClB,OAAM,IAAI,MAAM,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAGzE,OAAO;EACP,IAAI,SAAS;EACb,IAAI,UAAU;AAEd,SAAO,MAAM,OAAO,QAAQ;GAC1B,MAAM,OAAO,OAAO;AAEpB,OAAI,SAAS;AACX,QAAI,SAAS,KACX,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,MAClB,UAAU;aACD,SAAS,MAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAAK;KACvB,MAAM,MAAM,OAAO,UAAU,MAAM,GAAG,MAAM,EAAE;AAC9C,SAAI,qBAAqB,KAAK,IAAI,EAAE;AAClC,UAAI,IAAI,WAAW,GACjB,UAAU,OAAO,aAAa,OAAO,SAAS,KAAK,GAAG,CAAC;WAEvD,UAAU,CAAC,CAAC,EAAE,KAAK;MAGrB,OAAO,IAAI;KACZ,MACC,OAAM,IAAI,MACR,CAAC,oCAAoC,EAAE,IAAI,cAAc,EAAE,KAAK;IAGrE,MACC,OAAM,IAAI,MACR,CAAC,2BAA2B,EAAE,KAAK,cAAc,EAAE,KAAK;IAG5D,UAAU;GACX,WAAU,SAAS,MAClB,UAAU;YACD,SAAS,MAAK;IACvB,OAAO;AACP,WAAO;GACR,OACC,UAAU;GAGZ,OAAO;EACR;AAED,MAAI,SAAS,UAAU;AACvB,SAAO;CACR;CAED,SAAS,cAAsB;EAC7B,MAAM,QAAQ;EACd,IAAI,SAAS;AAEb,MAAI,OAAO,SAAS,KAAK;GACvB,UAAU;GACV,OAAO;EACR;AAED,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;GAC9C,UAAU;GACV,OAAO;AAEP,OAAI,OAAO,QAAQ,OAAO,OAAO,QAAQ,IACvC,OAAM,IAAI,MAAM,CAAC,2BAA2B,EAAE,OAAO;EAExD;AAED,MAAI,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,IAC9D,QAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;GACtE,UAAU,OAAO;GACjB,OAAO;EACR;AAGH,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;GAC9C,UAAU;GACV,OAAO;AACP,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;IACtE,UAAU,OAAO;IACjB,OAAO;GACR;EACF;AAED,MAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;GACvE,UAAU,OAAO;GACjB,OAAO;AACP,OAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;IACvE,UAAU,OAAO;IACjB,OAAO;GACR;AACD,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;IACtE,UAAU,OAAO;IACjB,OAAO;GACR;EACF;AAED,MAAI,WAAW,IAAK,QAAO;EAE3B,MAAM,MAAM,OAAO,WAAW,OAAO;AAErC,MAAI,OAAO,MAAM,IAAI,EAAE;GACrB,MAAM;AACN,SAAM,IAAI,MAAM,CAAC,gBAAgB,EAAE,OAAO,cAAc,EAAE,OAAO;EAClE;AAED,SAAO;CACR;CAED,SAAS,aAAsB;EAC7B,gBAAgB;AAEhB,MAAI,OAAO,OAAO,OAChB,OAAM,IAAI,MAAM,CAAC,oCAAoC,EAAE,KAAK;EAG9D,MAAM,OAAO,OAAO;AAEpB,MAAI,SAAS,IAAK,QAAO,aAAa;AACtC,MAAI,SAAS,IAAK,QAAO,YAAY;AACrC,MAAI,SAAS,KAAK,QAAO,aAAa;AAEtC,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;GACrD,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;EACR;AAED,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;GACrD,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;EACR;AAED,MAAI,QAAQ,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;GACtD,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;EACR;AAED,MAAI,SAAS,OAAQ,QAAQ,OAAO,QAAQ,IAC1C,QAAO,aAAa;AAGtB,QAAM,IAAI,MAAM,CAAC,sBAAsB,EAAE,KAAK,cAAc,EAAE,KAAK;CACpE;CAED,SAAS,aAAwB;AAC/B,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAGzE,MAAMC,MAAiB,CAAE;EAEzB,OAAO;EACP,gBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;GACvB,OAAO;AACP,UAAO;EACR;AAED,SAAO,MAAM,OAAO,QAAQ;GAC1B,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,IAAI,KAAK,YAAY,CAAC;GAEtB,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;IACvB,OAAO;AACP,WAAO;GACR,WAAU,OAAO,SAAS,KAAK;IAC9B,OAAO;AACP;GACD;AAED,SAAM,IAAI,MACR,CAAC,gCAAgC,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAEjE;AAED,SAAO;CACR;CAED,SAAS,cAAuC;AAC9C,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAGzE,MAAMC,MAA+B,CAAE;EACvC,OAAO;EACP,gBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;GACvB,OAAO;AACP,UAAO;EACR;AAED,SAAO,MAAM,OAAO,QAAQ;GAC1B,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,MAAM,MAAM,aAAa;GAEzB,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MACR,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;GAG3D,OAAO;GAEP,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,IAAI,OAAO,YAAY;GAEvB,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;IACvB,OAAO;AACP,WAAO;GACR,WAAU,OAAO,SAAS,KAAK;IAC9B,OAAO;AACP;GACD;AAED,SAAM,IAAI,MACR,CAAC,gCAAgC,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAEjE;AAED,SAAO;CACR;CAED,MAAM,QAAQ,YAAY;CAC1B,gBAAgB;AAEhB,KAAI,MAAM,OAAO,OACf,OAAM,IAAI,MAAM,CAAC,sBAAsB,EAAE,OAAO,KAAK,cAAc,EAAE,KAAK;AAG5E,QAAO;AACR;AAGD,SAAgB,iBAAiBF,GAAuB;AAEtD,KAAI;AACF,MAAI,OAAO,MAAM,YAAa,QAAO;AACrC,SAAO,uBAAuB,EAAE;CACjC,QAAO;AAEN,SAAO;CACR;AACF"}
+{"version":3,"file":"json.cjs","names":[],"sources":["../../src/utils/json.ts"],"sourcesContent":["export function parseJsonMarkdown(s: string, parser = parsePartialJson) {\n  // eslint-disable-next-line no-param-reassign\n  s = s.trim();\n\n  const firstFenceIndex = s.indexOf(\"```\");\n  if (firstFenceIndex === -1) {\n    return parser(s);\n  }\n\n  let contentAfterFence = s.substring(firstFenceIndex + 3);\n\n  if (contentAfterFence.startsWith(\"json\\n\")) {\n    contentAfterFence = contentAfterFence.substring(5);\n  } else if (contentAfterFence.startsWith(\"json\")) {\n    contentAfterFence = contentAfterFence.substring(4);\n  } else if (contentAfterFence.startsWith(\"\\n\")) {\n    contentAfterFence = contentAfterFence.substring(1);\n  }\n\n  const closingFenceIndex = contentAfterFence.indexOf(\"```\");\n  let finalContent = contentAfterFence;\n  if (closingFenceIndex !== -1) {\n    finalContent = contentAfterFence.substring(0, closingFenceIndex);\n  }\n\n  return parser(finalContent.trim());\n}\n\n/**\n * Recursive descent partial JSON parser.\n * @param s - The string to parse.\n * @returns The parsed value.\n * @throws Error if the input is a malformed JSON string.\n */\nexport function strictParsePartialJson(s: string): unknown {\n  try {\n    return JSON.parse(s);\n  } catch {\n    // Continue to partial parsing\n  }\n\n  const buffer = s.trim();\n  if (buffer.length === 0) throw new Error(\"Unexpected end of JSON input\");\n\n  let pos = 0;\n\n  function skipWhitespace(): void {\n    while (pos < buffer.length && /\\s/.test(buffer[pos])) {\n      pos += 1;\n    }\n  }\n\n  function parseString(): string {\n    if (buffer[pos] !== '\"') {\n      throw new Error(`Expected '\"' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    pos += 1;\n    let result = \"\";\n    let escaped = false;\n\n    while (pos < buffer.length) {\n      const char = buffer[pos];\n\n      if (escaped) {\n        if (char === \"n\") {\n          result += \"\\n\";\n        } else if (char === \"t\") {\n          result += \"\\t\";\n        } else if (char === \"r\") {\n          result += \"\\r\";\n        } else if (char === \"\\\\\") {\n          result += \"\\\\\";\n        } else if (char === '\"') {\n          result += '\"';\n        } else if (char === \"b\") {\n          result += \"\\b\";\n        } else if (char === \"f\") {\n          result += \"\\f\";\n        } else if (char === \"/\") {\n          result += \"/\";\n        } else if (char === \"u\") {\n          const hex = buffer.substring(pos + 1, pos + 5);\n          if (/^[0-9A-Fa-f]{0,4}$/.test(hex)) {\n            if (hex.length === 4) {\n              result += String.fromCharCode(Number.parseInt(hex, 16));\n            } else {\n              result += `u${hex}`;\n            }\n\n            pos += hex.length;\n          } else {\n            throw new Error(\n              `Invalid unicode escape sequence '\\\\u${hex}' at position ${pos}`\n            );\n          }\n        } else {\n          throw new Error(\n            `Invalid escape sequence '\\\\${char}' at position ${pos}`\n          );\n        }\n        escaped = false;\n      } else if (char === \"\\\\\") {\n        escaped = true;\n      } else if (char === '\"') {\n        pos += 1;\n        return result;\n      } else {\n        result += char;\n      }\n\n      pos += 1;\n    }\n\n    if (escaped) result += \"\\\\\";\n    return result;\n  }\n\n  function parseNumber(): number {\n    const start = pos;\n    let numStr = \"\";\n\n    if (buffer[pos] === \"-\") {\n      numStr += \"-\";\n      pos += 1;\n    }\n\n    if (pos < buffer.length && buffer[pos] === \"0\") {\n      numStr += \"0\";\n      pos += 1;\n\n      if (buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        throw new Error(`Invalid number at position ${start}`);\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] >= \"1\" && buffer[pos] <= \"9\") {\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] === \".\") {\n      numStr += \".\";\n      pos += 1;\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && (buffer[pos] === \"e\" || buffer[pos] === \"E\")) {\n      numStr += buffer[pos];\n      pos += 1;\n      if (pos < buffer.length && (buffer[pos] === \"+\" || buffer[pos] === \"-\")) {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (numStr === \"-\") return -0;\n\n    const num = Number.parseFloat(numStr);\n\n    if (Number.isNaN(num)) {\n      pos = start;\n      throw new Error(`Invalid number '${numStr}' at position ${start}`);\n    }\n\n    return num;\n  }\n\n  function parseValue(): unknown {\n    skipWhitespace();\n\n    if (pos >= buffer.length) {\n      throw new Error(`Unexpected end of input at position ${pos}`);\n    }\n\n    const char = buffer[pos];\n\n    if (char === \"{\") return parseObject();\n    if (char === \"[\") return parseArray();\n    if (char === '\"') return parseString();\n\n    if (\"null\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return null;\n    }\n\n    if (\"true\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return true;\n    }\n\n    if (\"false\".startsWith(buffer.substring(pos, pos + 5))) {\n      pos += Math.min(5, buffer.length - pos);\n      return false;\n    }\n\n    if (char === \"-\" || (char >= \"0\" && char <= \"9\")) {\n      return parseNumber();\n    }\n\n    throw new Error(`Unexpected character '${char}' at position ${pos}`);\n  }\n\n  function parseArray(): unknown[] {\n    if (buffer[pos] !== \"[\") {\n      throw new Error(`Expected '[' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const arr: unknown[] = [];\n\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return arr;\n    if (buffer[pos] === \"]\") {\n      pos += 1;\n      return arr;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      arr.push(parseValue());\n\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      if (buffer[pos] === \"]\") {\n        pos += 1;\n        return arr;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or ']' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return arr;\n  }\n\n  function parseObject(): Record<string, unknown> {\n    if (buffer[pos] !== \"{\") {\n      throw new Error(`Expected '{' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const obj: Record<string, unknown> = {};\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return obj;\n    if (buffer[pos] === \"}\") {\n      pos += 1;\n      return obj;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      const key = parseString();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] !== \":\") {\n        throw new Error(\n          `Expected ':' at position ${pos}, got '${buffer[pos]}'`\n        );\n      }\n      pos += 1;\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      obj[key] = parseValue();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] === \"}\") {\n        pos += 1;\n        return obj;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or '}' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return obj;\n  }\n\n  const value = parseValue();\n  skipWhitespace();\n\n  if (pos < buffer.length) {\n    throw new Error(`Unexpected character '${buffer[pos]}' at position ${pos}`);\n  }\n\n  return value;\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function parsePartialJson(s: string): any | null {\n  // Attempt to parse the modified string as JSON.\n  try {\n    if (typeof s === \"undefined\") return null;\n    return strictParsePartialJson(s);\n  } catch {\n    // If we still can't parse the string as JSON, return null to indicate failure.\n    return null;\n  }\n}\n"],"mappings":";;AAAA,SAAgB,kBAAkB,GAAW,SAAS,kBAAkB;AAEtE,KAAI,EAAE,MAAM;CAEZ,MAAM,kBAAkB,EAAE,QAAQ,MAAM;AACxC,KAAI,oBAAoB,GACtB,QAAO,OAAO,EAAE;CAGlB,IAAI,oBAAoB,EAAE,UAAU,kBAAkB,EAAE;AAExD,KAAI,kBAAkB,WAAW,SAAS,CACxC,qBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,OAAO,CAC7C,qBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,KAAK,CAC3C,qBAAoB,kBAAkB,UAAU,EAAE;CAGpD,MAAM,oBAAoB,kBAAkB,QAAQ,MAAM;CAC1D,IAAI,eAAe;AACnB,KAAI,sBAAsB,GACxB,gBAAe,kBAAkB,UAAU,GAAG,kBAAkB;AAGlE,QAAO,OAAO,aAAa,MAAM,CAAC;;;;;;;;AASpC,SAAgB,uBAAuB,GAAoB;AACzD,KAAI;AACF,SAAO,KAAK,MAAM,EAAE;SACd;CAIR,MAAM,SAAS,EAAE,MAAM;AACvB,KAAI,OAAO,WAAW,EAAG,OAAM,IAAI,MAAM,+BAA+B;CAExE,IAAI,MAAM;CAEV,SAAS,iBAAuB;AAC9B,SAAO,MAAM,OAAO,UAAU,KAAK,KAAK,OAAO,KAAK,CAClD,QAAO;;CAIX,SAAS,cAAsB;AAC7B,MAAI,OAAO,SAAS,KAClB,OAAM,IAAI,MAAM,4BAA4B,IAAI,SAAS,OAAO,KAAK,GAAG;AAG1E,SAAO;EACP,IAAI,SAAS;EACb,IAAI,UAAU;AAEd,SAAO,MAAM,OAAO,QAAQ;GAC1B,MAAM,OAAO,OAAO;AAEpB,OAAI,SAAS;AACX,QAAI,SAAS,IACX,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,KAClB,WAAU;aACD,SAAS,KAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,KAAK;KACvB,MAAM,MAAM,OAAO,UAAU,MAAM,GAAG,MAAM,EAAE;AAC9C,SAAI,qBAAqB,KAAK,IAAI,EAAE;AAClC,UAAI,IAAI,WAAW,EACjB,WAAU,OAAO,aAAa,OAAO,SAAS,KAAK,GAAG,CAAC;UAEvD,WAAU,IAAI;AAGhB,aAAO,IAAI;WAEX,OAAM,IAAI,MACR,uCAAuC,IAAI,gBAAgB,MAC5D;UAGH,OAAM,IAAI,MACR,8BAA8B,KAAK,gBAAgB,MACpD;AAEH,cAAU;cACD,SAAS,KAClB,WAAU;YACD,SAAS,MAAK;AACvB,WAAO;AACP,WAAO;SAEP,WAAU;AAGZ,UAAO;;AAGT,MAAI,QAAS,WAAU;AACvB,SAAO;;CAGT,SAAS,cAAsB;EAC7B,MAAM,QAAQ;EACd,IAAI,SAAS;AAEb,MAAI,OAAO,SAAS,KAAK;AACvB,aAAU;AACV,UAAO;;AAGT,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;AAC9C,aAAU;AACV,UAAO;AAEP,OAAI,OAAO,QAAQ,OAAO,OAAO,QAAQ,IACvC,OAAM,IAAI,MAAM,8BAA8B,QAAQ;;AAI1D,MAAI,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,IAC9D,QAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;AACtE,aAAU,OAAO;AACjB,UAAO;;AAIX,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;AAC9C,aAAU;AACV,UAAO;AACP,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;AACtE,cAAU,OAAO;AACjB,WAAO;;;AAIX,MAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;AACvE,aAAU,OAAO;AACjB,UAAO;AACP,OAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;AACvE,cAAU,OAAO;AACjB,WAAO;;AAET,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;AACtE,cAAU,OAAO;AACjB,WAAO;;;AAIX,MAAI,WAAW,IAAK,QAAO;EAE3B,MAAM,MAAM,OAAO,WAAW,OAAO;AAErC,MAAI,OAAO,MAAM,IAAI,EAAE;AACrB,SAAM;AACN,SAAM,IAAI,MAAM,mBAAmB,OAAO,gBAAgB,QAAQ;;AAGpE,SAAO;;CAGT,SAAS,aAAsB;AAC7B,kBAAgB;AAEhB,MAAI,OAAO,OAAO,OAChB,OAAM,IAAI,MAAM,uCAAuC,MAAM;EAG/D,MAAM,OAAO,OAAO;AAEpB,MAAI,SAAS,IAAK,QAAO,aAAa;AACtC,MAAI,SAAS,IAAK,QAAO,YAAY;AACrC,MAAI,SAAS,KAAK,QAAO,aAAa;AAEtC,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;AACrD,UAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;;AAGT,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;AACrD,UAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;;AAGT,MAAI,QAAQ,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;AACtD,UAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;;AAGT,MAAI,SAAS,OAAQ,QAAQ,OAAO,QAAQ,IAC1C,QAAO,aAAa;AAGtB,QAAM,IAAI,MAAM,yBAAyB,KAAK,gBAAgB,MAAM;;CAGtE,SAAS,aAAwB;AAC/B,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,4BAA4B,IAAI,SAAS,OAAO,KAAK,GAAG;EAG1E,MAAM,MAAiB,EAAE;AAEzB,SAAO;AACP,kBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;AACvB,UAAO;AACP,UAAO;;AAGT,SAAO,MAAM,OAAO,QAAQ;AAC1B,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,KAAK,YAAY,CAAC;AAEtB,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;AACvB,WAAO;AACP,WAAO;cACE,OAAO,SAAS,KAAK;AAC9B,WAAO;AACP;;AAGF,SAAM,IAAI,MACR,mCAAmC,IAAI,SAAS,OAAO,KAAK,GAC7D;;AAGH,SAAO;;CAGT,SAAS,cAAuC;AAC9C,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,4BAA4B,IAAI,SAAS,OAAO,KAAK,GAAG;EAG1E,MAAM,MAA+B,EAAE;AACvC,SAAO;AACP,kBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;AACvB,UAAO;AACP,UAAO;;AAGT,SAAO,MAAM,OAAO,QAAQ;AAC1B,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,MAAM,MAAM,aAAa;AAEzB,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MACR,4BAA4B,IAAI,SAAS,OAAO,KAAK,GACtD;AAEH,UAAO;AAEP,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,YAAY;AAEvB,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;AACvB,WAAO;AACP,WAAO;cACE,OAAO,SAAS,KAAK;AAC9B,WAAO;AACP;;AAGF,SAAM,IAAI,MACR,mCAAmC,IAAI,SAAS,OAAO,KAAK,GAC7D;;AAGH,SAAO;;CAGT,MAAM,QAAQ,YAAY;AAC1B,iBAAgB;AAEhB,KAAI,MAAM,OAAO,OACf,OAAM,IAAI,MAAM,yBAAyB,OAAO,KAAK,gBAAgB,MAAM;AAG7E,QAAO;;AAIT,SAAgB,iBAAiB,GAAuB;AAEtD,KAAI;AACF,MAAI,OAAO,MAAM,YAAa,QAAO;AACrC,SAAO,uBAAuB,EAAE;SAC1B;AAEN,SAAO"}

package/dist/utils/json.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"json.d.cts","names":["parseJsonMarkdown","parsePartialJson","strictParsePartialJson"],"sources":["../../src/utils/json.d.ts"],"sourcesContent":["export declare function parseJsonMarkdown(s: string, parser?: typeof parsePartialJson): any;\n/**\n * Recursive descent partial JSON parser.\n * @param s - The string to parse.\n * @returns The parsed value.\n * @throws Error if the input is a malformed JSON string.\n */\nexport declare function strictParsePartialJson(s: string): unknown;\nexport declare function parsePartialJson(s: string): any | null;\n//# sourceMappingURL=json.d.ts.map"],"mappings":";iBAAwBA,iBAAAA,4BAA6CC;iBAQ7CA,gBAAAA"}
+{"version":3,"file":"json.d.cts","names":[],"sources":["../../src/utils/json.ts"],"mappings":";iBAAgB,iBAAA,CAAkB,CAAA,UAAW,MAAA,UAAM,gBAAA;AAAA,iBA+TnC,gBAAA,CAAiB,CAAA"}

package/dist/utils/json.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"json.d.ts","names":["parseJsonMarkdown","parsePartialJson","strictParsePartialJson"],"sources":["../../src/utils/json.d.ts"],"sourcesContent":["export declare function parseJsonMarkdown(s: string, parser?: typeof parsePartialJson): any;\n/**\n * Recursive descent partial JSON parser.\n * @param s - The string to parse.\n * @returns The parsed value.\n * @throws Error if the input is a malformed JSON string.\n */\nexport declare function strictParsePartialJson(s: string): unknown;\nexport declare function parsePartialJson(s: string): any | null;\n//# sourceMappingURL=json.d.ts.map"],"mappings":";iBAAwBA,iBAAAA,4BAA6CC;iBAQ7CA,gBAAAA"}
+{"version":3,"file":"json.d.ts","names":[],"sources":["../../src/utils/json.ts"],"mappings":";iBAAgB,iBAAA,CAAkB,CAAA,UAAW,MAAA,UAAM,gBAAA;AAAA,iBA+TnC,gBAAA,CAAiB,CAAA"}

package/dist/utils/json.js.map

@@ -1 +1 @@
-{"version":3,"file":"json.js","names":["s: string","arr: unknown[]","obj: Record<string, unknown>"],"sources":["../../src/utils/json.ts"],"sourcesContent":["export function parseJsonMarkdown(s: string, parser = parsePartialJson) {\n  // eslint-disable-next-line no-param-reassign\n  s = s.trim();\n\n  const firstFenceIndex = s.indexOf(\"```\");\n  if (firstFenceIndex === -1) {\n    return parser(s);\n  }\n\n  let contentAfterFence = s.substring(firstFenceIndex + 3);\n\n  if (contentAfterFence.startsWith(\"json\\n\")) {\n    contentAfterFence = contentAfterFence.substring(5);\n  } else if (contentAfterFence.startsWith(\"json\")) {\n    contentAfterFence = contentAfterFence.substring(4);\n  } else if (contentAfterFence.startsWith(\"\\n\")) {\n    contentAfterFence = contentAfterFence.substring(1);\n  }\n\n  const closingFenceIndex = contentAfterFence.indexOf(\"```\");\n  let finalContent = contentAfterFence;\n  if (closingFenceIndex !== -1) {\n    finalContent = contentAfterFence.substring(0, closingFenceIndex);\n  }\n\n  return parser(finalContent.trim());\n}\n\n/**\n * Recursive descent partial JSON parser.\n * @param s - The string to parse.\n * @returns The parsed value.\n * @throws Error if the input is a malformed JSON string.\n */\nexport function strictParsePartialJson(s: string): unknown {\n  try {\n    return JSON.parse(s);\n  } catch {\n    // Continue to partial parsing\n  }\n\n  const buffer = s.trim();\n  if (buffer.length === 0) throw new Error(\"Unexpected end of JSON input\");\n\n  let pos = 0;\n\n  function skipWhitespace(): void {\n    while (pos < buffer.length && /\\s/.test(buffer[pos])) {\n      pos += 1;\n    }\n  }\n\n  function parseString(): string {\n    if (buffer[pos] !== '\"') {\n      throw new Error(`Expected '\"' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    pos += 1;\n    let result = \"\";\n    let escaped = false;\n\n    while (pos < buffer.length) {\n      const char = buffer[pos];\n\n      if (escaped) {\n        if (char === \"n\") {\n          result += \"\\n\";\n        } else if (char === \"t\") {\n          result += \"\\t\";\n        } else if (char === \"r\") {\n          result += \"\\r\";\n        } else if (char === \"\\\\\") {\n          result += \"\\\\\";\n        } else if (char === '\"') {\n          result += '\"';\n        } else if (char === \"b\") {\n          result += \"\\b\";\n        } else if (char === \"f\") {\n          result += \"\\f\";\n        } else if (char === \"/\") {\n          result += \"/\";\n        } else if (char === \"u\") {\n          const hex = buffer.substring(pos + 1, pos + 5);\n          if (/^[0-9A-Fa-f]{0,4}$/.test(hex)) {\n            if (hex.length === 4) {\n              result += String.fromCharCode(Number.parseInt(hex, 16));\n            } else {\n              result += `u${hex}`;\n            }\n\n            pos += hex.length;\n          } else {\n            throw new Error(\n              `Invalid unicode escape sequence '\\\\u${hex}' at position ${pos}`\n            );\n          }\n        } else {\n          throw new Error(\n            `Invalid escape sequence '\\\\${char}' at position ${pos}`\n          );\n        }\n        escaped = false;\n      } else if (char === \"\\\\\") {\n        escaped = true;\n      } else if (char === '\"') {\n        pos += 1;\n        return result;\n      } else {\n        result += char;\n      }\n\n      pos += 1;\n    }\n\n    if (escaped) result += \"\\\\\";\n    return result;\n  }\n\n  function parseNumber(): number {\n    const start = pos;\n    let numStr = \"\";\n\n    if (buffer[pos] === \"-\") {\n      numStr += \"-\";\n      pos += 1;\n    }\n\n    if (pos < buffer.length && buffer[pos] === \"0\") {\n      numStr += \"0\";\n      pos += 1;\n\n      if (buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        throw new Error(`Invalid number at position ${start}`);\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] >= \"1\" && buffer[pos] <= \"9\") {\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] === \".\") {\n      numStr += \".\";\n      pos += 1;\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && (buffer[pos] === \"e\" || buffer[pos] === \"E\")) {\n      numStr += buffer[pos];\n      pos += 1;\n      if (pos < buffer.length && (buffer[pos] === \"+\" || buffer[pos] === \"-\")) {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (numStr === \"-\") return -0;\n\n    const num = Number.parseFloat(numStr);\n\n    if (Number.isNaN(num)) {\n      pos = start;\n      throw new Error(`Invalid number '${numStr}' at position ${start}`);\n    }\n\n    return num;\n  }\n\n  function parseValue(): unknown {\n    skipWhitespace();\n\n    if (pos >= buffer.length) {\n      throw new Error(`Unexpected end of input at position ${pos}`);\n    }\n\n    const char = buffer[pos];\n\n    if (char === \"{\") return parseObject();\n    if (char === \"[\") return parseArray();\n    if (char === '\"') return parseString();\n\n    if (\"null\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return null;\n    }\n\n    if (\"true\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return true;\n    }\n\n    if (\"false\".startsWith(buffer.substring(pos, pos + 5))) {\n      pos += Math.min(5, buffer.length - pos);\n      return false;\n    }\n\n    if (char === \"-\" || (char >= \"0\" && char <= \"9\")) {\n      return parseNumber();\n    }\n\n    throw new Error(`Unexpected character '${char}' at position ${pos}`);\n  }\n\n  function parseArray(): unknown[] {\n    if (buffer[pos] !== \"[\") {\n      throw new Error(`Expected '[' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const arr: unknown[] = [];\n\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return arr;\n    if (buffer[pos] === \"]\") {\n      pos += 1;\n      return arr;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      arr.push(parseValue());\n\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      if (buffer[pos] === \"]\") {\n        pos += 1;\n        return arr;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or ']' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return arr;\n  }\n\n  function parseObject(): Record<string, unknown> {\n    if (buffer[pos] !== \"{\") {\n      throw new Error(`Expected '{' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const obj: Record<string, unknown> = {};\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return obj;\n    if (buffer[pos] === \"}\") {\n      pos += 1;\n      return obj;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      const key = parseString();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] !== \":\") {\n        throw new Error(\n          `Expected ':' at position ${pos}, got '${buffer[pos]}'`\n        );\n      }\n      pos += 1;\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      obj[key] = parseValue();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] === \"}\") {\n        pos += 1;\n        return obj;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or '}' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return obj;\n  }\n\n  const value = parseValue();\n  skipWhitespace();\n\n  if (pos < buffer.length) {\n    throw new Error(`Unexpected character '${buffer[pos]}' at position ${pos}`);\n  }\n\n  return value;\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function parsePartialJson(s: string): any | null {\n  // Attempt to parse the modified string as JSON.\n  try {\n    if (typeof s === \"undefined\") return null;\n    return strictParsePartialJson(s);\n  } catch {\n    // If we still can't parse the string as JSON, return null to indicate failure.\n    return null;\n  }\n}\n"],"mappings":";AAAA,SAAgB,kBAAkBA,GAAW,SAAS,kBAAkB;CAEtE,IAAI,EAAE,MAAM;CAEZ,MAAM,kBAAkB,EAAE,QAAQ,MAAM;AACxC,KAAI,oBAAoB,GACtB,QAAO,OAAO,EAAE;CAGlB,IAAI,oBAAoB,EAAE,UAAU,kBAAkB,EAAE;AAExD,KAAI,kBAAkB,WAAW,SAAS,EACxC,oBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,OAAO,EAC7C,oBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,KAAK,EAC3C,oBAAoB,kBAAkB,UAAU,EAAE;CAGpD,MAAM,oBAAoB,kBAAkB,QAAQ,MAAM;CAC1D,IAAI,eAAe;AACnB,KAAI,sBAAsB,IACxB,eAAe,kBAAkB,UAAU,GAAG,kBAAkB;AAGlE,QAAO,OAAO,aAAa,MAAM,CAAC;AACnC;;;;;;;AAQD,SAAgB,uBAAuBA,GAAoB;AACzD,KAAI;AACF,SAAO,KAAK,MAAM,EAAE;CACrB,QAAO,CAEP;CAED,MAAM,SAAS,EAAE,MAAM;AACvB,KAAI,OAAO,WAAW,EAAG,OAAM,IAAI,MAAM;CAEzC,IAAI,MAAM;CAEV,SAAS,iBAAuB;AAC9B,SAAO,MAAM,OAAO,UAAU,KAAK,KAAK,OAAO,KAAK,EAClD,OAAO;CAEV;CAED,SAAS,cAAsB;AAC7B,MAAI,OAAO,SAAS,KAClB,OAAM,IAAI,MAAM,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAGzE,OAAO;EACP,IAAI,SAAS;EACb,IAAI,UAAU;AAEd,SAAO,MAAM,OAAO,QAAQ;GAC1B,MAAM,OAAO,OAAO;AAEpB,OAAI,SAAS;AACX,QAAI,SAAS,KACX,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,MAClB,UAAU;aACD,SAAS,MAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAClB,UAAU;aACD,SAAS,KAAK;KACvB,MAAM,MAAM,OAAO,UAAU,MAAM,GAAG,MAAM,EAAE;AAC9C,SAAI,qBAAqB,KAAK,IAAI,EAAE;AAClC,UAAI,IAAI,WAAW,GACjB,UAAU,OAAO,aAAa,OAAO,SAAS,KAAK,GAAG,CAAC;WAEvD,UAAU,CAAC,CAAC,EAAE,KAAK;MAGrB,OAAO,IAAI;KACZ,MACC,OAAM,IAAI,MACR,CAAC,oCAAoC,EAAE,IAAI,cAAc,EAAE,KAAK;IAGrE,MACC,OAAM,IAAI,MACR,CAAC,2BAA2B,EAAE,KAAK,cAAc,EAAE,KAAK;IAG5D,UAAU;GACX,WAAU,SAAS,MAClB,UAAU;YACD,SAAS,MAAK;IACvB,OAAO;AACP,WAAO;GACR,OACC,UAAU;GAGZ,OAAO;EACR;AAED,MAAI,SAAS,UAAU;AACvB,SAAO;CACR;CAED,SAAS,cAAsB;EAC7B,MAAM,QAAQ;EACd,IAAI,SAAS;AAEb,MAAI,OAAO,SAAS,KAAK;GACvB,UAAU;GACV,OAAO;EACR;AAED,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;GAC9C,UAAU;GACV,OAAO;AAEP,OAAI,OAAO,QAAQ,OAAO,OAAO,QAAQ,IACvC,OAAM,IAAI,MAAM,CAAC,2BAA2B,EAAE,OAAO;EAExD;AAED,MAAI,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,IAC9D,QAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;GACtE,UAAU,OAAO;GACjB,OAAO;EACR;AAGH,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;GAC9C,UAAU;GACV,OAAO;AACP,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;IACtE,UAAU,OAAO;IACjB,OAAO;GACR;EACF;AAED,MAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;GACvE,UAAU,OAAO;GACjB,OAAO;AACP,OAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;IACvE,UAAU,OAAO;IACjB,OAAO;GACR;AACD,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;IACtE,UAAU,OAAO;IACjB,OAAO;GACR;EACF;AAED,MAAI,WAAW,IAAK,QAAO;EAE3B,MAAM,MAAM,OAAO,WAAW,OAAO;AAErC,MAAI,OAAO,MAAM,IAAI,EAAE;GACrB,MAAM;AACN,SAAM,IAAI,MAAM,CAAC,gBAAgB,EAAE,OAAO,cAAc,EAAE,OAAO;EAClE;AAED,SAAO;CACR;CAED,SAAS,aAAsB;EAC7B,gBAAgB;AAEhB,MAAI,OAAO,OAAO,OAChB,OAAM,IAAI,MAAM,CAAC,oCAAoC,EAAE,KAAK;EAG9D,MAAM,OAAO,OAAO;AAEpB,MAAI,SAAS,IAAK,QAAO,aAAa;AACtC,MAAI,SAAS,IAAK,QAAO,YAAY;AACrC,MAAI,SAAS,KAAK,QAAO,aAAa;AAEtC,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;GACrD,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;EACR;AAED,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;GACrD,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;EACR;AAED,MAAI,QAAQ,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;GACtD,OAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;EACR;AAED,MAAI,SAAS,OAAQ,QAAQ,OAAO,QAAQ,IAC1C,QAAO,aAAa;AAGtB,QAAM,IAAI,MAAM,CAAC,sBAAsB,EAAE,KAAK,cAAc,EAAE,KAAK;CACpE;CAED,SAAS,aAAwB;AAC/B,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAGzE,MAAMC,MAAiB,CAAE;EAEzB,OAAO;EACP,gBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;GACvB,OAAO;AACP,UAAO;EACR;AAED,SAAO,MAAM,OAAO,QAAQ;GAC1B,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,IAAI,KAAK,YAAY,CAAC;GAEtB,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;IACvB,OAAO;AACP,WAAO;GACR,WAAU,OAAO,SAAS,KAAK;IAC9B,OAAO;AACP;GACD;AAED,SAAM,IAAI,MACR,CAAC,gCAAgC,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAEjE;AAED,SAAO;CACR;CAED,SAAS,cAAuC;AAC9C,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAGzE,MAAMC,MAA+B,CAAE;EACvC,OAAO;EACP,gBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;GACvB,OAAO;AACP,UAAO;EACR;AAED,SAAO,MAAM,OAAO,QAAQ;GAC1B,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,MAAM,MAAM,aAAa;GAEzB,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MACR,CAAC,yBAAyB,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;GAG3D,OAAO;GAEP,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,IAAI,OAAO,YAAY;GAEvB,gBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;IACvB,OAAO;AACP,WAAO;GACR,WAAU,OAAO,SAAS,KAAK;IAC9B,OAAO;AACP;GACD;AAED,SAAM,IAAI,MACR,CAAC,gCAAgC,EAAE,IAAI,OAAO,EAAE,OAAO,KAAK,CAAC,CAAC;EAEjE;AAED,SAAO;CACR;CAED,MAAM,QAAQ,YAAY;CAC1B,gBAAgB;AAEhB,KAAI,MAAM,OAAO,OACf,OAAM,IAAI,MAAM,CAAC,sBAAsB,EAAE,OAAO,KAAK,cAAc,EAAE,KAAK;AAG5E,QAAO;AACR;AAGD,SAAgB,iBAAiBF,GAAuB;AAEtD,KAAI;AACF,MAAI,OAAO,MAAM,YAAa,QAAO;AACrC,SAAO,uBAAuB,EAAE;CACjC,QAAO;AAEN,SAAO;CACR;AACF"}
+{"version":3,"file":"json.js","names":[],"sources":["../../src/utils/json.ts"],"sourcesContent":["export function parseJsonMarkdown(s: string, parser = parsePartialJson) {\n  // eslint-disable-next-line no-param-reassign\n  s = s.trim();\n\n  const firstFenceIndex = s.indexOf(\"```\");\n  if (firstFenceIndex === -1) {\n    return parser(s);\n  }\n\n  let contentAfterFence = s.substring(firstFenceIndex + 3);\n\n  if (contentAfterFence.startsWith(\"json\\n\")) {\n    contentAfterFence = contentAfterFence.substring(5);\n  } else if (contentAfterFence.startsWith(\"json\")) {\n    contentAfterFence = contentAfterFence.substring(4);\n  } else if (contentAfterFence.startsWith(\"\\n\")) {\n    contentAfterFence = contentAfterFence.substring(1);\n  }\n\n  const closingFenceIndex = contentAfterFence.indexOf(\"```\");\n  let finalContent = contentAfterFence;\n  if (closingFenceIndex !== -1) {\n    finalContent = contentAfterFence.substring(0, closingFenceIndex);\n  }\n\n  return parser(finalContent.trim());\n}\n\n/**\n * Recursive descent partial JSON parser.\n * @param s - The string to parse.\n * @returns The parsed value.\n * @throws Error if the input is a malformed JSON string.\n */\nexport function strictParsePartialJson(s: string): unknown {\n  try {\n    return JSON.parse(s);\n  } catch {\n    // Continue to partial parsing\n  }\n\n  const buffer = s.trim();\n  if (buffer.length === 0) throw new Error(\"Unexpected end of JSON input\");\n\n  let pos = 0;\n\n  function skipWhitespace(): void {\n    while (pos < buffer.length && /\\s/.test(buffer[pos])) {\n      pos += 1;\n    }\n  }\n\n  function parseString(): string {\n    if (buffer[pos] !== '\"') {\n      throw new Error(`Expected '\"' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    pos += 1;\n    let result = \"\";\n    let escaped = false;\n\n    while (pos < buffer.length) {\n      const char = buffer[pos];\n\n      if (escaped) {\n        if (char === \"n\") {\n          result += \"\\n\";\n        } else if (char === \"t\") {\n          result += \"\\t\";\n        } else if (char === \"r\") {\n          result += \"\\r\";\n        } else if (char === \"\\\\\") {\n          result += \"\\\\\";\n        } else if (char === '\"') {\n          result += '\"';\n        } else if (char === \"b\") {\n          result += \"\\b\";\n        } else if (char === \"f\") {\n          result += \"\\f\";\n        } else if (char === \"/\") {\n          result += \"/\";\n        } else if (char === \"u\") {\n          const hex = buffer.substring(pos + 1, pos + 5);\n          if (/^[0-9A-Fa-f]{0,4}$/.test(hex)) {\n            if (hex.length === 4) {\n              result += String.fromCharCode(Number.parseInt(hex, 16));\n            } else {\n              result += `u${hex}`;\n            }\n\n            pos += hex.length;\n          } else {\n            throw new Error(\n              `Invalid unicode escape sequence '\\\\u${hex}' at position ${pos}`\n            );\n          }\n        } else {\n          throw new Error(\n            `Invalid escape sequence '\\\\${char}' at position ${pos}`\n          );\n        }\n        escaped = false;\n      } else if (char === \"\\\\\") {\n        escaped = true;\n      } else if (char === '\"') {\n        pos += 1;\n        return result;\n      } else {\n        result += char;\n      }\n\n      pos += 1;\n    }\n\n    if (escaped) result += \"\\\\\";\n    return result;\n  }\n\n  function parseNumber(): number {\n    const start = pos;\n    let numStr = \"\";\n\n    if (buffer[pos] === \"-\") {\n      numStr += \"-\";\n      pos += 1;\n    }\n\n    if (pos < buffer.length && buffer[pos] === \"0\") {\n      numStr += \"0\";\n      pos += 1;\n\n      if (buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        throw new Error(`Invalid number at position ${start}`);\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] >= \"1\" && buffer[pos] <= \"9\") {\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && buffer[pos] === \".\") {\n      numStr += \".\";\n      pos += 1;\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (pos < buffer.length && (buffer[pos] === \"e\" || buffer[pos] === \"E\")) {\n      numStr += buffer[pos];\n      pos += 1;\n      if (pos < buffer.length && (buffer[pos] === \"+\" || buffer[pos] === \"-\")) {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n      while (pos < buffer.length && buffer[pos] >= \"0\" && buffer[pos] <= \"9\") {\n        numStr += buffer[pos];\n        pos += 1;\n      }\n    }\n\n    if (numStr === \"-\") return -0;\n\n    const num = Number.parseFloat(numStr);\n\n    if (Number.isNaN(num)) {\n      pos = start;\n      throw new Error(`Invalid number '${numStr}' at position ${start}`);\n    }\n\n    return num;\n  }\n\n  function parseValue(): unknown {\n    skipWhitespace();\n\n    if (pos >= buffer.length) {\n      throw new Error(`Unexpected end of input at position ${pos}`);\n    }\n\n    const char = buffer[pos];\n\n    if (char === \"{\") return parseObject();\n    if (char === \"[\") return parseArray();\n    if (char === '\"') return parseString();\n\n    if (\"null\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return null;\n    }\n\n    if (\"true\".startsWith(buffer.substring(pos, pos + 4))) {\n      pos += Math.min(4, buffer.length - pos);\n      return true;\n    }\n\n    if (\"false\".startsWith(buffer.substring(pos, pos + 5))) {\n      pos += Math.min(5, buffer.length - pos);\n      return false;\n    }\n\n    if (char === \"-\" || (char >= \"0\" && char <= \"9\")) {\n      return parseNumber();\n    }\n\n    throw new Error(`Unexpected character '${char}' at position ${pos}`);\n  }\n\n  function parseArray(): unknown[] {\n    if (buffer[pos] !== \"[\") {\n      throw new Error(`Expected '[' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const arr: unknown[] = [];\n\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return arr;\n    if (buffer[pos] === \"]\") {\n      pos += 1;\n      return arr;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      arr.push(parseValue());\n\n      skipWhitespace();\n      if (pos >= buffer.length) return arr;\n\n      if (buffer[pos] === \"]\") {\n        pos += 1;\n        return arr;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or ']' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return arr;\n  }\n\n  function parseObject(): Record<string, unknown> {\n    if (buffer[pos] !== \"{\") {\n      throw new Error(`Expected '{' at position ${pos}, got '${buffer[pos]}'`);\n    }\n\n    const obj: Record<string, unknown> = {};\n    pos += 1;\n    skipWhitespace();\n\n    if (pos >= buffer.length) return obj;\n    if (buffer[pos] === \"}\") {\n      pos += 1;\n      return obj;\n    }\n\n    while (pos < buffer.length) {\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      const key = parseString();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] !== \":\") {\n        throw new Error(\n          `Expected ':' at position ${pos}, got '${buffer[pos]}'`\n        );\n      }\n      pos += 1;\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      obj[key] = parseValue();\n\n      skipWhitespace();\n      if (pos >= buffer.length) return obj;\n\n      if (buffer[pos] === \"}\") {\n        pos += 1;\n        return obj;\n      } else if (buffer[pos] === \",\") {\n        pos += 1;\n        continue;\n      }\n\n      throw new Error(\n        `Expected ',' or '}' at position ${pos}, got '${buffer[pos]}'`\n      );\n    }\n\n    return obj;\n  }\n\n  const value = parseValue();\n  skipWhitespace();\n\n  if (pos < buffer.length) {\n    throw new Error(`Unexpected character '${buffer[pos]}' at position ${pos}`);\n  }\n\n  return value;\n}\n\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nexport function parsePartialJson(s: string): any | null {\n  // Attempt to parse the modified string as JSON.\n  try {\n    if (typeof s === \"undefined\") return null;\n    return strictParsePartialJson(s);\n  } catch {\n    // If we still can't parse the string as JSON, return null to indicate failure.\n    return null;\n  }\n}\n"],"mappings":";AAAA,SAAgB,kBAAkB,GAAW,SAAS,kBAAkB;AAEtE,KAAI,EAAE,MAAM;CAEZ,MAAM,kBAAkB,EAAE,QAAQ,MAAM;AACxC,KAAI,oBAAoB,GACtB,QAAO,OAAO,EAAE;CAGlB,IAAI,oBAAoB,EAAE,UAAU,kBAAkB,EAAE;AAExD,KAAI,kBAAkB,WAAW,SAAS,CACxC,qBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,OAAO,CAC7C,qBAAoB,kBAAkB,UAAU,EAAE;UACzC,kBAAkB,WAAW,KAAK,CAC3C,qBAAoB,kBAAkB,UAAU,EAAE;CAGpD,MAAM,oBAAoB,kBAAkB,QAAQ,MAAM;CAC1D,IAAI,eAAe;AACnB,KAAI,sBAAsB,GACxB,gBAAe,kBAAkB,UAAU,GAAG,kBAAkB;AAGlE,QAAO,OAAO,aAAa,MAAM,CAAC;;;;;;;;AASpC,SAAgB,uBAAuB,GAAoB;AACzD,KAAI;AACF,SAAO,KAAK,MAAM,EAAE;SACd;CAIR,MAAM,SAAS,EAAE,MAAM;AACvB,KAAI,OAAO,WAAW,EAAG,OAAM,IAAI,MAAM,+BAA+B;CAExE,IAAI,MAAM;CAEV,SAAS,iBAAuB;AAC9B,SAAO,MAAM,OAAO,UAAU,KAAK,KAAK,OAAO,KAAK,CAClD,QAAO;;CAIX,SAAS,cAAsB;AAC7B,MAAI,OAAO,SAAS,KAClB,OAAM,IAAI,MAAM,4BAA4B,IAAI,SAAS,OAAO,KAAK,GAAG;AAG1E,SAAO;EACP,IAAI,SAAS;EACb,IAAI,UAAU;AAEd,SAAO,MAAM,OAAO,QAAQ;GAC1B,MAAM,OAAO,OAAO;AAEpB,OAAI,SAAS;AACX,QAAI,SAAS,IACX,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,KAClB,WAAU;aACD,SAAS,KAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,IAClB,WAAU;aACD,SAAS,KAAK;KACvB,MAAM,MAAM,OAAO,UAAU,MAAM,GAAG,MAAM,EAAE;AAC9C,SAAI,qBAAqB,KAAK,IAAI,EAAE;AAClC,UAAI,IAAI,WAAW,EACjB,WAAU,OAAO,aAAa,OAAO,SAAS,KAAK,GAAG,CAAC;UAEvD,WAAU,IAAI;AAGhB,aAAO,IAAI;WAEX,OAAM,IAAI,MACR,uCAAuC,IAAI,gBAAgB,MAC5D;UAGH,OAAM,IAAI,MACR,8BAA8B,KAAK,gBAAgB,MACpD;AAEH,cAAU;cACD,SAAS,KAClB,WAAU;YACD,SAAS,MAAK;AACvB,WAAO;AACP,WAAO;SAEP,WAAU;AAGZ,UAAO;;AAGT,MAAI,QAAS,WAAU;AACvB,SAAO;;CAGT,SAAS,cAAsB;EAC7B,MAAM,QAAQ;EACd,IAAI,SAAS;AAEb,MAAI,OAAO,SAAS,KAAK;AACvB,aAAU;AACV,UAAO;;AAGT,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;AAC9C,aAAU;AACV,UAAO;AAEP,OAAI,OAAO,QAAQ,OAAO,OAAO,QAAQ,IACvC,OAAM,IAAI,MAAM,8BAA8B,QAAQ;;AAI1D,MAAI,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,IAC9D,QAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;AACtE,aAAU,OAAO;AACjB,UAAO;;AAIX,MAAI,MAAM,OAAO,UAAU,OAAO,SAAS,KAAK;AAC9C,aAAU;AACV,UAAO;AACP,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;AACtE,cAAU,OAAO;AACjB,WAAO;;;AAIX,MAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;AACvE,aAAU,OAAO;AACjB,UAAO;AACP,OAAI,MAAM,OAAO,WAAW,OAAO,SAAS,OAAO,OAAO,SAAS,MAAM;AACvE,cAAU,OAAO;AACjB,WAAO;;AAET,UAAO,MAAM,OAAO,UAAU,OAAO,QAAQ,OAAO,OAAO,QAAQ,KAAK;AACtE,cAAU,OAAO;AACjB,WAAO;;;AAIX,MAAI,WAAW,IAAK,QAAO;EAE3B,MAAM,MAAM,OAAO,WAAW,OAAO;AAErC,MAAI,OAAO,MAAM,IAAI,EAAE;AACrB,SAAM;AACN,SAAM,IAAI,MAAM,mBAAmB,OAAO,gBAAgB,QAAQ;;AAGpE,SAAO;;CAGT,SAAS,aAAsB;AAC7B,kBAAgB;AAEhB,MAAI,OAAO,OAAO,OAChB,OAAM,IAAI,MAAM,uCAAuC,MAAM;EAG/D,MAAM,OAAO,OAAO;AAEpB,MAAI,SAAS,IAAK,QAAO,aAAa;AACtC,MAAI,SAAS,IAAK,QAAO,YAAY;AACrC,MAAI,SAAS,KAAK,QAAO,aAAa;AAEtC,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;AACrD,UAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;;AAGT,MAAI,OAAO,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;AACrD,UAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;;AAGT,MAAI,QAAQ,WAAW,OAAO,UAAU,KAAK,MAAM,EAAE,CAAC,EAAE;AACtD,UAAO,KAAK,IAAI,GAAG,OAAO,SAAS,IAAI;AACvC,UAAO;;AAGT,MAAI,SAAS,OAAQ,QAAQ,OAAO,QAAQ,IAC1C,QAAO,aAAa;AAGtB,QAAM,IAAI,MAAM,yBAAyB,KAAK,gBAAgB,MAAM;;CAGtE,SAAS,aAAwB;AAC/B,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,4BAA4B,IAAI,SAAS,OAAO,KAAK,GAAG;EAG1E,MAAM,MAAiB,EAAE;AAEzB,SAAO;AACP,kBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;AACvB,UAAO;AACP,UAAO;;AAGT,SAAO,MAAM,OAAO,QAAQ;AAC1B,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,KAAK,YAAY,CAAC;AAEtB,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;AACvB,WAAO;AACP,WAAO;cACE,OAAO,SAAS,KAAK;AAC9B,WAAO;AACP;;AAGF,SAAM,IAAI,MACR,mCAAmC,IAAI,SAAS,OAAO,KAAK,GAC7D;;AAGH,SAAO;;CAGT,SAAS,cAAuC;AAC9C,MAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MAAM,4BAA4B,IAAI,SAAS,OAAO,KAAK,GAAG;EAG1E,MAAM,MAA+B,EAAE;AACvC,SAAO;AACP,kBAAgB;AAEhB,MAAI,OAAO,OAAO,OAAQ,QAAO;AACjC,MAAI,OAAO,SAAS,KAAK;AACvB,UAAO;AACP,UAAO;;AAGT,SAAO,MAAM,OAAO,QAAQ;AAC1B,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;GAEjC,MAAM,MAAM,aAAa;AAEzB,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,IAClB,OAAM,IAAI,MACR,4BAA4B,IAAI,SAAS,OAAO,KAAK,GACtD;AAEH,UAAO;AAEP,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,YAAY;AAEvB,mBAAgB;AAChB,OAAI,OAAO,OAAO,OAAQ,QAAO;AAEjC,OAAI,OAAO,SAAS,KAAK;AACvB,WAAO;AACP,WAAO;cACE,OAAO,SAAS,KAAK;AAC9B,WAAO;AACP;;AAGF,SAAM,IAAI,MACR,mCAAmC,IAAI,SAAS,OAAO,KAAK,GAC7D;;AAGH,SAAO;;CAGT,MAAM,QAAQ,YAAY;AAC1B,iBAAgB;AAEhB,KAAI,MAAM,OAAO,OACf,OAAM,IAAI,MAAM,yBAAyB,OAAO,KAAK,gBAAgB,MAAM;AAG7E,QAAO;;AAIT,SAAgB,iBAAiB,GAAuB;AAEtD,KAAI;AACF,MAAI,OAAO,MAAM,YAAa,QAAO;AACrC,SAAO,uBAAuB,EAAE;SAC1B;AAEN,SAAO"}

package/dist/utils/json_patch.cjs

@@ -1,11 +1,11 @@
-const require_rolldown_runtime = require('../_virtual/rolldown_runtime.cjs');
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_runtime = require('../_virtual/_rolldown/runtime.cjs');
 const require_core = require('./fast-json-patch/src/core.cjs');
 const require_duplex = require('./fast-json-patch/src/duplex.cjs');
 require('./fast-json-patch/index.cjs');
 
 //#region src/utils/json_patch.ts
-var json_patch_exports = {};
-require_rolldown_runtime.__export(json_patch_exports, {
+var json_patch_exports = /* @__PURE__ */ require_runtime.__exportAll({
 	applyPatch: () => require_core.applyPatch,
 	compare: () => require_duplex.compare
 });

package/dist/utils/json_patch.js

@@ -1,11 +1,10 @@
-import { __export } from "../_virtual/rolldown_runtime.js";
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
 import { applyPatch } from "./fast-json-patch/src/core.js";
 import { compare } from "./fast-json-patch/src/duplex.js";
 import "./fast-json-patch/index.js";
 
 //#region src/utils/json_patch.ts
-var json_patch_exports = {};
-__export(json_patch_exports, {
+var json_patch_exports = /* @__PURE__ */ __exportAll({
 	applyPatch: () => applyPatch,
 	compare: () => compare
 });

package/dist/utils/json_schema.cjs

@@ -1,15 +1,15 @@
-const require_rolldown_runtime = require('../_virtual/rolldown_runtime.cjs');
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_runtime = require('../_virtual/_rolldown/runtime.cjs');
 const require_zod = require('./types/zod.cjs');
 const require_zodToJsonSchema = require('./zod-to-json-schema/zodToJsonSchema.cjs');
 require('./zod-to-json-schema/index.cjs');
-const zod_v4_core = require_rolldown_runtime.__toESM(require("zod/v4/core"));
-const __cfworker_json_schema = require_rolldown_runtime.__toESM(require("@cfworker/json-schema"));
+let zod_v4_core = require("zod/v4/core");
+let _cfworker_json_schema = require("@cfworker/json-schema");
 
 //#region src/utils/json_schema.ts
-var json_schema_exports = {};
-require_rolldown_runtime.__export(json_schema_exports, {
-	Validator: () => __cfworker_json_schema.Validator,
-	deepCompareStrict: () => __cfworker_json_schema.deepCompareStrict,
+var json_schema_exports = /* @__PURE__ */ require_runtime.__exportAll({
+	Validator: () => _cfworker_json_schema.Validator,
+	deepCompareStrict: () => _cfworker_json_schema.deepCompareStrict,
 	toJsonSchema: () => toJsonSchema,
 	validatesOnlyStrings: () => validatesOnlyStrings
 });
@@ -22,10 +22,8 @@ require_rolldown_runtime.__export(json_schema_exports, {
 function toJsonSchema(schema, params) {
 	if (require_zod.isZodSchemaV4(schema)) {
 		const inputSchema = require_zod.interopZodTransformInputSchema(schema, true);
-		if (require_zod.isZodObjectV4(inputSchema)) {
-			const strictSchema = require_zod.interopZodObjectStrict(inputSchema, true);
-			return (0, zod_v4_core.toJSONSchema)(strictSchema, params);
-		} else return (0, zod_v4_core.toJSONSchema)(schema, params);
+		if (require_zod.isZodObjectV4(inputSchema)) return (0, zod_v4_core.toJSONSchema)(require_zod.interopZodObjectStrict(inputSchema, true), params);
+		else return (0, zod_v4_core.toJSONSchema)(schema, params);
 	}
 	if (require_zod.isZodSchemaV3(schema)) return require_zodToJsonSchema.zodToJsonSchema(schema);
 	return schema;
@@ -54,7 +52,7 @@ function validatesOnlyStrings(schema) {
 	if ("not" in schema) return false;
 	if ("$ref" in schema && typeof schema.$ref === "string") {
 		const ref = schema.$ref;
-		const resolved = (0, __cfworker_json_schema.dereference)(schema);
+		const resolved = (0, _cfworker_json_schema.dereference)(schema);
 		if (resolved[ref]) return validatesOnlyStrings(resolved[ref]);
 		return false;
 	}
@@ -65,13 +63,13 @@ function validatesOnlyStrings(schema) {
 Object.defineProperty(exports, 'Validator', {
   enumerable: true,
   get: function () {
-    return __cfworker_json_schema.Validator;
+    return _cfworker_json_schema.Validator;
   }
 });
 Object.defineProperty(exports, 'deepCompareStrict', {
   enumerable: true,
   get: function () {
-    return __cfworker_json_schema.deepCompareStrict;
+    return _cfworker_json_schema.deepCompareStrict;
   }
 });
 Object.defineProperty(exports, 'json_schema_exports', {

package/dist/utils/json_schema.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.cjs","names":["schema: InteropZodType | JSONSchema","params?: ToJSONSchemaParams","isZodSchemaV4","interopZodTransformInputSchema","isZodObjectV4","interopZodObjectStrict","isZodSchemaV3","zodToJsonSchema","schema: unknown"],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  ZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * Converts a Zod schema or JSON schema to a JSON schema.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(\n        inputSchema,\n        true\n      ) as ZodObjectV4;\n      return toJSONSchema(strictSchema, params);\n    } else {\n      return toJSONSchema(schema, params);\n    }\n  }\n  if (isZodSchemaV3(schema)) {\n    return zodToJsonSchema(schema);\n  }\n  return schema as JSONSchema;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,aACdA,QACAC,QACY;AACZ,KAAIC,0BAAc,OAAO,EAAE;EACzB,MAAM,cAAcC,2CAA+B,QAAQ,KAAK;AAChE,MAAIC,0BAAc,YAAY,EAAE;GAC9B,MAAM,eAAeC,mCACnB,aACA,KACD;AACD,wCAAoB,cAAc,OAAO;EAC1C,MACC,sCAAoB,QAAQ,OAAO;CAEtC;AACD,KAAIC,0BAAc,OAAO,CACvB,QAAOC,wCAAgB,OAAO;AAEhC,QAAO;AACR;;;;;;;;AASD,SAAgB,qBAAqBC,QAA0B;AAE7D,KACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,OAAO,CAAC,WAAW,KAC/B,MAAM,QAAQ,OAAO,CAErB,QAAO;AAIT,KAAI,UAAU,QAAQ;AACpB,MAAI,OAAO,OAAO,SAAS,SACzB,QAAO,OAAO,SAAS;AAGzB,MAAI,MAAM,QAAQ,OAAO,KAAK,CAG5B,QAAO,OAAO,KAAK,MAAM,CAAC,MAAM,MAAM,SAAS;AAEjD,SAAO;CACR;AAGD,KAAI,UAAU,OACZ,QACE,MAAM,QAAQ,OAAO,KAAK,IAC1B,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,MAAM,CAAC,QAAQ,OAAO,QAAQ,SAAS;AAKvD,KAAI,WAAW,OACb,QAAO,OAAO,OAAO,UAAU;AAIjC,KAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,CAElD,QAAO,OAAO,MAAM,KAAK,CAAC,cAAc,qBAAqB,UAAU,CAAC;AAG1E,KACG,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,IAChD,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,EACjD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;AAI5C,SACE,WAAW,SAAS,KACpB,WAAW,MAAM,CAAC,cAAc,qBAAqB,UAAU,CAAC;CAEnE;AAGD,KAAI,SAAS,OACX,QAAO;AAGT,KAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,mDAAuB,OAAiB;AAC9C,MAAI,SAAS,KACX,QAAO,qBAAqB,SAAS,KAAK;AAE5C,SAAO;CACR;AAKD,QAAO;AACR"}
+{"version":3,"file":"json_schema.cjs","names":["isZodSchemaV4","interopZodTransformInputSchema","isZodObjectV4","interopZodObjectStrict","isZodSchemaV3","zodToJsonSchema"],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  ZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * Converts a Zod schema or JSON schema to a JSON schema.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(\n        inputSchema,\n        true\n      ) as ZodObjectV4;\n      return toJSONSchema(strictSchema, params);\n    } else {\n      return toJSONSchema(schema, params);\n    }\n  }\n  if (isZodSchemaV3(schema)) {\n    return zodToJsonSchema(schema);\n  }\n  return schema as JSONSchema;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,aACd,QACA,QACY;AACZ,KAAIA,0BAAc,OAAO,EAAE;EACzB,MAAM,cAAcC,2CAA+B,QAAQ,KAAK;AAChE,MAAIC,0BAAc,YAAY,CAK5B,sCAJqBC,mCACnB,aACA,KACD,EACiC,OAAO;MAEzC,sCAAoB,QAAQ,OAAO;;AAGvC,KAAIC,0BAAc,OAAO,CACvB,QAAOC,wCAAgB,OAAO;AAEhC,QAAO;;;;;;;;;AAUT,SAAgB,qBAAqB,QAA0B;AAE7D,KACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,OAAO,CAAC,WAAW,KAC/B,MAAM,QAAQ,OAAO,CAErB,QAAO;AAIT,KAAI,UAAU,QAAQ;AACpB,MAAI,OAAO,OAAO,SAAS,SACzB,QAAO,OAAO,SAAS;AAGzB,MAAI,MAAM,QAAQ,OAAO,KAAK,CAG5B,QAAO,OAAO,KAAK,OAAO,MAAM,MAAM,SAAS;AAEjD,SAAO;;AAIT,KAAI,UAAU,OACZ,QACE,MAAM,QAAQ,OAAO,KAAK,IAC1B,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,OAAO,QAAQ,OAAO,QAAQ,SAAS;AAKvD,KAAI,WAAW,OACb,QAAO,OAAO,OAAO,UAAU;AAIjC,KAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,CAElD,QAAO,OAAO,MAAM,MAAM,cAAc,qBAAqB,UAAU,CAAC;AAG1E,KACG,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,IAChD,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,EACjD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;AAI5C,SACE,WAAW,SAAS,KACpB,WAAW,OAAO,cAAc,qBAAqB,UAAU,CAAC;;AAKpE,KAAI,SAAS,OACX,QAAO;AAGT,KAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,kDAAuB,OAAiB;AAC9C,MAAI,SAAS,KACX,QAAO,qBAAqB,SAAS,KAAK;AAE5C,SAAO;;AAMT,QAAO"}

package/dist/utils/json_schema.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.d.cts","names":["toJSONSchema","InteropZodType","JsonSchema7Type","JSONSchema","deepCompareStrict","Validator","ToJSONSchemaParams","Parameters","NonNullable","toJsonSchema","validatesOnlyStrings","JsonSchema7ArrayType","JsonSchema7ObjectType","JsonSchema7StringType","JsonSchema7NumberType","JsonSchema7NullableType"],"sources":["../../src/utils/json_schema.d.ts"],"sourcesContent":["import { toJSONSchema } from \"zod/v4/core\";\nimport { InteropZodType } from \"./types/zod.js\";\nimport { type JsonSchema7Type as JSONSchema } from \"./zod-to-json-schema/index.js\";\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\nexport type ToJSONSchemaParams = NonNullable<Parameters<typeof toJSONSchema>[1]>;\n/**\n * Converts a Zod schema or JSON schema to a JSON schema.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport declare function toJsonSchema(schema: InteropZodType | JSONSchema, params?: ToJSONSchemaParams): JSONSchema;\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport declare function validatesOnlyStrings(schema: unknown): boolean;\nexport { type JsonSchema7Type, type JsonSchema7Type as JSONSchema, type JsonSchema7ArrayType, type JsonSchema7ObjectType, type JsonSchema7StringType, type JsonSchema7NumberType, type JsonSchema7NullableType, } from \"./zod-to-json-schema/index.js\";\n//# sourceMappingURL=json_schema.d.ts.map"],"mappings":";;;;;;;;;;;KAIYM,kBAAAA,GAAqBE,YAAYD,kBAAkBP;;;;;;;AAAnDM,iBAOYG,YAAAA,CAPM,MAAA,EAOeR,cAPf,GAOgCE,eAPhC,EAAA,MAAA,CAAA,EAOqDG,kBAPrD,CAAA,EAO0EH,eAP1E;;;;AAAc;AAO5C;;;AAAmFG,iBAQ3DI,oBAAAA,CAR2DJ,MAAAA,EAAAA,OAAAA,CAAAA,EAAAA,OAAAA"}
+{"version":3,"file":"json_schema.d.cts","names":[],"sources":["../../src/utils/json_schema.ts"],"mappings":";;;;;;;;;;;KAkBY,kBAAA,GAAqB,WAAA,CAC/B,UAAA,QAAkB,YAAA;;;;;;;iBASJ,YAAA,CACd,MAAA,EAAQ,cAAA,GAAiB,eAAA,EACzB,MAAA,GAAS,kBAAA,GACR,eAAA;;;;;;;;iBA0Ba,oBAAA,CAAqB,MAAA"}

package/dist/utils/json_schema.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.d.ts","names":["toJSONSchema","InteropZodType","JsonSchema7Type","JSONSchema","deepCompareStrict","Validator","ToJSONSchemaParams","Parameters","NonNullable","toJsonSchema","validatesOnlyStrings","JsonSchema7ArrayType","JsonSchema7ObjectType","JsonSchema7StringType","JsonSchema7NumberType","JsonSchema7NullableType"],"sources":["../../src/utils/json_schema.d.ts"],"sourcesContent":["import { toJSONSchema } from \"zod/v4/core\";\nimport { InteropZodType } from \"./types/zod.js\";\nimport { type JsonSchema7Type as JSONSchema } from \"./zod-to-json-schema/index.js\";\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\nexport type ToJSONSchemaParams = NonNullable<Parameters<typeof toJSONSchema>[1]>;\n/**\n * Converts a Zod schema or JSON schema to a JSON schema.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport declare function toJsonSchema(schema: InteropZodType | JSONSchema, params?: ToJSONSchemaParams): JSONSchema;\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport declare function validatesOnlyStrings(schema: unknown): boolean;\nexport { type JsonSchema7Type, type JsonSchema7Type as JSONSchema, type JsonSchema7ArrayType, type JsonSchema7ObjectType, type JsonSchema7StringType, type JsonSchema7NumberType, type JsonSchema7NullableType, } from \"./zod-to-json-schema/index.js\";\n//# sourceMappingURL=json_schema.d.ts.map"],"mappings":";;;;;;;;;;;;KAIYM,kBAAAA,GAAqBE,YAAYD,kBAAkBP;;;;;;;iBAOvCS,YAAAA,SAAqBR,iBAAiBE,0BAAqBG,qBAAqBH;AAPxG;;;;AAA4C;AAO5C;;AAA8DA,iBAQtCO,oBAAAA,CARsCP,MAAAA,EAAAA,OAAAA,CAAAA,EAAAA,OAAAA"}
+{"version":3,"file":"json_schema.d.ts","names":[],"sources":["../../src/utils/json_schema.ts"],"mappings":";;;;;;;;;;;;KAkBY,kBAAA,GAAqB,WAAA,CAC/B,UAAA,QAAkB,YAAA;;;;;;;iBASJ,YAAA,CACd,MAAA,EAAQ,cAAA,GAAiB,eAAA,EACzB,MAAA,GAAS,kBAAA,GACR,eAAA;AAbH;;;;;;;AAAA,iBAuCgB,oBAAA,CAAqB,MAAA"}

package/dist/utils/json_schema.js

@@ -1,4 +1,4 @@
-import { __export } from "../_virtual/rolldown_runtime.js";
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
 import { interopZodObjectStrict, interopZodTransformInputSchema, isZodObjectV4, isZodSchemaV3, isZodSchemaV4 } from "./types/zod.js";
 import { zodToJsonSchema } from "./zod-to-json-schema/zodToJsonSchema.js";
 import "./zod-to-json-schema/index.js";
@@ -6,8 +6,7 @@ import { toJSONSchema } from "zod/v4/core";
 import { Validator, deepCompareStrict, dereference } from "@cfworker/json-schema";
 
 //#region src/utils/json_schema.ts
-var json_schema_exports = {};
-__export(json_schema_exports, {
+var json_schema_exports = /* @__PURE__ */ __exportAll({
 	Validator: () => Validator,
 	deepCompareStrict: () => deepCompareStrict,
 	toJsonSchema: () => toJsonSchema,
@@ -22,10 +21,8 @@ __export(json_schema_exports, {
 function toJsonSchema(schema, params) {
 	if (isZodSchemaV4(schema)) {
 		const inputSchema = interopZodTransformInputSchema(schema, true);
-		if (isZodObjectV4(inputSchema)) {
-			const strictSchema = interopZodObjectStrict(inputSchema, true);
-			return toJSONSchema(strictSchema, params);
-		} else return toJSONSchema(schema, params);
+		if (isZodObjectV4(inputSchema)) return toJSONSchema(interopZodObjectStrict(inputSchema, true), params);
+		else return toJSONSchema(schema, params);
 	}
 	if (isZodSchemaV3(schema)) return zodToJsonSchema(schema);
 	return schema;

package/dist/utils/json_schema.js.map

@@ -1 +1 @@
-{"version":3,"file":"json_schema.js","names":["schema: InteropZodType | JSONSchema","params?: ToJSONSchemaParams","schema: unknown"],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  ZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * Converts a Zod schema or JSON schema to a JSON schema.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(\n        inputSchema,\n        true\n      ) as ZodObjectV4;\n      return toJSONSchema(strictSchema, params);\n    } else {\n      return toJSONSchema(schema, params);\n    }\n  }\n  if (isZodSchemaV3(schema)) {\n    return zodToJsonSchema(schema);\n  }\n  return schema as JSONSchema;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,aACdA,QACAC,QACY;AACZ,KAAI,cAAc,OAAO,EAAE;EACzB,MAAM,cAAc,+BAA+B,QAAQ,KAAK;AAChE,MAAI,cAAc,YAAY,EAAE;GAC9B,MAAM,eAAe,uBACnB,aACA,KACD;AACD,UAAO,aAAa,cAAc,OAAO;EAC1C,MACC,QAAO,aAAa,QAAQ,OAAO;CAEtC;AACD,KAAI,cAAc,OAAO,CACvB,QAAO,gBAAgB,OAAO;AAEhC,QAAO;AACR;;;;;;;;AASD,SAAgB,qBAAqBC,QAA0B;AAE7D,KACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,OAAO,CAAC,WAAW,KAC/B,MAAM,QAAQ,OAAO,CAErB,QAAO;AAIT,KAAI,UAAU,QAAQ;AACpB,MAAI,OAAO,OAAO,SAAS,SACzB,QAAO,OAAO,SAAS;AAGzB,MAAI,MAAM,QAAQ,OAAO,KAAK,CAG5B,QAAO,OAAO,KAAK,MAAM,CAAC,MAAM,MAAM,SAAS;AAEjD,SAAO;CACR;AAGD,KAAI,UAAU,OACZ,QACE,MAAM,QAAQ,OAAO,KAAK,IAC1B,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,MAAM,CAAC,QAAQ,OAAO,QAAQ,SAAS;AAKvD,KAAI,WAAW,OACb,QAAO,OAAO,OAAO,UAAU;AAIjC,KAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,CAElD,QAAO,OAAO,MAAM,KAAK,CAAC,cAAc,qBAAqB,UAAU,CAAC;AAG1E,KACG,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,IAChD,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,EACjD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;AAI5C,SACE,WAAW,SAAS,KACpB,WAAW,MAAM,CAAC,cAAc,qBAAqB,UAAU,CAAC;CAEnE;AAGD,KAAI,SAAS,OACX,QAAO;AAGT,KAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,WAAW,YAAY,OAAiB;AAC9C,MAAI,SAAS,KACX,QAAO,qBAAqB,SAAS,KAAK;AAE5C,SAAO;CACR;AAKD,QAAO;AACR"}
+{"version":3,"file":"json_schema.js","names":[],"sources":["../../src/utils/json_schema.ts"],"sourcesContent":["import { toJSONSchema } from \"zod/v4/core\";\nimport { dereference, type Schema } from \"@cfworker/json-schema\";\nimport {\n  isZodSchemaV3,\n  isZodSchemaV4,\n  InteropZodType,\n  interopZodObjectStrict,\n  isZodObjectV4,\n  ZodObjectV4,\n  interopZodTransformInputSchema,\n} from \"./types/zod.js\";\nimport {\n  type JsonSchema7Type as JSONSchema,\n  zodToJsonSchema,\n} from \"./zod-to-json-schema/index.js\";\n\nexport { deepCompareStrict, Validator } from \"@cfworker/json-schema\";\n\nexport type ToJSONSchemaParams = NonNullable<\n  Parameters<typeof toJSONSchema>[1]\n>;\n\n/**\n * Converts a Zod schema or JSON schema to a JSON schema.\n * @param schema - The schema to convert.\n * @param params - The parameters to pass to the toJSONSchema function.\n * @returns The converted schema.\n */\nexport function toJsonSchema(\n  schema: InteropZodType | JSONSchema,\n  params?: ToJSONSchemaParams\n): JSONSchema {\n  if (isZodSchemaV4(schema)) {\n    const inputSchema = interopZodTransformInputSchema(schema, true);\n    if (isZodObjectV4(inputSchema)) {\n      const strictSchema = interopZodObjectStrict(\n        inputSchema,\n        true\n      ) as ZodObjectV4;\n      return toJSONSchema(strictSchema, params);\n    } else {\n      return toJSONSchema(schema, params);\n    }\n  }\n  if (isZodSchemaV3(schema)) {\n    return zodToJsonSchema(schema);\n  }\n  return schema as JSONSchema;\n}\n\n/**\n * Validates if a JSON schema validates only strings. May return false negatives in some edge cases\n * (like recursive or unresolvable refs).\n *\n * @param schema - The schema to validate.\n * @returns `true` if the schema validates only strings, `false` otherwise.\n */\nexport function validatesOnlyStrings(schema: unknown): boolean {\n  // Null, undefined, or empty schema\n  if (\n    !schema ||\n    typeof schema !== \"object\" ||\n    Object.keys(schema).length === 0 ||\n    Array.isArray(schema)\n  ) {\n    return false; // Validates anything, not just strings\n  }\n\n  // Explicit type constraint\n  if (\"type\" in schema) {\n    if (typeof schema.type === \"string\") {\n      return schema.type === \"string\";\n    }\n\n    if (Array.isArray(schema.type)) {\n      // not sure why someone would do `\"type\": [\"string\"]` or especially `\"type\": [\"string\",\n      // \"string\", \"string\", ...]` but we're not here to judge\n      return schema.type.every((t) => t === \"string\");\n    }\n    return false; // Invalid or non-string type\n  }\n\n  // Enum with only string values\n  if (\"enum\" in schema) {\n    return (\n      Array.isArray(schema.enum) &&\n      schema.enum.length > 0 &&\n      schema.enum.every((val) => typeof val === \"string\")\n    );\n  }\n\n  // String constant\n  if (\"const\" in schema) {\n    return typeof schema.const === \"string\";\n  }\n\n  // Schema combinations\n  if (\"allOf\" in schema && Array.isArray(schema.allOf)) {\n    // If any subschema validates only strings, then the overall schema validates only strings\n    return schema.allOf.some((subschema) => validatesOnlyStrings(subschema));\n  }\n\n  if (\n    (\"anyOf\" in schema && Array.isArray(schema.anyOf)) ||\n    (\"oneOf\" in schema && Array.isArray(schema.oneOf))\n  ) {\n    const subschemas = (\n      \"anyOf\" in schema ? schema.anyOf : schema.oneOf\n    ) as unknown[];\n\n    // All subschemas must validate only strings\n    return (\n      subschemas.length > 0 &&\n      subschemas.every((subschema) => validatesOnlyStrings(subschema))\n    );\n  }\n\n  // We're not going to try on this one, it's too complex - we just assume if it has a \"not\" key and hasn't matched one of the above checks, it's not a string schema.\n  if (\"not\" in schema) {\n    return false; // The not case can validate non-strings\n  }\n\n  if (\"$ref\" in schema && typeof schema.$ref === \"string\") {\n    const ref = schema.$ref as string;\n    const resolved = dereference(schema as Schema);\n    if (resolved[ref]) {\n      return validatesOnlyStrings(resolved[ref]);\n    }\n    return false;\n  }\n\n  // ignore recursive refs and other cases where type is omitted for now\n  // ignore other cases for now where type is omitted\n\n  return false;\n}\n\n// Re-export of the types used throughout langchain for json schema serialization.\n// The plan is to eventually nix zod-to-json-schema altogether in place for\n// zod v4 / a more standardized way of serializing validated inputs, so its re-exported\n// here to remove the dependency on zod-to-json-schema in downstream packages until\n// a determination is made.\n\nexport {\n  type JsonSchema7Type,\n  type JsonSchema7Type as JSONSchema,\n  type JsonSchema7ArrayType,\n  type JsonSchema7ObjectType,\n  type JsonSchema7StringType,\n  type JsonSchema7NumberType,\n  type JsonSchema7NullableType,\n} from \"./zod-to-json-schema/index.js\";\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AA4BA,SAAgB,aACd,QACA,QACY;AACZ,KAAI,cAAc,OAAO,EAAE;EACzB,MAAM,cAAc,+BAA+B,QAAQ,KAAK;AAChE,MAAI,cAAc,YAAY,CAK5B,QAAO,aAJc,uBACnB,aACA,KACD,EACiC,OAAO;MAEzC,QAAO,aAAa,QAAQ,OAAO;;AAGvC,KAAI,cAAc,OAAO,CACvB,QAAO,gBAAgB,OAAO;AAEhC,QAAO;;;;;;;;;AAUT,SAAgB,qBAAqB,QAA0B;AAE7D,KACE,CAAC,UACD,OAAO,WAAW,YAClB,OAAO,KAAK,OAAO,CAAC,WAAW,KAC/B,MAAM,QAAQ,OAAO,CAErB,QAAO;AAIT,KAAI,UAAU,QAAQ;AACpB,MAAI,OAAO,OAAO,SAAS,SACzB,QAAO,OAAO,SAAS;AAGzB,MAAI,MAAM,QAAQ,OAAO,KAAK,CAG5B,QAAO,OAAO,KAAK,OAAO,MAAM,MAAM,SAAS;AAEjD,SAAO;;AAIT,KAAI,UAAU,OACZ,QACE,MAAM,QAAQ,OAAO,KAAK,IAC1B,OAAO,KAAK,SAAS,KACrB,OAAO,KAAK,OAAO,QAAQ,OAAO,QAAQ,SAAS;AAKvD,KAAI,WAAW,OACb,QAAO,OAAO,OAAO,UAAU;AAIjC,KAAI,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,CAElD,QAAO,OAAO,MAAM,MAAM,cAAc,qBAAqB,UAAU,CAAC;AAG1E,KACG,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,IAChD,WAAW,UAAU,MAAM,QAAQ,OAAO,MAAM,EACjD;EACA,MAAM,aACJ,WAAW,SAAS,OAAO,QAAQ,OAAO;AAI5C,SACE,WAAW,SAAS,KACpB,WAAW,OAAO,cAAc,qBAAqB,UAAU,CAAC;;AAKpE,KAAI,SAAS,OACX,QAAO;AAGT,KAAI,UAAU,UAAU,OAAO,OAAO,SAAS,UAAU;EACvD,MAAM,MAAM,OAAO;EACnB,MAAM,WAAW,YAAY,OAAiB;AAC9C,MAAI,SAAS,KACX,QAAO,qBAAqB,SAAS,KAAK;AAE5C,SAAO;;AAMT,QAAO"}

package/dist/utils/math.cjs

@@ -1,14 +1,14 @@
-const require_rolldown_runtime = require('../_virtual/rolldown_runtime.cjs');
+Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
+const require_runtime = require('../_virtual/_rolldown/runtime.cjs');
 const require_similarities = require('./ml-distance/similarities.cjs');
 const require_distances = require('./ml-distance/distances.cjs');
 const require_euclidean = require('./ml-distance-euclidean/euclidean.cjs');
 
 //#region src/utils/math.ts
-var math_exports = {};
-require_rolldown_runtime.__export(math_exports, {
+var math_exports = /* @__PURE__ */ require_runtime.__exportAll({
 	cosineSimilarity: () => cosineSimilarity,
 	euclideanDistance: () => euclideanDistance,
-	innerProduct: () => innerProduct$1,
+	innerProduct: () => innerProduct,
 	matrixFunc: () => matrixFunc,
 	maximalMarginalRelevance: () => maximalMarginalRelevance,
 	normalize: () => normalize
@@ -46,7 +46,7 @@ function normalize(M, similarity = false) {
 function cosineSimilarity(X, Y) {
 	return matrixFunc(X, Y, require_similarities.cosine);
 }
-function innerProduct$1(X, Y) {
+function innerProduct(X, Y) {
 	return matrixFunc(X, Y, require_distances.innerProduct);
 }
 function euclideanDistance(X, Y) {
@@ -65,8 +65,7 @@ function euclideanDistance(X, Y) {
 */
 function maximalMarginalRelevance(queryEmbedding, embeddingList, lambda = .5, k = 4) {
 	if (Math.min(k, embeddingList.length) <= 0) return [];
-	const queryEmbeddingExpanded = Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding];
-	const similarityToQuery = cosineSimilarity(queryEmbeddingExpanded, embeddingList)[0];
+	const similarityToQuery = cosineSimilarity(Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding], embeddingList)[0];
 	const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;
 	const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];
 	const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];
@@ -117,7 +116,7 @@ function matrixMaxVal(arrays) {
 //#endregion
 exports.cosineSimilarity = cosineSimilarity;
 exports.euclideanDistance = euclideanDistance;
-exports.innerProduct = innerProduct$1;
+exports.innerProduct = innerProduct;
 Object.defineProperty(exports, 'math_exports', {
   enumerable: true,
   get: function () {

package/dist/utils/math.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"math.cjs","names":["X: number[][]","Y: number[][]","func: VectorFunction","M: number[][]","cosine","innerProduct","innerProductDistance","euclidean","queryEmbedding: number[] | number[][]","embeddingList: number[][]","array: number[]","arrays: number[][]"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACdA,GACAC,GACAC,MACY;AACZ,KACE,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,EAEhB,QAAO,CAAC,CAAE,CAAC;AAGb,KAAI,EAAE,GAAG,WAAW,EAAE,GAAG,OACvB,OAAM,IAAI,MACR,CAAC,2DAA2D,EAAE,CAC5D,EAAE,QACF,EAAE,GAAG,MACN,EAAC,iBAAiB,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,MAAO,EAAC,CAAC,CAAC;AAInD,QAAO,EAAE,IAAI,CAAC,YACZ,EAAE,IAAI,CAAC,YAAY,KAAK,SAAS,QAAQ,CAAC,CAAC,IAAI,CAAC,eAC9C,OAAO,MAAM,WAAW,GAAG,IAAI,WAChC,CACF;AACF;AAED,SAAgB,UAAUC,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,EAAE;AAC3B,QAAO,EAAE,IAAI,CAAC,QACZ,IAAI,IAAI,CAAC,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,IAAK,CAC3D;AACF;;;;;;;;;;;AAYD,SAAgB,iBAAiBH,GAAeC,GAA2B;AACzE,QAAO,WAAW,GAAG,GAAGG,4BAAO;AAChC;AAED,SAAgBC,eAAaL,GAAeC,GAA2B;AACrE,QAAO,WAAW,GAAG,GAAGK,+BAAqB;AAC9C;AAED,SAAgB,kBAAkBN,GAAeC,GAA2B;AAC1E,QAAO,WAAW,GAAG,GAAGM,4BAAU;AACnC;;;;;;;;;;;;AAaD,SAAgB,yBACdC,gBACAC,eACA,SAAS,IACT,IAAI,GACM;AACV,KAAI,KAAK,IAAI,GAAG,cAAc,OAAO,IAAI,EACvC,QAAO,CAAE;CAGX,MAAM,yBACJ,MAAM,QAAQ,eAAe,GAAG,GAAG,iBAAiB,CAAC,cAAe;CAGtE,MAAM,oBAAoB,iBACxB,wBACA,cACD,CAAC;CACF,MAAM,4BAA4B,OAAO,kBAAkB,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,0BAA2B;CACrE,MAAM,4BAA4B,CAAC,yBAA0B;AAE7D,QAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,OAAO,EAAE;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,mBACD;EAED,kBAAkB,QAAQ,CAAC,YAAY,oBAAoB;AACzD,OAAI,0BAA0B,SAAS,gBAAgB,CACrD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,iBACzB;GACD,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;AAEvC,OAAI,QAAQ,WAAW;IACrB,YAAY;IACZ,YAAY;GACb;EACF,EAAC;EACF,mBAAmB,KAAK,cAAc,WAAW;EACjD,0BAA0B,KAAK,UAAU;CAC1C;AAED,QAAO;AACR;;;;;;;AAaD,SAAS,OAAOC,OAA0B;AACxC,KAAI,MAAM,WAAW,EACnB,QAAO;EACL,UAAU;EACV,UAAU;CACX;CAGH,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EACrC,KAAI,MAAM,KAAK,UAAU;EACvB,WAAW;EACX,WAAW,MAAM;CAClB;AAEH,QAAO;EAAE;EAAU;CAAU;AAC9B;AAED,SAAS,aAAaC,QAA4B;AAChD,QAAO,OAAO,OACZ,CAAC,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC,SAAS,EACrD,EACD;AACF"}
+{"version":3,"file":"math.cjs","names":["cosine","innerProductDistance","euclidean"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,GACA,GACA,MACY;AACZ,KACE,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,EAEhB,QAAO,CAAC,EAAE,CAAC;AAGb,KAAI,EAAE,GAAG,WAAW,EAAE,GAAG,OACvB,OAAM,IAAI,MACR,8DAA8D,CAC5D,EAAE,QACF,EAAE,GAAG,OACN,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,GAC9C;AAGH,QAAO,EAAE,KAAK,YACZ,EAAE,KAAK,YAAY,KAAK,SAAS,QAAQ,CAAC,CAAC,KAAK,eAC9C,OAAO,MAAM,WAAW,GAAG,IAAI,WAChC,CACF;;AAGH,SAAgB,UAAU,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,EAAE;AAC3B,QAAO,EAAE,KAAK,QACZ,IAAI,KAAK,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,IAAK,CAC3D;;;;;;;;;;;;AAaH,SAAgB,iBAAiB,GAAe,GAA2B;AACzE,QAAO,WAAW,GAAG,GAAGA,4BAAO;;AAGjC,SAAgB,aAAa,GAAe,GAA2B;AACrE,QAAO,WAAW,GAAG,GAAGC,+BAAqB;;AAG/C,SAAgB,kBAAkB,GAAe,GAA2B;AAC1E,QAAO,WAAW,GAAG,GAAGC,4BAAU;;;;;;;;;;;;;AAcpC,SAAgB,yBACd,gBACA,eACA,SAAS,IACT,IAAI,GACM;AACV,KAAI,KAAK,IAAI,GAAG,cAAc,OAAO,IAAI,EACvC,QAAO,EAAE;CAOX,MAAM,oBAAoB,iBAHxB,MAAM,QAAQ,eAAe,GAAG,GAAG,iBAAiB,CAAC,eAAe,EAKpE,cACD,CAAC;CACF,MAAM,4BAA4B,OAAO,kBAAkB,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,2BAA2B;CACrE,MAAM,4BAA4B,CAAC,0BAA0B;AAE7D,QAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,OAAO,EAAE;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,mBACD;AAED,oBAAkB,SAAS,YAAY,oBAAoB;AACzD,OAAI,0BAA0B,SAAS,gBAAgB,CACrD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,iBACzB;GACD,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;AAEvC,OAAI,QAAQ,WAAW;AACrB,gBAAY;AACZ,gBAAY;;IAEd;AACF,qBAAmB,KAAK,cAAc,WAAW;AACjD,4BAA0B,KAAK,UAAU;;AAG3C,QAAO;;;;;;;;AAcT,SAAS,OAAO,OAA0B;AACxC,KAAI,MAAM,WAAW,EACnB,QAAO;EACL,UAAU;EACV,UAAU;EACX;CAGH,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EACrC,KAAI,MAAM,KAAK,UAAU;AACvB,aAAW;AACX,aAAW,MAAM;;AAGrB,QAAO;EAAE;EAAU;EAAU;;AAG/B,SAAS,aAAa,QAA4B;AAChD,QAAO,OAAO,QACX,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC,SAAS,EACrD,EACD"}

package/dist/utils/math.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"math.d.cts","names":["VectorFunction","matrixFunc","normalize","cosineSimilarity","innerProduct","euclideanDistance","maximalMarginalRelevance"],"sources":["../../src/utils/math.d.ts"],"sourcesContent":["type VectorFunction = (xVector: number[], yVector: number[]) => number;\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\nexport declare function matrixFunc(X: number[][], Y: number[][], func: VectorFunction): number[][];\nexport declare function normalize(M: number[][], similarity?: boolean): number[][];\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport declare function cosineSimilarity(X: number[][], Y: number[][]): number[][];\nexport declare function innerProduct(X: number[][], Y: number[][]): number[][];\nexport declare function euclideanDistance(X: number[][], Y: number[][]): number[][];\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport declare function maximalMarginalRelevance(queryEmbedding: number[] | number[][], embeddingList: number[][], lambda?: number, k?: number): number[];\nexport {};\n//# sourceMappingURL=math.d.ts.map"],"mappings":";KAAKA,cAAAA;;AAYL;AACA;AAWA;AACA;AACA;AAYA;;;;;iBA1BwBC,UAAAA,qCAA+CD;iBAC/CE,SAAAA;;;;;;;;;;;iBAWAC,gBAAAA;iBACAC,YAAAA;iBACAC,iBAAAA;;;;;;;;;;;;iBAYAC,wBAAAA"}
+{"version":3,"file":"math.d.cts","names":[],"sources":["../../src/utils/math.ts"],"mappings":";KAIK,cAAA,IAAkB,OAAA,YAAmB,OAAA;;;;;;AAc1C;;;;;;iBAAgB,UAAA,CACd,CAAA,cACA,CAAA,cACA,IAAA,EAAM,cAAA;AAAA,iBA2BQ,SAAA,CAAU,CAAA,cAAe,UAAA;;;AAAzC;;;;;AAiBA;;;iBAAgB,gBAAA,CAAiB,CAAA,cAAe,CAAA;AAAA,iBAIhC,YAAA,CAAa,CAAA,cAAe,CAAA;AAAA,iBAI5B,iBAAA,CAAkB,CAAA,cAAe,CAAA;;;;;AAAjD;;;;;AAeA;;iBAAgB,wBAAA,CACd,cAAA,yBACA,aAAA,cACA,MAAA,WACA,CAAA"}

package/dist/utils/math.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"math.d.ts","names":["VectorFunction","matrixFunc","normalize","cosineSimilarity","innerProduct","euclideanDistance","maximalMarginalRelevance"],"sources":["../../src/utils/math.d.ts"],"sourcesContent":["type VectorFunction = (xVector: number[], yVector: number[]) => number;\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\nexport declare function matrixFunc(X: number[][], Y: number[][], func: VectorFunction): number[][];\nexport declare function normalize(M: number[][], similarity?: boolean): number[][];\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport declare function cosineSimilarity(X: number[][], Y: number[][]): number[][];\nexport declare function innerProduct(X: number[][], Y: number[][]): number[][];\nexport declare function euclideanDistance(X: number[][], Y: number[][]): number[][];\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport declare function maximalMarginalRelevance(queryEmbedding: number[] | number[][], embeddingList: number[][], lambda?: number, k?: number): number[];\nexport {};\n//# sourceMappingURL=math.d.ts.map"],"mappings":";KAAKA,cAAAA;;AAYL;AACA;AAWA;AACA;AACA;AAYA;;;;;iBA1BwBC,UAAAA,qCAA+CD;iBAC/CE,SAAAA;;;;;;;;;;;iBAWAC,gBAAAA;iBACAC,YAAAA;iBACAC,iBAAAA;;;;;;;;;;;;iBAYAC,wBAAAA"}
+{"version":3,"file":"math.d.ts","names":[],"sources":["../../src/utils/math.ts"],"mappings":";KAIK,cAAA,IAAkB,OAAA,YAAmB,OAAA;;;;;;AAc1C;;;;;;iBAAgB,UAAA,CACd,CAAA,cACA,CAAA,cACA,IAAA,EAAM,cAAA;AAAA,iBA2BQ,SAAA,CAAU,CAAA,cAAe,UAAA;;;AAAzC;;;;;AAiBA;;;iBAAgB,gBAAA,CAAiB,CAAA,cAAe,CAAA;AAAA,iBAIhC,YAAA,CAAa,CAAA,cAAe,CAAA;AAAA,iBAI5B,iBAAA,CAAkB,CAAA,cAAe,CAAA;;;;;AAAjD;;;;;AAeA;;iBAAgB,wBAAA,CACd,cAAA,yBACA,aAAA,cACA,MAAA,WACA,CAAA"}

package/dist/utils/math.js

@@ -1,14 +1,13 @@
-import { __export } from "../_virtual/rolldown_runtime.js";
+import { __exportAll } from "../_virtual/_rolldown/runtime.js";
 import { cosine } from "./ml-distance/similarities.js";
-import { innerProduct } from "./ml-distance/distances.js";
+import { innerProduct as innerProduct$1 } from "./ml-distance/distances.js";
 import { euclidean } from "./ml-distance-euclidean/euclidean.js";
 
 //#region src/utils/math.ts
-var math_exports = {};
-__export(math_exports, {
+var math_exports = /* @__PURE__ */ __exportAll({
 	cosineSimilarity: () => cosineSimilarity,
 	euclideanDistance: () => euclideanDistance,
-	innerProduct: () => innerProduct$1,
+	innerProduct: () => innerProduct,
 	matrixFunc: () => matrixFunc,
 	maximalMarginalRelevance: () => maximalMarginalRelevance,
 	normalize: () => normalize
@@ -46,8 +45,8 @@ function normalize(M, similarity = false) {
 function cosineSimilarity(X, Y) {
 	return matrixFunc(X, Y, cosine);
 }
-function innerProduct$1(X, Y) {
-	return matrixFunc(X, Y, innerProduct);
+function innerProduct(X, Y) {
+	return matrixFunc(X, Y, innerProduct$1);
 }
 function euclideanDistance(X, Y) {
 	return matrixFunc(X, Y, euclidean);
@@ -65,8 +64,7 @@ function euclideanDistance(X, Y) {
 */
 function maximalMarginalRelevance(queryEmbedding, embeddingList, lambda = .5, k = 4) {
 	if (Math.min(k, embeddingList.length) <= 0) return [];
-	const queryEmbeddingExpanded = Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding];
-	const similarityToQuery = cosineSimilarity(queryEmbeddingExpanded, embeddingList)[0];
+	const similarityToQuery = cosineSimilarity(Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding], embeddingList)[0];
 	const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;
 	const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];
 	const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];
@@ -115,5 +113,5 @@ function matrixMaxVal(arrays) {
 }
 
 //#endregion
-export { cosineSimilarity, euclideanDistance, innerProduct$1 as innerProduct, math_exports, matrixFunc, maximalMarginalRelevance, normalize };
+export { cosineSimilarity, euclideanDistance, innerProduct, math_exports, matrixFunc, maximalMarginalRelevance, normalize };
 //# sourceMappingURL=math.js.map

package/dist/utils/math.js.map

@@ -1 +1 @@
-{"version":3,"file":"math.js","names":["X: number[][]","Y: number[][]","func: VectorFunction","M: number[][]","innerProduct","innerProductDistance","queryEmbedding: number[] | number[][]","embeddingList: number[][]","array: number[]","arrays: number[][]"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACdA,GACAC,GACAC,MACY;AACZ,KACE,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,EAEhB,QAAO,CAAC,CAAE,CAAC;AAGb,KAAI,EAAE,GAAG,WAAW,EAAE,GAAG,OACvB,OAAM,IAAI,MACR,CAAC,2DAA2D,EAAE,CAC5D,EAAE,QACF,EAAE,GAAG,MACN,EAAC,iBAAiB,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,MAAO,EAAC,CAAC,CAAC;AAInD,QAAO,EAAE,IAAI,CAAC,YACZ,EAAE,IAAI,CAAC,YAAY,KAAK,SAAS,QAAQ,CAAC,CAAC,IAAI,CAAC,eAC9C,OAAO,MAAM,WAAW,GAAG,IAAI,WAChC,CACF;AACF;AAED,SAAgB,UAAUC,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,EAAE;AAC3B,QAAO,EAAE,IAAI,CAAC,QACZ,IAAI,IAAI,CAAC,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,IAAK,CAC3D;AACF;;;;;;;;;;;AAYD,SAAgB,iBAAiBH,GAAeC,GAA2B;AACzE,QAAO,WAAW,GAAG,GAAG,OAAO;AAChC;AAED,SAAgBG,eAAaJ,GAAeC,GAA2B;AACrE,QAAO,WAAW,GAAG,GAAGI,aAAqB;AAC9C;AAED,SAAgB,kBAAkBL,GAAeC,GAA2B;AAC1E,QAAO,WAAW,GAAG,GAAG,UAAU;AACnC;;;;;;;;;;;;AAaD,SAAgB,yBACdK,gBACAC,eACA,SAAS,IACT,IAAI,GACM;AACV,KAAI,KAAK,IAAI,GAAG,cAAc,OAAO,IAAI,EACvC,QAAO,CAAE;CAGX,MAAM,yBACJ,MAAM,QAAQ,eAAe,GAAG,GAAG,iBAAiB,CAAC,cAAe;CAGtE,MAAM,oBAAoB,iBACxB,wBACA,cACD,CAAC;CACF,MAAM,4BAA4B,OAAO,kBAAkB,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,0BAA2B;CACrE,MAAM,4BAA4B,CAAC,yBAA0B;AAE7D,QAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,OAAO,EAAE;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,mBACD;EAED,kBAAkB,QAAQ,CAAC,YAAY,oBAAoB;AACzD,OAAI,0BAA0B,SAAS,gBAAgB,CACrD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,iBACzB;GACD,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;AAEvC,OAAI,QAAQ,WAAW;IACrB,YAAY;IACZ,YAAY;GACb;EACF,EAAC;EACF,mBAAmB,KAAK,cAAc,WAAW;EACjD,0BAA0B,KAAK,UAAU;CAC1C;AAED,QAAO;AACR;;;;;;;AAaD,SAAS,OAAOC,OAA0B;AACxC,KAAI,MAAM,WAAW,EACnB,QAAO;EACL,UAAU;EACV,UAAU;CACX;CAGH,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EACrC,KAAI,MAAM,KAAK,UAAU;EACvB,WAAW;EACX,WAAW,MAAM;CAClB;AAEH,QAAO;EAAE;EAAU;CAAU;AAC9B;AAED,SAAS,aAAaC,QAA4B;AAChD,QAAO,OAAO,OACZ,CAAC,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC,SAAS,EACrD,EACD;AACF"}
+{"version":3,"file":"math.js","names":["innerProductDistance"],"sources":["../../src/utils/math.ts"],"sourcesContent":["import { cosine } from \"./ml-distance/similarities.js\";\nimport { innerProduct as innerProductDistance } from \"./ml-distance/distances.js\";\nimport { euclidean } from \"./ml-distance-euclidean/euclidean.js\";\n\ntype VectorFunction = (xVector: number[], yVector: number[]) => number;\n\n/**\n * Apply a row-wise function between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n * @param {VectorFunction} func - The function to apply.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the result of applying the function between the corresponding rows of X and Y.\n */\n\nexport function matrixFunc(\n  X: number[][],\n  Y: number[][],\n  func: VectorFunction\n): number[][] {\n  if (\n    X.length === 0 ||\n    X[0].length === 0 ||\n    Y.length === 0 ||\n    Y[0].length === 0\n  ) {\n    return [[]];\n  }\n\n  if (X[0].length !== Y[0].length) {\n    throw new Error(\n      `Number of columns in X and Y must be the same. X has shape ${[\n        X.length,\n        X[0].length,\n      ]} and Y has shape ${[Y.length, Y[0].length]}.`\n    );\n  }\n\n  return X.map((xVector) =>\n    Y.map((yVector) => func(xVector, yVector)).map((similarity) =>\n      Number.isNaN(similarity) ? 0 : similarity\n    )\n  );\n}\n\nexport function normalize(M: number[][], similarity = false): number[][] {\n  const max = matrixMaxVal(M);\n  return M.map((row) =>\n    row.map((val) => (similarity ? 1 - val / max : val / max))\n  );\n}\n\n/**\n * This function calculates the row-wise cosine similarity between two matrices with the same number of columns.\n *\n * @param {number[][]} X - The first matrix.\n * @param {number[][]} Y - The second matrix.\n *\n * @throws {Error} If the number of columns in X and Y are not the same.\n *\n * @returns {number[][] | [[]]} A matrix where each row represents the cosine similarity values between the corresponding rows of X and Y.\n */\nexport function cosineSimilarity(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, cosine);\n}\n\nexport function innerProduct(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, innerProductDistance);\n}\n\nexport function euclideanDistance(X: number[][], Y: number[][]): number[][] {\n  return matrixFunc(X, Y, euclidean);\n}\n\n/**\n * This function implements the Maximal Marginal Relevance algorithm\n * to select a set of embeddings that maximizes the diversity and relevance to a query embedding.\n *\n * @param {number[]|number[][]} queryEmbedding - The query embedding.\n * @param {number[][]} embeddingList - The list of embeddings to select from.\n * @param {number} [lambda=0.5] - The trade-off parameter between relevance and diversity.\n * @param {number} [k=4] - The maximum number of embeddings to select.\n *\n * @returns {number[]} The indexes of the selected embeddings in the embeddingList.\n */\nexport function maximalMarginalRelevance(\n  queryEmbedding: number[] | number[][],\n  embeddingList: number[][],\n  lambda = 0.5,\n  k = 4\n): number[] {\n  if (Math.min(k, embeddingList.length) <= 0) {\n    return [];\n  }\n\n  const queryEmbeddingExpanded = (\n    Array.isArray(queryEmbedding[0]) ? queryEmbedding : [queryEmbedding]\n  ) as number[][];\n\n  const similarityToQuery = cosineSimilarity(\n    queryEmbeddingExpanded,\n    embeddingList\n  )[0];\n  const mostSimilarEmbeddingIndex = argMax(similarityToQuery).maxIndex;\n\n  const selectedEmbeddings = [embeddingList[mostSimilarEmbeddingIndex]];\n  const selectedEmbeddingsIndexes = [mostSimilarEmbeddingIndex];\n\n  while (selectedEmbeddingsIndexes.length < Math.min(k, embeddingList.length)) {\n    let bestScore = -Infinity;\n    let bestIndex = -1;\n\n    const similarityToSelected = cosineSimilarity(\n      embeddingList,\n      selectedEmbeddings\n    );\n\n    similarityToQuery.forEach((queryScore, queryScoreIndex) => {\n      if (selectedEmbeddingsIndexes.includes(queryScoreIndex)) {\n        return;\n      }\n      const maxSimilarityToSelected = Math.max(\n        ...similarityToSelected[queryScoreIndex]\n      );\n      const score =\n        lambda * queryScore - (1 - lambda) * maxSimilarityToSelected;\n\n      if (score > bestScore) {\n        bestScore = score;\n        bestIndex = queryScoreIndex;\n      }\n    });\n    selectedEmbeddings.push(embeddingList[bestIndex]);\n    selectedEmbeddingsIndexes.push(bestIndex);\n  }\n\n  return selectedEmbeddingsIndexes;\n}\n\ntype MaxInfo = {\n  maxIndex: number;\n  maxValue: number;\n};\n\n/**\n * Finds the index of the maximum value in the given array.\n * @param {number[]} array - The input array.\n *\n * @returns {number} The index of the maximum value in the array. If the array is empty, returns -1.\n */\nfunction argMax(array: number[]): MaxInfo {\n  if (array.length === 0) {\n    return {\n      maxIndex: -1,\n      maxValue: NaN,\n    };\n  }\n\n  let maxValue = array[0];\n  let maxIndex = 0;\n\n  for (let i = 1; i < array.length; i += 1) {\n    if (array[i] > maxValue) {\n      maxIndex = i;\n      maxValue = array[i];\n    }\n  }\n  return { maxIndex, maxValue };\n}\n\nfunction matrixMaxVal(arrays: number[][]): number {\n  return arrays.reduce(\n    (acc, array) => Math.max(acc, argMax(array).maxValue),\n    0\n  );\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;AAkBA,SAAgB,WACd,GACA,GACA,MACY;AACZ,KACE,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,KAChB,EAAE,WAAW,KACb,EAAE,GAAG,WAAW,EAEhB,QAAO,CAAC,EAAE,CAAC;AAGb,KAAI,EAAE,GAAG,WAAW,EAAE,GAAG,OACvB,OAAM,IAAI,MACR,8DAA8D,CAC5D,EAAE,QACF,EAAE,GAAG,OACN,CAAC,mBAAmB,CAAC,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAC,GAC9C;AAGH,QAAO,EAAE,KAAK,YACZ,EAAE,KAAK,YAAY,KAAK,SAAS,QAAQ,CAAC,CAAC,KAAK,eAC9C,OAAO,MAAM,WAAW,GAAG,IAAI,WAChC,CACF;;AAGH,SAAgB,UAAU,GAAe,aAAa,OAAmB;CACvE,MAAM,MAAM,aAAa,EAAE;AAC3B,QAAO,EAAE,KAAK,QACZ,IAAI,KAAK,QAAS,aAAa,IAAI,MAAM,MAAM,MAAM,IAAK,CAC3D;;;;;;;;;;;;AAaH,SAAgB,iBAAiB,GAAe,GAA2B;AACzE,QAAO,WAAW,GAAG,GAAG,OAAO;;AAGjC,SAAgB,aAAa,GAAe,GAA2B;AACrE,QAAO,WAAW,GAAG,GAAGA,eAAqB;;AAG/C,SAAgB,kBAAkB,GAAe,GAA2B;AAC1E,QAAO,WAAW,GAAG,GAAG,UAAU;;;;;;;;;;;;;AAcpC,SAAgB,yBACd,gBACA,eACA,SAAS,IACT,IAAI,GACM;AACV,KAAI,KAAK,IAAI,GAAG,cAAc,OAAO,IAAI,EACvC,QAAO,EAAE;CAOX,MAAM,oBAAoB,iBAHxB,MAAM,QAAQ,eAAe,GAAG,GAAG,iBAAiB,CAAC,eAAe,EAKpE,cACD,CAAC;CACF,MAAM,4BAA4B,OAAO,kBAAkB,CAAC;CAE5D,MAAM,qBAAqB,CAAC,cAAc,2BAA2B;CACrE,MAAM,4BAA4B,CAAC,0BAA0B;AAE7D,QAAO,0BAA0B,SAAS,KAAK,IAAI,GAAG,cAAc,OAAO,EAAE;EAC3E,IAAI,YAAY;EAChB,IAAI,YAAY;EAEhB,MAAM,uBAAuB,iBAC3B,eACA,mBACD;AAED,oBAAkB,SAAS,YAAY,oBAAoB;AACzD,OAAI,0BAA0B,SAAS,gBAAgB,CACrD;GAEF,MAAM,0BAA0B,KAAK,IACnC,GAAG,qBAAqB,iBACzB;GACD,MAAM,QACJ,SAAS,cAAc,IAAI,UAAU;AAEvC,OAAI,QAAQ,WAAW;AACrB,gBAAY;AACZ,gBAAY;;IAEd;AACF,qBAAmB,KAAK,cAAc,WAAW;AACjD,4BAA0B,KAAK,UAAU;;AAG3C,QAAO;;;;;;;;AAcT,SAAS,OAAO,OAA0B;AACxC,KAAI,MAAM,WAAW,EACnB,QAAO;EACL,UAAU;EACV,UAAU;EACX;CAGH,IAAI,WAAW,MAAM;CACrB,IAAI,WAAW;AAEf,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,EACrC,KAAI,MAAM,KAAK,UAAU;AACvB,aAAW;AACX,aAAW,MAAM;;AAGrB,QAAO;EAAE;EAAU;EAAU;;AAG/B,SAAS,aAAa,QAA4B;AAChD,QAAO,OAAO,QACX,KAAK,UAAU,KAAK,IAAI,KAAK,OAAO,MAAM,CAAC,SAAS,EACrD,EACD"}

package/dist/utils/ml-distance/distances.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"distances.cjs","names":["a: number[]","b: number[]"],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;;AAOA,SAAgB,aAAaA,GAAaC,GAAqB;CAC7D,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,OAAO,EAAE,KAAK,EAAE;AAElB,QAAO;AACR"}
+{"version":3,"file":"distances.cjs","names":[],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;;AAOA,SAAgB,aAAa,GAAa,GAAqB;CAC7D,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,QAAO,EAAE,KAAK,EAAE;AAElB,QAAO"}

package/dist/utils/ml-distance/distances.js.map

@@ -1 +1 @@
-{"version":3,"file":"distances.js","names":["a: number[]","b: number[]"],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;AAOA,SAAgB,aAAaA,GAAaC,GAAqB;CAC7D,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAC5B,OAAO,EAAE,KAAK,EAAE;AAElB,QAAO;AACR"}
+{"version":3,"file":"distances.js","names":[],"sources":["../../../src/utils/ml-distance/distances.ts"],"sourcesContent":["/**\n *Returns the Inner Product similarity between vectors a and b\n * @link [Inner Product Similarity algorithm](https://www.naun.org/main/NAUN/ijmmas/mmmas-49.pdf)\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function innerProduct(a: number[], b: number[]): number {\n  let ans = 0;\n  for (let i = 0; i < a.length; i++) {\n    ans += a[i] * b[i];\n  }\n  return ans;\n}\n"],"mappings":";;;;;;;;AAOA,SAAgB,aAAa,GAAa,GAAqB;CAC7D,IAAI,MAAM;AACV,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC5B,QAAO,EAAE,KAAK,EAAE;AAElB,QAAO"}

package/dist/utils/ml-distance/similarities.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"similarities.cjs","names":["a: number[]","b: number[]"],"sources":["../../../src/utils/ml-distance/similarities.ts"],"sourcesContent":["/**\n * Returns the average of cosine distances between vectors a and b\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function cosine(a: number[], b: number[]): number {\n  let p = 0;\n  let p2 = 0;\n  let q2 = 0;\n  for (let i = 0; i < a.length; i++) {\n    p += a[i] * b[i];\n    p2 += a[i] * a[i];\n    q2 += b[i] * b[i];\n  }\n  return p / (Math.sqrt(p2) * Math.sqrt(q2));\n}\n"],"mappings":";;;;;;;;AAMA,SAAgB,OAAOA,GAAaC,GAAqB;CACvD,IAAI,IAAI;CACR,IAAI,KAAK;CACT,IAAI,KAAK;AACT,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EACjC,KAAK,EAAE,KAAK,EAAE;EACd,MAAM,EAAE,KAAK,EAAE;EACf,MAAM,EAAE,KAAK,EAAE;CAChB;AACD,QAAO,KAAK,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,GAAG;AAC1C"}
+{"version":3,"file":"similarities.cjs","names":[],"sources":["../../../src/utils/ml-distance/similarities.ts"],"sourcesContent":["/**\n * Returns the average of cosine distances between vectors a and b\n * @param a - first vector\n * @param b - second vector\n *\n */\nexport function cosine(a: number[], b: number[]): number {\n  let p = 0;\n  let p2 = 0;\n  let q2 = 0;\n  for (let i = 0; i < a.length; i++) {\n    p += a[i] * b[i];\n    p2 += a[i] * a[i];\n    q2 += b[i] * b[i];\n  }\n  return p / (Math.sqrt(p2) * Math.sqrt(q2));\n}\n"],"mappings":";;;;;;;;AAMA,SAAgB,OAAO,GAAa,GAAqB;CACvD,IAAI,IAAI;CACR,IAAI,KAAK;CACT,IAAI,KAAK;AACT,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;AACjC,OAAK,EAAE,KAAK,EAAE;AACd,QAAM,EAAE,KAAK,EAAE;AACf,QAAM,EAAE,KAAK,EAAE;;AAEjB,QAAO,KAAK,KAAK,KAAK,GAAG,GAAG,KAAK,KAAK,GAAG"}