3144 |
if (!mod.isLeaf(node)) |
if (!mod.isLeaf(node)) |
3145 |
max = mod.getChildCount(node); |
max = mod.getChildCount(node); |
3146 |
|
|
3147 |
if (!node.equals(mod.getRoot())) |
if (!node.equals(mod.getRoot()) && |
3148 |
|
(tree.isRootVisible() || getLevel(node) != 1)) |
3149 |
icon.paintIcon(tree, g, indentation - rightChildIndent - 3, h); |
icon.paintIcon(tree, g, indentation - rightChildIndent - 3, h); |
3150 |
|
|
3151 |
if (tree.isExpanded(path)) |
if (tree.isExpanded(path)) |
3692 |
current = current.pathByAddingChild(next); |
current = current.pathByAddingChild(next); |
3693 |
else |
else |
3694 |
current = new TreePath(next); |
current = new TreePath(next); |
3695 |
|
|
3696 |
|
// FIXME: Inefficent to have 2 loops when the |
3697 |
|
// tree is very large. Find a better way. |
3698 |
do |
do |
3699 |
next = getNextNode(next); |
next = getNextNode(next); |
3700 |
while (next != null |
while (next != null |