Struct polkadot_node_subsystem_util::database::paritydb_impl::DbAdapter

pub struct DbAdapter { /* private fields */ }

Implementation of of Database for parity-db adapter.

Implementations

impl DbAdapter

pub fn new(db: Db, indexed_columns: &[u32]) -> Self

Implementation of of Database for parity-db adapter.

Trait Implementations

impl Database for DbAdapter

fn is_indexed_column(&self, col: u32) -> bool

Check if column allows content iteration and removal by prefix.

impl KeyValueDB for DbAdapter

fn transaction(&self) -> DBTransaction

Helper to create a new transaction.

fn get(&self, col: u32, key: &[u8]) -> Result<Option<DBValue>>

Get a value by key.

fn get_by_prefix(&self, col: u32, prefix: &[u8]) -> Option<Box<[u8]>>

Get the first value matching the given prefix.

fn iter<'a>(
    &'a self,
    col: u32
) -> Box<dyn Iterator<Item = (Box<[u8]>, Box<[u8]>)> + 'a>

Iterate over the data for a given column.

fn iter_with_prefix<'a>(
    &'a self,
    col: u32,
    prefix: &'a [u8]
) -> Box<dyn Iterator<Item = (Box<[u8]>, Box<[u8]>)> + 'a>

Iterate over the data for a given column, returning all key/value pairs where the key starts with the given prefix.

fn restore(&self, _new_db: &str) -> Result<()>

Attempt to replace this database with a new one located at the given path.

fn io_stats(&self, _kind: IoStatsKind) -> IoStats

Query statistics.

fn has_key(&self, col: u32, key: &[u8]) -> Result<bool>

Check for the existence of a value by key.

fn has_prefix(&self, col: u32, prefix: &[u8]) -> bool

Check for the existence of a value by prefix.

fn write(&self, transaction: DBTransaction) -> Result<()>

Write a transaction of changes to the backing store.

impl MallocSizeOf for DbAdapter

fn size_of(&self, _ops: &mut MallocSizeOfOps) -> usize

Measure the heap usage of all descendant heap-allocated structures, but not the space taken up by the value itself. If T::size_of is a constant, consider implementing constant_size as well.

fn constant_size() -> Option<usize>where
    Self: Sized,

Used to optimize MallocSizeOf implementation for collections like Vec and HashMap to avoid iterating over them unnecessarily. The Self: Sized bound is for object safety.