import raw ("scripts/containers/containers-tests.assembly.lp"). Test = type predicate{ common }. FnAnns = type predicate{ test(kind:: Test) } min = function(x:: [int]; csize(5)):: int { loop fold((x:: [int]; csize(5))->el:: int, 1000->min):: int { if (el < min):: int { el } else { min } } } min2 = function(x:: [int]; fly(csize(5))):: int { loop fold((x:: [int]; fly(csize(5)))->el:: int, 1000->min):: int { if (el < min):: int { el } else { min } } } Rec = type {x:: int, y:: int}. fn-RecUpdateInLoop1 = function(base:: int):: int { fields = intrinsic fields("Rec"):: [string]; i12n(on()). result = loop fold(fields->field:: string, {undef, 0}->ctx):: {rec:: Rec, id:: int} { { (ctx["rec"]::Rec) : {[field] = base + ctx["id"] }, ctx["id"]+1 }:: {rec:: Rec, id:: int} }. result["rec"]["y"] } fn-Keys1 = function:: int { data = {16, 3, 2, 5}:: [int]; csize(4). keys = intrinsic keys(data):: [int]; range(). loop fold(keys-> key:: int, 0->sum):: int { sum + key } } fn-ArrayArg1 = function:: int; test(common()) { a = {3, 2, 1, 4, 5}:: [int]; csize(5). min(a) } fn-FlyArg1 = function:: int; test(common()) { a = {3, 2, 1, 4, 5}:: [int]; csize(5). b = loop map(a->x:: int):: [int]; fly(csize(5)) { 8 * x :: int }. min2(b) } fn-Range1 = function:: int; test(common()) { range = [1..5]:: [int]; range(). loop fold(range->x:: int, 0->sum):: int { sum + x } } fn-Range2 = function:: int; test(common()) { range1 = [1..5]:: [int]; range(). range2 = loop map (range1->x:: int):: [int]; fly(range()) {2 * x:: int}. loop fold(range2->x:: int, 0->sum):: int {sum + x} } fn-GenRange1 = function:: [int]; range() { [1..5]:: [int]; range() } fn-RetRange1 = function:: int; test(common()) { loop fold((fn-GenRange1()::[int]; range()) -> x:: int, 0->sum):: int { sum + x } } fn-FoldLambdaBoundVars1 = function(scale::int, offset:: int):: int { data = [1..8]:: [int]; range(). data2 = loop map(data->el:: int):: [int]; fly(range()) { scale * el + offset:: int //scale * el:: int }. loop fold(data2->el:: int, 0->sum):: int { el + sum } } fn-reorder1 = function(div:: int):: int; allocapad("global") { arr = {2, 4, 6, 8}:: [int]; csize(4). idx = {3, 1}:: [int]; csize(2). arr2 = reorder(arr, idx):: [int]; fly(csize(2)). loop fold(arr2->divisor::int, div->quotent):: int { quotent / divisor } } reorder = function(aggrSrc:: [int];csize(4), idxs::[int];csize(2)):: [int];fly(csize(2)) { loop map(idxs->idx:: int)::[int]; fly(csize(2));alloca("global") { aggrSrc[idx]::int } } reorder2 = function(aggrSrc:: [int];csize(4), idxs::[int];fly(range())):: [int];fly(fly(range())) { loop map(idxs->idx:: int)::[int]; fly(fly(range())) { aggrSrc[idx]::int } } reverse = function(aggrSrc::[int]; csize(4))::[int];fly(fly(range())) { sizeDst = 4:: int. idxsDst = intrinsic keys(aggrSrc):: [int]; range(). idxsTnsf = loop map(idxsDst-> idx:: int):: [int]; fly(range()); alloca("main") { sizeDst - (idx + 1):: int }. reorder2(aggrSrc, idxsTnsf) } fn-LastLess1 = function(limit:: int):: int; allocapad("main") { aggr = {15, 19, 3, 9}:: [int]. loop fold((reverse(aggr)::[int];fly(fly(range())))->x:: int, 0->acc):: int { if (x < limit):: int { x } else { acc } } }