toni/zern
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

double dot in for ranges

Browse Source
This commit is contained in:
Antoni Piasecki
2025-06-13 16:59:22 +02:00
parent a93274d8ac
commit 7425ab256b
19 changed files with 43 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
examples/arrays.zr
View File

@@ -4,7 +4,7 @@ func main[] : I64
Array.push(xs, 6533)
Array.push(xs, 4574)
for i in 0:Array.size(xs)
for i in 0..Array.size(xs)
xs
|> Array.nth(i)
|> print_i64()

2
examples/euler1.zr
View File

@@ -1,7 +1,7 @@
func main[] : I64
let sum: I64 = 0
for i in 0:1000
for i in 0..1000
if i % 5 == 0 || i % 3 == 0
sum = sum + i
print_i64(sum)

2
examples/euler10.zr
View File

@@ -1,7 +1,7 @@
func main[] : I64
let sum: I64 = 0
for i in 0:2000000
for i in 0..2000000
if Math.is_prime(i)
sum = sum + i
print_i64(sum)

2
examples/euler12.zr
View File

@@ -2,7 +2,7 @@ func num_divisors[n: I64] : I64
let end: I64 = Math.isqrt(n)
let result: I64 = 0
for i in 1:end+1
for i in 1..end+1
if n % i == 0
result = result + 2

2
examples/euler14.zr
View File

@@ -14,7 +14,7 @@ func main[] : I64
let max: I64 = 0
let max_index: I64 = 0
for i in 1:1000000
for i in 1..1000000
let seq: I64 = collatz_seq(i)
if seq > max
max = seq

2
examples/euler15.zr
View File

@@ -3,7 +3,7 @@ func main[] : I64
let r: I64 = 20
let out: I64 = 1
for i in 1:r+1
for i in 1..r+1
out = out * (n - (r - i)) / i
print_i64(out)

4
examples/euler4.zr
View File

@@ -1,8 +1,8 @@
func main[] : I64
let out: I64 = 0
for a in 500:1000
for b in 500:1000
for a in 500..1000
for b in 500..1000
if a * b > out
let s: String = I64.to_string(a * b)
let s_rev: String = String.rev(s)

2
examples/euler5.zr
View File

@@ -1,6 +1,6 @@
func main[] : I64
let out: I64 = 1
for i in 1:21
for i in 1..21
out = Math.lcm(out, i)
print_i64(out)

4
examples/euler6.zr
View File

@@ -1,10 +1,10 @@
func main[] : I64
let sum_of_squares: I64 = 0
for i in 1:101
for i in 1..101
sum_of_squares = sum_of_squares + i * i
let square_of_sum: I64 = 0
for i in 1:101
for i in 1..101
square_of_sum = square_of_sum + i
square_of_sum = square_of_sum * square_of_sum

2
examples/euler8.zr
View File

@@ -3,7 +3,7 @@ func main[] : I64
let out: I64 = 0
let max: I64 = strlen(n) - 13
for i in 0:max
for i in 0..max
let s: I64 = 1
let j: I64 = 0
while j < 13

4
examples/euler9.zr
View File

@@ -1,6 +1,6 @@
func main[] : I64
for a in 1:1000
for b in 1:1000
for a in 1..1000
for b in 1..1000
let c: I64 = 1000 - b - a
if a * a + b * b == c * c
print_i64(a * b * c)

6
examples/quicksort.zr
View File

@@ -12,7 +12,7 @@ func do_quicksort[arr: Array, low: I64, high: I64] : I64
func partition[arr: Array, low: I64, high: I64] : I64
let pivot: I64 = Array.nth(arr, high)
let i: I64 = low - 1
for j in low:high
for j in (low)..high
if Array.nth(arr, j) <= pivot
i = i + 1
let temp: I64 = Array.nth(arr, i)
@@ -26,11 +26,11 @@ func partition[arr: Array, low: I64, high: I64] : I64
func main[] : I64
let arr: Array = [340, 252, 352, 117, 650, 652, 322, 175, 714, 268, 725, 664]
for i in 0:Array.size(arr)
for i in 0..Array.size(arr)
print_i64(Array.nth(arr, i))
print("------------")
quicksort(arr)
for i in 0:Array.size(arr)
for i in 0..Array.size(arr)
print_i64(Array.nth(arr, i))

8
examples/rule110.zr
View File

@@ -1,7 +1,7 @@
func rule110_step[state: Array] : Array
let new_state: Array = []
for i in 0:Array.size(state)
for i in 0..Array.size(state)
let left: Bool = false
if i - 1 >= 0
left = Array.nth(state, i-1)
@@ -16,7 +16,7 @@ func rule110_step[state: Array] : Array
func to_str[state: Array]: String
let out: String = malloc(Array.size(state))
for i in 0:Array.size(state)
for i in 0..Array.size(state)
if Array.nth(state, i)
String.set(out, i, String.nth("#", 0))
else
@@ -27,11 +27,11 @@ func main[] : I64
let SIZE: I64 = 60
let state: Array = []
for i in 0:SIZE
for i in 0..SIZE
Array.push(state, false)
Array.push(state, true)
print(to_str(state))
for i in 0:SIZE
for i in 0..SIZE
state = rule110_step(state)
print(to_str(state))