8 [ unique_preserve_order/1
10 , map/3 % Tunable recursion limit
13 , map_result/2 % Not tail-recursive
18 -define(DEFAULT_RECURSION_LIMIT, 1000).
25 %% @doc Tail-recursive equivalent of lists:map/2
27 -spec map([A], fun((A) -> (B))) ->
30 map(Xs, F, ?DEFAULT_RECURSION_LIMIT).
32 -spec map([A], fun((A) -> (B)), RecursionLimit :: non_neg_integer()) ->
34 map(Xs, F, RecursionLimit) ->
35 map(Xs, F, RecursionLimit, 0).
42 map([X1, X2], F, _, _) ->
46 map([X1, X2, X3], F, _, _) ->
51 map([X1, X2, X3, X4], F, _, _) ->
57 map([X1, X2, X3, X4, X5 | Xs], F, RecursionLimit, RecursionCount) ->
64 case RecursionCount > RecursionLimit
65 of true -> map_slow(Xs, F)
66 ; false -> map (Xs, F, RecursionLimit, RecursionCount + 1)
68 [Y1, Y2, Y3, Y4, Y5 | Ys].
70 %% @doc lists:reverse(map_rev(L, F))
72 -spec map_slow([A], fun((A) -> (B))) ->
75 lists:reverse(map_rev(Xs, F)).
78 %% @doc Tail-recursive alternative to lists:map/2, which accumulates and
79 %% returns list in reverse order.
81 -spec map_rev([A], fun((A) -> (B))) ->
84 map_rev_acc(Xs, F, []).
86 -spec map_rev_acc([A], fun((A) -> (B)), [B]) ->
88 map_rev_acc([], _, Ys) ->
90 map_rev_acc([X|Xs], F, Ys) ->
92 map_rev_acc(Xs, F, [Y|Ys]).
94 -spec map_result([A], fun((A) -> (hope_result:t(B, C)))) ->
95 hope_result:t([B], C).
98 map_result([X | Xs], F) ->
101 case map_result(Xs, F)
104 ; {error, _}=Error ->
107 ; {error, _}=Error ->
111 -spec unique_preserve_order(t(A)) ->
113 unique_preserve_order(L) ->
116 case lists:member(X, Xs)
121 lists:reverse(lists:foldl(PrependIfNew, [], L)).
123 -spec first_match([{Tag, fun((A) -> boolean())}], A) ->
125 first_match([], _) ->
127 first_match([{Tag, F} | Tests], X) ->
129 of true -> {some, Tag}
130 ; false -> first_match(Tests, X)