Class

com.cra.figaro.algorithm.structured

NestedProblem

Related Doc: package structured

Permalink

class NestedProblem[T] extends Problem

Linear Supertypes
Problem, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NestedProblem
  2. Problem
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NestedProblem(collection: ComponentCollection, target: Element[T])

    Permalink

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. def add[T](element: Element[T]): ProblemComponent[T]

    Permalink

    Add a component for the given element to this problem.

    Add a component for the given element to this problem.

    Definition Classes
    Problem
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. val collection: ComponentCollection

    Permalink
    Definition Classes
    Problem
  8. var components: List[ProblemComponent[_]]

    Permalink

    Components directly defined in this problem.

    Components directly defined in this problem.

    Definition Classes
    Problem
  9. val componentsToVisit: Set[ProblemComponent[_]]

    Permalink
    Definition Classes
    Problem
  10. def contains(otherProblem: Problem): Boolean

    Permalink

    Determines if this problem contains the given problem.

    Determines if this problem contains the given problem. Any variables in the contained problem should also be eliminated when this problem is solved.

    Definition Classes
    Problem
  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  15. def global(variable: Variable[_]): Boolean

    Permalink

    Determines if a variable is in scope outside of this problem

    Determines if a variable is in scope outside of this problem

    Definition Classes
    Problem
  16. var globals: Set[ProblemComponent[_]]

    Permalink

    Components outside of this problem that appear in the solution to this problem.

    Components outside of this problem that appear in the solution to this problem.

    Definition Classes
    Problem
  17. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  18. def internal(variable: Variable[_]): Boolean

    Permalink

    Determines if a variable is internal to this problem and should be eliminated

    Determines if a variable is internal to this problem and should be eliminated

    Definition Classes
    Problem
  19. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  20. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  21. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  22. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  23. var recordingFactors: Map[Variable[_], Factor[_]]

    Permalink

    A map for each variable that indicates the value of the variable that is maximal for each possible value of the interface The support of each factor is over the product of the supports of the interface variables

    A map for each variable that indicates the value of the variable that is maximal for each possible value of the interface The support of each factor is over the product of the supports of the interface variables

    Definition Classes
    Problem
  24. def sample(): (Map[Element[_], _], Double)

    Permalink

    Produce a single weighted sample of all the elements in this problem.

    Produce a single weighted sample of all the elements in this problem.

    Definition Classes
    Problem
  25. var solution: List[Factor[Double]]

    Permalink

    Factors over globals produced by solving the problem.

    Factors over globals produced by solving the problem.

    Definition Classes
    Problem
  26. def solve(strategy: SolvingStrategy, bounds: Bounds = Lower): Unit

    Permalink

    Solve the problem defined by all the components' current factors.

    Solve the problem defined by all the components' current factors. This will also set the globals accordingly. All components in this problem and contained subproblems should be eliminated in the solution.

    Definition Classes
    Problem
  27. var solved: Boolean

    Permalink

    A flag indicating whether the problem has been solved.

    A flag indicating whether the problem has been solved.

    Definition Classes
    Problem
  28. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  29. val target: Element[T]

    Permalink
  30. val targets: List[Element[_]]

    Permalink
    Definition Classes
    Problem
  31. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  32. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  33. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  34. final def wait(arg0: Long): Unit

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

Inherited from Problem

Inherited from AnyRef

Inherited from Any

Ungrouped