package org.apache.commons.jcs.engine.memory.fifo;
   
   /*
    * Licensed to the Apache Software Foundation (ASF) under one
    * or more contributor license agreements.  See the NOTICE file
    * distributed with this work for additional information
    * regarding copyright ownership.  The ASF licenses this file
    * to you under the Apache License, Version 2.0 (the
    * "License"); you may not use this file except in compliance
   * with the License.  You may obtain a copy of the License at
   *
   *   http://www.apache.org/licenses/LICENSE-2.0
   *
   * Unless required by applicable law or agreed to in writing,
   * software distributed under the License is distributed on an
   * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
   * KIND, either express or implied.  See the License for the
   * specific language governing permissions and limitations
   * under the License.
   */
  
  import java.io.IOException;
  
  import junit.framework.TestCase;
  
  import org.apache.commons.jcs.engine.CacheElement;
  import org.apache.commons.jcs.engine.CompositeCacheAttributes;
  import org.apache.commons.jcs.engine.ElementAttributes;
  import org.apache.commons.jcs.engine.behavior.ICompositeCacheAttributes;
  import org.apache.commons.jcs.engine.control.CompositeCache;
  
  /** Unit tests for the fifo implementation. */
  public class FIFOMemoryCacheUnitTest
      extends TestCase
  {
      /**
       * Verify that the oldest inserted item is removed
       * <p>
       * @throws IOException
       */
      public void testExpirationPolicy_oneExtra()
          throws IOException
      {
          // SETUP
          int maxObjects = 10;
          String cacheName = "testExpirationPolicy_oneExtra";
  
          ICompositeCacheAttributes attributes = new CompositeCacheAttributes();
          attributes.setCacheName(cacheName);
          attributes.setMaxObjects( maxObjects );
          attributes.setSpoolChunkSize( 1 );
  
          FIFOMemoryCache<String, String> cache = new FIFOMemoryCache<String, String>();
          cache.initialize( new CompositeCache<String, String>( attributes, new ElementAttributes() ) );
  
          for ( int i = 0; i <= maxObjects; i++ )
          {
              CacheElement<String, String> element = new CacheElement<String, String>( cacheName, "key" + i, "value" + i );
              cache.update( element );
          }
  
          CacheElement<String, String> oneMoreElement = new CacheElement<String, String>( cacheName, "onemore", "onemore" );
  
          // DO WORK
          cache.update( oneMoreElement );
  
          // VERIFY
          assertEquals( "Should have max elements", maxObjects, cache.getSize() );
          System.out.println(cache.getKeySet());
          for ( int i = maxObjects; i > 1; i-- )
          {
              assertNotNull( "Should have element " + i, cache.get( "key" + i ) );
          }
          assertNotNull( "Should have oneMoreElement", cache.get( "onemore" ) );
      }
  
      /**
       * Verify that the oldest inserted item is removed
       * <p>
       * @throws IOException
       */
      public void testExpirationPolicy_doubleOver()
          throws IOException
      {
          // SETUP
          int maxObjects = 10;
          String cacheName = "testExpirationPolicy_oneExtra";
  
          ICompositeCacheAttributes attributes = new CompositeCacheAttributes();
          attributes.setCacheName(cacheName);
          attributes.setMaxObjects( maxObjects );
          attributes.setSpoolChunkSize( 1 );
  
          FIFOMemoryCache<String, String> cache = new FIFOMemoryCache<String, String>();
          cache.initialize( new CompositeCache<String, String>( attributes, new ElementAttributes() ) );
  
          // DO WORK
          for ( int i = 0; i <= (maxObjects * 2); i++ )
          {
             CacheElement<String, String> element = new CacheElement<String, String>( cacheName, "key" + i, "value" + i );
             cache.update( element );
         }
 
         // VERIFY
         assertEquals( "Should have max elements", maxObjects, cache.getSize() );
         for ( int i = (maxObjects * 2); i > maxObjects; i-- )
         {
             assertNotNull( "Shjould have elemnt " + i, cache.get( "key" + i ) );
         }
     }
 }