1 #ifndef UTIL_STRING_PIECE_HASH_H
2 #define UTIL_STRING_PIECE_HASH_H
3
4 #include "util/have.hh"
5 #include "util/string_piece.hh"
6
7 #include <boost/functional/hash.hpp>
8 #include <boost/version.hpp>
9
10 #ifdef HAVE_ICU
11 U_NAMESPACE_BEGIN
12 #endif
13
hash_value(const StringPiece & str)14 inline size_t hash_value(const StringPiece &str) {
15 return boost::hash_range(str.data(), str.data() + str.length());
16 }
17
18 #ifdef HAVE_ICU
19 U_NAMESPACE_END
20 #endif
21
22 /* Support for lookup of StringPiece in boost::unordered_map<std::string> */
23 struct StringPieceCompatibleHash : public std::unary_function<const StringPiece &, size_t> {
operator ()StringPieceCompatibleHash24 size_t operator()(const StringPiece &str) const {
25 return hash_value(str);
26 }
27 };
28
29 struct StringPieceCompatibleEquals : public std::binary_function<const StringPiece &, const std::string &, bool> {
operator ()StringPieceCompatibleEquals30 bool operator()(const StringPiece &first, const StringPiece &second) const {
31 return first == second;
32 }
33 };
FindStringPiece(const T & t,const StringPiece & key)34 template <class T> typename T::const_iterator FindStringPiece(const T &t, const StringPiece &key) {
35 #if BOOST_VERSION < 104200
36 std::string temp(key.data(), key.size());
37 return t.find(temp);
38 #else
39 return t.find(key, StringPieceCompatibleHash(), StringPieceCompatibleEquals());
40 #endif
41 }
42
FindStringPiece(T & t,const StringPiece & key)43 template <class T> typename T::iterator FindStringPiece(T &t, const StringPiece &key) {
44 #if BOOST_VERSION < 104200
45 std::string temp(key.data(), key.size());
46 return t.find(temp);
47 #else
48 return t.find(key, StringPieceCompatibleHash(), StringPieceCompatibleEquals());
49 #endif
50 }
51
52 #endif // UTIL_STRING_PIECE_HASH_H
53