1 |
< |
/* |
2 |
< |
* Copyright (C) 2000-2004 Object Oriented Parallel Simulation Engine (OOPSE) project |
3 |
< |
* |
4 |
< |
* Contact: oopse@oopse.org |
5 |
< |
* |
6 |
< |
* This program is free software; you can redistribute it and/or |
7 |
< |
* modify it under the terms of the GNU Lesser General Public License |
8 |
< |
* as published by the Free Software Foundation; either version 2.1 |
9 |
< |
* of the License, or (at your option) any later version. |
10 |
< |
* All we ask is that proper credit is given for our work, which includes |
11 |
< |
* - but is not limited to - adding the above copyright notice to the beginning |
12 |
< |
* of your source code files, and to any copyright notice that you may distribute |
13 |
< |
* with programs based on this work. |
14 |
< |
* |
15 |
< |
* This program is distributed in the hope that it will be useful, |
16 |
< |
* but WITHOUT ANY WARRANTY; without even the implied warranty of |
17 |
< |
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
18 |
< |
* GNU Lesser General Public License for more details. |
19 |
< |
* |
20 |
< |
* You should have received a copy of the GNU Lesser General Public License |
21 |
< |
* along with this program; if not, write to the Free Software |
22 |
< |
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. |
1 |
> |
/* |
2 |
> |
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
3 |
|
* |
4 |
+ |
* The University of Notre Dame grants you ("Licensee") a |
5 |
+ |
* non-exclusive, royalty free, license to use, modify and |
6 |
+ |
* redistribute this software in source and binary code form, provided |
7 |
+ |
* that the following conditions are met: |
8 |
+ |
* |
9 |
+ |
* 1. Acknowledgement of the program authors must be made in any |
10 |
+ |
* publication of scientific results based in part on use of the |
11 |
+ |
* program. An acceptable form of acknowledgement is citation of |
12 |
+ |
* the article in which the program was described (Matthew |
13 |
+ |
* A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher |
14 |
+ |
* J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented |
15 |
+ |
* Parallel Simulation Engine for Molecular Dynamics," |
16 |
+ |
* J. Comput. Chem. 26, pp. 252-271 (2005)) |
17 |
+ |
* |
18 |
+ |
* 2. Redistributions of source code must retain the above copyright |
19 |
+ |
* notice, this list of conditions and the following disclaimer. |
20 |
+ |
* |
21 |
+ |
* 3. Redistributions in binary form must reproduce the above copyright |
22 |
+ |
* notice, this list of conditions and the following disclaimer in the |
23 |
+ |
* documentation and/or other materials provided with the |
24 |
+ |
* distribution. |
25 |
+ |
* |
26 |
+ |
* This software is provided "AS IS," without a warranty of any |
27 |
+ |
* kind. All express or implied conditions, representations and |
28 |
+ |
* warranties, including any implied warranty of merchantability, |
29 |
+ |
* fitness for a particular purpose or non-infringement, are hereby |
30 |
+ |
* excluded. The University of Notre Dame and its licensors shall not |
31 |
+ |
* be liable for any damages suffered by licensee as a result of |
32 |
+ |
* using, modifying or distributing the software or its |
33 |
+ |
* derivatives. In no event will the University of Notre Dame or its |
34 |
+ |
* licensors be liable for any lost revenue, profit or data, or for |
35 |
+ |
* direct, indirect, special, consequential, incidental or punitive |
36 |
+ |
* damages, however caused and regardless of the theory of liability, |
37 |
+ |
* arising out of the use of or inability to use software, even if the |
38 |
+ |
* University of Notre Dame has been advised of the possibility of |
39 |
+ |
* such damages. |
40 |
|
*/ |
41 |
< |
|
41 |
> |
|
42 |
|
/** |
43 |
|
* @file next_combination.hpp |
44 |
|
* @author tlin |
82 |
|
* //1 8 |
83 |
|
* @endcode |
84 |
|
*/ |
85 |
< |
template<class RandomAccessIterator, template<typename ELEM, typename = std::allocator<ELEM> > class IteratorContainer> |
86 |
< |
bool next_combination(IteratorContainer<RandomAccessIterator>& iterContainer, RandomAccessIterator first, RandomAccessIterator last) { |
85 |
> |
template<class RandomAccessIterator> |
86 |
> |
bool next_combination(std::vector<RandomAccessIterator>& iterContainer, RandomAccessIterator first, RandomAccessIterator last) { |
87 |
|
if (first == last) { |
88 |
|
return false; |
89 |
|
} |
90 |
|
|
91 |
|
RandomAccessIterator endIter = --last; |
92 |
< |
typename IteratorContainer<RandomAccessIterator>::iterator i = iterContainer.end(); |
92 |
> |
typename std::vector<RandomAccessIterator>::iterator i = iterContainer.end(); |
93 |
|
|
94 |
|
if (iterContainer.empty()) { |
95 |
|
//if sequence is empty, we insert the first iterator |
109 |
|
//If j is less than zero, it means it already reaches the last combination of current size. |
110 |
|
//For instance, sequence may contain 6, 7, 8, 9 at this time, we need to increase the size |
111 |
|
// of combination to 5 |
112 |
< |
typename IteratorContainer<RandomAccessIterator>::iterator j = i; |
112 |
> |
typename std::vector<RandomAccessIterator>::iterator j = i; |
113 |
|
j--; |
114 |
|
while( j >= iterContainer.begin() && *i == *j + 1){ |
115 |
|
i--; |
146 |
|
} |
147 |
|
} //end next_combination |
148 |
|
|
133 |
– |
/** |
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 the whole series of combinations, pass an empty iterator |
137 |
– |
* container. The user should not modify this iterator container |
138 |
– |
* @param sequence the whole sequence used to generate combination |
139 |
– |
* @param result a possible combination sequence which is set on return |
140 |
– |
* @param wildCard the wild card string. Its value is "X" by default |
141 |
– |
* @note since next_combination never returns an empty sequence, replaceWildCard will not generate |
142 |
– |
* one special combination, which is n identical wild cards (n is equal to the size of the passing sequence) |
143 |
– |
* |
144 |
– |
* @code |
145 |
– |
* std::vector<std::string> sv; |
146 |
– |
* std::vector<std::vector<std::string>::iterator> sic; |
147 |
– |
* std::vector<std::string> resultString; |
148 |
– |
* sv.push_back("H"); |
149 |
– |
* sv.push_back("C"); |
150 |
– |
* sv.push_back("N"); |
151 |
– |
|
152 |
– |
* while (replaceWildCard(sic, sv, resultString)) { |
153 |
– |
* for(std::vector<std::string>::iterator i = resultString.begin(); i != resultString.end(); ++i) { |
154 |
– |
* std::cout << *i << "\t"; |
155 |
– |
* } |
156 |
– |
* std::cout << std::endl; |
157 |
– |
* } |
158 |
– |
* //output |
159 |
– |
* //H X X |
160 |
– |
* //X C X |
161 |
– |
* //X X N |
162 |
– |
* //H C X |
163 |
– |
* //H X N |
164 |
– |
* //X C N |
165 |
– |
* //H C N |
166 |
– |
@endcode |
167 |
– |
*/ |
168 |
– |
bool replaceWildCard(std::vector<std::vector<std::string>::iterator>& cont, |
169 |
– |
std::vector<std::string>& sequence, std::vector<std::string>& result, |
170 |
– |
const std::string& wildCard = "X") { |
171 |
– |
if (cont.size() > sequence.size()) { |
172 |
– |
std::cerr << "the size of iterator container is greater than the size of sequence"; |
173 |
– |
} |
174 |
– |
|
175 |
– |
bool hasMoreCombination = next_combination(cont, sequence.begin(), sequence.end()); |
176 |
– |
if (hasMoreCombination) { |
177 |
– |
result.clear(); |
178 |
– |
result.insert(result.begin(), sequence.size(), wildCard); |
179 |
– |
std::vector<std::vector<std::string>::iterator>::iterator i; |
180 |
– |
for ( i = cont.begin(); i != cont.end(); i++){ |
181 |
– |
result[*i - sequence.begin()] = **i; |
182 |
– |
} |
183 |
– |
} |
184 |
– |
|
185 |
– |
return hasMoreCombination; |
186 |
– |
|
187 |
– |
}//end replaceWildCard |
188 |
– |
|
149 |
|
} //end namespace oopse |
150 |
|
#endif //UTILS_NEXT_COMBINATION_HPP |
151 |
|
|