Lines Matching refs:close
97 path->close();
103 path->close();
198 path.close();
223 path.close();
241 path->close();
270 path->close();
313 // This test checks that r{Line,Quad,Conic,Cubic}To following a close()
314 // are relative to the point we close to, not relative to the point we close from.
321 path.close(); // Returns us back to 0,0.
332 path.close();
343 path.close();
354 path.close();
468 path.close();path.moveTo(0.995934f, 22.4779f);
485 path.close();
519 path.close();
827 path->close();
954 path.close();
960 path.close();
970 // end with a single close
971 // only have (at most) 1 close
1143 path.close();
1149 path.close();
1159 path->close();
1238 // if we force a close on the interator we should have a close
1247 closePt.close();
1256 empty.close();
1262 rect.close();
1268 quad.close();
1275 cubic.close();
1282 line.close();
1287 rect2.close();
1290 rect2.close();
1295 oval3.close();
1298 oval3.close();
1325 tinyConvexPolygon.close();
1333 platTriangle.close();
1341 platTriangle.close();
1349 pt.close();
1356 line.close();
1364 triLeft.close();
1372 triRight.close();
1381 square.close();
1398 redundantSquare.close();
1415 bowTie.close();
1427 spiral.close();
1437 dent.close();
1480 badFirstVector.close();
1495 falseBackEdge.close();
1732 path.close();
1913 path.close();
1925 path.close();
2022 path.close();
2063 // no close, but we should detect them as fillably the same as a rect
2126 path.close();
2158 // fail, close then line
2164 path1.close();
2177 path1.close();
2186 path1.close();
2198 path1.close();
2210 path1.close();
2240 path.close();
2276 // A redundant close shouldn't cause a failure.
2277 path2.close();
2314 // down, up, left, close
2323 path.close();
2326 // right, left, up, close
2332 path.close();
2341 path.close();
2350 path.close();
2383 // success, no close is OK
2384 SkPoint c1[] = {{0, 0}, {1, 0}, {1, 1}, {0, 1}}; // close doesn't match
2435 path.close();
2464 // fail, close then line
2473 path1.close();
2492 path1.close();
2507 path1.close();
2525 path1.close();
2543 path1.close();
2693 p.close();
2907 // Test that close path makes no difference for an empty path
2915 // Test that close path makes no difference
2973 p.close();
3084 // Initial close is never ever stored
3086 path.close();
3090 // Move/close sequences
3092 path.close(); // Not stored, no purpose
3094 path.close();
3095 path.close(); // Not stored, no purpose
3097 path.close();
3100 path.close();
3227 path.close();
3874 p.close();
3970 q.close();
4005 p.close();
4209 p.close();
4409 q.close();
4490 path.close();
4517 path.close();
4528 path.close();
4561 path.close();
4577 path.close();
4587 path.close();
4627 path.close();
4663 path.close();
4691 path.close();
4715 path.close();
4731 path.close();
4751 path.close();
5212 auto makePath = [](const SkPoint* points, size_t count, bool close) -> SkPath {
5217 if (close) {
5218 path.close();
5233 path.close();
5657 case SkPath::kClose_Verb: path.close(); break;
5751 * path.moveTo....close()
5785 path1.moveTo(20,30).lineTo(40,30).lineTo(40,50).lineTo(20,50).close();
5818 // with a kClose, in which case we need to fiddle with our lastMoveIndex (as ::close() does)