Memo

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. 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

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. 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

10. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    Definition Classes

    AnyRef → Any

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

    Cache results in a hash map.

    Cache results in a hash map. Nonsensical unless K has a meaningful hashCode and java.lang.Object.equals. As this memo uses a single var, it's thread-safe.

    Definition Classes

    MemoFunctions

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

    Cache results in a list map.

    Cache results in a list map. Nonsensical unless K has a meaningful java.lang.Object.equals. As this memo uses a single var, it's thread-safe.

    Definition Classes

    MemoFunctions

17. 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

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    MemoFunctions

20. 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 meaningful hashCode and java.lang.Object.equals.

    Definition Classes

    MemoFunctions

21. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

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

    Definition Classes

    MemoFunctions

23. final def notify(): Unit

    Definition Classes

    AnyRef

24. final def notifyAll(): Unit

    Definition Classes

    AnyRef

25. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

26. def toString(): String

    Definition Classes

    AnyRef → Any

27. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

28. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

29. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

30. 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