private NodeItem nextLeft(NodeItem n) { NodeItem c = null; if ( n.isExpanded() ) c = (NodeItem)n.getFirstChild(); return ( c != null ? c : getParams(n).thread ); }
++leafCount; } else if ( n.isExpanded() ) { NodeItem c = (NodeItem)n.getFirstChild(); for (; c!=null; c = (NodeItem)c.getNextSibling()) { area += c.getDouble(AREA);
private void secondWalk(NodeItem n, NodeItem p, double m, int depth) { Params np = getParams(n); setBreadth(n, p, np.prelim + m); setDepth(n, p, m_depths[depth]); if ( n.isExpanded() ) { depth += 1; for ( NodeItem c = (NodeItem)n.getFirstChild(); c != null; c = (NodeItem)c.getNextSibling() ) { secondWalk(c, n, m + np.mod, depth); } } np.clear(); }
if ( cc == 0 ) return null; NodeItem c = (NodeItem)n.getFirstChild();
NodeItem leftMost = (NodeItem)n.getFirstChild(); NodeItem rightMost = (NodeItem)n.getLastChild(); NodeItem defaultAncestor = leftMost;