Better query api and fuzzy search

This commit is contained in:
Kirill Bulatov 2020-12-28 14:24:13 +02:00
parent 0e48cd0c3c
commit c4995cfbd5
3 changed files with 47 additions and 41 deletions

View file

@ -135,7 +135,7 @@ fn fuzzy_completion(acc: &mut Completions, ctx: &CompletionContext) -> Option<()
ctx.krate?, ctx.krate?,
Some(100), Some(100),
&potential_import_name, &potential_import_name,
false, true,
) )
.filter_map(|import_candidate| { .filter_map(|import_candidate| {
Some(match import_candidate { Some(match import_candidate {

View file

@ -156,7 +156,8 @@ impl ImportMap {
let start = last_batch_start; let start = last_batch_start;
last_batch_start = idx + 1; last_batch_start = idx + 1;
let key = fst_string(&importables[start].1.path); let key = fst_path(&importables[start].1.path);
builder.insert(key, start as u64).unwrap(); builder.insert(key, start as u64).unwrap();
} }
@ -212,15 +213,15 @@ impl fmt::Debug for ImportMap {
} }
} }
fn fst_string<T: ToString>(t: &T) -> String { fn fst_path(path: &ImportPath) -> String {
let mut s = t.to_string(); let mut s = path.to_string();
s.make_ascii_lowercase(); s.make_ascii_lowercase();
s s
} }
fn cmp((_, lhs): &(&ItemInNs, &ImportInfo), (_, rhs): &(&ItemInNs, &ImportInfo)) -> Ordering { fn cmp((_, lhs): &(&ItemInNs, &ImportInfo), (_, rhs): &(&ItemInNs, &ImportInfo)) -> Ordering {
let lhs_str = fst_string(&lhs.path); let lhs_str = fst_path(&lhs.path);
let rhs_str = fst_string(&rhs.path); let rhs_str = fst_path(&rhs.path);
lhs_str.cmp(&rhs_str) lhs_str.cmp(&rhs_str)
} }
@ -237,14 +238,20 @@ pub enum ImportKind {
BuiltinType, BuiltinType,
} }
/// todo kb
#[derive(Debug)]
pub enum SearchMode {
Equals,
Contains,
Fuzzy,
}
#[derive(Debug)] #[derive(Debug)]
pub struct Query { pub struct Query {
query: String, query: String,
lowercased: String, lowercased: String,
// TODO kb use enums instead?
name_only: bool, name_only: bool,
name_end: bool, search_mode: SearchMode,
strict_include: bool,
case_sensitive: bool, case_sensitive: bool,
limit: usize, limit: usize,
exclude_import_kinds: FxHashSet<ImportKind>, exclude_import_kinds: FxHashSet<ImportKind>,
@ -253,29 +260,23 @@ pub struct Query {
impl Query { impl Query {
pub fn new(query: &str) -> Self { pub fn new(query: &str) -> Self {
Self { Self {
lowercased: query.to_lowercase(),
query: query.to_string(), query: query.to_string(),
lowercased: query.to_lowercase(),
name_only: false, name_only: false,
name_end: false, search_mode: SearchMode::Contains,
strict_include: false,
case_sensitive: false, case_sensitive: false,
limit: usize::max_value(), limit: usize::max_value(),
exclude_import_kinds: FxHashSet::default(), exclude_import_kinds: FxHashSet::default(),
} }
} }
pub fn name_end(self) -> Self {
Self { name_end: true, ..self }
}
/// todo kb
pub fn name_only(self) -> Self { pub fn name_only(self) -> Self {
Self { name_only: true, ..self } Self { name_only: true, ..self }
} }
/// todo kb /// todo kb
pub fn strict_include(self) -> Self { pub fn search_mode(self, search_mode: SearchMode) -> Self {
Self { strict_include: true, ..self } Self { search_mode, ..self }
} }
/// Limits the returned number of items to `limit`. /// Limits the returned number of items to `limit`.
@ -309,18 +310,24 @@ fn contains_query(query: &Query, input_path: &ImportPath, enforce_lowercase: boo
let query_string = let query_string =
if !enforce_lowercase && query.case_sensitive { &query.query } else { &query.lowercased }; if !enforce_lowercase && query.case_sensitive { &query.query } else { &query.lowercased };
if query.strict_include { match query.search_mode {
if query.name_end { SearchMode::Equals => &input == query_string,
&input == query_string SearchMode::Contains => input.contains(query_string),
} else { SearchMode::Fuzzy => {
input.contains(query_string) let mut unchecked_query_chars = query_string.chars();
let mut mismatching_query_char = unchecked_query_chars.next();
for input_char in input.chars() {
match mismatching_query_char {
None => return true,
Some(matching_query_char) if matching_query_char == input_char => {
mismatching_query_char = unchecked_query_chars.next();
}
_ => (),
}
}
mismatching_query_char.is_none()
} }
} else if query.name_end {
input.ends_with(query_string)
} else {
let input_chars = input.chars().collect::<FxHashSet<_>>();
// TODO kb actually check for the order and the quantity
query_string.chars().all(|query_char| input_chars.contains(&query_char))
} }
} }
@ -358,14 +365,14 @@ pub fn search_dependencies<'a>(
continue; continue;
} }
let common_importables_path_fst = fst_string(common_importables_path); let common_importables_path_fst = fst_path(common_importables_path);
// Add the items from this `ModPath` group. Those are all subsequent items in // Add the items from this `ModPath` group. Those are all subsequent items in
// `importables` whose paths match `path`. // `importables` whose paths match `path`.
let iter = importables let iter = importables
.iter() .iter()
.copied() .copied()
.take_while(|item| { .take_while(|item| {
common_importables_path_fst == fst_string(&import_map.map[item].path) common_importables_path_fst == fst_path(&import_map.map[item].path)
}) })
.filter(|&item| match item_import_kind(item) { .filter(|&item| match item_import_kind(item) {
Some(import_kind) => !query.exclude_import_kinds.contains(&import_kind), Some(import_kind) => !query.exclude_import_kinds.contains(&import_kind),
@ -741,7 +748,7 @@ mod tests {
check_search( check_search(
ra_fixture, ra_fixture,
"main", "main",
Query::new("fmt"), Query::new("fmt").search_mode(SearchMode::Fuzzy),
expect![[r#" expect![[r#"
dep::fmt (t) dep::fmt (t)
dep::Fmt (t) dep::Fmt (t)
@ -756,7 +763,7 @@ mod tests {
check_search( check_search(
ra_fixture, ra_fixture,
"main", "main",
Query::new("fmt").name_only().strict_include(), Query::new("fmt").name_only().search_mode(SearchMode::Equals),
expect![[r#" expect![[r#"
dep::fmt (t) dep::fmt (t)
dep::Fmt (t) dep::Fmt (t)

View file

@ -30,8 +30,7 @@ pub fn find_exact_imports<'a>(
import_map::Query::new(name_to_import) import_map::Query::new(name_to_import)
.limit(40) .limit(40)
.name_only() .name_only()
.name_end() .search_mode(import_map::SearchMode::Equals)
.strict_include()
.case_sensitive(), .case_sensitive(),
) )
} }
@ -41,14 +40,14 @@ pub fn find_similar_imports<'a>(
krate: Crate, krate: Crate,
limit: Option<usize>, limit: Option<usize>,
name_to_import: &str, name_to_import: &str,
// TODO kb change it to search across the whole path or not? name_only: bool,
ignore_modules: bool,
) -> impl Iterator<Item = Either<ModuleDef, MacroDef>> { ) -> impl Iterator<Item = Either<ModuleDef, MacroDef>> {
let _p = profile::span("find_similar_imports"); let _p = profile::span("find_similar_imports");
let mut external_query = import_map::Query::new(name_to_import).name_only(); let mut external_query =
if ignore_modules { import_map::Query::new(name_to_import).search_mode(import_map::SearchMode::Fuzzy);
external_query = external_query.exclude_import_kind(import_map::ImportKind::Module); if name_only {
external_query = external_query.name_only();
} }
let mut local_query = symbol_index::Query::new(name_to_import.to_string()); let mut local_query = symbol_index::Query::new(name_to_import.to_string());