2019-12-30 07:25:19 -06:00
|
|
|
//! An algorithm to find a path to refer to a certain item.
|
|
|
|
|
2019-12-30 10:31:15 -06:00
|
|
|
use crate::{
|
|
|
|
db::DefDatabase,
|
|
|
|
item_scope::ItemInNs,
|
|
|
|
path::{ModPath, PathKind},
|
|
|
|
ModuleId,
|
|
|
|
};
|
2019-12-30 07:25:19 -06:00
|
|
|
|
2019-12-30 10:31:15 -06:00
|
|
|
pub fn find_path(db: &impl DefDatabase, item: ItemInNs, from: ModuleId) -> ModPath {
|
|
|
|
// 1. Find all locations that the item could be imported from (i.e. that are visible)
|
|
|
|
// - this needs to consider other crates, for reexports from transitive dependencies
|
|
|
|
// - filter by visibility
|
|
|
|
// 2. For each of these, go up the module tree until we find an
|
|
|
|
// item/module/crate that is already in scope (including because it is in
|
|
|
|
// the prelude, and including aliases!)
|
|
|
|
// 3. Then select the one that gives the shortest path
|
|
|
|
let def_map = db.crate_def_map(from.krate);
|
|
|
|
let from_scope: &crate::item_scope::ItemScope = &def_map.modules[from.local_id].scope;
|
|
|
|
if let Some((name, _)) = from_scope.reverse_get(item) {
|
|
|
|
return ModPath::from_simple_segments(PathKind::Plain, vec![name.clone()]);
|
|
|
|
}
|
2019-12-30 07:25:19 -06:00
|
|
|
todo!()
|
|
|
|
}
|
|
|
|
|
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
|
|
|
use super::*;
|
2019-12-30 10:31:15 -06:00
|
|
|
use crate::test_db::TestDB;
|
2019-12-30 07:25:19 -06:00
|
|
|
use hir_expand::hygiene::Hygiene;
|
2019-12-30 10:31:15 -06:00
|
|
|
use ra_db::fixture::WithFixture;
|
|
|
|
use ra_syntax::ast::AstNode;
|
2019-12-30 07:25:19 -06:00
|
|
|
|
|
|
|
/// `code` needs to contain a cursor marker; checks that `find_path` for the
|
|
|
|
/// item the `path` refers to returns that same path when called from the
|
|
|
|
/// module the cursor is in.
|
|
|
|
fn check_found_path(code: &str, path: &str) {
|
|
|
|
let (db, pos) = TestDB::with_position(code);
|
|
|
|
let module = db.module_for_file(pos.file_id);
|
|
|
|
let parsed_path_file = ra_syntax::SourceFile::parse(&format!("use {};", path));
|
2019-12-30 10:31:15 -06:00
|
|
|
let ast_path = parsed_path_file
|
|
|
|
.syntax_node()
|
|
|
|
.descendants()
|
|
|
|
.find_map(ra_syntax::ast::Path::cast)
|
|
|
|
.unwrap();
|
2019-12-30 07:25:19 -06:00
|
|
|
let mod_path = ModPath::from_src(ast_path, &Hygiene::new_unhygienic()).unwrap();
|
|
|
|
|
|
|
|
let crate_def_map = db.crate_def_map(module.krate);
|
2019-12-30 10:31:15 -06:00
|
|
|
let resolved = crate_def_map
|
|
|
|
.resolve_path(
|
|
|
|
&db,
|
|
|
|
module.local_id,
|
|
|
|
&mod_path,
|
|
|
|
crate::item_scope::BuiltinShadowMode::Module,
|
|
|
|
)
|
|
|
|
.0
|
|
|
|
.take_types()
|
|
|
|
.unwrap();
|
2019-12-30 07:25:19 -06:00
|
|
|
|
2019-12-30 10:31:15 -06:00
|
|
|
let found_path = find_path(&db, ItemInNs::Types(resolved), module);
|
2019-12-30 07:25:19 -06:00
|
|
|
|
|
|
|
assert_eq!(mod_path, found_path);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn same_module() {
|
|
|
|
let code = r#"
|
2019-12-30 10:31:15 -06:00
|
|
|
//- /main.rs
|
|
|
|
struct S;
|
|
|
|
<|>
|
|
|
|
"#;
|
2019-12-30 07:25:19 -06:00
|
|
|
check_found_path(code, "S");
|
|
|
|
}
|
2019-12-30 10:31:15 -06:00
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn sub_module() {
|
|
|
|
let code = r#"
|
|
|
|
//- /main.rs
|
|
|
|
mod foo {
|
|
|
|
pub struct S;
|
|
|
|
}
|
|
|
|
<|>
|
|
|
|
"#;
|
|
|
|
check_found_path(code, "foo::S");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn same_crate() {
|
|
|
|
let code = r#"
|
|
|
|
//- /main.rs
|
|
|
|
mod foo;
|
|
|
|
struct S;
|
|
|
|
//- /foo.rs
|
|
|
|
<|>
|
|
|
|
"#;
|
|
|
|
check_found_path(code, "crate::S");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn different_crate() {
|
|
|
|
let code = r#"
|
|
|
|
//- /main.rs crate:main deps:std
|
|
|
|
<|>
|
|
|
|
//- /std.rs crate:std
|
|
|
|
pub struct S;
|
|
|
|
"#;
|
|
|
|
check_found_path(code, "std::S");
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn same_crate_reexport() {
|
|
|
|
let code = r#"
|
|
|
|
//- /main.rs
|
|
|
|
mod bar {
|
|
|
|
mod foo { pub(super) struct S; }
|
|
|
|
pub(crate) use foo::*;
|
|
|
|
}
|
|
|
|
<|>
|
|
|
|
"#;
|
|
|
|
check_found_path(code, "bar::S");
|
|
|
|
}
|
2019-12-30 07:25:19 -06:00
|
|
|
}
|