24 #if ! defined (octave_boolSparse_h)
25 #define octave_boolSparse_h 1
27 #include "octave-config.h"
77 :
Sparse<
bool> (a, r, c, nr, nc, sum_terms, nzm) { }
114 bool resize_ok)
const;
119 bool inv =
false)
const;
135 friend OCTAVE_API std::ostream&
operator << (std::ostream& os,
137 friend OCTAVE_API std::istream&
operator >> (std::istream&
is,
SparseMatrix reshape(const dim_vector &new_dims) const
#define SPARSE_SMSM_BOOL_OP_DECLS(M1, M2, API)
bool operator!=(const dim_vector &a, const dim_vector &b)
const octave_base_value const Array< octave_idx_type > & ra_idx
Sparse< T > & operator=(const Sparse< T > &a)
SparseBoolMatrix all(int dim=-1) const
std::istream & operator>>(std::istream &is, SparseBoolMatrix &a)
#define SPARSE_SMS_EQNE_OP_DECLS(M, S, API)
SparseMatrix sum(int dim=-1) const
identity matrix If supplied two scalar respectively For allows like xample val
SparseBoolMatrix(octave_idx_type r, octave_idx_type c, octave_idx_type num_nz)
#define SPARSE_SSM_EQNE_OP_DECLS(S, M, API)
SparseBoolMatrix(const PermMatrix &a)
SparseBoolMatrix(octave_idx_type r, octave_idx_type c, bool val)
SparseMatrix ipermute(const Array< octave_idx_type > &vec) const
ComplexNDArray concat(NDArray &ra, ComplexNDArray &rb, const Array< octave_idx_type > &ra_idx)
SparseBoolMatrix(octave_idx_type r, octave_idx_type c)
Sparse< double > index(const idx_vector &i, bool resize_ok=false) const
SparseMatrix & insert(const SparseMatrix &a, octave_idx_type r, octave_idx_type c)
SparseBoolMatrix transpose(void) const
#define SPARSE_SMS_BOOL_OP_DECLS(M, S, API)
calling an anonymous function involves an overhead quite comparable to the overhead of an m file function Passing a handle to a built in function is because the interpreter is not involved in the internal loop For a
#define SPARSE_SSM_BOOL_OP_DECLS(S, M, API)
Matrix matrix_value(void) const
SparseBoolMatrix(const boolNDArray &a)
#define SPARSE_SMSM_EQNE_OP_DECLS(M1, M2, API)
SparseMatrix diag(octave_idx_type k=0) const
the sparsity preserving column transformation such that that defines the pivoting threshold can be given in which case it defines the c
SparseBoolMatrix(const SparseBoolMatrix &a, const dim_vector &dv)
bool operator==(const dim_vector &a, const dim_vector &b)
SparseBoolMatrix(const boolMatrix &a)
SparseMatrix squeeze(void) const
=val(i)}if ode{val(i)}occurs in table i
SparseBoolMatrix(const dim_vector &dv, octave_idx_type nz=0)
template OCTAVE_API std::ostream & operator<<(std::ostream &, const Array< bool > &)
SparseMatrix permute(const Array< octave_idx_type > &vec, bool inv=false) const
octave_value operator!(const octave_value &a)
write the output to stdout if nargout is
SparseBoolMatrix(const Sparse< bool > &a)
SparseMatrix & operator=(const SparseMatrix &a)
Vector representing the dimensions (size) of an Array.
the second is matched to the second specifier and placed in the second column and so forth If there are more words than specifiers then the process is repeated until all words have been processed or the limit imposed by any(non-whitespace) text in the format that is not one of these specifiers is considered a literal.If there is a literal between two format specifiers then that same literal must appear in the input stream between the matching words.The following specifiers are valid
SparseBoolMatrix(const Array< bool > &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)
Sparse< T > transpose(void) const
SparseBoolMatrix(const SparseBoolMatrix &a)
boolMatrix dense_matrix_type