+
+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),
+ hope_list:unique_preserve_order(L) ==
+ lists:reverse(lists:reverse(L) -- Duplicates)
+ 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()).