permlib
0.2.9
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 | |
BaseSorterByReference (const std::vector< unsigned long > &order) | |
constructor | |
![]() | |
bool | operator() (unsigned long a, unsigned long b) const |
true iff a preceeds b in given sequence | |
Static Public Member Functions | |
template<class InputIterator > | |
static std::vector< unsigned long > | createOrder (unsigned int size, InputIterator begin, InputIterator end) |
constructs an ordering array with the same parameters as BaseSorter for use with BaseSorterByReference | |
Additional Inherited Members | |
![]() | |
OrderedSorter (unsigned int size) | |
constructor for direct vector usage More... | |
OrderedSorter (const std::vector< unsigned long > & order) | |
constructor for reference use | |
![]() | |
unsigned int | m_size |
size of domain which the order applies to | |
const std::vector< unsigned long > & | m_order |
array which defines the order of points | |
A sorter that sorts a sequence (e.g. ) with respect to a given input ordering (e.g. a base)
This class uses a reference to a given ordering array to determine the order of elements