2012-05-10 12:06:41 +02:00
|
|
|
/******************************************************************************
|
|
|
|
* Icinga 2 *
|
|
|
|
* Copyright (C) 2012 Icinga Development Team (http://www.icinga.org/) *
|
|
|
|
* *
|
|
|
|
* 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
|
|
|
******************************************************************************/
|
|
|
|
|
2012-04-18 15:22:25 +02:00
|
|
|
#include "i2-base.h"
|
2012-07-24 10:50:53 +02:00
|
|
|
#include <cJSON.h>
|
2012-04-18 15:22:25 +02:00
|
|
|
|
|
|
|
using namespace icinga;
|
|
|
|
|
2012-09-14 14:41:17 +02:00
|
|
|
/**
|
2012-09-19 12:32:39 +02:00
|
|
|
* Compares dictionary keys using the less operator.
|
2012-09-14 14:41:17 +02:00
|
|
|
*/
|
2012-08-06 12:03:38 +02:00
|
|
|
struct DictionaryKeyLessComparer
|
|
|
|
{
|
2012-09-19 12:32:39 +02:00
|
|
|
/**
|
|
|
|
* Compares two keys.
|
|
|
|
*
|
|
|
|
* @param a The first key.
|
|
|
|
* @param b The second key.
|
|
|
|
* @returns true if the first key is less than the second key, false
|
|
|
|
* otherwise
|
|
|
|
*/
|
2012-08-06 12:03:38 +02:00
|
|
|
bool operator()(const pair<String, Value>& a, const char *b)
|
|
|
|
{
|
|
|
|
return a.first < b;
|
|
|
|
}
|
|
|
|
|
2012-09-19 12:32:39 +02:00
|
|
|
/**
|
|
|
|
* Compares two keys.
|
|
|
|
*
|
|
|
|
* @param a The first key.
|
|
|
|
* @param b The second key.
|
|
|
|
* @returns true if the first key is less than the second key, false
|
|
|
|
* otherwise
|
|
|
|
*/
|
2012-08-06 12:03:38 +02:00
|
|
|
bool operator()(const char *a, const pair<String, Value>& b)
|
|
|
|
{
|
|
|
|
return a < b.first;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2012-08-02 09:38:08 +02:00
|
|
|
/**
|
2012-08-06 12:03:38 +02:00
|
|
|
* Restrieves 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
|
|
|
*/
|
2012-08-06 12:03:38 +02:00
|
|
|
Value Dictionary::Get(const char *key) const
|
2012-08-02 09:38:08 +02:00
|
|
|
{
|
|
|
|
map<String, Value>::const_iterator it;
|
|
|
|
|
2012-08-06 12:03:38 +02:00
|
|
|
it = std::lower_bound(m_Data.begin(), m_Data.end(), key, DictionaryKeyLessComparer());
|
|
|
|
|
|
|
|
if (it == m_Data.end() || DictionaryKeyLessComparer()(key, *it))
|
2012-08-03 13:19:55 +02:00
|
|
|
return Empty;
|
2012-08-02 09:38:08 +02:00
|
|
|
|
|
|
|
return it->second;
|
|
|
|
}
|
|
|
|
|
2012-08-06 12:03:38 +02:00
|
|
|
/**
|
|
|
|
* Retrieves a value from the dictionary.
|
|
|
|
*
|
|
|
|
* @param key The key whose value should be retrieved.
|
|
|
|
* @returns The value or an empty value if the key was not found.
|
|
|
|
*/
|
|
|
|
Value Dictionary::Get(const String& key) const
|
|
|
|
{
|
|
|
|
return Get(key.CStr());
|
|
|
|
}
|
|
|
|
|
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)
|
|
|
|
{
|
|
|
|
if (value.IsEmpty()) {
|
|
|
|
Remove(key);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
pair<map<String, Value>::iterator, bool> ret;
|
|
|
|
ret = m_Data.insert(make_pair(key, value));
|
|
|
|
if (!ret.second)
|
|
|
|
ret.first->second = value;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Adds an unnamed value to the dictionary.
|
|
|
|
*
|
|
|
|
* @param value The value.
|
|
|
|
* @returns The key that was used to add the new item.
|
|
|
|
*/
|
|
|
|
String Dictionary::Add(const Value& value)
|
|
|
|
{
|
|
|
|
Dictionary::Iterator it;
|
|
|
|
String key;
|
|
|
|
long index = GetLength();
|
|
|
|
do {
|
|
|
|
stringstream s;
|
2013-02-07 09:36:17 +01:00
|
|
|
s << "_" << std::hex << std::setw(8) << std::setfill('0') << index;
|
2012-08-02 09:38:08 +02:00
|
|
|
index++;
|
|
|
|
|
|
|
|
key = s.str();
|
|
|
|
it = m_Data.find(key);
|
|
|
|
} while (it != m_Data.end());
|
|
|
|
|
|
|
|
Set(key, value);
|
|
|
|
return key;
|
|
|
|
}
|
|
|
|
|
2012-05-08 15:14:20 +02:00
|
|
|
/**
|
|
|
|
* Returns an iterator to the beginning of the dictionary.
|
|
|
|
*
|
|
|
|
* @returns An iterator.
|
|
|
|
*/
|
2012-06-30 15:22:51 +02:00
|
|
|
Dictionary::Iterator Dictionary::Begin(void)
|
2012-04-18 15:22:25 +02:00
|
|
|
{
|
|
|
|
return m_Data.begin();
|
|
|
|
}
|
|
|
|
|
2012-05-08 15:14:20 +02:00
|
|
|
/**
|
|
|
|
* Returns an iterator to the end of the dictionary.
|
|
|
|
*
|
|
|
|
* @returns An iterator.
|
|
|
|
*/
|
2012-06-30 15:22:51 +02:00
|
|
|
Dictionary::Iterator Dictionary::End(void)
|
2012-04-18 15:22:25 +02:00
|
|
|
{
|
|
|
|
return m_Data.end();
|
|
|
|
}
|
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
|
|
|
{
|
|
|
|
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
|
|
|
{
|
|
|
|
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
|
|
|
{
|
|
|
|
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
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Removes the item specified by the iterator from the dictionary.
|
|
|
|
*
|
|
|
|
* @param it The iterator.
|
|
|
|
*/
|
|
|
|
void Dictionary::Remove(Dictionary::Iterator it)
|
|
|
|
{
|
|
|
|
String key = it->first;
|
|
|
|
m_Data.erase(it);
|
2012-07-09 10:09:53 +02:00
|
|
|
}
|
2012-07-24 10:50:53 +02:00
|
|
|
|
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
|
|
|
|
{
|
|
|
|
Dictionary::Ptr clone = boost::make_shared<Dictionary>();
|
|
|
|
|
|
|
|
String key;
|
|
|
|
Value value;
|
|
|
|
BOOST_FOREACH(tie(key, value), m_Data) {
|
|
|
|
clone->Set(key, value);
|
|
|
|
}
|
|
|
|
|
|
|
|
return clone;
|
|
|
|
}
|
|
|
|
|
2012-07-24 10:50:53 +02:00
|
|
|
/**
|
|
|
|
* Converts a JSON object to a dictionary.
|
|
|
|
*
|
|
|
|
* @param json The JSON object.
|
|
|
|
* @returns A dictionary that is equivalent to the JSON object.
|
|
|
|
*/
|
|
|
|
Dictionary::Ptr Dictionary::FromJson(cJSON *json)
|
|
|
|
{
|
|
|
|
Dictionary::Ptr dictionary = boost::make_shared<Dictionary>();
|
|
|
|
|
|
|
|
if (json->type != cJSON_Object)
|
2013-02-06 12:51:12 +01:00
|
|
|
BOOST_THROW_EXCEPTION(invalid_argument("JSON type must be cJSON_Object."));
|
2012-07-24 10:50:53 +02:00
|
|
|
|
|
|
|
for (cJSON *i = json->child; i != NULL; i = i->next) {
|
2012-08-02 09:38:08 +02:00
|
|
|
dictionary->Set(i->string, Value::FromJson(i));
|
2012-07-24 10:50:53 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
return dictionary;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2012-09-17 13:35:55 +02:00
|
|
|
* Converts this dictionary to a JSON object.
|
2012-07-24 10:50:53 +02:00
|
|
|
*
|
|
|
|
* @returns A JSON object that is equivalent to the dictionary. Values that
|
|
|
|
* cannot be represented in JSON are omitted.
|
|
|
|
*/
|
|
|
|
cJSON *Dictionary::ToJson(void) const
|
|
|
|
{
|
|
|
|
cJSON *json = cJSON_CreateObject();
|
|
|
|
|
|
|
|
try {
|
2012-08-02 09:38:08 +02:00
|
|
|
String key;
|
|
|
|
Value value;
|
2012-07-24 10:50:53 +02:00
|
|
|
BOOST_FOREACH(tie(key, value), m_Data) {
|
2012-08-02 09:38:08 +02:00
|
|
|
cJSON_AddItemToObject(json, key.CStr(), value.ToJson());
|
2012-07-24 10:50:53 +02:00
|
|
|
}
|
|
|
|
} catch (...) {
|
|
|
|
cJSON_Delete(json);
|
|
|
|
throw;
|
|
|
|
}
|
|
|
|
|
|
|
|
return json;
|
2012-07-24 15:38:04 +02:00
|
|
|
}
|