blob: 1694f884e5320f5b55bff1ff21615c2f2de34d44 (
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
68
69
70
71
72
73
74
75
|
/*
* SOLID - Software Library for Interference Detection
*
* Copyright (C) 2001-2003 Dtecta. All rights reserved.
*
* This library may be distributed under the terms of the Q Public License
* (QPL) as defined by Trolltech AS of Norway and appearing in the file
* LICENSE.QPL included in the packaging of this file.
*
* This library may be distributed and/or modified under the terms of the
* GNU General Public License (GPL) version 2 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in the
* packaging of this file.
*
* This library is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* Commercial use or any other use of this library not covered by either
* the QPL or the GPL requires an additional license from Dtecta.
* Please contact info@dtecta.com for enquiries about the terms of commercial
* use of this library.
*/
#ifndef DT_ARRAY_H
#define DT_ARRAY_H
#if defined (__sgi)
#include <assert.h>
#else
#include <cassert>
#endif
template <typename Data, typename Size = size_t>
class DT_Array {
public:
DT_Array()
: m_count(0),
m_data(0)
{}
explicit DT_Array(Size count)
: m_count(count),
m_data(new Data[count])
{
assert(m_data);
}
DT_Array(Size count, const Data *data)
: m_count(count),
m_data(new Data[count])
{
assert(m_data);
std::copy(&data[0], &data[count], m_data);
}
~DT_Array()
{
delete [] m_data;
}
const Data& operator[](int i) const { return m_data[i]; }
Data& operator[](int i) { return m_data[i]; }
Size size() const { return m_count; }
private:
DT_Array(const DT_Array&);
DT_Array& operator=(const DT_Array&);
Size m_count;
Data *m_data;
};
#endif
|
