@Test
@Ignore // FIXME started breaking 8/10
public void testRefreshNoisily() throws Exception {
final CountingCacheEntryFactory factory = new CountingCacheEntryFactory("value");
CountingCacheEventListener countingCacheEventListener = new CountingCacheEventListener();
CountingCacheEventListener.resetCounters();
cache.getCacheEventNotificationService().registerListener(countingCacheEventListener);
selfPopulatingCache = new SelfPopulatingCache(cache, factory);
// check initial conditions on counters
assertEquals(0, CountingCacheEventListener.getCacheElementsPut(cache).size());
assertEquals(0, CountingCacheEventListener.getCacheElementsUpdated(cache).size());
Element e1 = selfPopulatingCache.get("key1");
Element e2 = selfPopulatingCache.get("key2");
assertEquals(2, factory.getCount());
assertEquals(2, CountingCacheEventListener.getCacheElementsPut(cache).size());
assertEquals(0, CountingCacheEventListener.getCacheElementsUpdated(cache).size());
long lastUpdateTime1 = e1.getLastUpdateTime();
long lastUpdateTime2 = e2.getLastUpdateTime();
// wait a little so creation time to allow CPU clock to advance
Thread.sleep(100L);
// full refresh
selfPopulatingCache.refresh(false);
assertEquals(4, factory.getCount());
assertEquals(2, CountingCacheEventListener.getCacheElementsPut(cache).size());
assertEquals(2, CountingCacheEventListener.getCacheElementsUpdated(cache).size());
e1 = selfPopulatingCache.get("key1");
e2 = selfPopulatingCache.get("key2");
assertEquals(4, factory.getCount());
assertEquals(2, CountingCacheEventListener.getCacheElementsPut(cache).size());
assertEquals(2, CountingCacheEventListener.getCacheElementsUpdated(cache).size());
assertFalse(
"getLastUpdateTime() should not be the same (" + lastUpdateTime1 + ")",
lastUpdateTime1 == e1.getLastUpdateTime());
assertFalse(
"getLastUpdateTime() should not be the same (" + lastUpdateTime2 + ")",
lastUpdateTime2 == e2.getLastUpdateTime());
lastUpdateTime2 = e2.getLastUpdateTime();
// wait a little to allow CPU clock to advance
Thread.sleep(100L);
// single element refresh
e2 = selfPopulatingCache.refresh("key2", false);
assertEquals(5, factory.getCount());
assertEquals(2, CountingCacheEventListener.getCacheElementsPut(cache).size());
assertEquals(3, CountingCacheEventListener.getCacheElementsUpdated(cache).size());
assertFalse(
"getLastUpdateTime() should not be the same (" + lastUpdateTime2 + ")",
lastUpdateTime2 == e2.getLastUpdateTime());
}
@Test
public void testRefreshElement() throws Exception {
final IncrementingCacheEntryFactory factory = new IncrementingCacheEntryFactory();
selfPopulatingCache = new SelfPopulatingCache(cache, factory);
Element e1 = selfPopulatingCache.get("key1");
Element e2 = selfPopulatingCache.get("key2");
assertEquals(2, selfPopulatingCache.getSize());
assertEquals(2, factory.getCount());
assertEquals(Integer.valueOf(1), e1.getValue());
assertEquals(Integer.valueOf(2), e2.getValue());
// full refresh
selfPopulatingCache.refresh();
e1 = selfPopulatingCache.get("key1");
e2 = selfPopulatingCache.get("key2");
assertEquals(2, selfPopulatingCache.getSize());
assertEquals(4, factory.getCount());
// we cannot be sure which order key1 or key2 gets refreshed,
// as the implementation makes no guarantee over the sequence
// of the refresh; all we can be sure of is that between
// them key1&2 must have the values 3 & 4
int e1i = ((Integer) e1.getValue()).intValue();
int e2i = ((Integer) e2.getValue()).intValue();
assertTrue(((e1i == 3) && (e2i == 4)) || ((e1i == 4) && (e2i == 3)));
// single element refresh
selfPopulatingCache.get("key2");
Element e2r = selfPopulatingCache.refresh("key2");
assertEquals(2, selfPopulatingCache.getSize());
assertEquals(5, factory.getCount());
assertNotNull(e2r);
assertEquals("key2", e2r.getKey());
assertEquals(Integer.valueOf(5), e2r.getValue());
// additional element
Element e3 = selfPopulatingCache.get("key3");
assertEquals(3, selfPopulatingCache.getSize());
assertEquals(6, factory.getCount());
assertNotNull(e3);
assertEquals("key3", e3.getKey());
assertEquals(Integer.valueOf(6), e3.getValue());
// full refresh
selfPopulatingCache.refresh();
assertEquals(3, selfPopulatingCache.getSize());
assertEquals(9, factory.getCount());
}
/**
* See {@link #testCacheEntryFactoryReturningElementMake} this test ensures the Refresh
* functionality works
*/
@Test
public void testCacheEntryFactoryReturningElementRefresh() throws Exception {
final long specialVersionNumber = 54321L;
final CacheEntryFactory elementReturningFactory =
new CacheEntryFactory() {
public Object createEntry(final Object key) throws Exception {
Element e = new Element(key, "V_" + key);
e.setVersion(specialVersionNumber);
return e;
}
};
selfPopulatingCache = new SelfPopulatingCache(cache, elementReturningFactory);
Element e = null;
e = selfPopulatingCache.get("key1");
assertEquals("V_key1", e.getValue());
assertEquals(specialVersionNumber, e.getVersion());
e = selfPopulatingCache.get("key2");
assertEquals("V_key2", e.getValue());
assertEquals(specialVersionNumber, e.getVersion());
assertEquals(2, selfPopulatingCache.getSize());
selfPopulatingCache.refresh();
e = selfPopulatingCache.get("key1");
assertEquals("V_key1", e.getValue());
assertEquals(specialVersionNumber, e.getVersion());
e = selfPopulatingCache.get("key2");
assertEquals("V_key2", e.getValue());
assertEquals(specialVersionNumber, e.getVersion());
assertEquals(2, selfPopulatingCache.getSize());
}
@Test
public void testRefreshAbsentElement() throws Exception {
final IncrementingCacheEntryFactory factory = new IncrementingCacheEntryFactory();
selfPopulatingCache = new SelfPopulatingCache(cache, factory);
selfPopulatingCache.get("key1");
selfPopulatingCache.get("key2");
assertEquals(2, selfPopulatingCache.getSize());
assertEquals(2, factory.getCount());
// full refresh
selfPopulatingCache.refresh();
assertEquals(2, selfPopulatingCache.getSize());
assertEquals(4, factory.getCount());
// single element refresh which is not in the cache
Element e3 = selfPopulatingCache.refresh("key3");
assertEquals(3, selfPopulatingCache.getSize());
assertEquals(5, factory.getCount());
assertNotNull(e3);
assertEquals("key3", e3.getKey());
assertEquals(Integer.valueOf(5), e3.getValue());
}
/** Tests refreshing the entries. */
public void testRefresh() throws Exception {
final String value = "value";
final CountingCacheEntryFactory factory = new CountingCacheEntryFactory(value);
selfPopulatingCache = new SelfPopulatingCache(cache, factory);
// Check the value
assertSame(value, selfPopulatingCache.get("key").getObjectValue());
assertEquals(1, factory.getCount());
// Refresh
selfPopulatingCache.refresh();
assertEquals(2, factory.getCount());
// Check the value
assertSame(value, selfPopulatingCache.get("key").getObjectValue());
assertEquals(2, factory.getCount());
}
/**
* Tests discarding little used entries. <cache name="sampleIdlingExpiringCache"
* maxElementsInMemory="1" eternal="false" timeToIdleSeconds="2" timeToLiveSeconds="5"
* overflowToDisk="true" />
*/
public void testDiscardLittleUsed() throws Exception {
final CacheEntryFactory factory = new CountingCacheEntryFactory("value");
selfPopulatingCache = new SelfPopulatingCache(cache, factory);
selfPopulatingCache.get("key1");
selfPopulatingCache.get("key2");
assertEquals(2, selfPopulatingCache.getSize());
selfPopulatingCache.refresh();
assertEquals(2, selfPopulatingCache.getSize());
Thread.sleep(2020);
// Will be two, because counting expired elements
assertEquals(2, selfPopulatingCache.getSize());
// Check the cache
selfPopulatingCache.removeAll();
assertEquals(0, selfPopulatingCache.getSize());
}
/**
* Tests that the current thread, which gets renamed when it enters a SelfPopulatingCache, comes
* out with its old name.
*/
public void testThreadNaming() throws Exception {
final String value = "value";
final CountingCacheEntryFactory factory = new CountingCacheEntryFactory(value);
selfPopulatingCache = new SelfPopulatingCache(cache, factory);
String originalThreadName = Thread.currentThread().getName();
// Check the value
selfPopulatingCache.get("key");
assertEquals(originalThreadName, Thread.currentThread().getName());
// Refresh
selfPopulatingCache.refresh();
assertEquals(originalThreadName, Thread.currentThread().getName());
// Check the value with null key
selfPopulatingCache.get(null);
assertEquals(originalThreadName, Thread.currentThread().getName());
}
/** Tests refreshing the entries. */
@Test
public void testRefreshWithException() throws Exception {
final String value = "value";
final CountingCacheEntryFactory factory = new CountingCacheEntryFactory(value);
selfPopulatingCache = new SelfPopulatingCache(cache, factory);
// Check the value
String explodingKey = "explode";
assertSame(value, selfPopulatingCache.get(explodingKey).getObjectValue());
assertEquals(1, factory.getCount());
// Refresh
try {
selfPopulatingCache.refresh();
fail("This should have exploded!");
} catch (CacheException e) {
assertNotNull(e.getCause());
assertEquals(
e.getCause().getMessage() + " on refresh with key " + explodingKey, e.getMessage());
}
}
/**
* Refresh the elements of this cache.
*
* <p>Refreshes bypass the {@link BlockingCache} and act directly on the backing {@link Ehcache}.
* This way, {@link BlockingCache} gets can continue to return stale data while the refresh, which
* might be expensive, takes place.
*
* <p>Quiet methods are used, so that statistics are not affected. Note that the refreshed
* elements will not be replicated to any cache peers.
*
* <p>Configure ehcache.xml to stop elements from being refreshed forever:
*
* <ul>
* <li>use timeToIdle to discard elements unused for a period of time
* <li>use timeToLive to discard elmeents that have existed beyond their allotted lifespan
* </ul>
*
* @throws CacheException
*/
public void refresh() throws CacheException {
refresh(true);
}