#include <Combinators.h>
|
| | CombinationGenerator (const std::initializer_list< size_t > &collectionSizes) |
| | construct combnations maker with the sizes of collection to which it should be applied
|
| void | add (size_t nextColl) |
| void | reset () |
| size_t | size () const |
| const std::vector< size_t > & | operator() () const |
| | returns current combination
|
| const std::vector< size_t > & | current () const |
| void | operator++ () |
| | moves to the next combination
|
| | operator bool () const |
| | are combinations exhausted
|
◆ CombinationGenerator()
| CombinationGenerator::CombinationGenerator |
( |
const std::initializer_list< size_t > & | collectionSizes | ) |
|
construct combnations maker with the sizes of collection to which it should be applied
Definition at line 12 of file Combinators.cxx.
16
17}
std::vector< size_t > m_current
std::vector< size_t > m_maxes
◆ add()
| void HLT::CombinationGenerator::add |
( |
size_t | nextColl | ) |
|
|
inline |
◆ current()
| const std::vector< size_t > & HLT::CombinationGenerator::current |
( |
| ) |
const |
|
inline |
◆ operator bool()
| CombinationGenerator::operator bool |
( |
| ) |
const |
◆ operator()()
| const std::vector< size_t > & HLT::CombinationGenerator::operator() |
( |
| ) |
const |
|
inline |
◆ operator++()
| void CombinationGenerator::operator++ |
( |
| ) |
|
moves to the next combination
Definition at line 29 of file Combinators.cxx.
29 {
34 } else {
36 return;
37 }
38 }
39
40
42}
◆ reset()
| void CombinationGenerator::reset |
( |
| ) |
|
Definition at line 19 of file Combinators.cxx.
19 {
20
22 []( size_t m ){ return m == 0; } ) )
24 else {
26 }
27}
void fill(H5::Group &out_file, size_t iterations)
◆ size()
| size_t HLT::CombinationGenerator::size |
( |
| ) |
const |
|
inline |
◆ m_current
| std::vector<size_t> HLT::CombinationGenerator::m_current |
|
private |
◆ m_maxes
| std::vector<size_t> HLT::CombinationGenerator::m_maxes |
|
private |
The documentation for this class was generated from the following files: