radyx 1.0.0

A basic radix tree implementation
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153

use std::{collections::HashMap, fmt::Debug};

use crate::utils::longest_common_prefix;

#[derive(Debug)]
pub struct Radyx<'a, T: Debug> {
    nodes: HashMap<&'a str, Box<Radyx<'a, T>>>,
    val: Option<T>,
}

impl<'a, T: Debug> Radyx<'a, T> {
    /// Create a new node
    ///
    /// # Example
    ///
    /// ```
    /// use radyx::Radyx;
    ///
    /// let mut node: Radyx<String> = Radyx::new(String::from("Radyx"));
    /// ```
    pub fn new(val: T) -> Radyx<'a, T> {
        Radyx {
            nodes: HashMap::new(),
            val: Some(val),
        }
    }

    /// Create a new empty node
    ///
    /// # Example
    ///
    /// ```
    /// use radyx::Radyx;
    ///
    /// let mut node: Radyx<String> = Radyx::new_empty();
    /// ```
    pub fn new_empty() -> Radyx<'a, T> {
        Radyx {
            nodes: HashMap::new(),
            val: None,
        }
    }

    /// Insert new value to the node
    ///
    /// # Example
    ///
    /// ```
    /// use radyx::Radyx;
    ///
    /// let mut node: Radyx<String> = Radyx::new_empty();
    /// ```
    pub fn insert(&mut self, path: &'a str, val: T) {
        self.insert_node(path, Some(val));
    }

    pub fn get(&self, path: &'a str) -> Option<&T> {
        if self.nodes.is_empty() {
            return None;
        }

        for (key, node) in &self.nodes {
            if key == &path {
                if let Some(val) = &node.val {
                    return Some(val);
                }
            } else if let Some(stripped) = path.strip_prefix(key) {
                if !stripped.is_empty() && !key.is_empty() {
                    return node.get(stripped);
                }
            }
        }

        None
    }

    fn insert_node(&mut self, path: &'a str, val: Option<T>) {
        if self.nodes.is_empty() {
            if let Some(val) = val {
                self.nodes.insert(path, Box::new(Radyx::new(val)));
            } else {
                self.nodes.insert(path, Box::new(Radyx::new_empty()));
            }
            return;
        } else if path.is_empty() {
            self.val = val;
            return;
        }

        for (key, node) in &mut self.nodes {
            let splitting_index = match longest_common_prefix(path, key) {
                0 => continue,
                v => v,
            };

            if key == &path {
                node.val = val;
                return;
            }

            let key_length = key.len();
            let path_length = path.len();

            if key_length == splitting_index && path.starts_with(key) {
                return node.insert_node(&path[key_length..], val);
            }

            let (base_key, splitted_key) = if key_length == splitting_index {
                path.split_at(splitting_index)
            } else if path_length == splitting_index && key.starts_with(path) {
                key.split_at(path_length)
            } else {
                key.split_at(splitting_index)
            };

            self.split_node(base_key, splitted_key);
            return self.insert_node(path, val);
        }

        match val {
            Some(val) => self.nodes.insert(path, Box::new(Radyx::new(val))),
            None => self.nodes.insert(path, Box::new(Radyx::new_empty())),
        };
    }

    fn split_node(&mut self, base_key: &'a str, splitted_key: &'a str) {
        let node = self
            .nodes
            .remove(format!("{base_key}{splitted_key}").as_str())
            .unwrap();

        let mut main_node: Radyx<'_, T> = Radyx::new_empty();

        main_node.insert_node(splitted_key, node.val);
        main_node.fill_node(splitted_key, node.nodes);

        self.nodes.insert(base_key, Box::new(main_node));
    }

    fn fill_node(&mut self, splitted_key: &'a str, new_nodes: HashMap<&'a str, Box<Radyx<'a, T>>>) {
        let new_node = self.nodes.get_mut(splitted_key).unwrap();

        if new_node.nodes.is_empty() {
            new_node.nodes = new_nodes;
        }
    }
}

impl<T: Debug> Default for Radyx<'_, T> {
    fn default() -> Self {
        Self::new_empty()
    }
}