Skip to content

Commit 3d3f093

Browse files
committed
Cosmetic codestyle changes.
1 parent 25cf9c0 commit 3d3f093

File tree

1 file changed

+16
-6
lines changed

1 file changed

+16
-6
lines changed

slicer.h

Lines changed: 16 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -232,7 +232,8 @@ class SlicerLayer
232232
{
233233
polygonList.push_back(openPolygonList[bestA]);
234234
openPolygonList[bestA].clear();
235-
}else if (bestResult.AtoB)
235+
}
236+
else if (bestResult.AtoB)
236237
{
237238
unsigned int n = polygonList.size();
238239
polygonList.push_back(ClipperLib::Polygon());
@@ -241,20 +242,25 @@ class SlicerLayer
241242
for(unsigned int j = openPolygonList[bestA].size() - 1; int(j) >= 0; j--)
242243
polygonList[n].push_back(openPolygonList[bestA][j]);
243244
openPolygonList[bestA].clear();
244-
}else{
245+
}
246+
else
247+
{
245248
unsigned int n = polygonList.size();
246249
polygonList.push_back(openPolygonList[bestA]);
247250
for(unsigned int j = bestResult.pointIdxB; j != bestResult.pointIdxA; j = (j + 1) % polygonList[bestResult.polygonIdx].size())
248251
polygonList[n].push_back(polygonList[bestResult.polygonIdx][j]);
249252
openPolygonList[bestA].clear();
250253
}
251-
}else{
254+
}
255+
else
256+
{
252257
if (bestResult.pointIdxA == bestResult.pointIdxB)
253258
{
254259
for(unsigned int n=0; n<openPolygonList[bestA].size(); n++)
255260
openPolygonList[bestB].push_back(openPolygonList[bestA][n]);
256261
openPolygonList[bestA].clear();
257-
}else if (bestResult.AtoB)
262+
}
263+
else if (bestResult.AtoB)
258264
{
259265
ClipperLib::Polygon poly;
260266
for(unsigned int n = bestResult.pointIdxA; n != bestResult.pointIdxB; n = (n + 1) % polygonList[bestResult.polygonIdx].size())
@@ -264,15 +270,19 @@ class SlicerLayer
264270
for(unsigned int n=0; n<openPolygonList[bestA].size(); n++)
265271
openPolygonList[bestB].push_back(openPolygonList[bestA][n]);
266272
openPolygonList[bestA].clear();
267-
}else{
273+
}
274+
else
275+
{
268276
for(unsigned int n = bestResult.pointIdxB; n != bestResult.pointIdxA; n = (n + 1) % polygonList[bestResult.polygonIdx].size())
269277
openPolygonList[bestB].push_back(polygonList[bestResult.polygonIdx][n]);
270278
for(unsigned int n = openPolygonList[bestA].size() - 1; int(n) >= 0; n--)
271279
openPolygonList[bestB].push_back(openPolygonList[bestA][n]);
272280
openPolygonList[bestA].clear();
273281
}
274282
}
275-
}else{
283+
}
284+
else
285+
{
276286
break;
277287
}
278288
}

0 commit comments

Comments
 (0)