mirror of https://github.com/CGAL/cgal
Do not define _USE_MATH_DEFINES (#9094)
## Summary of Changes This leads to a warning in the [testsuite](https://cgal.geometryfactory.com/CGAL/testsuite/CGAL-6.2-Ic-11/Periodic_2_triangulation_2/TestReport_Christo_ICPC-2025.1-Release.gz) Also it is a weaker test as this `#define` is not required. ## Release Management * Affected package(s): Periodic_2_triangulation_2 * License and copyright ownership: unchanged
This commit is contained in:
commit
d95917e06f
|
|
@ -892,8 +892,8 @@ four_cover_points(Staircases< Traits >& d, OutputIterator o, bool& ok)
|
||||||
sdistx(*(shf - 1), bottom) <= FT(2) * d.r))))
|
sdistx(*(shf - 1), bottom) <= FT(2) * d.r))))
|
||||||
#else
|
#else
|
||||||
if (sdistx(bottom_i.second, bottom) <= FT(2) * d.r &&
|
if (sdistx(bottom_i.second, bottom) <= FT(2) * d.r &&
|
||||||
((!d.is_x_greater_y() ||
|
(!d.is_x_greater_y() ||
|
||||||
(shl == Citerator(share.end()) ||
|
((shl == Citerator(share.end()) ||
|
||||||
sdistx(share.back(), bottom) <= FT(2) * d.r) &&
|
sdistx(share.back(), bottom) <= FT(2) * d.r) &&
|
||||||
(shf == Citerator(share.begin()) ||
|
(shf == Citerator(share.begin()) ||
|
||||||
sdistx(*(shf - 1), bottom) <= FT(2) * d.r))))
|
sdistx(*(shf - 1), bottom) <= FT(2) * d.r))))
|
||||||
|
|
|
||||||
|
|
@ -4,8 +4,6 @@
|
||||||
#ifndef P2T2_UNIT_TEST_TYPES_H
|
#ifndef P2T2_UNIT_TEST_TYPES_H
|
||||||
#define P2T2_UNIT_TEST_TYPES_H
|
#define P2T2_UNIT_TEST_TYPES_H
|
||||||
|
|
||||||
#define _USE_MATH_DEFINES
|
|
||||||
#include <math.h>
|
|
||||||
|
|
||||||
#include <CGAL/Periodic_2_triangulation_2.h>
|
#include <CGAL/Periodic_2_triangulation_2.h>
|
||||||
#include <CGAL/Periodic_2_triangulation_traits_2.h>
|
#include <CGAL/Periodic_2_triangulation_traits_2.h>
|
||||||
|
|
|
||||||
|
|
@ -30,7 +30,7 @@ int main()
|
||||||
vh_midpoint = t.insert(Point(0, 0) + midpoint);
|
vh_midpoint = t.insert(Point(0, 0) + midpoint);
|
||||||
for (int i = 0; i < n; ++i)
|
for (int i = 0; i < n; ++i)
|
||||||
{
|
{
|
||||||
t.insert(Point(0.3 * sin(i * 1.0 / n * 2 * M_PI), 0.3 * cos(i * 1.0 / n * 2 * M_PI)) + midpoint);
|
t.insert(Point(0.3 * sin(i * 1.0 / n * 2 * CGAL_PI), 0.3 * cos(i * 1.0 / n * 2 * CGAL_PI)) + midpoint);
|
||||||
}
|
}
|
||||||
t.remove(vh_midpoint);
|
t.remove(vh_midpoint);
|
||||||
assert(t.is_valid(true));
|
assert(t.is_valid(true));
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue