blob: 86488db71029936acae2bb5f36c5702eb03b1420 (
plain) (
blame)
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
|
struct point { int x, y; };
struct rect { point a, b; int tag; };
struct list<T> { int len; T* items; };
struct node { int v; node* next; };
type num = int;
int counter = 5;
[4]int squares;
point origin;
int area(rect* r) { return (r.b.x - r.a.x) * (r.b.y - r.a.y); }
list<T>*.u mklist<T>(int cap) {
list<T>* l = new(list<T>);
l.len = 0;
l.items = new(T, cap) as T*;
return u*l;
}
T first<T>(list<T>* l) { return l.items[0]; }
int sum(node* n) { int s = 0; while (n) { s += n.v; n = n.next; } return s; }
fn main() {
rect r;
r.a.x = 1; r.a.y = 2; r.b.x = 4; r.b.y = 6;
put_n(area(&r)); put_c(' ');
put_n(sizeof(rect)); put_c(' '); put_n(sizeof(point)); put_c(' '); put_n(sizeof([3]rect)); put_c(' ');
let p = new(point); // let infers *point
p.x = 7; p->y = 8;
put_n(p.x * p.y); put_c(' ');
free(d*p);
list<int>* l = mklist<int>(4);
l.items[0] = 42; l.len = 1;
put_n(first(l)); put_c(' ');
free(d*l);
node* a = new(node), b = new(node);
a.v = 3; b.v = 4; a.next = b;
put_n(sum(a)); put_c(' ');
free(d*a); // b went with it: a.next = b made a its owner
[3]point pts;
pts[2].y = 9;
put_n(pts[2].y + counter); put_c(' ');
num k = 3;
put_n(k); put_c(10);
// reflection
tprint(typeof(r)); put_c(' '); tprint(typeof(&r)); put_c(' '); tprint(typeof(l)); put_c(' ');
tprint(sigof(mklist)); put_c(' '); tprint(sigof(first)); put_c(' '); tprint(sigofs("free")); put_c(10);
let t = typeof(r), i = 0;
while (i < tnfields(t)) { put_s(tfname(t, i)); put_c(':'); tprint(tftype(t, i)); put_c('@'); put_n(tfoff(t, i)); put_c(' '); i++; }
put_c(10);
point* q = new(point);
tprint(typeof_obj(q)); put_c(' '); put_n(typeof_obj(q) == typeof(point)); put_c(' '); put_n(tkind(typeof_obj(q)) == TY_STRUCT);
free(d*q);
put_c(10);
return 0;
}
|
