Lines Matching defs:pi

232                 PathIterator pi = s.getPathIterator(at);
233 setWindingRule(pi.getWindingRule());
236 append(pi, false);
654 public final void append(PathIterator pi, boolean connect) {
656 while (!pi.isDone()) {
657 switch (pi.currentSegment(coords)) {
687 pi.next();
1066 PathIterator pi = s.getPathIterator(at);
1067 setWindingRule(pi.getWindingRule());
1070 append(pi, false);
1379 public final void append(PathIterator pi, boolean connect) {
1381 while (!pi.isDone()) {
1382 switch (pi.currentSegment(coords)) {
1412 pi.next();
1816 * @param pi the {@code PathIterator} whose geometry is appended to
1823 public abstract void append(PathIterator pi, boolean connect);
1962 * @param pi the specified {@code PathIterator}
1969 public static boolean contains(PathIterator pi, double x, double y) {
1974 int mask = (pi.getWindingRule() == WIND_NON_ZERO ? -1 : 1);
1975 int cross = Curve.pointCrossingsForPath(pi, x, y);
1995 * @param pi the specified {@code PathIterator}
2001 public static boolean contains(PathIterator pi, Point2D p) {
2002 return contains(pi, p.getX(), p.getY());
2059 * @param pi the specified {@code PathIterator}
2068 public static boolean contains(PathIterator pi,
2085 int mask = (pi.getWindingRule() == WIND_NON_ZERO ? -1 : 2);
2086 int crossings = Curve.rectCrossingsForPath(pi, x, y, x+w, y+h);
2113 * @param pi the specified {@code PathIterator}
2119 public static boolean contains(PathIterator pi, Rectangle2D r) {
2120 return contains(pi, r.getX(), r.getY(), r.getWidth(), r.getHeight());
2208 * @param pi the specified {@code PathIterator}
2218 public static boolean intersects(PathIterator pi,
2235 int mask = (pi.getWindingRule() == WIND_NON_ZERO ? -1 : 2);
2236 int crossings = Curve.rectCrossingsForPath(pi, x, y, x+w, y+h);
2262 * @param pi the specified {@code PathIterator}
2269 public static boolean intersects(PathIterator pi, Rectangle2D r) {
2270 return intersects(pi, r.getX(), r.getY(), r.getWidth(), r.getHeight());