src/optimization/OptimizationFactory.cpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).          
 * [4]  Kuang & Gezelter,  J. Chem. Phys. 133, 164101 (2010).
 * [5]  Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
 */
 
#include "optimization/OptimizationFactory.hpp"
#include "optimization/OptimizationCreator.hpp"

namespace OpenMD {

  //initialize instance of OptimizationFactory
  OptimizationFactory* OptimizationFactory::instance_ = NULL;

  OptimizationFactory::~OptimizationFactory() {
    CreatorMapType::iterator i;
    for (i = creatorMap_.begin(); i != creatorMap_.end(); ++i) {
      delete i->second;
    }
    creatorMap_.clear();
  }

  bool OptimizationFactory::registerOptimization(OptimizationCreator* creator) {
    return creatorMap_.insert(
                              CreatorMapType::value_type(creator->getIdent(), creator)).second;
  }

  bool OptimizationFactory::unregisterOptimization(const std::string& id) {
    return creatorMap_.erase(id) == 1;
  }

  QuantLib::OptimizationMethod* OptimizationFactory::createOptimization(const std::string& id, SimInfo* info) {
    CreatorMapType::iterator i = creatorMap_.find(id);
    if (i != creatorMap_.end()) {
      //invoke functor to create object
      return (i->second)->create();
    } else {
      return NULL;
    }
  }

  std::vector<std::string> OptimizationFactory::getIdents() {
    IdentVectorType idents;
    CreatorMapType::iterator i;

    for (i = creatorMap_.begin(); i != creatorMap_.end(); ++i) {
      idents.push_back(i->first);
    }
    
    return idents;
  }

  std::ostream& operator <<(std::ostream& o, OptimizationFactory& factory) {
    OptimizationFactory::IdentVectorType idents;
    OptimizationFactory::IdentVectorIterator i;

    idents = factory.getIdents();

    o << "Avaliable type identifiers in this factory: " << std::endl;
    for (i = idents.begin(); i != idents.end(); ++i) {
      o << *i << std::endl;
    }

    return o;
  }

}

Revision:	1741
Committed:	Tue Jun 5 18:02:44 2012 UTC (12 years, 10 months ago) by gezelter
File size:	3896 byte(s)
Log Message:	Adding initial import of optimization library
#	User	Rev	Content
1	gezelter	1741	/*
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. Redistributions of source code must retain the above copyright
10			* notice, this list of conditions and the following disclaimer.
11			*
12			* 2. Redistributions in binary form must reproduce the above copyright
13			* 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			*
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			* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 24107 (2008).
39			* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010).
40			* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
41			*/
42
43			#include "optimization/OptimizationFactory.hpp"
44			#include "optimization/OptimizationCreator.hpp"
45
46			namespace OpenMD {
47
48			//initialize instance of OptimizationFactory
49			OptimizationFactory* OptimizationFactory::instance_ = NULL;
50
51			OptimizationFactory::~OptimizationFactory() {
52			CreatorMapType::iterator i;
53			for (i = creatorMap_.begin(); i != creatorMap_.end(); ++i) {
54			delete i->second;
55			}
56			creatorMap_.clear();
57			}
58
59			bool OptimizationFactory::registerOptimization(OptimizationCreator* creator) {
60			return creatorMap_.insert(
61			CreatorMapType::value_type(creator->getIdent(), creator)).second;
62			}
63
64			bool OptimizationFactory::unregisterOptimization(const std::string& id) {
65			return creatorMap_.erase(id) == 1;
66			}
67
68			QuantLib::OptimizationMethod* OptimizationFactory::createOptimization(const std::string& id, SimInfo* info) {
69			CreatorMapType::iterator i = creatorMap_.find(id);
70			if (i != creatorMap_.end()) {
71			//invoke functor to create object
72			return (i->second)->create();
73			} else {
74			return NULL;
75			}
76			}
77
78			std::vector<std::string> OptimizationFactory::getIdents() {
79			IdentVectorType idents;
80			CreatorMapType::iterator i;
81
82			for (i = creatorMap_.begin(); i != creatorMap_.end(); ++i) {
83			idents.push_back(i->first);
84			}
85
86			return idents;
87			}
88
89			std::ostream& operator <<(std::ostream& o, OptimizationFactory& factory) {
90			OptimizationFactory::IdentVectorType idents;
91			OptimizationFactory::IdentVectorIterator i;
92
93			idents = factory.getIdents();
94
95			o << "Avaliable type identifiers in this factory: " << std::endl;
96			for (i = idents.begin(); i != idents.end(); ++i) {
97			o << *i << std::endl;
98			}
99
100			return o;
101			}
102
103			}
104