Struct rdms::no_disk::NoDisk

pub struct NoDisk<K, V> { /* fields omitted */ }

NoDisk type denotes empty Disk type. Applications can use this type while instantiating rdms-index in mem-only mode.

Trait Implementations

impl<K, V> Footprint for NoDisk<K, V>

fn footprint(&self) -> isize

impl<K, V> Index<K, V> for NoDisk<K, V> where
    K: Clone + Ord + Footprint,
    V: Clone + Diff + Footprint, 

type W = NoDisk<K, V>

A writer type, that can ingest key-value pairs, associated with this index.

type R = NoDisk<K, V>

A writer type, that can ingest key-value pairs, associated with this index.

fn make_new(&self) -> Result<Box<Self>>

Make a new empty index of this type, with same configuration.

fn to_reader(&mut self) -> Result<Self::R>

Create a new read handle, for multi-threading. Note that not all indexes allow concurrent readers. Refer to index API for more details.

fn to_writer(&mut self) -> Result<Self::W>

Create a new write handle, for multi-threading. Note that not all indexes allow concurrent writers. Refer to index API for more details.

impl<K, V> Reader<K, V> for NoDisk<K, V> where
    K: Clone + Ord,
    V: Clone + Diff, 

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

Get key from index. Returned entry may not have all its previous versions, if it is costly to fetch from disk.

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

Iterate over all entries in this index. Returned entry may not have all its previous versions, if it is costly to fetch from disk.

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

Iterate from lower bound to upper bound. Returned entry may not have all its previous versions, if it is costly to fetch from disk.

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

Iterate from upper bound to lower bound. Returned entry may not have all its previous versions, if it is costly to fetch from disk.

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

Get key from index. Returned entry shall have all its previous versions, can be a costly call.

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

Iterate over all entries in this index. Returned entry shall have all its previous versions, can be a costly call.

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

Iterate from lower bound to upper bound. Returned entry shall have all its previous versions, can be a costly call.

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

Iterate from upper bound to lower bound. Returned entry shall have all its previous versions, can be a costly call.

impl<K, V> Writer<K, V> for NoDisk<K, V> where
    K: Clone + Ord + Footprint,
    V: Clone + Diff + Footprint, 

fn set(&mut self, _key: K, _value: V) -> Result<Option<Entry<K, V>>>

Set {key, value} in index. Return older entry if present. Return the older entry if present. If operation was invalid or NOOP, returned seqno shall be ZERO.

fn set_cas(&mut self, _k: K, _v: V, _: 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. If operation was invalid or NOOP, returned seqno shall be ZERO.

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 index. Return the mutation and entry if present. If operation was invalid or NOOP, returned seqno shall be ZERO.