Something went wrong. Try again.
A component based functional template language
Something went wrong. Try again.
5.5 kB · 280 lines
at main
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281library Base:Array { let make = fn (length) -> { 0..length };
let init = fn (length, f) -> { for (index in make(length)) { f(index) } };
let length = fn (array) -> %%pinc_array_length%%;
let append = fn (array1, array2) -> %%pinc_array_append%%;
let rev = fn (array) -> { let mutable result = [];
for (value in array) { result := append([value], result); };
result };
let first = fn (array) -> { array[0] };
let map = fn (array, f) -> { for (item in array) { f(item) } };
let map_reverse = fn (array, f) -> { for (item in rev(array)) { f(item) } };
let mapi = fn (array, f) -> { for (index, item in array) { f(index, item) } };
let mapi_reverse = fn (array, f) -> { for (index, item in rev(array)) { f(index, item) } };
let last = fn (array) -> { let len = length(array); if (len > 0) { array[len - 1] } };
let take_until = fn (array, condition) -> { for (item in array) { if (condition(item)) { break; }; item } };
let slice = fn (array, offset, length) -> { for (index, item in array) { if (index < offset) { continue; }; if (index == length + offset) { break; }; item } };
let chunk = fn (array, size) -> { let len = length(array); let x = Base:Math.ceil(len / size); 0..x |> mapi(fn (index, item) -> { slice(array, index * size, size) }) };
let join = fn (array, sep) -> { let mutable result = ""; for (index, item in array) { if (index > 0) { result := result ++ sep; }; result := result ++ item; }; result };
let partition = fn (array, condition) -> { let len = length(array); let part = fn (yes, no, index) -> { if (index == len) { [yes, no] } else { let item = array[index]; if (condition(item)) { part(append(yes, [item]), no, index + 1) } else { part(yes, append(no, [item]), index + 1) } } }; part([], [], 0) };
let filter = fn (array, condition) -> { let len = length(array); let aux = fn (acc, index) -> { if (index == len) { acc } else { let item = array[index]; if (condition(item)) { aux(append(acc, [item]), index + 1) } else { aux(acc, index + 1) } } };
aux([], 0) };
let keep = filter;
let find = fn (array, condition) -> { let len = length(array); let aux = fn (index) -> { if (index < len) { let item = array[index]; if (condition(item)) { item } else { aux(index + 1) } } };
aux(0) };
let exists = fn (array, condition) -> { let len = length(array); let aux = fn (index) -> { if (index < len) { let item = array[index]; if (condition(item)) { true } else { aux(index + 1) } } else { false } };
aux(0) };
let some = exists;
let for_all = fn (array, condition) -> { let len = length(array); let aux = fn (acc, index) -> { if (index == len || acc == false) { acc } else { let item = array[index]; aux(acc && condition(item), index + 1) } };
aux(true, 0) };
let every = for_all;
let fold_lefti = fn (array, init, f) -> { let len = length(array); let aux = fn (acc, index) -> { if (index == len || acc == false) { acc } else { let item = array[index]; let acc = f(acc, item, index); aux(acc, index + 1) } };
aux(init, 0) };
let reducei = fold_lefti;
let fold_left = fn (array, init, f) -> { fold_lefti(array, init, fn (acc, curr, index) -> { f(acc, curr) }) };
let reduce = fold_left;
let group = fn (array, size) -> { let array_length = length(array); let group_size = Base:Math.floor(array_length / size);
0..size |> fold_lefti( [], fn (acc, curr, index) -> { append( acc, [slice(array, index * group_size, if (index == size - 1) array_length else group_size)], ) }, ) };
let nth = fn (array, index) -> { array[index] };
let sort = fn (array, f) -> { let merge = fn (a, b) -> { let len_a = length(a); if (len_a == 0) { b } else { let len_b = length(b); if (len_b == 0) { a } else { let first_a = a[0]; let first_b = b[0]; if (f(first_a, first_b) < 0) { append([first_a], merge(slice(a, 1, len_a), b)) } else { append([first_b], merge(a, slice(b, 1, len_b))) } } } };
let len = length(array); if (len < 2) { array } else { let h = Base:Math.ceil(len / 2); let first_half = array |> slice(0, h); let second_half = array |> slice(h, len); merge(sort(first_half, f), sort(second_half, f)) } };
let unique = fn (array) -> { let isSorted = false; let mutable result = []; let mutable seen = [];
for (index, value in array) { if (index == 0 || !exists(seen, fn (item) -> item == value)) { seen := append(seen, [value]); result := append(result, [value]); } };
result };}