MDS/openide
1
0
Fork 0
mirror of https://gitflic.ru/project/openide/openide.git synced 2026-09-27 10:03:11 +07:00
Code Issues Packages Projects Releases Wiki Activity

IDEA-230663: TreeUtil#collapseAll should not collapse a top level node if it is only one

Browse Source 
GitOrigin-RevId: 3e291acc359be0053c356d4b60a9a57207c59ec8
This commit is contained in:
Sergey Malenkov
2020-01-16 08:11:51 +00:00
committed by intellij-monorepo-bot
parent ad7889e964
commit a97745b8a0
1 changed files with 29 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files
platform/platform-api/src/com/intellij/util/ui/tree/TreeUtil.java
+29 -13
View File
@@ -812,24 +812,40 @@ public final class TreeUtil {
}
}
/**
* @param tree a tree, which nodes should be collapsed
* @param keepSelectionLevel a minimal path count of a lead selection path or {@code -1} to restore old selection
*/
public static void collapseAll(@NotNull JTree tree, final int keepSelectionLevel) {
assert EventQueue.isDispatchThread();
int row = tree.getRowCount();
if (row <= 1) return; // nothing to collapse
final TreePath leadSelectionPath = tree.getLeadSelectionPath();
int threshold = 1; // allowed path count to collapse
if (!tree.isRootVisible()) threshold++;
if (!tree.getShowsRootHandles()) threshold++;
// Collapse all
int row = tree.getRowCount() - 1;
while (row >= 0) {
tree.collapseRow(row);
row--;
}
Object root = tree.getModel().getRoot();
if (root != null && !tree.isRootVisible()) {
tree.expandPath(new TreePath(root));
boolean strict = false; // do not allow to collapse a top level node if is only one
while (0 < row--) {
if (!strict && row == 0) break;
TreePath path = tree.getPathForRow(row);
assert path != null : "path is not found at row " + row;
int count = path.getPathCount();
if (count == threshold && row > 0) strict = true;
if (count >= threshold) tree.collapsePath(path);
}
if (!strict) threshold++; // top level node is not collapsed
if (leadSelectionPath != null) {
final Object[] path = leadSelectionPath.getPath();
final Object[] pathToSelect = new Object[path.length > keepSelectionLevel && keepSelectionLevel >= 0 ? keepSelectionLevel : path.length];
System.arraycopy(path, 0, pathToSelect, 0, pathToSelect.length);
if (pathToSelect.length == 0) return;
selectPath(tree, new TreePath(pathToSelect));
TreePath path = leadSelectionPath;
if (keepSelectionLevel >= 0) {
int count = path.getPathCount() - Math.max(keepSelectionLevel, threshold);
while (0 < count--) path = path.getParentPath(); // normalize to given level
}
selectPath(tree, path);
}
}