Struct TransitionFrontierCandidatesState

pub struct TransitionFrontierCandidatesState {
    ordered: BTreeSet<TransitionFrontierCandidateState>,
    invalid: BTreeMap<StateHash, u32>,
}

Fields

ordered: BTreeSet<TransitionFrontierCandidateState>

Maintains an ordered list of transition frontier Candidates, ordered using consensus rules worst to best.

invalid: BTreeMap<StateHash, u32>

Candidate block hashes, which failed either the prevalidation or block proof verification. We move them here so that they consume less memory while still preventing us from triggering revalidation for an invalid block if we receive it on p2p again.

Implementations

impl TransitionFrontierCandidatesState

pub fn new() -> Self

pub fn contains(&self, hash: &StateHash) -> bool

pub(super) fn get( &self, hash: &StateHash, ) -> Option<&TransitionFrontierCandidateState>

pub(super) fn add( &mut self, time: Timestamp, block: ArcBlockWithHash, chain_proof: Option<(Vec<StateHash>, ArcBlockWithHash)>, )

fn update( &mut self, hash: &StateHash, update: impl FnOnce(TransitionFrontierCandidateState) -> TransitionFrontierCandidateState, ) -> bool

pub(super) fn update_status( &mut self, hash: &StateHash, update: impl FnOnce(TransitionFrontierCandidateStatus) -> TransitionFrontierCandidateStatus, ) -> bool

pub(super) fn invalidate(&mut self, hash: &StateHash, is_forever_invalid: bool)

pub(super) fn set_chain_proof( &mut self, hash: &StateHash, chain_proof: (Vec<StateHash>, ArcBlockWithHash), ) -> bool

pub(super) fn prune(&mut self)

pub(super) fn best(&self) -> Option<&TransitionFrontierCandidateState>

pub fn best_verified(&self) -> Option<&TransitionFrontierCandidateState>

pub fn is_chain_proof_needed(&self, hash: &StateHash) -> bool

pub fn best_verified_block(&self) -> Option<&ArcBlockWithHash>

pub fn best_verified_block_chain_proof( &self, transition_frontier: &TransitionFrontierState, ) -> Option<(Vec<StateHash>, ArcBlockWithHash)>

fn block_chain_proof( &self, block_state: &TransitionFrontierCandidateState, transition_frontier: &TransitionFrontierState, ) -> Option<(Vec<StateHash>, ArcBlockWithHash)>

impl TransitionFrontierCandidatesState

pub fn reducer( state_context: Substate<'_, Self>, action: TransitionFrontierCandidateActionWithMetaRef<'_>, )

Trait Implementations

impl Clone for TransitionFrontierCandidatesState

fn clone(&self) -> TransitionFrontierCandidatesState

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TransitionFrontierCandidatesState

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

Formats the value using the given formatter.

impl Default for TransitionFrontierCandidatesState

fn default() -> TransitionFrontierCandidatesState

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for TransitionFrontierCandidatesState

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for TransitionFrontierCandidatesState

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SubstateAccess<TransitionFrontierCandidatesState> for State

fn substate(&self) -> SubstateResult<&TransitionFrontierCandidatesState>

Attempts to obtain an immutable reference to the substate.

fn substate_mut( &mut self, ) -> SubstateResult<&mut TransitionFrontierCandidatesState>

Attempts to obtain a mutable reference to the substate.