Enum NodeKind 

pub enum NodeKind {
    Signal,
    Effect,
    Computed,
}

Kind discriminator for ReactiveNode. Carried separately from NodeData so dependency-graph walks can branch on kind without matching the data variant (the variants carry mutable state that we generally don’t want to touch during graph walks).

Variants

Signal

Mutable reactive value. Subscribers re-run when it changes.

Effect

Side-effecting reactive computation. Has no return value observable to other nodes; runs once on registration and again whenever a tracked source changes.

Computed

Derived value. Like an effect, but caches its return so downstream readers can observe it through the same dependency mechanism as a signal.

Trait Implementations

impl Clone for NodeKind

fn clone(&self) -> NodeKind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for NodeKind

impl Debug for NodeKind

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

Formats the value using the given formatter.

impl Eq for NodeKind

impl PartialEq for NodeKind

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