Home
last modified time | relevance | path

Searched refs:tiniest (Results 1 – 5 of 5) sorted by relevance

/external/skia/src/pathops/
DSkPathOpsLine.cpp51 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local
53 largest = SkTMax(largest, -tiniest); in nearPoint()
75 double tiniest = SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local
77 largest = SkTMax(largest, -tiniest); in nearRay()
107 double tiniest = SkTMin(SkTMin(y, left), right); in NearPointH() local
109 largest = SkTMax(largest, -tiniest); in NearPointH()
142 double tiniest = SkTMin(SkTMin(x, top), bottom); in NearPointV() local
144 largest = SkTMax(largest, -tiniest); in NearPointV()
DSkPathOpsPoint.h155 double tiniest = SkTMin(SkTMin(SkTMin(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
157 largest = SkTMax(largest, -tiniest); in approximatelyDEqual()
175 double tiniest = SkTMin(SkTMin(SkTMin(fX, a.fX), fY), a.fY); in approximatelyEqual() local
177 largest = SkTMax(largest, -tiniest); in approximatelyEqual()
198 float tiniest = SkTMin(SkTMin(SkTMin(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
200 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual()
236 double tiniest = SkTMin(SkTMin(SkTMin(fX, a.fX), fY), a.fY); in roughlyEqual() local
238 largest = SkTMax(largest, -tiniest); in roughlyEqual()
250 float tiniest = SkTMin(SkTMin(SkTMin(a.fX, b.fX), a.fY), b.fY); in RoughlyEqual() local
252 largest = SkTMax(largest, -tiniest); in RoughlyEqual()
DSkPathOpsQuad.cpp181 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), in isLinear() local
185 largest = SkTMax(largest, -tiniest); in isLinear()
DSkPathOpsCubic.cpp219 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), in isLinear() local
223 largest = SkTMax(largest, -tiniest); in isLinear()
/external/jline/src/src/test/resources/jline/example/
Denglish.gz