25 #if defined (HAVE_CONFIG_H)
64 if (r < 0 || r >=
rows () || c < 0 || c + s_len - 1 >
cols ())
65 (*current_liboctave_error_handler) (
"range error for insert");
88 if (r == 0 && (nr == 0 || nc == 0))
92 (*current_liboctave_error_handler) (
"range error for row_as_string");
108 retval.resize (nc+1);
bool operator==(const charMatrix &a) const
#define MM_BOOL_OPS(M1, M2)
octave_idx_type numel(void) const
Number of elements in the array.
#define SM_BOOL_OPS(S, M)
octave_value resize(const dim_vector &dv, bool fill=false) const
char & elem(octave_idx_type n)
std::string row_as_string(octave_idx_type, bool strip_ws=false) const
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
charMatrix & insert(const char *s, octave_idx_type r, octave_idx_type c)
bool operator!=(const charMatrix &a) const
const char * 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
T::size_type strlen(const typename T::value_type *str)
With real return the complex result
charMatrix extract(octave_idx_type r1, octave_idx_type c1, octave_idx_type r2, octave_idx_type c2) const
=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
If this string is the system will ring the terminal sometimes it is useful to be able to print the original representation of the string