682191ce06
In some cases, inner nodes were not being emitted. This some times would cause queries (get / range_fold) to only include results in a right-most branch.
107 lines
3.6 KiB
Erlang
107 lines
3.6 KiB
Erlang
%% ----------------------------------------------------------------------------
|
|
%%
|
|
%% hanoi: LSM-trees (Log-Structured Merge Trees) Indexed Storage
|
|
%%
|
|
%% Copyright 2011-2012 (c) Trifork A/S. All Rights Reserved.
|
|
%% http://trifork.com/ info@trifork.com
|
|
%%
|
|
%% Copyright 2012 (c) Basho Technologies, Inc. All Rights Reserved.
|
|
%% http://basho.com/ info@basho.com
|
|
%%
|
|
%% This file is provided to you under the Apache License, Version 2.0 (the
|
|
%% "License"); you may not use this file except in compliance with the License.
|
|
%% You may obtain a copy of the License at
|
|
%%
|
|
%% http://www.apache.org/licenses/LICENSE-2.0
|
|
%%
|
|
%% Unless required by applicable law or agreed to in writing, software
|
|
%% distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
|
|
%% WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
|
|
%% License for the specific language governing permissions and limitations
|
|
%% under the License.
|
|
%%
|
|
%% ----------------------------------------------------------------------------
|
|
|
|
-module(hanoi_writer_tests).
|
|
|
|
-ifdef(TEST).
|
|
-include_lib("proper/include/proper.hrl").
|
|
-include_lib("eunit/include/eunit.hrl").
|
|
-endif.
|
|
|
|
-include("include/hanoi.hrl").
|
|
|
|
-compile(export_all).
|
|
|
|
simple_test() ->
|
|
|
|
file:delete("testdata"),
|
|
{ok, BT} = hanoi_writer:open("testdata"),
|
|
ok = hanoi_writer:add(BT, <<"A">>, <<"Avalue">>),
|
|
ok = hanoi_writer:add(BT, <<"B">>, <<"Bvalue">>),
|
|
ok = hanoi_writer:close(BT),
|
|
|
|
{ok, IN} = hanoi_reader:open("testdata"),
|
|
{ok, <<"Avalue">>} = hanoi_reader:lookup(IN, <<"A">>),
|
|
ok = hanoi_reader:close(IN),
|
|
|
|
ok = file:delete("testdata").
|
|
|
|
|
|
simple1_test() ->
|
|
|
|
file:delete("testdata"),
|
|
{ok, BT} = hanoi_writer:open("testdata", [{block_size, 1024}]),
|
|
|
|
Max = 1024,
|
|
Seq = lists:seq(0, Max),
|
|
|
|
{Time1,_} = timer:tc(
|
|
fun() ->
|
|
lists:foreach(
|
|
fun(Int) ->
|
|
ok = hanoi_writer:add(BT, <<Int:128>>, <<"valuevalue/", Int:128>>)
|
|
end,
|
|
Seq),
|
|
ok = hanoi_writer:close(BT)
|
|
end,
|
|
[]),
|
|
|
|
error_logger:info_msg("time to insert: ~p/sec~n", [1000000/(Time1/Max)]),
|
|
|
|
{ok, IN} = hanoi_reader:open("testdata"),
|
|
Middle = Max div 2,
|
|
{ok, <<"valuevalue/", Middle:128>>} = hanoi_reader:lookup(IN, <<Middle:128>>),
|
|
|
|
|
|
{Time2,Count} = timer:tc(
|
|
fun() -> hanoi_reader:fold(fun(Key, <<"valuevalue/", Key/binary>>, N) ->
|
|
N+1
|
|
end,
|
|
0,
|
|
IN)
|
|
end,
|
|
[]),
|
|
|
|
error_logger:info_msg("time to scan: ~p/sec~n", [1000000/(Time2/Max)]),
|
|
|
|
Max = Count-1,
|
|
|
|
{Time3,{done,Count2}} = timer:tc(
|
|
fun() -> hanoi_reader:range_fold(fun(Key, <<"valuevalue/", Key/binary>>, N) ->
|
|
N+1
|
|
end,
|
|
0,
|
|
IN,
|
|
#btree_range{ from_key= <<>>, to_key=undefined })
|
|
end,
|
|
[]),
|
|
|
|
error_logger:info_msg("time to range_fold: ~p/sec~n", [1000000/(Time3/Max)]),
|
|
|
|
error_logger:info_msg("count2=~p~n", [Count2]),
|
|
|
|
Max = Count2-1,
|
|
|
|
ok = hanoi_reader:close(IN).
|
|
|