Memo

Memoizing different types of functions.

Calling a memoized function with a set of arguments for the first time will save the result in a cache - a mutable.Map, possibly user-provided. Calling it with the same set of arguments subsequently will not perform the computation, but retrieve the cached value instead.

This is useful for computations that are expensive and are performed many times with the same arguments.

However, functions need to be referentially transparent (i.e. have no side effects) to preserve correctness.

Linear Supertypes

AnyRef, Any

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply[A, R](f: (A) ⇒ R, cache: Map[A, R] = mutable.Map.empty[A, R]): (A) ⇒ R

Memoize a simple referentially transparent function
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def commutative[A, R](f: (A, A) ⇒ R, cache: Map[(A, A), R] = mutable.Map.empty[(A, A), R]): (A, A) ⇒ R

Memoize a commutative function (the order of arguments doesn't matter).
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def recur[A, R](f: ((A) ⇒ R) ⇒ (A) ⇒ R, cache: Map[A, R] = mutable.Map.empty[A, R]): (A) ⇒ R

Memoize a recursive function.
Memoize a recursive function. Recursive invocations will also go through the cache, therefore the function must accept it's cached variant as argument.
Memoization of recursive functions is equivalent to dynamic programming.
WARNING: Not stack safe.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package util

object Memo

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[A, R](f: (A) ⇒ R, cache: Map[A, R] = mutable.Map.empty[A, R]): (A) ⇒ R

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def commutative[A, R](f: (A, A) ⇒ R, cache: Map[(A, A), R] = mutable.Map.empty[(A, A), R]): (A, A) ⇒ R

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 recur[A, R](f: ((A) ⇒ R) ⇒ (A) ⇒ R, cache: Map[A, R] = mutable.Map.empty[A, R]): (A) ⇒ R

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

Inherited from AnyRef

Inherited from Any

Ungrouped