1 // Copyright 2016 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 //! This module contains types and functions to support formatting specific line ranges.
13 use std::collections::HashMap;
14 use std::path::PathBuf;
16 use std::{cmp, fmt, iter, str};
18 use serde::de::{Deserialize, Deserializer};
19 use serde_json as json;
21 use syntax::codemap::{self, FileMap};
23 /// A range of lines in a file, inclusive of both ends.
24 pub struct LineRange {
25 pub file: Rc<FileMap>,
30 /// Defines the name of an input - either a file or stdin.
31 #[derive(Clone, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
37 impl From<codemap::FileName> for FileName {
38 fn from(name: codemap::FileName) -> FileName {
40 codemap::FileName::Real(p) => FileName::Real(p),
41 codemap::FileName::Custom(ref f) if f == "stdin" => FileName::Stdin,
47 impl fmt::Display for FileName {
48 fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
50 FileName::Real(p) => write!(f, "{}", p.to_str().unwrap()),
51 FileName::Stdin => write!(f, "stdin"),
57 pub fn file_name(&self) -> FileName {
58 self.file.name.clone().into()
62 /// A range that is inclusive of both ends.
63 #[derive(Clone, Copy, Debug, Eq, PartialEq, PartialOrd, Ord, Deserialize)]
69 impl<'a> From<&'a LineRange> for Range {
70 fn from(range: &'a LineRange) -> Range {
71 Range::new(range.lo, range.hi)
76 pub fn new(lo: usize, hi: usize) -> Range {
80 fn is_empty(self) -> bool {
85 fn contains(self, other: Range) -> bool {
89 !self.is_empty() && self.lo <= other.lo && self.hi >= other.hi
93 fn intersects(self, other: Range) -> bool {
94 if self.is_empty() || other.is_empty() {
97 (self.lo <= other.hi && other.hi <= self.hi)
98 || (other.lo <= self.hi && self.hi <= other.hi)
102 fn adjacent_to(self, other: Range) -> bool {
103 if self.is_empty() || other.is_empty() {
106 self.hi + 1 == other.lo || other.hi + 1 == self.lo
110 /// Returns a new `Range` with lines from `self` and `other` if they were adjacent or
111 /// intersect; returns `None` otherwise.
112 fn merge(self, other: Range) -> Option<Range> {
113 if self.adjacent_to(other) || self.intersects(other) {
115 cmp::min(self.lo, other.lo),
116 cmp::max(self.hi, other.hi),
124 /// A set of lines in files.
126 /// It is represented as a multimap keyed on file names, with values a collection of
127 /// non-overlapping ranges sorted by their start point. An inner `None` is interpreted to mean all
128 /// lines in all files.
129 #[derive(Clone, Debug, Default, PartialEq)]
130 pub struct FileLines(Option<HashMap<FileName, Vec<Range>>>);
132 /// Normalizes the ranges so that the invariants for `FileLines` hold: ranges are non-overlapping,
133 /// and ordered by their start point.
134 fn normalize_ranges(ranges: &mut HashMap<FileName, Vec<Range>>) {
135 for ranges in ranges.values_mut() {
137 let mut result = vec![];
139 let mut iter = ranges.into_iter().peekable();
140 while let Some(next) = iter.next() {
141 let mut next = *next;
142 while let Some(&&mut peek) = iter.peek() {
143 if let Some(merged) = next.merge(peek) {
144 iter.next().unwrap();
158 /// Creates a `FileLines` that contains all lines in all files.
159 pub(crate) fn all() -> FileLines {
163 /// Returns true if this `FileLines` contains all lines in all files.
164 pub(crate) fn is_all(&self) -> bool {
168 pub fn from_ranges(mut ranges: HashMap<FileName, Vec<Range>>) -> FileLines {
169 normalize_ranges(&mut ranges);
170 FileLines(Some(ranges))
173 /// Returns an iterator over the files contained in `self`.
174 pub fn files(&self) -> Files {
175 Files(self.0.as_ref().map(|m| m.keys()))
178 /// Returns true if `self` includes all lines in all files. Otherwise runs `f` on all ranges in
179 /// the designated file (if any) and returns true if `f` ever does.
180 fn file_range_matches<F>(&self, file_name: &FileName, f: F) -> bool
182 F: FnMut(&Range) -> bool,
184 let map = match self.0 {
185 // `None` means "all lines in all files".
187 Some(ref map) => map,
190 match canonicalize_path_string(file_name).and_then(|file| map.get(&file)) {
191 Some(ranges) => ranges.iter().any(f),
196 /// Returns true if `range` is fully contained in `self`.
198 pub(crate) fn contains(&self, range: &LineRange) -> bool {
199 self.file_range_matches(&range.file_name(), |r| r.contains(Range::from(range)))
202 /// Returns true if any lines in `range` are in `self`.
203 pub(crate) fn intersects(&self, range: &LineRange) -> bool {
204 self.file_range_matches(&range.file_name(), |r| r.intersects(Range::from(range)))
207 /// Returns true if `line` from `file_name` is in `self`.
208 pub(crate) fn contains_line(&self, file_name: &FileName, line: usize) -> bool {
209 self.file_range_matches(file_name, |r| r.lo <= line && r.hi >= line)
212 /// Returns true if all the lines between `lo` and `hi` from `file_name` are in `self`.
213 pub(crate) fn contains_range(&self, file_name: &FileName, lo: usize, hi: usize) -> bool {
214 self.file_range_matches(file_name, |r| r.contains(Range::new(lo, hi)))
218 /// `FileLines` files iterator.
219 pub struct Files<'a>(Option<::std::collections::hash_map::Keys<'a, FileName, Vec<Range>>>);
221 impl<'a> iter::Iterator for Files<'a> {
222 type Item = &'a FileName;
224 fn next(&mut self) -> Option<&'a FileName> {
225 self.0.as_mut().and_then(Iterator::next)
229 fn canonicalize_path_string(file: &FileName) -> Option<FileName> {
231 FileName::Real(ref path) => path.canonicalize().ok().map(FileName::Real),
232 _ => Some(file.clone()),
236 // This impl is needed for `Config::override_value` to work for use in tests.
237 impl str::FromStr for FileLines {
240 fn from_str(s: &str) -> Result<FileLines, String> {
241 let v: Vec<JsonSpan> = json::from_str(s).map_err(|e| e.to_string())?;
242 let mut m = HashMap::new();
244 let (s, r) = JsonSpan::into_tuple(js)?;
245 m.entry(s).or_insert_with(|| vec![]).push(r);
247 Ok(FileLines::from_ranges(m))
251 // For JSON decoding.
252 #[derive(Clone, Debug, Deserialize)]
254 #[serde(deserialize_with = "deserialize_filename")]
256 range: (usize, usize),
259 fn deserialize_filename<'de, D: Deserializer<'de>>(d: D) -> Result<FileName, D::Error> {
260 let s = String::deserialize(d)?;
264 Ok(FileName::Real(s.into()))
269 fn into_tuple(self) -> Result<(FileName, Range), String> {
270 let (lo, hi) = self.range;
271 let canonical = canonicalize_path_string(&self.file)
272 .ok_or_else(|| format!("Can't canonicalize {}", &self.file))?;
273 Ok((canonical, Range::new(lo, hi)))
277 // This impl is needed for inclusion in the `Config` struct. We don't have a toml representation
278 // for `FileLines`, so it will just panic instead.
279 impl<'de> ::serde::de::Deserialize<'de> for FileLines {
280 fn deserialize<D>(_: D) -> Result<Self, D::Error>
282 D: ::serde::de::Deserializer<'de>,
285 "FileLines cannot be deserialized from a project rustfmt.toml file: please \
286 specify it via the `--file-lines` option instead"
291 // We also want to avoid attempting to serialize a FileLines to toml. The
292 // `Config` struct should ensure this impl is never reached.
293 impl ::serde::ser::Serialize for FileLines {
294 fn serialize<S>(&self, _: S) -> Result<S::Ok, S::Error>
296 S: ::serde::ser::Serializer,
298 unreachable!("FileLines cannot be serialized. This is a rustfmt bug.");
307 fn test_range_intersects() {
308 assert!(Range::new(1, 2).intersects(Range::new(1, 1)));
309 assert!(Range::new(1, 2).intersects(Range::new(2, 2)));
310 assert!(!Range::new(1, 2).intersects(Range::new(0, 0)));
311 assert!(!Range::new(1, 2).intersects(Range::new(3, 10)));
312 assert!(!Range::new(1, 3).intersects(Range::new(5, 5)));
316 fn test_range_adjacent_to() {
317 assert!(!Range::new(1, 2).adjacent_to(Range::new(1, 1)));
318 assert!(!Range::new(1, 2).adjacent_to(Range::new(2, 2)));
319 assert!(Range::new(1, 2).adjacent_to(Range::new(0, 0)));
320 assert!(Range::new(1, 2).adjacent_to(Range::new(3, 10)));
321 assert!(!Range::new(1, 3).adjacent_to(Range::new(5, 5)));
325 fn test_range_contains() {
326 assert!(Range::new(1, 2).contains(Range::new(1, 1)));
327 assert!(Range::new(1, 2).contains(Range::new(2, 2)));
328 assert!(!Range::new(1, 2).contains(Range::new(0, 0)));
329 assert!(!Range::new(1, 2).contains(Range::new(3, 10)));
333 fn test_range_merge() {
334 assert_eq!(None, Range::new(1, 3).merge(Range::new(5, 5)));
335 assert_eq!(None, Range::new(4, 7).merge(Range::new(0, 1)));
337 Some(Range::new(3, 7)),
338 Range::new(3, 5).merge(Range::new(4, 7))
341 Some(Range::new(3, 7)),
342 Range::new(3, 5).merge(Range::new(5, 7))
345 Some(Range::new(3, 7)),
346 Range::new(3, 5).merge(Range::new(6, 7))
349 Some(Range::new(3, 7)),
350 Range::new(3, 7).merge(Range::new(4, 5))