1 // Copyright 2002 Adam Megacz, see the COPYING file for licensing [GPL]
4 // FEATURE: reflow before allowing js to read from width/height
5 // FEATURE: fastpath for rows=1/cols=1
6 // FEATURE: mark to reflow starting with a certain child
7 // FEATURE: separate mark_for_reflow and mark_for_resize
8 // FEATURE: make all methods final
9 // FEATURE: use a linked list for the "frontier" when packing
10 // FEATURE: or else have a way to mark a column "same as last one"?
11 // FEATURE: reintroduce surface.abort
17 import org.xwt.util.*;
18 import org.xwt.translators.*;
22 * Encapsulates the data for a single XWT box as well as all layout
26 * <p>The rendering process consists of four phases; each requires
27 * one DFS pass over the tree</p>
28 * <ol><li> <b>repacking</b>: children of a box are packed into columns
29 * and rows according to their colspan/rowspan attributes and
31 * <ol><li> <b>reconstraining</b>: Minimum and maximum sizes of columns are computed.
32 * <li> <b>resizing</b>: width/height and x/y positions of children
33 * are assigned, and PosChange/SizeChanges are triggered.
34 * <li> <b>repainting</b>: children draw their content onto the PixelBuffer.
37 * The first three passes together are called the <i>reflow</i> phase.
38 * Reflowing is done in a seperate pass since PosChanges and
39 * SizeChanges trigger an Surface.abort; if rendering were done in the same
40 * pass, rendering work done prior to the Surface.abort would be wasted.
42 public final class Box extends JSScope {
44 // Macros //////////////////////////////////////////////////////////////////////
47 //#define MARK_REPACK for(Box b2 = this; b2 != null && !b2.test(REPACK); b2 = b2.parent) b2.set(REPACK);
48 //#define MARK_REPACK_b for(Box b2 = b; b2 != null && !b2.test(REPACK); b2 = b2.parent) b2.set(REPACK);
49 //#define MARK_REPACK_parent for(Box b2 = parent; b2 != null && !b2.test(REPACK); b2 = b2.parent) b2.set(REPACK);
50 //#define MARK_REFLOW for(Box b2 = this; b2 != null && !b2.test(REFLOW); b2 = b2.parent) b2.set(REFLOW);
51 //#define MARK_REFLOW_b for(Box b2 = b; b2 != null && !b2.test(REFLOW); b2 = b2.parent) b2.set(REFLOW);
52 //#define MARK_RESIZE for(Box b2 = this; b2 != null && !b2.test(RESIZE); b2 = b2.parent) b2.set(RESIZE);
53 //#define MARK_RESIZE_b for(Box b2 = b; b2 != null && !b2.test(RESIZE); b2 = b2.parent) b2.set(RESIZE);
54 //#define CHECKSET_SHORT(prop) short nu = (short)toInt(value); if (nu == prop) break; prop = nu;
55 //#define CHECKSET_INT(prop) int nu = toInt(value); if (nu == prop) break; prop = nu;
56 //#define CHECKSET_FLAG(flag) boolean nu = toBoolean(value); if (nu == test(flag)) break; if (nu) set(flag); else clear(flag);
57 //#define CHECKSET_BOOLEAN(prop) boolean nu = toBoolean(value); if (nu == prop) break; prop = nu;
58 //#define CHECKSET_STRING(prop) if ((value==null&&prop==null)||(value!=null&&value.equals(prop))) break; prop=(String)value;
60 protected Box() { super(null); }
62 static Hash boxToCursor = new Hash(500, 3);
63 public static final int MAX_LENGTH = Integer.MAX_VALUE;
65 // Flags //////////////////////////////////////////////////////////////////////
67 static final int MOUSEINSIDE = 0x00000001;
68 static final int VISIBLE = 0x00000002;
69 static final int PACKED = 0x00000004;
70 static final int HSHRINK = 0x00000008;
71 static final int VSHRINK = 0x00000010;
72 static final int BLACK = 0x00000020; // for red-black code
74 static final int FIXED = 0x00000040;
75 static final boolean ROWS = true;
76 static final boolean COLS = false;
78 static final int ISROOT = 0x00000080;
79 static final int REPACK = 0x00000100;
80 static final int REFLOW = 0x00000200;
81 static final int RESIZE = 0x00000400;
82 static final int RECONSTRAIN = 0x00000800;
83 static final int ALIGN_TOP = 0x00001000;
84 static final int ALIGN_BOTTOM = 0x00002000;
85 static final int ALIGN_LEFT = 0x00004000;
86 static final int ALIGN_RIGHT = 0x00008000;
87 static final int ALIGNS = 0x0000f000;
88 static final int CURSOR = 0x00010000; // if true, this box has a cursor in the cursor hash; FEATURE: GC issues?
89 static final int NOCLIP = 0x00020000;
92 // Instance Data //////////////////////////////////////////////////////////////////////
96 int flags = VISIBLE | PACKED | REPACK | REFLOW | RESIZE | FIXED /* ROWS */;
98 private String text = null;
99 private Font font = null;
100 private Picture.Holder texture;
101 private short strokewidth = 1;
102 private int fillcolor = 0x00000000;
103 private int strokecolor = 0xFF000000;
105 // specified directly by user
106 public LENGTH minwidth = 0;
107 public LENGTH maxwidth = MAX_LENGTH;
108 public LENGTH minheight = 0;
109 public LENGTH maxheight = MAX_LENGTH;
110 private short rows = 1;
111 private short cols = 0;
112 private short rowspan = 1;
113 private short colspan = 1;
115 // computed during reflow
116 private short row = 0;
117 private short col = 0;
120 public LENGTH width = 0;
121 public LENGTH height = 0;
122 private LENGTH contentwidth = 0; // == max(minwidth, textwidth, sum(child.contentwidth))
123 private LENGTH contentheight = 0;
126 private VectorGraphics.VectorPath path = null;
127 private VectorGraphics.Affine transform = null;
128 private VectorGraphics.RasterPath rpath = null;
129 private VectorGraphics.Affine rtransform = null;
132 // Instance Methods /////////////////////////////////////////////////////////////////////
134 public Box getRoot() { return parent == null ? this : parent.getRoot(); }
135 public Surface getSurface() { return Surface.fromBox(getRoot()); }
137 // FEATURE: use cx2/cy2 format
138 /** Adds the intersection of (x,y,w,h) and the node's current actual geometry to the Surface's dirty list */
139 public void dirty() { dirty(0, 0, width, height); }
140 public void dirty(int x, int y, int w, int h) {
141 for(Box cur = this; cur != null; cur = cur.parent) {
142 if (!cur.test(NOCLIP)) {
143 w = min(x + w, cur.width) - max(x, 0);
144 h = min(y + h, cur.height) - max(y, 0);
148 if (w <= 0 || h <= 0) return;
149 if (cur.parent == null && cur.getSurface() != null) cur.getSurface().dirty(x, y, w, h);
155 /** update MOUSEINSIDE, check for Enter/Leave/Move */
156 void Move(int oldmousex, int oldmousey, int mousex, int mousey) { Move(oldmousex, oldmousey, mousex, mousey, false); }
157 void Move(int oldmousex, int oldmousey, int mousex, int mousey, boolean forceleave) {
158 boolean wasinside = test(MOUSEINSIDE);
159 boolean isinside = test(VISIBLE) && inside(mousex, mousey) && !forceleave;
160 if (isinside) set(MOUSEINSIDE); else clear(MOUSEINSIDE);
161 if (!wasinside && !isinside) return;
163 if (isinside && test(CURSOR)) Surface.fromBox(getRoot()).cursor = (String)boxToCursor.get(this);
164 if (!wasinside && isinside && getTrap("Enter") != null) putAndTriggerTraps("Enter", T);
165 else if (wasinside && !isinside && getTrap("Leave") != null) putAndTriggerTraps("Leave", T);
166 else if (wasinside && isinside && (mousex != oldmousex || mousey != oldmousey) && getTrap("Move")!= null)
167 putAndTriggerTraps("Move", T);
168 for(Box b = getChild(numchildren - 1); b != null; b = b.prevSibling()) {
169 b.Move(oldmousex - b.x, oldmousey - b.y, mousex - b.x, mousey - b.y, forceleave);
170 if (b.inside(mousex - b.x, mousey - b.y)) forceleave = true;
175 // Reflow ////////////////////////////////////////////////////////////////////////////////////////
177 // static stuff so we don't have to keep reallocating
178 private static int[] numRowsInCol = new int[65535];
179 private static LENGTH[] colWidth = new LENGTH[65535];
180 private static LENGTH[] colMaxWidth = new LENGTH[65535];
181 private static LENGTH[] rowHeight = new LENGTH[65535];
182 private static LENGTH[] rowMaxHeight = new LENGTH[65535];
183 static { for(int i=0; i<rowMaxHeight.length; i++) { rowMaxHeight[i] = MAX_LENGTH; colMaxWidth[i] = MAX_LENGTH; } }
185 Box nextPackedSibling() { Box b = nextSibling(); return b == null || (b.test(PACKED | VISIBLE)) ? b : b.nextPackedSibling(); }
186 Box firstPackedChild() { Box b = getChild(0); return b == null || (b.test(PACKED | VISIBLE)) ? b : b.nextPackedSibling(); }
188 /** only for use on the root box */
189 void reflow(int new_width, int new_height) {
192 new_width = bound(max(contentwidth, minwidth), new_width, test(HSHRINK) ? max(contentwidth, minwidth) : maxwidth);
193 new_height = bound(max(contentheight, minheight), new_height, test(VSHRINK) ? max(contentheight, minheight) : maxheight);
195 resize(x, y, new_width, new_height);
199 /** pack the boxes into rows and columns; also computes contentwidth */
201 for(Box child = getChild(0); child != null; child = child.nextSibling()) child.repack();
203 //#repeat COLS/ROWS rows/cols cols/rows col/row row/col colspan/rowspan rowspan/colspan
204 if (test(FIXED) == COLS) {
206 for(Box child = firstPackedChild(); child != null; r++) {
207 for(short c=0, numclear=0; child != null && c < cols; c++) {
208 if (numRowsInCol[c] > r) continue;
209 if (c != 0 && c + min(cols, child.colspan) - numclear > cols) break;
210 if (++numclear < min(cols, child.colspan)) continue;
211 for(int i=c - numclear + 1; i <= c; i++) numRowsInCol[i] += child.rowspan;
212 child.col = (short)(c - numclear + 1); child.row = r;
213 rows = (short)max(rows, child.row + child.rowspan);
214 child = child.nextPackedSibling();
218 for(int i=0; i<cols; i++) numRowsInCol[i] = 0;
222 //#repeat contentwidth/contentheight colWidth/rowHeight colspan/rowspan col/row cols/rows minwidth/minheight \
223 // textwidth/textheight maxwidth/maxheight
225 for(Box child = firstPackedChild(); child != null; child = child.nextPackedSibling())
226 colWidth[child.col] = max(colWidth[child.col], child.contentwidth / child.colspan);
227 for(int i=0; i<cols; i++) { contentwidth += colWidth[i]; colWidth[i] = 0; }
228 contentwidth = bound(minwidth, max(font == null || text == null ? 0 : font.textwidth(text), contentwidth), maxwidth);
232 private void resize(LENGTH x, LENGTH y, LENGTH width, LENGTH height) {
233 // FEATURE reimplement, but we're destroying this
234 if (x != this.x || y != this.y || width != this.width || height != this.height) {
235 (parent == null ? this : parent).dirty(this.x, this.y, this.width, this.height);
236 boolean sizechange = (this.width != width || this.height != height) && getTrap("SizeChange") != null;
237 boolean poschange = (this.x != x || this.y != y) && getTrap("PosChange") != null;
238 this.width = width; this.height = height; this.x = x; this.y = y;
240 try { if (sizechange) putAndTriggerTraps("SizeChange", T); /*Surface.abort = true;*/ }
241 catch (Exception e) { Log.log(this, e); }
242 try { if (poschange) putAndTriggerTraps("PosChange", T); /*Surface.abort = true;*/ }
243 catch (Exception e) { Log.log(this, e); }
247 private void resize_children() {
249 //#repeat col/row colspan/rowspan contentwidth/contentheight x/y width/height colMaxWidth/rowMaxHeight colWidth/rowHeight \
250 // HSHRINK/VSHRINK maxwidth/maxheight cols/rows minwidth/minheight colWidth/rowHeight x_slack/y_slack
251 // PHASE 1: compute column min/max sizes
253 for(int i=0; i<cols; i++) x_slack -= colWidth[i];
254 for(Box child = firstPackedChild(); child != null; child = child.nextPackedSibling())
255 for(int i=child.col; i < child.col + child.colspan; i++) {
256 x_slack += colWidth[i];
257 colWidth[i] = max(colWidth[i], child.contentwidth / child.colspan);
258 x_slack -= colWidth[i];
259 colMaxWidth[i] = min(colMaxWidth[i], child.test(HSHRINK) ? child.contentwidth : child.maxwidth) / child.colspan;
262 // PHASE 2: hand out slack
263 for(int startslack = 0; x_slack > 0 && cols > 0 && startslack != x_slack;) {
264 int increment = max(1, x_slack / cols);
265 startslack = x_slack;
266 for(short col=0; col < cols; col++) {
267 int diff = min(colMaxWidth[col], colWidth[col] + increment) - colWidth[col];
269 colWidth[col] += diff;
274 // Phase 3: assign childrens' actual sizes
275 for(Box child = getChild(0); child != null; child = child.nextSibling()) {
276 if (!child.test(VISIBLE)) continue;
277 int child_width, child_height, child_x, child_y;
278 if (!child.test(PACKED)) {
281 child_width = child.test(HSHRINK) ? child.contentwidth : min(child.maxwidth, width - child.x);
282 child_height = child.test(VSHRINK) ? child.contentheight : min(child.maxheight, height - child.y);
283 child_width = max(child.minwidth, child_width);
284 child_height = max(child.minheight, child_height);
287 //#repeat col/row colspan/rowspan contentwidth/contentheight width/height colMaxWidth/rowMaxHeight \
288 // child_x/child_y x/y HSHRINK/VSHRINK maxwidth/maxheight cols/rows minwidth/minheight x_slack/y_slack \
289 // colWidth/rowHeight child_width/child_height ALIGN_RIGHT/ALIGN_BOTTOM ALIGN_LEFT/ALIGN_TOP
291 for(int i = child.col; i < child.col + child.colspan; i++) unbounded += colWidth[i];
292 child_width = min(unbounded, child.test(HSHRINK) ? child.contentwidth : child.maxwidth);
293 child_x = test(ALIGN_RIGHT) ? x_slack : test(ALIGN_LEFT) ? 0 : x_slack / 2;
294 for(int i=0; i < child.col; i++) child_x += colWidth[i];
295 if (child_width > unbounded) child_x -= (child_width - unbounded) / 2;
298 child.resize(child_x, child_y, child_width, child_height);
302 for(int i=0; i<cols; i++) { colWidth[i] = 0; colMaxWidth[i] = MAX_LENGTH; }
303 for(int i=0; i<rows; i++) { rowHeight[i] = 0; rowMaxHeight[i] = MAX_LENGTH; }
305 for(Box child = getChild(0); child != null; child = child.nextSibling())
307 child.resize_children();
312 // Rendering Pipeline /////////////////////////////////////////////////////////////////////
314 /** Renders self and children within the specified region. All rendering operations are clipped to xIn,yIn,wIn,hIn */
315 void render(int parentx, int parenty, int cx1, int cy1, int cx2, int cy2, PixelBuffer buf, VectorGraphics.Affine a) {
316 if (!test(VISIBLE)) return;
317 int globalx = parentx + (parent == null ? 0 : x);
318 int globaly = parenty + (parent == null ? 0 : y);
320 // intersect the x,y,w,h rendering window with ourselves; quit if it's empty
322 cx1 = max(cx1, parent == null ? 0 : globalx);
323 cy1 = max(cy1, parent == null ? 0 : globaly);
324 cx2 = min(cx2, globalx + width);
325 cy2 = min(cy2, globaly + height);
326 if (cx2 <= cx1 || cy2 <= cy1) return;
329 if ((fillcolor & 0xFF000000) != 0x00000000)
330 buf.fillTrapezoid(globalx, globalx + width, globaly, globalx, globalx + width, globaly + height, fillcolor);
332 if (texture != null && texture.picture != null)
333 for(int x = globalx; x < cx2; x += texture.picture.getWidth())
334 for(int y = globaly; y < cy2; y += texture.picture.getHeight())
335 buf.drawPicture(texture.picture, x, y, cx1, cy1, cx2, cy2);
337 if (text != null && !text.equals("") && font != null)
338 if (font.rasterizeGlyphs(text, buf, strokecolor, globalx, globaly, cx1, cy1, cx2, cy2, null) == -1)
339 font.rasterizeGlyphs(text, buf, strokecolor, globalx, globaly, cx1, cy1, cx2, cy2,
340 new Scheduler.Task() { public void perform() { Box b = Box.this; MARK_REFLOW_b; dirty(); }});
342 for(Box b = getChild(0); b != null; b = b.nextSibling())
343 b.render(globalx, globaly, cx1, cy1, cx2, cy2, buf, null);
347 // Methods to implement org.xwt.js.JS //////////////////////////////////////
349 public int globalToLocalX(int x) { return parent == null ? x : parent.globalToLocalX(x - this.x); }
350 public int globalToLocalY(int y) { return parent == null ? y : parent.globalToLocalY(y - this.y); }
351 public int localToGlobalX(int x) { return parent == null ? x : parent.globalToLocalX(x + this.x); }
352 public int localToGlobalY(int y) { return parent == null ? y : parent.globalToLocalY(y + this.y); }
354 public Object callMethod(Object method, Object a0, Object a1, Object a2, Object[] rest, int nargs) throws JSExn {
355 if (nargs != 1 || !"indexof".equals(method)) return super.callMethod(method, a0, a1, a2, rest, nargs);
357 if (b.parent != this)
358 return (redirect == null || redirect == this) ?
360 redirect.callMethod(method, a0, a1, a2, rest, nargs);
361 return N(b.getIndexInParent());
364 public Enumeration keys() { throw new Error("you cannot apply for..in to a " + this.getClass().getName()); }
366 /** to be filled in by the Tree implementation */
367 public int numchildren = 0;
369 protected boolean isTrappable() { return true; }
370 public Object get(Object name) {
371 if (name instanceof Number)
372 return redirect == null ? null : redirect == this ? getChild(toInt(name)) : redirect.get(name);
375 case "indexof": return METHOD;
376 case "text": return text;
377 case "path": throw new JSExn("cannot read from the path property");
378 case "fill": return colorToString(fillcolor);
379 case "strokecolor": return colorToString(strokecolor);
380 case "textcolor": return colorToString(strokecolor);
381 case "font": return font == null ? null : font.res;
382 case "fontsize": return font == null ? N(10) : N(font.pointsize);
383 case "strokewidth": return N(strokewidth);
384 case "align": return alignToString();
385 case "thisbox": return this;
386 case "shrink": return B(test(HSHRINK) || test(VSHRINK));
387 case "hshrink": return B(test(HSHRINK));
388 case "vshrink": return B(test(VSHRINK));
389 case "x": return (parent == null || !test(VISIBLE)) ? N(0) : N(x);
390 case "y": return (parent == null || !test(VISIBLE)) ? N(0) : N(y);
391 case "width": return N(width);
392 case "height": return N(height);
393 case "cols": return test(FIXED) == COLS ? N(cols) : N(0);
394 case "rows": return test(FIXED) == ROWS ? N(rows) : N(0);
395 case "colspan": return N(colspan);
396 case "rowspan": return N(rowspan);
397 case "noclip": return B(test(NOCLIP));
398 case "visible": return B(test(VISIBLE) && (parent == null || (parent.get("visible") == T)));
399 case "packed": return B(test(PACKED));
400 case "globalx": return N(localToGlobalX(0));
401 case "globaly": return N(localToGlobalY(0));
402 case "cursor": return test(CURSOR) ? boxToCursor.get(this) : null;
403 case "mousex": { Surface s = getSurface(); return N(s == null ? 0 : globalToLocalX(s.mousex)); }
404 case "mousey": { Surface s = getSurface(); return N(s == null ? 0 : globalToLocalY(s.mousey)); }
405 case "mouseinside": return B(test(MOUSEINSIDE));
406 case "numchildren": return redirect == null ? N(0) : redirect == this ? N(numchildren) : redirect.get("numchildren");
407 case "minwidth": return N(minwidth);
408 case "maxwidth": return N(maxwidth);
409 case "minheight": return N(minheight);
410 case "maxheight": return N(maxheight);
411 case "redirect": return redirect == null ? null : redirect == this ? T : redirect.get("redirect");
412 case "Minimized": if (parent == null && getSurface() != null) return B(getSurface().minimized);
413 default: return super.get(name);
418 public void put(Object name, Object value) {
419 if (name instanceof Number) { put(toInt(name), value); return; }
422 case "text": CHECKSET_STRING(text); MARK_RESIZE; dirty();
423 case "strokecolor": value = N(stringToColor((String)value)); CHECKSET_INT(strokecolor); MARK_RESIZE; dirty();
424 case "textcolor": value = N(stringToColor((String)value)); CHECKSET_INT(strokecolor); MARK_RESIZE; dirty();
425 case "text": CHECKSET_STRING(text); MARK_RESIZE; dirty();
426 case "strokewidth": CHECKSET_SHORT(strokewidth); dirty();
427 case "thisbox": if (value == null) remove();
428 case "shrink": put("hshrink", value); put("vshrink", value);
429 case "hshrink": CHECKSET_FLAG(HSHRINK); MARK_RESIZE;
430 case "vshrink": CHECKSET_FLAG(VSHRINK); MARK_RESIZE;
431 case "width": if (parent==null&&Surface.fromBox(this)!=null) { CHECKSET_INT(width); } else { put("maxwidth", value); put("minwidth", value); MARK_RESIZE; }
432 case "height": if (parent == null&&Surface.fromBox(this)!=null) { CHECKSET_INT(height); } else { put("maxheight", value); put("minheight", value); MARK_RESIZE; }
433 case "maxwidth": CHECKSET_INT(maxwidth); MARK_RESIZE;
434 case "minwidth": CHECKSET_INT(minwidth); MARK_RESIZE;
435 case "maxheight": CHECKSET_INT(maxheight); MARK_RESIZE;
436 case "minheight": CHECKSET_INT(minheight); MARK_RESIZE;
437 case "colspan": CHECKSET_SHORT(colspan); MARK_REPACK_parent;
438 case "rowspan": CHECKSET_SHORT(colspan); MARK_REPACK_parent;
439 case "rows": CHECKSET_SHORT(rows); if (rows==0){set(FIXED, COLS);if(cols==0)cols=1;} else set(FIXED, ROWS); MARK_REPACK;
440 case "cols": CHECKSET_SHORT(cols); if (cols==0){set(FIXED, ROWS);if(rows==0)rows=1;} else set(FIXED, COLS); MARK_REPACK;
441 case "noclip": CHECKSET_FLAG(NOCLIP); if (parent == null) dirty(); else parent.dirty();
442 case "visible": CHECKSET_FLAG(VISIBLE); dirty(); MARK_RESIZE; dirty();
443 case "packed": CHECKSET_FLAG(PACKED); MARK_REPACK_parent;
444 case "globalx": put("x", N(globalToLocalX(toInt(value))));
445 case "globaly": put("y", N(globalToLocalY(toInt(value))));
446 case "align": clear(ALIGNS); setAlign(value == null ? "center" : value); MARK_RESIZE;
447 case "cursor": setCursor(value);
448 case "fill": setFill(value);
449 case "Press1": mouseEvent("Press1", value);
450 case "Press2": mouseEvent("Press2", value);
451 case "Press3": mouseEvent("Press3", value);
452 case "Release1": mouseEvent("Release1", value);
453 case "Release2": mouseEvent("Release2", value);
454 case "Release3": mouseEvent("Release3", value);
455 case "Click1": mouseEvent("Click1", value);
456 case "Click2": mouseEvent("Click2", value);
457 case "Click3": mouseEvent("Click3", value);
458 case "DoubleClick1": mouseEvent("DoubleClick1", value);
459 case "DoubleClick2": mouseEvent("DoubleClick2", value);
460 case "DoubleClick3": mouseEvent("DoubleClick3", value);
461 case "Minimized": if (parent == null && getSurface() != null) getSurface().minimized = toBoolean(value); // FEATURE
462 case "Maximized": if (parent == null && getSurface() != null) getSurface().maximized = toBoolean(value); // FEATURE
463 case "Close": if (parent == null && getSurface() != null) getSurface().dispose(true);
464 case "toback": if (parent == null && getSurface() != null && toBoolean(value)) { getSurface().toBack(); }
465 case "tofront": if (parent == null && getSurface() != null && toBoolean(value)) { getSurface().toFront(); }
466 case "redirect": if (redirect == this) redirect = (Box)value; else Log.log(this, "redirect can only be set once");
467 case "font": font = value == null ? null : Font.getFont((Res)value, font == null ? 10 : font.pointsize); MARK_RESIZE; dirty();
468 case "fontsize": font = Font.getFont(font == null ? null : font.res, toInt(value)); MARK_RESIZE; dirty();
469 case "x": if (test(PACKED) && parent != null) return; CHECKSET_INT(x); dirty(); MARK_RESIZE; dirty();
470 case "y": if (test(PACKED) && parent != null) return; CHECKSET_INT(y); dirty(); MARK_RESIZE; dirty();
471 case "KeyPressed": // prevent stuff from hitting the Hash
472 case "KeyReleased": // prevent stuff from hitting the Hash
473 case "PosChange": // prevent stuff from hitting the Hash
474 case "SizeChange": // prevent stuff from hitting the Hash
475 case "childadded": // prevent stuff from hitting the Hash
476 case "childremoved": // prevent stuff from hitting the Hash
480 private String alignToString() {
481 switch(flags & ALIGNS) {
482 case (ALIGN_TOP | ALIGN_LEFT): return "topleft";
483 case (ALIGN_BOTTOM | ALIGN_LEFT): return "bottomleft";
484 case (ALIGN_TOP | ALIGN_RIGHT): return "topright";
485 case (ALIGN_BOTTOM | ALIGN_RIGHT): return "bottomright";
486 case ALIGN_TOP: return "top";
487 case ALIGN_BOTTOM: return "bottom";
488 case ALIGN_LEFT: return "left";
489 case ALIGN_RIGHT: return "right";
490 case 0: return "center";
491 default: throw new Error("invalid alignment flags: " + (flags & ALIGNS));
495 private void setAlign(Object value) {
497 case "center": clear(ALIGNS);
498 case "topleft": set(ALIGN_TOP | ALIGN_LEFT);
499 case "bottomleft": set(ALIGN_BOTTOM | ALIGN_LEFT);
500 case "topright": set(ALIGN_TOP | ALIGN_RIGHT);
501 case "bottomright": set(ALIGN_BOTTOM | ALIGN_RIGHT);
502 case "top": set(ALIGN_TOP);
503 case "bottom": set(ALIGN_BOTTOM);
504 case "left": set(ALIGN_LEFT);
505 case "right": set(ALIGN_RIGHT);
506 default: Log.logJS("invalid alignment \"" + value + "\"");
510 private void setCursor(Object value) {
511 if (value == null) { clear(CURSOR); boxToCursor.remove(this); return; }
512 if (value.equals(boxToCursor.get(this))) return;
514 boxToCursor.put(this, value);
515 Surface surface = getSurface();
516 String tempcursor = surface.cursor;
517 Move(surface.mousex, surface.mousey, surface.mousex, surface.mousey);
518 if (surface.cursor != tempcursor) surface.syncCursor();
521 private void setFill(Object value) {
522 if (value == null) return;
523 if (value instanceof String) {
524 // FIXME check double set
525 int newfillcolor = stringToColor((String)value);
526 if (newfillcolor == fillcolor) return;
527 fillcolor = newfillcolor;
531 if (!(value instanceof Res)) return;
532 texture = Picture.fromRes((Res)value, null);
533 if (texture != null) {
534 minwidth = texture.picture.getWidth();
535 minheight = texture.picture.getHeight();
540 texture = Picture.fromRes((Res)value, new Scheduler.Task() { public void perform() {
541 minwidth = texture.picture.getWidth();
542 minheight = texture.picture.getHeight();
543 Box b = Box.this; MARK_REFLOW_b;
548 private void mouseEvent(String name, Object value) {
549 Surface surface = getSurface();
550 if (surface == null) return;
551 int mousex = globalToLocalX(surface.mousex);
552 int mousey = globalToLocalY(surface.mousey);
553 for(Box c = prevSibling(); c != null; c = c.prevSibling())
554 if (c.inside(mousex - c.x, mousey - c.y)) { c.putAndTriggerTraps(name, value); return; }
555 if (parent != null) parent.putAndTriggerTraps(name, value);
558 private static int stringToColor(String s) {
559 if (s == null) return 0x00000000;
560 else if (SVG.colors.get(s) != null) return 0xFF000000 | toInt(SVG.colors.get(s));
561 else if (s.length() > 0 && s.charAt(0) == '#') try {
564 (Integer.parseInt(s.substring(1, 3), 16) << 16) |
565 (Integer.parseInt(s.substring(3, 5), 16) << 8) |
566 Integer.parseInt(s.substring(5, 7), 16);
567 } catch (NumberFormatException e) {
568 Log.log(Box.class, "invalid color " + s);
571 else return 0; // FEATURE: error?
574 private static String colorToString(int argb) {
575 if ((argb & 0xFF000000) == 0) return null;
576 String red = Integer.toHexString((argb & 0x00FF0000) >> 16);
577 String green = Integer.toHexString((argb & 0x0000FF00) >> 8);
578 String blue = Integer.toHexString(argb & 0x000000FF);
579 if (red.length() < 2) red = "0" + red;
580 if (blue.length() < 2) blue = "0" + blue;
581 if (green.length() < 2) green = "0" + green;
582 return "#" + red + green + blue;
585 /** figures out what box in this subtree of the Box owns the pixel at x,y relitave to the Surface */
586 public static Box whoIs(Box cur, int x, int y) {
588 if (cur.parent != null) throw new Error("whoIs may only be invoked on the root box of a surface");
592 // WARNING: this method is called from the event-queueing thread -- it may run concurrently with
593 // ANY part of XWT, and is UNSYNCHRONIZED for performance reasons. BE CAREFUL HERE.
595 if (!cur.test(VISIBLE)) return null;
596 if (!cur.inside(x - globalx, y - globaly)) return cur.parent == null ? cur : null;
598 for(int i=cur.numchildren - 1; i>=0; i--) {
599 Box child = cur.getChild(i);
600 if (child == null) continue; // since this method is unsynchronized, we have to double-check
603 if (child.test(VISIBLE) && child.inside(x - globalx, y - globaly)) { cur = child; continue OUTER; }
613 // Trivial Helper Methods (should be inlined) /////////////////////////////////////////
615 static short min(short a, short b) { if (a<b) return a; else return b; }
616 static int min(int a, int b) { if (a<b) return a; else return b; }
617 static float min(float a, float b) { if (a<b) return a; else return b; }
619 static short max(short a, short b) { if (a>b) return a; else return b; }
620 static int max(int a, int b) { if (a>b) return a; else return b; }
621 static float max(float a, float b) { if (a>b) return a; else return b; }
623 static int min(int a, int b, int c) { if (a<=b && a<=c) return a; else if (b<=c && b<=a) return b; else return c; }
624 static int max(int a, int b, int c) { if (a>=b && a>=c) return a; else if (b>=c && b>=a) return b; else return c; }
625 static int bound(int a, int b, int c) { if (c < b) return c; if (a > b) return a; return b; }
626 final boolean inside(int x, int y) { return test(VISIBLE) && x >= 0 && y >= 0 && x < width && y < height; }
628 void set(int mask) { flags |= mask; }
629 void set(int mask, boolean setclear) { if (setclear) set(mask); else clear(mask); }
630 void clear(int mask) { flags &= ~mask; }
631 boolean test(int mask) { return ((flags & mask) == mask); }
633 protected Box left = null;
634 protected Box right = null;
635 protected Box rootChild = null;
636 protected Box peerTree_parent = null;
639 // Tree Handling //////////////////////////////////////////////////////////////////////
642 private static boolean REDbool = false;
643 private static boolean BLACKbool = true;
645 public final Box peerTree_leftmost() { for (Box p = this; ; p = p.left) if (p.left == null) return p; }
646 public final Box peerTree_rightmost() { for (Box p = this; ; p = p.right) if (p.right == null) return p; }
647 static Box peerTree_parent(Box p) { return (p == null)? null: p.peerTree_parent; }
649 public Box insertBeforeMe(Box cell) { left = cell; cell.peerTree_parent = this; return cell.fixAfterInsertion(); }
650 public Box insertAfterMe(Box cell) { right = cell; cell.peerTree_parent = this; return cell.fixAfterInsertion(); }
652 static boolean colorOf(Box p) { return (p == null) ? BLACKbool : p.test(BLACK); }
653 static void setColor(Box p, boolean c) { if (p != null) { if (c) p.set(BLACK); else p.clear(BLACK); } }
654 static Box leftOf(Box p) { return (p == null)? null: p.left; }
655 static Box rightOf(Box p) { return (p == null)? null: p.right; }
657 public final Box nextSibling() {
659 return right.peerTree_leftmost();
661 Box p = peerTree_parent;
663 while (p != null && ch == p.right) { ch = p; p = p.peerTree_parent; }
668 public final Box prevSibling() {
670 return left.peerTree_rightmost();
672 Box p = peerTree_parent;
674 while (p != null && ch == p.left) { ch = p; p = p.peerTree_parent; }
679 public Box removeNode() {
680 Box root = peerTree_parent.rootChild;
682 // handle case where we are only node
683 if (left == null && right == null && peerTree_parent == null) return null;
685 // if strictly internal, swap places with a successor
686 if (left != null && right != null) {
687 Box s = nextSibling();
688 // To work nicely with arbitrary subclasses of Box, we don't want to
689 // just copy successor's fields. since we don't know what
690 // they are. Instead we swap positions in the tree.
691 root = swapPosition(this, s);
694 // Start fixup at replacement node (normally a child).
695 // But if no children, fake it by using self
697 if (left == null && right == null) {
699 if (test(BLACK)) root = this.fixAfterDeletion();
701 // Unlink (Couldn't before since fixAfterDeletion needs peerTree_parent ptr)
703 if (peerTree_parent != null) {
704 if (this == peerTree_parent.left)
705 peerTree_parent.left = null;
706 else if (this == peerTree_parent.right)
707 peerTree_parent.right = null;
708 peerTree_parent = null;
713 Box replacement = left;
714 if (replacement == null) replacement = right;
716 // link replacement to peerTree_parent
717 replacement.peerTree_parent = peerTree_parent;
719 if (peerTree_parent == null) root = replacement;
720 else if (this == peerTree_parent.left) peerTree_parent.left = replacement;
721 else peerTree_parent.right = replacement;
725 peerTree_parent = null;
728 if (test(BLACK)) root = replacement.fixAfterDeletion();
736 * Swap the linkages of two nodes in a tree.
737 * Return new root, in case it changed.
739 Box swapPosition(Box x, Box y) {
740 Box root = peerTree_parent.rootChild;
742 /* Too messy. TODO: find sequence of assigments that are always OK */
744 Box px = x.peerTree_parent;
745 boolean xpl = px != null && x == px.left;
749 Box py = y.peerTree_parent;
750 boolean ypl = py != null && y == py.left;
755 y.peerTree_parent = px;
756 if (px != null) if (xpl) px.left = y; else px.right = y;
757 x.peerTree_parent = y;
760 y.right = rx; if (rx != null) rx.peerTree_parent = y;
764 y.left = lx; if (lx != null) lx.peerTree_parent = y;
766 x.left = ly; if (ly != null) ly.peerTree_parent = x;
767 x.right = ry; if (ry != null) ry.peerTree_parent = x;
770 x.peerTree_parent = py;
771 if (py != null) if (ypl) py.left = x; else py.right = x;
772 y.peerTree_parent = x;
775 x.right = ry; if (ry != null) ry.peerTree_parent = x;
779 x.left = ly; if (ly != null) ly.peerTree_parent = x;
781 y.left = lx; if (lx != null) lx.peerTree_parent = y;
782 y.right = rx; if (rx != null) rx.peerTree_parent = y;
785 x.peerTree_parent = py; if (py != null) if (ypl) py.left = x; else py.right = x;
786 x.left = ly; if (ly != null) ly.peerTree_parent = x;
787 x.right = ry; if (ry != null) ry.peerTree_parent = x;
789 y.peerTree_parent = px; if (px != null) if (xpl) px.left = y; else px.right = y;
790 y.left = lx; if (lx != null) lx.peerTree_parent = y;
791 y.right = rx; if (rx != null) rx.peerTree_parent = y;
794 boolean c = x.test(BLACK);
795 if (y.test(BLACK)) x.set(BLACK); else x.clear(BLACK);
796 if (c) y.set(BLACK); else y.clear(BLACK);
798 if (root == x) root = y;
799 else if (root == y) root = x;
800 return parent.rootChild = root;
804 Box root = parent.rootChild;
807 if (r.left != null) r.left.peerTree_parent = this;
808 r.peerTree_parent = peerTree_parent;
809 if (peerTree_parent == null) root = r;
810 else if (peerTree_parent.left == this) peerTree_parent.left = r;
811 else peerTree_parent.right = r;
814 return parent.rootChild = root;
818 Box root = parent.rootChild;
821 if (l.right != null) l.right.peerTree_parent = this;
822 l.peerTree_parent = peerTree_parent;
823 if (peerTree_parent == null) root = l;
824 else if (peerTree_parent.right == this) peerTree_parent.right = l;
825 else peerTree_parent.left = l;
828 return parent.rootChild;
831 Box fixAfterInsertion() {
832 Box root = parent.rootChild;
836 while (x != null && x != root && !x.peerTree_parent.test(BLACK)) {
837 if (peerTree_parent(x) == leftOf(peerTree_parent(peerTree_parent(x)))) {
838 Box y = rightOf(peerTree_parent(peerTree_parent(x)));
839 if (colorOf(y) == REDbool) {
840 setColor(peerTree_parent(x), BLACKbool);
841 setColor(y, BLACKbool);
842 setColor(peerTree_parent(peerTree_parent(x)), REDbool);
843 x = peerTree_parent(peerTree_parent(x));
846 if (x == rightOf(peerTree_parent(x))) {
847 x = peerTree_parent(x);
848 root = x.rotateLeft();
850 setColor(peerTree_parent(x), BLACKbool);
851 setColor(peerTree_parent(peerTree_parent(x)), REDbool);
852 if (peerTree_parent(peerTree_parent(x)) != null)
853 root = peerTree_parent(peerTree_parent(x)).rotateRight();
857 Box y = leftOf(peerTree_parent(peerTree_parent(x)));
858 if (colorOf(y) == REDbool) {
859 setColor(peerTree_parent(x), BLACKbool);
860 setColor(y, BLACKbool);
861 setColor(peerTree_parent(peerTree_parent(x)), REDbool);
862 x = peerTree_parent(peerTree_parent(x));
865 if (x == leftOf(peerTree_parent(x))) {
866 x = peerTree_parent(x);
867 root = x.rotateRight();
869 setColor(peerTree_parent(x), BLACKbool);
870 setColor(peerTree_parent(peerTree_parent(x)), REDbool);
871 if (peerTree_parent(peerTree_parent(x)) != null)
872 root = peerTree_parent(peerTree_parent(x)).rotateLeft();
877 return parent.rootChild = root;
881 Box fixAfterDeletion() {
882 Box root = peerTree_parent.rootChild;
884 while (x != root && colorOf(x) == BLACKbool) {
885 if (x == leftOf(peerTree_parent(x))) {
886 Box sib = rightOf(peerTree_parent(x));
887 if (colorOf(sib) == REDbool) {
888 setColor(sib, BLACKbool);
889 setColor(peerTree_parent(x), REDbool);
890 root = peerTree_parent(x).rotateLeft();
891 sib = rightOf(peerTree_parent(x));
893 if (colorOf(leftOf(sib)) == BLACKbool && colorOf(rightOf(sib)) == BLACKbool) {
894 setColor(sib, REDbool);
895 x = peerTree_parent(x);
898 if (colorOf(rightOf(sib)) == BLACKbool) {
899 setColor(leftOf(sib), BLACKbool);
900 setColor(sib, REDbool);
901 root = sib.rotateRight();
902 sib = rightOf(peerTree_parent(x));
904 setColor(sib, colorOf(peerTree_parent(x)));
905 setColor(peerTree_parent(x), BLACKbool);
906 setColor(rightOf(sib), BLACKbool);
907 root = peerTree_parent(x).rotateLeft();
912 Box sib = leftOf(peerTree_parent(x));
913 if (colorOf(sib) == REDbool) {
914 setColor(sib, BLACKbool);
915 setColor(peerTree_parent(x), REDbool);
916 root = peerTree_parent(x).rotateRight();
917 sib = leftOf(peerTree_parent(x));
919 if (colorOf(rightOf(sib)) == BLACKbool && colorOf(leftOf(sib)) == BLACKbool) {
920 setColor(sib, REDbool);
921 x = peerTree_parent(x);
924 if (colorOf(leftOf(sib)) == BLACKbool) {
925 setColor(rightOf(sib), BLACKbool);
926 setColor(sib, REDbool);
927 root = sib.rotateLeft();
928 sib = leftOf(peerTree_parent(x));
930 setColor(sib, colorOf(peerTree_parent(x)));
931 setColor(peerTree_parent(x), BLACKbool);
932 setColor(leftOf(sib), BLACKbool);
933 root = peerTree_parent(x).rotateRight();
938 setColor(x, BLACKbool);
939 return parent.rootChild = root;
942 // Tree Manipulation /////////////////////////////////////////////////////////////////////
944 /** remove this node from its parent; INVARIANT: whenever the parent of a node is changed, remove() gets called. */
945 public void remove() {
946 if (parent == null) {
947 Surface surface = Surface.fromBox(this);
948 if (surface != null) surface.dispose(true);
951 parent.numchildren--;
953 Box oldparent = parent;
954 if (oldparent == null) return;
960 if (oldparent != null) { Box b = oldparent; MARK_REFLOW_b; }
961 if (oldparent != null) oldparent.putAndTriggerTraps("childremoved", this);
964 /** Returns ith child */
965 public Box getChild(int i) {
966 // FIXME: store numleft and numright in the tree
967 Box left = rootChild;
968 if (left == null) return null;
969 while (left.left != null) left = left.left;
970 for(; i > 0; i--) left = left.nextSibling();
974 /** Returns our index in our parent */
975 public int getIndexInParent() {
976 // FIXME: store numleft and numright in the tree
977 if (peerTree_parent == null) return left == null ? 0 : left.numPeerChildren() + 1;
978 else if (peerTree_parent.left == this) return peerTree_parent.getIndexInParent() - 1;
979 else if (peerTree_parent.right == this) return peerTree_parent.getIndexInParent() + 1;
980 else throw new Error("we're not a child of our parent!");
983 public int numPeerChildren() {
984 return (left == null ? 0 : left.numPeerChildren() + 1) + (right == null ? 0 : right.numPeerChildren() + 1);
987 public void put(int i, Object value) {
990 if (value != null && !(value instanceof Box)) {
991 if (Log.on) Log.logJS(this, "attempt to set a numerical property on a box to a non-box");
995 if (redirect == null) {
996 if (value == null) putAndTriggerTraps("childremoved", getChild(i));
997 else Log.logJS(this, "attempt to add/remove children to/from a node with a null redirect");
999 } else if (redirect != this) {
1000 if (value != null) putAndTriggerTraps("childadded", value);
1001 redirect.put(i, value);
1002 if (value == null) {
1003 Box b = (Box)redirect.get(new Integer(i));
1004 if (b != null) putAndTriggerTraps("childremoved", b);
1007 } else if (value == null) {
1008 if (i < 0 || i > numchildren) return;
1009 Box b = getChild(i);
1011 putAndTriggerTraps("childremoved", b);
1016 // check if box being moved is currently target of a redirect
1017 for(Box cur = b.parent; cur != null; cur = cur.parent)
1018 if (cur.redirect == b) {
1019 if (Log.on) Log.logJS(this, "attempt to move a box that is the target of a redirect");
1023 // check for recursive ancestor violation
1024 for(Box cur = this; cur != null; cur = cur.parent)
1026 if (Log.on) Log.logJS(this, "attempt to make a node a parent of its own ancestor");
1027 if (Log.on) Log.log(this, "box == " + this + " ancestor == " + b);
1035 Box before = getChild(i);
1036 if (before == null) {
1037 if (rootChild == null) rootChild = b;
1038 else rootChild.peerTree_rightmost().insertAfterMe(b);
1040 else before.insertBeforeMe(b);
1042 // need both of these in case child was already uncalc'ed
1047 putAndTriggerTraps("childadded", b);
1061 if (rpath == null) rpath = path.realize(transform == null ? VectorGraphics.Affine.identity() : transform);
1062 if ((flags & HSHRINK) != 0) contentwidth = max(contentwidth, rpath.boundingBoxWidth());
1063 if ((flags & VSHRINK) != 0) contentheight = max(contentheight, rpath.boundingBoxHeight());
1064 // FIXME: separate offset_x needed for the path
1066 // #repeat x1/y1 x2/y2 x3/y3 x4/y4 contentwidth/contentheight left/top right/bottom
1067 int x1 = transform == null ? 0 : (int)transform.multiply_px(0, 0);
1068 int x2 = transform == null ? 0 : (int)transform.multiply_px(contentwidth, 0);
1069 int x3 = transform == null ? contentwidth : (int)transform.multiply_px(contentwidth, contentheight);
1070 int x4 = transform == null ? contentwidth : (int)transform.multiply_px(0, contentheight);
1071 int left = min(min(x1, x2), min(x3, x4));
1072 int right = max(max(x1, x2), max(x3, x4));
1073 contentwidth = max(contentwidth, right - left);
1074 offset_x = -1 * left;
1081 if (rtransform == null) rpath = null;
1082 else if (!rtransform.equalsIgnoringTranslation(a)) rpath = null;
1084 rpath.translate((int)(a.e - rtransform.e), (int)(a.f - rtransform.f));
1085 rtransform = a.copy();
1087 if (rpath == null) rpath = path.realize((rtransform = a) == null ? VectorGraphics.Affine.identity() : a);
1088 if ((strokecolor & 0xff000000) != 0) rpath.stroke(buf, 1, strokecolor);
1089 if ((fillcolor & 0xff000000) != 0) rpath.fill(buf, new VectorGraphics.SingleColorPaint(fillcolor));
1095 VectorGraphics.Affine a2 = VectorGraphics.Affine.translate(b.x, b.y);
1096 if (transform != null) a2.multiply(transform);
1097 a2.multiply(VectorGraphics.Affine.translate(offset_x, offset_y));