当前位置: 首页>>代码示例>>Java>>正文


Java Crossings类代码示例

本文整理汇总了Java中sun.awt.geom.Crossings的典型用法代码示例。如果您正苦于以下问题:Java Crossings类的具体用法?Java Crossings怎么用?Java Crossings使用的例子?那么, 这里精选的类代码示例或许可以为您提供帮助。


Crossings类属于sun.awt.geom包,在下文中一共展示了Crossings类的7个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: getCrossings

import sun.awt.geom.Crossings; //导入依赖的package包/类
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;
}
 
开发者ID:SunburstApps,项目名称:OpenJSharp,代码行数:22,代码来源:Polygon.java

示例2: getCrossings

import sun.awt.geom.Crossings; //导入依赖的package包/类
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;
   }
 
开发者ID:jgaltidor,项目名称:VarJ,代码行数:22,代码来源:Polygon.java

示例3: getCrossings

import sun.awt.geom.Crossings; //导入依赖的package包/类
@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;
}
 
开发者ID:umple,项目名称:umple,代码行数:22,代码来源:Polygon2D.java

示例4: intersects

import sun.awt.geom.Crossings; //导入依赖的package包/类
/**
 * {@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());
}
 
开发者ID:SunburstApps,项目名称:OpenJSharp,代码行数:13,代码来源:Polygon.java

示例5: contains

import sun.awt.geom.Crossings; //导入依赖的package包/类
/**
 * {@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));
}
 
开发者ID:SunburstApps,项目名称:OpenJSharp,代码行数:13,代码来源:Polygon.java

示例6: contains

import sun.awt.geom.Crossings; //导入依赖的package包/类
/**
 * {@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));
}
 
开发者ID:SunburstApps,项目名称:OpenJSharp,代码行数:15,代码来源:Area.java

示例7: intersects

import sun.awt.geom.Crossings; //导入依赖的package包/类
/**
 * {@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());
}
 
开发者ID:SunburstApps,项目名称:OpenJSharp,代码行数:15,代码来源:Area.java


注:本文中的sun.awt.geom.Crossings类示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。