b2dpolypolygoncutter.cxx (d8ed516e) | b2dpolypolygoncutter.cxx (3ddd48ca) |
---|---|
1/************************************************************** 2 * 3 * Licensed to the Apache Software Foundation (ASF) under one 4 * or more contributor license agreements. See the NOTICE file 5 * distributed with this work for additional information 6 * regarding copyright ownership. The ASF licenses this file 7 * to you under the Apache License, Version 2.0 (the 8 * "License"); you may not use this file except in compliance --- 676 unchanged lines hidden (view full) --- 685 // apply coordinate corrections to ensure inside/outside correctness after solving 686 const sal_uInt32 nPolygonCount(maOriginal.count()); 687 basegfx::B2DPolyPolygon aRetval(maOriginal); 688 689 for(sal_uInt32 a(0); a < nPolygonCount; a++) 690 { 691 basegfx::B2DPolygon aTemp(aRetval.getB2DPolygon(a)); 692 const sal_uInt32 nPointCount(aTemp.count()); | 1/************************************************************** 2 * 3 * Licensed to the Apache Software Foundation (ASF) under one 4 * or more contributor license agreements. See the NOTICE file 5 * distributed with this work for additional information 6 * regarding copyright ownership. The ASF licenses this file 7 * to you under the Apache License, Version 2.0 (the 8 * "License"); you may not use this file except in compliance --- 676 unchanged lines hidden (view full) --- 685 // apply coordinate corrections to ensure inside/outside correctness after solving 686 const sal_uInt32 nPolygonCount(maOriginal.count()); 687 basegfx::B2DPolyPolygon aRetval(maOriginal); 688 689 for(sal_uInt32 a(0); a < nPolygonCount; a++) 690 { 691 basegfx::B2DPolygon aTemp(aRetval.getB2DPolygon(a)); 692 const sal_uInt32 nPointCount(aTemp.count()); |
693 bool bChanged; | 693 bool bChanged(false); |
694 695 for(sal_uInt32 b(0); b < nPointCount; b++) 696 { 697 const basegfx::B2DPoint aCandidate(aTemp.getB2DPoint(b)); 698 699 for(sal_uInt32 c(0); c < nCorrectionSize; c++) 700 { 701 if(maCorrectionTable[c].first.getX() == aCandidate.getX() && maCorrectionTable[c].first.getY() == aCandidate.getY()) --- 468 unchanged lines hidden --- | 694 695 for(sal_uInt32 b(0); b < nPointCount; b++) 696 { 697 const basegfx::B2DPoint aCandidate(aTemp.getB2DPoint(b)); 698 699 for(sal_uInt32 c(0); c < nCorrectionSize; c++) 700 { 701 if(maCorrectionTable[c].first.getX() == aCandidate.getX() && maCorrectionTable[c].first.getY() == aCandidate.getY()) --- 468 unchanged lines hidden --- |