Struct solana_core::heaviest_subtree_fork_choice::HeaviestSubtreeForkChoice

pub struct HeaviestSubtreeForkChoice { /* private fields */ }

Implementations

impl HeaviestSubtreeForkChoice

pub fn new(root: SlotHashKey) -> Self

pub fn new_from_frozen_banks(
    root: SlotHashKey,
    frozen_banks: &[Arc<Bank>]
) -> Self

pub fn new_from_bank_forks(bank_forks: &BankForks) -> Self

pub fn contains_block(&self, key: &SlotHashKey) -> bool

pub fn best_slot(&self, key: &SlotHashKey) -> Option<SlotHashKey>

pub fn best_overall_slot(&self) -> SlotHashKey

pub fn stake_voted_subtree(&self, key: &SlotHashKey) -> Option<u64>

pub fn root(&self) -> SlotHashKey

pub fn max_by_weight(&self, slot1: SlotHashKey, slot2: SlotHashKey) -> Ordering

pub fn add_votes<'a, 'b>(
    &'a mut self,
    pubkey_votes: impl Iterator<Item = impl Borrow<(Pubkey, SlotHashKey)> + 'b>,
    epoch_stakes: &HashMap<Epoch, EpochStakes>,
    epoch_schedule: &EpochSchedule
) -> SlotHashKey

pub fn set_root(&mut self, new_root: SlotHashKey)

pub fn add_root_parent(&mut self, root_parent: SlotHashKey)

pub fn add_new_leaf_slot(
    &mut self,
    slot_hash_key: SlotHashKey,
    parent: Option<SlotHashKey>
)

pub fn all_slots_stake_voted_subtree(
    &self
) -> impl Iterator<Item = (&SlotHashKey, u64)>

pub fn merge(
    &mut self,
    other: HeaviestSubtreeForkChoice,
    merge_leaf: &SlotHashKey,
    epoch_stakes: &HashMap<Epoch, EpochStakes>,
    epoch_schedule: &EpochSchedule
)

pub fn stake_voted_at(&self, slot: &SlotHashKey) -> Option<u64>

pub fn latest_invalid_ancestor(
    &self,
    slot_hash_key: &SlotHashKey
) -> Option<Slot>

pub fn is_duplicate_confirmed(
    &self,
    slot_hash_key: &SlotHashKey
) -> Option<bool>

pub fn is_unconfirmed_duplicate(
    &self,
    slot_hash_key: &SlotHashKey
) -> Option<bool>

Returns if the exact node with the specified key has been explicitly marked as a duplicate slot (doesn’t count ancestors being marked as duplicate).

pub fn is_candidate(&self, slot_hash_key: &SlotHashKey) -> Option<bool>

Returns false if the node or any of its ancestors have been marked as duplicate

pub fn is_strict_ancestor(
    &self,
    maybe_ancestor_key: &SlotHashKey,
    node_key: &SlotHashKey
) -> bool

Returns if a node with slot maybe_ancestor_slot is an ancestor of the node with key node_key

Trait Implementations

impl ForkChoice for HeaviestSubtreeForkChoice

type ForkChoiceKey = (u64, Hash)

fn compute_bank_stats(
    &mut self,
    bank: &Bank,
    _tower: &Tower,
    latest_validator_votes_for_frozen_banks: &mut LatestValidatorVotesForFrozenBanks
)

fn select_forks(
    &self,
    _frozen_banks: &[Arc<Bank>],
    tower: &Tower,
    _progress: &ProgressMap,
    _ancestors: &HashMap<u64, HashSet<u64>>,
    bank_forks: &RwLock<BankForks>
) -> (Arc<Bank>, Option<Arc<Bank>>)

fn mark_fork_invalid_candidate(&mut self, invalid_slot_hash_key: &SlotHashKey)

fn mark_fork_valid_candidate(
    &mut self,
    valid_slot_hash_key: &SlotHashKey
) -> Vec<SlotHashKey>

Returns any newly duplicate confirmed ancestors of valid_slot up to and including valid_slot itself

impl TreeDiff for HeaviestSubtreeForkChoice

type TreeKey = (u64, Hash)

fn contains_slot(&self, slot_hash_key: &SlotHashKey) -> bool

fn children(&self, slot_hash_key: &SlotHashKey) -> Option<&[SlotHashKey]>

fn subtree_diff(
    &self,
    root1: Self::TreeKey,
    root2: Self::TreeKey
) -> HashSet<Self::TreeKey>