[Plexus-svn] SF.net SVN: plexus:[896] trunk/plexus-graph/src/test/java/com/phoenixst/ plexus
Status: Alpha
Brought to you by:
rconner
Menu
▾
▴
[Plexus-svn] SF.net SVN: plexus:[896] trunk/plexus-graph/src/test/java/com/phoenixst/ plexus
|
From: <rc...@us...> - 2010-09-16 16:38:12
|
Revision: 896
http://plexus.svn.sourceforge.net/plexus/?rev=896&view=rev
Author: rconner
Date: 2010-09-16 16:38:05 +0000 (Thu, 16 Sep 2010)
Log Message:
-----------
getting rid of some PMD warnings. no functional change
Modified Paths:
--------------
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/AbstractGraphTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/DefaultGraphTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/GraphPrinter.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/SimpleObjectEdge.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteBipartiteGraphTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteGraphTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteTreeTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CycleTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/EmptyGraphTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PathTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PetersenGraphTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PlanarMeshTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PrismTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/StarTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/ToroidalMeshTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/WheelTest.java
trunk/plexus-graph/src/test/java/com/phoenixst/plexus/util/SingletonGraphTest.java
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/AbstractGraphTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/AbstractGraphTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/AbstractGraphTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -117,7 +117,7 @@
////////////////////////////////////////
@SuppressWarnings( "unchecked" )
- protected void setGraph( Graph graph )
+ protected void setGraph( final Graph graph )
{
g = graph;
@@ -132,27 +132,27 @@
}
}
- protected void setPresentNodes( Object... presentNodes )
+ protected void setPresentNodes( final Object... presentNodes )
{
this.presentNodes = presentNodes;
}
- protected void setNotPresentNodes( Object... notPresentNodes )
+ protected void setNotPresentNodes( final Object... notPresentNodes )
{
this.notPresentNodes = notPresentNodes;
}
- protected void setPresentEdges( Edge... presentEdges )
+ protected void setPresentEdges( final Edge... presentEdges )
{
this.presentEdges = presentEdges;
}
- protected void setNotPresentEdges( Edge... notPresentEdges )
+ protected void setNotPresentEdges( final Edge... notPresentEdges )
{
this.notPresentEdges = notPresentEdges;
}
- protected void createPresentNodeRanges( int limit )
+ protected void createPresentNodeRanges( final int limit )
{
presentNodes = new Object[limit];
for( int i = 0; i < limit; i++ ) {
@@ -165,7 +165,7 @@
Integer.valueOf( limit ) };
}
- protected void createPresentNodeRanges( int limitA, int limitB )
+ protected void createPresentNodeRanges( final int limitA, final int limitB )
{
presentNodes = new Object[limitA * limitB];
for( int i = 0; i < limitA; i++ ) {
@@ -187,7 +187,7 @@
new OrderedIntPair( limitA, limitB - 1 ) };
}
- protected void createEdgeArrays( int limit, Predicate pred )
+ protected void createEdgeArrays( final int limit, final Predicate pred )
{
Set< Edge > goodEdges = new HashSet< Edge >();
Set< Edge > badEdges = new HashSet< Edge >();
@@ -215,7 +215,7 @@
notPresentEdges = createEdgeArray( badEdges );
}
- protected void createEdgeArrays( int limitA, int limitB, Predicate pred )
+ protected void createEdgeArrays( final int limitA, final int limitB, final Predicate pred )
{
Set< Edge > goodEdges = new HashSet< Edge >();
Set< Edge > badEdges = new HashSet< Edge >();
@@ -247,7 +247,7 @@
notPresentEdges = createEdgeArray( badEdges );
}
- private static Edge[] createEdgeArray( Collection< Edge > edges )
+ private static Edge[] createEdgeArray( final Collection< Edge > edges )
{
Edge[] edgeArray = new Edge[edges.size()];
edges.toArray( edgeArray );
@@ -289,14 +289,14 @@
// Helper methods
////////////////////////////////////////
- private static boolean isSelfEdge( Edge edge )
+ private static boolean isSelfEdge( final Edge edge )
{
Object tail = edge.getTail();
Object head = edge.getHead();
return ( tail == null ) ? head == null : tail.equals( head );
}
- private void testEdge( Edge edge, Object tail, Object head )
+ private void validateEdge( final Edge edge, final Object tail, final Object head )
{
Object edgeTail = edge.getTail();
Object edgeHead = edge.getHead();
@@ -338,7 +338,7 @@
}
}
- private void testNotPresentNodes( Closure closure )
+ private void validateNotPresentNodes( final Closure closure )
{
// Check that using nodes not present in the graph throws an
// exception.
@@ -393,9 +393,9 @@
assertEquals( count, g.degree( node ) );
}
- testNotPresentNodes( new Closure()
+ validateNotPresentNodes( new Closure()
{
- public void execute( Object object )
+ public void execute( final Object object )
{
getGraph().degree( object );
}
@@ -416,9 +416,9 @@
assertEquals( count, g.degree( node, GraphUtils.OUT_TRAVERSER_PREDICATE ) );
}
- testNotPresentNodes( new Closure()
+ validateNotPresentNodes( new Closure()
{
- public void execute( Object object )
+ public void execute( final Object object )
{
getGraph().degree( object, GraphUtils.OUT_TRAVERSER_PREDICATE );
}
@@ -439,9 +439,9 @@
assertEquals( count, g.degree( node, GraphUtils.IN_TRAVERSER_PREDICATE ) );
}
- testNotPresentNodes( new Closure()
+ validateNotPresentNodes( new Closure()
{
- public void execute( Object object )
+ public void execute( final Object object )
{
getGraph().degree( object, GraphUtils.IN_TRAVERSER_PREDICATE );
}
@@ -486,7 +486,7 @@
Predicate edgePred = EdgePredicateFactory.createEqualsNodes( tail, head, DIR_MASK );
Edge edge = g.getEdge( edgePred );
if( edge != null ) {
- testEdge( edge, tail, head );
+ validateEdge( edge, tail, head );
}
}
}
@@ -543,7 +543,7 @@
int count;
for( count = 0; edgeIter.hasNext(); count++ ) {
Edge edge = (Edge) edgeIter.next();
- testEdge( edge, edge.getTail(), edge.getHead() );
+ validateEdge( edge, edge.getTail(), edge.getHead() );
}
try {
edgeIter.next();
@@ -574,7 +574,7 @@
if( isSelfEdge( edge ) ) {
selfCount++;
}
- testEdge( edge, tail, head );
+ validateEdge( edge, tail, head );
totalCount++;
if( edge.isDirected() ) {
// Make sure we get it twice since all
@@ -633,9 +633,9 @@
edges.add( edge );
Object tail = edge.getTail();
if( ( node == null ) ? ( tail == null ) : node.equals( tail ) ) {
- testEdge( edge, node, adjNode );
+ validateEdge( edge, node, adjNode );
} else {
- testEdge( edge, adjNode, node );
+ validateEdge( edge, adjNode, node );
}
}
try {
@@ -651,9 +651,9 @@
assertEquals( totalCount + selfCount, 2 * realEdges.size() );
- testNotPresentNodes( new Closure()
+ validateNotPresentNodes( new Closure()
{
- public void execute( Object object )
+ public void execute( final Object object )
{
getGraph().traverser( object, null );
}
@@ -679,7 +679,7 @@
Edge edge = t.getEdge();
edges.add( edge );
- testEdge( edge, node, adjNode );
+ validateEdge( edge, node, adjNode );
}
try {
t.next();
@@ -692,9 +692,9 @@
assertEquals( count, edges.size() );
}
- testNotPresentNodes( new Closure()
+ validateNotPresentNodes( new Closure()
{
- public void execute( Object object )
+ public void execute( final Object object )
{
getGraph().traverser( object, GraphUtils.OUT_TRAVERSER_PREDICATE );
}
@@ -720,7 +720,7 @@
Edge edge = t.getEdge();
edges.add( edge );
- testEdge( edge, adjNode, node );
+ validateEdge( edge, adjNode, node );
}
try {
t.next();
@@ -733,9 +733,9 @@
assertEquals( count, edges.size() );
}
- testNotPresentNodes( new Closure()
+ validateNotPresentNodes( new Closure()
{
- public void execute( Object object )
+ public void execute( final Object object )
{
getGraph().traverser( object, GraphUtils.IN_TRAVERSER_PREDICATE );
}
@@ -762,7 +762,7 @@
{
private static final long serialVersionUID = 1L;
- public OrderedIntPair( int first, int second )
+ public OrderedIntPair( final int first, final int second )
{
super( Integer.valueOf( first ), Integer.valueOf( second ) );
}
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/DefaultGraphTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/DefaultGraphTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/DefaultGraphTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -19,6 +19,7 @@
import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
+import java.io.IOException;
import java.io.ObjectInputStream;
import java.io.ObjectOutputStream;
import java.util.Arrays;
@@ -43,6 +44,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class DefaultGraphTest extends AbstractGraphTest
{
private static final Edge[] EMPTY_EDGE_ARRAY = new Edge[0];
@@ -59,7 +61,7 @@
@Test
public void testDeserialization()
- throws Exception
+ throws IOException, ClassNotFoundException
{
// Make sure we're not being tested inappropriately.
assertEquals( DefaultGraph.class, getGraph().getClass() );
@@ -95,7 +97,7 @@
Set< Edge > badEdges = new HashSet< Edge >();
@SuppressWarnings( "unchecked" )
- GraphSetup( Graph graph )
+ GraphSetup( final Graph graph )
{
// Assumption is that the graph being copied works just fine.
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/GraphPrinter.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/GraphPrinter.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/GraphPrinter.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -39,7 +39,7 @@
*
* @author rconner
*/
-public class GraphPrinter
+public final class GraphPrinter
{
private GraphPrinter()
@@ -47,7 +47,7 @@
super();
}
- public static void printNode( PrintStream out, Graph graph, Object node )
+ public static void printNode( final PrintStream out, final Graph graph, final Object node )
{
out.println( "Node " + node );
@@ -69,7 +69,7 @@
}
- public static void printEdge( PrintStream out, Edge edge )
+ public static void printEdge( final PrintStream out, final Edge edge )
{
Object object = edge.getUserObject();
Object tail = edge.getTail();
@@ -82,7 +82,7 @@
}
- public static void printGraph( PrintStream out, String msg, Graph graph )
+ public static void printGraph( final PrintStream out, final String msg, final Graph graph )
{
out.println( "\n" + msg );
out.println( "Graph = " + graph );
@@ -101,7 +101,7 @@
}
- public static void printGraph( String msg, Graph graph )
+ public static void printGraph( final String msg, final Graph graph )
{
printGraph( System.out, msg, graph );
}
@@ -146,7 +146,7 @@
}
- public static void main( String[] args )
+ public static void main( final String[] args )
{
printStandardGraphs();
}
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/SimpleObjectEdge.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/SimpleObjectEdge.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/SimpleObjectEdge.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -39,7 +39,7 @@
/**
* Creates a new <code>SimpleObjectEdge</code>.
*/
- public SimpleObjectEdge( Object object, Object tail, Object head, boolean directed )
+ public SimpleObjectEdge( final Object object, final Object tail, final Object head, final boolean directed )
{
super( object, tail, head, directed );
}
@@ -49,7 +49,7 @@
// Other methods
////////////////////////////////////////
- private boolean equals( Object tail, Object head )
+ private boolean equals( final Object tail, final Object head )
{
return GraphUtils.equals( getTail(), tail )
&& GraphUtils.equals( getHead(), head );
@@ -61,7 +61,7 @@
* object.
*/
@Override
- public boolean equals( Object object )
+ public boolean equals( final Object object )
{
if( !( object instanceof SimpleObjectEdge ) ) {
return false;
@@ -80,7 +80,7 @@
&& equals( edge.getHead(), edge.getTail() );
}
- private int hashCode( Object object )
+ private int hashCode( final Object object )
{
return object == null ? 0 : object.hashCode();
}
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteBipartiteGraphTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteBipartiteGraphTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteBipartiteGraphTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class CompleteBipartiteGraphTest extends AbstractGraphTest
{
void set( final int m, final int n )
@@ -35,7 +36,7 @@
createPresentNodeRanges( m + n );
createEdgeArrays( m + n, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteGraphTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteGraphTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteGraphTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class CompleteGraphTest extends AbstractGraphTest
{
void set( final int n )
@@ -35,7 +36,7 @@
createPresentNodeRanges( n );
createEdgeArrays( n, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteTreeTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteTreeTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CompleteTreeTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class CompleteTreeTest extends AbstractGraphTest
{
void set( final int height, final int numChildren )
@@ -47,7 +48,7 @@
createPresentNodeRanges( n );
createEdgeArrays( n, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CycleTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CycleTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/CycleTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class CycleTest extends AbstractGraphTest
{
void set( final int n )
@@ -35,7 +36,7 @@
createPresentNodeRanges( n );
createEdgeArrays( n, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/EmptyGraphTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/EmptyGraphTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/EmptyGraphTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -26,6 +26,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class EmptyGraphTest extends AbstractGraphTest
{
void set( final int n )
@@ -34,7 +35,7 @@
createPresentNodeRanges( n );
createEdgeArrays( n, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
return false;
}
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PathTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PathTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PathTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class PathTest extends AbstractGraphTest
{
void set( final int n )
@@ -35,7 +36,7 @@
createPresentNodeRanges( n );
createEdgeArrays( n, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PetersenGraphTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PetersenGraphTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PetersenGraphTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.TestClassWithoutTestCases" )
public class PetersenGraphTest extends AbstractGraphTest
{
@Before
@@ -37,7 +38,7 @@
createEdgeArrays( 10, new Predicate()
{
// Assumes tail < head
- private boolean evaluate( int tail, int head )
+ private boolean evaluate( final int tail, final int head )
{
int diff = head - tail;
if( tail < 5 ) {
@@ -48,7 +49,7 @@
return diff == 2 || diff == 3;
}
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PlanarMeshTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PlanarMeshTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PlanarMeshTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -29,6 +29,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class PlanarMeshTest extends AbstractGraphTest
{
void set( final int m, final int n )
@@ -38,7 +39,7 @@
createEdgeArrays( m, n, new Predicate()
{
@SuppressWarnings( "unchecked" )
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PrismTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PrismTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/PrismTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -29,6 +29,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class PrismTest extends AbstractGraphTest
{
void set( final int m, final int n )
@@ -38,7 +39,7 @@
createEdgeArrays( m, n, new Predicate()
{
@SuppressWarnings( "unchecked" )
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/StarTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/StarTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/StarTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class StarTest extends AbstractGraphTest
{
void set( final int n )
@@ -35,7 +36,7 @@
createPresentNodeRanges( n + 1 );
createEdgeArrays( n + 1, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/ToroidalMeshTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/ToroidalMeshTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/ToroidalMeshTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -29,6 +29,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class ToroidalMeshTest extends AbstractGraphTest
{
void set( final int m, final int n )
@@ -38,7 +39,7 @@
createEdgeArrays( m, n, new Predicate()
{
@SuppressWarnings( "unchecked" )
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/WheelTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/WheelTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/examples/WheelTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -27,6 +27,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class WheelTest extends AbstractGraphTest
{
void set( final int n )
@@ -35,7 +36,7 @@
createPresentNodeRanges( n + 1 );
createEdgeArrays( n + 1, new Predicate()
{
- public boolean evaluate( Object object )
+ public boolean evaluate( final Object object )
{
Edge edge = (Edge) object;
if( !edge.isDirected() ) {
Modified: trunk/plexus-graph/src/test/java/com/phoenixst/plexus/util/SingletonGraphTest.java
===================================================================
--- trunk/plexus-graph/src/test/java/com/phoenixst/plexus/util/SingletonGraphTest.java 2010-09-16 16:17:44 UTC (rev 895)
+++ trunk/plexus-graph/src/test/java/com/phoenixst/plexus/util/SingletonGraphTest.java 2010-09-16 16:38:05 UTC (rev 896)
@@ -26,6 +26,7 @@
*
* @author rconner
*/
+@SuppressWarnings( "PMD.AbstractNaming" )
public abstract class SingletonGraphTest extends AbstractGraphTest
{
void setNode( final Object node )
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
