-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDynamicArrayTemplate.h
More file actions
170 lines (124 loc) · 3.71 KB
/
DynamicArrayTemplate.h
File metadata and controls
170 lines (124 loc) · 3.71 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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
// ===========================================================================
// DynamicArrayTemplate.h
// ===========================================================================
#pragma once
#include <iostream>
#include <string>
template <typename T>
class DynamicArrayTemplate
{
private:
size_t m_size;
T* m_data;
public:
// c'tor(s) / d'tor
DynamicArrayTemplate() {
m_size = 0;
m_data = nullptr;
}
DynamicArrayTemplate(size_t size) {
m_size = size;
m_data = new T[size];
// initialize buffer with default values
for (int i = 0; i < m_size; ++i) {
m_data[i] = T();
}
}
~DynamicArrayTemplate() {
delete[] m_data;
}
// getter / setter
size_t size() const { return m_size; }
T& at(size_t index) {
// bounds checking
if (index >= m_size) {
std::string msg = "Wrong Index: " + std::to_string(index);
throw std::out_of_range(msg);
}
return m_data[index];
}
// public interface
void fill(T value) {
for (int i = 0; i < m_size; ++i) {
m_data[i] = value;
}
}
void resize(size_t newSize) {
// allocate new buffer
T* data = new T[newSize];
size_t minSize = (newSize <= m_size) ? newSize : m_size;
// copy old buffer into new one
for (size_t i = 0; i < minSize; ++i) {
data[i] = m_data[i];
}
// initialize rest of buffer, if any, with default values
for (size_t i = m_size; i < newSize; ++i) {
data[i] = T();
}
// release old buffer
delete[] m_data;
// switch to new buffer
m_size = newSize;
m_data = data;
}
void release() {
delete[] m_data;
m_data = nullptr;
m_size = 0;
}
void print() {
for (size_t i = 0; i < m_size; ++i) {
std::cout << m_data[i] << ' ';
}
std::cout << "[Length: " << m_size << ']' << std::endl;
}
// operators
T& operator[] (size_t index) {
// no bounds checking - intentionally !!!
return m_data[index];
}
// copy semantics - copy constructor
DynamicArrayTemplate(const DynamicArrayTemplate& other) {
// allocate buffer
m_size = other.m_size;
m_data = new T[m_size];
// copy object
for (size_t i = 0; i < other.m_size; ++i) {
m_data[i] = other.m_data[i];
}
}
// copy semantics - assignment operator
DynamicArrayTemplate& operator= (const DynamicArrayTemplate& other) {
// prevent self-assignment
if (this == &other)
return *this;
// delete old buffer
delete[] m_data;
// allocate a new buffer
m_size = other.m_size;
m_data = new T[m_size];
// copy buffer
for (size_t i = 0; i < other.m_size; ++i) {
m_data[i] = other.m_data[i];
}
return *this;
}
// comparison operators
friend bool operator== (const DynamicArrayTemplate& left, DynamicArrayTemplate right) {
if (left.m_size != right.m_size) {
return false;
}
for (int i = 0; i < left.m_size; ++i) {
if (left.m_data[i] != right.m_data[i]) {
return false;
}
}
return true;
}
friend bool operator!= (const DynamicArrayTemplate& left, DynamicArrayTemplate right) {
return !(left == right);
}
};
// ===========================================================================
// End-of-File
// ===========================================================================