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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
// Template array classes
/*
Copyright (C) 1996 John W. Eaton
This file is part of Octave.
Octave 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, or (at your option) any
later version.
Octave 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 Octave; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#if !defined (octave_Array3_h)
#define octave_Array3_h 1
#if defined (__GNUG__)
#pragma interface
#endif
#include <cassert>
#include <cstdlib>
#include "Array2.h"
#include "lo-error.h"
class idx_vector;
// Three dimensional array class.
template <class T>
class Array3 : public Array2<T>
{
protected:
int d3;
Array3 (T *d, int n, int m, int k) : Array2<T> (d, n, m*k)
{
d2 = m;
d3 = k;
set_max_indices (3);
}
public:
Array3 (void) : Array2<T> ()
{
d2 = 0;
d3 = 0;
set_max_indices (3);
}
Array3 (int n, int m, int k) : Array2<T> (n, m*k)
{
d2 = m;
d3 = k;
set_max_indices (3);
}
Array3 (int n, int m, int k, const T& val) : Array2<T> (n, m*k, val)
{
d2 = m;
d3 = k;
set_max_indices (3);
}
Array3 (const Array3<T>& a) : Array2<T> (a)
{
d2 = a.d2;
d3 = a.d3;
set_max_indices (3);
}
~Array3 (void) { }
Array3<T>& operator = (const Array3<T>& a)
{
if (this != &a && rep != a.rep)
{
Array<T>::operator = (a);
d1 = a.d1;
d2 = a.d2;
d3 = a.d3;
}
return *this;
}
int dim3 (void) const { return d3; }
// No checking of any kind, ever.
T& xelem (int i, int j, int k) { return Array2<T>::xelem (i, d2*k+j); }
T xelem (int i, int j, int k) const { return Array2<T>::xelem (i, d2*k+j); }
// Note that the following element selection methods don't use
// xelem() because they need to make use of the code in
// Array<T>::elem() that checks the reference count.
T& checkelem (int i, int j, int k)
{
if (i < 0 || j < 0 || k < 0 || i >= d1 || j >= d2 || k >= d3)
{
(*current_liboctave_error_handler) ("range error");
static T foo;
return foo;
}
return Array2<T>::elem (i, d2*k+j);
}
T& elem (int i, int j, int k) { return Array2<T>::elem (i, d2*k+j); }
#if defined (BOUNDS_CHECKING)
T& operator () (int i, int j, int k) { return checkelem (i, j, k); }
#else
T& operator () (int i, int j, int k) { return elem (i, j, k); }
#endif
T checkelem (int i, int j, int k) const
{
if (i < 0 || j < 0 || k < 0 || i >= d1 || j >= d2 || k >= d3)
{
(*current_liboctave_error_handler) ("range error");
return T ();
}
return Array2<T>::elem (i, d1*k+j);
}
T elem (int i, int j, int k) const { return Array2<T>::elem (i, d2*k+j); }
#if defined (BOUNDS_CHECKING)
T operator () (int i, int j, int k) const { return checkelem (i, j, k); }
#else
T operator () (int i, int j, int k) const { return elem (i, j, k); }
#endif
void resize (int n, int m, int k);
void resize (int n, int m, int k, const T& val);
#ifdef HEAVYWEIGHT_INDEXING
void maybe_delete_elements (idx_vector& i, idx_vector& j, idx_vector& k);
Array3<T> value (void);
#endif
};
template <class LT, class RT>
int assign (Array3<LT>& lhs, const Array3<RT>& rhs);
#endif
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
