summaryrefslogtreecommitdiff
path: root/test.toc
blob: 73d1ad1f51f60cb7200ae6d7a75107012ab51845 (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
58
59
60
61
62
63
64
65
66
67
68
69
70
#include "tests/std/io.toc", io;
#include "tests/std/mem.toc";

z ::= nms {
	Foo ::= struct(f ::= fn() int { return 7; }) {
		x: int;
	}

	Bar ::= fn() &(struct { x, y: int; f ::= fn() int { return 13; } } ) {
		x : u64;
		return &x as &void;
	}


	foo ::= fn() total : int = 0 {
		f: Foo();
		total += f.f();
		total += Bar().f();
	}
}


main ::= fn() {
	nums := news(int, 10);
	for x, i := &nums {
		*x = i*i;
	}
	l := slice_to_ll(nums);
	p := &l;
	while p {
		io.puti(p.head);
		p = p.tail;
	}
	f: Foo;
	f.k = -173;
	f.b = new(Bar);
	f.b.f.b = new(Bar);
	f.b.f.b.f.k = 9;
	io.puti(f.k);
	io.puti(f.b.f.k);
	io.puti(f.b.f.b.f.k);
	x := z.foo();
	y ::= z.foo();
	io.puti(x);
	io.puti(y);
}

slice_to_ll ::= fn(t::=, slice: []t) use ll: LinkedList(t) {
	head = slice[0];
	if slice.len == 1 {
		tail = null;
	} else {
		tail = new(LinkedList(t));
		*tail = slice_to_ll(slice[1:]);
	}
}

LinkedList ::= struct (of :: Type) {
	head: of;
	tail: &LinkedList(of);
}

Foo ::= struct {
	k: int;
	b: &Bar;
}

Bar ::= struct {
	f: Foo;
}