X-Git-Url: https://git.xandkar.net/?a=blobdiff_plain;f=test%2Fhope_list_SUITE.erl;h=386cdc674ca831a064808082641588fba2a4fae3;hb=HEAD;hp=1311ba969fd92b5bae12982dc609f78836d4cc44;hpb=d302b4a314bba4b3fde4d6c558af3037d4fcc25d;p=hope.git

diff --git a/test/hope_list_SUITE.erl b/test/hope_list_SUITE.erl
index 1311ba9..386cdc6 100644
--- a/test/hope_list_SUITE.erl
+++ b/test/hope_list_SUITE.erl
@@ -20,12 +20,13 @@
     , 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).
 
@@ -49,6 +50,7 @@ groups() ->
         , t_manual_map_result
         , t_manual_map_rev
         , t_manual_map_slow
+        , t_manual_divide
         ],
     Properties = [parallel],
     [{?GROUP, Properties, Tests}].
@@ -84,60 +86,75 @@ t_manual_map_slow(_Cfg) ->
     [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).
+
 %% =============================================================================
 %%  Generated test cases
 %% =============================================================================
 
 t_auto_map_rev(_Cfg) ->
-    ?CHECK(proper_spec_map_rev).
+    ?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) ->
-    ?CHECK(proper_spec_map_slow).
+    ?TEST(?FORALL({L, F}, {type_l(), type_f()},
+        hope_list:map_slow(L, F) == lists:map(F, L)
+    )).
 
 t_auto_map(_Cfg) ->
-    ?CHECK(proper_spec_map).
+    ?TEST(?FORALL({L, F}, {type_l(), type_f()},
+        hope_list:map(L, F) == lists:map(F, L)
+    )).
 
 t_auto_map_3(_Cfg) ->
-    ?CHECK(proper_spec_map_3).
+    ?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) ->
-    ?CHECK(proper_spec_prop_unique_preserve_order).
+    ?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).
 
 %% ============================================================================
-%% PropEr test specs
+%% Common types
 %% ============================================================================
 
-proper_spec_map_rev() ->
-    ?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()},
-        hope_list:map_slow(L, F) == lists:map(F, L)
-    ).
-
-proper_spec_map() ->
-    ?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()},
-        hope_list:map(L, F, N) == lists:map(F, L)
-    ).
-
-proper_spec_prop_unique_preserve_order() ->
-    ?FORALL(L, ?type:list(),
-    begin
-        Duplicates = L -- lists:usort(L),
-        hope_list:unique_preserve_order(L) ==
-            lists:reverse(lists:reverse(L) -- Duplicates)
-    end).
-
 type_l() ->
     ?type:list(?type:integer()).