Apache
/
commons-collections
mirror of https://github.com/apache/commons-collections.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Fixed javadoc links. 

git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/proper/collections/trunk@130743 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Michael Smith 2002-07-03 02:16:48 +00:00
parent c2307801a0
commit 5248e3fb4a
5 changed files with 34 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
src/java/org/apache/commons/collections/ArrayStack.java
View File

@ -1,7 +1,7 @@
/*
* $Header: /home/jerenkrantz/tmp/commons/commons-convert/cvs/home/cvs/jakarta-commons//collections/src/java/org/apache/commons/collections/ArrayStack.java,v 1.6 2002/07/03 02:09:06 mas Exp $
* $Revision: 1.6 $
* $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/ArrayStack.java,v 1.7 2002/07/03 02:16:48 mas Exp $
* $Revision: 1.7 $
* $Date: 2002/07/03 02:16:48 $
*
* ====================================================================
*
@ -77,12 +77,12 @@ import java.util.Stack; // only used in javadoc comments, javadoc won't find it
* The removal order of an <Code>ArrayStack</Code> is based on insertion
* order: The most recently added element is removed first. The iteration
* order is <I>not</I> 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
*/

22
src/java/org/apache/commons/collections/BinaryHeap.java
View File

@ -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 <Code>isMinHeap</Code> 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
* <I>not</I> the same as the order of iteration; elements are
* returned by the iterator in no particular order.<P>
*
* 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.<P>
*
* Note that this implementation is not synchronized. Use
* {@link BufferUtils.synchronizedBuffer(Buffer)} to provide
* {@link BufferUtils#synchronizedBuffer(Buffer)} to provide
* synchronized access to a <Code>BinaryHeap</Code>:
*
* <Pre>
@ -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

10
src/java/org/apache/commons/collections/BoundedFifoBuffer.java
View File

@ -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.<P>
*
* 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 <a href="mailto:bloritsch@apache.org">Berin Loritsch</a>
* @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
{

14
src/java/org/apache/commons/collections/BufferUtils.java
View File

@ -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
* <Code>BufferUnderflowException</Code>.
*

12
src/java/org/apache/commons/collections/UnboundedFifoBuffer.java
View File

@ -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.<P>
*
* 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.<P>
*
* Note that this implementation is not synchronized. The following can be
@ -90,7 +90,7 @@ import java.util.NoSuchElementException;
* @author <a href="fede@apache.org">Federico Barbieri</a>
* @author <a href="bloritsch@apache.org">Berin Loritsch</a>
* @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