Struct FastMemoryStore 

pub struct FastMemoryStore {
    inner: RwLock<StoreInner>,
}

High-performance in-memory JMT store optimized for write throughput.

Differences from MockTreeStore:

• Uses std::collections::HashMap (no parking_lot overhead)
• Single RwLock instead of separate locks per collection
• Tracks node count for metrics
• Correct delete semantics via tombstones (not entry removal)
• No debug assertions in hot path

Fields

inner: RwLock<StoreInner>

Implementations

impl FastMemoryStore

pub fn new() -> Self

pub fn num_nodes(&self) -> usize

pub fn num_values(&self) -> usize

pub fn num_stale_nodes(&self) -> usize

impl FastMemoryStore

pub fn write_tree_update_batch(&self, batch: TreeUpdateBatch) -> Result<()>

pub fn prune_stale_nodes(&self, up_to_version: Version) -> usize

Prune stale nodes up to the given version.

Trait Implementations

impl Default for FastMemoryStore

fn default() -> Self

Returns the “default value” for a type.

impl TreeReader for FastMemoryStore

fn get_node_option(&self, node_key: &NodeKey) -> Result<Option<Node>>

Gets node given a node key. Returns None if the node does not exist.

fn get_value_option( &self, max_version: Version, key_hash: KeyHash, ) -> Result<Option<OwnedValue>>

Gets a value by identifier, returning the newest value whose version is less than or equal to the specified version. Returns None if the value does not exist.

fn get_rightmost_leaf(&self) -> Result<Option<(NodeKey, LeafNode)>>

Gets the rightmost leaf. Note that this assumes we are in the process of restoring the tree and all nodes are at the same version.

fn get_node(&self, node_key: &NodeKey) -> Result<Node, Error>

Gets node given a node key. Returns error if the node does not exist.

fn get_value( &self, max_version: u64, key_hash: KeyHash, ) -> Result<Vec<u8>, Error>

Gets a value by identifier, returning the newest value whose version is less than or equal to the specified version. Returns an error if the value does not exist.

impl TreeWriter for FastMemoryStore

fn write_node_batch(&self, node_batch: &NodeBatch) -> Result<()>

Writes a node batch into storage.