Struct PropertyMap 

pub struct PropertyMap { /* private fields */ }

A compact, ordered property map.

Behaves like a BTreeMap<PropertyKey, Value> but stores small maps inline (up to 4 entries) and uses linear scan for lookups. For the sizes typical in graph workloads this is both faster and more memory-efficient than a tree.

Implementations

impl PropertyMap

pub fn new() -> Self

Creates an empty property map.

pub fn with_capacity(cap: usize) -> Self

Creates a property map with pre-allocated capacity.

pub fn len(&self) -> usize

Returns the number of properties.

pub fn is_empty(&self) -> bool

Returns true if the map contains no properties.

pub fn get(&self, key: &PropertyKey) -> Option<&Value>

Looks up a property by key.

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

Returns true if the map contains the given key.

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

Inserts a property, replacing any existing value for the same key.

Returns the previous value if the key was already present.

pub fn remove(&mut self, key: &PropertyKey) -> Option<Value>

Removes a property by key, returning its value if present.

pub fn iter(&self) -> impl Iterator<Item = (&PropertyKey, &Value)>

Iterates over (key, value) pairs.

pub fn to_btree_map(&self) -> BTreeMap<PropertyKey, Value>

Converts to a BTreeMap (e.g. for serialization into Value::Map).

Trait Implementations

impl Clone for PropertyMap

fn clone(&self) -> PropertyMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PropertyMap

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

Formats the value using the given formatter.

impl Default for PropertyMap

fn default() -> Self

Returns the “default value” for a type.

impl FromIterator<(PropertyKey, Value)> for PropertyMap

fn from_iter<I: IntoIterator<Item = (PropertyKey, Value)>>(iter: I) -> Self

Creates a value from an iterator.

impl<'a> IntoIterator for &'a PropertyMap

type Item = (&'a PropertyKey, &'a Value)

The type of the elements being iterated over.

type IntoIter = Map<Iter<'a, (PropertyKey, Value)>, fn(&'a (PropertyKey, Value)) -> (&'a PropertyKey, &'a Value)>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl IntoIterator for PropertyMap

type Item = (PropertyKey, Value)

The type of the elements being iterated over.

type IntoIter = IntoIter<[(PropertyKey, Value); 4]>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq for PropertyMap

fn eq(&self, other: &PropertyMap) -> 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 StructuralPartialEq for PropertyMap