@@ -271,8 +271,8 @@ bool SEdgeList::AssemblePolygon(SPolygon *dest, SEdge *errorAt, bool keepDir) co
271271 dest->Clear ();
272272
273273 bool allClosed = true ;
274- Vector first = {0 , 0 , 0 };
275- Vector last = {0 , 0 , 0 };
274+ Vector first = {} /* { 0, 0, 0}*/ ;
275+ Vector last = {} /* { 0, 0, 0}*/ ;
276276 int i;
277277 for (i = 0 ; i < l.n ; i++) {
278278 if (!l[i].tag ) {
@@ -380,7 +380,7 @@ SKdNodeEdges *SKdNodeEdges::From(SEdgeLl *sell) {
380380
381381 // Compute the midpoints (just mean, though median would be better) of
382382 // each component.
383- Vector ptAve = {0 , 0 , 0 };
383+ Vector ptAve = {} /* { 0, 0, 0}*/ ;
384384 SEdgeLl *flip;
385385 int totaln = 0 ;
386386 for (flip = sell; flip; flip = flip->next ) {
@@ -582,7 +582,7 @@ void SContour::FindPointWithMinX() {
582582}
583583
584584Vector SContour::ComputeNormal () const {
585- Vector n = {0 , 0 , 0 };
585+ Vector n = {} /* { 0, 0, 0}*/ ;
586586
587587 for (int i = 0 ; i < l.n - 2 ; i++) {
588588 Vector u = (l[i+1 ].p ).Minus (l[i+0 ].p ).WithMagnitude (1 );
@@ -678,7 +678,7 @@ void SPolygon::MakeEdgesInto(SEdgeList *el) const {
678678
679679Vector SPolygon::ComputeNormal () const {
680680 if (l.IsEmpty ())
681- return {0 , 0 , 0 };
681+ return {} /* { 0, 0, 0}*/ ;
682682 return (l[0 ]).ComputeNormal ();
683683}
684684
0 commit comments