Enum RootGateCadence 

pub enum RootGateCadence {
    EveryNBlocks(NonZeroU64),
    Disabled,
}

How often the reactive root gate probes tracked accounts (TrackingPolicy::WholeAccount / TrackingPolicy::Scalars; the Scalars account-fields comparison rides the same firing).

eth_getProof is the slowest read this crate issues, so per-block probing is never the default. Skipping blocks is safe by construction: the gate diffs root_now against its persisted baseline, never block-over-block, so a move in any skipped block is still visible at the next firing — cadence trades detection lag (at most n − 1 blocks) for cost, never eventual detection. The decoder-touched set accumulates across skipped blocks and drains per firing, so a covered write in a skipped block never false-positives as a ReactiveReport::CoverageGap.

Variants

EveryNBlocks(NonZeroU64)

Probe at most once every n canonical blocks (the first canonical block ever seen always fires, so baseline adoption does not wait a full window). EveryNBlocks(1) is per-block probing.

Disabled

Root gate off: coverage gaps surface only via decoders + freshness.

Implementations

impl RootGateCadence

pub fn every_n_blocks(n: u64) -> Self

Probe at most once every n canonical blocks, clamping 0 to 1.

Trait Implementations

impl Clone for RootGateCadence

fn clone(&self) -> RootGateCadence

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for RootGateCadence

impl Debug for RootGateCadence

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

Formats the value using the given formatter.

impl Default for RootGateCadence

fn default() -> Self

Every 16 canonical blocks — ~3.2 min worst-case detection lag on mainnet for a 16× probe-cost cut. Fast-block chains should raise n, not lower it.

impl Eq for RootGateCadence

impl PartialEq for RootGateCadence

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