-module(hope_list_SUITE).
--include_lib("proper/include/proper.hrl").
+-include_lib("proper/include/proper_common.hrl").
%% Callbacks
-export(
%% Test cases
-export(
- [ t_unique_preserve_order/1
- , t_hope_list_specs/1
- , t_map_rev/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(PROPTEST(A), true = proper:quickcheck(A())).
+-define(TEST(TestSpec), true = proper:quickcheck(TestSpec)).
+
+-define(type, proper_types).
%% ============================================================================
groups() ->
Tests =
- [ t_unique_preserve_order
- , t_hope_list_specs
- , t_map_rev
+ [ 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) ->
+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_manual_map_result(_Cfg) ->
+ AssertPositive =
+ fun (I) when I > 0 -> {ok, I}; (_) -> {error, negative} end,
+ AllPositives = lists:seq(1, 5),
+ AllNegatives = lists:seq(-5, -1),
+ Mixed = lists:seq(-5, 5),
+ {ok, AllPositives} = hope_list:map_result(AllPositives, AssertPositive),
+ {error, negative} = hope_list:map_result(AllNegatives, AssertPositive),
+ {error, negative} = hope_list:map_result(Mixed, AssertPositive).
+
+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_unique_preserve_order(_Cfg) ->
- ?PROPTEST(prop_unique_preserve_order).
+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).
-prop_unique_preserve_order() ->
- ?FORALL(L, list(),
- begin
- Duplicates = L -- lists:usort(L),
- hope_list:unique_preserve_order(L) ==
- lists:reverse(lists:reverse(L) -- Duplicates)
- end).
+%% =============================================================================
+%% Generated test cases
+%% =============================================================================
-t_hope_list_specs(_) ->
+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))
+ )).
+
+t_auto_map_slow(_Cfg) ->
+ ?TEST(?FORALL({L, F}, {type_l(), type_f()},
+ hope_list:map_slow(L, F) == lists:map(F, L)
+ )).
+
+t_auto_map(_Cfg) ->
+ ?TEST(?FORALL({L, F}, {type_l(), type_f()},
+ hope_list:map(L, F) == lists:map(F, L)
+ )).
+
+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)
+ )).
+
+t_auto_unique_preserve_order(_Cfg) ->
+ ?TEST(?FORALL(L, ?type:list(),
+ begin
+ Duplicates = L -- lists:usort(L),
+ 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()).
+
+type_f() ->
+ ?type:function([?type:integer()], ?type:term()).