GitHub-Proxy/Slic3r
1
0
Fork 0
mirror of https://git.mirrors.martin98.com/https://github.com/slic3r/Slic3r.git synced 2025-08-02 21:10:38 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

Address warnings about comparing signed/unsigned integers.

Browse Source
This commit is contained in:
Joseph Lenox 2017-09-28 22:20:30 -05:00
parent 90f66ea9b9
commit e9c0c93ff1
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
xs/src/libslic3r/LayerRegion.cpp
View File

@ -89,7 +89,7 @@ LayerRegion::process_external_surfaces()
// (thus not visible from the outside), like a slab sustained by // (thus not visible from the outside), like a slab sustained by
// pillars, include them in the bridge in order to have better and // pillars, include them in the bridge in order to have better and
// more continuous bridging. // more continuous bridging.
for (int i = 0; i < surfaces[j].expolygon.holes.size(); ++i) { for (size_t i = 0; i < surfaces[j].expolygon.holes.size(); ++i) {
// reverse the hole and consider it a polygon // reverse the hole and consider it a polygon
Polygon h = surfaces[j].expolygon.holes[i]; Polygon h = surfaces[j].expolygon.holes[i];
h.reverse(); h.reverse();
@ -97,7 +97,7 @@ LayerRegion::process_external_surfaces()
// Is this hole fully contained in the layer slices? // Is this hole fully contained in the layer slices?
if (diff(h, this->layer()->slices).empty()) { if (diff(h, this->layer()->slices).empty()) {
// remove any other surface contained in this hole // remove any other surface contained in this hole
for (int k = 0; k < surfaces.size(); ++k) { for (size_t k = 0; k < surfaces.size(); ++k) {
if (k == j) continue; if (k == j) continue;
if (h.contains(surfaces[k].expolygon.contour.first_point())) { if (h.contains(surfaces[k].expolygon.contour.first_point())) {
surfaces.erase(surfaces.begin() + k); surfaces.erase(surfaces.begin() + k);

2
xs/src/libslic3r/PerimeterGenerator.cpp
View File

@ -215,7 +215,7 @@ PerimeterGenerator::process()
// find the contour loop that contains it // find the contour loop that contains it
for (int t = d-1; t >= 0; --t) { for (int t = d-1; t >= 0; --t) {
for (int j = 0; j < contours[t].size(); ++j) { for (size_t j = 0; j < contours[t].size(); ++j) {
PerimeterGeneratorLoop &candidate_parent = contours[t][j]; PerimeterGeneratorLoop &candidate_parent = contours[t][j];
if (candidate_parent.polygon.contains(loop.polygon.first_point())) { if (candidate_parent.polygon.contains(loop.polygon.first_point())) {
candidate_parent.children.push_back(loop); candidate_parent.children.push_back(loop);