#[lang = "pin"] #[repr(transparent)]pub struct Pin<P> { /* fields omitted */ }
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.
impl<P> Pin<P> where
P: Deref,
<P as Deref>::Target: Unpin,
[src]
pub fn new(pointer: P) -> Pin<P>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
[src]
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 fn into_inner(pin: Pin<P>) -> P
[src]1.39.0
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]
#[lang = "new_unchecked"]pub unsafe fn new_unchecked(pointer: P) -> Pin<P>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
[src]
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.
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(x.clone()) }; { 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>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
[src]
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 unsafe fn into_inner_unchecked(pin: Pin<P>) -> P
[src]1.39.0
Unwraps this Pin<P>
returning the underlying pointer.
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]
pub fn as_mut(&mut self) -> Pin<&mut <P as Deref>::Target>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
[src]
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.
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]
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]
pub unsafe fn map_unchecked<U, F>(self, func: F) -> Pin<&'a U>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
where
F: FnOnce(&T) -> &U,
U: ?Sized,
[src]
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.
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 fn get_ref(self) -> &'a TⓘNotable traits for &'_ mut F
impl<'_, F> Future for &'_ mut F where
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output;
impl<'_, I> Iterator for &'_ mut I where
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item;
impl<R: Read + ?Sized, '_> Read for &'_ mut R
impl<W: Write + ?Sized, '_> Write for &'_ mut W
[src]
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]
pub fn into_ref(self) -> Pin<&'a T>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
[src]
Converts this Pin<&mut T>
into a Pin<&T>
with the same lifetime.
pub fn get_mut(self) -> &'a mut TⓘNotable traits for &'_ mut F
impl<'_, F> Future for &'_ mut F where
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output;
impl<'_, I> Iterator for &'_ mut I where
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item;
impl<R: Read + ?Sized, '_> Read for &'_ mut R
impl<W: Write + ?Sized, '_> Write for &'_ mut W
where
T: Unpin,
[src]
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 unsafe fn get_unchecked_mut(self) -> &'a mut TⓘNotable traits for &'_ mut F
impl<'_, F> Future for &'_ mut F where
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output;
impl<'_, I> Iterator for &'_ mut I where
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item;
impl<R: Read + ?Sized, '_> Read for &'_ mut R
impl<W: Write + ?Sized, '_> Write for &'_ mut W
[src]
Gets a mutable reference to the data inside of this Pin
.
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>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
where
F: FnOnce(&mut T) -> &mut U,
U: ?Sized,
[src]
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.
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.
impl<P> Clone for Pin<P> where
P: Clone,
[src]
fn clone(&self) -> Pin<P>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
[src]
fn clone_from(&mut self, source: &Self)
[src]1.0.0
impl<P, U> CoerceUnsized<Pin<U>> for Pin<P> where
P: CoerceUnsized<U>,
[src]
impl<P> Copy for Pin<P> where
P: Copy,
[src]
impl<P> Debug for Pin<P> where
P: Debug,
[src]
impl<P> Deref for Pin<P> where
P: Deref,
[src]
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]
impl<P, U> DispatchFromDyn<Pin<U>> for Pin<P> where
P: DispatchFromDyn<U>,
[src]
impl<P> Display for Pin<P> where
P: Display,
[src]
impl<P> Eq for Pin<P> where
P: Deref,
<P as Deref>::Target: Eq,
[src]1.41.0
impl<T> From<Box<T>> for Pin<Box<T>> where
T: ?Sized,
[src]
fn from(boxed: Box<T>) -> Pin<Box<T>>ⓘNotable traits for Pin<P>
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
type Output = <<P as Deref>::Target as Future>::Output;
[src]
Converts a Box<T>
into a Pin<Box<T>>
This conversion does not allocate on the heap and happens in place.
impl<P> Future for Pin<P> where
P: Unpin + DerefMut,
<P as Deref>::Target: Future,
[src]1.36.0
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]
impl<'_, G, R> Generator<R> for Pin<&'_ mut G> where
G: Generator<R> + ?Sized,
[src]
type Yield = <G as Generator<R>>::Yield
The type of value this generator yields. Read more
type Return = <G as Generator<R>>::Return
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]
impl<G, R> Generator<R> for Pin<Box<G>> where
G: Generator<R> + ?Sized,
[src]
type Yield = <G as Generator<R>>::Yield
The type of value this generator yields. Read more
type Return = <G as Generator<R>>::Return
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]
impl<P> Hash for Pin<P> where
P: Deref,
<P as Deref>::Target: Hash,
[src]1.41.0
fn hash<H>(&self, state: &mut H) where
H: Hasher,
[src]
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
[src]1.3.0
impl<P> Ord for Pin<P> where
P: Deref,
<P as Deref>::Target: Ord,
[src]1.41.0
fn cmp(&self, other: &Pin<P>) -> Ordering
[src]
fn max(self, other: Self) -> Self
[src]1.21.0
fn min(self, other: Self) -> Self
[src]1.21.0
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>,
[src]1.41.0
impl<P, Q> PartialOrd<Pin<Q>> for Pin<P> where
P: Deref,
Q: Deref,
<P as Deref>::Target: PartialOrd<<Q as Deref>::Target>,
[src]1.41.0
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]
impl<P> RefUnwindSafe for Pin<P> where
P: RefUnwindSafe,
impl<P> Send for Pin<P> where
P: Send,
impl<P> Sync for Pin<P> where
P: Sync,
impl<P> Unpin for Pin<P> where
P: Unpin,
impl<P> UnwindSafe for Pin<P> where
P: UnwindSafe,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
fn borrow(&self) -> &TⓘNotable traits for &'_ mut F
impl<'_, F> Future for &'_ mut F where
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output;
impl<'_, I> Iterator for &'_ mut I where
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item;
impl<R: Read + ?Sized, '_> Read for &'_ mut R
impl<W: Write + ?Sized, '_> Write for &'_ mut W
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
fn borrow_mut(&mut self) -> &mut TⓘNotable traits for &'_ mut F
impl<'_, F> Future for &'_ mut F where
F: Unpin + Future + ?Sized,
type Output = <F as Future>::Output;
impl<'_, I> Iterator for &'_ mut I where
I: Iterator + ?Sized,
type Item = <I as Iterator>::Item;
impl<R: Read + ?Sized, '_> Read for &'_ mut R
impl<W: Write + ?Sized, '_> Write for &'_ mut W
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
impl<F> IntoFuture for F where
F: Future,
[src]
type Output = <F as Future>::Output
The output that the future will produce on completion.
type Future = F
Which kind of future are we turning this into?
fn into_future(self) -> <F as IntoFuture>::Future
[src]
impl<T> ToOwned for T where
T: Clone,
[src]
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]
impl<T, U> TryFrom<U> 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<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
© 2010 The Rust Project Developers
Licensed under the Apache License, Version 2.0 or the MIT license, at your option.
https://doc.rust-lang.org/std/pin/struct.Pin.html