| 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 "lattice/LatticeFactory.hpp" | 
| 43 | #include "lattice/BaseLattice.hpp" | 
| 44 | #include "lattice/LatticeCreator.hpp" | 
| 45 |  | 
| 46 | namespace oopse { | 
| 47 |  | 
| 48 | LatticeFactory* LatticeFactory::instance = NULL; | 
| 49 | LatticeFactory::~LatticeFactory(){ | 
| 50 | std::map<std::string, BaseLatticeCreator*>::iterator mapIter; | 
| 51 | for (mapIter = creatorMap.begin(); mapIter == creatorMap.end(); ++mapIter) { | 
| 52 | delete mapIter->second; | 
| 53 | } | 
| 54 | } | 
| 55 |  | 
| 56 | LatticeFactory* LatticeFactory::getInstance(){ | 
| 57 | if (instance == NULL) | 
| 58 | instance = new LatticeFactory(); | 
| 59 |  | 
| 60 | return instance; | 
| 61 | } | 
| 62 |  | 
| 63 | bool LatticeFactory::registerCreator( BaseLatticeCreator*  latCreator ){ | 
| 64 | std::string latticeType = latCreator->getType(); | 
| 65 | std::map<std::string, BaseLatticeCreator*>::iterator mapIter; | 
| 66 |  | 
| 67 | mapIter = creatorMap.find(latticeType); | 
| 68 |  | 
| 69 | if (mapIter == creatorMap.end()) { | 
| 70 | creatorMap[ latticeType ] = latCreator; | 
| 71 | return true; | 
| 72 | } | 
| 73 | else{ | 
| 74 | delete mapIter->second; | 
| 75 | mapIter->second = latCreator; | 
| 76 | return false; | 
| 77 | } | 
| 78 | } | 
| 79 |  | 
| 80 | BaseLattice* LatticeFactory::createLattice( const std::string& latticeType ){ | 
| 81 | std::map<std::string, BaseLatticeCreator*>::iterator mapIter; | 
| 82 |  | 
| 83 | mapIter = creatorMap.find(latticeType); | 
| 84 |  | 
| 85 | if (mapIter != creatorMap.end()) { | 
| 86 | return (mapIter->second)->createLattice(); | 
| 87 | } | 
| 88 | else | 
| 89 | return NULL; | 
| 90 | } | 
| 91 |  | 
| 92 | bool LatticeFactory::hasLatticeCreator( const std::string& latticeType ){ | 
| 93 | std::map<std::string, BaseLatticeCreator*>::iterator mapIter; | 
| 94 |  | 
| 95 | mapIter = creatorMap.find(latticeType); | 
| 96 |  | 
| 97 | if (mapIter != creatorMap.end()) | 
| 98 | return true; | 
| 99 | else | 
| 100 | return false; | 
| 101 | } | 
| 102 |  | 
| 103 | const  std::string LatticeFactory::toString(){ | 
| 104 | std::string result; | 
| 105 | std::map<std::string, BaseLatticeCreator*>::iterator mapIter; | 
| 106 |  | 
| 107 | result = "Avaliable lattice creators in LatticeFactory are:\n"; | 
| 108 |  | 
| 109 | for(mapIter = creatorMap.begin(); mapIter != creatorMap.end(); ++mapIter){ | 
| 110 | result += mapIter->first + " "; | 
| 111 | } | 
| 112 |  | 
| 113 | result += "\n"; | 
| 114 |  | 
| 115 | return result; | 
| 116 | } | 
| 117 |  | 
| 118 |  | 
| 119 | } |