67 lines
2.6 KiB
C++
67 lines
2.6 KiB
C++
/*
|
|
* (c) Copyright Ascensio System SIA 2010-2014
|
|
*
|
|
* This program is a free software product. You can redistribute it and/or
|
|
* modify it under the terms of the GNU Affero General Public License (AGPL)
|
|
* version 3 as published by the Free Software Foundation. In accordance with
|
|
* Section 7(a) of the GNU AGPL its Section 15 shall be amended to the effect
|
|
* that Ascensio System SIA expressly excludes the warranty of non-infringement
|
|
* of any third-party rights.
|
|
*
|
|
* This program is distributed WITHOUT ANY WARRANTY; without even the implied
|
|
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For
|
|
* details, see the GNU AGPL at: http://www.gnu.org/licenses/agpl-3.0.html
|
|
*
|
|
* You can contact Ascensio System SIA at Lubanas st. 125a-25, Riga, Latvia,
|
|
* EU, LV-1021.
|
|
*
|
|
* The interactive user interfaces in modified source and object code versions
|
|
* of the Program must display Appropriate Legal Notices, as required under
|
|
* Section 5 of the GNU AGPL version 3.
|
|
*
|
|
* Pursuant to Section 7(b) of the License you must retain the original Product
|
|
* logo when distributing the program. Pursuant to Section 7(e) we decline to
|
|
* grant you any rights under trademark law for use of our trademarks.
|
|
*
|
|
* All the Product's GUI elements, including illustrations and icon sets, as
|
|
* well as technical writing content are licensed under the terms of the
|
|
* Creative Commons Attribution-ShareAlike 4.0 International. See the License
|
|
* terms at http://creativecommons.org/licenses/by-sa/4.0/legalcode
|
|
*
|
|
*/
|
|
#pragma once
|
|
#ifndef IDICTONARY_INCLUDE_H_
|
|
#define IDICTONARY_INCLUDE_H_
|
|
|
|
#include <map>
|
|
|
|
|
|
template<typename Key, typename Value>
|
|
class IDictonary
|
|
{
|
|
public:
|
|
const size_t size() const {return m_container.size();}
|
|
void add(const Key& key, const Value& value) {m_container.insert(std::make_pair(key, value));}
|
|
const bool empty() const {return m_container.empty();}
|
|
|
|
public:
|
|
Value& operator [](const Key& key) {return m_container[key];}
|
|
const Value& operator [](const Key& key) const {return m_container[key];}
|
|
|
|
public:
|
|
typedef typename std::map<Key, Value>::iterator iterator;
|
|
typedef typename std::map<Key, Value>::const_iterator const_iterator;
|
|
|
|
public:
|
|
iterator begin() {return m_container.begin();}
|
|
iterator end() {return m_container.end();}
|
|
const_iterator begin() const {return m_container.begin();}
|
|
const_iterator end() const {return m_container.end();}
|
|
iterator find(const Key& key) {return m_container.find(key);}
|
|
const_iterator find(const Key& key) const {return m_container.find(key);}
|
|
|
|
protected:
|
|
std::map<Key, Value> m_container;
|
|
};
|
|
|
|
#endif // IDICTONARY_INCLUDE_H_
|