X-Git-Url: http://git.phpeclipse.com

diff --git a/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/LRUCacheEnumerator.java b/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/LRUCacheEnumerator.java
index 8a04b28..1aa66be 100644
--- a/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/LRUCacheEnumerator.java
+++ b/net.sourceforge.phpeclipse/src/net/sourceforge/phpdt/internal/core/LRUCacheEnumerator.java
@@ -13,29 +13,28 @@ package net.sourceforge.phpdt.internal.core;
 import java.util.Enumeration;
 
 /**
- *	The <code>LRUCacheEnumerator</code> returns its elements in 
- *	the order they are found in the <code>LRUCache</code>, with the
- *	most recent elements first.
- *
- *	Once the enumerator is created, elements which are later added 
- *	to the cache are not returned by the enumerator.  However,
- *	elements returned from the enumerator could have been closed 
- *	by the cache.
+ * The <code>LRUCacheEnumerator</code> returns its elements in the order they
+ * are found in the <code>LRUCache</code>, with the most recent elements
+ * first.
+ * 
+ * Once the enumerator is created, elements which are later added to the cache
+ * are not returned by the enumerator. However, elements returned from the
+ * enumerator could have been closed by the cache.
  */
 public class LRUCacheEnumerator implements Enumeration {
 	/**
-	 *	Current element;
+	 * Current element;
 	 */
 	protected LRUEnumeratorElement fElementQueue;
 
 	public static class LRUEnumeratorElement {
 		/**
-		 *	Value returned by <code>nextElement()</code>;
+		 * Value returned by <code>nextElement()</code>;
 		 */
 		public Object fValue;
-		
+
 		/**
-		 *	Next element
+		 * Next element
 		 */
 		public LRUEnumeratorElement fNext;
 
@@ -46,24 +45,28 @@ public class LRUCacheEnumerator implements Enumeration {
 			fValue = value;
 		}
 	}
-/**
- *	Creates a CacheEnumerator on the list of <code>LRUEnumeratorElements</code>.
- */
-public LRUCacheEnumerator(LRUEnumeratorElement firstElement) {
-	fElementQueue = firstElement;
-}
-/**
- * Returns true if more elements exist.
- */
-public boolean hasMoreElements() {
-	return fElementQueue != null;
-}
-/**
- * Returns the next element.
- */
-public Object nextElement() {
-	Object temp = fElementQueue.fValue;
-	fElementQueue = fElementQueue.fNext;
-	return temp;
-}
+
+	/**
+	 * Creates a CacheEnumerator on the list of
+	 * <code>LRUEnumeratorElements</code>.
+	 */
+	public LRUCacheEnumerator(LRUEnumeratorElement firstElement) {
+		fElementQueue = firstElement;
+	}
+
+	/**
+	 * Returns true if more elements exist.
+	 */
+	public boolean hasMoreElements() {
+		return fElementQueue != null;
+	}
+
+	/**
+	 * Returns the next element.
+	 */
+	public Object nextElement() {
+		Object temp = fElementQueue.fValue;
+		fElementQueue = fElementQueue.fNext;
+		return temp;
+	}
 }