1 //! Completion of paths, i.e. `some::prefix::$0`.
5 use hir::{ScopeDef, Trait};
6 use rustc_hash::FxHashSet;
7 use syntax::{ast, AstNode};
10 context::{PathCompletionContext, PathKind},
11 patterns::ImmediateLocation,
12 CompletionContext, Completions,
15 pub(crate) fn complete_qualified_path(acc: &mut Completions, ctx: &CompletionContext) {
16 if ctx.is_path_disallowed() || ctx.has_impl_or_trait_prev_sibling() {
19 let (path, use_tree_parent, kind) = match ctx.path_context {
20 // let ... else, syntax would come in really handy here right now
21 Some(PathCompletionContext {
22 qualifier: Some(ref qualifier),
26 }) => (qualifier, use_tree_parent, kind),
30 // special case `<_>::$0` as this doesn't resolve to anything.
31 if path.qualifier().is_none() {
33 path.segment().and_then(|it| it.kind()),
34 Some(ast::PathSegmentKind::Type {
35 type_ref: Some(ast::Type::InferType(_)),
39 cov_mark::hit!(completion_type_anchor_empty);
43 .flat_map(|it| Trait::from(it).items(ctx.sema.db))
44 .for_each(|item| add_assoc_item(acc, ctx, item));
49 let resolution = match ctx.sema.resolve_path(path) {
54 let context_module = ctx.module;
56 match ctx.completion_location {
57 Some(ImmediateLocation::ItemList | ImmediateLocation::Trait | ImmediateLocation::Impl) => {
58 if let hir::PathResolution::Def(hir::ModuleDef::Module(module)) = resolution {
59 for (name, def) in module.scope(ctx.db, context_module) {
60 if let ScopeDef::MacroDef(macro_def) = def {
61 if macro_def.is_fn_like() {
62 acc.add_macro(ctx, Some(name.clone()), macro_def);
65 if let ScopeDef::ModuleDef(hir::ModuleDef::Module(_)) = def {
66 acc.add_resolution(ctx, name, def);
76 Some(PathKind::Vis { .. }) => {
77 if let hir::PathResolution::Def(hir::ModuleDef::Module(module)) = resolution {
78 if let Some(current_module) = ctx.module {
79 if let Some(next) = current_module
82 .take_while(|&it| it != module)
85 if let Some(name) = next.name(ctx.db) {
86 acc.add_resolution(ctx, name, ScopeDef::ModuleDef(next.into()));
93 Some(PathKind::Attr) => {
94 if let hir::PathResolution::Def(hir::ModuleDef::Module(module)) = resolution {
95 for (name, def) in module.scope(ctx.db, context_module) {
96 let add_resolution = match def {
97 ScopeDef::MacroDef(mac) => mac.is_attr(),
98 ScopeDef::ModuleDef(hir::ModuleDef::Module(_)) => true,
102 acc.add_resolution(ctx, name, def);
108 Some(PathKind::Use) => {
109 if iter::successors(Some(path.clone()), |p| p.qualifier())
110 .all(|p| p.segment().and_then(|s| s.super_token()).is_some())
112 acc.add_keyword(ctx, "super::");
114 // only show `self` in a new use-tree when the qualifier doesn't end in self
117 path.segment().and_then(|it| it.kind()),
118 Some(ast::PathSegmentKind::SelfKw)
121 acc.add_keyword(ctx, "self");
127 if !matches!(kind, Some(PathKind::Pat)) {
128 // Add associated types on type parameters and `Self`.
129 resolution.assoc_type_shorthand_candidates(ctx.db, |_, alias| {
130 acc.add_type_alias(ctx, alias);
136 hir::PathResolution::Def(hir::ModuleDef::Module(module)) => {
137 let module_scope = module.scope(ctx.db, context_module);
138 for (name, def) in module_scope {
139 if let Some(PathKind::Use) = kind {
140 if let ScopeDef::Unknown = def {
141 if let Some(ast::NameLike::NameRef(name_ref)) = ctx.name_syntax.as_ref() {
142 if name_ref.syntax().text() == name.to_smol_str().as_str() {
143 // for `use self::foo$0`, don't suggest `foo` as a completion
144 cov_mark::hit!(dont_complete_current_use);
151 let add_resolution = match def {
152 // Don't suggest attribute macros and derives.
153 ScopeDef::MacroDef(mac) => mac.is_fn_like(),
154 // no values in type places
156 hir::ModuleDef::Function(_)
157 | hir::ModuleDef::Variant(_)
158 | hir::ModuleDef::Static(_),
160 | ScopeDef::Local(_) => !ctx.expects_type(),
161 // unless its a constant in a generic arg list position
162 ScopeDef::ModuleDef(hir::ModuleDef::Const(_)) => {
163 !ctx.expects_type() || ctx.expects_generic_arg()
169 acc.add_resolution(ctx, name, def);
173 hir::PathResolution::Def(
174 def @ (hir::ModuleDef::Adt(_)
175 | hir::ModuleDef::TypeAlias(_)
176 | hir::ModuleDef::BuiltinType(_)),
178 if let hir::ModuleDef::Adt(hir::Adt::Enum(e)) = def {
179 add_enum_variants(acc, ctx, e);
182 hir::ModuleDef::Adt(adt) => adt.ty(ctx.db),
183 hir::ModuleDef::TypeAlias(a) => {
184 let ty = a.ty(ctx.db);
185 if let Some(hir::Adt::Enum(e)) = ty.as_adt() {
186 cov_mark::hit!(completes_variant_through_alias);
187 add_enum_variants(acc, ctx, e);
191 hir::ModuleDef::BuiltinType(builtin) => {
192 let module = match ctx.module {
196 cov_mark::hit!(completes_primitive_assoc_const);
197 builtin.ty(ctx.db, module)
202 // XXX: For parity with Rust bug #22519, this does not complete Ty::AssocType.
203 // (where AssocType is defined on a trait, not an inherent impl)
205 let krate = ctx.krate;
206 if let Some(krate) = krate {
207 let traits_in_scope = ctx.scope.visible_traits();
208 ty.iterate_path_candidates(
215 add_assoc_item(acc, ctx, item);
220 // Iterate assoc types separately
221 ty.iterate_assoc_items(ctx.db, krate, |item| {
222 if let hir::AssocItem::TypeAlias(ty) = item {
223 acc.add_type_alias(ctx, ty)
229 hir::PathResolution::Def(hir::ModuleDef::Trait(t)) => {
230 // Handles `Trait::assoc` as well as `<Ty as Trait>::assoc`.
231 for item in t.items(ctx.db) {
232 add_assoc_item(acc, ctx, item);
235 hir::PathResolution::TypeParam(_) | hir::PathResolution::SelfType(_) => {
236 if let Some(krate) = ctx.krate {
237 let ty = match resolution {
238 hir::PathResolution::TypeParam(param) => param.ty(ctx.db),
239 hir::PathResolution::SelfType(impl_def) => impl_def.self_ty(ctx.db),
243 if let Some(hir::Adt::Enum(e)) = ty.as_adt() {
244 add_enum_variants(acc, ctx, e);
247 let traits_in_scope = ctx.scope.visible_traits();
248 let mut seen = FxHashSet::default();
249 ty.iterate_path_candidates(
256 // We might iterate candidates of a trait multiple times here, so deduplicate
258 if seen.insert(item) {
259 add_assoc_item(acc, ctx, item);
266 hir::PathResolution::Macro(mac) => acc.add_macro(ctx, None, mac),
271 fn add_assoc_item(acc: &mut Completions, ctx: &CompletionContext, item: hir::AssocItem) {
273 hir::AssocItem::Function(func) if !ctx.expects_type() => acc.add_function(ctx, func, None),
274 hir::AssocItem::Const(ct) if !ctx.expects_type() || ctx.expects_generic_arg() => {
275 acc.add_const(ctx, ct)
277 hir::AssocItem::TypeAlias(ty) => acc.add_type_alias(ctx, ty),
282 fn add_enum_variants(acc: &mut Completions, ctx: &CompletionContext, e: hir::Enum) {
283 if ctx.expects_type() {
286 e.variants(ctx.db).into_iter().for_each(|variant| acc.add_enum_variant(ctx, variant, None));
291 use expect_test::{expect, Expect};
293 use crate::tests::{check_edit, completion_list_no_kw};
295 fn check(ra_fixture: &str, expect: Expect) {
296 let actual = completion_list_no_kw(ra_fixture);
297 expect.assert_eq(&actual);
301 fn associated_item_visibility() {
304 //- /lib.rs crate:lib new_source_root:library
308 pub fn public_method() { }
309 fn private_method() { }
310 pub type PublicType = u32;
311 type PrivateType = u32;
312 pub const PUBLIC_CONST: u32 = 1;
313 const PRIVATE_CONST: u32 = 1;
316 //- /main.rs crate:main deps:lib new_source_root:local
317 fn foo() { let _ = lib::S::$0 }
320 fn public_method() fn()
321 ct PUBLIC_CONST pub const PUBLIC_CONST: u32
322 ta PublicType pub type PublicType = u32
328 fn completes_union_associated_method() {
332 impl U { fn m() { } }
334 fn foo() { let _ = U::$0 }
343 fn completes_trait_associated_method_1() {
346 trait Trait { fn m(); }
348 fn foo() { let _ = Trait::$0 }
351 fn m() (as Trait) fn()
357 fn completes_trait_associated_method_2() {
360 trait Trait { fn m(); }
365 fn foo() { let _ = S::$0 }
368 fn m() (as Trait) fn()
374 fn completes_trait_associated_method_3() {
377 trait Trait { fn m(); }
382 fn foo() { let _ = <S as Trait>::$0 }
385 fn m() (as Trait) fn()
391 fn completes_ty_param_assoc_ty() {
405 fn submethod(&self) {}
408 fn foo<T: Sub>() { T::$0 }
411 ta SubTy (as Sub) type SubTy
412 ta Ty (as Super) type Ty
413 ct C2 (as Sub) const C2: ()
414 fn subfunc() (as Sub) fn()
415 me submethod(…) (as Sub) fn(&self)
416 ct CONST (as Super) const CONST: u8
417 fn func() (as Super) fn()
418 me method(…) (as Super) fn(&self)
424 fn completes_self_param_assoc_ty() {
438 fn submethod(&self) {}
442 impl<T> Super for Wrap<T> {}
443 impl<T> Sub for Wrap<T> {
445 // Should be able to assume `Self: Sub + Super`
451 ta SubTy (as Sub) type SubTy
452 ta Ty (as Super) type Ty
453 ct CONST (as Super) const CONST: u8
454 fn func() (as Super) fn()
455 me method(…) (as Super) fn(&self)
456 ct C2 (as Sub) const C2: ()
457 fn subfunc() (as Sub) fn()
458 me submethod(…) (as Sub) fn(&self)
464 fn completes_type_alias() {
468 impl S { fn foo() {} }
470 impl T { fn bar() {} }
482 fn completes_qualified_macros() {
486 macro_rules! foo { () => {} }
488 fn main() { let _ = crate::$0 }
492 ma foo!(…) #[macro_export] macro_rules! foo
498 fn does_not_complete_non_fn_macros() {
502 #[rustc_builtin_macro]
513 #[rustc_builtin_macro]
524 fn completes_reexported_items_under_correct_name() {
527 fn foo() { self::m::$0 }
530 pub use super::p::wrong_fn as right_fn;
531 pub use super::p::WRONG_CONST as RIGHT_CONST;
532 pub use super::p::WrongType as RightType;
536 const WRONG_CONST: u32 = 1;
550 fn foo() { self::m::$0 }
553 pub use super::p::wrong_fn as right_fn;
554 pub use super::p::WRONG_CONST as RIGHT_CONST;
555 pub use super::p::WrongType as RightType;
559 const WRONG_CONST: u32 = 1;
564 fn foo() { self::m::RightType }
567 pub use super::p::wrong_fn as right_fn;
568 pub use super::p::WRONG_CONST as RIGHT_CONST;
569 pub use super::p::WrongType as RightType;
573 const WRONG_CONST: u32 = 1;
581 fn completes_in_simple_macro_call() {
584 macro_rules! m { ($e:expr) => { $e } }
585 fn main() { m!(self::f$0); }
596 fn function_mod_share_name() {
599 fn foo() { self::m::$0 }
614 fn completes_hashmap_new() {
618 struct HashMap<K, V, S = RandomState> {}
620 impl<K, V> HashMap<K, V, RandomState> {
621 pub fn new() -> HashMap<K, V, RandomState> { }
628 fn new() fn() -> HashMap<K, V, RandomState>
634 fn dont_complete_attr() {
637 mod foo { pub struct Foo; }
646 fn completes_variant_through_self() {
669 fn completes_primitive_assoc_const() {
670 cov_mark::check!(completes_primitive_assoc_const);
673 //- /lib.rs crate:lib deps:core
678 //- /core.rs crate:core
681 pub const MAX: Self = 255;
687 ct MAX pub const MAX: Self
694 fn completes_variant_through_alias() {
695 cov_mark::check!(completes_variant_through_alias);
713 fn respects_doc_hidden() {
714 cov_mark::check!(qualified_path_doc_hidden);
717 //- /lib.rs crate:lib deps:dep
722 //- /dep.rs crate:dep
743 fn type_anchor_empty() {
744 cov_mark::check!(completion_type_anchor_empty);
761 fn foo() (as Foo) fn() -> Self