Mercurial > hg > octave-nkf

comparison liboctave/Array.h @ 2802:bca5fbab2e52

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[project @ 1997-03-09 11:02:27 by jwe]
author jwe
date Sun, 09 Mar 1997 11:03:18 +0000
parents 58e5955495d7
children 8b262e771614
comparison
equal deleted inserted replaced
2801:a98f5a21f026 2802:bca5fbab2e52
169 169
170 // XXX FIXME XXX -- would be nice to fix this so that we don't 170 // XXX FIXME XXX -- would be nice to fix this so that we don't
171 // unnecessarily force a copy, but that is not so easy, and I see no 171 // unnecessarily force a copy, but that is not so easy, and I see no
172 // clean way to do it. 172 // clean way to do it.
173 173
174 T& Array<T>::checkelem (int n) 174 T& checkelem (int n)
175 { 175 {
176 if (n < 0 || n >= rep->length ()) 176 if (n < 0 || n >= rep->length ())
177 return range_error ("T& Array<T>::checkelem", n); 177 return range_error ("T& Array<T>::checkelem", n);
178 else 178 else
179 { 179 {
192 T& operator () (int n) { return checkelem (n); } 192 T& operator () (int n) { return checkelem (n); }
193 #else 193 #else
194 T& operator () (int n) { return elem (n); } 194 T& operator () (int n) { return elem (n); }
195 #endif 195 #endif
196 196
197 T Array<T>::checkelem (int n) const 197 T checkelem (int n) const
198 { 198 {
199 if (n < 0 || n >= rep->length ()) 199 if (n < 0 || n >= rep->length ())
200 return range_error ("T Array<T>::checkelem", n); 200 return range_error ("T Array<T>::checkelem", n);
201 else 201 else
202 return xelem (n); 202 return xelem (n);
203 } 203 }
204 204
205 T Array<T>::elem (int n) const { return xelem (n); } 205 T elem (int n) const { return xelem (n); }
206 206
207 #if defined (BOUNDS_CHECKING) 207 #if defined (BOUNDS_CHECKING)
208 T Array<T>::operator () (int n) const { return checkelem (n); } 208 T operator () (int n) const { return checkelem (n); }
209 #else 209 #else
210 T Array<T>::operator () (int n) const { return elem (n); } 210 T operator () (int n) const { return elem (n); }
211 #endif 211 #endif
212 212
213 void resize (int n); 213 void resize (int n);
214 void resize (int n, const T& val); 214 void resize (int n, const T& val);
215 215