1.33.0[−][src]Struct async_std::pin::Pin
unstable
only.A pinned pointer.
This is a wrapper around a kind of pointer which makes that pointer "pin" its
value in place, preventing the value referenced by that pointer from being moved
unless it implements Unpin
.
See the pin
module documentation for an explanation of pinning.
Implementations
impl<P> Pin<P> where
P: Deref,
<P as Deref>::Target: Unpin,
[src]
P: Deref,
<P as Deref>::Target: Unpin,
pub const fn new(pointer: P) -> Pin<P>ⓘ
[src]
unstable
only.Construct a new Pin<P>
around a pointer to some data of a type that
implements Unpin
.
Unlike Pin::new_unchecked
, this method is safe because the pointer
P
dereferences to an Unpin
type, which cancels the pinning guarantees.
pub const fn into_inner(pin: Pin<P>) -> P
1.39.0[src]
unstable
only.Unwraps this Pin<P>
returning the underlying pointer.
This requires that the data inside this Pin
is Unpin
so that we
can ignore the pinning invariants when unwrapping it.
impl<P> Pin<P> where
P: Deref,
[src]
P: Deref,
#[lang = "new_unchecked"]pub const unsafe fn new_unchecked(pointer: P) -> Pin<P>ⓘ
[src]
unstable
only.Construct a new Pin<P>
around a reference to some data of a type that
may or may not implement Unpin
.
If pointer
dereferences to an Unpin
type, Pin::new
should be used
instead.
Safety
This constructor is unsafe because we cannot guarantee that the data
pointed to by pointer
is pinned, meaning that the data will not be moved or
its storage invalidated until it gets dropped. If the constructed Pin<P>
does
not guarantee that the data P
points to is pinned, that is a violation of
the API contract and may lead to undefined behavior in later (safe) operations.
By using this method, you are making a promise about the P::Deref
and
P::DerefMut
implementations, if they exist. Most importantly, they
must not move out of their self
arguments: Pin::as_mut
and Pin::as_ref
will call DerefMut::deref_mut
and Deref::deref
on the pinned pointer
and expect these methods to uphold the pinning invariants.
Moreover, by calling this method you promise that the reference P
dereferences to will not be moved out of again; in particular, it
must not be possible to obtain a &mut P::Target
and then
move out of that reference (using, for example mem::swap
).
For example, calling Pin::new_unchecked
on an &'a mut T
is unsafe because
while you are able to pin it for the given lifetime 'a
, you have no control
over whether it is kept pinned once 'a
ends:
use std::mem; use std::pin::Pin; fn move_pinned_ref<T>(mut a: T, mut b: T) { unsafe { let p: Pin<&mut T> = Pin::new_unchecked(&mut a); // This should mean the pointee `a` can never move again. } mem::swap(&mut a, &mut b); // The address of `a` changed to `b`'s stack slot, so `a` got moved even // though we have previously pinned it! We have violated the pinning API contract. }
A value, once pinned, must remain pinned forever (unless its type implements Unpin
).
Similarly, calling Pin::new_unchecked
on an Rc<T>
is unsafe because there could be
aliases to the same data that are not subject to the pinning restrictions:
use std::rc::Rc; use std::pin::Pin; fn move_pinned_rc<T>(mut x: Rc<T>) { let pinned = unsafe { Pin::new_unchecked(Rc::clone(&x)) }; { let p: Pin<&T> = pinned.as_ref(); // This should mean the pointee can never move again. } drop(pinned); let content = Rc::get_mut(&mut x).unwrap(); // Now, if `x` was the only reference, we have a mutable reference to // data that we pinned above, which we could use to move it as we have // seen in the previous example. We have violated the pinning API contract. }
pub fn as_ref(&self) -> Pin<&<P as Deref>::Target>ⓘ
[src]
unstable
only.Gets a pinned shared reference from this pinned pointer.
This is a generic method to go from &Pin<Pointer<T>>
to Pin<&T>
.
It is safe because, as part of the contract of Pin::new_unchecked
,
the pointee cannot move after Pin<Pointer<T>>
got created.
"Malicious" implementations of Pointer::Deref
are likewise
ruled out by the contract of Pin::new_unchecked
.
pub const unsafe fn into_inner_unchecked(pin: Pin<P>) -> P
1.39.0[src]
unstable
only.Unwraps this Pin<P>
returning the underlying pointer.
Safety
This function is unsafe. You must guarantee that you will continue to
treat the pointer P
as pinned after you call this function, so that
the invariants on the Pin
type can be upheld. If the code using the
resulting P
does not continue to maintain the pinning invariants that
is a violation of the API contract and may lead to undefined behavior in
later (safe) operations.
If the underlying data is Unpin
, Pin::into_inner
should be used
instead.
impl<P> Pin<P> where
P: DerefMut,
[src]
P: DerefMut,
pub fn as_mut(&mut self) -> Pin<&mut <P as Deref>::Target>ⓘ
[src]
unstable
only.Gets a pinned mutable reference from this pinned pointer.
This is a generic method to go from &mut Pin<Pointer<T>>
to Pin<&mut T>
.
It is safe because, as part of the contract of Pin::new_unchecked
,
the pointee cannot move after Pin<Pointer<T>>
got created.
"Malicious" implementations of Pointer::DerefMut
are likewise
ruled out by the contract of Pin::new_unchecked
.
This method is useful when doing multiple calls to functions that consume the pinned type.
Example
use std::pin::Pin; impl Type { fn method(self: Pin<&mut Self>) { // do something } fn call_method_twice(mut self: Pin<&mut Self>) { // `method` consumes `self`, so reborrow the `Pin<&mut Self>` via `as_mut`. self.as_mut().method(); self.as_mut().method(); } }
pub fn set(&mut self, value: <P as Deref>::Target) where
<P as Deref>::Target: Sized,
[src]
<P as Deref>::Target: Sized,
unstable
only.Assigns a new value to the memory behind the pinned reference.
This overwrites pinned data, but that is okay: its destructor gets run before being overwritten, so no pinning guarantee is violated.
impl<'a, T> Pin<&'a T> where
T: ?Sized,
[src]
T: ?Sized,
pub unsafe fn map_unchecked<U, F>(self, func: F) -> Pin<&'a U>ⓘ where
F: FnOnce(&T) -> &U,
U: ?Sized,
[src]
F: FnOnce(&T) -> &U,
U: ?Sized,
unstable
only.Constructs a new pin by mapping the interior value.
For example, if you wanted to get a Pin
of a field of something,
you could use this to get access to that field in one line of code.
However, there are several gotchas with these "pinning projections";
see the pin
module documentation for further details on that topic.
Safety
This function is unsafe. You must guarantee that the data you return will not move so long as the argument value does not move (for example, because it is one of the fields of that value), and also that you do not move out of the argument you receive to the interior function.
pub const fn get_ref(self) -> &'a T
[src]
unstable
only.Gets a shared reference out of a pin.
This is safe because it is not possible to move out of a shared reference.
It may seem like there is an issue here with interior mutability: in fact,
it is possible to move a T
out of a &RefCell<T>
. However, this is
not a problem as long as there does not also exist a Pin<&T>
pointing
to the same data, and RefCell<T>
does not let you create a pinned reference
to its contents. See the discussion on "pinning projections" for further
details.
Note: Pin
also implements Deref
to the target, which can be used
to access the inner value. However, Deref
only provides a reference
that lives for as long as the borrow of the Pin
, not the lifetime of
the Pin
itself. This method allows turning the Pin
into a reference
with the same lifetime as the original Pin
.
impl<'a, T> Pin<&'a mut T> where
T: ?Sized,
[src]
T: ?Sized,
pub const fn into_ref(self) -> Pin<&'a T>ⓘ
[src]
unstable
only.Converts this Pin<&mut T>
into a Pin<&T>
with the same lifetime.
pub const fn get_mut(self) -> &'a mut T where
T: Unpin,
[src]
T: Unpin,
unstable
only.Gets a mutable reference to the data inside of this Pin
.
This requires that the data inside this Pin
is Unpin
.
Note: Pin
also implements DerefMut
to the data, which can be used
to access the inner value. However, DerefMut
only provides a reference
that lives for as long as the borrow of the Pin
, not the lifetime of
the Pin
itself. This method allows turning the Pin
into a reference
with the same lifetime as the original Pin
.
pub const unsafe fn get_unchecked_mut(self) -> &'a mut T
[src]
unstable
only.Gets a mutable reference to the data inside of this Pin
.
Safety
This function is unsafe. You must guarantee that you will never move
the data out of the mutable reference you receive when you call this
function, so that the invariants on the Pin
type can be upheld.
If the underlying data is Unpin
, Pin::get_mut
should be used
instead.
pub unsafe fn map_unchecked_mut<U, F>(self, func: F) -> Pin<&'a mut U>ⓘ where
F: FnOnce(&mut T) -> &mut U,
U: ?Sized,
[src]
F: FnOnce(&mut T) -> &mut U,
U: ?Sized,
unstable
only.Construct a new pin by mapping the interior value.
For example, if you wanted to get a Pin
of a field of something,
you could use this to get access to that field in one line of code.
However, there are several gotchas with these "pinning projections";
see the pin
module documentation for further details on that topic.
Safety
This function is unsafe. You must guarantee that the data you return will not move so long as the argument value does not move (for example, because it is one of the fields of that value), and also that you do not move out of the argument you receive to the interior function.
Trait Implementations
impl<P> AsyncBufRead for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncBufRead,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncBufRead,
fn poll_fill_buf(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Result<&[u8], Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Result<&[u8], Error>>
fn consume(self: Pin<&mut Pin<P>>, amt: usize)
[src]
impl<P> AsyncRead for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncRead,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncRead,
fn poll_read(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
buf: &mut [u8]
) -> Poll<Result<usize, Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
buf: &mut [u8]
) -> Poll<Result<usize, Error>>
fn poll_read_vectored(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
bufs: &mut [IoSliceMut<'_>]
) -> Poll<Result<usize, Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
bufs: &mut [IoSliceMut<'_>]
) -> Poll<Result<usize, Error>>
impl<P> AsyncSeek for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncSeek,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncSeek,
fn poll_seek(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
pos: SeekFrom
) -> Poll<Result<u64, Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
pos: SeekFrom
) -> Poll<Result<u64, Error>>
impl<P> AsyncWrite for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncWrite,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: AsyncWrite,
fn poll_write(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
buf: &[u8]
) -> Poll<Result<usize, Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
buf: &[u8]
) -> Poll<Result<usize, Error>>
fn poll_write_vectored(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
bufs: &[IoSlice<'_>]
) -> Poll<Result<usize, Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>,
bufs: &[IoSlice<'_>]
) -> Poll<Result<usize, Error>>
fn poll_flush(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Result<(), Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Result<(), Error>>
fn poll_close(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Result<(), Error>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Result<(), Error>>
impl<P> BufRead for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: BufRead,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: BufRead,
fn poll_fill_buf(
self: Pin<&mut Self>,
cx: &mut Context<'_>
) -> Poll<Result<&[u8]>>
[src]
self: Pin<&mut Self>,
cx: &mut Context<'_>
) -> Poll<Result<&[u8]>>
fn consume(self: Pin<&mut Self>, amt: usize)
[src]
fn read_until<'a>(
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>
) -> ImplFuture<usize> where
Self: Unpin,
[src]
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>
) -> ImplFuture<usize> where
Self: Unpin,
fn read_line<'a>(&'a mut self, buf: &'a mut String) -> ImplFuture<Result<usize>> where
Self: Unpin,
[src]
Self: Unpin,
fn lines(self) -> Lines<Self> where
Self: Unpin + Sized,
[src]
Self: Unpin + Sized,
fn split(self, byte: u8) -> Split<Self> where
Self: Sized,
[src]
Self: Sized,
impl<P> Clone for Pin<P> where
P: Clone,
[src]
P: Clone,
impl<P, U> CoerceUnsized<Pin<U>> for Pin<P> where
P: CoerceUnsized<U>,
[src]
P: CoerceUnsized<U>,
impl<P> Copy for Pin<P> where
P: Copy,
[src]
P: Copy,
impl<P> Debug for Pin<P> where
P: Debug,
[src]
P: Debug,
impl<P> Deref for Pin<P> where
P: Deref,
[src]
P: Deref,
type Target = <P as Deref>::Target
The resulting type after dereferencing.
fn deref(&self) -> &<P as Deref>::Target
[src]
impl<P> DerefMut for Pin<P> where
P: DerefMut,
<P as Deref>::Target: Unpin,
[src]
P: DerefMut,
<P as Deref>::Target: Unpin,
impl<P, U> DispatchFromDyn<Pin<U>> for Pin<P> where
P: DispatchFromDyn<U>,
[src]
P: DispatchFromDyn<U>,
impl<P> Display for Pin<P> where
P: Display,
[src]
P: Display,
impl<P> Eq for Pin<P> where
P: Deref,
<P as Deref>::Target: Eq,
1.41.0[src]
P: Deref,
<P as Deref>::Target: Eq,
impl<T> From<Box<T>> for Pin<Box<T>> where
T: ?Sized,
[src]
T: ?Sized,
fn from(boxed: Box<T>) -> Pin<Box<T>>ⓘ
[src]
Converts a Box<T>
into a Pin<Box<T>>
This conversion does not allocate on the heap and happens in place.
impl<P> FusedFuture for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: FusedFuture,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: FusedFuture,
fn is_terminated(&self) -> bool
[src]
impl<P> FusedStream for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: FusedStream,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: FusedStream,
fn is_terminated(&self) -> bool
[src]
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
1.36.0[src]
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output
The type of value produced on completion.
fn poll(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<<Pin<P> as Future>::Output>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<<Pin<P> as Future>::Output>
impl<P> Future for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: Future,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output
The type of value produced on completion.
fn poll(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Self::Output>
[src]
fn delay(self, dur: Duration) -> ImplFuture<Self::Output> where
Self: Sized,
[src]
Self: Sized,
fn flatten(self) -> ImplFuture<<Self::Output as IntoFuture>::Output> where
Self: Sized,
Self::Output: IntoFuture,
[src]
Self: Sized,
Self::Output: IntoFuture,
fn race<F>(self, other: F) -> ImplFuture<Self::Output> where
Self: Future + Sized,
F: Future<Output = Self::Output>,
[src]
Self: Future + Sized,
F: Future<Output = Self::Output>,
fn try_race<F, T, E>(self, other: F) -> ImplFuture<Self::Output> where
Self: Future<Output = Result<T, E>> + Sized,
F: Future<Output = Self::Output>,
[src]
Self: Future<Output = Result<T, E>> + Sized,
F: Future<Output = Self::Output>,
fn join<F>(self, other: F) -> ImplFuture<(Self::Output, <F as Future>::Output)> where
Self: Future + Sized,
F: Future,
[src]
Self: Future + Sized,
F: Future,
fn try_join<F, A, B, E>(self, other: F) -> ImplFuture<Result<(A, B), E>> where
Self: Future<Output = Result<A, E>> + Sized,
F: Future<Output = Result<B, E>>,
[src]
Self: Future<Output = Result<A, E>> + Sized,
F: Future<Output = Result<B, E>>,
fn timeout(self, dur: Duration) -> ImplFuture<Self::Output> where
Self: Sized,
[src]
Self: Sized,
impl<'_, G, R> Generator<R> for Pin<&'_ mut G> where
G: Generator<R> + ?Sized,
[src]
G: Generator<R> + ?Sized,
type Yield = <G as Generator<R>>::Yield
generator_trait
)The type of value this generator yields. Read more
type Return = <G as Generator<R>>::Return
generator_trait
)The type of value this generator returns. Read more
fn resume(
self: Pin<&mut Pin<&'_ mut G>>,
arg: R
) -> GeneratorState<<Pin<&'_ mut G> as Generator<R>>::Yield, <Pin<&'_ mut G> as Generator<R>>::Return>
[src]
self: Pin<&mut Pin<&'_ mut G>>,
arg: R
) -> GeneratorState<<Pin<&'_ mut G> as Generator<R>>::Yield, <Pin<&'_ mut G> as Generator<R>>::Return>
impl<G, R> Generator<R> for Pin<Box<G>> where
G: Generator<R> + ?Sized,
[src]
G: Generator<R> + ?Sized,
type Yield = <G as Generator<R>>::Yield
generator_trait
)The type of value this generator yields. Read more
type Return = <G as Generator<R>>::Return
generator_trait
)The type of value this generator returns. Read more
fn resume(
self: Pin<&mut Pin<Box<G>>>,
arg: R
) -> GeneratorState<<Pin<Box<G>> as Generator<R>>::Yield, <Pin<Box<G>> as Generator<R>>::Return>
[src]
self: Pin<&mut Pin<Box<G>>>,
arg: R
) -> GeneratorState<<Pin<Box<G>> as Generator<R>>::Yield, <Pin<Box<G>> as Generator<R>>::Return>
impl<P> Hash for Pin<P> where
P: Deref,
<P as Deref>::Target: Hash,
1.41.0[src]
P: Deref,
<P as Deref>::Target: Hash,
fn hash<H>(&self, state: &mut H) where
H: Hasher,
[src]
H: Hasher,
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
impl<P> Ord for Pin<P> where
P: Deref,
<P as Deref>::Target: Ord,
1.41.0[src]
P: Deref,
<P as Deref>::Target: Ord,
fn cmp(&self, other: &Pin<P>) -> 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<P, Q> PartialEq<Pin<Q>> for Pin<P> where
P: Deref,
Q: Deref,
<P as Deref>::Target: PartialEq<<Q as Deref>::Target>,
1.41.0[src]
P: Deref,
Q: Deref,
<P as Deref>::Target: PartialEq<<Q as Deref>::Target>,
impl<P, Q> PartialOrd<Pin<Q>> for Pin<P> where
P: Deref,
Q: Deref,
<P as Deref>::Target: PartialOrd<<Q as Deref>::Target>,
1.41.0[src]
P: Deref,
Q: Deref,
<P as Deref>::Target: PartialOrd<<Q as Deref>::Target>,
fn partial_cmp(&self, other: &Pin<Q>) -> Option<Ordering>
[src]
fn lt(&self, other: &Pin<Q>) -> bool
[src]
fn le(&self, other: &Pin<Q>) -> bool
[src]
fn gt(&self, other: &Pin<Q>) -> bool
[src]
fn ge(&self, other: &Pin<Q>) -> bool
[src]
impl<P> Pointer for Pin<P> where
P: Pointer,
[src]
P: Pointer,
impl<P> Read for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: Read,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: Read,
fn poll_read(
self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &mut [u8]
) -> Poll<Result<usize>>
[src]
self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &mut [u8]
) -> Poll<Result<usize>>
fn poll_read_vectored(
self: Pin<&mut Self>,
cx: &mut Context<'_>,
bufs: &mut [IoSliceMut<'_>]
) -> Poll<Result<usize>>
[src]
self: Pin<&mut Self>,
cx: &mut Context<'_>,
bufs: &mut [IoSliceMut<'_>]
) -> Poll<Result<usize>>
fn read<'a>(&'a mut self, buf: &'a mut [u8]) -> ImplFuture<Result<usize>> where
Self: Unpin,
[src]
Self: Unpin,
fn read_vectored<'a>(
&'a mut self,
bufs: &'a mut [IoSliceMut<'a>]
) -> ImplFuture<Result<usize>> where
Self: Unpin,
[src]
&'a mut self,
bufs: &'a mut [IoSliceMut<'a>]
) -> ImplFuture<Result<usize>> where
Self: Unpin,
fn read_to_end<'a>(
&'a mut self,
buf: &'a mut Vec<u8>
) -> ImplFuture<Result<usize>> where
Self: Unpin,
[src]
&'a mut self,
buf: &'a mut Vec<u8>
) -> ImplFuture<Result<usize>> where
Self: Unpin,
fn read_to_string<'a>(
&'a mut self,
buf: &'a mut String
) -> ImplFuture<Result<usize>> where
Self: Unpin,
[src]
&'a mut self,
buf: &'a mut String
) -> ImplFuture<Result<usize>> where
Self: Unpin,
fn read_exact<'a>(&'a mut self, buf: &'a mut [u8]) -> ImplFuture<Result<()>> where
Self: Unpin,
[src]
Self: Unpin,
fn take(self, limit: u64) -> Take<Self> where
Self: Sized,
[src]
Self: Sized,
fn by_ref(&mut self) -> &mut Self where
Self: Sized,
[src]
Self: Sized,
fn bytes(self) -> Bytes<Self> where
Self: Sized,
[src]
Self: Sized,
fn chain<R: Read>(self, next: R) -> Chain<Self, R> where
Self: Sized,
[src]
Self: Sized,
impl<P> Seek for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: Seek,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: Seek,
fn poll_seek(
self: Pin<&mut Self>,
cx: &mut Context<'_>,
pos: SeekFrom
) -> Poll<Result<u64>>
[src]
self: Pin<&mut Self>,
cx: &mut Context<'_>,
pos: SeekFrom
) -> Poll<Result<u64>>
fn seek(&mut self, pos: SeekFrom) -> ImplFuture<Result<u64>> where
Self: Unpin,
[src]
Self: Unpin,
impl<P> Stream for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: Stream,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: Stream,
type Item = <<P as Deref>::Target as Stream>::Item
Values yielded by the stream.
fn poll_next(
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Option<<Pin<P> as Stream>::Item>>
[src]
self: Pin<&mut Pin<P>>,
cx: &mut Context<'_>
) -> Poll<Option<<Pin<P> as Stream>::Item>>
fn size_hint(&self) -> (usize, Option<usize>)
[src]
impl<P> Stream for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: Stream,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: Stream,
type Item = <<P as Deref>::Target as Stream>::Item
The type of items yielded by this stream.
fn poll_next(
self: Pin<&mut Self>,
cx: &mut Context<'_>
) -> Poll<Option<Self::Item>>
[src]
self: Pin<&mut Self>,
cx: &mut Context<'_>
) -> Poll<Option<Self::Item>>
fn next(&mut self) -> ImplFuture<Option<Self::Item>> where
Self: Unpin,
[src]
Self: Unpin,
fn take(self, n: usize) -> Take<Self> where
Self: Sized,
[src]
Self: Sized,
fn take_while<P>(self, predicate: P) -> TakeWhile<Self, P> where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
[src]
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn throttle(self, d: Duration) -> Throttle<Self> where
Self: Sized,
[src]
Self: Sized,
fn step_by(self, step: usize) -> StepBy<Self> where
Self: Sized,
[src]
Self: Sized,
fn chain<U>(self, other: U) -> Chain<Self, U> where
Self: Sized,
U: Stream<Item = Self::Item> + Sized,
[src]
Self: Sized,
U: Stream<Item = Self::Item> + Sized,
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Sized + Stream<Item = &'a T>,
T: Clone + 'a,
[src]
Self: Sized + Stream<Item = &'a T>,
T: Clone + 'a,
fn copied<'a, T>(self) -> Copied<Self> where
Self: Sized + Stream<Item = &'a T>,
T: Copy + 'a,
[src]
Self: Sized + Stream<Item = &'a T>,
T: Copy + 'a,
fn cycle(self) -> Cycle<Self> where
Self: Clone + Sized,
[src]
Self: Clone + Sized,
fn enumerate(self) -> Enumerate<Self> where
Self: Sized,
[src]
Self: Sized,
fn delay(self, dur: Duration) -> Delay<Self> where
Self: Sized,
[src]
Self: Sized,
fn map<B, F>(self, f: F) -> Map<Self, F> where
Self: Sized,
F: FnMut(Self::Item) -> B,
[src]
Self: Sized,
F: FnMut(Self::Item) -> B,
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
Self: Sized,
F: FnMut(&Self::Item),
[src]
Self: Sized,
F: FnMut(&Self::Item),
fn last(self) -> ImplFuture<Option<Self::Item>> where
Self: Sized,
[src]
Self: Sized,
fn fuse(self) -> Fuse<Self> where
Self: Sized,
[src]
Self: Sized,
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
[src]
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
Self: Sized,
U: IntoStream,
F: FnMut(Self::Item) -> U,
[src]
Self: Sized,
U: IntoStream,
F: FnMut(Self::Item) -> U,
fn flatten(self) -> Flatten<Self> where
Self: Sized,
Self::Item: IntoStream,
[src]
Self: Sized,
Self::Item: IntoStream,
fn filter_map<B, F>(self, f: F) -> FilterMap<Self, F> where
Self: Sized,
F: FnMut(Self::Item) -> Option<B>,
[src]
Self: Sized,
F: FnMut(Self::Item) -> Option<B>,
fn min_by_key<B, F>(self, key_by: F) -> ImplFuture<Option<Self::Item>> where
Self: Sized,
B: Ord,
F: FnMut(&Self::Item) -> B,
[src]
Self: Sized,
B: Ord,
F: FnMut(&Self::Item) -> B,
fn max_by_key<B, F>(self, key_by: F) -> ImplFuture<Option<Self::Item>> where
Self: Sized,
B: Ord,
F: FnMut(&Self::Item) -> B,
[src]
Self: Sized,
B: Ord,
F: FnMut(&Self::Item) -> B,
fn min_by<F>(self, compare: F) -> ImplFuture<Option<Self::Item>> where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
[src]
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn max(self) -> ImplFuture<Option<Self::Item>> where
Self: Sized,
Self::Item: Ord,
[src]
Self: Sized,
Self::Item: Ord,
fn min(self) -> ImplFuture<Option<Self::Item>> where
Self: Sized,
Self::Item: Ord,
[src]
Self: Sized,
Self::Item: Ord,
fn max_by<F>(self, compare: F) -> ImplFuture<Option<Self::Item>> where
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
[src]
Self: Sized,
F: FnMut(&Self::Item, &Self::Item) -> Ordering,
fn nth(&mut self, n: usize) -> ImplFuture<Option<Self::Item>> where
Self: Unpin + Sized,
[src]
Self: Unpin + Sized,
fn all<F>(&mut self, f: F) -> ImplFuture<bool> where
Self: Unpin + Sized,
F: FnMut(Self::Item) -> bool,
[src]
Self: Unpin + Sized,
F: FnMut(Self::Item) -> bool,
fn find<P>(&mut self, p: P) -> ImplFuture<Option<Self::Item>> where
Self: Unpin + Sized,
P: FnMut(&Self::Item) -> bool,
[src]
Self: Unpin + Sized,
P: FnMut(&Self::Item) -> bool,
fn find_map<F, B>(&mut self, f: F) -> ImplFuture<Option<B>> where
Self: Unpin + Sized,
F: FnMut(Self::Item) -> Option<B>,
[src]
Self: Unpin + Sized,
F: FnMut(Self::Item) -> Option<B>,
fn fold<B, F>(self, init: B, f: F) -> ImplFuture<B> where
Self: Sized,
F: FnMut(B, Self::Item) -> B,
[src]
Self: Sized,
F: FnMut(B, Self::Item) -> B,
fn partition<B, F>(self, f: F) -> ImplFuture<(B, B)> where
Self: Sized,
F: FnMut(&Self::Item) -> bool,
B: Default + Extend<Self::Item>,
[src]
Self: Sized,
F: FnMut(&Self::Item) -> bool,
B: Default + Extend<Self::Item>,
fn for_each<F>(self, f: F) -> ImplFuture<()> where
Self: Sized,
F: FnMut(Self::Item),
[src]
Self: Sized,
F: FnMut(Self::Item),
fn any<F>(&mut self, f: F) -> ImplFuture<bool> where
Self: Unpin + Sized,
F: FnMut(Self::Item) -> bool,
[src]
Self: Unpin + Sized,
F: FnMut(Self::Item) -> bool,
fn by_ref(&mut self) -> &mut Self
[src]
fn 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>,
[src]
Self: Sized,
F: FnMut(&mut St, Self::Item) -> Option<B>,
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
Self: Sized,
P: FnMut(&Self::Item) -> bool,
[src]
Self: Sized,
P: FnMut(&Self::Item) -> bool,
fn skip(self, n: usize) -> Skip<Self> where
Self: Sized,
[src]
Self: Sized,
fn timeout(self, dur: Duration) -> Timeout<Self> where
Self: Stream + Sized,
[src]
Self: Stream + Sized,
fn try_fold<B, F, T, E>(&mut self, init: T, f: F) -> ImplFuture<Result<T, E>> where
Self: Unpin + Sized,
F: FnMut(B, Self::Item) -> Result<T, E>,
[src]
Self: Unpin + Sized,
F: FnMut(B, Self::Item) -> Result<T, E>,
fn try_for_each<F, E>(&mut self, f: F) -> ImplFuture<E> where
Self: Unpin + Sized,
F: FnMut(Self::Item) -> Result<(), E>,
[src]
Self: Unpin + Sized,
F: FnMut(Self::Item) -> Result<(), E>,
fn zip<U>(self, other: U) -> Zip<Self, U> where
Self: Sized,
U: Stream,
[src]
Self: Sized,
U: Stream,
fn unzip<A, B, FromA, FromB>(self) -> ImplFuture<(FromA, FromB)> where
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Stream<Item = (A, B)> + Sized,
[src]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Stream<Item = (A, B)> + Sized,
fn collect<'a, B>(self) -> ImplFuture<B> where
Self: Sized + 'a + Send,
B: FromStream<Self::Item>,
Self::Item: Send,
[src]
Self: Sized + 'a + Send,
B: FromStream<Self::Item>,
Self::Item: Send,
fn merge<U>(self, other: U) -> Merge<Self, U> where
Self: Sized,
U: Stream<Item = Self::Item> + Sized,
[src]
Self: Sized,
U: Stream<Item = Self::Item> + Sized,
fn partial_cmp<S>(self, other: S) -> ImplFuture<Option<Ordering>> where
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
[src]
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
fn position<P>(&mut self, predicate: P) -> ImplFuture<Option<usize>> where
Self: Unpin + Sized,
P: FnMut(Self::Item) -> bool,
[src]
Self: Unpin + Sized,
P: FnMut(Self::Item) -> bool,
fn cmp<S>(self, other: S) -> ImplFuture<Ordering> where
Self: Sized + Stream,
S: Stream,
Self::Item: Ord,
[src]
Self: Sized + Stream,
S: Stream,
Self::Item: Ord,
fn count(self) -> ImplFuture<usize> where
Self: Sized,
[src]
Self: Sized,
fn ne<S>(self, other: S) -> ImplFuture<bool> where
Self: Sized,
S: Sized + Stream,
Self::Item: PartialEq<S::Item>,
[src]
Self: Sized,
S: Sized + Stream,
Self::Item: PartialEq<S::Item>,
fn ge<S>(self, other: S) -> ImplFuture<bool> where
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
[src]
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
fn eq<S>(self, other: S) -> ImplFuture<bool> where
Self: Sized + Stream,
S: Sized + Stream,
Self::Item: PartialEq<S::Item>,
[src]
Self: Sized + Stream,
S: Sized + Stream,
Self::Item: PartialEq<S::Item>,
fn gt<S>(self, other: S) -> ImplFuture<bool> where
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
[src]
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
fn le<S>(self, other: S) -> ImplFuture<bool> where
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
[src]
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
fn lt<S>(self, other: S) -> ImplFuture<bool> where
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
[src]
Self: Sized + Stream,
S: Stream,
Self::Item: PartialOrd<S::Item>,
fn sum<'a, S>(self) -> ImplFuture<S> where
Self: Sized + Stream<Item = S> + 'a,
S: Sum<Self::Item>,
[src]
Self: Sized + Stream<Item = S> + 'a,
S: Sum<Self::Item>,
fn product<'a, P>(self) -> ImplFuture<P> where
Self: Sized + Stream<Item = P> + 'a,
P: Product,
[src]
Self: Sized + Stream<Item = P> + 'a,
P: Product,
impl<P> Write for Pin<P> where
P: DerefMut + Unpin,
<P as Deref>::Target: Write,
[src]
P: DerefMut + Unpin,
<P as Deref>::Target: Write,
fn poll_write(
self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &[u8]
) -> Poll<Result<usize>>
[src]
self: Pin<&mut Self>,
cx: &mut Context<'_>,
buf: &[u8]
) -> Poll<Result<usize>>
fn poll_flush(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Result<()>>
[src]
fn poll_close(self: Pin<&mut Self>, cx: &mut Context<'_>) -> Poll<Result<()>>
[src]
fn poll_write_vectored(
self: Pin<&mut Self>,
cx: &mut Context<'_>,
bufs: &[IoSlice<'_>]
) -> Poll<Result<usize>>
[src]
self: Pin<&mut Self>,
cx: &mut Context<'_>,
bufs: &[IoSlice<'_>]
) -> Poll<Result<usize>>
fn write<'a>(&'a mut self, buf: &'a [u8]) -> ImplFuture<Result<usize>> where
Self: Unpin,
[src]
Self: Unpin,
fn flush(&mut self) -> ImplFuture<Result<()>> where
Self: Unpin,
[src]
Self: Unpin,
fn write_vectored<'a>(
&'a mut self,
bufs: &'a [IoSlice<'a>]
) -> ImplFuture<Result<usize>> where
Self: Unpin,
[src]
&'a mut self,
bufs: &'a [IoSlice<'a>]
) -> ImplFuture<Result<usize>> where
Self: Unpin,
fn write_all<'a>(&'a mut self, buf: &'a [u8]) -> ImplFuture<Result<()>> where
Self: Unpin,
[src]
Self: Unpin,
fn write_fmt<'a>(&'a mut self, fmt: Arguments<'_>) -> ImplFuture<Result<()>> where
Self: Unpin,
[src]
Self: Unpin,
Auto Trait Implementations
impl<P> RefUnwindSafe for Pin<P> where
P: RefUnwindSafe,
P: RefUnwindSafe,
impl<P> Send for Pin<P> where
P: Send,
P: Send,
impl<P> Sync for Pin<P> where
P: Sync,
P: Sync,
impl<P> Unpin for Pin<P> where
P: Unpin,
P: Unpin,
impl<P> UnwindSafe for Pin<P> where
P: UnwindSafe,
P: UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<R> AsyncBufReadExt for R where
R: AsyncBufRead + ?Sized,
[src]
R: AsyncBufRead + ?Sized,
fn read_until(
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>
) -> ReadUntilFuture<'a, Self> where
Self: Unpin,
[src]
&'a mut self,
byte: u8,
buf: &'a mut Vec<u8>
) -> ReadUntilFuture<'a, Self> where
Self: Unpin,
fn read_line(&'a mut self, buf: &'a mut String) -> ReadLineFuture<'a, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn lines(self) -> Lines<Self> where
Self: Unpin,
[src]
Self: Unpin,
fn split(self, byte: u8) -> Split<Self>
[src]
impl<R> AsyncReadExt for R where
R: AsyncRead + ?Sized,
[src]
R: AsyncRead + ?Sized,
fn read(&'a mut self, buf: &'a mut [u8]) -> ReadFuture<'a, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn read_vectored(
&'a mut self,
bufs: &'a mut [IoSliceMut<'a>]
) -> ReadVectoredFuture<'a, Self> where
Self: Unpin,
[src]
&'a mut self,
bufs: &'a mut [IoSliceMut<'a>]
) -> ReadVectoredFuture<'a, Self> where
Self: Unpin,
fn read_to_end(&'a mut self, buf: &'a mut Vec<u8>) -> ReadToEndFuture<'a, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn read_to_string(
&'a mut self,
buf: &'a mut String
) -> ReadToStringFuture<'a, Self> where
Self: Unpin,
[src]
&'a mut self,
buf: &'a mut String
) -> ReadToStringFuture<'a, Self> where
Self: Unpin,
fn read_exact(&'a mut self, buf: &'a mut [u8]) -> ReadExactFuture<'a, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn take(self, limit: u64) -> Take<Self>
[src]
fn bytes(self) -> Bytes<Self>
[src]
fn chain<R>(self, next: R) -> Chain<Self, R> where
R: AsyncRead,
[src]
R: AsyncRead,
impl<S> AsyncSeekExt for S where
S: AsyncSeek + ?Sized,
[src]
S: AsyncSeek + ?Sized,
fn seek(&mut self, pos: SeekFrom) -> SeekFuture<'_, Self> where
Self: Unpin,
[src]
Self: Unpin,
impl<W> AsyncWriteExt for W where
W: AsyncWrite + ?Sized,
[src]
W: AsyncWrite + ?Sized,
fn write(&'a mut self, buf: &'a [u8]) -> WriteFuture<'a, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn write_vectored(
&'a mut self,
bufs: &'a [IoSlice<'a>]
) -> WriteVectoredFuture<'a, Self> where
Self: Unpin,
[src]
&'a mut self,
bufs: &'a [IoSlice<'a>]
) -> WriteVectoredFuture<'a, Self> where
Self: Unpin,
fn write_all(&'a mut self, buf: &'a [u8]) -> WriteAllFuture<'a, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn flush(&mut self) -> FlushFuture<'_, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn close(&mut self) -> CloseFuture<'_, Self> where
Self: Unpin,
[src]
Self: Unpin,
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<F> FutureExt for F where
F: Future + ?Sized,
[src]
F: Future + ?Sized,
fn or<F>(self, other: F) -> Or<Self, F> where
F: Future<Output = Self::Output>,
[src]
F: Future<Output = Self::Output>,
fn race<F>(self, other: F) -> Race<Self, F> where
F: Future<Output = Self::Output>,
[src]
F: Future<Output = Self::Output>,
fn boxed<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + 'a + Send>>ⓘ where
Self: Send + 'a,
[src]
Self: Send + 'a,
fn boxed_local<'a>(self) -> Pin<Box<dyn Future<Output = Self::Output> + 'a>>ⓘ where
Self: 'a,
[src]
Self: 'a,
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<F> IntoFuture for F where
F: Future,
[src]
F: Future,
type Output = <F as Future>::Output
into_future
)The output that the future will produce on completion.
type Future = F
into_future
)Which kind of future are we turning this into?
fn into_future(self) -> <F as IntoFuture>::Future
[src]
impl<S> StreamExt for S where
S: Stream + ?Sized,
[src]
S: Stream + ?Sized,
fn next(&mut self) -> NextFuture<'_, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn try_next<T, E>(&mut self) -> TryNextFuture<'_, Self> where
Self: Stream<Item = Result<T, E>> + Unpin,
[src]
Self: Stream<Item = Result<T, E>> + Unpin,
fn count(self) -> CountFuture<Self>
[src]
fn map<T, F>(self, f: F) -> Map<Self, F> where
F: FnMut(Self::Item) -> T,
[src]
F: FnMut(Self::Item) -> T,
fn flat_map<U, F>(self, f: F) -> FlatMap<Self, U, F> where
F: FnMut(Self::Item) -> U,
U: Stream,
[src]
F: FnMut(Self::Item) -> U,
U: Stream,
fn flatten(self) -> Flatten<Self> where
Self::Item: Stream,
[src]
Self::Item: Stream,
fn filter<P>(self, predicate: P) -> Filter<Self, P> where
P: FnMut(&Self::Item) -> bool,
[src]
P: FnMut(&Self::Item) -> bool,
fn filter_map<T, F>(self, f: F) -> FilterMap<Self, F> where
F: FnMut(Self::Item) -> Option<T>,
[src]
F: FnMut(Self::Item) -> Option<T>,
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]
P: FnMut(&Self::Item) -> bool,
fn skip(self, n: usize) -> Skip<Self>
[src]
fn skip_while<P>(self, predicate: P) -> SkipWhile<Self, P> where
P: FnMut(&Self::Item) -> bool,
[src]
P: FnMut(&Self::Item) -> bool,
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]
U: Stream<Item = Self::Item>,
fn cloned<'a, T>(self) -> Cloned<Self> where
Self: Stream<Item = &'a T>,
T: Clone + 'a,
[src]
Self: Stream<Item = &'a T>,
T: Clone + 'a,
fn copied<'a, T>(self) -> Copied<Self> where
Self: Stream<Item = &'a T>,
T: Copy + 'a,
[src]
Self: Stream<Item = &'a T>,
T: Copy + 'a,
fn collect<C>(self) -> CollectFuture<Self, C> where
C: Default + Extend<Self::Item>,
[src]
C: Default + Extend<Self::Item>,
fn try_collect<T, E, C>(self) -> TryCollectFuture<Self, C> where
C: Default + Extend<T>,
Self: Stream<Item = Result<T, E>>,
[src]
C: Default + Extend<T>,
Self: Stream<Item = Result<T, E>>,
fn partition<B, P>(self, predicate: P) -> PartitionFuture<Self, P, B> where
B: Default + Extend<Self::Item>,
P: FnMut(&Self::Item) -> bool,
[src]
B: Default + Extend<Self::Item>,
P: FnMut(&Self::Item) -> bool,
fn fold<T, F>(self, init: T, f: F) -> FoldFuture<Self, F, T> where
F: FnMut(T, Self::Item) -> T,
[src]
F: FnMut(T, Self::Item) -> T,
fn try_fold<T, E, F, B>(
&mut self,
init: B,
f: F
) -> TryFoldFuture<'_, Self, F, B> where
F: FnMut(B, T) -> Result<B, E>,
Self: Stream<Item = Result<T, E>> + Unpin,
[src]
&mut self,
init: B,
f: F
) -> TryFoldFuture<'_, Self, F, B> where
F: FnMut(B, T) -> Result<B, E>,
Self: Stream<Item = Result<T, E>> + Unpin,
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]
F: FnMut(&mut St, Self::Item) -> Option<B>,
fn fuse(self) -> Fuse<Self>
[src]
fn cycle(self) -> Cycle<Self> where
Self: Clone,
[src]
Self: Clone,
fn enumerate(self) -> Enumerate<Self>
[src]
fn inspect<F>(self, f: F) -> Inspect<Self, F> where
F: FnMut(&Self::Item),
[src]
F: FnMut(&Self::Item),
fn nth(&mut self, n: usize) -> NthFuture<'_, Self> where
Self: Unpin,
[src]
Self: Unpin,
fn last(self) -> LastFuture<Self>
[src]
fn find<P>(&mut self, predicate: P) -> FindFuture<'_, Self, P> where
P: FnMut(&Self::Item) -> bool,
Self: Unpin,
[src]
P: FnMut(&Self::Item) -> bool,
Self: Unpin,
fn find_map<F, B>(&mut self, f: F) -> FindMapFuture<'_, Self, F> where
F: FnMut(Self::Item) -> Option<B>,
Self: Unpin,
[src]
F: FnMut(Self::Item) -> Option<B>,
Self: Unpin,
fn position<P>(&mut self, predicate: P) -> PositionFuture<'_, Self, P> where
P: FnMut(Self::Item) -> bool,
Self: Unpin,
[src]
P: FnMut(Self::Item) -> bool,
Self: Unpin,
fn all<P>(&mut self, predicate: P) -> AllFuture<'_, Self, P> where
P: FnMut(Self::Item) -> bool,
Self: Unpin,
[src]
P: FnMut(Self::Item) -> bool,
Self: Unpin,
fn any<P>(&mut self, predicate: P) -> AnyFuture<'_, Self, P> where
P: FnMut(Self::Item) -> bool,
Self: Unpin,
[src]
P: FnMut(Self::Item) -> bool,
Self: Unpin,
fn for_each<F>(self, f: F) -> ForEachFuture<Self, F> where
F: FnMut(Self::Item),
[src]
F: FnMut(Self::Item),
fn try_for_each<F, E>(&mut self, f: F) -> TryForEachFuture<'_, Self, F> where
F: FnMut(Self::Item) -> Result<(), E>,
Self: Unpin,
[src]
F: FnMut(Self::Item) -> Result<(), E>,
Self: Unpin,
fn zip<U>(self, other: U) -> Zip<Self, U> where
U: Stream,
[src]
U: Stream,
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]
FromA: Default + Extend<A>,
FromB: Default + Extend<B>,
Self: Stream<Item = (A, B)>,
fn boxed<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + 'a + Send>>ⓘ where
Self: Send + 'a,
[src]
Self: Send + 'a,
fn boxed_local<'a>(self) -> Pin<Box<dyn Stream<Item = Self::Item> + 'a>>ⓘ where
Self: 'a,
[src]
Self: 'a,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T> ToString for T where
T: Display + ?Sized,
[src]
T: Display + ?Sized,
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<F, T, E> TryFuture for F where
F: Future<Output = Result<T, E>> + ?Sized,
[src]
F: Future<Output = Result<T, E>> + ?Sized,
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(
self: Pin<&mut F>,
cx: &mut Context<'_>
) -> Poll<<F as Future>::Output>
[src]
self: Pin<&mut F>,
cx: &mut Context<'_>
) -> Poll<<F as Future>::Output>
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<S, T, E> TryStream for S where
S: Stream<Item = Result<T, E>> + ?Sized,
[src]
S: Stream<Item = Result<T, E>> + ?Sized,