@Override protected SplitNode getLeftChild( SplitNode node ){ return ((Node)node).getLeft(); }
@Override protected SplitNode getLeftChild( SplitNode node ){ return ((Node)node).getLeft(); }
public Cell getLeftmostCell( SplitNode node ){ while( node != null ){ if( node instanceof Node ){ node = ((Node)node).getLeft(); } else{ return cells.get( node ); } } return null; }
@Override public SplitNode getChild( int location ){ switch( location ){ case 0: return getLeft(); case 1: return getRight(); default: return null; } }
private SplitNode traverseDown( SplitNode node ){ while( node instanceof Node ){ Node n = (Node)node; boolean left = n.getLeft().isVisible(); boolean right = n.getRight().isVisible(); if( !left && right ){ node = n.getRight(); } else if( left && !right ){ node = n.getLeft(); } else{ break; } } return node; }
/** * Creates a new node-element. * @param layout the layout that uses this node * @param parent the parent of this node * @param node the node that is represented by this node-element */ public ResizeNode( LockedResizeLayoutManager<T> layout, ResizeElement<T> parent, Node node ){ super( parent, layout ); this.node = node; children[0] = layout.toElement( this, node.getLeft() ); children[1] = layout.toElement( this, node.getRight() ); }
/** * Creates a new node-element. * @param layout the layout that uses this node * @param parent the parent of this node * @param node the node that is represented by this node-element */ public ResizeNode( LockedResizeLayoutManager<T> layout, ResizeElement<T> parent, Node node ){ super( parent, layout ); this.node = node; children[0] = layout.toElement( this, node.getLeft() ); children[1] = layout.toElement( this, node.getRight() ); }
public double validateDivider( SplitDockStation station, double divider, Node node ){ divider = Math.min( 1, Math.max( 0, divider )); SplitNode left = node.getLeft(); SplitNode right = node.getRight(); Dimension leftMin = null; Dimension rightMin = null; if( left != null ){ leftMin = left.getMinimumSize(); } if( right != null ){ rightMin = right.getMinimumSize(); } if( leftMin == null ){ leftMin = new Dimension(); } if( rightMin == null ){ rightMin = new Dimension(); } return validateDivider( station, divider, leftMin, rightMin, node.getOrientation(), node.getWidth(), node.getHeight() ); }
public double validateDivider( SplitDockStation station, double divider, Node node ){ divider = Math.min( 1, Math.max( 0, divider )); SplitNode left = node.getLeft(); SplitNode right = node.getRight(); Dimension leftMin = null; Dimension rightMin = null; if( left != null ){ leftMin = left.getMinimumSize(); } if( right != null ){ rightMin = right.getMinimumSize(); } if( leftMin == null ){ leftMin = new Dimension(); } if( rightMin == null ){ rightMin = new Dimension(); } return validateDivider( station, divider, leftMin, rightMin, node.getOrientation(), node.getWidth(), node.getHeight() ); }
child = ((Node)child).getLeft();
Dimension left = column.getPreferredSize( ((Node) node).getLeft() ); Dimension right = column.getPreferredSize( ((Node) node).getRight() ); if( left == null ) {
Dimension left = column.getMinimumSize( ((Node) node).getLeft() ); Dimension right = column.getMinimumSize( ((Node) node).getRight() ); if( left == null ) {
public double validateDivider( Column column, double divider, Node node, WizardNodeMap map ){ if( divider > node.getDivider() ){ return divider; } Cell head = column.getRightmostCell( node.getLeft() ); if( head == null ){ return divider; } int min; int available; if( side().getHeaderOrientation() == Orientation.HORIZONTAL ){ min = node.getLeft().getSize().height - head.getNode().getSize().height + head.getMinimumSize().height; available = node.getSize().height; } else{ min = node.getLeft().getSize().width - head.getNode().getSize().width + head.getMinimumSize().width; available = node.getSize().width; } double minDividier = (min + gap()/2) / (double)(available + gap()); return Math.max( minDividier, divider ); }
SplitNode neighbor = null; if( put == Put.LEFT || put == Put.TOP ){ neighbor = ((Node)parent).getLeft();
/** * Gets the number of gaps between the leafs of this cell * @return the number of gaps */ public int getGaps(){ if( node instanceof Leaf ) { return 0; } if( node instanceof Node ) { int left = column.getGaps( ((Node) node).getLeft() ); int right = column.getGaps( ((Node) node).getRight() ); if( left == -1 ) { return right; } if( right == -1 ) { return left; } if( left == -1 && right == -1 ) { return -1; } return left + 1 + right; } else if( node instanceof Root ) { return column.getGaps( ((Root) node).getChild() ); } else { return -1; } } }
SplitNode left = real.getLeft(); SplitNode right = real.getRight();
int left = applyPersistentSizes( ((Node)node).getLeft(), map ); int right = applyPersistentSizes( ((Node)node).getRight(), map ); int gap = gap( (Node)node, map );