COMBINATORIAL_BLAS  1.6
sort.timpl.h File Reference
#include <cassert>
#include <algorithm>
#include <utility>
#include <memory>
#include <iterator>
#include <stdexcept>

Go to the source code of this file.

Classes

class  iosort::stream_slices< RanIt, Splitter >
 
class  iosort::stream_slices< RanIt, Splitter >::iterator
 

Namespaces

 iosort
 
 iosort::base_
 

Enumerations

enum  iosort::base_::tag_RECURSELIMIT { iosort::base_::RECURSELIMIT = 24 }
 

Functions

template<class It , class Pred >
void iosort::base_::insertion_sort (It begin, It end, Pred comp)
 
template<typename T , class Pred >
iosort::base_::median (const T &a, const T &b, const T &c, Pred comp)
 
template<class BidIt , class T , class Pred >
BidIt iosort::base_::partition (BidIt begin, BidIt end, T pivot, Pred comp)
 
template<class RanIt , class Pred >
void iosort::base_::quicksort (RanIt First, RanIt Last, Pred comp)
 
template<class Int >
Int iosort::base_::logc (Int k)
 
template<class RanIt , class Pred >
void iosort::base_::batcher_sort (RanIt begin, RanIt end, Pred comp)
 
template<class RanIt , class Pred >
void iosort::base_::inplace_base_sort (RanIt begin, RanIt end, Pred comp)
 
template<class Splitter , class Diff >
Diff iosort::run_size_ (Diff d)
 
template<class Merger , class Splitter , class Diff , class MAlloc , class TAlloc >
std::pair< Merger *, Merger * > iosort::build_cache_ (Diff run_size, MAlloc &malloc, TAlloc &talloc)
 
template<class Merger , class Splitter , class It , class OutIt , class Alloc >
void iosort::merge_sort_ (It begin, It end, OutIt dest, Merger *cache, Alloc alloc)
 
template<class Merger , class Splitter , class MPtr , class It , class Alloc >
void iosort::sort_streams_ (MPtr cache, It begin, size_t order, size_t run_size, size_t big_runs, Alloc alloc)
 
template<class MPtr , class It >
void iosort::add_sorted_streams_ (MPtr merger, It end, size_t order, size_t run_size, size_t big_runs)
 
template<class MPtr , class It , class Pred >
void iosort::add_streams_ (MPtr merger, It begin, size_t order, size_t run_size, size_t big_runs, Pred comp)
 
template<class Merger , class Splitter , class It , class OutIt >
void iosort::merge_sort (It begin, It end, OutIt dest, const typename Merger::allocator &alloc)