asar coverage - build #130

src/asar/
File: src/asar/assocarr.h
Date: 2024-01-22 10:47:55
Lines:
116/119
97.5%
Functions:
79/85
92.9%
Branches:
58/64
90.6%
Line Branch Exec Source
1 //API for assocarr<mytype> myarr:
2 //myarr.exists("index")
3 // Returns a boolean telling whether the entry exists.
4 // Complexity: O(log n).
5 //myarr.find("index")
6 // Returns a mytype& corresponding to the relevant entry. If it doesn't exist, behaviour is undefined.
7 // Complexity: O(log n).
8 //myarr.create("index")
9 // Returns a mytype& corresponding to the relevant entry. If it doesn't exist, it's created.
10 // Complexity: Worst case O(n), reduced to amortized O(log n) if the element should be at the end (strict weak ordering), or O(log n) if the element
11 // exists.
12 //myarr.remove("index")
13 // Removes the element corresponding to the relevant entry. If it doesn't exist, this structure is left untouched.
14 // Complexity: Worst case O(n), reduced to amortized O(log n) if the element is at the end.
15 //myarr.reset()
16 // Clears the data structure, calling all destructors. It is safe to call this function on an empty structure.
17 // Complexity: O(n).
18 //myarr.move("from", "to")
19 // Moves an element from index "from" to "to". If the source doesn't exist, behaviour is undefined. If the target exists, no action is performed.
20 // Complexity: O(n).
21 //myarr["index"]
22 // Similar to myarr.create("index"), but if the returned entry isn't changed by the next call to any function in the same structure, it's removed.
23 // if (myarr["index"]) is safe if type can cast to a bool, and myarr["index"]=4 is also valid if the assignment is valid for a type&. However, it is
24 // not safe to use assocarr<assocarr<int> > myarr; if (myarr["3"]["4"]), since the inner assocarr won't know that it's supposed to be garbage collected,
25 // and the outer one sees that the inner one changed, so you get pollution and memory waste. However, if (myarr["3"].exists("4")) is safe.
26 // Complexity: Same as myarr.create().
27 //myarr.each(func)
28 // Calls func() for each entry in the structure. func must match the prototype void func(const char * index, mytype& val), but can be a lambda. No
29 // non-const function may be called on this structure from inside func(), but it is safe to call const functions of the structure. The function
30 // calls are in the same order as the indexes, in a strict weak ordering.
31 // Complexity: O(n).
32 //Space usage: O(n).
33 //C++ version: C++98 or C++03, not sure which.
34 //Serializer support: Yes, if mytype is serializable.
35 //"Undefined behaviour" means "segfault" in most cases.
36
37 #pragma once
38
39 #include <initializer_list>
40 #include "std-includes.h"
41 #include "libmisc.h"//bitround
42
43 //just a helper for initializer list
44 template<typename T1, typename T2> struct pair{
45 T1 first;
46 T2 second;
47 };
48
49 template<typename right> class assocarr {
50 public:
51 int num;
52
53 private:
54
55 const char ** indexes;
56 right ** ptr;
57 int bufferlen;
58
59 char lastone[sizeof(right)];
60 int lastid;
61
62 420431 void collectgarbage(const char * ifnotmatch=nullptr)
63 {
64
2/2
✓ Branch 0 taken 108977 times.
✓ Branch 1 taken 112120 times.
 420431 if (lastid==-1) return;
65
4/4
✓ Branch 0 taken 161372 times.
✓ Branch 1 taken 241 times.
✓ Branch 2 taken 78734 times.
✓ Branch 3 taken 82638 times.
 323226 if (ifnotmatch && !strcmp(indexes[lastid], ifnotmatch)) return;
66
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 161487 times.
 322974 if (!memcmp(ptr[lastid], lastone, sizeof(right)))
67 {
68 ✗ int tmpid=lastid;
69 ✗ lastid=-1;
70 ✗ remove(indexes[tmpid]);
71 }
72 322974 lastid=-1;
73 }
74
75 379134 right& rawadd(const char * index, bool collect)
76 {
77 379134 collectgarbage(index);
78 193745 int loc=0;
79 379134 int skip= (int)bitround((unsigned int)num);
80
2/2
✓ Branch 0 taken 1120681 times.
✓ Branch 1 taken 196112 times.
 2473215 while (skip)
81 {
82 int dir;
83
2/2
✓ Branch 0 taken 556136 times.
✓ Branch 1 taken 564545 times.
 2112293 if (loc>=num) dir=1;
84 1496624 else dir=strcmp(indexes[loc], index);
85
2/2
✓ Branch 0 taken 12598 times.
✓ Branch 1 taken 952097 times.
 1812220 if (!dir) return ptr[loc][0];
86 2095884 skip/=2;
87
2/2
✓ Branch 0 taken 381101 times.
✓ Branch 1 taken 726982 times.
 2095884 if (dir>0) loc-=skip;
88 1370769 else loc+=skip;
89
2/2
✓ Branch 0 taken 542111 times.
✓ Branch 1 taken 565972 times.
 2095884 if (loc<0)
90 {
91 909 loc=0;
92 909 break;
93 }
94 }
95
4/4
✓ Branch 0 taken 108912 times.
✓ Branch 1 taken 88207 times.
✓ Branch 2 taken 99119 times.
✓ Branch 3 taken 9793 times.
 362725 if (loc<num && strcmp(indexes[loc], index)<0) loc++;
96
2/2
✓ Branch 0 taken 37265 times.
✓ Branch 1 taken 159854 times.
 362725 if (num==bufferlen)
97 {
98
2/2
✓ Branch 0 taken 7535 times.
✓ Branch 1 taken 29730 times.
 59040 if (!num) bufferlen=1;
99 47865 else bufferlen*=2;
100 59040 ptr=(right**)realloc(ptr, sizeof(right*)*(size_t)bufferlen);
101 59040 indexes=(const char**)realloc(indexes, sizeof(const char *)*(size_t)bufferlen);
102 }
103 362725 num++;
104 362725 memmove(indexes+loc+1, indexes+loc, sizeof(const char *)*(size_t)(num-loc-1));
105 362725 memmove(ptr+loc+1, ptr+loc, sizeof(right*)*(size_t)(num-loc-1));
106 362725 indexes[loc]= duplicate_string(index);
107 362725 ptr[loc]=(right*)malloc(sizeof(right));
108 362725 memset(ptr[loc], 0, sizeof(right));
109
1/4
✓ Branch 0 taken 108 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 362725 new(ptr[loc]) right;
110
2/2
✓ Branch 0 taken 163561 times.
✓ Branch 1 taken 33558 times.
 362725 if (collect)
111 {
112 327122 lastid=loc;
113 327122 memcpy(lastone, ptr[loc], sizeof(right));
114 }
115 362725 return ptr[loc][0];
116 }
117
118 246606 int find_i(const char * index) const
119 {
120 107409 int loc=0;
121 246606 int skip=(int)bitround((unsigned int)num);
122
2/2
✓ Branch 0 taken 481239 times.
✓ Branch 1 taken 65153 times.
 717008 while (skip)
123 {
124 int dir;
125
2/2
✓ Branch 0 taken 250078 times.
✓ Branch 1 taken 231161 times.
 648896 if (loc>=num) dir=1;
126 616402 else dir=strcmp(indexes[loc], index);
127
2/2
✓ Branch 0 taken 111616 times.
✓ Branch 1 taken 353644 times.
 632665 if (!dir) return loc;
128 471274 skip/=2;
129
2/2
✓ Branch 0 taken 141193 times.
✓ Branch 1 taken 228430 times.
 471274 if (dir>0) loc-=skip;
130 287971 else loc+=skip;
131
2/2
✓ Branch 0 taken 187886 times.
✓ Branch 1 taken 181737 times.
 471274 if (loc<0) return -1;
132 }
133 30977 return -1;
134 }
135
136 public:
137
138 188095 bool exists(const char * index) const
139 {
140 188095 return find_i(index)>=0;
141 }
142
143 100184 right& find(const char * index) const
144 {
145 100184 return ptr[find_i(index)][0];
146 }
147
148 57273 right& create(const char * index)
149 {
150 57273 return rawadd(index, false);
151 }
152
153 1100 void remove(const char * index)
154 {
155 1100 collectgarbage();
156 562 int loc=0;
157 1100 int skip= (int)bitround((unsigned int)num);
158
2/2
✓ Branch 0 taken 2213 times.
✓ Branch 1 taken 259 times.
 3762 while (skip)
159 {
160 int dir;
161
2/2
✓ Branch 0 taken 1104 times.
✓ Branch 1 taken 1109 times.
 3503 if (loc>=num) dir=1;
162 3497 else dir=strcmp(indexes[loc], index);
163
2/2
✓ Branch 0 taken 504 times.
✓ Branch 1 taken 1706 times.
 3500 if (!dir)
164 {
165 840 free((void*)indexes[loc]);
166 840 ptr[loc]->~right();
167 840 free(ptr[loc]);
168 840 memmove(indexes+loc, indexes+loc+1, sizeof(const char *)*(size_t)(num-loc-1));
169 840 memmove(ptr+loc, ptr+loc+1, sizeof(right*)*(size_t)(num-loc-1));
170 840 num--;
171
2/2
✓ Branch 0 taken 66 times.
✓ Branch 1 taken 438 times.
 840 if (num==bufferlen/2)
172 {
173 132 bufferlen/=2;
174 132 ptr=(right**)realloc(ptr, sizeof(right*)*(size_t)bufferlen);
175 132 indexes=(const char**)realloc(indexes, sizeof(const char *)*(size_t)bufferlen);
176 }
177 840 return;
178 }
179 2663 skip/=2;
180
2/2
✓ Branch 0 taken 632 times.
✓ Branch 1 taken 1077 times.
 2663 if (dir>0) loc-=skip;
181 1677 else loc+=skip;
182
2/2
✓ Branch 0 taken 853 times.
✓ Branch 1 taken 856 times.
 2663 if (loc<0) return;
183 }
184 }
185
186 void move(const char * from, const char * to)
187 {
188 collectgarbage();
189 int frompos=find_i(from);
190 int topos=0;
191 int skip=bitround(num);
192 while (skip)
193 {
194 int dir;
195 if (topos>=num) dir=1;
196 else dir=strcmp(indexes[topos], to);
197 if (!dir) return;
198 skip/=2;
199 if (dir>0) topos-=skip;
200 else topos+=skip;
201 if (topos<0)
202 {
203 topos=0;
204 break;
205 }
206 }
207 if (topos<num && strcmp(indexes[topos], to)<0) topos++;
208 right * tmp=ptr[frompos];
209 if (topos==frompos || topos==frompos+1)
210 {
211 free((void*)indexes[frompos]);
212 indexes[frompos]= duplicate_string(to);
213 }
214 else if (topos>frompos)
215 {
216 free((void*)indexes[frompos]);
217 memmove(indexes+frompos, indexes+frompos+1, sizeof(const char *)*(topos-frompos-1));
218 memmove(ptr+frompos, ptr+frompos+1, sizeof(right*)*(topos-frompos-1));
219 ptr[topos-1]=tmp;
220 indexes[topos-1]= duplicate_string(to);//I wonder what the fuck I'm doing.
221 }
222 else
223 {
224 free((void*)indexes[frompos]);
225 memmove(indexes+topos+1, indexes+topos, sizeof(const char *)*(frompos-topos));
226 memmove(ptr+topos+1, ptr+topos, sizeof(right*)*(frompos-topos));
227 ptr[topos]=tmp;
228 indexes[topos]= duplicate_string(to);
229 }
230 }
231
232 26632 void reset()
233 {
234
2/2
✓ Branch 0 taken 177923 times.
✓ Branch 1 taken 13916 times.
 382271 for (int i=0;i<num;i++)
235 {
236 355639 free((void*)indexes[i]);
237 355639 ptr[i]->~right();
238 355639 free(ptr[i]);
239 }
240 26632 free(indexes);
241 26632 free(ptr);
242 26632 indexes=nullptr;
243 26632 ptr= nullptr;
244 26632 num=0;
245 26632 bufferlen=0;
246 26632 lastid=-1;
247 26632 }
248
249 4819 assocarr()
250 {
251 4819 indexes= nullptr;
252 4819 ptr= nullptr;
253 4819 num=0;
254 4819 bufferlen=0;
255 4819 lastid=-1;
256 4819 }
257
258 241 assocarr(std::initializer_list<pair<const char *, right>> list)
259 {
260 241 indexes= nullptr;
261 241 ptr= nullptr;
262 241 num=0;
263 241 bufferlen=0;
264 241 lastid=-1;
265
266
2/2
✓ Branch 0 taken 15665 times.
✓ Branch 1 taken 241 times.
 15906 for(auto &item : list){
267 15665 rawadd(item.first, true) = item.second;
268 }
269 241 }
270
271 2670 ~assocarr()
272 {
273 2670 reset();
274 2670 }
275
276 300664 right& operator[](const char * index)
277 {
278 300664 return rawadd(index, true);
279 }
280
281 //void(*func)(const char * key, right& value)
282 21232 template<typename t> void each(t func)
283 {
284 21232 collectgarbage();
285
2/2
✓ Branch 0 taken 176873 times.
✓ Branch 1 taken 10616 times.
 374978 for (int i=0;i<num;i++)
286 {
287
2/4
✓ Branch 0 taken 27986 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 14146 times.
✗ Branch 3 not taken.
 353746 func(indexes[i], ptr[i][0]);
288 }
289 21232 }
290
291 //void debug(){puts("");for(int i=0;i<num;i++)puts(indexes[i]);}
292
293 #ifdef SERIALIZER
294 void serialize(serializer & s)
295 {
296 collectgarbage();
297 if (s.serializing)
298 {
299 s(num);
300 s(bufferlen);
301 for (int i=0;i<num;i++)
302 {
303 s(ptr[i][0]);
304 s(indexes[i]);
305 }
306 }
307 else
308 {
309 reset();
310 s(num);
311 s(bufferlen);
312 ptr=(right**)malloc(sizeof(right*)*bufferlen);
313 indexes=(const char**)malloc(sizeof(const char *)*bufferlen);
314 for (int i=0;i<num;i++)
315 {
316 ptr[i]=(right*)malloc(sizeof(right));
317 memset(ptr[i], 0, sizeof(right));
318 new(ptr[i]) right;
319 s(ptr[i][0]);
320 s(indexes[i]);
321 }
322 }
323 }
324 #endif
325 #define SERIALIZER_BANNED
326 };
327