Packages

trait ParOneTime extends ParSamplingAlgorithm with OneTime

Parallel one-time sampling algorithms. These algorithms have multiple instances that execute across multiple threads.

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ParOneTime
  2. OneTime
  3. ParSamplingAlgorithm
  4. Algorithm
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract val parAlgs: ParSeq[OneTime]
    Attributes
    protected
    Definition Classes
    ParOneTimeParSamplingAlgorithm

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
    Definition Classes
    Algorithm
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def cleanUp(): Unit

    Calls cleanUp() on all algorithms.

    Calls cleanUp() on all algorithms.

    Definition Classes
    ParSamplingAlgorithmAlgorithm
  7. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def doKill(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    ParOneTimeOneTimeParSamplingAlgorithmAlgorithm
  9. def doResume(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    ParOneTimeOneTimeParSamplingAlgorithmAlgorithm
  10. def doStart(): Unit

    Specify delegation of algorithm management to ParSamplingAlgorithm *

    Specify delegation of algorithm management to ParSamplingAlgorithm *

    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    ParOneTimeOneTimeParSamplingAlgorithmAlgorithm
  11. def doStop(): Unit
    Attributes
    protected[com.cra.figaro.algorithm]
    Definition Classes
    ParOneTimeOneTimeParSamplingAlgorithmAlgorithm
  12. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  13. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  14. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. def initialize(): Unit

    Calls initialize() on all algorithms.

    Calls initialize() on all algorithms.

    Definition Classes
    ParSamplingAlgorithmAlgorithm
  18. def isActive: Boolean
    Definition Classes
    Algorithm
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. 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
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  24. 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
  25. def run(): Unit

    Run the algorithms in parallel, performing their computations to completion.

    Run the algorithms in parallel, performing their computations to completion.

    Definition Classes
    ParOneTimeOneTime
  26. 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
  27. 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
  28. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  29. def toString(): String
    Definition Classes
    AnyRef → Any
  30. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  31. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  32. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from OneTime

Inherited from ParSamplingAlgorithm

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped