scalaz

MemoFunctions

trait MemoFunctions extends AnyRef

Source
Memo.scala
Linear Supertypes
AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. MemoFunctions
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

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

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

    Definition Classes
    AnyRef → Any
  4. def arrayMemo[V >: Null](n: Int)(implicit arg0: ClassManifest[V]): Memo[Int, V]

    Cache results in an n-long array.

  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def doubleArrayMemo(n: Int, sentinel: Double = 0d): Memo[Int, Double]

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

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

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

    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

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

    Definition Classes
    AnyRef → Any
  12. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  13. 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.

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

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

  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. def memo[K, V](f: ((K) ⇒ V) ⇒ (K) ⇒ V): Memo[K, V]

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

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

    Definition Classes
    AnyRef
  20. def nilMemo[K, V]: Memo[K, V]

  21. final def notify(): Unit

    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  23. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  24. def toString(): String

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

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  28. def weakHashMapMemo[K, V]: Memo[K, V]

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

Inherited from AnyRef

Inherited from Any

Ungrouped