Struct solana_core::vote_simulator::VoteSimulator

source ·

pub struct VoteSimulator {
    pub validator_keypairs: HashMap<Pubkey, ValidatorVoteKeypairs>,
    pub node_pubkeys: Vec<Pubkey>,
    pub vote_pubkeys: Vec<Pubkey>,
    pub bank_forks: Arc<RwLock<BankForks>>,
    pub progress: ProgressMap,
    pub heaviest_subtree_fork_choice: HeaviestSubtreeForkChoice,
    pub latest_validator_votes_for_frozen_banks: LatestValidatorVotesForFrozenBanks,
}

Fields§

§validator_keypairs: HashMap<Pubkey, ValidatorVoteKeypairs>§node_pubkeys: Vec<Pubkey>§vote_pubkeys: Vec<Pubkey>§bank_forks: Arc<RwLock<BankForks>>§progress: ProgressMap§heaviest_subtree_fork_choice: HeaviestSubtreeForkChoice§latest_validator_votes_for_frozen_banks: LatestValidatorVotesForFrozenBanks

Struct solana_core::vote_simulator::VoteSimulator

Fields§

Implementations§

impl VoteSimulator

pub fn new(num_keypairs: usize) -> Self

pub fn fill_bank_forks( &mut self, forks: Tree<u64>, cluster_votes: &HashMap<Pubkey, Vec<u64>>, is_frozen: bool )

pub fn simulate_vote( &mut self, vote_slot: Slot, my_pubkey: &Pubkey, tower: &mut Tower ) -> Vec<HeaviestForkFailures>

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

pub fn create_and_vote_new_branch( &mut self, start_slot: Slot, end_slot: Slot, cluster_votes: &HashMap<Pubkey, Vec<u64>>, votes_to_simulate: &HashSet<Slot>, my_pubkey: &Pubkey, tower: &mut Tower ) -> HashMap<Slot, Vec<HeaviestForkFailures>>

pub fn simulate_lockout_interval( &mut self, slot: Slot, lockout_interval: (u64, u64), vote_account_pubkey: &Pubkey )

pub fn can_progress_on_fork( &mut self, my_pubkey: &Pubkey, tower: &mut Tower, start_slot: u64, num_slots: u64, cluster_votes: &mut HashMap<Pubkey, Vec<u64>> ) -> bool

Auto Trait Implementations§

impl RefUnwindSafe for VoteSimulator

impl Send for VoteSimulator

impl Sync for VoteSimulator

impl Unpin for VoteSimulator

impl UnwindSafe for VoteSimulator

Blanket Implementations§

impl<T> AbiExample for T

default fn example() -> T

impl<T> Any for Twhere T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere T: 'a,

fn explicit(self, class: Class, tag: u32) -> TaggedParser<'a, Explicit, Self, E>

impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere T: 'a,

fn implicit( self, class: Class, constructed: bool, tag: u32 ) -> TaggedParser<'a, Implicit, Self, E>

impl<T> Borrow<T> for Twhere T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for Twhere T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<T> From<T> for T

fn from(t: T) -> T

impl<T> Instrument for T

fn instrument(self, span: Span) -> Instrumented<Self>

fn in_current_span(self) -> Instrumented<Self>

impl<T, U> Into<U> for Twhere U: From<T>,

fn into(self) -> U

impl<T> IntoRequest<T> for T

fn into_request(self) -> Request<T>

impl<T> IntoRequest<T> for T

fn into_request(self) -> Request<T>

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

type Init = T

unsafe fn init(init: <T as Pointable>::Init) -> usize

unsafe fn deref<'a>(ptr: usize) -> &'a T

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

unsafe fn drop(ptr: usize)

impl<T> Same<T> for T

type Output = T

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<T> TupleTree<T, ()> for T

const SIZE: Size = Size{ degree: 0, descendants: 0,}

fn descendants(_indirect_level: usize) -> usize

fn height() -> usize

fn preorder(self, f: &mut impl FnMut(Visit<T>))

fn preorder_with_size_hint(self, f: &mut impl FnMut(Visit<T>, Size))

fn postorder(self, f: &mut impl FnMut(Visit<T>))

fn postorder_with_size_hint(self, f: &mut impl FnMut(Visit<T>, Size))

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

fn vzip(self) -> V

impl<T> WithSubscriber for T

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>where S: Into<Dispatch>,

fn with_current_subscriber(self) -> WithDispatch<Self>