@@ -84,7 +84,7 @@ complex<float_t> solveLaguerreRoot(polynomial<complex<float_t>> p, complex<float
84
84
complex_t aSign0 = G + det;
85
85
complex_t aSign1 = G - det;
86
86
a = complex_t (n, 0.0 ) / (abs (aSign0) > abs (aSign1) ? aSign0 : aSign1);
87
- // if (isnan(a) || isinf(a)) return nbl::core::nan<double>();
87
+ // if (core:: isnan(a) || isinf(a)) return nbl::core::nan<double>();
88
88
x -= a;
89
89
k++;
90
90
// Repeat until a is small enough or if the maximum number of iterations has been reached.
@@ -203,7 +203,7 @@ bool Hatch::Segment::isStraightLineConstantMajor() const
203
203
p1 = originalBezier->P1 [major],
204
204
p2 = originalBezier->P2 [major];
205
205
// assert(p0 <= p1 && p1 <= p2); (PRECISION ISSUES ARISE ONCE MORE)
206
- return abs (p1 - p0) <= exp2 (-24 ) && abs (p2 - p0) <= exp (-24 );
206
+ return abs (p1 - p0) <= core:: exp2 (-24 ) && abs (p2 - p0) <= exp (-24 );
207
207
}
208
208
209
209
std::array<double , 2 > Hatch::Segment::intersect (const Segment& other) const
@@ -290,7 +290,7 @@ std::array<double, 2> Hatch::Segment::intersect(const Segment& other) const
290
290
for (uint32_t i = 0 ; i < intersections.size (); i++)
291
291
{
292
292
auto t = intersections[i];
293
- if (isnan (t) || other.t_start >= t || t >= other.t_end )
293
+ if (core:: isnan (t) || other.t_start >= t || t >= other.t_end )
294
294
continue ;
295
295
296
296
auto intersection = otherBezier.evaluate (t);
@@ -730,7 +730,7 @@ Hatch::Hatch(std::span<CPolyline> lines, const MajorAxis majorAxis, int32_t& deb
730
730
const Segment& item = activeCandidates[i];
731
731
auto curveMinEnd = intersectOrtho (*item.originalBezier , newMajor, major);
732
732
auto splitCurveMin = *item.originalBezier ;
733
- splitCurveMin.splitCurveFromMinToMax (item.t_start , isnan (curveMinEnd) ? 1.0 : curveMinEnd);
733
+ splitCurveMin.splitCurveFromMinToMax (item.t_start , core:: isnan (curveMinEnd) ? 1.0 : curveMinEnd);
734
734
735
735
drawDebugBezier (splitCurveMin, (i == candidatesSize - 1 ) ? float32_t4 (0.0 , 0.0 , 1.0 , 1.0 ) : float32_t4 (1.0 , 0.0 , 0.0 , 1.0 ));
736
736
if (i == candidatesSize - 1 )
@@ -756,9 +756,9 @@ Hatch::Hatch(std::span<CPolyline> lines, const MajorAxis majorAxis, int32_t& deb
756
756
auto curveMaxEnd = intersectOrtho (*right.originalBezier , newMajor, major);
757
757
758
758
auto splitCurveMin = *left.originalBezier ;
759
- splitCurveMin.splitFromMinToMax (left.t_start , isnan (curveMinEnd) ? 1.0 : curveMinEnd);
759
+ splitCurveMin.splitFromMinToMax (left.t_start , core:: isnan (curveMinEnd) ? 1.0 : curveMinEnd);
760
760
auto splitCurveMax = *right.originalBezier ;
761
- splitCurveMax.splitFromMinToMax (right.t_start , isnan (curveMaxEnd) ? 1.0 : curveMaxEnd);
761
+ splitCurveMax.splitFromMinToMax (right.t_start , core:: isnan (curveMaxEnd) ? 1.0 : curveMaxEnd);
762
762
763
763
assert (splitCurveMin.evaluate (0.0 )[major] <= splitCurveMin.evaluate (1.0 )[major]);
764
764
assert (splitCurveMax.evaluate (0.0 )[major] <= splitCurveMax.evaluate (1.0 )[major]);
@@ -893,7 +893,7 @@ std::array<double, 4> Hatch::bezierBezierIntersections(const QuadraticBezier& lh
893
893
}
894
894
895
895
// TODO: why did we do this?
896
- // if (t[0] == t[1] || isnan(t[0]) || isnan(t[1]))
896
+ // if (t[0] == t[1] || core:: isnan(t[0]) || core:: isnan(t[1]))
897
897
// t[0] = (t[0] != 0.0) ? 0.0 : 1.0;
898
898
899
899
return t;
@@ -957,7 +957,7 @@ std::pair<float64_t2, float64_t2> Hatch::getBezierBoundingBoxMinor(const Quadrat
957
957
for (uint32_t i = 0 ; i < searchTSize; i++)
958
958
{
959
959
double t = searchT[i];
960
- if (t < 0.0 || t > 1.0 || isnan (t))
960
+ if (t < 0.0 || t > 1.0 || core:: isnan (t))
961
961
continue ;
962
962
float64_t2 value = bezier.evaluate (t);
963
963
min = float64_t2 (std::min (min.x , value.x ), std::min (min.y , value.y ));
0 commit comments