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 determine_location, determine_prev_sibling, for_is_prev2, inside_impl_trait_block,
21 is_in_loop_body, is_match_arm, previous_token, ImmediateLocation, ImmediatePrevSibling,
26 #[derive(Copy, Clone, Debug, PartialEq, Eq)]
27 pub(crate) enum PatternRefutability {
32 /// `CompletionContext` is created early during completion to figure out, where
33 /// exactly is the cursor, syntax-wise.
35 pub(crate) struct CompletionContext<'a> {
36 pub(super) sema: Semantics<'a, RootDatabase>,
37 pub(super) scope: SemanticsScope<'a>,
38 pub(super) db: &'a RootDatabase,
39 pub(super) config: &'a CompletionConfig,
40 pub(super) position: FilePosition,
41 /// The token before the cursor, in the original file.
42 pub(super) original_token: SyntaxToken,
43 /// The token before the cursor, in the macro-expanded file.
44 pub(super) token: SyntaxToken,
45 pub(super) krate: Option<hir::Crate>,
46 pub(super) expected_name: Option<NameOrNameRef>,
47 pub(super) expected_type: Option<Type>,
48 pub(super) name_ref_syntax: Option<ast::NameRef>,
50 pub(super) use_item_syntax: Option<ast::Use>,
52 /// The parent function of the cursor position if it exists.
53 pub(super) function_def: Option<ast::Fn>,
54 /// The parent impl of the cursor position if it exists.
55 pub(super) impl_def: Option<ast::Impl>,
57 /// RecordExpr the token is a field of
58 pub(super) record_lit_syntax: Option<ast::RecordExpr>,
59 /// RecordPat the token is a field of
60 pub(super) record_pat_syntax: Option<ast::RecordPat>,
62 // potentially set if we are completing a lifetime
63 pub(super) lifetime_syntax: Option<ast::Lifetime>,
64 pub(super) lifetime_param_syntax: Option<ast::LifetimeParam>,
65 pub(super) lifetime_allowed: bool,
66 pub(super) is_label_ref: bool,
68 // potentially set if we are completing a name
69 pub(super) is_pat_or_const: Option<PatternRefutability>,
70 pub(super) is_param: bool,
72 pub(super) completion_location: Option<ImmediateLocation>,
73 pub(super) prev_sibling: Option<ImmediatePrevSibling>,
75 /// FIXME: `ActiveParameter` is string-based, which is very very wrong
76 pub(super) active_parameter: Option<ActiveParameter>,
77 /// A single-indent path, like `foo`. `::foo` should not be considered a trivial path.
78 pub(super) is_trivial_path: bool,
79 /// If not a trivial path, the prefix (qualifier).
80 pub(super) path_qual: Option<ast::Path>,
81 /// `true` if we are a statement or a last expr in the block.
82 pub(super) can_be_stmt: bool,
83 /// `true` if we expect an expression at the cursor position.
84 pub(super) is_expr: bool,
85 /// Something is typed at the "top" level, in module or impl/trait.
86 pub(super) is_new_item: bool,
87 /// The receiver if this is a field or method access, i.e. writing something.$0
88 pub(super) dot_receiver: Option<ast::Expr>,
89 pub(super) dot_receiver_is_ambiguous_float_literal: bool,
90 /// If this is a call (method or function) in particular, i.e. the () are already there.
91 pub(super) is_call: bool,
92 /// Like `is_call`, but for tuple patterns.
93 pub(super) is_pattern_call: bool,
94 /// If this is a macro call, i.e. the () are already there.
95 pub(super) is_macro_call: bool,
96 pub(super) is_path_type: bool,
97 pub(super) has_type_args: bool,
98 pub(super) attribute_under_caret: Option<ast::Attr>,
99 pub(super) mod_declaration_under_caret: Option<ast::Module>,
100 pub(super) locals: Vec<(String, Local)>,
103 pub(super) previous_token: Option<SyntaxToken>,
104 pub(super) in_loop_body: bool,
105 pub(super) is_match_arm: bool,
106 pub(super) incomplete_let: bool,
108 no_completion_required: bool,
111 impl<'a> CompletionContext<'a> {
113 db: &'a RootDatabase,
114 position: FilePosition,
115 config: &'a CompletionConfig,
116 ) -> Option<CompletionContext<'a>> {
117 let sema = Semantics::new(db);
119 let original_file = sema.parse(position.file_id);
121 // Insert a fake ident to get a valid parse tree. We will use this file
122 // to determine context, though the original_file will be used for
123 // actual completion.
124 let file_with_fake_ident = {
125 let parse = db.parse(position.file_id);
126 let edit = Indel::insert(position.offset, "intellijRulezz".to_string());
127 parse.reparse(&edit).tree()
129 let fake_ident_token =
130 file_with_fake_ident.syntax().token_at_offset(position.offset).right_biased().unwrap();
132 let krate = sema.to_module_def(position.file_id).map(|m| m.krate());
134 original_file.syntax().token_at_offset(position.offset).left_biased()?;
135 let token = sema.descend_into_macros(original_token.clone());
136 let scope = sema.scope_at_offset(&token, position.offset);
137 let mut locals = vec![];
138 scope.process_all_names(&mut |name, scope| {
139 if let ScopeDef::Local(local) = scope {
140 locals.push((name.to_string(), local));
143 let mut ctx = CompletionContext {
152 lifetime_allowed: false,
155 name_ref_syntax: None,
156 lifetime_syntax: None,
157 lifetime_param_syntax: None,
159 use_item_syntax: None,
160 record_lit_syntax: None,
161 record_pat_syntax: None,
163 active_parameter: ActiveParameter::at(db, position),
166 is_pat_or_const: None,
167 is_trivial_path: false,
173 dot_receiver_is_ambiguous_float_literal: false,
175 is_pattern_call: false,
176 is_macro_call: false,
178 has_type_args: false,
179 attribute_under_caret: None,
180 mod_declaration_under_caret: None,
181 previous_token: None,
183 completion_location: None,
186 no_completion_required: false,
187 incomplete_let: false,
191 let mut original_file = original_file.syntax().clone();
192 let mut speculative_file = file_with_fake_ident.syntax().clone();
193 let mut offset = position.offset;
194 let mut fake_ident_token = fake_ident_token;
196 // Are we inside a macro call?
197 while let (Some(actual_macro_call), Some(macro_call_with_fake_ident)) = (
198 find_node_at_offset::<ast::MacroCall>(&original_file, offset),
199 find_node_at_offset::<ast::MacroCall>(&speculative_file, offset),
201 if actual_macro_call.path().as_ref().map(|s| s.syntax().text())
202 != macro_call_with_fake_ident.path().as_ref().map(|s| s.syntax().text())
206 let speculative_args = match macro_call_with_fake_ident.token_tree() {
210 if let (Some(actual_expansion), Some(speculative_expansion)) = (
211 ctx.sema.expand(&actual_macro_call),
212 ctx.sema.speculative_expand(
218 let new_offset = speculative_expansion.1.text_range().start();
219 if new_offset > actual_expansion.text_range().end() {
222 original_file = actual_expansion;
223 speculative_file = speculative_expansion.0;
224 fake_ident_token = speculative_expansion.1;
230 ctx.fill_keyword_patterns(&speculative_file, offset);
231 ctx.fill(&original_file, speculative_file, offset);
235 /// Checks whether completions in that particular case don't make much sense.
237 /// - `fn $0` -- we expect function name, it's unlikely that "hint" will be helpful.
238 /// Exception for this case is `impl Trait for Foo`, where we would like to hint trait method names.
239 /// - `for _ i$0` -- obviously, it'll be "in" keyword.
240 pub(crate) fn no_completion_required(&self) -> bool {
241 self.no_completion_required
244 /// The range of the identifier that is being completed.
245 pub(crate) fn source_range(&self) -> TextRange {
246 // check kind of macro-expanded token, but use range of original token
247 let kind = self.token.kind();
248 if kind == IDENT || kind == LIFETIME_IDENT || kind == UNDERSCORE || kind.is_keyword() {
249 cov_mark::hit!(completes_if_prefix_is_keyword);
250 self.original_token.text_range()
251 } else if kind == CHAR {
252 // assume we are completing a lifetime but the user has only typed the '
253 cov_mark::hit!(completes_if_lifetime_without_idents);
254 TextRange::at(self.original_token.text_range().start(), TextSize::from(1))
256 TextRange::empty(self.position.offset)
260 pub(crate) fn previous_token_is(&self, kind: SyntaxKind) -> bool {
261 self.previous_token.as_ref().map_or(false, |tok| tok.kind() == kind)
264 pub(crate) fn expects_assoc_item(&self) -> bool {
266 self.completion_location,
267 Some(ImmediateLocation::Trait) | Some(ImmediateLocation::Impl)
271 pub(crate) fn expects_use_tree(&self) -> bool {
272 matches!(self.completion_location, Some(ImmediateLocation::Use))
275 pub(crate) fn expects_non_trait_assoc_item(&self) -> bool {
276 matches!(self.completion_location, Some(ImmediateLocation::Impl))
279 pub(crate) fn expects_item(&self) -> bool {
280 matches!(self.completion_location, Some(ImmediateLocation::ItemList))
283 pub(crate) fn expects_expression(&self) -> bool {
287 pub(crate) fn has_block_expr_parent(&self) -> bool {
288 matches!(self.completion_location, Some(ImmediateLocation::BlockExpr))
291 pub(crate) fn expects_ident_pat_or_ref_expr(&self) -> bool {
293 self.completion_location,
294 Some(ImmediateLocation::IdentPat) | Some(ImmediateLocation::RefExpr)
298 pub(crate) fn expect_record_field(&self) -> bool {
299 matches!(self.completion_location, Some(ImmediateLocation::RecordField))
302 pub(crate) fn has_impl_or_trait_prev_sibling(&self) -> bool {
305 Some(ImmediatePrevSibling::ImplDefType) | Some(ImmediatePrevSibling::TraitDefName)
309 pub(crate) fn after_if(&self) -> bool {
310 matches!(self.prev_sibling, Some(ImmediatePrevSibling::IfExpr))
313 pub(crate) fn is_path_disallowed(&self) -> bool {
314 self.record_lit_syntax.is_some()
315 || self.record_pat_syntax.is_some()
316 || self.attribute_under_caret.is_some()
317 || self.mod_declaration_under_caret.is_some()
320 fn fill_keyword_patterns(&mut self, file_with_fake_ident: &SyntaxNode, offset: TextSize) {
321 let fake_ident_token = file_with_fake_ident.token_at_offset(offset).right_biased().unwrap();
322 let syntax_element = NodeOrToken::Token(fake_ident_token);
323 self.previous_token = previous_token(syntax_element.clone());
324 self.in_loop_body = is_in_loop_body(syntax_element.clone());
325 self.is_match_arm = is_match_arm(syntax_element.clone());
327 self.mod_declaration_under_caret =
328 find_node_at_offset::<ast::Module>(&file_with_fake_ident, offset)
329 .filter(|module| module.item_list().is_none());
330 self.incomplete_let =
331 syntax_element.ancestors().take(6).find_map(ast::LetStmt::cast).map_or(false, |it| {
332 it.syntax().text_range().end() == syntax_element.text_range().end()
335 let inside_impl_trait_block = inside_impl_trait_block(syntax_element.clone());
336 let fn_is_prev = self.previous_token_is(T![fn]);
337 let for_is_prev2 = for_is_prev2(syntax_element.clone());
338 self.no_completion_required = (fn_is_prev && !inside_impl_trait_block) || for_is_prev2;
341 fn fill_impl_def(&mut self) {
344 .token_ancestors_with_macros(self.token.clone())
345 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
346 .find_map(ast::Impl::cast);
349 fn expected_type_and_name(&self) -> (Option<Type>, Option<NameOrNameRef>) {
350 let mut node = match self.token.parent() {
352 None => return (None, None),
357 ast::LetStmt(it) => {
358 cov_mark::hit!(expected_type_let_with_leading_char);
359 cov_mark::hit!(expected_type_let_without_leading_char);
361 .and_then(|pat| self.sema.type_of_pat(&pat))
362 .or_else(|| it.initializer().and_then(|it| self.sema.type_of_expr(&it)));
363 let name = if let Some(ast::Pat::IdentPat(ident)) = it.pat() {
364 ident.name().map(NameOrNameRef::Name)
371 ast::ArgList(_it) => {
372 cov_mark::hit!(expected_type_fn_param_with_leading_char);
373 cov_mark::hit!(expected_type_fn_param_without_leading_char);
374 ActiveParameter::at_token(
378 let name = ap.ident().map(NameOrNameRef::Name);
381 .unwrap_or((None, None))
383 ast::RecordExprFieldList(_it) => {
384 cov_mark::hit!(expected_type_struct_field_without_leading_char);
385 // wouldn't try {} be nice...
387 let expr_field = self.token.prev_sibling_or_token()?
389 .and_then(|node| ast::RecordExprField::cast(node))?;
390 let (_, _, ty) = self.sema.resolve_record_field(&expr_field)?;
393 expr_field.field_name().map(NameOrNameRef::NameRef),
395 })().unwrap_or((None, None))
397 ast::RecordExprField(it) => {
398 cov_mark::hit!(expected_type_struct_field_with_leading_char);
400 it.expr().as_ref().and_then(|e| self.sema.type_of_expr(e)),
401 it.field_name().map(NameOrNameRef::NameRef),
404 ast::MatchExpr(it) => {
405 cov_mark::hit!(expected_type_match_arm_without_leading_char);
407 .and_then(|e| self.sema.type_of_expr(&e));
411 cov_mark::hit!(expected_type_if_let_without_leading_char);
412 let ty = it.condition()
413 .and_then(|cond| cond.expr())
414 .and_then(|e| self.sema.type_of_expr(&e));
417 ast::IdentPat(it) => {
418 cov_mark::hit!(expected_type_if_let_with_leading_char);
419 cov_mark::hit!(expected_type_match_arm_with_leading_char);
420 let ty = self.sema.type_of_pat(&ast::Pat::from(it));
424 cov_mark::hit!(expected_type_fn_ret_with_leading_char);
425 cov_mark::hit!(expected_type_fn_ret_without_leading_char);
426 let def = self.sema.to_def(&it);
427 (def.map(|def| def.ret_type(self.db)), None)
429 ast::ClosureExpr(it) => {
430 let ty = self.sema.type_of_expr(&it.into());
431 ty.and_then(|ty| ty.as_callable(self.db))
432 .map(|c| (Some(c.return_type()), None))
433 .unwrap_or((None, None))
435 ast::Stmt(_it) => (None, None),
437 match node.parent() {
442 None => (None, None),
452 original_file: &SyntaxNode,
453 file_with_fake_ident: SyntaxNode,
456 let (expected_type, expected_name) = self.expected_type_and_name();
457 self.expected_type = expected_type;
458 self.expected_name = expected_name;
459 self.attribute_under_caret = find_node_at_offset(&file_with_fake_ident, offset);
460 let name_like = match find_node_at_offset(&&file_with_fake_ident, offset) {
464 self.completion_location = determine_location(&name_like);
465 self.prev_sibling = determine_prev_sibling(&name_like);
467 ast::NameLike::Lifetime(lifetime) => {
468 self.classify_lifetime(original_file, lifetime, offset);
470 ast::NameLike::NameRef(name_ref) => {
471 self.classify_name_ref(original_file, name_ref, offset);
473 ast::NameLike::Name(name) => {
474 self.classify_name(original_file, name, offset);
479 fn classify_lifetime(
481 original_file: &SyntaxNode,
482 lifetime: ast::Lifetime,
485 self.lifetime_syntax =
486 find_node_at_offset(original_file, lifetime.syntax().text_range().start());
487 if let Some(parent) = lifetime.syntax().parent() {
488 if parent.kind() == ERROR {
494 ast::LifetimeParam(_it) => {
495 self.lifetime_allowed = true;
496 self.lifetime_param_syntax =
497 self.sema.find_node_at_offset_with_macros(original_file, offset);
499 ast::BreakExpr(_it) => self.is_label_ref = true,
500 ast::ContinueExpr(_it) => self.is_label_ref = true,
501 ast::Label(_it) => (),
502 _ => self.lifetime_allowed = true,
508 fn classify_name(&mut self, original_file: &SyntaxNode, name: ast::Name, offset: TextSize) {
509 if let Some(bind_pat) = name.syntax().parent().and_then(ast::IdentPat::cast) {
510 self.is_pat_or_const = Some(PatternRefutability::Refutable);
511 // if any of these is here our bind pat can't be a const pat anymore
512 let complex_ident_pat = bind_pat.at_token().is_some()
513 || bind_pat.ref_token().is_some()
514 || bind_pat.mut_token().is_some();
515 if complex_ident_pat {
516 self.is_pat_or_const = None;
518 let irrefutable_pat = bind_pat.syntax().ancestors().find_map(|node| {
521 ast::LetStmt(it) => Some(it.pat()),
522 ast::Param(it) => Some(it.pat()),
527 if let Some(Some(pat)) = irrefutable_pat {
528 // This check is here since we could be inside a pattern in the initializer expression of the let statement.
529 if pat.syntax().text_range().contains_range(bind_pat.syntax().text_range()) {
530 self.is_pat_or_const = Some(PatternRefutability::Irrefutable);
534 let is_name_in_field_pat = bind_pat
537 .and_then(ast::RecordPatField::cast)
538 .map_or(false, |pat_field| pat_field.name_ref().is_none());
539 if is_name_in_field_pat {
540 self.is_pat_or_const = None;
544 self.fill_impl_def();
546 self.is_param |= is_node::<ast::Param>(name.syntax());
547 if ast::RecordPatField::for_field_name(&name).is_some() {
548 self.record_pat_syntax =
549 self.sema.find_node_at_offset_with_macros(&original_file, offset);
553 fn classify_name_ref(
555 original_file: &SyntaxNode,
556 name_ref: ast::NameRef,
559 self.fill_impl_def();
560 if ast::RecordExprField::for_field_name(&name_ref).is_some() {
561 self.record_lit_syntax =
562 self.sema.find_node_at_offset_with_macros(original_file, offset);
564 if ast::RecordPatField::for_field_name_ref(&name_ref).is_some() {
565 self.record_pat_syntax =
566 self.sema.find_node_at_offset_with_macros(&original_file, offset);
569 self.name_ref_syntax =
570 find_node_at_offset(original_file, name_ref.syntax().text_range().start());
572 let name_range = name_ref.syntax().text_range();
573 let top_node = name_ref
576 .take_while(|it| it.text_range() == name_range)
580 if matches!(top_node.parent().map(|it| it.kind()), Some(SOURCE_FILE) | Some(ITEM_LIST)) {
581 self.is_new_item = true;
585 self.use_item_syntax =
586 self.sema.token_ancestors_with_macros(self.token.clone()).find_map(ast::Use::cast);
588 self.function_def = self
590 .token_ancestors_with_macros(self.token.clone())
591 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
592 .find_map(ast::Fn::cast);
594 let parent = match name_ref.syntax().parent() {
599 if let Some(segment) = ast::PathSegment::cast(parent.clone()) {
600 let path = segment.parent_path();
604 .and_then(ast::PathExpr::cast)
605 .and_then(|it| it.syntax().parent().and_then(ast::CallExpr::cast))
607 self.is_macro_call = path.syntax().parent().and_then(ast::MacroCall::cast).is_some();
608 self.is_pattern_call =
609 path.syntax().parent().and_then(ast::TupleStructPat::cast).is_some();
611 self.is_path_type = path.syntax().parent().and_then(ast::PathType::cast).is_some();
612 self.has_type_args = segment.generic_arg_list().is_some();
614 if let Some(path) = path_or_use_tree_qualifier(&path) {
615 self.path_qual = path
618 find_node_with_range::<ast::PathSegment>(
620 it.syntax().text_range(),
623 .map(|it| it.parent_path());
627 if let Some(segment) = path.segment() {
628 if segment.coloncolon_token().is_some() {
633 self.is_trivial_path = true;
635 // Find either enclosing expr statement (thing with `;`) or a
636 // block. If block, check that we are the last expr.
637 self.can_be_stmt = name_ref
641 if let Some(stmt) = ast::ExprStmt::cast(node.clone()) {
642 return Some(stmt.syntax().text_range() == name_ref.syntax().text_range());
644 if let Some(block) = ast::BlockExpr::cast(node) {
646 block.tail_expr().map(|e| e.syntax().text_range())
647 == Some(name_ref.syntax().text_range()),
653 self.is_expr = path.syntax().parent().and_then(ast::PathExpr::cast).is_some();
656 if let Some(field_expr) = ast::FieldExpr::cast(parent.clone()) {
657 // The receiver comes before the point of insertion of the fake
658 // ident, so it should have the same range in the non-modified file
659 self.dot_receiver = field_expr
661 .map(|e| e.syntax().text_range())
662 .and_then(|r| find_node_with_range(original_file, r));
663 self.dot_receiver_is_ambiguous_float_literal =
664 if let Some(ast::Expr::Literal(l)) = &self.dot_receiver {
666 ast::LiteralKind::FloatNumber { .. } => l.token().text().ends_with('.'),
674 if let Some(method_call_expr) = ast::MethodCallExpr::cast(parent) {
676 self.dot_receiver = method_call_expr
678 .map(|e| e.syntax().text_range())
679 .and_then(|r| find_node_with_range(original_file, r));
685 fn find_node_with_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
686 syntax.covering_element(range).ancestors().find_map(N::cast)
689 fn is_node<N: AstNode>(node: &SyntaxNode) -> bool {
690 match node.ancestors().find_map(N::cast) {
692 Some(n) => n.syntax().text_range() == node.text_range(),
696 fn path_or_use_tree_qualifier(path: &ast::Path) -> Option<ast::Path> {
697 if let Some(qual) = path.qualifier() {
700 let use_tree_list = path.syntax().ancestors().find_map(ast::UseTreeList::cast)?;
701 let use_tree = use_tree_list.syntax().parent().and_then(ast::UseTree::cast)?;
707 use expect_test::{expect, Expect};
710 use crate::test_utils::{position, TEST_CONFIG};
712 use super::CompletionContext;
714 fn check_expected_type_and_name(ra_fixture: &str, expect: Expect) {
715 let (db, pos) = position(ra_fixture);
716 let completion_context = CompletionContext::new(&db, pos, &TEST_CONFIG).unwrap();
718 let ty = completion_context
720 .map(|t| t.display_test(&db).to_string())
721 .unwrap_or("?".to_owned());
723 let name = completion_context
725 .map_or_else(|| "?".to_owned(), |name| name.to_string());
727 expect.assert_eq(&format!("ty: {}, name: {}", ty, name));
731 fn expected_type_let_without_leading_char() {
732 cov_mark::check!(expected_type_let_without_leading_char);
733 check_expected_type_and_name(
739 expect![[r#"ty: u32, name: x"#]],
744 fn expected_type_let_with_leading_char() {
745 cov_mark::check!(expected_type_let_with_leading_char);
746 check_expected_type_and_name(
752 expect![[r#"ty: u32, name: x"#]],
757 fn expected_type_let_pat() {
758 check_expected_type_and_name(
764 expect![[r#"ty: u32, name: ?"#]],
766 check_expected_type_and_name(
772 expect![[r#"ty: u32, name: ?"#]],
777 fn expected_type_fn_param_without_leading_char() {
778 cov_mark::check!(expected_type_fn_param_without_leading_char);
779 check_expected_type_and_name(
787 expect![[r#"ty: u32, name: x"#]],
792 fn expected_type_fn_param_with_leading_char() {
793 cov_mark::check!(expected_type_fn_param_with_leading_char);
794 check_expected_type_and_name(
802 expect![[r#"ty: u32, name: x"#]],
807 fn expected_type_struct_field_without_leading_char() {
808 cov_mark::check!(expected_type_struct_field_without_leading_char);
809 check_expected_type_and_name(
811 struct Foo { a: u32 }
816 expect![[r#"ty: u32, name: a"#]],
821 fn expected_type_generic_struct_field() {
822 check_expected_type_and_name(
824 struct Foo<T> { a: T }
825 fn foo() -> Foo<u32> {
829 expect![[r#"ty: u32, name: a"#]],
834 fn expected_type_struct_field_with_leading_char() {
835 cov_mark::check!(expected_type_struct_field_with_leading_char);
836 check_expected_type_and_name(
838 struct Foo { a: u32 }
843 expect![[r#"ty: u32, name: a"#]],
848 fn expected_type_match_arm_without_leading_char() {
849 cov_mark::check!(expected_type_match_arm_without_leading_char);
850 check_expected_type_and_name(
857 expect![[r#"ty: E, name: ?"#]],
862 fn expected_type_match_arm_with_leading_char() {
863 cov_mark::check!(expected_type_match_arm_with_leading_char);
864 check_expected_type_and_name(
871 expect![[r#"ty: E, name: ?"#]],
876 fn expected_type_if_let_without_leading_char() {
877 cov_mark::check!(expected_type_if_let_without_leading_char);
878 check_expected_type_and_name(
880 enum Foo { Bar, Baz, Quux }
887 expect![[r#"ty: Foo, name: ?"#]],
892 fn expected_type_if_let_with_leading_char() {
893 cov_mark::check!(expected_type_if_let_with_leading_char);
894 check_expected_type_and_name(
896 enum Foo { Bar, Baz, Quux }
903 expect![[r#"ty: Foo, name: ?"#]],
908 fn expected_type_fn_ret_without_leading_char() {
909 cov_mark::check!(expected_type_fn_ret_without_leading_char);
910 check_expected_type_and_name(
916 expect![[r#"ty: u32, name: ?"#]],
921 fn expected_type_fn_ret_with_leading_char() {
922 cov_mark::check!(expected_type_fn_ret_with_leading_char);
923 check_expected_type_and_name(
929 expect![[r#"ty: u32, name: ?"#]],
934 fn expected_type_fn_ret_fn_ref_fully_typed() {
935 check_expected_type_and_name(
941 expect![[r#"ty: u32, name: ?"#]],
946 fn expected_type_closure_param_return() {
947 // FIXME: make this work with `|| $0`
948 check_expected_type_and_name(
954 fn bar(f: impl FnOnce() -> u32) {}
956 trait FnOnce { type Output; }
958 expect![[r#"ty: u32, name: ?"#]],
963 fn expected_type_generic_function() {
964 check_expected_type_and_name(
972 expect![[r#"ty: u32, name: t"#]],
977 fn expected_type_generic_method() {
978 check_expected_type_and_name(
986 fn bar(self, t: T) {}
989 expect![[r#"ty: u32, name: t"#]],