sun.awt.geom.Crossings Java Examples

The following examples show how to use sun.awt.geom.Crossings. You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example #1
Source File: Polygon.java    From jdk8u-jdk with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #2
Source File: Polygon.java    From jdk-1.7-annotated with Apache License 2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #3
Source File: Polygon.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #4
Source File: Polygon.java    From JDKSourceCode1.8 with MIT License 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #5
Source File: Polygon.java    From openjdk-8 with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #6
Source File: Polygon.java    From hottub with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #7
Source File: Polygon.java    From jdk8u60 with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #8
Source File: Polygon.java    From Bytecoder with Apache License 2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #9
Source File: Polygon.java    From Java8CN with Apache License 2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #10
Source File: Polygon.java    From TencentKona-8 with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #11
Source File: Polygon.java    From jdk8u-jdk with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #12
Source File: Polygon.java    From openjdk-jdk9 with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #13
Source File: Polygon.java    From dragonwell8_jdk with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #14
Source File: Polygon.java    From jdk8u-dev-jdk with GNU General Public License v2.0 6 votes vote down vote up 
private Crossings getCrossings(double xlo, double ylo,
                               double xhi, double yhi)
{
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    int lastx = xpoints[npoints - 1];
    int lasty = ypoints[npoints - 1];
    int curx, cury;

    // Walk the edges of the polygon
    for (int i = 0; i < npoints; i++) {
        curx = xpoints[i];
        cury = ypoints[i];
        if (cross.accumulateLine(lastx, lasty, curx, cury)) {
            return null;
        }
        lastx = curx;
        lasty = cury;
    }

    return cross;
}
Example #15
Source File: Polygon.java    From jdk8u-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross == null || !cross.isEmpty());
}
Example #16
Source File: Polygon.java    From jdk8u-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross == null || !cross.isEmpty());
}
Example #17
Source File: Polygon.java    From jdk-1.7-annotated with Apache License 2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross == null || !cross.isEmpty());
}
Example #18
Source File: Area.java    From jdk8u_jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (w < 0 || h < 0) {
        return false;
    }
    if (!getCachedBounds().intersects(x, y, w, h)) {
        return false;
    }
    Crossings c = Crossings.findCrossings(curves, x, y, x+w, y+h);
    return (c == null || !c.isEmpty());
}
Example #19
Source File: Polygon.java    From jdk8u_jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross != null && cross.covers(y, y+h));
}
Example #20
Source File: Area.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (w < 0 || h < 0) {
        return false;
    }
    if (!getCachedBounds().contains(x, y, w, h)) {
        return false;
    }
    Crossings c = Crossings.findCrossings(curves, x, y, x+w, y+h);
    return (c != null && c.covers(y, y+h));
}
Example #21
Source File: Area.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (w < 0 || h < 0) {
        return false;
    }
    if (!getCachedBounds().contains(x, y, w, h)) {
        return false;
    }
    Crossings c = Crossings.findCrossings(curves, x, y, x+w, y+h);
    return (c != null && c.covers(y, y+h));
}
Example #22
Source File: Polygon.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross != null && cross.covers(y, y+h));
}
Example #23
Source File: Polygon.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross == null || !cross.isEmpty());
}
Example #24
Source File: Area.java    From jdk8u-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (w < 0 || h < 0) {
        return false;
    }
    if (!getCachedBounds().intersects(x, y, w, h)) {
        return false;
    }
    Crossings c = Crossings.findCrossings(curves, x, y, x+w, y+h);
    return (c == null || !c.isEmpty());
}
Example #25
Source File: Polygon.java    From jdk8u-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross != null && cross.covers(y, y+h));
}
Example #26
Source File: Area.java    From Java8CN with Apache License 2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (w < 0 || h < 0) {
        return false;
    }
    if (!getCachedBounds().intersects(x, y, w, h)) {
        return false;
    }
    Crossings c = Crossings.findCrossings(curves, x, y, x+w, y+h);
    return (c == null || !c.isEmpty());
}
Example #27
Source File: Area.java    From Java8CN with Apache License 2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (w < 0 || h < 0) {
        return false;
    }
    if (!getCachedBounds().contains(x, y, w, h)) {
        return false;
    }
    Crossings c = Crossings.findCrossings(curves, x, y, x+w, y+h);
    return (c != null && c.covers(y, y+h));
}
Example #28
Source File: Polygon.java    From Java8CN with Apache License 2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross != null && cross.covers(y, y+h));
}
Example #29
Source File: Polygon.java    From Java8CN with Apache License 2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean intersects(double x, double y, double w, double h) {
    if (npoints <= 0 || !getBoundingBox().intersects(x, y, w, h)) {
        return false;
    }

    Crossings cross = getCrossings(x, y, x+w, y+h);
    return (cross == null || !cross.isEmpty());
}
Example #30
Source File: Area.java    From jdk8u-jdk with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * {@inheritDoc}
 * @since 1.2
 */
public boolean contains(double x, double y, double w, double h) {
    if (w < 0 || h < 0) {
        return false;
    }
    if (!getCachedBounds().contains(x, y, w, h)) {
        return false;
    }
    Crossings c = Crossings.findCrossings(curves, x, y, x+w, y+h);
    return (c != null && c.covers(y, y+h));
}