-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathgrowing_array.hpp
71 lines (71 loc) · 1.22 KB
/
growing_array.hpp
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
#pragma once
#ifndef GROWING_ARRAY_H
#define GROWING_ARRAY_H
#include <iostream>
#define GROWING_MINIMUM 32
template <class T>
class growing_array
{
private:
T *arr;
unsigned int _size;
//growing_array(growing_array& ref) {}
public:
growing_array(const growing_array &ref) = default;
growing_array(unsigned int initial_size = GROWING_MINIMUM)
{
_size = initial_size;
arr = new T[_size]();
}
// Avoid size check
inline T &direct_access(int index)
{
return arr[index];
}
// Access with size check
inline T &operator[](unsigned int index)
{
while (index >= _size)
{
grow();
}
return arr[index];
}
inline void grow()
{
T *tmp = new T[_size * 2]();
for (unsigned int i = 0; i < _size; i++)
{
tmp[i] = arr[i];
}
delete[] arr;
arr = tmp;
_size *= 2;
}
void shrink()
{
if (_size / 2 <= GROWING_MINIMUM)
return;
_size /= 2;
T *tmp = new T[_size];
for (unsigned int i = 0; i < _size; i++)
{
tmp[i] = arr[i];
}
delete[] arr;
arr = tmp;
}
inline unsigned int size()
{
return _size;
}
~growing_array()
{
if (arr)
delete[] arr;
arr = 0;
_size = 0;
}
};
#undef GROWING_MINIMUM
#endif // !GROWING_ARRAY_H