frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo Class Reference

Convenience class to hold variable information. More...

Inheritance diagram for frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo:

Public Member Functions
	VariableInfo (String variableID, V[] domain, String parent, List< String > children, Class< SamplingProcedure< V > > samplingClass, Class< TerminationCondition< V > > terminationClass)
	Constructor.
boolean	sample ()
boolean	storeCOSTmsg (COSTmsg msg)

Protected Member Functions
SearchNode< V >	createNode (int domainSize, boolean maximize, boolean IGNORE_INF)

Protected Attributes
boolean	infeasiblePath = false
	Whether the path is infeasible.

Detailed Description

Convenience class to hold variable information.

Author

Brammert Ottens, 7 jul. 2011

Constructor & Destructor Documentation

VariableInfo()

frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo.VariableInfo	(	String	variableID,
		V[]	domain,
		String	parent,
		List< String >	children,
		Class< SamplingProcedure< V > >	samplingClass,
		Class< TerminationCondition< V > >	terminationClass )

Constructor.

Parameters

variableID	the name of the variable
domain	the domain of the variable
parent	the parent of the variable
children	list of the children of the variable
samplingClass	the class of the sampling method
terminationClass	the class of the termination condition

Member Function Documentation

createNode()

SearchNode< V > frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo.createNode ( int domainSize, boolean maximize, boolean IGNORE_INF )

protected

See also

frodo2.algorithms.duct.Sampling.VariableInfo.createNode(int, boolean, boolean)

sample()

boolean frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo.sample

(

)

See also

frodo2.algorithms.duct.Sampling.VariableInfo.sample()

Referenced by frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.notifyIn().

storeCOSTmsg()

boolean frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo.storeCOSTmsg

(

COSTmsg

msg

)

Author

Brammert Ottens, 7 jul. 2011

Parameters

msg	the message to be stored

Returns

true when enough cost messages have been received, false otherwise

References frodo2.solutionSpaces.AddableReal.add(), and frodo2.algorithms.duct.COSTmsg.getCost().

Referenced by frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.notifyIn().

Here is the call graph for this function:

Member Data Documentation

infeasiblePath

boolean frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo.infeasiblePath = false

protected

Whether the path is infeasible.

Referenced by frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.notifyIn().

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/duct/SamplingPruningSearch.java