Struct SearchForest 

pub struct SearchForest {
    pub forest_id: String,
    pub task_id: String,
    pub node_id: String,
    pub generation: u32,
    pub accepted_root: String,
    pub branches: Vec<SearchBranch>,
    pub limits: SearchLimits,
    pub usage: SearchUsage,
}

The forest rooted at one accepted state (Definition 2).

Fields

forest_id: String

task_id: String

node_id: String

generation: u32

accepted_root: String

State root of the immutable accepted root x_k.

branches: Vec<SearchBranch>

limits: SearchLimits

usage: SearchUsage

Implementations

impl SearchForest

pub fn validate(&self) -> Result<()>

Validate the structural invariants: every branch’s accepted ancestor is the forest root and every seed witness reaches it.

Trait Implementations

impl Clone for SearchForest

fn clone(&self) -> SearchForest

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SearchForest

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for SearchForest

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for SearchForest

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

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for SearchForest