MutableCacheProxy

abstract def self: MutableCache[K, V]

final def !=(arg0: Any): Boolean

final def ##(): Int

def +=(kv: (K, V)): MutableCacheProxy.this.type

def -=(k: K): MutableCacheProxy.this.type

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clear: MutableCacheProxy.this.type

def clone(): AnyRef

def contains(k: K): Boolean

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

def empty: MutableCache[K, V]

Returns an empty version of this specific cache implementation.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def evict(k: K): Option[V]

def filter(pred: ((K, V)) ⇒ Boolean): MutableCache[K, V]

def finalize(): Unit

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.

final def getClass(): Class[_]

def getOrElseUpdate(k: K, v: ⇒ V): V

def hashCode(): Int

def hit(k: K): Option[V]

final def isInstanceOf[T0]: Boolean

def iterator: Iterator[(K, V)]

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

def multiInsert(kvs: Map[K, V]): MutableCacheProxy.this.type

def multiRemove(ks: Set[K]): MutableCacheProxy.this.type

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