Memo

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def arrayMemo[V >: Null](n: Int)(implicit arg0: ClassTag[V]): Memo[Int, V]

Cache results in an n-long array.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def doubleArrayMemo(n: Int, sentinel: Double = 0d): Memo[Int, Double]

As with arrayMemo, but memoizing double results != sentinel.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def immutableHashMapMemo[K, V]: Memo[K, V]

Cache results in a hash map.

def immutableMapMemo[K, V](m: Map[K, V]): Memo[K, V]

def immutableTreeMapMemo[K, V](implicit arg0: scala.Ordering[K]): Memo[K, V]

Cache results in a tree map.

final def isInstanceOf[T0]: Boolean

def memo[K, V](f: ((K) ⇒ V) ⇒ (K) ⇒ V): Memo[K, V]

final def ne(arg0: AnyRef): Boolean

def nilMemo[K, V]: Memo[K, V]

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

def immutableListMapMemo[K, V]: Memo[K, V]

Cache results in a list map.

def mutableHashMapMemo[K, V]: Memo[K, V]

Cache results in a scala.collection.mutable.HashMap.

def mutableMapMemo[K, V](a: Map[K, V]): Memo[K, V]

def weakHashMapMemo[K, V]: Memo[K, V]

As with mutableHashMapMemo, but forget elements according to GC pressure.