Struct NodeToDecoratorIds 

pub struct NodeToDecoratorIds { /* private fields */ }

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. For node i:

• Before-enter decorators are stored in before_enter.row(i)
• After-exit decorators are stored in after_exit.row(i)

Implementations

impl NodeToDecoratorIds

pub fn new() -> NodeToDecoratorIds

Creates a new empty NodeToDecoratorIds.

pub fn from_matrices( before_enter: CsrMatrix<MastNodeId, DecoratorId>, after_exit: CsrMatrix<MastNodeId, DecoratorId>, ) -> NodeToDecoratorIds

Create a NodeToDecoratorIds from raw CSR matrices.

Used during deserialization. Validation happens separately via validate_csr().

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.

Note: With CsrMatrix, this is a no-op since the CSR is always in a valid state.

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

fn deserialize<__D>( __deserializer: __D, ) -> Result<NodeToDecoratorIds, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

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

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for NodeToDecoratorIds

impl StructuralPartialEq for NodeToDecoratorIds