public class FlatteningPathIterator extends Object implements PathIterator
FlatteningPathIterator
class returns a flattened view of
another PathIterator
object. Other Shape
classes can use this class to provide flattening behavior for their paths
without having to perform the interpolation calculations themselves.SEG_CLOSE, SEG_CUBICTO, SEG_LINETO, SEG_MOVETO, SEG_QUADTO, WIND_EVEN_ODD, WIND_NON_ZERO
Constructor and Description |
---|
FlatteningPathIterator(PathIterator src,
double flatness)
Constructs a new
FlatteningPathIterator object that
flattens a path as it iterates over it. |
FlatteningPathIterator(PathIterator src,
double flatness,
int limit)
Constructs a new
FlatteningPathIterator object
that flattens a path as it iterates over it. |
Modifier and Type | Method and 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.
|
double |
getFlatness()
Returns the flatness of this iterator.
|
int |
getRecursionLimit()
Returns the recursion limit of this iterator.
|
int |
getWindingRule()
Returns the winding rule for determining the interior of the
path.
|
boolean |
isDone()
Tests if the iteration is complete.
|
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.
|
public FlatteningPathIterator(PathIterator src, double flatness)
FlatteningPathIterator
object that
flattens a path as it iterates over it. The iterator does not
subdivide any curve read from the source iterator to more than
10 levels of subdivision which yields a maximum of 1024 line
segments per curve.src
- the original unflattened path being iterated overflatness
- the maximum allowable distance between the
control points and the flattened curvepublic FlatteningPathIterator(PathIterator src, double flatness, int limit)
FlatteningPathIterator
object
that flattens a path as it iterates over it.
The limit
parameter allows you to control the
maximum number of recursive subdivisions that the iterator
can make before it assumes that the curve is flat enough
without measuring against the flatness
parameter.
The flattened iteration therefore never generates more than
a maximum of (2^limit)
line segments per curve.src
- the original unflattened path being iterated overflatness
- the maximum allowable distance between the
control points and the flattened curvelimit
- the maximum number of recursive subdivisions
allowed for any curved segmentIllegalArgumentException
- if
flatness
or limit
is less than zeropublic double getFlatness()
FlatteningPathIterator
.public int getRecursionLimit()
FlatteningPathIterator
.public int getWindingRule()
getWindingRule
in interface PathIterator
PathIterator.WIND_EVEN_ODD
,
PathIterator.WIND_NON_ZERO
public boolean isDone()
isDone
in interface PathIterator
true
if all the segments have
been read; false
otherwise.public void next()
next
in interface PathIterator
public int currentSegment(float[] coords)
currentSegment
in interface PathIterator
coords
- an array that holds the data returned from
this methodNoSuchElementException
- if there
are no more elements in the flattening path to be
returned.PathIterator.SEG_MOVETO
,
PathIterator.SEG_LINETO
,
PathIterator.SEG_CLOSE
public int currentSegment(double[] coords)
currentSegment
in interface PathIterator
coords
- an array that holds the data returned from
this methodNoSuchElementException
- if there
are no more elements in the flattening path to be
returned.PathIterator.SEG_MOVETO
,
PathIterator.SEG_LINETO
,
PathIterator.SEG_CLOSE
Submit a bug or feature
For further API reference and developer documentation, see Java SE Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.
Copyright © 1993, 2022, Oracle and/or its affiliates. All rights reserved. Use is subject to license terms. Also see the documentation redistribution policy.