src/imports.rs

   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.
   4 //
   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.
  10
  11 use std::cmp::Ordering;
  12
  13 use config::lists::*;
  14 use syntax::ast::{self, UseTreeKind};
  15 use syntax::source_map::{self, BytePos, Span, DUMMY_SP};
  16
  17 use comment::combine_strs_with_missing_comments;
  18 use config::IndentStyle;
  19 use lists::{definitive_tactic, itemize_list, write_list, ListFormatting, ListItem, Separator};
  20 use rewrite::{Rewrite, RewriteContext};
  21 use shape::Shape;
  22 use source_map::SpanUtils;
  23 use spanned::Spanned;
  24 use utils::{is_same_visibility, mk_sp, rewrite_ident};
  25 use visitor::FmtVisitor;
  26
  27 use std::borrow::Cow;
  28 use std::fmt;
  29
  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
  34 }
  35
  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(
  41             &self.get_context(),
  42             tree,
  43             None,
  44             Some(item.vis.clone()),
  45             Some(item.span.lo()),
  46             Some(item.attrs.clone()),
  47         ).rewrite_top_level(&self.get_context(), shape);
  48         match rw {
  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') {
  57                     self.buffer.pop();
  58                     self.line_number -= 1;
  59                 }
  60                 self.last_pos = source!(self, span).hi();
  61             }
  62             Some(ref s) => {
  63                 self.format_missing_with_indent(source!(self, span).lo());
  64                 self.push_str(s);
  65                 self.last_pos = source!(self, span).hi();
  66             }
  67             None => {
  68                 self.format_missing_with_indent(source!(self, span).lo());
  69                 self.format_missing(source!(self, span).hi());
  70             }
  71         }
  72     }
  73 }
  74
  75 // Ordering of imports
  76
  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.
  82 //
  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
  86 // practice).
  87
  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
  91 // sorting.
  92
  93 // FIXME we do a lot of allocation to make our own representation.
  94 #[derive(Clone, Eq, PartialEq)]
  95 pub enum UseSegment {
  96     Ident(String, Option<String>),
  97     Slf(Option<String>),
  98     Super(Option<String>),
  99     Glob,
 100     List(Vec<UseTree>),
 101 }
 102
 103 #[derive(Clone)]
 104 pub struct UseTree {
 105     pub path: Vec<UseSegment>,
 106     pub span: Span,
 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>>,
 113 }
 114
 115 impl PartialEq for UseTree {
 116     fn eq(&self, other: &UseTree) -> bool {
 117         self.path == other.path
 118     }
 119 }
 120 impl Eq for UseTree {}
 121
 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())
 126         } else {
 127             self.span.lo()
 128         };
 129         mk_sp(lo, self.span.hi())
 130     }
 131 }
 132
 133 impl UseSegment {
 134     // Clone a version of self with any top-level alias removed.
 135     fn remove_alias(&self) -> UseSegment {
 136         match *self {
 137             UseSegment::Ident(ref s, _) => UseSegment::Ident(s.clone(), None),
 138             UseSegment::Slf(_) => UseSegment::Slf(None),
 139             UseSegment::Super(_) => UseSegment::Super(None),
 140             _ => self.clone(),
 141         }
 142     }
 143
 144     fn from_path_segment(
 145         context: &RewriteContext,
 146         path_seg: &ast::PathSegment,
 147     ) -> Option<UseSegment> {
 148         let name = rewrite_ident(context, path_seg.ident);
 149         if name.is_empty() || name == "{{root}}" {
 150             return None;
 151         }
 152         Some(if name == "self" {
 153             UseSegment::Slf(None)
 154         } else if name == "super" {
 155             UseSegment::Super(None)
 156         } else {
 157             UseSegment::Ident((*name).to_owned(), None)
 158         })
 159     }
 160 }
 161
 162 pub fn merge_use_trees(use_trees: Vec<UseTree>) -> Vec<UseTree> {
 163     let mut result = Vec::with_capacity(use_trees.len());
 164     for use_tree in use_trees {
 165         if use_tree.has_comment() || use_tree.attrs.is_some() {
 166             result.push(use_tree);
 167             continue;
 168         }
 169
 170         for flattened in use_tree.flatten() {
 171             merge_use_trees_inner(&mut result, flattened);
 172         }
 173     }
 174     result
 175 }
 176
 177 fn merge_use_trees_inner(trees: &mut Vec<UseTree>, use_tree: UseTree) {
 178     for tree in trees.iter_mut() {
 179         if tree.share_prefix(&use_tree) {
 180             tree.merge(use_tree);
 181             return;
 182         }
 183     }
 184
 185     trees.push(use_tree);
 186 }
 187
 188 impl fmt::Debug for UseTree {
 189     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
 190         fmt::Display::fmt(self, f)
 191     }
 192 }
 193
 194 impl fmt::Debug for UseSegment {
 195     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
 196         fmt::Display::fmt(self, f)
 197     }
 198 }
 199
 200 impl fmt::Display for UseSegment {
 201     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
 202         match *self {
 203             UseSegment::Glob => write!(f, "*"),
 204             UseSegment::Ident(ref s, _) => write!(f, "{}", s),
 205             UseSegment::Slf(..) => write!(f, "self"),
 206             UseSegment::Super(..) => write!(f, "super"),
 207             UseSegment::List(ref list) => {
 208                 write!(f, "{{")?;
 209                 for (i, item) in list.iter().enumerate() {
 210                     let is_last = i == list.len() - 1;
 211                     write!(f, "{}", item)?;
 212                     if !is_last {
 213                         write!(f, ", ")?;
 214                     }
 215                 }
 216                 write!(f, "}}")
 217             }
 218         }
 219     }
 220 }
 221 impl fmt::Display for UseTree {
 222     fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
 223         for (i, segment) in self.path.iter().enumerate() {
 224             let is_last = i == self.path.len() - 1;
 225             write!(f, "{}", segment)?;
 226             if !is_last {
 227                 write!(f, "::")?;
 228             }
 229         }
 230         write!(f, "")
 231     }
 232 }
 233
 234 impl UseTree {
 235     // Rewrite use tree with `use ` and a trailing `;`.
 236     pub fn rewrite_top_level(&self, context: &RewriteContext, shape: Shape) -> Option<String> {
 237         let vis = self.visibility.as_ref().map_or(Cow::from(""), |vis| {
 238             ::utils::format_visibility(context, &vis)
 239         });
 240         let use_str = self
 241             .rewrite(context, shape.offset_left(vis.len())?)
 242             .map(|s| {
 243                 if s.is_empty() {
 244                     s.to_owned()
 245                 } else {
 246                     format!("{}use {};", vis, s)
 247                 }
 248             })?;
 249         if let Some(ref attrs) = self.attrs {
 250             let attr_str = attrs.rewrite(context, shape)?;
 251             let lo = attrs.last().as_ref()?.span().hi();
 252             let hi = self.span.lo();
 253             let span = mk_sp(lo, hi);
 254             combine_strs_with_missing_comments(context, &attr_str, &use_str, span, shape, false)
 255         } else {
 256             Some(use_str)
 257         }
 258     }
 259
 260     // FIXME: Use correct span?
 261     // The given span is essentially incorrect, since we are reconstructing
 262     // use statements. This should not be a problem, though, since we have
 263     // already tried to extract comment and observed that there are no comment
 264     // around the given use item, and the span will not be used afterward.
 265     fn from_path(path: Vec<UseSegment>, span: Span) -> UseTree {
 266         UseTree {
 267             path,
 268             span,
 269             list_item: None,
 270             visibility: None,
 271             attrs: None,
 272         }
 273     }
 274
 275     pub fn from_ast_with_normalization(
 276         context: &RewriteContext,
 277         item: &ast::Item,
 278     ) -> Option<UseTree> {
 279         match item.node {
 280             ast::ItemKind::Use(ref use_tree) => Some(
 281                 UseTree::from_ast(
 282                     context,
 283                     use_tree,
 284                     None,
 285                     Some(item.vis.clone()),
 286                     Some(item.span.lo()),
 287                     if item.attrs.is_empty() {
 288                         None
 289                     } else {
 290                         Some(item.attrs.clone())
 291                     },
 292                 ).normalize(),
 293             ),
 294             _ => None,
 295         }
 296     }
 297
 298     fn from_ast(
 299         context: &RewriteContext,
 300         a: &ast::UseTree,
 301         list_item: Option<ListItem>,
 302         visibility: Option<ast::Visibility>,
 303         opt_lo: Option<BytePos>,
 304         attrs: Option<Vec<ast::Attribute>>,
 305     ) -> UseTree {
 306         let span = if let Some(lo) = opt_lo {
 307             mk_sp(lo, a.span.hi())
 308         } else {
 309             a.span
 310         };
 311         let mut result = UseTree {
 312             path: vec![],
 313             span,
 314             list_item,
 315             visibility,
 316             attrs,
 317         };
 318         for p in &a.prefix.segments {
 319             if let Some(use_segment) = UseSegment::from_path_segment(context, p) {
 320                 result.path.push(use_segment);
 321             }
 322         }
 323         match a.kind {
 324             UseTreeKind::Glob => {
 325                 result.path.push(UseSegment::Glob);
 326             }
 327             UseTreeKind::Nested(ref list) => {
 328                 // Extract comments between nested use items.
 329                 // This needs to be done before sorting use items.
 330                 let items: Vec<_> = itemize_list(
 331                     context.snippet_provider,
 332                     list.iter().map(|(tree, _)| tree),
 333                     "}",
 334                     ",",
 335                     |tree| tree.span.lo(),
 336                     |tree| tree.span.hi(),
 337                     |_| Some("".to_owned()), // We only need comments for now.
 338                     context.snippet_provider.span_after(a.span, "{"),
 339                     a.span.hi(),
 340                     false,
 341                 ).collect();
 342                 result.path.push(UseSegment::List(
 343                     list.iter()
 344                         .zip(items.into_iter())
 345                         .map(|(t, list_item)| {
 346                             Self::from_ast(context, &t.0, Some(list_item), None, None, None)
 347                         }).collect(),
 348                 ));
 349             }
 350             UseTreeKind::Simple(ref rename, ..) => {
 351                 let name = rewrite_ident(context, path_to_imported_ident(&a.prefix)).to_owned();
 352                 let alias = rename.and_then(|ident| {
 353                     if ident == path_to_imported_ident(&a.prefix) {
 354                         None
 355                     } else {
 356                         Some(rewrite_ident(context, ident).to_owned())
 357                     }
 358                 });
 359
 360                 let segment = if &name == "self" {
 361                     UseSegment::Slf(alias)
 362                 } else if &name == "super" {
 363                     UseSegment::Super(alias)
 364                 } else {
 365                     UseSegment::Ident(name, alias)
 366                 };
 367
 368                 // `name` is already in result.
 369                 result.path.pop();
 370                 result.path.push(segment);
 371             }
 372         }
 373         result
 374     }
 375
 376     // Do the adjustments that rustfmt does elsewhere to use paths.
 377     pub fn normalize(mut self) -> UseTree {
 378         let mut last = self.path.pop().expect("Empty use tree?");
 379         // Hack around borrow checker.
 380         let mut normalize_sole_list = false;
 381         let mut aliased_self = false;
 382
 383         // Remove foo::{} or self without attributes.
 384         match last {
 385             _ if self.attrs.is_some() => (),
 386             UseSegment::List(ref list) if list.is_empty() => {
 387                 self.path = vec![];
 388                 return self;
 389             }
 390             UseSegment::Slf(None) if self.path.is_empty() && self.visibility.is_some() => {
 391                 self.path = vec![];
 392                 return self;
 393             }
 394             _ => (),
 395         }
 396
 397         // Normalise foo::self -> foo.
 398         if let UseSegment::Slf(None) = last {
 399             if !self.path.is_empty() {
 400                 return self;
 401             }
 402         }
 403
 404         // Normalise foo::self as bar -> foo as bar.
 405         if let UseSegment::Slf(_) = last {
 406             match self.path.last() {
 407                 None => {}
 408                 Some(UseSegment::Ident(_, None)) => {
 409                     aliased_self = true;
 410                 }
 411                 _ => unreachable!(),
 412             }
 413         }
 414
 415         let mut done = false;
 416         if aliased_self {
 417             match self.path.last_mut() {
 418                 Some(UseSegment::Ident(_, ref mut old_rename)) => {
 419                     assert!(old_rename.is_none());
 420                     if let UseSegment::Slf(Some(rename)) = last.clone() {
 421                         *old_rename = Some(rename);
 422                         done = true;
 423                     }
 424                 }
 425                 _ => unreachable!(),
 426             }
 427         }
 428
 429         if done {
 430             return self;
 431         }
 432
 433         // Normalise foo::{bar} -> foo::bar
 434         if let UseSegment::List(ref list) = last {
 435             if list.len() == 1 {
 436                 normalize_sole_list = true;
 437             }
 438         }
 439
 440         if normalize_sole_list {
 441             match last {
 442                 UseSegment::List(list) => {
 443                     for seg in &list[0].path {
 444                         self.path.push(seg.clone());
 445                     }
 446                     return self.normalize();
 447                 }
 448                 _ => unreachable!(),
 449             }
 450         }
 451
 452         // Recursively normalize elements of a list use (including sorting the list).
 453         if let UseSegment::List(list) = last {
 454             let mut list = list
 455                 .into_iter()
 456                 .map(|ut| ut.normalize())
 457                 .collect::<Vec<_>>();
 458             list.sort();
 459             last = UseSegment::List(list);
 460         }
 461
 462         self.path.push(last);
 463         self
 464     }
 465
 466     fn has_comment(&self) -> bool {
 467         self.list_item.as_ref().map_or(false, ListItem::has_comment)
 468     }
 469
 470     fn same_visibility(&self, other: &UseTree) -> bool {
 471         match (&self.visibility, &other.visibility) {
 472             (
 473                 Some(source_map::Spanned {
 474                     node: ast::VisibilityKind::Inherited,
 475                     ..
 476                 }),
 477                 None,
 478             )
 479             | (
 480                 None,
 481                 Some(source_map::Spanned {
 482                     node: ast::VisibilityKind::Inherited,
 483                     ..
 484                 }),
 485             )
 486             | (None, None) => true,
 487             (Some(ref a), Some(ref b)) => is_same_visibility(a, b),
 488             _ => false,
 489         }
 490     }
 491
 492     fn share_prefix(&self, other: &UseTree) -> bool {
 493         if self.path.is_empty()
 494             || other.path.is_empty()
 495             || self.attrs.is_some()
 496             || !self.same_visibility(other)
 497         {
 498             false
 499         } else {
 500             self.path[0] == other.path[0]
 501         }
 502     }
 503
 504     fn flatten(self) -> Vec<UseTree> {
 505         if self.path.is_empty() {
 506             return vec![self];
 507         }
 508         match self.path.clone().last().unwrap() {
 509             UseSegment::List(list) => {
 510                 let prefix = &self.path[..self.path.len() - 1];
 511                 let mut result = vec![];
 512                 for nested_use_tree in list {
 513                     for flattend in &mut nested_use_tree.clone().flatten() {
 514                         let mut new_path = prefix.to_vec();
 515                         new_path.append(&mut flattend.path);
 516                         result.push(UseTree {
 517                             path: new_path,
 518                             span: self.span,
 519                             list_item: None,
 520                             visibility: self.visibility.clone(),
 521                             attrs: None,
 522                         });
 523                     }
 524                 }
 525
 526                 result
 527             }
 528             _ => vec![self],
 529         }
 530     }
 531
 532     fn merge(&mut self, other: UseTree) {
 533         let mut new_path = vec![];
 534         for (a, b) in self
 535             .path
 536             .clone()
 537             .iter_mut()
 538             .zip(other.path.clone().into_iter())
 539         {
 540             if *a == b {
 541                 new_path.push(b);
 542             } else {
 543                 break;
 544             }
 545         }
 546         if let Some(merged) = merge_rest(&self.path, &other.path, new_path.len()) {
 547             new_path.push(merged);
 548             self.span = self.span.to(other.span);
 549         }
 550         self.path = new_path;
 551     }
 552 }
 553
 554 fn merge_rest(a: &[UseSegment], b: &[UseSegment], len: usize) -> Option<UseSegment> {
 555     let a_rest = &a[len..];
 556     let b_rest = &b[len..];
 557     if a_rest.is_empty() && b_rest.is_empty() {
 558         return None;
 559     }
 560     if a_rest.is_empty() {
 561         return Some(UseSegment::List(vec![
 562             UseTree::from_path(vec![UseSegment::Slf(None)], DUMMY_SP),
 563             UseTree::from_path(b_rest.to_vec(), DUMMY_SP),
 564         ]));
 565     }
 566     if b_rest.is_empty() {
 567         return Some(UseSegment::List(vec![
 568             UseTree::from_path(vec![UseSegment::Slf(None)], DUMMY_SP),
 569             UseTree::from_path(a_rest.to_vec(), DUMMY_SP),
 570         ]));
 571     }
 572     if let UseSegment::List(mut list) = a_rest[0].clone() {
 573         merge_use_trees_inner(&mut list, UseTree::from_path(b_rest.to_vec(), DUMMY_SP));
 574         list.sort();
 575         return Some(UseSegment::List(list.clone()));
 576     }
 577     let mut list = vec![
 578         UseTree::from_path(a_rest.to_vec(), DUMMY_SP),
 579         UseTree::from_path(b_rest.to_vec(), DUMMY_SP),
 580     ];
 581     list.sort();
 582     Some(UseSegment::List(list))
 583 }
 584
 585 impl PartialOrd for UseSegment {
 586     fn partial_cmp(&self, other: &UseSegment) -> Option<Ordering> {
 587         Some(self.cmp(other))
 588     }
 589 }
 590 impl PartialOrd for UseTree {
 591     fn partial_cmp(&self, other: &UseTree) -> Option<Ordering> {
 592         Some(self.cmp(other))
 593     }
 594 }
 595 impl Ord for UseSegment {
 596     fn cmp(&self, other: &UseSegment) -> Ordering {
 597         use self::UseSegment::*;
 598
 599         fn is_upper_snake_case(s: &str) -> bool {
 600             s.chars()
 601                 .all(|c| c.is_uppercase() || c == '_' || c.is_numeric())
 602         }
 603
 604         match (self, other) {
 605             (&Slf(ref a), &Slf(ref b)) | (&Super(ref a), &Super(ref b)) => a.cmp(b),
 606             (&Glob, &Glob) => Ordering::Equal,
 607             (&Ident(ref ia, ref aa), &Ident(ref ib, ref ab)) => {
 608                 // snake_case < CamelCase < UPPER_SNAKE_CASE
 609                 if ia.starts_with(char::is_uppercase) && ib.starts_with(char::is_lowercase) {
 610                     return Ordering::Greater;
 611                 }
 612                 if ia.starts_with(char::is_lowercase) && ib.starts_with(char::is_uppercase) {
 613                     return Ordering::Less;
 614                 }
 615                 if is_upper_snake_case(ia) && !is_upper_snake_case(ib) {
 616                     return Ordering::Greater;
 617                 }
 618                 if !is_upper_snake_case(ia) && is_upper_snake_case(ib) {
 619                     return Ordering::Less;
 620                 }
 621                 let ident_ord = ia.cmp(ib);
 622                 if ident_ord != Ordering::Equal {
 623                     return ident_ord;
 624                 }
 625                 if aa.is_none() && ab.is_some() {
 626                     return Ordering::Less;
 627                 }
 628                 if aa.is_some() && ab.is_none() {
 629                     return Ordering::Greater;
 630                 }
 631                 aa.cmp(ab)
 632             }
 633             (&List(ref a), &List(ref b)) => {
 634                 for (a, b) in a.iter().zip(b.iter()) {
 635                     let ord = a.cmp(b);
 636                     if ord != Ordering::Equal {
 637                         return ord;
 638                     }
 639                 }
 640
 641                 a.len().cmp(&b.len())
 642             }
 643             (&Slf(_), _) => Ordering::Less,
 644             (_, &Slf(_)) => Ordering::Greater,
 645             (&Super(_), _) => Ordering::Less,
 646             (_, &Super(_)) => Ordering::Greater,
 647             (&Ident(..), _) => Ordering::Less,
 648             (_, &Ident(..)) => Ordering::Greater,
 649             (&Glob, _) => Ordering::Less,
 650             (_, &Glob) => Ordering::Greater,
 651         }
 652     }
 653 }
 654 impl Ord for UseTree {
 655     fn cmp(&self, other: &UseTree) -> Ordering {
 656         for (a, b) in self.path.iter().zip(other.path.iter()) {
 657             let ord = a.cmp(b);
 658             // The comparison without aliases is a hack to avoid situations like
 659             // comparing `a::b` to `a as c` - where the latter should be ordered
 660             // first since it is shorter.
 661             if ord != Ordering::Equal && a.remove_alias().cmp(&b.remove_alias()) != Ordering::Equal
 662             {
 663                 return ord;
 664             }
 665         }
 666
 667         self.path.len().cmp(&other.path.len())
 668     }
 669 }
 670
 671 fn rewrite_nested_use_tree(
 672     context: &RewriteContext,
 673     use_tree_list: &[UseTree],
 674     shape: Shape,
 675 ) -> Option<String> {
 676     let mut list_items = Vec::with_capacity(use_tree_list.len());
 677     let nested_shape = match context.config.imports_indent() {
 678         IndentStyle::Block => shape
 679             .block_indent(context.config.tab_spaces())
 680             .with_max_width(context.config)
 681             .sub_width(1)?,
 682         IndentStyle::Visual => shape.visual_indent(0),
 683     };
 684     for use_tree in use_tree_list {
 685         if let Some(mut list_item) = use_tree.list_item.clone() {
 686             list_item.item = use_tree.rewrite(context, nested_shape);
 687             list_items.push(list_item);
 688         } else {
 689             list_items.push(ListItem::from_str(use_tree.rewrite(context, nested_shape)?));
 690         }
 691     }
 692     let has_nested_list = use_tree_list.iter().any(|use_segment| {
 693         use_segment
 694             .path
 695             .last()
 696             .map_or(false, |last_segment| match last_segment {
 697                 UseSegment::List(..) => true,
 698                 _ => false,
 699             })
 700     });
 701
 702     let remaining_width = if has_nested_list {
 703         0
 704     } else {
 705         shape.width.saturating_sub(2)
 706     };
 707
 708     let tactic = definitive_tactic(
 709         &list_items,
 710         context.config.imports_layout(),
 711         Separator::Comma,
 712         remaining_width,
 713     );
 714
 715     let ends_with_newline = context.config.imports_indent() == IndentStyle::Block
 716         && tactic != DefinitiveListTactic::Horizontal;
 717     let trailing_separator = if ends_with_newline {
 718         context.config.trailing_comma()
 719     } else {
 720         SeparatorTactic::Never
 721     };
 722     let fmt = ListFormatting::new(nested_shape, context.config)
 723         .tactic(tactic)
 724         .trailing_separator(trailing_separator)
 725         .ends_with_newline(ends_with_newline)
 726         .preserve_newline(true)
 727         .nested(has_nested_list);
 728
 729     let list_str = write_list(&list_items, &fmt)?;
 730
 731     let result = if (list_str.contains('\n') || list_str.len() > remaining_width)
 732         && context.config.imports_indent() == IndentStyle::Block
 733     {
 734         format!(
 735             "{{\n{}{}\n{}}}",
 736             nested_shape.indent.to_string(context.config),
 737             list_str,
 738             shape.indent.to_string(context.config)
 739         )
 740     } else {
 741         format!("{{{}}}", list_str)
 742     };
 743
 744     Some(result)
 745 }
 746
 747 impl Rewrite for UseSegment {
 748     fn rewrite(&self, context: &RewriteContext, shape: Shape) -> Option<String> {
 749         Some(match *self {
 750             UseSegment::Ident(ref ident, Some(ref rename)) => format!("{} as {}", ident, rename),
 751             UseSegment::Ident(ref ident, None) => ident.clone(),
 752             UseSegment::Slf(Some(ref rename)) => format!("self as {}", rename),
 753             UseSegment::Slf(None) => "self".to_owned(),
 754             UseSegment::Super(Some(ref rename)) => format!("super as {}", rename),
 755             UseSegment::Super(None) => "super".to_owned(),
 756             UseSegment::Glob => "*".to_owned(),
 757             UseSegment::List(ref use_tree_list) => rewrite_nested_use_tree(
 758                 context,
 759                 use_tree_list,
 760                 // 1 = "{" and "}"
 761                 shape.offset_left(1)?.sub_width(1)?,
 762             )?,
 763         })
 764     }
 765 }
 766
 767 impl Rewrite for UseTree {
 768     // This does NOT format attributes and visibility or add a trailing `;`.
 769     fn rewrite(&self, context: &RewriteContext, mut shape: Shape) -> Option<String> {
 770         let mut result = String::with_capacity(256);
 771         let mut iter = self.path.iter().peekable();
 772         while let Some(ref segment) = iter.next() {
 773             let segment_str = segment.rewrite(context, shape)?;
 774             result.push_str(&segment_str);
 775             if iter.peek().is_some() {
 776                 result.push_str("::");
 777                 // 2 = "::"
 778                 shape = shape.offset_left(2 + segment_str.len())?;
 779             }
 780         }
 781         Some(result)
 782     }
 783 }
 784
 785 #[cfg(test)]
 786 mod test {
 787     use super::*;
 788     use syntax::source_map::DUMMY_SP;
 789
 790     // Parse the path part of an import. This parser is not robust and is only
 791     // suitable for use in a test harness.
 792     fn parse_use_tree(s: &str) -> UseTree {
 793         use std::iter::Peekable;
 794         use std::mem::swap;
 795         use std::str::Chars;
 796
 797         struct Parser<'a> {
 798             input: Peekable<Chars<'a>>,
 799         }
 800
 801         impl<'a> Parser<'a> {
 802             fn bump(&mut self) {
 803                 self.input.next().unwrap();
 804             }
 805
 806             fn eat(&mut self, c: char) {
 807                 assert!(self.input.next().unwrap() == c);
 808             }
 809
 810             fn push_segment(
 811                 result: &mut Vec<UseSegment>,
 812                 buf: &mut String,
 813                 alias_buf: &mut Option<String>,
 814             ) {
 815                 if !buf.is_empty() {
 816                     let mut alias = None;
 817                     swap(alias_buf, &mut alias);
 818                     if buf == "self" {
 819                         result.push(UseSegment::Slf(alias));
 820                         *buf = String::new();
 821                         *alias_buf = None;
 822                     } else if buf == "super" {
 823                         result.push(UseSegment::Super(alias));
 824                         *buf = String::new();
 825                         *alias_buf = None;
 826                     } else {
 827                         let mut name = String::new();
 828                         swap(buf, &mut name);
 829                         result.push(UseSegment::Ident(name, alias));
 830                     }
 831                 }
 832             }
 833
 834             fn parse_in_list(&mut self) -> UseTree {
 835                 let mut result = vec![];
 836                 let mut buf = String::new();
 837                 let mut alias_buf = None;
 838                 while let Some(&c) = self.input.peek() {
 839                     match c {
 840                         '{' => {
 841                             assert!(buf.is_empty());
 842                             self.bump();
 843                             result.push(UseSegment::List(self.parse_list()));
 844                             self.eat('}');
 845                         }
 846                         '*' => {
 847                             assert!(buf.is_empty());
 848                             self.bump();
 849                             result.push(UseSegment::Glob);
 850                         }
 851                         ':' => {
 852                             self.bump();
 853                             self.eat(':');
 854                             Self::push_segment(&mut result, &mut buf, &mut alias_buf);
 855                         }
 856                         '}' | ',' => {
 857                             Self::push_segment(&mut result, &mut buf, &mut alias_buf);
 858                             return UseTree {
 859                                 path: result,
 860                                 span: DUMMY_SP,
 861                                 list_item: None,
 862                                 visibility: None,
 863                                 attrs: None,
 864                             };
 865                         }
 866                         ' ' => {
 867                             self.bump();
 868                             self.eat('a');
 869                             self.eat('s');
 870                             self.eat(' ');
 871                             alias_buf = Some(String::new());
 872                         }
 873                         c => {
 874                             self.bump();
 875                             if let Some(ref mut buf) = alias_buf {
 876                                 buf.push(c);
 877                             } else {
 878                                 buf.push(c);
 879                             }
 880                         }
 881                     }
 882                 }
 883                 Self::push_segment(&mut result, &mut buf, &mut alias_buf);
 884                 UseTree {
 885                     path: result,
 886                     span: DUMMY_SP,
 887                     list_item: None,
 888                     visibility: None,
 889                     attrs: None,
 890                 }
 891             }
 892
 893             fn parse_list(&mut self) -> Vec<UseTree> {
 894                 let mut result = vec![];
 895                 loop {
 896                     match self.input.peek().unwrap() {
 897                         ',' | ' ' => self.bump(),
 898                         '}' => {
 899                             return result;
 900                         }
 901                         _ => result.push(self.parse_in_list()),
 902                     }
 903                 }
 904             }
 905         }
 906
 907         let mut parser = Parser {
 908             input: s.chars().peekable(),
 909         };
 910         parser.parse_in_list()
 911     }
 912
 913     macro parse_use_trees($($s:expr),* $(,)*) {
 914         vec![
 915             $(parse_use_tree($s),)*
 916         ]
 917     }
 918
 919     #[test]
 920     fn test_use_tree_merge() {
 921         macro test_merge([$($input:expr),* $(,)*], [$($output:expr),* $(,)*]) {
 922             assert_eq!(
 923                 merge_use_trees(parse_use_trees!($($input,)*)),
 924                 parse_use_trees!($($output,)*),
 925             );
 926         }
 927
 928         test_merge!(["a::b::{c, d}", "a::b::{e, f}"], ["a::b::{c, d, e, f}"]);
 929         test_merge!(["a::b::c", "a::b"], ["a::b::{self, c}"]);
 930         test_merge!(["a::b", "a::b"], ["a::b"]);
 931         test_merge!(["a", "a::b", "a::b::c"], ["a::{self, b::{self, c}}"]);
 932         test_merge!(
 933             ["a::{b::{self, c}, d::e}", "a::d::f"],
 934             ["a::{b::{self, c}, d::{e, f}}"]
 935         );
 936         test_merge!(
 937             ["a::d::f", "a::{b::{self, c}, d::e}"],
 938             ["a::{b::{self, c}, d::{e, f}}"]
 939         );
 940         test_merge!(
 941             ["a::{c, d, b}", "a::{d, e, b, a, f}", "a::{f, g, c}"],
 942             ["a::{a, b, c, d, e, f, g}"]
 943         );
 944     }
 945
 946     #[test]
 947     fn test_use_tree_flatten() {
 948         assert_eq!(
 949             parse_use_tree("a::b::{c, d, e, f}").flatten(),
 950             parse_use_trees!("a::b::c", "a::b::d", "a::b::e", "a::b::f",)
 951         );
 952
 953         assert_eq!(
 954             parse_use_tree("a::b::{c::{d, e, f}, g, h::{i, j, k}}").flatten(),
 955             parse_use_trees![
 956                 "a::b::c::d",
 957                 "a::b::c::e",
 958                 "a::b::c::f",
 959                 "a::b::g",
 960                 "a::b::h::i",
 961                 "a::b::h::j",
 962                 "a::b::h::k",
 963             ]
 964         );
 965     }
 966
 967     #[test]
 968     fn test_use_tree_normalize() {
 969         assert_eq!(parse_use_tree("a::self").normalize(), parse_use_tree("a"));
 970         assert_eq!(
 971             parse_use_tree("a::self as foo").normalize(),
 972             parse_use_tree("a as foo")
 973         );
 974         assert_eq!(parse_use_tree("a::{self}").normalize(), parse_use_tree("a"));
 975         assert_eq!(parse_use_tree("a::{b}").normalize(), parse_use_tree("a::b"));
 976         assert_eq!(
 977             parse_use_tree("a::{b, c::self}").normalize(),
 978             parse_use_tree("a::{b, c}")
 979         );
 980         assert_eq!(
 981             parse_use_tree("a::{b as bar, c::self}").normalize(),
 982             parse_use_tree("a::{b as bar, c}")
 983         );
 984     }
 985
 986     #[test]
 987     fn test_use_tree_ord() {
 988         assert!(parse_use_tree("a").normalize() < parse_use_tree("aa").normalize());
 989         assert!(parse_use_tree("a").normalize() < parse_use_tree("a::a").normalize());
 990         assert!(parse_use_tree("a").normalize() < parse_use_tree("*").normalize());
 991         assert!(parse_use_tree("a").normalize() < parse_use_tree("{a, b}").normalize());
 992         assert!(parse_use_tree("*").normalize() < parse_use_tree("{a, b}").normalize());
 993
 994         assert!(
 995             parse_use_tree("aaaaaaaaaaaaaaa::{bb, cc, dddddddd}").normalize()
 996                 < parse_use_tree("aaaaaaaaaaaaaaa::{bb, cc, ddddddddd}").normalize()
 997         );
 998         assert!(
 999             parse_use_tree("serde::de::{Deserialize}").normalize()
1000                 < parse_use_tree("serde_json").normalize()
1001         );
1002         assert!(parse_use_tree("a::b::c").normalize() < parse_use_tree("a::b::*").normalize());
1003         assert!(
1004             parse_use_tree("foo::{Bar, Baz}").normalize()
1005                 < parse_use_tree("{Bar, Baz}").normalize()
1006         );
1007
1008         assert!(
1009             parse_use_tree("foo::{self as bar}").normalize()
1010                 < parse_use_tree("foo::{qux as bar}").normalize()
1011         );
1012         assert!(
1013             parse_use_tree("foo::{qux as bar}").normalize()
1014                 < parse_use_tree("foo::{baz, qux as bar}").normalize()
1015         );
1016         assert!(
1017             parse_use_tree("foo::{self as bar, baz}").normalize()
1018                 < parse_use_tree("foo::{baz, qux as bar}").normalize()
1019         );
1020
1021         assert!(parse_use_tree("foo").normalize() < parse_use_tree("Foo").normalize());
1022         assert!(parse_use_tree("foo").normalize() < parse_use_tree("foo::Bar").normalize());
1023
1024         assert!(
1025             parse_use_tree("std::cmp::{d, c, b, a}").normalize()
1026                 < parse_use_tree("std::cmp::{b, e, g, f}").normalize()
1027         );
1028     }
1029 }