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

  /external/skia/gm/
convexpaths.cpp 100 kPtsPerSide = (1 << 12),
103 for (int i = 1; i < kPtsPerSide; ++i) { // skip the first point due to moveTo.
104 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0);
106 for (int i = 0; i < kPtsPerSide; ++i) {
107 fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide);
109 for (int i = kPtsPerSide; i > 0; --i) {
110 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength);
112 for (int i = kPtsPerSide; i > 0; --i) {
113 fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide);
  /external/skqp/gm/
convexpaths.cpp 100 kPtsPerSide = (1 << 12),
103 for (int i = 1; i < kPtsPerSide; ++i) { // skip the first point due to moveTo.
104 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0);
106 for (int i = 0; i < kPtsPerSide; ++i) {
107 fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide);
109 for (int i = kPtsPerSide; i > 0; --i) {
110 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength);
112 for (int i = kPtsPerSide; i > 0; --i) {
113 fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide);

Completed in 153 milliseconds