blob: 3751d70fdb10360943ad7193a7e6e3d0381a4420 [file] [log] [blame]
/*
* Copyright (C) 2014 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package com.android.tools.idea.tests.gui.framework.fixture;
import com.google.common.collect.Lists;
import com.intellij.codeInspection.ui.InspectionTree;
import com.intellij.codeInspection.ui.InspectionTreeNode;
import com.intellij.openapi.project.Project;
import com.intellij.openapi.wm.ToolWindowId;
import org.fest.swing.core.Robot;
import org.fest.swing.edt.GuiQuery;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import static org.fest.swing.edt.GuiActionRunner.execute;
/**
* Fixture for the Inspections window in the IDE
*/
public class InspectionsFixture extends ToolWindowFixture {
private final InspectionTree myTree;
public InspectionsFixture(@NotNull Robot robot, @NotNull Project project, InspectionTree tree) {
super(ToolWindowId.INSPECTION, project, robot);
myTree = tree;
}
public String getResults() {
activate();
waitUntilIsVisible();
return execute(new GuiQuery<String>() {
@Override
@Nullable
protected String executeInEDT() throws Throwable {
StringBuilder sb = new StringBuilder();
InspectionsFixture.describe(myTree.getRoot(), sb, 0);
return sb.toString();
}
});
}
public static void describe(@NotNull InspectionTreeNode node, @NotNull StringBuilder sb, int depth) {
for (int i = 0; i < depth; i++) {
sb.append(" ");
}
sb.append(node.toString());
sb.append("\n");
// The exact order of the results sometimes varies so sort the children alphabetically
// instead to ensure stable test output
List<InspectionTreeNode> children = Lists.newArrayListWithExpectedSize(node.getChildCount());
for (int i = 0, n = node.getChildCount(); i < n; i++) {
children.add((InspectionTreeNode)node.getChildAt(i));
}
Collections.sort(children, new Comparator<InspectionTreeNode>() {
@Override
public int compare(InspectionTreeNode node1, InspectionTreeNode node2) {
return node1.toString().compareTo(node2.toString());
}
});
for (InspectionTreeNode child : children) {
describe(child, sb, depth + 1);
}
}
}