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(Debug, PartialEq, Eq)]
29 pub(crate) enum IsPatOrConst {
35 /// `CompletionContext` is created early during completion to figure out, where
36 /// exactly is the cursor, syntax-wise.
38 pub(crate) struct CompletionContext<'a> {
39 pub(super) sema: Semantics<'a, RootDatabase>,
40 pub(super) scope: SemanticsScope<'a>,
41 pub(super) db: &'a RootDatabase,
42 pub(super) config: &'a CompletionConfig,
43 pub(super) position: FilePosition,
44 /// The token before the cursor, in the original file.
45 pub(super) original_token: SyntaxToken,
46 /// The token before the cursor, in the macro-expanded file.
47 pub(super) token: SyntaxToken,
48 pub(super) krate: Option<hir::Crate>,
49 pub(super) expected_name: Option<NameOrNameRef>,
50 pub(super) expected_type: Option<Type>,
51 pub(super) name_ref_syntax: Option<ast::NameRef>,
52 pub(super) function_syntax: Option<ast::Fn>,
53 pub(super) use_item_syntax: Option<ast::Use>,
54 pub(super) record_lit_syntax: Option<ast::RecordExpr>,
55 pub(super) record_pat_syntax: Option<ast::RecordPat>,
56 pub(super) record_field_syntax: Option<ast::RecordExprField>,
57 /// The parent impl of the cursor position if it exists.
58 pub(super) impl_def: Option<ast::Impl>,
60 // potentially set if we are completing a lifetime
61 pub(super) lifetime_syntax: Option<ast::Lifetime>,
62 pub(super) lifetime_param_syntax: Option<ast::LifetimeParam>,
63 pub(super) lifetime_allowed: bool,
64 pub(super) is_label_ref: bool,
66 // potentially set if we are completing a name
67 pub(super) is_pat_or_const: IsPatOrConst,
68 pub(super) is_param: bool,
70 /// FIXME: `ActiveParameter` is string-based, which is very very wrong
71 pub(super) active_parameter: Option<ActiveParameter>,
72 /// A single-indent path, like `foo`. `::foo` should not be considered a trivial path.
73 pub(super) is_trivial_path: bool,
74 /// If not a trivial path, the prefix (qualifier).
75 pub(super) path_qual: Option<ast::Path>,
76 pub(super) after_if: bool,
77 /// `true` if we are a statement or a last expr in the block.
78 pub(super) can_be_stmt: bool,
79 /// `true` if we expect an expression at the cursor position.
80 pub(super) is_expr: bool,
81 /// Something is typed at the "top" level, in module or impl/trait.
82 pub(super) is_new_item: bool,
83 /// The receiver if this is a field or method access, i.e. writing something.$0
84 pub(super) dot_receiver: Option<ast::Expr>,
85 pub(super) dot_receiver_is_ambiguous_float_literal: bool,
86 /// If this is a call (method or function) in particular, i.e. the () are already there.
87 pub(super) is_call: bool,
88 /// Like `is_call`, but for tuple patterns.
89 pub(super) is_pattern_call: bool,
90 /// If this is a macro call, i.e. the () are already there.
91 pub(super) is_macro_call: bool,
92 pub(super) is_path_type: bool,
93 pub(super) has_type_args: bool,
94 pub(super) attribute_under_caret: Option<ast::Attr>,
95 pub(super) locals: Vec<(String, Local)>,
97 pub(super) mod_declaration_under_caret: Option<ast::Module>,
98 pub(super) has_trait_parent: bool,
99 pub(super) has_impl_parent: bool,
102 pub(super) previous_token: Option<SyntaxToken>,
103 pub(super) block_expr_parent: bool,
104 pub(super) bind_pat_parent: bool,
105 pub(super) ref_pat_parent: bool,
106 pub(super) in_loop_body: bool,
107 pub(super) has_field_list_parent: bool,
108 pub(super) trait_as_prev_sibling: bool,
109 pub(super) impl_as_prev_sibling: bool,
110 pub(super) is_match_arm: bool,
111 pub(super) has_item_list_or_source_file_parent: bool,
112 pub(super) incomplete_let: bool,
114 no_completion_required: bool,
116 impl<'a> CompletionContext<'a> {
118 db: &'a RootDatabase,
119 position: FilePosition,
120 config: &'a CompletionConfig,
121 ) -> Option<CompletionContext<'a>> {
122 let sema = Semantics::new(db);
124 let original_file = sema.parse(position.file_id);
126 // Insert a fake ident to get a valid parse tree. We will use this file
127 // to determine context, though the original_file will be used for
128 // actual completion.
129 let file_with_fake_ident = {
130 let parse = db.parse(position.file_id);
131 let edit = Indel::insert(position.offset, "intellijRulezz".to_string());
132 parse.reparse(&edit).tree()
134 let fake_ident_token =
135 file_with_fake_ident.syntax().token_at_offset(position.offset).right_biased().unwrap();
137 let krate = sema.to_module_def(position.file_id).map(|m| m.krate());
139 original_file.syntax().token_at_offset(position.offset).left_biased()?;
140 let token = sema.descend_into_macros(original_token.clone());
141 let scope = sema.scope_at_offset(&token, position.offset);
142 let mut locals = vec![];
143 scope.process_all_names(&mut |name, scope| {
144 if let ScopeDef::Local(local) = scope {
145 locals.push((name.to_string(), local));
148 let mut ctx = CompletionContext {
157 lifetime_allowed: false,
160 name_ref_syntax: None,
161 lifetime_syntax: None,
162 lifetime_param_syntax: None,
163 function_syntax: None,
164 use_item_syntax: None,
165 record_lit_syntax: None,
166 record_pat_syntax: None,
167 record_field_syntax: None,
169 active_parameter: ActiveParameter::at(db, position),
172 is_pat_or_const: IsPatOrConst::No,
173 is_trivial_path: false,
180 dot_receiver_is_ambiguous_float_literal: false,
182 is_pattern_call: false,
183 is_macro_call: false,
185 has_type_args: false,
186 attribute_under_caret: None,
187 mod_declaration_under_caret: None,
188 previous_token: None,
189 block_expr_parent: false,
190 bind_pat_parent: false,
191 ref_pat_parent: false,
193 has_trait_parent: false,
194 has_impl_parent: false,
195 has_field_list_parent: false,
196 trait_as_prev_sibling: false,
197 impl_as_prev_sibling: false,
199 has_item_list_or_source_file_parent: false,
200 no_completion_required: false,
201 incomplete_let: false,
205 let mut original_file = original_file.syntax().clone();
206 let mut speculative_file = file_with_fake_ident.syntax().clone();
207 let mut offset = position.offset;
208 let mut fake_ident_token = fake_ident_token;
210 // Are we inside a macro call?
211 while let (Some(actual_macro_call), Some(macro_call_with_fake_ident)) = (
212 find_node_at_offset::<ast::MacroCall>(&original_file, offset),
213 find_node_at_offset::<ast::MacroCall>(&speculative_file, offset),
215 if actual_macro_call.path().as_ref().map(|s| s.syntax().text())
216 != macro_call_with_fake_ident.path().as_ref().map(|s| s.syntax().text())
220 let speculative_args = match macro_call_with_fake_ident.token_tree() {
224 if let (Some(actual_expansion), Some(speculative_expansion)) = (
225 ctx.sema.expand(&actual_macro_call),
226 ctx.sema.speculative_expand(
232 let new_offset = speculative_expansion.1.text_range().start();
233 if new_offset > actual_expansion.text_range().end() {
236 original_file = actual_expansion;
237 speculative_file = speculative_expansion.0;
238 fake_ident_token = speculative_expansion.1;
244 ctx.fill_keyword_patterns(&speculative_file, offset);
245 ctx.fill(&original_file, speculative_file, offset);
249 /// Checks whether completions in that particular case don't make much sense.
251 /// - `fn $0` -- we expect function name, it's unlikely that "hint" will be helpful.
252 /// Exception for this case is `impl Trait for Foo`, where we would like to hint trait method names.
253 /// - `for _ i$0` -- obviously, it'll be "in" keyword.
254 pub(crate) fn no_completion_required(&self) -> bool {
255 self.no_completion_required
258 /// The range of the identifier that is being completed.
259 pub(crate) fn source_range(&self) -> TextRange {
260 // check kind of macro-expanded token, but use range of original token
261 let kind = self.token.kind();
262 if kind == IDENT || kind == LIFETIME_IDENT || kind == UNDERSCORE || kind.is_keyword() {
263 cov_mark::hit!(completes_if_prefix_is_keyword);
264 self.original_token.text_range()
265 } else if kind == CHAR {
266 // assume we are completing a lifetime but the user has only typed the '
267 cov_mark::hit!(completes_if_lifetime_without_idents);
268 TextRange::at(self.original_token.text_range().start(), TextSize::from(1))
270 TextRange::empty(self.position.offset)
274 pub(crate) fn previous_token_is(&self, kind: SyntaxKind) -> bool {
275 self.previous_token.as_ref().map_or(false, |tok| tok.kind() == kind)
278 fn fill_keyword_patterns(&mut self, file_with_fake_ident: &SyntaxNode, offset: TextSize) {
279 let fake_ident_token = file_with_fake_ident.token_at_offset(offset).right_biased().unwrap();
280 let syntax_element = NodeOrToken::Token(fake_ident_token);
281 self.previous_token = previous_token(syntax_element.clone());
282 self.block_expr_parent = has_block_expr_parent(syntax_element.clone());
283 self.bind_pat_parent = has_bind_pat_parent(syntax_element.clone());
284 self.ref_pat_parent = has_ref_parent(syntax_element.clone());
285 self.in_loop_body = is_in_loop_body(syntax_element.clone());
286 self.has_trait_parent = has_trait_parent(syntax_element.clone());
287 self.has_impl_parent = has_impl_parent(syntax_element.clone());
288 self.has_field_list_parent = has_field_list_parent(syntax_element.clone());
289 self.impl_as_prev_sibling = has_impl_as_prev_sibling(syntax_element.clone());
290 self.trait_as_prev_sibling = has_trait_as_prev_sibling(syntax_element.clone());
291 self.is_match_arm = is_match_arm(syntax_element.clone());
293 self.has_item_list_or_source_file_parent =
294 has_item_list_or_source_file_parent(syntax_element.clone());
295 self.mod_declaration_under_caret =
296 find_node_at_offset::<ast::Module>(&file_with_fake_ident, offset)
297 .filter(|module| module.item_list().is_none());
298 self.incomplete_let =
299 syntax_element.ancestors().take(6).find_map(ast::LetStmt::cast).map_or(false, |it| {
300 it.syntax().text_range().end() == syntax_element.text_range().end()
303 let inside_impl_trait_block = inside_impl_trait_block(syntax_element.clone());
304 let fn_is_prev = self.previous_token_is(T![fn]);
305 let for_is_prev2 = for_is_prev2(syntax_element.clone());
306 self.no_completion_required = (fn_is_prev && !inside_impl_trait_block) || for_is_prev2;
309 fn fill_impl_def(&mut self) {
312 .token_ancestors_with_macros(self.token.clone())
313 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
314 .find_map(ast::Impl::cast);
317 fn expected_type_and_name(&self) -> (Option<Type>, Option<NameOrNameRef>) {
318 let mut node = match self.token.parent() {
320 None => return (None, None),
325 ast::LetStmt(it) => {
326 cov_mark::hit!(expected_type_let_with_leading_char);
327 cov_mark::hit!(expected_type_let_without_leading_char);
329 .and_then(|pat| self.sema.type_of_pat(&pat))
330 .or_else(|| it.initializer().and_then(|it| self.sema.type_of_expr(&it)));
331 let name = if let Some(ast::Pat::IdentPat(ident)) = it.pat() {
332 ident.name().map(NameOrNameRef::Name)
339 ast::ArgList(_it) => {
340 cov_mark::hit!(expected_type_fn_param_with_leading_char);
341 cov_mark::hit!(expected_type_fn_param_without_leading_char);
342 ActiveParameter::at_token(
346 let name = ap.ident().map(NameOrNameRef::Name);
349 .unwrap_or((None, None))
351 ast::RecordExprFieldList(_it) => {
352 cov_mark::hit!(expected_type_struct_field_without_leading_char);
353 // wouldn't try {} be nice...
355 let expr_field = self.token.prev_sibling_or_token()?
357 .and_then(|node| ast::RecordExprField::cast(node))?;
358 let (_, _, ty) = self.sema.resolve_record_field(&expr_field)?;
361 expr_field.field_name().map(NameOrNameRef::NameRef),
363 })().unwrap_or((None, None))
365 ast::RecordExprField(it) => {
366 cov_mark::hit!(expected_type_struct_field_with_leading_char);
368 it.expr().as_ref().and_then(|e| self.sema.type_of_expr(e)),
369 it.field_name().map(NameOrNameRef::NameRef),
372 ast::MatchExpr(it) => {
373 cov_mark::hit!(expected_type_match_arm_without_leading_char);
375 .and_then(|e| self.sema.type_of_expr(&e));
379 cov_mark::hit!(expected_type_if_let_without_leading_char);
380 let ty = it.condition()
381 .and_then(|cond| cond.expr())
382 .and_then(|e| self.sema.type_of_expr(&e));
385 ast::IdentPat(it) => {
386 cov_mark::hit!(expected_type_if_let_with_leading_char);
387 cov_mark::hit!(expected_type_match_arm_with_leading_char);
388 let ty = self.sema.type_of_pat(&ast::Pat::from(it));
392 cov_mark::hit!(expected_type_fn_ret_with_leading_char);
393 cov_mark::hit!(expected_type_fn_ret_without_leading_char);
394 let def = self.sema.to_def(&it);
395 (def.map(|def| def.ret_type(self.db)), None)
397 ast::ClosureExpr(it) => {
398 let ty = self.sema.type_of_expr(&it.into());
399 ty.and_then(|ty| ty.as_callable(self.db))
400 .map(|c| (Some(c.return_type()), None))
401 .unwrap_or((None, None))
403 ast::Stmt(_it) => (None, None),
405 match node.parent() {
410 None => (None, None),
420 original_file: &SyntaxNode,
421 file_with_fake_ident: SyntaxNode,
424 let (expected_type, expected_name) = self.expected_type_and_name();
425 self.expected_type = expected_type;
426 self.expected_name = expected_name;
427 self.attribute_under_caret = find_node_at_offset(&file_with_fake_ident, offset);
428 let name_like = match find_node_at_offset(&&file_with_fake_ident, offset) {
433 ast::NameLike::Lifetime(lifetime) => {
434 self.classify_lifetime(original_file, lifetime, offset);
436 ast::NameLike::NameRef(name_ref) => {
437 self.classify_name_ref(original_file, name_ref, offset);
439 ast::NameLike::Name(name) => {
440 self.classify_name(original_file, name, offset);
445 fn classify_lifetime(
447 original_file: &SyntaxNode,
448 lifetime: ast::Lifetime,
451 self.lifetime_syntax =
452 find_node_at_offset(original_file, lifetime.syntax().text_range().start());
453 if let Some(parent) = lifetime.syntax().parent() {
454 if parent.kind() == ERROR {
460 ast::LifetimeParam(_it) => {
461 self.lifetime_allowed = true;
462 self.lifetime_param_syntax =
463 self.sema.find_node_at_offset_with_macros(original_file, offset);
465 ast::BreakExpr(_it) => self.is_label_ref = true,
466 ast::ContinueExpr(_it) => self.is_label_ref = true,
467 ast::Label(_it) => (),
468 _ => self.lifetime_allowed = true,
474 fn classify_name(&mut self, original_file: &SyntaxNode, name: ast::Name, offset: TextSize) {
475 if let Some(bind_pat) = name.syntax().parent().and_then(ast::IdentPat::cast) {
476 self.is_pat_or_const = IsPatOrConst::Refutable;
477 // if any of these is here our bind pat can't be a const pat anymore
478 let complex_ident_pat = bind_pat.at_token().is_some()
479 || bind_pat.ref_token().is_some()
480 || bind_pat.mut_token().is_some();
481 if complex_ident_pat {
482 self.is_pat_or_const = IsPatOrConst::No;
483 } else if let Some(pat_field) =
484 bind_pat.syntax().parent().and_then(ast::RecordPatField::cast)
486 if pat_field.name_ref().is_none() {
487 self.is_pat_or_const = IsPatOrConst::No;
490 let irrefutable_pat = bind_pat.syntax().ancestors().find_map(|node| {
493 ast::LetStmt(it) => Some(it.pat()),
494 ast::Param(it) => Some(it.pat()),
499 if let Some(Some(pat)) = irrefutable_pat {
500 // This check is here since we could be inside a pattern in the initializer expression of the let statement.
501 if pat.syntax().text_range().contains_range(bind_pat.syntax().text_range()) {
502 self.is_pat_or_const = IsPatOrConst::Irrefutable;
507 self.fill_impl_def();
509 if is_node::<ast::Param>(name.syntax()) {
510 self.is_param = true;
513 // FIXME: remove this (V) duplication and make the check more precise
514 if name.syntax().ancestors().find_map(ast::RecordPatFieldList::cast).is_some() {
515 self.record_pat_syntax =
516 self.sema.find_node_at_offset_with_macros(&original_file, offset);
520 fn classify_name_ref(
522 original_file: &SyntaxNode,
523 name_ref: ast::NameRef,
526 // FIXME: remove this (^) duplication and make the check more precise
527 if name_ref.syntax().ancestors().find_map(ast::RecordPatFieldList::cast).is_some() {
528 self.record_pat_syntax =
529 self.sema.find_node_at_offset_with_macros(&original_file, offset);
532 self.name_ref_syntax =
533 find_node_at_offset(original_file, name_ref.syntax().text_range().start());
534 let name_range = name_ref.syntax().text_range();
535 if ast::RecordExprField::for_field_name(&name_ref).is_some() {
536 self.record_lit_syntax =
537 self.sema.find_node_at_offset_with_macros(original_file, offset);
540 self.fill_impl_def();
542 let top_node = name_ref
545 .take_while(|it| it.text_range() == name_range)
549 match top_node.parent().map(|it| it.kind()) {
550 Some(SOURCE_FILE) | Some(ITEM_LIST) => {
551 self.is_new_item = true;
557 self.use_item_syntax =
558 self.sema.token_ancestors_with_macros(self.token.clone()).find_map(ast::Use::cast);
560 self.function_syntax = self
562 .token_ancestors_with_macros(self.token.clone())
563 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
564 .find_map(ast::Fn::cast);
566 self.record_field_syntax = self
568 .token_ancestors_with_macros(self.token.clone())
570 it.kind() != SOURCE_FILE && it.kind() != MODULE && it.kind() != CALL_EXPR
572 .find_map(ast::RecordExprField::cast);
574 let parent = match name_ref.syntax().parent() {
579 if let Some(segment) = ast::PathSegment::cast(parent.clone()) {
580 let path = segment.parent_path();
584 .and_then(ast::PathExpr::cast)
585 .and_then(|it| it.syntax().parent().and_then(ast::CallExpr::cast))
587 self.is_macro_call = path.syntax().parent().and_then(ast::MacroCall::cast).is_some();
588 self.is_pattern_call =
589 path.syntax().parent().and_then(ast::TupleStructPat::cast).is_some();
591 self.is_path_type = path.syntax().parent().and_then(ast::PathType::cast).is_some();
592 self.has_type_args = segment.generic_arg_list().is_some();
594 if let Some(path) = path_or_use_tree_qualifier(&path) {
595 self.path_qual = path
598 find_node_with_range::<ast::PathSegment>(
600 it.syntax().text_range(),
603 .map(|it| it.parent_path());
607 if let Some(segment) = path.segment() {
608 if segment.coloncolon_token().is_some() {
613 self.is_trivial_path = true;
615 // Find either enclosing expr statement (thing with `;`) or a
616 // block. If block, check that we are the last expr.
617 self.can_be_stmt = name_ref
621 if let Some(stmt) = ast::ExprStmt::cast(node.clone()) {
622 return Some(stmt.syntax().text_range() == name_ref.syntax().text_range());
624 if let Some(block) = ast::BlockExpr::cast(node) {
626 block.tail_expr().map(|e| e.syntax().text_range())
627 == Some(name_ref.syntax().text_range()),
633 self.is_expr = path.syntax().parent().and_then(ast::PathExpr::cast).is_some();
635 if let Some(off) = name_ref.syntax().text_range().start().checked_sub(2.into()) {
636 if let Some(if_expr) =
637 self.sema.find_node_at_offset_with_macros::<ast::IfExpr>(original_file, off)
639 if if_expr.syntax().text_range().end() < name_ref.syntax().text_range().start()
641 self.after_if = true;
646 if let Some(field_expr) = ast::FieldExpr::cast(parent.clone()) {
647 // The receiver comes before the point of insertion of the fake
648 // ident, so it should have the same range in the non-modified file
649 self.dot_receiver = field_expr
651 .map(|e| e.syntax().text_range())
652 .and_then(|r| find_node_with_range(original_file, r));
653 self.dot_receiver_is_ambiguous_float_literal =
654 if let Some(ast::Expr::Literal(l)) = &self.dot_receiver {
656 ast::LiteralKind::FloatNumber { .. } => l.token().text().ends_with('.'),
663 if let Some(method_call_expr) = ast::MethodCallExpr::cast(parent) {
665 self.dot_receiver = method_call_expr
667 .map(|e| e.syntax().text_range())
668 .and_then(|r| find_node_with_range(original_file, r));
674 fn find_node_with_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
675 syntax.covering_element(range).ancestors().find_map(N::cast)
678 fn is_node<N: AstNode>(node: &SyntaxNode) -> bool {
679 match node.ancestors().find_map(N::cast) {
681 Some(n) => n.syntax().text_range() == node.text_range(),
685 fn path_or_use_tree_qualifier(path: &ast::Path) -> Option<ast::Path> {
686 if let Some(qual) = path.qualifier() {
689 let use_tree_list = path.syntax().ancestors().find_map(ast::UseTreeList::cast)?;
690 let use_tree = use_tree_list.syntax().parent().and_then(ast::UseTree::cast)?;
696 use expect_test::{expect, Expect};
699 use crate::test_utils::{position, TEST_CONFIG};
701 use super::CompletionContext;
703 fn check_expected_type_and_name(ra_fixture: &str, expect: Expect) {
704 let (db, pos) = position(ra_fixture);
705 let completion_context = CompletionContext::new(&db, pos, &TEST_CONFIG).unwrap();
707 let ty = completion_context
709 .map(|t| t.display_test(&db).to_string())
710 .unwrap_or("?".to_owned());
712 let name = completion_context
714 .map_or_else(|| "?".to_owned(), |name| name.to_string());
716 expect.assert_eq(&format!("ty: {}, name: {}", ty, name));
720 fn expected_type_let_without_leading_char() {
721 cov_mark::check!(expected_type_let_without_leading_char);
722 check_expected_type_and_name(
728 expect![[r#"ty: u32, name: x"#]],
733 fn expected_type_let_with_leading_char() {
734 cov_mark::check!(expected_type_let_with_leading_char);
735 check_expected_type_and_name(
741 expect![[r#"ty: u32, name: x"#]],
746 fn expected_type_let_pat() {
747 check_expected_type_and_name(
753 expect![[r#"ty: u32, name: ?"#]],
755 check_expected_type_and_name(
761 expect![[r#"ty: u32, name: ?"#]],
766 fn expected_type_fn_param_without_leading_char() {
767 cov_mark::check!(expected_type_fn_param_without_leading_char);
768 check_expected_type_and_name(
776 expect![[r#"ty: u32, name: x"#]],
781 fn expected_type_fn_param_with_leading_char() {
782 cov_mark::check!(expected_type_fn_param_with_leading_char);
783 check_expected_type_and_name(
791 expect![[r#"ty: u32, name: x"#]],
796 fn expected_type_struct_field_without_leading_char() {
797 cov_mark::check!(expected_type_struct_field_without_leading_char);
798 check_expected_type_and_name(
800 struct Foo { a: u32 }
805 expect![[r#"ty: u32, name: a"#]],
810 fn expected_type_generic_struct_field() {
811 check_expected_type_and_name(
813 struct Foo<T> { a: T }
814 fn foo() -> Foo<u32> {
818 expect![[r#"ty: u32, name: a"#]],
823 fn expected_type_struct_field_with_leading_char() {
824 cov_mark::check!(expected_type_struct_field_with_leading_char);
825 check_expected_type_and_name(
827 struct Foo { a: u32 }
832 expect![[r#"ty: u32, name: a"#]],
837 fn expected_type_match_arm_without_leading_char() {
838 cov_mark::check!(expected_type_match_arm_without_leading_char);
839 check_expected_type_and_name(
846 expect![[r#"ty: E, name: ?"#]],
851 fn expected_type_match_arm_with_leading_char() {
852 cov_mark::check!(expected_type_match_arm_with_leading_char);
853 check_expected_type_and_name(
860 expect![[r#"ty: E, name: ?"#]],
865 fn expected_type_if_let_without_leading_char() {
866 cov_mark::check!(expected_type_if_let_without_leading_char);
867 check_expected_type_and_name(
869 enum Foo { Bar, Baz, Quux }
876 expect![[r#"ty: Foo, name: ?"#]],
881 fn expected_type_if_let_with_leading_char() {
882 cov_mark::check!(expected_type_if_let_with_leading_char);
883 check_expected_type_and_name(
885 enum Foo { Bar, Baz, Quux }
892 expect![[r#"ty: Foo, name: ?"#]],
897 fn expected_type_fn_ret_without_leading_char() {
898 cov_mark::check!(expected_type_fn_ret_without_leading_char);
899 check_expected_type_and_name(
905 expect![[r#"ty: u32, name: ?"#]],
910 fn expected_type_fn_ret_with_leading_char() {
911 cov_mark::check!(expected_type_fn_ret_with_leading_char);
912 check_expected_type_and_name(
918 expect![[r#"ty: u32, name: ?"#]],
923 fn expected_type_fn_ret_fn_ref_fully_typed() {
924 check_expected_type_and_name(
930 expect![[r#"ty: u32, name: ?"#]],
935 fn expected_type_closure_param_return() {
936 // FIXME: make this work with `|| $0`
937 check_expected_type_and_name(
943 fn bar(f: impl FnOnce() -> u32) {}
945 trait FnOnce { type Output; }
947 expect![[r#"ty: u32, name: ?"#]],
952 fn expected_type_generic_function() {
953 check_expected_type_and_name(
961 expect![[r#"ty: u32, name: t"#]],
966 fn expected_type_generic_method() {
967 check_expected_type_and_name(
975 fn bar(self, t: T) {}
978 expect![[r#"ty: u32, name: t"#]],