2012-05-10 12:06:41 +02:00
|
|
|
/******************************************************************************
|
|
|
|
* Icinga 2 *
|
2015-01-22 12:00:23 +01:00
|
|
|
* Copyright (C) 2012-2015 Icinga Development Team (http://www.icinga.org) *
|
2012-05-10 12:06:41 +02:00
|
|
|
* *
|
|
|
|
* This program is free software; you can redistribute it and/or *
|
|
|
|
* modify it under the terms of the GNU General Public License *
|
|
|
|
* as published by the Free Software Foundation; either version 2 *
|
|
|
|
* of the License, or (at your option) any later version. *
|
|
|
|
* *
|
|
|
|
* This program is distributed in the hope that it will be useful, *
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
|
|
|
* GNU General Public License for more details. *
|
|
|
|
* *
|
|
|
|
* You should have received a copy of the GNU General Public License *
|
|
|
|
* along with this program; if not, write to the Free Software Foundation *
|
2012-05-11 13:33:57 +02:00
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. *
|
2012-05-10 12:06:41 +02:00
|
|
|
******************************************************************************/
|
|
|
|
|
2014-05-25 16:23:35 +02:00
|
|
|
#include "base/dictionary.hpp"
|
|
|
|
#include "base/objectlock.hpp"
|
|
|
|
#include "base/debug.hpp"
|
2014-10-31 08:49:14 +01:00
|
|
|
#include "base/primitivetype.hpp"
|
2013-03-16 21:18:53 +01:00
|
|
|
#include <boost/foreach.hpp>
|
2012-04-18 15:22:25 +02:00
|
|
|
|
|
|
|
using namespace icinga;
|
|
|
|
|
2014-12-12 15:19:23 +01:00
|
|
|
REGISTER_PRIMITIVE_TYPE(Dictionary, Dictionary::GetPrototype());
|
2014-10-31 08:49:14 +01:00
|
|
|
|
2012-08-02 09:38:08 +02:00
|
|
|
/**
|
2014-02-17 16:34:18 +01:00
|
|
|
* Retrieves a value from a dictionary.
|
2012-08-02 09:38:08 +02:00
|
|
|
*
|
|
|
|
* @param key The key whose value should be retrieved.
|
2012-08-06 12:03:38 +02:00
|
|
|
* @returns The value of an empty value if the key was not found.
|
2012-08-02 09:38:08 +02:00
|
|
|
*/
|
2015-03-31 10:39:02 +02:00
|
|
|
Value Dictionary::Get(const String& key) const
|
2012-08-02 09:38:08 +02:00
|
|
|
{
|
2013-03-07 16:00:10 +01:00
|
|
|
ASSERT(!OwnsLock());
|
2013-02-18 14:40:24 +01:00
|
|
|
ObjectLock olock(this);
|
|
|
|
|
2015-03-31 10:39:02 +02:00
|
|
|
std::map<String, Value>::const_iterator it = m_Data.find(key);
|
2012-08-02 09:38:08 +02:00
|
|
|
|
2015-03-31 10:39:02 +02:00
|
|
|
if (it == m_Data.end())
|
2012-08-03 13:19:55 +02:00
|
|
|
return Empty;
|
2012-08-02 09:38:08 +02:00
|
|
|
|
|
|
|
return it->second;
|
|
|
|
}
|
|
|
|
|
2015-03-31 11:45:38 +02:00
|
|
|
/**
|
|
|
|
* 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
|
|
|
|
{
|
|
|
|
ASSERT(!OwnsLock());
|
|
|
|
ObjectLock olock(this);
|
|
|
|
|
|
|
|
std::map<String, Value>::const_iterator it = m_Data.find(key);
|
|
|
|
|
|
|
|
if (it == m_Data.end())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
*result = it->second;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2012-08-02 09:38:08 +02:00
|
|
|
/**
|
|
|
|
* Sets a value in the dictionary.
|
|
|
|
*
|
|
|
|
* @param key The key.
|
|
|
|
* @param value The value.
|
|
|
|
*/
|
|
|
|
void Dictionary::Set(const String& key, const Value& value)
|
|
|
|
{
|
2013-03-07 16:00:10 +01:00
|
|
|
ASSERT(!OwnsLock());
|
2013-03-04 15:52:42 +01:00
|
|
|
ObjectLock olock(this);
|
|
|
|
|
2013-03-16 21:18:53 +01:00
|
|
|
std::pair<std::map<String, Value>::iterator, bool> ret;
|
|
|
|
ret = m_Data.insert(std::make_pair(key, value));
|
2012-08-02 09:38:08 +02:00
|
|
|
if (!ret.second)
|
|
|
|
ret.first->second = value;
|
|
|
|
}
|
|
|
|
|
2012-04-30 15:30:45 +02:00
|
|
|
|
2012-05-08 15:14:20 +02:00
|
|
|
/**
|
|
|
|
* Returns the number of elements in the dictionary.
|
|
|
|
*
|
|
|
|
* @returns Number of elements.
|
|
|
|
*/
|
2012-08-08 08:34:15 +02:00
|
|
|
size_t Dictionary::GetLength(void) const
|
2012-04-30 15:30:45 +02:00
|
|
|
{
|
2013-03-07 16:00:10 +01:00
|
|
|
ASSERT(!OwnsLock());
|
2013-02-18 14:40:24 +01:00
|
|
|
ObjectLock olock(this);
|
|
|
|
|
2012-04-30 15:30:45 +02:00
|
|
|
return m_Data.size();
|
|
|
|
}
|
2012-06-14 11:18:20 +02:00
|
|
|
|
2012-06-17 16:37:36 +02:00
|
|
|
/**
|
|
|
|
* Checks whether the dictionary contains the specified key.
|
|
|
|
*
|
|
|
|
* @param key The key.
|
|
|
|
* @returns true if the dictionary contains the key, false otherwise.
|
|
|
|
*/
|
2012-08-02 09:38:08 +02:00
|
|
|
bool Dictionary::Contains(const String& key) const
|
2012-06-14 11:18:20 +02:00
|
|
|
{
|
2013-03-07 16:00:10 +01:00
|
|
|
ASSERT(!OwnsLock());
|
2013-02-18 14:40:24 +01:00
|
|
|
ObjectLock olock(this);
|
|
|
|
|
2012-06-14 11:18:20 +02:00
|
|
|
return (m_Data.find(key) != m_Data.end());
|
|
|
|
}
|
2012-07-09 10:09:53 +02:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Removes the specified key from the dictionary.
|
|
|
|
*
|
|
|
|
* @param key The key.
|
|
|
|
*/
|
2012-08-02 09:38:08 +02:00
|
|
|
void Dictionary::Remove(const String& key)
|
2012-07-09 10:09:53 +02:00
|
|
|
{
|
2013-03-07 16:00:10 +01:00
|
|
|
ASSERT(!OwnsLock());
|
2013-02-18 14:40:24 +01:00
|
|
|
ObjectLock olock(this);
|
|
|
|
|
2012-07-09 10:09:53 +02:00
|
|
|
Dictionary::Iterator it;
|
|
|
|
it = m_Data.find(key);
|
|
|
|
|
|
|
|
if (it == m_Data.end())
|
|
|
|
return;
|
|
|
|
|
|
|
|
m_Data.erase(it);
|
2012-08-02 09:38:08 +02:00
|
|
|
}
|
|
|
|
|
2015-03-05 20:50:27 +01:00
|
|
|
/**
|
|
|
|
* Removes all dictionary items.
|
|
|
|
*/
|
|
|
|
void Dictionary::Clear(void)
|
|
|
|
{
|
|
|
|
ASSERT(!OwnsLock());
|
|
|
|
ObjectLock olock(this);
|
|
|
|
|
|
|
|
m_Data.clear();
|
|
|
|
}
|
|
|
|
|
2014-03-20 13:02:02 +01:00
|
|
|
void Dictionary::CopyTo(const Dictionary::Ptr& dest) const
|
|
|
|
{
|
|
|
|
ASSERT(!OwnsLock());
|
|
|
|
ObjectLock olock(this);
|
|
|
|
|
|
|
|
BOOST_FOREACH(const Dictionary::Pair& kv, m_Data) {
|
|
|
|
dest->Set(kv.first, kv.second);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-09-03 10:28:14 +02:00
|
|
|
/**
|
|
|
|
* Makes a shallow copy of a dictionary.
|
|
|
|
*
|
|
|
|
* @returns a copy of the dictionary.
|
|
|
|
*/
|
|
|
|
Dictionary::Ptr Dictionary::ShallowClone(void) const
|
|
|
|
{
|
2014-11-08 21:17:16 +01:00
|
|
|
Dictionary::Ptr clone = new Dictionary();
|
2014-03-20 13:02:02 +01:00
|
|
|
CopyTo(clone);
|
2012-09-03 10:28:14 +02:00
|
|
|
return clone;
|
|
|
|
}
|
2015-01-29 12:38:25 +01:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns an array containing all keys
|
|
|
|
* which are currently set in this directory.
|
|
|
|
*
|
|
|
|
* @returns an array of key names
|
|
|
|
*/
|
|
|
|
std::vector<String> Dictionary::GetKeys(void) const
|
|
|
|
{
|
|
|
|
ASSERT(!OwnsLock());
|
|
|
|
ObjectLock olock(this);
|
|
|
|
|
|
|
|
std::vector<String> keys;
|
|
|
|
|
|
|
|
BOOST_FOREACH(const Dictionary::Pair& kv, m_Data) {
|
|
|
|
keys.push_back(kv.first);
|
|
|
|
}
|
|
|
|
|
|
|
|
return keys;
|
|
|
|
}
|