public RepositoryIdCache() { pool.setCaches(this); }
public final synchronized RepositoryId popId() { try { return super.pop(); } catch (EmptyStackException e) { increasePool(5); return super.pop(); } }
final void increasePool(int size) { // if (cache.size() <= MAX_CACHE_SIZE) for (int i = size; i > 0; i--) push(new RepositoryId()); /* * // _REVISIT_ This will not work w/out either thread tracing or weak references. I am // betting that thread * tracing almost completely negates benefit of reuse. Until either // 1.2 only inclusion or proof to the * contrary, I'll leave it this way... else { int numToReclaim = cache.size() / 2; Enumeration keys = * cache.keys(); Enumeration elements = cache.elements(); for (int i = numToReclaim; i > 0; i--) { Object key = * keys.nextElement(); Object element = elements.nextElement(); * * push(element); cache.remove(key); } } */ }
public final synchronized RepositoryId popId() { try { return super.pop(); } catch (EmptyStackException e) { increasePool(5); return super.pop(); } }
final void increasePool(int size) { // if (cache.size() <= MAX_CACHE_SIZE) for (int i = size; i > 0; i--) push(new RepositoryId()); /* * // _REVISIT_ This will not work w/out either thread tracing or weak references. I am // betting that thread * tracing almost completely negates benefit of reuse. Until either // 1.2 only inclusion or proof to the * contrary, I'll leave it this way... else { int numToReclaim = cache.size() / 2; Enumeration keys = * cache.keys(); Enumeration elements = cache.elements(); for (int i = numToReclaim; i > 0; i--) { Object key = * keys.nextElement(); Object element = elements.nextElement(); * * push(element); cache.remove(key); } } */ }
public RepositoryIdCache() { pool.setCaches(this); }