home/src/unordered_map.hh

#ifndef unordered_map_hh_INCLUDED
#define unordered_map_hh_INCLUDED

#include "hash.hh"
#include "memory.hh"

#include <unordered_map>

namespace Kakoune
{

template<typename Key, typename Value, MemoryDomain domain = MemoryDomain::Undefined>
using UnorderedMap = std::unordered_map<Key, Value, Hash<Key>, std::equal_to<Key>,
                                        Allocator<std::pair<const Key, Value>, domain>>;

}

#endif // unordered_map_hh_INCLUDED
Rework hashing, use a more extensible framework similar to n3876 proposal std::hash specialization is a pain to work with, stop using that, and just specialize a 'size_t hash_value(const T&)' free function. 2014-12-16 19:57:19 +01:00			`#ifndef unordered_map_hh_INCLUDED`
			`#define unordered_map_hh_INCLUDED`

			`#include "hash.hh"`
Add initial memory domain allocation tracking support 2015-01-07 20:29:31 +01:00			`#include "memory.hh"`
Rework hashing, use a more extensible framework similar to n3876 proposal std::hash specialization is a pain to work with, stop using that, and just specialize a 'size_t hash_value(const T&)' free function. 2014-12-16 19:57:19 +01:00
			`#include <unordered_map>`

			`namespace Kakoune`
			`{`

Add initial memory domain allocation tracking support 2015-01-07 20:29:31 +01:00			`template<typename Key, typename Value, MemoryDomain domain = MemoryDomain::Undefined>`
			`using UnorderedMap = std::unordered_map<Key, Value, Hash<Key>, std::equal_to<Key>,`
			`Allocator<std::pair<const Key, Value>, domain>>;`
Rework hashing, use a more extensible framework similar to n3876 proposal std::hash specialization is a pain to work with, stop using that, and just specialize a 'size_t hash_value(const T&)' free function. 2014-12-16 19:57:19 +01:00
			`}`

			`#endif // unordered_map_hh_INCLUDED`