Tulip  6.0.0
Large graphs analysis and drawing
tuliphash.h
1 /*
2  *
3  * This file is part of Tulip (https://tulip.labri.fr)
4  *
5  * Authors: David Auber and the Tulip development Team
6  * from LaBRI, University of Bordeaux
7  *
8  * Tulip is free software; you can redistribute it and/or modify
9  * it under the terms of the GNU Lesser General Public License
10  * as published by the Free Software Foundation, either version 3
11  * of the License, or (at your option) any later version.
12  *
13  * Tulip is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
16  * See the GNU General Public License for more details.
17  *
18  */
19 ///@cond DOXYGEN_HIDDEN
20 
21 #ifndef TLP_HASH_H
22 #define TLP_HASH_H
23 
24 /**
25  * @brief This file defines what class is used to provide a hashmap.
26  * The tlp_hash_map macro defines which implementation is used for hash maps.
27  *
28  */
29 // we tried to find a high-performance alternative to std::unordered_map
30 // with the same api and an easy integration into Tulip.
31 // see
32 // https://martin.ankerl.com/2022/08/27/hashmap-bench-01/
33 // https://jacksonallan.github.io/c_cpp_hash_tables_benchmark/
34 #include <tulip/unordered_dense.h>
35 #define tlp_hash_map ankerl::unordered_dense::map
36 
37 // needed because the definition of tlp_hash_combine template
38 // has been moved into TlpTools.h
39 #include <tulip/TlpTools.h>
40 
41 #endif
42 
43 ///@endcond