, t_map_rev/1
, t_map_slow/1
, t_map/1
+ , t_map_3/1
+ , t_map_result/1
]).
, t_map_rev
, t_map_slow
, t_map
+ , t_map_3
+ , t_map_result
],
Properties = [parallel],
[{?GROUP, Properties, Tests}].
%% =============================================================================
t_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).
+ ?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) ->
- F = fun (N) -> N + 1 end,
- [2, 3, 4] = hope_list:map_slow([1, 2, 3], F),
- [] = hope_list:map_slow([], F).
+ ?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) ->
- 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).
+ ?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).
t_hope_list_specs(_) ->
[] = proper:check_specs(hope_list).
+
+t_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).