CacheStrategy

abstract def insert(k: K, v: V): Boolean

Insert the value v (keyed by k) into the cache

abstract def lookup(k: K): Option[V]

Lookup the value for key k

abstract def remove(k: K): Option[V]

Remove k from the cache

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

final def getClass(): java.lang.Class[_]

def getOrInsert(k: K, vv: ⇒ V): V

Lookup the value for key k If the value is in the cache, return it.

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): 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