Struct Inner 

struct Inner {
    own_properties: IndexMap<Name, Option<ComputedValue>, BuildHasherDefault<PrecomputedHasher>>,
    parent: Option<Arc<Inner>>,
    len: usize,
    ancestor_count: u8,
}

Fields

own_properties: IndexMap<Name, Option<ComputedValue>, BuildHasherDefault<PrecomputedHasher>>

parent: Option<Arc<Inner>>

len: usize

The number of custom properties we store. Note that this is different from the sum of our own and our parent’s length, since we might store duplicate entries.

ancestor_count: u8

The number of ancestors we have.

Implementations

impl Inner

fn iter(&self) -> Iter<'_>

fn is_empty(&self) -> bool

fn len(&self) -> usize

fn get(&self, name: &Name) -> Option<&ComputedRegisteredValue>

fn insert(&mut self, name: &Name, value: Option<ComputedRegisteredValue>)

fn should_expand_chain(&self) -> bool

Whether we should expand the chain, or just copy-on-write.

Trait Implementations

impl Clone for Inner

fn clone(&self) -> Inner

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Inner

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

Formats the value using the given formatter.

impl PartialEq for Inner

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.