1 // Copyright 2015 The Rust Project Developers. See the COPYRIGHT
2 // file at the top-level directory of this distribution and at
3 // http://rust-lang.org/COPYRIGHT.
5 // Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
6 // http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
7 // <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
8 // option. This file may not be copied, modified, or distributed
9 // except according to those terms.
11 use std::cmp::Ordering;
14 use syntax::ast::{self, UseTreeKind};
15 use syntax::source_map::{self, BytePos, Span, DUMMY_SP};
17 use comment::combine_strs_with_missing_comments;
18 use config::{Edition, IndentStyle};
19 use lists::{definitive_tactic, itemize_list, write_list, ListFormatting, ListItem, Separator};
20 use rewrite::{Rewrite, RewriteContext};
22 use source_map::SpanUtils;
24 use utils::{is_same_visibility, mk_sp, rewrite_ident};
25 use visitor::FmtVisitor;
30 /// Returns a name imported by a `use` declaration. e.g. returns `Ordering`
31 /// for `std::cmp::Ordering` and `self` for `std::cmp::self`.
32 pub fn path_to_imported_ident(path: &ast::Path) -> ast::Ident {
33 path.segments.last().unwrap().ident
36 impl<'a> FmtVisitor<'a> {
37 pub fn format_import(&mut self, item: &ast::Item, tree: &ast::UseTree) {
38 let span = item.span();
39 let shape = self.shape();
40 let rw = UseTree::from_ast(
44 Some(item.vis.clone()),
46 Some(item.attrs.clone()),
47 ).rewrite_top_level(&self.get_context(), shape);
49 Some(ref s) if s.is_empty() => {
50 // Format up to last newline
51 let prev_span = mk_sp(self.last_pos, source!(self, span).lo());
52 let trimmed_snippet = self.snippet(prev_span).trim_right();
53 let span_end = self.last_pos + BytePos(trimmed_snippet.len() as u32);
54 self.format_missing(span_end);
55 // We have an excessive newline from the removed import.
56 if self.buffer.ends_with('\n') {
58 self.line_number -= 1;
60 self.last_pos = source!(self, span).hi();
63 self.format_missing_with_indent(source!(self, span).lo());
65 self.last_pos = source!(self, span).hi();
68 self.format_missing_with_indent(source!(self, span).lo());
69 self.format_missing(source!(self, span).hi());
75 // Ordering of imports
77 // We order imports by translating to our own representation and then sorting.
78 // The Rust AST data structures are really bad for this. Rustfmt applies a bunch
79 // of normalisations to imports and since we want to sort based on the result
80 // of these (and to maintain idempotence) we must apply the same normalisations
81 // to the data structures for sorting.
83 // We sort `self` and `super` before other imports, then identifier imports,
84 // then glob imports, then lists of imports. We do not take aliases into account
85 // when ordering unless the imports are identical except for the alias (rare in
88 // FIXME(#2531) - we should unify the comparison code here with the formatting
89 // code elsewhere since we are essentially string-ifying twice. Furthermore, by
90 // parsing to our own format on comparison, we repeat a lot of work when
93 // FIXME we do a lot of allocation to make our own representation.
94 #[derive(Clone, Eq, PartialEq)]
96 Ident(String, Option<String>),
98 Super(Option<String>),
105 pub path: Vec<UseSegment>,
107 // Comment information within nested use tree.
108 pub list_item: Option<ListItem>,
109 // Additional fields for top level use items.
110 // Should we have another struct for top-level use items rather than reusing this?
111 visibility: Option<ast::Visibility>,
112 attrs: Option<Vec<ast::Attribute>>,
115 impl PartialEq for UseTree {
116 fn eq(&self, other: &UseTree) -> bool {
117 self.path == other.path
120 impl Eq for UseTree {}
122 impl Spanned for UseTree {
123 fn span(&self) -> Span {
124 let lo = if let Some(ref attrs) = self.attrs {
125 attrs.iter().next().map_or(self.span.lo(), |a| a.span.lo())
129 mk_sp(lo, self.span.hi())
134 // Clone a version of self with any top-level alias removed.
135 fn remove_alias(&self) -> UseSegment {
137 UseSegment::Ident(ref s, _) => UseSegment::Ident(s.clone(), None),
138 UseSegment::Slf(_) => UseSegment::Slf(None),
139 UseSegment::Super(_) => UseSegment::Super(None),
144 fn from_path_segment(
145 context: &RewriteContext,
146 path_seg: &ast::PathSegment,
148 ) -> Option<UseSegment> {
149 let name = rewrite_ident(context, path_seg.ident);
150 if name.is_empty() || name == "{{root}}" {
154 "self" => UseSegment::Slf(None),
155 "super" => UseSegment::Super(None),
157 let mod_sep = if modsep { "::" } else { "" };
158 UseSegment::Ident(format!("{}{}", mod_sep, name), None)
164 pub fn merge_use_trees(use_trees: Vec<UseTree>) -> Vec<UseTree> {
165 let mut result = Vec::with_capacity(use_trees.len());
166 for use_tree in use_trees {
167 if use_tree.has_comment() || use_tree.attrs.is_some() {
168 result.push(use_tree);
172 for flattened in use_tree.flatten() {
173 merge_use_trees_inner(&mut result, flattened);
179 fn merge_use_trees_inner(trees: &mut Vec<UseTree>, use_tree: UseTree) {
180 for tree in trees.iter_mut() {
181 if tree.share_prefix(&use_tree) {
182 tree.merge(&use_tree);
187 trees.push(use_tree);
190 impl fmt::Debug for UseTree {
191 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
192 fmt::Display::fmt(self, f)
196 impl fmt::Debug for UseSegment {
197 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
198 fmt::Display::fmt(self, f)
202 impl fmt::Display for UseSegment {
203 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
205 UseSegment::Glob => write!(f, "*"),
206 UseSegment::Ident(ref s, _) => write!(f, "{}", s),
207 UseSegment::Slf(..) => write!(f, "self"),
208 UseSegment::Super(..) => write!(f, "super"),
209 UseSegment::List(ref list) => {
211 for (i, item) in list.iter().enumerate() {
212 let is_last = i == list.len() - 1;
213 write!(f, "{}", item)?;
223 impl fmt::Display for UseTree {
224 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
225 for (i, segment) in self.path.iter().enumerate() {
226 let is_last = i == self.path.len() - 1;
227 write!(f, "{}", segment)?;
237 // Rewrite use tree with `use ` and a trailing `;`.
238 pub fn rewrite_top_level(&self, context: &RewriteContext, shape: Shape) -> Option<String> {
239 let vis = self.visibility.as_ref().map_or(Cow::from(""), |vis| {
240 ::utils::format_visibility(context, &vis)
243 .rewrite(context, shape.offset_left(vis.len())?)
248 format!("{}use {};", vis, s)
251 if let Some(ref attrs) = self.attrs {
252 let attr_str = attrs.rewrite(context, shape)?;
253 let lo = attrs.last().as_ref()?.span().hi();
254 let hi = self.span.lo();
255 let span = mk_sp(lo, hi);
256 combine_strs_with_missing_comments(context, &attr_str, &use_str, span, shape, false)
262 // FIXME: Use correct span?
263 // The given span is essentially incorrect, since we are reconstructing
264 // use statements. This should not be a problem, though, since we have
265 // already tried to extract comment and observed that there are no comment
266 // around the given use item, and the span will not be used afterward.
267 fn from_path(path: Vec<UseSegment>, span: Span) -> UseTree {
277 pub fn from_ast_with_normalization(
278 context: &RewriteContext,
280 ) -> Option<UseTree> {
282 ast::ItemKind::Use(ref use_tree) => Some(
287 Some(item.vis.clone()),
288 Some(item.span.lo()),
289 if item.attrs.is_empty() {
292 Some(item.attrs.clone())
301 context: &RewriteContext,
303 list_item: Option<ListItem>,
304 visibility: Option<ast::Visibility>,
305 opt_lo: Option<BytePos>,
306 attrs: Option<Vec<ast::Attribute>>,
308 let span = if let Some(lo) = opt_lo {
309 mk_sp(lo, a.span.hi())
313 let mut result = UseTree {
321 let leading_modsep = context.config.edition() == Edition::Edition2018
322 && a.prefix.to_string().len() > 2
323 && a.prefix.to_string().starts_with("::");
325 for p in &a.prefix.segments {
326 if let Some(use_segment) = UseSegment::from_path_segment(context, p, leading_modsep) {
327 result.path.push(use_segment);
331 UseTreeKind::Glob => {
332 result.path.push(UseSegment::Glob);
334 UseTreeKind::Nested(ref list) => {
335 // Extract comments between nested use items.
336 // This needs to be done before sorting use items.
337 let items: Vec<_> = itemize_list(
338 context.snippet_provider,
339 list.iter().map(|(tree, _)| tree),
342 |tree| tree.span.lo(),
343 |tree| tree.span.hi(),
344 |_| Some("".to_owned()), // We only need comments for now.
345 context.snippet_provider.span_after(a.span, "{"),
349 result.path.push(UseSegment::List(
351 .zip(items.into_iter())
352 .map(|(t, list_item)| {
353 Self::from_ast(context, &t.0, Some(list_item), None, None, None)
357 UseTreeKind::Simple(ref rename, ..) => {
358 let name = rewrite_ident(context, path_to_imported_ident(&a.prefix)).to_owned();
359 let alias = rename.and_then(|ident| {
360 if ident.name == "_" {
363 } else if ident == path_to_imported_ident(&a.prefix) {
366 Some(rewrite_ident(context, ident).to_owned())
369 let segment = match name.as_ref() {
370 "self" => UseSegment::Slf(alias),
371 "super" => UseSegment::Super(alias),
372 _ => UseSegment::Ident(name, alias),
375 // `name` is already in result.
377 result.path.push(segment);
383 // Do the adjustments that rustfmt does elsewhere to use paths.
384 pub fn normalize(mut self) -> UseTree {
385 let mut last = self.path.pop().expect("Empty use tree?");
386 // Hack around borrow checker.
387 let mut normalize_sole_list = false;
388 let mut aliased_self = false;
390 // Remove foo::{} or self without attributes.
392 _ if self.attrs.is_some() => (),
393 UseSegment::List(ref list) if list.is_empty() => {
397 UseSegment::Slf(None) if self.path.is_empty() && self.visibility.is_some() => {
404 // Normalise foo::self -> foo.
405 if let UseSegment::Slf(None) = last {
406 if !self.path.is_empty() {
411 // Normalise foo::self as bar -> foo as bar.
412 if let UseSegment::Slf(_) = last {
413 match self.path.last() {
415 Some(UseSegment::Ident(_, None)) => {
422 let mut done = false;
424 match self.path.last_mut() {
425 Some(UseSegment::Ident(_, ref mut old_rename)) => {
426 assert!(old_rename.is_none());
427 if let UseSegment::Slf(Some(rename)) = last.clone() {
428 *old_rename = Some(rename);
440 // Normalise foo::{bar} -> foo::bar
441 if let UseSegment::List(ref list) = last {
443 normalize_sole_list = true;
447 if normalize_sole_list {
449 UseSegment::List(list) => {
450 for seg in &list[0].path {
451 self.path.push(seg.clone());
453 return self.normalize();
459 // Recursively normalize elements of a list use (including sorting the list).
460 if let UseSegment::List(list) = last {
463 .map(|ut| ut.normalize())
464 .collect::<Vec<_>>();
466 last = UseSegment::List(list);
469 self.path.push(last);
473 fn has_comment(&self) -> bool {
474 self.list_item.as_ref().map_or(false, ListItem::has_comment)
477 fn same_visibility(&self, other: &UseTree) -> bool {
478 match (&self.visibility, &other.visibility) {
480 Some(source_map::Spanned {
481 node: ast::VisibilityKind::Inherited,
488 Some(source_map::Spanned {
489 node: ast::VisibilityKind::Inherited,
493 | (None, None) => true,
494 (Some(ref a), Some(ref b)) => is_same_visibility(a, b),
499 fn share_prefix(&self, other: &UseTree) -> bool {
500 if self.path.is_empty()
501 || other.path.is_empty()
502 || self.attrs.is_some()
503 || !self.same_visibility(other)
507 self.path[0] == other.path[0]
511 fn flatten(self) -> Vec<UseTree> {
512 if self.path.is_empty() {
515 match self.path.clone().last().unwrap() {
516 UseSegment::List(list) => {
517 let prefix = &self.path[..self.path.len() - 1];
518 let mut result = vec![];
519 for nested_use_tree in list {
520 for flattend in &mut nested_use_tree.clone().flatten() {
521 let mut new_path = prefix.to_vec();
522 new_path.append(&mut flattend.path);
523 result.push(UseTree {
527 visibility: self.visibility.clone(),
539 fn merge(&mut self, other: &UseTree) {
540 let mut new_path = vec![];
545 .zip(other.path.clone().into_iter())
553 if let Some(merged) = merge_rest(&self.path, &other.path, new_path.len()) {
554 new_path.push(merged);
555 self.span = self.span.to(other.span);
557 self.path = new_path;
561 fn merge_rest(a: &[UseSegment], b: &[UseSegment], len: usize) -> Option<UseSegment> {
562 let a_rest = &a[len..];
563 let b_rest = &b[len..];
564 if a_rest.is_empty() && b_rest.is_empty() {
567 if a_rest.is_empty() {
568 return Some(UseSegment::List(vec![
569 UseTree::from_path(vec![UseSegment::Slf(None)], DUMMY_SP),
570 UseTree::from_path(b_rest.to_vec(), DUMMY_SP),
573 if b_rest.is_empty() {
574 return Some(UseSegment::List(vec![
575 UseTree::from_path(vec![UseSegment::Slf(None)], DUMMY_SP),
576 UseTree::from_path(a_rest.to_vec(), DUMMY_SP),
579 if let UseSegment::List(mut list) = a_rest[0].clone() {
580 merge_use_trees_inner(&mut list, UseTree::from_path(b_rest.to_vec(), DUMMY_SP));
582 return Some(UseSegment::List(list.clone()));
585 UseTree::from_path(a_rest.to_vec(), DUMMY_SP),
586 UseTree::from_path(b_rest.to_vec(), DUMMY_SP),
589 Some(UseSegment::List(list))
592 impl PartialOrd for UseSegment {
593 fn partial_cmp(&self, other: &UseSegment) -> Option<Ordering> {
594 Some(self.cmp(other))
597 impl PartialOrd for UseTree {
598 fn partial_cmp(&self, other: &UseTree) -> Option<Ordering> {
599 Some(self.cmp(other))
602 impl Ord for UseSegment {
603 fn cmp(&self, other: &UseSegment) -> Ordering {
604 use self::UseSegment::*;
606 fn is_upper_snake_case(s: &str) -> bool {
608 .all(|c| c.is_uppercase() || c == '_' || c.is_numeric())
611 match (self, other) {
612 (&Slf(ref a), &Slf(ref b)) | (&Super(ref a), &Super(ref b)) => a.cmp(b),
613 (&Glob, &Glob) => Ordering::Equal,
614 (&Ident(ref ia, ref aa), &Ident(ref ib, ref ab)) => {
615 // snake_case < CamelCase < UPPER_SNAKE_CASE
616 if ia.starts_with(char::is_uppercase) && ib.starts_with(char::is_lowercase) {
617 return Ordering::Greater;
619 if ia.starts_with(char::is_lowercase) && ib.starts_with(char::is_uppercase) {
620 return Ordering::Less;
622 if is_upper_snake_case(ia) && !is_upper_snake_case(ib) {
623 return Ordering::Greater;
625 if !is_upper_snake_case(ia) && is_upper_snake_case(ib) {
626 return Ordering::Less;
628 let ident_ord = ia.cmp(ib);
629 if ident_ord != Ordering::Equal {
632 if aa.is_none() && ab.is_some() {
633 return Ordering::Less;
635 if aa.is_some() && ab.is_none() {
636 return Ordering::Greater;
640 (&List(ref a), &List(ref b)) => {
641 for (a, b) in a.iter().zip(b.iter()) {
643 if ord != Ordering::Equal {
648 a.len().cmp(&b.len())
650 (&Slf(_), _) => Ordering::Less,
651 (_, &Slf(_)) => Ordering::Greater,
652 (&Super(_), _) => Ordering::Less,
653 (_, &Super(_)) => Ordering::Greater,
654 (&Ident(..), _) => Ordering::Less,
655 (_, &Ident(..)) => Ordering::Greater,
656 (&Glob, _) => Ordering::Less,
657 (_, &Glob) => Ordering::Greater,
661 impl Ord for UseTree {
662 fn cmp(&self, other: &UseTree) -> Ordering {
663 for (a, b) in self.path.iter().zip(other.path.iter()) {
665 // The comparison without aliases is a hack to avoid situations like
666 // comparing `a::b` to `a as c` - where the latter should be ordered
667 // first since it is shorter.
668 if ord != Ordering::Equal && a.remove_alias().cmp(&b.remove_alias()) != Ordering::Equal
674 self.path.len().cmp(&other.path.len())
678 fn rewrite_nested_use_tree(
679 context: &RewriteContext,
680 use_tree_list: &[UseTree],
682 ) -> Option<String> {
683 let mut list_items = Vec::with_capacity(use_tree_list.len());
684 let nested_shape = match context.config.imports_indent() {
685 IndentStyle::Block => shape
686 .block_indent(context.config.tab_spaces())
687 .with_max_width(context.config)
689 IndentStyle::Visual => shape.visual_indent(0),
691 for use_tree in use_tree_list {
692 if let Some(mut list_item) = use_tree.list_item.clone() {
693 list_item.item = use_tree.rewrite(context, nested_shape);
694 list_items.push(list_item);
696 list_items.push(ListItem::from_str(use_tree.rewrite(context, nested_shape)?));
699 let has_nested_list = use_tree_list.iter().any(|use_segment| {
703 .map_or(false, |last_segment| match last_segment {
704 UseSegment::List(..) => true,
709 let remaining_width = if has_nested_list {
712 shape.width.saturating_sub(2)
715 let tactic = definitive_tactic(
717 context.config.imports_layout(),
722 let ends_with_newline = context.config.imports_indent() == IndentStyle::Block
723 && tactic != DefinitiveListTactic::Horizontal;
724 let trailing_separator = if ends_with_newline {
725 context.config.trailing_comma()
727 SeparatorTactic::Never
729 let fmt = ListFormatting::new(nested_shape, context.config)
731 .trailing_separator(trailing_separator)
732 .ends_with_newline(ends_with_newline)
733 .preserve_newline(true)
734 .nested(has_nested_list);
736 let list_str = write_list(&list_items, &fmt)?;
738 let result = if (list_str.contains('\n') || list_str.len() > remaining_width)
739 && context.config.imports_indent() == IndentStyle::Block
743 nested_shape.indent.to_string(context.config),
745 shape.indent.to_string(context.config)
748 format!("{{{}}}", list_str)
754 impl Rewrite for UseSegment {
755 fn rewrite(&self, context: &RewriteContext, shape: Shape) -> Option<String> {
757 UseSegment::Ident(ref ident, Some(ref rename)) => format!("{} as {}", ident, rename),
758 UseSegment::Ident(ref ident, None) => ident.clone(),
759 UseSegment::Slf(Some(ref rename)) => format!("self as {}", rename),
760 UseSegment::Slf(None) => "self".to_owned(),
761 UseSegment::Super(Some(ref rename)) => format!("super as {}", rename),
762 UseSegment::Super(None) => "super".to_owned(),
763 UseSegment::Glob => "*".to_owned(),
764 UseSegment::List(ref use_tree_list) => rewrite_nested_use_tree(
768 shape.offset_left(1)?.sub_width(1)?,
774 impl Rewrite for UseTree {
775 // This does NOT format attributes and visibility or add a trailing `;`.
776 fn rewrite(&self, context: &RewriteContext, mut shape: Shape) -> Option<String> {
777 let mut result = String::with_capacity(256);
778 let mut iter = self.path.iter().peekable();
779 while let Some(ref segment) = iter.next() {
780 let segment_str = segment.rewrite(context, shape)?;
781 result.push_str(&segment_str);
782 if iter.peek().is_some() {
783 result.push_str("::");
785 shape = shape.offset_left(2 + segment_str.len())?;
795 use syntax::source_map::DUMMY_SP;
797 // Parse the path part of an import. This parser is not robust and is only
798 // suitable for use in a test harness.
799 fn parse_use_tree(s: &str) -> UseTree {
800 use std::iter::Peekable;
805 input: Peekable<Chars<'a>>,
808 impl<'a> Parser<'a> {
810 self.input.next().unwrap();
813 fn eat(&mut self, c: char) {
814 assert!(self.input.next().unwrap() == c);
818 result: &mut Vec<UseSegment>,
820 alias_buf: &mut Option<String>,
823 let mut alias = None;
824 swap(alias_buf, &mut alias);
826 result.push(UseSegment::Slf(alias));
827 *buf = String::new();
829 } else if buf == "super" {
830 result.push(UseSegment::Super(alias));
831 *buf = String::new();
834 let mut name = String::new();
835 swap(buf, &mut name);
836 result.push(UseSegment::Ident(name, alias));
841 fn parse_in_list(&mut self) -> UseTree {
842 let mut result = vec![];
843 let mut buf = String::new();
844 let mut alias_buf = None;
845 while let Some(&c) = self.input.peek() {
848 assert!(buf.is_empty());
850 result.push(UseSegment::List(self.parse_list()));
854 assert!(buf.is_empty());
856 result.push(UseSegment::Glob);
861 Self::push_segment(&mut result, &mut buf, &mut alias_buf);
864 Self::push_segment(&mut result, &mut buf, &mut alias_buf);
878 alias_buf = Some(String::new());
882 if let Some(ref mut buf) = alias_buf {
890 Self::push_segment(&mut result, &mut buf, &mut alias_buf);
900 fn parse_list(&mut self) -> Vec<UseTree> {
901 let mut result = vec![];
903 match self.input.peek().unwrap() {
904 ',' | ' ' => self.bump(),
908 _ => result.push(self.parse_in_list()),
914 let mut parser = Parser {
915 input: s.chars().peekable(),
917 parser.parse_in_list()
920 macro parse_use_trees($($s:expr),* $(,)*) {
922 $(parse_use_tree($s),)*
927 fn test_use_tree_merge() {
928 macro test_merge([$($input:expr),* $(,)*], [$($output:expr),* $(,)*]) {
930 merge_use_trees(parse_use_trees!($($input,)*)),
931 parse_use_trees!($($output,)*),
935 test_merge!(["a::b::{c, d}", "a::b::{e, f}"], ["a::b::{c, d, e, f}"]);
936 test_merge!(["a::b::c", "a::b"], ["a::b::{self, c}"]);
937 test_merge!(["a::b", "a::b"], ["a::b"]);
938 test_merge!(["a", "a::b", "a::b::c"], ["a::{self, b::{self, c}}"]);
940 ["a::{b::{self, c}, d::e}", "a::d::f"],
941 ["a::{b::{self, c}, d::{e, f}}"]
944 ["a::d::f", "a::{b::{self, c}, d::e}"],
945 ["a::{b::{self, c}, d::{e, f}}"]
948 ["a::{c, d, b}", "a::{d, e, b, a, f}", "a::{f, g, c}"],
949 ["a::{a, b, c, d, e, f, g}"]
954 fn test_use_tree_flatten() {
956 parse_use_tree("a::b::{c, d, e, f}").flatten(),
957 parse_use_trees!("a::b::c", "a::b::d", "a::b::e", "a::b::f",)
961 parse_use_tree("a::b::{c::{d, e, f}, g, h::{i, j, k}}").flatten(),
975 fn test_use_tree_normalize() {
976 assert_eq!(parse_use_tree("a::self").normalize(), parse_use_tree("a"));
978 parse_use_tree("a::self as foo").normalize(),
979 parse_use_tree("a as foo")
981 assert_eq!(parse_use_tree("a::{self}").normalize(), parse_use_tree("a"));
982 assert_eq!(parse_use_tree("a::{b}").normalize(), parse_use_tree("a::b"));
984 parse_use_tree("a::{b, c::self}").normalize(),
985 parse_use_tree("a::{b, c}")
988 parse_use_tree("a::{b as bar, c::self}").normalize(),
989 parse_use_tree("a::{b as bar, c}")
994 fn test_use_tree_ord() {
995 assert!(parse_use_tree("a").normalize() < parse_use_tree("aa").normalize());
996 assert!(parse_use_tree("a").normalize() < parse_use_tree("a::a").normalize());
997 assert!(parse_use_tree("a").normalize() < parse_use_tree("*").normalize());
998 assert!(parse_use_tree("a").normalize() < parse_use_tree("{a, b}").normalize());
999 assert!(parse_use_tree("*").normalize() < parse_use_tree("{a, b}").normalize());
1002 parse_use_tree("aaaaaaaaaaaaaaa::{bb, cc, dddddddd}").normalize()
1003 < parse_use_tree("aaaaaaaaaaaaaaa::{bb, cc, ddddddddd}").normalize()
1006 parse_use_tree("serde::de::{Deserialize}").normalize()
1007 < parse_use_tree("serde_json").normalize()
1009 assert!(parse_use_tree("a::b::c").normalize() < parse_use_tree("a::b::*").normalize());
1011 parse_use_tree("foo::{Bar, Baz}").normalize()
1012 < parse_use_tree("{Bar, Baz}").normalize()
1016 parse_use_tree("foo::{self as bar}").normalize()
1017 < parse_use_tree("foo::{qux as bar}").normalize()
1020 parse_use_tree("foo::{qux as bar}").normalize()
1021 < parse_use_tree("foo::{baz, qux as bar}").normalize()
1024 parse_use_tree("foo::{self as bar, baz}").normalize()
1025 < parse_use_tree("foo::{baz, qux as bar}").normalize()
1028 assert!(parse_use_tree("foo").normalize() < parse_use_tree("Foo").normalize());
1029 assert!(parse_use_tree("foo").normalize() < parse_use_tree("foo::Bar").normalize());
1032 parse_use_tree("std::cmp::{d, c, b, a}").normalize()
1033 < parse_use_tree("std::cmp::{b, e, g, f}").normalize()