Struct NodeToDecoratorIds 

pub struct NodeToDecoratorIds {
    pub before_enter_decorators: Vec<DecoratorId>,
    pub after_exit_decorators: Vec<DecoratorId>,
    pub node_indptr_for_before: IndexVec<MastNodeId, usize>,
    pub node_indptr_for_after: IndexVec<MastNodeId, usize>,
}

A CSR (Compressed Sparse Row) representation for storing node-level decorators (before_enter and after_exit).

This structure provides efficient storage for before_enter and after_exit decorators across all nodes in a MastForest, using a similar CSR pattern to OpToDecoratorIds but for node-level decorators.

The data layout follows CSR format:

• before_enter_decorators: Flat storage of all before_enter DecoratorId values
• after_exit_decorators: Flat storage of all after_exit DecoratorId values
• node_indptr_for_before: Pointer indices for nodes within before_enter_decorators
• node_indptr_for_after: Pointer indices for nodes within after_exit_decorators

For node i, its before_enter decorators are at:

before_enter_decorators[node_indptr_for_before[i]..node_indptr_for_before[i+1]]

And its after_exit decorators are at:

after_exit_decorators[node_indptr_for_after[i]..node_indptr_for_after[i+1]]

Fields

before_enter_decorators: Vec<DecoratorId>

All before_enter decorators, concatenated across all nodes.

after_exit_decorators: Vec<DecoratorId>

All after_exit decorators, concatenated across all nodes.

node_indptr_for_before: IndexVec<MastNodeId, usize>

Index pointers for before_enter decorators: the range for node i is

node_indptr_for_before[i]..node_indptr_for_before[i+1]

node_indptr_for_after: IndexVec<MastNodeId, usize>

Index pointers for after_exit decorators: the range for node i is

node_indptr_for_after[i]..node_indptr_for_after[i+1]

Implementations

impl NodeToDecoratorIds

pub fn new() -> NodeToDecoratorIds

Creates a new empty NodeToDecoratorIds.

pub fn with_capacity( nodes_capacity: usize, before_decorators_capacity: usize, after_decorators_capacity: usize, ) -> NodeToDecoratorIds

Creates a new empty NodeToDecoratorIds with specified capacity.

pub fn add_node_decorators( &mut self, node_id: MastNodeId, before: &[DecoratorId], after: &[DecoratorId], )

Adds decorators for a node to the centralized storage using CSR pattern.

Arguments

• node_id - The ID of the node to add decorators for
• before - Slice of before_enter decorators for this node
• after - Slice of after_exit decorators for this node

pub fn get_before_decorators(&self, node_id: MastNodeId) -> &[DecoratorId]

Gets the before_enter decorators for a given node.

pub fn get_after_decorators(&self, node_id: MastNodeId) -> &[DecoratorId]

Gets the after_exit decorators for a given node.

pub fn finalize(&mut self)

Finalizes the storage by ensuring sentinel pointers are properly set. This should be called after all nodes have been added.

pub fn clear(&mut self)

Clears all decorators and mappings.

pub fn len(&self) -> usize

Returns the number of nodes in this storage.

pub fn is_empty(&self) -> bool

Returns true if this storage is empty.

Trait Implementations

impl Clone for NodeToDecoratorIds

fn clone(&self) -> NodeToDecoratorIds

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeToDecoratorIds

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

Formats the value using the given formatter.

impl Default for NodeToDecoratorIds

fn default() -> NodeToDecoratorIds

Returns the “default value” for a type.

impl PartialEq for NodeToDecoratorIds

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

impl StructuralPartialEq for NodeToDecoratorIds