| /third_party/flutter/skia/src/pathops/ |
| D | SkPathOpsLine.cpp | 51 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()
|
| D | SkPathOpsPoint.h | 163 double tiniest = SkTMin(SkTMin(SkTMin(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
165 largest = SkTMax(largest, -tiniest); in approximatelyDEqual()
183 double tiniest = SkTMin(SkTMin(SkTMin(fX, a.fX), fY), a.fY); in approximatelyEqual() local
185 largest = SkTMax(largest, -tiniest); in approximatelyEqual()
206 float tiniest = SkTMin(SkTMin(SkTMin(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
208 largest = SkTMax(largest, -tiniest); in ApproximatelyEqual()
244 double tiniest = SkTMin(SkTMin(SkTMin(fX, a.fX), fY), a.fY); in roughlyEqual() local
246 largest = SkTMax(largest, -tiniest); in roughlyEqual()
258 float tiniest = SkTMin(SkTMin(SkTMin(a.fX, b.fX), a.fY), b.fY); in RoughlyEqual() local
260 largest = SkTMax(largest, -tiniest); in RoughlyEqual()
|
| D | SkPathOpsQuad.cpp | 191 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), in isLinear() local
195 largest = SkTMax(largest, -tiniest); in isLinear()
|
| D | SkPathOpsCubic.cpp | 218 double tiniest = SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(SkTMin(fPts[0].fX, fPts[0].fY), in isLinear() local
222 largest = SkTMax(largest, -tiniest); in isLinear()
|
| /third_party/skia/src/pathops/ |
| D | SkPathOpsLine.cpp | 51 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearPoint() local
53 largest = std::max(largest, -tiniest); in nearPoint()
75 double tiniest = std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), fPts[1].fX), fPts[1].fY); in nearRay() local
77 largest = std::max(largest, -tiniest); in nearRay()
107 double tiniest = std::min(std::min(y, left), right); in NearPointH() local
109 largest = std::max(largest, -tiniest); in NearPointH()
142 double tiniest = std::min(std::min(x, top), bottom); in NearPointV() local
144 largest = std::max(largest, -tiniest); in NearPointV()
|
| D | SkPathOpsPoint.h | 163 double tiniest = std::min(std::min(std::min(fX, a.fX), fY), a.fY); in approximatelyDEqual() local
165 largest = std::max(largest, -tiniest); in approximatelyDEqual()
183 double tiniest = std::min(std::min(std::min(fX, a.fX), fY), a.fY); in approximatelyEqual() local
185 largest = std::max(largest, -tiniest); in approximatelyEqual()
206 float tiniest = std::min(std::min(std::min(a.fX, b.fX), a.fY), b.fY); in ApproximatelyEqual() local
208 largest = std::max(largest, -tiniest); in ApproximatelyEqual()
244 double tiniest = std::min(std::min(std::min(fX, a.fX), fY), a.fY); in roughlyEqual() local
246 largest = std::max(largest, -tiniest); in roughlyEqual()
258 float tiniest = std::min(std::min(std::min(a.fX, b.fX), a.fY), b.fY); in RoughlyEqual() local
260 largest = std::max(largest, -tiniest); in RoughlyEqual()
|
| D | SkPathOpsQuad.cpp | 191 double tiniest = std::min(std::min(std::min(std::min(std::min(fPts[0].fX, fPts[0].fY), in isLinear() local
195 largest = std::max(largest, -tiniest); in isLinear()
|
| D | SkPathOpsCubic.cpp | 219 …double tiniest = std::min(std::min(std::min(std::min(std::min(std::min(std::min(fPts[0].fX, fPts[0… in isLinear() local
223 largest = std::max(largest, -tiniest); in isLinear()
|
| /third_party/python/Lib/test/decimaltestdata/ |
| D | ddMultiply.decTest | 459 -- reducing tiniest
|