| 1 | /* | 
| 2 | * Copyright (c) 2005, 2010 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. Redistributions of source code must retain the above copyright | 
| 10 | *    notice, this list of conditions and the following disclaimer. | 
| 11 | * | 
| 12 | * 2. Redistributions in binary form must reproduce the above copyright | 
| 13 | *    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 | * | 
| 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]  Kuang & Gezelter,  J. Chem. Phys. 133, 164101 (2010). | 
| 40 | * [5]  Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). | 
| 41 | */ | 
| 42 |  | 
| 43 | #include "selection/DistanceFinder.hpp" | 
| 44 | #include "primitives/Molecule.hpp" | 
| 45 | namespace OpenMD { | 
| 46 |  | 
| 47 | DistanceFinder::DistanceFinder(SimInfo* info) : info_(info) { | 
| 48 |  | 
| 49 | nStuntDoubles_ = info_->getNGlobalAtoms() + info_->getNGlobalRigidBodies(); | 
| 50 | stuntdoubles_.resize(nStuntDoubles_); | 
| 51 |  | 
| 52 | SimInfo::MoleculeIterator mi; | 
| 53 | Molecule* mol; | 
| 54 | Molecule::AtomIterator ai; | 
| 55 | Atom* atom; | 
| 56 | Molecule::RigidBodyIterator rbIter; | 
| 57 | RigidBody* rb; | 
| 58 |  | 
| 59 |  | 
| 60 | for (mol = info_->beginMolecule(mi); mol != NULL; | 
| 61 | mol = info_->nextMolecule(mi)) { | 
| 62 |  | 
| 63 | for(atom = mol->beginAtom(ai); atom != NULL; | 
| 64 | atom = mol->nextAtom(ai)) { | 
| 65 | stuntdoubles_[atom->getGlobalIndex()] = atom; | 
| 66 | } | 
| 67 |  | 
| 68 | for (rb = mol->beginRigidBody(rbIter); rb != NULL; | 
| 69 | rb = mol->nextRigidBody(rbIter)) { | 
| 70 | stuntdoubles_[rb->getGlobalIndex()] = rb; | 
| 71 | } | 
| 72 | } | 
| 73 | } | 
| 74 |  | 
| 75 | OpenMDBitSet DistanceFinder::find(const OpenMDBitSet& bs, RealType distance) { | 
| 76 | StuntDouble * center; | 
| 77 | Vector3d centerPos; | 
| 78 | Snapshot* currSnapshot = info_->getSnapshotManager()->getCurrentSnapshot(); | 
| 79 | OpenMDBitSet bsResult(nStuntDoubles_); | 
| 80 | assert(bsResult.size() == bs.size()); | 
| 81 |  | 
| 82 | for (unsigned int j = 0; j < stuntdoubles_.size(); ++j) { | 
| 83 | if (stuntdoubles_[j]->isRigidBody()) { | 
| 84 | RigidBody* rb = static_cast<RigidBody*>(stuntdoubles_[j]); | 
| 85 | rb->updateAtoms(); | 
| 86 | } | 
| 87 | } | 
| 88 |  | 
| 89 | // This will fail in parallel because i might not be on this processor. | 
| 90 |  | 
| 91 | for (int i = bs.firstOnBit(); i != -1; i = bs.nextOnBit(i)) { | 
| 92 | center = stuntdoubles_[i]; | 
| 93 | centerPos = center->getPos(); | 
| 94 | for (unsigned int j = 0; j < stuntdoubles_.size(); ++j) { | 
| 95 | Vector3d r =centerPos - stuntdoubles_[j]->getPos(); | 
| 96 | currSnapshot->wrapVector(r); | 
| 97 | if (r.length() <= distance) { | 
| 98 | bsResult.setBitOn(j); | 
| 99 | } | 
| 100 | } | 
| 101 | } | 
| 102 |  | 
| 103 | return bsResult; | 
| 104 | } | 
| 105 |  | 
| 106 | } |