| 1 | /* | 
| 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 |  | 
| 42 | #include "applications/hydrodynamics/BeadModel.hpp" | 
| 43 |  | 
| 44 | namespace oopse { | 
| 45 | bool BeadModel::createBeads(std::vector<BeadParam>& beads) { | 
| 46 |  | 
| 47 | if (sd_->isAtom()) { | 
| 48 | createSingleBead(static_cast<Atom*>(sd_), beads); | 
| 49 | } | 
| 50 | else if (sd_->isRigidBody()) { | 
| 51 | RigidBody* rb = static_cast<RigidBody*>(sd_); | 
| 52 | std::vector<Atom*>::iterator ai; | 
| 53 | Atom* atom; | 
| 54 | for (atom = rb->beginAtom(ai); atom != NULL; atom = rb->nextAtom(ai)) { | 
| 55 | if (!createSingleBead(atom, beads)) | 
| 56 | return false; | 
| 57 | } | 
| 58 | } | 
| 59 |  | 
| 60 | return true; | 
| 61 | } | 
| 62 |  | 
| 63 | bool BeadModel::createSingleBead(Atom* atom, std::vector<BeadParam>& beads) { | 
| 64 | AtomType* atomType = atom->getAtomType(); | 
| 65 |  | 
| 66 | if (atomType->isGayBerne()) { | 
| 67 | return false; | 
| 68 | } else if (atomType->isLennardJones()){ | 
| 69 | GenericData* data = atomType->getPropertyByName("LennardJones"); | 
| 70 | if (data != NULL) { | 
| 71 | LJParamGenericData* ljData = dynamic_cast<LJParamGenericData*>(data); | 
| 72 |  | 
| 73 | if (ljData != NULL) { | 
| 74 | LJParam ljParam = ljData->getData(); | 
| 75 | BeadParam currBead; | 
| 76 | currBead.atomName = atom->getType(); | 
| 77 | currBead.pos = atom->getPos(); | 
| 78 | currBead.radius = ljParam.sigma/2.0; | 
| 79 | beads.push_back(currBead); | 
| 80 | } else { | 
| 81 | sprintf( painCave.errMsg, | 
| 82 | "Can not cast GenericData to LJParam\n"); | 
| 83 | painCave.severity = OOPSE_ERROR; | 
| 84 | painCave.isFatal = 1; | 
| 85 | simError(); | 
| 86 | } | 
| 87 | } | 
| 88 | } | 
| 89 |  | 
| 90 | return true; | 
| 91 | } | 
| 92 |  | 
| 93 | } |