reactive_graph 0.2.4

A fine-grained reactive graph for building user interfaces.
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

/// A node in the reactive graph.
pub trait ReactiveNode {
    /// Notifies the source's dependencies that it has changed.
    fn mark_dirty(&self);

    /// Notifies the source's dependencies that it may have changed.
    fn mark_check(&self);

    /// Marks that all subscribers need to be checked.
    fn mark_subscribers_check(&self);

    /// Regenerates the value for this node, if needed, and returns whether
    /// it has actually changed or not.
    fn update_if_necessary(&self) -> bool;
}

/// The current state of a reactive node.
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
pub enum ReactiveNodeState {
    /// The node is known to be clean: i.e., either none of its sources have changed, or its
    /// sources have changed but its value is unchanged and its dependencies do not need to change.
    Clean,
    /// The node may have changed, but it is not yet known whether it has actually changed.
    Check,
    /// The node's value has definitely changed, and subscribers will need to update.
    Dirty,
}