LruMap

Class Overview

A map that provides a constant-size LRU map by ordering elements by accessing order (and not in insertion order) Most cases would be served better by using Android's LruCache class.

Summary

[Expand] Inherited Methods
From class java.util.LinkedHashMap void clear() boolean containsValue(Object arg0) void forEach(BiConsumer<? super K, ? super V> arg0) V get(Object arg0) boolean removeEldestEntry(Entry<K, V> arg0) void replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0)
From class java.util.HashMap void clear() Object clone() boolean containsKey(Object arg0) boolean containsValue(Object arg0) Set<Entry<K, V>> entrySet() void forEach(BiConsumer<? super K, ? super V> arg0) V get(Object arg0) boolean isEmpty() Set<K> keySet() V put(K arg0, V arg1) void putAll(Map<? extends K, ? extends V> arg0) V remove(Object arg0) boolean replace(K arg0, V arg1, V arg2) void replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0) int size() Collection<V> values()
From class java.util.AbstractMap void clear() Object clone() boolean containsKey(Object arg0) boolean containsValue(Object arg0) abstract Set<Entry<K, V>> entrySet() boolean equals(Object arg0) V get(Object arg0) int hashCode() boolean isEmpty() Set<K> keySet() V put(K arg0, V arg1) void putAll(Map<? extends K, ? extends V> arg0) V remove(Object arg0) int size() String toString() Collection<V> values()
From class java.lang.Object Object clone() boolean equals(Object arg0) void finalize() final Class<?> getClass() int hashCode() final void notify() final void notifyAll() String toString() final void wait(long arg0, int arg1) final void wait(long arg0) final void wait()
From interface java.util.Map abstract void clear() abstract V compute(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) abstract V computeIfAbsent(K arg0, Function<? super K, ? extends V> arg1) abstract V computeIfPresent(K arg0, BiFunction<? super K, ? super V, ? extends V> arg1) abstract boolean containsKey(Object arg0) abstract boolean containsValue(Object arg0) abstract Set<Entry<K, V>> entrySet() abstract boolean equals(Object arg0) abstract void forEach(BiConsumer<? super K, ? super V> arg0) abstract V get(Object arg0) abstract V getOrDefault(Object arg0, V arg1) abstract int hashCode() abstract boolean isEmpty() abstract Set<K> keySet() abstract V merge(K arg0, V arg1, BiFunction<? super V, ? super V, ? extends V> arg2) abstract V put(K arg0, V arg1) abstract void putAll(Map<? extends K, ? extends V> arg0) abstract V putIfAbsent(K arg0, V arg1) abstract boolean remove(Object arg0, Object arg1) abstract V remove(Object arg0) abstract boolean replace(K arg0, V arg1, V arg2) abstract V replace(K arg0, V arg1) abstract void replaceAll(BiFunction<? super K, ? super V, ? extends V> arg0) abstract int size() abstract Collection<V> values()