Enum ReevaluationRule 

#[repr(u8)]
pub enum ReevaluationRule {
    Move = 0,
    CacheLast = 1,
    CacheAll = 2,
}

Variants

Move = 0

Always move outputs, reevaluate every time. If the receiving node takes a reference, it will be pased in, then dropped after that node evaluates.

CacheLast = 1

If all inputs are previous inputs, don’t evaluate and just return a clone of the cached output.

CacheAll = 2

If all inputs are equal to ANY previous input combination, don’t evaluate and just return a clone of the cached output associated with that exact set of inputs.

Trait Implementations

impl Clone for ReevaluationRule

fn clone(&self) -> ReevaluationRule

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReevaluationRule

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

Formats the value using the given formatter.

impl Hash for ReevaluationRule

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for ReevaluationRule

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

impl Eq for ReevaluationRule

impl StructuralPartialEq for ReevaluationRule