-
Notifications
You must be signed in to change notification settings - Fork 0
/
DynamicArray.h
234 lines (187 loc) · 4.28 KB
/
DynamicArray.h
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
/**
*
* Solution to homework task
* Data Structures Course
* Faculty of Mathematics and Informatics of Sofia University
* Winter semester 2016/2017
*
* @author Nevena Mihaylova Gadzheva
* @idnumber 61938
* @task 1
* @compiler VC
*
*/
#ifndef DYNAMIC_ARRAY_H
#define DYNAMIC_ARRAY_H
#include<assert.h>
// Implementation of a template of a class, which shows a dynamic array
template<class DataType>
class DynamicArray
{
public:
//Constructors, destructor and copy assignment operator
// Default constructor
DynamicArray();
// Destructor
~DynamicArray();
//Copy constructor
DynamicArray(const DynamicArray &);
// Copy assignment operator
DynamicArray& operator=(const DynamicArray&);
// Operators for access
// Operator functions for indexing
const DataType& operator[](int) const;
DataType& operator[](int);
// Adds an element at the end of the array
void Add(DataType);
// Prints the elements of the array
void Print() const;
// Information methods
// Returns the number of elements currunetly stored in the array
int GetSize() const;
// Returns the allocated memory for the array
int GetCapaity() const;
// Checks whether the stack is empty
bool IsEmpty() const;
private:
DataType* data;
int usedSize;
int capacity;
// Help functions
// Initializes the data members of the object
void Init();
// Removes all elements in the array and frees the allocated memory
void Delete();
// Makes a copy of the array
void Copy(const DynamicArray&);
// Resizes the array
void Resize(int);
};
// Constructs an empty array
template<class DataType>
DynamicArray<DataType>::DynamicArray()
{
Init();
}
// Destructor
template<class DataType>
DynamicArray<DataType>::~DynamicArray()
{
Delete();
}
// Copy constructor
template<class DataType>
DynamicArray<DataType>::DynamicArray(const DynamicArray& other)
{
Init();
Copy(other);
}
// Assignment operator
// The operator frees the currently allocated mamory and then performs the copying
template<class DataType>
DynamicArray<DataType>& DynamicArray<DataType>::operator=(const DynamicArray& other)
{
if (this != &other)
{
Delete();
Copy(other);
}
return *this;
}
// Constant operation function for indexing
template<class DataType>
const DataType& DynamicArray<DataType>::operator[](int index) const
{
//assert(index < usedSize);
return data[index];
}
// Non-constant operation function for indexing
template<class DataType>
DataType& DynamicArray<DataType>::operator[](int index)
{
//assert(index < usedSize);
return data[index];
}
// Adds an element at the end of the array
template<class DataType>
void DynamicArray<DataType>::Add(DataType element)
{
if (usedSize >= capacity)
{
int newSize = (capacity == 0 ? 2 : capacity * 2);
Resize(newSize);
}
data[usedSize++] = element;
}
// Returns the number of elements currunetly stored in the array
template<class DataType>
int DynamicArray<DataType>::GetSize() const
{
//assert(usedSize != 0);
return usedSize;
}
// Returns the allocated memory for the array
template<class DataType>
int DynamicArray<DataType>::GetCapaity() const
{
assert(capacity != 0);
return capacity;
}
// Checks whether the array is empty
template<class DataType>
bool DynamicArray<DataType>::IsEmpty() const
{
return usedSize == 0;
}
// Prints the elements of the array
template<class DataType>
void DynamicArray<DataType>::Print() const
{
for (int i = 0; i < usedSize; i++)
{
cout << data[i];
}
cout << endl;
}
// Initializes the data members of the object
template<class DataType>
void DynamicArray<DataType>::Init()
{
data = NULL;
usedSize = 0;
capacity = 0;
}
// Removes all elements in the array and frees the allocated memory
template<class DataType>
void DynamicArray<DataType>::Delete()
{
delete[] data;
data = NULL;
usedSize = 0;
capacity = 0;
}
// Makes a copy of the array
template<class DataType>
void DynamicArray<DataType>::Copy(const DynamicArray& other)
{
capacity = capacity ? capacity : 1;
data = new DataType[capacity];
for (int i = 0; i < usedSize; i++)
{
data[i] = other[i];
}
}
// Resizes the array
template<class DataType>
void DynamicArray<DataType>::Resize(int newCapacity)
{
DataType* newData = new DataType[newCapacity];
for (int i = 0; i < usedSize && i < newCapacity; i++)
{
newData[i] = data[i];
}
delete[] data;
data = newData;
capacity = newCapacity;
}
#endif