aboutsummaryrefslogtreecommitdiff
path: root/src/un_list.c
blob: 133dc12b5cc55a7ef84f5da84fbf5bb42a5d9a24 (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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
List un_list_create(u64 start_capacity, u64 element_size, Allocator alloc) {
    List list;

    list.count = 0;
    list.capacity = start_capacity;
    list.element_size = element_size;
    list.alloc = alloc;

    list.data = un_memory_alloc(list.capacity * list.element_size, alloc);

    assert(list.data != NULL);
    return list;
}

void un_list_destroy(List *list) {
    un_memory_destroy(&list->alloc);
    UN_CLEAR(*list);
}

List un_list_clone(List *list, Allocator alloc) {
    List result;

    result = *list;
    result.alloc = alloc;
    result.data  = un_memory_alloc(result.capacity * result.element_size, alloc);
    assert(result.data != NULL);

    un_memory_copy(result.data, list->data, result.count * result.element_size);

    return result;
}

static b32 list_grow_if_needed(List *list) {
    if ((list->count + 1) <= list->capacity) {
        return true;
    } else {
        void *mem = un_memory_realloc(list->data, list->element_size * list->capacity * 2, list->alloc);

        if (!mem) {
            return false;
        }

        list->data = mem;
        list->capacity *= 2;
    }

    return true;
}

b32 un_list_append(List *list, void *data) {
    void *addr;

    if (list_grow_if_needed(list)) {
        addr = (u8*)list->data + list->count * list->element_size;
        un_memory_copy(addr, data, list->element_size);
        list->count++;
        return true;
    } else {
        return false;
    }
}

void *un_list_get(List *list, u64 index) {
    if (index >= list->count) return NULL;

    return (u8*)list->data + index * list->element_size;
}

void un_list_remove(List *list, u64 index) {
    void *addr;
    u64 move_elements;
    
    if (index >= list->count) return;

    addr = (u8*)list->data + index * list->element_size;
    
    move_elements = list->count - (index + 1);

    if (move_elements) {
        un_memory_move(addr, (u8*)addr + list->element_size, move_elements * list->element_size);
    }

    list->count--;
}