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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
|
#ifndef GU_SEQ_H_
#define GU_SEQ_H_
#include <gu/mem.h>
typedef struct {
size_t len;
uint8_t data[0];
} GuSeq;
typedef struct {
GuSeq* seq;
size_t elem_size;
size_t avail_len;
GuFinalizer fin;
} GuBuf;
GuSeq*
gu_empty_seq();
GuSeq*
gu_make_seq(size_t elem_size, size_t len, GuPool* pool);
#define gu_new_seq(T, N, POOL) \
gu_make_seq(sizeof(T), (N), (POOL))
GuSeq*
gu_alloc_seq_(size_t elem_size, size_t length);
#define gu_alloc_seq(T, N) \
gu_alloc_seq_(sizeof(T), (N))
GuSeq*
gu_realloc_seq_(GuSeq* seq, size_t elem_size, size_t length);
#define gu_realloc_seq(S, T, N) \
gu_realloc_seq_(S, sizeof(T), (N))
void
gu_seq_free(GuSeq* seq);
inline size_t
gu_seq_length(GuSeq* seq)
{
return seq->len;
}
inline void*
gu_seq_data(GuSeq* seq)
{
return seq->data;
}
#define gu_seq_index(SEQ, T, I) \
(&((T*)gu_seq_data(SEQ))[I])
#define gu_seq_get(SEQ, T, I) \
(*gu_seq_index(SEQ, T, I))
#define gu_seq_set(SEQ, T, I, V) \
GU_BEGIN \
(*gu_seq_index(SEQ, T, I) = (V)); \
GU_END
GuBuf*
gu_make_buf(size_t elem_size, GuPool* pool);
#define gu_new_buf(T, POOL) \
gu_make_buf(sizeof(T), (POOL))
inline size_t
gu_buf_length(GuBuf* buf)
{
return buf->seq->len;
}
inline size_t
gu_buf_avail(GuBuf* buf)
{
return buf->avail_len;
}
inline void*
gu_buf_data(GuBuf* buf)
{
return &buf->seq->data;
}
inline GuSeq*
gu_buf_data_seq(GuBuf* buf)
{
return buf->seq;
}
#define gu_buf_index(BUF, T, I) \
(&((T*)gu_buf_data(BUF))[I])
#define gu_buf_get(BUF, T, I) \
(*gu_buf_index(BUF, T, I))
#define gu_buf_set(BUF, T, I, V) \
GU_BEGIN \
(*gu_buf_index(BUF, T, I) = (V)); \
GU_END
void
gu_buf_push_n(GuBuf* buf, const void* elems, size_t n_elems);
void*
gu_buf_extend_n(GuBuf* buf, size_t n_elems);
inline void*
gu_buf_extend(GuBuf* buf)
{
return gu_buf_extend_n(buf, 1);
}
#define gu_buf_push(BUF, T, VAL) \
GU_BEGIN \
((*(T*)gu_buf_extend(BUF)) = (VAL)); \
GU_END
void
gu_buf_pop_n(GuBuf* buf, size_t n_elems, void* data_out);
const void*
gu_buf_trim_n(GuBuf* buf, size_t n_elems);
inline const void*
gu_buf_trim(GuBuf* buf)
{
return gu_buf_trim_n(buf, 1);
}
void*
gu_buf_insert(GuBuf* buf, size_t n_index);
inline void
gu_buf_flush(GuBuf* buf)
{
buf->seq->len = 0;
}
#define gu_buf_pop(BUF, T) \
(*(T*)gu_buf_trim(BUF))
void
gu_buf_sort(GuBuf *buf, GuOrder *order);
#define gu_seq_binsearch(S, O, T, V) \
((T*) gu_seq_binsearch_(S, O, sizeof(T), V))
void*
gu_seq_binsearch_(GuSeq *seq, GuOrder *order, size_t elem_size, const void *key);
#define gu_seq_binsearch_index(S, O, T, V, PI) \
gu_seq_binsearch_index_(S, O, sizeof(T), V, PI)
bool
gu_seq_binsearch_index_(GuSeq *seq, GuOrder *order, size_t elem_size,
const void *key, size_t *pindex);
// Using a buffer as a heap
void
gu_buf_heap_push(GuBuf *buf, GuOrder *order, void *value);
void
gu_buf_heap_pop(GuBuf *buf, GuOrder *order, void* data_out);
void
gu_buf_heap_replace(GuBuf *buf, GuOrder *order, void *value, void *data_out);
void
gu_buf_heapify(GuBuf *buf, GuOrder *order);
GuSeq*
gu_buf_freeze(GuBuf* buf, GuPool* pool);
#endif // GU_SEQ_H_
#ifdef GU_STRING_H_
void
gu_buf_require(GuBuf* buf, size_t req_len);
#endif // GU_STRING_H_
|
