Mercurial > hg > octave-lyh

comparison liboctave/MSparse.h @ 10785:c2041adcf234

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
remove unnecessary sparse indexing overloads
author Jaroslav Hajek <highegg@gmail.com>
date Tue, 13 Jul 2010 12:08:08 +0200
parents b4d2080b6df7
children fd0a3ac60b0e
comparison
equal deleted inserted replaced
10784:ca2df6737d6b 10785:c2041adcf234
89 89
90 MSparse<T> transpose (void) const { return Sparse<T>::transpose (); } 90 MSparse<T> transpose (void) const { return Sparse<T>::transpose (); }
91 91
92 MSparse<T> squeeze (void) const { return Sparse<T>::squeeze (); } 92 MSparse<T> squeeze (void) const { return Sparse<T>::squeeze (); }
93 93
94 MSparse<T> index (const idx_vector& i, bool resize_ok) const
95 { return Sparse<T>::index (i, resize_ok); }
96
97 MSparse<T> index (const idx_vector& i, const idx_vector& j, bool resize_ok) const
98 { return Sparse<T>::index (i, j, resize_ok); }
99
100 MSparse<T> reshape (const dim_vector& new_dims) const 94 MSparse<T> reshape (const dim_vector& new_dims) const
101 { return Sparse<T>::reshape (new_dims); } 95 { return Sparse<T>::reshape (new_dims); }
102 96
103 MSparse<T> permute (const Array<octave_idx_type>& vec, bool inv = false) const 97 MSparse<T> permute (const Array<octave_idx_type>& vec, bool inv = false) const
104 { return Sparse<T>::permute (vec, inv); } 98 { return Sparse<T>::permute (vec, inv); }