| 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 |
#ifndef TYPES_DATAHOLDER_HPP |
| 43 |
#define TYPES_DATAHOLDER_HPP |
| 44 |
|
| 45 |
#include <iostream> |
| 46 |
|
| 47 |
#include <string> |
| 48 |
#include <map> |
| 49 |
#include <set> |
| 50 |
#include "math/Vector3.hpp" |
| 51 |
#include "utils/ParameterManager.hpp" |
| 52 |
#include "io/ParamConstraint.hpp" |
| 53 |
#include "utils/simError.h" |
| 54 |
namespace oopse { |
| 55 |
|
| 56 |
class DataHolder { |
| 57 |
public: |
| 58 |
DataHolder() {} |
| 59 |
virtual ~DataHolder() {} |
| 60 |
|
| 61 |
template<class T> |
| 62 |
void assign(const std::string& keyword, T val) { |
| 63 |
ParamMap::iterator i =parameters_.find(keyword); |
| 64 |
if (i != parameters_.end()) { |
| 65 |
bool result = i->second->setData(val); |
| 66 |
if (!result ) { |
| 67 |
std::cout << "Error in parsing " << keyword << ": expect " << i->second->getParamType() <<"\n"; |
| 68 |
} |
| 69 |
}else if (deprecatedKeywords_.find(keyword) != deprecatedKeywords_.end()){ |
| 70 |
std::cout << keyword << " is deprecated\n"; |
| 71 |
}else { |
| 72 |
std::cout << keyword << " can not be recognized\n"; |
| 73 |
} |
| 74 |
} |
| 75 |
|
| 76 |
virtual void validate() { |
| 77 |
ParamMap::iterator i; |
| 78 |
for (i = parameters_.begin(); i != parameters_.end(); ++i) { |
| 79 |
if (!i->second->isOptional() && i->second->empty()) { |
| 80 |
std::cout << i->second->getKeyword() << " must be set\n"; |
| 81 |
} |
| 82 |
} |
| 83 |
} |
| 84 |
|
| 85 |
protected: |
| 86 |
typedef std::map<std::string, ParameterBase*> ParamMap; |
| 87 |
|
| 88 |
ParamMap parameters_; |
| 89 |
std::set<std::string> deprecatedKeywords_; |
| 90 |
|
| 91 |
private: |
| 92 |
DataHolder(const DataHolder&); |
| 93 |
DataHolder& operator=(const DataHolder&); |
| 94 |
}; |
| 95 |
|
| 96 |
} |
| 97 |
#endif |
