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, 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 // potentially set if we are completing a lifetime
58 pub(super) lifetime_syntax: Option<ast::Lifetime>,
59 pub(super) lifetime_param_syntax: Option<ast::LifetimeParam>,
60 pub(super) lifetime_allowed: bool,
61 pub(super) is_label_ref: bool,
63 // potentially set if we are completing a name
64 pub(super) is_pat_or_const: Option<PatternRefutability>,
65 pub(super) is_param: bool,
67 pub(super) completion_location: Option<ImmediateLocation>,
68 pub(super) prev_sibling: Option<ImmediatePrevSibling>,
69 pub(super) attribute_under_caret: Option<ast::Attr>,
71 /// FIXME: `ActiveParameter` is string-based, which is very very wrong
72 pub(super) active_parameter: Option<ActiveParameter>,
73 /// A single-indent path, like `foo`. `::foo` should not be considered a trivial path.
74 pub(super) is_trivial_path: bool,
75 /// If not a trivial path, the prefix (qualifier).
76 pub(super) path_qual: Option<ast::Path>,
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 /// If this is a call (method or function) in particular, i.e. the () are already there.
82 pub(super) is_call: bool,
83 /// Like `is_call`, but for tuple patterns.
84 pub(super) is_pattern_call: bool,
85 /// If this is a macro call, i.e. the () are already there.
86 pub(super) is_macro_call: bool,
87 pub(super) is_path_type: bool,
88 pub(super) has_type_args: bool,
89 pub(super) locals: Vec<(String, Local)>,
91 pub(super) previous_token: Option<SyntaxToken>,
92 pub(super) in_loop_body: bool,
93 pub(super) incomplete_let: bool,
95 no_completion_required: bool,
98 impl<'a> CompletionContext<'a> {
100 db: &'a RootDatabase,
101 position: FilePosition,
102 config: &'a CompletionConfig,
103 ) -> Option<CompletionContext<'a>> {
104 let sema = Semantics::new(db);
106 let original_file = sema.parse(position.file_id);
108 // Insert a fake ident to get a valid parse tree. We will use this file
109 // to determine context, though the original_file will be used for
110 // actual completion.
111 let file_with_fake_ident = {
112 let parse = db.parse(position.file_id);
113 let edit = Indel::insert(position.offset, "intellijRulezz".to_string());
114 parse.reparse(&edit).tree()
116 let fake_ident_token =
117 file_with_fake_ident.syntax().token_at_offset(position.offset).right_biased().unwrap();
119 let krate = sema.to_module_def(position.file_id).map(|m| m.krate());
121 original_file.syntax().token_at_offset(position.offset).left_biased()?;
122 let token = sema.descend_into_macros(original_token.clone());
123 let scope = sema.scope_at_offset(&token, position.offset);
124 let mut locals = vec![];
125 scope.process_all_names(&mut |name, scope| {
126 if let ScopeDef::Local(local) = scope {
127 locals.push((name.to_string(), local));
130 let mut ctx = CompletionContext {
139 lifetime_allowed: false,
142 name_ref_syntax: None,
143 lifetime_syntax: None,
144 lifetime_param_syntax: None,
146 use_item_syntax: None,
148 active_parameter: ActiveParameter::at(db, position),
151 is_pat_or_const: None,
152 is_trivial_path: false,
157 is_pattern_call: false,
158 is_macro_call: false,
160 has_type_args: false,
161 previous_token: None,
163 completion_location: None,
165 no_completion_required: false,
166 incomplete_let: false,
167 attribute_under_caret: None,
171 let mut original_file = original_file.syntax().clone();
172 let mut speculative_file = file_with_fake_ident.syntax().clone();
173 let mut offset = position.offset;
174 let mut fake_ident_token = fake_ident_token;
176 // Are we inside a macro call?
177 while let (Some(actual_macro_call), Some(macro_call_with_fake_ident)) = (
178 find_node_at_offset::<ast::MacroCall>(&original_file, offset),
179 find_node_at_offset::<ast::MacroCall>(&speculative_file, offset),
181 if actual_macro_call.path().as_ref().map(|s| s.syntax().text())
182 != macro_call_with_fake_ident.path().as_ref().map(|s| s.syntax().text())
186 let speculative_args = match macro_call_with_fake_ident.token_tree() {
190 if let (Some(actual_expansion), Some(speculative_expansion)) = (
191 ctx.sema.expand(&actual_macro_call),
192 ctx.sema.speculative_expand(
198 let new_offset = speculative_expansion.1.text_range().start();
199 if new_offset > actual_expansion.text_range().end() {
202 original_file = actual_expansion;
203 speculative_file = speculative_expansion.0;
204 fake_ident_token = speculative_expansion.1;
210 ctx.fill(&original_file, speculative_file, offset);
214 /// Checks whether completions in that particular case don't make much sense.
216 /// - `fn $0` -- we expect function name, it's unlikely that "hint" will be helpful.
217 /// Exception for this case is `impl Trait for Foo`, where we would like to hint trait method names.
218 /// - `for _ i$0` -- obviously, it'll be "in" keyword.
219 pub(crate) fn no_completion_required(&self) -> bool {
220 self.no_completion_required
223 /// The range of the identifier that is being completed.
224 pub(crate) fn source_range(&self) -> TextRange {
225 // check kind of macro-expanded token, but use range of original token
226 let kind = self.token.kind();
227 if kind == IDENT || kind == LIFETIME_IDENT || kind == UNDERSCORE || kind.is_keyword() {
228 cov_mark::hit!(completes_if_prefix_is_keyword);
229 self.original_token.text_range()
230 } else if kind == CHAR {
231 // assume we are completing a lifetime but the user has only typed the '
232 cov_mark::hit!(completes_if_lifetime_without_idents);
233 TextRange::at(self.original_token.text_range().start(), TextSize::from(1))
235 TextRange::empty(self.position.offset)
239 pub(crate) fn previous_token_is(&self, kind: SyntaxKind) -> bool {
240 self.previous_token.as_ref().map_or(false, |tok| tok.kind() == kind)
243 pub(crate) fn expects_assoc_item(&self) -> bool {
245 self.completion_location,
246 Some(ImmediateLocation::Trait) | Some(ImmediateLocation::Impl)
250 pub(crate) fn has_dot_receiver(&self) -> bool {
252 &self.completion_location,
253 Some(ImmediateLocation::FieldAccess { receiver, .. }) | Some(ImmediateLocation::MethodCall { receiver })
254 if receiver.is_some()
258 pub(crate) fn dot_receiver(&self) -> Option<&ast::Expr> {
259 match &self.completion_location {
260 Some(ImmediateLocation::MethodCall { receiver })
261 | Some(ImmediateLocation::FieldAccess { receiver, .. }) => receiver.as_ref(),
266 pub(crate) fn expects_use_tree(&self) -> bool {
267 matches!(self.completion_location, Some(ImmediateLocation::Use))
270 pub(crate) fn expects_non_trait_assoc_item(&self) -> bool {
271 matches!(self.completion_location, Some(ImmediateLocation::Impl))
274 pub(crate) fn expects_item(&self) -> bool {
275 matches!(self.completion_location, Some(ImmediateLocation::ItemList))
278 // fn expects_value(&self) -> bool {
279 pub(crate) fn expects_expression(&self) -> bool {
283 pub(crate) fn has_block_expr_parent(&self) -> bool {
284 matches!(self.completion_location, Some(ImmediateLocation::BlockExpr))
287 pub(crate) fn expects_ident_pat_or_ref_expr(&self) -> bool {
289 self.completion_location,
290 Some(ImmediateLocation::IdentPat) | Some(ImmediateLocation::RefExpr)
294 pub(crate) fn expect_record_field(&self) -> bool {
295 matches!(self.completion_location, Some(ImmediateLocation::RecordField))
298 pub(crate) fn has_impl_or_trait_prev_sibling(&self) -> bool {
301 Some(ImmediatePrevSibling::ImplDefType) | Some(ImmediatePrevSibling::TraitDefName)
305 pub(crate) fn after_if(&self) -> bool {
306 matches!(self.prev_sibling, Some(ImmediatePrevSibling::IfExpr))
309 pub(crate) fn is_path_disallowed(&self) -> bool {
311 self.completion_location,
312 Some(ImmediateLocation::Attribute(_))
313 | Some(ImmediateLocation::ModDeclaration(_))
314 | Some(ImmediateLocation::RecordPat(_))
315 | Some(ImmediateLocation::RecordExpr(_))
316 ) || self.attribute_under_caret.is_some()
319 fn fill_impl_def(&mut self) {
322 .token_ancestors_with_macros(self.token.clone())
323 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
324 .find_map(ast::Impl::cast);
327 fn expected_type_and_name(&self) -> (Option<Type>, Option<NameOrNameRef>) {
328 let mut node = match self.token.parent() {
330 None => return (None, None),
335 ast::LetStmt(it) => {
336 cov_mark::hit!(expected_type_let_with_leading_char);
337 cov_mark::hit!(expected_type_let_without_leading_char);
339 .and_then(|pat| self.sema.type_of_pat(&pat))
340 .or_else(|| it.initializer().and_then(|it| self.sema.type_of_expr(&it)));
341 let name = if let Some(ast::Pat::IdentPat(ident)) = it.pat() {
342 ident.name().map(NameOrNameRef::Name)
349 ast::ArgList(_it) => {
350 cov_mark::hit!(expected_type_fn_param_with_leading_char);
351 cov_mark::hit!(expected_type_fn_param_without_leading_char);
352 ActiveParameter::at_token(
356 let name = ap.ident().map(NameOrNameRef::Name);
359 .unwrap_or((None, None))
361 ast::RecordExprFieldList(_it) => {
362 cov_mark::hit!(expected_type_struct_field_without_leading_char);
363 // wouldn't try {} be nice...
365 let expr_field = self.token.prev_sibling_or_token()?
367 .and_then(|node| ast::RecordExprField::cast(node))?;
368 let (_, _, ty) = self.sema.resolve_record_field(&expr_field)?;
371 expr_field.field_name().map(NameOrNameRef::NameRef),
373 })().unwrap_or((None, None))
375 ast::RecordExprField(it) => {
376 cov_mark::hit!(expected_type_struct_field_with_leading_char);
378 it.expr().as_ref().and_then(|e| self.sema.type_of_expr(e)),
379 it.field_name().map(NameOrNameRef::NameRef),
382 ast::MatchExpr(it) => {
383 cov_mark::hit!(expected_type_match_arm_without_leading_char);
385 .and_then(|e| self.sema.type_of_expr(&e));
389 cov_mark::hit!(expected_type_if_let_without_leading_char);
390 let ty = it.condition()
391 .and_then(|cond| cond.expr())
392 .and_then(|e| self.sema.type_of_expr(&e));
395 ast::IdentPat(it) => {
396 cov_mark::hit!(expected_type_if_let_with_leading_char);
397 cov_mark::hit!(expected_type_match_arm_with_leading_char);
398 let ty = self.sema.type_of_pat(&ast::Pat::from(it));
402 cov_mark::hit!(expected_type_fn_ret_with_leading_char);
403 cov_mark::hit!(expected_type_fn_ret_without_leading_char);
404 let def = self.sema.to_def(&it);
405 (def.map(|def| def.ret_type(self.db)), None)
407 ast::ClosureExpr(it) => {
408 let ty = self.sema.type_of_expr(&it.into());
409 ty.and_then(|ty| ty.as_callable(self.db))
410 .map(|c| (Some(c.return_type()), None))
411 .unwrap_or((None, None))
413 ast::Stmt(_it) => (None, None),
415 match node.parent() {
420 None => (None, None),
430 original_file: &SyntaxNode,
431 file_with_fake_ident: SyntaxNode,
434 let fake_ident_token = file_with_fake_ident.token_at_offset(offset).right_biased().unwrap();
435 let syntax_element = NodeOrToken::Token(fake_ident_token);
436 self.previous_token = previous_token(syntax_element.clone());
437 self.attribute_under_caret = syntax_element.ancestors().find_map(ast::Attr::cast);
438 self.no_completion_required = {
439 let inside_impl_trait_block = inside_impl_trait_block(syntax_element.clone());
440 let fn_is_prev = self.previous_token_is(T![fn]);
441 let for_is_prev2 = for_is_prev2(syntax_element.clone());
442 (fn_is_prev && !inside_impl_trait_block) || for_is_prev2
444 self.in_loop_body = is_in_loop_body(syntax_element.clone());
446 self.incomplete_let =
447 syntax_element.ancestors().take(6).find_map(ast::LetStmt::cast).map_or(false, |it| {
448 it.syntax().text_range().end() == syntax_element.text_range().end()
451 let (expected_type, expected_name) = self.expected_type_and_name();
452 self.expected_type = expected_type;
453 self.expected_name = expected_name;
455 let name_like = match find_node_at_offset(&&file_with_fake_ident, offset) {
459 self.completion_location =
460 determine_location(&self.sema, original_file, offset, &name_like);
461 self.prev_sibling = determine_prev_sibling(&name_like);
463 ast::NameLike::Lifetime(lifetime) => {
464 self.classify_lifetime(original_file, lifetime, offset);
466 ast::NameLike::NameRef(name_ref) => {
467 self.classify_name_ref(original_file, name_ref);
469 ast::NameLike::Name(name) => {
470 self.classify_name(name);
475 fn classify_lifetime(
477 original_file: &SyntaxNode,
478 lifetime: ast::Lifetime,
481 self.lifetime_syntax =
482 find_node_at_offset(original_file, lifetime.syntax().text_range().start());
483 if let Some(parent) = lifetime.syntax().parent() {
484 if parent.kind() == ERROR {
490 ast::LifetimeParam(_it) => {
491 self.lifetime_allowed = true;
492 self.lifetime_param_syntax =
493 self.sema.find_node_at_offset_with_macros(original_file, offset);
495 ast::BreakExpr(_it) => self.is_label_ref = true,
496 ast::ContinueExpr(_it) => self.is_label_ref = true,
497 ast::Label(_it) => (),
498 _ => self.lifetime_allowed = true,
504 fn classify_name(&mut self, name: ast::Name) {
505 if let Some(bind_pat) = name.syntax().parent().and_then(ast::IdentPat::cast) {
506 self.is_pat_or_const = Some(PatternRefutability::Refutable);
507 // if any of these is here our bind pat can't be a const pat anymore
508 let complex_ident_pat = bind_pat.at_token().is_some()
509 || bind_pat.ref_token().is_some()
510 || bind_pat.mut_token().is_some();
511 if complex_ident_pat {
512 self.is_pat_or_const = None;
514 let irrefutable_pat = bind_pat.syntax().ancestors().find_map(|node| {
517 ast::LetStmt(it) => Some(it.pat()),
518 ast::Param(it) => Some(it.pat()),
523 if let Some(Some(pat)) = irrefutable_pat {
524 // This check is here since we could be inside a pattern in the initializer expression of the let statement.
525 if pat.syntax().text_range().contains_range(bind_pat.syntax().text_range()) {
526 self.is_pat_or_const = Some(PatternRefutability::Irrefutable);
530 let is_name_in_field_pat = bind_pat
533 .and_then(ast::RecordPatField::cast)
534 .map_or(false, |pat_field| pat_field.name_ref().is_none());
535 if is_name_in_field_pat {
536 self.is_pat_or_const = None;
540 self.fill_impl_def();
543 self.is_param |= is_node::<ast::Param>(name.syntax());
546 fn classify_name_ref(&mut self, original_file: &SyntaxNode, name_ref: ast::NameRef) {
547 self.fill_impl_def();
549 self.name_ref_syntax =
550 find_node_at_offset(original_file, name_ref.syntax().text_range().start());
552 if matches!(self.completion_location, Some(ImmediateLocation::ItemList)) {
556 self.use_item_syntax =
557 self.sema.token_ancestors_with_macros(self.token.clone()).find_map(ast::Use::cast);
559 self.function_def = self
561 .token_ancestors_with_macros(self.token.clone())
562 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
563 .find_map(ast::Fn::cast);
565 let parent = match name_ref.syntax().parent() {
570 if let Some(segment) = ast::PathSegment::cast(parent.clone()) {
571 let path = segment.parent_path();
575 .and_then(ast::PathExpr::cast)
576 .and_then(|it| it.syntax().parent().and_then(ast::CallExpr::cast))
578 self.is_macro_call = path.syntax().parent().and_then(ast::MacroCall::cast).is_some();
579 self.is_pattern_call =
580 path.syntax().parent().and_then(ast::TupleStructPat::cast).is_some();
582 self.is_path_type = path.syntax().parent().and_then(ast::PathType::cast).is_some();
583 self.has_type_args = segment.generic_arg_list().is_some();
585 if let Some(path) = path_or_use_tree_qualifier(&path) {
586 self.path_qual = path
589 find_node_with_range::<ast::PathSegment>(
591 it.syntax().text_range(),
594 .map(|it| it.parent_path());
598 if let Some(segment) = path.segment() {
599 if segment.coloncolon_token().is_some() {
604 self.is_trivial_path = true;
606 // Find either enclosing expr statement (thing with `;`) or a
607 // block. If block, check that we are the last expr.
608 self.can_be_stmt = name_ref
612 if let Some(stmt) = ast::ExprStmt::cast(node.clone()) {
613 return Some(stmt.syntax().text_range() == name_ref.syntax().text_range());
615 if let Some(block) = ast::BlockExpr::cast(node) {
617 block.tail_expr().map(|e| e.syntax().text_range())
618 == Some(name_ref.syntax().text_range()),
624 self.is_expr = path.syntax().parent().and_then(ast::PathExpr::cast).is_some();
627 matches!(self.completion_location, Some(ImmediateLocation::MethodCall { .. }));
631 fn find_node_with_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
632 syntax.covering_element(range).ancestors().find_map(N::cast)
635 fn is_node<N: AstNode>(node: &SyntaxNode) -> bool {
636 match node.ancestors().find_map(N::cast) {
638 Some(n) => n.syntax().text_range() == node.text_range(),
642 fn path_or_use_tree_qualifier(path: &ast::Path) -> Option<ast::Path> {
643 if let Some(qual) = path.qualifier() {
646 let use_tree_list = path.syntax().ancestors().find_map(ast::UseTreeList::cast)?;
647 let use_tree = use_tree_list.syntax().parent().and_then(ast::UseTree::cast)?;
653 use expect_test::{expect, Expect};
656 use crate::test_utils::{position, TEST_CONFIG};
658 use super::CompletionContext;
660 fn check_expected_type_and_name(ra_fixture: &str, expect: Expect) {
661 let (db, pos) = position(ra_fixture);
662 let completion_context = CompletionContext::new(&db, pos, &TEST_CONFIG).unwrap();
664 let ty = completion_context
666 .map(|t| t.display_test(&db).to_string())
667 .unwrap_or("?".to_owned());
669 let name = completion_context
671 .map_or_else(|| "?".to_owned(), |name| name.to_string());
673 expect.assert_eq(&format!("ty: {}, name: {}", ty, name));
677 fn expected_type_let_without_leading_char() {
678 cov_mark::check!(expected_type_let_without_leading_char);
679 check_expected_type_and_name(
685 expect![[r#"ty: u32, name: x"#]],
690 fn expected_type_let_with_leading_char() {
691 cov_mark::check!(expected_type_let_with_leading_char);
692 check_expected_type_and_name(
698 expect![[r#"ty: u32, name: x"#]],
703 fn expected_type_let_pat() {
704 check_expected_type_and_name(
710 expect![[r#"ty: u32, name: ?"#]],
712 check_expected_type_and_name(
718 expect![[r#"ty: u32, name: ?"#]],
723 fn expected_type_fn_param_without_leading_char() {
724 cov_mark::check!(expected_type_fn_param_without_leading_char);
725 check_expected_type_and_name(
733 expect![[r#"ty: u32, name: x"#]],
738 fn expected_type_fn_param_with_leading_char() {
739 cov_mark::check!(expected_type_fn_param_with_leading_char);
740 check_expected_type_and_name(
748 expect![[r#"ty: u32, name: x"#]],
753 fn expected_type_struct_field_without_leading_char() {
754 cov_mark::check!(expected_type_struct_field_without_leading_char);
755 check_expected_type_and_name(
757 struct Foo { a: u32 }
762 expect![[r#"ty: u32, name: a"#]],
767 fn expected_type_generic_struct_field() {
768 check_expected_type_and_name(
770 struct Foo<T> { a: T }
771 fn foo() -> Foo<u32> {
775 expect![[r#"ty: u32, name: a"#]],
780 fn expected_type_struct_field_with_leading_char() {
781 cov_mark::check!(expected_type_struct_field_with_leading_char);
782 check_expected_type_and_name(
784 struct Foo { a: u32 }
789 expect![[r#"ty: u32, name: a"#]],
794 fn expected_type_match_arm_without_leading_char() {
795 cov_mark::check!(expected_type_match_arm_without_leading_char);
796 check_expected_type_and_name(
803 expect![[r#"ty: E, name: ?"#]],
808 fn expected_type_match_arm_with_leading_char() {
809 cov_mark::check!(expected_type_match_arm_with_leading_char);
810 check_expected_type_and_name(
817 expect![[r#"ty: E, name: ?"#]],
822 fn expected_type_if_let_without_leading_char() {
823 cov_mark::check!(expected_type_if_let_without_leading_char);
824 check_expected_type_and_name(
826 enum Foo { Bar, Baz, Quux }
833 expect![[r#"ty: Foo, name: ?"#]],
838 fn expected_type_if_let_with_leading_char() {
839 cov_mark::check!(expected_type_if_let_with_leading_char);
840 check_expected_type_and_name(
842 enum Foo { Bar, Baz, Quux }
849 expect![[r#"ty: Foo, name: ?"#]],
854 fn expected_type_fn_ret_without_leading_char() {
855 cov_mark::check!(expected_type_fn_ret_without_leading_char);
856 check_expected_type_and_name(
862 expect![[r#"ty: u32, name: ?"#]],
867 fn expected_type_fn_ret_with_leading_char() {
868 cov_mark::check!(expected_type_fn_ret_with_leading_char);
869 check_expected_type_and_name(
875 expect![[r#"ty: u32, name: ?"#]],
880 fn expected_type_fn_ret_fn_ref_fully_typed() {
881 check_expected_type_and_name(
887 expect![[r#"ty: u32, name: ?"#]],
892 fn expected_type_closure_param_return() {
893 // FIXME: make this work with `|| $0`
894 check_expected_type_and_name(
900 fn bar(f: impl FnOnce() -> u32) {}
902 trait FnOnce { type Output; }
904 expect![[r#"ty: u32, name: ?"#]],
909 fn expected_type_generic_function() {
910 check_expected_type_and_name(
918 expect![[r#"ty: u32, name: t"#]],
923 fn expected_type_generic_method() {
924 check_expected_type_and_name(
932 fn bar(self, t: T) {}
935 expect![[r#"ty: u32, name: t"#]],