Home
last modified time | relevance | path

Searched refs:oIndex (Results 1 – 3 of 3) sorted by relevance

/external/skqp/tools/bookmaker/
DtextParser.h486 size_t oIndex = 0; in startsWith() local
487 while (oIndex < oLen && tIndex < tLen) { in startsWith()
489 bool oSpace = ' ' >= str[oIndex]; in startsWith()
498 ++oIndex; in startsWith()
499 } while (oIndex < oLen && ' ' >= str[oIndex]); in startsWith()
502 if (fChar[tIndex] != str[oIndex]) { in startsWith()
506 ++oIndex; in startsWith()
508 return oIndex >= oLen; in startsWith()
/external/skqp/src/pathops/
DSkPathOpsTSect.cpp1096 for (int oIndex = 0; oIndex < oppRayI.used(); ++oIndex) { in linesIntersect() local
1098 ptMatches += oppRayI.pt(oIndex).approximatelyEqual(oppLine.fPts[lIndex]); in linesIntersect()
1114 for (int oIndex = 0; oIndex < thisRayI.used(); ++oIndex) { in linesIntersect() local
1115 if (!roughly_between(oppSpan->fStartT, thisRayI[0][oIndex], oppSpan->fEndT)) { in linesIntersect()
1118 double distSq = thisRayI.pt(index).distanceSquared(oppRayI.pt(oIndex)); in linesIntersect()
1122 oppCloseIndex = oIndex; in linesIntersect()
/external/skia/src/pathops/
DSkPathOpsTSect.cpp1097 for (int oIndex = 0; oIndex < oppRayI.used(); ++oIndex) { in linesIntersect() local
1099 ptMatches += oppRayI.pt(oIndex).approximatelyEqual(oppLine.fPts[lIndex]); in linesIntersect()
1115 for (int oIndex = 0; oIndex < thisRayI.used(); ++oIndex) { in linesIntersect() local
1116 if (!roughly_between(oppSpan->fStartT, thisRayI[0][oIndex], oppSpan->fEndT)) { in linesIntersect()
1119 double distSq = thisRayI.pt(index).distanceSquared(oppRayI.pt(oIndex)); in linesIntersect()
1123 oppCloseIndex = oIndex; in linesIntersect()