class
LRUCachePolicy[K, V] extends LinkedMapBasedPolicy[K, V]
Instance Constructors
-
new
LRUCachePolicy()
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
-
var
_evictUsingAccessOrder: Boolean
-
var
_evictionCount: Long
-
var
_evictionFunc: (K, V) ⇒ Unit
-
var
_hitCount: Long
-
var
_isInitialized: Boolean
-
var
_loadFunc: (K) ⇒ V
-
var
_maxSize: Int
-
var
_missCount: Long
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
evictionCount: Long
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
hitRate: Double
-
def
initialize(strArgs: Array[String], fallbackMaxSize: Int, loadFunc: (K) ⇒ V, evictionFunc: (K, V) ⇒ Unit): Unit
-
final
def
isInstanceOf[T0]: Boolean
-
def
keysOfCachedEntries: Seq[K]
-
def
maxSize: Int
-
def
maxSize_=(newMaxSize: Int): Unit
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
notifyGet(key: K): Unit
-
def
notifyPut(key: K, value: V): Unit
-
def
notifyRemove(key: K): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
