You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@avalon.apache.org by do...@apache.org on 2001/11/03 03:13:29 UTC

cvs commit: jakarta-avalon-excalibur/src/java/org/apache/avalon/excalibur/collections BinaryHeap.java

donaldp     01/11/02 18:13:29

  Modified:    src/java/org/apache/avalon/excalibur/collections
                        BinaryHeap.java
  Log:
  Protected -> private change of member variables. Has no effect on subclasses as class was final.
  
  Revision  Changes    Path
  1.3       +10 -10    jakarta-avalon-excalibur/src/java/org/apache/avalon/excalibur/collections/BinaryHeap.java
  
  Index: BinaryHeap.java
  ===================================================================
  RCS file: /home/cvs/jakarta-avalon-excalibur/src/java/org/apache/avalon/excalibur/collections/BinaryHeap.java,v
  retrieving revision 1.2
  retrieving revision 1.3
  diff -u -r1.2 -r1.3
  --- BinaryHeap.java	2001/08/07 10:57:04	1.2
  +++ BinaryHeap.java	2001/11/03 02:13:29	1.3
  @@ -15,17 +15,17 @@
    *
    * @author <a href="mailto:donaldp@apache.org">Peter Donald</a>
    * @author <a href="mailto:ram.chidambaram@telus.com">Ram Chidambaram</a>
  - * @version CVS $Revision: 1.2 $ $Date: 2001/08/07 10:57:04 $
  + * @version CVS $Revision: 1.3 $ $Date: 2001/11/03 02:13:29 $
    * @since 4.0
    */
   public final class BinaryHeap
       implements PriorityQueue
   {
  -    protected static final int      DEFAULT_CAPACITY   = 13;
  +    private static final int      DEFAULT_CAPACITY   = 13;
   
  -    protected int                   m_size;
  -    protected Comparable[]          m_elements;
  -    protected boolean               m_isMinHeap;
  +    private int                   m_size;
  +    private Comparable[]          m_elements;
  +    private boolean               m_isMinHeap;
   
       public BinaryHeap()
       {
  @@ -157,7 +157,7 @@
        *
        * @param element the element
        */
  -    protected void percolateDownMinHeap( final int index )
  +    private void percolateDownMinHeap( final int index )
       {
           final Comparable element = m_elements[ index ];
   
  @@ -194,7 +194,7 @@
        *
        * @param element the element
        */
  -    protected void percolateDownMaxHeap( final int index )
  +    private void percolateDownMaxHeap( final int index )
       {
           final Comparable element = m_elements[ index ];
   
  @@ -231,7 +231,7 @@
        *
        * @param element the element
        */
  -    protected void percolateUpMinHeap( final Comparable element )
  +    private void percolateUpMinHeap( final Comparable element )
       {
           int hole = ++m_size;
   
  @@ -256,7 +256,7 @@
        *
        * @param element the element
        */
  -    protected void percolateUpMaxHeap( final Comparable element )
  +    private void percolateUpMaxHeap( final Comparable element )
       {
           int hole = ++m_size;
   
  @@ -273,7 +273,7 @@
           m_elements[ hole ] = element;
       }
   
  -    protected void grow()
  +    private void grow()
       {
           final Comparable[] elements =
               new Comparable[ m_elements.length * 2 ];
  
  
  

--
To unsubscribe, e-mail:   <ma...@jakarta.apache.org>
For additional commands, e-mail: <ma...@jakarta.apache.org>