hypen-engine 0.4.946

A Rust implementation of the Hypen engine
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

use crate::ir::NodeId;
use indexmap::IndexSet;

/// Tracks which nodes need to be re-rendered
pub struct Scheduler {
    /// Set of dirty nodes that need recomputation
    dirty_nodes: IndexSet<NodeId>,
}

impl Scheduler {
    pub fn new() -> Self {
        Self {
            dirty_nodes: IndexSet::new(),
        }
    }

    /// Mark a node as dirty (needs re-render)
    pub fn mark_dirty(&mut self, node_id: NodeId) {
        self.dirty_nodes.insert(node_id);
    }

    /// Mark multiple nodes as dirty
    pub fn mark_many_dirty(&mut self, node_ids: impl IntoIterator<Item = NodeId>) {
        self.dirty_nodes.extend(node_ids);
    }

    /// Get all dirty nodes and clear the dirty set
    pub fn take_dirty(&mut self) -> IndexSet<NodeId> {
        std::mem::take(&mut self.dirty_nodes)
    }

    /// Check if there are any dirty nodes
    pub fn has_dirty(&self) -> bool {
        !self.dirty_nodes.is_empty()
    }

    /// Clear all dirty nodes without returning them
    pub fn clear(&mut self) {
        self.dirty_nodes.clear();
    }
}

impl Default for Scheduler {
    fn default() -> Self {
        Self::new()
    }
}