google::protobuf::hash< pair< First, Second > > Struct Template Reference

#include <hash.h>

Public Member Functions
size_t	operator() (const pair< First, Second > &key) const
size_t	operator() (const pair< First, Second > &a, const pair< First, Second > &b) const
size_t	operator() (const pair< First, Second > &key) const
size_t	operator() (const pair< First, Second > &a, const pair< First, Second > &b) const

Static Public Attributes
static const size_t	bucket_size = 4
static const size_t	min_buckets = 8

Member Function Documentation

template<typename First , typename Second >

size_t google::protobuf::hash< pair< First, Second > >::operator() ( const pair< First, Second > &  key ) const

inline

 {
 size_t first_hash = hash<First>()(key.first);
 size_t second_hash = hash<Second>()(key.second);

 // FIXME(kenton): What is the best way to compute this hash? I have
 // no idea! This seems a bit better than an XOR.
 return first_hash * ((1 << 16) - 1) + second_hash;
 }

template<typename First , typename Second >

size_t google::protobuf::hash< pair< First, Second > >::operator() ( const pair< First, Second > &  key ) const

inline

 {
 size_t first_hash = hash<First>()(key.first);
 size_t second_hash = hash<Second>()(key.second);

 // FIXME(kenton): What is the best way to compute this hash? I have
 // no idea! This seems a bit better than an XOR.
 return first_hash * ((1 << 16) - 1) + second_hash;
 }

template<typename First , typename Second >

size_t google::protobuf::hash< pair< First, Second > >::operator() ( const pair< First, Second > &  a, const pair< First, Second > &  b  ) const

inline

 {
 return a < b;
 }

template<typename First , typename Second >

size_t google::protobuf::hash< pair< First, Second > >::operator() ( const pair< First, Second > &  a, const pair< First, Second > &  b  ) const

inline

 {
 return a < b;
 }

Member Data Documentation

template<typename First , typename Second >

static const size_t google::protobuf::hash< pair< First, Second > >::bucket_size = 4

static

template<typename First , typename Second >

static const size_t google::protobuf::hash< pair< First, Second > >::min_buckets = 8

static

---

The documentation for this struct was generated from the following file:

• contrib/protoc-bnet/google/protobuf/stubs/hash.h