25 #if defined (HAVE_CONFIG_H)
#define MM_BOOL_OPS(M1, M2)
boolMatrix diag(octave_idx_type k=0) const
bool operator==(const boolMatrix &a) const
octave_idx_type numel(void) const
Number of elements in the array.
#define SM_BOOL_OPS(S, M)
Array< T > diag(octave_idx_type k=0) const
Get the kth super or subdiagonal.
T & elem(octave_idx_type n)
octave_idx_type rows(void) const
Array< T > & insert(const Array< T > &a, const Array< octave_idx_type > &idx)
Insert an array into another at a specified position.
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 & insert(const boolMatrix &a, octave_idx_type r, octave_idx_type c)
const bool * data(void) const
the sparsity preserving column transformation such that that defines the pivoting threshold can be given in which case it defines the c
=val(i)}if ode{val(i)}occurs in table i
#define MS_BOOL_OPS(M, S)
#define MM_CMP_OPS(M1, M2)
bool mx_inline_equal(size_t n, const T1 *x, const T2 *y)
octave_idx_type cols(void) const
bool operator!=(const boolMatrix &a) const
boolMatrix operator!(void) const