Struct VecMap

pub struct VecMap<K: Inner + PartialEq, V: Inner + PartialEq> { /* private fields */ }

Implementations

impl<K: Inner + PartialEq, V: Inner + PartialEq> VecMap<K, V>

pub fn new() -> Self

pub fn intoinner(self) -> ShortVec<KeyValue<K, V>>

pub fn insert(&mut self, key: K, value: V)

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

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

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

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

pub fn remove(&mut self, key: &K)

Trait Implementations

impl<K: Inner + PartialEq, V: Inner + PartialEq> BorshDeserialize for VecMap<K, V>

where ShortVec<KeyValue<K, V>>: BorshDeserialize,

fn deserialize_reader<R: Read>(reader: &mut R) -> Result<Self, Error>

fn deserialize(buf: &mut &[u8]) -> Result<Self, Error>

Deserializes this instance from a given slice of bytes. Updates the buffer to point at the remaining bytes.

fn try_from_slice(v: &[u8]) -> Result<Self, Error>

Deserialize this instance from a slice of bytes.

fn try_from_reader<R>(reader: &mut R) -> Result<Self, Error>

where R: Read,

impl<K: Inner + PartialEq, V: Inner + PartialEq> BorshSerialize for VecMap<K, V>

where ShortVec<KeyValue<K, V>>: BorshSerialize,

fn serialize<W: Write>(&self, writer: &mut W) -> Result<(), Error>

fn try_to_vec(&self) -> Result<Vec<u8>, Error>

Serialize this instance into a vector of bytes.

impl<K: Clone + Inner + PartialEq, V: Clone + Inner + PartialEq> Clone for VecMap<K, V>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Inner + PartialEq, V: Inner + PartialEq> From<&HashMap<K, V>> for VecMap<K, V>

fn from(map: &HashMap<K, V>) -> Self

Converts to this type from the input type.

impl<K: Inner + PartialEq, V: Inner + PartialEq> From<HashMap<K, V>> for VecMap<K, V>

fn from(map: HashMap<K, V>) -> Self

Converts to this type from the input type.

impl<K: Inner + PartialEq, V: Inner + PartialEq> From<Vec<KeyValue<K, V>>> for VecMap<K, V>

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

Converts to this type from the input type.

impl<K: Inner + PartialEq, V: Inner + PartialEq> From<VecMap<K, V>> for LongVecMap<K, V>

fn from(map: VecMap<K, V>) -> Self

Converts to this type from the input type.

impl<K: Inner + PartialEq, V: Inner + PartialEq> FromIterator<(K, V)> for VecMap<K, V>

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

Creates a value from an iterator.

impl<K: Inner + PartialEq, V: Inner + PartialEq> Into<VecMap<K, V>> for LongVecMap<K, V>

fn into(self) -> VecMap<K, V>

Converts this type into the (usually inferred) input type.

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

where K: Inner + PartialEq, V: Inner + PartialEq,

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = VecMapIter<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 + Inner + PartialEq, V: PartialEq + Inner + PartialEq> PartialEq for VecMap<K, V>

fn eq(&self, other: &VecMap<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: Inner + PartialEq + ToNode, V: Inner + PartialEq + ToNode> ToNode for VecMap<K, V>

fn to_node(&self) -> [u8; 32]

impl<K: Inner + PartialEq + ToSchema, V: Inner + PartialEq + ToSchema> ToSchema for VecMap<K, V>

fn schema() -> Schema

fn schema_value(&self) -> SchemaValue

impl<K: Inner + PartialEq, V: Inner + PartialEq> StructuralPartialEq for VecMap<K, V>