Struct Map 

pub struct Map<K, V>(pub IndexMap<K, V>);

Tuple Fields

0: IndexMap<K, V>

Implementations

impl<K, V> Map<K, V>

pub fn len(&self) -> usize

Returns the number of elements in the collection.

pub fn is_empty(&self) -> bool

Returns true if the collection contains no elements.

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

Iterates over the collection.

pub fn new() -> Self

Creates a new, empty collection.

impl<K: Hash + Eq, V> Map<K, V>

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

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

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

O(1) removal, may reorder remaining keys. Use when order doesn’t matter (e.g., batch processing).

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

O(n) removal, preserves document order. Use when order must be maintained.

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

impl Map<ObjectKey, NodeId>

pub fn add( &mut self, key: ObjectKey, value: NodeId, ) -> Result<(), InsertErrorKind>

pub fn get_node_id(&self, key: &ObjectKey) -> Option<NodeId>

Trait Implementations

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

fn clone(&self) -> Map<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 Map<K, V>

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

Formats the value using the given formatter.

impl<K, V> Default for Map<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Eq + Hash, V> FromIterator<(K, V)> for Map<K, V>

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

Creates a value from an iterator.

impl<K, V> IntoDocument for Map<K, V>

where K: Into<ObjectKey>, V: IntoDocument,

fn write_to(self, c: &mut DocumentConstructor) -> Result<(), WriteError>

Write this value to the current node in the document constructor.

impl<'plural, K, V> IntoIterator for &'plural Map<K, V>

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

The type of the elements being iterated over.

type IntoIter = <&'plural IndexMap<K, V> as IntoIterator>::IntoIter

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 Map<K, V>

type Item = (K, V)

The type of the elements being iterated over.

type IntoIter = <IndexMap<K, V> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'doc, K, T> ParseDocument<'doc> for Map<K, T>

where K: ParseObjectKey<'doc>, T: ParseDocument<'doc>, T::Error: From<ParseError>,

type Error = <T as ParseDocument<'doc>>::Error

The error type returned by parsing.

fn parse(ctx: &ParseContext<'doc>) -> Result<Self, Self::Error>

Parse a value of this type from the given parse context.

impl<K: Eq + Hash, V: PartialEq> PartialEq for Map<K, V>

fn eq(&self, other: &Self) -> 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: Eq + Hash, V: Eq> Eq for Map<K, V>