this repo has no description
Remove dead code
-23
-23
lib/btree/writer.ex
-23
lib/btree/writer.ex
···
179
179
Page.encode_page_from_pairs(page_type, btree.opts.page_size, pairs, page_ek)
180
180
end
181
181
182
-
defp fill_inner(%BTree{} = btree, pairs, page_sk, page_ek, writes_acc) do
183
-
case :ets.first(btree.write_buffer) do
184
-
key when is_binary(key) and key < page_ek ->
185
-
{child_sk, child_ek, child_address} = find_child(pairs, key, page_sk)
186
-
<<child_index::integer-64, child_checksum::binary-16>> = child_address
187
-
188
-
writes = do_flush(btree, child_index, child_checksum, child_sk, child_ek)
189
-
writes_acc = Enum.reverse(writes, writes_acc)
190
-
# TODO: free(child_index)
191
-
fill_inner(btree, pairs, page_sk, page_ek, writes_acc)
192
-
193
-
_ ->
194
-
Enum.reduce(writes_acc, pairs, fn {k, v}, acc -> BTree.write_pair(acc, k, v) end)
195
-
end
196
-
end
197
-
198
-
defp find_child([{k, v} | pairs_rest], search_key, last_ek) do
199
-
case search_key < k do
200
-
true -> {last_ek, k, v}
201
-
false -> find_child(pairs_rest, search_key, k)
202
-
end
203
-
end
204
-
205
182
defp fill_leaf(write_buffer, page_ek, pairs_acc) do
206
183
case :ets.first_lookup(write_buffer) do
207
184
{_key, [{key, value}]} when key < page_ek ->