-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathset.h
293 lines (259 loc) · 8.71 KB
/
set.h
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
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
/*
Copyright (c) 2020, Marc Sune Clos
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef __CDADA_SET_H__
#define __CDADA_SET_H__
#include <stdbool.h>
#include <stdio.h>
#include <stdint.h>
#include <cdada/utils.h>
/**
* @file cdada/set.h
* @author Marc Sune<marcdevel (at) gmail.com>
*
* @brief Set data structure.
*
* `cdada_set` data structure is a collection of unique elements of type 'TYPE'.
* During insertions, a _copy_ of the element `key` will be stored in the set.
* During accesses (e.g. `cdada_set_first`), if found, a _copy_ of the value
* will be stored in the region of memory pointed by `key`.
*
* Uses std::set as a backend
*/
/**
* cdada set structure
*/
typedef void cdada_set_t;
//In case it's included from C++
CDADA_BEGIN_DECLS
//Fwd decl
//See cdada_set_create() for return codes
struct __cdada_set_ops;
cdada_set_t* __cdada_set_create(const uint16_t key_size,
struct __cdada_set_ops* ops);
/**
* cdada set structure iterator
*
* @param set Set ptr
* @param key Key (immutable)
* @param opaque A pointer to an opaque object tat will be passed to the callback
*/
typedef void (*cdada_set_it)(const cdada_set_t* set, const void* key,
void* opaque);
/**
* @brief Create and initialize a set data structure
*
* Allocate and initialize a set structure. Containers will perform
* better when TYPE has a size of {1,2,4,8,16,32,64,128,256} bytes
*
* For types > 256, use custom containers
*
* @returns Returns a cdada_set object or NULL, if some error is found
*/
#define cdada_set_create(TYPE) \
__cdada_set_create(sizeof( TYPE ), NULL)
/**
* Destroy a set structure
*
* @returns Return codes:
* CDADA_SUCCESS: set is destroyed
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_destroy(cdada_set_t* set);
/**
* Clear the contents of the set
*
* @returns Return codes:
* CDADA_SUCCESS: set is cleared
* CDADA_E_MEM: out of memory
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_clear(cdada_set_t* set);
/**
* Traverse set
*
* @param set Set
* @param func Traverse function for this specific set
* @param opaque User data (opaque ptr)
*
* @returns Return codes:
* CDADA_SUCCESS: set was successfully traversed
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_traverse(const cdada_set_t* set, cdada_set_it func,
void* opaque);
/**
* Reverse traverse set
*
* @param set Set
* @param func Traverse function for this specific set
* @param opaque User data (opaque ptr)
*
* @returns Return codes:
* CDADA_SUCCESS: set was successfully reverse traversed
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_rtraverse(const cdada_set_t* set, cdada_set_it func,
void* opaque);
//Set properties
/**
* Is the set empty
*
* @returns Returns true if set is empty else (including invalid) false
*/
bool cdada_set_empty(const cdada_set_t* set);
/**
* Return the size (number of elements) in the set
*
* @returns Returns number of elements. If set is NULL or corrupted, returns 0
*/
uint32_t cdada_set_size(const cdada_set_t* set);
//Element manipulation
/**
* Insert an element (a copy) in the set
*
* @param set Set pointer
* @param key Key. The key type _must_ have all bytes initialized
*
* @returns Return codes:
* CDADA_SUCCESS: element is inserted
* CDADA_E_EXISTS: element exists
* CDADA_E_MEM: out of memory
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_insert(cdada_set_t* set, const void* key);
/**
* Erase an element in the set
*
* @param set Set pointer
* @param key Key. The key type _must_ have all bytes initialized
*
* @returns Return codes:
* CDADA_SUCCESS: element was successfully erased
* CDADA_E_NOT_FOUND: no element `key` was found
* CDADA_E_MEM: out of memory
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_erase(cdada_set_t* set, const void* key);
/**
* Find a key in the set
*
* @param set Set pointer
* @param key Key to search
*
* @returns Returns true if set has element else (including invalid) false
*/
bool cdada_set_find(const cdada_set_t* set, const void* key);
/**
* Get the Nth element of the set, starting with 0
* @param set Set pointer
* @param pos Position in the set [0..size)
* @param key The key to be filled-in
*
* @returns Return codes:
* CDADA_SUCCESS: element was retrieved
* CDADA_E_EMPTY: set has no elements
* CDADA_E_NOT_FOUND: no element on that position (>= size)
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_get_pos(const cdada_set_t* set, const uint32_t pos, void* key);
/**
* Get the first element in the set
* @param set Set pointer
* @param key If set has elements, a copy of the first element will be stored
* in *key
*
* @returns Return codes:
* CDADA_SUCCESS: first element was retrieved
* CDADA_E_EMPTY: set has no elements
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_first(const cdada_set_t* set, void* key);
/**
* Get the last element in the set
* @param set Set pointer
* @param key If set has elements, a copy of the last element will be stored
* in *key
*
* @returns Return codes:
* CDADA_SUCCESS: last element was retrieved
* CDADA_E_EMPTY: set has no elements
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_last(const cdada_set_t* set, void* key);
//Dumpers
/**
* Dump to a string the contents of the set
*
* @param set Set object
* @param size Size of the buffer
* @param buffer Buffer. If NULL, necessary bytes, including '\0' will be set in
* 'size_used'
* @param size_used If buffer != NULL, the number of bytes written else number of
* bytes necessary to write, including '\0'
*
* @returns Return codes:
* CDADA_SUCCESS: set was dumped to buffer
* CDADA_E_INCOMPLETE: not enough room in buffer
* CDADA_E_MEM: out of memory
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_dump(cdada_set_t* set, uint32_t size, char* buffer,
uint32_t* bytes_used);
/**
* @brief Print the contents of the set
*
* @param set Set object
* @param stream stdout or stderr
*
* @returns Return codes:
* CDADA_SUCCESS: set was dumped to `stream`
* CDADA_E_MEM: out of memory
* CDADA_E_UNKNOWN: corrupted set or internal error (bug)
* CDADA_E_INVALID: set is NULL or corrupted
*/
int cdada_set_print(cdada_set_t* set, FILE *stream);
//Custom types
/**
* Forward declare custom time ops
*/
#define CDADA_SET_CUSTOM_TYPE_DECL(TYPE) \
extern struct __cdada_set_ops __cdada_set_autogen_##TYPE
/**
* @brief Create a set with a custom type, with a dedicated std::set
*
* Requires instantiating CDADA_SET_CUSTOM_GEN() or
* CDADA_SET_CUSTOM_GEN_NO_MEMCP() once in a C++ compilation unit
*/
#define cdada_set_create_custom(TYPE) \
__cdada_set_create(sizeof( TYPE ), & __cdada_set_autogen_##TYPE )
CDADA_END_DECLS
#endif //__CDADA_SET_H__