Struct MemoryApplier 

pub struct MemoryApplier { /* private fields */ }

Implementations

impl MemoryApplier

pub fn new() -> Self

pub fn slots(&mut self) -> &mut SlotTable

pub fn take_structural_change_parents_attached_to( &mut self, root: NodeId, ) -> Vec<NodeId>

Drains the parents recorded via Applier::record_structural_change, keeping only nodes still attached to root (a parent that was itself removed is covered by its own surviving ancestor’s record). A virtual parent — a subcompose slot wrapper the render graph never contains — is reported as its nearest non-virtual ancestor: that is the node whose graph child set the change altered, and an id the graph cannot resolve would force the scoped scene update to give up and rebuild.

pub fn with_node<N: Node + 'static, R>( &mut self, id: NodeId, f: impl FnOnce(&mut N) -> R, ) -> Result<R, NodeError>

pub fn len(&self) -> usize

pub fn capacity(&self) -> usize

pub fn tombstone_count(&self) -> usize

pub fn freelist_len(&self) -> usize

pub fn debug_recycled_node_count(&self) -> usize

pub fn debug_recycled_node_count_for<N: Node + 'static>(&self) -> usize

pub fn debug_stats(&self) -> MemoryApplierDebugStats

pub fn is_empty(&self) -> bool

pub fn debug_live_node_heap_bytes(&self) -> usize

pub fn debug_recycled_node_heap_bytes(&self) -> usize

pub fn set_runtime_handle(&mut self, handle: RuntimeHandle)

pub fn clear_runtime_handle(&mut self)

pub fn runtime_handle(&self) -> Option<RuntimeHandle>

pub fn dump_tree(&self, root: Option<NodeId>) -> String

Trait Implementations

impl Applier for MemoryApplier

fn record_structural_change(&mut self, parent_id: NodeId)

Records that parent_id’s child list changed structurally this frame (insert, remove, move, or reparent). Incremental scene consumers drain the recorded parents and re-patch those subtrees so removed nodes are evicted from a persistent render graph even when the frame’s scene update is otherwise scoped to unrelated dirty nodes.

fn create(&mut self, node: Box<dyn Node>) -> NodeId

fn node_generation(&self, id: NodeId) -> u32

Returns the current generation for a node index. Generation is incremented when an index is reused from the freelist, preventing stale slot entries from matching recycled nodes.

fn get_mut(&mut self, id: NodeId) -> Result<&mut dyn Node, NodeError>

fn remove(&mut self, id: NodeId) -> Result<(), NodeError>

fn insert_with_id( &mut self, id: NodeId, node: Box<dyn Node>, ) -> Result<(), NodeError>

Inserts a node with a pre-assigned ID.

fn insert_recycled_node_or_create( &mut self, stable_id: NodeId, node: Box<dyn Node>, ) -> RecycledNodeInsertion

Reinserts a recycled node at its retained stable ID, or creates a fresh ID if that retained ID is no longer available.

fn compact(&mut self)

Trim trailing tombstones/unused capacity after structural changes.

fn take_recycled_node(&mut self, key: TypeId) -> Option<RecycledNode>

Returns a previously recycled node shell and its stable ID for the requested concrete type.

fn set_recycled_node_origin(&mut self, id: NodeId, warm_origin: bool)

Marks whether a reinserted recycled node originated from the warm recycle path.

fn seed_recycled_node_shell( &mut self, key: TypeId, recycle_pool_limit: Option<usize>, shell: Box<dyn Node>, )

Seeds a warm recyclable shell for future reuse without requiring a prior removal.

fn record_fresh_recyclable_creation(&mut self, key: TypeId)

Records that the current apply pass had to allocate a fresh recyclable shell for this type.

fn clear_recycled_nodes(&mut self)

Drops any recyclable shells that should not survive beyond the current apply pass.

fn as_any(&self) -> &dyn Any

where Self: Sized,

fn as_any_mut(&mut self) -> &mut dyn Any

where Self: Sized,

impl Default for MemoryApplier

fn default() -> MemoryApplier

Returns the “default value” for a type.