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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
extern crate unicode_segmentation;

use std::collections::HashMap;

use unicode_segmentation::{UnicodeSegmentation, Graphemes};

#[derive(Debug)]
pub struct Trie<T> {
    root: Option<Node<T>>
}

#[derive(Debug)]
struct Node<T> {
    data: Option<T>,
    children: HashMap<String, Node<T>>
}

impl<T> Trie<T> {
    pub fn new() -> Self {
        Trie {
            root: None
        }
    }

    pub fn get(&self, key: &str) -> Option<&T> {
        match self.root {
            None => None,
            Some(ref root) => {
                let mut key_parts = UnicodeSegmentation::graphemes(key, true);
                root.get(key_parts)
            }
        }
    }

    pub fn add(&mut self, key: &str, value: T) -> Option<T> {
        if self.root.is_none() {
            self.root = Some(Node::new());
        }

        let mut key_parts = UnicodeSegmentation::graphemes(key, true);

        match self.root {
            None => unreachable!(),
            Some(ref mut root) => root.add(key_parts, value)
        }
    }
}

impl<T> Node<T> {

    fn new() -> Self {
        Node {
            data: None,
            children: HashMap::new()
        }
    }

    fn get_child_or_new(&mut self, char: &str) -> &mut Self {
        if ! self.children.contains_key(char) {
            self.children.insert(char.into(), Node::new());
        }
        self.children.get_mut(char).expect("Just Checked for this above")
    }

    fn add(&mut self, mut key_iter: Graphemes, data: T) -> Option<T> {
        match key_iter.next() {
            // this is a new data node
            None => {
                let old_data = self.data.take();
                self.data = Some(data);
                old_data
            }
            Some(char) => {
                let mut child = self.get_child_or_new(char);
                child.add(key_iter, data)
            }
        }
    }

    fn get(&self, mut key_iter: Graphemes) -> Option<&T> {
        match key_iter.next() {
            None => self.data.as_ref(),
            Some(char) => {
                match self.children.get(char) {
                    None => None,
                    Some(ch) => {
                        ch.get(key_iter)
                    }
                }
            }
        }
    }

}