Explicitly name each version of the output under comparison.

[hope.git] / test / hope_list_SUITE.erl

diff --git a/test/hope_list_SUITE.erl b/test/hope_list_SUITE.erl
index 7152503..e1f8375 100644 (file)
--- a/test/hope_list_SUITE.erl
+++ b/test/hope_list_SUITE.erl
@@ -1,6 +1,6 @@
 -module(hope_list_SUITE).
 
--include_lib("proper/include/proper.hrl").
+-include_lib("proper/include/proper_common.hrl").
 
 %% Callbacks
 -export(
@@ -10,19 +10,24 @@
 
 %% 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
     ]).
 
 
 -define(GROUP , hope_list).
 
--define(PROPTEST(A), true = proper:quickcheck(A())).
+-define(TEST(TestSpec), true = proper:quickcheck(TestSpec)).
+
+-define(type, proper_types).
 
 
 %% ============================================================================
@@ -34,65 +39,32 @@ 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
         ],
     Properties = [parallel],
     [{?GROUP, Properties, Tests}].
 
-
 %% =============================================================================
-%%  Test cases
+%%  Manual test cases
 %% =============================================================================
 
-t_map_rev(_Cfg) ->
-    ?PROPTEST(map_rev).
-
-map_rev() ->
-    ?FORALL({L, F}, {list(integer()), function([integer()], term())},
-            hope_list:map_rev(L, F) == lists:reverse(lists:map(F, L))).
-
-t_map_slow(_Cfg) ->
-    ?PROPTEST(map_slow).
-
-map_slow() ->
-    ?FORALL({L, F}, {list(integer()), function([integer()], term())},
-            hope_list:map_slow(L, F) == lists:map(F, L)).
-
-t_map(_Cfg) ->
-    ?PROPTEST(map).
-
-map() ->
-    ?FORALL({L, F}, {list(integer()), function([integer()], term())},
-            hope_list:map(L, F) == lists:map(F, L)).
-
-t_map_3(_Cfg) ->
-    ?PROPTEST(map_3).
-
-map_3() ->
-    ?FORALL({L, F, N}, {list(integer()), function([integer()], term()), non_neg_integer()},
-            hope_list:map(L, F, N) == lists:map(F, L)).
-
-t_unique_preserve_order(_Cfg) ->
-    ?PROPTEST(prop_unique_preserve_order).
-
-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).
-
-t_hope_list_specs(_) ->
-    [] = proper:check_specs(hope_list).
+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_map_result(_Cfg) ->
+t_manual_map_result(_Cfg) ->
     AssertPositive =
         fun (I) when I > 0 -> {ok, I}; (_) -> {error, negative} end,
     AllPositives = lists:seq(1, 5),
@@ -101,3 +73,59 @@ t_map_result(_Cfg) ->
     {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_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).
+
+%% =============================================================================
+%%  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))
+    )).
+
+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()).