#include <Combinations.h>
Public Member Functions | |
| Combinations (unsigned int n, unsigned int k) | |
| ~Combinations () | |
| bool | start (IndexSet &indexes) |
| bool | next (IndexSet &indexes) |
| bool | done () |
Definition at line 20 of file Combinations.h.
| Combinations::Combinations | ( | unsigned int | n, | |
| unsigned int | k | |||
| ) | [inline] |
Constructor
| n | determines the maximum integer (n - 1) that can apear in the generated sequences | |
| k | determines the length of the generated sequences |
Definition at line 30 of file Combinations.h.
| Combinations::~Combinations | ( | ) | [inline] |
Destructor
Definition at line 43 of file Combinations.h.
| bool Combinations::start | ( | IndexSet & | indexes | ) | [inline] |
Initialize a Combinations object to the first available combination.
| indexes | an IndexSet that will hold the first combination |
Definition at line 53 of file Combinations.h.
References IndexSet::setData().
Referenced by FiniteGroup< T, BinaryFunction >::getSubGroups().
Here is the call graph for this function:

Here is the caller graph for this function:

| bool Combinations::next | ( | IndexSet & | indexes | ) | [inline] |
Generate the next combination.
| indexes | an IndexSet that will hold the next combination |
Definition at line 73 of file Combinations.h.
References IndexSet::setData().
Referenced by FiniteGroup< T, BinaryFunction >::getSubGroups().
Here is the call graph for this function:

Here is the caller graph for this function:

| bool Combinations::done | ( | ) | [inline] |
Tell if there are any more combinations to enumerate.
Definition at line 107 of file Combinations.h.