A sorter that sorts a sequence of permutations with respect to a ordering induced by a base. More...
#include <group_sorter.h>
Public Member Functions | |
template<class InputIterator > | |
GroupSorter (uint size, InputIterator begin, InputIterator end) | |
constructor | |
bool | operator() (PERM a, PERM b) const |
true iff a < b | |
template<class InputIterator > | |
GroupSorter (uint size, InputIterator begin, InputIterator end) | |
constructor | |
bool | operator() (PERM a, PERM b) const |
true iff a < b |
A sorter that sorts a sequence of permutations with respect to a ordering induced by a base.
permlib::GroupSorter< PERM >::GroupSorter | ( | uint | 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 |
permlib::GroupSorter< PERM >::GroupSorter | ( | uint | 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 |