Enum PropertyMap 

pub enum PropertyMap {
    Standard(SmallVec<[(DbString, Value); 6]>),
    Compact {
        keys: Arc<[DbString]>,
        values: SmallVec<[Option<Value>; 6]>,
    },
}

Property storage for open and closed graph values.

Variants

Standard(SmallVec<[(DbString, Value); 6]>)

Open graph representation: sorted key/value pairs.

Compact

Closed graph representation: fixed sorted keys with positional values.

Fields

keys: Arc<[DbString]>

Sorted key set defined by a schema type.

values: SmallVec<[Option<Value>; 6]>

Positional values aligned with keys; None means absent.

Implementations

impl PropertyMap

pub fn new() -> Self

Construct an empty standard property map.

pub fn from_pairs( pairs: impl IntoIterator<Item = (DbString, Value)>, ) -> CoreResult<Self>

Construct a standard property map from pairs, sorting by DbString order.

Later duplicate keys overwrite earlier keys.

Errors

Returns CoreError::ConstructedValueTooLarge if the final distinct key count exceeds the implementation-defined cardinality cap.

pub fn compact( keys: impl IntoIterator<Item = DbString>, values: impl IntoIterator<Item = Option<Value>>, ) -> CoreResult<Self>

Construct a compact property map from a fixed schema key set.

Keys are sorted with their corresponding value slots. Duplicate keys keep the last value.

Errors

Returns CoreError::ConstructedValueTooLarge if key count exceeds the implementation-defined cardinality cap.

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

Return the value for key, if present.

pub fn set(&mut self, key: DbString, value: Value) -> CoreResult<()>

Set key to value.

Unknown-key writes against a compact map widen it to standard form and drop absent compact slots because standard maps only store present key/value pairs.

Errors

Returns CoreError::ConstructedValueTooLarge if inserting a distinct key would exceed the implementation-defined cardinality cap.

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

Remove a present property.

pub fn len(&self) -> usize

Number of present properties.

pub fn is_empty(&self) -> bool

Return true if no properties are present.

pub fn iter(&self) -> PropertyMapIter<'_>

Iterate present key/value pairs in sorted-key order.

Returns a concrete PropertyMapIter (not a boxed trait object): this is exercised per-label per-node on the commit path and per-write during validation, so the allocation a Box<dyn Iterator> would cost on every call is removed here.

pub fn keys(&self) -> PropertyMapKeys<'_>

Iterate present property keys in sorted-key order.

pub fn values(&self) -> PropertyMapValues<'_>

Iterate present property values in sorted-key order.

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

Return true if key has a present value.

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<'de> Deserialize<'de> for PropertyMap

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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 Serialize for PropertyMap

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for PropertyMap