24 #if defined (HAVE_CONFIG_H) 39 #include "smx-bm-sbm.h" 40 #include "smx-sbm-bm.h" 50 DEFCATOP (bm_sbm, bool_matrix, sparse_bool_matrix)
77 DEFCONV (sparse_bool_matrix_conv, bool_matrix, sparse_bool_matrix)
108 sparse_bool_matrix_conv);
#define INSTALL_ASSIGNOP_TI(ti, op, t1, t2, f)
Matrix matrix_value(bool=false) const
virtual SparseMatrix sparse_matrix_value(bool=false) const
#define INSTALL_BINOP_TI(ti, op, t1, t2, f)
const octave_base_value const Array< octave_idx_type > & ra_idx
characters Given a string matrix
octave_value op_eq(const octave_value &a1, const octave_value &a2)
ComplexNDArray concat(NDArray &ra, ComplexNDArray &rb, const Array< octave_idx_type > &ra_idx)
virtual SparseBoolMatrix sparse_bool_matrix_value(bool=false) const
void install_bm_sbm_ops(octave::type_info &ti)
const octave_base_value & a2
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
octave_value op_el_or(const octave_value &a1, const octave_value &a2)
#define INSTALL_CATOP_TI(ti, t1, t2, f)
octave_value op_el_and(const octave_value &a1, const octave_value &a2)
boolMatrix mx_el_ne(const boolMatrix &m1, const boolMatrix &m2)
boolMatrix bool_matrix_value(bool=false) const
#define DEFCATOP(name, t1, t2)
#define INSTALL_ASSIGNCONV_TI(ti, t1, t2, tr)
return octave_value(v1.char_array_value() . concat(v2.char_array_value(), ra_idx),((a1.is_sq_string()||a2.is_sq_string()) ? '\'' :'"'))
const octave_char_matrix & v2
boolMatrix mx_el_or(const boolMatrix &m1, const boolMatrix &m2)
#define DEFNDASSIGNOP_FN(name, t1, t2, e, f)
octave_value op_ne(const octave_value &a1, const octave_value &a2)
boolMatrix mx_el_and(const boolMatrix &m1, const boolMatrix &m2)
Matrix matrix_value(bool=false) const
#define DEFCONV(name, a_dummy, b_dummy)
#define DEFBINOP_FN(name, t1, t2, f)
#define INSTALL_WIDENOP_TI(ti, t1, t2, f)
boolMatrix mx_el_eq(const boolMatrix &m1, const boolMatrix &m2)