jmcnally    2002/06/04 16:40:30

  Modified:    src/java/org/apache/jcs/engine/memory/lru
                        LRUMemoryCache.java
  Log:
  remove commented out code
  
  Revision  Changes    Path
  1.14      +1 -41     
jakarta-turbine-jcs/src/java/org/apache/jcs/engine/memory/lru/LRUMemoryCache.java
  
  Index: LRUMemoryCache.java
  ===================================================================
  RCS file: 
/home/cvs/jakarta-turbine-jcs/src/java/org/apache/jcs/engine/memory/lru/LRUMemoryCache.java,v
  retrieving revision 1.13
  retrieving revision 1.14
  diff -u -r1.13 -r1.14
  --- LRUMemoryCache.java       4 Jun 2002 23:39:36 -0000       1.13
  +++ LRUMemoryCache.java       4 Jun 2002 23:40:30 -0000       1.14
  @@ -33,7 +33,7 @@
    *@author     <a href="mailto:[EMAIL PROTECTED]";>Aaron Smuts</a>
    *@author     <a href="mailto:[EMAIL PROTECTED]";>James Taylor</a>
    *@created    May 13, 2002
  - *@version    $Id: LRUMemoryCache.java,v 1.13 2002/06/04 23:39:36 jmcnally Exp $
  + *@version    $Id: LRUMemoryCache.java,v 1.14 2002/06/04 23:40:30 jmcnally Exp $
    */
   public class LRUMemoryCache implements MemoryCache, Serializable
   {
  @@ -388,46 +388,6 @@
               return map.keySet().toArray();
           }
       }
  -
  -
  -//    /**
  -//     *  Get an Array of the keys for elements in the specified range of
  -//     *  the memory cache.  If the end position is greater than the size of the
  -//     *  Map, the method will return an array of the remaining elements after
  -//     *  the start position.  If the start element is greater than the size of
  -//     *  Map, a error will be thrown.
  -//     *
  -//     *@return    An Object[]
  -//     */
  -//    public Object[] getKeyArray(int start, int end) throws 
java.lang.IllegalArgumentException
  -//    {
  -//
  -//        int size = getSize();
  -//        if ( start >= size ) {
  -//          throw new java.lang.IllegalArgumentException( "Start value is greater 
than the size of the cache" );
  -//        }
  -//        int stop = Math.min( size, end );
  -//        int count = 0;
  -//
  -//        // need a better locking strategy here.
  -//        synchronized ( this )
  -//        {
  -//          Object[] result = new Object[stop-start];
  -//          Iterator e = this.map.keySet().iterator();
  -//          for (int i=0; e.hasNext(); i++)
  -//          {
  -//              if ( i >= start && i < stop ) {
  -//                result[count] = e.next();
  -//                count++;
  -//              }
  -//              if ( i >= stop ) {
  -//                continue;
  -//              }
  -//          }
  -//          return result;
  -//        }
  -//    }
  -
   
       /**
        *  Puts an item to the cache.
  
  
  

--
To unsubscribe, e-mail:   <mailto:[EMAIL PROTECTED]>
For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>

Reply via email to