java2d/pipe/Region.java

44  * (lox, loy, hix, hiy).
79     private int lox;
173     private Region(int lox, int loy, int hix, int hiy) {
174         this.lox = lox;
180     private Region(int lox, int loy, int hix, int hiy, int[] bands, int end) {
181         this.lox = lox;
284      * indicated rectangular area in lox, loy, hix, hiy and edges array, which
290     static Region getInstance(final int lox, final int loy, final int hix,
294         if (hiy <= loy || hix <= lox || y2 <= y1) {
302             final int spanlox = Math.max(clipAdd(lox, edges[index++]), lox);
303             final int spanhix = Math.min(clipAdd(lox, edges[index++]), hix);
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.
409         int tlox = clipScale(lox, sx);
449                     ret.lox = ret.loy = ret.hix = ret.hiy = 0;
454                     ret.lox = newbands[3];
479         int tlox = lox + dx;
483         if ((tlox > lox) != (dx > 0) ||
513         int tlox = clipAdd(lox, dx);
553                     ret.lox = ret.loy = ret.hix = ret.hiy = 0;
558                     ret.lox = newbands[3];
609     public Region getIntersectionXYXY(double lox, double loy, double hix,
611         if (isNaN(lox) || isNaN(loy) || isNaN(hix) || isNaN(hiy)) {
614         return getIntersectionXYXY(clipRound(lox), clipRound(loy),
623     public Region getIntersectionXYXY(int lox, int loy, int hix, int hiy) {
624         if (isInsideXYXY(lox, loy, hix, hiy)) {
627         Region ret = new Region((lox < this.lox) ? this.lox : lox,
656         Region ret = new Region((r.lox < this.lox) ? this.lox : r.lox,
685         Region ret = new Region((r.lox > this.lox) ? this.lox : r.lox,
712         Region ret = new Region(this.lox, this.loy, this.hix, this.hiy);
736         Region ret = new Region((r.lox > this.lox) ? this.lox : r.lox,
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};
839                 if (x < lox) x = lox;
919      * rectangular area in lox, loy, hix, hiy format.
924     public Region getBoundsIntersectionXYXY(int lox, int loy,
928             this.lox >= lox && this.loy >= loy &&
933         return new Region((lox < this.lox) ? this.lox : lox,
954         return new Region((r.lox < this.lox) ? this.lox : r.lox,
970         if ((spanlox = box[0]) < lox) spanlox = lox;
1047                 lox = loy = hix = hiy = 0;
1051                 lox = bands[3];
1058         int lox = this.hix;
1059         int hix = this.lox;
1067             if (lox > bands[i]) {
1068                 lox = bands[i];
1076         this.lox = lox;
1086         return lox;
1114         if (hix < lox) return 0;
1116         if ((w = hix - lox) < 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) {
1190         return (this.lox >= lox && this.loy >= loy &&
1204                 r.lox <= this.lox && r.loy <= this.loy &&
1210      * rectangular area specified in lox, loy, hix, hiy format.
1216     public boolean intersectsQuickCheckXYXY(int lox, int loy,
1219         return (hix > this.lox && lox < this.hix &&
1232         return (r.hix > this.lox && r.lox < this.hix &&
1245                 this.lox <= r.lox && this.loy <= r.loy &&
1262      * rectangular area specified in lox, loy, hix, hiy format.
1267     public boolean encompassesXYXY(int lox, int loy, int hix, int hiy) {
1269                 this.lox <= lox && this.loy <= loy &&
1277         pathbox[0] = lox;
1287         if (bbox[0] < lox) bbox[0] = lox;
1323             si.intersectClipBox(lox, loy, hix, hiy);
1334         sb.append(lox);
1368         return (isEmpty() ? 0 : (lox * 3 + loy * 5 + hix * 7 + hiy * 9));
1385         if (r.lox != this.lox || r.loy != this.loy ||