pub unsafe auto trait Send { }Expand description
Types that can be transferred across thread boundaries.
This trait is automatically implemented when the compiler determines it’s appropriate.
An example of a non-Send type is the reference-counting pointer
rc::Rc. If two threads attempt to clone Rcs that point to the same
reference-counted value, they might try to update the reference count at the
same time, which is undefined behavior because Rc doesn’t use atomic
operations. Its cousin sync::Arc does use atomic operations (incurring
some overhead) and thus is Send.
See the Nomicon and the Sync trait for more details.
Implementors§
impl !Send for Args
impl !Send for ArgsOs
impl Send for gstd::prelude::string::Drain<'_>
impl Send for Waker
impl Send for AtomicWaker
impl Send for Bytes
impl Send for BytesMut
impl<'a> Send for IoSlice<'a>
impl<'a> Send for IoSliceMut<'a>
impl<'a, 'b, K, Q, V, S, A> Send for OccupiedEntryRef<'a, 'b, K, Q, V, S, A>
impl<'a, T, O> Send for Iter<'a, T, O>where
T: BitStore,
O: BitOrder,
&'a mut BitSlice<T, O>: Send,
impl<'a, T, O> Send for IterMut<'a, T, O>where
T: BitStore,
O: BitOrder,
&'a mut BitSlice<T, O>: Send,
impl<'a, T, const CAP: usize> Send for arrayvec::arrayvec::Drain<'a, T, CAP>where
T: Send,
impl<Dyn> Send for DynMetadata<Dyn>where
Dyn: ?Sized,
impl<Fut> Send for FuturesUnordered<Fut>where
Fut: Send,
impl<Fut> Send for IntoIter<Fut>
impl<Fut> Send for IterPinMut<'_, Fut>where
Fut: Send,
impl<Fut> Send for IterPinRef<'_, Fut>where
Fut: Send,
impl<K, V> Send for gstd::prelude::collections::hash_map::IterMut<'_, K, V>
impl<K, V, S, A> Send for gstd::prelude::collections::hash_map::OccupiedEntry<'_, K, V, S, A>
impl<K, V, S, A> Send for RawOccupiedEntryMut<'_, K, V, S, A>
impl<M, T, O> Send for BitRef<'_, M, T, O>where
M: Mutability,
T: BitStore + Sync,
O: BitOrder,
impl<T> !Send for *const Twhere
T: ?Sized,
impl<T> !Send for *mut Twhere
T: ?Sized,
impl<T> !Send for NonNull<T>where
T: ?Sized,
NonNull pointers are not Send because the data they reference may be aliased.
impl<T> !Send for std::sync::mutex::MutexGuard<'_, T>where
T: ?Sized,
impl<T> !Send for std::sync::rwlock::RwLockReadGuard<'_, T>where
T: ?Sized,
impl<T> !Send for std::sync::rwlock::RwLockWriteGuard<'_, T>where
T: ?Sized,
impl<T> Send for &T
impl<T> Send for ThinBox<T>
ThinBox<T> is Send if T is Send because the data is owned.
impl<T> Send for Cell<T>
impl<T> Send for RefCell<T>
impl<T> Send for gstd::prelude::collections::linked_list::Iter<'_, T>where
T: Sync,
impl<T> Send for gstd::prelude::collections::linked_list::IterMut<'_, T>where
T: Send,
impl<T> Send for ChunksExactMut<'_, T>where
T: Send,
impl<T> Send for ChunksMut<'_, T>where
T: Send,
impl<T> Send for gstd::prelude::slice::Iter<'_, T>where
T: Sync,
impl<T> Send for gstd::prelude::slice::IterMut<'_, T>where
T: Send,
impl<T> Send for RChunksExactMut<'_, T>where
T: Send,
impl<T> Send for RChunksMut<'_, T>where
T: Send,
impl<T> Send for AtomicPtr<T>
impl<T> Send for Receiver<T>where
T: Send,
impl<T> Send for Sender<T>where
T: Send,
impl<T> Send for SyncSender<T>where
T: Send,
impl<T> Send for std::sync::mutex::Mutex<T>
impl<T> Send for OnceLock<T>where
T: Send,
impl<T> Send for std::sync::rwlock::RwLock<T>
impl<T> Send for JoinHandle<T>
impl<T> Send for BitSpanError<T>where
T: BitStore,
impl<T> Send for Bucket<T>
impl<T> Send for FutureObj<'_, T>
impl<T> Send for MisalignError<T>
impl<T> Send for Mutex<T>
impl<T> Send for MutexGuard<'_, T>
impl<T> Send for MutexLockFuture<'_, T>
impl<T> Send for OwnedMutexGuard<T>
impl<T> Send for OwnedMutexLockFuture<T>
impl<T, A> !Send for Rc<T, A>
impl<T, A> !Send for gstd::prelude::rc::Weak<T, A>
impl<T, A> Send for gstd::prelude::collections::linked_list::Cursor<'_, T, A>
impl<T, A> Send for gstd::prelude::collections::linked_list::CursorMut<'_, T, A>
impl<T, A> Send for LinkedList<T, A>
impl<T, A> Send for gstd::prelude::collections::vec_deque::Drain<'_, T, A>
impl<T, A> Send for gstd::prelude::vec::Drain<'_, T, A>
impl<T, A> Send for gstd::prelude::vec::IntoIter<T, A>
impl<T, A> Send for Arc<T, A>
impl<T, A> Send for alloc::sync::Weak<T, A>
impl<T, A> Send for Box<T, A>
impl<T, A> Send for Drain<'_, T, A>
impl<T, A> Send for IntoIter<T, A>
impl<T, A> Send for OccupiedEntry<'_, T, A>
impl<T, A> Send for RawDrain<'_, T, A>
impl<T, A> Send for RawIntoIter<T, A>
impl<T, A> Send for RawTable<T, A>
impl<T, O> Send for BitBox<T, O>where
T: BitStore,
O: BitOrder,
impl<T, O> Send for BitSlice<T, O>where
T: BitStore + Sync,
O: BitOrder,
§Bit-Slice Thread Safety
This allows bit-slice references to be moved across thread boundaries only when
the underlying T element can tolerate concurrency.
All BitSlice references, shared or exclusive, are only threadsafe if the T
element type is Send, because any given bit-slice reference may only have
partial control of a memory element that is also being shared by a bit-slice
reference on another thread. As such, this is never implemented for Cell<U>,
but always implemented for AtomicU and U for a given unsigned integer type
U.
Atomic integers safely handle concurrent writes, cells do not allow concurrency
at all, so the only missing piece is &mut BitSlice<_, U: Unsigned>. This is
handled by the aliasing system that the mutable splitters employ: a mutable
reference to an unsynchronized bit-slice can only cross threads when no other
handle is able to exist to the elements it governs. Splitting a mutable
bit-slice causes the split halves to change over to either atomics or cells, so
concurrency is either safe or impossible.