Struct async_skipdb::optimistic::OptimisticDb

pub struct OptimisticDb<K, V, SP: AsyncSpawner, S = RandomState> { /* private fields */ }

A concurrent MVCC in-memory key-value database.

OptimisticDb requires key to be Ord and Hash.

Comparing to SerializableDb:

1. SerializableDb support full serializable snapshot isolation, which can detect both direct dependencies and indirect dependencies.
2. SerializableDb does not require key to implement Hash.
3. But, OptimisticDb has more flexible write transaction APIs and no clone happen.

Implementations

impl<K, V, SP: AsyncSpawner> OptimisticDb<K, V, SP>

pub async fn new() -> Self

Creates a new OptimisticDb with the given options.

impl<K, V, SP: AsyncSpawner, S> OptimisticDb<K, V, SP, S>

pub async fn with_hasher(hasher: S) -> Self

Creates a new OptimisticDb with the given hasher.

pub async fn version(&self) -> u64

Returns the current read version of the database.

pub async fn read( &self ) -> ReadTransaction<K, V, OptimisticDb<K, V, SP, S>, HashCm<K, S>, SP>

Create a read transaction.

impl<K, V, SP, S> OptimisticDb<K, V, SP, S>

where K: Ord + Hash + Eq, S: BuildHasher + Clone, SP: AsyncSpawner,

pub async fn write(&self) -> OptimisticTransaction<K, V, SP, S>

Create a write transaction.

pub async fn write_with_capacity( &self, capacity: usize ) -> OptimisticTransaction<K, V, SP, S>

Create a write transaction with the given capacity hint.

impl<K, V, SP, S> OptimisticDb<K, V, SP, S>

where K: Ord + Eq + Hash + Send + 'static, V: Send + 'static, SP: AsyncSpawner,

pub fn compact(&self)

Compact the database.

Trait Implementations

impl<K, V, SP, S> Clone for OptimisticDb<K, V, SP, S>

where SP: AsyncSpawner,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.