}
for (InspectionPackageNode packageNode : packageNodes.values()) {
if (packageNode.getPackageName() != null) {
- insertByIndex(packageNode, moduleNode);
+ moduleNode.insertByOrder(packageNode);
for (UserObjectContainer<T> container : packageDescriptors.get(packageNode)) {
appendDescriptor(context, toolWrapper, container, packageNode, canPackageRepeat);
}
return false;
}
else {
- insertByIndex(finalPrevNode, refElementNode);
+ refElementNode.insertByOrder(finalPrevNode);
result.set(nodeToBeAdded);
return false;
}
if(!result.isNull()) return result.get();
if (!firstLevel.get()) {
- insertByIndex(prevNode, currentNode);
+ currentNode.insertByOrder(prevNode);
}
final UserObjectContainer owner = container.getOwner();
if (owner == null) {
- insertByIndex(currentNode, parentNode);
+ parentNode.insertByOrder(currentNode);
return nodeToBeAdded;
}
container = owner;
}
}
}
- insertByIndex(child, parent);
- }
-
- public static void insertByIndex(InspectionTreeNode child, InspectionTreeNode parent) {
- if (parent.getIndex(child) != -1) {
- return;
- }
- final int i = TreeUtil.indexedBinarySearch(parent, child, InspectionResultsViewComparator.getInstance());
- if (i >= 0){
- return;
- }
- parent.insert(child, -i -1);
+ parent.insertByOrder(child);
}
private static void processDepth(final InspectionTreeNode child, final InspectionTreeNode current) {
final RefElementNode elemNode = addNodeToParent(container, presentation, pNode);
for (CommonProblemDescriptor problem : problems) {
assert problem != null;
- insertByIndex(new ProblemDescriptionNode(refElement, problem, toolWrapper,presentation), elemNode);
+ elemNode.insertByOrder(new ProblemDescriptionNode(refElement, problem, toolWrapper,presentation));
if (problems.length == 1) {
elemNode.setProblem(problems[0]);
}
final OfflineProblemDescriptorNode child =
OfflineProblemDescriptorNode.create(((OfflineProblemDescriptorContainer)container).getUserObject(),
(LocalInspectionToolWrapper)toolWrapper, presentation);
- insertByIndex(child, elemNode);
+ elemNode.insertByOrder(child);
}
}
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.ConcurrentMap;
-import static com.intellij.codeInspection.ex.InspectionRVContentProvider.insertByIndex;
-
/**
* @author max
*/
}
group = ConcurrencyUtil.cacheOrGet(map, groupName, new InspectionGroupNode(groupName, groupPath));
if (!myDisposed) {
- insertByIndex(group, getRelativeRootNode(groupedBySeverity, errorLevel));
+ getRelativeRootNode(groupedBySeverity, errorLevel).insertByOrder(group);
}
}
return group;
severityGroupNode = ConcurrencyUtil.cacheOrGet(mySeverityGroupNodes, level, newNode);
if (severityGroupNode == newNode) {
InspectionTreeNode root = myTree.getRoot();
- insertByIndex(severityGroupNode, root);
+ root.insertByOrder(severityGroupNode);
}
}
return severityGroupNode;
import com.intellij.codeInspection.reference.RefEntity;
import com.intellij.openapi.vcs.FileStatus;
import com.intellij.util.containers.FactoryMap;
+import com.intellij.util.ui.tree.TreeUtil;
import org.jetbrains.annotations.Nullable;
import javax.swing.*;
return true;
}
- public boolean isExcluded(ExcludedInspectionTreeNodesManager excludedManager){
+ public boolean isExcluded(ExcludedInspectionTreeNodesManager excludedManager) {
return excludedManager.isExcluded(this);
}
return null;
}
- public FileStatus getNodeStatus(){
+ public FileStatus getNodeStatus() {
return FileStatus.NOT_CHANGED;
}
}
}
+ public void insertByOrder(InspectionTreeNode child) {
+ if (getIndex(child) != -1) {
+ return;
+ }
+ final int i = TreeUtil.indexedBinarySearch(this, child, InspectionResultsViewComparator.getInstance());
+ if (i >= 0){
+ return;
+ }
+ insert(child, -i -1);
+ }
+
@Override
public void add(MutableTreeNode newChild) {
super.add(newChild);
}
@Override
- public synchronized void setParent(MutableTreeNode newParent) {
- super.setParent(newParent);
+ public synchronized TreeNode getParent() {
+ return super.getParent();
}
@Override
- public synchronized TreeNode getParent() {
- return super.getParent();
+ public synchronized void setParent(MutableTreeNode newParent) {
+ super.setParent(newParent);
}
}
private boolean needRestore(@NotNull InspectionTreeNode node) {
for (Object o : mySelectionPath.myPath) {
- if (InspectionResultsViewComparator.getInstance().areEqual(o, node)) {
+ if (InspectionResultsViewComparator.getInstance().areEqual((InspectionTreeNode)o, node)) {
return true;
}
}