#include <sort.hh>
Public Member Functions | |
Sorts () | |
Sorts (std::size_t number) | |
void | push_back (util::stream::Chain &chain, const util::stream::SortConfig &config, const Compare &compare=Compare(), const Combine &combine=Combine()) |
In the anticipated use case, an instance of this class will maintain one Sort object for each n-gram order (ranging from 1 up to the maximum n-gram order being processed). Use in this manner would enable the n-grams each n-gram order to be sorted, in parallel.
Compare | An ngram comparator to use during sorting. |
Definition at line 557 of file sort.hh.
util::stream::Sorts< Compare, Combine >::Sorts | ( | ) | [inline] |
Constructs, but does not initialize.
Init must be called before use.
util::stream::Sorts< Compare, Combine >::Sorts | ( | std::size_t | number | ) | [inline, explicit] |
void util::stream::Sorts< Compare, Combine >::push_back | ( | util::stream::Chain & | chain, | |
const util::stream::SortConfig & | config, | |||
const Compare & | compare = Compare() , |
|||
const Combine & | combine = Combine() | |||
) | [inline] |
Constructs a new Sort object which is stored in this array.
The new Sort object is constructed using the provided SortConfig and ngram comparator; once constructed, a new worker thread (owned by the chain) will sort the n-gram data stored in the blocks of the provided chain.
Definition at line 590 of file sort.hh.
References util::FixedArray< T >::Constructed(), and util::FixedArray< T >::end().