Inheritance diagram for frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >:

[legend]

Public Member Functions
	LeafNodeTree (String ownVariable, Val[] ownVariableDomain, UtilitySolutionSpace< Val, U > space, U zero, U infeasible, boolean maximize, boolean collectStats)
	A constructor.
	LeafNodeTree (String ownVariable, Val[] ownVariableDomain, List< UtilitySolutionSpace< Val, U > > spaces, U zero, U infeasible, boolean maximize, boolean collectStats)
	A constructor.
Good< Val, U >	getAmax ()
void	getBestAssignmentForOwnVariable (HashMap< String, Val > context)
int[]	getFinalDomainSize ()
Val[][]	getDomains ()
boolean	hasFullInfo ()
boolean	hasMore ()
boolean	isValuationSufficient ()
boolean	knowsVariable (String variable)
boolean	notEnoughInfo ()
boolean	pathExists (Val[] values)
void	removeAMax ()
	This function is not used in this class.
void	setFinalDomainSize (String[] variables, int[] domainSize)
	This function is not used in this class.
boolean	stillToSend ()
String[]	getChildSeparatorReportingOrder (int child)
void	setChildrenSeparator (int child, String[] variables)
boolean	add (Good< Val, U > g, int sender, HashMap< String, Val[]> domains)
boolean	setChildDone (int child)
HashMap< String, Val >	getChildValues (HashMap< String, Val > parentContext, int child)
Public Member Functions inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
	GoodsTree (String ownVariable, Val[] ownVariableDomain, UtilitySolutionSpace< Val, U > space, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
	GoodsTree (String ownVariable, Val[] ownVariableDomain, List< UtilitySolutionSpace< Val, U > > spaces, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
double	getTreeFillPercentage ()
long	getNumberOfDummies ()
double	getDummiesFillPercentage ()
boolean	greaterThanOrEqual (U u1, U u2)
	Compares two values.
boolean	greaterThan (U u1, U u2)
	Compares two values.
U	getMaximalCut ()
long	getNumberOfGoodsSent ()
long	getSizeOfSpace ()

Protected Member Functions
void	addToTree (Val[] assignment, int depth, Node currentNode)
	Adds a reported value to the goods tree.
void	getOwnAssignment (HashMap< String, Val > assignment, Node currentNode, int depth)
	Given an assignment to all the variables in the variables separator, this method finds and returns the optimal value of the tree's own variable.
boolean	pathExists (Val[] values, int finalDepth)
	Checks whether a path exists up until a certain depth.
Protected Member Functions inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
void	solveLocalProblem ()
	Method used to solve the local problem and create an ordered list of all feasible assignments.
void	countLeafNode ()
	Method used to count the number of leaf nodes created (includes the dummy nodes).
void	countLeafNode (boolean real)
	Method used to count the number of leaf nodes created (includes the dummy nodes).
void	countGoodsProduced ()
	Count rhe number of goods produced.

Protected Attributes
Node	root
	The root of the tree.
boolean	hasMore
	`true` when orderedAssignments is not empty, and `false` otherwise
String[]	separatorVariables
	The variables in `ownVariable's` separator.
int[]	domainSize
	For each variable the size of its domain.
HashMap< String, HashMap< Val, Integer > >	valuePointers
	for each variables, the child index of their values
Val[]	localAssignment
	The currently optimal assignment to the local problem.
boolean	singleton
	`true` when the variable that owns this tree is a singleton, i.e.
Protected Attributes inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
UtilitySolutionSpace< Val, U >	localProblem
	The list of spaces this variable is responsible for.
int	numberOfLocalVariables
	The number of local variables in the local problem.
IteratorBestFirst< Val, U >	localProblemIterator
	Iterator that returns solutions to the local problem in a best first order.
final U	infeasibleUtil
	The -infinite utility.
final U	zero
	The zero utility.
int	numberOfSpaces
	The number of spaces that together comprise the local problem.
Class<?>	domainElementClass
	domain element used for reflection
int	numberOfVariables
	The number of variables in the local problem.
String[]	depthToVariable
	Links a level in the tree with its corresponding variable.
String	ownVariable
	The variable that controls this LeafNodeTree.
int	depthFinalVariable
	The depth of the last variable in the tree.
Val[]	ownVarDomain
	The domain of `ownVariable`.
String[]	outsideVariables
	The variables as they should be communicated with the outside world.
int[]	valuesToBeRemoved
	Contains the indices of the values that need to be removed from the assigment before being send upwards.
int	depthOfFirstToBeRemovedVariables
	All variables below this depth must be removed when sending a good.
HashMap< String, Integer >	outsideVariablesMapping
	A mapping from outside variables to inside variables.
final boolean	maximize
	`true` when we are maximizing, and false otherwise
long	totalSeparatorSpaceSize = 1
	The size of the separator space.

Private Member Functions
void	init (U zero)
	Method to initialize all the variables.

Private Attributes
HashMap< String, Integer >	variableToDepth
	The index of every variable in `variables`.
boolean	stillToSend
	`true` when the final domain size information has not yet been requested, and `false` otherwise

Static Private Attributes
static final long	serialVersionUID = -4372313666234992912L
	Used for serialisation.

Additional Inherited Members
Public Attributes inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
final boolean	COLLECT_STATISTICS
	`true` when statistics should be collected, and `false` otherwise

Detailed Description

Author: Brammert Ottens, 9 nov 2009

Parameters

<Val>	type used for variable values
<U>	type used for utility values
<L>	type used for the leaf node

Todo: write tests for this class

Constructor & Destructor Documentation

◆ LeafNodeTree() [1/2]

frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.LeafNodeTree	(	String	ownVariable,
		Val[]	ownVariableDomain,
		UtilitySolutionSpace< Val, U >	space,
		U	zero,
		U	infeasible,
		boolean	maximize,
		boolean	collectStats )

A constructor.

Warning: we assume that the agent's own variable is put in the end of variables_order

Parameters

ownVariable	The variable ID
ownVariableDomain	The domain of `ownVariable`
space	The hypercube representing the local problem
zero	The zero utility
infeasible	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References init(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfSpaces, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.solveLocalProblem(), and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Here is the call graph for this function:

◆ LeafNodeTree() [2/2]

frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.LeafNodeTree	(	String	ownVariable,
		Val[]	ownVariableDomain,
		List< UtilitySolutionSpace< Val, U > >	spaces,
		U	zero,
		U	infeasible,
		boolean	maximize,
		boolean	collectStats )

A constructor.

Warning: we assume that the agents own variable is put in the end of variables_order

Parameters

ownVariable	The variable ID
ownVariableDomain	The domain of `ownVariable`
spaces	The hypercubes representing the local problem
zero	The zero utility
infeasible	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References init(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfSpaces, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.solveLocalProblem(), and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Here is the call graph for this function:

Member Function Documentation

◆ add()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.add	(	Good< Val, U >	g,
		int	sender,
		HashMap< String, Val[]>	domains )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.add(frodo2.algorithms.odpop.Good, int, java.util.HashMap)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ addToTree()

void frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.addToTree	(	Val[]	assignment,
		int	depth,
		Node	currentNode )

protected

Adds a reported value to the goods tree.

Author: Brammert Ottens, 9 nov 2009

Parameters

assignment	The reported assignment
depth	The current depth in the tree
currentNode	The current node being visited

References frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node.addChild(), addToTree(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.COLLECT_STATISTICS, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.countLeafNode(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domainSize, frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node.getChild(), and valuePointers.

Referenced by addToTree().

Here is the call graph for this function:

◆ getAmax()

Good< Val, U > frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.getAmax ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getAmax()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References getAmax(), and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblemIterator.

Referenced by getAmax().

Here is the call graph for this function:

◆ getBestAssignmentForOwnVariable()

void frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.getBestAssignmentForOwnVariable ( HashMap< String, Val > context )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getBestAssignmentForOwnVariable(java.util.HashMap)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References getOwnAssignment(), and root.

Here is the call graph for this function:

◆ getChildSeparatorReportingOrder()

String[] frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.getChildSeparatorReportingOrder ( int child )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getChildSeparatorReportingOrder(int)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ getChildValues()

HashMap< String, Val > frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.getChildValues	(	HashMap< String, Val >	parentContext,
		int	child )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getChildValues(java.util.HashMap, int)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ getDomains()

Val[][] frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.getDomains ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getDomains()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, getDomains(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables.

Referenced by getDomains().

Here is the call graph for this function:

◆ getFinalDomainSize()

int[] frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.getFinalDomainSize ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getFinalDomainSize()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, domainSize, frodo2.output, and stillToSend.

◆ getOwnAssignment()

void frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.getOwnAssignment	(	HashMap< String, Val >	assignment,
		Node	currentNode,
		int	depth )

protected

Given an assignment to all the variables in the variables separator, this method finds and returns the optimal value of the tree's own variable.

Author: Brammert Ottens, 9 nov 2009

Parameters

assignment	The partial assignment
currentNode	The current node being visited
depth	The current depth in the tree

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node.getChild(), getOwnAssignment(), frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNode< Val extends Addable< Val > >.getValue(), localAssignment, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, and valuePointers.

Referenced by getBestAssignmentForOwnVariable(), and getOwnAssignment().

Here is the call graph for this function:

◆ hasFullInfo()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.hasFullInfo ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.hasFullInfo()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References hasMore.

◆ hasMore()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.hasMore ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.hasMore()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References hasMore.

◆ init()

void frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.init ( U zero )

private

Method to initialize all the variables.

Author: Brammert Ottens, 9 nov 2009

Parameters

zero	The zero utility

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domainSize, hasMore, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVarDomain, root, separatorVariables, singleton, stillToSend, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.totalSeparatorSpaceSize, valuePointers, variableToDepth, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Referenced by LeafNodeTree(), and LeafNodeTree().

◆ isValuationSufficient()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.isValuationSufficient ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.isValuationSufficient()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ knowsVariable()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.knowsVariable ( String variable )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.knowsVariable(java.lang.String)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References valuePointers.

◆ notEnoughInfo()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.notEnoughInfo ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.notEnoughInfo()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables.

◆ pathExists() [1/2]

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.pathExists ( Val[] values )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree#pathExists(Addable[])

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node.getChild(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, root, and valuePointers.

Here is the call graph for this function:

◆ pathExists() [2/2]

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.pathExists	(	Val[]	values,
		int	finalDepth )

protected

Checks whether a path exists up until a certain depth.

Author: Brammert Ottens, 10 nov 2009

Parameters

values	the path to be checked
finalDepth	the maximal depth

Returns: true when the path exists, and false otherwise

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node.getChild(), root, and valuePointers.

Here is the call graph for this function:

◆ removeAMax()

void frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.removeAMax ( )

This function is not used in this class.

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.removeAMax()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ setChildDone()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.setChildDone ( int child )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.setChildDone(int)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ setChildrenSeparator()

void frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.setChildrenSeparator	(	int	child,
		String[]	variables )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.setChildrenSeparator(int, java.lang.String[])

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ setFinalDomainSize()

void frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >.setFinalDomainSize	(	String[]	variables,
		int[]	domainSize )

This function is not used in this class.

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.setFinalDomainSize(java.lang.String[], int[])

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References domainSize.

◆ stillToSend()

boolean frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.stillToSend ( )