Regina Calculation Engine
|
An iterator class that runs through all 24 permutations of four elements. More...
#include <npermit.h>
Public Member Functions | |
NPermItS4 () | |
Creates a new iterator pointing at the first permutation. | |
void | init () |
Points this iterator at the first permutation. | |
void | operator++ (int) |
Points this iterator at the next permutation after the one it is currently pointing to. | |
const NPerm & | operator* () const |
Returns the permutation at which this iterator is pointing. | |
bool | done () const |
Determines if this iterator is past-the-end (has run through all possible permutations). |
An iterator class that runs through all 24 permutations of four elements.
regina::NPermItS4::NPermItS4 | ( | ) | [inline] |
Creates a new iterator pointing at the first permutation.
bool regina::NPermItS4::done | ( | ) | const [inline] |
Determines if this iterator is past-the-end (has run through all possible permutations).
true
if and only if this iterator is past-the-end. void regina::NPermItS4::init | ( | ) | [inline] |
Points this iterator at the first permutation.
const NPerm & regina::NPermItS4::operator* | ( | ) | const [inline] |
Returns the permutation at which this iterator is pointing.
void regina::NPermItS4::operator++ | ( | int | ) | [inline] |
Points this iterator at the next permutation after the one it is currently pointing to.