23 #if defined (HAVE_CONFIG_H)
54 DEFNDCATOP_FN (f_bm, float_scalar, bool_matrix, float_array, float_array,
57 DEFCONV (bool_matrix_conv,
bool, bool_matrix)
boolNDArray mx_el_and_not(const boolNDArray &m1, const boolNDArray &m2)
nd group nd example oindent but is performed more efficiently If only and it is a scalar
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
ComplexNDArray concat(NDArray &ra, ComplexNDArray &rb, const Array< octave_idx_type > &ra_idx)
#define INSTALL_WIDENOP(t1, t2, f)
#define DEFNDBINOP_FN(name, t1, t2, e1, e2, f)
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_BINOP(op, t1, t2, f)
then the function must return scalars which will be concatenated into the return array(s).If code
octave_value op_el_and(const octave_value &a1, const octave_value &a2)
#define INSTALL_CATOP(t1, t2, f)
boolMatrix mx_el_or(const boolMatrix &m1, const boolMatrix &m2)
boolMatrix mx_el_and(const boolMatrix &m1, const boolMatrix &m2)
boolNDArray mx_el_or_not(const boolNDArray &m1, const boolNDArray &m2)
boolMatrix bool_matrix_value(bool=false) const
void install_b_bm_ops(void)
#define DEFCONV(name, a_dummy, b_dummy)
#define INSTALL_ASSIGNCONV(t1, t2, tr)
#define DEFNDCATOP_FN(name, t1, t2, e1, e2, f)