use robin-hood-hashing

reki2000 · Jun 22, 2020 · 4f9c518 · 4f9c518
1 parent 91d3dc7
commit 4f9c518
Show file tree

Hide file tree

Showing 4 changed files with 7 additions and 2 deletions.
diff --git a/.gitmodules b/.gitmodules
@@ -0,0 +1,3 @@
+[submodule "cpp/external_projects/robin-hood-hashing"]
+	path = cpp/external_projects/robin-hood-hashing
+	url = https://github.com/martinus/robin-hood-hashing
diff --git a/cpp/Makefile b/cpp/Makefile
@@ -4,4 +4,4 @@ clean:
 	rm main
 
 main: src/main.cpp
-	clang++ -std=c++17 -O3 -Wall -Wextra -pedantic-errors -march=native -mtune=native -o main src/main.cpp
+	clang++ -std=c++17 -O3 -Wall -Wextra -pedantic-errors -march=native -mtune=native -I external_projects/robin-hood-hashing/src/include -o main src/main.cpp
diff --git a/cpp/external_projects/robin-hood-hashing b/cpp/external_projects/robin-hood-hashing
diff --git a/cpp/src/main.cpp b/cpp/src/main.cpp
@@ -6,6 +6,7 @@
 #include<queue>
 #include<cstdint>
 #include<limits>
+#include"robin_hood.h"
 
 using NodeId = int;
 using NodeIndex = int;
@@ -17,7 +18,7 @@ constexpr int DISTANCE_MULTIPLE = 100;
 bool is_debug = false;
 
 struct G {
-  std::unordered_map<NodeId,NodeIndex> id2idx;
+  robin_hood::unordered_map<NodeId,NodeIndex> id2idx;
   std::vector<NodeId> idx2id = {0};
   NodeIndex idx = 1;
   std::vector<std::vector<Edge>> edge = {std::vector<Edge>()};