home
/
code
/
hope.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Replace lists:keysearch with hope_kv_list:get
[hope.git]
/
src
/
hope_list.erl
diff --git
a/src/hope_list.erl
b/src/hope_list.erl
index
91ab916
..
f179d1a
100644
(file)
--- a/
src/hope_list.erl
+++ b/
src/hope_list.erl
@@
-7,12
+7,14
@@
-export(
[ unique_preserve_order/1
, map/2
-export(
[ unique_preserve_order/1
, map/2
+ , map/3 % Tunable recursion limit
, map_rev/2
, map_slow/2
, map_rev/2
, map_slow/2
+ , first_match/2
]).
]).
--define(RECURSION_LIMIT, 1000).
+-define(
DEFAULT_
RECURSION_LIMIT, 1000).
-type t(A) ::
-type t(A) ::
@@
-24,40
+26,43
@@
-spec map([A], fun((A) -> (B))) ->
[B].
map(Xs, F) ->
-spec map([A], fun((A) -> (B))) ->
[B].
map(Xs, F) ->
- map(Xs, F,
0
).
+ map(Xs, F,
?DEFAULT_RECURSION_LIMIT
).
--spec map([A], fun((A) -> (B)), non_neg_integer()) ->
+-spec map([A], fun((A) -> (B)),
RecursionLimit ::
non_neg_integer()) ->
[B].
[B].
-map([], _, _) ->
+map(Xs, F, RecursionLimit) ->
+ map(Xs, F, RecursionLimit, 0).
+
+map([], _, _, _) ->
[];
[];
-map([X1], F, _) ->
+map([X1], F, _
, _
) ->
Y1 = F(X1),
[Y1];
Y1 = F(X1),
[Y1];
-map([X1, X2], F, _) ->
+map([X1, X2], F, _
, _
) ->
Y1 = F(X1),
Y2 = F(X2),
[Y1, Y2];
Y1 = F(X1),
Y2 = F(X2),
[Y1, Y2];
-map([X1, X2, X3], F, _) ->
+map([X1, X2, X3], F, _
, _
) ->
Y1 = F(X1),
Y2 = F(X2),
Y3 = F(X3),
[Y1, Y2, Y3];
Y1 = F(X1),
Y2 = F(X2),
Y3 = F(X3),
[Y1, Y2, Y3];
-map([X1, X2, X3, X4], F, _) ->
+map([X1, X2, X3, X4], F, _
, _
) ->
Y1 = F(X1),
Y2 = F(X2),
Y3 = F(X3),
Y4 = F(X4),
[Y1, Y2, Y3, Y4];
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) ->
+map([X1, X2, X3, X4, X5 | Xs], F,
RecursionLimit, Recursion
Count) ->
Y1 = F(X1),
Y2 = F(X2),
Y3 = F(X3),
Y4 = F(X4),
Y5 = F(X5),
Ys =
Y1 = F(X1),
Y2 = F(X2),
Y3 = F(X3),
Y4 = F(X4),
Y5 = F(X5),
Ys =
- case
Count > ?RECURSION_LIMIT
+ case
RecursionCount > RecursionLimit
of true -> map_slow(Xs, F)
of true -> map_slow(Xs, F)
- ; false -> map (Xs, F, Count + 1)
+ ; false -> map (Xs, F,
RecursionLimit, Recursion
Count + 1)
end,
[Y1, Y2, Y3, Y4, Y5 | Ys].
end,
[Y1, Y2, Y3, Y4, Y5 | Ys].
@@
-98,3
+103,13
@@
unique_preserve_order(L) ->
end
end,
lists:reverse(lists:foldl(PrependIfNew, [], L)).
end
end,
lists:reverse(lists:foldl(PrependIfNew, [], L)).
+
+-spec first_match([{Tag, fun((A) -> boolean())}], A) ->
+ hope_option:t(Tag).
+first_match([], _) ->
+ none;
+first_match([{Tag, F} | Tests], X) ->
+ case F(X)
+ of true -> {some, Tag}
+ ; false -> first_match(Tests, X)
+ end.
This page took
0.025006 seconds
and
4
git commands to generate.