Internal sorter objects. More...
#include <tpie/portability.h>#include <tpie/parallel_sort.h>#include <tpie/fractional_progress.h>#include <tpie/memory.h>#include <tpie/tpie_assert.h>#include <tpie/file_stream.h>Go to the source code of this file.
Classes | |
| class | tpie::ami::qsort_item< Key > |
| A simple class that facilitates doing key sorting followed by in-memory permuting to sort items in-memory. More... | |
| class | tpie::ami::Internal_Sorter_Base< T > |
| The base class for internal sorters. More... | |
| class | tpie::ami::Internal_Sorter_Obj< T, Compare > |
| Comparision object based Internal_Sorter_base subclass implementation; uses quick_sort_obj(). More... | |
Namespaces | |
| tpie | |
| pipelining/factory_base.h Base class of pipelining factories | |
| tpie::ami | |
| A version of sort that takes an input stream of elements of type T, and an output stream, and and uses the < operator to sort, see also Sorting in TPIE. | |
Internal sorter objects.
Provides base class Internal_Sorter_Base for internal sorter objects and subclass implementation Internal_Sorter_Obj. Relies on quicksort variant quick_sort_obj().
Definition in file internal_sort.h.