Repository navigation
Expand file tree
/
Copy pathdynarray.h
More file actions
182 lines (160 loc) · 4.01 KB
/
Copy pathdynarray.h
File metadata and controls
182 lines (160 loc) · 4.01 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
171
172
173
174
175
176
177
178
179
180
181
182
// Library for I/O of genetic data
// This code was given to me by Pete Shirley
//
// This program is distributed under the terms of the GNU General Public License
#ifndef _DYNARRAY_H_
#define _DYNARRAY_H_
#include <stdlib.h>
#include <assert.h>
// a dynarray stores data in an ordered random access structure with
// no delete operations. Items are added with append.
template <class T>
class dynarray {
public:
dynarray();
dynarray(int);
dynarray(const dynarray<T>&);
~dynarray();
dynarray<T>& operator=(const dynarray<T>&);
bool append(T item); // always tagged to end
bool addEmpty(); // efficiency hack: adds new index/space without value
bool resize(int size);// efficiency hack similar to addEmpty()
bool truncate(); // make arraySize = nData;
void clear() { nData = 0; }
void swap(int, int);
void reverse();
void removeLast() { nData--; }
void removeLast(int num) { nData -= num; }
int length() const { return nData; }
bool empty() const { return length() == 0; }
const T &operator[] (int i) const { assert(i >= 0 && i < length());
return data[i]; }
T &operator[] (int i) { assert(i >= 0 && i < length());
return data[i]; }
private:
T *data;
int nData;
int arraySize;
};
template <class T>
dynarray<T>::dynarray() {
nData = 0;
arraySize = 4;
data = new T[arraySize];
}
template <class T>
dynarray<T>::dynarray(int a) {
nData = 0;
arraySize = a;
data = new T[arraySize];
}
template <class T>
dynarray<T>::dynarray(const dynarray<T>& t) {
nData = t.length();
arraySize = t.arraySize;
data = new T[arraySize];
for (int i = 0; i < t.length(); i++)
data[i] = t[i];
}
template <class T>
dynarray<T>::~dynarray() {
nData = 0;
delete [] data;
}
template <class T>
dynarray<T>& dynarray<T>::operator=(const dynarray<T>& t) {
if (&t == this) return *this;
bool needNew = false;
nData = t.length();
if (data != NULL && arraySize < nData) {
delete [] data;
needNew = true;
}
if (data == NULL || needNew) {
arraySize = t.arraySize;
data = new T[arraySize];
}
for (int i = 0; i < t.length(); i++)
data[i] = t[i];
return *this;
}
template <class T>
bool dynarray<T>::append(T item) {
if (nData == arraySize) {
if (arraySize > 256)
arraySize += 256; // don't grow exponentially after 256 indices
else
arraySize *= 2;
T *temp = data;
if (!(data = new T[arraySize])) return false;
for (int i = 0; i < nData; i++)
data[i] = temp[i];
assert(data != temp);
delete [] temp;
}
data[nData++] = item;
return true;
}
template <class T>
bool dynarray<T>::addEmpty() {
if (nData == arraySize) {
if (arraySize > 256)
arraySize += 256; // don't grow exponentially after 256 indices
else
arraySize *= 2;
T *temp = data;
if (!(data = new T[arraySize])) return false;
for (int i = 0; i < nData; i++)
data[i] = temp[i];
delete [] temp;
}
nData++;
return true;
}
template <class T>
bool dynarray<T>::resize(int size) {
if (arraySize < size) {
while(arraySize < size) {
if (arraySize > 256)
arraySize += 256; // don't grow exponentially after 256 indices
else
arraySize *= 2;
T *temp = data;
if (!(data = new T[arraySize])) return false;
for (int i = 0; i < nData; i++)
data[i] = temp[i];
delete [] temp;
}
}
nData = size;
return true;
}
template <class T>
bool dynarray<T>::truncate() {
if(nData != arraySize) {
T *temp = data;
arraySize = nData;
if(!(data = new T[arraySize])) return false;
for(int i = 0; i < nData; i++)
data[i] = temp[i];
delete [] temp;
}
return true;
}
template <class T>
void dynarray<T>::swap(int a, int b) {
assert(a >= 0 && a < length());
assert(b >= 0 && b < length());
if (a == b)
return;
T temp = data[a];
data[a] = data[b];
data[b] = temp;
}
template <class T>
void dynarray<T>::reverse() {
for(int i = 0; i < length() / 2; i++) {
swap(i, length() - i - 1);
}
}
#endif // _DYNARRAY_H_