home
/
code
/
hope.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (from parent 1:
54ab0c8
)
Do not import unused PropEr bindings
author
Siraaj Khandkar
<siraaj@khandkar.net>
Sat, 5 Sep 2015 23:31:15 +0000
(16:31 -0700)
committer
Siraaj Khandkar
<siraaj@khandkar.net>
Sat, 5 Sep 2015 23:31:15 +0000
(16:31 -0700)
test/hope_list_SUITE.erl
patch
|
blob
|
blame
|
history
diff --git
a/test/hope_list_SUITE.erl
b/test/hope_list_SUITE.erl
index
7152503
..
1919249
100644
(file)
--- a/
test/hope_list_SUITE.erl
+++ b/
test/hope_list_SUITE.erl
@@
-1,6
+1,6
@@
-module(hope_list_SUITE).
-module(hope_list_SUITE).
--include_lib("proper/include/proper.hrl").
+-include_lib("proper/include/proper
_common
.hrl").
%% Callbacks
-export(
%% Callbacks
-export(
@@
-54,35
+54,35
@@
t_map_rev(_Cfg) ->
?PROPTEST(map_rev).
map_rev() ->
?PROPTEST(map_rev).
map_rev() ->
- ?FORALL({L, F}, {
list(integer()), function([integer()],
term())},
+ ?FORALL({L, F}, {
proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:
term())},
hope_list:map_rev(L, F) == lists:reverse(lists:map(F, L))).
t_map_slow(_Cfg) ->
?PROPTEST(map_slow).
map_slow() ->
hope_list:map_rev(L, F) == lists:reverse(lists:map(F, L))).
t_map_slow(_Cfg) ->
?PROPTEST(map_slow).
map_slow() ->
- ?FORALL({L, F}, {
list(integer()), function([integer()],
term())},
+ ?FORALL({L, F}, {
proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:
term())},
hope_list:map_slow(L, F) == lists:map(F, L)).
t_map(_Cfg) ->
?PROPTEST(map).
map() ->
hope_list:map_slow(L, F) == lists:map(F, L)).
t_map(_Cfg) ->
?PROPTEST(map).
map() ->
- ?FORALL({L, F}, {
list(integer()), function([integer()],
term())},
+ ?FORALL({L, F}, {
proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:
term())},
hope_list:map(L, F) == lists:map(F, L)).
t_map_3(_Cfg) ->
?PROPTEST(map_3).
map_3() ->
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()},
+ ?FORALL({L, F, N}, {
proper_types:list(proper_types:integer()), proper_types:function([proper_types:integer()], proper_types:term()), proper_types:
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() ->
- ?FORALL(L, list(),
+ ?FORALL(L,
proper_types:
list(),
begin
Duplicates = L -- lists:usort(L),
hope_list:unique_preserve_order(L) ==
begin
Duplicates = L -- lists:usort(L),
hope_list:unique_preserve_order(L) ==
This page took
0.068109 seconds
and
4
git commands to generate.