-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdynamic_array.cpp
More file actions
110 lines (83 loc) · 2.25 KB
/
dynamic_array.cpp
File metadata and controls
110 lines (83 loc) · 2.25 KB
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
#include <initializer_list>
#include <iostream>
template <class T, size_t initLen = 10> class DynArr {
T *m_pArr;
size_t m_nextIndex;
size_t m_len;
public:
DynArr(std::initializer_list<T>);
DynArr();
~DynArr();
T &operator[](size_t);
void add(size_t);
size_t size();
};
template <class T, size_t initLen> DynArr<T, initLen>::DynArr() {
m_len = initLen;
m_nextIndex = 0;
m_pArr = new T[m_len];
for (size_t i = 0; i < m_len; i++)
m_pArr[i] = 0;
}
template <class T, size_t initLen>
DynArr<T, initLen>::DynArr(std::initializer_list<T> list) {
m_len = list.size();
m_nextIndex = 0;
m_pArr = new T[m_len];
size_t i = 0;
for (size_t e : list) {
m_pArr[i] = e;
i++;
}
}
template <class T, size_t initLen> DynArr<T, initLen>::~DynArr() {
delete[] m_pArr;
}
template <class T, size_t initLen>
T &DynArr<T, initLen>::operator[](size_t index) {
T *pNewArr;
if (index >= m_len) {
m_len = index * 2;
pNewArr = new T[m_len];
for (size_t i = 0; i < m_nextIndex; i++)
pNewArr[i] = m_pArr[i];
for (size_t j = m_nextIndex; j < m_len; j++)
pNewArr[j] = 0;
delete[] m_pArr;
m_pArr = pNewArr;
}
if (index > m_nextIndex)
m_nextIndex = index + 1;
return *(m_pArr + index);
}
template <class T, size_t initLen> void DynArr<T, initLen>::add(size_t val) {
T *pNewArr;
if (m_nextIndex == m_len) {
m_len = m_len * 2;
pNewArr = new T[m_len];
for (size_t i = 0; i < m_nextIndex; i++)
pNewArr[i] = m_pArr[i];
for (size_t j = m_nextIndex; j < m_len; j++)
pNewArr[j] = 0;
delete[] m_pArr;
m_pArr = pNewArr;
}
m_pArr[m_nextIndex++] = val;
}
template <class T, size_t initLen> size_t DynArr<T, initLen>::size() {
return m_len;
}
int main() {
DynArr<int> fib{1, 1, 2, 3, 5, 7, 13};
std::cout << "size of fib[] is " << fib.size() << std::endl;
for (size_t i = 0; i < fib.size(); i++)
std::cout << "fib[" << i << "] = " << fib[i] << std::endl;
fib[5] = 8;
std::cout << "now fib[5] = " << fib[5] << std::endl;
fib[7] = 21;
std::cout << std::endl << "now fib[7] = " << fib[7] << std::endl;
std::cout << "now size of fib[] is " << fib.size() << std::endl;
fib.add(34);
std::cout << fib[8] << " is added to the end of the array";
return 0;
}