home
/
code
/
hope.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
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
38d406a
..
6967458
100644
(file)
--- a/
test/hope_list_SUITE.erl
+++ b/
test/hope_list_SUITE.erl
@@
-14,6
+14,7
@@
, t_hope_list_specs/1
, t_map_rev/1
, t_map_slow/1
, t_hope_list_specs/1
, t_map_rev/1
, t_map_slow/1
+ , t_map/1
]).
]).
@@
-35,6
+36,7
@@
groups() ->
, t_hope_list_specs
, t_map_rev
, t_map_slow
, t_hope_list_specs
, t_map_rev
, t_map_slow
+ , t_map
],
Properties = [parallel],
[{?GROUP, Properties, Tests}].
],
Properties = [parallel],
[{?GROUP, Properties, Tests}].
@@
-54,6
+56,13
@@
t_map_slow(_Cfg) ->
[2, 3, 4] = hope_list:map_slow([1, 2, 3], F),
[] = hope_list:map_slow([], F).
[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).
t_unique_preserve_order(_Cfg) ->
?PROPTEST(prop_unique_preserve_order).
This page took
0.0265 seconds
and
4
git commands to generate.