|
3665
|
1 // Template array classes |
|
|
2 /* |
|
|
3 |
|
|
4 Copyright (C) 2000 John W. Eaton |
|
|
5 |
|
|
6 This file is part of Octave. |
|
|
7 |
|
|
8 Octave is free software; you can redistribute it and/or modify it |
|
|
9 under the terms of the GNU General Public License as published by the |
|
|
10 Free Software Foundation; either version 2, or (at your option) any |
|
|
11 later version. |
|
|
12 |
|
|
13 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
14 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
16 for more details. |
|
|
17 |
|
|
18 You should have received a copy of the GNU General Public License |
|
|
19 along with Octave; see the file COPYING. If not, write to the Free |
|
|
20 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
|
21 |
|
|
22 */ |
|
|
23 |
|
|
24 #if !defined (octave_ArrayN_h) |
|
|
25 #define octave_ArrayN_h 1 |
|
|
26 |
|
4192
|
27 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
3665
|
28 #pragma interface |
|
|
29 #endif |
|
|
30 |
|
|
31 #include <iostream> |
|
|
32 |
|
|
33 #include <cassert> |
|
|
34 #include <climits> |
|
|
35 #include <cmath> |
|
|
36 #include <cstdlib> |
|
|
37 |
|
|
38 #include "Array.h" |
|
4513
|
39 #include "Array2.h" |
|
3665
|
40 #include "lo-error.h" |
|
|
41 |
|
|
42 class idx_vector; |
|
|
43 |
|
|
44 // N-dimensional array class. |
|
|
45 |
|
|
46 template <class T> |
|
|
47 class |
|
|
48 ArrayN : public Array<T> |
|
|
49 { |
|
|
50 protected: |
|
|
51 |
|
4587
|
52 ArrayN (T *d, const dim_vector& dv) : Array<T> (d, dv) { } |
|
3665
|
53 |
|
|
54 public: |
|
|
55 |
|
|
56 // These really need to be protected (and they will be in the |
|
|
57 // future, so don't depend on them being here!), but they can't be |
|
|
58 // until template friends work correctly in g++. |
|
|
59 |
|
|
60 ArrayN (void) : Array<T> () { } |
|
|
61 |
|
4587
|
62 ArrayN (const dim_vector& dv) : Array<T> (dv) { } |
|
3665
|
63 |
|
4587
|
64 ArrayN (const dim_vector& dv, const T& val) |
|
|
65 : Array<T> (dv) { fill (val); } |
|
3665
|
66 |
|
4902
|
67 template <class U> |
|
|
68 explicit ArrayN (const Array2<U>& a) : Array<T> (a, a.dims ()) { } |
|
4504
|
69 |
|
4902
|
70 template <class U> |
|
|
71 ArrayN (const ArrayN<U>& a) : Array<T> (a, a.dims ()) { } |
|
4504
|
72 |
|
4902
|
73 template <class U> |
|
|
74 ArrayN (const Array<U>& a) : Array<T> (a) { } |
|
4532
|
75 |
|
4902
|
76 template <class U> |
|
|
77 ArrayN (const Array<U>& a, const dim_vector& dv) |
|
|
78 : Array<T> (a, dv) { } |
|
4504
|
79 |
|
3665
|
80 ~ArrayN (void) { } |
|
|
81 |
|
|
82 ArrayN<T>& operator = (const ArrayN<T>& a) |
|
|
83 { |
|
4513
|
84 if (this != &a) |
|
|
85 Array<T>::operator = (a); |
|
3665
|
86 |
|
|
87 return *this; |
|
|
88 } |
|
|
89 |
|
4902
|
90 ArrayN<T> reshape (const dim_vector& new_dims) const |
|
|
91 { return Array<T>::reshape (new_dims); } |
|
|
92 |
|
|
93 ArrayN<T> permute (const Array<int>& vec, bool inv = false) const |
|
|
94 { return Array<T>::permute (vec, inv); } |
|
|
95 |
|
|
96 ArrayN<T> ipermute (const Array<int>& vec) const |
|
|
97 { return Array<T>::ipermute (vec); } |
|
|
98 |
|
4587
|
99 void resize (const dim_vector& dv) |
|
4645
|
100 { this->resize_no_fill (dv); } |
|
3665
|
101 |
|
4587
|
102 void resize (const dim_vector& dv, const T& val) |
|
|
103 { Array<T>::resize (dv, val); } |
|
3665
|
104 |
|
4532
|
105 ArrayN<T> squeeze (void) const { return Array<T>::squeeze (); } |
|
|
106 |
|
4902
|
107 ArrayN<T> transpose (void) const { return Array<T>::transpose (); } |
|
|
108 |
|
4587
|
109 ArrayN<T>& insert (const ArrayN<T>& a, const dim_vector& dv) |
|
3665
|
110 { |
|
4587
|
111 Array<T>::insert (a, dv); |
|
4513
|
112 return *this; |
|
3665
|
113 } |
|
|
114 |
|
4765
|
115 ArrayN<T>& insert (const ArrayN<T>& a, int r, int c) |
|
|
116 { |
|
|
117 Array<T>::insert (a, r, c); |
|
|
118 return *this; |
|
|
119 } |
|
|
120 |
|
4513
|
121 ArrayN<T> index (idx_vector& i, int resize_ok = 0, |
|
|
122 const T& rfv = resize_fill_value (T ())) const |
|
3665
|
123 { |
|
4513
|
124 Array<T> tmp = Array<T>::index (i, resize_ok, rfv); |
|
|
125 return ArrayN<T> (tmp, tmp.dims ()); |
|
3665
|
126 } |
|
|
127 |
|
4513
|
128 ArrayN<T> index (idx_vector& i, idx_vector& j, int resize_ok = 0, |
|
|
129 const T& rfv = resize_fill_value (T ())) const |
|
|
130 { |
|
|
131 Array<T> tmp = Array<T>::index (i, j, resize_ok, rfv); |
|
|
132 return ArrayN<T> (tmp, tmp.dims ()); |
|
|
133 } |
|
3665
|
134 |
|
4273
|
135 ArrayN<T> index (Array<idx_vector>& ra_idx, int resize_ok = 0, |
|
4513
|
136 const T& rfv = resize_fill_value (T ())) const |
|
|
137 { |
|
|
138 Array<T> tmp = Array<T>::index (ra_idx, resize_ok, rfv); |
|
|
139 return ArrayN<T> (tmp, tmp.dims ()); |
|
|
140 } |
|
3665
|
141 }; |
|
|
142 |
|
|
143 template <class T> |
|
|
144 std::ostream& |
|
|
145 operator << (std::ostream&, const ArrayN<T>&); |
|
|
146 |
|
|
147 #endif |
|
|
148 |
|
|
149 /* |
|
|
150 ;;; Local Variables: *** |
|
|
151 ;;; mode: C++ *** |
|
|
152 ;;; End: *** |
|
|
153 */ |
