exa/exa.rs

101 lines
2.9 KiB
Rust
Raw Normal View History

#![feature(phase)]
extern crate regex;
#[phase(plugin)] extern crate regex_macros;
2014-05-03 10:30:37 +00:00
use std::os;
use file::File;
use dir::Dir;
2014-05-25 16:14:50 +00:00
use options::Options;
use unix::Unix;
2014-05-03 10:30:37 +00:00
pub mod colours;
pub mod column;
pub mod dir;
pub mod format;
pub mod file;
pub mod filetype;
pub mod unix;
pub mod options;
2014-06-01 10:54:31 +00:00
pub mod sort;
2014-05-03 10:30:37 +00:00
fn main() {
2014-05-26 19:24:51 +00:00
let args = os::args();
2014-05-25 16:14:50 +00:00
match Options::getopts(args) {
Err(err) => println!("Invalid options:\n{}", err),
2014-05-25 16:14:50 +00:00
Ok(opts) => {
2014-05-26 19:24:51 +00:00
// Default to listing the current directory when a target
// isn't specified (mimic the behaviour of ls)
2014-05-25 16:14:50 +00:00
let strs = if opts.dirs.is_empty() {
vec!(".".to_string())
2014-05-25 16:14:50 +00:00
}
else {
opts.dirs.clone()
};
for dir in strs.move_iter() {
exa(&opts, dir)
2014-05-25 16:14:50 +00:00
}
}
};
2014-05-03 10:30:37 +00:00
}
fn exa(options: &Options, string: String) {
let path = Path::new(string.clone());
let dir = match Dir::readdir(path) {
Ok(dir) => dir,
Err(e) => {
println!("{}: {}", string, e);
return;
}
};
let unsorted_files = dir.files();
let files: Vec<&File> = options.transform_files(&unsorted_files);
2014-05-26 19:24:51 +00:00
// The output gets formatted into columns, which looks nicer. To
// do this, we have to write the results into a table, instead of
// displaying each file immediately, then calculating the maximum
// width of each column based on the length of the results and
// padding the fields during output.
let mut cache = Unix::empty_cache();
2014-05-26 10:08:33 +00:00
let table: Vec<Vec<String>> = files.iter()
.map(|f| options.columns.iter().map(|c| f.display(c, &mut cache)).collect())
.collect();
2014-05-03 13:26:49 +00:00
2014-05-26 19:24:51 +00:00
// Each column needs to have its invisible colour-formatting
// characters stripped before it has its width calculated, or the
// width will be incorrect and the columns won't line up properly.
// This is fairly expensive to do (it uses a regex), so the
// results are cached.
let lengths: Vec<Vec<uint>> = table.iter()
.map(|row| row.iter().map(|col| colours::strip_formatting(col).len()).collect())
.collect();
2014-05-26 19:24:51 +00:00
let column_widths: Vec<uint> = range(0, options.columns.len())
.map(|n| lengths.iter().map(|row| *row.get(n)).max().unwrap())
.collect();
2014-05-03 10:30:37 +00:00
for (field_lengths, row) in lengths.iter().zip(table.iter()) {
for (((column_length, cell), field_length), (num, column)) in column_widths.iter().zip(row.iter()).zip(field_lengths.iter()).zip(options.columns.iter().enumerate()) { // this is getting messy
if num != 0 {
2014-05-03 11:15:35 +00:00
print!(" ");
}
if num == options.columns.len() - 1 {
print!("{}", cell);
}
else {
print!("{}", column.alignment().pad_string(cell, *field_length, *column_length));
}
2014-05-03 11:15:35 +00:00
}
print!("\n");
2014-05-03 10:30:37 +00:00
}
}