1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316
|
/* Icinga 2 | (c) 2012 Icinga GmbH | GPLv2+ */
#include "base/dictionary.hpp"
#include "base/objectlock.hpp"
#include "base/debug.hpp"
#include "base/primitivetype.hpp"
#include "base/configwriter.hpp"
#include <sstream>
using namespace icinga;
template class std::map<String, Value>;
REGISTER_PRIMITIVE_TYPE(Dictionary, Object, Dictionary::GetPrototype());
Dictionary::Dictionary(const DictionaryData& other)
{
for (const auto& kv : other)
m_Data.insert(kv);
}
Dictionary::Dictionary(DictionaryData&& other)
{
for (auto& kv : other)
m_Data.insert(std::move(kv));
}
Dictionary::Dictionary(std::initializer_list<Dictionary::Pair> init)
: m_Data(init)
{ }
/**
* Retrieves a value from a dictionary.
*
* @param key The key whose value should be retrieved.
* @returns The value of an empty value if the key was not found.
*/
Value Dictionary::Get(const String& key) const
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
auto it = m_Data.find(key);
if (it == m_Data.end())
return Empty;
return it->second;
}
/**
* Retrieves a value from a dictionary.
*
* @param key The key whose value should be retrieved.
* @param result The value of the dictionary item (only set when the key exists)
* @returns true if the key exists, false otherwise.
*/
bool Dictionary::Get(const String& key, Value *result) const
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
auto it = m_Data.find(key);
if (it == m_Data.end())
return false;
*result = it->second;
return true;
}
/**
* Retrieves a value's address from a dictionary.
*
* @param key The key whose value's address should be retrieved.
* @returns nullptr if the key was not found.
*/
const Value * Dictionary::GetRef(const String& key) const
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
auto it (m_Data.find(key));
return it == m_Data.end() ? nullptr : &it->second;
}
/**
* Sets a value in the dictionary.
*
* @param key The key.
* @param value The value.
* @param overrideFrozen Whether to allow modifying frozen dictionaries.
*/
void Dictionary::Set(const String& key, Value value, bool overrideFrozen)
{
ObjectLock olock(this);
std::unique_lock<std::shared_timed_mutex> lock (m_DataMutex);
if (m_Frozen && !overrideFrozen)
BOOST_THROW_EXCEPTION(std::invalid_argument("Value in dictionary must not be modified."));
m_Data[key] = std::move(value);
}
/**
* Returns the number of elements in the dictionary.
*
* @returns Number of elements.
*/
size_t Dictionary::GetLength() const
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
return m_Data.size();
}
/**
* Checks whether the dictionary contains the specified key.
*
* @param key The key.
* @returns true if the dictionary contains the key, false otherwise.
*/
bool Dictionary::Contains(const String& key) const
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
return (m_Data.find(key) != m_Data.end());
}
/**
* Returns an iterator to the beginning of the dictionary.
*
* Note: Caller must hold the object lock while using the iterator.
*
* @returns An iterator.
*/
Dictionary::Iterator Dictionary::Begin()
{
ASSERT(OwnsLock());
return m_Data.begin();
}
/**
* Returns an iterator to the end of the dictionary.
*
* Note: Caller must hold the object lock while using the iterator.
*
* @returns An iterator.
*/
Dictionary::Iterator Dictionary::End()
{
ASSERT(OwnsLock());
return m_Data.end();
}
/**
* Removes the item specified by the iterator from the dictionary.
*
* @param it The iterator.
*/
void Dictionary::Remove(Dictionary::Iterator it)
{
ASSERT(OwnsLock());
std::unique_lock<std::shared_timed_mutex> lock (m_DataMutex);
if (m_Frozen)
BOOST_THROW_EXCEPTION(std::invalid_argument("Dictionary must not be modified."));
m_Data.erase(it);
}
/**
* Removes the specified key from the dictionary.
*
* @param key The key.
*/
void Dictionary::Remove(const String& key)
{
ObjectLock olock(this);
std::unique_lock<std::shared_timed_mutex> lock (m_DataMutex);
if (m_Frozen)
BOOST_THROW_EXCEPTION(std::invalid_argument("Dictionary must not be modified."));
Dictionary::Iterator it;
it = m_Data.find(key);
if (it == m_Data.end())
return;
m_Data.erase(it);
}
/**
* Removes all dictionary items.
*/
void Dictionary::Clear()
{
ObjectLock olock(this);
std::unique_lock<std::shared_timed_mutex> lock (m_DataMutex);
if (m_Frozen)
BOOST_THROW_EXCEPTION(std::invalid_argument("Dictionary must not be modified."));
m_Data.clear();
}
void Dictionary::CopyTo(const Dictionary::Ptr& dest) const
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
for (const Dictionary::Pair& kv : m_Data) {
dest->Set(kv.first, kv.second);
}
}
/**
* Makes a shallow copy of a dictionary.
*
* @returns a copy of the dictionary.
*/
Dictionary::Ptr Dictionary::ShallowClone() const
{
Dictionary::Ptr clone = new Dictionary();
CopyTo(clone);
return clone;
}
/**
* Makes a deep clone of a dictionary
* and its elements.
*
* @returns a copy of the dictionary.
*/
Object::Ptr Dictionary::Clone() const
{
DictionaryData dict;
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
dict.reserve(GetLength());
for (const Dictionary::Pair& kv : m_Data) {
dict.emplace_back(kv.first, kv.second.Clone());
}
}
return new Dictionary(std::move(dict));
}
/**
* Returns an ordered vector containing all keys
* which are currently set in this directory.
*
* @returns an ordered vector of key names
*/
std::vector<String> Dictionary::GetKeys() const
{
std::shared_lock<std::shared_timed_mutex> lock (m_DataMutex);
std::vector<String> keys;
for (const Dictionary::Pair& kv : m_Data) {
keys.push_back(kv.first);
}
return keys;
}
String Dictionary::ToString() const
{
std::ostringstream msgbuf;
ConfigWriter::EmitScope(msgbuf, 1, const_cast<Dictionary *>(this));
return msgbuf.str();
}
void Dictionary::Freeze()
{
ObjectLock olock(this);
m_Frozen = true;
}
Value Dictionary::GetFieldByName(const String& field, bool, const DebugInfo& debugInfo) const
{
Value value;
if (Get(field, &value))
return value;
else
return GetPrototypeField(const_cast<Dictionary *>(this), field, false, debugInfo);
}
void Dictionary::SetFieldByName(const String& field, const Value& value, bool overrideFrozen, const DebugInfo&)
{
Set(field, value, overrideFrozen);
}
bool Dictionary::HasOwnField(const String& field) const
{
return Contains(field);
}
bool Dictionary::GetOwnField(const String& field, Value *result) const
{
return Get(field, result);
}
Dictionary::Iterator icinga::begin(const Dictionary::Ptr& x)
{
return x->Begin();
}
Dictionary::Iterator icinga::end(const Dictionary::Ptr& x)
{
return x->End();
}
|