()
| 34 | } |
| 35 | |
| 36 | public void iter() { |
| 37 | try (Path p = new Path().moveTo(10, 10).lineTo(20, 0).lineTo(20, 20).closePath(); |
| 38 | var i = p.iterator();) { |
| 39 | assertEquals(true, i.hasNext()); |
| 40 | PathSegment s = i.next(); |
| 41 | assertEquals(PathVerb.MOVE, s.getVerb()); |
| 42 | assertEquals(new Point(10, 10), s.getP0()); |
| 43 | assertEquals(true, s.isClosedContour()); |
| 44 | |
| 45 | assertEquals(true, i.hasNext()); |
| 46 | s = i.next(); |
| 47 | assertEquals(PathVerb.LINE, s.getVerb()); |
| 48 | assertEquals(new Point(10, 10), s.getP0()); |
| 49 | assertEquals(new Point(20, 0), s.getP1()); |
| 50 | assertEquals(false, s.isCloseLine()); |
| 51 | |
| 52 | assertEquals(true, i.hasNext()); |
| 53 | s = i.next(); |
| 54 | assertEquals(PathVerb.LINE, s.getVerb()); |
| 55 | assertEquals(new Point(20, 0), s.getP0()); |
| 56 | assertEquals(new Point(20, 20), s.getP1()); |
| 57 | assertEquals(false, s.isCloseLine()); |
| 58 | |
| 59 | assertEquals(true, i.hasNext()); |
| 60 | s = i.next(); |
| 61 | assertEquals(PathVerb.LINE, s.getVerb()); |
| 62 | assertEquals(new Point(20, 20), s.getP0()); |
| 63 | assertEquals(new Point(10, 10), s.getP1()); |
| 64 | assertEquals(true, s.isCloseLine()); |
| 65 | |
| 66 | assertEquals(true, i.hasNext()); |
| 67 | s = i.next(); |
| 68 | assertEquals(PathVerb.CLOSE, s.getVerb()); |
| 69 | assertEquals(new Point(10, 10), s.getP0()); |
| 70 | |
| 71 | assertEquals(false, i.hasNext()); |
| 72 | assertThrows(NoSuchElementException.class, () -> i.next()); |
| 73 | } |
| 74 | } |
| 75 | |
| 76 | |
| 77 | public void convexity() { |
no test coverage detected