32 int DIM()
const {
return N; }
40 for ( i=0; (i<n) && (m_mask[i]); ++i ) {
41 this->m_mask[i] =
false;
45 this->m_mask[i] =
true;
57 for (
int i=0; i<N; ++i ) {
70 #define English_dox "Doxygen English documentation"
75 #define Spanish_dox "Documentación Doxygen en español"
124 #ifdef SUBSET_EXAMPLE
140 const bool *SS = iter.
next();
143 for (
int i=0; i<iter.
DIM(); ++i ) {
152 std::cout <<
" }" << std::endl;
int DIM() const
Returns the size of the complete set.
int main()
Test ==> main() ==> iterJava().
Iterator/generator that returns all subsets for an N element set.
const bool * next()
Generate next subset.
bool * m_mask
Marks which elements are in the current set.
bool hasNext() const
Returns true while there are more subsets to generate.
subset()
Constructor. DIM() == N