LinkedList in Chi

08_generics.cx

struct Node<any T> {
    T data;
    Node<T>* next = 0;
    void new(T data) {
        this.data = data;
    }
};

struct LinkedList<any T> {
    Node<T>* head = 0;
    Node<T>* tail = 0;
    int size = 0;

    Node<T>* add(T value) {
        this.tail = new {value};
        if (!this.head) {
            this.head = this.tail;
        } else {
            let node = this.head;
            for (;;) {
                if (!node.next) {
                    break;
                }
                node = node.next;
            }
            node.next = this.tail;
        }
        ++this.size;
        return this.tail;
    }
}

int main() {
    LinkedList<int> list;
    list.add(1);
    printf("list.size: {}\n", list.size);
    printf("list.tail: {}\n", list.tail.data);
    list.add(2);
    printf("list.size: {}\n", list.size);
    printf("list.tail: {}\n", list.tail.data);
    for (let node=list.head; node; node = node.next) {
        printf("item value: {}\n", node.data);
    }
    return 0;
}

08_generics.expect

list.size: 1
list.tail: 1
list.size: 2
list.tail: 2
item value: 1
item value: 2