template C { let array = 0...3; let new_array = array |> Base:Array.append([4]); let new_array_2 = array |> Base:Array.append([4, 5, 6]); let merged_array = new_array |> Base:Array.append(5...7); let merged_array_2 = new_array |> Base:Array.append(5...7) |> Base:Array.append([8, 9]); let merged_record = Base:Record.merge({ a: 1, b: 2 }, { c: 3 }); let merged_record_2 = { a: 1, b: 2 } |> Base:Record.merge({ b: 3 }) |> Base:Record.merge({ y: 8 }); let nested_array = new_array |> Base:Array.append([merged_array |> Base:Array.append([merged_record_2])]); let index = 8; let partitioned = merged_array_2 |> Base:Array.partition(fn (item) -> {item % 2 == 0}); let even = partitioned[0]; let odd = partitioned[1];
{array} {new_array} {new_array_2} {merged_array} {merged_array_2} {merged_record} {merged_record_2} {nested_array[2 + 3 * 1][index]["y"]} {nested_array[2 + 3 * 1][index].y} {even} {odd} {merged_array_2 |> Base:Array.keep(fn (item) -> {item % 2 == 0})} {if (merged_array_2 |> Base:Array.find(fn (item) -> {item == 3})) { "FOUND" } else { "NOT FOUND" }} {if merged_array_2 |> Base:Array.find(fn (item) -> {item == -10}) { "FOUND" } else { "NOT FOUND" }} {even |> Base:Array.every(fn (item) -> {item % 2 == 0})} {merged_array_2 |> Base:Array.some(fn (item) -> {item % 2 == 0})} {merged_array_2 |> Base:Array.every(fn (item) -> {item % 2 == 0})} {merged_array_2 |> Base:Array.some(fn (item) -> {item < 0})} { Base:Array.make(6) |> Base:Array.map(fn (item) -> item + 1) |> Base:Array.reduce(0, fn (acc, item) -> item + acc) } {merged_array_2 |> Base:Array.take_until(fn item -> item == 5)} {1...10 |> Base:Array.slice(2, 5)} { ["1", "2", "3", "4", "5", "6", "7", "8", "9", "10"] |> Base:Array.chunk(3) |> Base:Array.map(fn chunk -> Base:Array.join(chunk, ",")) |> Base:Array.map(fn item ->
{item}
) } {[5, 1, 2, 3, 6, 3, 4, 7] |> Base:Array.sort(fn (a, b) -> a - b)} {[1, 1, 2, 3, 4, 3, 4, 7] |> Base:Array.unique}
}