mirror of
https://github.com/ETLCPP/etl.git
synced 2026-05-01 03:19:10 +08:00
120 lines
4.4 KiB
C++
120 lines
4.4 KiB
C++
///\file
|
|
|
|
/******************************************************************************
|
|
The MIT License(MIT)
|
|
|
|
Embedded Template Library.
|
|
https://github.com/ETLCPP/etl
|
|
http://www.etlcpp.com
|
|
|
|
Copyright(c) 2016 jwellbelove
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files(the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions :
|
|
|
|
The above copyright notice and this permission notice shall be included in all
|
|
copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
SOFTWARE.
|
|
******************************************************************************/
|
|
|
|
#ifndef __ETL_UNORDERED_MAP__
|
|
#define __ETL_UNORDERED_MAP__
|
|
|
|
#include <stddef.h>
|
|
#include <iterator>
|
|
#include <functional>
|
|
|
|
#include "iunordered_map.h"
|
|
#include "container.h"
|
|
#include "pool.h"
|
|
#include "vector.h"
|
|
#include "basic_intrusive_forward_list.h"
|
|
#include "hash.h"
|
|
|
|
//*****************************************************************************
|
|
///\defgroup unordered_map unordered_map
|
|
/// A unordered_map with the capacity defined at compile time.
|
|
///\ingroup containers
|
|
//*****************************************************************************
|
|
|
|
namespace etl
|
|
{
|
|
//*************************************************************************
|
|
/// A templated unordered_map implementation that uses a fixed size buffer.
|
|
//*************************************************************************
|
|
template <typename TKey, typename TValue, const size_t MAX_SIZE_, typename THash = etl::hash<TKey>, typename TKeyEqual = std::equal_to<TKey> >
|
|
class unordered_map : public iunordered_map<TKey, TValue, THash, TKeyEqual>
|
|
{
|
|
public:
|
|
|
|
static const size_t MAX_SIZE = MAX_SIZE_;
|
|
|
|
//*************************************************************************
|
|
/// Default constructor.
|
|
//*************************************************************************
|
|
unordered_map()
|
|
: iunordered_map<TKey, TValue, THash, TKeyEqual>(node_pool, buckets)
|
|
{
|
|
iunordered_map<TKey, TValue, THash, TKeyEqual>::initialise();
|
|
}
|
|
|
|
//*************************************************************************
|
|
/// Copy constructor.
|
|
//*************************************************************************
|
|
unordered_map(const unordered_map& other)
|
|
: iunordered_map<TKey, TValue, THash, TKeyEqual>(node_pool, buckets)
|
|
{
|
|
iunordered_map<TKey, TValue, THash, TKeyEqual>::assign(other.cbegin(), other.cend());
|
|
}
|
|
|
|
//*************************************************************************
|
|
/// Constructor, from an iterator range.
|
|
///\tparam TIterator The iterator type.
|
|
///\param first The iterator to the first element.
|
|
///\param last The iterator to the last element + 1.
|
|
//*************************************************************************
|
|
template <typename TIterator>
|
|
unordered_map(TIterator first, TIterator last)
|
|
: iunordered_map<TKey, TValue, THash, TKeyEqual>(node_pool, buckets)
|
|
{
|
|
iunordered_map<TKey, TValue, THash, TKeyEqual>::assign(first, last);
|
|
}
|
|
|
|
//*************************************************************************
|
|
/// Assignment operator.
|
|
//*************************************************************************
|
|
unordered_map& operator = (const unordered_map& rhs)
|
|
{
|
|
// Skip if doing self assignment
|
|
if (this != &rhs)
|
|
{
|
|
iunordered_map<TKey, TValue, THash, TKeyEqual>::assign(rhs.cbegin(), rhs.cend());
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
private:
|
|
|
|
/// The pool of nodes used for the unordered_map.
|
|
etl::pool<typename iunordered_map<TKey, TValue, THash, TKeyEqual>::node_t, MAX_SIZE> node_pool;
|
|
|
|
/// The buckets of node lists.
|
|
etl::vector<etl::basic_intrusive_forward_list, MAX_SIZE> buckets;
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|