Searched defs:oEnd (Results 1 - 3 of 3) sorted by relevance
/external/eigen/unsupported/Eigen/src/BVH/ |
H A D | BVAlgorithms.h | 26 ObjIter oBegin = ObjIter(), oEnd = ObjIter(); local 31 tree.getChildren(todo.back(), vBegin, vEnd, oBegin, oEnd); 38 for(; oBegin != oEnd; ++oBegin) //go through child objects 158 ObjIter oBegin = ObjIter(), oEnd = ObjIter(); local 164 tree.getChildren(todo.top().second, vBegin, vEnd, oBegin, oEnd); 167 for(; oBegin != oEnd; ++oBegin) //go through child objects
|
/external/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 992 int oEnd = other->nextSpan(oIndex, 1); local 997 while (++otherIndex < oEnd) { 1004 other->alignSpanState(oStart, oEnd); 1215 SkOpSpan* oEnd = oTest; 1220 // this is always true since oEnd == oTest && oStartPt == oTest->fPt -- find proper condition 1221 if (oStartPt == oEnd->fPt || precisely_equal(oStartT, oEnd->fT)) { 1225 while (oStartPt == oEnd->fPt || precisely_equal(oStartT, oEnd->fT)) { 1226 zeroSpan(oEnd); [all...] |
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkOpSegment.cpp | 1025 int oEnd = other->nextSpan(oIndex, 1); local 1030 while (++otherIndex < oEnd) { 1037 other->alignSpanState(oStart, oEnd); 1248 SkOpSpan* oEnd = oTest; 1253 // this is always true since oEnd == oTest && oStartPt == oTest->fPt -- find proper condition 1254 if (oStartPt == oEnd->fPt || precisely_equal(oStartT, oEnd->fT)) { 1258 while (oStartPt == oEnd->fPt || precisely_equal(oStartT, oEnd->fT)) { 1259 zeroSpan(oEnd); [all...] |
Completed in 1834 milliseconds