java2d/pipe/Region.java

44  * (lox, loy, hix, hiy).
82     private int hiy;
173     private Region(int lox, int loy, int hix, int hiy) {
177         this.hiy = hiy;
180     private Region(int lox, int loy, int hix, int hiy, int[] bands, int end) {
184         this.hiy = hiy;
284      * indicated rectangular area in lox, loy, hix, hiy and edges array, which
291                               final int hiy, final int[] edges) {
294         if (hiy <= loy || hix <= lox || y2 <= y1) {
306                 final int spanhiy = Math.min(clipAdd(spanloy, 1), hiy);
316         return end != 0 ? new Region(lox, loy, hix, hiy, bands, end)
355      * by the indicated rectangular area in lox, loy, hix, hiy format.
360     public static Region getInstanceXYXY(int lox, int loy, int hix, int hiy) {
361         return new Region(lox, loy, hix, hiy);
366      * indicated rectangular area in lox, loy, hix, hiy format.
412         int thiy = clipScale(hiy, sy);
449                     ret.lox = ret.loy = ret.hix = ret.hiy = 0;
453                     ret.hiy = newbands[1];
482         int thiy = hiy + dy;
486             (thiy > hiy) != (dy > 0))
516         int thiy = clipAdd(hiy, dy);
553                     ret.lox = ret.loy = ret.hix = ret.hiy = 0;
557                     ret.hiy = newbands[1];
610                                       double hiy) {
611         if (isNaN(lox) || isNaN(loy) || isNaN(hix) || isNaN(hiy)) {
615                                    clipRound(hix), clipRound(hiy));
623     public Region getIntersectionXYXY(int lox, int loy, int hix, int hiy) {
624         if (isInsideXYXY(lox, loy, hix, hiy)) {
630                                 (hiy > this.hiy) ? this.hiy : hiy);
659                                 (r.hiy > this.hiy) ? this.hiy : r.hiy);
688                                 (r.hiy < this.hiy) ? this.hiy : r.hiy);
712         Region ret = new Region(this.lox, this.loy, this.hix, this.hiy);
739                                 (r.hiy < this.hiy) ? this.hiy : r.hiy);
752             abands = new int[] {ra.loy, ra.hiy, 1, ra.lox, ra.hix};
755             bbands = new int[] {rb.loy, rb.hiy, 1, rb.lox, rb.hix};
769         while (y < hiy) {
779                     ay1 = ay2 = hiy;
792                     by1 = by2 = hiy;
919      * rectangular area in lox, loy, hix, hiy format.
925                                             int hix, int hiy)
929             this.hix <= hix && this.hiy <= hiy)
936                           (hiy > this.hiy) ? this.hiy : hiy);
957                           (r.hiy > this.hiy) ? this.hiy : r.hiy);
973         if ((spanhiy = box[3]) > hiy) spanhiy = hiy;
1047                 lox = loy = hix = hiy = 0;
1050                 hiy = bands[1];
1079         this.hiy = bands[hiyindex + 1];
1107         return hiy;
1126         if (hiy < loy) return 0;
1128         if ((h = hiy - loy) < 0) {
1138         return (hix <= lox || hiy <= loy);
1153         if (x < lox || x >= hix || y < loy || y >= hiy) return false;
1187      * rectangular area specified in lox, loy, hix, hiy format.
1189     public boolean isInsideXYXY(int lox, int loy, int hix, int hiy) {
1191                 this.hix <= hix && this.hiy <= hiy);
1205                 r.hix >= this.hix && r.hiy >= this.hiy);
1210      * rectangular area specified in lox, loy, hix, hiy format.
1217                                             int hix, int hiy)
1220                 hiy > this.loy && loy < this.hiy);
1233                 r.hiy > this.loy && r.loy < this.hiy);
1246                 this.hix >= r.hix && this.hiy >= r.hiy);
1262      * rectangular area specified in lox, loy, hix, hiy format.
1267     public boolean encompassesXYXY(int lox, int loy, int hix, int hiy) {
1270                 this.hix >= hix && this.hiy >= hiy);
1280         pathbox[3] = hiy;
1290         if (bbox[3] > hiy) bbox[3] = hiy;
1323             si.intersectClipBox(lox, loy, hix, hiy);
1340         sb.append(hiy);
1368         return (isEmpty() ? 0 : (lox * 3 + loy * 5 + hix * 7 + hiy * 9));
1386             r.hix != this.hix || r.hiy != this.hiy)