PandA-2024.02
hash_helper.hpp
Go to the documentation of this file.
1 /*
2  *
3  * _/_/_/ _/_/ _/ _/ _/_/_/ _/_/
4  * _/ _/ _/ _/ _/_/ _/ _/ _/ _/ _/
5  * _/_/_/ _/_/_/_/ _/ _/_/ _/ _/ _/_/_/_/
6  * _/ _/ _/ _/ _/ _/ _/ _/ _/
7  * _/ _/ _/ _/ _/ _/_/_/ _/ _/
8  *
9  * ***********************************************
10  * PandA Project
11  * URL: http://panda.dei.polimi.it
12  * Politecnico di Milano - DEIB
13  * System Architectures Group
14  * ***********************************************
15  * Copyright (C) 2015-2024 Politecnico di Milano
16  *
17  * This file is part of the PandA framework.
18  *
19  * The PandA framework is free software; you can redistribute it and/or modify
20  * it under the terms of the GNU General Public License as published by
21  * the Free Software Foundation; either version 3 of the License, or
22  * (at your option) any later version.
23  *
24  * This program is distributed in the hope that it will be useful,
25  * but WITHOUT ANY WARRANTY; without even the implied warranty of
26  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
27  * GNU General Public License for more details.
28  *
29  * You should have received a copy of the GNU General Public License
30  * along with this program. If not, see <http://www.gnu.org/licenses/>.
31  *
32  */
40 #ifndef HASH_HELPER_HPP
41 #define HASH_HELPER_HPP
42 
43 #include "custom_set.hpp"
44 
45 #if NO_ABSEIL_HASH
46 
47 #include <boost/functional/hash/hash.hpp>
48 
50 namespace std
51 {
52  template <typename T>
53  struct hash<std::vector<T>> : public std::unary_function<std::vector<T>, std::size_t>
54  {
55  std::size_t operator()(const std::vector<T>& val) const
56  {
57  return boost::hash_range<typename std::vector<T>::const_iterator>(val.begin(), val.end());
58  }
59  };
60 } // namespace std
61 
63 namespace std
64 {
65  template <typename T, typename U>
66  struct hash<std::pair<T, U>> : public std::unary_function<std::pair<T, U>, std::size_t>
67  {
68  std::size_t operator()(const std::pair<T, U>& val) const
69  {
70  size_t hash_value = 0;
71  boost::hash_combine(hash_value, val.first);
72  boost::hash_combine(hash_value, val.second);
73  return hash_value;
74  }
75  };
76 } // namespace std
77 #endif
78 #endif
Definition of hash function for EdgeDescriptor.
Definition: graph.hpp:1321
redefinition of set to manage ordered/unordered structures
unsigned int size_t
Definition: test.c:1

Generated on Mon Feb 12 2024 13:02:56 for PandA-2024.02 by doxygen 1.8.13