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
|
/* code-sparse-set.h
*
* Copyright 2025 Christian Hergert <chergert@redhat.com>
*
* This library is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of the
* License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*
* SPDX-License-Identifier: LGPL-2.1-or-later
*/
#pragma once
#include <glib.h>
G_BEGIN_DECLS
G_GNUC_CONST
static inline gboolean
_ispow2 (guint v)
{
return (v != 0) && ((v & (v - 1)) == 0);
}
typedef struct _CodeSparseSetItem
{
guint value;
guint user_value;
} CodeSparseSetItem;
typedef struct _CodeSparseSet
{
CodeSparseSetItem *dense;
guint *sparse;
guint capacity;
guint len;
} CodeSparseSet;
#define CODE_SPARSE_SET_INIT(max) \
(CodeSparseSet) { \
.dense = g_new (CodeSparseSetItem, 8), \
.sparse = g_new (guint, max), \
.capacity = max, \
.len = 0, \
}
static inline void
code_sparse_set_init (CodeSparseSet *sparse_set,
guint max)
{
*sparse_set = CODE_SPARSE_SET_INIT (max);
}
static inline void
code_sparse_set_clear (CodeSparseSet *sparse_set)
{
g_clear_pointer (&sparse_set->dense, g_free);
g_clear_pointer (&sparse_set->sparse, g_free);
sparse_set->len = 0;
sparse_set->capacity = 0;
}
static inline void
code_sparse_set_reset (CodeSparseSet *sparse_set)
{
if (sparse_set->len != 0)
{
sparse_set->dense = g_renew (CodeSparseSetItem, sparse_set->dense, 8);
sparse_set->len = 0;
}
}
static inline gboolean
code_sparse_set_add_with_data (CodeSparseSet *sparse_set,
guint value,
guint user_value)
{
guint idx;
g_return_val_if_fail (value < sparse_set->capacity, FALSE);
idx = sparse_set->sparse[value];
if (idx < sparse_set->len && sparse_set->dense[idx].value == value)
return FALSE;
idx = sparse_set->len;
sparse_set->dense[idx].value = value;
sparse_set->dense[idx].user_value = user_value;
sparse_set->sparse[value] = idx;
sparse_set->len++;
if (sparse_set->len < 8)
return TRUE;
if (_ispow2 (sparse_set->len))
sparse_set->dense = g_renew (CodeSparseSetItem, sparse_set->dense, sparse_set->len * 2);
return TRUE;
}
static inline gboolean
code_sparse_set_add (CodeSparseSet *sparse_set,
guint value)
{
return code_sparse_set_add_with_data (sparse_set, value, 0);
}
static inline gboolean
code_sparse_set_contains (CodeSparseSet *sparse_set,
guint value)
{
guint idx;
if (value >= sparse_set->capacity)
return FALSE;
idx = sparse_set->sparse[value];
return idx < sparse_set->len && sparse_set->dense[idx].value == value;
}
static inline gboolean
code_sparse_set_get (CodeSparseSet *sparse_set,
guint value,
guint *user_value)
{
guint idx;
if (value >= sparse_set->capacity)
return FALSE;
idx = sparse_set->sparse[value];
if (idx < sparse_set->len && sparse_set->dense[idx].value == value)
{
*user_value = sparse_set->dense[idx].user_value;
return TRUE;
}
return FALSE;
}
static inline int
_code_sparse_set_compare (gconstpointer a,
gconstpointer b,
G_GNUC_UNUSED gpointer data)
{
const CodeSparseSetItem *aval = a;
const CodeSparseSetItem *bval = b;
if (aval->value < bval->value)
return -1;
else if (aval->value > bval->value)
return 1;
else
return 0;
}
static inline void
code_sparse_set_sort (CodeSparseSet *sparse_set)
{
if (sparse_set->len < 2)
return;
g_sort_array (sparse_set->dense,
sparse_set->len,
sizeof sparse_set->dense[0],
_code_sparse_set_compare,
NULL);
for (guint i = 0; i < sparse_set->len; i++)
sparse_set->sparse[sparse_set->dense[i].value] = i;
}
G_DEFINE_AUTO_CLEANUP_CLEAR_FUNC (CodeSparseSet, code_sparse_set_clear)
G_END_DECLS
|
