| 1 | gezelter | 246 | /* | 
| 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 "minimizers/MinimizerFactory.hpp" | 
| 43 |  |  | #include "minimizers/MinimizerCreator.hpp" | 
| 44 |  |  |  | 
| 45 |  |  | namespace oopse { | 
| 46 |  |  |  | 
| 47 |  |  | //initialize instance of MinimizerFactory | 
| 48 |  |  | MinimizerFactory* MinimizerFactory::instance_ = NULL; | 
| 49 |  |  |  | 
| 50 |  |  | MinimizerFactory::~MinimizerFactory() { | 
| 51 |  |  | CreatorMapType::iterator i; | 
| 52 |  |  | for (i = creatorMap_.begin(); i != creatorMap_.end(); ++i) { | 
| 53 |  |  | delete i->second; | 
| 54 |  |  | } | 
| 55 |  |  | creatorMap_.clear(); | 
| 56 |  |  | } | 
| 57 |  |  |  | 
| 58 |  |  | bool MinimizerFactory::registerMinimizer(MinimizerCreator* creator) { | 
| 59 |  |  | return creatorMap_.insert( | 
| 60 |  |  | CreatorMapType::value_type(creator->getIdent(), creator)).second; | 
| 61 |  |  | } | 
| 62 |  |  |  | 
| 63 |  |  | bool MinimizerFactory::unregisterMinimizer(const std::string& id) { | 
| 64 |  |  | return creatorMap_.erase(id) == 1; | 
| 65 |  |  | } | 
| 66 |  |  |  | 
| 67 |  |  | Minimizer* MinimizerFactory::createMinimizer(const std::string& id, SimInfo* info) { | 
| 68 |  |  | CreatorMapType::iterator i = creatorMap_.find(id); | 
| 69 |  |  | if (i != creatorMap_.end()) { | 
| 70 |  |  | //invoke functor to create object | 
| 71 |  |  | return (i->second)->create(info); | 
| 72 |  |  | } else { | 
| 73 |  |  | return NULL; | 
| 74 |  |  | } | 
| 75 |  |  | } | 
| 76 |  |  |  | 
| 77 |  |  | std::vector<std::string> MinimizerFactory::getIdents() { | 
| 78 |  |  | IdentVectorType idents; | 
| 79 |  |  | CreatorMapType::iterator i; | 
| 80 |  |  |  | 
| 81 |  |  | for (i = creatorMap_.begin(); i != creatorMap_.end(); ++i) { | 
| 82 |  |  | idents.push_back(i->first); | 
| 83 |  |  | } | 
| 84 |  |  |  | 
| 85 |  |  | return idents; | 
| 86 |  |  | } | 
| 87 |  |  |  | 
| 88 |  |  | std::ostream& operator <<(std::ostream& o, MinimizerFactory& factory) { | 
| 89 |  |  | MinimizerFactory::IdentVectorType idents; | 
| 90 |  |  | MinimizerFactory::IdentVectorIterator i; | 
| 91 |  |  |  | 
| 92 |  |  | idents = factory.getIdents(); | 
| 93 |  |  |  | 
| 94 |  |  | o << "Avaliable type identifiers in this factory: " << std::endl; | 
| 95 |  |  | for (i = idents.begin(); i != idents.end(); ++i) { | 
| 96 |  |  | o << *i << std::endl; | 
| 97 |  |  | } | 
| 98 |  |  |  | 
| 99 |  |  | return o; | 
| 100 |  |  | } | 
| 101 |  |  |  | 
| 102 |  |  | } | 
| 103 |  |  |  |