this repo has no description
Remove dead code
-16
-16
lib/btree/iterator.ex
-16
lib/btree/iterator.ex
···
172
172
end
173
173
end
174
174
175
-
defp seek_inner([], _search_key, _i), do: assert false
176
-
defp seek_inner([{k, _v} = p | pairs_rest], search_key, i) do
177
-
case search_key < k do
178
-
true -> {i, p}
179
-
false -> seek_inner(pairs_rest, search_key, i + 1)
180
-
end
181
-
end
182
-
183
-
defp seek_leaf([], _search_key, _i), do: :not_found
184
-
defp seek_leaf([{k, _v} = p | pairs_rest], search_key, i) do
185
-
case k >= search_key do
186
-
true -> {i, p}
187
-
false -> seek_leaf(pairs_rest, search_key, i + 1)
188
-
end
189
-
end
190
-
191
175
defp next_forward(%Iterator{} = it) do
192
176
%{
193
177
current_page: current_page,