add missing trailing newlines

2026-03-11 14:58:22 +01:00
parent b79cd46b4b
commit d1b65dc1ed
45 changed files with 45 additions and 45 deletions
--- a/examples/puzzles/aoc2024_01.zr
+++ b/examples/puzzles/aoc2024_01.zr
@@ -32,4 +32,4 @@ func main[] : i64
    alg.quicksort(l2)

    part1(l1, l2)
-    part2(l1, l2)
+    part2(l1, l2)
--- a/examples/puzzles/aoc2024_02.zr
+++ b/examples/puzzles/aoc2024_02.zr
@@ -51,4 +51,4 @@ func main[] : i64
        array.push(data, report)

    part1(data)
-    part2(data)
+    part2(data)
--- a/examples/puzzles/aoc2024_04.zr
+++ b/examples/puzzles/aoc2024_04.zr
@@ -59,4 +59,4 @@ func main[] : i64
    let lines: array = io.read_file("input.txt") |> str.split("\n")

    part1(lines)
-    part2(lines)
+    part2(lines)
--- a/examples/puzzles/aoc2024_05.zr
+++ b/examples/puzzles/aoc2024_05.zr
@@ -70,4 +70,4 @@ func main[] : i64
        array.push(updates, xs)

    part1(updates, rules_left, rules_right)
-    part2(updates, rules_left, rules_right)
+    part2(updates, rules_left, rules_right)
--- a/examples/puzzles/aoc2024_07.zr
+++ b/examples/puzzles/aoc2024_07.zr
@@ -74,4 +74,4 @@ func main[] : i64
        array.push(equations, [str.parse_i64(array.nth(parts, 0)), xs])

    part1(equations)
-    part2(equations)
+    part2(equations)
--- a/examples/puzzles/aoc2025_01.zr
+++ b/examples/puzzles/aoc2025_01.zr
@@ -50,4 +50,4 @@ func main[] : i64
    let lines: array = io.read_file("input.txt") |> str.split("\n")

    part1(lines)
-    part2(lines)
+    part2(lines)
--- a/examples/puzzles/aoc2025_02.zr
+++ b/examples/puzzles/aoc2025_02.zr
@@ -57,4 +57,4 @@ func main[] : i64
    let ranges: array = io.read_file("input.txt") |> str.split(",")

    part1(ranges)
-    part2(ranges)
+    part2(ranges)
--- a/examples/puzzles/aoc2025_03.zr
+++ b/examples/puzzles/aoc2025_03.zr
@@ -48,4 +48,4 @@ func main[] : i64
    let lines: array = io.read_file("input.txt") |> str.split("\n")

    part1(lines)
-    part2(lines)
+    part2(lines)
--- a/examples/puzzles/euler_00.zr
+++ b/examples/puzzles/euler_00.zr
@@ -5,4 +5,4 @@ func main[] : i64
        if i % 2 != 0
            sum = sum + i * i
    
-    io.println_i64(sum)
+    io.println_i64(sum)
--- a/examples/puzzles/euler_01.zr
+++ b/examples/puzzles/euler_01.zr
@@ -4,4 +4,4 @@ func main[] : i64
    for i in 0..1000
        if i % 5 == 0 || i % 3 == 0
            sum = sum + i
-    io.println_i64(sum)
+    io.println_i64(sum)
--- a/examples/puzzles/euler_02.zr
+++ b/examples/puzzles/euler_02.zr
@@ -10,4 +10,4 @@ func main[] : i64
        b = a + b
        a = temp

-    io.println_i64(sum)
+    io.println_i64(sum)
--- a/examples/puzzles/euler_03.zr
+++ b/examples/puzzles/euler_03.zr
@@ -8,4 +8,4 @@ func main[] : i64
        else
            f = f + 1

-    io.println_i64(n)
+    io.println_i64(n)
--- a/examples/puzzles/euler_04.zr
+++ b/examples/puzzles/euler_04.zr
@@ -10,4 +10,4 @@ func main[] : i64
                    out = a * b
                mem.free(s)
                mem.free(s_rev)
-    io.println_i64(out)
+    io.println_i64(out)
--- a/examples/puzzles/euler_05.zr
+++ b/examples/puzzles/euler_05.zr
@@ -3,4 +3,4 @@ func main[] : i64

    for i in 1..21
        out = math.lcm(out, i)
-    io.println_i64(out)
+    io.println_i64(out)
--- a/examples/puzzles/euler_06.zr
+++ b/examples/puzzles/euler_06.zr
@@ -8,4 +8,4 @@ func main[] : i64
        square_of_sum = square_of_sum + i
    square_of_sum = square_of_sum * square_of_sum

-    io.println_i64(square_of_sum - sum_of_squares)
+    io.println_i64(square_of_sum - sum_of_squares)
--- a/examples/puzzles/euler_07.zr
+++ b/examples/puzzles/euler_07.zr
@@ -8,4 +8,4 @@ func main[] : i64
            if found == 10001
                io.println_i64(i)
                break
-        i = i + 1
+        i = i + 1
--- a/examples/puzzles/euler_08.zr
+++ b/examples/puzzles/euler_08.zr
@@ -11,4 +11,4 @@ func main[] : i64
            j = j + 1
        if s > out
            out = s
-    io.println_i64(out)
+    io.println_i64(out)
--- a/examples/puzzles/euler_09.zr
+++ b/examples/puzzles/euler_09.zr
@@ -4,4 +4,4 @@ func main[] : i64
            let c: i64 = 1000 - b - a
            if a * a + b * b == c * c
                io.println_i64(a * b * c)
-                return 0
+                return 0
--- a/examples/puzzles/euler_10.zr
+++ b/examples/puzzles/euler_10.zr
@@ -4,4 +4,4 @@ func main[] : i64
    for i in 0..2000000
        if math.is_prime(i)
            sum = sum + i
-    io.println_i64(sum)
+    io.println_i64(sum)
--- a/examples/puzzles/euler_11.zr
+++ b/examples/puzzles/euler_11.zr
@@ -33,4 +33,4 @@ func main[] : i64
            let d2: i64 = array.nth(array.nth(grid, i), N-j-1) * array.nth(array.nth(grid, i+1), N-j-2) * array.nth(array.nth(grid, i+2), N-j-3) * array.nth(array.nth(grid, i+3), N-j-4)
            out = math.max(out, math.max(h, math.max(v, math.max(d1, d2))))

-    io.println_i64(out)
+    io.println_i64(out)
--- a/examples/puzzles/euler_12.zr
+++ b/examples/puzzles/euler_12.zr
@@ -18,4 +18,4 @@ func main[] : i64
        if num_divisors(n) > 500
            io.println_i64(n)
            break
-        i = i + 1
+        i = i + 1
--- a/examples/puzzles/euler_13.zr
+++ b/examples/puzzles/euler_13.zr
@@ -3,4 +3,4 @@ func main[] : i64
    37107287533 + 46376937677 + 74324986199 + 91942213363 + 23067588207 + 89261670696 + 28112879812 + 44274228917 + 47451445736 + 70386486105 + 62176457141 + 64906352462 + 92575867718 + 58203565325 + 80181199384 + 35398664372 + 86515506006 + 71693888707 + 54370070576 + 53282654108 + 36123272525 + 45876576172 + 17423706905 + 81142660418 + 51934325451 + 62467221648 + 15732444386 + 55037687525 + 18336384825 + 80386287592 + 78182833757 + 16726320100 + 48403098129 + 87086987551 + 59959406895 + 69793950679 + 41052684708 + 65378607361 + 35829035317 + 94953759765 + 88902802571 + 25267680276 + 36270218540 + 24074486908 + 91430288197 + 34413065578 + 23053081172 + 11487696932 + 63783299490 + 67720186971 + 95548255300 + 76085327132 + 37774242535 + 23701913275 + 29798860272 + 18495701454 + 38298203783 + 34829543829 + 40957953066 + 29746152185 + 41698116222 + 62467957194 + 23189706772 + 86188088225 + 11306739708 + 82959174767 + 97623331044 + 42846280183 + 55121603546 + 32238195734 + 75506164965 + 62177842752 + 32924185707 + 99518671430 + 73267460800 + 76841822524 + 97142617910 + 87783646182 + 10848802521 + 71329612474 + 62184073572 + 66627891981 + 60661826293 + 85786944089 + 66024396409 + 64913982680 + 16730939319 + 94809377245 + 78639167021 + 15368713711 + 40789923115 + 44889911501 + 41503128880 + 81234880673 + 82616570773 + 22918802058 + 77158542502 + 72107838435 + 20849603980 + 53503534226
    |> str.from_i64()
    |> str.substr(0, 10)
-    |> io.println()
+    |> io.println()
--- a/examples/puzzles/euler_14.zr
+++ b/examples/puzzles/euler_14.zr
@@ -19,4 +19,4 @@ func main[] : i64
        if seq > max
            max = seq
            max_index = i
-    io.println_i64(max_index)
+    io.println_i64(max_index)
--- a/examples/puzzles/euler_15.zr
+++ b/examples/puzzles/euler_15.zr
@@ -6,4 +6,4 @@ func main[] : i64
    for i in 1..r+1
        out = out * (n - (r - i)) / i

-    io.println_i64(out)
+    io.println_i64(out)
--- a/examples/puzzles/euler_17.zr
+++ b/examples/puzzles/euler_17.zr
@@ -23,4 +23,4 @@ func main[] : i64
    
    sum = sum + array.nth(s1, 1) + 8

-    io.println_i64(sum)
+    io.println_i64(sum)
--- a/examples/puzzles/euler_19.zr
+++ b/examples/puzzles/euler_19.zr
@@ -19,4 +19,4 @@ func main[] : i64
                sun = sun + 1
            wday = (wday + days(year, mon)) % 7
    
-    io.println_i64(sun)
+    io.println_i64(sun)
--- a/examples/puzzles/euler_20.zr
+++ b/examples/puzzles/euler_20.zr
@@ -18,4 +18,4 @@ func main[] : i64
    for i in 0..array.size(n)
        sum = sum + array.nth(n, i)
    
-    io.println_i64(sum)
+    io.println_i64(sum)
--- a/examples/puzzles/euler_21.zr
+++ b/examples/puzzles/euler_21.zr
@@ -18,4 +18,4 @@ func main[] : i64
        if i < d && i == divisors_sum(d)
            sum = sum + i + d
    
-    io.println_i64(sum)
+    io.println_i64(sum)