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
|
// Template array classes
/*
Copyright (C) 2000 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, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#if !defined (octave_ArrayN_h)
#define octave_ArrayN_h 1
#if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION)
#pragma interface
#endif
#include <iostream>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdlib>
#include "Array.h"
#include "Array2.h"
#include "lo-error.h"
class idx_vector;
// N-dimensional array class.
template <class T>
class
ArrayN : public Array<T>
{
protected:
ArrayN (T *d, const dim_vector& dv) : Array<T> (d, dv) { }
public:
// These really need to be protected (and they will be in the
// future, so don't depend on them being here!), but they can't be
// until template friends work correctly in g++.
ArrayN (void) : Array<T> () { }
ArrayN (const dim_vector& dv) : Array<T> (dv) { }
ArrayN (const dim_vector& dv, const T& val)
: Array<T> (dv) { fill (val); }
template <class U>
explicit ArrayN (const Array2<U>& a) : Array<T> (a, a.dims ()) { }
template <class U>
ArrayN (const ArrayN<U>& a) : Array<T> (a, a.dims ()) { }
template <class U>
ArrayN (const Array<U>& a) : Array<T> (a) { }
template <class U>
ArrayN (const Array<U>& a, const dim_vector& dv)
: Array<T> (a, dv) { }
~ArrayN (void) { }
ArrayN<T>& operator = (const ArrayN<T>& a)
{
if (this != &a)
Array<T>::operator = (a);
return *this;
}
ArrayN<T> reshape (const dim_vector& new_dims) const
{ return Array<T>::reshape (new_dims); }
ArrayN<T> permute (const Array<int>& vec, bool inv = false) const
{ return Array<T>::permute (vec, inv); }
ArrayN<T> ipermute (const Array<int>& vec) const
{ return Array<T>::ipermute (vec); }
void resize (const dim_vector& dv)
{ this->resize_no_fill (dv); }
void resize (const dim_vector& dv, const T& val)
{ Array<T>::resize (dv, val); }
ArrayN<T> squeeze (void) const { return Array<T>::squeeze (); }
ArrayN<T> transpose (void) const { return Array<T>::transpose (); }
ArrayN<T>& insert (const ArrayN<T>& a, const dim_vector& dv)
{
Array<T>::insert (a, dv);
return *this;
}
ArrayN<T>& insert (const ArrayN<T>& a, int r, int c)
{
Array<T>::insert (a, r, c);
return *this;
}
ArrayN<T> index (idx_vector& i, int resize_ok = 0,
const T& rfv = resize_fill_value (T ())) const
{
Array<T> tmp = Array<T>::index (i, resize_ok, rfv);
return ArrayN<T> (tmp, tmp.dims ());
}
ArrayN<T> index (idx_vector& i, idx_vector& j, int resize_ok = 0,
const T& rfv = resize_fill_value (T ())) const
{
Array<T> tmp = Array<T>::index (i, j, resize_ok, rfv);
return ArrayN<T> (tmp, tmp.dims ());
}
ArrayN<T> index (Array<idx_vector>& ra_idx, int resize_ok = 0,
const T& rfv = resize_fill_value (T ())) const
{
Array<T> tmp = Array<T>::index (ra_idx, resize_ok, rfv);
return ArrayN<T> (tmp, tmp.dims ());
}
};
template <class T>
std::ostream&
operator << (std::ostream&, const ArrayN<T>&);
#endif
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
|
