Struct VecKeylist

pub struct VecKeylist<K, V>(pub Vec<(K, V)>);

Tuple Fields

0: Vec<(K, V)>

Implementations

impl<K, V> VecKeylist<K, V>

pub fn new() -> Self

pub fn into_swapped(self) -> VecKeylist<V, K>

pub fn insert(&mut self, index: usize, k: K, v: V)

pub fn push(&mut self, k: K, v: V)

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

pub fn remove(&mut self, index: usize) -> (K, V)

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

pub fn iter_mut<'a>(&'a mut self) -> impl Iterator<Item = &'a mut (K, V)>

pub fn keys<'a>(&'a self) -> impl Iterator<Item = &'a K>

pub fn keys_mut<'a>(&'a mut self) -> impl Iterator<Item = &'a mut K>

pub fn values<'a>(&'a self) -> impl Iterator<Item = &'a V>

pub fn values_mut<'a>(&'a mut self) -> impl Iterator<Item = &'a mut V>

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

impl<K: PartialEq, V> VecKeylist<K, V>

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

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

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

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

pub fn get_all_get_key_value(&self, key: &K) -> Vec<&(K, V)>

pub fn get_all(&self, key: &K) -> Vec<&V>

get all values matching the key

impl<K: Ord, V> VecKeylist<K, V>

pub fn sort_by_key<'a>(&'a mut self)

impl<K, V: Ord> VecKeylist<K, V>

pub fn sort_by_value<'a>(&'a mut self)

impl<K: PartialEq, V: PartialEq> VecKeylist<K, V>

pub fn contains(&self, item: &(K, V)) -> bool

impl<K: Ord, V: Ord> VecKeylist<K, V>

pub fn sort(&mut self)

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

The normal get function uses a find on a iterator to find the key value. This function uses binary search to find the key value

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

The normal get function uses a find on a iterator to find the value. This function uses binary search to find the value

Trait Implementations

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

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

impl<'a, K: Copy, V: Copy> Extend<(&'a K, &'a V)> for VecKeylist<K, V>

fn extend<T: IntoIterator<Item = (&'a K, &'a V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K, V> Extend<(K, V)> for VecKeylist<K, V>

fn extend<T: IntoIterator<Item = (K, V)>>(&mut self, iter: T)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<K, V> From<Vec<(K, V)>> for VecKeylist<K, V>

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

Converts to this type from the input type.

impl<K, V> FromIterator<(K, V)> for VecKeylist<K, V>

fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> VecKeylist<K, V>

Creates a value from an iterator.

impl<K: Hash, V: Hash> Hash for VecKeylist<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<K, V> IntoIterator for VecKeylist<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = IntoIter<(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 VecKeylist<K, V>

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