1 |
gezelter |
507 |
/* |
2 |
gezelter |
246 |
* 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 |
gezelter |
1390 |
* 1. Redistributions of source code must retain the above copyright |
10 |
gezelter |
246 |
* notice, this list of conditions and the following disclaimer. |
11 |
|
|
* |
12 |
gezelter |
1390 |
* 2. Redistributions in binary form must reproduce the above copyright |
13 |
gezelter |
246 |
* 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 |
gezelter |
1390 |
* |
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] Vardeman & Gezelter, in progress (2009). |
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 |
gezelter |
1390 |
namespace OpenMD { |
47 |
tim |
129 |
|
48 |
gezelter |
507 |
PropertyMap::~PropertyMap(){ |
49 |
|
|
clearProperties(); |
50 |
|
|
} |
51 |
tim |
73 |
|
52 |
|
|
|
53 |
gezelter |
507 |
void PropertyMap::addProperty(GenericData* genData){ |
54 |
tim |
129 |
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 |
507 |
propMap_.insert(std::make_pair(genData->getID(), genData)); |
60 |
tim |
129 |
} else { |
61 |
gezelter |
507 |
delete iter->second; |
62 |
|
|
iter->second = genData; |
63 |
tim |
129 |
} |
64 |
gezelter |
507 |
} |
65 |
tim |
73 |
|
66 |
gezelter |
507 |
bool PropertyMap::removeProperty(const std::string& propName){ |
67 |
|
|
std::map<std::string, GenericData*>::iterator iter; |
68 |
tim |
73 |
|
69 |
tim |
129 |
iter = propMap_.find(propName); |
70 |
tim |
73 |
|
71 |
tim |
129 |
if (iter != propMap_.end()){ |
72 |
gezelter |
507 |
delete iter->second; |
73 |
|
|
propMap_.erase(iter); |
74 |
|
|
return true; |
75 |
tim |
129 |
} else { |
76 |
gezelter |
507 |
//logger.warn("Can not find property with name: " + propName); |
77 |
|
|
return false; |
78 |
tim |
129 |
} |
79 |
gezelter |
507 |
} |
80 |
tim |
73 |
|
81 |
gezelter |
507 |
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 |
gezelter |
507 |
delete iter->second; |
86 |
tim |
129 |
|
87 |
|
|
propMap_.clear(); |
88 |
gezelter |
507 |
} |
89 |
tim |
73 |
|
90 |
gezelter |
507 |
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 |
gezelter |
507 |
propNames.push_back(iter->first); |
96 |
tim |
73 |
|
97 |
tim |
129 |
return propNames; |
98 |
gezelter |
507 |
} |
99 |
tim |
73 |
|
100 |
gezelter |
507 |
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 |
gezelter |
507 |
properties.push_back(iter->second); |
106 |
tim |
73 |
|
107 |
tim |
129 |
return properties; |
108 |
gezelter |
507 |
} |
109 |
tim |
73 |
|
110 |
gezelter |
507 |
GenericData* PropertyMap::getPropertyByName(const std::string& propName){ |
111 |
tim |
129 |
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 |
gezelter |
507 |
return iter->second; |
117 |
tim |
129 |
else |
118 |
gezelter |
507 |
return NULL; |
119 |
|
|
} |
120 |
tim |
129 |
|
121 |
gezelter |
1390 |
}//end namespace OpenMD |