1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
#!/usr/bin/env escript
%% -*- erlang -*-
%%! -pa ./src/couchdb -sasl errlog_type error -boot start_sasl -noshell
-define(FILE_NAME, "./t/temp.021").
-define(ROWS, 1000).
main(_) ->
etap:plan(8),
case (catch test()) of
ok ->
etap:end_tests();
Other ->
etap:diag(io_lib:format("Test died abnormally: ~p", [Other])),
etap:bail()
end,
ok.
test()->
ReduceFun = fun
(reduce, KVs) -> length(KVs);
(rereduce, Reds) -> lists:sum(Reds)
end,
{ok, Fd} = couch_file:open(?FILE_NAME, [create,overwrite]),
{ok, Btree} = couch_btree:open(nil, Fd, [{reduce, ReduceFun}]),
% Create a list, of {"even", Value} or {"odd", Value} pairs.
{_, EvenOddKVs} = lists:foldl(fun(Idx, {Key, Acc}) ->
case Key of
"even" -> {"odd", [{{Key, Idx}, 1} | Acc]};
_ -> {"even", [{{Key, Idx}, 1} | Acc]}
end
end, {"odd", []}, lists:seq(1, ?ROWS)),
{ok, Btree2} = couch_btree:add_remove(Btree, EvenOddKVs, []),
GroupFun = fun({K1, _}, {K2, _}) -> K1 == K2 end,
FoldFun = fun(GroupedKey, Unreduced, Acc) ->
{ok, [{GroupedKey, couch_btree:final_reduce(Btree2, Unreduced)} | Acc]}
end,
{SK1, EK1} = {{"even", -1}, {"even", foo}},
{SK2, EK2} = {{"odd", -1}, {"odd", foo}},
etap:fun_is(
fun
({ok, [{{"odd", _}, ?ROWS div 2}, {{"even", _}, ?ROWS div 2}]}) ->
true;
(_) ->
false
end,
couch_btree:fold_reduce(Btree2, nil, nil, GroupFun, FoldFun, []),
"Reduction works with no specified direction, startkey, or endkey."
),
etap:fun_is(
fun
({ok, [{{"odd", _}, ?ROWS div 2}, {{"even", _}, ?ROWS div 2}]}) ->
true;
(_) ->
false
end,
couch_btree:fold_reduce(Btree2, fwd, nil, nil, GroupFun, FoldFun, []),
"Reducing forward works with no startkey or endkey."
),
etap:fun_is(
fun
({ok, [{{"even", _}, ?ROWS div 2}, {{"odd", _}, ?ROWS div 2}]}) ->
true;
(_) ->
false
end,
couch_btree:fold_reduce(Btree2, rev, nil, nil, GroupFun, FoldFun, []),
"Reducing backwards works with no startkey or endkey."
),
etap:fun_is(
fun
({ok, [{{"odd", _}, ?ROWS div 2}, {{"even", _}, ?ROWS div 2}]}) ->
true;
(_) ->
false
end,
couch_btree:fold_reduce(Btree2, fwd, SK1, EK2, GroupFun, FoldFun, []),
"Reducing works over the entire range with startkey and endkey set."
),
etap:fun_is(
fun
({ok, [{{"even", _}, ?ROWS div 2}]}) -> true;
(_) -> false
end,
couch_btree:fold_reduce(Btree2, fwd, SK1, EK1, GroupFun, FoldFun, []),
"Reducing foward over first half works with a startkey and endkey."
),
etap:fun_is(
fun
({ok, [{{"odd", _}, ?ROWS div 2}]}) -> true;
(_) -> false
end,
couch_btree:fold_reduce(Btree2, fwd, SK2, EK2, GroupFun, FoldFun, []),
"Reducing foward over second half works with second startkey and endkey"
),
etap:fun_is(
fun
({ok, [{{"odd", _}, ?ROWS div 2}]}) -> true;
(_) -> false
end,
couch_btree:fold_reduce(Btree2, rev, EK2, SK2, GroupFun, FoldFun, []),
"Reducing in reverse works after swapping the startkey and endkey."
),
etap:fun_is(
fun
({ok, [{{"even", _}, ?ROWS div 2}, {{"odd", _}, ?ROWS div 2}]}) ->
true;
(_) ->
false
end,
couch_btree:fold_reduce(Btree2, rev, EK2, SK1, GroupFun, FoldFun, []),
"Reducing in reverse results in reversed accumulator."
),
couch_file:close(Fd).
|
