typed-sled 0.2.3

Sled with types instead of bytes.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69

//! Convert one typed [Tree][crate::Tree] into another.
//! # Example
//! ```
//! pub fn main() -> Result<(), Box<dyn std::error::Error>> {
//!  let db = sled::Config::new().temporary(true).open().unwrap();
//!
//!  {
//!      let old_tree: Tree<u32, u32> = Tree::open(&db, "test_tree");
//!
//!      old_tree.insert(&1, &2)?;
//!      old_tree.insert(&3, &4)?;
//!      old_tree.flush()?;
//!  }
//!
//!  convert::<u32, u32, u64, u64>(&db, "test_tree");
//!  let tree: Tree<u64, u64> = Tree::open(&db, "test_tree");
//!  assert_eq!(tree.get(&1)?.unwrap(), 2);
//!  assert_eq!(tree.get(&3)?.unwrap(), 4);
//! Ok(()) }
//! ```
use crate::custom_serde::serialize::{Key, Value};
use crate::custom_serde::Tree;
use std::convert::Into;

/// Convert `Tree<KOld, VOld, SerDeOld>` to `Tree<KNew, VNew, SerDeNew>`
pub fn convert<KOld, VOld, KNew, VNew, SerDeOld, SerDeNew>(db: &sled::Db, tree: &str)
where
    Key<KOld, VOld, SerDeOld>: Into<KNew>,
    Value<KOld, VOld, SerDeOld>: Into<VNew>,
    SerDeOld: crate::custom_serde::serialize::SerDe<KOld, VOld>,
    SerDeNew: crate::custom_serde::serialize::SerDe<KNew, VNew>,
{
    let mut kvs = Vec::new();

    {
        let tree: Tree<KOld, VOld, SerDeOld> = Tree::open(db, tree);

        for kv_pair in tree.iter() {
            kvs.push(kv_pair.unwrap());
        }
    }

    db.drop_tree(tree).unwrap();
    let tree: Tree<KNew, VNew, SerDeNew> = Tree::open(db, tree);

    for kv_pair in kvs.drain(..) {
        tree.insert(&kv_pair.0.into(), &kv_pair.1.into()).unwrap();
    }
}

#[test]
fn test_convert() {
    use super::serialize::BincodeSerDe;
    let config = sled::Config::new().temporary(true);
    let db = config.open().unwrap();

    {
        let old_tree: Tree<u32, u32, BincodeSerDe> = Tree::open(&db, "test_tree");

        old_tree.insert(&1, &2).unwrap();
        old_tree.insert(&3, &4).unwrap();
        old_tree.flush().unwrap();
    }

    convert::<u32, u32, u64, u64, BincodeSerDe, BincodeSerDe>(&db, "test_tree");
    let tree: Tree<u64, u64, BincodeSerDe> = Tree::open(&db, "test_tree");
    assert_eq!(tree.get(&1).unwrap().unwrap(), 2);
    assert_eq!(tree.get(&3).unwrap().unwrap(), 4);
}