/
dvector.imp
114 lines (96 loc) · 3.16 KB
/
dvector.imp
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
//
// This file is part of Gambit
// Copyright (c) 1994-2024, The Gambit Project (http://www.gambit-project.org)
//
// FILE: src/libgambit/dvector.imp
// Implementation of doubly-partitioned vector class
//
// 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.
//
#include "dvector.h"
namespace Gambit {
//--------------------------------------------------------------------------
// DVector<T>: Private and protected member functions
//--------------------------------------------------------------------------
template <class T> void DVector<T>::setindex()
{
int index = 1;
for (int i = 1; i <= dvlen.Length(); i++) {
dvptr[i] = this->svptr + index - 1;
dvidx[i] = index;
index += dvlen[i];
}
}
//--------------------------------------------------------------------------
// DVector<T>: Constructors, destructor, and constructive operators
//--------------------------------------------------------------------------
template <class T>
DVector<T>::DVector(const PVector<int> &shape)
: PVector<T>(static_cast<const Array<int> &>(shape)),
dvlen(shape.Lengths().Length()), dvidx(shape.Lengths().Length())
{
dvptr = new T **[dvlen.Length()];
dvptr -= 1;
for (int i = 1; i <= dvlen.Length(); i++) {
dvlen[i] = shape.Lengths()[i];
}
setindex();
}
template <class T> DVector<T>::DVector(const DVector<T> &v)
: PVector<T>(v), dvlen(v.dvlen), dvidx(v.dvidx)
{
dvptr = new T **[dvlen.Length()];
dvptr -= 1;
setindex();
}
template <class T> DVector<T>::~DVector()
{
if (dvptr) delete [] (dvptr + 1);
}
template <class T> DVector<T> &DVector<T>::operator=(const T &c)
{
PVector<T>::operator=(c);
return *this;
}
//--------------------------------------------------------------------------
// DVector<T>: Operator definitions
//--------------------------------------------------------------------------
template <class T> T &DVector<T>::operator()(int a, int b, int c)
{
if (dvlen.First() > a || a > dvlen.Last()) {
throw IndexException();
}
if (1 > b || b > dvlen[a]) {
throw IndexException();
}
if (1 > c || c > this->svlen[dvidx[a] + b - 1]) {
throw IndexException();
}
return dvptr[a][b][c];
}
template <class T> const T &DVector<T>::operator()(int a, int b, int c) const
{
if (dvlen.First() > a || a > dvlen.Last()) {
throw IndexException();
}
if (1 > b || b > dvlen[a]) {
throw IndexException();
}
if (1 > c || c > this->svlen[dvidx[a] + b - 1]) {
throw IndexException();
}
return dvptr[a][b][c];
}
} // end namespace Gambit