final
class
LRUCache[K, V] extends AnyRef
Instance Constructors
-
new
LRUCache(size: Int, onEvict: (K, V) ⇒ Unit = ((k: K, v: V) => ()))(implicit arg0: ClassTag[K], arg1: ClassTag[V])
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
-=(k: K): Unit
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
get(k: K): Option[V]
-
final
def
getClass(): Class[_]
-
def
getOrElseUpdate(k: K, v: ⇒ V): V
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
iterator: Iterator[(K, V)]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
update(k: K, v: V): Unit
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Well, an approximate LRU cache base on hashing