* SizeChanges trigger an Surface.abort; if rendering were done in the same
* pass, rendering work done prior to the Surface.abort would be wasted.
*/
-public abstract class Box extends JSScope implements JSTrap.JSTrappable {
+public final class Box extends JSScope {
// Macros //////////////////////////////////////////////////////////////////////
// FEATURE: use cx2/cy2 format
/** Adds the intersection of (x,y,w,h) and the node's current actual geometry to the Surface's dirty list */
- public final void dirty() { dirty(0, 0, width, height); }
- public final void dirty(int x, int y, int w, int h) {
+ public void dirty() { dirty(0, 0, width, height); }
+ public void dirty(int x, int y, int w, int h) {
for(Box cur = this; cur != null; cur = cur.parent) {
if (!cur.test(NOCLIP)) {
w = min(x + w, cur.width) - max(x, 0);
}
}
- public void putAndTriggerJSTraps(Object key, Object value) {
- JSContext.invokeTrap(this, key, value);
- }
-
/** update MOUSEINSIDE, check for Enter/Leave/Move */
void Move(int oldmousex, int oldmousey, int mousex, int mousey) { Move(oldmousex, oldmousey, mousex, mousey, false); }
void Move(int oldmousex, int oldmousey, int mousex, int mousey, boolean forceleave) {
if (!wasinside && !isinside) return;
if (isinside && test(CURSOR)) Surface.fromBox(getRoot()).cursor = (String)boxToCursor.get(this);
- if (!wasinside && isinside && getTrap("Enter") != null) putAndTriggerJSTraps("Enter", T);
- else if (wasinside && !isinside && getTrap("Leave") != null) putAndTriggerJSTraps("Leave", T);
+ if (!wasinside && isinside && getTrap("Enter") != null) putAndTriggerTraps("Enter", T);
+ else if (wasinside && !isinside && getTrap("Leave") != null) putAndTriggerTraps("Leave", T);
else if (wasinside && isinside && (mousex != oldmousex || mousey != oldmousey) && getTrap("Move")!= null)
- putAndTriggerJSTraps("Move", T);
+ putAndTriggerTraps("Move", T);
for(Box b = getChild(numchildren - 1); b != null; b = b.prevSibling()) {
b.Move(oldmousex - b.x, oldmousey - b.y, mousex - b.x, mousey - b.y, forceleave);
if (b.inside(mousex - b.x, mousey - b.y)) forceleave = true;
private static LENGTH[] rowMaxHeight = new LENGTH[65535];
static { for(int i=0; i<rowMaxHeight.length; i++) { rowMaxHeight[i] = MAX_LENGTH; colMaxWidth[i] = MAX_LENGTH; } }
- final Box nextPackedSibling() { Box b = nextSibling(); return b == null || (b.test(PACKED | VISIBLE)) ? b : b.nextPackedSibling(); }
- final Box firstPackedChild() { Box b = getChild(0); return b == null || (b.test(PACKED | VISIBLE)) ? b : b.nextPackedSibling(); }
+ Box nextPackedSibling() { Box b = nextSibling(); return b == null || (b.test(PACKED | VISIBLE)) ? b : b.nextPackedSibling(); }
+ Box firstPackedChild() { Box b = getChild(0); return b == null || (b.test(PACKED | VISIBLE)) ? b : b.nextPackedSibling(); }
/** only for use on the root box */
void reflow(int new_width, int new_height) {
boolean poschange = (this.x != x || this.y != y) && getTrap("PosChange") != null;
this.width = width; this.height = height; this.x = x; this.y = y;
dirty();
- try { if (sizechange) putAndTriggerJSTraps("SizeChange", T); /*Surface.abort = true;*/ }
+ try { if (sizechange) putAndTriggerTraps("SizeChange", T); /*Surface.abort = true;*/ }
catch (Exception e) { Log.log(this, e); }
- try { if (poschange) putAndTriggerJSTraps("PosChange", T); /*Surface.abort = true;*/ }
+ try { if (poschange) putAndTriggerTraps("PosChange", T); /*Surface.abort = true;*/ }
catch (Exception e) { Log.log(this, e); }
}
}
public int localToGlobalX(int x) { return parent == null ? x : parent.globalToLocalX(x + this.x); }
public int localToGlobalY(int y) { return parent == null ? y : parent.globalToLocalY(y + this.y); }
- public Object callMethod(Object method, Object a0, Object a1, Object a2, Object[] rest, int nargs) throws JS.Exn {
+ public Object callMethod(Object method, Object a0, Object a1, Object a2, Object[] rest, int nargs) throws JSExn {
if (nargs != 1 || !"indexof".equals(method)) return super.callMethod(method, a0, a1, a2, rest, nargs);
Box b = (Box)a0;
if (b.parent != this)
public Enumeration keys() { throw new Error("you cannot apply for..in to a " + this.getClass().getName()); }
/** to be filled in by the Tree implementation */
- abstract void put(int i, Object value);
public int numchildren = 0;
- abstract public int getIndexInParent();
- abstract public Box getChild(int i);
- abstract public Box nextSibling();
- abstract public Box prevSibling();
- abstract public void remove();
- abstract Box swapPosition(Box x, Box y);
-
- public Object get(Object name) { return get(name, false); }
- public Object get(Object name, boolean ignoretraps) {
+
+ protected boolean isTrappable() { return true; }
+ public Object get(Object name) {
if (name instanceof Number)
return redirect == null ? null : redirect == this ? getChild(toInt(name)) : redirect.get(name);
//#switch(name)
case "indexof": return METHOD;
case "text": return text;
- case "path": throw new JS.Exn("cannot read from the path property");
+ case "path": throw new JSExn("cannot read from the path property");
case "fill": return colorToString(fillcolor);
case "strokecolor": return colorToString(strokecolor);
case "textcolor": return colorToString(strokecolor);
case "Minimized": if (parent == null && getSurface() != null) return B(getSurface().minimized);
default: return super.get(name);
//#end
- return null;
+ throw new Error("unreachable"); // unreachable
}
- public void put(Object name, Object value) { put(name, value, false); }
- public void put(Object name, Object value, boolean ignoretraps) {
+ public void put(Object name, Object value) {
if (name instanceof Number) { put(toInt(name), value); return; }
-
//#switch(name)
case "text": CHECKSET_STRING(text); MARK_RESIZE; dirty();
case "strokecolor": value = N(stringToColor((String)value)); CHECKSET_INT(strokecolor); MARK_RESIZE; dirty();
case "maxheight": CHECKSET_INT(maxheight); MARK_RESIZE;
case "minheight": CHECKSET_INT(minheight); MARK_RESIZE;
case "colspan": CHECKSET_SHORT(colspan); MARK_REPACK_parent;
- case "rowspan": CHECKSET_SHORT(colspan); MARK_REPACK_parent;
+ case "rowspan": CHECKSET_SHORT(rowspan); MARK_REPACK_parent;
case "rows": CHECKSET_SHORT(rows); if (rows==0){set(FIXED, COLS);if(cols==0)cols=1;} else set(FIXED, ROWS); MARK_REPACK;
case "cols": CHECKSET_SHORT(cols); if (cols==0){set(FIXED, ROWS);if(rows==0)rows=1;} else set(FIXED, COLS); MARK_REPACK;
case "noclip": CHECKSET_FLAG(NOCLIP); if (parent == null) dirty(); else parent.dirty();
case "fontsize": font = Font.getFont(font == null ? null : font.res, toInt(value)); MARK_RESIZE; dirty();
case "x": if (test(PACKED) && parent != null) return; CHECKSET_INT(x); dirty(); MARK_RESIZE; dirty();
case "y": if (test(PACKED) && parent != null) return; CHECKSET_INT(y); dirty(); MARK_RESIZE; dirty();
- case "KeyPressed": // prevent stuff from hitting the Hash
- case "KeyReleased": // prevent stuff from hitting the Hash
- case "PosChange": // prevent stuff from hitting the Hash
- case "SizeChange": // prevent stuff from hitting the Hash
- case "childadded": // prevent stuff from hitting the Hash
- case "childremoved": // prevent stuff from hitting the Hash
+ case "KeyPressed": return; // prevent stuff from hitting the Hash
+ case "KeyReleased": return; // prevent stuff from hitting the Hash
+ case "PosChange": return; // prevent stuff from hitting the Hash
+ case "SizeChange": return; // prevent stuff from hitting the Hash
+ case "childadded": return; // prevent stuff from hitting the Hash
+ case "childremoved": return; // prevent stuff from hitting the Hash
+ default: super.put(name, value);
//#end
}
int mousex = globalToLocalX(surface.mousex);
int mousey = globalToLocalY(surface.mousey);
for(Box c = prevSibling(); c != null; c = c.prevSibling())
- if (c.inside(mousex - c.x, mousey - c.y)) { c.putAndTriggerJSTraps(name, value); return; }
- if (parent != null) parent.putAndTriggerJSTraps(name, value);
+ if (c.inside(mousex - c.x, mousey - c.y)) { c.putAndTriggerTraps(name, value); return; }
+ if (parent != null) parent.putAndTriggerTraps(name, value);
}
private static int stringToColor(String s) {
// Trivial Helper Methods (should be inlined) /////////////////////////////////////////
- static final short min(short a, short b) { if (a<b) return a; else return b; }
- static final int min(int a, int b) { if (a<b) return a; else return b; }
- static final float min(float a, float b) { if (a<b) return a; else return b; }
+ static short min(short a, short b) { if (a<b) return a; else return b; }
+ static int min(int a, int b) { if (a<b) return a; else return b; }
+ static float min(float a, float b) { if (a<b) return a; else return b; }
- static final short max(short a, short b) { if (a>b) return a; else return b; }
- static final int max(int a, int b) { if (a>b) return a; else return b; }
- static final float max(float a, float b) { if (a>b) return a; else return b; }
+ static short max(short a, short b) { if (a>b) return a; else return b; }
+ static int max(int a, int b) { if (a>b) return a; else return b; }
+ static float max(float a, float b) { if (a>b) return a; else return b; }
- static final 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; }
- static final 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; }
- static final int bound(int a, int b, int c) { if (c < b) return c; if (a > b) return a; return b; }
+ 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; }
+ 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; }
+ static int bound(int a, int b, int c) { if (c < b) return c; if (a > b) return a; return b; }
final boolean inside(int x, int y) { return test(VISIBLE) && x >= 0 && y >= 0 && x < width && y < height; }
- protected final void set(int mask) { flags |= mask; }
- protected final void set(int mask, boolean setclear) { if (setclear) set(mask); else clear(mask); }
- protected final void clear(int mask) { flags &= ~mask; }
- protected final boolean test(int mask) { return ((flags & mask) == mask); }
+ void set(int mask) { flags |= mask; }
+ void set(int mask, boolean setclear) { if (setclear) set(mask); else clear(mask); }
+ void clear(int mask) { flags &= ~mask; }
+ boolean test(int mask) { return ((flags & mask) == mask); }
protected Box left = null;
protected Box right = null;
protected Box rootChild = null;
protected Box peerTree_parent = null;
- public abstract Box peerTree_leftmost();
- public abstract Box peerTree_rightmost();
- public abstract Box insertBeforeMe(Box cell);
- public abstract Box insertAfterMe(Box cell);
- protected abstract Box fixAfterInsertion();
- protected abstract Box fixAfterDeletion();
- protected abstract Box rotateLeft();
- protected abstract Box rotateRight();
- protected abstract int numPeerChildren();
+
+
+ // Tree Handling //////////////////////////////////////////////////////////////////////
+
+
+ private static boolean REDbool = false;
+ private static boolean BLACKbool = true;
+
+ public final Box peerTree_leftmost() { for (Box p = this; ; p = p.left) if (p.left == null) return p; }
+ public final Box peerTree_rightmost() { for (Box p = this; ; p = p.right) if (p.right == null) return p; }
+ static Box peerTree_parent(Box p) { return (p == null)? null: p.peerTree_parent; }
+
+ public void insertBeforeMe(Box cell) { left = cell; cell.peerTree_parent = this; cell.fixAfterInsertion(); }
+ public void insertAfterMe(Box cell) { right = cell; cell.peerTree_parent = this; cell.fixAfterInsertion(); }
+
+ static boolean colorOf(Box p) { return (p == null) ? BLACKbool : p.test(BLACK); }
+ static void setColor(Box p, boolean c) { if (p != null) { if (c) p.set(BLACK); else p.clear(BLACK); } }
+ static Box leftOf(Box p) { return (p == null)? null: p.left; }
+ static Box rightOf(Box p) { return (p == null)? null: p.right; }
+
+ public final Box nextSibling() {
+ if (right != null)
+ return right.peerTree_leftmost();
+ else {
+ Box p = peerTree_parent;
+ Box ch = this;
+ while (p != null && ch == p.right) { ch = p; p = p.peerTree_parent; }
+ return p;
+ }
+ }
+
+ public final Box prevSibling() {
+ if (left != null)
+ return left.peerTree_rightmost();
+ else {
+ Box p = peerTree_parent;
+ Box ch = this;
+ while (p != null && ch == p.left) { ch = p; p = p.peerTree_parent; }
+ return p;
+ }
+ }
+
+ public void removeNode() {
+
+ // handle case where we are only node
+ if (left == null && right == null && peerTree_parent == null) return;
+
+ // if strictly internal, swap places with a successor
+ if (left != null && right != null) {
+ Box s = nextSibling();
+ // To work nicely with arbitrary subclasses of Box, we don't want to
+ // just copy successor's fields. since we don't know what
+ // they are. Instead we swap positions in the tree.
+ swapPosition(this, s);
+ }
+
+ // Start fixup at replacement node (normally a child).
+ // But if no children, fake it by using self
+
+ if (left == null && right == null) {
+
+ if (test(BLACK)) fixAfterDeletion();
+
+ // Unlink (Couldn't before since fixAfterDeletion needs peerTree_parent ptr)
+
+ if (peerTree_parent != null) {
+ if (this == peerTree_parent.left)
+ peerTree_parent.left = null;
+ else if (this == peerTree_parent.right)
+ peerTree_parent.right = null;
+ peerTree_parent = null;
+ }
+
+ }
+ else {
+ Box replacement = left;
+ if (replacement == null) replacement = right;
+
+ // link replacement to peerTree_parent
+ replacement.peerTree_parent = peerTree_parent;
+
+ if (peerTree_parent == null) parent.rootChild = replacement;
+ else if (this == peerTree_parent.left) peerTree_parent.left = replacement;
+ else peerTree_parent.right = replacement;
+
+ left = null;
+ right = null;
+ peerTree_parent = null;
+
+ // fix replacement
+ if (test(BLACK)) replacement.fixAfterDeletion();
+
+ }
+ }
+
+ /**
+ * Swap the linkages of two nodes in a tree.
+ * Return new root, in case it changed.
+ **/
+ void swapPosition(Box x, Box y) {
+
+ /* Too messy. TODO: find sequence of assigments that are always OK */
+
+ Box px = x.peerTree_parent;
+ boolean xpl = px != null && x == px.left;
+ Box lx = x.left;
+ Box rx = x.right;
+
+ Box py = y.peerTree_parent;
+ boolean ypl = py != null && y == py.left;
+ Box ly = y.left;
+ Box ry = y.right;
+
+ if (x == py) {
+ y.peerTree_parent = px;
+ if (px != null) if (xpl) px.left = y; else px.right = y;
+ x.peerTree_parent = y;
+ if (ypl) {
+ y.left = x;
+ y.right = rx; if (rx != null) rx.peerTree_parent = y;
+ }
+ else {
+ y.right = x;
+ y.left = lx; if (lx != null) lx.peerTree_parent = y;
+ }
+ x.left = ly; if (ly != null) ly.peerTree_parent = x;
+ x.right = ry; if (ry != null) ry.peerTree_parent = x;
+ }
+ else if (y == px) {
+ x.peerTree_parent = py;
+ if (py != null) if (ypl) py.left = x; else py.right = x;
+ y.peerTree_parent = x;
+ if (xpl) {
+ x.left = y;
+ x.right = ry; if (ry != null) ry.peerTree_parent = x;
+ }
+ else {
+ x.right = y;
+ x.left = ly; if (ly != null) ly.peerTree_parent = x;
+ }
+ y.left = lx; if (lx != null) lx.peerTree_parent = y;
+ y.right = rx; if (rx != null) rx.peerTree_parent = y;
+ }
+ else {
+ x.peerTree_parent = py; if (py != null) if (ypl) py.left = x; else py.right = x;
+ x.left = ly; if (ly != null) ly.peerTree_parent = x;
+ x.right = ry; if (ry != null) ry.peerTree_parent = x;
+
+ y.peerTree_parent = px; if (px != null) if (xpl) px.left = y; else px.right = y;
+ y.left = lx; if (lx != null) lx.peerTree_parent = y;
+ y.right = rx; if (rx != null) rx.peerTree_parent = y;
+ }
+
+ boolean c = x.test(BLACK);
+ if (y.test(BLACK)) x.set(BLACK); else x.clear(BLACK);
+ if (c) y.set(BLACK); else y.clear(BLACK);
+
+ if (parent.rootChild == x) parent.rootChild = y;
+ else if (parent.rootChild == y) parent.rootChild = x;
+ }
+
+ void rotateLeft() {
+ Box r = right;
+ right = r.left;
+ if (r.left != null) r.left.peerTree_parent = this;
+ r.peerTree_parent = peerTree_parent;
+ if (peerTree_parent == null) parent.rootChild = r;
+ else if (peerTree_parent.left == this) peerTree_parent.left = r;
+ else peerTree_parent.right = r;
+ r.left = this;
+ peerTree_parent = r;
+ }
+
+ void rotateRight() {
+ Box l = left;
+ left = l.right;
+ if (l.right != null) l.right.peerTree_parent = this;
+ l.peerTree_parent = peerTree_parent;
+ if (peerTree_parent == null) parent.rootChild = l;
+ else if (peerTree_parent.right == this) peerTree_parent.right = l;
+ else peerTree_parent.left = l;
+ l.right = this;
+ peerTree_parent = l;
+ }
+
+ void fixAfterInsertion() {
+ clear(BLACK);
+ Box x = this;
+
+ while (x != null && x != parent.rootChild && !x.peerTree_parent.test(BLACK)) {
+ if (peerTree_parent(x) == leftOf(peerTree_parent(peerTree_parent(x)))) {
+ Box y = rightOf(peerTree_parent(peerTree_parent(x)));
+ if (colorOf(y) == REDbool) {
+ setColor(peerTree_parent(x), BLACKbool);
+ setColor(y, BLACKbool);
+ setColor(peerTree_parent(peerTree_parent(x)), REDbool);
+ x = peerTree_parent(peerTree_parent(x));
+ }
+ else {
+ if (x == rightOf(peerTree_parent(x))) {
+ x = peerTree_parent(x);
+ x.rotateLeft();
+ }
+ setColor(peerTree_parent(x), BLACKbool);
+ setColor(peerTree_parent(peerTree_parent(x)), REDbool);
+ if (peerTree_parent(peerTree_parent(x)) != null)
+ peerTree_parent(peerTree_parent(x)).rotateRight();
+ }
+ }
+ else {
+ Box y = leftOf(peerTree_parent(peerTree_parent(x)));
+ if (colorOf(y) == REDbool) {
+ setColor(peerTree_parent(x), BLACKbool);
+ setColor(y, BLACKbool);
+ setColor(peerTree_parent(peerTree_parent(x)), REDbool);
+ x = peerTree_parent(peerTree_parent(x));
+ }
+ else {
+ if (x == leftOf(peerTree_parent(x))) {
+ x = peerTree_parent(x);
+ x.rotateRight();
+ }
+ setColor(peerTree_parent(x), BLACKbool);
+ setColor(peerTree_parent(peerTree_parent(x)), REDbool);
+ if (peerTree_parent(peerTree_parent(x)) != null)
+ peerTree_parent(peerTree_parent(x)).rotateLeft();
+ }
+ }
+ }
+ parent.rootChild.set(BLACK);
+ }
+
+ /** From CLR **/
+ void fixAfterDeletion() {
+ Box x = this;
+ while (x != parent.rootChild && colorOf(x) == BLACKbool) {
+ if (x == leftOf(peerTree_parent(x))) {
+ Box sib = rightOf(peerTree_parent(x));
+ if (colorOf(sib) == REDbool) {
+ setColor(sib, BLACKbool);
+ setColor(peerTree_parent(x), REDbool);
+ peerTree_parent(x).rotateLeft();
+ sib = rightOf(peerTree_parent(x));
+ }
+ if (colorOf(leftOf(sib)) == BLACKbool && colorOf(rightOf(sib)) == BLACKbool) {
+ setColor(sib, REDbool);
+ x = peerTree_parent(x);
+ }
+ else {
+ if (colorOf(rightOf(sib)) == BLACKbool) {
+ setColor(leftOf(sib), BLACKbool);
+ setColor(sib, REDbool);
+ sib.rotateRight();
+ sib = rightOf(peerTree_parent(x));
+ }
+ setColor(sib, colorOf(peerTree_parent(x)));
+ setColor(peerTree_parent(x), BLACKbool);
+ setColor(rightOf(sib), BLACKbool);
+ peerTree_parent(x).rotateLeft();
+ x = parent.rootChild;
+ }
+ }
+ else {
+ Box sib = leftOf(peerTree_parent(x));
+ if (colorOf(sib) == REDbool) {
+ setColor(sib, BLACKbool);
+ setColor(peerTree_parent(x), REDbool);
+ peerTree_parent(x).rotateRight();
+ sib = leftOf(peerTree_parent(x));
+ }
+ if (colorOf(rightOf(sib)) == BLACKbool && colorOf(leftOf(sib)) == BLACKbool) {
+ setColor(sib, REDbool);
+ x = peerTree_parent(x);
+ }
+ else {
+ if (colorOf(leftOf(sib)) == BLACKbool) {
+ setColor(rightOf(sib), BLACKbool);
+ setColor(sib, REDbool);
+ sib.rotateLeft();
+ sib = leftOf(peerTree_parent(x));
+ }
+ setColor(sib, colorOf(peerTree_parent(x)));
+ setColor(peerTree_parent(x), BLACKbool);
+ setColor(leftOf(sib), BLACKbool);
+ peerTree_parent(x).rotateRight();
+ x = parent.rootChild;
+ }
+ }
+ }
+ setColor(x, BLACKbool);
+ }
+
+ // Tree Manipulation /////////////////////////////////////////////////////////////////////
+
+ /** remove this node from its parent; INVARIANT: whenever the parent of a node is changed, remove() gets called. */
+ public void remove() {
+ if (parent == null) {
+ Surface surface = Surface.fromBox(this);
+ if (surface != null) surface.dispose(true);
+ return;
+ } else {
+ parent.numchildren--;
+ }
+ Box oldparent = parent;
+ if (oldparent == null) return;
+ MARK_REFLOW;
+ dirty();
+ clear(MOUSEINSIDE);
+ removeNode();
+ parent = null;
+ if (oldparent != null) { Box b = oldparent; MARK_REFLOW_b; }
+ if (oldparent != null) oldparent.putAndTriggerTraps("childremoved", this);
+ }
+
+ /** Returns ith child */
+ public Box getChild(int i) {
+ // FIXME: store numleft and numright in the tree
+ Box left = rootChild;
+ if (left == null) return null;
+ while (left.left != null) left = left.left;
+ for(; i > 0; i--) left = left.nextSibling();
+ return left;
+ }
+
+ /** Returns our index in our parent */
+ public int getIndexInParent() {
+ // FIXME: store numleft and numright in the tree
+ if (peerTree_parent == null) return left == null ? 0 : left.numPeerChildren() + 1;
+ else if (peerTree_parent.left == this) return peerTree_parent.getIndexInParent() - 1;
+ else if (peerTree_parent.right == this) return peerTree_parent.getIndexInParent() + 1;
+ else throw new Error("we're not a child of our parent!");
+ }
+
+ public int numPeerChildren() {
+ return (left == null ? 0 : left.numPeerChildren() + 1) + (right == null ? 0 : right.numPeerChildren() + 1);
+ }
+
+ public void put(int i, Object value) {
+ if (i < 0) return;
+
+ if (value != null && !(value instanceof Box)) {
+ if (Log.on) Log.logJS(this, "attempt to set a numerical property on a box to a non-box");
+ return;
+ }
+
+ if (redirect == null) {
+ if (value == null) putAndTriggerTraps("childremoved", getChild(i));
+ else Log.logJS(this, "attempt to add/remove children to/from a node with a null redirect");
+
+ } else if (redirect != this) {
+ if (value != null) putAndTriggerTraps("childadded", value);
+ redirect.put(i, value);
+ if (value == null) {
+ Box b = (Box)redirect.get(new Integer(i));
+ if (b != null) putAndTriggerTraps("childremoved", b);
+ }
+
+ } else if (value == null) {
+ if (i < 0 || i > numchildren) return;
+ Box b = getChild(i);
+ b.remove();
+ putAndTriggerTraps("childremoved", b);
+
+ } else {
+ Box b = (Box)value;
+
+ // check if box being moved is currently target of a redirect
+ for(Box cur = b.parent; cur != null; cur = cur.parent)
+ if (cur.redirect == b) {
+ if (Log.on) Log.logJS(this, "attempt to move a box that is the target of a redirect");
+ return;
+ }
+
+ // check for recursive ancestor violation
+ for(Box cur = this; cur != null; cur = cur.parent)
+ if (cur == b) {
+ if (Log.on) Log.logJS(this, "attempt to make a node a parent of its own ancestor");
+ if (Log.on) Log.log(this, "box == " + this + " ancestor == " + b);
+ return;
+ }
+
+ b.remove();
+ b.parent = this;
+ numchildren++;
+
+ Box before = getChild(i);
+ if (before == null) {
+ if (rootChild == null) rootChild = b;
+ else rootChild.peerTree_rightmost().insertAfterMe(b);
+ }
+ else before.insertBeforeMe(b);
+
+ // need both of these in case child was already uncalc'ed
+ MARK_REFLOW_b;
+ MARK_REFLOW;
+
+ b.dirty();
+ putAndTriggerTraps("childadded", b);
+ }
+ }
+
}