(node, compare)
| 6217 | return children && (n = children.length) ? children[n - 1] : node._tree.thread; |
| 6218 | } |
| 6219 | function d3_layout_treeSearch(node, compare) { |
| 6220 | var children = node.children; |
| 6221 | if (children && (n = children.length)) { |
| 6222 | var child, n, i = -1; |
| 6223 | while (++i < n) { |
| 6224 | if (compare(child = d3_layout_treeSearch(children[i], compare), node) > 0) { |
| 6225 | node = child; |
| 6226 | } |
| 6227 | } |
| 6228 | } |
| 6229 | return node; |
| 6230 | } |
| 6231 | function d3_layout_treeRightmost(a, b) { |
| 6232 | return a.x - b.x; |
| 6233 | } |