3DPrinting/PrusaSlicer-NonPlainar
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Fixed compiler warnings

Browse source
This commit is contained in:
Lukáš Hejl 2020-11-29 17:29:11 +01:00
parent 87879034f6
commit f917b83706
1 changed files with 4 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
src/libslic3r/GCode/AvoidCrossingPerimeters.cpp
View file

@ -122,10 +122,6 @@ static Point find_first_different_vertex(const Polygon &polygon, const size_t po
return polygon.points[line_idx]; return polygon.points[line_idx];
} }
//FIXME will be in Point.h in the master
template<typename T, int Options>
inline Eigen::Matrix<T, 2, 1, Eigen::DontAlign> perp(const Eigen::MatrixBase<Eigen::Matrix<T, 2, 1, Options>>& v) { return Eigen::Matrix<T, 2, 1, Eigen::DontAlign>(-v.y(), v.x()); }
static Vec2d three_points_inward_normal(const Point &left, const Point &middle, const Point &right) static Vec2d three_points_inward_normal(const Point &left, const Point &middle, const Point &right)
{ {
assert(left != middle); assert(left != middle);
@ -223,11 +219,11 @@ static Direction get_shortest_direction(const AvoidCrossingPerimeters::Boundary
float total_length_backward = dist_first + contour_length - dist_second; float total_length_backward = dist_first + contour_length - dist_second;
if (reversed) std::swap(total_length_forward, total_length_backward); if (reversed) std::swap(total_length_forward, total_length_backward);
total_length_forward -= (intersection_first.point - poly[intersection_first.line_idx]).cast<double>().norm(); total_length_forward -= (intersection_first.point - poly[intersection_first.line_idx]).cast<float>().norm();
total_length_backward -= (poly[(intersection_first.line_idx + 1) % poly.size()] - intersection_first.point).cast<double>().norm(); total_length_backward -= (poly[(intersection_first.line_idx + 1) % poly.size()] - intersection_first.point).cast<float>().norm();
total_length_forward -= (poly[(intersection_second.line_idx + 1) % poly.size()] - intersection_second.point).cast<double>().norm(); total_length_forward -= (poly[(intersection_second.line_idx + 1) % poly.size()] - intersection_second.point).cast<float>().norm();
total_length_backward -= (intersection_second.point - poly[intersection_second.line_idx]).cast<double>().norm(); total_length_backward -= (intersection_second.point - poly[intersection_second.line_idx]).cast<float>().norm();
if (total_length_forward < total_length_backward) return Direction::Forward; if (total_length_forward < total_length_backward) return Direction::Forward;
return Direction::Backward; return Direction::Backward;