Cache

abstract def empty: Cache[K, V]

Returns an empty version of this specific cache implementation.

abstract def evict(k: K): (Option[V], Cache[K, V])

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

Returns an option containing the value stored for the supplied key or None if the key is not present in the cache.

abstract def hit(k: K): Cache[K, V]

abstract def iterator: Iterator[(K, V)]

Returns an iterator of all key-value pairs inside of this cache.

abstract def put(kv: (K, V)): (Set[K], Cache[K, V])

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(kv: (K, V)): Cache[K, V]

def -(k: K): Cache[K, V]

def --(ks: Set[K]): Cache[K, V]

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contains(k: K): Boolean

Returns true if the cache contains a value for the supplied key, false otherwise.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def seed(m: Map[K, V]): Cache[K, V]

final def synchronized[T0](arg0: ⇒ T0): T0

def toMap: Map[K, V]

def toMutable(exhaustFn: (Set[K]) ⇒ Unit = _ => ()): MutableCache[K, V]

def toString(): String

def touch(k: K, v: ⇒ V): Cache[K, V]

Touches the cache with the supplied key.

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit