@Test public void testNotRemove() { final CapacityLruLinkedHashMap<Object, String> capacityLruLinkedHashMap0 = new CapacityLruLinkedHashMap<>(3384, 0, 3384); final AbstractMap.SimpleEntry<Object, String> abstractMap_SimpleEntry0 = new AbstractMap.SimpleEntry<>((Object) null, "capacity must be positive"); final boolean boolean0 = capacityLruLinkedHashMap0.removeEldestEntry(abstractMap_SimpleEntry0); assertFalse(boolean0); }
@Override protected boolean removeEldestEntry(Map.Entry<K, V> eldest) { return size() > capacity; }
CapacityLruLinkedHashMap extends LinkedHashMap<K, V> { @Override protected boolean removeEldestEntry(Map.Entry<K, V> eldest) { return size() > capacity; } }
CapacityLruLinkedHashMap extends LinkedHashMap<K, V> { @Override protected boolean removeEldestEntry(Map.Entry<K, V> eldest) { return size() > capacity; } protected  CapacityLruLinkedHashMap(int capacity, int initialCapacity,
        float loadFactor); }
CapacityLruLinkedHashMap extends LinkedHashMap<K, V> { @Override protected boolean removeEldestEntry(Map.Entry<K, V> eldest) { return size() > capacity; } protected  CapacityLruLinkedHashMap(int capacity, int initialCapacity,
        float loadFactor); int getCapacity(); }
CapacityLruLinkedHashMap extends LinkedHashMap<K, V> { @Override protected boolean removeEldestEntry(Map.Entry<K, V> eldest) { return size() > capacity; } protected  CapacityLruLinkedHashMap(int capacity, int initialCapacity,
        float loadFactor); int getCapacity();  }