#include <stdlib.h>
#include "math_func.hpp"
#include "mem_func.hpp"
Go to the source code of this file.
Functions | |
| template<typename T> | |
| static FORCEINLINE void | QSortT (T *base, uint num, int(CDECL *comparator)(const T *, const T *), bool desc=false) |
| Type safe qsort(). | |
| template<typename T> | |
| static void | GSortT (T *base, uint num, int(CDECL *comparator)(const T *, const T *), bool desc=false) |
| Type safe Gnome Sort. | |
Definition in file sort_func.hpp.
| static void GSortT | ( | T * | base, | |
| uint | num, | |||
| int(CDECL *comparator)(const T *, const T *) | , | |||
| bool | desc = false | |||
| ) | [inline, static] |
Type safe Gnome Sort.
This is a slightly modifyied Gnome search. The basic Gnome search trys to sort already sorted list parts. The modification skips these.
| base | Pointer to the first element of the array to be sorted. | |
| num | Number of elements in the array pointed by base. | |
| comparator | Function that compares two elements. | |
| desc | Sort descending. |
Definition at line 48 of file sort_func.hpp.
References Swap().
| static FORCEINLINE void QSortT | ( | T * | base, | |
| uint | num, | |||
| int(CDECL *comparator)(const T *, const T *) | , | |||
| bool | desc = false | |||
| ) | [inline, static] |
Type safe qsort().
| base | Pointer to the first element of the array to be sorted. | |
| num | Number of elements in the array pointed by base. | |
| comparator | Function that compares two elements. | |
| desc | Sort descending. |
Definition at line 24 of file sort_func.hpp.
References MemReverseT().
1.5.6