Struct std::path::Components [] [src]

pub struct Components<'a> {
    // some fields omitted
}

The core iterator giving the components of a path.

See the module documentation for an in-depth explanation of components and their role in the API.

Examples

fn main() { use std::path::Path; let path = Path::new("/tmp/foo/bar.txt"); for component in path.components() { println!("{:?}", component); } }
use std::path::Path;

let path = Path::new("/tmp/foo/bar.txt");

for component in path.components() {
    println!("{:?}", component);
}

Methods

impl<'a> Components<'a>

fn as_path(&self) -> &'a Path

Extracts a slice corresponding to the portion of the path remaining for iteration.

Examples

fn main() { use std::path::Path; let path = Path::new("/tmp/foo/bar.txt"); println!("{:?}", path.components().as_path()); }
use std::path::Path;

let path = Path::new("/tmp/foo/bar.txt");

println!("{:?}", path.components().as_path());

fn peek(&self) -> Option<Component<'a>>

Unstable

Examine the next component without consuming it.

Trait Implementations

impl<'a> AsRef<Path> for Components<'a>

fn as_ref(&self) -> &Path

impl<'a> AsRef<OsStr> for Components<'a>

fn as_ref(&self) -> &OsStr

impl<'a> Iterator for Components<'a>

type Item = Component<'a>

fn next(&mut self) -> Option<Component<'a>>

fn size_hint(&self) -> (usize, Option<usize>)

fn count(self) -> usize

fn last(self) -> Option<Self::Item>

fn nth(&mut self, n: usize) -> Option<Self::Item>

fn chain<U>(self, other: U) -> Chain<Self, U::IntoIter> where U: IntoIterator<Item=Self::Item>

fn zip<U>(self, other: U) -> Zip<Self, U::IntoIter> where U: IntoIterator

fn map<B, F>(self, f: F) -> Map<Self, F> where F: FnMut(Self::Item) -> B

fn filter<P>(self, predicate: P) -> Filter<Self, P> where P: FnMut(&Self::Item) -> bool

fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where F: FnMut(Self::Item) -> Option<B>

fn enumerate(self) -> Enumerate<Self>

fn peekable(self) -> Peekable<Self>

fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where P: FnMut(&Self::Item) -> bool

fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where P: FnMut(&Self::Item) -> bool

fn skip(self, n: usize) -> Skip<Self>

fn take(self, n: usize) -> Take<Self>

fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where F: FnMut(&mut St, Self::Item) -> Option<B>

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where U: IntoIterator, F: FnMut(Self::Item) -> U

fn fuse(self) -> Fuse<Self>

fn inspect<F>(self, f: F) -> Inspect<Self, F> where F: FnMut(&Self::Item) -> ()

fn by_ref(&mut self) -> &mut Self

fn collect<B>(self) -> B where B: FromIterator<Self::Item>

fn partition<B, F>(self, f: F) -> (B, B) where F: FnMut(&Self::Item) -> bool, B: Default + Extend<Self::Item>

fn fold<B, F>(self, init: B, f: F) -> B where F: FnMut(B, Self::Item) -> B

fn all<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

fn any<F>(&mut self, f: F) -> bool where F: FnMut(Self::Item) -> bool

fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where P: FnMut(&Self::Item) -> bool

fn position<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool

fn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: ExactSizeIterator + DoubleEndedIterator

fn max(self) -> Option<Self::Item> where Self::Item: Ord

fn min(self) -> Option<Self::Item> where Self::Item: Ord

fn min_max(self) -> MinMaxResult<Self::Item> where Self::Item: Ord

fn max_by<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

fn min_by<B, F>(self, f: F) -> Option<Self::Item> where B: Ord, F: FnMut(&Self::Item) -> B

fn rev(self) -> Rev<Self> where Self: DoubleEndedIterator

fn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Iterator<Item=(A, B)>

fn cloned<'a, T>(self) -> Cloned<Self> where T: 'a + Clone, Self: Iterator<Item=&'a T>

fn cycle(self) -> Cycle<Self> where Self: Clone

fn reverse_in_place<'a, T>(&mut self) where T: 'a, Self: Iterator<Item=&'a mut T> + DoubleEndedIterator

fn sum<S = Self::Item>(self) -> S where S: Add<Self::Item, Output=S> + Zero

fn product<P = Self::Item>(self) -> P where P: Mul<Self::Item, Output=P> + One

impl<'a> DoubleEndedIterator for Components<'a>

fn next_back(&mut self) -> Option<Component<'a>>

impl<'a> PartialEq for Components<'a>

fn eq(&self, other: &Components<'a>) -> bool

fn ne(&self, other: &Rhs) -> bool

impl<'a> Eq for Components<'a>

impl<'a> PartialOrd for Components<'a>

fn partial_cmp(&self, other: &Components<'a>) -> Option<Ordering>

fn lt(&self, other: &Rhs) -> bool

fn le(&self, other: &Rhs) -> bool

fn gt(&self, other: &Rhs) -> bool

fn ge(&self, other: &Rhs) -> bool

impl<'a> Ord for Components<'a>

fn cmp(&self, other: &Components<'a>) -> Ordering

Derived Implementations

impl<'a> Clone for Components<'a>

fn clone(&self) -> Components<'a>

fn clone_from(&mut self, source: &Self)