[−][src]Struct async_tar::Entries

pub struct Entries<R: Read + Unpin> { /* fields omitted */ }

Stream of Entrys.

Trait Implementations

`impl<R: Read + Unpin> Stream for Entries<R>`[src]

`type Item = Result<Entry<Archive<R>>>`

Values yielded by the stream.

`fn poll_next(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>>`[src]

`fn size_hint(&self) -> (usize, Option<usize>)`[src]

Auto Trait Implementations

`impl<R> !RefUnwindSafe for Entries<R>`

`impl<R> !Send for Entries<R>`

`impl<R> !Sync for Entries<R>`

`impl<R> Unpin for Entries<R>`

`impl<R> !UnwindSafe for Entries<R>`

Blanket Implementations

`impl<T> Any for T where T: 'static + ?Sized,` [src]

`fn type_id(&self) -> TypeId`[src]

`impl<T> Borrow<T> for T where T: ?Sized,` [src]

`fn borrow(&self) -> &T`[src]

`impl<T> BorrowMut<T> for T where T: ?Sized,` [src]

`fn borrow_mut(&mut self) -> &mut T`[src]

`impl<T> From<T> for T`[src]

`fn from(t: T) -> T`[src]

`impl<T, U> Into for T where U: From<T>,` [src]

`fn into(self) -> U`[src]

`impl IntoStream for I where I: Stream,` [src]

`type Item = ::Item`

The type of the elements being iterated over.

`type IntoStream = I`

Which kind of stream are we turning this into?

`fn into_stream(self) -> I`[src]

`impl<T> StreamExt for T where T: Stream + ?Sized,` [src]

`fn next(&mut self) -> NextFuture<Self> where Self: Unpin,` [src]

`fn take(self, n: usize) -> Take<Self>`[src]

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

`fn throttle(self, d: Duration) -> Throttle<Self>`[src]

`fn step_by(self, step: usize) -> StepBy<Self>`[src]

`fn chain(self, other: U) -> Chain<Self, U> where U: Stream<Item = Self::Item>,` [src]

`fn cloned<'a, T>(self) -> Cloned<Self> where Self: Stream<Item = &'a T>, T: Clone + 'a,` [src]

`fn copied<'a, T>(self) -> Copied<Self> where Self: Stream<Item = &'a T>, T: Copy + 'a,` [src]

`fn cycle(self) -> Cycle<Self> where Self: Clone,` [src]

`fn enumerate(self) -> Enumerate<Self>`[src]

`fn delay(self, dur: Duration) -> Delay<Self>`[src]

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

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

`fn last(self) -> LastFuture<Self, Self::Item>`[src]

`fn fuse(self) -> Fuse<Self>`[src]

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

`fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoStream,` [src]

`fn flatten(self) -> Flatten<Self> where Self::Item: IntoStream,` [src]

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

`fn min_by_key<B, F>(self, key_by: F) -> MinByKeyFuture<Self, Self::Item, F> where B: Ord, F: FnMut(&Self::Item) -> B,` [src]

`fn max_by_key<B, F>(self, key_by: F) -> MaxByKeyFuture<Self, Self::Item, F> where B: Ord, F: FnMut(&Self::Item) -> B,` [src]

`fn min_by<F>(self, compare: F) -> MinByFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,` [src]

`fn max<F>(self) -> MaxFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,` [src]

`fn min<F>(self) -> MinFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,` [src]

`fn max_by<F>(self, compare: F) -> MaxByFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering,` [src]

`fn nth(&mut self, n: usize) -> NthFuture<Self> where Self: Unpin,` [src]

`fn all<F>(&mut self, f: F) -> AllFuture<Self, F, Self::Item> where F: FnMut(Self::Item) -> bool, Self: Unpin,` [src]

`fn find(&mut self, p: P) -> FindFuture<Self, P> where P: FnMut(&Self::Item) -> bool, Self: Unpin,` [src]

`fn find_map<F, B>(&mut self, f: F) -> FindMapFuture<Self, F> where F: FnMut(Self::Item) -> Option, Self: Unpin,` [src]

`fn fold<B, F>(self, init: B, f: F) -> FoldFuture<Self, F, B> where F: FnMut(B, Self::Item) -> B,` [src]

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

`fn for_each<F>(self, f: F) -> ForEachFuture<Self, F> where F: FnMut(Self::Item),` [src]

`fn any<F>(&mut self, f: F) -> AnyFuture<Self, F, Self::Item> where F: FnMut(Self::Item) -> bool, Self: Unpin,` [src]

`fn by_ref(&mut self) -> &mut Self`[src]

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

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

`fn skip(self, n: usize) -> Skip<Self>`[src]

`fn timeout(self, dur: Duration) -> Timeout<Self> where Self: Stream,` [src]

`fn try_fold<B, F, T, E>(&mut self, init: T, f: F) -> TryFoldFuture<Self, F, T> where F: FnMut(B, Self::Item) -> Result<T, E>, Self: Unpin,` [src]

`fn try_for_each<F, E>(&mut self, f: F) -> TryForEachFuture<Self, F> where F: FnMut(Self::Item) -> Result<(), E>, Self: Unpin,` [src]

`fn zip(self, other: U) -> Zip<Self, U> where U: Stream,` [src]

`fn unzip<A, B, FromA, FromB>(self) -> UnzipFuture<Self, FromA, FromB> where FromA: Default + Extend<A>, FromB: Default + Extend, Self: Stream<Item = (A, B)>,` [src]

`fn collect<'a, B>(self) -> Pin<Box<dyn Future<Output = B> + 'a>> where B: FromStream<Self::Item>, Self: 'a,` [src]

`fn merge(self, other: U) -> Merge<Self, U> where U: Stream<Item = Self::Item>,` [src]

`fn partial_cmp<S>(self, other: S) -> PartialCmpFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>,` [src]

`fn position(&mut self, predicate: P) -> PositionFuture<Self, P> where P: FnMut(Self::Item) -> bool, Self: Unpin,` [src]

`fn cmp<S>(self, other: S) -> CmpFuture<Self, S> where S: Stream, Self: Stream, Self::Item: Ord,` [src]

`fn count(self) -> CountFuture<Self>`[src]

`fn ne<S>(self, other: S) -> NeFuture<Self, S> where S: Stream, Self::Item: PartialEq<<S as Stream>::Item>,` [src]

`fn ge<S>(self, other: S) -> GeFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>,` [src]

`fn eq<S>(self, other: S) -> EqFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialEq<<S as Stream>::Item>,` [src]

`fn gt<S>(self, other: S) -> GtFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>,` [src]

`fn le<S>(self, other: S) -> LeFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>,` [src]

`fn lt<S>(self, other: S) -> LtFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>,` [src]

`fn sum<'a, S>(self) -> Pin<Box<dyn Future<Output = S> + 'a>> where S: Sum<Self::Item>, Self: Stream<Item = S> + 'a,` [src]

`fn product<'a, P>(self) -> Pin<Box<dyn Future<Output = P> + 'a>> where P: Product, Self: Stream<Item = P> + 'a,` [src]

`impl<T, U> TryFrom for T where U: Into<T>,` [src]

`type Error = Infallible`

The type returned in the event of a conversion error.

`fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>`[src]

`impl<T, U> TryInto for T where U: TryFrom<T>,` [src]

`type Error = >::Error`

The type returned in the event of a conversion error.

`fn try_into(self) -> Result<U, >::Error>`[src]

`impl<S, T, E> TryStream for S where S: Stream<Item = Result<T, E>> + ?Sized,` [src]

`type Ok = T`

The type of successful values yielded by this future

`type Error = E`

The type of failures yielded by this future

`fn try_poll_next( self: Pin<&mut S>, cx: &mut Context ) -> Poll<Option<Result<<S as TryStream>::Ok, <S as TryStream>::Error>>>`[src]

[−][src]Struct async_tar::Entries

Trait Implementations

impl<R: Read + Unpin> Stream for Entries<R>[src]

type Item = Result<Entry<Archive<R>>>

fn poll_next(self: Pin<&mut Self>, cx: &mut Context) -> Poll<Option<Self::Item>>[src]

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

Auto Trait Implementations

impl<R> !RefUnwindSafe for Entries<R>

impl<R> !Send for Entries<R>

impl<R> !Sync for Entries<R>

impl<R> Unpin for Entries<R>

impl<R> !UnwindSafe for Entries<R>

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized, [src]

fn type_id(&self) -> TypeId[src]

impl<T> Borrow<T> for T where T: ?Sized, [src]

fn borrow(&self) -> &T[src]

impl<T> BorrowMut<T> for T where T: ?Sized, [src]

fn borrow_mut(&mut self) -> &mut T[src]

impl<T> From<T> for T[src]

fn from(t: T) -> T[src]

impl<T, U> Into<U> for T where U: From<T>, [src]

fn into(self) -> U[src]

impl<I> IntoStream for I where I: Stream, [src]

type Item = <I as Stream>::Item

type IntoStream = I

fn into_stream(self) -> I[src]

impl<T> StreamExt for T where T: Stream + ?Sized, [src]

fn next(&mut self) -> NextFuture<Self> where Self: Unpin, [src]

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

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

fn throttle(self, d: Duration) -> Throttle<Self>[src]

fn step_by(self, step: usize) -> StepBy<Self>[src]

fn chain<U>(self, other: U) -> Chain<Self, U> where U: Stream<Item = Self::Item>, [src]

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

fn copied<'a, T>(self) -> Copied<Self> where Self: Stream<Item = &'a T>, T: Copy + 'a, [src]

fn cycle(self) -> Cycle<Self> where Self: Clone, [src]

fn enumerate(self) -> Enumerate<Self>[src]

fn delay(self, dur: Duration) -> Delay<Self>[src]

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

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

fn last(self) -> LastFuture<Self, Self::Item>[src]

fn fuse(self) -> Fuse<Self>[src]

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

fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where F: FnMut(Self::Item) -> U, U: IntoStream, [src]

fn flatten(self) -> Flatten<Self> where Self::Item: IntoStream, [src]

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

fn min_by_key<B, F>(self, key_by: F) -> MinByKeyFuture<Self, Self::Item, F> where B: Ord, F: FnMut(&Self::Item) -> B, [src]

fn max_by_key<B, F>(self, key_by: F) -> MaxByKeyFuture<Self, Self::Item, F> where B: Ord, F: FnMut(&Self::Item) -> B, [src]

fn min_by<F>(self, compare: F) -> MinByFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering, [src]

fn max<F>(self) -> MaxFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering, [src]

fn min<F>(self) -> MinFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering, [src]

fn max_by<F>(self, compare: F) -> MaxByFuture<Self, F, Self::Item> where F: FnMut(&Self::Item, &Self::Item) -> Ordering, [src]

fn nth(&mut self, n: usize) -> NthFuture<Self> where Self: Unpin, [src]

fn all<F>(&mut self, f: F) -> AllFuture<Self, F, Self::Item> where F: FnMut(Self::Item) -> bool, Self: Unpin, [src]

fn find<P>(&mut self, p: P) -> FindFuture<Self, P> where P: FnMut(&Self::Item) -> bool, Self: Unpin, [src]

fn find_map<F, B>(&mut self, f: F) -> FindMapFuture<Self, F> where F: FnMut(Self::Item) -> Option<B>, Self: Unpin, [src]

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

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

fn for_each<F>(self, f: F) -> ForEachFuture<Self, F> where F: FnMut(Self::Item), [src]

fn any<F>(&mut self, f: F) -> AnyFuture<Self, F, Self::Item> where F: FnMut(Self::Item) -> bool, Self: Unpin, [src]

fn by_ref(&mut self) -> &mut Self[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>, [src]

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

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

fn timeout(self, dur: Duration) -> Timeout<Self> where Self: Stream, [src]

fn try_fold<B, F, T, E>(&mut self, init: T, f: F) -> TryFoldFuture<Self, F, T> where F: FnMut(B, Self::Item) -> Result<T, E>, Self: Unpin, [src]

fn try_for_each<F, E>(&mut self, f: F) -> TryForEachFuture<Self, F> where F: FnMut(Self::Item) -> Result<(), E>, Self: Unpin, [src]

fn zip<U>(self, other: U) -> Zip<Self, U> where U: Stream, [src]

fn unzip<A, B, FromA, FromB>(self) -> UnzipFuture<Self, FromA, FromB> where FromA: Default + Extend<A>, FromB: Default + Extend<B>, Self: Stream<Item = (A, B)>, [src]

fn collect<'a, B>(self) -> Pin<Box<dyn Future<Output = B> + 'a>> where B: FromStream<Self::Item>, Self: 'a, [src]

fn merge<U>(self, other: U) -> Merge<Self, U> where U: Stream<Item = Self::Item>, [src]

fn partial_cmp<S>(self, other: S) -> PartialCmpFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>, [src]

fn position<P>(&mut self, predicate: P) -> PositionFuture<Self, P> where P: FnMut(Self::Item) -> bool, Self: Unpin, [src]

fn cmp<S>(self, other: S) -> CmpFuture<Self, S> where S: Stream, Self: Stream, Self::Item: Ord, [src]

fn count(self) -> CountFuture<Self>[src]

fn ne<S>(self, other: S) -> NeFuture<Self, S> where S: Stream, Self::Item: PartialEq<<S as Stream>::Item>, [src]

fn ge<S>(self, other: S) -> GeFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>, [src]

fn eq<S>(self, other: S) -> EqFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialEq<<S as Stream>::Item>, [src]

fn gt<S>(self, other: S) -> GtFuture<Self, S> where S: Stream, Self: Stream, Self::Item: PartialOrd<<S as Stream>::Item>, [src]