svn commit: r1145302 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java

[simonetripodi]

Author: simonetripodi
Date: Mon Jul 11 19:36:09 2011
New Revision: 1145302

URL: http://svn.apache.org/viewvc?rev=1145302&view=rev
Log:
in Collections the generic element is denoted with <E>, just a matter of 
coherence

Modified:
    
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java

Modified: 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java
URL: 
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java?rev=1145302&r1=1145301&r2=1145302&view=diff
==============================================================================
--- 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java
 (original)
+++ 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeapNode.java
 Mon Jul 11 19:36:09 2011
@@ -19,64 +19,64 @@ package org.apache.commons.graph.collect
  * under the License.
  */
 
-final class FibonacciHeapNode<T>
+final class FibonacciHeapNode<E>
 {
 
-    private final T value;
+    private final E value;
 
-    private FibonacciHeapNode<T> parent;
+    private FibonacciHeapNode<E> parent;
 
-    private FibonacciHeapNode<T> previous;
+    private FibonacciHeapNode<E> previous;
 
-    private FibonacciHeapNode<T> next;
+    private FibonacciHeapNode<E> next;
 
-    private FibonacciHeapNode<T> child;
+    private FibonacciHeapNode<E> child;
 
     private int degree = 0;
 
     private boolean marked = false;
 
-    public FibonacciHeapNode( T value )
+    public FibonacciHeapNode( E value )
     {
         this.value = value;
     }
 
-    public FibonacciHeapNode<T> getParent()
+    public FibonacciHeapNode<E> getParent()
     {
         return parent;
     }
 
-    public void setParent( FibonacciHeapNode<T> parent )
+    public void setParent( FibonacciHeapNode<E> parent )
     {
         this.parent = parent;
     }
 
-    public FibonacciHeapNode<T> getPrevious()
+    public FibonacciHeapNode<E> getPrevious()
     {
         return previous;
     }
 
-    public void setPrevious( FibonacciHeapNode<T> previous )
+    public void setPrevious( FibonacciHeapNode<E> previous )
     {
         this.previous = previous;
     }
 
-    public FibonacciHeapNode<T> getNext()
+    public FibonacciHeapNode<E> getNext()
     {
         return next;
     }
 
-    public void setNext( FibonacciHeapNode<T> next )
+    public void setNext( FibonacciHeapNode<E> next )
     {
         this.next = next;
     }
 
-    public FibonacciHeapNode<T> getChild()
+    public FibonacciHeapNode<E> getChild()
     {
         return child;
     }
 
-    public void setChild( FibonacciHeapNode<T> child )
+    public void setChild( FibonacciHeapNode<E> child )
     {
         this.child = child;
     }
@@ -101,7 +101,7 @@ final class FibonacciHeapNode<T>
         this.marked = marked;
     }
 
-    public T getValue()
+    public E getValue()
     {
         return value;
     }