Trait nom::lib::std::prelude::v1::rust_2024::Unpin

1.33.0 · source ·
pub auto trait Unpin { }
Expand description

Types that can be safely moved after being pinned.

Rust itself has no notion of immovable types, and considers moves (e.g., through assignment or mem::replace) to always be safe.

The Pin type is used instead to prevent moves through the type system. Pointers P<T> wrapped in the Pin<P<T>> wrapper can’t be moved out of. See the pin module documentation for more information on pinning.

Implementing the Unpin trait for T lifts the restrictions of pinning off the type, which then allows moving T out of Pin<P<T>> with functions such as mem::replace.

Unpin has no consequence at all for non-pinned data. In particular, mem::replace happily moves !Unpin data (it works for any &mut T, not just when T: Unpin). However, you cannot use mem::replace on data wrapped inside a Pin<P<T>> because you cannot get the &mut T you need for that, and that is what makes this system work.

So this, for example, can only be done on types implementing Unpin:

use std::mem;
use std::pin::Pin;

let mut string = "this".to_string();
let mut pinned_string = Pin::new(&mut string);

// We need a mutable reference to call `mem::replace`.
// We can obtain such a reference by (implicitly) invoking `Pin::deref_mut`,
// but that is only possible because `String` implements `Unpin`.
mem::replace(&mut *pinned_string, "other".to_string());

This trait is automatically implemented for almost every type.

Implementors§

source§

impl !Unpin for PhantomPinned

1.36.0 · source§

impl Unpin for Waker

source§

impl<'a, T> Unpin for &'a Twhere T: 'a + ?Sized,

source§

impl<'a, T> Unpin for &'a mut Twhere T: 'a + ?Sized,

source§

impl<Dyn> Unpin for DynMetadata<Dyn>where Dyn: ?Sized,

1.64.0 · source§

impl<F> Unpin for PollFn<F>where F: Unpin,

source§

impl<I> Unpin for FromIter<I>

1.38.0 · source§

impl<T> Unpin for *const Twhere T: ?Sized,

1.38.0 · source§

impl<T> Unpin for *mut Twhere T: ?Sized,

source§

impl<T> Unpin for Rc<T>where T: ?Sized,

source§

impl<T> Unpin for Arc<T>where T: ?Sized,

1.48.0 · source§

impl<T> Unpin for Ready<T>

source§

impl<T, A> Unpin for Box<T, A>where A: Allocator + 'static, T: ?Sized,

Auto implementors§

§

impl Unpin for CompareResult

§

impl Unpin for Needed

§

impl Unpin for ErrorKind

§

impl Unpin for VerboseErrorKind

§

impl Unpin for Endianness

§

impl Unpin for Ordering

§

impl Unpin for TryReserveErrorKind

§

impl Unpin for Infallible

§

impl Unpin for Alignment

§

impl Unpin for SearchStep

§

impl Unpin for AllocError

§

impl Unpin for Global

§

impl Unpin for Layout

§

impl Unpin for LayoutError

§

impl Unpin for System

§

impl Unpin for DefaultHasher

§

impl Unpin for RandomState

§

impl Unpin for TryReserveError

§

impl Unpin for Error

§

impl Unpin for SipHasher

§

impl Unpin for Assume

§

impl Unpin for RangeFull

§

impl Unpin for ParseBoolError

§

impl Unpin for Utf8Error

§

impl Unpin for FromUtf8Error

§

impl Unpin for FromUtf16Error

§

impl Unpin for String

§

impl<'a> Unpin for Arguments<'a>

§

impl<'a> Unpin for Formatter<'a>

§

impl<'a> Unpin for EscapeAscii<'a>

§

impl<'a> Unpin for CharSearcher<'a>

§

impl<'a> Unpin for Bytes<'a>

§

impl<'a> Unpin for CharIndices<'a>

§

impl<'a> Unpin for Chars<'a>

§

impl<'a> Unpin for EncodeUtf16<'a>

§

impl<'a> Unpin for EscapeDebug<'a>

§

impl<'a> Unpin for EscapeDefault<'a>

§

impl<'a> Unpin for EscapeUnicode<'a>

§

impl<'a> Unpin for Lines<'a>

§

impl<'a> Unpin for LinesAny<'a>

§

impl<'a> Unpin for SplitAsciiWhitespace<'a>

§

impl<'a> Unpin for SplitWhitespace<'a>

§

impl<'a> Unpin for Utf8Chunk<'a>

§

impl<'a> Unpin for Utf8Chunks<'a>

§

impl<'a> Unpin for nom::lib::std::string::Drain<'a>

§

impl<'a, 'b> Unpin for DebugList<'a, 'b>where 'b: 'a,

§

impl<'a, 'b> Unpin for DebugMap<'a, 'b>where 'b: 'a,

§

impl<'a, 'b> Unpin for DebugSet<'a, 'b>where 'b: 'a,

§

impl<'a, 'b> Unpin for DebugStruct<'a, 'b>where 'b: 'a,

§

impl<'a, 'b> Unpin for DebugTuple<'a, 'b>where 'b: 'a,

§

impl<'a, 'b> Unpin for CharSliceSearcher<'a, 'b>

§

impl<'a, 'b> Unpin for StrSearcher<'a, 'b>

§

impl<'a, 'b, const N: usize> Unpin for CharArrayRefSearcher<'a, 'b, N>

§

impl<'a, A> Unpin for nom::lib::std::option::Iter<'a, A>

§

impl<'a, A> Unpin for nom::lib::std::option::IterMut<'a, A>

§

impl<'a, B: ?Sized> Unpin for Cow<'a, B>where <B as ToOwned>::Owned: Unpin,

§

impl<'a, F> Unpin for CharPredicateSearcher<'a, F>where F: Unpin,

§

impl<'a, I> Unpin for ByRefSized<'a, I>

§

impl<'a, I, A> Unpin for Splice<'a, I, A>where I: Unpin,

§

impl<'a, K> Unpin for nom::lib::std::collections::hash_set::Drain<'a, K>where K: Unpin,

§

impl<'a, K> Unpin for nom::lib::std::collections::hash_set::Iter<'a, K>

§

impl<'a, K, F> Unpin for nom::lib::std::collections::hash_set::DrainFilter<'a, K, F>where F: Unpin,

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::Entry<'a, K, V>where K: Unpin,

§

impl<'a, K, V> Unpin for nom::lib::std::collections::btree_map::Cursor<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::btree_map::Iter<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::btree_map::IterMut<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::btree_map::Keys<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::btree_map::Range<'a, K, V>

§

impl<'a, K, V> Unpin for RangeMut<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::btree_map::Values<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::btree_map::ValuesMut<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::Drain<'a, K, V>where K: Unpin, V: Unpin,

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::Iter<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::IterMut<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::Keys<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::OccupiedEntry<'a, K, V>where K: Unpin,

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::OccupiedError<'a, K, V>where K: Unpin, V: Unpin,

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::VacantEntry<'a, K, V>where K: Unpin,

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::Values<'a, K, V>

§

impl<'a, K, V> Unpin for nom::lib::std::collections::hash_map::ValuesMut<'a, K, V>

§

impl<'a, K, V, A> Unpin for nom::lib::std::collections::btree_map::Entry<'a, K, V, A>where A: Unpin, K: Unpin,

§

impl<'a, K, V, A> Unpin for nom::lib::std::collections::btree_map::CursorMut<'a, K, V, A>

§

impl<'a, K, V, A> Unpin for nom::lib::std::collections::btree_map::OccupiedEntry<'a, K, V, A>where A: Unpin,

§

impl<'a, K, V, A> Unpin for nom::lib::std::collections::btree_map::OccupiedError<'a, K, V, A>where A: Unpin, V: Unpin,

§

impl<'a, K, V, A> Unpin for nom::lib::std::collections::btree_map::VacantEntry<'a, K, V, A>where A: Unpin, K: Unpin,

§

impl<'a, K, V, F> Unpin for nom::lib::std::collections::hash_map::DrainFilter<'a, K, V, F>where F: Unpin,

§

impl<'a, K, V, F, A> Unpin for nom::lib::std::collections::btree_map::DrainFilter<'a, K, V, F, A>where A: Unpin, F: Unpin,

§

impl<'a, K, V, S> Unpin for RawEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> Unpin for RawEntryBuilder<'a, K, V, S>

§

impl<'a, K, V, S> Unpin for RawEntryBuilderMut<'a, K, V, S>

§

impl<'a, K, V, S> Unpin for RawOccupiedEntryMut<'a, K, V, S>

§

impl<'a, K, V, S> Unpin for RawVacantEntryMut<'a, K, V, S>

§

impl<'a, P> Unpin for MatchIndices<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for Matches<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for RMatchIndices<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for RMatches<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for nom::lib::std::str::RSplit<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for nom::lib::std::str::RSplitN<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for RSplitTerminator<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for nom::lib::std::str::Split<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for nom::lib::std::str::SplitInclusive<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for nom::lib::std::str::SplitN<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, P> Unpin for SplitTerminator<'a, P>where <P as Pattern<'a>>::Searcher: Unpin,

§

impl<'a, T> Unpin for nom::lib::std::collections::binary_heap::Drain<'a, T>

§

impl<'a, T> Unpin for DrainSorted<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::binary_heap::Iter<'a, T>

§

impl<'a, T> Unpin for PeekMut<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::btree_set::Iter<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::btree_set::Range<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::btree_set::SymmetricDifference<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::btree_set::Union<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::linked_list::Iter<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::linked_list::IterMut<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::vec_deque::Iter<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::collections::vec_deque::IterMut<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::result::Iter<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::result::IterMut<'a, T>

§

impl<'a, T> Unpin for Chunks<'a, T>

§

impl<'a, T> Unpin for ChunksExact<'a, T>

§

impl<'a, T> Unpin for ChunksExactMut<'a, T>

§

impl<'a, T> Unpin for ChunksMut<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::slice::Iter<'a, T>

§

impl<'a, T> Unpin for nom::lib::std::slice::IterMut<'a, T>

§

impl<'a, T> Unpin for RChunks<'a, T>

§

impl<'a, T> Unpin for RChunksExact<'a, T>

§

impl<'a, T> Unpin for RChunksExactMut<'a, T>

§

impl<'a, T> Unpin for RChunksMut<'a, T>

§

impl<'a, T> Unpin for Windows<'a, T>

§

impl<'a, T, A> Unpin for nom::lib::std::collections::btree_set::Difference<'a, T, A>

§

impl<'a, T, A> Unpin for nom::lib::std::collections::btree_set::Intersection<'a, T, A>

§

impl<'a, T, A> Unpin for nom::lib::std::collections::linked_list::Cursor<'a, T, A>

§

impl<'a, T, A> Unpin for nom::lib::std::collections::linked_list::CursorMut<'a, T, A>

§

impl<'a, T, A> Unpin for nom::lib::std::collections::vec_deque::Drain<'a, T, A>

§

impl<'a, T, A> Unpin for nom::lib::std::vec::Drain<'a, T, A>

§

impl<'a, T, F, A> Unpin for nom::lib::std::collections::btree_set::DrainFilter<'a, T, F, A>where A: Unpin, F: Unpin,

§

impl<'a, T, F, A> Unpin for nom::lib::std::collections::linked_list::DrainFilter<'a, T, F, A>where F: Unpin,

§

impl<'a, T, F, A> Unpin for nom::lib::std::vec::DrainFilter<'a, T, F, A>where F: Unpin,

§

impl<'a, T, P> Unpin for GroupBy<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for GroupByMut<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::RSplit<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for RSplitMut<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::RSplitN<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for RSplitNMut<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::Split<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::SplitInclusive<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for SplitInclusiveMut<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for SplitMut<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::SplitN<'a, T, P>where P: Unpin,

§

impl<'a, T, P> Unpin for SplitNMut<'a, T, P>where P: Unpin,

§

impl<'a, T, S> Unpin for nom::lib::std::collections::hash_set::Difference<'a, T, S>

§

impl<'a, T, S> Unpin for nom::lib::std::collections::hash_set::Intersection<'a, T, S>

§

impl<'a, T, S> Unpin for nom::lib::std::collections::hash_set::SymmetricDifference<'a, T, S>

§

impl<'a, T, S> Unpin for nom::lib::std::collections::hash_set::Union<'a, T, S>

§

impl<'a, T, const N: usize> Unpin for nom::lib::std::slice::ArrayChunks<'a, T, N>

§

impl<'a, T, const N: usize> Unpin for ArrayChunksMut<'a, T, N>

§

impl<'a, T, const N: usize> Unpin for ArrayWindows<'a, T, N>

§

impl<'a, const N: usize> Unpin for CharArraySearcher<'a, N>

§

impl<A> Unpin for Repeat<A>where A: Unpin,

§

impl<A> Unpin for nom::lib::std::option::IntoIter<A>where A: Unpin,

§

impl<A, B> Unpin for Chain<A, B>where A: Unpin, B: Unpin,

§

impl<A, B> Unpin for Zip<A, B>where A: Unpin, B: Unpin,

§

impl<B, C> Unpin for ControlFlow<B, C>where B: Unpin, C: Unpin,

§

impl<E> Unpin for Err<E>where E: Unpin,

§

impl<F> Unpin for FromFn<F>where F: Unpin,

§

impl<F> Unpin for OnceWith<F>where F: Unpin,

§

impl<F> Unpin for RepeatWith<F>where F: Unpin,

§

impl<H> Unpin for BuildHasherDefault<H>

§

impl<I> Unpin for VerboseError<I>where I: Unpin,

§

impl<I> Unpin for Cloned<I>where I: Unpin,

§

impl<I> Unpin for Copied<I>where I: Unpin,

§

impl<I> Unpin for Cycle<I>where I: Unpin,

§

impl<I> Unpin for Enumerate<I>where I: Unpin,

§

impl<I> Unpin for Flatten<I>where I: Unpin, <<I as Iterator>::Item as IntoIterator>::IntoIter: Unpin,

§

impl<I> Unpin for Fuse<I>where I: Unpin,

§

impl<I> Unpin for Intersperse<I>where I: Unpin, <I as Iterator>::Item: Unpin,

§

impl<I> Unpin for Peekable<I>where I: Unpin, <I as Iterator>::Item: Unpin,

§

impl<I> Unpin for Skip<I>where I: Unpin,

§

impl<I> Unpin for StepBy<I>where I: Unpin,

§

impl<I> Unpin for Take<I>where I: Unpin,

§

impl<I, E, F> Unpin for ParserIterator<I, E, F>where E: Unpin, F: Unpin, I: Unpin,

§

impl<I, F> Unpin for FilterMap<I, F>where F: Unpin, I: Unpin,

§

impl<I, F> Unpin for Inspect<I, F>where F: Unpin, I: Unpin,

§

impl<I, F> Unpin for Map<I, F>where F: Unpin, I: Unpin,

§

impl<I, G> Unpin for IntersperseWith<I, G>where G: Unpin, I: Unpin, <I as Iterator>::Item: Unpin,

§

impl<I, P> Unpin for Filter<I, P>where I: Unpin, P: Unpin,

§

impl<I, P> Unpin for MapWhile<I, P>where I: Unpin, P: Unpin,

§

impl<I, P> Unpin for SkipWhile<I, P>where I: Unpin, P: Unpin,

§

impl<I, P> Unpin for TakeWhile<I, P>where I: Unpin, P: Unpin,

§

impl<I, St, F> Unpin for Scan<I, St, F>where F: Unpin, I: Unpin, St: Unpin,

§

impl<I, U, F> Unpin for FlatMap<I, U, F>where F: Unpin, I: Unpin, <U as IntoIterator>::IntoIter: Unpin,

§

impl<I, const N: usize> Unpin for nom::lib::std::iter::ArrayChunks<I, N>where I: Unpin, <I as Iterator>::Item: Unpin,

§

impl<Idx> Unpin for nom::lib::std::ops::Range<Idx>where Idx: Unpin,

§

impl<Idx> Unpin for RangeFrom<Idx>where Idx: Unpin,

§

impl<Idx> Unpin for RangeInclusive<Idx>where Idx: Unpin,

§

impl<Idx> Unpin for RangeTo<Idx>where Idx: Unpin,

§

impl<Idx> Unpin for RangeToInclusive<Idx>where Idx: Unpin,

§

impl<K> Unpin for nom::lib::std::collections::hash_set::IntoIter<K>where K: Unpin,

§

impl<K, V> Unpin for nom::lib::std::collections::hash_map::IntoIter<K, V>where K: Unpin, V: Unpin,

§

impl<K, V> Unpin for nom::lib::std::collections::hash_map::IntoKeys<K, V>where K: Unpin, V: Unpin,

§

impl<K, V> Unpin for nom::lib::std::collections::hash_map::IntoValues<K, V>where K: Unpin, V: Unpin,

§

impl<K, V, A> Unpin for nom::lib::std::collections::btree_map::IntoIter<K, V, A>where A: Unpin,

§

impl<K, V, A> Unpin for nom::lib::std::collections::btree_map::IntoKeys<K, V, A>where A: Unpin,

§

impl<K, V, A> Unpin for nom::lib::std::collections::btree_map::IntoValues<K, V, A>where A: Unpin,

§

impl<K, V, A> Unpin for BTreeMap<K, V, A>where A: Unpin,

§

impl<K, V, S> Unpin for HashMap<K, V, S>where K: Unpin, S: Unpin, V: Unpin,

§

impl<T> Unpin for Bound<T>where T: Unpin,

§

impl<T> Unpin for Option<T>where T: Unpin,

§

impl<T> Unpin for Reverse<T>where T: Unpin,

§

impl<T> Unpin for nom::lib::std::collections::binary_heap::IntoIter<T>where T: Unpin,

§

impl<T> Unpin for IntoIterSorted<T>where T: Unpin,

§

impl<T> Unpin for BinaryHeap<T>where T: Unpin,

§

impl<T> Unpin for Empty<T>

§

impl<T> Unpin for Once<T>where T: Unpin,

§

impl<T> Unpin for Rev<T>where T: Unpin,

§

impl<T> Unpin for Discriminant<T>

§

impl<T> Unpin for Yeet<T>where T: Unpin,

§

impl<T> Unpin for nom::lib::std::result::IntoIter<T>where T: Unpin,

§

impl<T> Unpin for MaybeUninit<T>where T: Unpin,

§

impl<T, A> Unpin for nom::lib::std::collections::btree_set::IntoIter<T, A>where A: Unpin,

§

impl<T, A> Unpin for nom::lib::std::collections::linked_list::IntoIter<T, A>where A: Unpin,

§

impl<T, A> Unpin for BTreeSet<T, A>where A: Unpin,

§

impl<T, A> Unpin for LinkedList<T, A>where A: Unpin,

§

impl<T, A> Unpin for VecDeque<T, A>where A: Unpin, T: Unpin,

§

impl<T, A> Unpin for nom::lib::std::collections::vec_deque::IntoIter<T, A>where A: Unpin, T: Unpin,

§

impl<T, A> Unpin for nom::lib::std::vec::IntoIter<T, A>where A: Unpin, T: Unpin,

§

impl<T, A> Unpin for Vec<T, A>where A: Unpin, T: Unpin,

§

impl<T, E> Unpin for Result<T, E>where E: Unpin, T: Unpin,

§

impl<T, F> Unpin for Successors<T, F>where F: Unpin, T: Unpin,

§

impl<T, S> Unpin for HashSet<T, S>where S: Unpin, T: Unpin,

§

impl<T: ?Sized> Unpin for ThinBox<T>where T: Unpin,

§

impl<T: ?Sized> Unpin for ManuallyDrop<T>where T: Unpin,

§

impl<Y, R> Unpin for GeneratorState<Y, R>where R: Unpin, Y: Unpin,