24 #if !defined (octave_MSparse_h)
25 #define octave_MSparse_h 1
64 :
Sparse<T> (a, r, c, nr, nc, sum_terms, nzm) { }
67 :
Sparse<T> (r, c, val) { }
72 :
Sparse<T> (r, c, num_nz) { }
120 map (U (&fcn) (
const T&))
const
Sparse< T > ipermute(const Array< octave_idx_type > &vec) const
Sparse< T > & operator=(const Sparse< T > &a)
MSparse(const MSparse< T > &a)
MSparse(octave_idx_type n, octave_idx_type m)
MSparse< T > & insert(const Sparse< T > &a, const Array< octave_idx_type > &indx)
MSparse(octave_idx_type r, octave_idx_type c, T val)
Sparse< T > permute(const Array< octave_idx_type > &vec, bool inv=false) const
Sparse< T > & insert(const Sparse< T > &a, octave_idx_type r, octave_idx_type c)
MSparse(const Sparse< T > &a)
MSparse< T > transpose(void) const
MSparse(const PermMatrix &a)
Sparse< T > squeeze(void) const
MSparse< T > squeeze(void) const
Sparse< T > reshape(const dim_vector &new_dims) const
MSparse< T > & insert(const Sparse< T > &a, octave_idx_type r, octave_idx_type c)
MSparse(const Array< T > &a, const idx_vector &r, const idx_vector &c, octave_idx_type nr=-1, octave_idx_type nc=-1, bool sum_terms=true, octave_idx_type nzm=-1)
MSparse< T > permute(const Array< octave_idx_type > &vec, bool inv=false) const
MSparse(const dim_vector &dv, octave_idx_type nz=0)
MSparse(const MSparse< T > &a, const dim_vector &dv)
MSparse< T > ipermute(const Array< octave_idx_type > &vec) const
MSparse(const Sparse< U > &a)
MSparse< U > map(U(&fcn)(const T &)) const
Handles the reference counting for all the derived classes.
MSparse< U > map(U(&fcn)(T)) const
MSparse(octave_idx_type r, octave_idx_type c, octave_idx_type num_nz)
MSparse< T > diag(octave_idx_type k=0) const
#define SPARSE_OPS_FORWARD_DECLS(A_T, F_T, API)
Sparse< T > diag(octave_idx_type k=0) const
Sparse< T > transpose(void) const
MSparse< T > reshape(const dim_vector &new_dims) const
SparseComplexMatrix & operator=(const SparseComplexMatrix &a)