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
|
/*GPL*START*
*
* tvector<> class template -- improved stl vector<>
*
* Copyright (C) 2000-2001 by Johannes Overmann <Johannes.Overmann@gmx.de>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
* *GPL*END*/
#ifndef _ngw_tvector_h_
#define _ngw_tvector_h_
#ifdef DONT_USE_STL
#include "ttvector.h"
#define tvector_base ttvector
#else
# include <vector>
# define tvector_base vector
using namespace std;
#endif
#include "texception.h"
// history: start 08 Jul 2000
// 2000:
// 08 Jul: removing tarray and tassocarray, this should provide tmap and tvector
// 2001:
// 15 Sep: DONT_USE_STL feature added
// 16 Sep: splittet tstl.h into tvector.h and tmap.h
// 20 Sep: clear() added
template<class T>
class tvector: public tvector_base<T> {
public:
// 1:1 wrapper
/// create an empty vector
tvector():tvector_base<T>() {}
/// create a vector with n elements
tvector(size_t n):tvector_base<T>(n) {}
/// create a vector with n copies of t
tvector(size_t n, const T& t):tvector_base<T>(n, t) {}
// new functionality
/// append an element to the end
const tvector& operator += (const T& a) { this->push_back(a); return *this; }
/// append another tvector to the end
const tvector& operator += (const tvector& a) { this->insert(tvector_base<T>::end(), a.tvector_base<T>::begin(), a.tvector_base<T>::end()); return *this; }
/// direct read only access, safe
const T& operator[](size_t i) const { if(i < tvector_base<T>::size()) return tvector_base<T>::operator[](i); else throw TZeroBasedIndexOutOfRangeException(i, tvector_base<T>::size()); } // throw(TZeroBasedIndexOutOfRangeException);
/// direct read/write access, automatically create new elements
T& operator[](size_t i) { if(i >= tvector_base<T>::size()) operator+=(tvector(i - tvector_base<T>::size() + 1)); return tvector_base<T>::operator[](i); }
/// clear vector
void clear() { this->erase(tvector_base<T>::begin(), tvector_base<T>::end()); }
};
#endif /* _ngw_tvector_h_ */
|
