Total Complexity | 4 |
Total Lines | 28 |
Duplicated Lines | 0 % |
Changes | 2 | ||
Bugs | 0 | Features | 1 |
1 | import unittest |
||
6 | class TernarySearchTrieUnitTest(unittest.TestCase): |
||
7 | |||
8 | def test_trie(self): |
||
9 | trie = TernarySearchTrie() |
||
10 | |||
11 | trie.put("Hello", "World") |
||
12 | trie.put("Hi", "There") |
||
13 | |||
14 | self.assertEqual(trie.size(), 2) |
||
15 | self.assertFalse(trie.is_empty()) |
||
16 | |||
17 | self.assertEqual(trie.get("Hello"), "World") |
||
18 | self.assertEqual(trie.get("Hi"), "There") |
||
19 | self.assertEqual(trie.get("none"), None) |
||
20 | |||
21 | for i in range(20): |
||
22 | trie.put(str(i), i) |
||
23 | for i in range(20): |
||
24 | self.assertTrue(trie.contains_key(str(i))) |
||
25 | self.assertEqual(trie.get(str(i)), i) |
||
26 | |||
27 | self.assertEqual(trie.size(), 22) |
||
28 | trie.delete("Hi") |
||
29 | self.assertEqual(trie.size(), 21) |
||
30 | self.assertFalse(trie.contains_key("Hi")) |
||
31 | |||
32 | for key in trie.keys(): |
||
33 | print(key) |
||
34 | |||
38 |