Struct vector_config::indexmap::map::Slice

pub struct Slice<K, V> { /* private fields */ }

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

impl<K, V> Slice<K, V>

pub const fn new<'a>() -> &'a Slice<K, V>

Returns an empty slice.

pub fn new_mut<'a>() -> &'a mut Slice<K, V>

Returns an empty mutable slice.

pub const fn len(&self) -> usize

Return the number of key-value pairs in the map slice.

pub const fn is_empty(&self) -> bool

Returns true if the map slice contains no elements.

pub fn get_index(&self, index: usize) -> Option<(&K, &V)>

Get a key-value pair by index.

Valid indices are 0 <= index < self.len().

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().

pub fn get_range<R>(&self, range: R) -> Option<&Slice<K, V>>

where R: RangeBounds<usize>,

Returns a slice of key-value pairs in the given range of indices.

Valid indices are 0 <= index < self.len().

pub fn get_range_mut<R>(&mut self, range: R) -> Option<&mut Slice<K, V>>

where R: RangeBounds<usize>,

Returns a mutable slice of key-value pairs in the given range of indices.

Valid indices are 0 <= index < self.len().

pub fn first(&self) -> Option<(&K, &V)>

Get the first key-value pair.

pub fn first_mut(&mut self) -> Option<(&K, &mut V)>

Get the first key-value pair, with mutable access to the value.

pub fn last(&self) -> Option<(&K, &V)>

Get the last key-value pair.

pub fn last_mut(&mut self) -> Option<(&K, &mut V)>

Get the last key-value pair, with mutable access to the value.

pub fn split_at(&self, index: usize) -> (&Slice<K, V>, &Slice<K, V>)

Divides one slice into two at an index.

Panics if index > len.

pub fn split_at_mut( &mut self, index: usize, ) -> (&mut Slice<K, V>, &mut Slice<K, V>)

Divides one mutable slice into two at an index.

Panics if index > len.

pub fn split_first(&self) -> Option<((&K, &V), &Slice<K, V>)>

Returns the first key-value pair and the rest of the slice, or None if it is empty.

pub fn split_first_mut(&mut self) -> Option<((&K, &mut V), &mut Slice<K, V>)>

Returns the first key-value pair and the rest of the slice, with mutable access to the value, or None if it is empty.

pub fn split_last(&self) -> Option<((&K, &V), &Slice<K, V>)>

Returns the last key-value pair and the rest of the slice, or None if it is empty.

pub fn split_last_mut(&mut self) -> Option<((&K, &mut V), &mut Slice<K, V>)>

Returns the last key-value pair and the rest of the slice, with mutable access to the value, or None if it is empty.

pub fn iter(&self) -> Iter<'_, K, V>

Return an iterator over the key-value pairs of the map slice.

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

Return an iterator over the key-value pairs of the map slice.

pub fn keys(&self) -> Keys<'_, K, V>

Return an iterator over the keys of the map slice.

pub fn into_keys(self: Box<Slice<K, V>>) -> IntoKeys<K, V>

Return an owning iterator over the keys of the map slice.

pub fn values(&self) -> Values<'_, K, V>

Return an iterator over the values of the map slice.

pub fn values_mut(&mut self) -> ValuesMut<'_, K, V>

Return an iterator over mutable references to the the values of the map slice.

pub fn into_values(self: Box<Slice<K, V>>) -> IntoValues<K, V>

Return an owning iterator over the values of the map slice.

pub fn binary_search_keys(&self, x: &K) -> Result<usize, usize>

where K: Ord,

Search over a sorted map for a key.

Returns the position where that key is present, or the position where it can be inserted to maintain the sort. See slice::binary_search for more details.

Computes in O(log(n)) time, which is notably less scalable than looking the key up in the map this is a slice from using IndexMap::get_index_of, but this can also position missing keys.

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>

where F: FnMut(&'a K, &'a V) -> Ordering,

Search over a sorted map with a comparator function.

Returns the position where that value is present, or the position where it can be inserted to maintain the sort. See slice::binary_search_by for more details.

Computes in O(log(n)) time.

pub fn binary_search_by_key<'a, B, F>( &'a self, b: &B, f: F, ) -> Result<usize, usize>

where F: FnMut(&'a K, &'a V) -> B, B: Ord,

Search over a sorted map with an extraction function.

Returns the position where that value is present, or the position where it can be inserted to maintain the sort. See slice::binary_search_by_key for more details.

Computes in O(log(n)) time.

pub fn partition_point<P>(&self, pred: P) -> usize

where P: FnMut(&K, &V) -> bool,

Returns the index of the partition point of a sorted map according to the given predicate (the index of the first element of the second partition).

See slice::partition_point for more details.

Computes in O(log(n)) time.

Trait Implementations

impl<K, V> Clone for Box<Slice<K, V>>

where K: Clone, V: Clone,

fn clone(&self) -> Box<Slice<K, V>>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<K, V> Debug for Slice<K, V>

where K: Debug, V: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<K, V> Default for &Slice<K, V>

fn default() -> &Slice<K, V>

Returns the “default value” for a type.

impl<K, V> Default for &mut Slice<K, V>

fn default() -> &mut Slice<K, V>

Returns the “default value” for a type.

impl<K, V> Default for Box<Slice<K, V>>

fn default() -> Box<Slice<K, V>>

Returns the “default value” for a type.

impl<K, V> From<&Slice<K, V>> for Box<Slice<K, V>>

where K: Copy, V: Copy,

fn from(slice: &Slice<K, V>) -> Box<Slice<K, V>>

Converts to this type from the input type.

impl<K, V> Hash for Slice<K, V>

where K: Hash, V: Hash,

fn hash<H>(&self, state: &mut H)

where H: Hasher,

Feeds this value into the given Hasher.

impl<K, V> Index<(Bound<usize>, Bound<usize>)> for Slice<K, V>

type Output = Slice<K, V>

The returned type after indexing.

fn index(&self, range: (Bound<usize>, Bound<usize>)) -> &Slice<K, V>

Performs the indexing (container[index]) operation.

impl<K, V> Index<Range<usize>> for Slice<K, V>

type Output = Slice<K, V>

The returned type after indexing.

fn index(&self, range: Range<usize>) -> &Slice<K, V>

Performs the indexing (container[index]) operation.

impl<K, V> Index<RangeFrom<usize>> for Slice<K, V>

type Output = Slice<K, V>

The returned type after indexing.

fn index(&self, range: RangeFrom<usize>) -> &Slice<K, V>

Performs the indexing (container[index]) operation.

impl<K, V> Index<RangeFull> for Slice<K, V>

type Output = Slice<K, V>

The returned type after indexing.

fn index(&self, range: RangeFull) -> &Slice<K, V>

Performs the indexing (container[index]) operation.

impl<K, V> Index<RangeInclusive<usize>> for Slice<K, V>

type Output = Slice<K, V>

The returned type after indexing.

fn index(&self, range: RangeInclusive<usize>) -> &Slice<K, V>

Performs the indexing (container[index]) operation.

impl<K, V> Index<RangeTo<usize>> for Slice<K, V>

type Output = Slice<K, V>

The returned type after indexing.

fn index(&self, range: RangeTo<usize>) -> &Slice<K, V>

Performs the indexing (container[index]) operation.

impl<K, V> Index<RangeToInclusive<usize>> for Slice<K, V>

type Output = Slice<K, V>

The returned type after indexing.

fn index(&self, range: RangeToInclusive<usize>) -> &Slice<K, V>

Performs the indexing (container[index]) operation.

impl<K, V> Index<usize> for Slice<K, V>

type Output = V

The returned type after indexing.

fn index(&self, index: usize) -> &V

Performs the indexing (container[index]) operation.

impl<K, V> IndexMut<(Bound<usize>, Bound<usize>)> for Slice<K, V>

fn index_mut(&mut self, range: (Bound<usize>, Bound<usize>)) -> &mut Slice<K, V>

Performs the mutable indexing (container[index]) operation.

impl<K, V> IndexMut<Range<usize>> for Slice<K, V>

fn index_mut(&mut self, range: Range<usize>) -> &mut Slice<K, V>

Performs the mutable indexing (container[index]) operation.

impl<K, V> IndexMut<RangeFrom<usize>> for Slice<K, V>

fn index_mut(&mut self, range: RangeFrom<usize>) -> &mut Slice<K, V>

Performs the mutable indexing (container[index]) operation.

impl<K, V> IndexMut<RangeFull> for Slice<K, V>

fn index_mut(&mut self, range: RangeFull) -> &mut Slice<K, V>

Performs the mutable indexing (container[index]) operation.

impl<K, V> IndexMut<RangeInclusive<usize>> for Slice<K, V>

fn index_mut(&mut self, range: RangeInclusive<usize>) -> &mut Slice<K, V>

Performs the mutable indexing (container[index]) operation.

impl<K, V> IndexMut<RangeTo<usize>> for Slice<K, V>

fn index_mut(&mut self, range: RangeTo<usize>) -> &mut Slice<K, V>

Performs the mutable indexing (container[index]) operation.

impl<K, V> IndexMut<RangeToInclusive<usize>> for Slice<K, V>

fn index_mut(&mut self, range: RangeToInclusive<usize>) -> &mut Slice<K, V>

Performs the mutable indexing (container[index]) operation.

impl<K, V> IndexMut<usize> for Slice<K, V>

fn index_mut(&mut self, index: usize) -> &mut V

Performs the mutable indexing (container[index]) operation.

impl<'a, K, V> IntoIterator for &'a Slice<K, V>

type IntoIter = Iter<'a, K, V>

Which kind of iterator are we turning this into?

type Item = (&'a K, &'a V)

The type of the elements being iterated over.

fn into_iter(self) -> <&'a Slice<K, V> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, K, V> IntoIterator for &'a mut Slice<K, V>

type IntoIter = IterMut<'a, K, V>

Which kind of iterator are we turning this into?

type Item = (&'a K, &'a mut V)

The type of the elements being iterated over.

fn into_iter(self) -> <&'a mut Slice<K, V> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<K, V> IntoIterator for Box<Slice<K, V>>

type IntoIter = IntoIter<K, V>

Which kind of iterator are we turning this into?

type Item = (K, V)

The type of the elements being iterated over.

fn into_iter(self) -> <Box<Slice<K, V>> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<K, V> Ord for Slice<K, V>

where K: Ord, V: Ord,

fn cmp(&self, other: &Slice<K, V>) -> Ordering

This method returns an Ordering between self and other.

impl<K, V> PartialEq for Slice<K, V>

where K: PartialEq, V: PartialEq,

fn eq(&self, other: &Slice<K, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<K, V> PartialOrd for Slice<K, V>

where K: PartialOrd, V: PartialOrd,

fn partial_cmp(&self, other: &Slice<K, V>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<K, V> Serialize for Slice<K, V>

where K: Serialize, V: Serialize,

Serializes a map::Slice as an ordered sequence.

This behaves like crate::map::serde_seq for IndexMap, serializing a sequence of (key, value) pairs, rather than as a map that might not preserve order.

fn serialize<T>( &self, serializer: T, ) -> Result<<T as Serializer>::Ok, <T as Serializer>::Error>

where T: Serializer,

Serialize this value into the given Serde serializer.

impl<K, V> Eq for Slice<K, V>

where K: Eq, V: Eq,