@librechat/agents 3.2.32 → 3.2.34

package/dist/esm/messages/recency.mjs

@@ -1,97 +1,81 @@
+//#region src/messages/recency.ts
 /**
- * Splits `messages` into a head (older, to summarize) and a tail (recent,
- * to preserve verbatim) at user-message boundaries.  The most recent
- * user-led turn is always included in the tail; additional older turns
- * are added subject to `turns` and `tokens` caps.
- *
- * Cutting strictly at HumanMessage boundaries ensures that:
- * - tool_use ↔ tool_result pairs are never split (they always live within
- *   the same turn);
- * - the first user message is never replaced by a summary, addressing
- *   the "first turn destruction" failure mode where a single large
- *   user-pasted payload would otherwise be replaced by a generic summary.
- *
- * When `messages` contains no HumanMessage (degenerate state — e.g. system
- * + assistant messages from a programmatic preamble), everything is
- * placed in the head and the tail is empty.  The summarize node treats
- * an empty tail as "nothing recent to preserve" and falls through to its
- * existing logic.
- */
+* Splits `messages` into a head (older, to summarize) and a tail (recent,
+* to preserve verbatim) at user-message boundaries.  The most recent
+* user-led turn is always included in the tail; additional older turns
+* are added subject to `turns` and `tokens` caps.
+*
+* Cutting strictly at HumanMessage boundaries ensures that:
+* - tool_use ↔ tool_result pairs are never split (they always live within
+*   the same turn);
+* - the first user message is never replaced by a summary, addressing
+*   the "first turn destruction" failure mode where a single large
+*   user-pasted payload would otherwise be replaced by a generic summary.
+*
+* When `messages` contains no HumanMessage (degenerate state — e.g. system
+* + assistant messages from a programmatic preamble), everything is
+* placed in the head and the tail is empty.  The summarize node treats
+* an empty tail as "nothing recent to preserve" and falls through to its
+* existing logic.
+*/
 function splitAtRecencyBoundary(messages, options = {}) {
-    const turnsCap = options.turns ?? 2;
-    if (messages.length === 0 || turnsCap <= 0) {
-        return {
-            head: messages,
-            tail: [],
-            tailTurnCount: 0,
-            tailStartIndex: messages.length,
-        };
-    }
-    const turnStarts = [];
-    for (let i = 0; i < messages.length; i++) {
-        if (messages[i].getType() === 'human') {
-            turnStarts.push(i);
-        }
-    }
-    if (turnStarts.length === 0) {
-        return {
-            head: messages,
-            tail: [],
-            tailTurnCount: 0,
-            tailStartIndex: messages.length,
-        };
-    }
-    const lastTurnStart = turnStarts[turnStarts.length - 1];
-    let tailStartIndex = lastTurnStart;
-    let tailTurnCount = 1;
-    const tokensCap = options.tokens;
-    const tokenCounter = options.tokenCounter;
-    const trackTokens = tokensCap != null && Number.isFinite(tokensCap) && tokenCounter != null;
-    /**
-     * Token-counting strategy: each candidate turn `t` spans the half-open
-     * range `[turnStarts[t], turnStarts[t + 1])` (or `[turnStarts[t], messages.length)`
-     * for the most recent turn).  Successive iterations of the outer loop
-     * walk older turns one at a time and never revisit messages from a
-     * later turn — so each message contributes to `tokenCounter` at most
-     * once across the entire selection, making the boundary search
-     * `O(messages_in_visited_turns)` and bounded by `O(messages.length)`
-     * even before the `turnsCap` short-circuit applies.  The inner upper
-     * bound uses `turnStarts[t + 1]` (a value derived from immutable
-     * `turnStarts`) rather than the mutated `tailStartIndex` to make the
-     * disjoint-range invariant self-evident.
-     */
-    let tailTokens = 0;
-    if (trackTokens) {
-        for (let i = lastTurnStart; i < messages.length; i++) {
-            tailTokens += tokenCounter(messages[i]);
-        }
-    }
-    for (let t = turnStarts.length - 2; t >= 0; t--) {
-        if (tailTurnCount >= turnsCap) {
-            break;
-        }
-        const turnStart = turnStarts[t];
-        const turnEnd = turnStarts[t + 1];
-        if (trackTokens) {
-            let turnTokens = 0;
-            for (let i = turnStart; i < turnEnd; i++) {
-                turnTokens += tokenCounter(messages[i]);
-            }
-            if (tailTokens + turnTokens > tokensCap) {
-                break;
-            }
-            tailTokens += turnTokens;
-        }
-        tailStartIndex = turnStart;
-        tailTurnCount += 1;
-    }
-    return {
-        head: messages.slice(0, tailStartIndex),
-        tail: messages.slice(tailStartIndex),
-        tailTurnCount,
-        tailStartIndex,
-    };
+	const turnsCap = options.turns ?? 2;
+	if (messages.length === 0 || turnsCap <= 0) return {
+		head: messages,
+		tail: [],
+		tailTurnCount: 0,
+		tailStartIndex: messages.length
+	};
+	const turnStarts = [];
+	for (let i = 0; i < messages.length; i++) if (messages[i].getType() === "human") turnStarts.push(i);
+	if (turnStarts.length === 0) return {
+		head: messages,
+		tail: [],
+		tailTurnCount: 0,
+		tailStartIndex: messages.length
+	};
+	const lastTurnStart = turnStarts[turnStarts.length - 1];
+	let tailStartIndex = lastTurnStart;
+	let tailTurnCount = 1;
+	const tokensCap = options.tokens;
+	const tokenCounter = options.tokenCounter;
+	const trackTokens = tokensCap != null && Number.isFinite(tokensCap) && tokenCounter != null;
+	/**
+	* Token-counting strategy: each candidate turn `t` spans the half-open
+	* range `[turnStarts[t], turnStarts[t + 1])` (or `[turnStarts[t], messages.length)`
+	* for the most recent turn).  Successive iterations of the outer loop
+	* walk older turns one at a time and never revisit messages from a
+	* later turn — so each message contributes to `tokenCounter` at most
+	* once across the entire selection, making the boundary search
+	* `O(messages_in_visited_turns)` and bounded by `O(messages.length)`
+	* even before the `turnsCap` short-circuit applies.  The inner upper
+	* bound uses `turnStarts[t + 1]` (a value derived from immutable
+	* `turnStarts`) rather than the mutated `tailStartIndex` to make the
+	* disjoint-range invariant self-evident.
+	*/
+	let tailTokens = 0;
+	if (trackTokens) for (let i = lastTurnStart; i < messages.length; i++) tailTokens += tokenCounter(messages[i]);
+	for (let t = turnStarts.length - 2; t >= 0; t--) {
+		if (tailTurnCount >= turnsCap) break;
+		const turnStart = turnStarts[t];
+		const turnEnd = turnStarts[t + 1];
+		if (trackTokens) {
+			let turnTokens = 0;
+			for (let i = turnStart; i < turnEnd; i++) turnTokens += tokenCounter(messages[i]);
+			if (tailTokens + turnTokens > tokensCap) break;
+			tailTokens += turnTokens;
+		}
+		tailStartIndex = turnStart;
+		tailTurnCount += 1;
+	}
+	return {
+		head: messages.slice(0, tailStartIndex),
+		tail: messages.slice(tailStartIndex),
+		tailTurnCount,
+		tailStartIndex
+	};
 }
-
+//#endregion
 export { splitAtRecencyBoundary };
-//# sourceMappingURL=recency.mjs.map
+
+//# sourceMappingURL=recency.mjs.map

package/dist/esm/messages/recency.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"recency.mjs","sources":["../../../src/messages/recency.ts"],"sourcesContent":["import type { BaseMessage } from '@langchain/core/messages';\n\n/**\n * Configuration for splitting a message list into a head (to be summarized)\n * and a tail (to be preserved verbatim).\n */\nexport interface RecencyWindowOptions {\n  /**\n   * Maximum number of recent user-led turns to keep in the tail.  A \"turn\"\n   * begins at a HumanMessage and includes every following AIMessage and\n   * ToolMessage up to (but not including) the next HumanMessage.  Cutting\n   * at turn boundaries guarantees that tool_use / tool_result pairs are\n   * never split across the head/tail divide.\n   *\n   * The most recent turn is always preserved regardless of this value or\n   * the token cap, so that a single oversized first message is never\n   * destroyed by summarization.\n   *\n   * Defaults to `2`.  A value of `0` disables the recency window (head =\n   * everything, tail = empty), restoring the pre-recency-window behavior.\n   */\n  turns?: number;\n  /**\n   * Optional cap on tail size in tokens.  When set, additional turns\n   * beyond the most recent one are added to the tail only while the\n   * cumulative token count stays at or below this cap.  Turns are added\n   * whole — never partially — so a turn that would exceed the cap is\n   * left in the head.\n   *\n   * The most recent turn is always preserved even if it exceeds the cap.\n   */\n  tokens?: number;\n  /** Token-counter used to evaluate the optional `tokens` cap. */\n  tokenCounter?: (m: BaseMessage) => number;\n}\n\nexport interface RecencySplit {\n  /** Older messages eligible for summarization.  Empty when nothing to summarize. */\n  head: BaseMessage[];\n  /** Recent messages preserved verbatim.  Always contains the most recent turn when any HumanMessage exists. */\n  tail: BaseMessage[];\n  /** Number of user-led turns retained in the tail (0 if no HumanMessage exists). */\n  tailTurnCount: number;\n  /** Index in the original `messages` array where the tail begins. */\n  tailStartIndex: number;\n}\n\n/**\n * Splits `messages` into a head (older, to summarize) and a tail (recent,\n * to preserve verbatim) at user-message boundaries.  The most recent\n * user-led turn is always included in the tail; additional older turns\n * are added subject to `turns` and `tokens` caps.\n *\n * Cutting strictly at HumanMessage boundaries ensures that:\n * - tool_use ↔ tool_result pairs are never split (they always live within\n *   the same turn);\n * - the first user message is never replaced by a summary, addressing\n *   the \"first turn destruction\" failure mode where a single large\n *   user-pasted payload would otherwise be replaced by a generic summary.\n *\n * When `messages` contains no HumanMessage (degenerate state — e.g. system\n * + assistant messages from a programmatic preamble), everything is\n * placed in the head and the tail is empty.  The summarize node treats\n * an empty tail as \"nothing recent to preserve\" and falls through to its\n * existing logic.\n */\nexport function splitAtRecencyBoundary(\n  messages: BaseMessage[],\n  options: RecencyWindowOptions = {}\n): RecencySplit {\n  const turnsCap = options.turns ?? 2;\n\n  if (messages.length === 0 || turnsCap <= 0) {\n    return {\n      head: messages,\n      tail: [],\n      tailTurnCount: 0,\n      tailStartIndex: messages.length,\n    };\n  }\n\n  const turnStarts: number[] = [];\n  for (let i = 0; i < messages.length; i++) {\n    if (messages[i].getType() === 'human') {\n      turnStarts.push(i);\n    }\n  }\n\n  if (turnStarts.length === 0) {\n    return {\n      head: messages,\n      tail: [],\n      tailTurnCount: 0,\n      tailStartIndex: messages.length,\n    };\n  }\n\n  const lastTurnStart = turnStarts[turnStarts.length - 1] as number;\n  let tailStartIndex = lastTurnStart;\n  let tailTurnCount = 1;\n\n  const tokensCap = options.tokens;\n  const tokenCounter = options.tokenCounter;\n  const trackTokens =\n    tokensCap != null && Number.isFinite(tokensCap) && tokenCounter != null;\n\n  /**\n   * Token-counting strategy: each candidate turn `t` spans the half-open\n   * range `[turnStarts[t], turnStarts[t + 1])` (or `[turnStarts[t], messages.length)`\n   * for the most recent turn).  Successive iterations of the outer loop\n   * walk older turns one at a time and never revisit messages from a\n   * later turn — so each message contributes to `tokenCounter` at most\n   * once across the entire selection, making the boundary search\n   * `O(messages_in_visited_turns)` and bounded by `O(messages.length)`\n   * even before the `turnsCap` short-circuit applies.  The inner upper\n   * bound uses `turnStarts[t + 1]` (a value derived from immutable\n   * `turnStarts`) rather than the mutated `tailStartIndex` to make the\n   * disjoint-range invariant self-evident.\n   */\n  let tailTokens = 0;\n  if (trackTokens) {\n    for (let i = lastTurnStart; i < messages.length; i++) {\n      tailTokens += tokenCounter(messages[i] as BaseMessage);\n    }\n  }\n\n  for (let t = turnStarts.length - 2; t >= 0; t--) {\n    if (tailTurnCount >= turnsCap) {\n      break;\n    }\n    const turnStart = turnStarts[t] as number;\n    const turnEnd = turnStarts[t + 1] as number;\n\n    if (trackTokens) {\n      let turnTokens = 0;\n      for (let i = turnStart; i < turnEnd; i++) {\n        turnTokens += tokenCounter(messages[i] as BaseMessage);\n      }\n      if (tailTokens + turnTokens > (tokensCap as number)) {\n        break;\n      }\n      tailTokens += turnTokens;\n    }\n\n    tailStartIndex = turnStart;\n    tailTurnCount += 1;\n  }\n\n  return {\n    head: messages.slice(0, tailStartIndex),\n    tail: messages.slice(tailStartIndex),\n    tailTurnCount,\n    tailStartIndex,\n  };\n}\n"],"names":[],"mappings":"AA+CA;;;;;;;;;;;;;;;;;;AAkBG;SACa,sBAAsB,CACpC,QAAuB,EACvB,UAAgC,EAAE,EAAA;AAElC,IAAA,MAAM,QAAQ,GAAG,OAAO,CAAC,KAAK,IAAI,CAAC;IAEnC,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,QAAQ,IAAI,CAAC,EAAE;QAC1C,OAAO;AACL,YAAA,IAAI,EAAE,QAAQ;AACd,YAAA,IAAI,EAAE,EAAE;AACR,YAAA,aAAa,EAAE,CAAC;YAChB,cAAc,EAAE,QAAQ,CAAC,MAAM;SAChC;IACH;IAEA,MAAM,UAAU,GAAa,EAAE;AAC/B,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACxC,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,KAAK,OAAO,EAAE;AACrC,YAAA,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;QACpB;IACF;AAEA,IAAA,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE;QAC3B,OAAO;AACL,YAAA,IAAI,EAAE,QAAQ;AACd,YAAA,IAAI,EAAE,EAAE;AACR,YAAA,aAAa,EAAE,CAAC;YAChB,cAAc,EAAE,QAAQ,CAAC,MAAM;SAChC;IACH;IAEA,MAAM,aAAa,GAAG,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAW;IACjE,IAAI,cAAc,GAAG,aAAa;IAClC,IAAI,aAAa,GAAG,CAAC;AAErB,IAAA,MAAM,SAAS,GAAG,OAAO,CAAC,MAAM;AAChC,IAAA,MAAM,YAAY,GAAG,OAAO,CAAC,YAAY;AACzC,IAAA,MAAM,WAAW,GACf,SAAS,IAAI,IAAI,IAAI,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,YAAY,IAAI,IAAI;AAEzE;;;;;;;;;;;;AAYG;IACH,IAAI,UAAU,GAAG,CAAC;IAClB,IAAI,WAAW,EAAE;AACf,QAAA,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACpD,UAAU,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAgB,CAAC;QACxD;IACF;AAEA,IAAA,KAAK,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAC/C,QAAA,IAAI,aAAa,IAAI,QAAQ,EAAE;YAC7B;QACF;AACA,QAAA,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAW;QACzC,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,CAAW;QAE3C,IAAI,WAAW,EAAE;YACf,IAAI,UAAU,GAAG,CAAC;AAClB,YAAA,KAAK,IAAI,CAAC,GAAG,SAAS,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;gBACxC,UAAU,IAAI,YAAY,CAAC,QAAQ,CAAC,CAAC,CAAgB,CAAC;YACxD;AACA,YAAA,IAAI,UAAU,GAAG,UAAU,GAAI,SAAoB,EAAE;gBACnD;YACF;YACA,UAAU,IAAI,UAAU;QAC1B;QAEA,cAAc,GAAG,SAAS;QAC1B,aAAa,IAAI,CAAC;IACpB;IAEA,OAAO;QACL,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;AACvC,QAAA,IAAI,EAAE,QAAQ,CAAC,KAAK,CAAC,cAAc,CAAC;QACpC,aAAa;QACb,cAAc;KACf;AACH;;;;"}
+{"version":3,"file":"recency.mjs","names":[],"sources":["../../../src/messages/recency.ts"],"sourcesContent":["import type { BaseMessage } from '@langchain/core/messages';\n\n/**\n * Configuration for splitting a message list into a head (to be summarized)\n * and a tail (to be preserved verbatim).\n */\nexport interface RecencyWindowOptions {\n  /**\n   * Maximum number of recent user-led turns to keep in the tail.  A \"turn\"\n   * begins at a HumanMessage and includes every following AIMessage and\n   * ToolMessage up to (but not including) the next HumanMessage.  Cutting\n   * at turn boundaries guarantees that tool_use / tool_result pairs are\n   * never split across the head/tail divide.\n   *\n   * The most recent turn is always preserved regardless of this value or\n   * the token cap, so that a single oversized first message is never\n   * destroyed by summarization.\n   *\n   * Defaults to `2`.  A value of `0` disables the recency window (head =\n   * everything, tail = empty), restoring the pre-recency-window behavior.\n   */\n  turns?: number;\n  /**\n   * Optional cap on tail size in tokens.  When set, additional turns\n   * beyond the most recent one are added to the tail only while the\n   * cumulative token count stays at or below this cap.  Turns are added\n   * whole — never partially — so a turn that would exceed the cap is\n   * left in the head.\n   *\n   * The most recent turn is always preserved even if it exceeds the cap.\n   */\n  tokens?: number;\n  /** Token-counter used to evaluate the optional `tokens` cap. */\n  tokenCounter?: (m: BaseMessage) => number;\n}\n\nexport interface RecencySplit {\n  /** Older messages eligible for summarization.  Empty when nothing to summarize. */\n  head: BaseMessage[];\n  /** Recent messages preserved verbatim.  Always contains the most recent turn when any HumanMessage exists. */\n  tail: BaseMessage[];\n  /** Number of user-led turns retained in the tail (0 if no HumanMessage exists). */\n  tailTurnCount: number;\n  /** Index in the original `messages` array where the tail begins. */\n  tailStartIndex: number;\n}\n\n/**\n * Splits `messages` into a head (older, to summarize) and a tail (recent,\n * to preserve verbatim) at user-message boundaries.  The most recent\n * user-led turn is always included in the tail; additional older turns\n * are added subject to `turns` and `tokens` caps.\n *\n * Cutting strictly at HumanMessage boundaries ensures that:\n * - tool_use ↔ tool_result pairs are never split (they always live within\n *   the same turn);\n * - the first user message is never replaced by a summary, addressing\n *   the \"first turn destruction\" failure mode where a single large\n *   user-pasted payload would otherwise be replaced by a generic summary.\n *\n * When `messages` contains no HumanMessage (degenerate state — e.g. system\n * + assistant messages from a programmatic preamble), everything is\n * placed in the head and the tail is empty.  The summarize node treats\n * an empty tail as \"nothing recent to preserve\" and falls through to its\n * existing logic.\n */\nexport function splitAtRecencyBoundary(\n  messages: BaseMessage[],\n  options: RecencyWindowOptions = {}\n): RecencySplit {\n  const turnsCap = options.turns ?? 2;\n\n  if (messages.length === 0 || turnsCap <= 0) {\n    return {\n      head: messages,\n      tail: [],\n      tailTurnCount: 0,\n      tailStartIndex: messages.length,\n    };\n  }\n\n  const turnStarts: number[] = [];\n  for (let i = 0; i < messages.length; i++) {\n    if (messages[i].getType() === 'human') {\n      turnStarts.push(i);\n    }\n  }\n\n  if (turnStarts.length === 0) {\n    return {\n      head: messages,\n      tail: [],\n      tailTurnCount: 0,\n      tailStartIndex: messages.length,\n    };\n  }\n\n  const lastTurnStart = turnStarts[turnStarts.length - 1] as number;\n  let tailStartIndex = lastTurnStart;\n  let tailTurnCount = 1;\n\n  const tokensCap = options.tokens;\n  const tokenCounter = options.tokenCounter;\n  const trackTokens =\n    tokensCap != null && Number.isFinite(tokensCap) && tokenCounter != null;\n\n  /**\n   * Token-counting strategy: each candidate turn `t` spans the half-open\n   * range `[turnStarts[t], turnStarts[t + 1])` (or `[turnStarts[t], messages.length)`\n   * for the most recent turn).  Successive iterations of the outer loop\n   * walk older turns one at a time and never revisit messages from a\n   * later turn — so each message contributes to `tokenCounter` at most\n   * once across the entire selection, making the boundary search\n   * `O(messages_in_visited_turns)` and bounded by `O(messages.length)`\n   * even before the `turnsCap` short-circuit applies.  The inner upper\n   * bound uses `turnStarts[t + 1]` (a value derived from immutable\n   * `turnStarts`) rather than the mutated `tailStartIndex` to make the\n   * disjoint-range invariant self-evident.\n   */\n  let tailTokens = 0;\n  if (trackTokens) {\n    for (let i = lastTurnStart; i < messages.length; i++) {\n      tailTokens += tokenCounter(messages[i] as BaseMessage);\n    }\n  }\n\n  for (let t = turnStarts.length - 2; t >= 0; t--) {\n    if (tailTurnCount >= turnsCap) {\n      break;\n    }\n    const turnStart = turnStarts[t] as number;\n    const turnEnd = turnStarts[t + 1] as number;\n\n    if (trackTokens) {\n      let turnTokens = 0;\n      for (let i = turnStart; i < turnEnd; i++) {\n        turnTokens += tokenCounter(messages[i] as BaseMessage);\n      }\n      if (tailTokens + turnTokens > (tokensCap as number)) {\n        break;\n      }\n      tailTokens += turnTokens;\n    }\n\n    tailStartIndex = turnStart;\n    tailTurnCount += 1;\n  }\n\n  return {\n    head: messages.slice(0, tailStartIndex),\n    tail: messages.slice(tailStartIndex),\n    tailTurnCount,\n    tailStartIndex,\n  };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;AAkEA,SAAgB,uBACd,UACA,UAAgC,CAAC,GACnB;CACd,MAAM,WAAW,QAAQ,SAAS;CAElC,IAAI,SAAS,WAAW,KAAK,YAAY,GACvC,OAAO;EACL,MAAM;EACN,MAAM,CAAC;EACP,eAAe;EACf,gBAAgB,SAAS;CAC3B;CAGF,MAAM,aAAuB,CAAC;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,KACnC,IAAI,SAAS,EAAE,CAAC,QAAQ,MAAM,SAC5B,WAAW,KAAK,CAAC;CAIrB,IAAI,WAAW,WAAW,GACxB,OAAO;EACL,MAAM;EACN,MAAM,CAAC;EACP,eAAe;EACf,gBAAgB,SAAS;CAC3B;CAGF,MAAM,gBAAgB,WAAW,WAAW,SAAS;CACrD,IAAI,iBAAiB;CACrB,IAAI,gBAAgB;CAEpB,MAAM,YAAY,QAAQ;CAC1B,MAAM,eAAe,QAAQ;CAC7B,MAAM,cACJ,aAAa,QAAQ,OAAO,SAAS,SAAS,KAAK,gBAAgB;;;;;;;;;;;;;;CAerE,IAAI,aAAa;CACjB,IAAI,aACF,KAAK,IAAI,IAAI,eAAe,IAAI,SAAS,QAAQ,KAC/C,cAAc,aAAa,SAAS,EAAiB;CAIzD,KAAK,IAAI,IAAI,WAAW,SAAS,GAAG,KAAK,GAAG,KAAK;EAC/C,IAAI,iBAAiB,UACnB;EAEF,MAAM,YAAY,WAAW;EAC7B,MAAM,UAAU,WAAW,IAAI;EAE/B,IAAI,aAAa;GACf,IAAI,aAAa;GACjB,KAAK,IAAI,IAAI,WAAW,IAAI,SAAS,KACnC,cAAc,aAAa,SAAS,EAAiB;GAEvD,IAAI,aAAa,aAAc,WAC7B;GAEF,cAAc;EAChB;EAEA,iBAAiB;EACjB,iBAAiB;CACnB;CAEA,OAAO;EACL,MAAM,SAAS,MAAM,GAAG,cAAc;EACtC,MAAM,SAAS,MAAM,cAAc;EACnC;EACA;CACF;AACF"}

package/dist/esm/messages/reducer.mjs

@@ -1,83 +1,70 @@
-import { v4 } from 'uuid';
-import { RemoveMessage, coerceMessageLikeToMessage } from '@langchain/core/messages';
-
-const REMOVE_ALL_MESSAGES = '__remove_all__';
+import { RemoveMessage, coerceMessageLikeToMessage } from "@langchain/core/messages";
+import { v4 } from "uuid";
+//#region src/messages/reducer.ts
+const REMOVE_ALL_MESSAGES = "__remove_all__";
 /**
- * Creates a message that instructs messagesStateReducer to remove ALL
- * existing messages from state.  Messages appearing after this one in
- * the array become the new state.
- *
- * Usage (in a node return value):
- * ```ts
- * return { messages: [createRemoveAllMessage(), ...survivingMessages] };
- * ```
- *
- * This works because the reducer checks for `getType() === 'remove'`
- * with `id === REMOVE_ALL_MESSAGES` and discards everything before it.
- *
- * NOTE: Uses RemoveMessage from @langchain/core with a sentinel id so
- * the reducer can distinguish a "remove-all" marker from a single-message
- * removal.
- */
+* Creates a message that instructs messagesStateReducer to remove ALL
+* existing messages from state.  Messages appearing after this one in
+* the array become the new state.
+*
+* Usage (in a node return value):
+* ```ts
+* return { messages: [createRemoveAllMessage(), ...survivingMessages] };
+* ```
+*
+* This works because the reducer checks for `getType() === 'remove'`
+* with `id === REMOVE_ALL_MESSAGES` and discards everything before it.
+*
+* NOTE: Uses RemoveMessage from @langchain/core with a sentinel id so
+* the reducer can distinguish a "remove-all" marker from a single-message
+* removal.
+*/
 function createRemoveAllMessage() {
-    return new RemoveMessage({ id: REMOVE_ALL_MESSAGES });
+	return new RemoveMessage({ id: REMOVE_ALL_MESSAGES });
 }
 /**
- * Prebuilt reducer that combines returned messages.
- * Can handle standard messages and special modifiers like {@link RemoveMessage}
- * instances.
- */
+* Prebuilt reducer that combines returned messages.
+* Can handle standard messages and special modifiers like {@link RemoveMessage}
+* instances.
+*/
 function messagesStateReducer(left, right) {
-    const leftArray = Array.isArray(left) ? left : [left];
-    const rightArray = Array.isArray(right) ? right : [right];
-    // coerce to message
-    const leftMessages = leftArray.map(coerceMessageLikeToMessage);
-    const rightMessages = rightArray.map(coerceMessageLikeToMessage);
-    // assign missing ids
-    for (const m of leftMessages) {
-        if (m.id === null || m.id === undefined) {
-            m.id = v4();
-            m.lc_kwargs.id = m.id;
-        }
-    }
-    let removeAllIdx;
-    for (let i = 0; i < rightMessages.length; i += 1) {
-        const m = rightMessages[i];
-        if (m.id === null || m.id === undefined) {
-            m.id = v4();
-            m.lc_kwargs.id = m.id;
-        }
-        if (m.getType() === 'remove' && m.id === REMOVE_ALL_MESSAGES) {
-            removeAllIdx = i;
-        }
-    }
-    if (removeAllIdx != null)
-        return rightMessages.slice(removeAllIdx + 1);
-    // merge
-    const merged = [...leftMessages];
-    const mergedById = new Map(merged.map((m, i) => [m.id, i]));
-    const idsToRemove = new Set();
-    for (const m of rightMessages) {
-        const existingIdx = mergedById.get(m.id);
-        if (existingIdx !== undefined) {
-            if (m.getType() === 'remove') {
-                idsToRemove.add(m.id);
-            }
-            else {
-                idsToRemove.delete(m.id);
-                merged[existingIdx] = m;
-            }
-        }
-        else {
-            if (m.getType() === 'remove') {
-                throw new Error(`Attempting to delete a message with an ID that doesn't exist ('${m.id}')`);
-            }
-            mergedById.set(m.id, merged.length);
-            merged.push(m);
-        }
-    }
-    return merged.filter((m) => !idsToRemove.has(m.id));
+	const leftArray = Array.isArray(left) ? left : [left];
+	const rightArray = Array.isArray(right) ? right : [right];
+	const leftMessages = leftArray.map(coerceMessageLikeToMessage);
+	const rightMessages = rightArray.map(coerceMessageLikeToMessage);
+	for (const m of leftMessages) if (m.id === null || m.id === void 0) {
+		m.id = v4();
+		m.lc_kwargs.id = m.id;
+	}
+	let removeAllIdx;
+	for (let i = 0; i < rightMessages.length; i += 1) {
+		const m = rightMessages[i];
+		if (m.id === null || m.id === void 0) {
+			m.id = v4();
+			m.lc_kwargs.id = m.id;
+		}
+		if (m.getType() === "remove" && m.id === "__remove_all__") removeAllIdx = i;
+	}
+	if (removeAllIdx != null) return rightMessages.slice(removeAllIdx + 1);
+	const merged = [...leftMessages];
+	const mergedById = new Map(merged.map((m, i) => [m.id, i]));
+	const idsToRemove = /* @__PURE__ */ new Set();
+	for (const m of rightMessages) {
+		const existingIdx = mergedById.get(m.id);
+		if (existingIdx !== void 0) if (m.getType() === "remove") idsToRemove.add(m.id);
+		else {
+			idsToRemove.delete(m.id);
+			merged[existingIdx] = m;
+		}
+		else {
+			if (m.getType() === "remove") throw new Error(`Attempting to delete a message with an ID that doesn't exist ('${m.id}')`);
+			mergedById.set(m.id, merged.length);
+			merged.push(m);
+		}
+	}
+	return merged.filter((m) => !idsToRemove.has(m.id));
 }
-
+//#endregion
 export { REMOVE_ALL_MESSAGES, createRemoveAllMessage, messagesStateReducer };
-//# sourceMappingURL=reducer.mjs.map
+
+//# sourceMappingURL=reducer.mjs.map

package/dist/esm/messages/reducer.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"reducer.mjs","sources":["../../../src/messages/reducer.ts"],"sourcesContent":["import { v4 } from 'uuid';\nimport {\n  BaseMessage,\n  RemoveMessage,\n  BaseMessageLike,\n  coerceMessageLikeToMessage,\n} from '@langchain/core/messages';\n\nexport const REMOVE_ALL_MESSAGES = '__remove_all__';\n\n/**\n * Creates a message that instructs messagesStateReducer to remove ALL\n * existing messages from state.  Messages appearing after this one in\n * the array become the new state.\n *\n * Usage (in a node return value):\n * ```ts\n * return { messages: [createRemoveAllMessage(), ...survivingMessages] };\n * ```\n *\n * This works because the reducer checks for `getType() === 'remove'`\n * with `id === REMOVE_ALL_MESSAGES` and discards everything before it.\n *\n * NOTE: Uses RemoveMessage from @langchain/core with a sentinel id so\n * the reducer can distinguish a \"remove-all\" marker from a single-message\n * removal.\n */\nexport function createRemoveAllMessage(): BaseMessage {\n  return new RemoveMessage({ id: REMOVE_ALL_MESSAGES });\n}\n\nexport type Messages =\n  | Array<BaseMessage | BaseMessageLike>\n  | BaseMessage\n  | BaseMessageLike;\n\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport function messagesStateReducer(\n  left: Messages,\n  right: Messages\n): BaseMessage[] {\n  const leftArray = Array.isArray(left) ? left : [left];\n  const rightArray = Array.isArray(right) ? right : [right];\n  // coerce to message\n  const leftMessages = (leftArray as BaseMessageLike[]).map(\n    coerceMessageLikeToMessage\n  );\n  const rightMessages = (rightArray as BaseMessageLike[]).map(\n    coerceMessageLikeToMessage\n  );\n  // assign missing ids\n  for (const m of leftMessages) {\n    if (m.id === null || m.id === undefined) {\n      m.id = v4();\n      m.lc_kwargs.id = m.id;\n    }\n  }\n\n  let removeAllIdx: number | undefined;\n  for (let i = 0; i < rightMessages.length; i += 1) {\n    const m = rightMessages[i];\n    if (m.id === null || m.id === undefined) {\n      m.id = v4();\n      m.lc_kwargs.id = m.id;\n    }\n\n    if (m.getType() === 'remove' && m.id === REMOVE_ALL_MESSAGES) {\n      removeAllIdx = i;\n    }\n  }\n\n  if (removeAllIdx != null) return rightMessages.slice(removeAllIdx + 1);\n\n  // merge\n  const merged = [...leftMessages];\n  const mergedById = new Map(merged.map((m, i) => [m.id, i]));\n  const idsToRemove = new Set();\n  for (const m of rightMessages) {\n    const existingIdx = mergedById.get(m.id);\n    if (existingIdx !== undefined) {\n      if (m.getType() === 'remove') {\n        idsToRemove.add(m.id);\n      } else {\n        idsToRemove.delete(m.id);\n        merged[existingIdx] = m;\n      }\n    } else {\n      if (m.getType() === 'remove') {\n        throw new Error(\n          `Attempting to delete a message with an ID that doesn't exist ('${m.id}')`\n        );\n      }\n      mergedById.set(m.id, merged.length);\n      merged.push(m);\n    }\n  }\n  return merged.filter((m) => !idsToRemove.has(m.id));\n}\n"],"names":[],"mappings":";;;AAQO,MAAM,mBAAmB,GAAG;AAEnC;;;;;;;;;;;;;;;;AAgBG;SACa,sBAAsB,GAAA;IACpC,OAAO,IAAI,aAAa,CAAC,EAAE,EAAE,EAAE,mBAAmB,EAAE,CAAC;AACvD;AAOA;;;;AAIG;AACG,SAAU,oBAAoB,CAClC,IAAc,EACd,KAAe,EAAA;AAEf,IAAA,MAAM,SAAS,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC;AACrD,IAAA,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC;;IAEzD,MAAM,YAAY,GAAI,SAA+B,CAAC,GAAG,CACvD,0BAA0B,CAC3B;IACD,MAAM,aAAa,GAAI,UAAgC,CAAC,GAAG,CACzD,0BAA0B,CAC3B;;AAED,IAAA,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE;AAC5B,QAAA,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,EAAE;AACvC,YAAA,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;YACX,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;QACvB;IACF;AAEA,IAAA,IAAI,YAAgC;AACpC,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;AAChD,QAAA,MAAM,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;AAC1B,QAAA,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,SAAS,EAAE;AACvC,YAAA,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE;YACX,CAAC,CAAC,SAAS,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE;QACvB;AAEA,QAAA,IAAI,CAAC,CAAC,OAAO,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,mBAAmB,EAAE;YAC5D,YAAY,GAAG,CAAC;QAClB;IACF;IAEA,IAAI,YAAY,IAAI,IAAI;QAAE,OAAO,aAAa,CAAC,KAAK,CAAC,YAAY,GAAG,CAAC,CAAC;;AAGtE,IAAA,MAAM,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC;IAChC,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AAC3D,IAAA,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE;AAC7B,IAAA,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE;QAC7B,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;AACxC,QAAA,IAAI,WAAW,KAAK,SAAS,EAAE;AAC7B,YAAA,IAAI,CAAC,CAAC,OAAO,EAAE,KAAK,QAAQ,EAAE;AAC5B,gBAAA,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACvB;iBAAO;AACL,gBAAA,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;AACxB,gBAAA,MAAM,CAAC,WAAW,CAAC,GAAG,CAAC;YACzB;QACF;aAAO;AACL,YAAA,IAAI,CAAC,CAAC,OAAO,EAAE,KAAK,QAAQ,EAAE;gBAC5B,MAAM,IAAI,KAAK,CACb,CAAA,+DAAA,EAAkE,CAAC,CAAC,EAAE,CAAA,EAAA,CAAI,CAC3E;YACH;YACA,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC;AACnC,YAAA,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAChB;IACF;AACA,IAAA,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACrD;;;;"}
+{"version":3,"file":"reducer.mjs","names":[],"sources":["../../../src/messages/reducer.ts"],"sourcesContent":["import { v4 } from 'uuid';\nimport {\n  BaseMessage,\n  RemoveMessage,\n  BaseMessageLike,\n  coerceMessageLikeToMessage,\n} from '@langchain/core/messages';\n\nexport const REMOVE_ALL_MESSAGES = '__remove_all__';\n\n/**\n * Creates a message that instructs messagesStateReducer to remove ALL\n * existing messages from state.  Messages appearing after this one in\n * the array become the new state.\n *\n * Usage (in a node return value):\n * ```ts\n * return { messages: [createRemoveAllMessage(), ...survivingMessages] };\n * ```\n *\n * This works because the reducer checks for `getType() === 'remove'`\n * with `id === REMOVE_ALL_MESSAGES` and discards everything before it.\n *\n * NOTE: Uses RemoveMessage from @langchain/core with a sentinel id so\n * the reducer can distinguish a \"remove-all\" marker from a single-message\n * removal.\n */\nexport function createRemoveAllMessage(): BaseMessage {\n  return new RemoveMessage({ id: REMOVE_ALL_MESSAGES });\n}\n\nexport type Messages =\n  | Array<BaseMessage | BaseMessageLike>\n  | BaseMessage\n  | BaseMessageLike;\n\n/**\n * Prebuilt reducer that combines returned messages.\n * Can handle standard messages and special modifiers like {@link RemoveMessage}\n * instances.\n */\nexport function messagesStateReducer(\n  left: Messages,\n  right: Messages\n): BaseMessage[] {\n  const leftArray = Array.isArray(left) ? left : [left];\n  const rightArray = Array.isArray(right) ? right : [right];\n  // coerce to message\n  const leftMessages = (leftArray as BaseMessageLike[]).map(\n    coerceMessageLikeToMessage\n  );\n  const rightMessages = (rightArray as BaseMessageLike[]).map(\n    coerceMessageLikeToMessage\n  );\n  // assign missing ids\n  for (const m of leftMessages) {\n    if (m.id === null || m.id === undefined) {\n      m.id = v4();\n      m.lc_kwargs.id = m.id;\n    }\n  }\n\n  let removeAllIdx: number | undefined;\n  for (let i = 0; i < rightMessages.length; i += 1) {\n    const m = rightMessages[i];\n    if (m.id === null || m.id === undefined) {\n      m.id = v4();\n      m.lc_kwargs.id = m.id;\n    }\n\n    if (m.getType() === 'remove' && m.id === REMOVE_ALL_MESSAGES) {\n      removeAllIdx = i;\n    }\n  }\n\n  if (removeAllIdx != null) return rightMessages.slice(removeAllIdx + 1);\n\n  // merge\n  const merged = [...leftMessages];\n  const mergedById = new Map(merged.map((m, i) => [m.id, i]));\n  const idsToRemove = new Set();\n  for (const m of rightMessages) {\n    const existingIdx = mergedById.get(m.id);\n    if (existingIdx !== undefined) {\n      if (m.getType() === 'remove') {\n        idsToRemove.add(m.id);\n      } else {\n        idsToRemove.delete(m.id);\n        merged[existingIdx] = m;\n      }\n    } else {\n      if (m.getType() === 'remove') {\n        throw new Error(\n          `Attempting to delete a message with an ID that doesn't exist ('${m.id}')`\n        );\n      }\n      mergedById.set(m.id, merged.length);\n      merged.push(m);\n    }\n  }\n  return merged.filter((m) => !idsToRemove.has(m.id));\n}\n"],"mappings":";;;AAQA,MAAa,sBAAsB;;;;;;;;;;;;;;;;;;AAmBnC,SAAgB,yBAAsC;CACpD,OAAO,IAAI,cAAc,EAAE,IAAI,oBAAoB,CAAC;AACtD;;;;;;AAYA,SAAgB,qBACd,MACA,OACe;CACf,MAAM,YAAY,MAAM,QAAQ,IAAI,IAAI,OAAO,CAAC,IAAI;CACpD,MAAM,aAAa,MAAM,QAAQ,KAAK,IAAI,QAAQ,CAAC,KAAK;CAExD,MAAM,eAAgB,UAAgC,IACpD,0BACF;CACA,MAAM,gBAAiB,WAAiC,IACtD,0BACF;CAEA,KAAK,MAAM,KAAK,cACd,IAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,KAAA,GAAW;EACvC,EAAE,KAAK,GAAG;EACV,EAAE,UAAU,KAAK,EAAE;CACrB;CAGF,IAAI;CACJ,KAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,KAAK,GAAG;EAChD,MAAM,IAAI,cAAc;EACxB,IAAI,EAAE,OAAO,QAAQ,EAAE,OAAO,KAAA,GAAW;GACvC,EAAE,KAAK,GAAG;GACV,EAAE,UAAU,KAAK,EAAE;EACrB;EAEA,IAAI,EAAE,QAAQ,MAAM,YAAY,EAAE,OAAA,kBAChC,eAAe;CAEnB;CAEA,IAAI,gBAAgB,MAAM,OAAO,cAAc,MAAM,eAAe,CAAC;CAGrE,MAAM,SAAS,CAAC,GAAG,YAAY;CAC/B,MAAM,aAAa,IAAI,IAAI,OAAO,KAAK,GAAG,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAC1D,MAAM,8BAAc,IAAI,IAAI;CAC5B,KAAK,MAAM,KAAK,eAAe;EAC7B,MAAM,cAAc,WAAW,IAAI,EAAE,EAAE;EACvC,IAAI,gBAAgB,KAAA,GAClB,IAAI,EAAE,QAAQ,MAAM,UAClB,YAAY,IAAI,EAAE,EAAE;OACf;GACL,YAAY,OAAO,EAAE,EAAE;GACvB,OAAO,eAAe;EACxB;OACK;GACL,IAAI,EAAE,QAAQ,MAAM,UAClB,MAAM,IAAI,MACR,kEAAkE,EAAE,GAAG,GACzE;GAEF,WAAW,IAAI,EAAE,IAAI,OAAO,MAAM;GAClC,OAAO,KAAK,CAAC;EACf;CACF;CACA,OAAO,OAAO,QAAQ,MAAM,CAAC,YAAY,IAAI,EAAE,EAAE,CAAC;AACpD"}

package/dist/esm/messages/tools.mjs

@@ -1,82 +1,56 @@
-import { ToolMessage, AIMessageChunk } from '@langchain/core/messages';
-import { findLastIndex } from './core.mjs';
-import { Constants } from '../common/enum.mjs';
-
-// src/messages/toolDiscovery.ts
+import "../common/enum.mjs";
+import "../common/index.mjs";
+import { findLastIndex } from "./core.mjs";
+import { AIMessageChunk, ToolMessage } from "@langchain/core/messages";
+//#region src/messages/tools.ts
 /**
- * Extracts discovered tool names from tool search results in the current turn.
- * Only processes tool search messages after the latest AI message with tool calls.
- *
- * Similar pattern to formatArtifactPayload - finds relevant messages efficiently
- * by identifying the latest AI parent and only processing subsequent tool messages.
- *
- * @param messages - All messages in the conversation
- * @returns Array of discovered tool names (empty if no new discoveries)
- */
+* Extracts discovered tool names from tool search results in the current turn.
+* Only processes tool search messages after the latest AI message with tool calls.
+*
+* Similar pattern to formatArtifactPayload - finds relevant messages efficiently
+* by identifying the latest AI parent and only processing subsequent tool messages.
+*
+* @param messages - All messages in the conversation
+* @returns Array of discovered tool names (empty if no new discoveries)
+*/
 function extractToolDiscoveries(messages) {
-    const lastMessage = messages[messages.length - 1];
-    if (!(lastMessage instanceof ToolMessage))
-        return [];
-    // Find the latest AIMessage with tool_calls that this tool message belongs to
-    const latestAIParentIndex = findLastIndex(messages, (msg) => (msg instanceof AIMessageChunk &&
-        (msg.tool_calls?.length ?? 0) > 0 &&
-        msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ??
-        false);
-    if (latestAIParentIndex === -1)
-        return [];
-    // Collect tool_call_ids from the AI message
-    const aiMessage = messages[latestAIParentIndex];
-    const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);
-    // Only process tool search results after the AI message that belong to this turn
-    const discoveredNames = [];
-    for (let i = latestAIParentIndex + 1; i < messages.length; i++) {
-        const msg = messages[i];
-        if (!(msg instanceof ToolMessage))
-            continue;
-        if (msg.name !== Constants.TOOL_SEARCH)
-            continue;
-        if (!toolCallIds.has(msg.tool_call_id))
-            continue;
-        // This is a tool search result from the current turn
-        if (typeof msg.artifact === 'object' && msg.artifact != null) {
-            const artifact = msg.artifact;
-            if (artifact.tool_references && artifact.tool_references.length > 0) {
-                for (const ref of artifact.tool_references) {
-                    discoveredNames.push(ref.tool_name);
-                }
-            }
-        }
-    }
-    return discoveredNames;
+	const lastMessage = messages[messages.length - 1];
+	if (!(lastMessage instanceof ToolMessage)) return [];
+	const latestAIParentIndex = findLastIndex(messages, (msg) => (msg instanceof AIMessageChunk && (msg.tool_calls?.length ?? 0) > 0 && msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ?? false);
+	if (latestAIParentIndex === -1) return [];
+	const aiMessage = messages[latestAIParentIndex];
+	const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);
+	const discoveredNames = [];
+	for (let i = latestAIParentIndex + 1; i < messages.length; i++) {
+		const msg = messages[i];
+		if (!(msg instanceof ToolMessage)) continue;
+		if (msg.name !== "tool_search") continue;
+		if (!toolCallIds.has(msg.tool_call_id)) continue;
+		if (typeof msg.artifact === "object" && msg.artifact != null) {
+			const artifact = msg.artifact;
+			if (artifact.tool_references && artifact.tool_references.length > 0) for (const ref of artifact.tool_references) discoveredNames.push(ref.tool_name);
+		}
+	}
+	return discoveredNames;
 }
 /**
- * Checks if the current turn has any tool search results.
- * Quick check to avoid full extraction when not needed.
- */
+* Checks if the current turn has any tool search results.
+* Quick check to avoid full extraction when not needed.
+*/
 function hasToolSearchInCurrentTurn(messages) {
-    const lastMessage = messages[messages.length - 1];
-    if (!(lastMessage instanceof ToolMessage))
-        return false;
-    // Find the latest AIMessage with tool_calls
-    const latestAIParentIndex = findLastIndex(messages, (msg) => (msg instanceof AIMessageChunk &&
-        (msg.tool_calls?.length ?? 0) > 0 &&
-        msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ??
-        false);
-    if (latestAIParentIndex === -1)
-        return false;
-    const aiMessage = messages[latestAIParentIndex];
-    const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);
-    // Check if any tool search results exist after the AI message
-    for (let i = latestAIParentIndex + 1; i < messages.length; i++) {
-        const msg = messages[i];
-        if (msg instanceof ToolMessage &&
-            msg.name === Constants.TOOL_SEARCH &&
-            toolCallIds.has(msg.tool_call_id)) {
-            return true;
-        }
-    }
-    return false;
+	const lastMessage = messages[messages.length - 1];
+	if (!(lastMessage instanceof ToolMessage)) return false;
+	const latestAIParentIndex = findLastIndex(messages, (msg) => (msg instanceof AIMessageChunk && (msg.tool_calls?.length ?? 0) > 0 && msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ?? false);
+	if (latestAIParentIndex === -1) return false;
+	const aiMessage = messages[latestAIParentIndex];
+	const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);
+	for (let i = latestAIParentIndex + 1; i < messages.length; i++) {
+		const msg = messages[i];
+		if (msg instanceof ToolMessage && msg.name === "tool_search" && toolCallIds.has(msg.tool_call_id)) return true;
+	}
+	return false;
 }
-
+//#endregion
 export { extractToolDiscoveries, hasToolSearchInCurrentTurn };
-//# sourceMappingURL=tools.mjs.map
+
+//# sourceMappingURL=tools.mjs.map

package/dist/esm/messages/tools.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"tools.mjs","sources":["../../../src/messages/tools.ts"],"sourcesContent":["// src/messages/toolDiscovery.ts\nimport { AIMessageChunk, ToolMessage } from '@langchain/core/messages';\nimport type { BaseMessage } from '@langchain/core/messages';\nimport { findLastIndex } from './core';\nimport { Constants } from '@/common';\n\ntype ToolSearchArtifact = {\n  tool_references?: Array<{ tool_name: string }>;\n};\n\n/**\n * Extracts discovered tool names from tool search results in the current turn.\n * Only processes tool search messages after the latest AI message with tool calls.\n *\n * Similar pattern to formatArtifactPayload - finds relevant messages efficiently\n * by identifying the latest AI parent and only processing subsequent tool messages.\n *\n * @param messages - All messages in the conversation\n * @returns Array of discovered tool names (empty if no new discoveries)\n */\nexport function extractToolDiscoveries(messages: BaseMessage[]): string[] {\n  const lastMessage = messages[messages.length - 1];\n  if (!(lastMessage instanceof ToolMessage)) return [];\n\n  // Find the latest AIMessage with tool_calls that this tool message belongs to\n  const latestAIParentIndex = findLastIndex(\n    messages,\n    (msg) =>\n      (msg instanceof AIMessageChunk &&\n        (msg.tool_calls?.length ?? 0) > 0 &&\n        msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ??\n      false\n  );\n\n  if (latestAIParentIndex === -1) return [];\n\n  // Collect tool_call_ids from the AI message\n  const aiMessage = messages[latestAIParentIndex] as AIMessageChunk;\n  const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);\n\n  // Only process tool search results after the AI message that belong to this turn\n  const discoveredNames: string[] = [];\n  for (let i = latestAIParentIndex + 1; i < messages.length; i++) {\n    const msg = messages[i];\n    if (!(msg instanceof ToolMessage)) continue;\n    if (msg.name !== Constants.TOOL_SEARCH) continue;\n    if (!toolCallIds.has(msg.tool_call_id)) continue;\n\n    // This is a tool search result from the current turn\n    if (typeof msg.artifact === 'object' && msg.artifact != null) {\n      const artifact = msg.artifact as ToolSearchArtifact;\n      if (artifact.tool_references && artifact.tool_references.length > 0) {\n        for (const ref of artifact.tool_references) {\n          discoveredNames.push(ref.tool_name);\n        }\n      }\n    }\n  }\n\n  return discoveredNames;\n}\n\n/**\n * Checks if the current turn has any tool search results.\n * Quick check to avoid full extraction when not needed.\n */\nexport function hasToolSearchInCurrentTurn(messages: BaseMessage[]): boolean {\n  const lastMessage = messages[messages.length - 1];\n  if (!(lastMessage instanceof ToolMessage)) return false;\n\n  // Find the latest AIMessage with tool_calls\n  const latestAIParentIndex = findLastIndex(\n    messages,\n    (msg) =>\n      (msg instanceof AIMessageChunk &&\n        (msg.tool_calls?.length ?? 0) > 0 &&\n        msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ??\n      false\n  );\n\n  if (latestAIParentIndex === -1) return false;\n\n  const aiMessage = messages[latestAIParentIndex] as AIMessageChunk;\n  const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);\n\n  // Check if any tool search results exist after the AI message\n  for (let i = latestAIParentIndex + 1; i < messages.length; i++) {\n    const msg = messages[i];\n    if (\n      msg instanceof ToolMessage &&\n      msg.name === Constants.TOOL_SEARCH &&\n      toolCallIds.has(msg.tool_call_id)\n    ) {\n      return true;\n    }\n  }\n\n  return false;\n}\n"],"names":[],"mappings":";;;;AAAA;AAUA;;;;;;;;;AASG;AACG,SAAU,sBAAsB,CAAC,QAAuB,EAAA;IAC5D,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;AACjD,IAAA,IAAI,EAAE,WAAW,YAAY,WAAW,CAAC;AAAE,QAAA,OAAO,EAAE;;AAGpD,IAAA,MAAM,mBAAmB,GAAG,aAAa,CACvC,QAAQ,EACR,CAAC,GAAG,KACF,CAAC,GAAG,YAAY,cAAc;QAC5B,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC;AACjC,QAAA,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,YAAY,CAAC;AAClE,QAAA,KAAK,CACR;IAED,IAAI,mBAAmB,KAAK,EAAE;AAAE,QAAA,OAAO,EAAE;;AAGzC,IAAA,MAAM,SAAS,GAAG,QAAQ,CAAC,mBAAmB,CAAmB;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;;IAG3E,MAAM,eAAe,GAAa,EAAE;AACpC,IAAA,KAAK,IAAI,CAAC,GAAG,mBAAmB,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9D,QAAA,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC;AACvB,QAAA,IAAI,EAAE,GAAG,YAAY,WAAW,CAAC;YAAE;AACnC,QAAA,IAAI,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,WAAW;YAAE;QACxC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC;YAAE;;AAGxC,QAAA,IAAI,OAAO,GAAG,CAAC,QAAQ,KAAK,QAAQ,IAAI,GAAG,CAAC,QAAQ,IAAI,IAAI,EAAE;AAC5D,YAAA,MAAM,QAAQ,GAAG,GAAG,CAAC,QAA8B;AACnD,YAAA,IAAI,QAAQ,CAAC,eAAe,IAAI,QAAQ,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE;AACnE,gBAAA,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,eAAe,EAAE;AAC1C,oBAAA,eAAe,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC;gBACrC;YACF;QACF;IACF;AAEA,IAAA,OAAO,eAAe;AACxB;AAEA;;;AAGG;AACG,SAAU,0BAA0B,CAAC,QAAuB,EAAA;IAChE,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;AACjD,IAAA,IAAI,EAAE,WAAW,YAAY,WAAW,CAAC;AAAE,QAAA,OAAO,KAAK;;AAGvD,IAAA,MAAM,mBAAmB,GAAG,aAAa,CACvC,QAAQ,EACR,CAAC,GAAG,KACF,CAAC,GAAG,YAAY,cAAc;QAC5B,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,IAAI,CAAC,IAAI,CAAC;AACjC,QAAA,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,WAAW,CAAC,YAAY,CAAC;AAClE,QAAA,KAAK,CACR;IAED,IAAI,mBAAmB,KAAK,EAAE;AAAE,QAAA,OAAO,KAAK;AAE5C,IAAA,MAAM,SAAS,GAAG,QAAQ,CAAC,mBAAmB,CAAmB;IACjE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,UAAU,EAAE,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;;AAG3E,IAAA,KAAK,IAAI,CAAC,GAAG,mBAAmB,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC9D,QAAA,MAAM,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC;QACvB,IACE,GAAG,YAAY,WAAW;AAC1B,YAAA,GAAG,CAAC,IAAI,KAAK,SAAS,CAAC,WAAW;YAClC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,YAAY,CAAC,EACjC;AACA,YAAA,OAAO,IAAI;QACb;IACF;AAEA,IAAA,OAAO,KAAK;AACd;;;;"}
+{"version":3,"file":"tools.mjs","names":[],"sources":["../../../src/messages/tools.ts"],"sourcesContent":["// src/messages/toolDiscovery.ts\nimport { AIMessageChunk, ToolMessage } from '@langchain/core/messages';\nimport type { BaseMessage } from '@langchain/core/messages';\nimport { findLastIndex } from './core';\nimport { Constants } from '@/common';\n\ntype ToolSearchArtifact = {\n  tool_references?: Array<{ tool_name: string }>;\n};\n\n/**\n * Extracts discovered tool names from tool search results in the current turn.\n * Only processes tool search messages after the latest AI message with tool calls.\n *\n * Similar pattern to formatArtifactPayload - finds relevant messages efficiently\n * by identifying the latest AI parent and only processing subsequent tool messages.\n *\n * @param messages - All messages in the conversation\n * @returns Array of discovered tool names (empty if no new discoveries)\n */\nexport function extractToolDiscoveries(messages: BaseMessage[]): string[] {\n  const lastMessage = messages[messages.length - 1];\n  if (!(lastMessage instanceof ToolMessage)) return [];\n\n  // Find the latest AIMessage with tool_calls that this tool message belongs to\n  const latestAIParentIndex = findLastIndex(\n    messages,\n    (msg) =>\n      (msg instanceof AIMessageChunk &&\n        (msg.tool_calls?.length ?? 0) > 0 &&\n        msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ??\n      false\n  );\n\n  if (latestAIParentIndex === -1) return [];\n\n  // Collect tool_call_ids from the AI message\n  const aiMessage = messages[latestAIParentIndex] as AIMessageChunk;\n  const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);\n\n  // Only process tool search results after the AI message that belong to this turn\n  const discoveredNames: string[] = [];\n  for (let i = latestAIParentIndex + 1; i < messages.length; i++) {\n    const msg = messages[i];\n    if (!(msg instanceof ToolMessage)) continue;\n    if (msg.name !== Constants.TOOL_SEARCH) continue;\n    if (!toolCallIds.has(msg.tool_call_id)) continue;\n\n    // This is a tool search result from the current turn\n    if (typeof msg.artifact === 'object' && msg.artifact != null) {\n      const artifact = msg.artifact as ToolSearchArtifact;\n      if (artifact.tool_references && artifact.tool_references.length > 0) {\n        for (const ref of artifact.tool_references) {\n          discoveredNames.push(ref.tool_name);\n        }\n      }\n    }\n  }\n\n  return discoveredNames;\n}\n\n/**\n * Checks if the current turn has any tool search results.\n * Quick check to avoid full extraction when not needed.\n */\nexport function hasToolSearchInCurrentTurn(messages: BaseMessage[]): boolean {\n  const lastMessage = messages[messages.length - 1];\n  if (!(lastMessage instanceof ToolMessage)) return false;\n\n  // Find the latest AIMessage with tool_calls\n  const latestAIParentIndex = findLastIndex(\n    messages,\n    (msg) =>\n      (msg instanceof AIMessageChunk &&\n        (msg.tool_calls?.length ?? 0) > 0 &&\n        msg.tool_calls?.some((tc) => tc.id === lastMessage.tool_call_id)) ??\n      false\n  );\n\n  if (latestAIParentIndex === -1) return false;\n\n  const aiMessage = messages[latestAIParentIndex] as AIMessageChunk;\n  const toolCallIds = new Set(aiMessage.tool_calls?.map((tc) => tc.id) ?? []);\n\n  // Check if any tool search results exist after the AI message\n  for (let i = latestAIParentIndex + 1; i < messages.length; i++) {\n    const msg = messages[i];\n    if (\n      msg instanceof ToolMessage &&\n      msg.name === Constants.TOOL_SEARCH &&\n      toolCallIds.has(msg.tool_call_id)\n    ) {\n      return true;\n    }\n  }\n\n  return false;\n}\n"],"mappings":";;;;;;;;;;;;;;;AAoBA,SAAgB,uBAAuB,UAAmC;CACxE,MAAM,cAAc,SAAS,SAAS,SAAS;CAC/C,IAAI,EAAE,uBAAuB,cAAc,OAAO,CAAC;CAGnD,MAAM,sBAAsB,cAC1B,WACC,SACE,eAAe,mBACb,IAAI,YAAY,UAAU,KAAK,KAChC,IAAI,YAAY,MAAM,OAAO,GAAG,OAAO,YAAY,YAAY,MACjE,KACJ;CAEA,IAAI,wBAAwB,IAAI,OAAO,CAAC;CAGxC,MAAM,YAAY,SAAS;CAC3B,MAAM,cAAc,IAAI,IAAI,UAAU,YAAY,KAAK,OAAO,GAAG,EAAE,KAAK,CAAC,CAAC;CAG1E,MAAM,kBAA4B,CAAC;CACnC,KAAK,IAAI,IAAI,sBAAsB,GAAG,IAAI,SAAS,QAAQ,KAAK;EAC9D,MAAM,MAAM,SAAS;EACrB,IAAI,EAAE,eAAe,cAAc;EACnC,IAAI,IAAI,SAAA,eAAgC;EACxC,IAAI,CAAC,YAAY,IAAI,IAAI,YAAY,GAAG;EAGxC,IAAI,OAAO,IAAI,aAAa,YAAY,IAAI,YAAY,MAAM;GAC5D,MAAM,WAAW,IAAI;GACrB,IAAI,SAAS,mBAAmB,SAAS,gBAAgB,SAAS,GAChE,KAAK,MAAM,OAAO,SAAS,iBACzB,gBAAgB,KAAK,IAAI,SAAS;EAGxC;CACF;CAEA,OAAO;AACT;;;;;AAMA,SAAgB,2BAA2B,UAAkC;CAC3E,MAAM,cAAc,SAAS,SAAS,SAAS;CAC/C,IAAI,EAAE,uBAAuB,cAAc,OAAO;CAGlD,MAAM,sBAAsB,cAC1B,WACC,SACE,eAAe,mBACb,IAAI,YAAY,UAAU,KAAK,KAChC,IAAI,YAAY,MAAM,OAAO,GAAG,OAAO,YAAY,YAAY,MACjE,KACJ;CAEA,IAAI,wBAAwB,IAAI,OAAO;CAEvC,MAAM,YAAY,SAAS;CAC3B,MAAM,cAAc,IAAI,IAAI,UAAU,YAAY,KAAK,OAAO,GAAG,EAAE,KAAK,CAAC,CAAC;CAG1E,KAAK,IAAI,IAAI,sBAAsB,GAAG,IAAI,SAAS,QAAQ,KAAK;EAC9D,MAAM,MAAM,SAAS;EACrB,IACE,eAAe,eACf,IAAI,SAAA,iBACJ,YAAY,IAAI,IAAI,YAAY,GAEhC,OAAO;CAEX;CAEA,OAAO;AACT"}