abstract class ParFiltering extends Algorithm with OneTime
A parallel version of Filtering. Specifically a version of OneTimeFiltering, since that's the only target for parallelization right now.
 Alphabetic
 By Inheritance
 ParFiltering
 OneTime
 Algorithm
 AnyRef
 Any
 Hide All
 Show All
 Public
 All
Abstract Value Members

abstract
def
advanceTime(evidence: Seq[NamedEvidence[_]]): Unit
Advance the filtering one time step, conditioning on the given evidence at the new time point.

abstract
def
computeCurrentDistribution[T](reference: Reference[T]): Stream[(Double, T)]
Returns the distribution over the element referred to by the reference at the current time point.
Returns the distribution over the element referred to by the reference at the current time point.
 Attributes
 protected

abstract
def
computeCurrentExpectation[T](reference: Reference[T], function: (T) ⇒ Double): Double
Returns the expectation of the element referred to by the reference under the given function at the current time point.
Returns the expectation of the element referred to by the reference under the given function at the current time point.
 Attributes
 protected

abstract
def
run(): Unit
Run the algorithm, performing its computation to completion.
Run the algorithm, performing its computation to completion.
 Definition Classes
 OneTime
Concrete 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

val
active: Boolean
 Attributes
 protected
 Definition Classes
 Algorithm

final
def
asInstanceOf[T0]: T0
 Definition Classes
 Any

def
cleanUp(): Unit
Called when the algorithm is killed.
Called when the algorithm is killed. By default, does nothing. Can be overridden.
 Definition Classes
 Algorithm

def
clone(): AnyRef
 Attributes
 protected[java.lang]
 Definition Classes
 AnyRef
 Annotations
 @throws( ... )

def
computeCurrentProbability[T](reference: Reference[T], predicate: (T) ⇒ Boolean): Double
Returns the probability that the element referred to by the reference satisfies the given predicate at the current time point.
Returns the probability that the element referred to by the reference satisfies the given predicate at the current time point.
 Attributes
 protected

def
currentDistribution[T](reference: Reference[T]): Stream[(Double, T)]
Returns the distribution over the element referred to by the reference at the current time point.

def
currentExpectation[T](reference: Reference[T], function: (T) ⇒ Double): Double
Returns the expectation of the element referred to by the reference under the given function at the current time point.

def
currentProbability[T](reference: Reference[T], predicate: (T) ⇒ Boolean): Double
Returns the probability that the element referred to by the reference satisfies the given predicate at the current time point.

def
currentProbability[T](reference: Reference[T], value: T): Double
Returns the probability that the element referred to by the reference produces the given value at the current time point.

def
doKill(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doResume(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doStart(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

def
doStop(): Unit
 Attributes
 protected[com.cra.figaro.algorithm]
 Definition Classes
 OneTime → Algorithm

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
initialize(): Unit
Called when the algorithm is started before running any steps.
Called when the algorithm is started before running any steps. By default, does nothing. Can be overridden.
 Definition Classes
 Algorithm

def
isActive: Boolean
 Definition Classes
 Algorithm

final
def
isInstanceOf[T0]: Boolean
 Definition Classes
 Any

def
kill(): Unit
Kill the algorithm so that it is inactive.
Kill the algorithm so that it is inactive. It will no longer be able to provide answers.Throws AlgorithmInactiveException if the algorithm is not active.
 Definition Classes
 Algorithm

final
def
ne(arg0: AnyRef): Boolean
 Definition Classes
 AnyRef

final
def
notify(): Unit
 Definition Classes
 AnyRef

final
def
notifyAll(): Unit
 Definition Classes
 AnyRef

def
resume(): Unit
Resume the computation of the algorithm, if it has been stopped.
Resume the computation of the algorithm, if it has been stopped. Throws AlgorithmInactiveException if the algorithm is not active.
 Definition Classes
 Algorithm

def
start(): Unit
Start the algorithm and make it active.
Start the algorithm and make it active. After it returns, the algorithm must be ready to provide answers. Throws AlgorithmActiveException if the algorithm is already active.
 Definition Classes
 Algorithm

def
stop(): Unit
Stop the algorithm from computing.
Stop the algorithm from computing. The algorithm is still ready to provide answers after it returns. Throws AlgorithmInactiveException if the algorithm is not active.
 Definition Classes
 Algorithm

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( ... )