1 |
gezelter |
1288 |
/* |
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 |
gezelter |
1288 |
* notice, this list of conditions and the following disclaimer. |
11 |
|
|
* |
12 |
gezelter |
1390 |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
gezelter |
1288 |
* 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 |
|
|
* [4] Vardeman & Gezelter, in progress (2009). |
40 |
gezelter |
1288 |
*/ |
41 |
|
|
|
42 |
|
|
#ifndef BRAINS_PAIRLIST_HPP |
43 |
|
|
|
44 |
|
|
#define BRAINS_PAIRLIST_HPP |
45 |
|
|
|
46 |
|
|
#include <iostream> |
47 |
|
|
#include <set> |
48 |
|
|
#include <utility> |
49 |
|
|
#include <vector> |
50 |
|
|
|
51 |
gezelter |
1390 |
namespace OpenMD { |
52 |
gezelter |
1288 |
|
53 |
|
|
/** |
54 |
|
|
* @class PairList PairList.hpp "brains/PairList.hpp" |
55 |
|
|
* @brief PairList class maintains a general purpose list of atom |
56 |
|
|
* pairs using the global indices of the atoms. This structure is |
57 |
|
|
* the general form for exclude lists as well as 1-4, 1-3, and 1-2 |
58 |
|
|
* lists. The PairLists are passed to fortran in a plain array. |
59 |
|
|
*/ |
60 |
|
|
class PairList { |
61 |
|
|
public: |
62 |
|
|
|
63 |
|
|
PairList() : modified_(false) {} |
64 |
|
|
|
65 |
|
|
|
66 |
|
|
/** Adds a pair into this PairList class */ |
67 |
|
|
void addPair(int i, int j); |
68 |
|
|
|
69 |
|
|
void addPairs(std::set<int>& set1, std::set<int>& set2); |
70 |
|
|
template<typename IterType1, typename IterType2> |
71 |
|
|
void addPairs(IterType1 iter1_first, IterType1 iter1_last, IterType2 iter2_first, IterType2 iter2_last); |
72 |
|
|
|
73 |
|
|
/** Remove a pair from PairList class */ |
74 |
|
|
void removePair(int i, int j); |
75 |
|
|
|
76 |
|
|
void removePairs(std::set<int>& set1, std::set<int>& set2); |
77 |
|
|
template<typename IterType1, typename IterType2> |
78 |
|
|
void removePairs(IterType1 iter1_first, IterType1 iter1_last, IterType2 iter2_first, IterType2 iter2_last); |
79 |
|
|
|
80 |
|
|
/** Checks whether pair (i, j) is in this PairList class */ |
81 |
|
|
bool hasPair(int i, int j); |
82 |
|
|
|
83 |
|
|
/** Returns the number of pairs in the list */ |
84 |
|
|
int getSize(); |
85 |
|
|
|
86 |
|
|
/** Returns the size of PairList */ |
87 |
|
|
int getSizeOfPairList(); |
88 |
|
|
|
89 |
|
|
/** Returns the pairs in a plain array*/ |
90 |
|
|
int *getPairList(); |
91 |
|
|
|
92 |
|
|
/** write out the exclusion list to an ostream */ |
93 |
|
|
friend std::ostream& operator <<(std::ostream& o, PairList& e); |
94 |
|
|
|
95 |
|
|
private: |
96 |
|
|
|
97 |
|
|
std::set < std::pair<int, int> > pairSet_; |
98 |
|
|
std::vector <int> pairList_; |
99 |
|
|
bool modified_; |
100 |
|
|
}; |
101 |
|
|
|
102 |
gezelter |
1390 |
} //end namespace OpenMD |
103 |
gezelter |
1288 |
|
104 |
|
|
#endif // __PAIRLIST_H__ |