23 #if defined (HAVE_CONFIG_H)
47 DEFNDCATOP_FN (chm_chm, char_matrix, char_matrix, char_array, char_array,
std::string type_name(void) const
NDArray array_value(bool=false) const
const octave_base_value const Array< octave_idx_type > & ra_idx
nd group nd example oindent but is performed more efficiently If only and it is a scalar
void install_chm_ops(void)
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)
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
Matrix matrix_value(bool=false) const
octave_value op_transpose(const octave_value &a)
Matrix transpose(void) const
#define INSTALL_CATOP(t1, t2, f)
#define DEFCATOP(name, t1, t2)
const octave_char_matrix & v2
std::string type_name(void) const
charNDArray char_array_value(bool=false) const
void warn_implicit_conversion(const char *id, const char *from, const char *to)
virtual std::string type_name(void) const
#define INSTALL_UNOP(op, t, f)
octave_value op_hermitian(const octave_value &a)
NDArray array_value(bool=false) const
#define DEFNDCATOP_FN(name, t1, t2, e1, e2, f)
return octave_value(v1.char_array_value().concat(v2.char_array_value(), ra_idx),((a1.is_sq_string()||a2.is_sq_string())? '\'': '"'))