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
|
/* 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 CDEQ_H_INCLUDED
#include "ccommon.h"
#include "forward.h"
#include <stdlib.h>
#include <string.h>
#endif // CDEQ_H_INCLUDED
#define _i_prefix cdeq_
#define _pop _pop_front
#define _pull _pull_front
#include "priv/cqueue_hdr.h"
#undef _pop
#undef _pull
STC_API _cx_value* _cx_MEMB(_push_front)(_cx_Self* self, i_key value);
STC_API _cx_iter _cx_MEMB(_insert_n)(_cx_Self* self, intptr_t idx, const _cx_value* arr, intptr_t n);
STC_API _cx_iter _cx_MEMB(_insert_uninit)(_cx_Self* self, intptr_t idx, intptr_t n);
STC_API void _cx_MEMB(_erase_n)(_cx_Self* self, intptr_t idx, intptr_t n);
STC_INLINE const _cx_value*
_cx_MEMB(_at)(const _cx_Self* self, intptr_t idx)
{ return self->data + _cdeq_topos(self, idx); }
STC_INLINE _cx_value*
_cx_MEMB(_at_mut)(_cx_Self* self, intptr_t idx)
{ return self->data + _cdeq_topos(self, idx); }
STC_INLINE _cx_value*
_cx_MEMB(_push_back)(_cx_Self* self, _cx_value val)
{ return _cx_MEMB(_push)(self, val); }
STC_INLINE void
_cx_MEMB(_pop_back)(_cx_Self* self) {
c_assert(!_cx_MEMB(_empty)(self));
self->end = (self->end - 1) & self->capmask;
i_keydrop((self->data + self->end));
}
STC_INLINE _cx_value _cx_MEMB(_pull_back)(_cx_Self* self) { // move back out of deq
c_assert(!_cx_MEMB(_empty)(self));
self->end = (self->end - 1) & self->capmask;
return self->data[self->end];
}
STC_INLINE _cx_iter
_cx_MEMB(_insert_at)(_cx_Self* self, _cx_iter it, const _cx_value val) {
intptr_t idx = _cdeq_toidx(self, it.pos);
return _cx_MEMB(_insert_n)(self, idx, &val, 1);
}
STC_INLINE _cx_iter
_cx_MEMB(_erase_at)(_cx_Self* self, _cx_iter it) {
_cx_MEMB(_erase_n)(self, _cdeq_toidx(self, it.pos), 1);
if (it.pos == self->end) it.ref = NULL;
return it;
}
STC_INLINE _cx_iter
_cx_MEMB(_erase_range)(_cx_Self* self, _cx_iter it1, _cx_iter it2) {
intptr_t idx1 = _cdeq_toidx(self, it1.pos);
intptr_t idx2 = _cdeq_toidx(self, it2.pos);
_cx_MEMB(_erase_n)(self, idx1, idx2 - idx1);
if (it1.pos == self->end) it1.ref = NULL;
return it1;
}
#if !defined i_no_emplace
STC_API _cx_iter
_cx_MEMB(_emplace_n)(_cx_Self* self, intptr_t idx, const _cx_raw* raw, intptr_t n);
STC_INLINE _cx_value*
_cx_MEMB(_emplace_front)(_cx_Self* self, const _cx_raw raw)
{ return _cx_MEMB(_push_front)(self, i_keyfrom(raw)); }
STC_INLINE _cx_value*
_cx_MEMB(_emplace_back)(_cx_Self* self, const _cx_raw raw)
{ return _cx_MEMB(_push)(self, i_keyfrom(raw)); }
STC_INLINE _cx_iter
_cx_MEMB(_emplace_at)(_cx_Self* self, _cx_iter it, const _cx_raw raw)
{ return _cx_MEMB(_insert_at)(self, it, i_keyfrom(raw)); }
#endif
#if defined _i_has_eq || defined _i_has_cmp
STC_API _cx_iter _cx_MEMB(_find_in)(_cx_iter p1, _cx_iter p2, _cx_raw raw);
STC_INLINE _cx_iter
_cx_MEMB(_find)(const _cx_Self* self, _cx_raw raw) {
return _cx_MEMB(_find_in)(_cx_MEMB(_begin)(self), _cx_MEMB(_end)(self), raw);
}
STC_INLINE const _cx_value*
_cx_MEMB(_get)(const _cx_Self* self, _cx_raw raw) {
return _cx_MEMB(_find_in)(_cx_MEMB(_begin)(self), _cx_MEMB(_end)(self), raw).ref;
}
STC_INLINE _cx_value*
_cx_MEMB(_get_mut)(_cx_Self* self, _cx_raw raw)
{ return (_cx_value *) _cx_MEMB(_get)(self, raw); }
#endif
/* -------------------------- IMPLEMENTATION ------------------------- */
#if defined(i_implement) || defined(i_static)
#include "priv/cqueue_imp.h"
STC_DEF _cx_value*
_cx_MEMB(_push_front)(_cx_Self* self, i_key value) {
intptr_t start = (self->start - 1) & self->capmask;
if (start == self->end) { // full
_cx_MEMB(_reserve)(self, self->capmask + 3); // => 2x expand
start = (self->start - 1) & self->capmask;
}
_cx_value *v = self->data + start;
self->start = start;
*v = value;
return v;
}
STC_DEF void
_cx_MEMB(_erase_n)(_cx_Self* self, const intptr_t idx, const intptr_t n) {
const intptr_t len = _cx_MEMB(_size)(self);
for (intptr_t i = idx + n - 1; i >= idx; --i)
i_keydrop(_cx_MEMB(_at_mut)(self, i));
for (intptr_t i = idx, j = i + n; j < len; ++i, ++j)
*_cx_MEMB(_at_mut)(self, i) = *_cx_MEMB(_at)(self, j);
self->end = (self->end - n) & self->capmask;
}
STC_DEF _cx_iter
_cx_MEMB(_insert_uninit)(_cx_Self* self, const intptr_t idx, const intptr_t n) {
const intptr_t len = _cx_MEMB(_size)(self);
_cx_iter it = {._s=self};
if (len + n > self->capmask)
if (!_cx_MEMB(_reserve)(self, len*5/4 + n))
return it;
for (intptr_t i = len - 1, j = i + n; i >= idx; --i, --j)
*_cx_MEMB(_at_mut)(self, j) = *_cx_MEMB(_at)(self, i);
self->end = (self->end + n) & self->capmask;
it.pos = _cdeq_topos(self, idx);
it.ref = self->data + it.pos;
return it;
}
STC_DEF _cx_iter
_cx_MEMB(_insert_n)(_cx_Self* self, const intptr_t idx, const _cx_value* arr, const intptr_t n) {
_cx_iter it = _cx_MEMB(_insert_uninit)(self, idx, n);
for (intptr_t i = idx, j = 0; j < n; ++i, ++j)
*_cx_MEMB(_at_mut)(self, i) = arr[j];
return it;
}
#if !defined i_no_emplace
STC_DEF _cx_iter
_cx_MEMB(_emplace_n)(_cx_Self* self, const intptr_t idx, const _cx_raw* raw, const intptr_t n) {
_cx_iter it = _cx_MEMB(_insert_uninit)(self, idx, n);
for (intptr_t i = idx, j = 0; j < n; ++i, ++j)
*_cx_MEMB(_at_mut)(self, i) = i_keyfrom(raw[j]);
return it;
}
#endif
#if defined _i_has_eq || defined _i_has_cmp
STC_DEF _cx_iter
_cx_MEMB(_find_in)(_cx_iter i1, _cx_iter i2, _cx_raw raw) {
for (; i1.pos != i2.pos; _cx_MEMB(_next)(&i1)) {
const _cx_raw r = i_keyto(i1.ref);
if (i_eq((&raw), (&r)))
break;
}
return i1;
}
#endif
#endif // IMPLEMENTATION
#define CDEQ_H_INCLUDED
#include "priv/template2.h"
|
