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 Rc
s 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 for more details.
NonNull
pointers are not Send
because the data they reference may be aliased.
Conditionally mark BitSlice
as Send
based on its T
type argument.
In order for BitSlice
to be Send
(that is, &mut BitSlice
can be moved
across thread boundaries), it must be capable of writing to memory without
invalidating any other &BitSlice
handles that alias the same memory address.
This is true when T
is one of the fundamental integers, because no other
&BitSlice
handle is able to observe mutations, or when T
is a BitSafe
type
that implements atomic read-modify-write instructions, because other &BitSlice
types will be protected from data races by the hardware.
When T
is a non-atomic BitSafe
type, BitSlice
cannot be Send
, because
one &mut BitSlice
moved across a thread boundary may cause mutation that
another &BitSlice
may observe, but the instructions used to access memory do
not guard against data races.
A &mut BitSlice
over aliased memory addresses is equivalent to either a
&Cell
or &AtomicT
, depending on what the radium
crate makes available
for the register width.
impl<'_> Send for scale_info::prelude::string::Drain<'_>
impl<'_, T> Send for scale_info::prelude::collections::linked_list::Iter<'_, T> where
T: Sync,
impl<'_, T> Send for scale_info::prelude::collections::linked_list::IterMut<'_, T> where
T: Send,
impl<'_, T> Send for scale_info::prelude::collections::vec_deque::IterMut<'_, T> where
T: Send,
impl<'a, K> Send for scale_info::prelude::collections::hash_set::Drain<'a, K> where
K: Send,
impl<'a, K> Send for scale_info::prelude::collections::hash_set::Iter<'a, K> where
K: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::btree_map::Entry<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for scale_info::prelude::collections::hash_map::Entry<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for scale_info::prelude::collections::btree_map::Iter<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::btree_map::IterMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for scale_info::prelude::collections::btree_map::Keys<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::btree_map::Range<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::btree_map::Values<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::btree_map::ValuesMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for scale_info::prelude::collections::hash_map::Drain<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for scale_info::prelude::collections::hash_map::Iter<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::hash_map::IterMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for scale_info::prelude::collections::hash_map::Keys<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::hash_map::Values<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for scale_info::prelude::collections::hash_map::ValuesMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, T> Send for scale_info::prelude::collections::binary_heap::Drain<'a, T> where
T: Send,
impl<'a, T> Send for scale_info::prelude::collections::binary_heap::Iter<'a, T> where
T: Sync,
impl<'a, T> Send for scale_info::prelude::collections::btree_set::Difference<'a, T> where
T: Sync,
impl<'a, T> Send for scale_info::prelude::collections::btree_set::Intersection<'a, T> where
T: Sync,
impl<'a, T> Send for scale_info::prelude::collections::btree_set::Iter<'a, T> where
T: Sync,
impl<'a, T> Send for scale_info::prelude::collections::btree_set::Range<'a, T> where
T: Sync,
impl<'a, T> Send for scale_info::prelude::collections::btree_set::Union<'a, T> where
T: Sync,
impl<'a, T> Send for scale_info::prelude::collections::vec_deque::Iter<'a, T> where
T: Sync,
impl<'a, T, F> !Send for scale_info::prelude::collections::linked_list::DrainFilter<'a, T, F>
impl<'a, T, S> Send for scale_info::prelude::collections::hash_set::Difference<'a, T, S> where
S: Sync,
T: Sync,
impl<'a, T, S> Send for scale_info::prelude::collections::hash_set::Union<'a, T, S> where
S: Sync,
T: Sync,
impl<Idx> Send for scale_info::prelude::ops::Range<Idx> where
Idx: Send,
impl<K> Send for scale_info::prelude::collections::hash_set::IntoIter<K> where
K: Send,
impl<K, V> Send for scale_info::prelude::collections::btree_map::IntoIter<K, V> where
K: Send,
V: Send,
impl<K, V> Send for scale_info::prelude::collections::btree_map::IntoKeys<K, V> where
K: Send,
V: Send,
impl<K, V> Send for scale_info::prelude::collections::hash_map::IntoIter<K, V> where
K: Send,
V: Send,
impl<K, V> Send for scale_info::prelude::collections::hash_map::IntoKeys<K, V> where
K: Send,
V: Send,
impl<T> Send for scale_info::prelude::collections::binary_heap::IntoIter<T> where
T: Send,
impl<T> Send for scale_info::prelude::collections::btree_set::IntoIter<T> where
T: Send,
impl<T> Send for scale_info::prelude::collections::linked_list::IntoIter<T> where
T: Send,
impl<T, A> Send for scale_info::prelude::collections::vec_deque::IntoIter<T, A> where
A: Send,
T: Send,