// growable arrays of the sized types and f32: []u8, []i16, []f32
fn put_f(x) { asm { x @ #1220 } return 0; }
fn sp() { put_c(32); return 0; }
fn main() {
	[]u8 b = new([]u8, 0);
	[]i16 h = new([]i16, 3);
	[]f32 f = new([]f32, 0);
	int i = 0, s = 0;
	while (i < 100) { push(b, i * 7); i++; }
	i = 0;
	while (i < 100) { s = s + b[i]; i++; }
	put_n(len(b)); sp(); put_n(s); sp(); put_n(b[99]); sp();
	b[5] = 300; put_n(b[5]); sp();
	put_n(pop(b)); sp(); put_n(len(b)); sp();
	h[0] = 40000; h[2] = 0 - 5; push(h, 70000);
	put_n(h[0]); sp(); put_n(h[1]); sp(); put_n(h[2]); sp(); put_n(h[3]); sp();
	push(f, 0.1); push(f, 2.5); push(f, 1.0);
	put_n(f[0] == 0.1); sp(); put_f(f[1]); sp(); put_f(f[0] + f[2]); sp();
	resize(b, 3); resize(b, 12);
	put_n(b[2]); put_n(b[3]); put_n(b[11]); sp();
	put_n(cap(b) >= 12);
	put_c(10);
	free(d*b); free(d*h); free(d*f);
	second();
	return 0;
}
o3 int sumv([]u8 v) {
	int s = 0;
	for (int i = 0; i < len(v); i++) s += v[i];
	return s;
}
fn second() {
	[]u8 v = new([]u8, 0);
	int i = 0;
	while (i < 300) { push(v, i); i++; }
	put_n(sumv(v)); put_c(10);
	free(d*v);
	return 0;
}