-
Notifications
You must be signed in to change notification settings - Fork 160
/
trie.jl
186 lines (158 loc) · 4.9 KB
/
trie.jl
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
##################
# Trie #
##################
struct Trie{K,V}
leaf_nodes::Dict{K,V}
internal_nodes::Dict{K,Trie{K,V}}
end
Trie{K,V}() where {K,V} = Trie(Dict{K,V}(), Dict{K,Trie{K,V}}())
# copy constructor for something supported read-only trie interface
function Trie(other)
trie = Trie{Any,Any}()
for (key, value) in get_leaf_nodes(other)
set_leaf_node!(trie, key, value)
end
for (key, node) in get_internal_nodes(other)
sub_trie = Trie(node)
set_internal_node!(trie, key, sub_trie)
end
trie
end
# TODO come up with a better printing method (and something nice for Jupyter
# notebooks)
import JSON
Base.println(trie::Trie) = JSON.print(trie, 4)
# invariant: all internal nodes are nonempty
Base.isempty(trie::Trie) = isempty(trie.leaf_nodes) && isempty(trie.internal_nodes)
get_leaf_nodes(trie::Trie) = trie.leaf_nodes
get_internal_nodes(trie::Trie) = trie.internal_nodes
function Base.values(trie::Trie)
iterators = convert(Vector{Any}, collect(map(values, values(trie.internal_nodes))))
push!(iterators, values(trie.leaf_nodes))
Iterators.flatten(iterators)
end
function has_internal_node(trie::Trie, addr)
haskey(trie.internal_nodes, addr)
end
function has_internal_node(trie::Trie, addr::Pair)
(first, rest) = addr
if haskey(trie.internal_nodes, first)
has_internal_node(trie.internal_nodes[first], rest)
else
false
end
end
function get_internal_node(trie::Trie, addr)
trie.internal_nodes[addr]
end
function get_internal_node(trie::Trie, addr::Pair)
(first, rest) = addr
if haskey(trie.internal_nodes, first)
get_internal_node(trie.internal_nodes[first], rest)
else
throw(KeyError(trie, addr))
end
end
function set_internal_node!(trie::Trie{K,V}, addr, new_node::Trie{K,V}) where {K,V}
if !isempty(new_node)
trie.internal_nodes[addr] = new_node
end
end
function set_internal_node!(trie::Trie{K,V}, addr::Pair, new_node::Trie{K,V}) where {K,V}
(first, rest) = addr
if haskey(trie.internal_nodes, first)
node = trie.internal_nodes[first]
else
node = Trie{K,V}()
trie.internal_nodes[first] = node
end
set_internal_node!(node, rest, new_node)
end
function delete_internal_node!(trie::Trie, addr)
delete!(trie.internal_nodes, addr)
return isempty(trie.leaf_nodes) && isempty(trie.internal_nodes)
end
function delete_internal_node!(trie::Trie, addr::Pair)
(first, rest) = addr
if haskey(trie.internal_nodes, first)
node = trie.internal_nodes[first]
if delete_internal_node!(node, rest, new_node)
delete!(trie.internal_nodes, first)
end
end
return isempty(trie.leaf_nodes) && isempty(trie.internal_nodes)
end
function has_leaf_node(trie::Trie, addr)
haskey(trie.leaf_nodes, addr)
end
function has_leaf_node(trie::Trie, addr::Pair)
(first, rest) = addr
if haskey(trie.internal_nodes, first)
has_leaf_node(trie.internal_nodes[first], rest)
else
false
end
end
function get_leaf_node(trie::Trie, addr)
trie.leaf_nodes[addr]
end
function get_leaf_node(trie::Trie, addr::Pair)
(first, rest) = addr
if haskey(trie.internal_nodes, first)
get_leaf_node(trie.internal_nodes[first], rest)
else
throw(KeyError(trie, addr))
end
end
function set_leaf_node!(trie::Trie, addr, value)
trie.leaf_nodes[addr] = value
end
function set_leaf_node!(trie::Trie{K,V}, addr::Pair, value) where {K,V}
(first, rest) = addr
if haskey(trie.internal_nodes, first)
node = trie.internal_nodes[first]
else
node = Trie{K,V}()
trie.internal_nodes[first] = node
end
node = trie.internal_nodes[first]
set_leaf_node!(node, rest, value)
end
function delete_leaf_node!(trie::Trie, addr)
delete!(trie.leaf_nodes, addr)
return isempty(trie.leaf_nodes) && isempty(trie.internal_nodes)
end
function delete_leaf_node!(trie::Trie, addr::Pair)
(first, rest) = addr
if haskey(trie.internal_nodes[first])
node = trie.internal_nodes[first]
if delete_leaf_node!(node, rest)
delete!(trie.internal_nodes, first)
end
end
return isempty(trie.leaf_nodes) && isempty(trie.internal_nodes)
end
Base.setindex!(trie::Trie, value, addr) = set_leaf_node!(trie, addr, value)
function Base.merge!(a::Trie{K,V}, b::Trie{K,V}) where {K,V}
merge!(a.leaf_nodes, b.leaf_nodes)
for (key, a_sub) in a.sub
if haskey(b.sub, key)
b_sub = b.sub[key]
merge!(a_sub, b_sub)
end
end
for (key, b_sub) in b.sub
if !haskey(a.sub, key)
a.sub[key] = b_sub
end
end
a
end
get_address_schema(::Trie) = DynamicSchema()
Base.haskey(trie::Trie, key) = has_leaf_node(trie, key)
Base.getindex(trie::Trie, key) = get_leaf_node(trie, key)
export Trie
export set_internal_node!
export delete_internal_node!
export set_leaf_node!
export delete_leaf_node!