diff options
| author | Simon Brandhof <simon.brandhof@gmail.com> | 2013-08-16 23:32:08 +0200 |
|---|---|---|
| committer | Simon Brandhof <simon.brandhof@gmail.com> | 2013-08-16 23:32:08 +0200 |
| commit | a48f3652c54ac1b9444ff740ab020d035fba293d (patch) | |
| tree | 21d1c9544934367b82e7f37f4ac7bff4e7ebe946 /sonar-graph/src | |
| parent | 39f367043ff3cb6eb7deaa0edd168073c83da0e7 (diff) | |
| download | sonarqube-a48f3652c54ac1b9444ff740ab020d035fba293d.tar.gz sonarqube-a48f3652c54ac1b9444ff740ab020d035fba293d.zip | |
Fix some quality flaws
Diffstat (limited to 'sonar-graph/src')
| -rw-r--r-- | sonar-graph/src/main/java/org/sonar/graph/Dsm.java | 2 | ||||
| -rw-r--r-- | sonar-graph/src/main/java/org/sonar/graph/DsmTopologicalSorter.java | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/sonar-graph/src/main/java/org/sonar/graph/Dsm.java b/sonar-graph/src/main/java/org/sonar/graph/Dsm.java index 941ecbb2c1c..8ac2715936d 100644 --- a/sonar-graph/src/main/java/org/sonar/graph/Dsm.java +++ b/sonar-graph/src/main/java/org/sonar/graph/Dsm.java @@ -53,7 +53,7 @@ public class Dsm<V> { V to = vertices[y]; Edge<V> edge = graph.getEdge(from, to); - boolean isFeedbackEdge = (edge != null && feedbackEdges.contains(edge)); + boolean isFeedbackEdge = edge != null && feedbackEdges.contains(edge); DsmCell cell = new DsmCell(edge, isFeedbackEdge); cells[x][y] = cell; } diff --git a/sonar-graph/src/main/java/org/sonar/graph/DsmTopologicalSorter.java b/sonar-graph/src/main/java/org/sonar/graph/DsmTopologicalSorter.java index b28685a9f86..85a77a91b7e 100644 --- a/sonar-graph/src/main/java/org/sonar/graph/DsmTopologicalSorter.java +++ b/sonar-graph/src/main/java/org/sonar/graph/DsmTopologicalSorter.java @@ -39,7 +39,7 @@ public final class DsmTopologicalSorter<V> { boolean dsmCanBeSortedOnRight = partitionner.pushToRightVerticesWithoutOutgointEdges(); dsmCanBeSorted = dsmCanBeSortedOnLeft || dsmCanBeSortedOnRight; } - boolean isCyclicGraph = (partitionner.leftOrderedIndex < partitionner.rightOrderedIndex); + boolean isCyclicGraph = partitionner.leftOrderedIndex < partitionner.rightOrderedIndex; if (isCyclicGraph) { throw new IllegalStateException("Can't sort a cyclic graph."); } |