Struct Db 

pub struct Db<E> { /* private fields */ }

Top-level configuration for the system.

Implementations

impl<E> Db<E>

where E: Encryption,

pub fn open_tree<V: AsRef<[u8]>>(&self, name: V) -> Result<Tree<E>>

Open or create a new disk-backed Tree with its own keyspace, accessible from the Db via the provided identifier.

pub fn drop_tree<V: AsRef<[u8]>>(&self, name: V) -> Result<bool>

Remove a disk-backed collection.

pub fn tree_names(&self) -> Result<Vec<IVec>>

Returns the trees names saved in this Db.

pub fn was_recovered(&self) -> bool

pub fn generate_id(&self) -> Result<u64>

pub fn checksum(&self) -> Result<u32>

pub fn size_on_disk(&self) -> Result<u64>

Methods from Deref<Target = Tree<E>>

pub fn get<K: AsRef<[u8]>>(&self, key: K) -> Result<Option<IVec>>

pub fn insert<K, V>(&self, key: K, value: V) -> Result<Option<IVec>>

where K: AsRef<[u8]>, V: Into<IVec>,

pub fn remove<K: AsRef<[u8]>>(&self, key: K) -> Result<Option<IVec>>

pub fn apply_batch(&self, batch: Batch) -> Result<()>

pub fn transaction<F, A, Error>(&self, f: F) -> TransactionResult<A, Error>

where F: Fn(&TransactionalTree<E>) -> ConflictableTransactionResult<A, Error>,

pub fn watch_prefix<P: AsRef<[u8]>>(&self, prefix: P) -> Result<Subscriber<E>>

pub fn compare_and_swap<K, OV, NV>( &self, key: K, old: Option<OV>, new: Option<NV>, ) -> Result<Result<(), CompareAndSwapError>>

where K: AsRef<[u8]>, OV: AsRef<[u8]>, NV: Into<IVec>,

pub fn update_and_fetch<K, V, F>(&self, key: K, f: F) -> Result<Option<IVec>>

where K: AsRef<[u8]>, F: FnMut(Option<IVec>) -> Option<V>, V: Into<IVec>,

pub fn fetch_and_update<K, V, F>(&self, key: K, f: F) -> Result<Option<IVec>>

where K: AsRef<[u8]>, F: FnMut(Option<IVec>) -> Option<V>, V: Into<IVec>,

pub fn flush(&self) -> Result<usize>

pub async fn flush_async(&self) -> Result<usize>

pub fn contains_key<K: AsRef<[u8]>>(&self, key: K) -> Result<bool>

pub fn get_lt<K>(&self, key: K) -> Result<Option<(IVec, IVec)>>

where K: AsRef<[u8]>,

pub fn get_gt<K>(&self, key: K) -> Result<Option<(IVec, IVec)>>

where K: AsRef<[u8]>,

pub fn first(&self) -> Result<Option<(IVec, IVec)>>

pub fn last(&self) -> Result<Option<(IVec, IVec)>>

pub fn pop_min(&self) -> Result<Option<(IVec, IVec)>>

pub fn pop_max(&self) -> Result<Option<(IVec, IVec)>>

pub fn iter(&self) -> Iter<E>

pub fn range<K, R>(&self, range: R) -> Result<Iter<E>>

where K: AsRef<[u8]>, R: RangeBounds<K>,

pub fn scan_prefix<P>(&self, prefix: P) -> Result<Iter<E>>

where P: AsRef<[u8]>,

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn clear(&self) -> Result<()>

pub fn name(&self) -> Result<IVec>

pub fn checksum(&self) -> Result<u32>

pub fn merge<K, V>(&self, key: K, value: V) -> Result<Option<IVec>>

where K: AsRef<[u8]>, V: AsRef<[u8]>,

pub fn set_merge_operator(&self, merge_operator: impl MergeOperator + 'static)

Trait Implementations

impl<E: Clone> Clone for Db<E>

fn clone(&self) -> Db<E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<E: Debug> Debug for Db<E>

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

Formats the value using the given formatter.

impl<E> Deref for Db<E>

type Target = Tree<E>

The resulting type after dereferencing.

fn deref(&self) -> &Tree<E>

Dereferences the value.