use ra_syntax::{ algo::visit::{visitor, Visitor}, AstNode, ast::{self, LoopBodyOwner}, SyntaxKind::*, SyntaxNode, }; use crate::completion::{CompletionContext, CompletionItem, Completions, CompletionKind, CompletionItemKind}; pub(super) fn complete_use_tree_keyword(acc: &mut Completions, ctx: &CompletionContext) { // complete keyword "crate" in use stmt match (ctx.use_item_syntax.as_ref(), ctx.path_prefix.as_ref()) { (Some(_), None) => { CompletionItem::new(CompletionKind::Keyword, "crate") .kind(CompletionItemKind::Keyword) .lookup_by("crate") .snippet("crate::") .add_to(acc); CompletionItem::new(CompletionKind::Keyword, "self") .kind(CompletionItemKind::Keyword) .lookup_by("self") .add_to(acc); CompletionItem::new(CompletionKind::Keyword, "super") .kind(CompletionItemKind::Keyword) .lookup_by("super") .add_to(acc); } (Some(_), Some(_)) => { CompletionItem::new(CompletionKind::Keyword, "self") .kind(CompletionItemKind::Keyword) .lookup_by("self") .add_to(acc); CompletionItem::new(CompletionKind::Keyword, "super") .kind(CompletionItemKind::Keyword) .lookup_by("super") .add_to(acc); } _ => {} } } fn keyword(kw: &str, snippet: &str) -> CompletionItem { CompletionItem::new(CompletionKind::Keyword, kw) .kind(CompletionItemKind::Keyword) .snippet(snippet) .build() } pub(super) fn complete_expr_keyword(acc: &mut Completions, ctx: &CompletionContext) { if !ctx.is_trivial_path { return; } let fn_def = match ctx.function_syntax { Some(it) => it, None => return, }; acc.add(keyword("if", "if $0 {}")); acc.add(keyword("match", "match $0 {}")); acc.add(keyword("while", "while $0 {}")); acc.add(keyword("loop", "loop {$0}")); if ctx.after_if { acc.add(keyword("else", "else {$0}")); acc.add(keyword("else if", "else if $0 {}")); } if is_in_loop_body(ctx.leaf) { if ctx.can_be_stmt { acc.add(keyword("continue", "continue;")); acc.add(keyword("break", "break;")); } else { acc.add(keyword("continue", "continue")); acc.add(keyword("break", "break")); } } acc.add_all(complete_return(fn_def, ctx.can_be_stmt)); } fn is_in_loop_body(leaf: &SyntaxNode) -> bool { for node in leaf.ancestors() { if node.kind() == FN_DEF || node.kind() == LAMBDA_EXPR { break; } let loop_body = visitor() .visit::(LoopBodyOwner::loop_body) .visit::(LoopBodyOwner::loop_body) .visit::(LoopBodyOwner::loop_body) .accept(node); if let Some(Some(body)) = loop_body { if leaf.range().is_subrange(&body.syntax().range()) { return true; } } } false } fn complete_return(fn_def: &ast::FnDef, can_be_stmt: bool) -> Option { let snip = match (can_be_stmt, fn_def.ret_type().is_some()) { (true, true) => "return $0;", (true, false) => "return;", (false, true) => "return $0", (false, false) => "return", }; Some(keyword("return", snip)) } #[cfg(test)] mod tests { use crate::completion::{CompletionKind, check_completion}; fn check_keyword_completion(code: &str, expected_completions: &str) { check_completion(code, expected_completions, CompletionKind::Keyword); } #[test] fn completes_keywords_in_use_stmt() { check_keyword_completion( r" use <|> ", r#" crate "crate" "crate::" self "self" super "super" "#, ); check_keyword_completion( r" use a::<|> ", r#" self "self" super "super" "#, ); check_keyword_completion( r" use a::{b, <|>} ", r#" self "self" super "super" "#, ); } #[test] fn completes_various_keywords_in_function() { check_keyword_completion( r" fn quux() { <|> } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" return "return;" "#, ); } #[test] fn completes_else_after_if() { check_keyword_completion( r" fn quux() { if true { () } <|> } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" else "else {$0}" else if "else if $0 {}" return "return;" "#, ); } #[test] fn test_completion_return_value() { check_keyword_completion( r" fn quux() -> i32 { <|> 92 } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" return "return $0;" "#, ); check_keyword_completion( r" fn quux() { <|> 92 } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" return "return;" "#, ); } #[test] fn dont_add_semi_after_return_if_not_a_statement() { check_keyword_completion( r" fn quux() -> i32 { match () { () => <|> } } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" return "return $0" "#, ); } #[test] fn last_return_in_block_has_semi() { check_keyword_completion( r" fn quux() -> i32 { if condition { <|> } } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" return "return $0;" "#, ); check_keyword_completion( r" fn quux() -> i32 { if condition { <|> } let x = 92; x } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" return "return $0;" "#, ); } #[test] fn completes_break_and_continue_in_loops() { check_keyword_completion( r" fn quux() -> i32 { loop { <|> } } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" continue "continue;" break "break;" return "return $0;" "#, ); // No completion: lambda isolates control flow check_keyword_completion( r" fn quux() -> i32 { loop { || { <|> } } } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" return "return $0;" "#, ); } #[test] fn no_semi_after_break_continue_in_expr() { check_keyword_completion( r" fn f() { loop { match () { () => br<|> } } } ", r#" if "if $0 {}" match "match $0 {}" while "while $0 {}" loop "loop {$0}" continue "continue" break "break" return "return" "#, ) } }