commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From m..@apache.org
Subject cvs commit: jakarta-commons/collections/src/java/org/apache/commons/collections ArrayStack.java BinaryHeap.java BoundedFifoBuffer.java BufferUtils.java UnboundedFifoBuffer.java
Date Wed, 03 Jul 2002 02:16:48 GMT
mas         2002/07/02 19:16:48

  Modified:    collections/src/java/org/apache/commons/collections
                        ArrayStack.java BinaryHeap.java
                        BoundedFifoBuffer.java BufferUtils.java
                        UnboundedFifoBuffer.java
  Log:
  Fixed javadoc links.
  
  Revision  Changes    Path
  1.7       +5 -5      jakarta-commons/collections/src/java/org/apache/commons/collections/ArrayStack.java
  
  Index: ArrayStack.java
  ===================================================================
  RCS file: /home/cvs/jakarta-commons/collections/src/java/org/apache/commons/collections/ArrayStack.java,v
  retrieving revision 1.6
  retrieving revision 1.7
  diff -u -r1.6 -r1.7
  --- ArrayStack.java	3 Jul 2002 02:09:06 -0000	1.6
  +++ ArrayStack.java	3 Jul 2002 02:16:48 -0000	1.7
  @@ -77,7 +77,7 @@
    * 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
  
  
  
  1.9       +11 -11    jakarta-commons/collections/src/java/org/apache/commons/collections/BinaryHeap.java
  
  Index: BinaryHeap.java
  ===================================================================
  RCS file: /home/cvs/jakarta-commons/collections/src/java/org/apache/commons/collections/BinaryHeap.java,v
  retrieving revision 1.8
  retrieving revision 1.9
  diff -u -r1.8 -r1.9
  --- BinaryHeap.java	3 Jul 2002 02:09:06 -0000	1.8
  +++ BinaryHeap.java	3 Jul 2002 02:16:48 -0000	1.9
  @@ -70,19 +70,19 @@
    *
    * 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 @@
   
   
       /**
  -     *  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 @@
   
   
       /**
  -     *  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 @@
   
   
       /**
  -     *  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
  
  
  
  1.3       +5 -5      jakarta-commons/collections/src/java/org/apache/commons/collections/BoundedFifoBuffer.java
  
  Index: BoundedFifoBuffer.java
  ===================================================================
  RCS file: /home/cvs/jakarta-commons/collections/src/java/org/apache/commons/collections/BoundedFifoBuffer.java,v
  retrieving revision 1.2
  retrieving revision 1.3
  diff -u -r1.2 -r1.3
  --- BoundedFifoBuffer.java	3 Jul 2002 01:59:50 -0000	1.2
  +++ BoundedFifoBuffer.java	3 Jul 2002 02:16:48 -0000	1.3
  @@ -76,7 +76,7 @@
    * 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.
    *
  
  
  
  1.3       +7 -7      jakarta-commons/collections/src/java/org/apache/commons/collections/BufferUtils.java
  
  Index: BufferUtils.java
  ===================================================================
  RCS file: /home/cvs/jakarta-commons/collections/src/java/org/apache/commons/collections/BufferUtils.java,v
  retrieving revision 1.2
  retrieving revision 1.3
  diff -u -r1.2 -r1.3
  --- BufferUtils.java	3 Jul 2002 01:59:50 -0000	1.2
  +++ BufferUtils.java	3 Jul 2002 02:16:48 -0000	1.3
  @@ -100,9 +100,9 @@
   
       /**
        *  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>.
        *
  
  
  
  1.3       +6 -6      jakarta-commons/collections/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java
  
  Index: UnboundedFifoBuffer.java
  ===================================================================
  RCS file: /home/cvs/jakarta-commons/collections/src/java/org/apache/commons/collections/UnboundedFifoBuffer.java,v
  retrieving revision 1.2
  retrieving revision 1.3
  diff -u -r1.2 -r1.3
  --- UnboundedFifoBuffer.java	3 Jul 2002 01:59:50 -0000	1.2
  +++ UnboundedFifoBuffer.java	3 Jul 2002 02:16:48 -0000	1.3
  @@ -76,8 +76,8 @@
    * 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
  
  
  

--
To unsubscribe, e-mail:   <mailto:commons-dev-unsubscribe@jakarta.apache.org>
For additional commands, e-mail: <mailto:commons-dev-help@jakarta.apache.org>


Mime
View raw message