ExpandableComponent

Instance Constructors

new ExpandableComponent(problem: Problem, parent: Element[ParentValue], element: Element[Value])

parent
the element according to whose values this component should be expanded
element
the element to which this component corresponds

Abstract Value Members

abstract def expand(parentValue: ParentValue): Unit

Expand for a particular parent value.
abstract val expandFunction: (ParentValue) ⇒ Element[Value]

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def constraintFactors(bounds: Bounds = Lower): List[Factor[Double]]

Gets the constraint factors for this component.
Gets the constraint factors for this component. Returns the lower bound factors unless an Upper argument is provided.

Definition Classes
ProblemComponent
val element: Element[Value]

Definition Classes
ProblemComponent
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def expand(): Unit

Expand for all values of the parent that were not previously expanded, based on the current range of the parent.
def finalize(): Unit

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

A problem component is fully enumerated if its range is complete.
A problem component is fully enumerated if its range is complete. This also means that its range cannot contain star. This is always false for components associated with elements that have infinite support.

Definition Classes
ProblemComponent
var fullyRefined: Boolean

A problem component is fully refined if any additional refinement cannot change its range or factors.
A problem component is fully refined if any additional refinement cannot change its range or factors. One necessary condition is to be fully enumerated. Additionally, expandable components must be fully expanded (i.e. have created a subproblem for each parent value), and each subproblem must be fully refined. These conditions are necessary but not always sufficient to be fully refined.

Definition Classes
ProblemComponent
def generateRange(): Unit

Generate a range of values for this component.
Generate a range of values for this component. Also sets the variable for this component. If an argument is not in the component collection, we do not generate the argument, but instead assume its only value is *. This doesn't change the range of any other element or expand any subproblems. The range will include * based on argument ranges including * or any subproblem not being expanded.\

Definition Classes
ProblemComponent
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
def nonConstraintFactors(parameterized: Boolean = false): List[Factor[Double]]

Generate the non-constraint factors based on the current range.
Generate the non-constraint factors based on the current range. For most elements, this just generates the factors in the usual way. For a chain, this does not include subproblem factors. The parameterized flag indicates whether parameterized elements should have special factors created that use the MAP values of their arguments. This defaults to false.

Definition Classes
ProblemComponent
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val problem: Problem

Definition Classes
ProblemComponent
var range: ValueSet[Value]

The current range of the element.
The current range of the element. May grow or change over time.

Definition Classes
ProblemComponent
def setVariable(v: Variable[Value]): Unit

Set the variable associated with this component to the given variable.
Set the variable associated with this component to the given variable.

Definition Classes
ProblemComponent
var subproblems: Map[ParentValue, NestedProblem[Value]]

The subproblems nested inside this expandable component.
The subproblems nested inside this expandable component. They are created for particular parent values.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def variable: Variable[Value]

The current variable representing this component in factors.
The current variable representing this component in factors. This is set automatically when the range is updated.

Definition Classes
ProblemComponent
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package structured

abstract class ExpandableComponent[ParentValue, Value] extends ProblemComponent[Value]

Instance Constructors

new ExpandableComponent(problem: Problem, parent: Element[ParentValue], element: Element[Value])

Abstract Value Members

abstract def expand(parentValue: ParentValue): Unit

abstract val expandFunction: (ParentValue) ⇒ Element[Value]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def constraintFactors(bounds: Bounds = Lower): List[Factor[Double]]

val element: Element[Value]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def expand(): Unit

def finalize(): Unit

var fullyEnumerated: Boolean

var fullyRefined: Boolean

def generateRange(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def nonConstraintFactors(parameterized: Boolean = false): List[Factor[Double]]

final def notify(): Unit

final def notifyAll(): Unit

val problem: Problem

var range: ValueSet[Value]

def setVariable(v: Variable[Value]): Unit

var subproblems: Map[ParentValue, NestedProblem[Value]]

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

def toString(): String

def variable: Variable[Value]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from ProblemComponent[Value]

Inherited from AnyRef

Inherited from Any

Ungrouped