- ?FORALL({L, F}, {proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:term())},
+ ?FORALL({L, F}, {?type:list(?type:integer()), ?type:function([?type:integer()], ?type:term())},
- ?FORALL({L, F}, {proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:term())},
+ ?FORALL({L, F}, {?type:list(?type:integer()), ?type:function([?type:integer()], ?type:term())},
- ?FORALL({L, F}, {proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:term())},
+ ?FORALL({L, F}, {?type:list(?type:integer()), ?type:function([?type:integer()], ?type:term())},
- ?FORALL({L, F, N}, {proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:term()), proper_types:non_neg_integer()},
+ ?FORALL({L, F, N}, {?type:list(?type:integer()), ?type:function([?type:integer()], ?type:term()), ?type: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() ->
hope_list:map(L, F, N) == lists:map(F, L)).
t_unique_preserve_order(_Cfg) ->
?PROPTEST(prop_unique_preserve_order).
prop_unique_preserve_order() ->
begin
Duplicates = L -- lists:usort(L),
hope_list:unique_preserve_order(L) ==
begin
Duplicates = L -- lists:usort(L),
hope_list:unique_preserve_order(L) ==