Lines Matching +full:- +full:- +full:detach
4 * Use of this source code is governed by a BSD-style license that can be
36 is_empty(reporter, b.detach()); in DEF_TEST()
42 SkPath p2 = b.detach(); in DEF_TEST()
56 is_empty(reporter, b.detach()); in DEF_TEST()
68 for (const SkPath& path : { b.snapshot(), b.detach() }) { in DEF_TEST()
135 auto bp = b.detach(); in DEF_TEST()
200 auto bp = SkPathBuilder().addOval(r, dir, i).detach(); in DEF_TEST()
205 auto bp = SkPathBuilder().addOval(r, dir).detach(); in DEF_TEST()
210 // test negative case -- can't have any other segments in DEF_TEST()
211 bp = SkPathBuilder().addOval(r, dir).lineTo(10, 10).detach(); in DEF_TEST()
213 bp = SkPathBuilder().lineTo(10, 10).addOval(r, dir).detach(); in DEF_TEST()
225 auto bp = b.detach(); in DEF_TEST()
231 auto bp = SkPathBuilder().addRRect(rr, dir).detach(); in DEF_TEST()
236 // test negative case -- can't have any other segments in DEF_TEST()
238 bp = SkPathBuilder().addRRect(rr, dir).lineTo(10, 10).detach(); in DEF_TEST()
240 bp = SkPathBuilder().lineTo(10, 10).addRRect(rr, dir).detach(); in DEF_TEST()
260 auto p0 = b.detach(); in DEF_TEST()
291 return builder.detach(); in DEF_TEST()
296 auto path0 = SkPathBuilder().addPolygon(pts, i, isClosed).detach(); in DEF_TEST()
313 REPORTER_ASSERT(reporter, p == SkPathBuilder().addPath(p).detach()); in DEF_TEST()
328 const int lastMoveToIndex = (ctrCount - 1) * N; in DEF_TEST()
335 builder.addPolygon(pts, N, isClosed); // new-school way in DEF_TEST()
336 b.addPoly(pts, N, isClosed); // old-school way in DEF_TEST()
338 a = builder.detach(); in DEF_TEST()
376 pb.moveTo(5, -1); in DEF_TEST()
383 SkPath result = pb.detach(); in DEF_TEST()
386 assertIsMoveTo(reporter, &iter, 5, -1); in DEF_TEST()
401 SkPath result = pb.detach(); in DEF_TEST()
403 reporter->push(name); in DEF_TEST()
408 reporter->pop(); in DEF_TEST()
416 test("radius is zero", {-3, 5}, {-7, 11}, 0, {-3, 5}); in DEF_TEST()