aboutsummaryrefslogtreecommitdiff
path: root/gen/src/gleam@list.erl
diff options
context:
space:
mode:
authorLouis Pilfold <louis@lpil.uk>2019-10-25 18:47:50 +0100
committerLouis Pilfold <louis@lpil.uk>2019-10-25 19:05:54 +0100
commit427dde6a252f4af02af7de1c83f5acbf701c9a8f (patch)
tree4a37bae6f99201b01119b7b3927a72c024236561 /gen/src/gleam@list.erl
parent0bf78a366609d460fa2546b17e12dcbc66cbc238 (diff)
downloadgleam_stdlib-427dde6a252f4af02af7de1c83f5acbf701c9a8f.tar.gz
gleam_stdlib-427dde6a252f4af02af7de1c83f5acbf701c9a8f.zip
list.find and list.find_map
Diffstat (limited to 'gen/src/gleam@list.erl')
-rw-r--r--gen/src/gleam@list.erl25
1 files changed, 20 insertions, 5 deletions
diff --git a/gen/src/gleam@list.erl b/gen/src/gleam@list.erl
index 508da27..586a5aa 100644
--- a/gen/src/gleam@list.erl
+++ b/gen/src/gleam@list.erl
@@ -1,7 +1,7 @@
-module(gleam@list).
-compile(no_auto_import).
--export([length/1, reverse/1, is_empty/1, contains/2, head/1, tail/1, filter/2, map/2, index_map/2, traverse/2, drop/2, take/2, new/0, append/2, flatten/1, fold/3, fold_right/3, find/2, all/2, any/2, zip/2, strict_zip/2, intersperse/2, at/2, unique/1, sort/2, range/2, repeat/2, split/2, split_while/2, key_find/2]).
+-export([length/1, reverse/1, is_empty/1, contains/2, head/1, tail/1, filter/2, map/2, index_map/2, traverse/2, drop/2, take/2, new/0, append/2, flatten/1, fold/3, fold_right/3, find/2, find_map/2, all/2, any/2, zip/2, strict_zip/2, intersperse/2, at/2, unique/1, sort/2, range/2, repeat/2, split/2, split_while/2, key_find/2]).
length(A) ->
erlang:length(A).
@@ -169,18 +169,33 @@ fold_right(List, Initial, Fun) ->
Fun(X, fold_right(Rest, Initial, Fun))
end.
-find(Haystack, Predicate) ->
+find(Haystack, IsDesired) ->
case Haystack of
[] ->
{error, nil};
[X | Rest] ->
- case Predicate(X) of
+ case IsDesired(X) of
+ true ->
+ {ok, X};
+
+ _ ->
+ find(Rest, IsDesired)
+ end
+ end.
+
+find_map(Haystack, Fun) ->
+ case Haystack of
+ [] ->
+ {error, nil};
+
+ [X | Rest] ->
+ case Fun(X) of
{ok, X1} ->
{ok, X1};
_ ->
- find(Rest, Predicate)
+ find_map(Rest, Fun)
end
end.
@@ -375,7 +390,7 @@ split_while(List, Predicate) ->
do_split_while(List, Predicate, []).
key_find(Haystack, Needle) ->
- find(Haystack, fun(P) -> case gleam@pair:first(P) =:= Needle of
+ find_map(Haystack, fun(P) -> case gleam@pair:first(P) =:= Needle of
true ->
{ok, gleam@pair:second(P)};