Crate sled

source ·
Expand description

sled is a flash-sympathetic persistent lock-free B+ tree.

Examples

let t = sled::Db::start_default("my_db").unwrap();

t.set(b"yo!", b"v1".to_vec());
assert!(t.get(b"yo!").unwrap().unwrap() == &*b"v1".to_vec());

t.cas(
    b"yo!",                // key
    Some(b"v1"),           // old value, None for not present
    Some(b"v2".to_vec()),  // new value, None for delete
).unwrap();

let mut iter = t.scan(b"a non-present key before yo!");
// assert_eq!(iter.next(), Some(Ok((b"yo!".to_vec(), b"v2".to_vec()))));
// assert_eq!(iter.next(), None);

t.del(b"yo!");
assert_eq!(t.get(b"yo!"), Ok(None));

Structs

A finalized ConfigBuilder that can be use multiple times to open a Tree or Log.
Top-level configuration for the system.
The sled embedded database!
An iterator over keys and values in a Tree.
An iterator over keys in a Tree
A simple map that can be used to store metadata for the pagecache tenant.
A reference to a heap location that is guaranteed to be valid for as long as this value exists.
A subscriber listening on a specified prefix
A flash-sympathetic persistent lock-free B+ tree
An iterator over values in a Tree

Enums

An Error type encapsulating various issues that may come up in both the expected and unexpected operation of a PageCache.
An event that happened to a key that a subscriber is interested in.

Type Definitions

The top-level result type for dealing with the PageCache.