asar coverage - build #93

src/asar/
File: src/asar/autoarray.h
Date: 2024-01-19 18:20:15
Lines:
76/76
100.0%
Functions:
102/109
93.6%
Branches:
68/85
80.0%
Line Branch Exec Source
1 #pragma once
2
3 #include "std-includes.h"
4
5 //Note: T must be a pointer type, or stuff will screw up. To make a pointer last longer than this object, assign nullptr to it and it won't free the old one.
6 template<typename T> class autoptr {
7 T ptr;
8 public:
9 operator T() const
10 {
11
13/13
✓ Branch 0 taken 135 times.
✓ Branch 1 taken 15678 times.
✓ Branch 2 taken 162 times.
✓ Branch 3 taken 135 times.
✓ Branch 4 taken 105 times.
✓ Branch 5 taken 99 times.
✓ Branch 6 taken 147 times.
✓ Branch 7 taken 156 times.
✓ Branch 8 taken 111 times.
✓ Branch 9 taken 60 times.
✓ Branch 10 taken 132 times.
✓ Branch 11 taken 159 times.
✓ Branch 12 taken 33 times.
 20928 return ptr;
12 }
13
14 autoptr& operator=(T ptr_)
15 {
16
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1206 times.
 1314 ptr = ptr_;
17 return *this;
18 }
19
20 1674 autoptr()
21 {
22
2/2
✓ Branch 0 taken 1314 times.
✓ Branch 1 taken 360 times.
 1674 ptr = nullptr;
23 }
24
25 360873 autoptr(T ptr_)
26 {
27
14/19
✓ Branch 0 taken 36 times.
✓ Branch 1 taken 17769 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 2232 times.
✓ Branch 4 taken 14940 times.
✗ Branch 5 not taken.
✓ Branch 6 taken 8424 times.
✓ Branch 7 taken 15726 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 72 times.
✓ Branch 10 taken 54 times.
✓ Branch 11 taken 99 times.
✓ Branch 12 taken 36 times.
✓ Branch 13 taken 513 times.
✓ Branch 14 taken 36 times.
✓ Branch 15 taken 678 times.
✗ Branch 16 not taken.
✓ Branch 17 taken 189 times.
✗ Branch 18 not taken.
 343791 ptr = ptr_;
28 }
29
30 autoptr(const autoptr<T>& ptr_)
31 {
32 ptr = ptr_.ptr;
33 }
34
35 961239 ~autoptr()
36 {
37
2/2
✓ Branch 0 taken 361857 times.
✓ Branch 1 taken 990 times.
 571845 if (ptr) free((void*)ptr);
38 961239 }
39 };
40
41 template<typename T> class autoarray {
42 public:
43 int count;
44
45 private:
46 T* ptr;
47 int bufferlen;
48
49 T dummy;
50 static const int default_size = 128;
51
52 10844 const T& getconst(int id) const
53 {
54
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5422 times.
 10844 if (id < 0) return dummy;
55
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 5422 times.
 10844 if (id >= count) return dummy;
56 10844 return ptr[id];
57 }
58
59 7877785 T& get(int id)
60 {
61
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 6452498 times.
 7877785 if (id < 0) return dummy;
62
2/2
✓ Branch 0 taken 811 times.
✓ Branch 1 taken 6451687 times.
 7877785 if (id >= bufferlen - 4)
63 {
64 1622 resize(id);
65 }
66
2/2
✓ Branch 0 taken 677707 times.
✓ Branch 1 taken 5774791 times.
 7877785 if (id >= count)
67 {
68
3/3
✓ Branch 0 taken 22806 times.
✓ Branch 1 taken 677783 times.
✓ Branch 2 taken 655099 times.
 2711148 for (int i = count;i <= id;i++) new(ptr + i) T();
69 1355300 count = id + 1;
70 }
71 7877785 return ptr[id];
72 }
73
74 1677 void resize(int size)
75 {
76 1677 int oldlen = count;
77
2/2
✓ Branch 0 taken 866 times.
✓ Branch 1 taken 866 times.
 3354 while (bufferlen <= size + 4) bufferlen *= 2;
78 1677 T *old = ptr;
79 1677 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
80
2/2
✓ Branch 0 taken 152184 times.
✓ Branch 1 taken 866 times.
 305441 for(int i = 0; i < oldlen; i++){
81 303764 new(ptr + i) T();
82 303764 ptr[i] = static_cast<T &&>(old[i]);
83 }
84 1677 free(old);
85 1677 memset(ptr + oldlen, 0, (size_t)(bufferlen - oldlen) * sizeof(T));
86 1677 }
87
88 public:
89
90 64957 void reset(int keep = 0)
91 {
92
2/2
✓ Branch 0 taken 4648 times.
✓ Branch 1 taken 28555 times.
 64957 if (keep >= count) return;
93
2/2
✓ Branch 0 taken 4563 times.
✓ Branch 1 taken 2582 times.
 14290 for (int i = keep;i < count;i++) ptr[i].~T();
94 8589 memset(ptr + keep, 0, (size_t)(count - keep) * sizeof(T));
95
1/2
✓ Branch 0 taken 4648 times.
✗ Branch 1 not taken.
 8589 if (keep < bufferlen / 2)
96 {
97
3/4
✓ Branch 0 taken 9121 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 4473 times.
✓ Branch 3 taken 4648 times.
 16444 while (keep < bufferlen / 2 && bufferlen>8) bufferlen /= 2;
98 8589 T *old = ptr;
99 8589 ptr = (T*)malloc(sizeof(T)*(size_t)bufferlen);
100
2/2
✓ Branch 0 taken 54 times.
✓ Branch 1 taken 4648 times.
 8697 for(int i = 0; i < keep; i++){
101 108 new(ptr + i) T();
102 108 ptr[i] = static_cast<T &&>(old[i]);
103 }
104 8589 free(old);
105
106 }
107 8589 count = keep;
108 }
109
110 T& operator[](int id)
111 {
112
1/2
✓ Branch 0 taken 18 times.
✗ Branch 1 not taken.
 3844306 return get(id);
113 }
114
115 const T& operator[](int id) const
116 {
117 5422 return getconst(id);
118 }
119
120 operator T*()
121 {
122
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 119 times.
 2073 return ptr;
123 }
124
125 operator const T*() const
126 {
127 return ptr;
128 }
129
130 1310171 T& append(const T& item)
131 {
132 1310171 return (get(count) = item);
133 }
134
135 //insert is not safe for non pod types!!!
136 void insert(int pos)
137 {
138 if (pos<0 || pos>count) return;
139 if (count >= bufferlen - 4)
140 {
141 resize(count);
142 }
143 memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(count - pos));
144 memset(ptr + pos, 0, sizeof(T));
145 new(ptr + pos) T();
146 count++;
147 }
148
149 477324 void insert(int pos, const T& item)
150 {
151
2/4
✓ Branch 0 taken 477324 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 477324 times.
✗ Branch 3 not taken.
 477324 if (pos<0 || pos>count) return;
152
2/2
✓ Branch 0 taken 55 times.
✓ Branch 1 taken 477269 times.
 477324 if (count >= bufferlen - 4)
153 {
154 55 resize(count);
155 }
156 477324 memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(size_t)(count - pos));
157 477324 memset(ptr + pos, 0, sizeof(T));
158 477324 new(ptr + pos) T();
159 477324 ptr[pos] = item;
160 477324 count++;
161 }
162
163 1105332 void remove(int id)
164 {
165
2/4
✓ Branch 0 taken 1103658 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 1103658 times.
✗ Branch 3 not taken.
 1105332 if (id < 0 || id >= count) return;
166 1105332 count--;
167 1105332 ptr[id].~T();
168
2/2
✓ Branch 0 taken 584045 times.
✓ Branch 1 taken 1103658 times.
 1689377 for(int i = id; i < count; i++){
169 584045 ptr[i] = static_cast<T &&>(ptr[i+1]);
170 }
171 }
172
173 25893 autoarray()
174 12926 {
175 25893 ptr = (T*)malloc(sizeof(T) * default_size);
176 25893 memset(ptr, 0, default_size*sizeof(T));
177 25893 bufferlen = default_size;
178 25893 count = 0;
179 27689 }
180
181 25600 ~autoarray()
182 {
183
2/2
✓ Branch 0 taken 21915 times.
✓ Branch 1 taken 5650 times.
 55130 for (int i = 0;i < count;i++) ptr[i].~T();
184 21218 free(ptr);
185 25600 }
186
187 #ifdef SERIALIZER
188 void serialize(serializer& s)
189 {
190 if (s.serializing) s(count);
191 else
192 {
193 int i;
194 s(i);
195 get(i - 1);
196 }
197 for (int i = 0;i < count;i++) s(ptr[i]);
198 }
199 #endif
200 #define SERIALIZER_BANNED
201 };
202