1 //! See `CompletionContext` structure.
3 use hir::{Local, ScopeDef, Semantics, SemanticsScope, Type};
5 base_db::{FilePosition, SourceDatabase},
6 call_info::ActiveParameter,
10 algo::find_node_at_offset,
11 ast::{self, NameOrNameRef, NameOwner},
12 match_ast, AstNode, NodeOrToken,
13 SyntaxKind::{self, *},
14 SyntaxNode, SyntaxToken, TextRange, TextSize, T,
20 for_is_prev2, has_bind_pat_parent, has_block_expr_parent, has_field_list_parent,
21 has_impl_as_prev_sibling, has_impl_parent, has_item_list_or_source_file_parent,
22 has_ref_parent, has_trait_as_prev_sibling, has_trait_parent, inside_impl_trait_block,
23 is_in_loop_body, is_match_arm, previous_token,
28 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
29 pub(crate) enum PatternRefutability {
34 /// `CompletionContext` is created early during completion to figure out, where
35 /// exactly is the cursor, syntax-wise.
37 pub(crate) struct CompletionContext<'a> {
38 pub(super) sema: Semantics<'a, RootDatabase>,
39 pub(super) scope: SemanticsScope<'a>,
40 pub(super) db: &'a RootDatabase,
41 pub(super) config: &'a CompletionConfig,
42 pub(super) position: FilePosition,
43 /// The token before the cursor, in the original file.
44 pub(super) original_token: SyntaxToken,
45 /// The token before the cursor, in the macro-expanded file.
46 pub(super) token: SyntaxToken,
47 pub(super) krate: Option<hir::Crate>,
48 pub(super) expected_name: Option<NameOrNameRef>,
49 pub(super) expected_type: Option<Type>,
50 pub(super) name_ref_syntax: Option<ast::NameRef>,
51 pub(super) function_syntax: Option<ast::Fn>,
52 pub(super) use_item_syntax: Option<ast::Use>,
53 pub(super) record_lit_syntax: Option<ast::RecordExpr>,
54 pub(super) record_pat_syntax: Option<ast::RecordPat>,
55 pub(super) record_field_syntax: Option<ast::RecordExprField>,
56 /// The parent impl of the cursor position if it exists.
57 pub(super) impl_def: Option<ast::Impl>,
59 // potentially set if we are completing a lifetime
60 pub(super) lifetime_syntax: Option<ast::Lifetime>,
61 pub(super) lifetime_param_syntax: Option<ast::LifetimeParam>,
62 pub(super) lifetime_allowed: bool,
63 pub(super) is_label_ref: bool,
65 // potentially set if we are completing a name
66 pub(super) is_pat_or_const: Option<PatternRefutability>,
67 pub(super) is_param: bool,
69 /// FIXME: `ActiveParameter` is string-based, which is very very wrong
70 pub(super) active_parameter: Option<ActiveParameter>,
71 /// A single-indent path, like `foo`. `::foo` should not be considered a trivial path.
72 pub(super) is_trivial_path: bool,
73 /// If not a trivial path, the prefix (qualifier).
74 pub(super) path_qual: Option<ast::Path>,
75 pub(super) after_if: bool,
76 /// `true` if we are a statement or a last expr in the block.
77 pub(super) can_be_stmt: bool,
78 /// `true` if we expect an expression at the cursor position.
79 pub(super) is_expr: bool,
80 /// Something is typed at the "top" level, in module or impl/trait.
81 pub(super) is_new_item: bool,
82 /// The receiver if this is a field or method access, i.e. writing something.$0
83 pub(super) dot_receiver: Option<ast::Expr>,
84 pub(super) dot_receiver_is_ambiguous_float_literal: bool,
85 /// If this is a call (method or function) in particular, i.e. the () are already there.
86 pub(super) is_call: bool,
87 /// Like `is_call`, but for tuple patterns.
88 pub(super) is_pattern_call: bool,
89 /// If this is a macro call, i.e. the () are already there.
90 pub(super) is_macro_call: bool,
91 pub(super) is_path_type: bool,
92 pub(super) has_type_args: bool,
93 pub(super) attribute_under_caret: Option<ast::Attr>,
94 pub(super) locals: Vec<(String, Local)>,
96 pub(super) mod_declaration_under_caret: Option<ast::Module>,
97 pub(super) has_trait_parent: bool,
98 pub(super) has_impl_parent: bool,
101 pub(super) previous_token: Option<SyntaxToken>,
102 pub(super) block_expr_parent: bool,
103 pub(super) bind_pat_parent: bool,
104 pub(super) ref_pat_parent: bool,
105 pub(super) in_loop_body: bool,
106 pub(super) has_field_list_parent: bool,
107 pub(super) trait_as_prev_sibling: bool,
108 pub(super) impl_as_prev_sibling: bool,
109 pub(super) is_match_arm: bool,
110 pub(super) has_item_list_or_source_file_parent: bool,
111 pub(super) incomplete_let: bool,
113 no_completion_required: bool,
115 impl<'a> CompletionContext<'a> {
117 db: &'a RootDatabase,
118 position: FilePosition,
119 config: &'a CompletionConfig,
120 ) -> Option<CompletionContext<'a>> {
121 let sema = Semantics::new(db);
123 let original_file = sema.parse(position.file_id);
125 // Insert a fake ident to get a valid parse tree. We will use this file
126 // to determine context, though the original_file will be used for
127 // actual completion.
128 let file_with_fake_ident = {
129 let parse = db.parse(position.file_id);
130 let edit = Indel::insert(position.offset, "intellijRulezz".to_string());
131 parse.reparse(&edit).tree()
133 let fake_ident_token =
134 file_with_fake_ident.syntax().token_at_offset(position.offset).right_biased().unwrap();
136 let krate = sema.to_module_def(position.file_id).map(|m| m.krate());
138 original_file.syntax().token_at_offset(position.offset).left_biased()?;
139 let token = sema.descend_into_macros(original_token.clone());
140 let scope = sema.scope_at_offset(&token, position.offset);
141 let mut locals = vec![];
142 scope.process_all_names(&mut |name, scope| {
143 if let ScopeDef::Local(local) = scope {
144 locals.push((name.to_string(), local));
147 let mut ctx = CompletionContext {
156 lifetime_allowed: false,
159 name_ref_syntax: None,
160 lifetime_syntax: None,
161 lifetime_param_syntax: None,
162 function_syntax: None,
163 use_item_syntax: None,
164 record_lit_syntax: None,
165 record_pat_syntax: None,
166 record_field_syntax: None,
168 active_parameter: ActiveParameter::at(db, position),
171 is_pat_or_const: None,
172 is_trivial_path: false,
179 dot_receiver_is_ambiguous_float_literal: false,
181 is_pattern_call: false,
182 is_macro_call: false,
184 has_type_args: false,
185 attribute_under_caret: None,
186 mod_declaration_under_caret: None,
187 previous_token: None,
188 block_expr_parent: false,
189 bind_pat_parent: false,
190 ref_pat_parent: false,
192 has_trait_parent: false,
193 has_impl_parent: false,
194 has_field_list_parent: false,
195 trait_as_prev_sibling: false,
196 impl_as_prev_sibling: false,
198 has_item_list_or_source_file_parent: false,
199 no_completion_required: false,
200 incomplete_let: false,
204 let mut original_file = original_file.syntax().clone();
205 let mut speculative_file = file_with_fake_ident.syntax().clone();
206 let mut offset = position.offset;
207 let mut fake_ident_token = fake_ident_token;
209 // Are we inside a macro call?
210 while let (Some(actual_macro_call), Some(macro_call_with_fake_ident)) = (
211 find_node_at_offset::<ast::MacroCall>(&original_file, offset),
212 find_node_at_offset::<ast::MacroCall>(&speculative_file, offset),
214 if actual_macro_call.path().as_ref().map(|s| s.syntax().text())
215 != macro_call_with_fake_ident.path().as_ref().map(|s| s.syntax().text())
219 let speculative_args = match macro_call_with_fake_ident.token_tree() {
223 if let (Some(actual_expansion), Some(speculative_expansion)) = (
224 ctx.sema.expand(&actual_macro_call),
225 ctx.sema.speculative_expand(
231 let new_offset = speculative_expansion.1.text_range().start();
232 if new_offset > actual_expansion.text_range().end() {
235 original_file = actual_expansion;
236 speculative_file = speculative_expansion.0;
237 fake_ident_token = speculative_expansion.1;
243 ctx.fill_keyword_patterns(&speculative_file, offset);
244 ctx.fill(&original_file, speculative_file, offset);
248 /// Checks whether completions in that particular case don't make much sense.
250 /// - `fn $0` -- we expect function name, it's unlikely that "hint" will be helpful.
251 /// Exception for this case is `impl Trait for Foo`, where we would like to hint trait method names.
252 /// - `for _ i$0` -- obviously, it'll be "in" keyword.
253 pub(crate) fn no_completion_required(&self) -> bool {
254 self.no_completion_required
257 /// The range of the identifier that is being completed.
258 pub(crate) fn source_range(&self) -> TextRange {
259 // check kind of macro-expanded token, but use range of original token
260 let kind = self.token.kind();
261 if kind == IDENT || kind == LIFETIME_IDENT || kind == UNDERSCORE || kind.is_keyword() {
262 cov_mark::hit!(completes_if_prefix_is_keyword);
263 self.original_token.text_range()
264 } else if kind == CHAR {
265 // assume we are completing a lifetime but the user has only typed the '
266 cov_mark::hit!(completes_if_lifetime_without_idents);
267 TextRange::at(self.original_token.text_range().start(), TextSize::from(1))
269 TextRange::empty(self.position.offset)
273 pub(crate) fn previous_token_is(&self, kind: SyntaxKind) -> bool {
274 self.previous_token.as_ref().map_or(false, |tok| tok.kind() == kind)
277 fn fill_keyword_patterns(&mut self, file_with_fake_ident: &SyntaxNode, offset: TextSize) {
278 let fake_ident_token = file_with_fake_ident.token_at_offset(offset).right_biased().unwrap();
279 let syntax_element = NodeOrToken::Token(fake_ident_token);
280 self.previous_token = previous_token(syntax_element.clone());
281 self.block_expr_parent = has_block_expr_parent(syntax_element.clone());
282 self.bind_pat_parent = has_bind_pat_parent(syntax_element.clone());
283 self.ref_pat_parent = has_ref_parent(syntax_element.clone());
284 self.in_loop_body = is_in_loop_body(syntax_element.clone());
285 self.has_trait_parent = has_trait_parent(syntax_element.clone());
286 self.has_impl_parent = has_impl_parent(syntax_element.clone());
287 self.has_field_list_parent = has_field_list_parent(syntax_element.clone());
288 self.impl_as_prev_sibling = has_impl_as_prev_sibling(syntax_element.clone());
289 self.trait_as_prev_sibling = has_trait_as_prev_sibling(syntax_element.clone());
290 self.is_match_arm = is_match_arm(syntax_element.clone());
292 self.has_item_list_or_source_file_parent =
293 has_item_list_or_source_file_parent(syntax_element.clone());
294 self.mod_declaration_under_caret =
295 find_node_at_offset::<ast::Module>(&file_with_fake_ident, offset)
296 .filter(|module| module.item_list().is_none());
297 self.incomplete_let =
298 syntax_element.ancestors().take(6).find_map(ast::LetStmt::cast).map_or(false, |it| {
299 it.syntax().text_range().end() == syntax_element.text_range().end()
302 let inside_impl_trait_block = inside_impl_trait_block(syntax_element.clone());
303 let fn_is_prev = self.previous_token_is(T![fn]);
304 let for_is_prev2 = for_is_prev2(syntax_element.clone());
305 self.no_completion_required = (fn_is_prev && !inside_impl_trait_block) || for_is_prev2;
308 fn fill_impl_def(&mut self) {
311 .token_ancestors_with_macros(self.token.clone())
312 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
313 .find_map(ast::Impl::cast);
316 fn expected_type_and_name(&self) -> (Option<Type>, Option<NameOrNameRef>) {
317 let mut node = match self.token.parent() {
319 None => return (None, None),
324 ast::LetStmt(it) => {
325 cov_mark::hit!(expected_type_let_with_leading_char);
326 cov_mark::hit!(expected_type_let_without_leading_char);
328 .and_then(|pat| self.sema.type_of_pat(&pat))
329 .or_else(|| it.initializer().and_then(|it| self.sema.type_of_expr(&it)));
330 let name = if let Some(ast::Pat::IdentPat(ident)) = it.pat() {
331 ident.name().map(NameOrNameRef::Name)
338 ast::ArgList(_it) => {
339 cov_mark::hit!(expected_type_fn_param_with_leading_char);
340 cov_mark::hit!(expected_type_fn_param_without_leading_char);
341 ActiveParameter::at_token(
345 let name = ap.ident().map(NameOrNameRef::Name);
348 .unwrap_or((None, None))
350 ast::RecordExprFieldList(_it) => {
351 cov_mark::hit!(expected_type_struct_field_without_leading_char);
352 // wouldn't try {} be nice...
354 let expr_field = self.token.prev_sibling_or_token()?
356 .and_then(|node| ast::RecordExprField::cast(node))?;
357 let (_, _, ty) = self.sema.resolve_record_field(&expr_field)?;
360 expr_field.field_name().map(NameOrNameRef::NameRef),
362 })().unwrap_or((None, None))
364 ast::RecordExprField(it) => {
365 cov_mark::hit!(expected_type_struct_field_with_leading_char);
367 it.expr().as_ref().and_then(|e| self.sema.type_of_expr(e)),
368 it.field_name().map(NameOrNameRef::NameRef),
371 ast::MatchExpr(it) => {
372 cov_mark::hit!(expected_type_match_arm_without_leading_char);
374 .and_then(|e| self.sema.type_of_expr(&e));
378 cov_mark::hit!(expected_type_if_let_without_leading_char);
379 let ty = it.condition()
380 .and_then(|cond| cond.expr())
381 .and_then(|e| self.sema.type_of_expr(&e));
384 ast::IdentPat(it) => {
385 cov_mark::hit!(expected_type_if_let_with_leading_char);
386 cov_mark::hit!(expected_type_match_arm_with_leading_char);
387 let ty = self.sema.type_of_pat(&ast::Pat::from(it));
391 cov_mark::hit!(expected_type_fn_ret_with_leading_char);
392 cov_mark::hit!(expected_type_fn_ret_without_leading_char);
393 let def = self.sema.to_def(&it);
394 (def.map(|def| def.ret_type(self.db)), None)
396 ast::ClosureExpr(it) => {
397 let ty = self.sema.type_of_expr(&it.into());
398 ty.and_then(|ty| ty.as_callable(self.db))
399 .map(|c| (Some(c.return_type()), None))
400 .unwrap_or((None, None))
402 ast::Stmt(_it) => (None, None),
404 match node.parent() {
409 None => (None, None),
419 original_file: &SyntaxNode,
420 file_with_fake_ident: SyntaxNode,
423 let (expected_type, expected_name) = self.expected_type_and_name();
424 self.expected_type = expected_type;
425 self.expected_name = expected_name;
426 self.attribute_under_caret = find_node_at_offset(&file_with_fake_ident, offset);
427 let name_like = match find_node_at_offset(&&file_with_fake_ident, offset) {
432 ast::NameLike::Lifetime(lifetime) => {
433 self.classify_lifetime(original_file, lifetime, offset);
435 ast::NameLike::NameRef(name_ref) => {
436 self.classify_name_ref(original_file, name_ref, offset);
438 ast::NameLike::Name(name) => {
439 self.classify_name(original_file, name, offset);
444 fn classify_lifetime(
446 original_file: &SyntaxNode,
447 lifetime: ast::Lifetime,
450 self.lifetime_syntax =
451 find_node_at_offset(original_file, lifetime.syntax().text_range().start());
452 if let Some(parent) = lifetime.syntax().parent() {
453 if parent.kind() == ERROR {
459 ast::LifetimeParam(_it) => {
460 self.lifetime_allowed = true;
461 self.lifetime_param_syntax =
462 self.sema.find_node_at_offset_with_macros(original_file, offset);
464 ast::BreakExpr(_it) => self.is_label_ref = true,
465 ast::ContinueExpr(_it) => self.is_label_ref = true,
466 ast::Label(_it) => (),
467 _ => self.lifetime_allowed = true,
473 fn classify_name(&mut self, original_file: &SyntaxNode, name: ast::Name, offset: TextSize) {
474 if let Some(bind_pat) = name.syntax().parent().and_then(ast::IdentPat::cast) {
475 self.is_pat_or_const = Some(PatternRefutability::Refutable);
476 // if any of these is here our bind pat can't be a const pat anymore
477 let complex_ident_pat = bind_pat.at_token().is_some()
478 || bind_pat.ref_token().is_some()
479 || bind_pat.mut_token().is_some();
480 if complex_ident_pat {
481 self.is_pat_or_const = None;
483 let irrefutable_pat = bind_pat.syntax().ancestors().find_map(|node| {
486 ast::LetStmt(it) => Some(it.pat()),
487 ast::Param(it) => Some(it.pat()),
492 if let Some(Some(pat)) = irrefutable_pat {
493 // This check is here since we could be inside a pattern in the initializer expression of the let statement.
494 if pat.syntax().text_range().contains_range(bind_pat.syntax().text_range()) {
495 self.is_pat_or_const = Some(PatternRefutability::Irrefutable);
499 let is_name_in_field_pat = bind_pat
502 .and_then(ast::RecordPatField::cast)
503 .map_or(false, |pat_field| pat_field.name_ref().is_none());
504 if is_name_in_field_pat {
505 self.is_pat_or_const = None;
509 self.fill_impl_def();
511 self.is_param |= is_node::<ast::Param>(name.syntax());
512 if ast::RecordPatField::for_field_name(&name).is_some() {
513 self.record_pat_syntax =
514 self.sema.find_node_at_offset_with_macros(&original_file, offset);
518 fn classify_name_ref(
520 original_file: &SyntaxNode,
521 name_ref: ast::NameRef,
524 self.fill_impl_def();
525 if ast::RecordExprField::for_field_name(&name_ref).is_some() {
526 self.record_lit_syntax =
527 self.sema.find_node_at_offset_with_macros(original_file, offset);
529 if ast::RecordPatField::for_field_name_ref(&name_ref).is_some() {
530 self.record_pat_syntax =
531 self.sema.find_node_at_offset_with_macros(&original_file, offset);
534 self.name_ref_syntax =
535 find_node_at_offset(original_file, name_ref.syntax().text_range().start());
537 let name_range = name_ref.syntax().text_range();
538 let top_node = name_ref
541 .take_while(|it| it.text_range() == name_range)
545 match top_node.parent().map(|it| it.kind()) {
546 Some(SOURCE_FILE) | Some(ITEM_LIST) => {
547 self.is_new_item = true;
553 self.use_item_syntax =
554 self.sema.token_ancestors_with_macros(self.token.clone()).find_map(ast::Use::cast);
556 self.function_syntax = self
558 .token_ancestors_with_macros(self.token.clone())
559 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
560 .find_map(ast::Fn::cast);
562 self.record_field_syntax = self
564 .token_ancestors_with_macros(self.token.clone())
566 it.kind() != SOURCE_FILE && it.kind() != MODULE && it.kind() != CALL_EXPR
568 .find_map(ast::RecordExprField::cast);
570 let parent = match name_ref.syntax().parent() {
575 if let Some(segment) = ast::PathSegment::cast(parent.clone()) {
576 let path = segment.parent_path();
580 .and_then(ast::PathExpr::cast)
581 .and_then(|it| it.syntax().parent().and_then(ast::CallExpr::cast))
583 self.is_macro_call = path.syntax().parent().and_then(ast::MacroCall::cast).is_some();
584 self.is_pattern_call =
585 path.syntax().parent().and_then(ast::TupleStructPat::cast).is_some();
587 self.is_path_type = path.syntax().parent().and_then(ast::PathType::cast).is_some();
588 self.has_type_args = segment.generic_arg_list().is_some();
590 if let Some(path) = path_or_use_tree_qualifier(&path) {
591 self.path_qual = path
594 find_node_with_range::<ast::PathSegment>(
596 it.syntax().text_range(),
599 .map(|it| it.parent_path());
603 if let Some(segment) = path.segment() {
604 if segment.coloncolon_token().is_some() {
609 self.is_trivial_path = true;
611 // Find either enclosing expr statement (thing with `;`) or a
612 // block. If block, check that we are the last expr.
613 self.can_be_stmt = name_ref
617 if let Some(stmt) = ast::ExprStmt::cast(node.clone()) {
618 return Some(stmt.syntax().text_range() == name_ref.syntax().text_range());
620 if let Some(block) = ast::BlockExpr::cast(node) {
622 block.tail_expr().map(|e| e.syntax().text_range())
623 == Some(name_ref.syntax().text_range()),
629 self.is_expr = path.syntax().parent().and_then(ast::PathExpr::cast).is_some();
631 if let Some(off) = name_ref.syntax().text_range().start().checked_sub(2.into()) {
632 if let Some(if_expr) =
633 self.sema.find_node_at_offset_with_macros::<ast::IfExpr>(original_file, off)
635 if if_expr.syntax().text_range().end() < name_ref.syntax().text_range().start()
637 self.after_if = true;
642 if let Some(field_expr) = ast::FieldExpr::cast(parent.clone()) {
643 // The receiver comes before the point of insertion of the fake
644 // ident, so it should have the same range in the non-modified file
645 self.dot_receiver = field_expr
647 .map(|e| e.syntax().text_range())
648 .and_then(|r| find_node_with_range(original_file, r));
649 self.dot_receiver_is_ambiguous_float_literal =
650 if let Some(ast::Expr::Literal(l)) = &self.dot_receiver {
652 ast::LiteralKind::FloatNumber { .. } => l.token().text().ends_with('.'),
659 if let Some(method_call_expr) = ast::MethodCallExpr::cast(parent) {
661 self.dot_receiver = method_call_expr
663 .map(|e| e.syntax().text_range())
664 .and_then(|r| find_node_with_range(original_file, r));
670 fn find_node_with_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
671 syntax.covering_element(range).ancestors().find_map(N::cast)
674 fn is_node<N: AstNode>(node: &SyntaxNode) -> bool {
675 match node.ancestors().find_map(N::cast) {
677 Some(n) => n.syntax().text_range() == node.text_range(),
681 fn path_or_use_tree_qualifier(path: &ast::Path) -> Option<ast::Path> {
682 if let Some(qual) = path.qualifier() {
685 let use_tree_list = path.syntax().ancestors().find_map(ast::UseTreeList::cast)?;
686 let use_tree = use_tree_list.syntax().parent().and_then(ast::UseTree::cast)?;
692 use expect_test::{expect, Expect};
695 use crate::test_utils::{position, TEST_CONFIG};
697 use super::CompletionContext;
699 fn check_expected_type_and_name(ra_fixture: &str, expect: Expect) {
700 let (db, pos) = position(ra_fixture);
701 let completion_context = CompletionContext::new(&db, pos, &TEST_CONFIG).unwrap();
703 let ty = completion_context
705 .map(|t| t.display_test(&db).to_string())
706 .unwrap_or("?".to_owned());
708 let name = completion_context
710 .map_or_else(|| "?".to_owned(), |name| name.to_string());
712 expect.assert_eq(&format!("ty: {}, name: {}", ty, name));
716 fn expected_type_let_without_leading_char() {
717 cov_mark::check!(expected_type_let_without_leading_char);
718 check_expected_type_and_name(
724 expect![[r#"ty: u32, name: x"#]],
729 fn expected_type_let_with_leading_char() {
730 cov_mark::check!(expected_type_let_with_leading_char);
731 check_expected_type_and_name(
737 expect![[r#"ty: u32, name: x"#]],
742 fn expected_type_let_pat() {
743 check_expected_type_and_name(
749 expect![[r#"ty: u32, name: ?"#]],
751 check_expected_type_and_name(
757 expect![[r#"ty: u32, name: ?"#]],
762 fn expected_type_fn_param_without_leading_char() {
763 cov_mark::check!(expected_type_fn_param_without_leading_char);
764 check_expected_type_and_name(
772 expect![[r#"ty: u32, name: x"#]],
777 fn expected_type_fn_param_with_leading_char() {
778 cov_mark::check!(expected_type_fn_param_with_leading_char);
779 check_expected_type_and_name(
787 expect![[r#"ty: u32, name: x"#]],
792 fn expected_type_struct_field_without_leading_char() {
793 cov_mark::check!(expected_type_struct_field_without_leading_char);
794 check_expected_type_and_name(
796 struct Foo { a: u32 }
801 expect![[r#"ty: u32, name: a"#]],
806 fn expected_type_generic_struct_field() {
807 check_expected_type_and_name(
809 struct Foo<T> { a: T }
810 fn foo() -> Foo<u32> {
814 expect![[r#"ty: u32, name: a"#]],
819 fn expected_type_struct_field_with_leading_char() {
820 cov_mark::check!(expected_type_struct_field_with_leading_char);
821 check_expected_type_and_name(
823 struct Foo { a: u32 }
828 expect![[r#"ty: u32, name: a"#]],
833 fn expected_type_match_arm_without_leading_char() {
834 cov_mark::check!(expected_type_match_arm_without_leading_char);
835 check_expected_type_and_name(
842 expect![[r#"ty: E, name: ?"#]],
847 fn expected_type_match_arm_with_leading_char() {
848 cov_mark::check!(expected_type_match_arm_with_leading_char);
849 check_expected_type_and_name(
856 expect![[r#"ty: E, name: ?"#]],
861 fn expected_type_if_let_without_leading_char() {
862 cov_mark::check!(expected_type_if_let_without_leading_char);
863 check_expected_type_and_name(
865 enum Foo { Bar, Baz, Quux }
872 expect![[r#"ty: Foo, name: ?"#]],
877 fn expected_type_if_let_with_leading_char() {
878 cov_mark::check!(expected_type_if_let_with_leading_char);
879 check_expected_type_and_name(
881 enum Foo { Bar, Baz, Quux }
888 expect![[r#"ty: Foo, name: ?"#]],
893 fn expected_type_fn_ret_without_leading_char() {
894 cov_mark::check!(expected_type_fn_ret_without_leading_char);
895 check_expected_type_and_name(
901 expect![[r#"ty: u32, name: ?"#]],
906 fn expected_type_fn_ret_with_leading_char() {
907 cov_mark::check!(expected_type_fn_ret_with_leading_char);
908 check_expected_type_and_name(
914 expect![[r#"ty: u32, name: ?"#]],
919 fn expected_type_fn_ret_fn_ref_fully_typed() {
920 check_expected_type_and_name(
926 expect![[r#"ty: u32, name: ?"#]],
931 fn expected_type_closure_param_return() {
932 // FIXME: make this work with `|| $0`
933 check_expected_type_and_name(
939 fn bar(f: impl FnOnce() -> u32) {}
941 trait FnOnce { type Output; }
943 expect![[r#"ty: u32, name: ?"#]],
948 fn expected_type_generic_function() {
949 check_expected_type_and_name(
957 expect![[r#"ty: u32, name: t"#]],
962 fn expected_type_generic_method() {
963 check_expected_type_and_name(
971 fn bar(self, t: T) {}
974 expect![[r#"ty: u32, name: t"#]],