pi_ordmap 0.3.3

Ord Map
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
70
71
72
73
74
75
76
77
78
79
80
81

#![feature(specialization)]

use std::sync::Arc;

use pi_ordmap::{ordmap::{ImOrdMap, OrdMap},
                asbtree::{TreeByteSize, Tree}};

#[derive(Ord, PartialOrd, Eq, PartialEq, Debug)]
struct Binary(Arc<Vec<u8>>);

impl Clone for Binary {
    fn clone(&self) -> Self {
        Binary(self.0.clone())
    }
}

impl From<&str> for Binary {
    fn from(value: &str) -> Self {
        Binary(Arc::new(value.as_bytes().to_vec()))
    }
}

impl TreeByteSize for Binary {
    fn tree_bytes_size(&self) -> u64 {
        self.0.len() as u64
    }
}

#[test]
fn test_bytes_size_with_sbtree() {
    let mut tree: OrdMap<Tree<Binary, Binary>> = OrdMap::new(Tree::new());
    assert_eq!(tree.bytes_size(), 0);
    tree.insert("abc".into(), "abc".into());
    assert_eq!(tree.bytes_size(), 6);
    let r = tree.upsert("abc".into(), "abcabc".into(), true);
    assert!(r.is_some());
    assert_eq!(tree.bytes_size(), 9);
    let r = tree.upsert("abc".into(), "abc".into(), false);
    assert!(r.is_some());
    assert_eq!(tree.bytes_size(), 6);
    let r = tree.delete(&"abc".into(), false);
    assert!(r.is_some());
    assert_eq!(tree.bytes_size(), 0);

    //插入
    let mut bytes_size = 0;
    for index in 0..8192 {
        let key = "abc".repeat(index + 1);
        let value = "abc".repeat(index + 1);
        let _ = tree.upsert(key.as_str().into(), value.as_str().into(), false);
        bytes_size += Binary::from(key.as_str()).tree_bytes_size() + Binary::from(value.as_str()).tree_bytes_size();
        assert_eq!(tree.bytes_size(), bytes_size);
    }

    //更新
    let mut tmp_bytes_size = bytes_size;
    for index in 0..8192 {
        let key = "abc".repeat(index + 1);
        let value = "abc".to_string();
        let _ = tree.upsert(key.as_str().into(), value.as_str().into(), false);
        tmp_bytes_size -= Binary::from(key.as_str()).tree_bytes_size() - 3;
        assert_eq!(tree.bytes_size(), tmp_bytes_size);
    }
    for index in (0..8192).rev() {
        let key = "abc".repeat(index + 1);
        let value = "abc".repeat(index + 1);
        let _ = tree.upsert(key.as_str().into(), value.as_str().into(), false);
        tmp_bytes_size += Binary::from(value.as_str()).tree_bytes_size() - 3;
        assert_eq!(tree.bytes_size(), tmp_bytes_size);
    }

    //删除
    for index in (0..8192).rev() {
        let key = "abc".repeat(index + 1);
        let value = "abc".repeat(index + 1);
        let r = tree.delete(&key.as_str().into(), false);
        assert!(r.is_some());
        bytes_size -= Binary::from(key.as_str()).tree_bytes_size() + Binary::from(value.as_str()).tree_bytes_size();
        assert_eq!(tree.bytes_size(), bytes_size);
    }
}