Struct NodeRareData

pub(crate) struct NodeRareData {
    pub(crate) containing_shadow_root: Option<Dom<ShadowRoot>>,
    pub(crate) mutation_observers: Vec<RegisteredObserver>,
    pub(crate) unique_id: Option<UniqueId>,
    pub(crate) slottable_data: SlottableData,
    pub(crate) ranges: WeakRangeVec,
    pub(crate) child_list: MutNullableDom<NodeList>,
}

Fields

containing_shadow_root: Option<Dom<ShadowRoot>>

The shadow root the node belongs to. This is None if the node is not in a shadow tree or if it is a ShadowRoot.

mutation_observers: Vec<RegisteredObserver>

Registered observers for this node.

unique_id: Option<UniqueId>

Lazily-generated Unique Id for this node.

slottable_data: SlottableData

ranges: WeakRangeVec

A vector of weak references to Range instances of which the start or end containers are this node. No range should ever be found twice in this vector, even if both the start and end containers are this node.

child_list: MutNullableDom<NodeList>

The live list of children return by .childNodes.

Trait Implementations

impl Default for NodeRareData

fn default() -> NodeRareData

Returns the “default value” for a type.

impl MallocSizeOf for NodeRareData

fn size_of(&self, ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself.

impl Traceable for NodeRareData

unsafe fn trace(&self, tracer: *mut JSTracer)

Trace self.