mirror of
https://github.com/rust-lang/rust-analyzer.git
synced 2025-10-02 22:54:58 +00:00
Merge assoc_items_only
and exclude_import_kinds
into assoc_mode
This commit is contained in:
parent
97b725e269
commit
8cd4e9f7ec
5 changed files with 49 additions and 143 deletions
|
@ -13,7 +13,7 @@ use syntax::{
|
|||
|
||||
use crate::{
|
||||
helpers::item_name,
|
||||
items_locator::{self, AssocItemSearch, DEFAULT_QUERY_SEARCH_LIMIT},
|
||||
items_locator::{self, AssocSearchMode, DEFAULT_QUERY_SEARCH_LIMIT},
|
||||
RootDatabase,
|
||||
};
|
||||
|
||||
|
@ -317,7 +317,7 @@ fn path_applicable_imports(
|
|||
// * improve the associated completion item matching and/or scoring to ensure no noisy completions appear
|
||||
//
|
||||
// see also an ignored test under FIXME comment in the qualify_path.rs module
|
||||
AssocItemSearch::Exclude,
|
||||
AssocSearchMode::Exclude,
|
||||
Some(DEFAULT_QUERY_SEARCH_LIMIT.inner()),
|
||||
)
|
||||
.filter_map(|item| {
|
||||
|
@ -334,7 +334,7 @@ fn path_applicable_imports(
|
|||
sema,
|
||||
current_crate,
|
||||
path_candidate.name.clone(),
|
||||
AssocItemSearch::Include,
|
||||
AssocSearchMode::Include,
|
||||
Some(DEFAULT_QUERY_SEARCH_LIMIT.inner()),
|
||||
)
|
||||
.filter_map(|item| {
|
||||
|
@ -483,7 +483,7 @@ fn trait_applicable_items(
|
|||
sema,
|
||||
current_crate,
|
||||
trait_candidate.assoc_item_name.clone(),
|
||||
AssocItemSearch::AssocItemsOnly,
|
||||
AssocSearchMode::AssocItemsOnly,
|
||||
Some(DEFAULT_QUERY_SEARCH_LIMIT.inner()),
|
||||
)
|
||||
.filter_map(|input| item_as_assoc(db, input))
|
||||
|
|
|
@ -3,10 +3,7 @@
|
|||
//! The main reason for this module to exist is the fact that project's items and dependencies' items
|
||||
//! are located in different caches, with different APIs.
|
||||
use either::Either;
|
||||
use hir::{
|
||||
import_map::{self, ImportKind},
|
||||
AsAssocItem, Crate, ItemInNs, Semantics,
|
||||
};
|
||||
use hir::{import_map, AsAssocItem, Crate, ItemInNs, Semantics};
|
||||
use limit::Limit;
|
||||
|
||||
use crate::{imports::import_assets::NameToImport, symbol_index, RootDatabase};
|
||||
|
@ -14,23 +11,14 @@ use crate::{imports::import_assets::NameToImport, symbol_index, RootDatabase};
|
|||
/// A value to use, when uncertain which limit to pick.
|
||||
pub static DEFAULT_QUERY_SEARCH_LIMIT: Limit = Limit::new(40);
|
||||
|
||||
/// Three possible ways to search for the name in associated and/or other items.
|
||||
#[derive(Debug, Clone, Copy)]
|
||||
pub enum AssocItemSearch {
|
||||
/// Search for the name in both associated and other items.
|
||||
Include,
|
||||
/// Search for the name in other items only.
|
||||
Exclude,
|
||||
/// Search for the name in the associated items only.
|
||||
AssocItemsOnly,
|
||||
}
|
||||
pub use import_map::AssocSearchMode;
|
||||
|
||||
/// Searches for importable items with the given name in the crate and its dependencies.
|
||||
pub fn items_with_name<'a>(
|
||||
sema: &'a Semantics<'_, RootDatabase>,
|
||||
krate: Crate,
|
||||
name: NameToImport,
|
||||
assoc_item_search: AssocItemSearch,
|
||||
assoc_item_search: AssocSearchMode,
|
||||
limit: Option<usize>,
|
||||
) -> impl Iterator<Item = ItemInNs> + 'a {
|
||||
let _p = profile::span("items_with_name").detail(|| {
|
||||
|
@ -60,16 +48,8 @@ pub fn items_with_name<'a>(
|
|||
let mut local_query = symbol_index::Query::new(fuzzy_search_string.clone());
|
||||
|
||||
let mut external_query = import_map::Query::new(fuzzy_search_string.clone())
|
||||
.search_mode(import_map::SearchMode::Fuzzy);
|
||||
match assoc_item_search {
|
||||
AssocItemSearch::Include => {}
|
||||
AssocItemSearch::Exclude => {
|
||||
external_query = external_query.exclude_import_kind(ImportKind::AssociatedItem);
|
||||
}
|
||||
AssocItemSearch::AssocItemsOnly => {
|
||||
external_query = external_query.assoc_items_only();
|
||||
}
|
||||
}
|
||||
.search_mode(import_map::SearchMode::Fuzzy)
|
||||
.assoc_search_mode(assoc_item_search);
|
||||
|
||||
if fuzzy_search_string.to_lowercase() != fuzzy_search_string {
|
||||
local_query.case_sensitive();
|
||||
|
@ -91,13 +71,15 @@ pub fn items_with_name<'a>(
|
|||
fn find_items<'a>(
|
||||
sema: &'a Semantics<'_, RootDatabase>,
|
||||
krate: Crate,
|
||||
assoc_item_search: AssocItemSearch,
|
||||
assoc_item_search: AssocSearchMode,
|
||||
local_query: symbol_index::Query,
|
||||
external_query: import_map::Query,
|
||||
) -> impl Iterator<Item = ItemInNs> + 'a {
|
||||
let _p = profile::span("find_items");
|
||||
let db = sema.db;
|
||||
|
||||
// NOTE: `external_query` includes `assoc_item_search`, so we don't need to
|
||||
// filter on our own.
|
||||
let external_importables =
|
||||
krate.query_external_importables(db, external_query).map(|external_importable| {
|
||||
match external_importable {
|
||||
|
@ -110,18 +92,15 @@ fn find_items<'a>(
|
|||
let local_results = local_query
|
||||
.search(&symbol_index::crate_symbols(db, krate))
|
||||
.into_iter()
|
||||
.filter_map(|local_candidate| match local_candidate.def {
|
||||
hir::ModuleDef::Macro(macro_def) => Some(ItemInNs::Macros(macro_def)),
|
||||
def => Some(ItemInNs::from(def)),
|
||||
.filter(move |candidate| match assoc_item_search {
|
||||
AssocSearchMode::Include => true,
|
||||
AssocSearchMode::Exclude => candidate.def.as_assoc_item(db).is_none(),
|
||||
AssocSearchMode::AssocItemsOnly => candidate.def.as_assoc_item(db).is_some(),
|
||||
})
|
||||
.map(|local_candidate| match local_candidate.def {
|
||||
hir::ModuleDef::Macro(macro_def) => ItemInNs::Macros(macro_def),
|
||||
def => ItemInNs::from(def),
|
||||
});
|
||||
|
||||
external_importables.chain(local_results).filter(move |&item| match assoc_item_search {
|
||||
AssocItemSearch::Include => true,
|
||||
AssocItemSearch::Exclude => !is_assoc_item(item, sema.db),
|
||||
AssocItemSearch::AssocItemsOnly => is_assoc_item(item, sema.db),
|
||||
})
|
||||
}
|
||||
|
||||
fn is_assoc_item(item: ItemInNs, db: &RootDatabase) -> bool {
|
||||
item.as_module_def().and_then(|module_def| module_def.as_assoc_item(db)).is_some()
|
||||
external_importables.chain(local_results)
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue