diff options
| author | Alessandro Ranellucci <aar@cpan.org> | 2014-11-23 22:14:13 +0300 |
|---|---|---|
| committer | Alessandro Ranellucci <aar@cpan.org> | 2014-11-23 22:14:13 +0300 |
| commit | 634bc09e2c1592ae993d3ecb800bd16aaaaf7069 (patch) | |
| tree | 91e16cd4c9b987882e33b2911a67507672f150ad /xs/src/libslic3r/TriangleMesh.cpp | |
| parent | 5deadc8f123e1a67886de8efffd52f177465bd11 (diff) | |
Refactoring: renamed all contains_*() methods to contains() in C++
Diffstat (limited to 'xs/src/libslic3r/TriangleMesh.cpp')
| -rw-r--r-- | xs/src/libslic3r/TriangleMesh.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/xs/src/libslic3r/TriangleMesh.cpp b/xs/src/libslic3r/TriangleMesh.cpp index 21198e6d4..bc86fc4c1 100644 --- a/xs/src/libslic3r/TriangleMesh.cpp +++ b/xs/src/libslic3r/TriangleMesh.cpp @@ -788,7 +788,7 @@ TriangleMeshSlicer::make_expolygons_simple(std::vector<IntersectionLine> &lines, int slice_idx = -1; double current_contour_area = -1; for (ExPolygons::iterator slice = slices->begin(); slice != slices->end(); ++slice) { - if (slice->contour.contains_point(loop->points.front())) { + if (slice->contour.contains(loop->points.front())) { double area = slice->contour.area(); if (area < current_contour_area || current_contour_area == -1) { slice_idx = slice - slices->begin(); @@ -816,7 +816,7 @@ TriangleMeshSlicer::make_expolygons(const Polygons &loops, ExPolygons* slices) supply everything to offset() instead of performing several union/diff calls. we sort by area assuming that the outermost loops have larger area; - the previous sorting method, based on $b->contains_point($a->[0]), failed to nest + the previous sorting method, based on $b->contains($a->[0]), failed to nest loops correctly in some edge cases when original model had overlapping facets */ |