/** * Visit tree ancestors and their other descendants. */ private void visitAncestors(NodeItem n) { if ( n == m_root ) return; visitFocus((NodeItem)n.getParent(), n); }
private Point2D getPoint(NodeItem n, boolean start) { NodeItem p = (NodeItem)n.getParent(); if ( start ) for (; p!=null && !p.isStartVisible(); p=(NodeItem)p.getParent()); else for (; p!=null && !p.isEndVisible(); p=(NodeItem)p.getParent()); if ( p == null ) { m_point.setLocation(n.getX(), n.getY());
while ( rowIter.hasNext() ) { NodeItem n = (NodeItem)rowIter.next(); NodeItem p = (NodeItem)n.getParent(); if ( horiz ) { setX(n, p, x+d);
NodeItem pp = (NodeItem)p.getParent(); if ( pp == r ) { break;
private Iterator sortedChildren(final NodeItem n) { double base = 0; NodeItem p = (NodeItem)n.getParent(); if ( p != null ) { base = normalize(Math.atan2(p.getY()-n.getY(), p.getX()-n.getX()));
vom = (NodeItem)vip.getParent().getFirstChild();