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
|
/*
* Copyright (c) 2009 Samit Basu
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*/
#ifndef __Vector_hpp__
#define __Vector_hpp__
#include <QSharedData>
#include <new>
#include "Exception.hpp"
template <typename T>
class VectorData : public QSharedData
{
T* m_data;
size_t m_len;
void allocate(size_t len) {
try {
m_data = new T[len];
if (sizeof(T) <= 8)
memset(m_data,0,sizeof(T)*len);
} catch (const std::bad_alloc& ) {
throw Exception(QString("Cannot allocate enough memory to store an array of size %1").arg(m_len));
}
}
void copyvec(const VectorData& copy) {
if (m_data) delete[] m_data;
m_len = copy.m_len;
if (m_len) {
allocate(m_len);
for (size_t i=0;i<m_len;i++)
m_data[i] = copy.m_data[i];
}
}
public:
inline VectorData() : m_data(0), m_len(0) {}
inline VectorData(size_t dim) {
try {
m_len = dim;
allocate(m_len);
} catch (const std::bad_alloc& ) {
throw Exception(QString("Cannot allocate enough memory to store an array of size %1").arg(dim));
}
}
inline VectorData(const VectorData& copy) : QSharedData(copy), m_data(0), m_len(0) {
copyvec(copy);
}
inline ~VectorData() {
if (m_data) delete[] m_data;
}
inline T operator[](size_t p) const {
return m_data[p];
}
inline T& operator[](size_t p) {
return m_data[p];
}
inline T at(size_t p) const {
return m_data[p];
}
inline T* data() {
return m_data;
}
inline const T* data() const {
return m_data;
}
inline void clear() {
m_len = 0;
if (m_data)
delete[] m_data;
m_data = 0;
}
};
template <typename T>
class Vector
{
public:
inline Vector() {d = new VectorData<T>();}
inline Vector(size_t dim) {d = new VectorData<T>(dim);}
inline Vector(const Vector& copy) : d(copy.d) {}
inline T operator[](size_t p) const {
return (*d)[p];
}
inline T& operator[](size_t p) {
return (*d)[p];
}
inline T at(size_t p) const {
return d->at[p];
}
inline T* data() {
return d->data();
}
inline const T* data() const {
return d->data();
}
inline void clear() {
d->clear();
}
private:
QSharedDataPointer<VectorData<T> > d;
};
#endif
|
