LfuCache

class LfuCache<K : Any, V : Any> @JvmOverloads constructor(val capacity: Int, val onDiscard: BiConsumer<K, V> = BiConsumer { _, _ -> }) : Map<K, V>

A simple least frequency used cache. Non-thread-safe.

Constructors

constructor(capacity: Int, onDiscard: BiConsumer<K, V> = BiConsumer { _, _ -> })

@get:JvmName(name = "capacity")

open override val entries: ObjectSet<out Map.Entry<K, V>>

open override val keys: ObjectSet<K>

open override val size: Int

open override val values: ObjectCollection<V>

fun clear()

Clears the cache.

open override fun containsKey(key: K): Boolean

open override fun containsValue(value: V): Boolean

open operator override fun get(key: K): V?

Gets the key and corresponding value (if exists), and increases its access count.

inline fun getOrPut(key: K, mappingFunction: (K) -> V): V

open override fun isEmpty(): Boolean

fun put(key: K, value: V): V?

Sets the key and corresponding value, and discards one of the least-used keys if full.

inline operator fun set(key: K, value: V)