Implement a tail-recursive list map.

[hope.git] / test / hope_list_SUITE.erl

diff --git a/test/hope_list_SUITE.erl b/test/hope_list_SUITE.erl
index f591e83..6967458 100644 (file)
--- a/test/hope_list_SUITE.erl
+++ b/test/hope_list_SUITE.erl
@@ -13,6 +13,8 @@
     [ t_unique_preserve_order/1
     , t_hope_list_specs/1
     , t_map_rev/1
+    , t_map_slow/1
+    , t_map/1
     ]).
 
 
@@ -33,6 +35,8 @@ groups() ->
         [ t_unique_preserve_order
         , t_hope_list_specs
         , t_map_rev
+        , t_map_slow
+        , t_map
         ],
     Properties = [parallel],
     [{?GROUP, Properties, Tests}].
@@ -47,6 +51,18 @@ t_map_rev(_Cfg) ->
     [4, 3, 2] = hope_list:map_rev([1, 2, 3], F),
     []        = hope_list:map_rev([], F).
 
+t_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_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_unique_preserve_order(_Cfg) ->
     ?PROPTEST(prop_unique_preserve_order).