Struct sled::Tree

pub struct Tree { /* fields omitted */ }

A flash-sympathetic persistent lock-free B+ tree

Methods

impl Tree

pub fn start_default<P: AsRef<Path>>(path: P) -> Result<Tree, ()>

Load existing or create a new Tree with a default configuration.

pub fn start(config: Config) -> Result<Tree, ()>

Load existing or create a new Tree.

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

Flushes any pending IO buffers to disk to ensure durability.

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

Retrieve a value from the Tree if it exists.

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

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.

Examples

use sled::{ConfigBuilder, Error};
let config = ConfigBuilder::new().temporary(true).build();
let t = sled::Tree::start(config).unwrap();

// unique creation
assert_eq!(t.cas(&[1], None, Some(vec![1])), Ok(()));
// assert_eq!(t.cas(&[1], None, Some(vec![1])), Err(Error::CasFailed(Some(vec![1]))));

// conditional modification
assert_eq!(t.cas(&[1], Some(&*vec![1]), Some(vec![2])), Ok(()));
// assert_eq!(t.cas(&[1], Some(vec![1]), Some(vec![2])), Err(Error::CasFailed(Some(vec![2]))));

// conditional deletion
assert_eq!(t.cas(&[1], Some(&[2]), None), Ok(()));
assert_eq!(t.get(&[1]), Ok(None));

pub fn set<K: AsRef<[u8]>>(     &self,     key: K,     value: Vec<u8> ) -> Result<Option<PinnedValue>, ()>

Set a key to a new value, returning the old value if it was set.

pub fn merge<K: AsRef<[u8]>>(&self, key: K, value: Vec<u8>) -> Result<(), ()>

Merge a new value into the total state for a key.

Examples

fn concatenate_merge(
  _key: &[u8],               // the key being merged
  old_value: Option<&[u8]>,  // the previous value, if one existed
  merged_bytes: &[u8]        // the new bytes being merged in
) -> Option<Vec<u8>> {       // set the new value, return None to delete
  let mut ret = old_value
    .map(|ov| ov.to_vec())
    .unwrap_or_else(|| vec![]);

  ret.extend_from_slice(merged_bytes);

  Some(ret)
}

let config = sled::ConfigBuilder::new()
  .temporary(true)
  .merge_operator(concatenate_merge)
  .build();

let tree = sled::Tree::start(config).unwrap();

let k = b"k1";

tree.set(k, vec![0]);
tree.merge(k, vec![1]);
tree.merge(k, vec![2]);
// assert_eq!(tree.get(k).unwrap().unwrap(), vec![0, 1, 2]);

// sets replace previously merged data,
// bypassing the merge function.
tree.set(k, vec![3]);
// assert_eq!(tree.get(k), Ok(Some(vec![3])));

// merges on non-present values will add them
tree.del(k);
tree.merge(k, vec![4]);
// assert_eq!(tree.get(k).unwrap().unwrap(), vec![4]);

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

Delete a value, returning the last result if it existed.

Examples

let config = sled::ConfigBuilder::new().temporary(true).build();
let t = sled::Tree::start(config).unwrap();
t.set(&[1], vec![1]);
assert_eq!(t.del(&*vec![1]).unwrap().unwrap(), vec![1]);
assert_eq!(t.del(&*vec![1]), Ok(None));

Important traits for Iter<'a>

impl<'a> Iterator for Iter<'a> type Item = Result<(Vec<u8>, PinnedValue), ()>;

pub fn scan<K: AsRef<[u8]>>(&self, key: K) -> Iter

Iterate over tuples of keys and values, starting at the provided key.

Examples

let config = sled::ConfigBuilder::new().temporary(true).build();
let t = sled::Tree::start(config).unwrap();
t.set(&[1], vec![10]);
t.set(&[2], vec![20]);
t.set(&[3], vec![30]);
let mut iter = t.scan(&*vec![2]);
// assert_eq!(iter.next(), Some(Ok((vec![2], vec![20]))));
// assert_eq!(iter.next(), Some(Ok((vec![3], vec![30]))));
// assert_eq!(iter.next(), None);

Important traits for Iter<'a>

impl<'a> Iterator for Iter<'a> type Item = Result<(Vec<u8>, PinnedValue), ()>;

pub fn iter(&self) -> Iter

Iterate over the tuples of keys and values in this tree.

Examples

let config = sled::ConfigBuilder::new().temporary(true).build();
let t = sled::Tree::start(config).unwrap();
t.set(&[1], vec![10]);
t.set(&[2], vec![20]);
t.set(&[3], vec![30]);
let mut iter = t.iter();
// assert_eq!(iter.next(), Some(Ok((vec![1], vec![10]))));
// assert_eq!(iter.next(), Some(Ok((vec![2], vec![20]))));
// assert_eq!(iter.next(), Some(Ok((vec![3], vec![30]))));
// assert_eq!(iter.next(), None);

Trait Implementations

impl Clone for Tree

fn clone(&self) -> Tree

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Sync for Tree

impl<'a> IntoIterator for &'a Tree

type Item = Result<(Vec<u8>, PinnedValue), ()>

The type of the elements being iterated over.

type IntoIter = Iter<'a>

Which kind of iterator are we turning this into?

Important traits for Iter<'a>

impl<'a> Iterator for Iter<'a> type Item = Result<(Vec<u8>, PinnedValue), ()>;

fn into_iter(self) -> Iter<'a>

Creates an iterator from a value.

impl Send for Tree

impl Debug for Tree

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

Formats the value using the given formatter.