0N/A/*
2362N/A * Copyright (c) 1997, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A */
0N/A
0N/Apackage java.awt.geom;
0N/A
0N/Aimport java.util.*;
0N/A
0N/A/**
0N/A * A utility class to iterate over the path segments of an rounded rectangle
0N/A * through the PathIterator interface.
0N/A *
0N/A * @author Jim Graham
0N/A */
0N/Aclass RoundRectIterator implements PathIterator {
0N/A double x, y, w, h, aw, ah;
0N/A AffineTransform affine;
0N/A int index;
0N/A
0N/A RoundRectIterator(RoundRectangle2D rr, AffineTransform at) {
0N/A this.x = rr.getX();
0N/A this.y = rr.getY();
0N/A this.w = rr.getWidth();
0N/A this.h = rr.getHeight();
0N/A this.aw = Math.min(w, Math.abs(rr.getArcWidth()));
0N/A this.ah = Math.min(h, Math.abs(rr.getArcHeight()));
0N/A this.affine = at;
0N/A if (aw < 0 || ah < 0) {
0N/A // Don't draw anything...
0N/A index = ctrlpts.length;
0N/A }
0N/A }
0N/A
0N/A /**
0N/A * Return the winding rule for determining the insideness of the
0N/A * path.
0N/A * @see #WIND_EVEN_ODD
0N/A * @see #WIND_NON_ZERO
0N/A */
0N/A public int getWindingRule() {
0N/A return WIND_NON_ZERO;
0N/A }
0N/A
0N/A /**
0N/A * Tests if there are more points to read.
0N/A * @return true if there are more points to read
0N/A */
0N/A public boolean isDone() {
0N/A return index >= ctrlpts.length;
0N/A }
0N/A
0N/A /**
0N/A * Moves the iterator to the next segment of the path forwards
0N/A * along the primary direction of traversal as long as there are
0N/A * more points in that direction.
0N/A */
0N/A public void next() {
0N/A index++;
0N/A }
0N/A
0N/A private static final double angle = Math.PI / 4.0;
0N/A private static final double a = 1.0 - Math.cos(angle);
0N/A private static final double b = Math.tan(angle);
0N/A private static final double c = Math.sqrt(1.0 + b * b) - 1 + a;
0N/A private static final double cv = 4.0 / 3.0 * a * b / c;
0N/A private static final double acv = (1.0 - cv) / 2.0;
0N/A
0N/A // For each array:
0N/A // 4 values for each point {v0, v1, v2, v3}:
0N/A // point = (x + v0 * w + v1 * arcWidth,
0N/A // y + v2 * h + v3 * arcHeight);
0N/A private static double ctrlpts[][] = {
0N/A { 0.0, 0.0, 0.0, 0.5 },
0N/A { 0.0, 0.0, 1.0, -0.5 },
0N/A { 0.0, 0.0, 1.0, -acv,
0N/A 0.0, acv, 1.0, 0.0,
0N/A 0.0, 0.5, 1.0, 0.0 },
0N/A { 1.0, -0.5, 1.0, 0.0 },
0N/A { 1.0, -acv, 1.0, 0.0,
0N/A 1.0, 0.0, 1.0, -acv,
0N/A 1.0, 0.0, 1.0, -0.5 },
0N/A { 1.0, 0.0, 0.0, 0.5 },
0N/A { 1.0, 0.0, 0.0, acv,
0N/A 1.0, -acv, 0.0, 0.0,
0N/A 1.0, -0.5, 0.0, 0.0 },
0N/A { 0.0, 0.5, 0.0, 0.0 },
0N/A { 0.0, acv, 0.0, 0.0,
0N/A 0.0, 0.0, 0.0, acv,
0N/A 0.0, 0.0, 0.0, 0.5 },
0N/A {},
0N/A };
0N/A private static int types[] = {
0N/A SEG_MOVETO,
0N/A SEG_LINETO, SEG_CUBICTO,
0N/A SEG_LINETO, SEG_CUBICTO,
0N/A SEG_LINETO, SEG_CUBICTO,
0N/A SEG_LINETO, SEG_CUBICTO,
0N/A SEG_CLOSE,
0N/A };
0N/A
0N/A /**
0N/A * Returns the coordinates and type of the current path segment in
0N/A * the iteration.
0N/A * The return value is the path segment type:
0N/A * SEG_MOVETO, SEG_LINETO, SEG_QUADTO, SEG_CUBICTO, or SEG_CLOSE.
0N/A * A float array of length 6 must be passed in and may be used to
0N/A * store the coordinates of the point(s).
0N/A * Each point is stored as a pair of float x,y coordinates.
0N/A * SEG_MOVETO and SEG_LINETO types will return one point,
0N/A * SEG_QUADTO will return two points,
0N/A * SEG_CUBICTO will return 3 points
0N/A * and SEG_CLOSE will not return any points.
0N/A * @see #SEG_MOVETO
0N/A * @see #SEG_LINETO
0N/A * @see #SEG_QUADTO
0N/A * @see #SEG_CUBICTO
0N/A * @see #SEG_CLOSE
0N/A */
0N/A public int currentSegment(float[] coords) {
0N/A if (isDone()) {
0N/A throw new NoSuchElementException("roundrect iterator out of bounds");
0N/A }
0N/A double ctrls[] = ctrlpts[index];
0N/A int nc = 0;
0N/A for (int i = 0; i < ctrls.length; i += 4) {
0N/A coords[nc++] = (float) (x + ctrls[i + 0] * w + ctrls[i + 1] * aw);
0N/A coords[nc++] = (float) (y + ctrls[i + 2] * h + ctrls[i + 3] * ah);
0N/A }
0N/A if (affine != null) {
0N/A affine.transform(coords, 0, coords, 0, nc / 2);
0N/A }
0N/A return types[index];
0N/A }
0N/A
0N/A /**
0N/A * Returns the coordinates and type of the current path segment in
0N/A * the iteration.
0N/A * The return value is the path segment type:
0N/A * SEG_MOVETO, SEG_LINETO, SEG_QUADTO, SEG_CUBICTO, or SEG_CLOSE.
0N/A * A double array of length 6 must be passed in and may be used to
0N/A * store the coordinates of the point(s).
0N/A * Each point is stored as a pair of double x,y coordinates.
0N/A * SEG_MOVETO and SEG_LINETO types will return one point,
0N/A * SEG_QUADTO will return two points,
0N/A * SEG_CUBICTO will return 3 points
0N/A * and SEG_CLOSE will not return any points.
0N/A * @see #SEG_MOVETO
0N/A * @see #SEG_LINETO
0N/A * @see #SEG_QUADTO
0N/A * @see #SEG_CUBICTO
0N/A * @see #SEG_CLOSE
0N/A */
0N/A public int currentSegment(double[] coords) {
0N/A if (isDone()) {
0N/A throw new NoSuchElementException("roundrect iterator out of bounds");
0N/A }
0N/A double ctrls[] = ctrlpts[index];
0N/A int nc = 0;
0N/A for (int i = 0; i < ctrls.length; i += 4) {
0N/A coords[nc++] = (x + ctrls[i + 0] * w + ctrls[i + 1] * aw);
0N/A coords[nc++] = (y + ctrls[i + 2] * h + ctrls[i + 3] * ah);
0N/A }
0N/A if (affine != null) {
0N/A affine.transform(coords, 0, coords, 0, nc / 2);
0N/A }
0N/A return types[index];
0N/A }
0N/A}