removed obsolete @SuppressWarnings and casts due to new jdepend library

Author: davidburkhart

src/main/java/de/andrena/tools/nopackagecycles/NoPackageCyclesRule.java

@@ -51,7 +51,6 @@ protected JDepend createJDepend() {
 	}
 
 	private String getPackageCycles(JDepend jdepend) {
-		@SuppressWarnings("unchecked")
 		Collection<JavaPackage> packages = jdepend.getPackages();
 		return new PackageCycleOutput(new ArrayList<JavaPackage>(packages)).getOutput();
 	}

src/main/java/de/andrena/tools/nopackagecycles/PackageCycleCollector.java

@@ -1,30 +1,27 @@
 package de.andrena.tools.nopackagecycles;
 
-import java.util.Collection;
 import java.util.Iterator;
 import java.util.List;
 import java.util.Set;
 
-import jdepend.framework.JavaPackage;
-
 import org.jgrapht.DirectedGraph;
 import org.jgrapht.alg.StrongConnectivityInspector;
 import org.jgrapht.graph.DefaultDirectedGraph;
 import org.jgrapht.graph.DefaultEdge;
 
+import jdepend.framework.JavaPackage;
+
 public class PackageCycleCollector {
 
 	public List<Set<JavaPackage>> collectCycles(List<JavaPackage> packages) {
-		DirectedGraph<JavaPackage, DefaultEdge> graph = new DefaultDirectedGraph<JavaPackage, DefaultEdge>(
-				DefaultEdge.class);
+		DirectedGraph<JavaPackage, DefaultEdge> graph = new DefaultDirectedGraph<>(DefaultEdge.class);
 		addVerticesToGraph(packages, graph);
 		addEdgesToGraph(packages, graph);
 		return collectCycles(graph);
 	}
 
 	private List<Set<JavaPackage>> collectCycles(DirectedGraph<JavaPackage, DefaultEdge> graph) {
-		List<Set<JavaPackage>> stronglyConnectedSets = new StrongConnectivityInspector<JavaPackage, DefaultEdge>(graph)
-				.stronglyConnectedSets();
+		List<Set<JavaPackage>> stronglyConnectedSets = new StrongConnectivityInspector<>(graph).stronglyConnectedSets();
 		removeSingletonSets(stronglyConnectedSets);
 		return stronglyConnectedSets;
 	}
@@ -39,10 +36,9 @@ private void removeSingletonSets(List<Set<JavaPackage>> stronglyConnectedSets) {
 		}
 	}
 
-	@SuppressWarnings("unchecked")
 	private void addEdgesToGraph(List<JavaPackage> packages, DirectedGraph<JavaPackage, DefaultEdge> graph) {
 		for (JavaPackage javaPackage : packages) {
-			for (JavaPackage efferent : (Collection<JavaPackage>) javaPackage.getEfferents()) {
+			for (JavaPackage efferent : javaPackage.getEfferents()) {
 				graph.addEdge(javaPackage, efferent);
 			}
 		}

src/main/java/de/andrena/tools/nopackagecycles/PackageCycleOutput.java

@@ -84,7 +84,6 @@ private void appendOutputForCyclicPackage(final JavaPackage javaPackage, JavaPac
 
 	private List<JavaClass> getOrderedDependentClasses(JavaPackage javaPackage, JavaPackage cyclicPackage) {
 		List<JavaClass> dependentClasses = new ArrayList<JavaClass>();
-		@SuppressWarnings("unchecked")
 		Collection<JavaClass> allClasses = javaPackage.getClasses();
 		for (JavaClass javaClass : allClasses) {
 			if (javaClass.getImportedPackages().contains(cyclicPackage)) {