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

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

Types that do not require any pinning guarantees.

For information on what “pinning” is, see the pin module documentation.

Implementing the Unpin trait for T expresses the fact that T is pinning-agnostic: it shall not expose nor rely on any pinning guarantees. This, in turn, means that a Pin-wrapped pointer to such a type can feature a fully unrestricted API. In other words, if T: Unpin, a value of type T will not be bound by the invariants which pinning otherwise offers, even when “pinned” by a Pin<Ptr> pointing at it. When a value of type T is pointed at by a Pin<Ptr>, Pin will not restrict access to the pointee value like it normally would, thus allowing the user to do anything that they normally could with a non-Pin-wrapped Ptr to that value.

The idea of this trait is to alleviate the reduced ergonomics of APIs that require the use of Pin for soundness for some types, but which also want to be used by other types that don’t care about pinning. The prime example of such an API is Future::poll. There are many Future types that don’t care about pinning. These futures can implement Unpin and therefore get around the pinning related restrictions in the API, while still allowing the subset of Futures which do require pinning to be implemented soundly.

For more discussion on the consequences of Unpin within the wider scope of the pinning system, see the section about Unpin in the pin module.

Unpin has no consequence at all for non-pinned data. In particular, mem::replace happily moves !Unpin data, which would be immovable when pinned (mem::replace works for any &mut T, not just when T: Unpin).

However, you cannot use mem::replace on !Unpin data which is pinned by being wrapped inside a Pin<Ptr> pointing at it. This is because you cannot (safely) use a Pin<Ptr> to get an &mut T to its pointee value, which you would need to call mem::replace, 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. The compiler is free to take the conservative stance of marking types as Unpin so long as all of the types that compose its fields are also Unpin. This is because if a type implements Unpin, then it is unsound for that type’s implementation to rely on pinning-related guarantees for soundness, even when viewed through a “pinning” pointer! It is the responsibility of the implementor of a type that relies upon pinning for soundness to ensure that type is not marked as Unpin by adding PhantomPinned field. For more details, see the pin module docs.

Implementors§

source§

impl !Unpin for PhantomPinned

source§

impl Unpin for LocalWaker

1.36.0 · source§

impl Unpin for Waker

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 T
where T: ?Sized,

1.38.0 · source§

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

source§

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

source§

impl<T> Unpin for &mut T
where T: ?Sized,

1.48.0 · source§

impl<T> Unpin for Ready<T>

1.28.0 · source§

impl<T> Unpin for NonZero<T>

source§

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

source§

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

source§

impl<T, A> Unpin for Arc<T, A>
where A: Allocator, 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 UnorderedKeyError

§

impl Unpin for TryReserveError

§

impl Unpin for Error

§

impl Unpin for DefaultHasher

§

impl Unpin for RandomState

§

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>

§

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

§

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

§

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

§

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

§

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> Unpin for Cow<'a, B>
where <B as ToOwned>::Owned: Unpin, B: ?Sized,

§

impl<'a, F> Unpin for CharPredicateSearcher<'a, F>
where F: FnOnce(char) + 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>

§

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::ExtractIf<'a, K, F>
where F: FnOnce(&K) + 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>

§

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 V: Unpin, K: 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 K: Unpin, A: 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 CursorMutKey<'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 V: Unpin, A: Unpin,

§

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

§

impl<'a, K, V, F> Unpin for nom::lib::std::collections::hash_map::ExtractIf<'a, K, V, F>
where F: FnOnce(&K, &mut V) + Unpin,

§

impl<'a, K, V, F, A> Unpin for nom::lib::std::collections::btree_map::ExtractIf<'a, K, V, F, A>
where F: FnOnce(&K, &mut V) + Unpin, A: 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::Iter<'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::binary_heap::Drain<'a, T, A>

§

impl<'a, T, A> Unpin for DrainSorted<'a, T, A>
where T: PartialOrd + PartialEq + Eq,

§

impl<'a, T, A> Unpin for PeekMut<'a, T, A>
where T: PartialOrd + PartialEq + Eq,

§

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::ExtractIf<'a, T, F, A>
where F: FnOnce(&T) + Unpin, A: Unpin,

§

impl<'a, T, F, A> Unpin for nom::lib::std::collections::linked_list::ExtractIf<'a, T, F, A>
where F: FnOnce(&mut T) + Unpin,

§

impl<'a, T, F, A> Unpin for nom::lib::std::vec::ExtractIf<'a, T, F, A>
where F: FnOnce(&mut T) + Unpin,

§

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

§

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

§

impl<'a, T, P> Unpin for nom::lib::std::slice::RSplit<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for RSplitMut<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::RSplitN<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for RSplitNMut<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::Split<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::SplitInclusive<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for SplitInclusiveMut<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for SplitMut<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for nom::lib::std::slice::SplitN<'a, T, P>
where P: FnOnce(&T) + Unpin,

§

impl<'a, T, P> Unpin for SplitNMut<'a, T, P>
where P: FnOnce(&T) + 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 RepeatN<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 C: Unpin, B: Unpin,

§

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

§

impl<F> Unpin for FormatterFn<F>
where F: FnMut(&mut Formatter<'_>) + FnOnce(&mut Formatter<'_>) + 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 as Iterator>::Item as IntoIterator>::IntoIter: Unpin, I: Unpin,

§

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

§

impl<I> Unpin for Intersperse<I>
where <I as Iterator>::Item: Sized + Unpin, I: 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 F: Unpin, I: Unpin, E: Unpin,

§

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

§

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

§

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

§

impl<I, F, const N: usize> Unpin for MapWindows<I, F, N>
where F: Unpin, I: Unpin, <I as Iterator>::Item: Unpin,

§

impl<I, G> Unpin for IntersperseWith<I, G>
where G: Unpin, <I as Iterator>::Item: Unpin, I: 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 I: Unpin, F: Unpin, St: Unpin,

§

impl<I, U, F> Unpin for FlatMap<I, U, F>
where <U as IntoIterator>::IntoIter: Unpin, I: Unpin, F: 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 S: Unpin, K: 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 ThinBox<T>
where T: Unpin + ?Sized,

§

impl<T> Unpin for Reverse<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 ManuallyDrop<T>
where T: Unpin + ?Sized,

§

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::binary_heap::IntoIter<T, A>
where T: Unpin, A: Unpin,

§

impl<T, A> Unpin for IntoIterSorted<T, A>
where A: Unpin, 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 BinaryHeap<T, A>
where A: Unpin, T: 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 T: Unpin, A: Unpin,

§

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

§

impl<T, E> Unpin for Result<T, E>
where T: Unpin, E: 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<Y, R> Unpin for CoroutineState<Y, R>
where Y: Unpin, R: Unpin,