| 1 |
gezelter |
246 |
/* |
| 2 |
|
|
* Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. |
| 3 |
tim |
73 |
* |
| 4 |
gezelter |
246 |
* 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 |
tim |
73 |
*/ |
| 41 |
gezelter |
246 |
|
| 42 |
tim |
129 |
#include "utils/PropertyMap.hpp" |
| 43 |
tim |
73 |
#include <cassert> |
| 44 |
gezelter |
246 |
#include <utility> |
| 45 |
tim |
73 |
|
| 46 |
tim |
129 |
namespace oopse { |
| 47 |
|
|
|
| 48 |
tim |
73 |
PropertyMap::~PropertyMap(){ |
| 49 |
|
|
clearProperties(); |
| 50 |
|
|
} |
| 51 |
|
|
|
| 52 |
|
|
|
| 53 |
tim |
129 |
void PropertyMap::addProperty(GenericData* genData){ |
| 54 |
|
|
std::map<std::string, GenericData*>::iterator iter; |
| 55 |
tim |
73 |
|
| 56 |
tim |
129 |
iter = propMap_.find(genData->getID()); |
| 57 |
tim |
73 |
|
| 58 |
tim |
129 |
if (iter == propMap_.end()){ |
| 59 |
gezelter |
246 |
propMap_.insert(std::make_pair(genData->getID(), genData)); |
| 60 |
tim |
129 |
} else { |
| 61 |
|
|
delete iter->second; |
| 62 |
|
|
iter->second = genData; |
| 63 |
|
|
} |
| 64 |
tim |
73 |
} |
| 65 |
|
|
|
| 66 |
tim |
129 |
bool PropertyMap::removeProperty(const std::string& propName){ |
| 67 |
tim |
73 |
std::map<std::string, GenericData*>::iterator iter; |
| 68 |
|
|
|
| 69 |
tim |
129 |
iter = propMap_.find(propName); |
| 70 |
tim |
73 |
|
| 71 |
tim |
129 |
if (iter != propMap_.end()){ |
| 72 |
|
|
delete iter->second; |
| 73 |
|
|
propMap_.erase(iter); |
| 74 |
|
|
return true; |
| 75 |
|
|
} else { |
| 76 |
|
|
//logger.warn("Can not find property with name: " + propName); |
| 77 |
|
|
return false; |
| 78 |
|
|
} |
| 79 |
tim |
73 |
} |
| 80 |
|
|
|
| 81 |
|
|
void PropertyMap::clearProperties(){ |
| 82 |
tim |
129 |
std::map<std::string, GenericData*>::iterator iter; |
| 83 |
tim |
73 |
|
| 84 |
tim |
129 |
for (iter = propMap_.begin(); iter != propMap_.end(); ++iter) |
| 85 |
|
|
delete iter->second; |
| 86 |
|
|
|
| 87 |
|
|
propMap_.clear(); |
| 88 |
tim |
73 |
} |
| 89 |
|
|
|
| 90 |
|
|
std::vector<std::string> PropertyMap::getPropertyNames(){ |
| 91 |
tim |
129 |
std::vector<std::string> propNames; |
| 92 |
|
|
std::map<std::string, GenericData*>::iterator iter; |
| 93 |
tim |
73 |
|
| 94 |
tim |
129 |
for (iter = propMap_.begin(); iter != propMap_.end(); ++iter) |
| 95 |
|
|
propNames.push_back(iter->first); |
| 96 |
tim |
73 |
|
| 97 |
tim |
129 |
return propNames; |
| 98 |
tim |
73 |
} |
| 99 |
|
|
|
| 100 |
|
|
std::vector<GenericData*> PropertyMap::getProperties(){ |
| 101 |
tim |
129 |
std::vector<GenericData*> properties; |
| 102 |
|
|
std::map<std::string, GenericData*>::iterator iter; |
| 103 |
tim |
73 |
|
| 104 |
tim |
129 |
for (iter = propMap_.begin(); iter != propMap_.end(); ++iter) |
| 105 |
|
|
properties.push_back(iter->second); |
| 106 |
tim |
73 |
|
| 107 |
tim |
129 |
return properties; |
| 108 |
tim |
73 |
} |
| 109 |
|
|
|
| 110 |
tim |
129 |
GenericData* PropertyMap::getPropertyByName(const std::string& propName){ |
| 111 |
|
|
std::map<std::string, GenericData*>::iterator iter; |
| 112 |
tim |
73 |
|
| 113 |
tim |
129 |
iter = propMap_.find(propName); |
| 114 |
tim |
73 |
|
| 115 |
tim |
129 |
if (iter != propMap_.end()) |
| 116 |
|
|
return iter->second; |
| 117 |
|
|
else |
| 118 |
|
|
return NULL; |
| 119 |
|
|
} |
| 120 |
|
|
|
| 121 |
|
|
}//end namepace oopse |