Struct NeoMap 

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

Neo N3 Map type

Implementations

impl<K, V> NeoMap<K, V>

pub fn new() -> NeoMap<K, V>

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

where K: PartialEq,

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

where K: PartialEq,

Gets a reference to the value associated with the given key.

Performance

This operation is O(n) as it performs a linear search. Consider using a HashMap for O(1) lookups if performance is critical.

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

where K: PartialEq,

Gets a mutable reference to the value associated with the given key.

Performance

This operation is O(n) as it performs a linear search.

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

where K: PartialEq,

Removes the key-value pair associated with the given key.

Performance

This operation is O(n) due to the element removal.

Order stability

Uses Vec::remove (shift) so iteration order of remaining entries is preserved (D7: swap_remove reordered entries, diverging from on-chain NeoVM Map semantics and breaking deterministic serialization). Note that on-chain NeoVM Map is sorted by key; this NeoMap is a linear map (insertion-stable), not the on-chain sorted map.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn contains_key(&self, key: &K) -> bool

where K: PartialEq,

Returns true if the map contains the given key.

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

Returns an iterator over the keys of the map.

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

Returns an iterator over the values of the map.

pub fn remove_strict( &mut self, key: &K, expected_value: &V, ) -> Result<(), RemoveStrictError>

where K: PartialEq, V: PartialEq,

Strict removal: only removes if both key AND expected_value match. Returns Ok(()) on success and Err(Mismatch) on value mismatch or missing key. Mirrors the C# NeoVM MAPREMOVE semantics (which FAULTs if value doesn’t match), letting contracts handle the bound explicitly.

Mismatch::Found distinguishes “missing key” (the standard remove would have returned None) from “wrong value” (a potential optimistic-concurrency conflict).

Trait Implementations

impl<K, V> Clone for NeoMap<K, V>

where K: Clone, V: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K, V> Debug for NeoMap<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 NeoMap<K, V>

fn default() -> NeoMap<K, V>

Returns the “default value” for a type.

impl<'de, K, V> Deserialize<'de> for NeoMap<K, V>

where K: Deserialize<'de> + Eq, V: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<NeoMap<K, V>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

where K: Eq, V: Eq,

impl From<NeoMap<NeoValue, NeoValue>> for NeoValue

fn from(value: NeoMap<NeoValue, NeoValue>) -> NeoValue

Converts to this type from the input type.

impl<K, V> IntoIterator for NeoMap<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) -> <NeoMap<K, V> as IntoIterator>::IntoIter

Creates an iterator from a value.

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

type Item = &'a (K, V)

The type of the elements being iterated over.

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

Which kind of iterator are we turning this into?

fn into_iter(self) -> Iter<'a, (K, V)>

Creates an iterator from a value.

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

where K: PartialEq, V: PartialEq,

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

where K: Serialize + Eq, V: Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

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

where K: PartialEq, V: PartialEq,