70 lines
2.1 KiB
Rust
70 lines
2.1 KiB
Rust
|
// Copyright 2014 The Rust Project Developers. See the COPYRIGHT
|
||
|
|
// file at the top-level directory of this distribution and at
|
||
|
|
// http://rust-lang.org/COPYRIGHT.
|
||
|
|
//
|
||
|
|
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
|
||
|
|
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
|
||
|
|
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
|
||
|
|
// option. This file may not be copied, modified, or distributed
|
||
|
|
// except according to those terms.
|
||
|
|
|
||
|
|
use std::slice;
|
||
|
|
|
||
|
|
#[deriving(Clone)]
|
||
|
|
pub struct SearchPaths {
|
||
|
|
paths: Vec<(PathKind, Path)>,
|
||
|
|
}
|
||
|
|
|
||
|
|
pub struct Iter<'a> {
|
||
|
|
kind: PathKind,
|
||
|
|
iter: slice::Iter<'a, (PathKind, Path)>,
|
||
|
|
}
|
||
|
|
|
||
|
|
#[deriving(Eq, PartialEq, Clone, Copy)]
|
||
|
|
pub enum PathKind {
|
||
|
|
Native,
|
||
|
|
Crate,
|
||
|
|
Dependency,
|
||
|
|
All,
|
||
|
|
}
|
||
|
|
|
||
|
|
impl SearchPaths {
|
||
|
|
pub fn new() -> SearchPaths {
|
||
|
|
SearchPaths { paths: Vec::new() }
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn add_path(&mut self, path: &str) {
|
||
|
|
let (kind, path) = if path.ends_with(":native") {
|
||
|
|
(PathKind::Native, path.slice_to(path.len() - ":native".len()))
|
||
|
|
} else if path.ends_with(":crate") {
|
||
|
|
(PathKind::Crate, path.slice_to(path.len() - ":crate".len()))
|
||
|
|
} else if path.ends_with(":dependency") {
|
||
|
|
(PathKind::Dependency,
|
||
|
|
path.slice_to(path.len() - ":dependency".len()))
|
||
|
|
} else if path.ends_with(":all") {
|
||
|
|
(PathKind::All, path.slice_to(path.len() - ":all".len()))
|
||
|
|
} else {
|
||
|
|
(PathKind::All, path)
|
||
|
|
};
|
||
|
|
self.paths.push((kind, Path::new(path)));
|
||
|
|
}
|
||
|
|
|
||
|
|
pub fn iter(&self, kind: PathKind) -> Iter {
|
||
|
|
Iter { kind: kind, iter: self.paths.iter() }
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
impl<'a> Iterator<&'a Path> for Iter<'a> {
|
||
|
|
fn next(&mut self) -> Option<&'a Path> {
|
||
|
|
loop {
|
||
|
|
match self.iter.next() {
|
||
|
|
Some(&(kind, ref p)) if self.kind == PathKind::All ||
|
||
|
|
kind == PathKind::All ||
|
||
|
|
kind == self.kind => return Some(p),
|
||
|
|
Some(..) => {}
|
||
|
|
None => return None,
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|