COMBINATORIAL_BLAS 1.6
Loading...
Searching...
No Matches
iosort::base_ Namespace Reference

Enumerations

enum  tag_RECURSELIMIT { RECURSELIMIT = 24 , RECURSELIMIT = 24 }
enum  tag_RECURSELIMIT { RECURSELIMIT = 24 , 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)

Enumeration Type Documentation

◆ tag_RECURSELIMIT [1/2]

Enumerator
RECURSELIMIT 
RECURSELIMIT 

Definition at line 32 of file sort.timpl.h.

◆ tag_RECURSELIMIT [2/2]

Enumerator
RECURSELIMIT 
RECURSELIMIT 

Definition at line 32 of file sort.timpl.h.

Function Documentation

◆ batcher_sort()

template<class RanIt, class Pred>
void iosort::base_::batcher_sort ( RanIt begin,
RanIt end,
Pred comp )

Definition at line 107 of file sort.timpl.h.

◆ inplace_base_sort()

template<class RanIt, class Pred>
void iosort::base_::inplace_base_sort ( RanIt begin,
RanIt end,
Pred comp )

Definition at line 160 of file sort.timpl.h.

◆ insertion_sort()

template<class It, class Pred>
void iosort::base_::insertion_sort ( It begin,
It end,
Pred comp )
inline

Definition at line 35 of file sort.timpl.h.

◆ logc()

template<class Int>
Int iosort::base_::logc ( Int k)
inline

Definition at line 99 of file sort.timpl.h.

◆ median()

template<typename T, class Pred>
T iosort::base_::median ( const T & a,
const T & b,
const T & c,
Pred comp )
inline

Definition at line 49 of file sort.timpl.h.

◆ partition()

template<class BidIt, class T, class Pred>
BidIt iosort::base_::partition ( BidIt begin,
BidIt end,
T pivot,
Pred comp )
inline

Definition at line 68 of file sort.timpl.h.

◆ quicksort()

template<class RanIt, class Pred>
void iosort::base_::quicksort ( RanIt First,
RanIt Last,
Pred comp )
inline

Definition at line 82 of file sort.timpl.h.