Lines Matching defs:hix

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) {}
92 int hix;
156 protected Region(int lox, int loy, int hix, int hiy) {
159 this.hix = hix;
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);
336 this.hix = box[2];
343 * hix, hiy format.
348 public void setOutputAreaXYXY(int lox, int loy, int hix, int hiy) {
351 this.hix = hix;
387 int thix = clipScale(hix, sx);
425 ret.lox = ret.loy = ret.hix = ret.hiy = 0;
431 ret.hix = newbands[4];
457 int thix = hix + dx;
461 (thix > hix) != (dx > 0) ||
491 int thix = clipAdd(hix, dx);
529 ret.lox = ret.loy = ret.hix = ret.hiy = 0;
535 ret.hix = newbands[4];
572 public Region getIntersectionXYXY(int lox, int loy, int hix, int hiy) {
573 if (isInsideXYXY(lox, loy, hix, hiy)) {
578 (hix > this.hix) ? this.hix : hix,
607 (r.hix > this.hix) ? this.hix : r.hix,
636 (r.hix < this.hix) ? this.hix : r.hix,
661 Region ret = new Region(this.lox, this.loy, this.hix, this.hiy);
687 (r.hix < this.hix) ? this.hix : r.hix,
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};
789 while (x < hix) {
796 ax1 = ax2 = hix;
806 bx1 = bx2 = hix;
868 * rectangular area in lox, loy, hix, hiy format.
874 int hix, int hiy)
878 this.hix <= hix && this.hiy <= hiy)
884 (hix > this.hix) ? this.hix : hix,
905 (r.hix > this.hix) ? this.hix : r.hix,
921 if ((spanhix = box[2]) > hix) spanhix = hix;
996 lox = loy = hix = hiy = 0;
1001 hix = bands[4];
1007 int lox = this.hix;
1008 int hix = this.lox;
1020 if (hix < bands[i - 1]) {
1021 hix = bands[i - 1];
1027 this.hix = hix;
1049 return hix;
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) {
1140 this.hix <= hix && this.hiy <= hiy);
1154 r.hix >= this.hix && r.hiy >= this.hiy);
1159 * rectangular area specified in lox, loy, hix, hiy format.
1166 int hix, int hiy)
1168 return (hix > this.lox && lox < this.hix &&
1181 return (r.hix > this.lox && r.lox < this.hix &&
1195 this.hix >= r.hix && this.hiy >= r.hiy);
1211 * rectangular area specified in lox, loy, hix, hiy format.
1216 public boolean encompassesXYXY(int lox, int loy, int hix, int hiy) {
1219 this.hix >= hix && this.hiy >= hiy);
1228 pathbox[2] = hix;
1238 if (bbox[2] > hix) bbox[2] = hix;
1272 si.intersectClipBox(lox, loy, hix, hiy);
1286 sb.append(hix);
1315 return (isEmpty() ? 0 : (lox * 3 + loy * 5 + hix * 7 + hiy * 9));
1329 r.hix != this.hix || r.hiy != this.hiy)