LRUCacheMap

class LRUCacheMap<K, V>(removeEldestEntry: (eldest: MutableMap.MutableEntry<K, V>, currentSize: Int) -> Boolean, initialCapacity: Int, loadFactor: Float) : LinkedHashMap<K, V> (source)

Author

ForteScarlet

Constructors

Link copied to clipboard
fun <K, V> LRUCacheMap(removeEldestEntry: (eldest: MutableMap.MutableEntry<K, V>, currentSize: Int) -> Boolean, initialCapacity: Int)
Link copied to clipboard
fun <K, V> LRUCacheMap(removeEldestEntry: (eldest: MutableMap.MutableEntry<K, V>, currentSize: Int) -> Boolean)
Link copied to clipboard
fun LRUCacheMap(maxSize: Int)
Link copied to clipboard
fun <K, V> LRUCacheMap(removeEldestEntry: (eldest: MutableMap.MutableEntry<K, V>, currentSize: Int) -> Boolean, initialCapacity: Int, loadFactor: Float)

Functions

Link copied to clipboard
open override fun clear()
Link copied to clipboard
open override fun clone(): Any
Link copied to clipboard
open override fun compute(p0: K, p1: BiFunction<in K, in V?, out V?>): V?
Link copied to clipboard
open override fun computeIfAbsent(p0: K, p1: Function<in K, out V>): V
Link copied to clipboard
open override fun computeIfPresent(p0: K, p1: BiFunction<in K, in V, out V?>): V?
Link copied to clipboard
open override fun containsKey(key: K): Boolean
Link copied to clipboard
open override fun containsValue(value: V): Boolean
Link copied to clipboard
open operator override fun equals(other: Any?): Boolean
Link copied to clipboard
open override fun forEach(p0: BiConsumer<in K, in V>)
Link copied to clipboard
open operator override fun get(key: K): V?
Link copied to clipboard
open override fun getOrDefault(key: K, defaultValue: V): V
Link copied to clipboard
open override fun hashCode(): Int
Link copied to clipboard
open override fun isEmpty(): Boolean
Link copied to clipboard
open override fun merge(p0: K, p1: V, p2: BiFunction<in V, in V, out V?>): V?
Link copied to clipboard
open override fun put(key: K, value: V): V?
Link copied to clipboard
open override fun putAll(from: Map<out K, V>)
Link copied to clipboard
open override fun putIfAbsent(p0: K, p1: V): V?
Link copied to clipboard
open override fun remove(key: K): V?
open override fun remove(key: K, value: V): Boolean
Link copied to clipboard
protected open override fun removeEldestEntry(eldest: MutableMap.MutableEntry<K, V>): Boolean
Link copied to clipboard
open override fun replace(p0: K, p1: V): V?
open override fun replace(p0: K, p1: V, p2: V): Boolean
Link copied to clipboard
open override fun replaceAll(p0: BiFunction<in K, in V, out V>)
Link copied to clipboard
open override fun toString(): String

Properties

Link copied to clipboard
Link copied to clipboard
open override val keys: MutableSet<K>
Link copied to clipboard
open override val size: Int
Link copied to clipboard
open override val values: MutableCollection<V>