Cross Reference: /openjdk7/jdk/src/share/classes/sun/java2d/pipe/Region.java

Lines Matching defs:lox
39  * (lox, loy, hix, hiy).
71         protected ImmutableRegion(int lox, int loy, int hix, int hiy) {
72             super(lox, loy, hix, hiy);
80         public void setOutputAreaXYXY(int lox, int loy, int hix, int hiy) {}
90     int lox;
156     protected Region(int lox, int loy, int hix, int hiy) {
157         this.lox = lox;
293      * by the indicated rectangular area in lox, loy, hix, hiy format.
298     public static Region getInstanceXYXY(int lox, int loy, int hix, int hiy) {
299         return new Region(lox, loy, hix, hiy);
334         this.lox = box[0];
342      * region bands.  The rectangle is specified in lox, loy,
348     public void setOutputAreaXYXY(int lox, int loy, int hix, int hiy) {
349         this.lox = lox;
385         int tlox = clipScale(lox, sx);
425                     ret.lox = ret.loy = ret.hix = ret.hiy = 0;
430                     ret.lox = newbands[3];
455         int tlox = lox + dx;
459         if ((tlox > lox) != (dx > 0) ||
489         int tlox = clipAdd(lox, dx);
529                     ret.lox = ret.loy = ret.hix = ret.hiy = 0;
534                     ret.lox = newbands[3];
572     public Region getIntersectionXYXY(int lox, int loy, int hix, int hiy) {
573         if (isInsideXYXY(lox, loy, hix, hiy)) {
576         Region ret = new Region((lox < this.lox) ? this.lox : lox,
605         Region ret = new Region((r.lox < this.lox) ? this.lox : r.lox,
634         Region ret = new Region((r.lox > this.lox) ? this.lox : r.lox,
661         Region ret = new Region(this.lox, this.loy, this.hix, this.hiy);
685         Region ret = new Region((r.lox > this.lox) ? this.lox : r.lox,
701             abands = new int[] {ra.loy, ra.hiy, 1, ra.lox, ra.hix};
704             bbands = new int[] {rb.loy, rb.hiy, 1, rb.lox, rb.hix};
788                 if (x < lox) x = lox;
868      * rectangular area in lox, loy, hix, hiy format.
873     public Region getBoundsIntersectionXYXY(int lox, int loy,
877             this.lox >= lox && this.loy >= loy &&
882         return new Region((lox < this.lox) ? this.lox : lox,
903         return new Region((r.lox < this.lox) ? this.lox : r.lox,
919         if ((spanlox = box[0]) < lox) spanlox = lox;
996                 lox = loy = hix = hiy = 0;
1000                 lox = bands[3];
1007         int lox = this.hix;
1008         int hix = this.lox;
1016             if (lox > bands[i]) {
1017                 lox = bands[i];
1025         this.lox = lox;
1035         return lox;
1063         if (hix < lox) return 0;
1065         if ((w = hix - lox) < 0) {
1087         return (hix <= lox || hiy <= loy);
1102         if (x < lox || x >= hix || y < loy || y >= hiy) return false;
1136      * rectangular area specified in lox, loy, hix, hiy format.
1138     public boolean isInsideXYXY(int lox, int loy, int hix, int hiy) {
1139         return (this.lox >= lox && this.loy >= loy &&
1153                 r.lox <= this.lox && r.loy <= this.loy &&
1159      * rectangular area specified in lox, loy, hix, hiy format.
1165     public boolean intersectsQuickCheckXYXY(int lox, int loy,
1168         return (hix > this.lox && lox < this.hix &&
1181         return (r.hix > this.lox && r.lox < this.hix &&
1194                 this.lox <= r.lox && this.loy <= r.loy &&
1211      * rectangular area specified in lox, loy, hix, hiy format.
1216     public boolean encompassesXYXY(int lox, int loy, int hix, int hiy) {
1218                 this.lox <= lox && this.loy <= loy &&
1226         pathbox[0] = lox;
1236         if (bbox[0] < lox) bbox[0] = lox;
1272             si.intersectClipBox(lox, loy, hix, hiy);
1282         sb.append(lox);
1315         return (isEmpty() ? 0 : (lox * 3 + loy * 5 + hix * 7 + hiy * 9));
1328         if (r.lox != this.lox || r.loy != this.loy ||