Struct cranelift_entity::BoxedSlice [−][src]
pub struct BoxedSlice<K, V> where
K: EntityRef, { /* fields omitted */ }
Expand description
A slice mapping K -> V
allocating dense entity references.
The BoxedSlice
data structure uses the dense index space to implement a map with a boxed
slice.
Implementations
Create a new slice from a raw pointer. A safer way to create slices is
to use PrimaryMap::into_boxed_slice()
.
Safety
This relies on raw
pointing to a valid slice of V
s.
Get the element at k
if it exists, mutable version.
Iterate over all the keys in this map.
Iterate over all the values in this map, mutable edition.
Iterate over all the keys and values in this map.
Iterate over all the keys and values in this map, mutable edition.
Trait Implementations
Immutable indexing into a BoxedSlice
.
The indexed value must be in the map.
Mutable indexing into a BoxedSlice
.
Auto Trait Implementations
impl<K, V> Send for BoxedSlice<K, V> where
K: Send,
V: Send,
impl<K, V> Sync for BoxedSlice<K, V> where
K: Sync,
V: Sync,
impl<K, V> Unpin for BoxedSlice<K, V> where
K: Unpin,
Blanket Implementations
Mutably borrows from an owned value. Read more