Struct PropMap 

pub struct PropMap(/* private fields */);

Ordered map of prop key-value pairs.

Uses a Vec for storage since widget props are typically small (5-15 entries). Linear scan is faster than hashing for this size.

Wire serialisation key order

Props are serialised to JSON via into_json_map which collects into a serde_json::Map. The workspace compiles serde_json without the preserve_order feature, so Map is an alphabetical-key BTreeMap equivalent. That keeps direct JSON serialisation stable for protocol-facing code and prop regression tests in this crate. Enabling preserve_order would make JSON serialisation insertion-ordered and change the emitted wire shape.

Implementations

impl PropMap

pub fn new() -> Self

Construct a new value.

pub fn with_capacity(cap: usize) -> Self

Return a new value with the capacity set.

pub fn get(&self, key: &str) -> Option<&PropValue>

Get a prop value by key.

pub fn get_mut(&mut self, key: &str) -> Option<&mut PropValue>

Get a mutable reference to a prop value by key.

pub fn insert(&mut self, key: impl Into<String>, value: impl Into<PropValue>)

Insert or replace a prop value.

pub fn remove(&mut self, key: &str) -> Option<PropValue>

Remove a prop by key, returning the old value if present.

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

Set or construct contains_key.

pub fn is_empty(&self) -> bool

Returns true when the empty condition holds.

pub fn len(&self) -> usize

Set or construct len.

pub fn iter(&self) -> impl Iterator<Item = (&str, &PropValue)>

Iterate over (key, value) pairs.

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

Iterate over keys.

pub fn from_json_map(map: Map<String, Value>) -> Self

Convert from a serde_json Map.

pub fn into_json_map(self) -> Map<String, Value>

Convert to a serde_json Map.

Trait Implementations

impl Clone for PropMap

fn clone(&self) -> PropMap

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PropMap

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

Formats the value using the given formatter.

impl Default for PropMap

fn default() -> PropMap

Returns the “default value” for a type.

impl From<PropMap> for Props

fn from(map: PropMap) -> Self

Converts to this type from the input type.

impl PartialEq for PropMap

fn eq(&self, other: &Self) -> bool

Wire-canonical equality: null-valued entries are equivalent to absent entries. The wire protocol encodes key removal by sending null, so {} and {"a": null} are indistinguishable downstream and must compare equal here. Without this, tree_diff + apply_patch could not round-trip trees whose only difference is a null-valued prop, because there is no protocol op that adds an explicit null-valued key.

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 Eq for PropMap