Examples of Crossings

Examples of ae.sun.awt.geom.Crossings

582
583
584
585
586
587
588
589
            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));
    }
View Full Code Here

Examples of ae.sun.awt.geom.Crossings

605
606
607
608
609
610
611
612
            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());
    }
View Full Code Here

Examples of ae.sun.awt.geom.Crossings

459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
    }

    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;
        }
View Full Code Here

Examples of ae.sun.awt.geom.Crossings

495
496
497
498
499
500
501
502
    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());
    }
View Full Code Here

Examples of ae.sun.awt.geom.Crossings

516
517
518
519
520
521
522
523
    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));
    }
View Full Code Here

Examples of sun.awt.geom.Crossings

441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
    }

    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;
  }
View Full Code Here

Examples of sun.awt.geom.Crossings

477
478
479
480
481
482
483
484
    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());
    }
View Full Code Here

Examples of sun.awt.geom.Crossings

498
499
500
501
502
503
504
505
    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));
    }
View Full Code Here

Examples of sun.awt.geom.Crossings

586
587
588
589
590
591
592
593
      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());
    }
View Full Code Here

Examples of sun.awt.geom.Crossings

494
495
496
497
498
499
500
501
    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());
    }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.