HomeSort by relevance Sort by last modified time
    Searched refs:bestXY (Results 1 - 12 of 12) sorted by null

  /external/chromium_org/third_party/skia/experimental/Intersection/
SimplifyFindTop_Test.cpp 35 SkPoint bestXY = {SK_ScalarMin, SK_ScalarMin};
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true);
Simplify.cpp     [all...]
  /external/skia/experimental/Intersection/
SimplifyFindTop_Test.cpp 35 SkPoint bestXY = {SK_ScalarMin, SK_ScalarMin};
38 findSortableTop(contourList, index, end, bestXY, unsortable, done, true);
Simplify.cpp     [all...]
  /external/chromium_org/third_party/skia/src/pathops/
SkOpContour.cpp 674 void SkOpContour::topSortableSegment(const SkPoint& topLeft, SkPoint* bestXY,
697 if (bestXY->fY < testXY.fY) {
700 if (bestXY->fY == testXY.fY && bestXY->fX < testXY.fX) {
705 *bestXY = testXY;
SkOpContour.h 287 void topSortableSegment(const SkPoint& topLeft, SkPoint* bestXY, SkOpSegment** topStart);
SkPathOpsCommon.cpp 236 SkPoint bestXY = {SK_ScalarMax, SK_ScalarMax};
254 contour->topSortableSegment(*topLeft, &bestXY, &topStart);
262 *topLeft = bestXY;
  /external/skia/src/pathops/
SkOpContour.cpp 662 void SkOpContour::topSortableSegment(const SkPoint& topLeft, SkPoint* bestXY,
685 if (bestXY->fY < testXY.fY) {
688 if (bestXY->fY == testXY.fY && bestXY->fX < testXY.fX) {
693 *bestXY = testXY;
SkOpContour.h 287 void topSortableSegment(const SkPoint& topLeft, SkPoint* bestXY, SkOpSegment** topStart);
SkPathOpsCommon.cpp 236 SkPoint bestXY = {SK_ScalarMax, SK_ScalarMax};
254 contour->topSortableSegment(*topLeft, &bestXY, &topStart);
262 *topLeft = bestXY;
  /packages/apps/Launcher2/src/com/android/launcher2/
CellLayout.java     [all...]
  /packages/apps/Launcher3/src/com/android/launcher3/
CellLayout.java     [all...]

Completed in 223 milliseconds