23 #if defined (HAVE_CONFIG_H) 89 perm_matrix_to_matrix);
octave_value xpow(const SparseMatrix &a, double b)
PermMatrix perm_matrix_value(void) const
double scalar_value(bool frc_str_conv=false) const
#define DEFBINOP(name, t1, t2)
#define INSTALL_BINOP_TI(ti, op, t1, t2, f)
nd group nd example oindent but is performed more efficiently If only and it is a scalar
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)
octave_value op_pow(const octave_value &a1, const octave_value &a2)
void install_pm_pm_ops(octave::type_info &ti)
#define DEFBINOP_OP(name, t1, t2, op)
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
#define INSTALL_UNOP_TI(ti, op, t, f)
octave_value op_div(const octave_value &a1, const octave_value &a2)
Matrix matrix_value(bool=false) const
octave_value op_transpose(const octave_value &a)
PermMatrix inverse(void) const
octave_int< T > pow(const octave_int< T > &a, const octave_int< T > &b)
#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
octave_value op_ldiv(const octave_value &a1, const octave_value &a2)
virtual PermMatrix perm_matrix_value(void) const
octave_value op_hermitian(const octave_value &a)
#define INSTALL_WIDENOP_TI(ti, t1, t2, f)
octave_value op_mul(const octave_value &a1, const octave_value &a2)
PermMatrix transpose(void) const