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
|
/*
* aarray.h
*
* Simple dynamic array template class.
*/
/*
* Copyright (C) 2009 Adam Kropelin
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of version 2 of the GNU General
* Public License as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1335, USA.
*/
#ifndef __AARRAY_H
#define __AARRAY_H
template <class T> class aarray
{
public:
aarray() : _data(NULL), _size(0) {}
aarray(const aarray<T> &rhs) : _data(NULL), _size(0) { *this = rhs; }
~aarray() { delete [] _data; }
aarray<T> &operator=(const aarray<T> &rhs)
{
if (this != &rhs)
{
delete [] _data;
_size = 0;
if (rhs._size)
{
_size = rhs._size;
_data = new T[_size];
for (unsigned int i = 0; i < _size; i++)
_data[i] = rhs._data[i];
}
}
return *this;
}
void append(const T& t)
{
T *tmp = new T[_size+1];
for (unsigned int i = 0; i < _size; i++)
tmp[i] = _data[i];
delete [] _data;
_data = tmp;
_data[_size++] = t;
}
unsigned int size() const { return _size; }
T& operator[](unsigned int idx) { return _data[idx]; }
const T& operator[](unsigned int idx) const { return _data[idx]; }
private:
T *_data;
unsigned int _size;
};
#endif
|
