commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From simonetrip...@apache.org
Subject svn commit: r1360097 - /commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java
Date Wed, 11 Jul 2012 10:18:40 GMT
Author: simonetripodi
Date: Wed Jul 11 10:18:39 2012
New Revision: 1360097

URL: http://svn.apache.org/viewvc?rev=1360097&view=rev
Log:
dropped trailing spaces on empty lines, no functional modifications

Modified:
    commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java

Modified: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java?rev=1360097&r1=1360096&r2=1360097&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java
(original)
+++ commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java
Wed Jul 11 10:18:39 2012
@@ -94,7 +94,7 @@ public final class FibonacciHeapTestCase
         assertThat( queue.poll(), is( 100 ) );
         assertThat( queue.isEmpty(), is( true ) );
     }
-    
+
     @Test
     public void insertSingleItem()
     {
@@ -103,7 +103,7 @@ public final class FibonacciHeapTestCase
         assertThat( queue.poll(), is( 50 ) );
         assertThat( queue.isEmpty(), is( true ) );
     }
-    
+
     @Test
     public void insertSameValuesAndReturnsOrderedItems()
     {
@@ -123,16 +123,16 @@ public final class FibonacciHeapTestCase
     {
         final Random r = new Random( System.currentTimeMillis() );
         final List<Integer> expected = new ArrayList<Integer>();
-        
+
         for ( int i = 0; i < 1000; i++ )
         {
             Integer number = new Integer( r.nextInt(10000) );
             expected.add( number );
-            
+
             queue.add( number );
         }
         Collections.sort( expected );
-        
+
         for ( Integer integer : expected )
         {
             Integer i = queue.poll();



Mime
View raw message