Guard min/max from macro expansion.

Author: abellgithub

include/delaunator.cpp

@@ -60,7 +60,7 @@ inline double circumradius(
     if ((bl > 0.0 || bl < 0.0) && (cl > 0.0 || cl < 0.0) && (d > 0.0 || d < 0.0)) {
         return x * x + y * y;
     } else {
-        return std::numeric_limits<double>::max();
+        return (std::numeric_limits<double>::max)();
     }
 }
 
@@ -198,10 +198,10 @@ Delaunator::Delaunator(std::vector<double> const& in_coords)
       m_edge_stack() {
     std::size_t n = coords.size() >> 1;
 
-    double max_x = std::numeric_limits<double>::min();
-    double max_y = std::numeric_limits<double>::min();
-    double min_x = std::numeric_limits<double>::max();
-    double min_y = std::numeric_limits<double>::max();
+    double max_x = (std::numeric_limits<double>::min)();
+    double max_y = (std::numeric_limits<double>::min)();
+    double min_x = (std::numeric_limits<double>::max)();
+    double min_y = (std::numeric_limits<double>::max)();
     std::vector<std::size_t> ids;
     ids.reserve(n);
 
@@ -218,7 +218,7 @@ Delaunator::Delaunator(std::vector<double> const& in_coords)
     }
     const double cx = (min_x + max_x) / 2;
     const double cy = (min_y + max_y) / 2;
-    double min_dist = std::numeric_limits<double>::max();
+    double min_dist = (std::numeric_limits<double>::max)();
 
     std::size_t i0 = INVALID_INDEX;
     std::size_t i1 = INVALID_INDEX;
@@ -236,7 +236,7 @@ Delaunator::Delaunator(std::vector<double> const& in_coords)
     const double i0x = coords[2 * i0];
     const double i0y = coords[2 * i0 + 1];
 
-    min_dist = std::numeric_limits<double>::max();
+    min_dist = (std::numeric_limits<double>::max)();
 
     // find the point closest to the seed
     for (std::size_t i = 0; i < n; i++) {
@@ -251,7 +251,7 @@ Delaunator::Delaunator(std::vector<double> const& in_coords)
     double i1x = coords[2 * i1];
     double i1y = coords[2 * i1 + 1];
 
-    double min_radius = std::numeric_limits<double>::max();
+    double min_radius = (std::numeric_limits<double>::max)();
 
     // find the third point which forms the smallest circumcircle with the first two
     for (std::size_t i = 0; i < n; i++) {
@@ -266,7 +266,7 @@ Delaunator::Delaunator(std::vector<double> const& in_coords)
         }
     }
 
-    if (!(min_radius < std::numeric_limits<double>::max())) {
+    if (!(min_radius < (std::numeric_limits<double>::max()))) {
         throw std::runtime_error("not triangulation");
     }