Struct redb::Table

pub struct Table<'db, 'txn, K: RedbKey + ?Sized, V: RedbValue + ?Sized> { /* private fields */ }

A table containing key-value mappings

Implementations

impl<'db, 'txn, K: RedbKey + ?Sized, V: RedbValue + ?Sized> Table<'db, 'txn, K, V>

pub fn insert(
    &mut self,
    key: &K,
    value: &V
) -> Result<Option<AccessGuard<'_, V>>, Error>

Insert mapping of the given key to the given value

Returns the old value, if the key was present in the table

pub fn insert_reserve(
    &mut self,
    key: &K,
    value_length: usize
) -> Result<AccessGuardMut<'_, K, [u8]>, Error>

Reserve space to insert a key-value pair The returned reference will have length equal to value_length

pub fn remove(&mut self, key: &K) -> Result<Option<AccessGuard<'_, V>>, Error>

Removes the given key

Returns the old value, if the key was present in the table

Trait Implementations

impl<'db, 'txn, K: RedbKey + ?Sized, V: RedbValue + ?Sized> Drop for Table<'db, 'txn, K, V>

fn drop(&mut self)

Executes the destructor for this type.

impl<'db, 'txn, K: RedbKey + ?Sized, V: RedbValue + ?Sized> ReadableTable<K, V> for Table<'db, 'txn, K, V>

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

Returns the value corresponding to the given key

fn range<'a, T: RangeBounds<KR>, KR: Borrow<K> + 'a>(
    &'a self,
    range: T
) -> Result<RangeIter<'_, K, V>, Error>

Returns a double-ended iterator over a range of elements in the table

fn len(&self) -> Result<usize, Error>

Returns the number of entries in the table

fn is_empty(&self) -> Result<bool, Error>

Returns true if the table is empty