-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.c
More file actions
110 lines (98 loc) · 3.65 KB
/
Copy pathmain.c
File metadata and controls
110 lines (98 loc) · 3.65 KB
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
105
106
107
108
109
110
/** @file
* \brief implementation of the lists
*
*/
#include "zimonzk/lists.h"
void arraylist_init(arraylist* list, uint16_t unit_size, uint16_t allocation_block_units)
{
list->data = calloc(unit_size, allocation_block_units);
list->used_units = 0;
list->allocated_units = allocation_block_units;
list->allocation_block_units = allocation_block_units;
list->unit_size = unit_size;
}
void arraylist_delete(arraylist* list)
{
free(list->data);
list->used_units = 0;
list->allocated_units = 0;
list->allocation_block_units = 0;
list->unit_size = 0;
}
static inline void copydata(uint16_t unit_size, void* dest, void* source)
{
for(uint16_t i = 0; i < unit_size; i++) {
*(((char*)dest)+i) = *(((char*)source)+i);
}
}
static inline void shiftdata(uint64_t shiftwitdh)
{
/*TODO shift elements efficiently*/
/*for(uint64_t i = 0; i*/
}
void arraylist_append(arraylist* list, void* element_ptr)
{
list->used_units++;
if(list->used_units > list->allocated_units) {
list->allocated_units += list->allocation_block_units;
list->data = realloc(list->data, list->allocated_units * list->unit_size);
if(list->data == 0) {
exit(1);
}
}
copydata(list->unit_size, (list->data + ((list->used_units - 1) * list->unit_size)), element_ptr);
}
void arraylist_instert(arraylist* list, void* element_ptr, uint64_t index)
{
/*TODO shift the old entries up*/
copydata(list->unit_size, (list->data + (index * list->unit_size)), element_ptr);
}
void arraylist_del_element(arraylist* list, uint64_t index)
{
if(index != (list->used_units - 1)) {
copydata(list->unit_size * (list->used_units - index), (list->data + (index * list->unit_size)), (list->data + (index * list->unit_size)) + 1);
}
list->used_units--;
if(list->used_units <= (list->allocated_units - list->allocation_block_units)) {
list->allocated_units -= list->allocation_block_units;
list->data = realloc(list->data, list->allocated_units * list->unit_size);
}
}
void arraylist_replace(arraylist* list, void* element_ptr, uint64_t index)
{
copydata(list->unit_size, (list->data + (index * list->unit_size)), element_ptr);
}
void* arraylist_get(arraylist* list, uint64_t index)
{
return (void*)(((char*)list->data) + (index * list->unit_size));
}
void arraylist_append_multi(arraylist* list, void* element0_ptr, uint64_t ammount)
{
list->used_units += ammount;
if(list->used_units > list->allocated_units) {
if((list->used_units % list->allocation_block_units) != 0) {
list->allocated_units = (list->used_units / list->allocation_block_units) + 1;
} else {
list->allocated_units = (list->used_units / list->allocation_block_units);
}
list->data = realloc(list->data, list->allocated_units * list->unit_size);
if(list->data == 0) {
exit(1);
}
}
copydata(list->unit_size * ammount, (list->data + ((list->used_units - ammount) * list->unit_size)), element0_ptr);
}
void arraylist_insert_multi(arraylist* list, void* element0_ptr, uint64_t index, uint64_t ammount)
{
/*TODO shift the old entries up*/
copydata(list->unit_size * ammount, (list->data + (index * list->unit_size)), element0_ptr);
}
void arraylist_replace_multi(arraylist* list, void* element0_ptr, uint64_t index, uint64_t ammount)
{
if((list->used_units - ammount) < index) {
/*don't do anything if any of the objects which are supposed
* to replace old objects are outside of the range of used objects*/
return;
}
copydata(list->unit_size * ammount, (list->data + (index * list->unit_size)), element0_ptr);
}