Class

breeze.stats.distributions.MarkovChain.Combinators

RichPseudoKernel

Related Doc: package Combinators

Permalink

class RichPseudoKernel[C, T, U] extends AnyRef

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

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

Instance Constructors

  1. new RichPseudoKernel(k1: (C, T) ⇒ Rand[U])

    Permalink

Value Members

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

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

    Permalink
    Definition Classes
    AnyRef → Any
  3. def <=<[V](k2: (C, V) ⇒ Rand[T]): (C, V) ⇒ Rand[U]

    Permalink

    Sequence two transitions together, in reverse order This is Kliesli arrow composition.

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

    Permalink
    Definition Classes
    AnyRef → Any
  5. def >=>[V](k2: (C, U) ⇒ Rand[V]): (C, T) ⇒ Rand[V]

    Permalink

    Sequence two transitions together.

    Sequence two transitions together. This is Kliesli arrow composition.

  6. final def asInstanceOf[T0]: T0

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

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

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

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

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

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

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

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

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

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

    Permalink
    Definition Classes
    AnyRef
  17. def promoteIterable: (C, Iterable[T]) ⇒ Rand[Iterable[U]]

    Permalink

    Promotes a kernel to map over collection.

    Promotes a kernel to map over collection. T=<Rand[U] becomes Seq[T]=<Rand[Collection[U]]

  18. def promoteSeq: (C, Seq[T]) ⇒ Rand[Seq[U]]

    Permalink

    Promotes a kernel to map over sequence.

    Promotes a kernel to map over sequence. T=<Rand[U] becomes Seq[T]=<Rand[Seq[U]]

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

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

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

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped