Trait

com.cra.figaro.algorithm

Algorithm

Related Doc: package algorithm

Permalink

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, AnytimeDecisionMetropolisHastings, AnytimeElementSampler, AnytimeMPE, AnytimeMPESampler, AnytimeMarginalMAP, AnytimeMetropolisHastings, AnytimeMetropolisHastingsAnnealer, AnytimeParticleBeliefPropagation, AnytimeProbEvidence, AnytimeProbEvidenceMarginalMAP, AnytimeProbEvidenceSampler, AnytimeProbQuery, AnytimeProbQuerySampler, AnytimeProbabilisticBeliefPropagation, AnytimeSampler, BPSolver, BaseProbQueryAlgorithm, BaseProbQuerySampler, BaseUnweightedSampler, BeliefPropagation, ChainApplyBlockingGibbs, CollapsedProbQueryGibbs, CollapsedProbabilisticGibbs, DecisionAlgorithm, DecisionImportance, DecisionMetropolisHastings, DeterministicCollapseStrategy, ElementSampler, ExpectationMaximization, ExpectationMaximizationWithFactors, FactorSizeCollapseStrategy, FactoredAlgorithm, FactoredFrontier, Filtering, FlatBP, FlatGibbs, FlatVE, GeneralizedEM, GeneralizedOnlineEM, Gibbs, GibbsSolver, HeuristicCollapseStrategy, Importance, LazyAlgorithm, LazyVariableElimination, MMAPProbEvidenceSampler, MPEAlgorithm, MPEBeliefPropagation, MPEVariableElimination, MarginalMAPAlgorithm, MarginalMAPBeliefPropagation, MetropolisHastings, MetropolisHastingsAnnealer, MultiDecisionAlgorithm, MultiDecisionVariableElimination, OneTime, OneTimeDecisionMetropolisHastings, OneTimeElementSampler, OneTimeFiltering, OneTimeMPE, OneTimeMPESampler, OneTimeMarginalMAP, OneTimeMetropolisHastings, OneTimeMetropolisHastingsAnnealer, OneTimeMultiDecisionImportance, OneTimeMultiDecisionMetropolisHastings, OneTimeParticleBeliefPropagation, OneTimeParticleFilter, OneTimeProbEvidence, OneTimeProbEvidenceBeliefPropagation, OneTimeProbEvidenceMarginalMAP, OneTimeProbEvidenceSampler, OneTimeProbQuery, OneTimeProbQueryDecision, OneTimeProbQuerySampler, OneTimeProbabilisticBeliefPropagation, OneTimeSampler, Online, OnlineExpectationMaximization, OnlineExpectationMaximizationWithFactors, ParAnytime, ParFiltering, ParOneTime, ParOneTimeParticleFilter, ParSampler, ParSamplingAlgorithm, ParticleBeliefPropagation, ProbEvidenceAlgorithm, ProbEvidenceBeliefPropagation, ProbEvidenceMarginalMAP, ProbEvidenceSampler, ProbQueryAlgorithm, ProbQueryBeliefPropagation, ProbQueryGibbs, ProbQueryParticleBeliefPropagation, ProbQuerySampler, ProbQueryVariableElimination, ProbQueryVariableEliminationDecision, ProbabilisticBeliefPropagation, ProbabilisticGibbs, ProbabilisticVariableElimination, ProbabilisticVariableEliminationDecision, RaisingVE, RecurringCollapseStrategy, Sampler, StreamableProbQueryAlgorithm, StructuredBP, StructuredGibbs, StructuredMPEAlgorithm, StructuredMPEBP, StructuredMPEVE, StructuredMarginalMAPAlgorithm, StructuredMarginalMAPVE, StructuredProbQueryAlgorithm, StructuredVE, StructuredVEBPChooser, StructuredVEBPGibbsChooser, StructuredVEGibbsChooser, SufficientStatisticsVariableElimination, UnweightedSampler, VESolver, VariableElimination, WeightedSampler
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

    Permalink
    Attributes
    protected[com.cra.figaro.algorithm]

  2. abstract def doResume(): Unit

    Permalink
    Attributes
    protected[com.cra.figaro.algorithm]

  3. abstract def doStart(): Unit

    Permalink
    Attributes
    protected[com.cra.figaro.algorithm]

  4. abstract def doStop(): Unit

    Permalink
    Attributes
    protected[com.cra.figaro.algorithm]

Concrete 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. var active: Boolean

    Permalink
    Attributes
    protected

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  6. def cleanUp(): Unit

    Permalink

    Called when the algorithm is killed.

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

  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. def initialize(): Unit

    Permalink

    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

    Permalink

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  16. def kill(): Unit

    Permalink

    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

    Permalink
    Definition Classes
    AnyRef

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. def resume(): Unit

    Permalink

    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

    Permalink

    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

    Permalink

    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

    Permalink
    Definition Classes
    AnyRef

  24. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  25. final def wait(): Unit

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

  26. final def wait(arg0: Long, arg1: Int): Unit

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

  27. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped