23 #if defined (HAVE_CONFIG_H)
64 error (
"transpose not defined for N-D objects");
74 DEFNDBINOP_FN (el_and, bool_matrix, bool_matrix, bool_array, bool_array,
77 DEFNDBINOP_FN (el_or, bool_matrix, bool_matrix, bool_array, bool_array,
80 DEFNDBINOP_FN (el_not_and, bool_matrix, bool_matrix, bool_array, bool_array,
83 DEFNDBINOP_FN (el_not_or, bool_matrix, bool_matrix, bool_array, bool_array,
86 DEFNDBINOP_FN (el_and_not, bool_matrix, bool_matrix, bool_array, bool_array,
89 DEFNDBINOP_FN (el_or_not, bool_matrix, bool_matrix, bool_array, bool_array,
95 DEFNDCATOP_FN (bm_fm, bool_matrix, float_matrix, float_array, float_array,
97 DEFNDCATOP_FN (fm_bm, float_matrix, bool_matrix, float_array, float_array,
octave_value op_uplus(const octave_value &a)
#define INSTALL_NCUNOP(op, t, f)
octave_value op_eq(const octave_value &a1, const octave_value &a2)
boolNDArray mx_el_and_not(const boolNDArray &m1, const boolNDArray &m2)
#define DEFNDASSIGNOP_FNOP(name, t1, t2, f, fnop)
void assign(const octave_value_list &idx, const MT &rhs)
boolNDArray mx_el_not_or(const boolNDArray &m1, const boolNDArray &m2)
#define DEFNULLASSIGNOP_FN(name, t, f)
boolNDArray mx_el_not_and(const boolNDArray &m1, const boolNDArray &m2)
the sparsity preserving column transformation such that that defines the pivoting threshold can be given in which case it defines the then the first element defines the pivoting tolerance for the unsymmetric the values defined such that for full matrix
static void transpose(octave_idx_type N, const octave_idx_type *ridx, const octave_idx_type *cidx, octave_idx_type *ridx2, octave_idx_type *cidx2)
ComplexNDArray concat(NDArray &ra, ComplexNDArray &rb, const Array< octave_idx_type > &ra_idx)
void error(const char *fmt,...)
#define DEFNDBINOP_FN(name, t1, t2, e1, e2, f)
#define INSTALL_ASSIGNOP(op, t1, t2, f)
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
boolMatrix transpose(void) const
octave_value op_el_or(const octave_value &a1, const octave_value &a2)
#define INSTALL_BINOP(op, t1, t2, f)
octave_value op_not(const octave_value &a)
then the function must return scalars which will be concatenated into the return array(s).If code
octave_value op_transpose(const octave_value &a)
octave_value op_el_and(const octave_value &a1, const octave_value &a2)
static octave_value oct_assignop_conv_and_assign(octave_base_value &a1, const octave_value_list &idx, const octave_base_value &a2)
boolMatrix mx_el_ne(const boolMatrix &m1, const boolMatrix &m2)
boolNDArray & mx_el_and_assign(boolNDArray &a, const boolNDArray &b)
#define INSTALL_CATOP(t1, t2, f)
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)
void install_bm_bm_ops(void)
boolMatrix mx_el_and(const boolMatrix &m1, const boolMatrix &m2)
boolNDArray mx_el_or_not(const boolNDArray &m1, const boolNDArray &m2)
#define INSTALL_UNOP(op, t, f)
boolMatrix bool_matrix_value(bool=false) const
#define DEFNDUNOP_OP(name, t, e, op)
octave_value op_hermitian(const octave_value &a)
#define DEFNDCATOP_FN(name, t1, t2, e1, e2, f)
boolMatrix mx_el_eq(const boolMatrix &m1, const boolMatrix &m2)
octave_value op_uminus(const octave_value &a)
boolNDArray & mx_el_or_assign(boolNDArray &a, const boolNDArray &b)
virtual boolNDArray bool_array_value(bool=false) const
return octave_value(v1.char_array_value().concat(v2.char_array_value(), ra_idx),((a1.is_sq_string()||a2.is_sq_string())? '\'': '"'))
#define DEFNCUNOP_METHOD(name, t, method)