eldek-tad 0.9.1

A project for learning Abstract Data Types (ADTs) in Rust. Heavily inspired by Java's 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

#[cfg(test)]
mod test{
    use crate::{linked_list::traits::linked_list_traits::LinkedListTrait, prefix_tree::{prefix_tree::PrefixTree, traits::prefix_tree_trait::PrefixTreeTrait}};

    #[test]
    fn search() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['h', 'e', 'l', 'l', 'o']);
        assert!(tree.search(vec!['h', 'e', 'l', 'l', 'o']));
    }

    #[test]
    fn search_string() {
        let mut tree:PrefixTree<char> = PrefixTree::new();
        tree.insert_string("hello");
        assert!(tree.search_string("hello"));
    }

    #[test]
    fn search_not_inserted() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['h', 'e', 'l', 'l', 'o']);
        assert!(!tree.search(vec!['h', 'e', 'l', 'l']));
    }

    #[test]
    fn search_empty_tree() {
        let tree: PrefixTree<char> = PrefixTree::new();
        assert!(!tree.search(vec!['a']));
    }

    #[test]
    fn insert_multiple_search_all() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['c', 'a', 't']);
        tree.insert(vec!['c', 'a', 'r']);
        tree.insert(vec!['d', 'o', 'g']);
        assert!(tree.search(vec!['c', 'a', 't']));
        assert!(tree.search(vec!['c', 'a', 'r']));
        assert!(tree.search(vec!['d', 'o', 'g']));
    }

    #[test]
    fn search_prefix_of_inserted() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['c', 'a', 't']);
        assert!(!tree.search(vec!['c', 'a']));
    }

    #[test]
    fn insert_empty_sequence() {
        let mut tree: PrefixTree<char> = PrefixTree::new();
        tree.insert(vec![]);
        assert!(tree.search(vec![]));
    }

    #[test]
    fn remove(){
        let mut tree= PrefixTree::new();
        tree.insert(vec![1, 2, 3]);
        tree.remove(vec![1, 2, 3]);
        assert!(!tree.search(vec![1, 2, 3]));
        assert_eq!(0, tree.size());
    }

    #[test]
    fn remove_string(){
        let mut tree:PrefixTree<char>= PrefixTree::new();
        tree.insert_string("Howdy");
        tree.remove_string("Howdy");
        assert_eq!(false, tree.search_string("Howdy"));
        assert_eq!(0, tree.size());
    }

    #[test]
    fn remove_failed(){
        let mut tree= PrefixTree::new();
        tree.insert(vec![1, 2, 3]);
        tree.remove(vec![1, 2, 4]);
        assert!(tree.search(vec![1, 2, 3]));
        assert_eq!(1, tree.size());
    }

    #[test]
    fn autocomplete_no_match() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['c', 'a', 't']);
        let results = tree.autocomplete(vec!['d']);
        assert_eq!(results.size(), 0);
    }

    #[test]
    fn autocomplete_exact_match() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['c', 'a', 't']);
        let results = tree.autocomplete(vec!['c', 'a', 't']);
        assert_eq!(results.size(), 1);
    }

    #[test]
    fn autocomplete_empty_prefix_returns_all() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['a']);
        tree.insert(vec!['b']);
        tree.insert(vec!['c']);
        let results = tree.autocomplete(vec![]);
        assert_eq!(results.size(), 3);
    }

    #[test]
    fn autocomplete_empty_tree() {
        let tree: PrefixTree<char> = PrefixTree::new();
        let results = tree.autocomplete(vec!['a']);
        assert_eq!(results.size(), 0);
    }

    #[test]
    fn autocomplete_count() {
        let mut tree = PrefixTree::new();
        tree.insert(vec!['c', 'a', 't']);
        tree.insert(vec!['c', 'a', 'r']);
        tree.insert(vec!['c', 'a', 'r', 'g', 'o']);
        let results = tree.autocomplete(vec!['c', 'a']);
        assert_eq!(results.size(), 3);
    }

    #[test]
    fn autocomplete_string() {
        let mut tree:PrefixTree<char> = PrefixTree::new();
        tree.insert_string("cat");
        tree.insert_string("car");
        tree.insert_string("cargo");
        let results = tree.autocomplete_string("ca");
        assert_eq!(true, results.contains(&String::from("cat")));
        assert_eq!(true, results.contains(&String::from("car")));
        assert_eq!(true, results.contains(&String::from("cargo")));
        assert_eq!(results.size(), 3);
    }
}