Lines Matching refs:aCurrent
213 TrDeEdgeEntries::iterator aCurrent, in addEdgeSorted() argument
217 while(aCurrent != maTrDeEdgeEntries.end() && (*aCurrent) < rNewEdge) in addEdgeSorted()
219 aCurrent++; in addEdgeSorted()
223 maTrDeEdgeEntries.insert(aCurrent, rNewEdge); in addEdgeSorted()
229 TrDeEdgeEntries::iterator aCurrent) in splitEdgeAtGivenPoint() argument
273 addEdgeSorted(aCurrent, aNewEdge); in splitEdgeAtGivenPoint()
281 TrDeEdgeEntries::iterator aCurrent) in testAndCorrectEdgeIntersection() argument
320 return splitEdgeAtGivenPoint(aEdgeB, aEdgeA.getStart(), aCurrent); in testAndCorrectEdgeIntersection()
325 return splitEdgeAtGivenPoint(aEdgeB, aEdgeA.getEnd(), aCurrent); in testAndCorrectEdgeIntersection()
332 return splitEdgeAtGivenPoint(aEdgeA, aEdgeB.getStart(), aCurrent); in testAndCorrectEdgeIntersection()
337 return splitEdgeAtGivenPoint(aEdgeA, aEdgeB.getEnd(), aCurrent); in testAndCorrectEdgeIntersection()
363 bRetval = splitEdgeAtGivenPoint(aEdgeA, *pNewPoint, aCurrent); in testAndCorrectEdgeIntersection()
364 bRetval |= splitEdgeAtGivenPoint(aEdgeB, *pNewPoint, aCurrent); in testAndCorrectEdgeIntersection()
398 TrDeEdgeEntries::iterator aCurrent(maTrDeEdgeEntries.begin()); in solveHorizontalEdges() local
403 TrDeEdgeEntries::reference aCompare(*aCurrent++); in solveHorizontalEdges()
431 if(splitEdgeAtGivenPoint(aCompare, *pNewPoint, aCurrent)) in solveHorizontalEdges()
442 while(aCurrent != maTrDeEdgeEntries.end() in solveHorizontalEdges()
443 && fTools::less(aCurrent->getStart().getY(), fFixedY)); in solveHorizontalEdges()
611 TrDeEdgeEntries::iterator aCurrent(maTrDeEdgeEntries.begin()); in Subdivide() local
612 TrDeEdgeEntries::reference aLeft(*aCurrent++); in Subdivide()
614 if(aCurrent == maTrDeEdgeEntries.end()) in Subdivide()
626 TrDeEdgeEntries::reference aRight(*aCurrent++); in Subdivide()
682 if(splitEdgeAtGivenPoint(aLeft, *pNewPoint, aCurrent)) in Subdivide()
695 if(splitEdgeAtGivenPoint(aRight, *pNewPoint, aCurrent)) in Subdivide()
729 if(testAndCorrectEdgeIntersection(aLeft, aRight, aCurrent)) in Subdivide()
738 if(aCurrent != maTrDeEdgeEntries.end() in Subdivide()
739 && fTools::less(aCurrent->getStart().getY(), aLeftEnd.getY())) in Subdivide()
754 TrDeEdgeEntries::iterator aLoop(aCurrent); in Subdivide()
791 if(splitEdgeAtGivenPoint(aLeft, *pNewLeft, aCurrent)) in Subdivide()
803 if(splitEdgeAtGivenPoint(aRight, *pNewRight, aCurrent)) in Subdivide()
818 bDone = testAndCorrectEdgeIntersection(aLeft, aCompare, aCurrent); in Subdivide()
824 bDone = testAndCorrectEdgeIntersection(aRight, aCompare, aCurrent); in Subdivide()
848 if(splitEdgeAtGivenPoint(aLeft, *pNewPoint, aCurrent)) in Subdivide()
861 if(splitEdgeAtGivenPoint(aRight, *pNewPoint, aCurrent)) in Subdivide()
1035 basegfx::trapezoidhelper::TrDeEdgeEntries::iterator aCurrent(aTrDeEdgeEntries.begin()); in createLineTrapezoidFromEdge() local
1036 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aLeft(*aCurrent++); in createLineTrapezoidFromEdge()
1037 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aRight(*aCurrent++); in createLineTrapezoidFromEdge()
1052 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aLeft2(*aCurrent++); in createLineTrapezoidFromEdge()
1053 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aRight2(*aCurrent++); in createLineTrapezoidFromEdge()
1072 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aRight2(*aCurrent++); in createLineTrapezoidFromEdge()
1073 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aLeft2(*aCurrent++); in createLineTrapezoidFromEdge()
1106 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aLeft2(*aCurrent++); in createLineTrapezoidFromEdge()
1107 basegfx::trapezoidhelper::TrDeEdgeEntries::reference aRight2(*aCurrent++); in createLineTrapezoidFromEdge()
1169 B2DPoint aCurrent(aSource.getB2DPoint(0)); in createLineTrapezoidFromB2DPolygon() local
1178 createLineTrapezoidFromEdge(ro_Result, aCurrent, aNext, fLineWidth); in createLineTrapezoidFromB2DPolygon()
1179 aCurrent = aNext; in createLineTrapezoidFromB2DPolygon()