| 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 |
+ |
|
| 42 |
+ |
|
| 43 |
|
#include "utils/Utility.hpp" |
| 2 |
– |
#include <vector> |
| 3 |
– |
#include <iostream> |
| 4 |
– |
#include <math.h> |
| 5 |
– |
using namespace std; |
| 44 |
|
|
| 45 |
< |
double dotProduct(vector<double>& v1, vector<double>& v2){ |
| 8 |
< |
double sum; |
| 45 |
> |
namespace oopse { |
| 46 |
|
|
| 47 |
< |
sum = 0; |
| 47 |
> |
bool replaceWithWildCard(std::vector<std::vector<std::string>::iterator>& cont, |
| 48 |
> |
std::vector<std::string>& sequence, std::vector<std::string>& result, const std::string& wildCard) { |
| 49 |
> |
if (cont.size() > sequence.size()) { |
| 50 |
> |
std::cerr << "the size of iterator container is greater than the size of sequence"; |
| 51 |
> |
} |
| 52 |
|
|
| 53 |
< |
if(v1.size() != v2.size()){ |
| 54 |
< |
cerr << "Utility Error: dimension of two vectors are not matched" << endl; |
| 55 |
< |
exit(-1); |
| 56 |
< |
} |
| 57 |
< |
|
| 58 |
< |
for(int i = 0; i < v1.size(); i++) |
| 59 |
< |
sum += v1[i]*v2[i]; |
| 60 |
< |
return sum; |
| 61 |
< |
} |
| 53 |
> |
bool hasMoreCombination = next_combination(cont, sequence.begin(), sequence.end()); |
| 54 |
> |
if (hasMoreCombination) { |
| 55 |
> |
result.clear(); |
| 56 |
> |
result.insert(result.begin(), sequence.size(), wildCard); |
| 57 |
> |
std::vector<std::vector<std::string>::iterator>::iterator i; |
| 58 |
> |
for ( i = cont.begin(); i != cont.end(); i++){ |
| 59 |
> |
result[*i - sequence.begin()] = **i; |
| 60 |
> |
} |
| 61 |
> |
} |
| 62 |
|
|
| 63 |
< |
double norm2(vector<double>& x){ |
| 64 |
< |
return sqrt(dotProduct(x, x)); |
| 65 |
< |
} |
| 63 |
> |
return hasMoreCombination; |
| 64 |
> |
|
| 65 |
> |
}//end replaceWildCard |
| 66 |
> |
|
| 67 |
> |
} |
