mirror of
https://github.com/rust-lang/rust-clippy
synced 2024-11-26 22:50:56 +00:00
store the span of the nested part of the use tree in the ast
This commit is contained in:
parent
2e989dc280
commit
f0f392781f
4 changed files with 9 additions and 9 deletions
|
@ -201,8 +201,8 @@ impl SingleComponentPathImports {
|
|||
|
||||
if segments.is_empty() {
|
||||
// keep track of `use {some_module, some_other_module};` usages
|
||||
if let UseTreeKind::Nested(trees) = &use_tree.kind {
|
||||
for tree in trees {
|
||||
if let UseTreeKind::Nested { items, .. } = &use_tree.kind {
|
||||
for tree in items {
|
||||
let segments = &tree.0.prefix.segments;
|
||||
if segments.len() == 1 {
|
||||
if let UseTreeKind::Simple(None) = tree.0.kind {
|
||||
|
@ -229,8 +229,8 @@ impl SingleComponentPathImports {
|
|||
}
|
||||
|
||||
// nested case such as `use self::{module1::Struct1, module2::Struct2}`
|
||||
if let UseTreeKind::Nested(trees) = &use_tree.kind {
|
||||
for tree in trees {
|
||||
if let UseTreeKind::Nested { items, .. } = &use_tree.kind {
|
||||
for tree in items {
|
||||
let segments = &tree.0.prefix.segments;
|
||||
if !segments.is_empty() {
|
||||
imports_reused_with_self.push(segments[0].ident.name);
|
||||
|
|
|
@ -36,8 +36,8 @@ declare_lint_pass!(UnnecessarySelfImports => [UNNECESSARY_SELF_IMPORTS]);
|
|||
impl EarlyLintPass for UnnecessarySelfImports {
|
||||
fn check_item(&mut self, cx: &EarlyContext<'_>, item: &Item) {
|
||||
if let ItemKind::Use(use_tree) = &item.kind
|
||||
&& let UseTreeKind::Nested(nodes) = &use_tree.kind
|
||||
&& let [(self_tree, _)] = &**nodes
|
||||
&& let UseTreeKind::Nested { items, .. } = &use_tree.kind
|
||||
&& let [(self_tree, _)] = &**items
|
||||
&& let [self_seg] = &*self_tree.prefix.segments
|
||||
&& self_seg.ident.name == kw::SelfLower
|
||||
&& let Some(last_segment) = use_tree.prefix.segments.last()
|
||||
|
|
|
@ -49,8 +49,8 @@ fn check_use_tree(use_tree: &UseTree, cx: &EarlyContext<'_>, span: Span) {
|
|||
unsafe_to_safe_check(old_name, new_name, cx, span);
|
||||
},
|
||||
UseTreeKind::Simple(None) | UseTreeKind::Glob => {},
|
||||
UseTreeKind::Nested(ref nested_use_tree) => {
|
||||
for (use_tree, _) in nested_use_tree {
|
||||
UseTreeKind::Nested { ref items, .. } => {
|
||||
for (use_tree, _) in items {
|
||||
check_use_tree(use_tree, cx, span);
|
||||
}
|
||||
},
|
||||
|
|
|
@ -637,7 +637,7 @@ pub fn eq_use_tree_kind(l: &UseTreeKind, r: &UseTreeKind) -> bool {
|
|||
match (l, r) {
|
||||
(Glob, Glob) => true,
|
||||
(Simple(l), Simple(r)) => both(l, r, |l, r| eq_id(*l, *r)),
|
||||
(Nested(l), Nested(r)) => over(l, r, |(l, _), (r, _)| eq_use_tree(l, r)),
|
||||
(Nested { items: l, .. }, Nested { items: r, .. }) => over(l, r, |(l, _), (r, _)| eq_use_tree(l, r)),
|
||||
_ => false,
|
||||
}
|
||||
}
|
||||
|
|
Loading…
Reference in a new issue