30 lines
863 B
C++
30 lines
863 B
C++
#ifndef WRAP_UNORDERED_MAP_HPP
|
|
#define WRAP_UNORDERED_MAP_HPP
|
|
|
|
#include "two-mallocs.hpp"
|
|
#include <unordered_map>
|
|
|
|
namespace eng {
|
|
template<class T>
|
|
using hash = std::hash<T>;
|
|
template<class T>
|
|
using equal_to = std::equal_to<T>;
|
|
template<class A, class B>
|
|
using pair = std::pair<A, B>;
|
|
template<class K, class V, class H=std::hash<K>, class E=std::equal_to<K>>
|
|
using unordered_map = std::unordered_map<K, V, H, E, EngAllocator<std::pair<const K, V>>>;
|
|
} // namespace eng
|
|
|
|
namespace drv {
|
|
template<class T>
|
|
using hash = std::hash<T>;
|
|
template<class T>
|
|
using equal_to = std::equal_to<T>;
|
|
template<class A, class B>
|
|
using pair = std::pair<A, B>;
|
|
template<class K, class V, class H=std::hash<K>, class E=std::equal_to<K>>
|
|
using unordered_map = std::unordered_map<K, V, H, E, DrvAllocator<std::pair<const K, V>>>;
|
|
} // namespace drv
|
|
|
|
#endif // WRAP_UNORDERED_MAP_HPP
|