umgeher/leveled
0
Fork 0
Code Issues Pull requests Releases Activity Actions

Remove unnecessary branch

Browse source
This commit is contained in:
martinsumner 2016-12-01 11:31:25 +00:00
parent dd0e9de050
commit 3ec144d33d
1 changed files with 5 additions and 10 deletions
Download patch file Download diff file Expand all files Collapse all files

7
src/leveled_skiplist.erl
View file

@ -173,16 +173,11 @@ from_list(KVL, Width, Level) ->
lookup(Key, SkipList, 1) -> lookup(Key, SkipList, 1) ->
SubList = get_sublist(Key, SkipList), SubList = get_sublist(Key, SkipList),
case SubList of
null ->
none;
SubList ->
case lists:keyfind(Key, 1, SubList) of case lists:keyfind(Key, 1, SubList) of
false -> false ->
none; none;
{Key, V} -> {Key, V} ->
{value, V} {value, V}
end
end; end;
lookup(Key, SkipList, Level) -> lookup(Key, SkipList, Level) ->
SubList = get_sublist(Key, SkipList), SubList = get_sublist(Key, SkipList),
@ -525,7 +520,7 @@ define_kv(X) ->
{X, {active, infinity}, null}}. {X, {active, infinity}, null}}.
skiplist_roundsize_test() -> skiplist_roundsize_test() ->
KVL = lists:map(fun(X) -> define_kv(X) end, lists:seq(1, 4000)), KVL = lists:map(fun(X) -> define_kv(X) end, lists:seq(1, 4096)),
SkipList = from_list(KVL), SkipList = from_list(KVL),
lists:foreach(fun({K, V}) -> lists:foreach(fun({K, V}) ->
?assertMatch({value, V}, lookup(K, SkipList)) end, ?assertMatch({value, V}, lookup(K, SkipList)) end,