Enumerations | |
enum | tag_RECURSELIMIT { RECURSELIMIT = 24 } |
Functions | |
template<class It , class Pred > | |
void | insertion_sort (It begin, It end, Pred comp) |
template<typename T , class Pred > | |
T | median (const T &a, const T &b, const T &c, Pred comp) |
template<class BidIt , class T , class Pred > | |
BidIt | partition (BidIt begin, BidIt end, T pivot, Pred comp) |
template<class RanIt , class Pred > | |
void | quicksort (RanIt First, RanIt Last, Pred comp) |
template<class Int > | |
Int | logc (Int k) |
template<class RanIt , class Pred > | |
void | batcher_sort (RanIt begin, RanIt end, Pred comp) |
template<class RanIt , class Pred > | |
void | inplace_base_sort (RanIt begin, RanIt end, Pred comp) |
Enumerator | |
---|---|
RECURSELIMIT |
Definition at line 32 of file sort.timpl.h.
void iosort::base_::batcher_sort | ( | RanIt | begin, |
RanIt | end, | ||
Pred | comp | ||
) |
Definition at line 107 of file sort.timpl.h.
void iosort::base_::inplace_base_sort | ( | RanIt | begin, |
RanIt | end, | ||
Pred | comp | ||
) |
Definition at line 160 of file sort.timpl.h.
|
inline |
Definition at line 35 of file sort.timpl.h.
|
inline |
Definition at line 99 of file sort.timpl.h.
|
inline |
Definition at line 49 of file sort.timpl.h.
|
inline |
Definition at line 68 of file sort.timpl.h.
|
inline |
Definition at line 82 of file sort.timpl.h.