From 7373e6d3df6c9fd08a9393977887ff7f81cb1b24 Mon Sep 17 00:00:00 2001 From: orange Date: Tue, 3 Mar 2026 10:00:46 +0300 Subject: [PATCH] added std namspace to int64_t type --- include/omath/collision/epa_algorithm.hpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/include/omath/collision/epa_algorithm.hpp b/include/omath/collision/epa_algorithm.hpp index 8013c74..660a2b1 100644 --- a/include/omath/collision/epa_algorithm.hpp +++ b/include/omath/collision/epa_algorithm.hpp @@ -163,12 +163,12 @@ namespace omath::collision // Horizon boundary: maps packed(a,b) → Edge. // Opposite edges cancel in O(1) via hash lookup instead of O(h) linear scan. - using BoundaryMap = std::pmr::unordered_map; + using BoundaryMap = std::pmr::unordered_map; [[nodiscard]] - static constexpr int64_t pack_edge(const int a, const int b) noexcept + static constexpr std::int64_t pack_edge(const int a, const int b) noexcept { - return (static_cast(a) << 32) | static_cast(b); + return (static_cast(a) << 32) | static_cast(b); } [[nodiscard]] @@ -194,7 +194,7 @@ namespace omath::collision // O(1) cancel: if the opposite edge (b→a) is already in the map it is an // internal edge shared by two visible faces and must be removed. // Otherwise this is a horizon edge and we insert it. - const int64_t rev = pack_edge(b, a); + const std::int64_t rev = pack_edge(b, a); if (const auto it = boundary.find(rev); it != boundary.end()) boundary.erase(it); else