Struct rdms::Rdms

pub struct Rdms<K, V, M, D> where
    K: Clone + Ord + Footprint,
    V: Clone + Diff + Footprint,
    M: Index<K, V>,
    D: Index<K, V>,  { /* fields omitted */ }

Index keys and corresponding values. Check module documentation for the full set of features.

Methods

impl<K, V, M, D> Rdms<K, V, M, D> where
    K: Clone + Ord + Footprint,
    V: Clone + Diff + Footprint,
    M: Index<K, V>,
    D: Index<K, V>, 

pub fn new<S>(
    name: S,
    mem: M,
    disk: D,
    config: Config
) -> Result<Rdms<K, V, M, D>> where
    S: AsRef<str>, 

impl<K, V, M, D> Rdms<K, V, M, D> where
    K: Clone + Ord + Footprint,
    V: Clone + Diff + Footprint,
    M: Index<K, V>,
    D: Index<K, V>, 

pub fn to_name(&self) -> String

pub fn to_seqno(&self) -> u64

impl<K, V, M, D> Rdms<K, V, M, D> where
    K: 'static + Clone + Ord + Footprint,
    V: 'static + Clone + Diff + Footprint,
    M: Index<K, V> + Reader<K, V>,
    D: Index<K, V> + Reader<K, V>, 

pub fn get<Q: ?Sized>(&self, key: &Q) -> Result<Entry<K, V>> where
    K: Borrow<Q>,
    Q: Ord, 

Get key from index.

pub fn iter(&self) -> Result<IndexIter<K, V>>

Iterate over all entries in this index.

pub fn range<'a, R, Q: ?Sized>(&'a self, range: R) -> Result<IndexIter<K, V>> where
    K: Borrow<Q>,
    R: 'a + Clone + RangeBounds<Q>,
    Q: 'a + Ord, 

Iterate from lower bound to upper bound.

pub fn reverse<'a, R, Q: ?Sized>(&'a self, range: R) -> Result<IndexIter<K, V>> where
    K: Borrow<Q>,
    R: 'a + Clone + RangeBounds<Q>,
    Q: 'a + Ord, 

Iterate from upper bound to lower bound.

impl<K, V, M, D> Rdms<K, V, M, D> where
    K: 'static + Clone + Ord + Footprint,
    V: 'static + Clone + Diff + From<<V as Diff>::D> + Footprint,
    M: Index<K, V> + Reader<K, V>,
    D: Index<K, V> + Reader<K, V>, 

pub fn get_with_versions<Q: ?Sized>(&self, key: &Q) -> Result<Entry<K, V>> where
    K: Borrow<Q>,
    Q: Ord, 

pub fn iter_with_versions(&self) -> Result<IndexIter<K, V>>

pub fn range_with_versions<'a, R, Q: ?Sized>(
    &'a self,
    range: R
) -> Result<IndexIter<K, V>> where
    K: Borrow<Q>,
    R: 'a + Clone + RangeBounds<Q>,
    Q: 'a + Ord, 

pub fn reverse_with_versions<'a, R, Q: ?Sized>(
    &'a self,
    range: R
) -> Result<IndexIter<K, V>> where
    K: Borrow<Q>,
    R: 'a + Clone + RangeBounds<Q>,
    Q: 'a + Ord, 

impl<K, V, M, D> Rdms<K, V, M, D> where
    K: Clone + Ord + Footprint,
    V: Clone + Diff + Footprint,
    M: Index<K, V> + Writer<K, V>,
    D: Index<K, V>, 

pub fn set(&mut self, key: K, value: V) -> Result<Option<Entry<K, V>>>

Set {key, value} in index. Return older entry if present.

pub fn set_cas(
    &mut self,
    key: K,
    value: V,
    cas: u64
) -> Result<Option<Entry<K, V>>>

Set {key, value} in index if an older entry exists with the same cas value. To create a fresh entry, pass cas as ZERO. Return the older entry if present.

pub fn delete<Q: ?Sized>(&mut self, key: &Q) -> Result<Option<Entry<K, V>>> where
    K: Borrow<Q>,
    Q: ToOwned<Owned = K> + Ord, 

Delete key from DB. Return the entry if it is already present.

impl<K, V, M, D> Rdms<K, V, M, D> where
    K: Clone + Ord + Debug + Footprint,
    V: Clone + Diff + Footprint,
    M: Index<K, V>,
    D: Index<K, V>, 

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