Inheritance diagram for SubListGenerator:

Public Member Functions
int *const &	get () const override

bool	next () override

	SubListGenerator (Catch::Generators::GeneratorWrapper< int > &&gen, int numSamps, const int *exclude, int numExclude)

	SubListGenerator (int *elems, int numElems, int numSamps)

	~SubListGenerator ()

Private Member Functions
void	createSublist ()

void	prepareSublist ()

Private Attributes
vector< bool >	featured

int	len

int *	list

int	sublen

int *	sublist

Detailed Description

Definition at line 974 of file utilities.cpp.

Constructor & Destructor Documentation

◆ SubListGenerator() [1/2]

SubListGenerator::SubListGenerator	(	int *	elems,
		int	numElems,
		int	numSamps
	)

inline

Definition at line 1003 of file utilities.cpp.

                                                              {
         
         DEMAND( numSamps <= numElems );
                 
         // make a record of all elements
         len = numElems;
         list = (int*) malloc(len * sizeof *list);
         for (int i=0; i<len; i++)
             list[i] = elems[i];
         
         // prepare sublist
         sublen = numSamps;
         createSublist();
         prepareSublist();  
     }

References createSublist(), DEMAND, len, list, prepareSublist(), and sublen.

◆ SubListGenerator() [2/2]

SubListGenerator::SubListGenerator	(	Catch::Generators::GeneratorWrapper< int > &&	gen,
		int	numSamps,
		const int *	exclude,
		int	numExclude
	)

inline

Definition at line 1019 of file utilities.cpp.

       {    
         // extract all generator elems
         vector<int> elems = vector<int>();
         do { elems.push_back(gen.get()); } while (gen.next());
         
         // make (int*) of non-excluded elems
         len = 0;
         list = (int*) malloc(elems.size() * sizeof *list);
         for (size_t i=0; i<elems.size(); i++) {
             int elem = elems[i];
             bool present = false;
             for (int j=0; j<numExclude; j++)
                 if (elem == exclude[j]) {
                     present = true;
                     break;
                 }
             if (!present)
                 list[len++] = elem;
         }
         
         DEMAND( numSamps <= len );
  
         // prepare sublist
         sublen = numSamps;
         createSublist();
         prepareSublist();
     }

References createSublist(), DEMAND, len, list, prepareSublist(), and sublen.

◆ ~SubListGenerator()

SubListGenerator::~SubListGenerator ( )

inline

Definition at line 1069 of file utilities.cpp.

                         {
         free(list);
         free(sublist);
     }

References list, and sublist.

Member Function Documentation

◆ createSublist()

void SubListGenerator::createSublist ( )

inlineprivate

Definition at line 981 of file utilities.cpp.

                          {
         
         // sublist to send to the user
         sublist = (int*) malloc(sublen * sizeof *sublist);
         
         // indicates which list members are currently in sublist
         featured = vector<bool>(len);
         fill(featured.end() - sublen, featured.end(), true);   
     }

References featured, len, sublen, and sublist.

Referenced by SubListGenerator().

◆ get()

int* const& SubListGenerator::get ( ) const

inlineoverride

Definition at line 1050 of file utilities.cpp.

                                      {
         return sublist;
     }

References sublist.

◆ next()

bool SubListGenerator::next ( )

inlineoverride

Definition at line 1054 of file utilities.cpp.

                          {
         
         // offer next permutation of the current combination
         if (next_permutation(sublist, sublist+sublen))
             return true;
  
         // else generate the next combination
         if (next_permutation(featured.begin(), featured.end())) {
             prepareSublist();
             return true;
         }
         
         return false;
     }

References featured, prepareSublist(), sublen, and sublist.

◆ prepareSublist()

void SubListGenerator::prepareSublist ( )

inlineprivate

Definition at line 991 of file utilities.cpp.

                           {
         
         // choose the next combination
         int j=0;
         for (int i=0; i<len; i++)
             if (featured[i])
                 sublist[j++] = list[i];
                 
         // prepare for permuting
         std::sort(sublist, sublist+sublen);
     }