permlib
0.2.6
Library for permutation computations
|
A sorter that sorts a sequence (e.g. ) with respect to a given input ordering (e.g. a base)
More...
#include <base_sorter.h>
Public Member Functions | |
template<class InputIterator > | |
BaseSorter (unsigned int size, InputIterator begin, InputIterator end) | |
constructor | |
Static Public Member Functions | |
template<class InputIterator > | |
static void | fillOrder (InputIterator begin, InputIterator end, std::vector< unsigned long > &order) |
constructs an ordering array |
A sorter that sorts a sequence (e.g. ) with respect to a given input ordering (e.g. a base)
note that copying (as it is implicitly done e.g. when used with std::sort) is expensive in this cases try BaseSorterByReference instead
permlib::BaseSorter::BaseSorter | ( | unsigned int | size, |
InputIterator | begin, | ||
InputIterator | end | ||
) | [inline] |
constructor
size | size of sequence to be sorted |
begin | begin iterator for partial sequence that induces the ordering |
end | end iterator for partial sequence that induces the ordering |
static void permlib::BaseSorter::fillOrder | ( | InputIterator | begin, |
InputIterator | end, | ||
std::vector< unsigned long > & | order | ||
) | [inline, static] |
constructs an ordering array
begin | begin iterator for partial sequence that induces the ordering |
end | end iterator for partial sequence that induces the ordering |
order | vector to store the ordering array |