trait Algorithm extends AnyRef

The general class of Figaro algorithms. The Algorithm class is defined to generalize both one-time and anytime algorithms, using a start/stop/resume/kill mechanism.

Linear Supertypes
AnyRef, Any
Known Subclasses
Anytime, AnytimeBoundsProbQuery, AnytimeMPE, AnytimeProbEvidence, AnytimeProbQuery, BaseProbQueryAlgorithm, BoundsProbQueryAlgorithm, LazyAlgorithm, MPEAlgorithm, OneTime, OneTimeBoundsProbQuery, OneTimeMPE, OneTimeProbEvidence, OneTimeProbQuery, ProbEvidenceAlgorithm, ProbQueryAlgorithm, StreamableProbQueryAlgorithm, AnytimeDecisionMetropolisHastings, DecisionAlgorithm, DecisionImportance, DecisionMetropolisHastings, MultiDecisionAlgorithm, MultiDecisionVariableElimination, OneTimeDecisionMetropolisHastings, OneTimeMultiDecisionImportance, OneTimeMultiDecisionMetropolisHastings, OneTimeProbQueryDecision, ProbQueryVariableEliminationDecision, ProbabilisticVariableEliminationDecision, FactoredAlgorithm, MPEVariableElimination, ProbQueryVariableElimination, ProbabilisticVariableElimination, SufficientStatisticsVariableElimination, VariableElimination, AnytimeProbabilisticBeliefPropagation, BeliefPropagation, MPEBeliefPropagation, OneTimeProbEvidenceBeliefPropagation, OneTimeProbabilisticBeliefPropagation, ProbEvidenceBeliefPropagation, ProbQueryBeliefPropagation, ProbabilisticBeliefPropagation, ChainApplyBlockingGibbs, Gibbs, ProbQueryGibbs, ProbabilisticGibbs, FactoredFrontier, Filtering, OneTimeFiltering, OneTimeParticleFilter, ParFiltering, ParOneTimeParticleFilter, LazyVariableElimination, ExpectationMaximization, ExpectationMaximizationWithFactors, GeneralizedEM, GeneralizedOnlineEM, OnlineExpectationMaximization, OnlineExpectationMaximizationWithFactors, Online, AnytimeElementSampler, AnytimeMPESampler, AnytimeMetropolisHastings, AnytimeMetropolisHastingsAnnealer, AnytimeProbEvidenceSampler, AnytimeProbQuerySampler, AnytimeSampler, BaseProbQuerySampler, BaseUnweightedSampler, ElementSampler, Importance, MetropolisHastings, MetropolisHastingsAnnealer, OneTimeElementSampler, OneTimeMPESampler, OneTimeMetropolisHastings, OneTimeMetropolisHastingsAnnealer, OneTimeProbEvidenceSampler, OneTimeProbQuerySampler, OneTimeSampler, ProbEvidenceSampler, ProbQuerySampler, Sampler, UnweightedSampler, WeightedSampler, ParAnytime, ParOneTime, ParSampler, ParSamplingAlgorithm, AnytimeLazyStructured, AnytimeLazyStructuredProbQuery, AnytimeStructured, AnytimeStructuredMPE, AnytimeStructuredProbQuery, DecompositionMPE, DecompositionProbQuery, DecompositionStructuredAlgorithm, LazyStructured, LazyStructuredProbQueryAlgorithm, OneTimeLazyStructured, OneTimeLazyStructuredProbQuery, OneTimeStructured, OneTimeStructuredMPE, OneTimeStructuredProbQuery, StructuredAlgorithm, StructuredMPEAlgorithm, StructuredProbQueryAlgorithm, FlatBP, FlatGibbs, FlatVE, RaisingVE, StructuredVEBPChooser, StructuredVEBPGibbsChooser, StructuredVEGibbsChooser, AnytimeLSVE, LazyStructuredVE, OneTimeLSVE, StructuredBP, StructuredGibbs, StructuredMPEBP, StructuredMPEVE, StructuredVE, BPSolver, GibbsSolver, VESolver, CollapsedProbQueryGibbs, CollapsedProbabilisticGibbs, DeterministicCollapseStrategy, FactorSizeCollapseStrategy, HeuristicCollapseStrategy, RecurringCollapseStrategy, AnytimeMarginalMAP, AnytimeProbEvidenceMarginalMAP, AnytimeStructuredMarginalMAP, DecompositionMarginalMAP, MarginalMAPAlgorithm, MarginalMAPBeliefPropagation, OneTimeMarginalMAP, OneTimeProbEvidenceMarginalMAP, OneTimeStructuredMarginalMAP, ProbEvidenceMarginalMAP, MMAPProbEvidenceSampler, StructuredMarginalMAPAlgorithm, StructuredMarginalMAPVE, AnytimeParticleBeliefPropagation, OneTimeParticleBeliefPropagation, ParticleBeliefPropagation, ProbQueryParticleBeliefPropagation
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Algorithm
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def doKill(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
  2. abstract def doResume(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
  3. abstract def doStart(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
  4. abstract def doStop(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]

Concrete 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. val active: Boolean
    Attributes
    protected
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def cleanUp(): Unit

    Called when the algorithm is killed.

    Called when the algorithm is killed. By default, does nothing. Can be overridden.

  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  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 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.

  14. def isActive: Boolean
  15. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  16. 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.

  17. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. final def notify(): Unit
    Definition Classes
    AnyRef
  19. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  20. 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.

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

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

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

Inherited from AnyRef

Inherited from Any

Ungrouped