Inheritance diagram for frodo2.algorithms.test.XCSPparserTest:

Public Member Functions
	XCSPparserTest (String name)
	Generates a test using the specified method.
	XCSPparserTest (String name, boolean maximize)
	Generates a test using the specified method.
	XCSPparserTest (String name, boolean extendedRandNeighborhoods, boolean publicAgents)
	Generates a test using the specified method.
void	testGetZeroUtility ()
	Test method for getZeroUtility().
void	testGetPlusInfUtility ()
	Test method for getPlusInfUtility().
void	testGetMinInfUtility ()
	Test method for getMinInfUtility().
void	testGetAgents ()
	Test method for XCSPparser.getAgents().
void	testGetOwner ()
	Test method for XCSPparser.getOwner(java.lang.String).
void	testGetOwners ()
	Test method for XCSPparser.getOwners().
void	testGetNbrVars ()
	Test method for XCSPparser.getNbrVars().
void	testGetNbrVarsString ()
	Test method for XCSPparser.getNbrVars(java.lang.String).
void	testGetVariables ()
	Test method for XCSPparser.getVariables().
void	testGetVariablesString ()
	Test method for XCSPparser.getVariables(java.lang.String).
void	testGetExtVars ()
	Test method for XCSPparser.getExtVars().
void	testGetNeighborVars ()
	Test method for XCSPparser.getNeighborVars(java.lang.String).
void	testGetNeighborVarsWithAnonymVars ()
	Test method for XCSPparser.getNeighborVars(java.lang.String, boolean).
void	testGetNeighborVars (boolean withAnonymVars)
	Test for getNeighborVars.
void	testGetNbrNeighbors ()
	Test method for XCSPparser.getNbrNeighbors(java.lang.String).
void	testGetNeighborhoods ()
	Test method for XCSPparser.getNeighborhoods(java.lang.String).
void	testGetAnonymNeighborhoods ()
	Test method for XCSPparser.getAnonymNeighborhoods(java.lang.String).
void	testGetNeighborhoodSizes ()
	Test method for XCSPparser.getNeighborhoodSizes(java.lang.String).
void	testGetAgentNeighborhoods ()
	Test method for XCSPparser.getAgentNeighborhoods(java.lang.String).
void	testGetDomainSize ()
	Test method for XCSPparser.getDomainSize(java.lang.String).
void	testGetDomain () throws JDOMException
	Test method for frodo2.algorithms.XCSPparser.getDomain(java.lang.String).
void	testSetDomain ()
	Tests the setDomain() method.
void	testGetSubProblem ()
	Test method for XCSPparser.getSubProblem(String).
void	testIsRandom () throws JDOMException
	Test method for frodo2.algorithms.XCSPparser.isRandom(java.lang.String).
void	testGetSolutionSpacesWithRandVars ()
	Test method for getSolutionSpaces() with random variables.
void	testGetSolutionSpaces ()
	Test method for getSolutionSpaces() ignoring random variables.
void	testGetProbabilitySpaces ()
	Test method for getProbabilitySpaces().
void	testGetSolutionSpacesForVarWithRandVars ()
	Test method for getSolutionSpaces(String) with random variables.
void	testGetSolutionSpacesForVar ()
	Test method for getSolutionSpaces(String) ignoring random variables.
void	testGetProbabilitySpacesForVar ()
	Test method for getProbabilitySpaces(String).
void	testGetUtility ()
	Test for the method getUtility() on complete assignments.
void	testMaximize ()
	Test for the method maximize().

Static Public Member Functions
static TestSuite	suite ()

Protected Member Functions
void	setUp ()
void	tearDown () throws Exception
Map< String, ? extends Collection< String > >	getNeighborhoods (final boolean withAnonymVars)
	Computes the correct neighborhoods.
void	testGetSolutionSpaces (DCOPProblemInterface< AddableInteger, AddableReal > problem, List< ? extends UtilitySolutionSpace< AddableInteger, AddableReal > > refSpaces, String var, final boolean withRandVars)
	Test method for getSolutionSpaces(String, boolean).

Protected Attributes
RandGraphFactory.Graph	graph
	Random graph used to generate a constraint graph.
Document	probDoc
	Random XCSP problem.
XCSPparser< AddableInteger, AddableReal >	parser
	The parser.
DCOPProblemInterface< AddableInteger, AddableReal >	prob
	The parsed problem instance.
ArrayList< Hypercube< AddableInteger, AddableReal > >	solutionSpaces = new ArrayList< Hypercube<AddableInteger, AddableReal> > ()
	The list of solution spaces in the problem.
ArrayList< Hypercube< AddableInteger, AddableReal > >	probSpaces = new ArrayList< Hypercube<AddableInteger, AddableReal> > ()
	The list of probability spaces in the problem.

Private Member Functions
HashSet< String >	getExtendedRandNeighbors (String var)
	Builds the set of all random variables reachable from var by paths involving only random variables.
void	testGetNeighborhoods (final boolean onlyAnonymVars)
	Test for XCSPparser.getNeighborhoods(java.lang.String) and XCSPparser.getAnonymNeighborhoods(java.lang.String).
void	testGetSolutionSpacesForVar (final boolean withRandVars)
	Test method for getSolutionSpaces(String, boolean).

Private Attributes
final boolean	maximize
	Whether to test on maximization problems.
final int	maxNbrVars = 15
	Maximum number of variables in the random graph.
final int	maxNbrEdges = 100
	Maximum number of edges in the random graph.
final int	maxNbrAgents = 5
	Maximum number of agents.
boolean	extendedRandNeighborhoods
	Whether we want extended random neighborhoods.
boolean	publicAgents = false
	Whether each agent knows the identities of all agents.

Detailed Description

Test suite for XCSPparser.

Author: Thomas Leaute

Todo: Fully test extendedRandNeighborhoods

Constructor & Destructor Documentation

◆ XCSPparserTest() [1/3]

frodo2.algorithms.test.XCSPparserTest.XCSPparserTest ( String name )

Generates a test using the specified method.

Parameters

name	name of the method

Referenced by suite().

◆ XCSPparserTest() [2/3]

frodo2.algorithms.test.XCSPparserTest.XCSPparserTest	(	String	name,
		boolean	maximize )

Generates a test using the specified method.

Parameters

name	name of the method
maximize	whether to test on maximization problems

References maximize.

◆ XCSPparserTest() [3/3]

frodo2.algorithms.test.XCSPparserTest.XCSPparserTest	(	String	name,
		boolean	extendedRandNeighborhoods,
		boolean	publicAgents )

Generates a test using the specified method.

Parameters

name	name of the method
extendedRandNeighborhoods	whether we want extended random neighborhoods
publicAgents	Whether each agent knows the identities of all agents

References extendedRandNeighborhoods, and publicAgents.

Member Function Documentation

◆ getExtendedRandNeighbors()

HashSet< String > frodo2.algorithms.test.XCSPparserTest.getExtendedRandNeighbors ( String var )

private

Builds the set of all random variables reachable from var by paths involving only random variables.

Parameters

var	the input variable

Returns: the extended random neighbors of var

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom().

Referenced by getNeighborhoods(), and testGetSubProblem().

Here is the call graph for this function:

◆ getNeighborhoods()

Map< String, ? extends Collection< String > > frodo2.algorithms.test.XCSPparserTest.getNeighborhoods ( final boolean withAnonymVars )

protected

Computes the correct neighborhoods.

Parameters

withAnonymVars whether to consider anonymous neighbors

Returns: the neighborhoods

References getExtendedRandNeighbors(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables(), and frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom().

Referenced by testGetAgentNeighborhoods(), testGetNbrNeighbors(), testGetNeighborhoods(), testGetNeighborhoodSizes(), and testGetNeighborVars().

Here is the call graph for this function:

◆ setUp()

void frodo2.algorithms.test.XCSPparserTest.setUp ( )

protected

See also: junit.framework.TestCase#setUp()

References frodo2.algorithms.test.AllTests.generateProblem(), frodo2.algorithms.RandGraphFactory.getRandGraph(), graph, maxNbrAgents, maxNbrEdges, maxNbrVars, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.parse(), parser, probDoc, probSpaces, and solutionSpaces.

Here is the call graph for this function:

◆ suite()

TestSuite frodo2.algorithms.test.XCSPparserTest.suite ( )

static

Returns: the test suite for this test

References suite(), and XCSPparserTest().

Referenced by frodo2.algorithms.test.AllTests.suite(), and suite().

Here is the call graph for this function:

◆ tearDown()

void frodo2.algorithms.test.XCSPparserTest.tearDown ( ) throws Exception

protected

See also: junit.framework.TestCase#tearDown()

References graph, parser, and probDoc.

◆ testGetAgentNeighborhoods()

void frodo2.algorithms.test.XCSPparserTest.testGetAgentNeighborhoods ( )

Test method for XCSPparser.getAgentNeighborhoods(java.lang.String).

References getNeighborhoods(), graph, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom(), and prob.

Here is the call graph for this function:

◆ testGetAgents()

void frodo2.algorithms.test.XCSPparserTest.testGetAgents ( )

Test method for XCSPparser.getAgents().

References graph, and prob.

◆ testGetAnonymNeighborhoods()

void frodo2.algorithms.test.XCSPparserTest.testGetAnonymNeighborhoods ( )

Test method for XCSPparser.getAnonymNeighborhoods(java.lang.String).

References testGetNeighborhoods().

Here is the call graph for this function:

◆ testGetDomain()

void frodo2.algorithms.test.XCSPparserTest.testGetDomain ( ) throws JDOMException

Test method for frodo2.algorithms.XCSPparser.getDomain(java.lang.String).

Exceptions

JDOMException if an error occurs while reading the problem description

References frodo2.solutionSpaces.AddableInteger.fromString(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getDomain(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables(), graph, prob, and probDoc.

Here is the call graph for this function:

◆ testGetDomainSize()

void frodo2.algorithms.test.XCSPparserTest.testGetDomainSize ( )

Test method for XCSPparser.getDomainSize(java.lang.String).

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getDomain(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getDomainSize(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables(), and prob.

Here is the call graph for this function:

◆ testGetExtVars()

void frodo2.algorithms.test.XCSPparserTest.testGetExtVars ( )

Test method for XCSPparser.getExtVars().

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getExtVars(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getOwners(), graph, and prob.

Here is the call graph for this function:

◆ testGetMinInfUtility()

void frodo2.algorithms.test.XCSPparserTest.testGetMinInfUtility ( )

Test method for getMinInfUtility().

References frodo2.solutionSpaces.AddableReal.add(), frodo2.solutionSpaces.AddableReal.equals(), and prob.

Here is the call graph for this function:

◆ testGetNbrNeighbors()

void frodo2.algorithms.test.XCSPparserTest.testGetNbrNeighbors ( )

Test method for XCSPparser.getNbrNeighbors(java.lang.String).

References getNeighborhoods(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom(), and prob.

Here is the call graph for this function:

◆ testGetNbrVars()

void frodo2.algorithms.test.XCSPparserTest.testGetNbrVars ( )

Test method for XCSPparser.getNbrVars().

References graph, and prob.

◆ testGetNbrVarsString()

void frodo2.algorithms.test.XCSPparserTest.testGetNbrVarsString ( )

Test method for XCSPparser.getNbrVars(java.lang.String).

References graph, and prob.

◆ testGetNeighborhoods() [1/2]

void frodo2.algorithms.test.XCSPparserTest.testGetNeighborhoods ( )

Test method for XCSPparser.getNeighborhoods(java.lang.String).

References testGetNeighborhoods().

Referenced by testGetAnonymNeighborhoods(), and testGetNeighborhoods().

Here is the call graph for this function:

◆ testGetNeighborhoods() [2/2]

void frodo2.algorithms.test.XCSPparserTest.testGetNeighborhoods ( final boolean onlyAnonymVars )

private

Test for XCSPparser.getNeighborhoods(java.lang.String) and XCSPparser.getAnonymNeighborhoods(java.lang.String).

Parameters

onlyAnonymVars whether we are only interested in random neighbors

References getNeighborhoods(), graph, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom(), and prob.

Here is the call graph for this function:

◆ testGetNeighborhoodSizes()

void frodo2.algorithms.test.XCSPparserTest.testGetNeighborhoodSizes ( )

Test method for XCSPparser.getNeighborhoodSizes(java.lang.String).

References getNeighborhoods(), graph, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom(), and prob.

Here is the call graph for this function:

◆ testGetNeighborVars() [1/2]

void frodo2.algorithms.test.XCSPparserTest.testGetNeighborVars ( )

Test method for XCSPparser.getNeighborVars(java.lang.String).

References testGetNeighborVars().

Referenced by testGetNeighborVars(), and testGetNeighborVarsWithAnonymVars().

Here is the call graph for this function:

◆ testGetNeighborVars() [2/2]

void frodo2.algorithms.test.XCSPparserTest.testGetNeighborVars ( boolean withAnonymVars )

Test for getNeighborVars.

Parameters

withAnonymVars if false, ignores variables with no specified owner

References getNeighborhoods(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom(), and prob.

Here is the call graph for this function:

◆ testGetNeighborVarsWithAnonymVars()

void frodo2.algorithms.test.XCSPparserTest.testGetNeighborVarsWithAnonymVars ( )

Test method for XCSPparser.getNeighborVars(java.lang.String, boolean).

References testGetNeighborVars().

Here is the call graph for this function:

◆ testGetOwner()

void frodo2.algorithms.test.XCSPparserTest.testGetOwner ( )

Test method for XCSPparser.getOwner(java.lang.String).

References graph, and prob.

◆ testGetOwners()

void frodo2.algorithms.test.XCSPparserTest.testGetOwners ( )

Test method for XCSPparser.getOwners().

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getOwners(), graph, and prob.

Here is the call graph for this function:

◆ testGetPlusInfUtility()

void frodo2.algorithms.test.XCSPparserTest.testGetPlusInfUtility ( )

Test method for getPlusInfUtility().

References frodo2.solutionSpaces.AddableReal.add(), frodo2.solutionSpaces.AddableReal.equals(), and prob.

Here is the call graph for this function:

◆ testGetProbabilitySpaces()

void frodo2.algorithms.test.XCSPparserTest.testGetProbabilitySpaces ( )

Test method for getProbabilitySpaces().

References prob, and probSpaces.

◆ testGetProbabilitySpacesForVar()

void frodo2.algorithms.test.XCSPparserTest.testGetProbabilitySpacesForVar ( )

Test method for getProbabilitySpaces(String).

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getProbabilitySpaces(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables(), graph, and prob.

Here is the call graph for this function:

◆ testGetSolutionSpaces() [1/2]

void frodo2.algorithms.test.XCSPparserTest.testGetSolutionSpaces ( )

Test method for getSolutionSpaces() ignoring random variables.

References frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable >.iterator(), frodo2.java, prob, and testGetSolutionSpaces().

Referenced by testGetSolutionSpaces(), testGetSolutionSpacesForVar(), and testGetSolutionSpacesWithRandVars().

Here is the call graph for this function:

◆ testGetSolutionSpaces() [2/2]

void frodo2.algorithms.test.XCSPparserTest.testGetSolutionSpaces	(	DCOPProblemInterface< AddableInteger, AddableReal >	problem,
		List< ? extends UtilitySolutionSpace< AddableInteger, AddableReal > >	refSpaces,
		String	var,
		final boolean	withRandVars )

protected

Test method for getSolutionSpaces(String, boolean).

Parameters

problem	the problem
refSpaces	the reference spaces
var	the variable
withRandVars	if `true`, also considers random variables

Todo: Test with default cost

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getSolutionSpaces().

Here is the call graph for this function:

◆ testGetSolutionSpacesForVar() [1/2]

void frodo2.algorithms.test.XCSPparserTest.testGetSolutionSpacesForVar ( )

Test method for getSolutionSpaces(String) ignoring random variables.

References frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable >.iterator(), frodo2.java, prob, and testGetSolutionSpacesForVar().

Referenced by testGetSolutionSpacesForVar(), and testGetSolutionSpacesForVarWithRandVars().

Here is the call graph for this function:

◆ testGetSolutionSpacesForVar() [2/2]

void frodo2.algorithms.test.XCSPparserTest.testGetSolutionSpacesForVar ( final boolean withRandVars )

private

Test method for getSolutionSpaces(String, boolean).

Parameters

withRandVars if true, considers random variables

Todo

Test with default cost

Test with and without forbidden vars

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables(), graph, prob, and testGetSolutionSpaces().

Here is the call graph for this function:

◆ testGetSolutionSpacesForVarWithRandVars()

void frodo2.algorithms.test.XCSPparserTest.testGetSolutionSpacesForVarWithRandVars ( )

Test method for getSolutionSpaces(String) with random variables.

References testGetSolutionSpacesForVar().

Here is the call graph for this function:

◆ testGetSolutionSpacesWithRandVars()

void frodo2.algorithms.test.XCSPparserTest.testGetSolutionSpacesWithRandVars ( )

Test method for getSolutionSpaces() with random variables.

References testGetSolutionSpaces().

Here is the call graph for this function:

◆ testGetSubProblem()

void frodo2.algorithms.test.XCSPparserTest.testGetSubProblem ( )

Test method for XCSPparser.getSubProblem(String).

References frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable >.getAgents(), getExtendedRandNeighbors(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getProbabilitySpaces(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getSolutionSpaces(), graph, and prob.

Here is the call graph for this function:

◆ testGetUtility()

void frodo2.algorithms.test.XCSPparserTest.testGetUtility ( )

Test for the method getUtility() on complete assignments.

References frodo2.solutionSpaces.AddableReal.add(), graph, and prob.

Here is the call graph for this function:

◆ testGetVariables()

void frodo2.algorithms.test.XCSPparserTest.testGetVariables ( )

Test method for XCSPparser.getVariables().

References graph, and prob.

◆ testGetVariablesString()

void frodo2.algorithms.test.XCSPparserTest.testGetVariablesString ( )

Test method for XCSPparser.getVariables(java.lang.String).

References graph, and prob.

◆ testGetZeroUtility()

void frodo2.algorithms.test.XCSPparserTest.testGetZeroUtility ( )

Test method for getZeroUtility().

References frodo2.solutionSpaces.AddableReal.add(), frodo2.solutionSpaces.AddableReal.equals(), and prob.

Here is the call graph for this function:

◆ testIsRandom()

void frodo2.algorithms.test.XCSPparserTest.testIsRandom ( ) throws JDOMException

Test method for frodo2.algorithms.XCSPparser.isRandom(java.lang.String).

Exceptions

JDOMException if an error occurred when reading the problem description

References prob, and probDoc.

◆ testMaximize()

void frodo2.algorithms.test.XCSPparserTest.testMaximize ( )

Test for the method maximize().

References frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.getAgents(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getSubProblem(), and frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.maximize().

Here is the call graph for this function:

◆ testSetDomain()

void frodo2.algorithms.test.XCSPparserTest.testSetDomain ( )

Tests the setDomain() method.

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getProbabilitySpaces(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.isRandom(), frodo2.solutionSpaces.AddableReal.multiply(), and frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.setDomain().

Here is the call graph for this function:

Member Data Documentation

◆ extendedRandNeighborhoods

boolean frodo2.algorithms.test.XCSPparserTest.extendedRandNeighborhoods

private

Whether we want extended random neighborhoods.

Referenced by XCSPparserTest().

◆ graph

RandGraphFactory.Graph frodo2.algorithms.test.XCSPparserTest.graph

protected

Random graph used to generate a constraint graph.

Referenced by setUp(), tearDown(), testGetAgentNeighborhoods(), testGetAgents(), testGetDomain(), testGetExtVars(), testGetNbrVars(), testGetNbrVarsString(), testGetNeighborhoods(), testGetNeighborhoodSizes(), testGetOwner(), testGetOwners(), testGetProbabilitySpacesForVar(), testGetSolutionSpacesForVar(), testGetSubProblem(), testGetUtility(), testGetVariables(), and testGetVariablesString().

◆ maximize

final boolean frodo2.algorithms.test.XCSPparserTest.maximize

private

Whether to test on maximization problems.

Referenced by XCSPparserTest().

◆ maxNbrAgents

final int frodo2.algorithms.test.XCSPparserTest.maxNbrAgents = 5

private

Maximum number of agents.

Referenced by setUp().

◆ maxNbrEdges

final int frodo2.algorithms.test.XCSPparserTest.maxNbrEdges = 100

private

Maximum number of edges in the random graph.

Referenced by setUp().

◆ maxNbrVars

final int frodo2.algorithms.test.XCSPparserTest.maxNbrVars = 15

private

Maximum number of variables in the random graph.

Note: Must be at least 2.

Referenced by setUp().

◆ parser

XCSPparser< AddableInteger, AddableReal > frodo2.algorithms.test.XCSPparserTest.parser

protected

The parser.

Referenced by setUp(), and tearDown().

◆ prob

DCOPProblemInterface<AddableInteger, AddableReal> frodo2.algorithms.test.XCSPparserTest.prob

protected

◆ probDoc

Document frodo2.algorithms.test.XCSPparserTest.probDoc

protected

Random XCSP problem.

Referenced by setUp(), tearDown(), testGetDomain(), and testIsRandom().

◆ probSpaces

ArrayList< Hypercube<AddableInteger, AddableReal> > frodo2.algorithms.test.XCSPparserTest.probSpaces = new ArrayList< Hypercube<AddableInteger, AddableReal> > ()

protected

The list of probability spaces in the problem.

Referenced by setUp(), and testGetProbabilitySpaces().

◆ publicAgents

boolean frodo2.algorithms.test.XCSPparserTest.publicAgents = false

private

Whether each agent knows the identities of all agents.

Referenced by XCSPparserTest().

◆ solutionSpaces

ArrayList< Hypercube<AddableInteger, AddableReal> > frodo2.algorithms.test.XCSPparserTest.solutionSpaces = new ArrayList< Hypercube<AddableInteger, AddableReal> > ()

protected

The list of solution spaces in the problem.

Referenced by setUp().

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

src/frodo2/algorithms/test/XCSPparserTest.java

Public Member Functions

Static Public Member Functions

Protected Member Functions

Protected Attributes

Private Member Functions

Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ XCSPparserTest() [1/3]

◆ XCSPparserTest() [2/3]

◆ XCSPparserTest() [3/3]

Member Function Documentation

◆ getExtendedRandNeighbors()

◆ getNeighborhoods()

◆ setUp()

◆ suite()

◆ tearDown()

◆ testGetAgentNeighborhoods()

◆ testGetAgents()

◆ testGetAnonymNeighborhoods()

◆ testGetDomain()

◆ testGetDomainSize()

◆ testGetExtVars()

◆ testGetMinInfUtility()

◆ testGetNbrNeighbors()

◆ testGetNbrVars()

◆ testGetNbrVarsString()

◆ testGetNeighborhoods() [1/2]

◆ testGetNeighborhoods() [2/2]

◆ testGetNeighborhoodSizes()

◆ testGetNeighborVars() [1/2]

◆ testGetNeighborVars() [2/2]

◆ testGetNeighborVarsWithAnonymVars()

◆ testGetOwner()

◆ testGetOwners()

◆ testGetPlusInfUtility()

◆ testGetProbabilitySpaces()

◆ testGetProbabilitySpacesForVar()

◆ testGetSolutionSpaces() [1/2]

◆ testGetSolutionSpaces() [2/2]

◆ testGetSolutionSpacesForVar() [1/2]

◆ testGetSolutionSpacesForVar() [2/2]

◆ testGetSolutionSpacesForVarWithRandVars()

◆ testGetSolutionSpacesWithRandVars()

◆ testGetSubProblem()

◆ testGetUtility()

◆ testGetVariables()

◆ testGetVariablesString()

◆ testGetZeroUtility()

◆ testIsRandom()

◆ testMaximize()

◆ testSetDomain()

Member Data Documentation

◆ extendedRandNeighborhoods

◆ graph

◆ maximize

◆ maxNbrAgents

◆ maxNbrEdges

◆ maxNbrVars

◆ parser

◆ prob

◆ probDoc

◆ probSpaces

◆ publicAgents

◆ solutionSpaces