authorgravatar for andrew@ziglang.orgAndrew Kelley <andrew@ziglang.org> 2015-12-17 14:59:08-07:00
committergravatar for andrew@ziglang.orgAndrew Kelley <andrew@ziglang.org> 2015-12-17 14:59:08-07:00
log437e9b954d8a47a1acb6aa5327c6473ab8d9267c
tree220b5d7162a0e494efe83591109a0547107ec552
parente4cb28dbf2d0bc70581502d751ba9e4f7a46ed93

add some brainstorming example zig code

2 files changed, 99 insertions(+), 0 deletions(-)

example/guess_number/main.zig created+33
......@@ -0,0 +1,33 @@
1export executable "guess_number";
2
3use "std.zig";
4
5fn main(argc: isize, argv: &&u8, env: &&u8) -> i32 {
6 print_str("Welcome to the Guess Number Game in Zig.\n");
7
8 var seed : u32;
9 ok_or_panic(os_get_random_bytes(&seed, 4));
10 var rand_state = rand_init(seed);
11
12 const answer = rand_int(&rand_state, 0, 100) + 1;
13
14 while true {
15 Buffer line = readline("\nGuess a number between 1 and 100: ");
16
17 (const err, const guess) = parse_number(line);
18 if err == Error.None {
19 if guess == answer {
20 print_str("You win!\n");
21 return 0;
22 } else if guess < answer {
23 print_str("Guess higher.\n");
24 } else {
25 print_str("Guess lower.\n");
26 }
27 } else {
28 print_str("Invalid number format.\n");
29 }
30 }
31
32 return 0;
33}
example/list/list.zig created+66
......@@ -0,0 +1,66 @@
1pub struct List#(T: type) {
2 items: ?&T,
3 length: usize,
4 capacity: usize,
5
6 pub fn (l: &List) deinit() {
7 free(l.items);
8 l.items = None;
9 }
10
11 pub fn append(l: &List, item: T) -> error {
12 const err = l.ensure_capacity(l.length + 1);
13 if err != Error.None {
14 return err;
15 }
16 const raw_items = l.items ?? unreachable;
17 l.raw_items[l.length] = item;
18 l.length += 1;
19 return 0;
20 }
21
22 pub fn at(l: List, index: usize) -> T {
23 assert(index < l.length);
24 const raw_items = l.items ?? unreachable;
25 return raw_items[index];
26 }
27
28 pub fn ptr_at(l: &List, index: usize) -> &T {
29 assert(index < l.length);
30 const raw_items = l.items ?? unreachable;
31 return &raw_items[index];
32 }
33
34 pub fn clear(l: &List) {
35 l.length = 0;
36 }
37
38 pub fn pop(l: &List) -> T {
39 assert(l.length >= 1);
40 l.length -= 1;
41 return l.items[l.length];
42 }
43
44 fn ensure_capacity(l: &List, new_capacity: usize) -> error {
45 var better_capacity = max(l.capacity, 16);
46 while better_capacity < new_capacity {
47 better_capacity *= 2;
48 }
49 if better_capacity != l.capacity {
50 const new_items = realloc(l.items, better_capacity) ?? { return Error.NoMem };
51 l.items = new_items;
52 l.capacity = better_capacity;
53 }
54 Error.None
55 }
56}
57
58pub fn malloc#(T: type)(count: usize) -> ?&T { realloc(None, count) }
59
60pub fn realloc#(T: type)(ptr: ?&T, new_count: usize) -> ?&T {
61
62}
63
64pub fn free#(T: type)(ptr: ?&T) {
65
66}