aboutsummaryrefslogtreecommitdiff
path: root/gen/list.erl
diff options
context:
space:
mode:
Diffstat (limited to 'gen/list.erl')
-rw-r--r--gen/list.erl295
1 files changed, 0 insertions, 295 deletions
diff --git a/gen/list.erl b/gen/list.erl
deleted file mode 100644
index 1567b98..0000000
--- a/gen/list.erl
+++ /dev/null
@@ -1,295 +0,0 @@
--module(list).
--compile(no_auto_import).
--include_lib("eunit/include/eunit.hrl").
-
--export([length/1, reverse/1, is_empty/1, has_member/2, head/1, tail/1, filter/2, map/2, traverse/2, drop/2, take/2, new/0, append/2, flatten/1, foldl/3, foldr/3, find/2]).
-
-length(A) ->
- erlang:length(A).
-
--ifdef(TEST).
-length_test() ->
- expect:equal(length([]), 0),
- expect:equal(length([1]), 1),
- expect:equal(length([1, 1]), 2),
- expect:equal(length([1, 1, 1]), 3).
--endif.
-
-reverse(A) ->
- lists:reverse(A).
-
--ifdef(TEST).
-reverse_test() ->
- expect:equal(length([]), 0),
- expect:equal(length([1, 2, 3, 4, 5]), 5).
--endif.
-
-is_empty(List) ->
- List =:= [].
-
--ifdef(TEST).
-is_empty_test() ->
- expect:true(is_empty([])),
- expect:false(is_empty([1])).
--endif.
-
-has_member(List, Elem) ->
- case List of
- [] ->
- false;
-
- [Head | Rest] ->
- Head =:= Elem orelse has_member(Rest, Elem)
- end.
-
--ifdef(TEST).
-has_member_test() ->
- expect:true(has_member([0, 4, 5, 1], 1)),
- expect:false(has_member([0, 4, 5, 7], 1)),
- expect:false(has_member([], 1)).
--endif.
-
-head(List) ->
- case List of
- [] ->
- {error, empty};
-
- [X | _] ->
- {ok, X}
- end.
-
--ifdef(TEST).
-head_test() ->
- expect:equal(head([0, 4, 5, 7]), {ok, 0}),
- expect:equal(head([]), {error, empty}).
--endif.
-
-tail(List) ->
- case List of
- [] ->
- {error, empty};
-
- [_ | Xs] ->
- {ok, Xs}
- end.
-
--ifdef(TEST).
-tail_test() ->
- expect:equal(tail([0, 4, 5, 7]), {ok, [4, 5, 7]}),
- expect:equal(tail([0]), {ok, []}),
- expect:equal(tail([]), {error, empty}).
--endif.
-
-do_filter(List, Fun, Acc) ->
- case List of
- [] ->
- reverse(Acc);
-
- [X | Xs] ->
- NewAcc = case Fun(X) of
- true ->
- [X | Acc];
-
- false ->
- Acc
- end,
- do_filter(Xs, Fun, NewAcc)
- end.
-
-filter(List, Fun) ->
- do_filter(List, Fun, []).
-
--ifdef(TEST).
-filter_test() ->
- expect:equal(filter([], fun(_) -> true end), []),
- expect:equal(filter([0, 4, 5, 7, 3], fun(_) -> true end), [0, 4, 5, 7, 3]),
- expect:equal(filter([0, 4, 5, 7, 3], fun(X) -> X > 4 end), [5, 7]),
- expect:equal(filter([0, 4, 5, 7, 3], fun(X) -> X < 4 end), [0, 3]).
--endif.
-
-do_map(List, Fun, Acc) ->
- case List of
- [] ->
- reverse(Acc);
-
- [X | Xs] ->
- do_map(Xs, Fun, [Fun(X) | Acc])
- end.
-
-map(List, Fun) ->
- do_map(List, Fun, []).
-
--ifdef(TEST).
-map_test() ->
- expect:equal(map([], fun(X) -> X * 2 end), []),
- expect:equal(map([0, 4, 5, 7, 3], fun(X) -> X * 2 end), [0, 8, 10, 14, 6]).
--endif.
-
-do_traverse(List, Fun, Acc) ->
- case List of
- [] ->
- {ok, reverse(Acc)};
-
- [X | Xs] ->
- case Fun(X) of
- {ok, Y} ->
- do_traverse(Xs, Fun, [Y | Acc]);
-
- {error, Error} ->
- {error, Error}
- end
- end.
-
-traverse(List, Fun) ->
- do_traverse(List, Fun, []).
-
--ifdef(TEST).
-traverse_test() ->
- Fun = fun(X) -> case X =:= 6 orelse X =:= 5 orelse X =:= 4 of
- true ->
- {ok, X * 2};
-
- false ->
- {error, X}
- end end,
- expect:equal(traverse([5, 6, 5, 6], Fun), {ok, [10, 12, 10, 12]}),
- expect:equal(traverse([4, 6, 5, 7, 3], Fun), {error, 7}).
--endif.
-
-drop(List, N) ->
- case N =< 0 of
- true ->
- List;
-
- false ->
- case List of
- [] ->
- [];
-
- [_ | Xs] ->
- drop(Xs, N - 1)
- end
- end.
-
--ifdef(TEST).
-drop_test() ->
- expect:equal(drop([], 5), []),
- expect:equal(drop([1, 2, 3, 4, 5, 6, 7, 8], 5), [6, 7, 8]).
--endif.
-
-do_take(List, N, Acc) ->
- case N =< 0 of
- true ->
- reverse(Acc);
-
- false ->
- case List of
- [] ->
- reverse(Acc);
-
- [X | Xs] ->
- do_take(Xs, N - 1, [X | Acc])
- end
- end.
-
-take(List, N) ->
- do_take(List, N, []).
-
--ifdef(TEST).
-take_test() ->
- expect:equal(take([], 5), []),
- expect:equal(take([1, 2, 3, 4, 5, 6, 7, 8], 5), [1, 2, 3, 4, 5]).
--endif.
-
-new() ->
- [].
-
--ifdef(TEST).
-new_test() ->
- expect:equal(new(), []).
--endif.
-
-append(A, B) ->
- lists:append(A, B).
-
--ifdef(TEST).
-append_test() ->
- expect:equal(append([1], [2, 3]), [1, 2, 3]).
--endif.
-
-do_flatten(Lists, Acc) ->
- case Lists of
- [] ->
- Acc;
-
- [L | Rest] ->
- do_flatten(Rest, append(Acc, L))
- end.
-
-flatten(Lists) ->
- do_flatten(Lists, []).
-
--ifdef(TEST).
-flatten_test() ->
- expect:equal(flatten([]), []),
- expect:equal(flatten([[]]), []),
- expect:equal(flatten([[], [], []]), []),
- expect:equal(flatten([[1, 2], [], [3, 4]]), [1, 2, 3, 4]).
--endif.
-
-foldl(List, Acc, Fun) ->
- case List of
- [] ->
- Acc;
-
- [X | Rest] ->
- foldl(Rest, Fun(X, Acc), Fun)
- end.
-
--ifdef(TEST).
-foldl_test() ->
- expect:equal(foldl([1, 2, 3], [], fun(X, Acc) -> [X | Acc] end), [3, 2, 1]).
--endif.
-
-foldr(List, Acc, Fun) ->
- case List of
- [] ->
- Acc;
-
- [X | Rest] ->
- Fun(X, foldr(Rest, Acc, Fun))
- end.
-
--ifdef(TEST).
-foldr_test() ->
- expect:equal(foldr([1, 2, 3], [], fun(X, Acc) -> [X | Acc] end), [1, 2, 3]).
--endif.
-
-find(Haystack, F) ->
- case Haystack of
- [] ->
- {error, not_found};
-
- [X | Rest] ->
- case F(X) of
- {ok, X1} ->
- {ok, X1};
-
- _ ->
- find(Rest, F)
- end
- end.
-
--ifdef(TEST).
-find_test() ->
- F = fun(X) -> case X of
- 2 ->
- {ok, 4};
-
- _ ->
- {error, not_found}
- end end,
- expect:equal(find([1, 2, 3], F), {ok, 4}),
- expect:equal(find([1, 3, 2], F), {ok, 4}),
- expect:equal(find([1, 3], F), {error, not_found}).
--endif.
generated by cgit v1.2.3 (git 2.25.1) at 2025-07-26 23:37:46 +0000