10 #ifndef RGROUP_SCORE_H
11 #define RGROUP_SCORE_H
30 for (
unsigned long size :
sizes) {
59 size_t max_index_of_row =
sizes[rowToIncrement] - 1;
60 if (
permutation[rowToIncrement] > max_index_of_row) {
68 double score(
const std::vector<size_t> &permutation,
69 const std::vector<std::vector<RGroupMatch>> &matches,
70 const std::set<int> &labels);
double score(const std::vector< size_t > &permutation, const std::vector< std::vector< RGroupMatch >> &matches, const std::set< int > &labels)
iterate through all possible permutations of the rgroups
std::vector< size_t > sizes
std::deque< size_t > bases
CartesianProduct(const std::vector< size_t > &inputSizes)
bool increment(size_t rowToIncrement)
std::vector< size_t > permutation