X-Git-Url: https://git.xandkar.net/?p=hope.git;a=blobdiff_plain;f=src%2Fhope_list.erl;h=91ab9169db829d617c9c967ec398f8137923e16e;hp=b93ad2d346d08d42f5dd277907de7255114ea1cb;hb=ff793acf03456b6bd4c12ea330a9311f7e94cc77;hpb=c66ddf8079f01284853e24ca129062c3d11229b0

diff --git a/src/hope_list.erl b/src/hope_list.erl
index b93ad2d..91ab916 100644
--- a/src/hope_list.erl
+++ b/src/hope_list.erl
@@ -6,15 +6,72 @@
 
 -export(
     [ unique_preserve_order/1
+    , map/2
     , map_rev/2
+    , map_slow/2
     ]).
 
 
+-define(RECURSION_LIMIT, 1000).
+
+
 -type t(A) ::
     [A].
 
 
-%% @doc O(N), tail-recursive equivalent to lists:rev(lists:map(F, L))
+%% @doc Tail-recursive equivalent of lists:map/2
+%% @end
+-spec map([A], fun((A) -> (B))) ->
+    [B].
+map(Xs, F) ->
+    map(Xs, F, 0).
+
+-spec map([A], fun((A) -> (B)), non_neg_integer()) ->
+    [B].
+map([], _, _) ->
+    [];
+map([X1], F, _) ->
+    Y1 = F(X1),
+    [Y1];
+map([X1, X2], F, _) ->
+    Y1 = F(X1),
+    Y2 = F(X2),
+    [Y1, Y2];
+map([X1, X2, X3], F, _) ->
+    Y1 = F(X1),
+    Y2 = F(X2),
+    Y3 = F(X3),
+    [Y1, Y2, Y3];
+map([X1, X2, X3, X4], F, _) ->
+    Y1 = F(X1),
+    Y2 = F(X2),
+    Y3 = F(X3),
+    Y4 = F(X4),
+    [Y1, Y2, Y3, Y4];
+map([X1, X2, X3, X4, X5 | Xs], F, Count) ->
+    Y1 = F(X1),
+    Y2 = F(X2),
+    Y3 = F(X3),
+    Y4 = F(X4),
+    Y5 = F(X5),
+    Ys =
+        case Count > ?RECURSION_LIMIT
+        of  true  -> map_slow(Xs, F)
+        ;   false -> map     (Xs, F, Count + 1)
+        end,
+    [Y1, Y2, Y3, Y4, Y5 | Ys].
+
+
+%% @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 Tail-recursive alternative to lists:map/2, which accumulates and
+%% returns list in reverse order.
 %% @end
 -spec map_rev([A], fun((A) -> (B))) ->
     [B].