Contains deprecated sorting algorithms. More...
#include <tpie/portability.h>
#include <tpie/sort_manager.h>
#include <tpie/mergeheap.h>
#include <tpie/internal_sort.h>
#include <tpie/progress_indicator_base.h>
#include <tpie/progress_indicator_null.h>
#include <tpie/sort.h>
#include <tpie/comparator.h>
Go to the source code of this file.
Namespaces | |
tpie | |
TPIE's namespace. | |
tpie::ami | |
The namespace within TPIE for the Access Method Interface elements. | |
Functions | |
err | tpie::ami::exception_kind (const exception &e) |
template<class T > | |
err | tpie::ami::sort (stream< T > *instream_ami, stream< T > *outstream_ami, tpie::progress_indicator_base *indicator=NULL) |
template<class T , class CMPR > | |
err | tpie::ami::sort (stream< T > *instream_ami, stream< T > *outstream_ami, CMPR *cmp, progress_indicator_base *indicator=NULL) |
template<class T > | |
err | tpie::ami::ptr_sort (stream< T > *instream_ami, stream< T > *outstream_ami, progress_indicator_base *indicator=NULL) |
template<class T , class CMPR > | |
err | tpie::ami::ptr_sort (stream< T > *instream_ami, stream< T > *outstream_ami, CMPR *cmp, progress_indicator_base *indicator=NULL) |
template<class T , class KEY , class CMPR > | |
err | tpie::ami::key_sort (stream< T > *instream_ami, stream< T > *outstream_ami, KEY, CMPR *cmp, progress_indicator_base *indicator=NULL) |
template<class T > | |
err | tpie::ami::sort (stream< T > *instream_ami, progress_indicator_base *indicator=0) |
template<class T , class CMPR > | |
err | tpie::ami::sort (stream< T > *instream_ami, CMPR *cmp, progress_indicator_base *indicator=NULL) |
template<class T > | |
err | tpie::ami::ptr_sort (stream< T > *instream_ami, progress_indicator_base *indicator=NULL) |
template<class T , class CMPR > | |
err | tpie::ami::ptr_sort (stream< T > *instream_ami, CMPR *cmp, progress_indicator_base *indicator=NULL) |
template<class T , class KEY , class CMPR > | |
err | tpie::ami::key_sort (stream< T > *instream_ami, KEY, CMPR *cmp, progress_indicator_base *indicator=NULL) |
Contains deprecated sorting algorithms.
Any of these variants will accomplish the task of sorting an input stream in an I/O efficient way, but there can be noticeable differences in processing time between the variants. As an example, key_sort() appears to be more cache-efficient than the others in many cases, and therefore often uses less processor time, despite extra data movement relative to ptr_sort().
In addition to the three variants discussed above, there are multiple choices within each variant regarding how the actual comparison operations are to be performed. These choices are described in some detail for sort().
Definition in file sort_deprecated.h.