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
|
/* MIT License
*
* Copyright (c) 2023 Tyge Løvset
*
* 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 "priv/linkage.h"
#ifndef CQUEUE_H_INCLUDED
#include "ccommon.h"
#include "forward.h"
#include <stdlib.h>
#include <string.h>
#endif // CQUEUE_H_INCLUDED
#ifndef _i_prefix
#define _i_prefix cqueue_
#endif
#include "priv/template.h"
#ifndef i_is_forward
_cx_DEFTYPES(_c_cdeq_types, _cx_Self, i_key);
#endif
typedef i_keyraw _cx_raw;
STC_API _cx_Self _cx_MEMB(_with_capacity)(const intptr_t n);
STC_API bool _cx_MEMB(_reserve)(_cx_Self* self, const intptr_t n);
STC_API void _cx_MEMB(_clear)(_cx_Self* self);
STC_API void _cx_MEMB(_drop)(_cx_Self* self);
STC_API _cx_value* _cx_MEMB(_push)(_cx_Self* self, i_key value); // push_back
STC_API void _cx_MEMB(_shrink_to_fit)(_cx_Self *self);
STC_API _cx_iter _cx_MEMB(_advance)(_cx_iter it, intptr_t n);
#define _cdeq_toidx(self, pos) (((pos) - (self)->start) & (self)->capmask)
#define _cdeq_topos(self, idx) (((self)->start + (idx)) & (self)->capmask)
STC_INLINE _cx_Self _cx_MEMB(_init)(void)
{ _cx_Self cx = {0}; return cx; }
STC_INLINE void _cx_MEMB(_put_n)(_cx_Self* self, const _cx_raw* raw, intptr_t n)
{ while (n--) _cx_MEMB(_push)(self, i_keyfrom(*raw++)); }
STC_INLINE _cx_Self _cx_MEMB(_from_n)(const _cx_raw* raw, intptr_t n)
{ _cx_Self cx = {0}; _cx_MEMB(_put_n)(&cx, raw, n); return cx; }
STC_INLINE void _cx_MEMB(_value_drop)(_cx_value* val) { i_keydrop(val); }
#if !defined i_no_emplace
STC_INLINE _cx_value* _cx_MEMB(_emplace)(_cx_Self* self, _cx_raw raw)
{ return _cx_MEMB(_push)(self, i_keyfrom(raw)); }
#endif
#if defined _i_has_eq || defined _i_has_cmp
STC_API bool _cx_MEMB(_eq)(const _cx_Self* self, const _cx_Self* other);
#endif
#if !defined i_no_clone
STC_API _cx_Self _cx_MEMB(_clone)(_cx_Self cx);
STC_INLINE i_key _cx_MEMB(_value_clone)(i_key val)
{ return i_keyclone(val); }
#endif // !i_no_clone
STC_INLINE intptr_t _cx_MEMB(_size)(const _cx_Self* self)
{ return _cdeq_toidx(self, self->end); }
STC_INLINE intptr_t _cx_MEMB(_capacity)(const _cx_Self* self)
{ return self->capmask; }
STC_INLINE bool _cx_MEMB(_empty)(const _cx_Self* self)
{ return self->start == self->end; }
STC_INLINE _cx_raw _cx_MEMB(_value_toraw)(const _cx_value* pval)
{ return i_keyto(pval); }
STC_INLINE _cx_value* _cx_MEMB(_front)(const _cx_Self* self)
{ return self->data + self->start; }
STC_INLINE _cx_value* _cx_MEMB(_back)(const _cx_Self* self)
{ return self->data + ((self->end - 1) & self->capmask); }
STC_INLINE void _cx_MEMB(_pop)(_cx_Self* self) { // pop_front
c_assert(!_cx_MEMB(_empty)(self));
i_keydrop((self->data + self->start));
self->start = (self->start + 1) & self->capmask;
}
STC_INLINE _cx_value _cx_MEMB(_pull)(_cx_Self* self) { // move front out of queue
c_assert(!_cx_MEMB(_empty)(self));
intptr_t s = self->start;
self->start = (s + 1) & self->capmask;
return self->data[s];
}
STC_INLINE void _cx_MEMB(_copy)(_cx_Self* self, const _cx_Self* other) {
if (self->data == other->data) return;
_cx_MEMB(_drop)(self);
*self = _cx_MEMB(_clone)(*other);
}
STC_INLINE _cx_iter _cx_MEMB(_begin)(const _cx_Self* self) {
return c_LITERAL(_cx_iter){
_cx_MEMB(_empty)(self) ? NULL : self->data + self->start,
self->start, self
};
}
STC_INLINE _cx_iter _cx_MEMB(_end)(const _cx_Self* self)
{ return c_LITERAL(_cx_iter){.pos=self->end, ._s=self}; }
STC_INLINE void _cx_MEMB(_next)(_cx_iter* it) {
if (it->pos != it->_s->capmask) { ++it->ref; ++it->pos; }
else { it->ref -= it->pos; it->pos = 0; }
if (it->pos == it->_s->end) it->ref = NULL;
}
STC_INLINE intptr_t _cx_MEMB(_index)(const _cx_Self* self, _cx_iter it)
{ return _cdeq_toidx(self, it.pos); }
STC_INLINE void _cx_MEMB(_adjust_end_)(_cx_Self* self, intptr_t n)
{ self->end = (self->end + n) & self->capmask; }
/* -------------------------- IMPLEMENTATION ------------------------- */
#if defined(i_implement) || defined(i_static)
STC_DEF _cx_iter _cx_MEMB(_advance)(_cx_iter it, intptr_t n) {
intptr_t len = _cx_MEMB(_size)(it._s);
intptr_t pos = it.pos, idx = _cdeq_toidx(it._s, pos);
it.pos = (pos + n) & it._s->capmask;
it.ref += it.pos - pos;
if (!c_LTu(idx + n, len)) it.ref = NULL;
return it;
}
STC_DEF void
_cx_MEMB(_clear)(_cx_Self* self) {
c_foreach (i, _cx_Self, *self)
{ i_keydrop(i.ref); }
self->start = 0, self->end = 0;
}
STC_DEF void
_cx_MEMB(_drop)(_cx_Self* self) {
_cx_MEMB(_clear)(self);
i_free(self->data);
}
STC_DEF _cx_Self
_cx_MEMB(_with_capacity)(const intptr_t n) {
_cx_Self cx = {0};
_cx_MEMB(_reserve)(&cx, n);
return cx;
}
STC_DEF bool
_cx_MEMB(_reserve)(_cx_Self* self, const intptr_t n) {
if (n <= self->capmask)
return true;
intptr_t oldcap = self->capmask + 1, newcap = cnextpow2(n + 1);
_cx_value* d = (_cx_value *)i_realloc(self->data, newcap*c_sizeof *self->data);
if (!d)
return false;
intptr_t head = oldcap - self->start;
if (self->start <= self->end)
;
else if (head < self->end) {
self->start = newcap - head;
c_memmove(d + self->start, d + oldcap - head, head*c_sizeof *d);
} else {
c_memmove(d + oldcap, d, self->end*c_sizeof *d);
self->end += oldcap;
}
self->capmask = newcap - 1;
self->data = d;
return true;
}
STC_DEF _cx_value*
_cx_MEMB(_push)(_cx_Self* self, i_key value) { // push_back
intptr_t end = (self->end + 1) & self->capmask;
if (end == self->start) { // full
_cx_MEMB(_reserve)(self, self->capmask + 3); // => 2x expand
end = (self->end + 1) & self->capmask;
}
_cx_value *v = self->data + self->end;
self->end = end;
*v = value;
return v;
}
STC_DEF void
_cx_MEMB(_shrink_to_fit)(_cx_Self *self) {
intptr_t sz = _cx_MEMB(_size)(self), j = 0;
if (sz > self->capmask/2)
return;
_cx_Self out = _cx_MEMB(_with_capacity)(sz);
if (!out.data)
return;
c_foreach (i, _cx_Self, *self)
out.data[j++] = *i.ref;
out.end = sz;
i_free(self->data);
*self = out;
}
#if !defined i_no_clone
STC_DEF _cx_Self
_cx_MEMB(_clone)(_cx_Self cx) {
intptr_t sz = _cx_MEMB(_size)(&cx), j = 0;
_cx_Self out = _cx_MEMB(_with_capacity)(sz);
if (out.data)
c_foreach (i, _cx_Self, cx)
out.data[j++] = i_keyclone((*i.ref));
out.end = sz;
return out;
}
#endif // i_no_clone
#if defined _i_has_eq || defined _i_has_cmp
STC_DEF bool
_cx_MEMB(_eq)(const _cx_Self* self, const _cx_Self* other) {
if (_cx_MEMB(_size)(self) != _cx_MEMB(_size)(other)) return false;
for (_cx_iter i = _cx_MEMB(_begin)(self), j = _cx_MEMB(_begin)(other);
i.ref; _cx_MEMB(_next)(&i), _cx_MEMB(_next)(&j))
{
const _cx_raw _rx = i_keyto(i.ref), _ry = i_keyto(j.ref);
if (!(i_eq((&_rx), (&_ry)))) return false;
}
return true;
}
#endif
#endif // IMPLEMENTATION
#include "priv/template2.h"
#define CQUEUE_H_INCLUDED
|
