Struct PrioritizationFeeCache

pub struct PrioritizationFeeCache { /* private fields */ }

Stores up to MAX_NUM_RECENT_BLOCKS recent block’s prioritization fee, A separate internal thread service_thread handles additional tasks when a bank is frozen, and collecting stats and reporting metrics.

Implementations

impl PrioritizationFeeCache

pub fn new(capacity: u64) -> Self

pub fn update<'a>( &self, bank: &Bank, txs: impl Iterator<Item = &'a SanitizedTransaction>, )

Update with a list of non-vote transactions’ compute_budget_details and account_locks; Only transactions have both valid compute_budget_details and account_locks will be used to update fee_cache asynchronously.

pub fn finalize_priority_fee(&self, slot: Slot, bank_id: BankId)

Finalize prioritization fee when it’s bank is completely replayed from blockstore, by pruning irrelevant accounts to save space, and marking its availability for queries.

pub fn available_block_count(&self) -> usize

Returns number of blocks that have finalized minimum fees collection

pub fn get_prioritization_fees( &self, account_keys: &[Pubkey], ) -> Vec<(Slot, u64)>

Trait Implementations

impl Debug for PrioritizationFeeCache

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

Formats the value using the given formatter.

impl Default for PrioritizationFeeCache

fn default() -> Self

Returns the “default value” for a type.

impl Drop for PrioritizationFeeCache

fn drop(&mut self)

Executes the destructor for this type.