Struct core::str::Lines
[−]
[src]
pub struct Lines<'a>(_);
Created with the method .lines()`.lines()`.
pub struct Lines<'a>(_);
Created with the method .lines()`.lines()`.
impl<'a> Iterator for Lines<'a>type Item = &'a strfn next(&mut self) -> Option<&'a str>fn size_hint(&self) -> (usize, Option<usize>)fn count(self) -> usize where Self: Sizedfn last(self) -> Option<Self::Item> where Self: Sizedfn nth(&mut self, n: usize) -> Option<Self::Item> where Self: Sizedfn chain<U>(self, other: U) -> Chain<Self, U> where Self: Sized, U: IntoIterator<Item=Self::Item>fn zip<U>(self, other: U) -> Zip<Self, U> where Self: Sized, U: IntoIteratorfn map<B, F>(self, f: F) -> Map<Self, F> where Self: Sized, F: FnMut(Self::Item) -> Bfn filter<P>(self, predicate: P) -> Filter<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> boolfn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where Self: Sized, F: FnMut(Self::Item) -> Option<B>fn enumerate(self) -> Enumerate<Self> where Self: Sizedfn peekable(self) -> Peekable<Self> where Self: Sizedfn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> boolfn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where Self: Sized, P: FnMut(&Self::Item) -> boolfn skip(self, n: usize) -> Skip<Self> where Self: Sizedfn take(self, n: usize) -> Take<Self> where Self: Sizedfn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where Self: Sized, F: FnMut(&mut St, Self::Item) -> Option<B>fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where Self: Sized, U: IntoIterator, F: FnMut(Self::Item) -> Ufn fuse(self) -> Fuse<Self> where Self: Sizedfn inspect<F>(self, f: F) -> Inspect<Self, F> where Self: Sized, F: FnMut(&Self::Item)fn by_ref(&mut self) -> &mut Self where Self: Sizedfn collect<B: FromIterator<Self::Item>>(self) -> B where Self: Sizedfn partition<B, F>(self, f: F) -> (B, B) where Self: Sized, B: Default + Extend<Self::Item>, F: FnMut(&Self::Item) -> boolfn fold<B, F>(self, init: B, f: F) -> B where Self: Sized, F: FnMut(B, Self::Item) -> Bfn all<F>(&mut self, f: F) -> bool where Self: Sized, F: FnMut(Self::Item) -> boolfn any<F>(&mut self, f: F) -> bool where Self: Sized, F: FnMut(Self::Item) -> boolfn find<P>(&mut self, predicate: P) -> Option<Self::Item> where Self: Sized, P: FnMut(&Self::Item) -> boolfn position<P>(&mut self, predicate: P) -> Option<usize> where Self: Sized, P: FnMut(Self::Item) -> boolfn rposition<P>(&mut self, predicate: P) -> Option<usize> where P: FnMut(Self::Item) -> bool, Self: Sized + ExactSizeIterator + DoubleEndedIteratorfn max(self) -> Option<Self::Item> where Self: Sized, Self::Item: Ordfn min(self) -> Option<Self::Item> where Self: Sized, Self::Item: Ordfn min_max(self) -> MinMaxResult<Self::Item> where Self: Sized, Self::Item: Ordfn max_by<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> Bfn min_by<B: Ord, F>(self, f: F) -> Option<Self::Item> where Self: Sized, F: FnMut(&Self::Item) -> Bfn rev(self) -> Rev<Self> where Self: Sized + DoubleEndedIteratorfn unzip<A, B, FromA, FromB>(self) -> (FromA, FromB) where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Sized + Iterator<Item=(A, B)>fn cloned<'a, T: 'a>(self) -> Cloned<Self> where Self: Sized + Iterator<Item=&'a T>, T: Clonefn cycle(self) -> Cycle<Self> where Self: Sized + Clonefn reverse_in_place<'a, T: 'a>(&mut self) where Self: Sized + Iterator<Item=&'a mut T> + DoubleEndedIteratorfn sum<S = Self::Item>(self) -> S where S: Add<Self::Item, Output=S> + Zero, Self: Sizedfn product<P = Self::Item>(self) -> P where P: Mul<Self::Item, Output=P> + One, Self: Sizedimpl<'a> DoubleEndedIterator for Lines<'a>impl<'a> Clone for Lines<'a>fn clone(&self) -> Lines<'a>fn clone_from(&mut self, source: &Self)
Prefix searches with a type followed by a colon (e.g.
fn:) to restrict the search to a given type.
Accepted types are: fn, mod,
struct, enum,
trait, typedef (or
tdef).
Search functions by type signature (e.g.
vec -> usize)