prolly-map 0.3.0

Content-addressed versioned map storage primitives.
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

//! Tree structure for Prolly Trees

use serde::{Deserialize, Serialize};

use super::cid::Cid;
use super::config::Config;

/// A Prolly Tree handle
#[derive(Clone, Debug, PartialEq, Serialize, Deserialize)]
pub struct Tree {
    /// Root node CID (None if empty)
    pub root: Option<Cid>,
    /// Tree configuration
    pub config: Config,
}

impl Tree {
    /// Create a new empty tree with the given configuration
    pub fn new(config: Config) -> Self {
        Self { root: None, config }
    }

    /// Check if the tree is empty
    pub fn is_empty(&self) -> bool {
        self.root.is_none()
    }
}

impl Default for Tree {
    fn default() -> Self {
        Self::new(Config::default())
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_tree_new() {
        let tree = Tree::new(Config::default());
        assert!(tree.is_empty());
        assert!(tree.root.is_none());
    }

    #[test]
    fn test_tree_default() {
        let tree = Tree::default();
        assert!(tree.is_empty());
    }

    #[test]
    fn test_tree_with_root() {
        let cid = Cid::from_bytes(b"test");
        let tree = Tree {
            root: Some(cid.clone()),
            config: Config::default(),
        };
        assert!(!tree.is_empty());
        assert_eq!(tree.root, Some(cid));
    }
}