asar coverage - build #285 - src/asar/autoarray.h

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		257367	operator T() const
10			{
11		257367	return ptr;
12			}
13
14		414	autoptr& operator=(T ptr_)
15			{
16		414	ptr = ptr_;
17		414	return *this;
18			}
19
20		534	autoptr()
21			{
22		534	ptr = nullptr;
23		534	}
24
25		87912	autoptr(T ptr_)
26			{
27		87912	ptr = ptr_;
28		87912	}
29
30			autoptr(const autoptr<T>& ptr_)
31			{
32			ptr = ptr_.ptr;
33			}
34
35		88446	~autoptr()
36			{
37	3/3 ✓ Branch 0 taken 39267 times. ✓ Branch 1 taken 39729 times. ✓ Branch 2 taken 60 times.	88446	if (ptr) free((void*)ptr);
38		88446	}
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		56	const T& getconst(int id) const
53			{
54	1/2 ✗ Branch 0 not taken. ✓ Branch 1 taken 28 times.	56	if (id < 0) return dummy;
55	1/3 ✗ Branch 0 not taken. ✗ Branch 1 not taken. ✓ Branch 2 taken 28 times.	56	if (id >= count) return dummy;
56		56	return ptr[id];
57			}
58
59		1898759	T& get(int id)
60			{
61	1/2 ✗ Branch 0 not taken. ✓ Branch 1 taken 1774557 times.	1898759	if (id < 0) return dummy;
62	4/4 ✓ Branch 0 taken 144 times. ✓ Branch 1 taken 886296 times. ✓ Branch 2 taken 147 times. ✓ Branch 3 taken 887970 times.	1898759	if (id >= bufferlen - 4)
63			{
64		582	resize(id);
65			}
66	3/3 ✓ Branch 0 taken 9624 times. ✓ Branch 1 taken 886624 times. ✓ Branch 2 taken 878309 times.	1898759	if (id >= count)
67			{
68	11/11 ✓ Branch 0 taken 3140 times. ✓ Branch 1 taken 9650 times. ✓ Branch 2 taken 6497 times. ✓ Branch 3 taken 15 times. ✓ Branch 4 taken 15 times. ✓ Branch 5 taken 1609 times. ✓ Branch 6 taken 7007 times. ✓ Branch 7 taken 5468 times. ✓ Branch 8 taken 45 times. ✓ Branch 9 taken 2781 times. ✓ Branch 10 taken 2781 times.	77852	for (int i = count;i <= id;i++) new(ptr + i) T();
69		38812	count = id + 1;
70			}
71		1898759	return ptr[id];
72			}
73
74		609	void resize(int size)
75			{
76		609	int oldlen = count;
77	4/4 ✓ Branch 0 taken 157 times. ✓ Branch 1 taken 157 times. ✓ Branch 2 taken 161 times. ✓ Branch 3 taken 161 times.	1218	while (bufferlen <= size + 4) bufferlen *= 2;
78		609	T *old = ptr;
79		609	ptr = (T)malloc(sizeof(T)(size_t)bufferlen);
80	2/2 ✓ Branch 0 taken 24744 times. ✓ Branch 1 taken 318 times.	49797	for(int i = 0; i < oldlen; i++){
81	0/7 ✗ Branch 0 not taken. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✗ Branch 5 not taken. ✗ Branch 6 not taken.	49188	new(ptr + i) T();
82	0/2 ✗ Branch 0 not taken. ✗ Branch 1 not taken.	49188	ptr[i] = static_cast<T &&>(old[i]);
83			}
84		609	free(old);
85	1/2 ✗ Branch 0 not taken. ✓ Branch 1 taken 161 times.	609	memset(ptr + oldlen, 0, (size_t)(bufferlen - oldlen) * sizeof(T));
86		609	}
87
88			public:
89
90		22458	void reset(int keep = 0)
91			{
92	3/3 ✓ Branch 0 taken 4381 times. ✓ Branch 1 taken 6275 times. ✓ Branch 2 taken 859 times.	22458	if (keep >= count) return;
93	7/7 ✓ Branch 0 taken 3242 times. ✓ Branch 1 taken 1083 times. ✓ Branch 2 taken 479 times. ✓ Branch 3 taken 3371 times. ✓ Branch 4 taken 347 times. ✓ Branch 5 taken 843 times. ✓ Branch 6 taken 512 times.	18942	for (int i = keep;i < count;i++) ptr[i].~T();
94	1/2 ✗ Branch 0 not taken. ✓ Branch 1 taken 859 times.	3015	memset(ptr + keep, 0, (size_t)(count - keep) * sizeof(T));
95	2/4 ✓ Branch 0 taken 765 times. ✗ Branch 1 not taken. ✓ Branch 2 taken 859 times. ✗ Branch 3 not taken.	3015	if (keep < bufferlen / 2)
96			{
97	8/10 ✓ Branch 0 taken 980 times. ✗ Branch 1 not taken. ✓ Branch 2 taken 215 times. ✓ Branch 3 taken 765 times. ✓ Branch 4 taken 1162 times. ✗ Branch 5 not taken. ✓ Branch 6 taken 303 times. ✓ Branch 7 taken 859 times. ✓ Branch 8 taken 303 times. ✓ Branch 9 taken 859 times.	3980	while (keep < bufferlen / 2 && bufferlen>8) bufferlen /= 2;
98		3015	T *old = ptr;
99		3015	ptr = (T)malloc(sizeof(T)(size_t)bufferlen);
100	2/2 ✓ Branch 0 taken 24 times. ✓ Branch 1 taken 1624 times.	3063	for(int i = 0; i < keep; i++){
101	0/7 ✗ Branch 0 not taken. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✗ Branch 3 not taken. ✗ Branch 4 not taken. ✗ Branch 5 not taken. ✗ Branch 6 not taken.	48	new(ptr + i) T();
102		48	ptr[i] = static_cast<T &&>(old[i]);
103			}
104		3015	free(old);
105
106			}
107		3015	count = keep;
108			}
109
110		1865817	T& operator[](int id)
111			{
112		1865817	return get(id);
113			}
114
115		56	const T& operator[](int id) const
116			{
117		56	return getconst(id);
118			}
119
120		1646	operator T*()
121			{
122		1646	return ptr;
123			}
124
125			operator const T*() const
126			{
127			return ptr;
128			}
129
130		27223	T& append(const T& item)
131			{
132		27223	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		138425	void insert(int pos, const T& item)
150			{
151	3/5 ✓ Branch 0 taken 138425 times. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✓ Branch 3 taken 69129 times. ✓ Branch 4 taken 69296 times.	138425	if (pos<0 \|\| pos>count) return;
152	4/4 ✓ Branch 0 taken 13 times. ✓ Branch 1 taken 69116 times. ✓ Branch 2 taken 14 times. ✓ Branch 3 taken 69282 times.	138425	if (count >= bufferlen - 4)
153			{
154		27	resize(count);
155			}
156	2/4 ✗ Branch 0 not taken. ✓ Branch 1 taken 69296 times. ✗ Branch 2 not taken. ✓ Branch 3 taken 69296 times.	138425	memmove(ptr + pos + 1, ptr + pos, sizeof(T)*(size_t)(count - pos));
157	1/2 ✗ Branch 0 not taken. ✓ Branch 1 taken 69296 times.	138425	memset(ptr + pos, 0, sizeof(T));
158		138425	new(ptr + pos) T();
159		138425	ptr[pos] = item;
160		138425	count++;
161			}
162
163		139026	void remove(int id)
164			{
165	3/5 ✓ Branch 0 taken 138462 times. ✗ Branch 1 not taken. ✗ Branch 2 not taken. ✓ Branch 3 taken 69171 times. ✓ Branch 4 taken 69291 times.	139026	if (id < 0 \|\| id >= count) return;
166		139026	count--;
167		139026	ptr[id].~T();
168	3/3 ✓ Branch 0 taken 93340 times. ✓ Branch 1 taken 162540 times. ✓ Branch 2 taken 69291 times.	325735	for(int i = id; i < count; i++){
169		186709	ptr[i] = static_cast<T &&>(ptr[i+1]);
170			}
171			}
172
173		5993	autoarray()
174		3195	{
175		5993	ptr = (T)malloc(sizeof(T) default_size);
176	1/2 ✗ Branch 0 not taken. ✓ Branch 1 taken 1627 times.	5993	memset(ptr, 0, default_size*sizeof(T));
177		5993	bufferlen = default_size;
178		5993	count = 0;
179		5993	}
180
181		5948	~autoarray()
182			{
183	7/7 ✓ Branch 0 taken 139 times. ✓ Branch 1 taken 6085 times. ✓ Branch 2 taken 719 times. ✓ Branch 3 taken 187 times. ✓ Branch 4 taken 756 times. ✓ Branch 5 taken 5472 times. ✓ Branch 6 taken 871 times.	28440	for (int i = 0;i < count;i++) ptr[i].~T();
184		5948	free(ptr);
185		5948	}
186			};
187