/** * Removes the least recently used mapping(s) from this map. * <p> * How many mappings are removed from the map, is controlled by the * trim factor. * In any case, at least one mapping will be removed. * * @see #getTrimFactor() */ public void removeLRU() { int removeCount = (int) Math.max((size() * trimFactor), 1); Iterator<Map.Entry<K, V>> entries = entrySet().iterator(); while ((removeCount--) > 0 && entries.hasNext()) { entries.next(); entries.remove(); } } }
/** * Removes the least recently used mapping(s) from this map. * <p> * How many mappings are removed from the map, is controlled by the * trim factor. * In any case, at least one mapping will be removed. * * @see #getTrimFactor() */ public void removeLRU() { int removeCount = (int) Math.max((size() * trimFactor), 1); Iterator<Map.Entry<K, V>> entries = entrySet().iterator(); while ((removeCount--) > 0 && entries.hasNext()) { entries.next(); entries.remove(); } } }
/** * Removes the least recently used mapping(s) from this map. * <p> * How many mappings are removed from the map, is controlled by the * trim factor. * In any case, at least one mapping will be removed. * * @see #getTrimFactor() */ public void removeLRU() { int removeCount = (int) Math.max((size() * trimFactor), 1); Iterator<Map.Entry<K, V>> entries = entrySet().iterator(); while ((removeCount--) > 0 && entries.hasNext()) { entries.next(); entries.remove(); } } }
/** * Removes the least recently used mapping(s) from this map. * <p> * How many mappings are removed from the map, is controlled by the * trim factor. * In any case, at least one mapping will be removed. * * @see #getTrimFactor() */ public void removeLRU() { int removeCount = (int) Math.max((size() * mTrimFactor), 1); Iterator<Map.Entry<K, V>> entries = entrySet().iterator(); while ((removeCount--) > 0 && entries.hasNext()) { entries.next(); entries.remove(); } } }