Struct sled_extensions::expiring::Tree

pub struct Tree<V, E, F> { /* fields omitted */ }

A flash-sympathetic persistent lock-free B+ tree

This tree keeps track of insert and update times if requested

Methods

impl<V, E, F> ExpiringTree<V, E, F> where
    E: Encoding<HashSet<IVec>> + Encoding<DateTime<Utc>> + 'static,
    F: Encoding<V> + 'static, 

pub fn cloned(&self) -> Self

Clone for structures where V, E, and F aren't Clone

pub fn transaction<G, R>(&self, g: G) -> TransactionResult<Result<R>> where
    G: Fn(ExpiringTransactionalTree<V, E, F>) -> TransactionResult<Result<R>>, 

Perform a multi-key serializable transaction.

Transactions also work on tuples of Trees, preserving serializable ACID semantics! In this example, we treat two trees like a work queue, atomically apply updates to data and move them from the unprocessed Tree to the processed Tree.

pub fn apply_batch(&self, batch: ExpiringBatch<V, F>) -> Result<()>

Create a new batched update that can be atomically applied.

It is possible to apply a Batch in a transaction as well, which is the way you can apply a Batch to multiple Trees atomically.

pub fn cas<K>(
    &self,
    key: K,
    old: Option<V>,
    new: Option<V>
) -> Result<Result<(), Option<V>>> where
    K: AsRef<[u8]>, 

Compare and swap. Capable of unique creation, conditional modification, or deletion. If old is None, this will only set the value if it doesn't exist yet. If new is None, will delete the value if old is correct. If both old and new are Some, will modify the value if old is correct. If Tree is read-only, will do nothing.

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

Retrieve a value from the Tree if it exists.

pub fn insert<K>(&self, key: K, value: V) -> Result<Option<V>> where
    IVec: From<K>,
    K: AsRef<[u8]>, 

Insert a key to a new value, returning the last value if it was set.

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

Delete a value, returning the old value if it existed.

pub fn update_and_fetch<K>(
    &self,
    key: K,
    f: impl Fn(Option<V>) -> Option<V>
) -> Result<Option<V>> where
    K: AsRef<[u8]>, 

Fetch the value, apply a function to it and return the result.

Note

This may call the function multiple times if the value has been changed from other threads in the meantime.

pub fn fetch_and_update<K>(
    &self,
    key: K,
    f: impl Fn(Option<V>) -> Option<V>
) -> Result<Option<V>> where
    K: AsRef<[u8]>, 

Fetch the value, apply a function to it and return the previous value.

Note

This may call the function multiple times if the value has been changed from other threads in the meantime.

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

Synchronously flushes all dirty IO buffers and calls fsync. If this succeeds, it is guaranteed that all previous writes will be recovered if the system crashes. Returns the number of bytes flushed during this call.

Flushing can take quite a lot of time, and you should measure the performance impact of using it on realistic sustained workloads running on realistic hardware.

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

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

Important traits for ExpiringIter<'a, V, E, F>

impl<'a, V, E, F> Iterator for ExpiringIter<'a, V, E, F> where
    E: Encoding<HashSet<IVec>> + Encoding<DateTime<Utc>> + 'static,
    F: Encoding<V> + 'static,  type Item = Result<(IVec, V)>;

pub fn iter<'a>(&'a self) -> ExpiringIter<'a, V, E, F>

Create a double-ended iterator over the tuples of keys and values in this tree.

Important traits for ExpiringIter<'a, V, E, F>

impl<'a, V, E, F> Iterator for ExpiringIter<'a, V, E, F> where
    E: Encoding<HashSet<IVec>> + Encoding<DateTime<Utc>> + 'static,
    F: Encoding<V> + 'static,  type Item = Result<(IVec, V)>;

pub fn range<'a, K, R>(&'a self, range: R) -> ExpiringIter<'a, V, E, F> where
    K: AsRef<[u8]>,
    R: RangeBounds<K>, 

Create a double-ended iterator over tuples of keys and values, where the keys fall within the specified range.

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

Retrieve the key and value before the provided key, if one exists.

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

Retrieve the next key and value from the Tree after the provided key.

Note

The order follows the Ord implementation for Vec:

[] < [0] < [255] < [255, 0] < [255, 255] ...

To retain the ordering of numerical types use big endian reprensentation

Important traits for ExpiringIter<'a, V, E, F>

impl<'a, V, E, F> Iterator for ExpiringIter<'a, V, E, F> where
    E: Encoding<HashSet<IVec>> + Encoding<DateTime<Utc>> + 'static,
    F: Encoding<V> + 'static,  type Item = Result<(IVec, V)>;

pub fn scan_prefix<'a, P>(&'a self, prefix: P) -> ExpiringIter<'a, V, E, F> where
    P: AsRef<[u8]>, 

Create an iterator over tuples of keys and values, where the all the keys starts with the given prefix.

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

Atomically removes the maximum item in the Tree instance.

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

Atomically removes the minimum item in the Tree instance.

pub fn len(&self) -> usize

Returns the number of elements in this tree.

Beware: performs a full O(n) scan under the hood.

pub fn is_empty(&self) -> bool

Returns true if the Tree contains no elements.

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

Clears the Tree, removing all values.

Note that this is not atomic.

pub fn name(&self) -> String

Returns the name of the tree.

pub fn expired<'a>(&'a self) -> impl 'a + Iterator<Item = IVec>

Create an iterator over the keys of expired records

Trait Implementations

impl<V: Clone, E: Clone, F: Clone> Clone for ExpiringTree<V, E, F>

fn clone(&self) -> ExpiringTree<V, E, F>

Returns a copy of the value.

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

Performs copy-assignment from source.