MemoisedBase

abstract def memo: Cache[AnyRef, AnyRef]

The memo table.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def dup(t1: T, t2: T): Unit

Duplicate an entry if possible.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def get(t: T): Option[U]

Return the value stored at key t as an option.

final def getClass(): Class[_]

def getWithDefault(t: T, u: ⇒ U): U

Return the value stored at key t if there is one, otherwise return u.

def hasBeenComputedAt(t: T): Boolean

Has the value at t already been computed or not? By default, does the memo table contain a value for t?

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def put(t: T, u: U): Unit

Store the value u under the key t.

def putIfNotPresent(t: T, u: ⇒ U): Unit

Store the value u under the key t if t does not already have an associated value.

def reset(): Unit

Immediately reset the memo table.

def resetAt(t: T): Unit

Immediately reset the memo table at t.

def size(): Long

The number of entries in the memo table.

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