40 lines
1.1 KiB
C++
40 lines
1.1 KiB
C++
/*
|
|
This file is part of Daydream Engine.
|
|
Copyright 2014 Adam Byléhn, Tobias Dahl, Simon Holmberg, Viktor Ljung
|
|
|
|
Daydream Engine is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
Daydream Engine is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with Daydream Engine. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef Util_UnorderedMapPair_h__
|
|
#define Util_UnorderedMapPair_h__
|
|
|
|
#include <boost/functional/hash.hpp>
|
|
|
|
namespace std
|
|
{
|
|
|
|
template<typename S, typename T> struct hash < pair<S, T> >
|
|
{
|
|
inline size_t operator()(const pair<S, T> & v) const
|
|
{
|
|
size_t seed = 0;
|
|
boost::hash_combine(seed, v.first);
|
|
boost::hash_combine(seed, v.second);
|
|
return seed;
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
#endif // Util_UnorderedMapPair_h__
|