private int computePriority(IProblem problem) {
- final int P_STATIC = 1000;
+ //final int P_STATIC = 1000;
final int P_OUTSIDE_METHOD = 4000;
final int P_FIRST_ERROR = 2000;
final int P_ERROR = 10000;
return this.tasks;
}
- public boolean hasErrors() {
-
- if (problems != null)
- for (int i = 0; i < problemCount; i++) {
- if (problems[i].isError())
- return true;
- }
- return false;
- }
-
- public boolean hasProblems() {
-
- return problemCount != 0;
- }
+// public boolean hasErrors() {
+//
+// if (problems != null)
+// for (int i = 0; i < problemCount; i++) {
+// if (problems[i].isError())
+// return true;
+// }
+// return false;
+// }
+
+// public boolean hasProblems() {
+//
+// return problemCount != 0;
+// }
public boolean hasSyntaxError() {
return false;
}
- public boolean hasTasks() {
- return this.taskCount != 0;
- }
-
- public boolean hasWarnings() {
-
- if (problems != null)
- for (int i = 0; i < problemCount; i++) {
- if (problems[i].isWarning())
- return true;
- }
- return false;
- }
+// public boolean hasTasks() {
+// return this.taskCount != 0;
+// }
+
+// public boolean hasWarnings() {
+//
+// if (problems != null)
+// for (int i = 0; i < problemCount; i++) {
+// if (problems[i].isWarning())
+// return true;
+// }
+// return false;
+// }
private static void quickSort(IProblem[] list, int left, int right) {