From 099a09e4d95d247f983c1cc88cd32eb42d476a5b Mon Sep 17 00:00:00 2001
From: lisyarus <lisyarus@gmail.com>
Date: Mon, 29 Jan 2024 17:44:27 +0300
Subject: [PATCH] Use util::hash_map instead of std::unordered_map for
 pathfinder

---
 libs/util/include/psemek/util/find_path.hpp | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/libs/util/include/psemek/util/find_path.hpp b/libs/util/include/psemek/util/find_path.hpp
index 37bf2b03..04265f93 100644
--- a/libs/util/include/psemek/util/find_path.hpp
+++ b/libs/util/include/psemek/util/find_path.hpp
@@ -1,8 +1,8 @@
 #pragma once
 
 #include <psemek/util/functional.hpp>
+#include <psemek/util/hash_table.hpp>
 
-#include <unordered_map>
 #include <set>
 #include <deque>
 #include <optional>
@@ -15,7 +15,7 @@ namespace psemek::util
 	{
 		struct node_compare
 		{
-			std::unordered_map<Node, Cost> const & priority;
+			util::hash_map<Node, Cost> const & priority;
 
 			bool operator()(Node const & n1, Node const & n2) const
 			{
@@ -34,9 +34,9 @@ namespace psemek::util
 		HeuristicFn heuristic;
 		EdgeCallback edge_callback;
 
-		std::unordered_map<Node, Cost> cost;
-		std::unordered_map<Node, Cost> priority;
-		std::unordered_map<Node, Node> previous;
+		util::hash_map<Node, Cost> cost;
+		util::hash_map<Node, Cost> priority;
+		util::hash_map<Node, Node> previous;
 		std::set<Node, node_compare> queue;
 
 		pathfinder(NeighboursFn && node_neighbours, HeuristicFn && heuristic, EdgeCallback && edge_callback)