83 #if ! defined (octave_oct_sort_h)
84 #define octave_oct_sort_h 1
86 #include "octave-config.h"
95 #define MAX_MERGE_PENDING 85
102 #define MERGESTATE_TEMP_SIZE 1024
107 template <
typename T>
114 typename ref_param<T>::type);
141 bool is_sorted_rows (
const T *data,
164 static bool ascending_compare (
typename ref_param<T>::type,
165 typename ref_param<T>::type);
167 static bool descending_compare (
typename ref_param<T>::type,
168 typename ref_param<T>::type);
188 : min_gallop (),
a (0), ia (0), alloced (0), n (0)
192 {
delete []
a;
delete [] ia; }
235 template <
typename Comp>
239 template <
typename Comp>
243 template <
typename Comp>
247 template <
typename Comp>
251 template <
typename Comp>
255 template <
typename Comp>
260 template <
typename Comp>
265 template <
typename Comp>
270 template <
typename Comp>
275 template <
typename Comp>
278 template <
typename Comp>
281 template <
typename Comp>
282 int merge_collapse (T *data, Comp comp);
284 template <
typename Comp>
287 template <
typename Comp>
288 int merge_force_collapse (T *data, Comp comp);
290 template <
typename Comp>
295 template <
typename Comp>
298 template <
typename Comp>
301 template <
typename Comp>
304 template <
typename Comp>
309 template <
typename Comp>
313 template <
typename Comp>
315 const T&
value, Comp comp);
317 template <
typename Comp>
322 template <
typename Comp>
327 template <
typename Comp>
339 template <
typename T>
Return the CPU time used by your Octave session The first output is the total time spent executing your process and is equal to the sum of second and third which are the number of CPU seconds spent executing in user mode and the number of CPU seconds spent executing in system mode
void set_compare(compare_fcn_type comp)
octave_idx_type lookup(const T *x, octave_idx_type n, T y)
cell array If invoked with two or more scalar integer or a vector of integer values
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 MAX_MERGE_PENDING
if_then_else< is_class_type< T >::no, T, T const & >::result type
=val(i)}if ode{val(i)}occurs in table i
OCTAVE_EXPORT octave_value_list or N dimensional array whose elements are all equal to the IEEE symbol zero divided by nd tex zero divided by nd ifnottex and any operation involving another NaN value(5+NaN).Note that NaN always compares not equal to NaN(NaN!
octave_idx_type min_gallop