58 if (val != 0.0 && val != 1.0)
104 template <
typename T>
112 template <
typename T>
122 template <
typename T>
131 template <
typename T>
142 template <
typename T>
144 operator << (std::ostream& os, const intNDArray<T>&
a)
149 os <<
" " <<
a.elem (
i) <<
"\n";
154 template <
typename T>
180 template <
typename T>
190 ret.
xelem (
i) = val.abs ();
196 template <
typename T>
206 ret.
xelem (
i) = val.signum ();
212 template <
typename T>
219 template <
typename T>
226 template <
typename T>
233 template <
typename T>
240 template <
typename T>
247 template <
typename T>
251 return do_mx_minmax_op<T> (*
this, idx_arg, dim,
mx_inline_max);
254 template <
typename T>
261 template <
typename T>
265 return do_mx_minmax_op<T> (*
this, idx_arg, dim,
mx_inline_min);
268 template <
typename T>
275 template <
typename T>
282 template <
typename T>
289 template <
typename T>
296 template <
typename T>
octave_idx_type compute_index(octave_idx_type n, const dim_vector &dims)
bool any_element_not_one_or_zero(void) const
void mx_inline_cummax(const T *v, T *r, octave_idx_type n)
const octave_base_value const Array< octave_idx_type > & ra_idx
octave_idx_type numel(void) const
Number of elements in the array.
identity matrix If supplied two scalar respectively For allows like xample val
intNDArray max(int dim=-1) const
intNDArray & insert(const intNDArray< T > &a, octave_idx_type r, octave_idx_type c)
Array< T > diag(octave_idx_type k=0) const
Get the kth super or subdiagonal.
intNDArray diag(octave_idx_type k=0) const
static void increment_index(Array< octave_idx_type > &ra_idx, const dim_vector &dimensions, int start_dimension=0)
intNDArray cumsum(int dim) const
T & elem(octave_idx_type n)
static octave_idx_type compute_index(Array< octave_idx_type > &ra_idx, const dim_vector &dimensions)
void mx_inline_max(const T *v, T *r, octave_idx_type n)
boolNDArray any(int dim=-1) const
bool mx_inline_any(const T *v, octave_idx_type n)
intNDArray sum(int dim) const
Array< T > & insert(const Array< T > &a, const Array< octave_idx_type > &idx)
Insert an array into another at a specified position.
std::istream & operator>>(std::istream &is, intNDArray< T > &a)
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
intNDArray cummin(int dim=-1) const
intNDArray diff(octave_idx_type order=1, int dim=-1) const
void increment_index(Array< octave_idx_type > &ra_idx, const dim_vector &dimensions, int start_dimension)
nd deftypefn *octave_map m
NDArray dsum(int dim) const
void mx_inline_cummin(const T *v, T *r, octave_idx_type n)
the sparsity preserving column transformation such that that defines the pivoting threshold can be given in which case it defines the c
the exceeded dimensions are set to if fewer subscripts than dimensions are the exceeding dimensions are merged into the final requested dimension For consider the following dims
intNDArray abs(void) const
intNDArray concat(const intNDArray< T > &rb, const Array< octave_idx_type > &ra_idx)
subst_template_param< std::complex, T, double >::type mx_inline_dsum(const T *v, octave_idx_type n)
intNDArray cummax(int dim=-1) const
T & xelem(octave_idx_type n)
T mx_inline_sum(const T *v, octave_idx_type n)
T::size_type numel(const T &str)
boolNDArray operator!(void) const
void mx_inline_cumsum(const T *v, T *r, octave_idx_type n)
intNDArray min(int dim=-1) const
=val(i)}if ode{val(i)}occurs in table i
boolNDArray all(int dim=-1) const
intNDArray signum(void) const
bool mx_inline_all(const T *v, octave_idx_type n)
intNDArray prod(int dim) const
write the output to stdout if nargout is
Vector representing the dimensions (size) of an Array.
T mx_inline_prod(const T *v, octave_idx_type n)
void mx_inline_diff(const T *v, T *r, octave_idx_type n, octave_idx_type order)
void mx_inline_min(const T *v, T *r, octave_idx_type n)