Struct Records 

pub struct Records {
    pub claims: HashMap<(String, u32), u32>,
    pub pegouts: BTreeMap<(String, u32), Burn>,
}

What the sidestr overlay remembers across blocks (siding/lib/overlay.mjs): outpoints claimed so far by the height that claimed them, and burns seen. Validation is idempotent for one height (a block re-validated, or a competing block at the same height, may claim the same outpoint); a different height may not. Level 1: no reorgs, so nothing is unwound.

Fields

claims: HashMap<(String, u32), u32>

Parent outpoint (txid:vout, txid display order) → height that claimed it.

pegouts: BTreeMap<(String, u32), Burn>

Sidechain outpoint → the burn.

Implementations

impl Records

pub fn claimed(&self, txid: &str, vout: u32) -> bool

Whether the parent outpoint has been claimed on this chain.

pub fn pegouts(&self) -> Vec<Burn>

Every burn the chain has validated, oldest first (SPEC 7).

Trait Implementations

impl Clone for Records

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Records

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

Formats the value using the given formatter.

impl Default for Records

fn default() -> Self

Returns the “default value” for a type.

impl Eq for Records

impl PartialEq for Records

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Records