Struct TestDB

pub struct TestDB<K, V> {
    pub rows: Arc<RwLock<BTreeMap<Vec<u8>, Vec<u8>>>>,
    pub name: String,
    /* private fields */
}

An interface to a btree map backed sally database. This is mainly intended for tests and performing benchmark comparisons

Fields

rows: Arc<RwLock<BTreeMap<Vec<u8>, Vec<u8>>>>

name: String

Implementations

impl<K, V> TestDB<K, V>

pub fn open() -> Self

pub fn batch(&self) -> TestDBWriteBatch

Trait Implementations

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

fn clone(&self) -> TestDB<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for TestDB<K, V>

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

Formats the value using the given formatter.

impl<'a, K, V> Map<'a, K, V> for TestDB<K, V>

where K: Serialize + DeserializeOwned, V: Serialize + DeserializeOwned,

type Error = TypedStoreError

type Iterator = Empty<(K, V)>

type SafeIterator = TestDBIter<'a, K, V>

type Keys = TestDBKeys<'a, K>

type Values = TestDBValues<'a, V>

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

Returns true if the map contains a value for the specified key.

fn get(&self, key: &K) -> Result<Option<V>, Self::Error>

Returns the value for the given key from the map, if it exists.

fn get_raw_bytes(&self, key: &K) -> Result<Option<Vec<u8>>, Self::Error>

Returns the raw value (serialized bytes) for the given key from the map, if it exists.

fn insert(&self, key: &K, value: &V) -> Result<(), Self::Error>

Inserts the given key-value pair into the map.

fn remove(&self, key: &K) -> Result<(), Self::Error>

Removes the entry for the given key from the map.

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

Removes every key-value pair from the map.

fn delete_file_in_range(&self, from: &K, to: &K) -> Result<(), TypedStoreError>

Removes every key-value pair from the map by deleting the underlying file.

fn schedule_delete_all(&self) -> Result<(), TypedStoreError>

Uses delete range on the entire key range

fn is_empty(&self) -> bool

Returns true if the map is empty, otherwise false.

fn unbounded_iter(&'a self) -> Self::Iterator

Returns an unbounded iterator visiting each key-value pair in the map. This is potentially unsafe as it can perform a full table scan

fn iter_with_bounds( &'a self, _lower_bound: Option<K>, _upper_bound: Option<K>, ) -> Self::Iterator

Returns an iterator visiting each key-value pair within the specified bounds in the map.

fn range_iter(&'a self, _range: impl RangeBounds<K>) -> Self::Iterator

Similar to iter_with_bounds but allows specifying inclusivity/exclusivity of ranges explicitly. TODO: find better name

fn safe_iter(&'a self) -> Self::SafeIterator

Same as iter but performs status check.

fn safe_iter_with_bounds( &'a self, _lower_bound: Option<K>, _upper_bound: Option<K>, ) -> Self::SafeIterator

fn safe_range_iter(&'a self, _range: impl RangeBounds<K>) -> Self::SafeIterator

fn keys(&'a self) -> Self::Keys

Returns an iterator over each key in the map.

fn values(&'a self) -> Self::Values

Returns an iterator over each value in the map.

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

Try to catch up with primary when running as secondary

fn multi_contains_keys<J>( &self, keys: impl IntoIterator<Item = J>, ) -> Result<Vec<bool>, Self::Error>

where J: Borrow<K>,

Returns true if the map contains a value for the specified key.

fn multi_get<J>( &self, keys: impl IntoIterator<Item = J>, ) -> Result<Vec<Option<V>>, Self::Error>

where J: Borrow<K>,

Returns a vector of values corresponding to the keys provided, non-atomically.

fn multi_get_raw_bytes<J>( &self, keys: impl IntoIterator<Item = J>, ) -> Result<Vec<Option<Vec<u8>>>, Self::Error>

where J: Borrow<K>,

Returns a vector of raw values corresponding to the keys provided, non-atomically.

fn chunked_multi_get<J>( &self, keys: impl IntoIterator<Item = J>, _chunk_size: usize, ) -> Result<Vec<Option<V>>, Self::Error>

where J: Borrow<K>,

Returns a vector of values corresponding to the keys provided, non-atomically.

fn multi_insert<J, U>( &self, key_val_pairs: impl IntoIterator<Item = (J, U)>, ) -> Result<(), Self::Error>

where J: Borrow<K>, U: Borrow<V>,

Inserts key-value pairs, non-atomically.

fn multi_remove<J>( &self, keys: impl IntoIterator<Item = J>, ) -> Result<(), Self::Error>

where J: Borrow<K>,

Removes keys, non-atomically.

impl<J, K, U, V> TryExtend<(J, U)> for TestDB<K, V>

where J: Borrow<K>, U: Borrow<V>, K: Serialize, V: Serialize,

type Error = TypedStoreError

Error type.

fn try_extend<T>(&mut self, iter: &mut T) -> Result<(), Self::Error>

where T: Iterator<Item = (J, U)>,

Try to extend the collection from the given iterator.

fn try_extend_from_slice(&mut self, slice: &[(J, U)]) -> Result<(), Self::Error>

Try to extend the collection from the given slice.