Experiment converting CDB to use skiplist not gb_tree
Might insertion time be faster?
This commit is contained in:
parent
a3f60e3609
commit
626a8e63f9
4 changed files with 166 additions and 63 deletions
|
@ -1283,7 +1283,7 @@ confirm_delete_test() ->
|
|||
|
||||
|
||||
maybe_pause_push(PCL, KL) ->
|
||||
T0 = leveled_skiplist:empty(),
|
||||
T0 = leveled_skiplist:empty(true),
|
||||
T1 = lists:foldl(fun({K, V}, Acc) -> leveled_skiplist:enter(K, V, Acc) end,
|
||||
T0,
|
||||
KL),
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue