add Vector2Hash<T> for all fundamental type, also replace fge::AStar::Vector2iHash with it

Author: JonathSpirit

includes/FastEngine/C_vector.hpp

@@ -43,6 +43,29 @@ using Vector3i = Vector3<int32_t>;
 using Vector3u = Vector3<uint32_t>;
 using Vector3f = Vector3<float>;
 
+template<class T>
+struct Vector2Hash
+{
+    static_assert(std::is_fundamental_v<T>, "Vector2Hash only works with fundamental types !");
+
+    inline std::size_t operator()(fge::Vector2<T> const& value) const
+    {
+        if constexpr (std::is_fundamental_v<T>)
+        {
+            return std::hash<T>{}(value.x) ^ std::hash<T>{}(value.y);
+        }
+        else
+        {
+            static_assert(false, "Vector2Hash only works with fundamental types !");
+        }
+    }
+};
+
+using Vector2iHash = Vector2Hash<int32_t>;
+using Vector2uHash = Vector2Hash<uint32_t>;
+using Vector2fHash = Vector2Hash<float>;
+using Vector2sizeHash = Vector2Hash<std::size_t>;
+
 } // namespace fge
 
 namespace glm

includes/FastEngine/extra/extra_pathFinding.hpp

@@ -39,17 +39,7 @@ namespace fge::AStar
 using HeuristicFunction = unsigned int (*)(fge::Vector2i, fge::Vector2i);
 using CoordinateList = std::vector<fge::Vector2i>;
 
-struct Vector2iHash
-{
-    static_assert(sizeof(fge::Vector2i) == 8, "bad fge::Vector2i size, should be 8 !");
-
-    inline std::size_t operator()(fge::Vector2i const& coord) const
-    {
-        return std::hash<uint64_t>()(*reinterpret_cast<uint64_t const*>(&coord));
-    }
-};
-
-using CoordinateSet = std::unordered_set<fge::Vector2i, fge::AStar::Vector2iHash>;
+using CoordinateSet = std::unordered_set<fge::Vector2i, fge::Vector2iHash>;
 
 struct FGE_API Node
 {
@@ -61,7 +51,7 @@ struct FGE_API Node
     std::optional<fge::Vector2i> _parent;
 };
 
-using NodeMap = std::unordered_map<fge::Vector2i, fge::AStar::Node, fge::AStar::Vector2iHash>;
+using NodeMap = std::unordered_map<fge::Vector2i, fge::AStar::Node, fge::Vector2iHash>;
 
 class FGE_API Generator
 {