diff options
| author | Alex Zolotarev <alex@maps.me> | 2015-06-24 15:47:00 +0300 |
|---|---|---|
| committer | Alex Zolotarev <alex@maps.me> | 2015-09-23 02:52:33 +0300 |
| commit | a2bbe7a4e180b996e73e183d53bc05f22618fa21 (patch) | |
| tree | 3806d15f3450d9bfc8425991d17f5061bbc29c58 /search | |
| parent | d8eebb597792cc47564bb18d188be35232260506 (diff) | |
boost::hash -> std::hash
TODO: Should we improve current hash implementation/review do we really need unordered sets/maps?
Diffstat (limited to 'search')
| -rw-r--r-- | search/feature_offset_match.hpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/search/feature_offset_match.hpp b/search/feature_offset_match.hpp index 69748356b1..acbcebc6de 100644 --- a/search/feature_offset_match.hpp +++ b/search/feature_offset_match.hpp @@ -178,7 +178,7 @@ template <class FilterT> class OffsetIntersecter { size_t operator() (ValueT const & v) const { - return (boost::hash_value(v.m_featureId)); + return static_cast<size_t>(v.m_featureId); } }; struct EqualFn |