easy-trie 0.1.1

A simple trie implementation in Rust
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

use std::collections::HashMap;

#[derive(Default, Debug)]
pub struct TrieNode {
    pub(crate) is_end_of_word: bool,
    pub(crate) children: HashMap<char, TrieNode>
}

impl TrieNode {

    /**
     * Calculates the length of the current node.
     * Defined as the sum of the length of all children nodes and of the current node.
     */
    pub fn len(&self) -> usize {
            let mut sum = self.children.len();
            for a in self.children.values() {
                sum += a.len();
            }
            return sum;
        
    }
}


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

    #[test]
    fn it_should_create_a_new_node() {
        let result = TrieNode::default();
        assert_eq!(result.is_end_of_word, false);
        assert_eq!(result.children.len(), 0);
    }

    #[test]
    fn it_should_have_correct_length() {
        let mut node = TrieNode::default();
        assert_eq!(node.len(), 0);
        let mut child = TrieNode::default();
        child.is_end_of_word = true; 
        node.children.insert('a', child);
        assert_eq!(node.len(), 1);
    }
}