ArrayStack is based on insertion
* order: The most recently added element is removed first. The iteration
* order is not the same as the removal order. The iterator returns
- * elements from the bottom up, whereas the {@link remove()} method removes
+ * elements from the bottom up, whereas the {@link #remove()} method removes
* them from the top down.
*
* @since 1.0
* @author Craig R. McClanahan
- * @version $Revision: 1.6 $ $Date: 2002/07/03 02:09:06 $
+ * @version $Revision: 1.7 $ $Date: 2002/07/03 02:16:48 $
* @see java.util.Stack
*/
diff --git a/src/java/org/apache/commons/collections/BinaryHeap.java b/src/java/org/apache/commons/collections/BinaryHeap.java
index 29cb34d23..3df2dba36 100644
--- a/src/java/org/apache/commons/collections/BinaryHeap.java
+++ b/src/java/org/apache/commons/collections/BinaryHeap.java
@@ -1,7 +1,7 @@
/*
- * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/BinaryHeap.java,v 1.8 2002/07/03 02:09:06 mas Exp $
- * $Revision: 1.8 $
- * $Date: 2002/07/03 02:09:06 $
+ * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/BinaryHeap.java,v 1.9 2002/07/03 02:16:48 mas Exp $
+ * $Revision: 1.9 $
+ * $Date: 2002/07/03 02:16:48 $
*
* ====================================================================
*
@@ -70,19 +70,19 @@ import java.util.Comparator;
*
* The removal order of a binary heap is based on either the natural sort
* order of its elements or a specified {@link Comparator}. The
- * {@link remove()} method always returns the first element as determined
+ * {@link #remove()} method always returns the first element as determined
* by the sort order. (The isMinHeap flag in the constructors
- * can be used to reverse the sort order, in which case {@link remove()}
+ * can be used to reverse the sort order, in which case {@link #remove()}
* will always remove the last element.) The removal order is
* not the same as the order of iteration; elements are
* returned by the iterator in no particular order.* - * The {@link add(Object)} and {@link remove()} operations perform - * in logarithmic time. The {@link get()} operation performs in constant + * The {@link #add(Object)} and {@link #remove()} operations perform + * in logarithmic time. The {@link #get()} operation performs in constant * time. All other operations perform in linear time or worse.
*
* Note that this implementation is not synchronized. Use
- * {@link BufferUtils.synchronizedBuffer(Buffer)} to provide
+ * {@link BufferUtils#synchronizedBuffer(Buffer)} to provide
* synchronized access to a BinaryHeap:
*
*
@@ -469,7 +469,7 @@ public final class BinaryHeap extends AbstractCollection
/**
- * Adds an object to this heap. Same as {@link insert(Object)}.
+ * Adds an object to this heap. Same as {@link #insert(Object)}.
*
* @param o the object to add
* @return true, always
@@ -481,7 +481,7 @@ public final class BinaryHeap extends AbstractCollection
/**
- * Returns the priority element. Same as {@link peek()}.
+ * Returns the priority element. Same as {@link #peek()}.
*
* @return the priority element
* @throws BufferUnderflowException if this heap is empty
@@ -496,7 +496,7 @@ public final class BinaryHeap extends AbstractCollection
/**
- * Removes the priority element. Same as {@link pop()}.
+ * Removes the priority element. Same as {@link #pop()}.
*
* @return the removed priority element
* @throws BufferUnderflowException if this heap is empty
diff --git a/src/java/org/apache/commons/collections/BoundedFifoBuffer.java b/src/java/org/apache/commons/collections/BoundedFifoBuffer.java
index f1f61dd16..985b45fdf 100644
--- a/src/java/org/apache/commons/collections/BoundedFifoBuffer.java
+++ b/src/java/org/apache/commons/collections/BoundedFifoBuffer.java
@@ -1,7 +1,7 @@
/*
- * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/BoundedFifoBuffer.java,v 1.2 2002/07/03 01:59:50 mas Exp $
- * $Revision: 1.2 $
- * $Date: 2002/07/03 01:59:50 $
+ * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/BoundedFifoBuffer.java,v 1.3 2002/07/03 02:16:48 mas Exp $
+ * $Revision: 1.3 $
+ * $Date: 2002/07/03 02:16:48 $
*
* ====================================================================
*
@@ -76,7 +76,7 @@ import java.util.NoSuchElementException;
* insertion order; elements are removed in the same order in which they
* were added. The iteration order is the same as the removal order.
*
- * The {@link add(Object}, {@link remove()} and {@link get()} operations
+ * The {@link #add(Object)}, {@link #remove()} and {@link #get()} operations
* all perform in constant time. All other operations perform in linear
* time or worse.
*
@@ -89,7 +89,7 @@ import java.util.NoSuchElementException;
*
* @author Berin Loritsch
* @author Paul Jack
- * @version $Id: BoundedFifoBuffer.java,v 1.2 2002/07/03 01:59:50 mas Exp $
+ * @version $Id: BoundedFifoBuffer.java,v 1.3 2002/07/03 02:16:48 mas Exp $
*/
public class BoundedFifoBuffer extends AbstractCollection implements Buffer
{
diff --git a/src/java/org/apache/commons/collections/BufferUtils.java b/src/java/org/apache/commons/collections/BufferUtils.java
index 963f52f8a..8e6a99b47 100644
--- a/src/java/org/apache/commons/collections/BufferUtils.java
+++ b/src/java/org/apache/commons/collections/BufferUtils.java
@@ -1,7 +1,7 @@
/*
- * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/BufferUtils.java,v 1.2 2002/07/03 01:59:50 mas Exp $
- * $Revision: 1.2 $
- * $Date: 2002/07/03 01:59:50 $
+ * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/BufferUtils.java,v 1.3 2002/07/03 02:16:48 mas Exp $
+ * $Revision: 1.3 $
+ * $Date: 2002/07/03 02:16:48 $
*
* ====================================================================
*
@@ -69,7 +69,7 @@ import java.util.Iterator;
* Contains static utility methods for operating on {@link Buffer} objects.
*
* @author Paul Jack
- * @version $Id: BufferUtils.java,v 1.2 2002/07/03 01:59:50 mas Exp $
+ * @version $Id: BufferUtils.java,v 1.3 2002/07/03 02:16:48 mas Exp $
*/
public class BufferUtils {
@@ -100,9 +100,9 @@ public class BufferUtils {
/**
* Returns a synchronized buffer backed by the given buffer that will
- * block on {@link Buffer.get()} and {@link Buffer.remove()} operations.
- * If the buffer is empty, then the {@link Buffer.get()} and
- * {@link Buffer.remove()} operations will block until new elements
+ * block on {@link Buffer#get()} and {@link Buffer#remove()} operations.
+ * If the buffer is empty, then the {@link Buffer#get()} and
+ * {@link Buffer#remove()} operations will block until new elements
* are added to the buffer, rather than immediately throwing a
* BufferUnderflowException.
*
diff --git a/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java b/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java
index 8a28a63c7..97bfaf97e 100644
--- a/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java
+++ b/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java
@@ -1,7 +1,7 @@
/*
- * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java,v 1.2 2002/07/03 01:59:50 mas Exp $
- * $Revision: 1.2 $
- * $Date: 2002/07/03 01:59:50 $
+ * $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java,v 1.3 2002/07/03 02:16:48 mas Exp $
+ * $Revision: 1.3 $
+ * $Date: 2002/07/03 02:16:48 $
*
* ====================================================================
*
@@ -76,8 +76,8 @@ import java.util.NoSuchElementException;
* order; elements are removed in the same order in which they were added.
* The iteration order is the same as the removal order.
*
- * The {@link remove()} and {@link get()} operations perform in constant time.
- * The {@link add()} operation performs in amortized constant time. All
+ * The {@link #remove()} and {@link #get()} operations perform in constant time.
+ * The {@link #add(Object)} operation performs in amortized constant time. All
* other operations perform in linear time or worse.
*
* Note that this implementation is not synchronized. The following can be
@@ -90,7 +90,7 @@ import java.util.NoSuchElementException;
* @author Federico Barbieri
* @author Berin Loritsch
* @author Paul Jack
- * @version CVS $Revision: 1.2 $ $Date: 2002/07/03 01:59:50 $
+ * @version CVS $Revision: 1.3 $ $Date: 2002/07/03 02:16:48 $
* @since Avalon 4.0
*/
public final class UnboundedFifoBuffer extends AbstractCollection implements Buffer