| 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 | 
gezelter | 
1390 | 
 * 1. Redistributions of source code must retain the above copyright | 
| 10 | 
tim | 
416 | 
 *    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 | 
416 | 
 *    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 | 
gezelter | 
1879 | 
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (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 | 
416 | 
 */ | 
| 42 | 
  | 
  | 
#include "selection/IndexFinder.hpp" | 
| 43 | 
  | 
  | 
#include "primitives/Molecule.hpp" | 
| 44 | 
gezelter | 
1390 | 
namespace OpenMD { | 
| 45 | 
tim | 
416 | 
 | 
| 46 | 
gezelter | 
507 | 
  IndexFinder::IndexFinder(SimInfo* info) : info_(info){ | 
| 47 | 
gezelter | 
1953 | 
    nObjects_.push_back(info_->getNGlobalAtoms()+info_->getNGlobalRigidBodies()); | 
| 48 | 
  | 
  | 
    nObjects_.push_back(info_->getNGlobalBonds()); | 
| 49 | 
  | 
  | 
    nObjects_.push_back(info_->getNGlobalBends()); | 
| 50 | 
  | 
  | 
    nObjects_.push_back(info_->getNGlobalTorsions()); | 
| 51 | 
  | 
  | 
    nObjects_.push_back(info_->getNGlobalInversions()); | 
| 52 | 
  | 
  | 
 | 
| 53 | 
  | 
  | 
    selectionSets_.resize(info_->getNGlobalMolecules()); | 
| 54 | 
tim | 
416 | 
    init(); | 
| 55 | 
gezelter | 
507 | 
  } | 
| 56 | 
tim | 
416 | 
 | 
| 57 | 
gezelter | 
507 | 
  void IndexFinder::init() { | 
| 58 | 
tim | 
416 | 
 | 
| 59 | 
  | 
  | 
    SimInfo::MoleculeIterator mi; | 
| 60 | 
gezelter | 
1953 | 
    Molecule::AtomIterator ai; | 
| 61 | 
  | 
  | 
    Molecule::RigidBodyIterator rbIter; | 
| 62 | 
  | 
  | 
    Molecule::BondIterator bondIter; | 
| 63 | 
  | 
  | 
    Molecule::BendIterator bendIter; | 
| 64 | 
  | 
  | 
    Molecule::TorsionIterator torsionIter; | 
| 65 | 
  | 
  | 
    Molecule::InversionIterator inversionIter; | 
| 66 | 
  | 
  | 
 | 
| 67 | 
tim | 
416 | 
    Molecule* mol; | 
| 68 | 
  | 
  | 
    Atom* atom; | 
| 69 | 
  | 
  | 
    RigidBody* rb; | 
| 70 | 
gezelter | 
1953 | 
    Bond* bond; | 
| 71 | 
  | 
  | 
    Bend* bend; | 
| 72 | 
  | 
  | 
    Torsion* torsion; | 
| 73 | 
  | 
  | 
    Inversion* inversion;     | 
| 74 | 
tim | 
416 | 
     | 
| 75 | 
gezelter | 
1801 | 
    for (mol = info_->beginMolecule(mi); mol != NULL;  | 
| 76 | 
  | 
  | 
         mol = info_->nextMolecule(mi)) { | 
| 77 | 
tim | 
416 | 
            | 
| 78 | 
gezelter | 
1953 | 
      SelectionSet ss(nObjects_); | 
| 79 | 
  | 
  | 
 | 
| 80 | 
gezelter | 
507 | 
      for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) { | 
| 81 | 
gezelter | 
1953 | 
        ss.bitsets_[STUNTDOUBLE].setBitOn(atom->getGlobalIndex()); | 
| 82 | 
gezelter | 
507 | 
      } | 
| 83 | 
gezelter | 
1801 | 
      for (rb = mol->beginRigidBody(rbIter); rb != NULL;  | 
| 84 | 
  | 
  | 
           rb = mol->nextRigidBody(rbIter)) { | 
| 85 | 
gezelter | 
1953 | 
        ss.bitsets_[STUNTDOUBLE].setBitOn(rb->getGlobalIndex()); | 
| 86 | 
gezelter | 
507 | 
      } | 
| 87 | 
gezelter | 
1953 | 
      for (bond = mol->beginBond(bondIter); bond != NULL;  | 
| 88 | 
  | 
  | 
           bond = mol->nextBond(bondIter)) { | 
| 89 | 
  | 
  | 
        ss.bitsets_[BOND].setBitOn(bond->getGlobalIndex()); | 
| 90 | 
  | 
  | 
      }    | 
| 91 | 
  | 
  | 
      for (bend = mol->beginBend(bendIter); bend != NULL;  | 
| 92 | 
  | 
  | 
           bend = mol->nextBend(bendIter)) { | 
| 93 | 
  | 
  | 
        ss.bitsets_[BEND].setBitOn(bend->getGlobalIndex()); | 
| 94 | 
  | 
  | 
      }    | 
| 95 | 
  | 
  | 
      for (torsion = mol->beginTorsion(torsionIter); torsion != NULL;  | 
| 96 | 
  | 
  | 
           torsion = mol->nextTorsion(torsionIter)) { | 
| 97 | 
  | 
  | 
        ss.bitsets_[TORSION].setBitOn(torsion->getGlobalIndex()); | 
| 98 | 
  | 
  | 
      }    | 
| 99 | 
  | 
  | 
      for (inversion = mol->beginInversion(inversionIter); inversion != NULL;  | 
| 100 | 
  | 
  | 
           inversion = mol->nextInversion(inversionIter)) { | 
| 101 | 
  | 
  | 
        ss.bitsets_[INVERSION].setBitOn(inversion->getGlobalIndex()); | 
| 102 | 
  | 
  | 
      }    | 
| 103 | 
  | 
  | 
 | 
| 104 | 
  | 
  | 
      selectionSets_[mol->getGlobalIndex()] = ss; | 
| 105 | 
gezelter | 
1801 | 
    } | 
| 106 | 
gezelter | 
507 | 
  } | 
| 107 | 
tim | 
416 | 
 | 
| 108 | 
gezelter | 
1953 | 
  SelectionSet IndexFinder::find(int molIndex){ | 
| 109 | 
  | 
  | 
    return selectionSets_[molIndex]; | 
| 110 | 
gezelter | 
507 | 
  } | 
| 111 | 
tim | 
416 | 
 | 
| 112 | 
gezelter | 
1953 | 
  SelectionSet IndexFinder::find(int begMolIndex, int endMolIndex){ | 
| 113 | 
  | 
  | 
    SelectionSet ss(nObjects_); | 
| 114 | 
tim | 
416 | 
         | 
| 115 | 
  | 
  | 
    for (int i = begMolIndex; i < endMolIndex; ++i) { | 
| 116 | 
gezelter | 
1953 | 
      ss |= selectionSets_[i]; | 
| 117 | 
gezelter | 
1801 | 
    }     | 
| 118 | 
gezelter | 
1953 | 
    return ss; | 
| 119 | 
gezelter | 
507 | 
  } | 
| 120 | 
tim | 
416 | 
} | 
| 121 | 
  | 
  | 
 |