Packages
gleam_stdlib
0.30.2
1.0.3
1.0.2
1.0.1
1.0.0
0.71.0
0.70.0
0.69.0
0.68.1
0.68.0
0.67.1
0.67.0
0.65.0
0.64.0
0.63.2
0.63.1
0.63.0
0.62.1
0.62.0
0.61.0
0.60.0
0.59.0
0.58.0
0.57.0
0.56.0
0.55.0
0.54.0
0.53.0
0.52.0
0.51.0
0.50.0
0.49.0
0.48.0
0.47.0
0.46.0
0.45.0
0.44.0
0.43.0
0.42.0
0.41.0
0.40.0
0.39.0
0.38.0
0.37.0
0.36.0
0.35.1
0.35.0
0.34.0
0.33.1
0.33.0
0.32.1
0.32.0
0.31.0
0.30.2
0.30.1
0.30.0
0.29.2
0.29.1
0.29.0
0.28.2
0.28.1
0.28.0
0.27.0
0.26.1
0.26.0
0.25.0
0.24.0
0.23.0
0.22.3
0.22.2
0.22.1
0.22.0
0.21.0
0.20.0
0.19.3
0.19.2
0.19.1
0.19.0
0.18.1
0.18.0
0.18.0-rc1
0.17.1
0.17.0
0.16.0
0.15.0
0.14.0
0.13.0
0.12.0
0.11.0
0.10.1
0.10.0
0.9.0
0.8.0
0.7.0
0.6.0
0.5.0
0.4.0
0.4.0-rc1
0.3.1
0.3.0
0.2.0
retired
A standard library for the Gleam programming language
Current section
Files
Jump to
Current section
Files
src/gleam@list.erl
-module(gleam@list).
-compile([no_auto_import, nowarn_unused_vars]).
-export([length/1, reverse/1, is_empty/1, contains/2, first/1, rest/1, filter/2, filter_map/2, map/2, map2/3, index_map/2, try_map/2, drop/2, take/2, new/0, append/2, prepend/2, concat/1, flatten/1, flat_map/2, fold/3, group/2, map_fold/3, fold_right/3, index_fold/3, try_fold/3, fold_until/3, find/2, find_map/2, all/2, any/2, zip/2, strict_zip/2, unzip/1, intersperse/2, at/2, unique/1, sort/2, range/2, repeat/2, split/2, split_while/2, key_find/2, pop/2, pop_map/2, key_pop/2, key_set/3, each/2, try_each/2, partition/2, permutations/1, window/2, window_by_2/1, drop_while/2, take_while/2, chunk/2, sized_chunk/2, reduce/2, scan/3, last/1, combinations/2, combination_pairs/1, transpose/1, interleave/1, shuffle/1]).
-export_type([length_mismatch/0, continue_or_stop/1]).
-type length_mismatch() :: length_mismatch.
-type continue_or_stop(TX) :: {continue, TX} | {stop, TX}.
-spec length(list(any())) -> integer().
length(List) ->
erlang:length(List).
-spec reverse(list(UC)) -> list(UC).
reverse(Xs) ->
lists:reverse(Xs).
-spec is_empty(list(any())) -> boolean().
is_empty(List) ->
List =:= [].
-spec contains(list(UK), UK) -> boolean().
contains(List, Elem) ->
case List of
[] ->
false;
[First | _] when First =:= Elem ->
true;
[_ | Rest] ->
contains(Rest, Elem)
end.
-spec first(list(UM)) -> {ok, UM} | {error, nil}.
first(List) ->
case List of
[] ->
{error, nil};
[X | _] ->
{ok, X}
end.
-spec rest(list(UQ)) -> {ok, list(UQ)} | {error, nil}.
rest(List) ->
case List of
[] ->
{error, nil};
[_ | Xs] ->
{ok, Xs}
end.
-spec do_filter(list(VJ), fun((VJ) -> boolean()), list(VJ)) -> list(VJ).
do_filter(List, Fun, Acc) ->
case List of
[] ->
reverse(Acc);
[X | Xs] ->
New_acc = case Fun(X) of
true ->
[X | Acc];
false ->
Acc
end,
do_filter(Xs, Fun, New_acc)
end.
-spec filter(list(VN), fun((VN) -> boolean())) -> list(VN).
filter(List, Predicate) ->
do_filter(List, Predicate, []).
-spec do_filter_map(list(VQ), fun((VQ) -> {ok, VS} | {error, any()}), list(VS)) -> list(VS).
do_filter_map(List, Fun, Acc) ->
case List of
[] ->
reverse(Acc);
[X | Xs] ->
New_acc = case Fun(X) of
{ok, X@1} ->
[X@1 | Acc];
{error, _} ->
Acc
end,
do_filter_map(Xs, Fun, New_acc)
end.
-spec filter_map(list(VY), fun((VY) -> {ok, WA} | {error, any()})) -> list(WA).
filter_map(List, Fun) ->
do_filter_map(List, Fun, []).
-spec do_map(list(WF), fun((WF) -> WH), list(WH)) -> list(WH).
do_map(List, Fun, Acc) ->
case List of
[] ->
reverse(Acc);
[X | Xs] ->
do_map(Xs, Fun, [Fun(X) | Acc])
end.
-spec map(list(WK), fun((WK) -> WM)) -> list(WM).
map(List, Fun) ->
do_map(List, Fun, []).
-spec update_group(fun((UV) -> UW)) -> fun((gleam@map:map_(UW, list(UV)), UV) -> gleam@map:map_(UW, list(UV))).
update_group(F) ->
fun(Groups, Elem) -> case gleam@map:get(Groups, F(Elem)) of
{ok, Existing} ->
gleam@map:insert(Groups, F(Elem), [Elem | Existing]);
{error, _} ->
gleam@map:insert(Groups, F(Elem), [Elem])
end end.
-spec do_map2(list(WU), list(WW), fun((WU, WW) -> WY), list(WY)) -> list(WY).
do_map2(List1, List2, Fun, Acc) ->
case {List1, List2} of
{[], _} ->
reverse(Acc);
{_, []} ->
reverse(Acc);
{[A | As_], [B | Bs]} ->
do_map2(As_, Bs, Fun, [Fun(A, B) | Acc])
end.
-spec map2(list(WO), list(WQ), fun((WO, WQ) -> WS)) -> list(WS).
map2(List1, List2, Fun) ->
do_map2(List1, List2, Fun, []).
-spec do_index_map(list(XG), fun((integer(), XG) -> XI), integer(), list(XI)) -> list(XI).
do_index_map(List, Fun, Index, Acc) ->
case List of
[] ->
reverse(Acc);
[X | Xs] ->
Acc@1 = [Fun(Index, X) | Acc],
do_index_map(Xs, Fun, Index + 1, Acc@1)
end.
-spec index_map(list(XL), fun((integer(), XL) -> XN)) -> list(XN).
index_map(List, Fun) ->
do_index_map(List, Fun, 0, []).
-spec do_try_map(list(XP), fun((XP) -> {ok, XR} | {error, XS}), list(XR)) -> {ok,
list(XR)} |
{error, XS}.
do_try_map(List, Fun, Acc) ->
case List of
[] ->
{ok, reverse(Acc)};
[X | Xs] ->
case Fun(X) of
{ok, Y} ->
do_try_map(Xs, Fun, [Y | Acc]);
{error, Error} ->
{error, Error}
end
end.
-spec try_map(list(XZ), fun((XZ) -> {ok, YB} | {error, YC})) -> {ok, list(YB)} |
{error, YC}.
try_map(List, Fun) ->
do_try_map(List, Fun, []).
-spec drop(list(YI), integer()) -> list(YI).
drop(List, N) ->
case N =< 0 of
true ->
List;
false ->
case List of
[] ->
[];
[_ | Xs] ->
drop(Xs, N - 1)
end
end.
-spec do_take(list(YL), integer(), list(YL)) -> list(YL).
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.
-spec take(list(YP), integer()) -> list(YP).
take(List, N) ->
do_take(List, N, []).
-spec new() -> list(any()).
new() ->
[].
-spec append(list(YU), list(YU)) -> list(YU).
append(First, Second) ->
lists:append(First, Second).
-spec prepend(list(AAC), AAC) -> list(AAC).
prepend(List, Item) ->
[Item | List].
-spec reverse_and_prepend(list(AAF), list(AAF)) -> list(AAF).
reverse_and_prepend(Prefix, Suffix) ->
case Prefix of
[] ->
Suffix;
[First | Rest] ->
reverse_and_prepend(Rest, [First | Suffix])
end.
-spec do_concat(list(list(AAJ)), list(AAJ)) -> list(AAJ).
do_concat(Lists, Acc) ->
case Lists of
[] ->
reverse(Acc);
[List | Further_lists] ->
do_concat(Further_lists, reverse_and_prepend(List, Acc))
end.
-spec concat(list(list(AAO))) -> list(AAO).
concat(Lists) ->
do_concat(Lists, []).
-spec flatten(list(list(AAS))) -> list(AAS).
flatten(Lists) ->
do_concat(Lists, []).
-spec flat_map(list(AAW), fun((AAW) -> list(AAY))) -> list(AAY).
flat_map(List, Fun) ->
_pipe = map(List, Fun),
concat(_pipe).
-spec fold(list(ABB), ABD, fun((ABD, ABB) -> ABD)) -> ABD.
fold(List, Initial, Fun) ->
case List of
[] ->
Initial;
[X | Rest] ->
fold(Rest, Fun(Initial, X), Fun)
end.
-spec group(list(VD), fun((VD) -> VF)) -> gleam@map:map_(VF, list(VD)).
group(List, Key) ->
fold(List, gleam@map:new(), update_group(Key)).
-spec map_fold(list(XB), XD, fun((XD, XB) -> {XD, XE})) -> {XD, list(XE)}.
map_fold(List, Acc, Fun) ->
_pipe = fold(
List,
{Acc, []},
fun(Acc@1, Item) ->
{Current_acc, Items} = Acc@1,
{Next_acc, Next_item} = Fun(Current_acc, Item),
{Next_acc, [Next_item | Items]}
end
),
gleam@pair:map_second(_pipe, fun reverse/1).
-spec fold_right(list(ABE), ABG, fun((ABG, ABE) -> ABG)) -> ABG.
fold_right(List, Initial, Fun) ->
case List of
[] ->
Initial;
[X | Rest] ->
Fun(fold_right(Rest, Initial, Fun), X)
end.
-spec do_index_fold(
list(ABH),
ABJ,
fun((ABJ, ABH, integer()) -> ABJ),
integer()
) -> ABJ.
do_index_fold(Over, Acc, With, Index) ->
case Over of
[] ->
Acc;
[First | Rest] ->
do_index_fold(Rest, With(Acc, First, Index), With, Index + 1)
end.
-spec index_fold(list(ABK), ABM, fun((ABM, ABK, integer()) -> ABM)) -> ABM.
index_fold(Over, Initial, Fun) ->
do_index_fold(Over, Initial, Fun, 0).
-spec try_fold(list(ABN), ABP, fun((ABP, ABN) -> {ok, ABP} | {error, ABQ})) -> {ok,
ABP} |
{error, ABQ}.
try_fold(Collection, Accumulator, Fun) ->
case Collection of
[] ->
{ok, Accumulator};
[First | Rest] ->
case Fun(Accumulator, First) of
{ok, Result} ->
try_fold(Rest, Result, Fun);
{error, _} = Error ->
Error
end
end.
-spec fold_until(list(ABV), ABX, fun((ABX, ABV) -> continue_or_stop(ABX))) -> ABX.
fold_until(Collection, Accumulator, Fun) ->
case Collection of
[] ->
Accumulator;
[First | Rest] ->
case Fun(Accumulator, First) of
{continue, Next_accumulator} ->
fold_until(Rest, Next_accumulator, Fun);
{stop, B} ->
B
end
end.
-spec find(list(ABZ), fun((ABZ) -> boolean())) -> {ok, ABZ} | {error, nil}.
find(Haystack, Is_desired) ->
case Haystack of
[] ->
{error, nil};
[X | Rest] ->
case Is_desired(X) of
true ->
{ok, X};
_ ->
find(Rest, Is_desired)
end
end.
-spec find_map(list(ACD), fun((ACD) -> {ok, ACF} | {error, any()})) -> {ok, ACF} |
{error, nil}.
find_map(Haystack, Fun) ->
case Haystack of
[] ->
{error, nil};
[X | Rest] ->
case Fun(X) of
{ok, X@1} ->
{ok, X@1};
_ ->
find_map(Rest, Fun)
end
end.
-spec all(list(ACL), fun((ACL) -> boolean())) -> boolean().
all(List, Predicate) ->
case List of
[] ->
true;
[First | Rest] ->
case Predicate(First) of
true ->
all(Rest, Predicate);
false ->
false
end
end.
-spec any(list(ACN), fun((ACN) -> boolean())) -> boolean().
any(List, Predicate) ->
case List of
[] ->
false;
[First | Rest] ->
case Predicate(First) of
true ->
true;
false ->
any(Rest, Predicate)
end
end.
-spec do_zip(list(ACP), list(ACR), list({ACP, ACR})) -> list({ACP, ACR}).
do_zip(Xs, Ys, Acc) ->
case {Xs, Ys} of
{[X | Xs@1], [Y | Ys@1]} ->
do_zip(Xs@1, Ys@1, [{X, Y} | Acc]);
{_, _} ->
reverse(Acc)
end.
-spec zip(list(ACV), list(ACX)) -> list({ACV, ACX}).
zip(List, Other) ->
do_zip(List, Other, []).
-spec strict_zip(list(ADA), list(ADC)) -> {ok, list({ADA, ADC})} |
{error, length_mismatch()}.
strict_zip(List, Other) ->
case length(List) =:= length(Other) of
true ->
{ok, zip(List, Other)};
false ->
{error, length_mismatch}
end.
-spec do_unzip(list({ASY, ASZ}), list(ASY), list(ASZ)) -> {list(ASY), list(ASZ)}.
do_unzip(Input, Xs, Ys) ->
case Input of
[] ->
{reverse(Xs), reverse(Ys)};
[{X, Y} | Rest] ->
do_unzip(Rest, [X | Xs], [Y | Ys])
end.
-spec unzip(list({ADL, ADM})) -> {list(ADL), list(ADM)}.
unzip(Input) ->
do_unzip(Input, [], []).
-spec do_intersperse(list(ADQ), ADQ, list(ADQ)) -> list(ADQ).
do_intersperse(List, Separator, Acc) ->
case List of
[] ->
reverse(Acc);
[X | Rest] ->
do_intersperse(Rest, Separator, [X, Separator | Acc])
end.
-spec intersperse(list(ADU), ADU) -> list(ADU).
intersperse(List, Elem) ->
case List of
[] ->
List;
[_] ->
List;
[X | Rest] ->
do_intersperse(Rest, Elem, [X])
end.
-spec at(list(ADX), integer()) -> {ok, ADX} | {error, nil}.
at(List, Index) ->
case Index >= 0 of
true ->
_pipe = List,
_pipe@1 = drop(_pipe, Index),
first(_pipe@1);
false ->
{error, nil}
end.
-spec unique(list(AEB)) -> list(AEB).
unique(List) ->
case List of
[] ->
[];
[X | Rest] ->
[X | unique(filter(Rest, fun(Y) -> Y /= X end))]
end.
-spec merge_up(
integer(),
integer(),
list(AEE),
list(AEE),
list(AEE),
fun((AEE, AEE) -> gleam@order:order())
) -> list(AEE).
merge_up(Na, Nb, A, B, Acc, Compare) ->
case {Na, Nb, A, B} of
{0, 0, _, _} ->
Acc;
{_, 0, [Ax | Ar], _} ->
merge_up(Na - 1, Nb, Ar, B, [Ax | Acc], Compare);
{0, _, _, [Bx | Br]} ->
merge_up(Na, Nb - 1, A, Br, [Bx | Acc], Compare);
{_, _, [Ax@1 | Ar@1], [Bx@1 | Br@1]} ->
case Compare(Ax@1, Bx@1) of
gt ->
merge_up(Na, Nb - 1, A, Br@1, [Bx@1 | Acc], Compare);
_ ->
merge_up(Na - 1, Nb, Ar@1, B, [Ax@1 | Acc], Compare)
end
end.
-spec merge_down(
integer(),
integer(),
list(AEJ),
list(AEJ),
list(AEJ),
fun((AEJ, AEJ) -> gleam@order:order())
) -> list(AEJ).
merge_down(Na, Nb, A, B, Acc, Compare) ->
case {Na, Nb, A, B} of
{0, 0, _, _} ->
Acc;
{_, 0, [Ax | Ar], _} ->
merge_down(Na - 1, Nb, Ar, B, [Ax | Acc], Compare);
{0, _, _, [Bx | Br]} ->
merge_down(Na, Nb - 1, A, Br, [Bx | Acc], Compare);
{_, _, [Ax@1 | Ar@1], [Bx@1 | Br@1]} ->
case Compare(Bx@1, Ax@1) of
lt ->
merge_down(Na - 1, Nb, Ar@1, B, [Ax@1 | Acc], Compare);
_ ->
merge_down(Na, Nb - 1, A, Br@1, [Bx@1 | Acc], Compare)
end
end.
-spec merge_sort(
list(AEO),
integer(),
fun((AEO, AEO) -> gleam@order:order()),
boolean()
) -> list(AEO).
merge_sort(L, Ln, Compare, Down) ->
N = Ln div 2,
A = L,
B = drop(L, N),
case Ln < 3 of
true ->
case Down of
true ->
merge_down(N, Ln - N, A, B, [], Compare);
false ->
merge_up(N, Ln - N, A, B, [], Compare)
end;
false ->
case Down of
true ->
merge_down(
N,
Ln - N,
merge_sort(A, N, Compare, false),
merge_sort(B, Ln - N, Compare, false),
[],
Compare
);
false ->
merge_up(
N,
Ln - N,
merge_sort(A, N, Compare, true),
merge_sort(B, Ln - N, Compare, true),
[],
Compare
)
end
end.
-spec sort(list(AER), fun((AER, AER) -> gleam@order:order())) -> list(AER).
sort(List, Compare) ->
merge_sort(List, length(List), Compare, true).
-spec tail_recursive_range(integer(), integer(), list(integer())) -> list(integer()).
tail_recursive_range(Start, Stop, Acc) ->
case gleam@int:compare(Start, Stop) of
eq ->
[Stop | Acc];
gt ->
tail_recursive_range(Start, Stop + 1, [Stop | Acc]);
lt ->
tail_recursive_range(Start, Stop - 1, [Stop | Acc])
end.
-spec range(integer(), integer()) -> list(integer()).
range(Start, Stop) ->
tail_recursive_range(Start, Stop, []).
-spec do_repeat(AEX, integer(), list(AEX)) -> list(AEX).
do_repeat(A, Times, Acc) ->
case Times =< 0 of
true ->
Acc;
false ->
do_repeat(A, Times - 1, [A | Acc])
end.
-spec repeat(AFA, integer()) -> list(AFA).
repeat(A, Times) ->
do_repeat(A, Times, []).
-spec do_split(list(AFC), integer(), list(AFC)) -> {list(AFC), list(AFC)}.
do_split(List, N, Taken) ->
case N =< 0 of
true ->
{reverse(Taken), List};
false ->
case List of
[] ->
{reverse(Taken), []};
[X | Xs] ->
do_split(Xs, N - 1, [X | Taken])
end
end.
-spec split(list(AFH), integer()) -> {list(AFH), list(AFH)}.
split(List, Index) ->
do_split(List, Index, []).
-spec do_split_while(list(AFL), fun((AFL) -> boolean()), list(AFL)) -> {list(AFL),
list(AFL)}.
do_split_while(List, F, Acc) ->
case List of
[] ->
{reverse(Acc), []};
[X | Xs] ->
case F(X) of
false ->
{reverse(Acc), List};
_ ->
do_split_while(Xs, F, [X | Acc])
end
end.
-spec split_while(list(AFQ), fun((AFQ) -> boolean())) -> {list(AFQ), list(AFQ)}.
split_while(List, Predicate) ->
do_split_while(List, Predicate, []).
-spec key_find(list({AFU, AFV}), AFU) -> {ok, AFV} | {error, nil}.
key_find(Keyword_list, Desired_key) ->
find_map(
Keyword_list,
fun(Keyword) ->
{Key, Value} = Keyword,
case Key =:= Desired_key of
true ->
{ok, Value};
false ->
{error, nil}
end
end
).
-spec do_pop(list(AWI), fun((AWI) -> boolean()), list(AWI)) -> {ok,
{AWI, list(AWI)}} |
{error, nil}.
do_pop(Haystack, Predicate, Checked) ->
case Haystack of
[] ->
{error, nil};
[X | Rest] ->
case Predicate(X) of
true ->
{ok, {X, append(reverse(Checked), Rest)}};
false ->
do_pop(Rest, Predicate, [X | Checked])
end
end.
-spec pop(list(AGD), fun((AGD) -> boolean())) -> {ok, {AGD, list(AGD)}} |
{error, nil}.
pop(Haystack, Is_desired) ->
do_pop(Haystack, Is_desired, []).
-spec do_pop_map(list(AWW), fun((AWW) -> {ok, AXJ} | {error, any()}), list(AWW)) -> {ok,
{AXJ, list(AWW)}} |
{error, nil}.
do_pop_map(Haystack, Mapper, Checked) ->
case Haystack of
[] ->
{error, nil};
[X | Rest] ->
case Mapper(X) of
{ok, Y} ->
{ok, {Y, append(reverse(Checked), Rest)}};
{error, _} ->
do_pop_map(Rest, Mapper, [X | Checked])
end
end.
-spec pop_map(list(AGM), fun((AGM) -> {ok, AGO} | {error, any()})) -> {ok,
{AGO, list(AGM)}} |
{error, nil}.
pop_map(Haystack, Is_desired) ->
do_pop_map(Haystack, Is_desired, []).
-spec key_pop(list({AGV, AGW}), AGV) -> {ok, {AGW, list({AGV, AGW})}} |
{error, nil}.
key_pop(Haystack, Key) ->
pop_map(
Haystack,
fun(Entry) ->
{K, V} = Entry,
case K of
K@1 when K@1 =:= Key ->
{ok, V};
_ ->
{error, nil}
end
end
).
-spec key_set(list({AHB, AHC}), AHB, AHC) -> list({AHB, AHC}).
key_set(List, Key, Value) ->
case List of
[] ->
[{Key, Value}];
[{K, _} | Rest] when K =:= Key ->
[{Key, Value} | Rest];
[First | Rest@1] ->
[First | key_set(Rest@1, Key, Value)]
end.
-spec each(list(AHF), fun((AHF) -> any())) -> nil.
each(List, F) ->
case List of
[] ->
nil;
[X | Xs] ->
F(X),
each(Xs, F)
end.
-spec try_each(list(AHI), fun((AHI) -> {ok, any()} | {error, AHL})) -> {ok, nil} |
{error, AHL}.
try_each(List, Fun) ->
case List of
[] ->
{ok, nil};
[X | Xs] ->
case Fun(X) of
{ok, _} ->
try_each(Xs, Fun);
{error, E} ->
{error, E}
end
end.
-spec do_partition(list(AYQ), fun((AYQ) -> boolean()), list(AYQ), list(AYQ)) -> {list(AYQ),
list(AYQ)}.
do_partition(List, Categorise, Trues, Falses) ->
case List of
[] ->
{reverse(Trues), reverse(Falses)};
[X | Xs] ->
case Categorise(X) of
true ->
do_partition(Xs, Categorise, [X | Trues], Falses);
false ->
do_partition(Xs, Categorise, Trues, [X | Falses])
end
end.
-spec partition(list(AHV), fun((AHV) -> boolean())) -> {list(AHV), list(AHV)}.
partition(List, Categorise) ->
do_partition(List, Categorise, [], []).
-spec permutations(list(AHZ)) -> list(list(AHZ)).
permutations(L) ->
case L of
[] ->
[[]];
_ ->
_pipe = L,
_pipe@5 = index_map(_pipe, fun(I_idx, I) -> _pipe@1 = L,
_pipe@2 = index_fold(
_pipe@1,
[],
fun(Acc, J, J_idx) -> case I_idx =:= J_idx of
true ->
Acc;
false ->
[J | Acc]
end end
),
_pipe@3 = reverse(_pipe@2),
_pipe@4 = permutations(_pipe@3),
map(_pipe@4, fun(Permutation) -> [I | Permutation] end) end),
concat(_pipe@5)
end.
-spec do_window(list(list(AID)), list(AID), integer()) -> list(list(AID)).
do_window(Acc, L, N) ->
Window = take(L, N),
case length(Window) =:= N of
true ->
do_window([Window | Acc], drop(L, 1), N);
false ->
Acc
end.
-spec window(list(AIJ), integer()) -> list(list(AIJ)).
window(L, N) ->
_pipe = do_window([], L, N),
reverse(_pipe).
-spec window_by_2(list(AIN)) -> list({AIN, AIN}).
window_by_2(L) ->
zip(L, drop(L, 1)).
-spec drop_while(list(AIQ), fun((AIQ) -> boolean())) -> list(AIQ).
drop_while(List, Predicate) ->
case List of
[] ->
[];
[X | Xs] ->
case Predicate(X) of
true ->
drop_while(Xs, Predicate);
false ->
[X | Xs]
end
end.
-spec do_take_while(list(AIT), fun((AIT) -> boolean()), list(AIT)) -> list(AIT).
do_take_while(List, Predicate, Acc) ->
case List of
[] ->
reverse(Acc);
[First | Rest] ->
case Predicate(First) of
true ->
do_take_while(Rest, Predicate, [First | Acc]);
false ->
reverse(Acc)
end
end.
-spec take_while(list(AIX), fun((AIX) -> boolean())) -> list(AIX).
take_while(List, Predicate) ->
do_take_while(List, Predicate, []).
-spec do_chunk(list(AJA), fun((AJA) -> AJC), AJC, list(AJA), list(list(AJA))) -> list(list(AJA)).
do_chunk(List, F, Previous_key, Current_chunk, Acc) ->
case List of
[First | Rest] ->
Key = F(First),
case Key =:= Previous_key of
false ->
New_acc = [reverse(Current_chunk) | Acc],
do_chunk(Rest, F, Key, [First], New_acc);
_ ->
do_chunk(Rest, F, Key, [First | Current_chunk], Acc)
end;
_ ->
reverse([reverse(Current_chunk) | Acc])
end.
-spec chunk(list(AJI), fun((AJI) -> any())) -> list(list(AJI)).
chunk(List, F) ->
case List of
[] ->
[];
[First | Rest] ->
do_chunk(Rest, F, F(First), [First], [])
end.
-spec do_sized_chunk(
list(AJN),
integer(),
integer(),
list(AJN),
list(list(AJN))
) -> list(list(AJN)).
do_sized_chunk(List, Count, Left, Current_chunk, Acc) ->
case List of
[] ->
case Current_chunk of
[] ->
reverse(Acc);
Remaining ->
reverse([reverse(Remaining) | Acc])
end;
[First | Rest] ->
Chunk = [First | Current_chunk],
case Left > 1 of
false ->
do_sized_chunk(
Rest,
Count,
Count,
[],
[reverse(Chunk) | Acc]
);
true ->
do_sized_chunk(Rest, Count, Left - 1, Chunk, Acc)
end
end.
-spec sized_chunk(list(AJU), integer()) -> list(list(AJU)).
sized_chunk(List, Count) ->
do_sized_chunk(List, Count, Count, [], []).
-spec reduce(list(AJY), fun((AJY, AJY) -> AJY)) -> {ok, AJY} | {error, nil}.
reduce(List, Fun) ->
case List of
[] ->
{error, nil};
[First | Rest] ->
{ok, fold(Rest, First, Fun)}
end.
-spec do_scan(list(AKC), AKE, list(AKE), fun((AKE, AKC) -> AKE)) -> list(AKE).
do_scan(List, Accumulator, Accumulated, Fun) ->
case List of
[] ->
reverse(Accumulated);
[X | Xs] ->
Next = Fun(Accumulator, X),
do_scan(Xs, Next, [Next | Accumulated], Fun)
end.
-spec scan(list(AKH), AKJ, fun((AKJ, AKH) -> AKJ)) -> list(AKJ).
scan(List, Initial, Fun) ->
do_scan(List, Initial, [], Fun).
-spec last(list(AKL)) -> {ok, AKL} | {error, nil}.
last(List) ->
_pipe = List,
reduce(_pipe, fun(_, Elem) -> Elem end).
-spec combinations(list(AKP), integer()) -> list(list(AKP)).
combinations(Items, N) ->
case N of
0 ->
[[]];
_ ->
case Items of
[] ->
[];
[X | Xs] ->
First_combinations = begin
_pipe = map(
combinations(Xs, N - 1),
fun(Com) -> [X | Com] end
),
reverse(_pipe)
end,
fold(
First_combinations,
combinations(Xs, N),
fun(Acc, C) -> [C | Acc] end
)
end
end.
-spec do_combination_pairs(list(AKT)) -> list(list({AKT, AKT})).
do_combination_pairs(Items) ->
case Items of
[] ->
[];
[X | Xs] ->
First_combinations = map(Xs, fun(Other) -> {X, Other} end),
[First_combinations | do_combination_pairs(Xs)]
end.
-spec combination_pairs(list(AKX)) -> list({AKX, AKX}).
combination_pairs(Items) ->
_pipe = do_combination_pairs(Items),
concat(_pipe).
-spec transpose(list(list(ALE))) -> list(list(ALE)).
transpose(List_of_list) ->
Take_first = fun(List) -> case List of
[] ->
[];
[F] ->
[F];
[F@1 | _] ->
[F@1]
end end,
case List_of_list of
[] ->
[];
[[] | Xss] ->
transpose(Xss);
Rows ->
Firsts = begin
_pipe = Rows,
_pipe@1 = map(_pipe, Take_first),
concat(_pipe@1)
end,
Rest = transpose(map(Rows, fun(_capture) -> drop(_capture, 1) end)),
[Firsts | Rest]
end.
-spec interleave(list(list(ALA))) -> list(ALA).
interleave(List) ->
_pipe = transpose(List),
concat(_pipe).
-spec do_shuffle_pair_unwrap(list({float(), ALJ}), list(ALJ)) -> list(ALJ).
do_shuffle_pair_unwrap(List, Acc) ->
case List of
[] ->
Acc;
_ ->
[Elem_pair | Enumerable] = List,
do_shuffle_pair_unwrap(
Enumerable,
[erlang:element(2, Elem_pair) | Acc]
)
end.
-spec do_shuffle_by_pair_indexes(list({float(), ALN})) -> list({float(), ALN}).
do_shuffle_by_pair_indexes(List_of_pairs) ->
sort(
List_of_pairs,
fun(A_pair, B_pair) ->
gleam@float:compare(
erlang:element(1, A_pair),
erlang:element(1, B_pair)
)
end
).
-spec shuffle(list(ALQ)) -> list(ALQ).
shuffle(List) ->
_pipe = List,
_pipe@1 = fold(
_pipe,
[],
fun(Acc, A) -> [{gleam@float:random(0.0, 1.0), A} | Acc] end
),
_pipe@2 = do_shuffle_by_pair_indexes(_pipe@1),
do_shuffle_pair_unwrap(_pipe@2, []).