Object

breeze.stats.distributions.MarkovChain

Combinators

Related Doc: package MarkovChain

Permalink

object Combinators

Combinators for creating transition kernels from other kernels or things that are not quite transition kernels. A kernel is a fn of type T=<Rand[T]

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Combinators
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class RichKernel[T] extends AnyRef

    Permalink

    Extension methods for kernels

  2. class RichPseudoKernel[C, T, U] extends AnyRef

    Permalink

    Extension methods for pseudo-kernels A pseudo-kernel is a method of type (C,T)=<Rand[U], with C being a context type

Value Members

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

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  13. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  14. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  15. def promoteTuple[T1, T2, T3, U1, U2, U3, T4, U4](k1: (T1, T2, T3, T4) ⇒ Rand[U1], k2: (U1, T2, T3, T4) ⇒ Rand[U2], k3: (U1, U2, T3, T4) ⇒ Rand[U3], k4: (U1, U2, U3, T4) ⇒ Rand[U4]): ((T1, T2, T3, T4)) ⇒ Rand[(U1, U2, U3, U4)]

    Permalink

    Tupleization of nearly-transition kernels to produce a kernel for tuples

  16. def promoteTuple[T1, T2, T3, U1, U2, U3](k1: (T1, T2, T3) ⇒ Rand[U1], k2: (U1, T2, T3) ⇒ Rand[U2], k3: (U1, U2, T3) ⇒ Rand[U3]): ((T1, T2, T3)) ⇒ Rand[(U1, U2, U3)]

    Permalink

    Tupleization of nearly-transition kernels to produce a kernel for tuples

  17. def promoteTuple[A, B, C, D](k1: (A, B) ⇒ Rand[C], k2: (C, B) ⇒ Rand[D]): ((A, B)) ⇒ Rand[(C, D)]

    Permalink

    Tupleization of nearly-transition kernels to produce a transition kernel for tuples

  18. implicit def richKernel[T](k1: (T) ⇒ Rand[T]): RichKernel[T]

    Permalink
  19. implicit def richPseudoKernel[C, T, U](k1: (C, T) ⇒ Rand[U]): RichPseudoKernel[C, T, U]

    Permalink
  20. def seqKernel[T](trans: (Seq[T], Int) ⇒ Rand[T]): (Seq[T]) ⇒ Rand[Seq[T]]

    Permalink

    Creates a transition kernel over a sequence, given the ability to do one index at a time.

    Creates a transition kernel over a sequence, given the ability to do one index at a time. Useful for sequence models with a markov assumption.

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

    Permalink
    Definition Classes
    AnyRef
  22. def toString(): String

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

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped