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 /// Something is typed at the "top" level, in module or impl/trait.
82 pub(super) is_new_item: bool,
83 /// If this is a call (method or function) in particular, i.e. the () are already there.
84 pub(super) is_call: bool,
85 /// Like `is_call`, but for tuple patterns.
86 pub(super) is_pattern_call: bool,
87 /// If this is a macro call, i.e. the () are already there.
88 pub(super) is_macro_call: bool,
89 pub(super) is_path_type: bool,
90 pub(super) has_type_args: bool,
91 pub(super) locals: Vec<(String, Local)>,
93 pub(super) previous_token: Option<SyntaxToken>,
94 pub(super) in_loop_body: bool,
95 pub(super) incomplete_let: bool,
97 no_completion_required: bool,
100 impl<'a> CompletionContext<'a> {
102 db: &'a RootDatabase,
103 position: FilePosition,
104 config: &'a CompletionConfig,
105 ) -> Option<CompletionContext<'a>> {
106 let sema = Semantics::new(db);
108 let original_file = sema.parse(position.file_id);
110 // Insert a fake ident to get a valid parse tree. We will use this file
111 // to determine context, though the original_file will be used for
112 // actual completion.
113 let file_with_fake_ident = {
114 let parse = db.parse(position.file_id);
115 let edit = Indel::insert(position.offset, "intellijRulezz".to_string());
116 parse.reparse(&edit).tree()
118 let fake_ident_token =
119 file_with_fake_ident.syntax().token_at_offset(position.offset).right_biased().unwrap();
121 let krate = sema.to_module_def(position.file_id).map(|m| m.krate());
123 original_file.syntax().token_at_offset(position.offset).left_biased()?;
124 let token = sema.descend_into_macros(original_token.clone());
125 let scope = sema.scope_at_offset(&token, position.offset);
126 let mut locals = vec![];
127 scope.process_all_names(&mut |name, scope| {
128 if let ScopeDef::Local(local) = scope {
129 locals.push((name.to_string(), local));
132 let mut ctx = CompletionContext {
141 lifetime_allowed: false,
144 name_ref_syntax: None,
145 lifetime_syntax: None,
146 lifetime_param_syntax: None,
148 use_item_syntax: None,
150 active_parameter: ActiveParameter::at(db, position),
153 is_pat_or_const: None,
154 is_trivial_path: false,
160 is_pattern_call: false,
161 is_macro_call: false,
163 has_type_args: false,
164 previous_token: None,
166 completion_location: None,
168 no_completion_required: false,
169 incomplete_let: false,
170 attribute_under_caret: None,
174 let mut original_file = original_file.syntax().clone();
175 let mut speculative_file = file_with_fake_ident.syntax().clone();
176 let mut offset = position.offset;
177 let mut fake_ident_token = fake_ident_token;
179 // Are we inside a macro call?
180 while let (Some(actual_macro_call), Some(macro_call_with_fake_ident)) = (
181 find_node_at_offset::<ast::MacroCall>(&original_file, offset),
182 find_node_at_offset::<ast::MacroCall>(&speculative_file, offset),
184 if actual_macro_call.path().as_ref().map(|s| s.syntax().text())
185 != macro_call_with_fake_ident.path().as_ref().map(|s| s.syntax().text())
189 let speculative_args = match macro_call_with_fake_ident.token_tree() {
193 if let (Some(actual_expansion), Some(speculative_expansion)) = (
194 ctx.sema.expand(&actual_macro_call),
195 ctx.sema.speculative_expand(
201 let new_offset = speculative_expansion.1.text_range().start();
202 if new_offset > actual_expansion.text_range().end() {
205 original_file = actual_expansion;
206 speculative_file = speculative_expansion.0;
207 fake_ident_token = speculative_expansion.1;
213 ctx.fill(&original_file, speculative_file, offset);
217 /// Checks whether completions in that particular case don't make much sense.
219 /// - `fn $0` -- we expect function name, it's unlikely that "hint" will be helpful.
220 /// Exception for this case is `impl Trait for Foo`, where we would like to hint trait method names.
221 /// - `for _ i$0` -- obviously, it'll be "in" keyword.
222 pub(crate) fn no_completion_required(&self) -> bool {
223 self.no_completion_required
226 /// The range of the identifier that is being completed.
227 pub(crate) fn source_range(&self) -> TextRange {
228 // check kind of macro-expanded token, but use range of original token
229 let kind = self.token.kind();
230 if kind == IDENT || kind == LIFETIME_IDENT || kind == UNDERSCORE || kind.is_keyword() {
231 cov_mark::hit!(completes_if_prefix_is_keyword);
232 self.original_token.text_range()
233 } else if kind == CHAR {
234 // assume we are completing a lifetime but the user has only typed the '
235 cov_mark::hit!(completes_if_lifetime_without_idents);
236 TextRange::at(self.original_token.text_range().start(), TextSize::from(1))
238 TextRange::empty(self.position.offset)
242 pub(crate) fn previous_token_is(&self, kind: SyntaxKind) -> bool {
243 self.previous_token.as_ref().map_or(false, |tok| tok.kind() == kind)
246 pub(crate) fn expects_assoc_item(&self) -> bool {
248 self.completion_location,
249 Some(ImmediateLocation::Trait) | Some(ImmediateLocation::Impl)
253 pub(crate) fn has_dot_receiver(&self) -> bool {
255 &self.completion_location,
256 Some(ImmediateLocation::FieldAccess { receiver, .. }) | Some(ImmediateLocation::MethodCall { receiver })
257 if receiver.is_some()
261 pub(crate) fn dot_receiver(&self) -> Option<&ast::Expr> {
262 match &self.completion_location {
263 Some(ImmediateLocation::MethodCall { receiver })
264 | Some(ImmediateLocation::FieldAccess { receiver, .. }) => receiver.as_ref(),
269 pub(crate) fn expects_use_tree(&self) -> bool {
270 matches!(self.completion_location, Some(ImmediateLocation::Use))
273 pub(crate) fn expects_non_trait_assoc_item(&self) -> bool {
274 matches!(self.completion_location, Some(ImmediateLocation::Impl))
277 pub(crate) fn expects_item(&self) -> bool {
278 matches!(self.completion_location, Some(ImmediateLocation::ItemList))
281 // fn expects_value(&self) -> bool {
282 pub(crate) fn expects_expression(&self) -> bool {
286 pub(crate) fn has_block_expr_parent(&self) -> bool {
287 matches!(self.completion_location, Some(ImmediateLocation::BlockExpr))
290 pub(crate) fn expects_ident_pat_or_ref_expr(&self) -> bool {
292 self.completion_location,
293 Some(ImmediateLocation::IdentPat) | Some(ImmediateLocation::RefExpr)
297 pub(crate) fn expect_record_field(&self) -> bool {
298 matches!(self.completion_location, Some(ImmediateLocation::RecordField))
301 pub(crate) fn has_impl_or_trait_prev_sibling(&self) -> bool {
304 Some(ImmediatePrevSibling::ImplDefType) | Some(ImmediatePrevSibling::TraitDefName)
308 pub(crate) fn after_if(&self) -> bool {
309 matches!(self.prev_sibling, Some(ImmediatePrevSibling::IfExpr))
312 pub(crate) fn is_path_disallowed(&self) -> bool {
314 self.completion_location,
315 Some(ImmediateLocation::Attribute(_))
316 | Some(ImmediateLocation::ModDeclaration(_))
317 | Some(ImmediateLocation::RecordPat(_))
318 | Some(ImmediateLocation::RecordExpr(_))
319 ) || self.attribute_under_caret.is_some()
322 fn fill_impl_def(&mut self) {
325 .token_ancestors_with_macros(self.token.clone())
326 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
327 .find_map(ast::Impl::cast);
330 fn expected_type_and_name(&self) -> (Option<Type>, Option<NameOrNameRef>) {
331 let mut node = match self.token.parent() {
333 None => return (None, None),
338 ast::LetStmt(it) => {
339 cov_mark::hit!(expected_type_let_with_leading_char);
340 cov_mark::hit!(expected_type_let_without_leading_char);
342 .and_then(|pat| self.sema.type_of_pat(&pat))
343 .or_else(|| it.initializer().and_then(|it| self.sema.type_of_expr(&it)));
344 let name = if let Some(ast::Pat::IdentPat(ident)) = it.pat() {
345 ident.name().map(NameOrNameRef::Name)
352 ast::ArgList(_it) => {
353 cov_mark::hit!(expected_type_fn_param_with_leading_char);
354 cov_mark::hit!(expected_type_fn_param_without_leading_char);
355 ActiveParameter::at_token(
359 let name = ap.ident().map(NameOrNameRef::Name);
362 .unwrap_or((None, None))
364 ast::RecordExprFieldList(_it) => {
365 cov_mark::hit!(expected_type_struct_field_without_leading_char);
366 // wouldn't try {} be nice...
368 let expr_field = self.token.prev_sibling_or_token()?
370 .and_then(|node| ast::RecordExprField::cast(node))?;
371 let (_, _, ty) = self.sema.resolve_record_field(&expr_field)?;
374 expr_field.field_name().map(NameOrNameRef::NameRef),
376 })().unwrap_or((None, None))
378 ast::RecordExprField(it) => {
379 cov_mark::hit!(expected_type_struct_field_with_leading_char);
381 it.expr().as_ref().and_then(|e| self.sema.type_of_expr(e)),
382 it.field_name().map(NameOrNameRef::NameRef),
385 ast::MatchExpr(it) => {
386 cov_mark::hit!(expected_type_match_arm_without_leading_char);
388 .and_then(|e| self.sema.type_of_expr(&e));
392 cov_mark::hit!(expected_type_if_let_without_leading_char);
393 let ty = it.condition()
394 .and_then(|cond| cond.expr())
395 .and_then(|e| self.sema.type_of_expr(&e));
398 ast::IdentPat(it) => {
399 cov_mark::hit!(expected_type_if_let_with_leading_char);
400 cov_mark::hit!(expected_type_match_arm_with_leading_char);
401 let ty = self.sema.type_of_pat(&ast::Pat::from(it));
405 cov_mark::hit!(expected_type_fn_ret_with_leading_char);
406 cov_mark::hit!(expected_type_fn_ret_without_leading_char);
407 let def = self.sema.to_def(&it);
408 (def.map(|def| def.ret_type(self.db)), None)
410 ast::ClosureExpr(it) => {
411 let ty = self.sema.type_of_expr(&it.into());
412 ty.and_then(|ty| ty.as_callable(self.db))
413 .map(|c| (Some(c.return_type()), None))
414 .unwrap_or((None, None))
416 ast::Stmt(_it) => (None, None),
418 match node.parent() {
423 None => (None, None),
433 original_file: &SyntaxNode,
434 file_with_fake_ident: SyntaxNode,
437 let fake_ident_token = file_with_fake_ident.token_at_offset(offset).right_biased().unwrap();
438 let syntax_element = NodeOrToken::Token(fake_ident_token);
439 self.previous_token = previous_token(syntax_element.clone());
440 self.attribute_under_caret = syntax_element.ancestors().find_map(ast::Attr::cast);
441 self.no_completion_required = {
442 let inside_impl_trait_block = inside_impl_trait_block(syntax_element.clone());
443 let fn_is_prev = self.previous_token_is(T![fn]);
444 let for_is_prev2 = for_is_prev2(syntax_element.clone());
445 (fn_is_prev && !inside_impl_trait_block) || for_is_prev2
447 self.in_loop_body = is_in_loop_body(syntax_element.clone());
449 self.incomplete_let =
450 syntax_element.ancestors().take(6).find_map(ast::LetStmt::cast).map_or(false, |it| {
451 it.syntax().text_range().end() == syntax_element.text_range().end()
454 let (expected_type, expected_name) = self.expected_type_and_name();
455 self.expected_type = expected_type;
456 self.expected_name = expected_name;
458 let name_like = match find_node_at_offset(&&file_with_fake_ident, offset) {
462 self.completion_location =
463 determine_location(&self.sema, original_file, offset, &name_like);
464 self.prev_sibling = determine_prev_sibling(&name_like);
466 ast::NameLike::Lifetime(lifetime) => {
467 self.classify_lifetime(original_file, lifetime, offset);
469 ast::NameLike::NameRef(name_ref) => {
470 self.classify_name_ref(original_file, name_ref);
472 ast::NameLike::Name(name) => {
473 self.classify_name(name);
478 fn classify_lifetime(
480 original_file: &SyntaxNode,
481 lifetime: ast::Lifetime,
484 self.lifetime_syntax =
485 find_node_at_offset(original_file, lifetime.syntax().text_range().start());
486 if let Some(parent) = lifetime.syntax().parent() {
487 if parent.kind() == ERROR {
493 ast::LifetimeParam(_it) => {
494 self.lifetime_allowed = true;
495 self.lifetime_param_syntax =
496 self.sema.find_node_at_offset_with_macros(original_file, offset);
498 ast::BreakExpr(_it) => self.is_label_ref = true,
499 ast::ContinueExpr(_it) => self.is_label_ref = true,
500 ast::Label(_it) => (),
501 _ => self.lifetime_allowed = true,
507 fn classify_name(&mut self, name: ast::Name) {
508 if let Some(bind_pat) = name.syntax().parent().and_then(ast::IdentPat::cast) {
509 self.is_pat_or_const = Some(PatternRefutability::Refutable);
510 // if any of these is here our bind pat can't be a const pat anymore
511 let complex_ident_pat = bind_pat.at_token().is_some()
512 || bind_pat.ref_token().is_some()
513 || bind_pat.mut_token().is_some();
514 if complex_ident_pat {
515 self.is_pat_or_const = None;
517 let irrefutable_pat = bind_pat.syntax().ancestors().find_map(|node| {
520 ast::LetStmt(it) => Some(it.pat()),
521 ast::Param(it) => Some(it.pat()),
526 if let Some(Some(pat)) = irrefutable_pat {
527 // This check is here since we could be inside a pattern in the initializer expression of the let statement.
528 if pat.syntax().text_range().contains_range(bind_pat.syntax().text_range()) {
529 self.is_pat_or_const = Some(PatternRefutability::Irrefutable);
533 let is_name_in_field_pat = bind_pat
536 .and_then(ast::RecordPatField::cast)
537 .map_or(false, |pat_field| pat_field.name_ref().is_none());
538 if is_name_in_field_pat {
539 self.is_pat_or_const = None;
543 self.fill_impl_def();
546 self.is_param |= is_node::<ast::Param>(name.syntax());
549 fn classify_name_ref(&mut self, original_file: &SyntaxNode, name_ref: ast::NameRef) {
550 self.fill_impl_def();
552 self.name_ref_syntax =
553 find_node_at_offset(original_file, name_ref.syntax().text_range().start());
555 let name_range = name_ref.syntax().text_range();
556 let top_node = name_ref
559 .take_while(|it| it.text_range() == name_range)
563 if matches!(top_node.parent().map(|it| it.kind()), Some(SOURCE_FILE) | Some(ITEM_LIST)) {
564 self.is_new_item = true;
568 self.use_item_syntax =
569 self.sema.token_ancestors_with_macros(self.token.clone()).find_map(ast::Use::cast);
571 self.function_def = self
573 .token_ancestors_with_macros(self.token.clone())
574 .take_while(|it| it.kind() != SOURCE_FILE && it.kind() != MODULE)
575 .find_map(ast::Fn::cast);
577 let parent = match name_ref.syntax().parent() {
582 if let Some(segment) = ast::PathSegment::cast(parent.clone()) {
583 let path = segment.parent_path();
587 .and_then(ast::PathExpr::cast)
588 .and_then(|it| it.syntax().parent().and_then(ast::CallExpr::cast))
590 self.is_macro_call = path.syntax().parent().and_then(ast::MacroCall::cast).is_some();
591 self.is_pattern_call =
592 path.syntax().parent().and_then(ast::TupleStructPat::cast).is_some();
594 self.is_path_type = path.syntax().parent().and_then(ast::PathType::cast).is_some();
595 self.has_type_args = segment.generic_arg_list().is_some();
597 if let Some(path) = path_or_use_tree_qualifier(&path) {
598 self.path_qual = path
601 find_node_with_range::<ast::PathSegment>(
603 it.syntax().text_range(),
606 .map(|it| it.parent_path());
610 if let Some(segment) = path.segment() {
611 if segment.coloncolon_token().is_some() {
616 self.is_trivial_path = true;
618 // Find either enclosing expr statement (thing with `;`) or a
619 // block. If block, check that we are the last expr.
620 self.can_be_stmt = name_ref
624 if let Some(stmt) = ast::ExprStmt::cast(node.clone()) {
625 return Some(stmt.syntax().text_range() == name_ref.syntax().text_range());
627 if let Some(block) = ast::BlockExpr::cast(node) {
629 block.tail_expr().map(|e| e.syntax().text_range())
630 == Some(name_ref.syntax().text_range()),
636 self.is_expr = path.syntax().parent().and_then(ast::PathExpr::cast).is_some();
639 matches!(self.completion_location, Some(ImmediateLocation::MethodCall { .. }));
643 fn find_node_with_range<N: AstNode>(syntax: &SyntaxNode, range: TextRange) -> Option<N> {
644 syntax.covering_element(range).ancestors().find_map(N::cast)
647 fn is_node<N: AstNode>(node: &SyntaxNode) -> bool {
648 match node.ancestors().find_map(N::cast) {
650 Some(n) => n.syntax().text_range() == node.text_range(),
654 fn path_or_use_tree_qualifier(path: &ast::Path) -> Option<ast::Path> {
655 if let Some(qual) = path.qualifier() {
658 let use_tree_list = path.syntax().ancestors().find_map(ast::UseTreeList::cast)?;
659 let use_tree = use_tree_list.syntax().parent().and_then(ast::UseTree::cast)?;
665 use expect_test::{expect, Expect};
668 use crate::test_utils::{position, TEST_CONFIG};
670 use super::CompletionContext;
672 fn check_expected_type_and_name(ra_fixture: &str, expect: Expect) {
673 let (db, pos) = position(ra_fixture);
674 let completion_context = CompletionContext::new(&db, pos, &TEST_CONFIG).unwrap();
676 let ty = completion_context
678 .map(|t| t.display_test(&db).to_string())
679 .unwrap_or("?".to_owned());
681 let name = completion_context
683 .map_or_else(|| "?".to_owned(), |name| name.to_string());
685 expect.assert_eq(&format!("ty: {}, name: {}", ty, name));
689 fn expected_type_let_without_leading_char() {
690 cov_mark::check!(expected_type_let_without_leading_char);
691 check_expected_type_and_name(
697 expect![[r#"ty: u32, name: x"#]],
702 fn expected_type_let_with_leading_char() {
703 cov_mark::check!(expected_type_let_with_leading_char);
704 check_expected_type_and_name(
710 expect![[r#"ty: u32, name: x"#]],
715 fn expected_type_let_pat() {
716 check_expected_type_and_name(
722 expect![[r#"ty: u32, name: ?"#]],
724 check_expected_type_and_name(
730 expect![[r#"ty: u32, name: ?"#]],
735 fn expected_type_fn_param_without_leading_char() {
736 cov_mark::check!(expected_type_fn_param_without_leading_char);
737 check_expected_type_and_name(
745 expect![[r#"ty: u32, name: x"#]],
750 fn expected_type_fn_param_with_leading_char() {
751 cov_mark::check!(expected_type_fn_param_with_leading_char);
752 check_expected_type_and_name(
760 expect![[r#"ty: u32, name: x"#]],
765 fn expected_type_struct_field_without_leading_char() {
766 cov_mark::check!(expected_type_struct_field_without_leading_char);
767 check_expected_type_and_name(
769 struct Foo { a: u32 }
774 expect![[r#"ty: u32, name: a"#]],
779 fn expected_type_generic_struct_field() {
780 check_expected_type_and_name(
782 struct Foo<T> { a: T }
783 fn foo() -> Foo<u32> {
787 expect![[r#"ty: u32, name: a"#]],
792 fn expected_type_struct_field_with_leading_char() {
793 cov_mark::check!(expected_type_struct_field_with_leading_char);
794 check_expected_type_and_name(
796 struct Foo { a: u32 }
801 expect![[r#"ty: u32, name: a"#]],
806 fn expected_type_match_arm_without_leading_char() {
807 cov_mark::check!(expected_type_match_arm_without_leading_char);
808 check_expected_type_and_name(
815 expect![[r#"ty: E, name: ?"#]],
820 fn expected_type_match_arm_with_leading_char() {
821 cov_mark::check!(expected_type_match_arm_with_leading_char);
822 check_expected_type_and_name(
829 expect![[r#"ty: E, name: ?"#]],
834 fn expected_type_if_let_without_leading_char() {
835 cov_mark::check!(expected_type_if_let_without_leading_char);
836 check_expected_type_and_name(
838 enum Foo { Bar, Baz, Quux }
845 expect![[r#"ty: Foo, name: ?"#]],
850 fn expected_type_if_let_with_leading_char() {
851 cov_mark::check!(expected_type_if_let_with_leading_char);
852 check_expected_type_and_name(
854 enum Foo { Bar, Baz, Quux }
861 expect![[r#"ty: Foo, name: ?"#]],
866 fn expected_type_fn_ret_without_leading_char() {
867 cov_mark::check!(expected_type_fn_ret_without_leading_char);
868 check_expected_type_and_name(
874 expect![[r#"ty: u32, name: ?"#]],
879 fn expected_type_fn_ret_with_leading_char() {
880 cov_mark::check!(expected_type_fn_ret_with_leading_char);
881 check_expected_type_and_name(
887 expect![[r#"ty: u32, name: ?"#]],
892 fn expected_type_fn_ret_fn_ref_fully_typed() {
893 check_expected_type_and_name(
899 expect![[r#"ty: u32, name: ?"#]],
904 fn expected_type_closure_param_return() {
905 // FIXME: make this work with `|| $0`
906 check_expected_type_and_name(
912 fn bar(f: impl FnOnce() -> u32) {}
914 trait FnOnce { type Output; }
916 expect![[r#"ty: u32, name: ?"#]],
921 fn expected_type_generic_function() {
922 check_expected_type_and_name(
930 expect![[r#"ty: u32, name: t"#]],
935 fn expected_type_generic_method() {
936 check_expected_type_and_name(
944 fn bar(self, t: T) {}
947 expect![[r#"ty: u32, name: t"#]],