-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_triestruct.py
63 lines (53 loc) · 1.89 KB
/
test_triestruct.py
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
import pytest
import TrieStruct
def test_insert_single():
"""
Test of the structure, when a single element is inserted
"""
trie = TrieStruct.Trie()
trie.insert_multiple_words(["1234"])
assert len(trie.get_all_words()) == 1
def test_insert_list():
"""
Test of the structure, when a collection of elements is inserted
"""
trie = TrieStruct.Trie()
trie.insert_multiple_words(["1234", "5678", "345287"])
assert len(trie.get_all_words()) == 3
def test_get_words_with_prefixes():
"""
Test of the get words with prefix method
"""
trie = TrieStruct.Trie()
trie.insert_multiple_words(["0902123456", "0902123897", "09023452",
"09026745362", "76453", "98763"])
prefix_words = trie.get_all_words_with_prefix("0902123")
assert len(prefix_words) == 2
def test_count_unique_nodes():
"""
Test of the count_unique_nodes method
"""
trie = TrieStruct.Trie()
trie.insert_multiple_words(["1234"])
assert trie.count_unique_nodes() == 4
trie.insert_multiple_words(["1235"])
assert trie.count_unique_nodes() == 5
trie.insert_multiple_words(["12345"])
assert trie.count_unique_nodes() == 6
trie.insert_multiple_words(["234"])
assert trie.count_unique_nodes() == 9
def test_get_unique_nodes():
"""
Test of the get_unique_nodes method
"""
trie = TrieStruct.Trie()
trie.insert_multiple_words(["1234"])
assert len(trie.get_unique_nodes()) == 4
trie.insert_multiple_words(["1235"])
assert len(trie.get_unique_nodes()) == 5
trie.insert_multiple_words(["12345"])
assert len(trie.get_unique_nodes()) == 6
trie.insert_multiple_words(["234"])
assert len(trie.get_unique_nodes()) == 9
assert sorted(trie.get_unique_nodes()) == sorted(
["1", "2", "3", "4", "5", "5", "2", "3", "4"])