summaryrefslogtreecommitdiff
path: root/tests/arr2.toc
blob: 7e29a9565807eeb8957d3a9667229f229e40a6f5 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include "std/mem.toc";
#include "std/io.toc";

// it would be nice if Arr.data.len == Arr.len (: but this will require some C code...
Arr ::= fn (t :: Type) Type {
	return struct {
		data : []t;
		len, cap : int;
	};
};

arr_add ::= fn(t ::=, a : &Arr(t), x : t) {
	if a.len >= a.cap {
		a.cap = a.cap * 2 + 2;
		new_data := news(t, a.cap);
		for i := 0..a.len-1 {
			new_data[i] = a.data[i];
		}
		a.data = new_data;
	}
	a.data[a.len] = x;
	a.len += 1;
};

square ::= fn(t ::=, x : t) t {
	a : Arr(t);
	for i := 1,2..2*x-1 {
		arr_add(&a, i);
	};
	sum := 0 as t;
	for i := 0..a.len-1 {
		sum += a.data[i];
	};
	return sum;
};


// ArrInt ::= Arr(int);

inc ::= fn(t ::=, x : t) t {
	return x + 1;
};

main ::= fn() {
	arr : Arr(int);
	farr : Arr(float);
	for i := 1..100 {	
		arr_add(&arr, inc(square(i)));
		arr_add(&farr, inc(square(i as float)));
	}
	for i := 0..arr.len - 1 {
		puti(arr.data[i]);
	}
	for i := 0..farr.len - 1 {
		putf(farr.data[i]);
	}
};