-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexample.c
More file actions
141 lines (114 loc) · 3.16 KB
/
example.c
File metadata and controls
141 lines (114 loc) · 3.16 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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
// SPDX-License-Identifier: ISC
// SPDX-FileCopyrightText: 2025 kurth4cker <kurth4cker@gmail.com>
#include <stdio.h>
#include <assert.h>
#include <string.h>
#include <math.h>
#include "da.h"
typedef struct {
const char *name;
const char *language;
} Project;
static inline Project project(const char *name, const char *language)
{
Project p = {
.name = name,
.language = language,
};
return p;
}
da_define_struct(Project_Array, Project);
static bool append_project(Project_Array *arr, Project val)
{
if (!da_init_if_needed(arr) || !da_grow_if_needed(arr)) {
return false;
}
arr->data[arr->size] = val;
arr->size++;
return true;
}
int
main(void)
{
assert(offsetof(Da_Size, data) == offsetof(Da_Generic, data));
assert(offsetof(Da_Size, size) == offsetof(Da_Generic, size));
assert(offsetof(Da_Size, capacity) == offsetof(Da_Generic, capacity));
const size_t limit = 17;
{
Da_Size arr = { 0 };
for (size_t i = 0; i < limit; i++) {
da_append_size(&arr, i);
assert(arr.data[i] == i);
}
assert(arr.size == limit);
assert(arr.data != NULL);
assert(arr.size <= arr.capacity);
da_destroy(&arr);
}
{
Da_Double arr = { 0 };
for (size_t i = 0; i < limit; i++) {
da_append_double(&arr, i / 10.0);
}
assert(arr.size == limit);
assert(arr.data != NULL);
assert(arr.size <= arr.capacity);
// destroy array
da_destroy(&arr);
}
{
Da_Int arr = { 0 };
for (int i = 0; i < (int)limit; i++) {
da_append_int(&arr, i);
assert(arr.data[i] == i);
}
assert(arr.size == limit);
assert(arr.data != NULL);
assert(arr.size <= arr.capacity);
da_destroy(&arr);
}
{
Da_Int arr = { 0 };
da_append_int(&arr, 99);
da_append_int(&arr, 99);
da_append_int(&arr, 99);
da_reset(&arr);
da_append_int(&arr, 1);
da_append_int(&arr, 2);
assert(arr.size == 2);
assert(arr.data[0] == 1);
assert(arr.data[1] == 2);
da_destroy(&arr);
}
{
Da_Str arr = { 0 };
da_append_str(&arr, "hello");
da_append_str(&arr, "world");
assert(arr.data != NULL);
assert(arr.capacity > arr.size);
assert(arr.size == 2);
assert(strcmp(arr.data[0], "hello") == 0);
assert(strcmp(arr.data[1], "world") == 0);
da_destroy(&arr);
}
{
Project_Array arr = { 0 };
append_project(&arr, project("da.c", "C"));
append_project(&arr, project("sample-go", "Go"));
assert(arr.data != NULL);
assert(arr.capacity > arr.size);
assert(arr.size == 2);
assert(strcmp(arr.data[1].name, "sample-go") == 0);
da_destroy(&arr);
}
{
Da_Generic arr = { 0 };
for (size_t i = 0; i < limit; i++) {
da_generic_append(&arr, &i, sizeof(i));
}
assert(arr.size == limit);
assert(arr.data != NULL);
assert(arr.size <= arr.capacity);
da_destroy(&arr);
}
}