123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401 |
- /****************************************************************************
- **
- ** https://www.qxorm.com/
- ** Copyright (C) 2013 Lionel Marty (contact@qxorm.com)
- **
- ** This file is part of the QxOrm library
- **
- ** This software is provided 'as-is', without any express or implied
- ** warranty. In no event will the authors be held liable for any
- ** damages arising from the use of this software
- **
- ** Commercial Usage
- ** Licensees holding valid commercial QxOrm licenses may use this file in
- ** accordance with the commercial license agreement provided with the
- ** Software or, alternatively, in accordance with the terms contained in
- ** a written agreement between you and Lionel Marty
- **
- ** GNU General Public License Usage
- ** Alternatively, this file may be used under the terms of the GNU
- ** General Public License version 3.0 as published by the Free Software
- ** Foundation and appearing in the file 'license.gpl3.txt' included in the
- ** packaging of this file. Please review the following information to
- ** ensure the GNU General Public License version 3.0 requirements will be
- ** met : http://www.gnu.org/copyleft/gpl.html
- **
- ** If you are unsure which license is appropriate for your use, or
- ** if you have questions regarding the use of this file, please contact :
- ** contact@qxorm.com
- **
- ****************************************************************************/
- #ifndef _QX_HASH_VALUE_H_
- #define _QX_HASH_VALUE_H_
- #ifdef _MSC_VER
- #pragma once
- #endif
- /*!
- * \file QxHashValue.h
- * \author Lionel Marty
- * \ingroup QxCommon
- * \brief Specialize hash_value function for some Qt and boost types (used for example by qx::QxCollection<Key, Value> container)
- */
- #include <QtCore/qstring.h>
- #include <QtCore/qdatetime.h>
- #include <QtCore/qvariant.h>
- #include <QtCore/qpair.h>
- inline std::size_t hash_value(const QString & s) { return qHash(s); }
- inline std::size_t hash_value(const QDate & d) { return qHash(d.toJulianDay()); }
- inline std::size_t hash_value(const QTime & t) { return qHash(t.toString()); }
- inline std::size_t hash_value(const QDateTime & dt) { return qHash(dt.toString()); }
- inline std::size_t hash_value(const QVariant & v) { return qHash(v.toString()); }
- inline uint qHash(const QDate & d) { return static_cast<uint>(hash_value(d)); }
- inline uint qHash(const QTime & t) { return static_cast<uint>(hash_value(t)); }
- inline uint qHash(const QDateTime & dt) { return static_cast<uint>(hash_value(dt)); }
- inline uint qHash(const QVariant & v) { return static_cast<uint>(hash_value(v)); }
- #ifndef QT_NO_STL
- inline uint qHash(const std::string & s) { QString tmp = QString::fromStdString(s); return qHash(tmp); }
- inline uint qHash(const std::wstring & s) { QString tmp = QString::fromStdWString(s); return qHash(tmp); }
- #else // QT_NO_STL
- inline uint qHash(const std::string & s) { QString tmp = QString::fromLatin1(s.data(), int(s.size())); return qHash(tmp); }
- inline uint qHash(const std::wstring & s) { qAssert(false); /* Need STL compatibility ! */ return 0; }
- #endif // QT_NO_STL
- namespace qx {
- template <class T>
- inline void hash_combine(std::size_t & seed, const T & t)
- { seed ^= qHash(t) + 0x9e3779b9 + (seed << 6) + (seed >> 2); }
- } // namespace qx
- template <typename T0, typename T1>
- inline std::size_t hash_value(const QPair<T0, T1> & p)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, p.first);
- qx::hash_combine(seed, p.second);
- return seed;
- }
- #ifdef _QX_ENABLE_BOOST
- namespace boost {
- namespace tuples {
- template <typename T0, typename T1>
- inline std::size_t hash_value(const boost::tuple<T0, T1> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- return seed;
- }
- template <typename T0, class T1, typename T2>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- qx::hash_combine(seed, boost::get<3>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- qx::hash_combine(seed, boost::get<3>(tu));
- qx::hash_combine(seed, boost::get<4>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- qx::hash_combine(seed, boost::get<3>(tu));
- qx::hash_combine(seed, boost::get<4>(tu));
- qx::hash_combine(seed, boost::get<5>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- qx::hash_combine(seed, boost::get<3>(tu));
- qx::hash_combine(seed, boost::get<4>(tu));
- qx::hash_combine(seed, boost::get<5>(tu));
- qx::hash_combine(seed, boost::get<6>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- qx::hash_combine(seed, boost::get<3>(tu));
- qx::hash_combine(seed, boost::get<4>(tu));
- qx::hash_combine(seed, boost::get<5>(tu));
- qx::hash_combine(seed, boost::get<6>(tu));
- qx::hash_combine(seed, boost::get<7>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- qx::hash_combine(seed, boost::get<3>(tu));
- qx::hash_combine(seed, boost::get<4>(tu));
- qx::hash_combine(seed, boost::get<5>(tu));
- qx::hash_combine(seed, boost::get<6>(tu));
- qx::hash_combine(seed, boost::get<7>(tu));
- qx::hash_combine(seed, boost::get<8>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
- inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, boost::get<0>(tu));
- qx::hash_combine(seed, boost::get<1>(tu));
- qx::hash_combine(seed, boost::get<2>(tu));
- qx::hash_combine(seed, boost::get<3>(tu));
- qx::hash_combine(seed, boost::get<4>(tu));
- qx::hash_combine(seed, boost::get<5>(tu));
- qx::hash_combine(seed, boost::get<6>(tu));
- qx::hash_combine(seed, boost::get<7>(tu));
- qx::hash_combine(seed, boost::get<8>(tu));
- qx::hash_combine(seed, boost::get<9>(tu));
- return seed;
- }
- } // namespace tuples
- } // namespace boost
- template <typename T0, typename T1>
- inline uint qHash(const boost::tuple<T0, T1> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, class T1, typename T2>
- inline uint qHash(const boost::tuple<T0, T1, T2> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3>
- inline uint qHash(const boost::tuple<T0, T1, T2, T3> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4>
- inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
- inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
- inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
- inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
- inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
- inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- #endif // _QX_ENABLE_BOOST
- template <typename T0, typename T1>
- inline std::size_t hash_value(const std::tuple<T0, T1> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- return seed;
- }
- template <typename T0, class T1, typename T2>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- qx::hash_combine(seed, std::get<3>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- qx::hash_combine(seed, std::get<3>(tu));
- qx::hash_combine(seed, std::get<4>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- qx::hash_combine(seed, std::get<3>(tu));
- qx::hash_combine(seed, std::get<4>(tu));
- qx::hash_combine(seed, std::get<5>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- qx::hash_combine(seed, std::get<3>(tu));
- qx::hash_combine(seed, std::get<4>(tu));
- qx::hash_combine(seed, std::get<5>(tu));
- qx::hash_combine(seed, std::get<6>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- qx::hash_combine(seed, std::get<3>(tu));
- qx::hash_combine(seed, std::get<4>(tu));
- qx::hash_combine(seed, std::get<5>(tu));
- qx::hash_combine(seed, std::get<6>(tu));
- qx::hash_combine(seed, std::get<7>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- qx::hash_combine(seed, std::get<3>(tu));
- qx::hash_combine(seed, std::get<4>(tu));
- qx::hash_combine(seed, std::get<5>(tu));
- qx::hash_combine(seed, std::get<6>(tu));
- qx::hash_combine(seed, std::get<7>(tu));
- qx::hash_combine(seed, std::get<8>(tu));
- return seed;
- }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
- inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
- {
- std::size_t seed = 0;
- qx::hash_combine(seed, std::get<0>(tu));
- qx::hash_combine(seed, std::get<1>(tu));
- qx::hash_combine(seed, std::get<2>(tu));
- qx::hash_combine(seed, std::get<3>(tu));
- qx::hash_combine(seed, std::get<4>(tu));
- qx::hash_combine(seed, std::get<5>(tu));
- qx::hash_combine(seed, std::get<6>(tu));
- qx::hash_combine(seed, std::get<7>(tu));
- qx::hash_combine(seed, std::get<8>(tu));
- qx::hash_combine(seed, std::get<9>(tu));
- return seed;
- }
- template <typename T0, typename T1>
- inline uint qHash(const std::tuple<T0, T1> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, class T1, typename T2>
- inline uint qHash(const std::tuple<T0, T1, T2> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3>
- inline uint qHash(const std::tuple<T0, T1, T2, T3> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4>
- inline uint qHash(const std::tuple<T0, T1, T2, T3, T4> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
- inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
- inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
- inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
- inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
- inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
- { return static_cast<uint>(hash_value(tu)); }
- #endif // _QX_HASH_VALUE_H_
|