2019-07-04 15:05:17 -05:00
|
|
|
use hir::{self, db::HirDatabase};
|
|
|
|
use ra_syntax::{
|
|
|
|
ast::{self, NameOwner},
|
|
|
|
AstNode, Direction, SmolStr,
|
|
|
|
SyntaxKind::{PATH, PATH_SEGMENT},
|
|
|
|
SyntaxNode, TextRange, T,
|
2019-02-24 04:53:35 -06:00
|
|
|
};
|
2019-10-27 08:46:49 -05:00
|
|
|
use ra_text_edit::TextEditBuilder;
|
|
|
|
|
|
|
|
use crate::{
|
|
|
|
assist_ctx::{Assist, AssistCtx},
|
|
|
|
AssistId,
|
|
|
|
};
|
|
|
|
|
2019-10-27 09:49:39 -05:00
|
|
|
/// This function produces sequence of text edits into edit
|
|
|
|
/// to import the target path in the most appropriate scope given
|
|
|
|
/// the cursor position
|
2019-10-27 08:48:20 -05:00
|
|
|
pub fn auto_import_text_edit(
|
|
|
|
// Ideally the position of the cursor, used to
|
|
|
|
position: &SyntaxNode,
|
|
|
|
// The statement to use as anchor (last resort)
|
|
|
|
anchor: &SyntaxNode,
|
|
|
|
// The path to import as a sequence of strings
|
|
|
|
target: &[SmolStr],
|
|
|
|
edit: &mut TextEditBuilder,
|
|
|
|
) {
|
|
|
|
let container = position.ancestors().find_map(|n| {
|
|
|
|
if let Some(module) = ast::Module::cast(n.clone()) {
|
|
|
|
return module.item_list().map(|it| it.syntax().clone());
|
|
|
|
}
|
|
|
|
ast::SourceFile::cast(n).map(|it| it.syntax().clone())
|
|
|
|
});
|
|
|
|
|
|
|
|
if let Some(container) = container {
|
|
|
|
let action = best_action_for_target(container, anchor.clone(), target);
|
|
|
|
make_assist(&action, target, edit);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-27 09:49:39 -05:00
|
|
|
// Assist: add_import
|
|
|
|
//
|
|
|
|
// Adds a use statement for a given fully-qualified path.
|
|
|
|
//
|
|
|
|
// ```
|
|
|
|
// fn process(map: std::collections::<|>HashMap<String, String>) {}
|
|
|
|
// ```
|
|
|
|
// ->
|
|
|
|
// ```
|
|
|
|
// use std::collections::HashMap;
|
|
|
|
//
|
|
|
|
// fn process(map: HashMap<String, String>) {}
|
|
|
|
// ```
|
2019-10-27 09:35:37 -05:00
|
|
|
pub(crate) fn add_import(ctx: AssistCtx<impl HirDatabase>) -> Option<Assist> {
|
2019-10-27 08:46:49 -05:00
|
|
|
let path: ast::Path = ctx.find_node_at_offset()?;
|
|
|
|
// We don't want to mess with use statements
|
|
|
|
if path.syntax().ancestors().find_map(ast::UseItem::cast).is_some() {
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
|
|
|
|
let hir_path = hir::Path::from_ast(path.clone())?;
|
|
|
|
let segments = collect_hir_path_segments(&hir_path)?;
|
|
|
|
if segments.len() < 2 {
|
|
|
|
return None;
|
|
|
|
}
|
|
|
|
|
2019-10-27 09:26:51 -05:00
|
|
|
let module = path.syntax().ancestors().find_map(ast::Module::cast);
|
2019-10-27 09:35:37 -05:00
|
|
|
let position = match module.and_then(|it| it.item_list()) {
|
2019-10-27 09:26:51 -05:00
|
|
|
Some(item_list) => item_list.syntax().clone(),
|
|
|
|
None => {
|
|
|
|
let current_file = path.syntax().ancestors().find_map(ast::SourceFile::cast)?;
|
|
|
|
current_file.syntax().clone()
|
2019-10-27 08:46:49 -05:00
|
|
|
}
|
2019-10-27 09:26:51 -05:00
|
|
|
};
|
|
|
|
|
2019-10-27 09:35:37 -05:00
|
|
|
ctx.add_assist(AssistId("add_import"), format!("import {}", fmt_segments(&segments)), |edit| {
|
|
|
|
apply_auto_import(&position, &path, &segments, edit.text_edit_builder());
|
|
|
|
})
|
2019-10-27 08:46:49 -05:00
|
|
|
}
|
2019-02-06 08:34:37 -06:00
|
|
|
|
2019-07-19 03:24:41 -05:00
|
|
|
fn collect_path_segments_raw(
|
|
|
|
segments: &mut Vec<ast::PathSegment>,
|
|
|
|
mut path: ast::Path,
|
2019-02-06 08:34:37 -06:00
|
|
|
) -> Option<usize> {
|
|
|
|
let oldlen = segments.len();
|
|
|
|
loop {
|
2019-03-30 05:25:53 -05:00
|
|
|
let mut children = path.syntax().children_with_tokens();
|
2019-02-06 08:34:37 -06:00
|
|
|
let (first, second, third) = (
|
2019-07-19 03:24:41 -05:00
|
|
|
children.next().map(|n| (n.clone(), n.kind())),
|
|
|
|
children.next().map(|n| (n.clone(), n.kind())),
|
|
|
|
children.next().map(|n| (n.clone(), n.kind())),
|
2019-02-06 08:34:37 -06:00
|
|
|
);
|
|
|
|
match (first, second, third) {
|
2019-05-15 07:35:47 -05:00
|
|
|
(Some((subpath, PATH)), Some((_, T![::])), Some((segment, PATH_SEGMENT))) => {
|
2019-07-19 03:24:41 -05:00
|
|
|
path = ast::Path::cast(subpath.as_node()?.clone())?;
|
|
|
|
segments.push(ast::PathSegment::cast(segment.as_node()?.clone())?);
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
(Some((segment, PATH_SEGMENT)), _, _) => {
|
2019-07-19 03:24:41 -05:00
|
|
|
segments.push(ast::PathSegment::cast(segment.as_node()?.clone())?);
|
2019-02-06 08:34:37 -06:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
(_, _, _) => return None,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// We need to reverse only the new added segments
|
|
|
|
let only_new_segments = segments.split_at_mut(oldlen).1;
|
|
|
|
only_new_segments.reverse();
|
2019-07-04 12:26:44 -05:00
|
|
|
Some(segments.len() - oldlen)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
|
2019-02-19 15:32:00 -06:00
|
|
|
fn fmt_segments(segments: &[SmolStr]) -> String {
|
2019-02-06 08:34:37 -06:00
|
|
|
let mut buf = String::new();
|
|
|
|
fmt_segments_raw(segments, &mut buf);
|
2019-07-04 12:26:44 -05:00
|
|
|
buf
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
|
2019-02-19 15:32:00 -06:00
|
|
|
fn fmt_segments_raw(segments: &[SmolStr], buf: &mut String) {
|
|
|
|
let mut iter = segments.iter();
|
|
|
|
if let Some(s) = iter.next() {
|
|
|
|
buf.push_str(s);
|
|
|
|
}
|
|
|
|
for s in iter {
|
|
|
|
buf.push_str("::");
|
|
|
|
buf.push_str(s);
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-08 14:30:59 -06:00
|
|
|
// Returns the numeber of common segments.
|
2019-07-19 03:24:41 -05:00
|
|
|
fn compare_path_segments(left: &[SmolStr], right: &[ast::PathSegment]) -> usize {
|
2019-07-04 12:26:44 -05:00
|
|
|
left.iter().zip(right).filter(|(l, r)| compare_path_segment(l, r)).count()
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
|
2019-02-19 15:32:00 -06:00
|
|
|
fn compare_path_segment(a: &SmolStr, b: &ast::PathSegment) -> bool {
|
|
|
|
if let Some(kb) = b.kind() {
|
|
|
|
match kb {
|
|
|
|
ast::PathSegmentKind::Name(nameref_b) => a == nameref_b.text(),
|
|
|
|
ast::PathSegmentKind::SelfKw => a == "self",
|
|
|
|
ast::PathSegmentKind::SuperKw => a == "super",
|
|
|
|
ast::PathSegmentKind::CrateKw => a == "crate",
|
2019-08-05 15:42:38 -05:00
|
|
|
ast::PathSegmentKind::Type { .. } => false, // not allowed in imports
|
2019-02-08 14:12:05 -06:00
|
|
|
}
|
2019-02-06 08:34:37 -06:00
|
|
|
} else {
|
|
|
|
false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-19 15:32:00 -06:00
|
|
|
fn compare_path_segment_with_name(a: &SmolStr, b: &ast::Name) -> bool {
|
|
|
|
a == b.text()
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
|
2019-07-19 03:24:41 -05:00
|
|
|
#[derive(Clone)]
|
|
|
|
enum ImportAction {
|
2019-02-06 08:34:37 -06:00
|
|
|
Nothing,
|
|
|
|
// Add a brand new use statement.
|
2019-02-08 15:12:49 -06:00
|
|
|
AddNewUse {
|
2019-07-19 03:24:41 -05:00
|
|
|
anchor: Option<SyntaxNode>, // anchor node
|
2019-02-08 15:12:49 -06:00
|
|
|
add_after_anchor: bool,
|
|
|
|
},
|
2019-02-06 08:34:37 -06:00
|
|
|
|
|
|
|
// To split an existing use statement creating a nested import.
|
2019-02-08 15:12:49 -06:00
|
|
|
AddNestedImport {
|
|
|
|
// how may segments matched with the target path
|
|
|
|
common_segments: usize,
|
2019-07-19 03:24:41 -05:00
|
|
|
path_to_split: ast::Path,
|
2019-02-08 15:12:49 -06:00
|
|
|
// the first segment of path_to_split we want to add into the new nested list
|
2019-07-19 03:24:41 -05:00
|
|
|
first_segment_to_split: Option<ast::PathSegment>,
|
2019-02-08 15:12:49 -06:00
|
|
|
// Wether to add 'self' in addition to the target path
|
|
|
|
add_self: bool,
|
|
|
|
},
|
2019-02-06 08:34:37 -06:00
|
|
|
// To add the target path to an existing nested import tree list.
|
2019-02-08 15:12:49 -06:00
|
|
|
AddInTreeList {
|
|
|
|
common_segments: usize,
|
|
|
|
// The UseTreeList where to add the target path
|
2019-07-19 03:24:41 -05:00
|
|
|
tree_list: ast::UseTreeList,
|
2019-02-08 15:12:49 -06:00
|
|
|
add_self: bool,
|
|
|
|
},
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
|
2019-07-19 03:24:41 -05:00
|
|
|
impl ImportAction {
|
|
|
|
fn add_new_use(anchor: Option<SyntaxNode>, add_after_anchor: bool) -> Self {
|
2019-02-09 04:33:30 -06:00
|
|
|
ImportAction::AddNewUse { anchor, add_after_anchor }
|
2019-02-08 15:12:49 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
fn add_nested_import(
|
|
|
|
common_segments: usize,
|
2019-07-19 03:24:41 -05:00
|
|
|
path_to_split: ast::Path,
|
|
|
|
first_segment_to_split: Option<ast::PathSegment>,
|
2019-02-08 15:12:49 -06:00
|
|
|
add_self: bool,
|
|
|
|
) -> Self {
|
|
|
|
ImportAction::AddNestedImport {
|
|
|
|
common_segments,
|
|
|
|
path_to_split,
|
|
|
|
first_segment_to_split,
|
|
|
|
add_self,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn add_in_tree_list(
|
|
|
|
common_segments: usize,
|
2019-07-19 03:24:41 -05:00
|
|
|
tree_list: ast::UseTreeList,
|
2019-02-08 15:12:49 -06:00
|
|
|
add_self: bool,
|
|
|
|
) -> Self {
|
2019-02-09 04:33:30 -06:00
|
|
|
ImportAction::AddInTreeList { common_segments, tree_list, add_self }
|
2019-02-08 15:12:49 -06:00
|
|
|
}
|
|
|
|
|
2019-07-19 03:24:41 -05:00
|
|
|
fn better(left: ImportAction, right: ImportAction) -> ImportAction {
|
|
|
|
if left.is_better(&right) {
|
2019-02-06 08:34:37 -06:00
|
|
|
left
|
|
|
|
} else {
|
|
|
|
right
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn is_better(&self, other: &ImportAction) -> bool {
|
|
|
|
match (self, other) {
|
|
|
|
(ImportAction::Nothing, _) => true,
|
2019-02-08 15:12:49 -06:00
|
|
|
(ImportAction::AddInTreeList { .. }, ImportAction::Nothing) => false,
|
|
|
|
(
|
2019-02-09 04:33:30 -06:00
|
|
|
ImportAction::AddNestedImport { common_segments: n, .. },
|
|
|
|
ImportAction::AddInTreeList { common_segments: m, .. },
|
2019-02-08 15:12:49 -06:00
|
|
|
) => n > m,
|
|
|
|
(
|
2019-02-09 04:33:30 -06:00
|
|
|
ImportAction::AddInTreeList { common_segments: n, .. },
|
|
|
|
ImportAction::AddNestedImport { common_segments: m, .. },
|
2019-02-08 15:12:49 -06:00
|
|
|
) => n > m,
|
|
|
|
(ImportAction::AddInTreeList { .. }, _) => true,
|
|
|
|
(ImportAction::AddNestedImport { .. }, ImportAction::Nothing) => false,
|
|
|
|
(ImportAction::AddNestedImport { .. }, _) => true,
|
|
|
|
(ImportAction::AddNewUse { .. }, _) => false,
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Find out the best ImportAction to import target path against current_use_tree.
|
|
|
|
// If current_use_tree has a nested import the function gets called recursively on every UseTree inside a UseTreeList.
|
2019-07-19 03:24:41 -05:00
|
|
|
fn walk_use_tree_for_best_action(
|
|
|
|
current_path_segments: &mut Vec<ast::PathSegment>, // buffer containing path segments
|
|
|
|
current_parent_use_tree_list: Option<ast::UseTreeList>, // will be Some value if we are in a nested import
|
|
|
|
current_use_tree: ast::UseTree, // the use tree we are currently examinating
|
|
|
|
target: &[SmolStr], // the path we want to import
|
|
|
|
) -> ImportAction {
|
2019-02-06 08:34:37 -06:00
|
|
|
// We save the number of segments in the buffer so we can restore the correct segments
|
|
|
|
// before returning. Recursive call will add segments so we need to delete them.
|
|
|
|
let prev_len = current_path_segments.len();
|
|
|
|
|
|
|
|
let tree_list = current_use_tree.use_tree_list();
|
|
|
|
let alias = current_use_tree.alias();
|
|
|
|
|
|
|
|
let path = match current_use_tree.path() {
|
|
|
|
Some(path) => path,
|
|
|
|
None => {
|
|
|
|
// If the use item don't have a path, it means it's broken (syntax error)
|
2019-02-08 15:12:49 -06:00
|
|
|
return ImportAction::add_new_use(
|
2019-02-06 08:34:37 -06:00
|
|
|
current_use_tree
|
|
|
|
.syntax()
|
|
|
|
.ancestors()
|
|
|
|
.find_map(ast::UseItem::cast)
|
2019-07-19 03:24:41 -05:00
|
|
|
.map(|it| it.syntax().clone()),
|
2019-02-06 08:34:37 -06:00
|
|
|
true,
|
|
|
|
);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// This can happen only if current_use_tree is a direct child of a UseItem
|
2019-07-19 03:24:41 -05:00
|
|
|
if let Some(name) = alias.and_then(|it| it.name()) {
|
|
|
|
if compare_path_segment_with_name(&target[0], &name) {
|
2019-02-06 08:34:37 -06:00
|
|
|
return ImportAction::Nothing;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-07-19 03:24:41 -05:00
|
|
|
collect_path_segments_raw(current_path_segments, path.clone());
|
2019-02-06 08:34:37 -06:00
|
|
|
|
|
|
|
// We compare only the new segments added in the line just above.
|
|
|
|
// The first prev_len segments were already compared in 'parent' recursive calls.
|
2019-02-08 14:30:59 -06:00
|
|
|
let left = target.split_at(prev_len).1;
|
|
|
|
let right = current_path_segments.split_at(prev_len).1;
|
2019-07-19 03:24:41 -05:00
|
|
|
let common = compare_path_segments(left, &right);
|
2019-02-08 14:30:59 -06:00
|
|
|
let mut action = match common {
|
2019-02-08 15:12:49 -06:00
|
|
|
0 => ImportAction::add_new_use(
|
2019-02-08 14:30:59 -06:00
|
|
|
// e.g: target is std::fmt and we can have
|
|
|
|
// use foo::bar
|
|
|
|
// We add a brand new use statement
|
2019-07-19 03:24:41 -05:00
|
|
|
current_use_tree
|
|
|
|
.syntax()
|
|
|
|
.ancestors()
|
|
|
|
.find_map(ast::UseItem::cast)
|
|
|
|
.map(|it| it.syntax().clone()),
|
2019-02-08 14:30:59 -06:00
|
|
|
true,
|
|
|
|
),
|
|
|
|
common if common == left.len() && left.len() == right.len() => {
|
2019-02-06 08:34:37 -06:00
|
|
|
// e.g: target is std::fmt and we can have
|
|
|
|
// 1- use std::fmt;
|
|
|
|
// 2- use std::fmt:{ ... }
|
|
|
|
if let Some(list) = tree_list {
|
|
|
|
// In case 2 we need to add self to the nested list
|
|
|
|
// unless it's already there
|
2019-07-19 03:24:41 -05:00
|
|
|
let has_self = list.use_trees().map(|it| it.path()).any(|p| {
|
|
|
|
p.and_then(|it| it.segment())
|
|
|
|
.and_then(|it| it.kind())
|
2019-02-06 08:34:37 -06:00
|
|
|
.filter(|k| *k == ast::PathSegmentKind::SelfKw)
|
|
|
|
.is_some()
|
|
|
|
});
|
|
|
|
|
|
|
|
if has_self {
|
|
|
|
ImportAction::Nothing
|
|
|
|
} else {
|
2019-02-08 15:12:49 -06:00
|
|
|
ImportAction::add_in_tree_list(current_path_segments.len(), list, true)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Case 1
|
|
|
|
ImportAction::Nothing
|
|
|
|
}
|
|
|
|
}
|
2019-02-08 14:30:59 -06:00
|
|
|
common if common != left.len() && left.len() == right.len() => {
|
2019-02-06 08:34:37 -06:00
|
|
|
// e.g: target is std::fmt and we have
|
|
|
|
// use std::io;
|
|
|
|
// We need to split.
|
2019-02-08 14:30:59 -06:00
|
|
|
let segments_to_split = current_path_segments.split_at(prev_len + common).1;
|
2019-02-08 15:12:49 -06:00
|
|
|
ImportAction::add_nested_import(
|
2019-02-08 14:30:59 -06:00
|
|
|
prev_len + common,
|
|
|
|
path,
|
2019-07-19 03:24:41 -05:00
|
|
|
Some(segments_to_split[0].clone()),
|
2019-02-08 14:30:59 -06:00
|
|
|
false,
|
|
|
|
)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
2019-02-14 14:33:38 -06:00
|
|
|
common if common == right.len() && left.len() > right.len() => {
|
2019-02-06 08:34:37 -06:00
|
|
|
// e.g: target is std::fmt and we can have
|
|
|
|
// 1- use std;
|
|
|
|
// 2- use std::{ ... };
|
|
|
|
|
|
|
|
// fallback action
|
2019-02-08 15:12:49 -06:00
|
|
|
let mut better_action = ImportAction::add_new_use(
|
2019-02-06 08:34:37 -06:00
|
|
|
current_use_tree
|
|
|
|
.syntax()
|
|
|
|
.ancestors()
|
|
|
|
.find_map(ast::UseItem::cast)
|
2019-07-19 03:24:41 -05:00
|
|
|
.map(|it| it.syntax().clone()),
|
2019-02-06 08:34:37 -06:00
|
|
|
true,
|
|
|
|
);
|
|
|
|
if let Some(list) = tree_list {
|
|
|
|
// Case 2, check recursively if the path is already imported in the nested list
|
|
|
|
for u in list.use_trees() {
|
2019-07-19 03:24:41 -05:00
|
|
|
let child_action = walk_use_tree_for_best_action(
|
|
|
|
current_path_segments,
|
|
|
|
Some(list.clone()),
|
|
|
|
u,
|
|
|
|
target,
|
|
|
|
);
|
2019-02-06 08:34:37 -06:00
|
|
|
if child_action.is_better(&better_action) {
|
|
|
|
better_action = child_action;
|
|
|
|
if let ImportAction::Nothing = better_action {
|
|
|
|
return better_action;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2019-02-14 14:33:38 -06:00
|
|
|
// Case 1, split adding self
|
2019-02-08 15:12:49 -06:00
|
|
|
better_action = ImportAction::add_nested_import(prev_len + common, path, None, true)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
better_action
|
|
|
|
}
|
2019-02-14 14:33:38 -06:00
|
|
|
common if common == left.len() && left.len() < right.len() => {
|
2019-02-08 14:12:05 -06:00
|
|
|
// e.g: target is std::fmt and we can have
|
2019-02-06 08:34:37 -06:00
|
|
|
// use std::fmt::Debug;
|
2019-02-08 14:30:59 -06:00
|
|
|
let segments_to_split = current_path_segments.split_at(prev_len + common).1;
|
2019-02-08 15:12:49 -06:00
|
|
|
ImportAction::add_nested_import(
|
|
|
|
prev_len + common,
|
|
|
|
path,
|
2019-07-19 03:24:41 -05:00
|
|
|
Some(segments_to_split[0].clone()),
|
2019-02-08 15:12:49 -06:00
|
|
|
true,
|
|
|
|
)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
2019-02-14 14:33:38 -06:00
|
|
|
common if common < left.len() && common < right.len() => {
|
|
|
|
// e.g: target is std::fmt::nested::Debug
|
|
|
|
// use std::fmt::Display
|
|
|
|
let segments_to_split = current_path_segments.split_at(prev_len + common).1;
|
|
|
|
ImportAction::add_nested_import(
|
|
|
|
prev_len + common,
|
|
|
|
path,
|
2019-07-19 03:24:41 -05:00
|
|
|
Some(segments_to_split[0].clone()),
|
2019-02-14 14:33:38 -06:00
|
|
|
false,
|
|
|
|
)
|
|
|
|
}
|
2019-02-08 14:30:59 -06:00
|
|
|
_ => unreachable!(),
|
2019-02-06 08:34:37 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
// If we are inside a UseTreeList adding a use statement become adding to the existing
|
|
|
|
// tree list.
|
2019-07-19 03:24:41 -05:00
|
|
|
action = match (current_parent_use_tree_list, action.clone()) {
|
2019-02-08 15:12:49 -06:00
|
|
|
(Some(use_tree_list), ImportAction::AddNewUse { .. }) => {
|
|
|
|
ImportAction::add_in_tree_list(prev_len, use_tree_list, false)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
(_, _) => action,
|
|
|
|
};
|
|
|
|
|
|
|
|
// We remove the segments added
|
|
|
|
current_path_segments.truncate(prev_len);
|
2019-07-04 12:26:44 -05:00
|
|
|
action
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
|
2019-07-19 03:24:41 -05:00
|
|
|
fn best_action_for_target(
|
|
|
|
container: SyntaxNode,
|
|
|
|
anchor: SyntaxNode,
|
|
|
|
target: &[SmolStr],
|
|
|
|
) -> ImportAction {
|
2019-02-06 08:34:37 -06:00
|
|
|
let mut storage = Vec::with_capacity(16); // this should be the only allocation
|
|
|
|
let best_action = container
|
|
|
|
.children()
|
|
|
|
.filter_map(ast::UseItem::cast)
|
2019-07-19 03:24:41 -05:00
|
|
|
.filter_map(|it| it.use_tree())
|
2019-02-06 08:34:37 -06:00
|
|
|
.map(|u| walk_use_tree_for_best_action(&mut storage, None, u, target))
|
2019-07-19 03:24:41 -05:00
|
|
|
.fold(None, |best, a| match best {
|
|
|
|
Some(best) => Some(ImportAction::better(best, a)),
|
|
|
|
None => Some(a),
|
2019-02-06 08:34:37 -06:00
|
|
|
});
|
|
|
|
|
|
|
|
match best_action {
|
2019-07-04 12:26:44 -05:00
|
|
|
Some(action) => action,
|
2019-02-06 08:34:37 -06:00
|
|
|
None => {
|
2019-02-11 14:57:38 -06:00
|
|
|
// We have no action and no UseItem was found in container so we find
|
2019-02-06 08:34:37 -06:00
|
|
|
// another item and we use it as anchor.
|
2019-04-19 15:30:05 -05:00
|
|
|
// If there are no items above, we choose the target path itself as anchor.
|
|
|
|
// todo: we should include even whitespace blocks as anchor candidates
|
2019-02-06 08:34:37 -06:00
|
|
|
let anchor = container
|
|
|
|
.children()
|
2019-07-20 04:58:27 -05:00
|
|
|
.find(|n| n.text_range().start() < anchor.text_range().start())
|
2019-06-03 09:27:51 -05:00
|
|
|
.or_else(|| Some(anchor));
|
2019-02-06 08:34:37 -06:00
|
|
|
|
2019-07-04 12:26:44 -05:00
|
|
|
ImportAction::add_new_use(anchor, false)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-19 15:32:00 -06:00
|
|
|
fn make_assist(action: &ImportAction, target: &[SmolStr], edit: &mut TextEditBuilder) {
|
2019-02-06 08:34:37 -06:00
|
|
|
match action {
|
2019-02-09 04:33:30 -06:00
|
|
|
ImportAction::AddNewUse { anchor, add_after_anchor } => {
|
|
|
|
make_assist_add_new_use(anchor, *add_after_anchor, target, edit)
|
|
|
|
}
|
|
|
|
ImportAction::AddInTreeList { common_segments, tree_list, add_self } => {
|
2019-02-06 08:34:37 -06:00
|
|
|
// We know that the fist n segments already exists in the use statement we want
|
|
|
|
// to modify, so we want to add only the last target.len() - n segments.
|
2019-02-08 15:12:49 -06:00
|
|
|
let segments_to_add = target.split_at(*common_segments).1;
|
|
|
|
make_assist_add_in_tree_list(tree_list, segments_to_add, *add_self, edit)
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
2019-02-08 15:12:49 -06:00
|
|
|
ImportAction::AddNestedImport {
|
|
|
|
common_segments,
|
|
|
|
path_to_split,
|
|
|
|
first_segment_to_split,
|
|
|
|
add_self,
|
|
|
|
} => {
|
|
|
|
let segments_to_add = target.split_at(*common_segments).1;
|
2019-02-06 08:34:37 -06:00
|
|
|
make_assist_add_nested_import(
|
2019-02-08 15:12:49 -06:00
|
|
|
path_to_split,
|
2019-02-06 08:34:37 -06:00
|
|
|
first_segment_to_split,
|
|
|
|
segments_to_add,
|
|
|
|
*add_self,
|
|
|
|
edit,
|
|
|
|
)
|
|
|
|
}
|
|
|
|
_ => {}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn make_assist_add_new_use(
|
2019-07-19 03:24:41 -05:00
|
|
|
anchor: &Option<SyntaxNode>,
|
2019-02-06 08:34:37 -06:00
|
|
|
after: bool,
|
2019-02-19 15:32:00 -06:00
|
|
|
target: &[SmolStr],
|
2019-02-19 10:54:00 -06:00
|
|
|
edit: &mut TextEditBuilder,
|
2019-02-06 08:34:37 -06:00
|
|
|
) {
|
|
|
|
if let Some(anchor) = anchor {
|
2019-02-09 04:33:30 -06:00
|
|
|
let indent = ra_fmt::leading_indent(anchor);
|
2019-02-06 08:34:37 -06:00
|
|
|
let mut buf = String::new();
|
|
|
|
if after {
|
|
|
|
buf.push_str("\n");
|
2019-07-19 03:24:41 -05:00
|
|
|
if let Some(spaces) = &indent {
|
2019-02-06 08:34:37 -06:00
|
|
|
buf.push_str(spaces);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
buf.push_str("use ");
|
|
|
|
fmt_segments_raw(target, &mut buf);
|
|
|
|
buf.push_str(";");
|
|
|
|
if !after {
|
|
|
|
buf.push_str("\n\n");
|
2019-07-19 03:24:41 -05:00
|
|
|
if let Some(spaces) = &indent {
|
|
|
|
buf.push_str(&spaces);
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
}
|
2019-07-20 04:58:27 -05:00
|
|
|
let position = if after { anchor.text_range().end() } else { anchor.text_range().start() };
|
2019-02-06 08:34:37 -06:00
|
|
|
edit.insert(position, buf);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn make_assist_add_in_tree_list(
|
|
|
|
tree_list: &ast::UseTreeList,
|
2019-02-19 15:32:00 -06:00
|
|
|
target: &[SmolStr],
|
2019-02-06 08:34:37 -06:00
|
|
|
add_self: bool,
|
2019-02-19 10:54:00 -06:00
|
|
|
edit: &mut TextEditBuilder,
|
2019-02-06 08:34:37 -06:00
|
|
|
) {
|
|
|
|
let last = tree_list.use_trees().last();
|
|
|
|
if let Some(last) = last {
|
|
|
|
let mut buf = String::new();
|
2019-05-15 07:35:47 -05:00
|
|
|
let comma = last.syntax().siblings(Direction::Next).find(|n| n.kind() == T![,]);
|
2019-02-06 08:34:37 -06:00
|
|
|
let offset = if let Some(comma) = comma {
|
2019-07-20 04:58:27 -05:00
|
|
|
comma.text_range().end()
|
2019-02-06 08:34:37 -06:00
|
|
|
} else {
|
|
|
|
buf.push_str(",");
|
2019-07-20 04:58:27 -05:00
|
|
|
last.syntax().text_range().end()
|
2019-02-06 08:34:37 -06:00
|
|
|
};
|
|
|
|
if add_self {
|
|
|
|
buf.push_str(" self")
|
|
|
|
} else {
|
|
|
|
buf.push_str(" ");
|
|
|
|
}
|
|
|
|
fmt_segments_raw(target, &mut buf);
|
|
|
|
edit.insert(offset, buf);
|
|
|
|
} else {
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn make_assist_add_nested_import(
|
|
|
|
path: &ast::Path,
|
2019-07-19 03:24:41 -05:00
|
|
|
first_segment_to_split: &Option<ast::PathSegment>,
|
2019-02-19 15:32:00 -06:00
|
|
|
target: &[SmolStr],
|
2019-02-06 08:34:37 -06:00
|
|
|
add_self: bool,
|
2019-02-19 10:54:00 -06:00
|
|
|
edit: &mut TextEditBuilder,
|
2019-02-06 08:34:37 -06:00
|
|
|
) {
|
|
|
|
let use_tree = path.syntax().ancestors().find_map(ast::UseTree::cast);
|
|
|
|
if let Some(use_tree) = use_tree {
|
|
|
|
let (start, add_colon_colon) = if let Some(first_segment_to_split) = first_segment_to_split
|
|
|
|
{
|
2019-07-20 04:58:27 -05:00
|
|
|
(first_segment_to_split.syntax().text_range().start(), false)
|
2019-02-06 08:34:37 -06:00
|
|
|
} else {
|
2019-07-20 04:58:27 -05:00
|
|
|
(use_tree.syntax().text_range().end(), true)
|
2019-02-06 08:34:37 -06:00
|
|
|
};
|
2019-07-20 04:58:27 -05:00
|
|
|
let end = use_tree.syntax().text_range().end();
|
2019-02-06 08:34:37 -06:00
|
|
|
|
|
|
|
let mut buf = String::new();
|
|
|
|
if add_colon_colon {
|
|
|
|
buf.push_str("::");
|
|
|
|
}
|
|
|
|
buf.push_str("{ ");
|
|
|
|
if add_self {
|
|
|
|
buf.push_str("self, ");
|
|
|
|
}
|
|
|
|
fmt_segments_raw(target, &mut buf);
|
|
|
|
if !target.is_empty() {
|
|
|
|
buf.push_str(", ");
|
|
|
|
}
|
|
|
|
edit.insert(start, buf);
|
2019-02-19 10:54:00 -06:00
|
|
|
edit.insert(end, "}".to_string());
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-02-19 15:32:00 -06:00
|
|
|
fn apply_auto_import(
|
2019-02-11 14:57:38 -06:00
|
|
|
container: &SyntaxNode,
|
|
|
|
path: &ast::Path,
|
2019-02-19 15:32:00 -06:00
|
|
|
target: &[SmolStr],
|
2019-02-19 10:54:00 -06:00
|
|
|
edit: &mut TextEditBuilder,
|
2019-02-11 14:57:38 -06:00
|
|
|
) {
|
2019-07-19 03:24:41 -05:00
|
|
|
let action = best_action_for_target(container.clone(), path.syntax().clone(), target);
|
2019-02-11 14:57:38 -06:00
|
|
|
make_assist(&action, target, edit);
|
2019-02-19 15:32:00 -06:00
|
|
|
if let Some(last) = path.segment() {
|
2019-02-11 14:57:38 -06:00
|
|
|
// Here we are assuming the assist will provide a correct use statement
|
|
|
|
// so we can delete the path qualifier
|
|
|
|
edit.delete(TextRange::from_to(
|
2019-07-20 04:58:27 -05:00
|
|
|
path.syntax().text_range().start(),
|
|
|
|
last.syntax().text_range().start(),
|
2019-02-11 14:57:38 -06:00
|
|
|
));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-10-27 08:48:20 -05:00
|
|
|
fn collect_hir_path_segments(path: &hir::Path) -> Option<Vec<SmolStr>> {
|
2019-02-19 15:32:00 -06:00
|
|
|
let mut ps = Vec::<SmolStr>::with_capacity(10);
|
|
|
|
match path.kind {
|
|
|
|
hir::PathKind::Abs => ps.push("".into()),
|
|
|
|
hir::PathKind::Crate => ps.push("crate".into()),
|
2019-04-19 15:30:05 -05:00
|
|
|
hir::PathKind::Plain => {}
|
2019-02-19 15:32:00 -06:00
|
|
|
hir::PathKind::Self_ => ps.push("self".into()),
|
2019-04-19 15:30:05 -05:00
|
|
|
hir::PathKind::Super => ps.push("super".into()),
|
2019-09-26 12:59:38 -05:00
|
|
|
hir::PathKind::Type(_) | hir::PathKind::DollarCrate(_) => return None,
|
2019-02-19 15:32:00 -06:00
|
|
|
}
|
|
|
|
for s in path.segments.iter() {
|
2019-04-22 07:56:28 -05:00
|
|
|
ps.push(s.name.to_string().into());
|
2019-02-19 15:32:00 -06:00
|
|
|
}
|
2019-09-11 13:01:07 -05:00
|
|
|
Some(ps)
|
2019-02-19 15:32:00 -06:00
|
|
|
}
|
|
|
|
|
2019-02-06 08:34:37 -06:00
|
|
|
#[cfg(test)]
|
|
|
|
mod tests {
|
2019-07-04 15:05:17 -05:00
|
|
|
use crate::helpers::{check_assist, check_assist_not_applicable};
|
2019-02-06 08:34:37 -06:00
|
|
|
|
2019-10-27 09:26:51 -05:00
|
|
|
use super::*;
|
|
|
|
|
2019-02-06 08:34:37 -06:00
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_use_no_anchor() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
std::fmt::Debug<|>
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
2019-04-19 15:30:05 -05:00
|
|
|
Debug<|>
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
#[test]
|
|
|
|
fn test_auto_import_add_use_no_anchor_with_item_below() {
|
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-04-19 15:30:05 -05:00
|
|
|
"
|
|
|
|
std::fmt::Debug<|>
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
Debug<|>
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_auto_import_add_use_no_anchor_with_item_above() {
|
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-04-19 15:30:05 -05:00
|
|
|
"
|
|
|
|
fn main() {
|
|
|
|
}
|
|
|
|
|
|
|
|
std::fmt::Debug<|>
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
}
|
|
|
|
|
2019-02-06 08:34:37 -06:00
|
|
|
Debug<|>
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2019-02-11 14:57:38 -06:00
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_use_no_anchor_2seg() {
|
2019-02-11 14:57:38 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-11 14:57:38 -06:00
|
|
|
"
|
|
|
|
std::fmt<|>::Debug
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt;
|
|
|
|
|
|
|
|
fmt<|>::Debug
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2019-02-06 08:34:37 -06:00
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_use() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use stdx;
|
|
|
|
|
|
|
|
impl std::fmt::Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use stdx;
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
impl Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_file_use_other_anchor() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
impl std::fmt::Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
impl Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_use_other_anchor_indent() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
impl std::fmt::Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
impl Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_split_different() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use std::fmt;
|
|
|
|
|
|
|
|
impl std::io<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::{ io, fmt};
|
|
|
|
|
|
|
|
impl io<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_split_self_for_use() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use std::fmt;
|
|
|
|
|
|
|
|
impl std::fmt::Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::{ self, Debug, };
|
|
|
|
|
|
|
|
impl Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_split_self_for_target() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
impl std::fmt<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::{ self, Debug};
|
|
|
|
|
|
|
|
impl fmt<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_to_nested_self_nested() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use std::fmt::{Debug, nested::{Display}};
|
|
|
|
|
|
|
|
impl std::fmt::nested<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::{Debug, nested::{Display, self}};
|
|
|
|
|
|
|
|
impl nested<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_to_nested_self_already_included() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use std::fmt::{Debug, nested::{self, Display}};
|
|
|
|
|
|
|
|
impl std::fmt::nested<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::{Debug, nested::{self, Display}};
|
|
|
|
|
|
|
|
impl nested<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_to_nested_nested() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use std::fmt::{Debug, nested::{Display}};
|
|
|
|
|
|
|
|
impl std::fmt::nested::Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::{Debug, nested::{Display, Debug}};
|
|
|
|
|
|
|
|
impl Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_split_common_target_longer() {
|
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-14 14:33:38 -06:00
|
|
|
"
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
impl std::fmt::nested::Display<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::{ nested::Display, Debug};
|
|
|
|
|
|
|
|
impl Display<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_auto_import_split_common_use_longer() {
|
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-14 14:33:38 -06:00
|
|
|
"
|
|
|
|
use std::fmt::nested::Debug;
|
|
|
|
|
|
|
|
impl std::fmt::Display<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt::{ Display, nested::Debug};
|
|
|
|
|
|
|
|
impl Display<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_auto_import_alias() {
|
2019-02-06 08:34:37 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
use std::fmt as foo;
|
|
|
|
|
|
|
|
impl foo::Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
use std::fmt as foo;
|
|
|
|
|
|
|
|
impl Debug<|> for Foo {
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_auto_import_not_applicable_one_segment() {
|
|
|
|
check_assist_not_applicable(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-06 08:34:37 -06:00
|
|
|
"
|
|
|
|
impl foo<|> for Foo {
|
|
|
|
}
|
2019-02-11 14:57:38 -06:00
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
#[test]
|
|
|
|
fn test_auto_import_not_applicable_in_use() {
|
|
|
|
check_assist_not_applicable(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-11 14:57:38 -06:00
|
|
|
"
|
|
|
|
use std::fmt<|>;
|
2019-02-06 08:34:37 -06:00
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
2019-02-12 14:14:51 -06:00
|
|
|
|
|
|
|
#[test]
|
2019-02-14 14:33:38 -06:00
|
|
|
fn test_auto_import_add_use_no_anchor_in_mod_mod() {
|
2019-02-12 14:14:51 -06:00
|
|
|
check_assist(
|
2019-10-27 08:46:49 -05:00
|
|
|
add_import,
|
2019-02-12 14:14:51 -06:00
|
|
|
"
|
|
|
|
mod foo {
|
|
|
|
mod bar {
|
|
|
|
std::fmt::Debug<|>
|
|
|
|
}
|
|
|
|
}
|
|
|
|
",
|
|
|
|
"
|
|
|
|
mod foo {
|
|
|
|
mod bar {
|
|
|
|
use std::fmt::Debug;
|
|
|
|
|
|
|
|
Debug<|>
|
|
|
|
}
|
|
|
|
}
|
|
|
|
",
|
|
|
|
);
|
|
|
|
}
|
2019-02-06 08:34:37 -06:00
|
|
|
}
|