Struct ChangesetCache 

pub struct ChangesetCache { /* private fields */ }

Thread-safe changeset cache.

This type wraps a shared, mutable reference to the cache inner. The RwLock enables concurrent reads while ensuring exclusive access for writes.

Implementations

impl ChangesetCache

pub fn new() -> Self

Creates a new cache.

The cache has no capacity limit and relies on explicit eviction via the evict() method to manage memory usage.

pub fn get(&self, block_hash: &B256) -> Option<Arc<TrieUpdatesSorted>>

Retrieves changesets for a block by hash.

Returns None if the block is not in the cache (either evicted or never computed). Updates hit/miss metrics accordingly.

pub fn insert( &self, block_hash: B256, block_number: u64, changesets: Arc<TrieUpdatesSorted>, )

Inserts changesets for a block into the cache.

This method does not perform any eviction. Eviction must be explicitly triggered by calling evict().

Arguments

• block_hash - Hash of the block
• block_number - Block number for tracking and eviction
• changesets - Trie changesets to cache

pub fn evict(&self, up_to_block: BlockNumber)

Evicts changesets for blocks below the given block number.

This should be called after blocks are persisted to the database to free memory for changesets that are no longer needed in the cache.

Arguments

• up_to_block - Evict blocks with number < this value. Blocks with number >= this value are retained.

pub fn get_or_compute<P>( &self, block_hash: B256, block_number: u64, provider: &P, ) -> ProviderResult<Arc<TrieUpdatesSorted>>

where P: DBProvider + StageCheckpointReader + ChangeSetReader + StorageChangeSetReader + BlockNumReader,

Gets changesets from cache, or computes them on-the-fly if missing.

This is the primary API for retrieving changesets. On cache miss, it computes changesets from the database state and populates the cache.

Arguments

• block_hash - Hash of the block to get changesets for
• block_number - Block number (for cache insertion and logging)
• provider - Database provider for DB access

Returns

Changesets for the block, either from cache or computed on-the-fly

pub fn get_or_compute_range<P>( &self, provider: &P, range: RangeInclusive<BlockNumber>, ) -> ProviderResult<TrieUpdatesSorted>

where P: DBProvider + StageCheckpointReader + ChangeSetReader + StorageChangeSetReader + BlockNumReader,

Gets or computes accumulated trie reverts for a range of blocks.

This method retrieves and accumulates all trie changesets (reverts) for the specified block range (inclusive). The changesets are accumulated in reverse order (newest to oldest) so that older values take precedence when there are conflicts.

Arguments

• provider - Database provider for DB access and block lookups
• range - Block range to accumulate reverts for (inclusive)

Returns

Accumulated trie reverts for all blocks in the specified range

Errors

Returns error if:

• Any block in the range is beyond the database tip
• Database access fails
• Block hash lookup fails
• Changeset computation fails

Trait Implementations

impl Clone for ChangesetCache

fn clone(&self) -> ChangesetCache

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ChangesetCache

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

Formats the value using the given formatter.

impl Default for ChangesetCache

fn default() -> Self

Returns the “default value” for a type.

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 8 bytes