//
// help_topic.rs
//
// Copyright (C) 2023 Posit Software, PBC. All rights reserved.
//
//

use oak_db::File;
use serde::Deserialize;
use serde::Serialize;
use tower_lsp_server::ls_types::Position;
use tower_lsp_server::ls_types::VersionedTextDocumentIdentifier;
use tree_sitter::Node;
use tree_sitter::Point;
use tree_sitter::Tree;

use crate::lsp;
use crate::lsp::backend::LspResult;
use crate::lsp::db::ArkDb;
use crate::lsp::db::FileArkExt;
use crate::lsp::traits::node::NodeExt;
use crate::treesitter::NodeType;
use crate::treesitter::NodeTypeExt;

pub static POSITRON_HELP_TOPIC_REQUEST: &str = "positron/textDocument/helpTopic";

#[derive(Debug, Eq, PartialEq, Clone, Deserialize, Serialize)]
#[serde(rename_all = "camelCase")]
pub struct HelpTopicParams {
    /// The document to provide a help topic for.
    pub text_document: VersionedTextDocumentIdentifier,
    /// The location of the cursor.
    pub position: Position,
}

#[derive(Debug, Eq, PartialEq, Clone, Deserialize, Serialize)]
#[serde(rename_all = "camelCase")]
pub struct HelpTopicResponse {
    /// The help topic appropriate for the cursor position.
    pub topic: String,
}

pub(crate) fn help_topic(
    db: &dyn ArkDb,
    file: File,
    point: Point,
) -> LspResult<Option<HelpTopicResponse>> {
    let tree = file.tree_sitter(db);

    let Some(node) = locate_help_node(tree, point) else {
        lsp::log_warn!("help_topic(): No help node at position {point}");
        return Ok(None);
    };

    let text = node.node_to_string(file.source_text(db))?;
    let response = HelpTopicResponse { topic: text };

    lsp::log_info!(
        "help_topic(): Using help topic '{}' at position {}",
        response.topic,
        point
    );

    Ok(Some(response))
}

fn locate_help_node(tree: &Tree, point: Point) -> Option<Node<'_>> {
    let root = tree.root_node();

    let mut node = root.find_closest_node_to_point(point)?;

    // Find the nearest node that is an identifier.
    while !node.is_identifier() {
        if let Some(sibling) = node.prev_sibling() {
            // Move to an adjacent sibling if we can.
            node = sibling;
        } else {
            // If no sibling, check the parent.
            node = node.parent()?;
        }
    }

    // Check if this identifier is part of a namespace operator. If it is, we send
    // back the whole `pkg::fun` text, regardless of which side the user was on.
    // Even if they are at `p<>kg::fun`, we assume they really want docs for `fun`.
    let node = match node.parent() {
        Some(parent) if matches!(parent.node_type(), NodeType::NamespaceOperator(_)) => parent,
        Some(parent) if matches!(parent.node_type(), NodeType::ExtractOperator(_)) => parent,
        Some(_) => node,
        None => node,
    };

    Some(node)
}

#[cfg(test)]
mod tests {
    use tree_sitter::Parser;

    use crate::fixtures::point_from_cursor;
    use crate::lsp::help_topic::locate_help_node;
    use crate::lsp::traits::node::NodeExt;

    #[test]
    fn test_locate_help_node() {
        let mut parser = Parser::new();
        parser
            .set_language(&tree_sitter_r::LANGUAGE.into())
            .expect("failed to create parser");

        // (text cursor, expected help topic)
        let cases = vec![
            // On the RHS
            ("dplyr::ac@ross(x:y, sum)", "dplyr::across"),
            // On the LHS (Returns function help for `across()`, not package help for `dplyr`,
            // as we assume that is more useful for the user).
            ("dpl@yr::across(x:y, sum)", "dplyr::across"),
            // In the operator
            ("dplyr:@:across(x:y, sum)", "dplyr::across"),
            // Internal `:::`
            ("dplyr:::ac@ross(x:y, sum)", "dplyr:::across"),
            // R6 methods, or reticulate accessors
            ("tf$a@bs(x)", "tf$abs"),
            ("t@f$abs(x)", "tf$abs"),
            // With the package namespace
            ("tensorflow::tf$ab@s(x)", "tensorflow::tf$abs"),
        ];

        for (code, expected) in cases {
            let (text, point) = point_from_cursor(code);
            let tree = parser.parse(text.as_str(), None).unwrap();
            let node = locate_help_node(&tree, point).unwrap();
            let text = node.node_as_str(&text).unwrap();
            assert_eq!(text, expected);
        }
    }
}
