| 1 | tim | 416 | /* | 
| 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 |  |  | #include "selection/IndexFinder.hpp" | 
| 42 |  |  | #include "primitives/Molecule.hpp" | 
| 43 |  |  | namespace oopse { | 
| 44 |  |  |  | 
| 45 |  |  |  | 
| 46 |  |  |  | 
| 47 | gezelter | 507 | IndexFinder::IndexFinder(SimInfo* info) : info_(info){ | 
| 48 | tim | 416 | nStuntDoubles_ = info_->getNGlobalAtoms() + info_->getNGlobalRigidBodies(); | 
| 49 |  |  | bitSets_.resize(info_->getNGlobalMolecules()); | 
| 50 |  |  | init(); | 
| 51 | gezelter | 507 | } | 
| 52 | tim | 416 |  | 
| 53 |  |  |  | 
| 54 | gezelter | 507 | void IndexFinder::init() { | 
| 55 | tim | 416 |  | 
| 56 |  |  | SimInfo::MoleculeIterator mi; | 
| 57 |  |  | Molecule* mol; | 
| 58 |  |  | Molecule::AtomIterator ai; | 
| 59 |  |  | Atom* atom; | 
| 60 |  |  | Molecule::RigidBodyIterator rbIter; | 
| 61 |  |  | RigidBody* rb; | 
| 62 |  |  |  | 
| 63 |  |  | for (mol = info_->beginMolecule(mi); mol != NULL; mol = info_->nextMolecule(mi)) { | 
| 64 |  |  |  | 
| 65 | tim | 770 | OOPSEBitSet bs(nStuntDoubles_); | 
| 66 | gezelter | 507 | for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { | 
| 67 |  |  | bs.setBitOn(atom->getGlobalIndex()); | 
| 68 |  |  | } | 
| 69 | tim | 416 |  | 
| 70 | gezelter | 507 | for (rb = mol->beginRigidBody(rbIter); rb != NULL; rb = mol->nextRigidBody(rbIter)) { | 
| 71 |  |  | bs.setBitOn(rb->getGlobalIndex()); | 
| 72 |  |  | } | 
| 73 | tim | 416 |  | 
| 74 | gezelter | 507 | bitSets_[mol->getGlobalIndex()] = bs; | 
| 75 | tim | 416 | } | 
| 76 |  |  |  | 
| 77 | gezelter | 507 | } | 
| 78 | tim | 416 |  | 
| 79 | tim | 770 | OOPSEBitSet IndexFinder::find(int molIndex){ | 
| 80 | tim | 416 | return bitSets_[molIndex]; | 
| 81 | gezelter | 507 | } | 
| 82 | tim | 416 |  | 
| 83 | tim | 770 | OOPSEBitSet IndexFinder::find(int begMolIndex, int endMolIndex){ | 
| 84 |  |  | OOPSEBitSet bs(nStuntDoubles_); | 
| 85 | tim | 416 |  | 
| 86 |  |  | for (int i = begMolIndex; i < endMolIndex; ++i) { | 
| 87 | gezelter | 507 | bs |= bitSets_[i]; | 
| 88 | tim | 416 | } | 
| 89 |  |  |  | 
| 90 |  |  | return bs; | 
| 91 | gezelter | 507 | } | 
| 92 | tim | 416 |  | 
| 93 |  |  |  | 
| 94 |  |  | } | 
| 95 |  |  |  |