1 |
tim |
325 |
/* |
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 |
gezelter |
1390 |
* 1. Redistributions of source code must retain the above copyright |
10 |
tim |
325 |
* notice, this list of conditions and the following disclaimer. |
11 |
|
|
* |
12 |
gezelter |
1390 |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
tim |
325 |
* notice, this list of conditions and the following disclaimer in the |
14 |
|
|
* documentation and/or other materials provided with the |
15 |
|
|
* distribution. |
16 |
|
|
* |
17 |
|
|
* This software is provided "AS IS," without a warranty of any |
18 |
|
|
* kind. All express or implied conditions, representations and |
19 |
|
|
* warranties, including any implied warranty of merchantability, |
20 |
|
|
* fitness for a particular purpose or non-infringement, are hereby |
21 |
|
|
* excluded. The University of Notre Dame and its licensors shall not |
22 |
|
|
* be liable for any damages suffered by licensee as a result of |
23 |
|
|
* using, modifying or distributing the software or its |
24 |
|
|
* derivatives. In no event will the University of Notre Dame or its |
25 |
|
|
* licensors be liable for any lost revenue, profit or data, or for |
26 |
|
|
* direct, indirect, special, consequential, incidental or punitive |
27 |
|
|
* damages, however caused and regardless of the theory of liability, |
28 |
|
|
* arising out of the use of or inability to use software, even if the |
29 |
|
|
* University of Notre Dame has been advised of the possibility of |
30 |
|
|
* such damages. |
31 |
gezelter |
1390 |
* |
32 |
|
|
* SUPPORT OPEN SCIENCE! If you use OpenMD or its source code in your |
33 |
|
|
* research, please cite the appropriate papers when you publish your |
34 |
|
|
* work. Good starting points are: |
35 |
|
|
* |
36 |
|
|
* [1] Meineke, et al., J. Comp. Chem. 26, 252-271 (2005). |
37 |
|
|
* [2] Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006). |
38 |
|
|
* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008). |
39 |
gezelter |
1782 |
* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010). |
40 |
|
|
* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). |
41 |
tim |
325 |
*/ |
42 |
|
|
|
43 |
|
|
#include <functional> |
44 |
tim |
963 |
#include "config.h" |
45 |
gezelter |
1390 |
namespace OpenMD { |
46 |
tim |
325 |
|
47 |
gezelter |
507 |
/** |
48 |
|
|
* copy_if is one of the missing functions in STL. |
49 |
|
|
* copy_if copies elements from the range [first, last) to the range [result, result + (last-first)), |
50 |
|
|
* except that any element for which pred is false is not copied. |
51 |
|
|
*/ |
52 |
|
|
template<typename InputIterator, typename OutputIterator, typename Predicate> |
53 |
|
|
OutputIterator copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate p) { |
54 |
tim |
325 |
while (first != last) { |
55 |
gezelter |
507 |
if (p(*first)) { |
56 |
|
|
*result++ = *first; |
57 |
|
|
} |
58 |
|
|
++first; |
59 |
tim |
325 |
} |
60 |
|
|
|
61 |
|
|
return result; |
62 |
gezelter |
507 |
} |
63 |
tim |
325 |
|
64 |
|
|
|
65 |
|
|
|
66 |
gezelter |
507 |
template<typename T> |
67 |
gezelter |
1782 |
struct logical_xor : public std::binary_function<T, T, bool> { |
68 |
|
|
T operator()(const T& x, const T& y) { return x ^ y; } |
69 |
gezelter |
507 |
}; |
70 |
tim |
325 |
|
71 |
|
|
} |