#if !defined( INCLUDED_CONTAINER_HASHTABLE_H )
#define INCLUDED_CONTAINER_HASHTABLE_H
+#include <unordered_map>
+
+template<typename Key, typename Value, typename Hasher, typename KeyEqual = std::equal_to<Key> >
+ using HashTable = std::unordered_map<Key, Value, Hasher, KeyEqual>;
+
+#if 0
#include <cstddef>
#include <algorithm>
#include <functional>
#include <memory>
#include "debugging/debugging.h"
-
namespace HashTableDetail
{
inline std::size_t next_power_of_two( std::size_t size ){
return 0;
}
- if ( nodeHash == hash && KeyEqual::operator()( ( *i ).key, key ) ) {
+ if ( nodeHash == hash && KeyEqual::operator()( ( *i ).first, key ) ) {
return i.node();
}
}
};
#endif
+
+#endif