QxHashValue.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401
  1. /****************************************************************************
  2. **
  3. ** https://www.qxorm.com/
  4. ** Copyright (C) 2013 Lionel Marty (contact@qxorm.com)
  5. **
  6. ** This file is part of the QxOrm library
  7. **
  8. ** This software is provided 'as-is', without any express or implied
  9. ** warranty. In no event will the authors be held liable for any
  10. ** damages arising from the use of this software
  11. **
  12. ** Commercial Usage
  13. ** Licensees holding valid commercial QxOrm licenses may use this file in
  14. ** accordance with the commercial license agreement provided with the
  15. ** Software or, alternatively, in accordance with the terms contained in
  16. ** a written agreement between you and Lionel Marty
  17. **
  18. ** GNU General Public License Usage
  19. ** Alternatively, this file may be used under the terms of the GNU
  20. ** General Public License version 3.0 as published by the Free Software
  21. ** Foundation and appearing in the file 'license.gpl3.txt' included in the
  22. ** packaging of this file. Please review the following information to
  23. ** ensure the GNU General Public License version 3.0 requirements will be
  24. ** met : http://www.gnu.org/copyleft/gpl.html
  25. **
  26. ** If you are unsure which license is appropriate for your use, or
  27. ** if you have questions regarding the use of this file, please contact :
  28. ** contact@qxorm.com
  29. **
  30. ****************************************************************************/
  31. #ifndef _QX_HASH_VALUE_H_
  32. #define _QX_HASH_VALUE_H_
  33. #ifdef _MSC_VER
  34. #pragma once
  35. #endif
  36. /*!
  37. * \file QxHashValue.h
  38. * \author Lionel Marty
  39. * \ingroup QxCommon
  40. * \brief Specialize hash_value function for some Qt and boost types (used for example by qx::QxCollection<Key, Value> container)
  41. */
  42. #include <QtCore/qstring.h>
  43. #include <QtCore/qdatetime.h>
  44. #include <QtCore/qvariant.h>
  45. #include <QtCore/qpair.h>
  46. inline std::size_t hash_value(const QString & s) { return qHash(s); }
  47. inline std::size_t hash_value(const QDate & d) { return qHash(d.toJulianDay()); }
  48. inline std::size_t hash_value(const QTime & t) { return qHash(t.toString()); }
  49. inline std::size_t hash_value(const QDateTime & dt) { return qHash(dt.toString()); }
  50. inline std::size_t hash_value(const QVariant & v) { return qHash(v.toString()); }
  51. inline uint qHash(const QDate & d) { return static_cast<uint>(hash_value(d)); }
  52. inline uint qHash(const QTime & t) { return static_cast<uint>(hash_value(t)); }
  53. inline uint qHash(const QDateTime & dt) { return static_cast<uint>(hash_value(dt)); }
  54. inline uint qHash(const QVariant & v) { return static_cast<uint>(hash_value(v)); }
  55. #ifndef QT_NO_STL
  56. inline uint qHash(const std::string & s) { QString tmp = QString::fromStdString(s); return qHash(tmp); }
  57. inline uint qHash(const std::wstring & s) { QString tmp = QString::fromStdWString(s); return qHash(tmp); }
  58. #else // QT_NO_STL
  59. inline uint qHash(const std::string & s) { QString tmp = QString::fromLatin1(s.data(), int(s.size())); return qHash(tmp); }
  60. inline uint qHash(const std::wstring & s) { qAssert(false); /* Need STL compatibility ! */ return 0; }
  61. #endif // QT_NO_STL
  62. namespace qx {
  63. template <class T>
  64. inline void hash_combine(std::size_t & seed, const T & t)
  65. { seed ^= qHash(t) + 0x9e3779b9 + (seed << 6) + (seed >> 2); }
  66. } // namespace qx
  67. template <typename T0, typename T1>
  68. inline std::size_t hash_value(const QPair<T0, T1> & p)
  69. {
  70. std::size_t seed = 0;
  71. qx::hash_combine(seed, p.first);
  72. qx::hash_combine(seed, p.second);
  73. return seed;
  74. }
  75. #ifdef _QX_ENABLE_BOOST
  76. namespace boost {
  77. namespace tuples {
  78. template <typename T0, typename T1>
  79. inline std::size_t hash_value(const boost::tuple<T0, T1> & tu)
  80. {
  81. std::size_t seed = 0;
  82. qx::hash_combine(seed, boost::get<0>(tu));
  83. qx::hash_combine(seed, boost::get<1>(tu));
  84. return seed;
  85. }
  86. template <typename T0, class T1, typename T2>
  87. inline std::size_t hash_value(const boost::tuple<T0, T1, T2> & tu)
  88. {
  89. std::size_t seed = 0;
  90. qx::hash_combine(seed, boost::get<0>(tu));
  91. qx::hash_combine(seed, boost::get<1>(tu));
  92. qx::hash_combine(seed, boost::get<2>(tu));
  93. return seed;
  94. }
  95. template <typename T0, typename T1, typename T2, typename T3>
  96. inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3> & tu)
  97. {
  98. std::size_t seed = 0;
  99. qx::hash_combine(seed, boost::get<0>(tu));
  100. qx::hash_combine(seed, boost::get<1>(tu));
  101. qx::hash_combine(seed, boost::get<2>(tu));
  102. qx::hash_combine(seed, boost::get<3>(tu));
  103. return seed;
  104. }
  105. template <typename T0, typename T1, typename T2, typename T3, typename T4>
  106. inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4> & tu)
  107. {
  108. std::size_t seed = 0;
  109. qx::hash_combine(seed, boost::get<0>(tu));
  110. qx::hash_combine(seed, boost::get<1>(tu));
  111. qx::hash_combine(seed, boost::get<2>(tu));
  112. qx::hash_combine(seed, boost::get<3>(tu));
  113. qx::hash_combine(seed, boost::get<4>(tu));
  114. return seed;
  115. }
  116. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
  117. inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5> & tu)
  118. {
  119. std::size_t seed = 0;
  120. qx::hash_combine(seed, boost::get<0>(tu));
  121. qx::hash_combine(seed, boost::get<1>(tu));
  122. qx::hash_combine(seed, boost::get<2>(tu));
  123. qx::hash_combine(seed, boost::get<3>(tu));
  124. qx::hash_combine(seed, boost::get<4>(tu));
  125. qx::hash_combine(seed, boost::get<5>(tu));
  126. return seed;
  127. }
  128. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
  129. inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
  130. {
  131. std::size_t seed = 0;
  132. qx::hash_combine(seed, boost::get<0>(tu));
  133. qx::hash_combine(seed, boost::get<1>(tu));
  134. qx::hash_combine(seed, boost::get<2>(tu));
  135. qx::hash_combine(seed, boost::get<3>(tu));
  136. qx::hash_combine(seed, boost::get<4>(tu));
  137. qx::hash_combine(seed, boost::get<5>(tu));
  138. qx::hash_combine(seed, boost::get<6>(tu));
  139. return seed;
  140. }
  141. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
  142. inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
  143. {
  144. std::size_t seed = 0;
  145. qx::hash_combine(seed, boost::get<0>(tu));
  146. qx::hash_combine(seed, boost::get<1>(tu));
  147. qx::hash_combine(seed, boost::get<2>(tu));
  148. qx::hash_combine(seed, boost::get<3>(tu));
  149. qx::hash_combine(seed, boost::get<4>(tu));
  150. qx::hash_combine(seed, boost::get<5>(tu));
  151. qx::hash_combine(seed, boost::get<6>(tu));
  152. qx::hash_combine(seed, boost::get<7>(tu));
  153. return seed;
  154. }
  155. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
  156. inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
  157. {
  158. std::size_t seed = 0;
  159. qx::hash_combine(seed, boost::get<0>(tu));
  160. qx::hash_combine(seed, boost::get<1>(tu));
  161. qx::hash_combine(seed, boost::get<2>(tu));
  162. qx::hash_combine(seed, boost::get<3>(tu));
  163. qx::hash_combine(seed, boost::get<4>(tu));
  164. qx::hash_combine(seed, boost::get<5>(tu));
  165. qx::hash_combine(seed, boost::get<6>(tu));
  166. qx::hash_combine(seed, boost::get<7>(tu));
  167. qx::hash_combine(seed, boost::get<8>(tu));
  168. return seed;
  169. }
  170. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
  171. inline std::size_t hash_value(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
  172. {
  173. std::size_t seed = 0;
  174. qx::hash_combine(seed, boost::get<0>(tu));
  175. qx::hash_combine(seed, boost::get<1>(tu));
  176. qx::hash_combine(seed, boost::get<2>(tu));
  177. qx::hash_combine(seed, boost::get<3>(tu));
  178. qx::hash_combine(seed, boost::get<4>(tu));
  179. qx::hash_combine(seed, boost::get<5>(tu));
  180. qx::hash_combine(seed, boost::get<6>(tu));
  181. qx::hash_combine(seed, boost::get<7>(tu));
  182. qx::hash_combine(seed, boost::get<8>(tu));
  183. qx::hash_combine(seed, boost::get<9>(tu));
  184. return seed;
  185. }
  186. } // namespace tuples
  187. } // namespace boost
  188. template <typename T0, typename T1>
  189. inline uint qHash(const boost::tuple<T0, T1> & tu)
  190. { return static_cast<uint>(hash_value(tu)); }
  191. template <typename T0, class T1, typename T2>
  192. inline uint qHash(const boost::tuple<T0, T1, T2> & tu)
  193. { return static_cast<uint>(hash_value(tu)); }
  194. template <typename T0, typename T1, typename T2, typename T3>
  195. inline uint qHash(const boost::tuple<T0, T1, T2, T3> & tu)
  196. { return static_cast<uint>(hash_value(tu)); }
  197. template <typename T0, typename T1, typename T2, typename T3, typename T4>
  198. inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4> & tu)
  199. { return static_cast<uint>(hash_value(tu)); }
  200. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
  201. inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5> & tu)
  202. { return static_cast<uint>(hash_value(tu)); }
  203. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
  204. inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
  205. { return static_cast<uint>(hash_value(tu)); }
  206. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
  207. inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
  208. { return static_cast<uint>(hash_value(tu)); }
  209. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
  210. inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
  211. { return static_cast<uint>(hash_value(tu)); }
  212. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
  213. inline uint qHash(const boost::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
  214. { return static_cast<uint>(hash_value(tu)); }
  215. #endif // _QX_ENABLE_BOOST
  216. template <typename T0, typename T1>
  217. inline std::size_t hash_value(const std::tuple<T0, T1> & tu)
  218. {
  219. std::size_t seed = 0;
  220. qx::hash_combine(seed, std::get<0>(tu));
  221. qx::hash_combine(seed, std::get<1>(tu));
  222. return seed;
  223. }
  224. template <typename T0, class T1, typename T2>
  225. inline std::size_t hash_value(const std::tuple<T0, T1, T2> & tu)
  226. {
  227. std::size_t seed = 0;
  228. qx::hash_combine(seed, std::get<0>(tu));
  229. qx::hash_combine(seed, std::get<1>(tu));
  230. qx::hash_combine(seed, std::get<2>(tu));
  231. return seed;
  232. }
  233. template <typename T0, typename T1, typename T2, typename T3>
  234. inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3> & tu)
  235. {
  236. std::size_t seed = 0;
  237. qx::hash_combine(seed, std::get<0>(tu));
  238. qx::hash_combine(seed, std::get<1>(tu));
  239. qx::hash_combine(seed, std::get<2>(tu));
  240. qx::hash_combine(seed, std::get<3>(tu));
  241. return seed;
  242. }
  243. template <typename T0, typename T1, typename T2, typename T3, typename T4>
  244. inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4> & tu)
  245. {
  246. std::size_t seed = 0;
  247. qx::hash_combine(seed, std::get<0>(tu));
  248. qx::hash_combine(seed, std::get<1>(tu));
  249. qx::hash_combine(seed, std::get<2>(tu));
  250. qx::hash_combine(seed, std::get<3>(tu));
  251. qx::hash_combine(seed, std::get<4>(tu));
  252. return seed;
  253. }
  254. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
  255. inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5> & tu)
  256. {
  257. std::size_t seed = 0;
  258. qx::hash_combine(seed, std::get<0>(tu));
  259. qx::hash_combine(seed, std::get<1>(tu));
  260. qx::hash_combine(seed, std::get<2>(tu));
  261. qx::hash_combine(seed, std::get<3>(tu));
  262. qx::hash_combine(seed, std::get<4>(tu));
  263. qx::hash_combine(seed, std::get<5>(tu));
  264. return seed;
  265. }
  266. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
  267. inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
  268. {
  269. std::size_t seed = 0;
  270. qx::hash_combine(seed, std::get<0>(tu));
  271. qx::hash_combine(seed, std::get<1>(tu));
  272. qx::hash_combine(seed, std::get<2>(tu));
  273. qx::hash_combine(seed, std::get<3>(tu));
  274. qx::hash_combine(seed, std::get<4>(tu));
  275. qx::hash_combine(seed, std::get<5>(tu));
  276. qx::hash_combine(seed, std::get<6>(tu));
  277. return seed;
  278. }
  279. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
  280. inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
  281. {
  282. std::size_t seed = 0;
  283. qx::hash_combine(seed, std::get<0>(tu));
  284. qx::hash_combine(seed, std::get<1>(tu));
  285. qx::hash_combine(seed, std::get<2>(tu));
  286. qx::hash_combine(seed, std::get<3>(tu));
  287. qx::hash_combine(seed, std::get<4>(tu));
  288. qx::hash_combine(seed, std::get<5>(tu));
  289. qx::hash_combine(seed, std::get<6>(tu));
  290. qx::hash_combine(seed, std::get<7>(tu));
  291. return seed;
  292. }
  293. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
  294. inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
  295. {
  296. std::size_t seed = 0;
  297. qx::hash_combine(seed, std::get<0>(tu));
  298. qx::hash_combine(seed, std::get<1>(tu));
  299. qx::hash_combine(seed, std::get<2>(tu));
  300. qx::hash_combine(seed, std::get<3>(tu));
  301. qx::hash_combine(seed, std::get<4>(tu));
  302. qx::hash_combine(seed, std::get<5>(tu));
  303. qx::hash_combine(seed, std::get<6>(tu));
  304. qx::hash_combine(seed, std::get<7>(tu));
  305. qx::hash_combine(seed, std::get<8>(tu));
  306. return seed;
  307. }
  308. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
  309. inline std::size_t hash_value(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
  310. {
  311. std::size_t seed = 0;
  312. qx::hash_combine(seed, std::get<0>(tu));
  313. qx::hash_combine(seed, std::get<1>(tu));
  314. qx::hash_combine(seed, std::get<2>(tu));
  315. qx::hash_combine(seed, std::get<3>(tu));
  316. qx::hash_combine(seed, std::get<4>(tu));
  317. qx::hash_combine(seed, std::get<5>(tu));
  318. qx::hash_combine(seed, std::get<6>(tu));
  319. qx::hash_combine(seed, std::get<7>(tu));
  320. qx::hash_combine(seed, std::get<8>(tu));
  321. qx::hash_combine(seed, std::get<9>(tu));
  322. return seed;
  323. }
  324. template <typename T0, typename T1>
  325. inline uint qHash(const std::tuple<T0, T1> & tu)
  326. { return static_cast<uint>(hash_value(tu)); }
  327. template <typename T0, class T1, typename T2>
  328. inline uint qHash(const std::tuple<T0, T1, T2> & tu)
  329. { return static_cast<uint>(hash_value(tu)); }
  330. template <typename T0, typename T1, typename T2, typename T3>
  331. inline uint qHash(const std::tuple<T0, T1, T2, T3> & tu)
  332. { return static_cast<uint>(hash_value(tu)); }
  333. template <typename T0, typename T1, typename T2, typename T3, typename T4>
  334. inline uint qHash(const std::tuple<T0, T1, T2, T3, T4> & tu)
  335. { return static_cast<uint>(hash_value(tu)); }
  336. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5>
  337. inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5> & tu)
  338. { return static_cast<uint>(hash_value(tu)); }
  339. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
  340. inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6> & tu)
  341. { return static_cast<uint>(hash_value(tu)); }
  342. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
  343. inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7> & tu)
  344. { return static_cast<uint>(hash_value(tu)); }
  345. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
  346. inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8> & tu)
  347. { return static_cast<uint>(hash_value(tu)); }
  348. template <typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
  349. inline uint qHash(const std::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> & tu)
  350. { return static_cast<uint>(hash_value(tu)); }
  351. #endif // _QX_HASH_VALUE_H_