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
|
/*
* Copyright (c) 2019-2021 David Timber <mieabby@gmail.com>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in all
* copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#include "iset.h"
#include "util_rt.h"
#include <stdlib.h>
#include <string.h>
static int iset_comp_func (const void *a, const void *b) {
return
*(const prne_iset_val_t*)a < *(const prne_iset_val_t*)b ? -1 :
*(const prne_iset_val_t*)a > *(const prne_iset_val_t*)b ? 1 :
0;
}
void prne_init_iset (prne_iset_t *s) {
s->arr = NULL;
s->size = 0;
}
void prne_free_iset (prne_iset_t *s) {
prne_free(s->arr);
s->arr = NULL;
s->size = 0;
}
void prne_iset_clear (prne_iset_t *s) {
prne_free(s->arr);
s->arr = NULL;
s->size = 0;
}
bool prne_iset_insert (prne_iset_t *s, const prne_iset_val_t v) {
void *ny_mem;
if (prne_iset_lookup(s, v)) {
return true;
}
ny_mem = prne_realloc(s->arr, sizeof(prne_iset_val_t), s->size + 1);
if (ny_mem == NULL) {
return false;
}
s->arr = (prne_iset_val_t*)ny_mem;
s->arr[s->size] = v;
s->size += 1;
qsort(s->arr, s->size, sizeof(prne_iset_val_t), iset_comp_func);
return true;
}
void prne_iset_erase (prne_iset_t *s, const prne_iset_val_t v) {
prne_iset_val_t *p;
p = (prne_iset_val_t*)bsearch(
&v,
s->arr,
s->size,
sizeof(prne_iset_val_t),
iset_comp_func);
if (p == NULL) {
return;
}
if (s->size == 1) {
prne_free(s->arr);
s->arr = NULL;
s->size = 0;
}
else {
void *ny_mem;
memmove(
p,
p + 1,
sizeof(prne_iset_val_t) * (s->size - 1 - (p - s->arr)));
s->size -= 1;
ny_mem = prne_realloc(s->arr, sizeof(prne_iset_val_t), s->size);
if (ny_mem != NULL) {
s->arr = (prne_iset_val_t*)ny_mem;
}
}
}
bool prne_iset_lookup (prne_iset_t *s, const prne_iset_val_t v) {
return bsearch(
&v,
s->arr,
s->size,
sizeof(prne_iset_val_t),
iset_comp_func) != NULL;
}
|
