blob: 0146efde3fed7caa6e1914f1691ab98a865eb45e (
plain)
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
|
/* This file is part of the KDE project
Copyright (C) 2001 Simon Hausmann <hausmann@kde.org>
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public License
along with this library; see the file COPYING.LIB. If not, write to
the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
#ifndef __boundscheckingarray__
#define __boundscheckingarray__
#include <assert.h>
#include <qvaluevector.h>
/* I wish QValueVector would check bounds upon extraction.. */
template <typename T, const unsigned int size>
class BoundsCheckingArray
{
public:
BoundsCheckingArray() {}
BoundsCheckingArray( const BoundsCheckingArray<T, size> &rhs )
{ (*this) = rhs; }
BoundsCheckingArray &operator=( const BoundsCheckingArray<T, size> &rhs )
{
unsigned int i = 0;
for (; i < size; ++i )
m_data[ i ] = rhs.m_data[ i ];
return *this;
}
T &operator[]( unsigned int index )
{
assert( index < size );
return m_data[ index ];
}
const T &operator[]( unsigned int index ) const
{
assert( index < size );
return m_data[ index ];
}
QValueVector<T> toValueVector() const
{
QValueVector<T> vector( size );
for ( unsigned int i = 0; i < size; ++i )
vector[ i ] = m_data[ i ];
return vector;
}
private:
T m_data[ size ];
};
#endif
|
