| 39 |
|
namespace oopse { |
| 40 |
|
|
| 41 |
|
/** |
| 42 |
– |
* @fn bool next_combination(IteratorContainer<RandomAccessIterator>& iterContainer, |
| 43 |
– |
* RandomAccessIterator first, RandomAccessIterator last) |
| 42 |
|
* @brief STL next_permuationtation like combination sequence generator. |
| 43 |
|
* Given the first and last iterator of a sequence, next_combination iteratively generates all |
| 44 |
< |
* possible combination. |
| 44 |
> |
* possible combinations. |
| 45 |
|
* @return if more combination is availiable, otherwise return false |
| 46 |
|
* @param iterContainer iterator container |
| 47 |
|
* @param first the first iterator |
| 64 |
|
* //1 |
| 65 |
|
* //8 |
| 66 |
|
* //1 8 |
| 67 |
+ |
* @endcode |
| 68 |
|
*/ |
| 69 |
|
template<class RandomAccessIterator, template<typename ELEM, typename = std::allocator<ELEM> > class IteratorContainer> |
| 70 |
|
bool next_combination(IteratorContainer<RandomAccessIterator>& iterContainer, RandomAccessIterator first, RandomAccessIterator last) { |
| 131 |
|
} //end next_combination |
| 132 |
|
|
| 133 |
|
/** |
| 135 |
– |
* @fn bool replaceWildCard(std::vector<std::vector<std::string>::iterator>& cont, |
| 136 |
– |
* std::vector<std::string>& sequence, std::vector<std::string>& result, |
| 137 |
– |
* const std::string& wildCard) |
| 134 |
|
* @brief iteratively replace the sequence with wild cards |
| 135 |
|
* @return true if more combination sequence is avaliable, otherwise return true |
| 136 |
|
* @param cont iterator container, if expect whole series of combination, just pass an empty iterator |
