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>
141 OCTAVE_DEPRECATED (4.4,
"use 'issorted' instead")
143 {
return issorted (data, nel); }
151 bool is_sorted_rows (
const T *data,
198 : min_gallop (),
a (nullptr), ia (nullptr), alloced (0), n (0)
208 {
delete []
a;
delete [] ia; }
245 template <
typename Comp>
249 template <
typename Comp>
253 template <
typename Comp>
257 template <
typename Comp>
261 template <
typename Comp>
265 template <
typename Comp>
270 template <
typename Comp>
275 template <
typename Comp>
280 template <
typename Comp>
285 template <
typename Comp>
288 template <
typename Comp>
291 template <
typename Comp>
292 int merge_collapse (T *data, Comp comp);
294 template <
typename Comp>
297 template <
typename Comp>
298 int merge_force_collapse (T *data, Comp comp);
300 template <
typename Comp>
305 template <
typename Comp>
308 template <
typename Comp>
311 template <
typename Comp>
314 template <
typename Comp>
315 OCTAVE_DEPRECATED (4.4,
"use 'issorted' instead")
317 {
return issorted (data, nel, comp); }
319 template <
typename Comp>
324 template <
typename Comp>
328 template <
typename Comp>
330 const T&
value, Comp comp);
332 template <
typename Comp>
337 template <
typename Comp>
342 template <
typename Comp>
348 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
octave_idx_type min_gallop
nd group nd example For each display the value