123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195
// Copyright 2018-2022 the Deno authors. All rights reserved. MIT license.
// The logic of this module is heavily influenced by// https://github.com/microsoft/vscode/blob/main/extensions/typescript-language-features/src/languageFeatures/refactor.ts
use deno_core::serde::Deserialize;use deno_core::serde::Serialize;use deno_core::ModuleSpecifier;use once_cell::sync::Lazy;use tower_lsp::lsp_types as lsp;
pub struct RefactorCodeActionKind {  pub kind: lsp::CodeActionKind,  matches_callback: Box<dyn Fn(&str) -> bool + Send + Sync>,}
impl RefactorCodeActionKind {  pub fn matches(&self, tag: &str) -> bool {    (self.matches_callback)(tag)  }}
pub static EXTRACT_FUNCTION: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [lsp::CodeActionKind::REFACTOR_EXTRACT.as_str(), "function"]      .join(".")      .into(),    matches_callback: Box::new(|tag: &str| tag.starts_with("function_")),  });
pub static EXTRACT_CONSTANT: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [lsp::CodeActionKind::REFACTOR_EXTRACT.as_str(), "constant"]      .join(".")      .into(),    matches_callback: Box::new(|tag: &str| tag.starts_with("constant_")),  });
pub static EXTRACT_TYPE: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [lsp::CodeActionKind::REFACTOR_EXTRACT.as_str(), "type"]      .join(".")      .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Extract to type alias")    }),  });
pub static EXTRACT_INTERFACE: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [lsp::CodeActionKind::REFACTOR_EXTRACT.as_str(), "interface"]      .join(".")      .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Extract to interface")    }),  });
pub static MOVE_NEWFILE: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [lsp::CodeActionKind::REFACTOR.as_str(), "move", "newFile"]      .join(".")      .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Move to a new file")    }),  });
pub static REWRITE_IMPORT: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [lsp::CodeActionKind::REFACTOR_REWRITE.as_str(), "import"]      .join(".")      .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Convert namespace import")        || tag.starts_with("Convert named imports")    }),  });
pub static REWRITE_EXPORT: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [lsp::CodeActionKind::REFACTOR_REWRITE.as_str(), "export"]      .join(".")      .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Convert default export")        || tag.starts_with("Convert named export")    }),  });
pub static REWRITE_ARROW_BRACES: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [      lsp::CodeActionKind::REFACTOR_REWRITE.as_str(),      "arrow",      "braces",    ]    .join(".")    .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Add or remove braces in an arrow function")    }),  });
pub static REWRITE_PARAMETERS_TO_DESTRUCTURED: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [      lsp::CodeActionKind::REFACTOR_REWRITE.as_str(),      "parameters",      "toDestructured",    ]    .join(".")    .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Convert parameters to destructured object")    }),  });
pub static REWRITE_PROPERTY_GENERATEACCESSORS: Lazy<RefactorCodeActionKind> =  Lazy::new(|| RefactorCodeActionKind {    kind: [      lsp::CodeActionKind::REFACTOR_REWRITE.as_str(),      "property",      "generateAccessors",    ]    .join(".")    .into(),    matches_callback: Box::new(|tag: &str| {      tag.starts_with("Generate 'get' and 'set' accessors")    }),  });
pub static ALL_KNOWN_REFACTOR_ACTION_KINDS: Lazy<  Vec<&'static RefactorCodeActionKind>,> = Lazy::new(|| {  vec![    &EXTRACT_FUNCTION,    &EXTRACT_CONSTANT,    &EXTRACT_TYPE,    &EXTRACT_INTERFACE,    &MOVE_NEWFILE,    &REWRITE_IMPORT,    &REWRITE_EXPORT,    &REWRITE_ARROW_BRACES,    &REWRITE_PARAMETERS_TO_DESTRUCTURED,    &REWRITE_PROPERTY_GENERATEACCESSORS,  ]});
#[derive(Debug, Serialize, Deserialize)]#[serde(rename_all = "camelCase")]pub struct RefactorCodeActionData {  pub specifier: ModuleSpecifier,  pub range: lsp::Range,  pub refactor_name: String,  pub action_name: String,}
pub fn prune_invalid_actions(  actions: &[lsp::CodeAction],  number_of_invalid: usize,) -> Vec<lsp::CodeAction> {  let mut available_actions = Vec::<lsp::CodeAction>::new();  let mut invalid_common_actions = Vec::<lsp::CodeAction>::new();  let mut invalid_uncommon_actions = Vec::<lsp::CodeAction>::new();  for action in actions {    if action.disabled.is_none() {      available_actions.push(action.clone());      continue;    }
    // These are the common refactors that we should always show if applicable.    let action_kind =      action.kind.as_ref().map(|a| a.as_str()).unwrap_or_default();    if action_kind.starts_with(EXTRACT_CONSTANT.kind.as_str())      || action_kind.starts_with(EXTRACT_FUNCTION.kind.as_str())    {      invalid_common_actions.push(action.clone());      continue;    }
    // These are the remaining refactors that we can show if we haven't reached the max limit with just common refactors.    invalid_uncommon_actions.push(action.clone());  }
  let mut prioritized_actions = Vec::<lsp::CodeAction>::new();  prioritized_actions.extend(invalid_common_actions);  prioritized_actions.extend(invalid_uncommon_actions);  let top_n_invalid = prioritized_actions    [0..std::cmp::min(number_of_invalid, prioritized_actions.len())]    .to_vec();  available_actions.extend(top_n_invalid);  available_actions}