Java 类sun.awt.geom.Crossings 实例源码

项目：OpenJSharp 文件：Polygon.java

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;
}

项目：jdk8u-jdk 文件：Polygon.java

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;
}

项目：openjdk-jdk10 文件：Polygon.java

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;
}

项目：openjdk9 文件：Polygon.java

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;
}

项目：Java8CN 文件：Polygon.java

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;
}

项目：jdk8u_jdk 文件：Polygon.java

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;
}

项目：lookaside_java-1.8.0-openjdk 文件：Polygon.java

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;
}

项目：VarJ 文件：Polygon.java

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;
   }

项目：umple 文件：Polygon2D.java

@Nullable
private Crossings getCrossings(double xlo, double ylo,
        double xhi, double yhi) {
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    double lastx = xpoints[npoints - 1];
    double lasty = ypoints[npoints - 1];
    double 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;
}

项目：umple 文件：Polygon2D.java

@Nullable
private Crossings getCrossings(float xlo, float ylo,
        float xhi, float yhi) {
    Crossings cross = new Crossings.EvenOdd(xlo, ylo, xhi, yhi);
    float lastx = xpoints[npoints - 1];
    float lasty = ypoints[npoints - 1];
    float 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;
}

项目：jdk-1.7-annotated 文件：Polygon.java

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;
}

项目：infobip-open-jdk-8 文件：Polygon.java

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;
}

项目：jdk8u-dev-jdk 文件：Polygon.java

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;
}

项目：jdk7-jdk 文件：Polygon.java

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;
}

项目：openjdk-source-code-learn 文件：Polygon.java

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;
}

项目：OLD-OpenJDK8 文件：Polygon.java

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;
}

项目：openjdk-jdk7u-jdk 文件：Polygon.java

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;
}

项目：openjdk-icedtea7 文件：Polygon.java

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;
}

项目：OpenJSharp 文件：Polygon.java

/**
 * {@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());
}

项目：OpenJSharp 文件：Polygon.java

/**
 * {@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));
}

项目：OpenJSharp 文件：Area.java

/**
 * {@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));
}

项目：OpenJSharp 文件：Area.java

/**
 * {@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());
}

项目：jdk8u-jdk 文件：Polygon.java

/**
 * {@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());
}

项目：jdk8u-jdk 文件：Polygon.java

/**
 * {@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));
}

项目：jdk8u-jdk 文件：Area.java

/**
 * {@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));
}

项目：jdk8u-jdk 文件：Area.java

/**
 * {@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());
}

项目：openjdk-jdk10 文件：Polygon.java

/**
 * {@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());
}

项目：openjdk-jdk10 文件：Polygon.java

/**
 * {@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));
}

项目：openjdk-jdk10 文件：Area.java

/**
 * {@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));
}

项目：openjdk-jdk10 文件：Area.java

/**
 * {@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());
}

项目：openjdk9 文件：Polygon.java

/**
 * {@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());
}

项目：openjdk9 文件：Polygon.java

/**
 * {@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));
}

项目：openjdk9 文件：Area.java

/**
 * {@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));
}

项目：openjdk9 文件：Area.java

/**
 * {@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());
}

项目：Java8CN 文件：Polygon.java

/**
 * {@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());
}

项目：Java8CN 文件：Polygon.java

/**
 * {@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));
}

项目：Java8CN 文件：Area.java

/**
 * {@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));
}

项目：Java8CN 文件：Area.java

/**
 * {@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());
}

项目：jdk8u_jdk 文件：Polygon.java

/**
 * {@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());
}

项目：jdk8u_jdk 文件：Polygon.java

/**
 * {@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));
}