28#include <unordered_map>
39 return !strcmp( x, y );
51 std::size_t hash = 2166136261u;
55 hash ^= (
unsigned char) *it;
65#define DECL_HASH_FOR_SWIG( TypeName, KeyType, ValueType ) \
68 % template( TypeName ) unordered_map<KeyType, ValueType>; \
70 typedef std::unordered_map<KeyType, ValueType> TypeName;
73#define DECL_HASH_FOR_SWIG( TypeName, KeyType, ValueType ) \
74 typedef std::unordered_map<KeyType, ValueType> TypeName;
95typedef std::unordered_map< const char*, int, fnv_1a, iequal_to >
KEYWORD_MAP;
std::unordered_map< const char *, int, fnv_1a, iequal_to > KEYWORD_MAP
A hashtable made of a const char* and an int.
Very fast and efficient hash function for "const char*" type, used in specialized KEYWORD_MAP below.
std::size_t operator()(const char *it) const
Equality test for "const char*" type used in very specialized KEYWORD_MAP below.
bool operator()(const char *x, const char *y) const