Struct skipdb_core::PendingMap

pub struct PendingMap<K, V> { /* private fields */ }

Pending write manger implementation for [EquivalentDB] and [ComparableDB].

Trait Implementations

impl<K: Clone, V: Clone> Clone for PendingMap<K, V>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K, V> Pwm for PendingMap<K, V>

where K: Ord,

type Error = Infallible

The error type returned by the conflict manager.

type Key = K

The key type.

type Value = V

The value type.

type Options = Options

The options type used to create the pending manager.

type Iter<'a> = Iter<'a, K, EntryValue<V>> where Self: 'a

The iterator type.

type IntoIter = IntoIter<K, EntryValue<V>>

The IntoIterator type.

fn new(options: Self::Options) -> Result<Self, Self::Error>

Create a new pending manager with the given options.

fn is_empty(&self) -> bool

Returns true if the buffer is empty.

fn len(&self) -> usize

Returns the number of elements in the buffer.

fn validate_entry( &self, _entry: &Entry<Self::Key, Self::Value> ) -> Result<(), Self::Error>

Validate if the entry is valid for this database.

fn max_batch_size(&self) -> u64

Returns the maximum batch size in bytes

fn max_batch_entries(&self) -> u64

Returns the maximum entries in batch

fn estimate_size(&self, _entry: &Entry<Self::Key, Self::Value>) -> u64

Returns the estimated size of the entry in bytes when persisted in the database.

fn contains_key(&self, key: &Self::Key) -> Result<bool, Self::Error>

Returns true if the pending manager contains the key.

fn get( &self, key: &Self::Key ) -> Result<Option<&EntryValue<Self::Value>>, Self::Error>

Returns a reference to the value corresponding to the key.

fn insert( &mut self, key: Self::Key, value: EntryValue<Self::Value> ) -> Result<(), Self::Error>

Inserts a key-value pair into the er.

fn remove_entry( &mut self, key: &Self::Key ) -> Result<Option<(Self::Key, EntryValue<Self::Value>)>, Self::Error>

Removes a key from the pending writes, returning the key-value pair if the key was previously in the pending writes.

fn iter(&self) -> Self::Iter<'_>

Returns an iterator over the pending writes.

fn into_iter(self) -> Self::IntoIter

Returns an iterator that consumes the pending writes.

fn rollback(&mut self) -> Result<(), Self::Error>

Rollback the pending writes.

impl<K, V> PwmComparable for PendingMap<K, V>

where K: Ord,

fn get_comparable<Q>( &self, key: &Q ) -> Result<Option<&EntryValue<Self::Value>>, Self::Error>

where Self::Key: Borrow<Q>, Q: Ord + ?Sized,

Optimized version of Pwm::get that accepts borrowed keys.

fn get_entry_comparable<Q>( &self, key: &Q ) -> Result<Option<(&Self::Key, &EntryValue<Self::Value>)>, Self::Error>

where Self::Key: Borrow<Q>, Q: Ord + ?Sized,

fn contains_key_comparable<Q>(&self, key: &Q) -> Result<bool, Self::Error>

where Self::Key: Borrow<Q>, Q: Ord + ?Sized,

Optimized version of Pwm::contains_key that accepts borrowed keys.

fn remove_entry_comparable<Q>( &mut self, key: &Q ) -> Result<Option<(Self::Key, EntryValue<Self::Value>)>, Self::Error>

where Self::Key: Borrow<Q>, Q: Ord + ?Sized,

Optimized version of Pwm::remove_entry that accepts borrowed keys.

impl<K, V> PwmComparableRange for PendingMap<K, V>

where K: Ord,

fn range_comparable<T, R>(&self, range: R) -> Self::Range<'_>

where T: ?Sized + Ord, Self::Key: Borrow<T> + Ord, R: RangeBounds<T>,

Returns an iterator over the pending writes.

impl<K, V> PwmRange for PendingMap<K, V>

where K: Ord,

type Range<'a> = Range<'a, K, EntryValue<V>> where Self: 'a

The iterator type.

fn range<R: RangeBounds<Self::Key>>(&self, range: R) -> Self::Range<'_>

Returns an iterator over the pending writes.