#[repr(transparent)]pub struct Slice<K, V> { /* private fields */ }
Expand description
A dynamically-sized slice of key-value pairs in an IndexMap
.
This supports indexed operations much like a [(K, V)]
slice,
but not any hashed operations on the map keys.
Unlike IndexMap
, Slice
does consider the order for PartialEq
and Eq
, and it also implements PartialOrd
, Ord
, and Hash
.
Implementations§
source§impl<K, V> Slice<K, V>
impl<K, V> Slice<K, V>
sourcepub fn get_index(&self, index: usize) -> Option<(&K, &V)>
pub fn get_index(&self, index: usize) -> Option<(&K, &V)>
Get a key-value pair by index.
Valid indices are 0 <= index < self.len()
sourcepub fn get_index_mut(&mut self, index: usize) -> Option<(&K, &mut V)>
pub fn get_index_mut(&mut self, index: usize) -> Option<(&K, &mut V)>
Get a key-value pair by index, with mutable access to the value.
Valid indices are 0 <= index < self.len()
sourcepub fn get_range<R: RangeBounds<usize>>(&self, range: R) -> Option<&Self>
pub fn get_range<R: RangeBounds<usize>>(&self, range: R) -> Option<&Self>
Returns a slice of key-value pairs in the given range of indices.
Valid indices are 0 <= index < self.len()
sourcepub fn get_range_mut<R: RangeBounds<usize>>(
&mut self,
range: R
) -> Option<&mut Self>
pub fn get_range_mut<R: RangeBounds<usize>>( &mut self, range: R ) -> Option<&mut Self>
Returns a mutable slice of key-value pairs in the given range of indices.
Valid indices are 0 <= index < self.len()
sourcepub fn first_mut(&mut self) -> Option<(&K, &mut V)>
pub fn first_mut(&mut self) -> Option<(&K, &mut V)>
Get the first key-value pair, with mutable access to the value.
sourcepub fn last_mut(&mut self) -> Option<(&K, &mut V)>
pub fn last_mut(&mut self) -> Option<(&K, &mut V)>
Get the last key-value pair, with mutable access to the value.
sourcepub fn split_at(&self, index: usize) -> (&Self, &Self)
pub fn split_at(&self, index: usize) -> (&Self, &Self)
Divides one slice into two at an index.
Panics if index > len
.
sourcepub fn split_at_mut(&mut self, index: usize) -> (&mut Self, &mut Self)
pub fn split_at_mut(&mut self, index: usize) -> (&mut Self, &mut Self)
Divides one mutable slice into two at an index.
Panics if index > len
.
sourcepub fn split_first(&self) -> Option<((&K, &V), &Self)>
pub fn split_first(&self) -> Option<((&K, &V), &Self)>
Returns the first key-value pair and the rest of the slice,
or None
if it is empty.
sourcepub fn split_first_mut(&mut self) -> Option<((&K, &mut V), &mut Self)>
pub fn split_first_mut(&mut self) -> Option<((&K, &mut V), &mut Self)>
Returns the first key-value pair and the rest of the slice,
with mutable access to the value, or None
if it is empty.
sourcepub fn split_last(&self) -> Option<((&K, &V), &Self)>
pub fn split_last(&self) -> Option<((&K, &V), &Self)>
Returns the last key-value pair and the rest of the slice,
or None
if it is empty.
sourcepub fn split_last_mut(&mut self) -> Option<((&K, &mut V), &mut Self)>
pub fn split_last_mut(&mut self) -> Option<((&K, &mut V), &mut Self)>
Returns the last key-value pair and the rest of the slice,
with mutable access to the value, or None
if it is empty.
sourcepub fn iter(&self) -> Iter<'_, K, V> ⓘ
pub fn iter(&self) -> Iter<'_, K, V> ⓘ
Return an iterator over the key-value pairs of the map slice.
sourcepub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
pub fn iter_mut(&mut self) -> IterMut<'_, K, V> ⓘ
Return an iterator over the key-value pairs of the map slice.
sourcepub fn into_keys(self: Box<Self>) -> IntoKeys<K, V> ⓘ
pub fn into_keys(self: Box<Self>) -> IntoKeys<K, V> ⓘ
Return an owning iterator over the keys of the map slice.
sourcepub fn values(&self) -> Values<'_, K, V> ⓘ
pub fn values(&self) -> Values<'_, K, V> ⓘ
Return an iterator over the values of the map slice.
sourcepub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
pub fn values_mut(&mut self) -> ValuesMut<'_, K, V> ⓘ
Return an iterator over mutable references to the the values of the map slice.
sourcepub fn into_values(self: Box<Self>) -> IntoValues<K, V> ⓘ
pub fn into_values(self: Box<Self>) -> IntoValues<K, V> ⓘ
Return an owning iterator over the values of the map slice.
Trait Implementations§
source§impl<'a, K, V> IntoIterator for &'a Slice<K, V>
impl<'a, K, V> IntoIterator for &'a Slice<K, V>
source§impl<'a, K, V> IntoIterator for &'a mut Slice<K, V>
impl<'a, K, V> IntoIterator for &'a mut Slice<K, V>
source§impl<K, V> IntoIterator for Box<Slice<K, V>>
impl<K, V> IntoIterator for Box<Slice<K, V>>
source§impl<K: PartialEq, V: PartialEq> PartialEq<Slice<K, V>> for Slice<K, V>
impl<K: PartialEq, V: PartialEq> PartialEq<Slice<K, V>> for Slice<K, V>
source§impl<K: PartialOrd, V: PartialOrd> PartialOrd<Slice<K, V>> for Slice<K, V>
impl<K: PartialOrd, V: PartialOrd> PartialOrd<Slice<K, V>> for Slice<K, V>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read more