Refine search
@Override public V getValueIfPresent(K key) { ValueHolder<V> value = map.get(key); if (value == null) { return null; } return value.getIfPresent(); }
@Override public V getValue(final K key) { ValueHolder<V> value = map.get(key); if (value == null) { value = function.apply(key); ValueHolder<V> previous = map.putIfAbsent(key, value); if (previous != null) { value = previous; } // finally, check that we are not over the bound if (maxSize != null && size() > maxSize) { clear(); } } return value.get(); }
@Override public void forEachValue(Consumer<? super V> consumer) { for (ValueHolder<V> valueHolder : map.values()) { V value = valueHolder.getIfPresent(); if (value != null) { consumer.accept(value); } } }
private V findNext() { while (delegate.hasNext()) { V next = delegate.next().getIfPresent(); if (next != null) { return next; } } return null; }
@Override public V getValue(final K key) { ValueHolder<V> value = map.get(key); if (value == null) { value = function.apply(key); ValueHolder<V> previous = map.putIfAbsent(key, value); if (previous != null) { value = previous; } // finally, check that we are not over the bound if (maxSize != null && size() > maxSize) { clear(); } } return value.get(); }
@Override public void forEachValue(Consumer<? super V> consumer) { for (ValueHolder<V> valueHolder : map.values()) { V value = valueHolder.getIfPresent(); if (value != null) { consumer.accept(value); } } }
private V findNext() { while (delegate.hasNext()) { V next = delegate.next().getIfPresent(); if (next != null) { return next; } } return null; }
@Override public V getValue(final K key) { ValueHolder<V> value = map.get(key); if (value == null) { value = function.apply(key); ValueHolder<V> previous = map.putIfAbsent(key, value); if (previous != null) { value = previous; } // finally, check that we are not over the bound if (maxSize != null && size() > maxSize) { clear(); } } return value.get(); }
@Override public V getValueIfPresent(K key) { ValueHolder<V> value = map.get(key); if (value == null) { return null; } return value.getIfPresent(); }
@Override public void forEachValue(Consumer<? super V> consumer) { for (ValueHolder<V> valueHolder : map.values()) { V value = valueHolder.getIfPresent(); if (value != null) { consumer.accept(value); } } }
private V findNext() { while (delegate.hasNext()) { V next = delegate.next().getIfPresent(); if (next != null) { return next; } } return null; }
@Override public V getValue(final K key) { ValueHolder<V> value = map.get(key); if (value == null) { value = function.apply(key); ValueHolder<V> previous = map.putIfAbsent(key, value); if (previous != null) { value = previous; } // finally, check that we are not over the bound if (maxSize != null && size() > maxSize) { clear(); } } return value.get(); }
@Override public V getValueIfPresent(K key) { ValueHolder<V> value = map.get(key); if (value == null) { return null; } return value.getIfPresent(); }
@Override public void forEachValue(Consumer<? super V> consumer) { for (ValueHolder<V> valueHolder : map.values()) { V value = valueHolder.getIfPresent(); if (value != null) { consumer.accept(value); } } }
private V findNext() { while (delegate.hasNext()) { V next = delegate.next().getIfPresent(); if (next != null) { return next; } } return null; }
@Override public V getValue(final K key) { ValueHolder<V> value = map.get(key); if (value == null) { value = function.apply(key); ValueHolder<V> previous = map.putIfAbsent(key, value); if (previous != null) { value = previous; } // finally, check that we are not over the bound if (maxSize != null && size() > maxSize) { clear(); } } return value.get(); }
@Override public V getValueIfPresent(K key) { ValueHolder<V> value = map.get(key); if (value == null) { return null; } return value.getIfPresent(); }
@Override public void forEachValue(Consumer<? super V> consumer) { for (ValueHolder<V> valueHolder : map.values()) { V value = valueHolder.getIfPresent(); if (value != null) { consumer.accept(value); } } }
private V findNext() { while (delegate.hasNext()) { V next = delegate.next().getIfPresent(); if (next != null) { return next; } } return null; }
@Override public V getValue(final K key) { ValueHolder<V> value = map.get(key); if (value == null) { value = function.apply(key); ValueHolder<V> previous = map.putIfAbsent(key, value); if (previous != null) { value = previous; } // finally, check that we are not over the bound if (maxSize != null && size() > maxSize) { clear(); } } return value.get(); }