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.
impl<'_> Send for nom::lib::std::string::Drain<'_>
impl<'_, T> Send for nom::lib::std::collections::linked_list::Iter<'_, T> where
T: Sync,
impl<'_, T> Send for nom::lib::std::collections::linked_list::IterMut<'_, T> where
T: Send,
impl<'_, T> Send for nom::lib::std::collections::vec_deque::IterMut<'_, T> where
T: Send,
impl<'_, T> Send for nom::lib::std::slice::Iter<'_, T> where
T: Sync,
impl<K, V, S, A> Send for OccupiedEntry<'_, K, V, S, A> where
K: Send,
V: Send,
S: Send,
A: Send + Allocator + Clone,
impl<'a, A> Send for nom::lib::std::option::Iter<'a, A> where
A: Sync,
impl<'a, K> Send for nom::lib::std::collections::hash_set::Drain<'a, K> where
K: Send,
impl<'a, K> Send for nom::lib::std::collections::hash_set::Iter<'a, K> where
K: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::btree_map::Entry<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for nom::lib::std::collections::hash_map::Entry<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for nom::lib::std::collections::btree_map::Iter<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::btree_map::IterMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for nom::lib::std::collections::btree_map::Keys<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::btree_map::Range<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::btree_map::Values<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::btree_map::ValuesMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for nom::lib::std::collections::hash_map::Drain<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for nom::lib::std::collections::hash_map::Iter<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::hash_map::IterMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, K, V> Send for nom::lib::std::collections::hash_map::Keys<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::hash_map::Values<'a, K, V> where
K: Sync,
V: Sync,
impl<'a, K, V> Send for nom::lib::std::collections::hash_map::ValuesMut<'a, K, V> where
K: Send,
V: Send,
impl<'a, T> Send for nom::lib::std::collections::binary_heap::Drain<'a, T> where
T: Send,
impl<'a, T> Send for nom::lib::std::collections::binary_heap::Iter<'a, T> where
T: Sync,
impl<'a, T> Send for nom::lib::std::collections::btree_set::Difference<'a, T> where
T: Sync,
impl<'a, T> Send for nom::lib::std::collections::btree_set::Iter<'a, T> where
T: Sync,
impl<'a, T> Send for nom::lib::std::collections::btree_set::Range<'a, T> where
T: Sync,
impl<'a, T> Send for nom::lib::std::collections::btree_set::Union<'a, T> where
T: Sync,
impl<'a, T> Send for nom::lib::std::collections::vec_deque::Iter<'a, T> where
T: Sync,
impl<'a, T> Send for nom::lib::std::result::Iter<'a, T> where
T: Sync,
impl<'a, T, F> !Send for nom::lib::std::collections::linked_list::DrainFilter<'a, T, F>
impl<'a, T, P> Send for nom::lib::std::slice::Split<'a, T, P> where
P: Send,
T: Sync,
impl<'a, T, S> Send for nom::lib::std::collections::hash_set::Union<'a, T, S> where
S: Sync,
T: Sync,
impl<Idx> Send for nom::lib::std::ops::Range<Idx> where
Idx: Send,
impl<K> Send for nom::lib::std::collections::hash_set::IntoIter<K> where
K: Send,
impl<T> Send for nom::lib::std::collections::binary_heap::IntoIter<T> where
T: Send,
impl<T> Send for nom::lib::std::collections::btree_set::IntoIter<T> where
T: Send,
impl<T> Send for nom::lib::std::collections::linked_list::IntoIter<T> where
T: Send,
impl<T> Send for nom::lib::std::iter::Once<T> where
T: Send,
impl<'abbrev, 'entry, 'unit, R> !Send for AttrsIter<'abbrev, 'entry, 'unit, R>
impl<'a, K, V, F, A> Send for DrainFilter<'a, K, V, F, A> where
F: Send,
K: Send,
V: Send,
impl<'a, K, V, S, A> Send for RawEntryMut<'a, K, V, S, A> where
A: Send,
K: Send,
S: Sync,
V: Send,
impl<'a, K, V, S, A> Send for RawEntryBuilder<'a, K, V, S, A> where
K: Sync,
S: Sync,
V: Sync,
impl<'a, K, V, S, A> Send for Entry<'a, K, V, S, A> where
A: Send,
K: Send,
S: Send,
V: Send,
impl<'a, K, V, S, A> Send for VacantEntry<'a, K, V, S, A> where
K: Send,
S: Send,
V: Send,
impl<'a, K, V, S, A> Send for OccupiedError<'a, K, V, S, A> where
A: Send,
K: Send,
S: Send,
V: Send,
impl<'a, K, I, F> !Send for Group<'a, K, I, F>
impl<NodeId, EdgeWeight> Send for Paths<NodeId, EdgeWeight> where
EdgeWeight: Send,
NodeId: Send,
impl<N, E, Ty, Ix> Send for Csr<N, E, Ty, Ix> where
E: Send,
Ix: Send,
N: Send,
Ty: Send,
impl<N, E, Ty, Ix> Send for Graph<N, E, Ty, Ix> where
E: Send,
Ix: Send,
N: Send,
Ty: Send,
impl<I, U, ID, F> Send for TryFold<I, U, ID, F> where
F: Send,
I: Send,
ID: Send,
U: Send,
impl<'a, WrapAlgo, WordSep, WordSplit> Send for Options<'a, WrapAlgo, WordSep, WordSplit> where
WordSep: Send,
WordSplit: Send,
WrapAlgo: Send,