recursive-agent 0.8.3

//! Chat completion data types.
//!
//! These types are the wire contract between the [`ChatProvider`] trait and
//! its callers. All provider implementations produce and consume these
//! shapes; nothing in `tools/` or `agent/` depends on provider internals.

use serde::{Deserialize, Serialize};
use serde_json::Value;
use tokio::sync::mpsc;

use crate::message::Message;

/// A single streamed delta emitted by a provider during a streaming LLM call.
///
/// Providers that expose an explicit reasoning channel (DeepSeek R1, OpenAI
/// o1/o3, Anthropic / DeepSeek extended thinking) emit `Reasoning` deltas
/// *before* the answer's `Text` deltas, so consumers can render the
/// chain-of-thought live and above the final answer.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum StreamChunk {
    /// A delta of the visible answer text.
    Text(String),
    /// A delta of the model's reasoning / thinking text.
    Reasoning(String),
}

/// Channel sender for streaming partial deltas during a streaming LLM call.
/// Each [`StreamChunk`] is a delta emitted by the provider.
pub type StreamSender = mpsc::UnboundedSender<StreamChunk>;

/// Locally-estimated per-component token breakdown of the prompt sent to the
/// provider.
///
/// Distinct from [`TokenUsage`] (which is the provider's reported truth):
/// these are local chars/4 estimates, one bucket per logical segment of the
/// assembled prompt. The `overhead` bucket absorbs the difference between
/// the sum of the other buckets and the provider's reported `prompt_tokens`
/// (chat-template wrapping, tool JSON envelope, message separators) so the
/// breakdown is honest about its estimation error rather than pretending
/// to be exact.
///
/// Recomputed every step: the static buckets (`system_prompt`, `rules`,
/// `skills`, `subagents`, `tools`, `mcp_dynamic`) change only on a `/model`
/// hot-swap or tool-registry change, while `conversation` grows with every
/// transcript mutation and `overhead` is derived from the provider's
/// reported `prompt_tokens` after each step.
#[derive(Debug, Clone, Copy, Default, PartialEq, Eq, Serialize, Deserialize)]
pub struct ContextBreakdown {
    /// `default_system_prompt` + the six memory layers + any channel
    /// `append_system_prompt` suffix.
    pub system_prompt: u32,
    /// `# Project context` block: `AGENTS.md` + `CLAUDE.md` from
    /// `prepend_project_context`.
    pub rules: u32,
    /// `skill_index()` output.
    pub skills: u32,
    /// `## Coordinator workflow` + `sub_agent` usage note (only when
    /// `sub_agent_enabled`).
    pub subagents: u32,
    /// Eager tool specs that are NOT from MCP and NOT deferred.
    pub tools: u32,
    /// Tool specs that ARE MCP-sourced or deferred (the dynamic /
    /// discovered-tools bucket).
    pub mcp_dynamic: u32,
    /// `self.messages` text content (transcript body).
    pub conversation: u32,
    /// Provider total - local sum (saturating to 0). Absorbs chat-template
    /// wrapping, tool JSON envelope, and message separators that the local
    /// estimate can't reproduce.
    pub overhead: u32,
}

impl ContextBreakdown {
    /// Sum of the seven non-overhead buckets.
    pub fn local_sum(&self) -> u32 {
        self.system_prompt
            .saturating_add(self.rules)
            .saturating_add(self.skills)
            .saturating_add(self.subagents)
            .saturating_add(self.tools)
            .saturating_add(self.mcp_dynamic)
            .saturating_add(self.conversation)
    }

    /// Total of every bucket including overhead.
    pub fn total(&self) -> u32 {
        self.local_sum().saturating_add(self.overhead)
    }
}

/// Rough token estimate for budget/breakdown display. Uses a bytes/4
/// heuristic (≈4 bytes/token for English; over-counts CJK ~3× because CJK
/// chars are 3 UTF-8 bytes each). This is intentionally byte-based for
/// speed (no char iteration) and is only an estimate — exact tokenization
/// would require the provider's tokenizer. Do not use for billing.
///
/// Used by both the `estimate_tokens` tool and the local `ContextBreakdown`
/// so the two share the same arithmetic.
///
/// The estimator deliberately rounds up (ceil) so a 5-byte string becomes
/// 2 tokens, not 1; this matches the conservative budgeting the rest of
/// the codebase applies when comparing local estimates against the
/// provider's reported truth.
pub fn estimate_tokens(text: &str) -> u32 {
    let bytes = text.len();
    let tokens = (bytes as f64 / 4.0).ceil() as u32;
    // Defensive: if bytes overflow the divisor (impossible for `str::len()`
    // on a single allocation but possible in theory), the f64 rounding
    // path can yield 0. Force a 1-token floor for any non-empty input.
    if tokens == 0 && !text.is_empty() {
        1
    } else {
        tokens
    }
}

/// Token usage data from an LLM response.
#[derive(Debug, Clone, Copy, Default, PartialEq, Eq, Serialize, Deserialize)]
pub struct TokenUsage {
    pub prompt_tokens: u32,
    pub completion_tokens: u32,
    pub total_tokens: u32,
    /// Input tokens served from the provider's prompt cache.
    ///
    /// Invariant (normalised across providers):
    /// `cache_hit_tokens + cache_miss_tokens == total input tokens`.
    /// A "hit" is a token read from cache; everything else processed for the
    /// prompt (fresh input *and* tokens written to cache) counts as a "miss".
    /// This lets consumers compute a cache-hit rate as
    /// `cache_hit / (cache_hit + cache_miss)` uniformly, regardless of which
    /// provider reported the usage. DeepSeek already reports the split this
    /// way (`prompt_tokens = hit + miss`); Anthropic reports `input_tokens`,
    /// `cache_read_input_tokens` and `cache_creation_input_tokens` separately,
    /// so its parser folds `input + creation` into `cache_miss_tokens`.
    pub cache_hit_tokens: u32,
    pub cache_miss_tokens: u32,
    /// Reasoning / thinking tokens emitted by models that support
    /// extended thinking (DeepSeek R1, OpenAI o1, Anthropic
    /// extended thinking). Adds to the cost total because the
    /// model spent compute producing them. Default 0 for models
    /// that don't report this separately.
    pub reasoning_tokens: u32,
}

impl TokenUsage {
    /// Saturating element-wise sum. Used to accumulate across LLM calls.
    pub fn accumulate(self, other: TokenUsage) -> TokenUsage {
        TokenUsage {
            reasoning_tokens: self.reasoning_tokens.saturating_add(other.reasoning_tokens),
            prompt_tokens: self.prompt_tokens.saturating_add(other.prompt_tokens),
            completion_tokens: self
                .completion_tokens
                .saturating_add(other.completion_tokens),
            total_tokens: self.total_tokens.saturating_add(other.total_tokens),
            cache_hit_tokens: self.cache_hit_tokens.saturating_add(other.cache_hit_tokens),
            cache_miss_tokens: self
                .cache_miss_tokens
                .saturating_add(other.cache_miss_tokens),
        }
    }
}

/// JSON-schema description of a tool, sent verbatim to the model.
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct ToolSpec {
    pub name: String,
    pub description: String,
    /// JSON Schema object describing the tool's input.
    pub parameters: Value,
}

/// A structured request to invoke one of the registered tools.
#[derive(Debug, Clone, PartialEq, Serialize, Deserialize)]
pub struct ToolCall {
    pub id: String,
    pub name: String,
    /// Raw JSON arguments as produced by the model.
    pub arguments: Value,
}

/// Request for a structured JSON response conforming to a JSON schema.
pub struct StructuredRequest {
    pub messages: Vec<Message>,
    /// JSON Schema describing the expected response shape.
    pub schema: Value,
    /// Name for the schema (sent to the provider as `schema_name`).
    pub schema_name: String,
}

/// One step of model output.
#[derive(Debug, Clone, Default)]
pub struct Completion {
    pub content: String,
    pub tool_calls: Vec<ToolCall>,
    pub finish_reason: Option<String>,
    pub usage: Option<TokenUsage>,
    /// DeepSeek reasoning/thinking content. Stored in the transcript and
    /// echoed back on subsequent requests to satisfy the API contract.
    pub reasoning_content: Option<String>,
}

impl Completion {
    /// Normalise chain-of-thought that a model emitted *inline* in the
    /// `content` field wrapped in `<think>…</think>` tags into the
    /// dedicated [`Completion::reasoning_content`] channel.
    ///
    /// Many DeepSeek-R1 style deployments (and OpenAI-compatible proxies)
    /// don't populate the separate `reasoning_content` SSE field; they
    /// stream the thinking inline as `<think>…</think>` inside `content`.
    /// Downstream the TUI markdown renderer parses those tags as an HTML
    /// block and silently drops the whole section — so the thinking is
    /// visible while streaming but disappears once the turn finalises and
    /// the assistant block is re-rendered from `content`.
    ///
    /// This moves the inner text into `reasoning_content` (so the existing
    /// `AgentEvent::Reasoning` → thinking-block pipeline lights up) and
    /// strips the tags from `content` (so the answer renders cleanly).
    ///
    /// No-op when `reasoning_content` is already populated (true reasoner
    /// models that use the dedicated field) or when no `<think>` tag is
    /// present.
    pub fn extract_inline_reasoning(&mut self) {
        if self
            .reasoning_content
            .as_deref()
            .is_some_and(|r| !r.trim().is_empty())
        {
            return;
        }
        let Some((reasoning, cleaned)) = split_think_tags(&self.content) else {
            return;
        };
        if !reasoning.is_empty() {
            self.reasoning_content = Some(reasoning);
        }
        self.content = cleaned;
    }
}

/// Split a `<think>…</think>` block out of `content`.
///
/// Returns `Some((reasoning, cleaned_content))` when an opening `<think>`
/// tag is present, else `None`. An unclosed `<think>` (e.g. a truncated
/// response) treats everything after the tag as reasoning. Both halves are
/// trimmed of surrounding whitespace.
fn split_think_tags(content: &str) -> Option<(String, String)> {
    const OPEN: &str = "<think>";
    const CLOSE: &str = "</think>";

    let open_idx = content.find(OPEN)?;
    let after_open = open_idx + OPEN.len();

    if let Some(rel_close) = content[after_open..].find(CLOSE) {
        let close_idx = after_open + rel_close;
        let reasoning = content[after_open..close_idx].trim().to_string();
        let mut cleaned = String::with_capacity(content.len());
        cleaned.push_str(&content[..open_idx]);
        cleaned.push_str(&content[close_idx + CLOSE.len()..]);
        Some((reasoning, cleaned.trim().to_string()))
    } else {
        // Unclosed tag: treat the remainder as reasoning.
        let reasoning = content[after_open..].trim().to_string();
        let cleaned = content[..open_idx].trim().to_string();
        Some((reasoning, cleaned))
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    fn completion_with_content(content: &str) -> Completion {
        Completion {
            content: content.to_string(),
            ..Default::default()
        }
    }

    #[test]
    fn estimate_tokens_is_byte_based_documents_cjk_overcount() {
        // "hello world" = 11 bytes / 11 chars; "你好世界" = 12 bytes / 4 chars.
        let ascii = "hello world";
        let cjk = "你好世界";
        // Pin the byte/char counts so the ratio below is self-documenting.
        assert_eq!(ascii.len(), 11);
        assert_eq!(ascii.chars().count(), 11);
        assert_eq!(cjk.len(), 12);
        assert_eq!(cjk.chars().count(), 4);
        // Byte-based: ascii=11/4≈3, cjk=12/4=3 — same tokens despite cjk having 1/3 the chars.
        assert_eq!(estimate_tokens(ascii), 3);
        assert_eq!(estimate_tokens(cjk), 3);
        assert_eq!(estimate_tokens(ascii), estimate_tokens(cjk));
        // This equality IS the known over-count; the docstring explains it.
    }

    #[test]
    fn extract_inline_reasoning_moves_think_block_to_reasoning() {
        let mut c = completion_with_content(
            "<think>\nlet me work through this\n</think>\n\nThe answer is 42.",
        );
        c.extract_inline_reasoning();
        assert_eq!(
            c.reasoning_content.as_deref(),
            Some("let me work through this")
        );
        assert_eq!(c.content, "The answer is 42.");
    }

    #[test]
    fn extract_inline_reasoning_handles_inline_single_line() {
        let mut c = completion_with_content("<think>quick thought</think>answer");
        c.extract_inline_reasoning();
        assert_eq!(c.reasoning_content.as_deref(), Some("quick thought"));
        assert_eq!(c.content, "answer");
    }

    #[test]
    fn extract_inline_reasoning_unclosed_tag_treats_rest_as_reasoning() {
        let mut c = completion_with_content("partial answer<think>still thinking");
        c.extract_inline_reasoning();
        assert_eq!(c.reasoning_content.as_deref(), Some("still thinking"));
        assert_eq!(c.content, "partial answer");
    }

    #[test]
    fn extract_inline_reasoning_no_tag_is_noop() {
        let mut c = completion_with_content("just a plain answer");
        c.extract_inline_reasoning();
        assert!(c.reasoning_content.is_none());
        assert_eq!(c.content, "just a plain answer");
    }

    // ── TokenUsage::accumulate tests ─────────────────────────────────────────

    #[test]
    fn token_usage_accumulate_sums_all_fields() {
        // kills function-level replacement and any single-field mutation in accumulate()
        let a = TokenUsage {
            reasoning_tokens: 10,
            prompt_tokens: 20,
            completion_tokens: 30,
            total_tokens: 60,
            cache_hit_tokens: 5,
            cache_miss_tokens: 15,
        };
        let b = TokenUsage {
            reasoning_tokens: 1,
            prompt_tokens: 2,
            completion_tokens: 3,
            total_tokens: 6,
            cache_hit_tokens: 4,
            cache_miss_tokens: 9,
        };
        let c = a.accumulate(b);
        assert_eq!(c.reasoning_tokens, 11);
        assert_eq!(c.prompt_tokens, 22);
        assert_eq!(c.completion_tokens, 33);
        assert_eq!(c.total_tokens, 66);
        assert_eq!(c.cache_hit_tokens, 9);
        assert_eq!(c.cache_miss_tokens, 24);
    }

    #[test]
    fn token_usage_accumulate_saturates_on_overflow() {
        // kills `saturating_add` → wrapping_add or `+` mutations
        let big = TokenUsage {
            reasoning_tokens: u32::MAX,
            prompt_tokens: u32::MAX,
            completion_tokens: u32::MAX,
            total_tokens: u32::MAX,
            cache_hit_tokens: u32::MAX,
            cache_miss_tokens: u32::MAX,
        };
        let one = TokenUsage {
            reasoning_tokens: 1,
            prompt_tokens: 1,
            completion_tokens: 1,
            total_tokens: 1,
            cache_hit_tokens: 1,
            cache_miss_tokens: 1,
        };
        let result = big.accumulate(one);
        assert_eq!(
            result.reasoning_tokens,
            u32::MAX,
            "must saturate, not overflow"
        );
        assert_eq!(result.prompt_tokens, u32::MAX);
        assert_eq!(result.completion_tokens, u32::MAX);
    }

    #[test]
    fn split_think_tags_empty_block_returns_empty_reasoning() {
        // kills mutations in the trimming / boundary logic for empty think blocks
        let result = split_think_tags("<think></think>answer");
        assert!(result.is_some(), "empty think block must still parse");
        let (reasoning, cleaned) = result.unwrap();
        assert!(
            reasoning.is_empty(),
            "reasoning must be empty for empty tags; got: {reasoning:?}"
        );
        assert_eq!(cleaned, "answer");
    }

    #[test]
    fn split_think_tags_returns_none_when_no_tag() {
        // kills `content.find(OPEN)?` → always-Some mutations
        let result = split_think_tags("no think tag here");
        assert!(
            result.is_none(),
            "must return None when no <think> tag present"
        );
    }

    #[test]
    fn split_think_tags_preserves_content_before_tag() {
        // kills mutations to the `content[..open_idx]` slice in split_think_tags
        let result = split_think_tags("prefix <think>reason</think>suffix");
        assert!(result.is_some());
        let (reasoning, cleaned) = result.unwrap();
        assert_eq!(reasoning, "reason");
        assert!(
            cleaned.contains("prefix"),
            "content before <think> must be preserved in cleaned: {cleaned:?}"
        );
        assert!(
            cleaned.contains("suffix"),
            "content after </think> must be preserved in cleaned: {cleaned:?}"
        );
    }

    #[test]
    fn extract_inline_reasoning_preserves_existing_reasoning_field() {
        // True reasoner model: reasoning_content already populated via the
        // dedicated SSE field. Leave content untouched even if it happens
        // to contain a stray tag.
        let mut c = Completion {
            content: "<think>ignored</think>answer".to_string(),
            reasoning_content: Some("real reasoning".to_string()),
            ..Default::default()
        };
        c.extract_inline_reasoning();
        assert_eq!(c.reasoning_content.as_deref(), Some("real reasoning"));
        assert_eq!(c.content, "<think>ignored</think>answer");
    }

    // ── estimate_tokens tests ───────────────────────────────────────────

    #[test]
    fn estimate_tokens_empty_string_is_zero() {
        // kills `replace / 4.0 with % 4.0` mutation — % would yield 0 / 4 = 0
        // for "" (correct by accident), but the ceil-cast branch must still
        // produce 0. The defensive floor only kicks in when ceil is 0 AND
        // text is non-empty, so empty text → 0 must round-trip cleanly.
        assert_eq!(estimate_tokens(""), 0);
    }

    #[test]
    fn estimate_tokens_exact_multiple_of_four() {
        // 4 chars / 4 = 1 → ceil = 1 token exactly.
        // kills `replace ceil with floor` — 4/4 = 1 either way, so we
        // additionally check that the no-op rounding doesn't drift.
        assert_eq!(estimate_tokens("abcd"), 1);
    }

    #[test]
    fn estimate_tokens_uses_ceil_not_floor() {
        // 5 chars / 4 = 1.25 → ceil = 2 tokens; floor would give 1.
        // This is the load-bearing case: a half-token string must round UP
        // so we never underestimate the local prompt size.
        assert_eq!(estimate_tokens("abcde"), 2);
        assert_eq!(
            estimate_tokens("abcdefg"),
            2, // 7/4 = 1.75 → 2
            "7-char string must round up to 2 tokens"
        );
    }

    #[test]
    fn estimate_tokens_long_string_scales_linearly() {
        // 100 chars / 4 = 25 → ceil = 25.
        let text = "a".repeat(100);
        assert_eq!(estimate_tokens(&text), 25);
    }

    #[test]
    fn estimate_tokens_single_nonempty_returns_at_least_one() {
        // Defensive floor: any non-empty input must yield >= 1 token so
        // a 1-char string (which ceil-divides to 0.25 → 1 anyway) and a
        // 2-char string (which ceil-divides to 0.5 → 1) are consistent.
        assert_eq!(estimate_tokens("a"), 1);
        assert_eq!(estimate_tokens("ab"), 1);
    }

    // ── ContextBreakdown tests ──────────────────────────────────────────

    #[test]
    fn context_breakdown_default_is_all_zeros() {
        // All buckets default to 0 so a freshly-built breakdown serialises
        // cleanly without per-field Option wrappers.
        let b = ContextBreakdown::default();
        assert_eq!(b.system_prompt, 0);
        assert_eq!(b.rules, 0);
        assert_eq!(b.skills, 0);
        assert_eq!(b.subagents, 0);
        assert_eq!(b.tools, 0);
        assert_eq!(b.mcp_dynamic, 0);
        assert_eq!(b.conversation, 0);
        assert_eq!(b.overhead, 0);
        assert_eq!(b.local_sum(), 0);
        assert_eq!(b.total(), 0);
    }

    #[test]
    fn context_breakdown_local_sum_excludes_overhead() {
        // local_sum is the seven user-meaningful buckets. Overhead must be
        // excluded so it can be subtracted by the breakdown-computation
        // code without double-counting.
        let b = ContextBreakdown {
            system_prompt: 10,
            rules: 20,
            skills: 30,
            subagents: 40,
            tools: 50,
            mcp_dynamic: 60,
            conversation: 70,
            overhead: 9999,
        };
        assert_eq!(b.local_sum(), 280);
        assert_eq!(b.total(), 280 + 9999);
    }

    #[test]
    fn context_breakdown_serde_round_trip() {
        let b = ContextBreakdown {
            system_prompt: 11,
            rules: 22,
            skills: 33,
            subagents: 44,
            tools: 55,
            mcp_dynamic: 66,
            conversation: 77,
            overhead: 88,
        };
        let json = serde_json::to_string(&b).unwrap();
        let back: ContextBreakdown = serde_json::from_str(&json).unwrap();
        assert_eq!(b, back);
    }
}