/****************************************************************************** * 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 * * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA. * ******************************************************************************/ #include "i2-base.h" #include using namespace icinga; /** * Compares dictionary keys using the less operator. */ struct DictionaryKeyLessComparer { /** * 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 */ bool operator()(const pair& a, const char *b) { return a.first < b; } /** * 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 */ bool operator()(const char *a, const pair& b) { return a < b.first; } }; /** * Constructor for the Dictionary class. */ Dictionary::Dictionary(void) : m_Sealed(false) { } /** * Restrieves 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. * @threadsafety Always. */ Value Dictionary::Get(const char *key) const { ObjectLock olock(this); map::const_iterator it; it = std::lower_bound(m_Data.begin(), m_Data.end(), key, DictionaryKeyLessComparer()); if (it == m_Data.end() || DictionaryKeyLessComparer()(key, *it)) return Empty; return it->second; } /** * 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. * @threadsafety Always. */ Value Dictionary::Get(const String& key) const { return Get(key.CStr()); } /** * Sets a value in the dictionary. * * @param key The key. * @param value The value. * @threadsafety Always. */ void Dictionary::Set(const String& key, const Value& value) { ObjectLock olock(this); assert(!m_Sealed); if (value.IsEmpty()) { Remove(key); return; } pair::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. * @threadsafety Always. */ String Dictionary::Add(const Value& value) { ObjectLock olock(this); Dictionary::Iterator it; String key; long index = GetLength(); do { stringstream s; s << "_" << std::hex << std::setw(8) << std::setfill('0') << index; index++; key = s.str(); it = m_Data.find(key); } while (it != m_Data.end()); Set(key, value); return key; } /** * Returns an iterator to the beginning of the dictionary. * * @returns An iterator. */ Dictionary::Iterator Dictionary::Begin(void) { return m_Data.begin(); } /** * Returns an iterator to the end of the dictionary. * * @returns An iterator. */ Dictionary::Iterator Dictionary::End(void) { return m_Data.end(); } /** * Returns the number of elements in the dictionary. * * @returns Number of elements. * @threadsafety Always. */ size_t Dictionary::GetLength(void) const { ObjectLock olock(this); 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. * @threadsafety Always. */ bool Dictionary::Contains(const String& key) const { ObjectLock olock(this); return (m_Data.find(key) != m_Data.end()); } /** * Removes the specified key from the dictionary. * * @param key The key. * @threadsafety Always. */ void Dictionary::Remove(const String& key) { ObjectLock olock(this); Dictionary::Iterator it; it = m_Data.find(key); if (it == m_Data.end()) return; m_Data.erase(it); } /** * 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); } /** * Marks the dictionary as read-only. Attempting to modify a sealed * dictionary is an error. */ void Dictionary::Seal(void) { m_Sealed = true; } /** * Makes a shallow copy of a dictionary. * * @returns a copy of the dictionary. * @threadsafety Always. */ Dictionary::Ptr Dictionary::ShallowClone(void) const { ObjectLock olock(this); Dictionary::Ptr clone = boost::make_shared(); String key; Value value; BOOST_FOREACH(tie(key, value), m_Data) { clone->Set(key, value); } return clone; } /** * Converts a JSON object to a dictionary. * * @param json The JSON object. * @returns A dictionary that is equivalent to the JSON object. * @threadsafety Always. */ Dictionary::Ptr Dictionary::FromJson(cJSON *json) { Dictionary::Ptr dictionary = boost::make_shared(); if (json->type != cJSON_Object) BOOST_THROW_EXCEPTION(invalid_argument("JSON type must be cJSON_Object.")); for (cJSON *i = json->child; i != NULL; i = i->next) { dictionary->Set(i->string, Value::FromJson(i)); } return dictionary; } /** * Converts this dictionary to a JSON object. * * @returns A JSON object that is equivalent to the dictionary. Values that * cannot be represented in JSON are omitted. * @threadsafety Always. */ cJSON *Dictionary::ToJson(void) const { cJSON *json = cJSON_CreateObject(); try { ObjectLock olock(this); String key; Value value; BOOST_FOREACH(tie(key, value), m_Data) { cJSON_AddItemToObject(json, key.CStr(), value.ToJson()); } } catch (...) { cJSON_Delete(json); throw; } return json; }