rjango 0.1.1

A full-stack Rust backend framework inspired by Django
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

/// Simple tree data structure for nested menus/categories.
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct TreeNode<T> {
    pub value: T,
    pub children: Vec<TreeNode<T>>,
}

impl<T> TreeNode<T> {
    #[must_use]
    pub fn new(value: T) -> Self {
        Self {
            value,
            children: Vec::new(),
        }
    }

    pub fn add_child(&mut self, child: TreeNode<T>) {
        self.children.push(child);
    }

    #[must_use]
    pub fn is_leaf(&self) -> bool {
        self.children.is_empty()
    }

    #[must_use]
    pub fn depth(&self) -> usize {
        if self.children.is_empty() {
            0
        } else {
            1 + self.children.iter().map(TreeNode::depth).max().unwrap_or(0)
        }
    }
}

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

    #[test]
    fn new_nodes_start_as_leaves() {
        let node = TreeNode::new("root");

        assert!(node.is_leaf());
        assert_eq!(node.depth(), 0);
    }

    #[test]
    fn add_child_makes_node_non_leaf() {
        let mut node = TreeNode::new("root");
        node.add_child(TreeNode::new("child"));

        assert!(!node.is_leaf());
        assert_eq!(node.children.len(), 1);
    }

    #[test]
    fn depth_tracks_longest_branch() {
        let mut root = TreeNode::new("root");
        let mut child = TreeNode::new("child");
        child.add_child(TreeNode::new("grandchild"));
        root.add_child(child);
        root.add_child(TreeNode::new("sibling"));

        assert_eq!(root.depth(), 2);
    }
}