|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|
JUnit test for P_DPOP agent. More...

Public Member Functions | |
| P2_DPOPagentTest (Class< V > domClass, Class< ? extends CryptoScheme< AddableInteger, E, ?> > schemeClass, Class< E > classOfE, boolean mergeBack, boolean minNCCCs, boolean useTCP, boolean maximize, int sign) | |
| Constructor. | |
| P2_DPOPagentTest (Class< V > domClass, Class< ? extends CryptoScheme< AddableInteger, E, ?> > schemeClass, Class< E > classOfE, boolean mergeBack, boolean minNCCCs, boolean useTCP) | |
| Constructor. | |
| void | test () throws JDOMException, IOException |
| Test whenever P-DPOP's and DPOP's answers to a random problem are equivalent. | |
Static Public Member Functions | |
| static TestSuite | suite () |
Protected Attributes | |
| int | maxVar = 5 |
| The maximum number of variables in this problem. | |
| int | maxAgent = 5 |
| The maximum number of agents in this problem. | |
| int | maxEdge = 10 |
| The maximum number of constraints in this problem. | |
| Class< ? extends CryptoScheme< AddableInteger, E, ?> > | schemeClass |
| The class of the CryptoScheme. | |
| Class< V > | domClass |
| The class used for variable values. | |
| final boolean | mergeBack |
| Whether to enable the merging of back-edges. | |
| final boolean | minNCCCs |
| Whether to minimize the NCCC. | |
| final boolean | useTCP |
| Whether to use TCP pipes. | |
Private Attributes | |
| Class< E > | classOfE |
| The class used for encrypted values. | |
| final boolean | maximize |
| Whether to test on a maximization or a minimization problem. | |
| final int | sign |
| The sign of the costs/utilities in the test problem instance. | |
JUnit test for P_DPOP agent.
| <V> | the type used for variable values |
| <E> | The class used for encrypted values |
| frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >.P2_DPOPagentTest | ( | Class< V > | domClass, |
| Class< ? extends CryptoScheme< AddableInteger, E, ?> > | schemeClass, | ||
| Class< E > | classOfE, | ||
| boolean | mergeBack, | ||
| boolean | minNCCCs, | ||
| boolean | useTCP, | ||
| boolean | maximize, | ||
| int | sign ) |
Constructor.
| schemeClass | The class of the CryptoScheme |
| domClass | The class used for variable values |
| classOfE | The class used for encrypted values |
| mergeBack | Whether to enable the merging of back-edges |
| minNCCCs | Whether to minimize the NCCC |
| useTCP | Whether to use TCP pipes |
| maximize | Whether to test on a maximization or a minimization problem |
| sign | The sign of the costs/utilities in the test problem instance |
References classOfE, domClass, maximize, mergeBack, minNCCCs, schemeClass, sign, and useTCP.
Referenced by suite().
| frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >.P2_DPOPagentTest | ( | Class< V > | domClass, |
| Class< ? extends CryptoScheme< AddableInteger, E, ?> > | schemeClass, | ||
| Class< E > | classOfE, | ||
| boolean | mergeBack, | ||
| boolean | minNCCCs, | ||
| boolean | useTCP ) |
Constructor.
| schemeClass | The class of the CryptoScheme |
| domClass | The class used for variable values |
| classOfE | The class used for encrypted values |
| mergeBack | Whether to enable the merging of back-edges |
| minNCCCs | Whether to minimize the NCCC |
| useTCP | Whether to use TCP pipes |
References classOfE, domClass, mergeBack, minNCCCs, schemeClass, and useTCP.
|
static |
References P2_DPOPagentTest().
Referenced by frodo2.algorithms.dpop.privacy.test.AllTestsP_DPOP.suite().

| void frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >.test | ( | ) | throws JDOMException, IOException |
Test whenever P-DPOP's and DPOP's answers to a random problem are equivalent.
| IOException | is thrown if an I/O exception occur when accessing to the description of P-DPOP or DPOP algorithm |
| JDOMException | is thrown if a parsing error occurs |
References frodo2.algorithms.test.AllTests.createRandProblem(), frodo2.algorithms.Solution< V, U >.getAssignments(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getNbrVars(), frodo2.algorithms.Solution< V, U >.getReportedUtil(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces(), frodo2.algorithms.Solution< V, U >.getUtility(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getUtility(), maxAgent, maxEdge, maximize, maxVar, frodo2.solutionSpaces.AddableInteger.multiply(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.parse(), sign, frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve(), and frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.solve().

|
private |
The class used for encrypted values.
Referenced by P2_DPOPagentTest(), and P2_DPOPagentTest().
|
protected |
The class used for variable values.
Referenced by P2_DPOPagentTest(), and P2_DPOPagentTest().
|
protected |
The maximum number of agents in this problem.
Referenced by test().
|
protected |
The maximum number of constraints in this problem.
Referenced by test().
|
private |
Whether to test on a maximization or a minimization problem.
Referenced by P2_DPOPagentTest(), and test().
|
protected |
The maximum number of variables in this problem.
Referenced by test().
|
protected |
Whether to enable the merging of back-edges.
Referenced by P2_DPOPagentTest(), and P2_DPOPagentTest().
|
protected |
Whether to minimize the NCCC.
Referenced by P2_DPOPagentTest(), and P2_DPOPagentTest().
|
protected |
The class of the CryptoScheme.
Referenced by P2_DPOPagentTest(), and P2_DPOPagentTest().
|
private |
The sign of the costs/utilities in the test problem instance.
Referenced by P2_DPOPagentTest(), and test().
|
protected |
Whether to use TCP pipes.
Referenced by P2_DPOPagentTest(), and P2_DPOPagentTest().