aboutsummaryrefslogtreecommitdiff
path: root/main.c
blob: 8b95eb58a73c749b4a5f3991d6e1d2d025c2c9f7 (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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
// This is the test unit, not the actual code.

#include "moonshine.h"

const enum {
    test_datatype,
    test_linkedlist,
    test_hashtable,
    test_alloc,
    test_array,
    test_hashtable_2,
    test_garbage_collector,
    test_minor_features
} current_test
    = test_minor_features;

int main() {
    if (current_test == test_alloc) {
        auto v1 = obj(i4);
        auto v2 = obj(u8);

        for (u8 i = 1; i <= 1000; i++) print(alloc(i * 1000));

        *v1 = 2;
        *v2 = 99;

        println(*v1, *v2);
        release(v1);

        println(*v2);
    } else if (current_test == test_array) {
        auto arr = new (int);
        push(arr, 4);
        push(arr, 9);
        push(arr, 3);
        push(arr, 5);
        set(arr, 0, 2);

        foreach (i in arr) println("[", (u8) i_index, "] ", i);

        reverse_array(arr);

        println("Reversed");

        foreach (i in arr) println("[", (u8) i_index, "] ", i);
    } else if (current_test == test_datatype) {
        datatype(binarytree, ((leaf, int), (node, binarytree *, int, binarytree *) ));
        const auto tree = instance(binarytree, leaf, 3);

        println(&tree);

        match(tree) {
            of(leaf, v) println("Leafy ", v);
            of(node, _, v, _) println("Nodey ", v);
            other() println("Idk man");
        }
    } else if (current_test == test_linkedlist) {
        const auto ll = create_linkedlist();

        for (u8 i = 0; i < 100; i++) push_linkedlist(ll, (var) i);

        print((u8) index_to_ptr(ll, 12)->data);
    } else if (current_test == test_hashtable) {
        const auto ht = create_hasharray(table_hash_2);

        for (u8 i = 0; i < 10000000; i++) {
            if (i % 1000000 == 0) println("I ", i);
            set_hasharray(ht, "hello", "world");
            set_hasharray(ht, "how", "are you");
        }

        println((string) get_hasharray(ht, "hello"), ' ', (string) get_hasharray(ht, "how"), ' ', get_hasharray(ht, "wowie"));
    } else if (current_test == test_hashtable_2) {
        const auto ht = create_hasharray(table_hash_2);

        set_hasharray(ht, "hello", "hi");
        println("Value: ", (string) get_hasharray(ht, "hello"));
        set_hasharray(ht, "hello", "meow");
        println("Value after: ", (string) get_hasharray(ht, "hello"));
    } else if (current_test == test_garbage_collector) {
        auto v1 = new (int, 5);
        auto v2 = obj(int);
        auto v3 = alloc(25);
        auto v4 = create_linkedlist();
        auto v5 = create_hasharray(table_hash_2);

        set_hasharray(v5, "hello", "world");
        println("Hash ", v5);

        collect_garbage(true);
    } else if (current_test == test_minor_features) {
        // Minor feature: Custom, better designed float representation
        auto x = (struct moonshine_float) { .number = 1234, .decimal = 2 };
        println(x);
        // Normal float enhancement
        println(12.34);
    }

    else {
        throw("Unknown test.");
    }

    return 0;
}