[−][src]Struct io::Data
Trait Implementations
impl<R: Clone + Read<T>, T: Clone + Copy> Clone for Data<R, T>
[src]
fn clone(&self) -> Data<R, T>ⓘ
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<R: Copy + Read<T>, T: Copy> Copy for Data<R, T>
[src]
impl<R: Debug + Read<T>, T: Debug + Copy> Debug for Data<R, T>
[src]
impl<R: Read<T>, T: Copy> Deref for Data<R, T>
[src]
impl<R: Read<T>, T: Copy> DerefMut for Data<R, T>
[src]
impl<R: Eq + Read<T>, T: Eq + Copy> Eq for Data<R, T>
[src]
impl<R: Hash + Read<T>, T: Hash + Copy> Hash for Data<R, T>
[src]
fn hash<__H: Hasher>(&self, state: &mut __H)
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<R: Read<T>, T: Copy> Iterator for Data<R, T>
[src]
type Item = Result<T, R::Err>
The type of the elements being iterated over.
fn next(&mut self) -> Option<Self::Item>
[src]
fn size_hint(&self) -> (usize, Option<usize>)
[src]
fn count(self) -> usize
1.0.0[src]
fn last(self) -> Option<Self::Item>
1.0.0[src]
fn nth(&mut self, n: usize) -> Option<Self::Item>
1.0.0[src]
fn step_by(self, step: usize) -> StepBy<Self>
1.28.0[src]
fn chain<U>(self, other: U) -> Chain<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator<Item = Self::Item>,
1.0.0[src]
U: IntoIterator<Item = Self::Item>,
fn zip<U>(self, other: U) -> Zip<Self, <U as IntoIterator>::IntoIter> where
U: IntoIterator,
1.0.0[src]
U: IntoIterator,
fn map<B, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> B,
1.0.0[src]
F: FnMut(Self::Item) -> B,
fn for_each<F>(self, f: F) where
F: FnMut(Self::Item),
1.21.0[src]
F: FnMut(Self::Item),
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(Self::Item) -> Option<B>,
fn enumerate(self) -> Enumerate<Self>
1.0.0[src]
fn peekable(self) -> Peekable<Self>
1.0.0[src]
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn map_while<B, P>(self, predicate: P) -> MapWhile<Self, P> where
P: FnMut(Self::Item) -> Option<B>,
[src]
P: FnMut(Self::Item) -> Option<B>,
fn skip(self, n: usize) -> Skip<Self>
1.0.0[src]
fn take(self, n: usize) -> Take<Self>
1.0.0[src]
fn scan<St, B, F>(self, initial_state: St, f: F) -> Scan<Self, St, F> where
F: FnMut(&mut St, Self::Item) -> Option<B>,
1.0.0[src]
F: FnMut(&mut St, Self::Item) -> Option<B>,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: IntoIterator,
1.0.0[src]
F: FnMut(Self::Item) -> U,
U: IntoIterator,
fn flatten(self) -> Flatten<Self> where
Self::Item: IntoIterator,
1.29.0[src]
Self::Item: IntoIterator,
fn fuse(self) -> Fuse<Self>
1.0.0[src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
1.0.0[src]
F: FnMut(&Self::Item),
fn by_ref(&mut self) -> &mut Self
1.0.0[src]
#[must_use =
"if you really need to exhaust the iterator, consider `.for_each(drop)` instead"]fn collect<B>(self) -> B where
B: FromIterator<Self::Item>,
1.0.0[src]
B: FromIterator<Self::Item>,
fn partition<B, F>(self, f: F) -> (B, B) where
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
1.0.0[src]
B: Default + Extend<Self::Item>,
F: FnMut(&Self::Item) -> bool,
fn partition_in_place<'a, T, P>(self, predicate: P) -> usize where
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
[src]
P: FnMut(&T) -> bool,
Self: DoubleEndedIterator<Item = &'a mut T>,
T: 'a,
fn is_partitioned<P>(self, predicate: P) -> bool where
P: FnMut(Self::Item) -> bool,
[src]
P: FnMut(Self::Item) -> bool,
fn try_fold<B, F, R>(&mut self, init: B, f: F) -> R where
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
1.27.0[src]
F: FnMut(B, Self::Item) -> R,
R: Try<Ok = B>,
fn try_for_each<F, R>(&mut self, f: F) -> R where
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
1.27.0[src]
F: FnMut(Self::Item) -> R,
R: Try<Ok = ()>,
fn fold<B, F>(self, init: B, f: F) -> B where
F: FnMut(B, Self::Item) -> B,
1.0.0[src]
F: FnMut(B, Self::Item) -> B,
fn fold_first<F>(self, f: F) -> Option<Self::Item> where
F: FnMut(Self::Item, Self::Item) -> Self::Item,
[src]
F: FnMut(Self::Item, Self::Item) -> Self::Item,
fn all<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
fn any<F>(&mut self, f: F) -> bool where
F: FnMut(Self::Item) -> bool,
1.0.0[src]
F: FnMut(Self::Item) -> bool,
fn find<P>(&mut self, predicate: P) -> Option<Self::Item> where
P: FnMut(&Self::Item) -> bool,
1.0.0[src]
P: FnMut(&Self::Item) -> bool,
fn find_map<B, F>(&mut self, f: F) -> Option<B> where
F: FnMut(Self::Item) -> Option<B>,
1.30.0[src]
F: FnMut(Self::Item) -> Option<B>,
fn try_find<F, R>(
&mut self,
f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool>,
[src]
&mut self,
f: F
) -> Result<Option<Self::Item>, <R as Try>::Error> where
F: FnMut(&Self::Item) -> R,
R: Try<Ok = bool>,
fn position<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
fn rposition<P>(&mut self, predicate: P) -> Option<usize> where
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
1.0.0[src]
P: FnMut(Self::Item) -> bool,
Self: ExactSizeIterator + DoubleEndedIterator,
fn max(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
fn min(self) -> Option<Self::Item> where
Self::Item: Ord,
1.0.0[src]
Self::Item: Ord,
fn max_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
fn max_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn min_by_key<B, F>(self, f: F) -> Option<Self::Item> where
B: Ord,
F: FnMut(&Self::Item) -> B,
1.6.0[src]
B: Ord,
F: FnMut(&Self::Item) -> B,
fn min_by<F>(self, compare: F) -> Option<Self::Item> where
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
1.15.0[src]
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn rev(self) -> Rev<Self> where
Self: DoubleEndedIterator,
1.0.0[src]
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)>,
1.0.0[src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Iterator<Item = (A, B)>,
fn copied<'a, T>(self) -> Copied<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
1.36.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Copy,
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
1.0.0[src]
Self: Iterator<Item = &'a T>,
T: 'a + Clone,
fn cycle(self) -> Cycle<Self> where
Self: Clone,
1.0.0[src]
Self: Clone,
fn sum<S>(self) -> S where
S: Sum<Self::Item>,
1.11.0[src]
S: Sum<Self::Item>,
fn product<P>(self) -> P where
P: Product<Self::Item>,
1.11.0[src]
P: Product<Self::Item>,
fn cmp<I>(self, other: I) -> Ordering where
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
1.5.0[src]
I: IntoIterator<Item = Self::Item>,
Self::Item: Ord,
fn cmp_by<I, F>(self, other: I, cmp: F) -> Ordering where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Ordering,
I: IntoIterator,
fn partial_cmp<I>(self, other: I) -> Option<Ordering> where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn partial_cmp_by<I, F>(self, other: I, partial_cmp: F) -> Option<Ordering> where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> Option<Ordering>,
I: IntoIterator,
fn eq<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn eq_by<I, F>(self, other: I, eq: F) -> bool where
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
[src]
F: FnMut(Self::Item, <I as IntoIterator>::Item) -> bool,
I: IntoIterator,
fn ne<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialEq<<I as IntoIterator>::Item>,
fn lt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn le<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn gt<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn ge<I>(self, other: I) -> bool where
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
1.5.0[src]
I: IntoIterator,
Self::Item: PartialOrd<<I as IntoIterator>::Item>,
fn is_sorted(self) -> bool where
Self::Item: PartialOrd<Self::Item>,
[src]
Self::Item: PartialOrd<Self::Item>,
fn is_sorted_by<F>(self, compare: F) -> bool where
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
[src]
F: FnMut(&Self::Item, &Self::Item) -> Option<Ordering>,
fn is_sorted_by_key<F, K>(self, f: F) -> bool where
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
[src]
F: FnMut(Self::Item) -> K,
K: PartialOrd<K>,
impl<R: Ord + Read<T>, T: Ord + Copy> Ord for Data<R, T>
[src]
fn cmp(&self, other: &Data<R, T>) -> Ordering
[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn min(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn clamp(self, min: Self, max: Self) -> Self
[src]
impl<R: PartialEq + Read<T>, T: PartialEq + Copy> PartialEq<Data<R, T>> for Data<R, T>
[src]
impl<R: PartialOrd + Read<T>, T: PartialOrd + Copy> PartialOrd<Data<R, T>> for Data<R, T>
[src]
fn partial_cmp(&self, other: &Data<R, T>) -> Option<Ordering>
[src]
fn lt(&self, other: &Data<R, T>) -> bool
[src]
fn le(&self, other: &Data<R, T>) -> bool
[src]
fn gt(&self, other: &Data<R, T>) -> bool
[src]
fn ge(&self, other: &Data<R, T>) -> bool
[src]
impl<R: Read<T>, T: Copy> StructuralEq for Data<R, T>
[src]
impl<R: Read<T>, T: Copy> StructuralPartialEq for Data<R, T>
[src]
Auto Trait Implementations
impl<R, T> Send for Data<R, T> where
R: Send,
T: Send,
R: Send,
T: Send,
impl<R, T> Sync for Data<R, T> where
R: Sync,
T: Sync,
R: Sync,
T: Sync,
impl<R, T> Unpin for Data<R, T> where
R: Unpin,
T: Unpin,
R: Unpin,
T: Unpin,
Blanket Implementations
impl<A, P> Alloc for P where
A: Alloc + ?Sized,
P: DerefMut<Target = A>,
[src]
A: Alloc + ?Sized,
P: DerefMut<Target = A>,
unsafe fn alloc(&mut self, l: Layout) -> Result<NonNull<u8>, AllocErr>
[src]
unsafe fn dealloc(&mut self, ptr: NonNull<u8>, l: Layout)
[src]
unsafe fn realloc(
&mut self,
ptr: NonNull<u8>,
old_l: Layout,
new_size: usize
) -> Result<NonNull<u8>, AllocErr>
[src]
&mut self,
ptr: NonNull<u8>,
old_l: Layout,
new_size: usize
) -> Result<NonNull<u8>, AllocErr>
unsafe fn alloc_zeroed(&mut self, l: Layout) -> Result<NonNull<u8>, AllocErr>
[src]
unsafe fn alloc_excess(&mut self, l: Layout) -> Result<Excess, AllocErr>
[src]
unsafe fn realloc_excess(
&mut self,
ptr: NonNull<u8>,
old_l: Layout,
new_size: usize
) -> Result<Excess, AllocErr>
[src]
&mut self,
ptr: NonNull<u8>,
old_l: Layout,
new_size: usize
) -> Result<Excess, AllocErr>
unsafe fn resize_in_place(
&mut self,
ptr: NonNull<u8>,
old_l: Layout,
new_size: usize
) -> Result<(), CannotReallocInPlace>
[src]
&mut self,
ptr: NonNull<u8>,
old_l: Layout,
new_size: usize
) -> Result<(), CannotReallocInPlace>
fn usable_size(&self, l: Layout) -> (usize, usize)
[src]
fn alloc_one<T>(&mut self) -> Result<Unique<T>, AllocErr>
[src]
unsafe fn dealloc_one<T>(&mut self, ptr: Unique<T>)
[src]
fn alloc_array<T>(&mut self, n: usize) -> Result<(Unique<T>, usize), AllocErr>
[src]
unsafe fn realloc_array<T>(
&mut self,
ptr: Unique<T>,
old_n: usize,
new_n: usize
) -> Result<(Unique<T>, usize), AllocErr>
[src]
&mut self,
ptr: Unique<T>,
old_n: usize,
new_n: usize
) -> Result<(Unique<T>, usize), AllocErr>
unsafe fn dealloc_array<T>(
&mut self,
ptr: Unique<T>,
n: usize
) -> Result<(), AllocErr>
[src]
&mut self,
ptr: Unique<T>,
n: usize
) -> Result<(), AllocErr>
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<I> IntoIterator for I where
I: Iterator,
[src]
I: Iterator,
type Item = <I as Iterator>::Item
The type of the elements being iterated over.
type IntoIter = I
Which kind of iterator are we turning this into?
fn into_iter(self) -> I
[src]
impl<'a, T, R> Read<T> for R where
R: DerefMut + ?Sized,
T: Copy,
<R as Deref>::Target: Read<T>,
[src]
R: DerefMut + ?Sized,
T: Copy,
<R as Deref>::Target: Read<T>,
type Err = <<R as Deref>::Target as Read<T>>::Err
fn read(&mut Self, &mut [T]) -> Result<usize, <R as Read<T>>::Err>
[src]
fn readv(&mut Self, &mut [&mut [T]]) -> Result<usize, <R as Read<T>>::Err>
[src]
fn try_read_full(&mut self, buf: &mut [T]) -> Result<usize, (Self::Err, usize)>
[src]
fn read_full<E: From<Self::Err> + From<EndOfFile>>(
&mut self,
buf: &mut [T]
) -> Result<(), (E, usize)>
[src]
&mut self,
buf: &mut [T]
) -> Result<(), (E, usize)>
fn size_hint(&self) -> (usize, Option<usize>)
[src]
fn data(self) -> Data<Self, T>ⓘ where
Self: Sized,
[src]
Self: Sized,
fn read_onto_vec<A: Alloc>(
&mut self,
xs: &mut Vec<T, A>
) -> Result<usize, Self::Err>
[src]
&mut self,
xs: &mut Vec<T, A>
) -> Result<usize, Self::Err>
fn split<P: FnMut(T) -> bool, E: From<Self::Err> + From<NoMemory>>(
self,
p: P,
keep_delim: bool
) -> Split<Self, T, P, E>ⓘ where
Self: Sized,
[src]
self,
p: P,
keep_delim: bool
) -> Split<Self, T, P, E>ⓘ where
Self: Sized,
impl<T> TryClone for T where
T: Clone,
T: Clone,
type Error = Void
fn try_clone(&self) -> Result<T, Void>
fn try_clone_from(&mut self, other: &T) -> Result<(), Void>
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<I> TryIterator for I where
I: Iterator,
I: Iterator,
type Item = <I as Iterator>::Item
type Error = Void
fn try_next(&mut self) -> Result<Option<<I as TryIterator>::Item>, Void>
impl<'a, T, W> Write<T> for W where
T: Copy,
W: DerefMut + ?Sized,
<W as Deref>::Target: Write<T>,
[src]
T: Copy,
W: DerefMut + ?Sized,
<W as Deref>::Target: Write<T>,
type Err = <<W as Deref>::Target as Write<T>>::Err
fn write(&mut Self, &[T]) -> Result<usize, <W as Write<T>>::Err>
[src]
fn writev(&mut Self, &[&[T]]) -> Result<usize, <W as Write<T>>::Err>
[src]
fn flush(&mut Self) -> Result<(), <W as Write<T>>::Err>
[src]
fn write_all<E>(&mut self, buf: &[T]) -> Result<(), (Self::Err, usize)> where
Self::Err: From<EndOfFile>,
[src]
Self::Err: From<EndOfFile>,
fn write_all_e(
&mut self,
buf: &[T]
) -> Result<(), (Either<EndOfFile, Self::Err>, usize)>
[src]
&mut self,
buf: &[T]
) -> Result<(), (Either<EndOfFile, Self::Err>, usize)>