Add for loops

test/tests/for break.ans

@@ -0,0 +1,4 @@
+for(:x, range(10))
+	if(x == 3)
+		break!
+	|{x}

test/tests/for continue.ans

@@ -0,0 +1,4 @@
+for(:x, range(4))
+	if(x == 3)
+		continue!
+	|{x}

test/tests/for invalid iterator.ans

@@ -0,0 +1,2 @@
+for(:x, 42)
+	|{x}

test/tests/for list.ans

@@ -0,0 +1,4 @@
+:l = *[7,96,"a",3]
+
+for(:x, l)
+	|{x}

test/tests/for range.ans

@@ -0,0 +1,27 @@
+|-
+for(:x, range(5))
+	|{x}
+
+|-
+for(:y, range(2, 7))
+	|{y}
+
+|-
+for(:z, range(2, 7, 3))
+	|{z}
+
+|-
+for(:x, range(4, 0, -1))
+	|{x}
+
+|-
+for(:x, range(4, 8, -1))
+	|{x}
+
+|-
+for(:x, range(8, 4))
+	|{x}
+
+|-
+for(:x, range(4, 4))
+	|{x}

test/tests/for struct.ans

@@ -0,0 +1,7 @@
+:s = { "a":"b", 6:"c", 98:5, true:3 }
+:t = *s
+
+/* struct iteration is non deterministic, too lazy to sort, so we check if we have 4 key that each appear at most once */
+for(:k, s)
+	|{t!has(k)}|
+	t(k) = ()

test/tests/for table.ans

@@ -0,0 +1,6 @@
+:s = *{ "a":"b", 6:"c", 98:5, true:3 }
+
+/* struct iteration is non deterministic, too lazy to sort, so we check if we have 4 key that each appear at most once */
+for(:k, s)
+	|{s!has(k)}|
+	s(k) = ()

test/tests/for tuple.ans

@@ -0,0 +1,4 @@
+:t = [2,5,7,1,8]
+
+for(:x, t)
+	|{x}