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

Build more efficiently

Browse source 
Don’t use ++ to build the tree
This commit is contained in:
Martin Sumner 2017-01-21 01:48:38 +00:00
parent 51f0402292
commit 4846272393
1 changed files with 4 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

8
src/leveled_tree.erl
View file

@ -26,7 +26,7 @@
-include_lib("eunit/include/eunit.hrl"). -include_lib("eunit/include/eunit.hrl").
-define(SKIP_WIDTH, 32). -define(SKIP_WIDTH, 16).
%%%============================================================================ %%%============================================================================
@ -99,12 +99,12 @@ empty() ->
from_orderedlist([], TmpList, _L) -> from_orderedlist([], TmpList, _L) ->
gb_trees:from_orddict(TmpList); gb_trees:from_orddict(lists:reverse(TmpList));
from_orderedlist(OrdList, TmpList, L) -> from_orderedlist(OrdList, TmpList, L) ->
SubLL = min(?SKIP_WIDTH, L), SubLL = min(?SKIP_WIDTH, L),
{Head, Tail} = lists:split(SubLL, OrdList), {Head, Tail} = lists:split(SubLL, OrdList),
{LastK, _LastV} = lists:last(Head), {LastK, _LastV} = lists:last(Head),
from_orderedlist(Tail, TmpList ++ [{LastK, Head}], L - SubLL). from_orderedlist(Tail, [{LastK, Head}|TmpList], L - SubLL).
lookup_match(_Key, []) -> lookup_match(_Key, []) ->
none; none;
@ -276,7 +276,7 @@ tree_search_test() ->
tree_test() -> tree_test() ->
N = 2000, N = 4000,
KL = lists:ukeysort(1, generate_randomkeys(1, N, 1, N div 5)), KL = lists:ukeysort(1, generate_randomkeys(1, N, 1, N div 5)),
OS = ets:new(test, [ordered_set, private]), OS = ets:new(test, [ordered_set, private]),