1 |
tim |
295 |
/* |
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 |
295 |
* 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 |
295 |
* 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 |
tim |
295 |
*/ |
41 |
|
|
|
42 |
|
|
#include "selection/DistanceFinder.hpp" |
43 |
|
|
#include "primitives/Molecule.hpp" |
44 |
gezelter |
1390 |
namespace OpenMD { |
45 |
tim |
295 |
|
46 |
gezelter |
507 |
DistanceFinder::DistanceFinder(SimInfo* info) : info_(info) { |
47 |
tim |
295 |
|
48 |
|
|
nStuntDoubles_ = info_->getNGlobalAtoms() + info_->getNGlobalRigidBodies(); |
49 |
|
|
stuntdoubles_.resize(nStuntDoubles_); |
50 |
|
|
|
51 |
|
|
SimInfo::MoleculeIterator mi; |
52 |
|
|
Molecule* mol; |
53 |
|
|
Molecule::AtomIterator ai; |
54 |
|
|
Atom* atom; |
55 |
|
|
Molecule::RigidBodyIterator rbIter; |
56 |
|
|
RigidBody* rb; |
57 |
|
|
|
58 |
|
|
|
59 |
|
|
for (mol = info_->beginMolecule(mi); mol != NULL; mol = info_->nextMolecule(mi)) { |
60 |
|
|
|
61 |
gezelter |
507 |
for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { |
62 |
|
|
stuntdoubles_[atom->getGlobalIndex()] = atom; |
63 |
|
|
} |
64 |
tim |
295 |
|
65 |
gezelter |
507 |
for (rb = mol->beginRigidBody(rbIter); rb != NULL; rb = mol->nextRigidBody(rbIter)) { |
66 |
|
|
stuntdoubles_[rb->getGlobalIndex()] = rb; |
67 |
|
|
} |
68 |
tim |
295 |
|
69 |
|
|
} |
70 |
|
|
|
71 |
gezelter |
507 |
} |
72 |
tim |
295 |
|
73 |
gezelter |
1390 |
OpenMDBitSet DistanceFinder::find(const OpenMDBitSet& bs, RealType distance) { |
74 |
tim |
295 |
StuntDouble * center; |
75 |
|
|
Vector3d centerPos; |
76 |
|
|
Snapshot* currSnapshot = info_->getSnapshotManager()->getCurrentSnapshot(); |
77 |
gezelter |
1390 |
OpenMDBitSet bsResult(nStuntDoubles_); |
78 |
tim |
295 |
assert(bsResult.size() == bs.size()); |
79 |
|
|
|
80 |
tim |
358 |
for (int i = bs.firstOnBit(); i != -1; i = bs.nextOnBit(i)) { |
81 |
gezelter |
507 |
center = stuntdoubles_[i]; |
82 |
|
|
centerPos = center->getPos(); |
83 |
|
|
for (int j = 0; j < stuntdoubles_.size(); ++j) { |
84 |
|
|
Vector3d r =centerPos - stuntdoubles_[j]->getPos(); |
85 |
|
|
currSnapshot->wrapVector(r); |
86 |
|
|
if (r.length() <= distance) { |
87 |
|
|
bsResult.setBitOn(j); |
88 |
|
|
} |
89 |
|
|
} |
90 |
tim |
295 |
} |
91 |
|
|
|
92 |
|
|
return bsResult; |
93 |
gezelter |
507 |
} |
94 |
tim |
295 |
|
95 |
|
|
} |