Struct OrderedAssociated 

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

An ordered, deduplicated slice of items each paired with some associated value.

Like Ordered, the contained Vec<(K, V)> is sealed after construction and cannot be modified. To unseal the inner Vec<(K, V)>, use the Into<Vec<(K, V)>> impl.

Consumers that only need the ordered keys can treat an OrderedAssociated as an Ordered through deref coercions.

Implementations

impl<K, V> OrderedAssociated<K, V>

pub fn len(&self) -> usize

Returns the number of entries in the map.

pub fn is_empty(&self) -> bool

Returns true if the map is empty.

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

Returns a key by index, if it exists.

pub fn position(&self, key: &K) -> Option<usize>

where K: Ord,

Returns the position of the provided key, if it exists.

pub fn keys(&self) -> &Ordered<K>

Returns the ordered keys as an Ordered reference.

pub fn into_keys(self) -> Ordered<K>

Consumes the map and returns the ordered keys.

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

Returns the associated value at index, if it exists.

pub fn get_value(&self, key: &K) -> Option<&V>

where K: Ord,

Returns the associated value for key, if it exists.

pub fn values(&self) -> &[V]

Returns the associated values.

pub fn iter_pairs(&self) -> impl Iterator<Item = (&K, &V)>

Returns a zipped iterator over keys and values.

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

Returns an iterator over the ordered keys.

Methods from Deref<Target = Ordered<K>>

pub fn len(&self) -> usize

Returns the size of the ordered collection.

pub fn is_empty(&self) -> bool

Returns true if the collection is empty.

pub fn get(&self, index: usize) -> Option<&T>

Returns an item by index, if it exists.

pub fn position(&self, item: &T) -> Option<usize>

where T: Ord,

Returns the position of a given item in the collection, if it exists.

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

Returns an iterator over the items in the collection.

Trait Implementations

impl<K, V> AsRef<[K]> for OrderedAssociated<K, V>

fn as_ref(&self) -> &[K]

Converts this type into a shared reference of the (usually inferred) input type.

impl<K, V> AsRef<Ordered<K>> for OrderedAssociated<K, V>

fn as_ref(&self) -> &Ordered<K>

Converts this type into a shared reference of the (usually inferred) input type.

impl<K: Clone, V: Clone> Clone for OrderedAssociated<K, V>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for OrderedAssociated<K, V>

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

Formats the value using the given formatter.

impl<K, V> Deref for OrderedAssociated<K, V>

type Target = Ordered<K>

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<K: EncodeSize, V: EncodeSize> EncodeSize for OrderedAssociated<K, V>

fn encode_size(&self) -> usize

Returns the encoded size of this value (in bytes).

impl<K: Ord + Clone, V: Clone> From<&[(K, V)]> for OrderedAssociated<K, V>

fn from(items: &[(K, V)]) -> Self

Converts to this type from the input type.

impl<K: Ord + Clone, V: Clone, const N: usize> From<&[(K, V); N]> for OrderedAssociated<K, V>

fn from(items: &[(K, V); N]) -> Self

Converts to this type from the input type.

impl<K: Ord, V, const N: usize> From<[(K, V); N]> for OrderedAssociated<K, V>

fn from(items: [(K, V); N]) -> Self

Converts to this type from the input type.

impl<K: Ord, V> From<OrderedAssociated<K, V>> for Vec<(K, V)>

fn from(wrapped: OrderedAssociated<K, V>) -> Self

Converts to this type from the input type.

impl<K: Ord, V> From<Vec<(K, V)>> for OrderedAssociated<K, V>

fn from(items: Vec<(K, V)>) -> Self

Converts to this type from the input type.

impl<K: Ord, V> FromIterator<(K, V)> for OrderedAssociated<K, V>

fn from_iter<I: IntoIterator<Item = (K, V)>>(iter: I) -> Self

Creates a value from an iterator.

impl<K: Hash, V: Hash> Hash for OrderedAssociated<K, V>

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

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

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

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

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K, V> IntoIterator for OrderedAssociated<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = OrderedAssociatedIntoIter<K, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<K: PartialEq, V: PartialEq> PartialEq for OrderedAssociated<K, V>

fn eq(&self, other: &OrderedAssociated<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: Read, V: Read> Read for OrderedAssociated<K, V>

type Cfg = (RangeCfg<usize>, <K as Read>::Cfg, <V as Read>::Cfg)

The Cfg type parameter allows passing configuration during the read process. This is crucial for safely decoding untrusted data, for example, by providing size limits for collections or strings.

fn read_cfg(buf: &mut impl Buf, cfg: &Self::Cfg) -> Result<Self, Error>

Reads a value from the buffer using the provided configuration cfg.

impl<K: Write, V: Write> Write for OrderedAssociated<K, V>

fn write(&self, buf: &mut impl BufMut)

Writes the binary representation of self to the provided buffer buf.

impl<K: Eq, V: Eq> Eq for OrderedAssociated<K, V>

impl<K, V> StructuralPartialEq for OrderedAssociated<K, V>