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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
defmodule SData.MerkleSearchTree do
@moduledoc"""
A Merkle search tree.
A node of the tree is
{
level,
hash_of_node | nil,
[
{ k_low_bound, v, hash_of_node | nil },
{ k_low_bound, v, hash_of_node | nil },
...
}
}
"""
defstruct [:root, :store]
def new() do
%SData.MerkleSearchTree{
root: nil,
store: %{}
}
end
def insert(state, key, value) do
level = calc_level(key)
{hash, store} = insert_at(state.store, state.root, key, level, value)
%{ state | root: hash, store: store }
end
def remove(_state, _key) do
# TODO
end
defp insert_at(store, root, key, level, value) do
{new_page, store} = if root == nil do
{ { level, nil, [ { key, value, nil } ] }, store }
else
{ plevel, low, lst } = store[root]
[ { k0, _, _} | _ ] = lst
cond do
plevel < level ->
{low, high, store} = split(store, root, key)
{ { level, low, [ { key, value, high } ] }, store }
plevel == level ->
store = Map.delete(store, root)
if key < k0 do
{low2a, low2b, store} = split(store, low, key)
{ { level, low2a, [ { key, value, low2b } | lst] }, store }
else
{new_lst, store} = aux_insert_after_first(store, lst, key, value)
{ { plevel, low, new_lst }, store }
end
plevel > level ->
store = Map.delete(store, root)
if key < k0 do
{new_low, store} = insert_at(store, low, key, level, value)
{ { plevel, new_low, lst }, store }
else
{new_lst, store} = aux_insert_sub_after_first(store, lst, key, level, value)
{ { plevel, low, new_lst }, store }
end
end
end
hash = SData.term_hash new_page
store = Map.put(store, hash, new_page)
{ hash, store }
end
defp split(store, hash, key) do
if hash == nil do
{nil, nil, store}
else
{ level, low, lst } = store[hash]
store = Map.delete(store, hash)
[ { k0, _, _} | _ ] = lst
cond do
key < k0 ->
{lowlow, lowhi, store} = split(store, low, key)
newp2 = { level, lowhi, lst }
newp2h = SData.term_hash newp2
store = Map.put(store, newp2h, newp2)
{lowlow, newp2h, store}
key > k0 ->
{lst1, p2, store} = split_aux(store, lst, key, level)
newp1 = {level, low, lst1}
newp1h = SData.term_hash newp1
store = Map.put(store, newp1h, newp1)
{newp1h, p2, store}
end
end
end
defp split_aux(store, lst, key, level) do
case lst do
[ {k1, _, _} | _ ] when k1 == key ->
raise "Bad logic"
[ {k1, v1, r1} ] ->
{r1l, r1h, store} = split(store, r1, key)
{ [{k1, v1, r1l}], r1h, store }
[ {k1, v1, r1}, {k2, v2, r2} | rst ] when key < k2->
{r1l, r1h, store} = split(store, r1, key)
p2 = { level, r1h, [ {k2, v2, r2} | rst ] }
p2h = SData.term_hash p2
store = store
|> Map.put(p2h, p2)
{ [{k1, v1, r1l}], p2h, store }
[ fst | rst ] ->
{rst2, hi, store} = split_aux(store, rst, key, level)
{ [ fst | rst2 ], hi, store }
end
end
defp aux_insert_after_first(store, lst, key, value) do
case lst do
[ {k1, _old_value, r1} | rst ] when k1 == key ->
{ [ {k1, value, r1} | rst ], store }
[ {k1, v1, r1} ] ->
{r1a, r1b, new_store} = split(store, r1, key)
{ [ {k1, v1, r1a}, {key, value, r1b} ], new_store }
[ {k1, v1, r1}, {k2, v2, r2} | rst ] when key < k2->
{r1a, r1b, new_store} = split(store, r1, key)
{ [ {k1, v1, r1a}, {key, value, r1b}, {k2, v2, r2} | rst ], new_store }
[ fst | rst ] ->
{rst2, new_store} = aux_insert_after_first(store, rst, key, value)
{ [ fst | rst2 ], new_store }
end
end
defp aux_insert_sub_after_first(store, lst, key, level, value) do
case lst do
[ {k1, _, _} | _ ] when k1 == key ->
raise "Bad logic"
[ {k1, v1, r1} ] ->
{r1new, store_new} = insert_at(store, r1, key, level, value)
{ [{k1, v1, r1new}], store_new }
[ {k1, v1, r1}, {k2, v2, r2} | rst ] when key < k2->
{r1new, store_new} = insert_at(store, r1, key, level, value)
{ [{k1, v1, r1new}, {k2, v2, r2} | rst], store_new }
[ fst | rst ] ->
{rst2, new_store} = aux_insert_sub_after_first(store, rst, key, level, value)
{ [ fst | rst2 ], new_store }
end
end
def get(state, key) do
get(state.store, state.root, key)
end
defp get(store, root, key) do
case root do
nil -> nil
_ ->
{ _, low, lst } = store[root]
get_aux(store, low, lst, key)
end
end
defp get_aux(store, low, lst, key) do
case lst do
[] ->
get(store, low, key)
[ {k, v, _} | _ ] when key == k ->
v
[ {k, _, _} | _ ] when key < k ->
get(store, low, key)
[ {k, _, low2} | rst ] when key > k ->
get_aux(store, low2, rst, key)
end
end
def dump(state) do
dump(state.store, state.root, "")
end
defp dump(store, root, lvl) do
case root do
nil ->
IO.puts(lvl <> "nil")
_ ->
{ level, low, lst} = store[root]
IO.puts(lvl <> "#{root|>Base.encode16} (#{level})")
dump(store, low, lvl <> " ")
for {k, v, r} <- lst do
IO.puts(lvl<>"- #{inspect k} => #{inspect v}")
dump(store, r, lvl <> " ")
end
end
end
defp calc_level(key) do
key
|> SData.term_hash
|> Base.encode16
|> String.to_charlist
|> count_leading_zeroes
end
defp count_leading_zeroes('0' ++ rest) do
1 + count_leading_zeroes(rest)
end
defp count_leading_zeroes(_) do
0
end
end
|
