|
1
|
1 /* |
|
|
2 |
|
2847
|
3 Copyright (C) 1996, 1997 John W. Eaton |
|
1
|
4 |
|
|
5 This file is part of Octave. |
|
|
6 |
|
|
7 Octave is free software; you can redistribute it and/or modify it |
|
|
8 under the terms of the GNU General Public License as published by the |
|
|
9 Free Software Foundation; either version 2, or (at your option) any |
|
|
10 later version. |
|
|
11 |
|
|
12 Octave is distributed in the hope that it will be useful, but WITHOUT |
|
|
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
|
|
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
|
|
15 for more details. |
|
|
16 |
|
|
17 You should have received a copy of the GNU General Public License |
|
|
18 along with Octave; see the file COPYING. If not, write to the Free |
|
1315
|
19 Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
|
1
|
20 |
|
|
21 */ |
|
|
22 |
|
383
|
23 #if !defined (octave_idx_vector_h) |
|
|
24 #define octave_idx_vector_h 1 |
|
1
|
25 |
|
4192
|
26 #if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION) |
|
1297
|
27 #pragma interface |
|
|
28 #endif |
|
|
29 |
|
3503
|
30 #include <iostream> |
|
|
31 |
|
4504
|
32 #include "Array.h" |
|
|
33 |
|
1560
|
34 class ColumnVector; |
|
4650
|
35 class boolNDArray; |
|
|
36 class NDArray; |
|
164
|
37 class Range; |
|
|
38 |
|
453
|
39 class |
|
|
40 idx_vector |
|
1
|
41 { |
|
1560
|
42 private: |
|
|
43 |
|
1879
|
44 class |
|
1560
|
45 idx_vector_rep |
|
1879
|
46 { |
|
|
47 public: |
|
|
48 |
|
2802
|
49 idx_vector_rep (void) |
|
1879
|
50 { |
|
|
51 colon = 0; |
|
|
52 len = 0; |
|
|
53 num_zeros = 0; |
|
|
54 num_ones = 0; |
|
|
55 one_zero = 0; |
|
|
56 orig_nr = 0; |
|
|
57 orig_nc = 0; |
|
|
58 initialized = 0; |
|
|
59 frozen = 0; |
|
|
60 colon_equiv_checked = 0; |
|
|
61 colon_equiv = 0; |
|
|
62 data = 0; |
|
|
63 } |
|
1560
|
64 |
|
1879
|
65 idx_vector_rep (const ColumnVector& v); |
|
1560
|
66 |
|
4650
|
67 idx_vector_rep (const NDArray& nda); |
|
1879
|
68 |
|
|
69 idx_vector_rep (const Range& r); |
|
1560
|
70 |
|
2386
|
71 idx_vector_rep (double d); |
|
|
72 |
|
3928
|
73 idx_vector_rep (int i); |
|
|
74 |
|
1879
|
75 idx_vector_rep (char c); |
|
1560
|
76 |
|
2828
|
77 idx_vector_rep (bool b); |
|
|
78 |
|
4650
|
79 idx_vector_rep (const boolNDArray& bnda); |
|
2828
|
80 |
|
1879
|
81 idx_vector_rep (const idx_vector_rep& a); |
|
1560
|
82 |
|
2802
|
83 ~idx_vector_rep (void) { delete [] data; } |
|
1560
|
84 |
|
1879
|
85 idx_vector_rep& operator = (const idx_vector_rep& a); |
|
1560
|
86 |
|
1879
|
87 int ok (void) { return initialized; } |
|
1560
|
88 |
|
1879
|
89 int capacity (void) const { return len; } |
|
|
90 int length (int colon_len) const { return colon ? colon_len : len; } |
|
1560
|
91 |
|
1879
|
92 int elem (int n) const { return colon ? n : data[n]; } |
|
1560
|
93 |
|
1879
|
94 int checkelem (int n) const; |
|
|
95 int operator () (int n) const { return checkelem (n); } |
|
1560
|
96 |
|
1879
|
97 int max (void) const { return max_val; } |
|
|
98 int min (void) const { return min_val; } |
|
|
99 |
|
|
100 int one_zero_only (void) const { return one_zero; } |
|
|
101 int zeros_count (void) const { return num_zeros; } |
|
|
102 int ones_count (void) const { return num_ones; } |
|
|
103 |
|
|
104 int is_colon (void) const { return colon; } |
|
2356
|
105 int is_colon_equiv (int n, int sort_uniq); |
|
1560
|
106 |
|
3079
|
107 void sort (bool uniq); |
|
|
108 |
|
1879
|
109 int orig_rows (void) const { return orig_nr; } |
|
|
110 int orig_columns (void) const { return orig_nc; } |
|
1560
|
111 |
|
4504
|
112 Array<int> orig_dimensions (void) const { return orig_dims; } |
|
|
113 |
|
1879
|
114 // other stuff |
|
1560
|
115 |
|
1879
|
116 void shorten (int n); // Unsafe. Avoid at all cost. |
|
1560
|
117 |
|
4461
|
118 int freeze (int z_len, const char *tag, bool resize_ok, bool warn_resize); |
|
1560
|
119 |
|
1879
|
120 // i/o |
|
1560
|
121 |
|
3504
|
122 std::ostream& print (std::ostream& os) const; |
|
1560
|
123 |
|
1879
|
124 int *data; |
|
|
125 int len; |
|
|
126 int num_zeros; |
|
|
127 int num_ones; |
|
|
128 int max_val; |
|
|
129 int min_val; |
|
4504
|
130 |
|
|
131 // XXX FIXME XXX -- with the introduction of orig_dims, these two |
|
|
132 // variables are not neccessary. orig_dims(0) and orig_dims(1) |
|
|
133 // should replace them in the code. |
|
|
134 |
|
1879
|
135 int orig_nr; |
|
|
136 int orig_nc; |
|
4504
|
137 |
|
|
138 Array<int> orig_dims; |
|
|
139 |
|
1879
|
140 int count; |
|
|
141 int frozen_at_z_len; |
|
|
142 int frozen_len; |
|
|
143 unsigned int colon : 1; |
|
|
144 unsigned int one_zero : 1; |
|
|
145 unsigned int initialized : 1; |
|
|
146 unsigned int frozen : 1; |
|
|
147 unsigned int colon_equiv_checked : 1; |
|
|
148 unsigned int colon_equiv : 1; |
|
1560
|
149 |
|
1879
|
150 void init_state (void); |
|
1560
|
151 |
|
2828
|
152 void maybe_convert_one_zero_to_idx (int z_len); |
|
1879
|
153 }; |
|
1560
|
154 |
|
1
|
155 public: |
|
1551
|
156 |
|
2802
|
157 idx_vector (void) |
|
1551
|
158 { |
|
1560
|
159 rep = new idx_vector_rep (); |
|
|
160 rep->count = 1; |
|
|
161 } |
|
|
162 |
|
|
163 idx_vector (const ColumnVector& v) |
|
|
164 { |
|
|
165 rep = new idx_vector_rep (v); |
|
|
166 rep->count = 1; |
|
|
167 } |
|
|
168 |
|
4650
|
169 idx_vector (const NDArray& nda) |
|
1560
|
170 { |
|
4650
|
171 rep = new idx_vector_rep (nda); |
|
1560
|
172 rep->count = 1; |
|
|
173 } |
|
|
174 |
|
|
175 idx_vector (const Range& r) |
|
|
176 { |
|
|
177 rep = new idx_vector_rep (r); |
|
|
178 rep->count = 1; |
|
|
179 } |
|
|
180 |
|
2386
|
181 idx_vector (double d) |
|
|
182 { |
|
|
183 rep = new idx_vector_rep (d); |
|
|
184 rep->count = 1; |
|
|
185 } |
|
|
186 |
|
3928
|
187 idx_vector (int i) |
|
|
188 { |
|
|
189 rep = new idx_vector_rep (i); |
|
|
190 rep->count = 1; |
|
|
191 } |
|
|
192 |
|
1560
|
193 idx_vector (char c) |
|
|
194 { |
|
|
195 rep = new idx_vector_rep (c); |
|
|
196 rep->count = 1; |
|
|
197 } |
|
|
198 |
|
2828
|
199 idx_vector (bool b) |
|
|
200 { |
|
|
201 rep = new idx_vector_rep (b); |
|
|
202 rep->count = 1; |
|
|
203 } |
|
|
204 |
|
4650
|
205 idx_vector (const boolNDArray& bnda) |
|
2828
|
206 { |
|
4650
|
207 rep = new idx_vector_rep (bnda); |
|
2828
|
208 rep->count = 1; |
|
|
209 } |
|
|
210 |
|
1560
|
211 idx_vector (const idx_vector& a) |
|
|
212 { |
|
|
213 rep = a.rep; |
|
|
214 rep->count++; |
|
1551
|
215 } |
|
|
216 |
|
2802
|
217 ~idx_vector (void) |
|
1560
|
218 { |
|
|
219 if (--rep->count <= 0) |
|
|
220 delete rep; |
|
|
221 } |
|
1
|
222 |
|
1560
|
223 idx_vector& operator = (const idx_vector& a) |
|
|
224 { |
|
|
225 if (this != &a) |
|
|
226 { |
|
|
227 if (--rep->count <= 0) |
|
|
228 delete rep; |
|
1
|
229 |
|
1560
|
230 rep = a.rep; |
|
|
231 rep->count++; |
|
|
232 } |
|
|
233 return *this; |
|
1551
|
234 } |
|
|
235 |
|
3145
|
236 operator bool () const { return rep->ok (); } |
|
1560
|
237 |
|
2802
|
238 int capacity (void) const { return rep->capacity (); } |
|
|
239 int length (int cl) const { return rep->length (cl); } |
|
191
|
240 |
|
2802
|
241 int elem (int n) const { return rep->elem (n); } |
|
|
242 int checkelem (int n) const { return rep->checkelem (n); } |
|
|
243 int operator () (int n) const { return rep->operator () (n); } |
|
1
|
244 |
|
2802
|
245 int max (void) const { return rep->max (); } |
|
|
246 int min (void) const { return rep->min (); } |
|
1551
|
247 |
|
2802
|
248 int one_zero_only (void) const { return rep->one_zero_only (); } |
|
|
249 int zeros_count (void) const { return rep->zeros_count (); } |
|
|
250 int ones_count (void) const { return rep->ones_count (); } |
|
1
|
251 |
|
1560
|
252 int is_colon (void) const { return rep->is_colon (); } |
|
2356
|
253 int is_colon_equiv (int n, int sort_uniq = 0) const |
|
|
254 { return rep->is_colon_equiv (n, sort_uniq); } |
|
1
|
255 |
|
3079
|
256 void sort (bool uniq = false) { rep->sort (uniq); } |
|
|
257 |
|
1560
|
258 int orig_rows (void) const { return rep->orig_rows (); } |
|
|
259 int orig_columns (void) const { return rep->orig_columns (); } |
|
208
|
260 |
|
4504
|
261 Array<int> orig_dimensions (void) const { return rep->orig_dimensions (); } |
|
|
262 |
|
2663
|
263 int orig_empty (void) const |
|
|
264 { |
|
|
265 return (! is_colon () |
|
|
266 && (orig_rows () == 0 || orig_columns () == 0)); |
|
|
267 } |
|
|
268 |
|
1560
|
269 // Unsafe. Avoid at all cost. |
|
|
270 void shorten (int n) { rep->shorten (n); } |
|
434
|
271 |
|
1
|
272 // i/o |
|
|
273 |
|
4461
|
274 int freeze (int z_len, const char *tag, bool resize_ok = false, |
|
|
275 bool warn_resize = false) |
|
|
276 { return rep->freeze (z_len, tag, resize_ok, warn_resize); } |
|
1560
|
277 |
|
3504
|
278 std::ostream& print (std::ostream& os) const { return rep->print (os); } |
|
1560
|
279 |
|
3504
|
280 friend std::ostream& operator << (std::ostream& os, const idx_vector& a) |
|
1560
|
281 { return a.print (os); } |
|
|
282 |
|
2828
|
283 void maybe_convert_one_zero_to_idx (int z_len) |
|
|
284 { rep->maybe_convert_one_zero_to_idx (z_len); } |
|
1
|
285 |
|
|
286 private: |
|
|
287 |
|
1560
|
288 idx_vector_rep *rep; |
|
1
|
289 |
|
1560
|
290 void init_state (void) { rep->init_state (); } |
|
1
|
291 }; |
|
|
292 |
|
|
293 #endif |
|
|
294 |
|
|
295 /* |
|
|
296 ;;; Local Variables: *** |
|
|
297 ;;; mode: C++ *** |
|
|
298 ;;; End: *** |
|
|
299 */ |
