Which calls lists:reverse/1 on the result of hope_list:map_rev/2
{application, hope,
[
{description, "Higher Order Programming in Erlang"},
{application, hope,
[
{description, "Higher Order Programming in Erlang"},
{registered, []},
{applications, [
kernel,
{registered, []},
{applications, [
kernel,
-export(
[ unique_preserve_order/1
, map_rev/2
-export(
[ unique_preserve_order/1
, map_rev/2
+%% @doc lists:reverse(map_rev(L, F))
+%% @end
+-spec map_slow([A], fun((A) -> (B))) ->
+ [B].
+map_slow(Xs, F) ->
+ lists:reverse(map_rev(Xs, F)).
+
+
%% @doc O(N), tail-recursive equivalent to lists:rev(lists:map(F, L))
%% @end
-spec map_rev([A], fun((A) -> (B))) ->
%% @doc O(N), tail-recursive equivalent to lists:rev(lists:map(F, L))
%% @end
-spec map_rev([A], fun((A) -> (B))) ->
[ t_unique_preserve_order/1
, t_hope_list_specs/1
, t_map_rev/1
[ t_unique_preserve_order/1
, t_hope_list_specs/1
, t_map_rev/1
[ t_unique_preserve_order
, t_hope_list_specs
, t_map_rev
[ t_unique_preserve_order
, t_hope_list_specs
, t_map_rev
],
Properties = [parallel],
[{?GROUP, Properties, Tests}].
],
Properties = [parallel],
[{?GROUP, Properties, Tests}].
[4, 3, 2] = hope_list:map_rev([1, 2, 3], F),
[] = hope_list:map_rev([], F).
[4, 3, 2] = hope_list:map_rev([1, 2, 3], F),
[] = hope_list:map_rev([], F).
+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).
+
t_unique_preserve_order(_Cfg) ->
?PROPTEST(prop_unique_preserve_order).
t_unique_preserve_order(_Cfg) ->
?PROPTEST(prop_unique_preserve_order).