com.cra.figaro.algorithm

LazyAlgorithm

trait LazyAlgorithm extends Algorithm

A lazy algorithm is an algorithm that can be run to increasing depths.

Linear Supertypes
Algorithm, AnyRef, Any
Known Subclasses
LazyVariableElimination
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. LazyAlgorithm
  2. Algorithm
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def run(depth: Int): Unit

    Run the algorithm to the given depth.

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

    Attributes
    protected
    Definition Classes
    Algorithm

  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.

    Definition Classes
    Algorithm

  7. def clone(): AnyRef

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

  8. var depth: Int

    The current depth to which the algorithm should be run.

  9. def doKill(): Unit

    Kill the algorithm.

    Kill the algorithm.

    Definition Classes
    LazyAlgorithm → Algorithm

  10. def doResume(): Unit

    Resume the algorithm by increasing the depth and running again.

    Resume the algorithm by increasing the depth and running again.

    Definition Classes
    LazyAlgorithm → Algorithm

  11. def doStart(): Unit

    Start the algorithm.

    Start the algorithm. This will run the algorithm to one depth.

    Definition Classes
    LazyAlgorithm → Algorithm

  12. def doStop(): Unit

    Stop the algorithm.

    Stop the algorithm.

    Definition Classes
    LazyAlgorithm → Algorithm

  13. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  14. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  15. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  16. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any

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

  19. def isActive: Boolean

    Definition Classes
    Algorithm

  20. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

  22. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  25. def pump(): Unit

    Increase the depth and run the algorithm again.

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

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

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

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

    Definition Classes
    AnyRef

  30. def toString(): String

    Definition Classes
    AnyRef → Any

  31. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped