object Memo extends MemoFunctions with MemoInstances
- Source
- Memo.scala
- Alphabetic
- By Inheritance
- Memo
- MemoInstances
- MemoFunctions
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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
arrayMemo[V >: Null](n: Int)(implicit arg0: ClassManifest[V]): Memo[Int, V]
Cache results in an
n
-long array.Cache results in an
n
-long array.- Definition Classes
- MemoFunctions
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
doubleArrayMemo(n: Int, sentinel: Double = 0d): Memo[Int, Double]
As with
arrayMemo
, but memoizing double results !=sentinel
.As with
arrayMemo
, but memoizing double results !=sentinel
.- Definition Classes
- MemoFunctions
-
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
-
def
immutableHashMapMemo[K, V]: Memo[K, V]
Cache results in a hash map.
Cache results in a hash map. Nonsensical unless
K
has a meaningfulhashCode
andjava.lang.Object.equals
. As this memo uses a single var, it's thread-safe.- Definition Classes
- MemoFunctions
-
def
immutableListMapMemo[K, V]: Memo[K, V]
Cache results in a list map.
Cache results in a list map. Nonsensical unless
K
has a meaningfuljava.lang.Object.equals
. As this memo uses a single var, it's thread-safe.- Definition Classes
- MemoFunctions
-
def
immutableTreeMapMemo[K, V](implicit arg0: scala.Ordering[K]): Memo[K, V]
Cache results in a tree map.
Cache results in a tree map. As this memo uses a single var, it's thread-safe.
- Definition Classes
- MemoFunctions
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
memo[K, V](f: ((K) ⇒ V) ⇒ (K) ⇒ V): Memo[K, V]
- Definition Classes
- MemoFunctions
-
def
mutableHashMapMemo[K, V]: Memo[K, V]
Cache results in a scala.collection.mutable.HashMap.
Cache results in a scala.collection.mutable.HashMap. Nonsensical if
K
lacks a meaningfulhashCode
andjava.lang.Object.equals
.- Definition Classes
- MemoFunctions
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nilMemo[K, V]: Memo[K, V]
- Definition Classes
- MemoFunctions
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
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( ... )
-
def
weakHashMapMemo[K, V]: Memo[K, V]
As with
mutableHashMapMemo
, but forget elements according to GC pressure.As with
mutableHashMapMemo
, but forget elements according to GC pressure.- Definition Classes
- MemoFunctions