X-Git-Url: https://git.xandkar.net/?a=blobdiff_plain;f=test%2Fhope_list_SUITE.erl;h=386cdc674ca831a064808082641588fba2a4fae3;hb=HEAD;hp=d5ac392513c16e93369a3b75265d8ffb47bdd93e;hpb=cf0f905c6b980352e35a8069c4a1a8680803e27d;p=hope.git diff --git a/test/hope_list_SUITE.erl b/test/hope_list_SUITE.erl index d5ac392..386cdc6 100644 --- a/test/hope_list_SUITE.erl +++ b/test/hope_list_SUITE.erl @@ -10,19 +10,23 @@ %% Test cases -export( - [ t_unique_preserve_order/1 - , t_hope_list_specs/1 - , t_map_rev/1 - , t_map_slow/1 - , t_map/1 - , t_map_3/1 - , t_map_result/1 + [ t_auto_hope_list_specs/1 + , t_auto_map/1 + , t_auto_map_3/1 + , t_auto_map_rev/1 + , t_auto_map_slow/1 + , t_auto_unique_preserve_order/1 + , t_manual_map/1 + , t_manual_map_result/1 + , t_manual_map_rev/1 + , t_manual_map_slow/1 + , t_manual_divide/1 ]). -define(GROUP , hope_list). --define(CHECK(F), true = proper:quickcheck(F())). +-define(TEST(TestSpec), true = proper:quickcheck(TestSpec)). -define(type, proper_types). @@ -36,41 +40,33 @@ all() -> groups() -> Tests = - [ t_unique_preserve_order - , t_hope_list_specs - , t_map_rev - , t_map_slow - , t_map - , t_map_3 - , t_map_result + [ t_auto_hope_list_specs + , t_auto_map + , t_auto_map_3 + , t_auto_map_rev + , t_auto_map_slow + , t_auto_unique_preserve_order + , t_manual_map + , t_manual_map_result + , t_manual_map_rev + , t_manual_map_slow + , t_manual_divide ], Properties = [parallel], [{?GROUP, Properties, Tests}]. - %% ============================================================================= -%% Test cases +%% Manual test cases %% ============================================================================= -t_map_rev(_Cfg) -> - ?CHECK(proper_spec_map_rev). - -t_map_slow(_Cfg) -> - ?CHECK(proper_spec_map_slow). - -t_map(_Cfg) -> - ?CHECK(proper_spec_map). - -t_map_3(_Cfg) -> - ?CHECK(proper_spec_map_3). - -t_unique_preserve_order(_Cfg) -> - ?CHECK(proper_spec_prop_unique_preserve_order). +t_manual_map(_Cfg) -> + F = fun (N) -> N + 1 end, + Xs = lists:seq(1, 5010), + Ys = lists:map(F, Xs), + Ys = hope_list:map(Xs, F), + [] = hope_list:map([], F). -t_hope_list_specs(_Cfg) -> - [] = proper:check_specs(hope_list). - -t_map_result(_Cfg) -> +t_manual_map_result(_Cfg) -> AssertPositive = fun (I) when I > 0 -> {ok, I}; (_) -> {error, negative} end, AllPositives = lists:seq(1, 5), @@ -80,37 +76,84 @@ t_map_result(_Cfg) -> {error, negative} = hope_list:map_result(AllNegatives, AssertPositive), {error, negative} = hope_list:map_result(Mixed, AssertPositive). -%% ============================================================================ -%% PropEr test specs -%% ============================================================================ +t_manual_map_rev(_Cfg) -> + F = fun (N) -> N + 1 end, + [4, 3, 2] = hope_list:map_rev([1, 2, 3], F), + [] = hope_list:map_rev([], F). + +t_manual_map_slow(_Cfg) -> + F = fun (N) -> N + 1 end, + [2, 3, 4] = hope_list:map_slow([1, 2, 3], F), + [] = hope_list:map_slow([], F). + +t_manual_divide(_Cfg) -> + try + hope_list:divide([a, b, c], -1) + catch + error:hope_list__divide__size_must_be_a_positive_integer -> ok + end, + try + hope_list:divide([a, b, c], 0) + catch + error:hope_list__divide__size_must_be_a_positive_integer -> ok + end, + [[c], [b], [a]] = hope_list:divide([a, b, c], 1), + [[c], [b, a]] = hope_list:divide([a, b, c], 2), + [[c, b, a]] = hope_list:divide([a, b, c], 3), + [[c, b, a]] = hope_list:divide([a, b, c], 4), + [[c, b, a]] = hope_list:divide([a, b, c], 5), + try + hope_list:divide([], 0) + catch + error:hope_list__divide__size_must_be_a_positive_integer -> ok + end, + try + hope_list:divide([], -1) + catch + error:hope_list__divide__size_must_be_a_positive_integer -> ok + end, + [[f, e], [d, c], [b, a]] = hope_list:divide([a, b, c, d, e, f], 2), + [[f, e, d], [c, b, a]] = hope_list:divide([a, b, c, d, e, f], 3). -proper_spec_map_rev() -> - ?FORALL({L, F}, {type_l(), type_f()}, +%% ============================================================================= +%% Generated test cases +%% ============================================================================= + +t_auto_map_rev(_Cfg) -> + ?TEST(?FORALL({L, F}, {type_l(), type_f()}, hope_list:map_rev(L, F) == lists:reverse(lists:map(F, L)) - ). + )). -proper_spec_map_slow() -> - ?FORALL({L, F}, {type_l(), type_f()}, +t_auto_map_slow(_Cfg) -> + ?TEST(?FORALL({L, F}, {type_l(), type_f()}, hope_list:map_slow(L, F) == lists:map(F, L) - ). + )). -proper_spec_map() -> - ?FORALL({L, F}, {type_l(), type_f()}, +t_auto_map(_Cfg) -> + ?TEST(?FORALL({L, F}, {type_l(), type_f()}, hope_list:map(L, F) == lists:map(F, L) - ). + )). -proper_spec_map_3() -> - ?FORALL({L, F, N}, {type_l(), type_f(), ?type:non_neg_integer()}, +t_auto_map_3(_Cfg) -> + ?TEST(?FORALL({L, F, N}, {type_l(), type_f(), ?type:non_neg_integer()}, hope_list:map(L, F, N) == lists:map(F, L) - ). + )). -proper_spec_prop_unique_preserve_order() -> - ?FORALL(L, ?type:list(), +t_auto_unique_preserve_order(_Cfg) -> + ?TEST(?FORALL(L, ?type:list(), begin Duplicates = L -- lists:usort(L), - hope_list:unique_preserve_order(L) == - lists:reverse(lists:reverse(L) -- Duplicates) - end). + UniquesInOrderA = lists:reverse(lists:reverse(L) -- Duplicates), + UniquesInOrderB = hope_list:unique_preserve_order(L), + UniquesInOrderA == UniquesInOrderB + end)). + +t_auto_hope_list_specs(_Cfg) -> + [] = proper:check_specs(hope_list). + +%% ============================================================================ +%% Common types +%% ============================================================================ type_l() -> ?type:list(?type:integer()).