java.awt.geom.PathIterator
public class PolylineShapeIterator
extends java.lang.Object
implements java.awt.geom.PathIterator
Modifier and Type | Field | Description |
---|---|---|
protected java.awt.geom.AffineTransform |
affine |
an affine transformation to be performed on the polyline.
|
protected int |
index |
the index of the current segment in the iterator.
|
protected PolylineShape |
poly |
The polyline over which we are going to iterate.
|
Modifier and Type | Method | Description |
---|---|---|
int |
currentSegment(double[] coords) |
Returns the coordinates and type of the current path segment in
the iteration.
|
int |
currentSegment(float[] coords) |
Returns the coordinates and type of the current path segment in
the iteration.
|
int |
getWindingRule() |
Return the winding rule for determining the insideness of the
path.
|
boolean |
isDone() |
Tests if there are more points to read.
|
void |
next() |
Moves the iterator to the next segment of the path forwards
along the primary direction of traversal as long as there are
more points in that direction.
|
protected PolylineShape poly
protected java.awt.geom.AffineTransform affine
protected int index
public int currentSegment(double[] coords)
currentSegment
in interface java.awt.geom.PathIterator
PathIterator.SEG_MOVETO
,
PathIterator.SEG_LINETO
,
PathIterator.SEG_QUADTO
,
PathIterator.SEG_CUBICTO
,
PathIterator.SEG_CLOSE
,
PathIterator.currentSegment(double[])
public int currentSegment(float[] coords)
currentSegment
in interface java.awt.geom.PathIterator
PathIterator.SEG_MOVETO
,
PathIterator.SEG_LINETO
,
PathIterator.SEG_QUADTO
,
PathIterator.SEG_CUBICTO
,
PathIterator.SEG_CLOSE
,
PathIterator.currentSegment(float[])
public int getWindingRule()
getWindingRule
in interface java.awt.geom.PathIterator
PathIterator.WIND_EVEN_ODD
,
PathIterator.WIND_NON_ZERO
,
PathIterator.getWindingRule()
public boolean isDone()
isDone
in interface java.awt.geom.PathIterator
PathIterator.isDone()
public void next()
next
in interface java.awt.geom.PathIterator
PathIterator.next()
Copyright © 1998–2018. All rights reserved.