| Cfrodo2.benchmarks.kidneys.KidneyExchange.ABO | Blood types |
| Cfrodo2.algorithms.AbstractProblem< V, U > | |
| Cfrodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | A ProblemInterface that does not require the use of the XCSP format |
| Cfrodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U > | A solver for a general problem |
| Cfrodo2.algorithms.AbstractSolver< DCOPProblemInterface< V, U >, V, U, S > | |
| Cfrodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U > | An abstract convenient class for solving DCOP instances |
| Cfrodo2.algorithms.adopt.ADOPTsolver< V extends Addable< V >, U extends Addable< U > > | A DCOP solver using ADOPT |
| Cfrodo2.algorithms.afb.AFBsolver< V extends Addable< V >, U extends Addable< U > > | A DCOP solver using AFB |
| Cfrodo2.algorithms.asodpop.ASODPOPsolver< V extends Addable< V >, U extends Addable< U > > | This is a solver that reads in the problem, creates the agents, runs the problem and then collects the statistics |
| Cfrodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > > | A DCOP solver using DPOP |
| Cfrodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > > | A DCOP solver using Param-DPOP |
| Cfrodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > > | A DCOP solver using P2-DPOP |
| Cfrodo2.algorithms.dpop.privacy.P_DPOPsolver< V extends Addable< V > > | A DCOP solver using P-DPOP |
| Cfrodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > > | A StochDCOP solver using E[DPOP] |
| Cfrodo2.algorithms.duct.DUCTsolver< V extends Addable< V > > | A DCOP solver using DUCT |
| Cfrodo2.algorithms.localSearch.dsa.DSAsolver< V extends Addable< V >, U extends Addable< U > > | This is a solver that reads in the problem, creates the agents, runs the problem and then collects the statistics |
| Cfrodo2.algorithms.localSearch.mgm.MGMsolver< V extends Addable< V >, U extends Addable< U > > | This is a solver that reads in the problem, creates the agents, runs the problem and then collects the statistics |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.MGM2solver< V extends Addable< V >, U extends Addable< U > > | This is a solver that reads in the problem, creates the agents, runs the problem and then collects the statistics |
| Cfrodo2.algorithms.maxsum.MaxSumSolver< V extends Addable< V >, U extends Addable< U > > | A solver for Max-Sum |
| Cfrodo2.algorithms.mpc_discsp.MPC_DisWCSP4solver< V extends Addable< V >, U extends Addable< U > > | A solver for MPC-Dis(W)CSP4 |
| Cfrodo2.algorithms.odpop.ODPOPsolver< V extends Addable< V >, U extends Addable< U > > | A DCOP solver using O-DPOP |
| Cfrodo2.algorithms.synchbb.SynchBBsolver< V extends Addable< V >, U extends Addable< U > > | A DCOP solver using SynchBB |
| CAbsXeqY | |
| Corg.jacop.constraints.AbsXeqYCloneable | A cloneable version of the AbsXeqY constraint |
| CActionListener | |
| Cfrodo2.gui.DOTrenderer | Renders and displays DOT code |
| Cfrodo2.gui.SimpleGUI | A simple GUI to configure and start FRODO |
| Cfrodo2.gui.VisualizerControls | A GUI to control how long messages are displayed |
| Cfrodo2.gui.jung.JungVisualizer | A Visualizer using JUNG2 |
| Cfrodo2.solutionSpaces.Addable< AddableBigDecimal > | |
| Cfrodo2.solutionSpaces.AddableBigDecimal | An arbitrary-precision real number that implements Addable |
| Cfrodo2.solutionSpaces.AddableBigDecimal.MinInfinity | This class implements the minus infinity element |
| Cfrodo2.solutionSpaces.AddableBigDecimal.PlusInfinity | This class implements the plus infinity element |
| Cfrodo2.solutionSpaces.Addable< AddableConflicts< U > > | |
| Cfrodo2.solutionSpaces.AddableConflicts< U extends Addable< U > > | |
| Cfrodo2.solutionSpaces.Addable< AddableInteger > | |
| Cfrodo2.solutionSpaces.AddableInteger | |
| Cfrodo2.solutionSpaces.AddableInteger.MinInfinity | This class implements the minus infinity element |
| Cfrodo2.solutionSpaces.AddableInteger.PlusInfinity | This class implements the plus infinity element |
| Cfrodo2.solutionSpaces.Addable< AddableReal > | |
| Cfrodo2.solutionSpaces.AddableReal | Class representing a real number |
| Cfrodo2.solutionSpaces.AddableReal.MinInfinity | A singleton class representing the real number -infinity |
| Cfrodo2.solutionSpaces.AddableReal.PlusInfinity | A singleton class representing the real number +infinity |
| Cfrodo2.solutionSpaces.AddableDelayed< T extends Addable< T > > | |
| Cfrodo2.solutionSpaces.crypto.AddableBigInteger.AddableBigIntegerDelayed | Class used to speed up n-ary additions and multiplications |
| Cfrodo2.solutionSpaces.AddableDelayed< AddableBigDecimal > | |
| Cfrodo2.solutionSpaces.AddableBigDecimal.AddableBigDecimalDelayed | Class used to speed up n-ary additions and multiplications |
| Cfrodo2.solutionSpaces.AddableDelayed< AddableInteger > | |
| Cfrodo2.solutionSpaces.AddableInteger.AddableIntegerDelayed | Class used to make the addition of a large number of integers more efficient |
| Cfrodo2.solutionSpaces.AddableDelayed< AddableReal > | |
| Cfrodo2.solutionSpaces.AddableReal.AddableRealDelayed | Class used to make the addition of a large number of reals more efficient |
| Cfrodo2.solutionSpaces.AddableLimited< T, T > | |
| Cfrodo2.solutionSpaces.Addable< T extends Addable< T > > | Defines the methods add() and also multiply() |
| Cfrodo2.solutionSpaces.crypto.AddableBigInteger | An Addable number based on a BigInteger |
| Cfrodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity | This class implements the minus infinity element |
| Cfrodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity | This class implements the plus infinity element |
| Cfrodo2.algorithms.afb.AFBBaseMsg< V, U > | |
| Cfrodo2.algorithms.afb.CPAmsg< V extends Addable< V >, U extends Addable< U > > | The message containing the current partial assignment in AFB |
| Cfrodo2.algorithms.afb.FbCpaMsg< V extends Addable< V >, U extends Addable< U > > | The FB_CPA message in AFB |
| Cfrodo2.algorithms.afb.FbEstimateMsg< V extends Addable< V >, U extends Addable< U > > | The FB_ESTIMATE message in AFB |
| Cfrodo2.algorithms.AgentInterface< V extends Addable< V > > | All agents corresponding to various algorithms should implement this interface |
| Cfrodo2.daemon.TestLocalWhitePages.SimpleAgent | A simple agent for testing purposes |
| Cfrodo2.algorithms.AgentInterface< Val > | |
| Cfrodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > > | An agent that uses a single queue |
| Cfrodo2.controller.testFiles.TestAgent< V extends Addable< V > > | Does the following: |
| Cfrodo2.algorithms.heuristics.AgentScoringHeuristic< S extends Comparable< S > &Serializable > | Interface for a heuristic that associates a score to every agent |
| Cfrodo2.algorithms.heuristics.AgentScoringHeuristic< String > | |
| Cfrodo2.algorithms.heuristics.AgentNameHeuristic | A scoring heuristic that returns the agent's name |
| Cfrodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.Algorithm | The different algorithms to be tested |
| CAlldiff | |
| Corg.jacop.constraints.AlldiffCloneable | A cloneable version of the Alldiff constraint |
| CAlldifferent | |
| Corg.jacop.constraints.AlldifferentCloneable | A cloneable version of the Alldifferent constraint |
| CAlldistinct | |
| Corg.jacop.constraints.AlldistinctCloneable | A cloneable version of the Alldistinct constraint |
| CAllEqual | |
| Corg.jacop.constraints.AllEqualCloneable | A Cloneable version of the AllEqual constraint |
| Cfrodo2.algorithms.test.AllTests | JUnit test suite for all the tests in frodo2.algorithms.dpop.test |
| Cfrodo2.communication.AllTests | JUnit test suite for all unit tests in this package |
| Cfrodo2.controller.AllTests | JUnit test suite for all unit tests in this package |
| Cfrodo2.daemon.AllTests | JUnit test suite for all unit tests in this package |
| Cfrodo2.algorithms.adopt.test.AllTestsADOPT | Test suite for all ADOPT tests |
| Cfrodo2.algorithms.afb.test.AllTestsAFB | JUnit test suite for all the tests in frodo2.algorithms.afb.test |
| Cfrodo2.algorithms.varOrdering.dfs.tests.AllTestsDFS | JUnit test suite for all the tests in frodo2.algorithms.varOrdering.dfs.tests |
| Cfrodo2.algorithms.dpop.test.AllTestsDPOP | JUnit test suite for all the tests in frodo2.algorithms.dpop.test |
| Cfrodo2.algorithms.varOrdering.election.tests.AllTestsElection | JUnit test suite for all the tests in frodo2.algorithms.varOrdering.election.tests |
| Cfrodo2.solutionSpaces.hypercube.tests.AllTestsHypercube | The hypercube tests |
| Cfrodo2.solutionSpaces.JaCoP.tests.AllTestsJaCoP | The JaCoP tests |
| Cfrodo2.algorithms.dpop.privacy.test.AllTestsP_DPOP | JUnit test suite for all the tests in frodo2.algorithms.dpop.privacy.test |
| Cfrodo2.algorithms.dpop.param.test.AllTestsParamDPOP | JUnit test suite for all the tests in frodo2.algorithms.dpop.param.test |
| Cfrodo2.algorithms.dpop.restart.test.AllTestsS_DPOP | JUnit test suite for all the tests in frodo2.algorithms.dpop.restart.test |
| Cfrodo2.solutionSpaces.tests.AllTestsSpaces | All solution spaces tests |
| Cfrodo2.algorithms.dpop.stochastic.test.AllTestsStochDPOP | JUnit test suite for all the tests in frodo2.algorithms.dpop.stochastic.test |
| Cfrodo2.algorithms.synchbb.test.AllTestsSynchBB | JUnit test suite for all the tests in frodo2.algorithms.synchbb.test |
| CAmong | |
| Corg.jacop.constraints.AmongCloneable | A cloneable version of the Among constraint |
| CAmongVar | |
| Corg.jacop.constraints.AmongVarCloneable | A cloneable version of the AmongVar constraint |
| CAnd | |
| Corg.jacop.constraints.AndCloneable | A cloneable version of the And constraint |
| CAndBool | |
| Corg.jacop.constraints.AndBoolCloneable | A cloneable version of the AndBool constraint |
| CAndBoolSimple | |
| Corg.jacop.constraints.AndBoolSimpleCloneable | A cloneable version of the AndBoolSimple constraint |
| CAndBoolVector | |
| Corg.jacop.constraints.AndBoolVectorCloneable | A cloneable version of the AndBoolVector constraint |
| CArgMax | |
| Corg.jacop.constraints.ArgMaxCloneable | A cloneable version of the ArgMax constraint |
| CArgMin | |
| Corg.jacop.constraints.ArgMinCloneable | A cloneable version of the ArgMin constraint |
| CArithmetic | |
| Corg.jacop.constraints.netflow.ArithmeticCloneable | A cloneable version of the Arithmetic constraint |
| Cfrodo2.algorithms.asodpop.ASODPOPsolver< V, U > | |
| Cfrodo2.algorithms.asodpop.ASODPOPBinarysolver< V extends Addable< V >, U extends Addable< U > > | This is a solver that reads in the problem, creates the agents, runs the problem and then collects the statistics |
| CAssignment | |
| Corg.jacop.constraints.AssignmentCloneable | A cloneable version of the Assignment constraint |
| Cfrodo2.algorithms.odpop.Assignment< Val extends Addable< Val > > | Class to hold an assignment of variables |
| Cfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >.Assignment< U extends Addable< U > > | Class containing a single assignment with its utility |
| Cfrodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val, U > | |
| Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > > | Assignment message used to reported the variables assignment and some statistics about the run |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U > | |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > > | A version of the SamplingPhase in which the sampling for all random variables is performed at the roots |
| CAtLeast | |
| Corg.jacop.constraints.AtLeastCloneable | A cloneable version of the AtLeast constraint |
| CAtMost | |
| Corg.jacop.constraints.AtMostCloneable | A cloneable version of the AtMost constraint |
| Cfrodo2.benchmarks.auctions.cats.Auction | This class represents an auction generated by the CATS program |
| Cfrodo2.solutionSpaces.hypercube.BasicHypercube< V, U > | |
| Cfrodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable > | A BasicHypercube that contains only one utility, and no variables |
| Cfrodo2.solutionSpaces.hypercube.BasicHypercube< V, UL > | |
| Cfrodo2.solutionSpaces.hypercube.HypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL > | A Hypercube whose utilities are AddableLimited's |
| Cfrodo2.solutionSpaces.hypercube.BasicHypercubeIter< V, U > | |
| Cfrodo2.solutionSpaces.hypercube.HypercubeIter< V extends Addable< V >, U extends Addable< U > > | An iterator for a Hypercube |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter< U extends Addable< U > > | A solution iterator for JaCoPutilSpace |
| Cfrodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL > | |
| Cfrodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL > | A UtilitySolutionSpace whose utilities implement AddableLimited |
| Cfrodo2.solutionSpaces.hypercube.HypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL > | A Hypercube whose utilities are AddableLimited's |
| Cfrodo2.benchmarks.auctions.cats.Bid | This class represents a bid placed in an auction |
| Cfrodo2.benchmarks.auctions.cats.Bidder | This class represents a bidder in the auction |
| CBinpacking | |
| Corg.jacop.constraints.binpacking.BinpackingCloneable | A cloneable version of the Binpacking constraint |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.BlindScoringHeuristic< S > | |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable > | Selects the next child as the one that has the highest score |
| CBoolClause | |
| Corg.jacop.constraints.BoolClauseCloneable | A cloneable version of the BoolClause constraint |
| Cfrodo2.algorithms.duct.bound.Bound< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.bound.Bound< V > | |
| Cfrodo2.algorithms.duct.bound.BoundInvLog< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.bound.BoundLog< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.bound.BoundLogSize< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.bound.BoundSqrt< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.bound.BoundSqrtSize< V extends Addable< V > > | |
| Cfrodo2.benchmarks.auctions.main.CATSToXCSP | This is the main class for converting a CATS (Combinatorial Auctions Test Suite) into a DCOP (Distributed Constraint Optimization Problem) |
| Cfrodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V, U > | |
| Cfrodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom< V extends Addable< V >, U extends Addable< U > > | A linear ordering heuristic that chooses first variables with highest numbers of links with previous variables, breaking ties by minimizing domain size |
| CChangeListener | |
| Cfrodo2.gui.VisualizerControls.MsgTypeSetting | A message type and its slider |
| CChannelImply | |
| Corg.jacop.constraints.ChannelImplyCloneable | A cloneable variant of the ChannelImply constraint |
| CChannelReif | |
| Corg.jacop.constraints.ChannelReifCloneable | A cloneable variant of the ChannelReif constraint |
| CCircuit | |
| Corg.jacop.constraints.CircuitCloneable | A cloneable version of the Circuit constraint |
| CCloneable | |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > > | A DCOP problem that is defined using JaCoP variables and constraints |
| Cfrodo2.solutionSpaces.SolutionSpace< V extends Addable< V > > | This interface defines common functionalities in all solution spaces |
| Corg.jacop.constraints.geost.ShapeCloneable | A cloneable version of Shape |
| Corg.jacop.util.fsm.FSMCloneable | A cloneable FSM |
| Corg.jacop.core.CloneableInto< V > | An interface for JaCoP variables that are cloneable into another store |
| Corg.jacop.core.CloneableInto< IntVarCloneable > | |
| Corg.jacop.core.IntVarCloneable | A JaCoP IntVar that is cloneable into a store |
| Cfrodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo | Information about a cluster of variables owned by this agent |
| Cfrodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo | A convenience class used to store information about a cluster |
| Cfrodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo | The information about a given variable |
| Cfrodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo | Information about a cluster of variables owned by this agent |
| CComparable | |
| Cfrodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger | A wrapper around a BigInteger so that it implements AddableLimited |
| Cfrodo2.algorithms.heuristics.ScorePair< S1 extends Comparable< S1 > &Serializable, S2 extends Comparable< S2 > &Serializable > | A pair of scores, the second being used for tiebreaking |
| Cfrodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >.Assignment< Val extends Addable< Val >, U extends Addable< U > > | Convenience class to store assignment/utility combinations in a priority queue |
| Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.IntIntStringTuple | An (int, int, String) tuple |
| Cfrodo2.communication.MessageType | The (hierarchical) type of a message |
| Cfrodo2.solutionSpaces.Addable< T extends Addable< T > > | Defines the methods add() and also multiply() |
| Cfrodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.CustomerAssignment< U extends Addable< U > > | Convenience class used by the iterator |
| CComparator | |
| Cfrodo2.communication.mailer.CentralMailer.TimestampComparator | A comparator used in the PriorityQueue to order messages according to their timestamps |
| Cfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >.MaximizeComp< U extends Addable< U > > | Comparator used when maximizing |
| Cfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >.MinimizeComp< U extends Addable< U > > | Comparator used when minimizing |
| Cfrodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo | The information about a particular component of the constraint graph |
| Cfrodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo | The information about a particular component of the constraint graph |
| Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.ComponentInfo | All relevant information about a connected component of the constraint graph |
| CConditional | |
| Corg.jacop.constraints.ConditionalCloneable | A cloneable version of Conditional |
| CConsistencyListener | |
| Cfrodo2.solutionSpaces.JaCoP.IterSolutionListener< V extends Addable< V > > | This solution listener is a part of the JaCoPutilSpace iterator that allows us to simulate a JaCoP master/slave search combination where the slave is an optimization search while the master is not |
| CConstraint | |
| Cfrodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube | A JaCoP extensional constraint encoded by a hypercube for faster lookups |
| Corg.jacop.constraints.ConstraintCloneableInterface< C extends DecomposedConstraint<? extends Constraint > > | A constraint is clonable if a state-less copy of it can be created into a target store |
| Cfrodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube | A JaCoP extensional constraint encoded by a hypercube for faster lookups |
| Cfrodo2.solutionSpaces.JaCoP.Predicate | Predicate wrapper that translates a predicate expression from XCSP into constraints available in JaCoP |
| Corg.jacop.constraints.binpacking.BinpackingCloneable | A cloneable version of the Binpacking constraint |
| Corg.jacop.constraints.cumulative.CumulativeBasicCloneable | A cloneable version of the CumulativeBasic constraint |
| Corg.jacop.constraints.cumulative.CumulativeCloneable | A cloneable version of the Cumulative constraint |
| Corg.jacop.constraints.cumulative.CumulativeOptionalCloneable | A Cloneable version of CumulativeOptional |
| Corg.jacop.constraints.cumulative.CumulativePrimaryCloneable | A cloneable version of the CumulativePrimary constraint |
| Corg.jacop.constraints.cumulative.CumulativeUnaryCloneable | A cloneable version of the CumulativeUnary constraint |
| Corg.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable | A Cloneable variant of CumulativeUnaryOptional |
| Corg.jacop.constraints.diffn.DiffnCloneable | A cloneable version of the Diffn constraint |
| Corg.jacop.constraints.diffn.DiffnDecomposedCloneable | A cloneable version of the DiffnDecomposed constraint |
| Corg.jacop.constraints.diffn.NooverlapCloneable | A cloneable version of the Nooverlap constraint |
| Corg.jacop.constraints.geost.GeostCloneable | A cloneable version of the Geost constraint |
| Corg.jacop.constraints.knapsack.KnapsackCloneable | A cloneable version of the Knapsack constraint |
| Corg.jacop.constraints.netflow.ArithmeticCloneable | A cloneable version of the Arithmetic constraint |
| Corg.jacop.constraints.netflow.NetworkFlowCloneable | A cloneable version of the NetworkFlow constraint |
| Corg.jacop.constraints.regular.RegularCloneable | A cloneable version of the Regular constraint |
| Corg.jacop.constraints.table.SimpleTableCloneable | A cloneable version of the SimpleTable constraint |
| Corg.jacop.constraints.table.TableCloneable | A cloneable version Table constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AbsXeqYCloneable > | |
| Corg.jacop.constraints.AbsXeqYCloneable | A cloneable version of the AbsXeqY constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AlldiffCloneable > | |
| Corg.jacop.constraints.AlldiffCloneable | A cloneable version of the Alldiff constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AlldifferentCloneable > | |
| Corg.jacop.constraints.AlldifferentCloneable | A cloneable version of the Alldifferent constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AlldistinctCloneable > | |
| Corg.jacop.constraints.AlldistinctCloneable | A cloneable version of the Alldistinct constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AllEqualCloneable > | |
| Corg.jacop.constraints.AllEqualCloneable | A Cloneable version of the AllEqual constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AmongCloneable > | |
| Corg.jacop.constraints.AmongCloneable | A cloneable version of the Among constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AmongVarCloneable > | |
| Corg.jacop.constraints.AmongVarCloneable | A cloneable version of the AmongVar constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AndBoolCloneable > | |
| Corg.jacop.constraints.AndBoolCloneable | A cloneable version of the AndBool constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AndBoolSimpleCloneable > | |
| Corg.jacop.constraints.AndBoolSimpleCloneable | A cloneable version of the AndBoolSimple constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AndBoolVectorCloneable > | |
| Corg.jacop.constraints.AndBoolVectorCloneable | A cloneable version of the AndBoolVector constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AndCloneable > | |
| Corg.jacop.constraints.AndCloneable | A cloneable version of the And constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ArgMaxCloneable > | |
| Corg.jacop.constraints.ArgMaxCloneable | A cloneable version of the ArgMax constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ArgMinCloneable > | |
| Corg.jacop.constraints.ArgMinCloneable | A cloneable version of the ArgMin constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AssignmentCloneable > | |
| Corg.jacop.constraints.AssignmentCloneable | A cloneable version of the Assignment constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AtLeastCloneable > | |
| Corg.jacop.constraints.AtLeastCloneable | A cloneable version of the AtLeast constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< AtMostCloneable > | |
| Corg.jacop.constraints.AtMostCloneable | A cloneable version of the AtMost constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< BoolClauseCloneable > | |
| Corg.jacop.constraints.BoolClauseCloneable | A cloneable version of the BoolClause constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ChannelImplyCloneable > | |
| Corg.jacop.constraints.ChannelImplyCloneable | A cloneable variant of the ChannelImply constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ChannelReifCloneable > | |
| Corg.jacop.constraints.ChannelReifCloneable | A cloneable variant of the ChannelReif constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< CircuitCloneable > | |
| Corg.jacop.constraints.CircuitCloneable | A cloneable version of the Circuit constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< Constraint > | |
| Corg.jacop.constraints.ConditionalCloneable | A cloneable version of Conditional |
| Corg.jacop.constraints.ConstraintCloneableInterface< CountBoundsCloneable > | |
| Corg.jacop.constraints.CountBoundsCloneable | A cloneable version of the CountBounds constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< CountCloneable > | |
| Corg.jacop.constraints.CountCloneable | A cloneable version of the Count constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< CountValuesBoundsCloneable > | |
| Corg.jacop.constraints.CountValuesBoundsCloneable | A cloneable version of the CountValuesBounds constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< CountValuesCloneable > | |
| Corg.jacop.constraints.CountValuesCloneable | A cloneable version of the CountValues constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< CountVarCloneable > | |
| Corg.jacop.constraints.CountVarCloneable | A cloneable version of the CountVar constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< CumulativeCloneable > | |
| Corg.jacop.constraints.CumulativeCloneable | A cloneable version of the Cumulative constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< DecreasingCloneable > | |
| Corg.jacop.constraints.DecreasingCloneable | A cloneable variant of the Decreasing constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< Diff2Cloneable > | |
| Corg.jacop.constraints.Diff2Cloneable | A cloneable version of the Diff2 constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< DiffCloneable > | |
| Corg.jacop.constraints.DiffCloneable | A cloneable version of the Diff constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< DisjointCloneable > | |
| Corg.jacop.constraints.DisjointCloneable | A cloneable version of the Disjoint constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< DisjointConditionalCloneable > | |
| Corg.jacop.constraints.DisjointConditionalCloneable | A cloneable version of the DisjointConditional constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< DistanceCloneable > | |
| Corg.jacop.constraints.DistanceCloneable | A Cloneable version of the Distance constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ElementIntegerCloneable > | |
| Corg.jacop.constraints.ElementIntegerCloneable | A cloneable version of the ElementInteger constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ElementIntegerFastCloneable > | |
| Corg.jacop.constraints.ElementIntegerFastCloneable | A cloneable version of the ElementIntegerFast constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ElementVariableCloneable > | |
| Corg.jacop.constraints.ElementVariableCloneable | A cloneable version of the ElementVariable constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ElementVariableFastCloneable > | |
| Corg.jacop.constraints.ElementVariableFastCloneable | A cloneable version of the ElementVariableFast constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< EqBoolCloneable > | |
| Corg.jacop.constraints.EqBoolCloneable | A cloneable version of the EqBool constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalConflictVACloneable > | |
| Corg.jacop.constraints.ExtensionalConflictVACloneable | A cloneable version of the ExtensionalConflictVA constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalSupportMDDCloneable > | |
| Corg.jacop.constraints.ExtensionalSupportMDDCloneable | A cloneable version of the ExtensionalSupportMDD constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalSupportSTRCloneable > | |
| Corg.jacop.constraints.ExtensionalSupportSTRCloneable | A cloneable version of the ExtensionalSupportSTR constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ExtensionalSupportVACloneable > | |
| Corg.jacop.constraints.ExtensionalSupportVACloneable | A cloneable version of the ExtensionalSupportVA constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< GCCCloneable > | |
| Corg.jacop.constraints.GCCCloneable | A cloneable version of the GCC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< IfThenBoolCloneable > | |
| Corg.jacop.constraints.IfThenBoolCloneable | A cloneable version of the IfThenBool constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< InCloneable > | |
| Corg.jacop.constraints.InCloneable | A cloneable version of the In constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< IncreasingCloneable > | |
| Corg.jacop.constraints.IncreasingCloneable | A cloneable variant of the Increasing constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< LexCloneable > | |
| Corg.jacop.constraints.LexCloneable | A cloneable version of the Lex constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< LexOrderCloneable > | |
| Corg.jacop.constraints.LexOrderCloneable | A cloneable version of the LexOrder constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< LinearIntCloneable > | |
| Corg.jacop.constraints.LinearIntCloneable | A cloneable LinearInt constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< LinearIntDomCloneable > | |
| Corg.jacop.constraints.LinearIntDomCloneable | A cloneable version of the LinearIntDom constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< MaxCloneable > | |
| Corg.jacop.constraints.MaxCloneable | A cloneable version of the Max constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< MaxSimpleCloneable > | |
| Corg.jacop.constraints.MaxSimpleCloneable | A cloneable version of the MaxSimple constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< MemberCloneable > | |
| Corg.jacop.constraints.MemberCloneable | A cloneable version of the Member constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< MinCloneable > | |
| Corg.jacop.constraints.MinCloneable | A cloneable version of the Min constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< MinSimpleCloneable > | |
| Corg.jacop.constraints.MinSimpleCloneable | A cloneable version of the MinSimple constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< NoGoodCloneable > | |
| Corg.jacop.constraints.NoGoodCloneable | A cloneable version of the NoGood constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< NotCloneable > | |
| Corg.jacop.constraints.NotCloneable | A cloneable version of the Not constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< OrBoolCloneable > | |
| Corg.jacop.constraints.OrBoolCloneable | A cloneable variant of the OrBool constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< OrBoolSimpleCloneable > | |
| Corg.jacop.constraints.OrBoolSimpleCloneable | A cloneable version of the OrBoolSimple constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< OrBoolVectorCloneable > | |
| Corg.jacop.constraints.OrBoolVectorCloneable | A cloneable variant of the OrBoolVector constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< OrCloneable > | |
| Corg.jacop.constraints.OrCloneable | A cloneable version of the Or constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< PrimitiveConstraint > | |
| Corg.jacop.constraints.EqCloneable | A cloneable version of the Eq constraint |
| Corg.jacop.constraints.IfThenCloneable | A cloneable version of the IfThen constraint |
| Corg.jacop.constraints.IfThenElseCloneable | A cloneable version of the IfThenElse constraint |
| Corg.jacop.constraints.ImpliesCloneable | A cloneable version of the Implies constraint |
| Corg.jacop.constraints.ReifiedCloneable | A cloneable version of the Reified constraint |
| Corg.jacop.constraints.XorCloneable | A cloneable version of the Xor constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SeqPrecedeChainCloneable > | |
| Corg.jacop.constraints.SeqPrecedeChainCloneable | A Cloneable version of the SeqPrecedeChain constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SequenceCloneable > | |
| Corg.jacop.constraints.SequenceCloneable | A cloneable version of the Sequence constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SoftAlldifferentCloneable > | |
| Corg.jacop.constraints.SoftAlldifferentCloneable | A cloneable version of the SoftAllDifferent constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SoftGCCCloneable > | |
| Corg.jacop.constraints.SoftGCCCloneable | A cloneable version of the SoftGCC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< StretchCloneable > | |
| Corg.jacop.constraints.StretchCloneable | A cloneable version of the Stretch constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SubcircuitCloneable > | |
| Corg.jacop.constraints.SubcircuitCloneable | A cloneable version of the Subcircuit constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SumBoolCloneable > | |
| Corg.jacop.constraints.SumBoolCloneable | A cloneable SumBool constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SumCloneable > | |
| Corg.jacop.constraints.SumCloneable | A cloneable version of the Sum constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SumIntCloneable > | |
| Corg.jacop.constraints.SumIntCloneable | A clonable version of JaCoP's SumInt constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< SumWeightCloneable > | |
| Corg.jacop.constraints.SumWeightCloneable | A cloneable version of the SumWeight constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ValuePrecedeCloneable > | |
| Corg.jacop.constraints.ValuePrecedeCloneable | A cloneable version of the ValuePrecede constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< ValuesCloneable > | |
| Corg.jacop.constraints.ValuesCloneable | A cloneable version of the Values constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XdivYeqZCloneable > | |
| Corg.jacop.constraints.XdivYeqZCloneable | A cloneable version of the XdivYeqZ constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XeqCCloneable > | |
| Corg.jacop.constraints.XeqCCloneable | A cloneable version of the XeqC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XeqYCloneable > | |
| Corg.jacop.constraints.XeqYCloneable | A cloneable version of the XeqY constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XexpYeqZCloneable > | |
| Corg.jacop.constraints.XexpYeqZCloneable | A cloneable version of the XexpYeqZ constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XgtCCloneable > | |
| Corg.jacop.constraints.XgtCCloneable | A cloneable version of the XqtC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XgteqCCloneable > | |
| Corg.jacop.constraints.XgteqCCloneable | A cloneable version of the XgteqC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XgteqYCloneable > | |
| Corg.jacop.constraints.XgteqYCloneable | A cloneable version of the XgteqY constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XgtYCloneable > | |
| Corg.jacop.constraints.XgtYCloneable | A cloneable version of the XgtY constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XltCCloneable > | |
| Corg.jacop.constraints.XltCCloneable | A cloneable version of the XltC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XlteqCCloneable > | |
| Corg.jacop.constraints.XlteqCCloneable | A cloneable version of the XlteqC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XlteqYCloneable > | |
| Corg.jacop.constraints.XlteqYCloneable | A cloneable version of the XlteqY constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XltYCloneable > | |
| Corg.jacop.constraints.XltYCloneable | A cloneable version of the XltY constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XmodYeqZCloneable > | |
| Corg.jacop.constraints.XmodYeqZCloneable | A cloneable version of the XmodYeqZ constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XmulCeqZCloneable > | |
| Corg.jacop.constraints.XmulCeqZCloneable | A cloneable version of the XmulCeqZ constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XmulYeqCCloneable > | |
| Corg.jacop.constraints.XmulYeqCCloneable | A cloneable version of the XmulYeqC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XmulYeqZCloneable > | |
| Corg.jacop.constraints.XmulYeqZCloneable | A cloneable version of the XmulYeqZ constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XneqCCloneable > | |
| Corg.jacop.constraints.XneqCCloneable | A cloneable version of the XneqC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XneqYCloneable > | |
| Corg.jacop.constraints.XneqYCloneable | A cloneable version of the XneqY constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XorBoolCloneable > | |
| Corg.jacop.constraints.XorBoolCloneable | A cloneable variant of the XorBool constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XplusCeqZCloneable > | |
| Corg.jacop.constraints.XplusCeqZCloneable | A cloneable version of the XplusCeqZ constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XplusClteqZCloneable > | |
| Corg.jacop.constraints.XplusClteqZCloneable | A cloneable version of the XplusClteqZ constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XplusYeqCCloneable > | |
| Corg.jacop.constraints.XplusYeqCCloneable | A version of the XplusYeqC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XplusYeqZCloneable > | |
| Corg.jacop.constraints.XplusYeqZCloneable | A cloneable version of the XplusYeqZ interface |
| Corg.jacop.constraints.ConstraintCloneableInterface< XplusYgtCCloneable > | |
| Corg.jacop.constraints.XplusYgtCCloneable | A cloneable version of the XplusYgtC constraint |
| Corg.jacop.constraints.ConstraintCloneableInterface< XplusYlteqZCloneable > | |
| Corg.jacop.constraints.XplusYlteqZCloneable | A cloneable version of the XplusYlteqZ constraint |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.ConstraintType | Constraint type |
| Cfrodo2.controller.Controller | The controller class, a container for the listeners that do the actual work |
| Cfrodo2.controller.TestController.ControllerExtension | An extension of the controller that allows external objects to |
| Cfrodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > > | An optimal solution to the problem |
| Cfrodo2.algorithms.ConvergenceInterface< V extends Addable< V > > | Interface for all modules that should be able to store convergence data |
| Cfrodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U > | An optimal solution to the problem |
| Cfrodo2.algorithms.ConvergenceInterface< V > | |
| Cfrodo2.algorithms.SolutionWithConvergence< V extends Addable< V >, U > | An optimal solution to the problem |
| Cfrodo2.benchmarks.vehiclerouting.CordeauToXCSP | A file converter from Cordeau's MDVRP format into FRODO XCSP format |
| CCount | |
| Corg.jacop.constraints.CountCloneable | A cloneable version of the Count constraint |
| CCountBounds | |
| Corg.jacop.constraints.CountBoundsCloneable | A cloneable version of the CountBounds constraint |
| CCountValues | |
| Corg.jacop.constraints.CountValuesCloneable | A cloneable version of the CountValues constraint |
| CCountValuesBounds | |
| Corg.jacop.constraints.CountValuesBoundsCloneable | A cloneable version of the CountValuesBounds constraint |
| CCountVar | |
| Corg.jacop.constraints.CountVarCloneable | A cloneable version of the CountVar constraint |
| Cfrodo2.solutionSpaces.crypto.CryptoScheme< AddableInteger, ElGamalBigInteger, ElGamalScheme.ElGamalPublicKeyShare > | |
| Cfrodo2.solutionSpaces.crypto.ElGamalScheme | The ElGamal crypto scheme |
| CCumulative | |
| Corg.jacop.constraints.CumulativeCloneable | A cloneable version of the Cumulative constraint |
| Corg.jacop.constraints.cumulative.CumulativeCloneable | A cloneable version of the Cumulative constraint |
| CCumulativeBasic | |
| Corg.jacop.constraints.cumulative.CumulativeBasicCloneable | A cloneable version of the CumulativeBasic constraint |
| CCumulativeOptional | |
| Corg.jacop.constraints.cumulative.CumulativeOptionalCloneable | A Cloneable version of CumulativeOptional |
| CCumulativePrimary | |
| Corg.jacop.constraints.cumulative.CumulativePrimaryCloneable | A cloneable version of the CumulativePrimary constraint |
| CCumulativeUnary | |
| Corg.jacop.constraints.cumulative.CumulativeUnaryCloneable | A cloneable version of the CumulativeUnary constraint |
| CCumulativeUnaryOptional | |
| Corg.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable | A Cloneable variant of CumulativeUnaryOptional |
| Cfrodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.CurrentAssignment< Val > | A convenience class to store an assignment |
| Cfrodo2.benchmarks.vehiclerouting.CordeauToXCSP.Customer | A customer |
| Cfrodo2.daemon.Daemon | |
| Cfrodo2.controller.TestController.DaemonExtension | A daemon with an API to pass the configuration file |
| Cfrodo2.communication.OutgoingMsgPolicyInterface< T >.Decision | The decision made |
| CDecomposedConstraint | |
| Cfrodo2.solutionSpaces.JaCoP.Predicate | Predicate wrapper that translates a predicate expression from XCSP into constraints available in JaCoP |
| Corg.jacop.constraints.DecomposedConstraintCloneableInterface | An interface that defines additional methods for a DecomposedConstraint |
| Cfrodo2.solutionSpaces.JaCoP.Predicate | Predicate wrapper that translates a predicate expression from XCSP into constraints available in JaCoP |
| Corg.jacop.constraints.AndBoolCloneable | A cloneable version of the AndBool constraint |
| Corg.jacop.constraints.LexCloneable | A cloneable version of the Lex constraint |
| Corg.jacop.constraints.OrBoolCloneable | A cloneable variant of the OrBool constraint |
| Corg.jacop.constraints.SequenceCloneable | A cloneable version of the Sequence constraint |
| Corg.jacop.constraints.SoftAlldifferentCloneable | A cloneable version of the SoftAllDifferent constraint |
| Corg.jacop.constraints.SoftGCCCloneable | A cloneable version of the SoftGCC constraint |
| Corg.jacop.constraints.StretchCloneable | A cloneable version of the Stretch constraint |
| Corg.jacop.constraints.diffn.DiffnDecomposedCloneable | A cloneable version of the DiffnDecomposed constraint |
| Corg.jacop.constraints.netflow.ArithmeticCloneable | A cloneable version of the Arithmetic constraint |
| CDecreasing | |
| Corg.jacop.constraints.DecreasingCloneable | A cloneable variant of the Decreasing constraint |
| CDefaultMutableTreeNode | |
| Cfrodo2.gui.VisualizerControls.MsgTypeSetting | A message type and its slider |
| Cfrodo2.communication.mailer.CentralMailer.DelayGenerator | Abstract class that defines the functions needed in a delay generator |
| Cfrodo2.communication.mailer.CentralMailer.NegativeExponentialDistribution | This class is used to generate message delay according to the negative exponential distribution |
| Cfrodo2.benchmarks.vehiclerouting.CordeauToXCSP.Depot | A depot |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignment< Val extends Addable< Val >, U extends Addable< U > > | Interface used to implement the different decision strategies of DSA |
| Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > > | In the future we might want to experiment with different ways of determining a variables assignment |
| Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > > | In the future we might want to experiment with different ways of determining a variables assignment |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignment< Val, U > | |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.A< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.C< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.E< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val, U > | |
| Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > > | This class should be used when only a single hierarchy is used |
| Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val, U > | |
| Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > > | This class should be used when only a single hierarchy is used |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V, U > | |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > > | A DFSgeneration module that also computes the order in which is variable is visited and the total number of variables in the DFS |
| Cfrodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > > | A DFS generation protocol with a heuristic for E[DPOP] |
| CDiff | |
| Corg.jacop.constraints.DiffCloneable | A cloneable version of the Diff constraint |
| CDiff2 | |
| Corg.jacop.constraints.Diff2Cloneable | A cloneable version of the Diff2 constraint |
| CDiffn | |
| Corg.jacop.constraints.diffn.DiffnCloneable | A cloneable version of the Diffn constraint |
| CDiffnDecomposed | |
| Corg.jacop.constraints.diffn.DiffnDecomposedCloneable | A cloneable version of the DiffnDecomposed constraint |
| CDisjoint | |
| Corg.jacop.constraints.DisjointCloneable | A cloneable version of the Disjoint constraint |
| CDisjointConditional | |
| Corg.jacop.constraints.DisjointConditionalCloneable | A cloneable version of the DisjointConditional constraint |
| CDistance | |
| Corg.jacop.constraints.DistanceCloneable | A Cloneable version of the Distance constraint |
| Cfrodo2.controller.DistributedSolverDemo | A demo for the distributed solver |
| CDoubleI | |
| Cfrodo2.solutionSpaces.vehiclerouting.Customer | A customer in the Vehicle Routing Problem |
| Cfrodo2.algorithms.dpop.stochastic.E_DPOPsolver< V, U > | |
| Cfrodo2.algorithms.dpop.stochastic.Complete_E_DPOPsolver< V extends Addable< V >, U extends Addable< U > > | The solver for Comp-E[DPOP] |
| Cfrodo2.algorithms.Eavesdroppable< T > | Defines a module that eavesdrops on the messages exchanged |
| Cfrodo2.algorithms.test.MessageDebugger | Prints out all messages received and sent by the agent |
| Cfrodo2.algorithms.RandGraphFactory.Edge | An edge |
| CElement | |
| Cfrodo2.benchmarks.auctions.xcsp.Constraint | This class is used to generate 'constraint' tags in the output XML file |
| Cfrodo2.benchmarks.auctions.xcsp.Constraints | This class is used to generate the 'constraints' tag in the output XML file |
| Cfrodo2.benchmarks.auctions.xcsp.Domain | This class is used to generate the 'domain' tags in the output XML file |
| Cfrodo2.benchmarks.auctions.xcsp.Domains | This class is used to generate the 'domains' tag in the output XML file |
| Cfrodo2.benchmarks.auctions.xcsp.Instance | This class is used to generate the 'instance' tag in the output XML file |
| Cfrodo2.benchmarks.auctions.xcsp.Presentation | This class is used to generate the 'presentation' tag of the output XML file |
| Cfrodo2.benchmarks.auctions.xcsp.Relation | This class is used to generate the 'relation' tags in the XML output file |
| Cfrodo2.benchmarks.auctions.xcsp.Relations | This class is used to generate the 'relations' tag in the XML output file |
| Cfrodo2.benchmarks.auctions.xcsp.SumParameters | This class is used to represent the parameters of an intensional sum constraint |
| Cfrodo2.benchmarks.auctions.xcsp.SumParameters.Equal | This internal class is needed to create the eq XML tag |
| Cfrodo2.benchmarks.auctions.xcsp.SumParameters.LessEqual | This internal class is needed to create the le XML tag; else, characters > and < are transformed into > and < |
| Cfrodo2.benchmarks.auctions.xcsp.Variable | This class is used to generate the 'variable' tags in the output XML file |
| Cfrodo2.benchmarks.auctions.xcsp.Variables | This class is used to generate the 'variables' tag in the output XML file |
| CElementInteger | |
| Corg.jacop.constraints.ElementIntegerCloneable | A cloneable version of the ElementInteger constraint |
| CElementIntegerFast | |
| Corg.jacop.constraints.ElementIntegerFastCloneable | A cloneable version of the ElementIntegerFast constraint |
| CElementVariable | |
| Corg.jacop.constraints.ElementVariableCloneable | A cloneable version of the ElementVariable constraint |
| CElementVariableFast | |
| Corg.jacop.constraints.ElementVariableFastCloneable | A cloneable version of the ElementVariableFast constraint |
| CEq | |
| Corg.jacop.constraints.EqCloneable | A cloneable version of the Eq constraint |
| CEqBool | |
| Corg.jacop.constraints.EqBoolCloneable | A cloneable version of the EqBool constraint |
| CExtensionalConflictVA | |
| Corg.jacop.constraints.ExtensionalConflictVACloneable | A cloneable version of the ExtensionalConflictVA constraint |
| CExtensionalSupportMDD | |
| Corg.jacop.constraints.ExtensionalSupportMDDCloneable | A cloneable version of the ExtensionalSupportMDD constraint |
| CExtensionalSupportSTR | |
| Corg.jacop.constraints.ExtensionalSupportSTRCloneable | A cloneable version of the ExtensionalSupportSTR constraint |
| CExtensionalSupportVA | |
| Corg.jacop.constraints.ExtensionalSupportVACloneable | A cloneable version of the ExtensionalSupportVA constraint |
| CExternalConstraint | |
| Corg.jacop.constraints.geost.ExternalConstraintCloneable | A cloneable version of ExternalConstraint |
| Corg.jacop.constraints.geost.InAreaCloneable | A cloneable version of InArea |
| Corg.jacop.constraints.geost.NonOverlappingCloneable | A cloneable version of NonOverlapping |
| CExternalizable | |
| Cfrodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > > | The message used to send a VALUE message to a variable's pseudochildren in ADOPT |
| Cfrodo2.algorithms.adopt.ENDmsg< Val extends Addable< Val > > | The message used to send a terminate message to a variable's children |
| Cfrodo2.algorithms.adopt.VALUEmsg< Val extends Addable< Val >, U extends Addable< U > > | The message used to send a VALUE message to a variable's pseudochildren |
| Cfrodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > > | A message reporting the convergence for a given component |
| Cfrodo2.algorithms.afb.AFBBaseMsg< V extends Addable< V >, U extends Addable< U > > | All AFB messages containing a CPA subclass this class |
| Cfrodo2.algorithms.afb.CPAmsg< V extends Addable< V >, U extends Addable< U > > | The message containing the current partial assignment in AFB |
| Cfrodo2.algorithms.afb.FbCpaMsg< V extends Addable< V >, U extends Addable< U > > | The FB_CPA message in AFB |
| Cfrodo2.algorithms.afb.FbEstimateMsg< V extends Addable< V >, U extends Addable< U > > | The FB_ESTIMATE message in AFB |
| Cfrodo2.algorithms.afb.PA< V extends Addable< V >, U extends Addable< U > > | Class holding a partial assignment for AFB |
| Cfrodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > > | A message containing the optimal solution found so far |
| Cfrodo2.algorithms.afb.Timestamp | Timestamp mechanism for AFB |
| Cfrodo2.algorithms.asodpop.ACKmsg | This message is used to ask a child for new information |
| Cfrodo2.algorithms.asodpop.VALUEmsgPseudo< Val extends Addable< Val > > | A VALUE message, which contains the value assignment of a variable |
| Cfrodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > > | A message containing a utility solution space |
| Cfrodo2.algorithms.dpop.privacy.ObsfUTILmsg< V extends Addable< V > > | UTIL Message sent and decoded by VariableObfuscation |
| Cfrodo2.algorithms.dpop.VALUEmsg< Val extends Addable< Val > > | VALUE message |
| Cfrodo2.algorithms.dpop.privacy.ObfsVALUEmsg< V extends Addable< V > > | VALUE message sent and decoded by VariableObfuscation |
| Cfrodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > > | Message sent by VariableObfuscation to transmit codeNames |
| Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.StatRequestOutput | Message sent to stat gatherer with all decryption requests for an agent |
| Cfrodo2.algorithms.dpop.privacy.DecryptRequest< C extends Addable< C >, E extends AddableLimited< C, E > | Decryption Request Message |
| Cfrodo2.algorithms.dpop.privacy.DecryptVectorRequest< C extends Addable< C >, E extends AddableLimited< C, E > | Vector decryption request |
| Cfrodo2.algorithms.dpop.privacy.DeliveryMsg< M extends Message > | A wrapper message containing a message to be delivered to a given variable by SecureCircularRouting |
| Cfrodo2.algorithms.dpop.privacy.DoneMsg | Message token used to tell to the root that the dfs can be rerooted |
| Cfrodo2.algorithms.dpop.privacy.EncrUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E > | Encrypted UTIL msg |
| Cfrodo2.algorithms.dpop.privacy.KeyShareMsg< K extends CryptoScheme.PublicKeyShare > | Message used to share the public key shares of the CryptoScheme |
| Cfrodo2.algorithms.dpop.privacy.LeafMsg | A token sent by the root in P2-DPOP to tell the last variable in the linear ordering to start UTIL propagation |
| Cfrodo2.algorithms.dpop.privacy.OptUtilMsg< U extends Addable< U > > | A message containing the optimal utility found for a given component |
| Cfrodo2.algorithms.dpop.privacy.RerootingMsg | Message used to send a reroot request |
| Cfrodo2.algorithms.dpop.privacy.StopMsg | A message stating that the problem is infeasible |
| Cfrodo2.algorithms.dpop.privacy.ToLastLeafMsg | A wrapper message containing a payload message that must be forwarded to the last leaf in the sub-tree rooted at the destination variable |
| Cfrodo2.algorithms.dpop.privacy.VarCodenameMsg< V > | Message sent by EncryptedUTIL to transmit codeNames |
| Cfrodo2.algorithms.dpop.privacy.VectorMsg< C extends Addable< C >, E extends AddableLimited< C, E > | Message that contains a vector of elements E and a counter |
| Cfrodo2.algorithms.localSearch.dsa.VALUEmsg< Val extends Addable< Val > > | Message used to convey the new value of the sender to a neighbouring variable |
| Cfrodo2.algorithms.localSearch.mgm.IMPROVE< U extends Addable< U > > | |
| Cfrodo2.algorithms.localSearch.mgm.OK< V extends Addable< V > > | |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.IMPROVE< U extends Addable< U > > | |
| Cfrodo2.algorithms.mpc_discsp.EncrSharesMsg | In MPC-DisCSP4, a message containing a vector of ElGamal-encrypted shares |
| Cfrodo2.algorithms.mpc_discsp.OneShareMsg | In MPC-DisCSP4, a message containing a single share |
| Cfrodo2.algorithms.mpc_discsp.PaillierInteger | A Paillier-encrypted integer |
| Cfrodo2.algorithms.mpc_discsp.PaillierPublicKey | A Paillier public key |
| Cfrodo2.algorithms.mpc_discsp.SharesMsg | In MPC-DisCSP4, a message containing a vector of shares |
| Cfrodo2.algorithms.mpc_discsp.SolShareMsg | A message containing shares of optimal values for some variables |
| Cfrodo2.algorithms.odpop.ASKmsg | This message is used to ask a child for new information |
| Cfrodo2.algorithms.odpop.DONEmsg | This message is used to ask a child for new information |
| Cfrodo2.algorithms.odpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.VALUEmsg< Val extends Addable< Val > > | VALUE message |
| Cfrodo2.algorithms.odpop.VALUEmsgWithVars< Val extends Addable< Val > > | Value message with variables |
| Cfrodo2.algorithms.asodpop.VALUEmsgChild< Val extends Addable< Val > > | A VALUE message, which contains the value assignment of a variable |
| Cfrodo2.algorithms.synchbb.BTmsg | Backtrack message in SynchBB |
| Cfrodo2.algorithms.synchbb.PathMsg< V extends Addable< V >, U extends Addable< U > > | The message containing the current partial assignment in SynchBB |
| Cfrodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > > | A message containing the optimal solution found so far |
| Cfrodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > > | A message reporting the convergence for a given component |
| Cfrodo2.algorithms.varOrdering.dfs.ParallelDFSmsg< S extends Comparable< S > &Serializable > | A message containing a DFS message for a particular candidate root, used by DFSgenerationParallel |
| Cfrodo2.algorithms.varOrdering.dfs.ReleaseDFSmsg | A message telling a variable to release its DFS output message, use DFSgenerationParallel |
| Cfrodo2.algorithms.varOrdering.dfs.ScoreMsg< S extends Serializable > | A message containing the score of a single variable |
| Cfrodo2.algorithms.varOrdering.dfs.ScoresMsg< S extends Serializable > | A message containing the scores of given variables |
| Cfrodo2.algorithms.varOrdering.dfs.VarNbrMsg | Msg sent to transfer through the DFS in top-down way the total number of variables in this component |
| Cfrodo2.algorithms.varOrdering.election.MaxIDmsg< T extends Comparable< T > &Serializable > | Leader election message containing two payloads: the sender agent, and its current maxID |
| Cfrodo2.algorithms.varOrdering.linear.NextVarMsg | A message containing the next variable chosen for a given component |
| Cfrodo2.algorithms.varOrdering.linear.ProposalMsg< S extends Comparable< S > &Serializable > | A message containing a proposal for the next variable to put in the order |
| Cfrodo2.algorithms.varOrdering.linear.RequestMsg | A message requesting a proposal for the next variable to put in the order |
| Cfrodo2.communication.Message | Base class used for messages exchanged between queues |
| Cfrodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > > | The message used to send a VALUE message to a variable's pseudochildren in ADOPT |
| Cfrodo2.algorithms.adopt.ENDmsg< Val extends Addable< Val > > | The message used to send a terminate message to a variable's children |
| Cfrodo2.algorithms.adopt.VALUEmsg< Val extends Addable< Val >, U extends Addable< U > > | The message used to send a VALUE message to a variable's pseudochildren |
| Cfrodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > > | A message reporting the convergence for a given component |
| Cfrodo2.algorithms.afb.AFBBaseMsg< V extends Addable< V >, U extends Addable< U > > | All AFB messages containing a CPA subclass this class |
| Cfrodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > > | A message containing the optimal solution found so far |
| Cfrodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > > | A message containing a utility solution space |
| Cfrodo2.algorithms.dpop.privacy.DoneMsg | Message token used to tell to the root that the dfs can be rerooted |
| Cfrodo2.algorithms.dpop.privacy.EncrUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E > | Encrypted UTIL msg |
| Cfrodo2.algorithms.dpop.privacy.LeafMsg | A token sent by the root in P2-DPOP to tell the last variable in the linear ordering to start UTIL propagation |
| Cfrodo2.algorithms.dpop.restart.Token | Message sent and received by UTILreuse module during warm restarts |
| Cfrodo2.algorithms.mpc_discsp.EncrSharesMsg | In MPC-DisCSP4, a message containing a vector of ElGamal-encrypted shares |
| Cfrodo2.algorithms.mpc_discsp.OneShareMsg | In MPC-DisCSP4, a message containing a single share |
| Cfrodo2.algorithms.mpc_discsp.SharesMsg | In MPC-DisCSP4, a message containing a vector of shares |
| Cfrodo2.algorithms.mpc_discsp.SolShareMsg | A message containing shares of optimal values for some variables |
| Cfrodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > > | A message holding an assignment to a variable |
| Cfrodo2.algorithms.synchbb.BTmsg | Backtrack message in SynchBB |
| Cfrodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > > | A message containing the optimal solution found so far |
| Cfrodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > > | A message reporting the convergence for a given component |
| Cfrodo2.algorithms.varOrdering.dfs.ReleaseDFSmsg | A message telling a variable to release its DFS output message, use DFSgenerationParallel |
| Cfrodo2.algorithms.varOrdering.dfs.ScoreMsg< S extends Serializable > | A message containing the score of a single variable |
| Cfrodo2.algorithms.varOrdering.dfs.ScoresMsg< S extends Serializable > | A message containing the scores of given variables |
| Cfrodo2.algorithms.varOrdering.linear.NextVarMsg | A message containing the next variable chosen for a given component |
| Cfrodo2.algorithms.varOrdering.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > > | A message containing a linear order on all variables belonging to a given connected component of the constraint graph |
| Cfrodo2.algorithms.varOrdering.linear.ProposalMsg< S extends Comparable< S > &Serializable > | A message containing a proposal for the next variable to put in the order |
| Cfrodo2.algorithms.varOrdering.linear.RequestMsg | A message requesting a proposal for the next variable to put in the order |
| Cfrodo2.communication.MessageWith2Payloads< T1 extends Serializable, T2 extends Serializable > | A message that has two objects of generic types as a payload |
| Cfrodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentMessage< V extends Addable< V > > | A message holding an assignment to a variable |
| Cfrodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentsMessage< V > | A message holding assignments to variables |
| Cfrodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.ConvStatMessage< Val > | A message containing information about the convergence of the algorithm |
| Cfrodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< U extends Addable< U > > | Message sent by roots containing the optimal utility value of their DFS tree |
| Cfrodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< U extends Addable< U > > | Message sent by roots containing the optimal utility value of their DFS tree |
| Cfrodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val >, U extends Addable< U > > | A message holding the optimal assignments to a variable, conditioned on the assignments to the variables in its separator |
| Cfrodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.OutputMsg< V extends Addable< V > > | The output message for a given variable |
| Cfrodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< Val extends Addable< Val >, U extends Addable< U > > | Message sent by roots containing the optimal utility value of their DFS tree, conditioned on the values of the parameters (if any) |
| Cfrodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.AssignmentMessage< Val extends Addable< Val > > | A message holding the optimal assignment to some variables, conditioned on the values of the parameters (if any) |
| Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.CryptoSchemeMsg< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare > | Message used to transfer the cryptoScheme to others modules of this agent |
| Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.VectorOutput< C extends Addable< C > > | Vector decryption Output Message |
| Cfrodo2.algorithms.dpop.privacy.DecryptVectorRequest< C extends Addable< C >, E extends AddableLimited< C, E > | Vector decryption request |
| Cfrodo2.algorithms.dpop.privacy.DeliveryMsg< M extends Message > | A wrapper message containing a message to be delivered to a given variable by SecureCircularRouting |
| Cfrodo2.algorithms.dpop.privacy.KeyShareMsg< K extends CryptoScheme.PublicKeyShare > | Message used to share the public key shares of the CryptoScheme |
| Cfrodo2.algorithms.dpop.privacy.OptUtilMsg< U extends Addable< U > > | A message containing the optimal utility found for a given component |
| Cfrodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >.RootValueMsg | The class of statistics messages containing the optimal assignment to a variable |
| Cfrodo2.algorithms.dpop.privacy.ToLastLeafMsg | A wrapper message containing a payload message that must be forwarded to the last leaf in the sub-tree rooted at the destination variable |
| Cfrodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.TestMessage | A message holding the sender variable and the number of variables visited so far |
| Cfrodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >.RandVarsProjMsg | Message telling what random variables should be projected out at given decision variable |
| Cfrodo2.algorithms.dpop.stochastic.LCAmsg2 | A message with flags, used both for phase 2 and as an output message of LowestCommonAncestors |
| Cfrodo2.algorithms.dpop.stochastic.SamplesMsg2< V extends Addable< V > > | Message used by the SamplingPhase module in phase 2, to which samples have been added |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.RandVarsProjMsg | Message telling what random variables should be projected out at given decision variable |
| Cfrodo2.algorithms.duct.COSTmsg | |
| Cfrodo2.algorithms.duct.VALUEmsg< V extends Addable< V > > | |
| Cfrodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > > | A message sent by a function node |
| Cfrodo2.algorithms.maxsum.VariableMsg< V extends Addable< V >, U extends Addable< U > > | A message sent by a variable node |
| Cfrodo2.algorithms.odpop.DONEmsg | This message is used to ask a child for new information |
| Cfrodo2.algorithms.odpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.GoodsTreeMessage< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > > | Message used to give the pointer to the goods tree to the VALUE propagation module |
| Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.OptUtilMessage< U extends Addable< U > > | Message sent by roots containing the optimal utility value of their DFS tree |
| Cfrodo2.algorithms.odpop.VALUEmsg< Val extends Addable< Val > > | VALUE message |
| Cfrodo2.algorithms.odpop.VALUEmsgWithVars< Val extends Addable< Val > > | Value message with variables |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput< V extends Addable< V >, U extends Addable< U > > | Message class used for the output of the protocol |
| Cfrodo2.algorithms.varOrdering.dfs.ParallelDFSmsg< S extends Comparable< S > &Serializable > | A message containing a DFS message for a particular candidate root, used by DFSgenerationParallel |
| Cfrodo2.algorithms.varOrdering.dfs.RandVarsMsg | A message containing random variables |
| Cfrodo2.algorithms.varOrdering.dfs.VarNbrMsg | Msg sent to transfer through the DFS in top-down way the total number of variables in this component |
| Cfrodo2.algorithms.varOrdering.election.MaxIDmsg< T extends Comparable< T > &Serializable > | Leader election message containing two payloads: the sender agent, and its current maxID |
| Cfrodo2.communication.MessageWith3Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable > | A message that has three objects of generic types as a payload |
| Cfrodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage | A message containing statistics about messages sent |
| Cfrodo2.algorithms.adopt.BoundsMsg< Val extends Addable< Val >, U extends Addable< U > > | A message containing the heuristics for the lower bound |
| Cfrodo2.algorithms.adopt.HeuristicMsg< Val extends Addable< Val >, U extends Addable< U > > | Message used to send the minimal utility of the agents local sub problem |
| Cfrodo2.algorithms.asodpop.VALUEmsgPseudo< Val extends Addable< Val > > | A VALUE message, which contains the value assignment of a variable |
| Cfrodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val > > | A message holding the optimal assignments to variables, conditioned on the assignments to the variables in its separator |
| Cfrodo2.algorithms.dpop.VALUEmsg< Val extends Addable< Val > > | VALUE message |
| Cfrodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.SeparatorMessage | A message holding the separator of a given child variable |
| Cfrodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >.SolutionSizeMessage< Val extends Addable< Val > > | |
| Cfrodo2.algorithms.dpop.count.VALUEmsg< Val extends Addable< Val > > | VALUE message |
| Cfrodo2.algorithms.dpop.memory.ContextMsg< V extends Addable< V > > | A CONTEXT message sent by cluster nodes in MB-DPOP |
| Cfrodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.StatsMsg< V extends Addable< V > > | A message containing stats about a variable |
| Cfrodo2.algorithms.dpop.param.VALUEmsg< Val extends Addable< Val > > | VALUE message |
| Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.DecryptionOutput< C extends Addable< C > > | Decryption Output Message |
| Cfrodo2.algorithms.dpop.privacy.DecryptRequest< C extends Addable< C >, E extends AddableLimited< C, E > | Decryption Request Message |
| Cfrodo2.algorithms.dpop.privacy.RoutingMsg< M extends Message > | A wrapper message around a payload message that must be routed through the DFS |
| Cfrodo2.algorithms.dpop.privacy.VarCodenameMsg< V > | Message sent by EncryptedUTIL to transmit codeNames |
| Cfrodo2.algorithms.dpop.privacy.VectorMsg< C extends Addable< C >, E extends AddableLimited< C, E > | Message that contains a vector of elements E and a counter |
| Cfrodo2.algorithms.dpop.stochastic.LCAmsg1 | A phase 1 message containing flags |
| Cfrodo2.algorithms.dpop.stochastic.SamplesMsg1< V extends Addable< V > > | Phase 1 LCA message containing proposed samples for the random variables |
| Cfrodo2.algorithms.duct.COSTBmsg | |
| Cfrodo2.algorithms.duct.NORMmsg | |
| Cfrodo2.algorithms.localSearch.dsa.VALUEmsg< Val extends Addable< Val > > | Message used to convey the new value of the sender to a neighbouring variable |
| Cfrodo2.algorithms.localSearch.mgm.IMPROVE< U extends Addable< U > > | |
| Cfrodo2.algorithms.localSearch.mgm.OK< V extends Addable< V > > | |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.IMPROVE< U extends Addable< U > > | |
| Cfrodo2.algorithms.varOrdering.dfs.CHILDmsg | A token indicating that the destination variable is a child of the sender variable |
| Cfrodo2.algorithms.varOrdering.dfs.CHILDorderMsg | Child token including the order of visit of the recipient variable in the graph |
| Cfrodo2.algorithms.varOrdering.dfs.CHILDrandMsg | A CHILD token containing a set of random variables |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >.DFSorderOutputMessage | Carries DFS order information for one variable |
| Cfrodo2.algorithms.varOrdering.dfs.PSEUDOmsg | A token indicating that the destination variable is a pseudo-child of the sender variable |
| Cfrodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.MessageLEoutput< T extends Comparable< T > &Serializable > | Message class used for the output of the protocol |
| Cfrodo2.daemon.LocalAgentReport | A message that an agent sends to its local white pages to report |
| Cfrodo2.communication.MessageWith4Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable, T4 extends Serializable > | A message that has three objects of generic types as a payload |
| Cfrodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SeparatorMessage | A message holding the separator of a given child variable |
| Cfrodo2.algorithms.dpop.memory.LabelMsg< V extends Addable< V > > | The class of the LABEL messages sent by MB-DPOP's labeling phase |
| Cfrodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > > | Message sent by VariableObfuscation to transmit codeNames |
| Cfrodo2.algorithms.duct.OUTmsg< V extends Addable< V > > | |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.ACCEPT< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.OFFER< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.OFFERold< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.communication.MessageWith5Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable, T4 extends Serializable, T5 extends Serializable > | A message that has three objects of generic types as a payload |
| Cfrodo2.algorithms.duct.BOUNDmsg | |
| Cfrodo2.communication.MessageWithPayload< T extends Serializable > | A message that has a single object of generic type as a payload |
| Cfrodo2.algorithms.asodpop.ACKmsg | This message is used to ask a child for new information |
| Cfrodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.StatsMessage | Message containing statistics |
| Cfrodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.StatsMessage | Message containing statistics |
| Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.StatRequestOutput | Message sent to stat gatherer with all decryption requests for an agent |
| Cfrodo2.algorithms.dpop.privacy.RerootingMsg | Message used to send a reroot request |
| Cfrodo2.algorithms.dpop.privacy.StopMsg | A message stating that the problem is infeasible |
| Cfrodo2.algorithms.duct.BoundStatsMsg | Message that contains the final bound on the solution quality |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.GO | |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.NOGO | |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.REJECT | |
| Cfrodo2.algorithms.odpop.ASKmsg | This message is used to ask a child for new information |
| Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.StatsMessage | Message containing statistics |
| Cfrodo2.communication.MessageWithRawData | A message containing data that must be custom-serialized |
| Cfrodo2.communication.MessageSerializedSimple< T extends Serializable > | A message that has a single object as raw data |
| Cfrodo2.controller.messages.MessageAgentReporting | |
| Cfrodo2.solutionSpaces.AddableLimited< A extends Addable< A >, M extends AddableLimited< A, M > | A limited Addable that only declares a very small subset of the operations supported by an Addable |
| Cfrodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger | A wrapper around a BigInteger so that it implements AddableLimited |
| Cfrodo2.solutionSpaces.crypto.ElGamalBigInteger | ElGamal encryption of an integer |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > > | A UtilitySolutionSpace based on JaCoP as a local solver |
| Cfrodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable > | A basic hypercube that stores one utility per combination of assigments to variables |
| Cfrodo2.benchmarks.FileCopier | Helper utility that copies a file for use by frodo2.py when running experiments from a repository of problem instances |
| CFSM | |
| Corg.jacop.util.fsm.FSMCloneable | A cloneable FSM |
| Cfrodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > > | A function node in a factor graph |
| Cfrodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.FunctionInfo | Information about each neighboring function node |
| CGCC | |
| Corg.jacop.constraints.GCCCloneable | A cloneable version of the GCC constraint |
| CGeost | |
| Corg.jacop.constraints.geost.GeostCloneable | A cloneable version of the Geost constraint |
| CGeostObject | |
| Corg.jacop.constraints.geost.GeostObjectCloneable | A cloneable version of GeostObject |
| Cfrodo2.algorithms.odpop.Good< Val extends Addable< Val >, U extends Addable< U > > | Class that represents a good being send from child to parent It contains |
| Cfrodo2.benchmarks.auctions.cats.Good | This class represents a good sold in the auction |
| Cfrodo2.algorithms.odpop.Good< Val, U > | |
| Cfrodo2.algorithms.asodpop.Good< Val extends Addable< Val >, U extends Addable< U > > | Class that represents a good being send fom child to parent It contains |
| Cfrodo2.algorithms.RandGraphFactory.Graph | A graph |
| Cfrodo2.benchmarks.graphcoloring.GraphColoring | A graph coloring problem generator |
| Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.Heuristic< T extends Comparable< T > &Serializable > | Variable ordering heuristic |
| Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.Heuristic< IntIntStringTuple > | |
| Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom | A heuristic that maximizes the number of neighbors already in the order, breaking ties by minimizing the domain size, and then by variable name |
| Cfrodo2.solutionSpaces.hypercube.Hypercube< V, U > | |
| Cfrodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > > | The output of a blindProject() that computes itself on the fly |
| Cfrodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > > | The output of expectation(), computed on the fly |
| Cfrodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > > | Class representing a NULL hypercube |
| Cfrodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > > | The special output of a join that remembers its inputs rather than computing itself explicitly |
| Cfrodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > > | A hypercube that contains no variables, but a single utility value |
| Cfrodo2.solutionSpaces.hypercube.HypercubeIter< V, U > | |
| Cfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > > | An iterator in best-first order |
| Cfrodo2.solutionSpaces.hypercube.HypercubeLimited< V, U, U > | |
| Cfrodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > > | The class representing a hypercube |
| Cfrodo2.solutionSpaces.hypercube.HypercubeLimited< V, U, UL > | |
| Cfrodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL > | A HypercubeLimited that contains no variable and a single utility |
| CIfThen | |
| Corg.jacop.constraints.IfThenCloneable | A cloneable version of the IfThen constraint |
| CIfThenBool | |
| Corg.jacop.constraints.IfThenBoolCloneable | A cloneable version of the IfThenBool constraint |
| CIfThenElse | |
| Corg.jacop.constraints.IfThenElseCloneable | A cloneable version of the IfThenElse constraint |
| CImplies | |
| Corg.jacop.constraints.ImpliesCloneable | A cloneable version of the Implies constraint |
| CIn | |
| Corg.jacop.constraints.InCloneable | A cloneable version of the In constraint |
| CInArea | |
| Corg.jacop.constraints.geost.InAreaCloneable | A cloneable version of InArea |
| Cfrodo2.communication.IncomingMsgPolicyInterface< MessageType > | |
| Cfrodo2.communication.QueueTest.ConstantMsgPolicy | A message policy that always returns the same decision |
| CIncreasing | |
| Corg.jacop.constraints.IncreasingCloneable | A cloneable variant of the Increasing constraint |
| Cfrodo2.solutionSpaces.hypercube.tests.HypercubeTest.Infinity | Variables are used to determine whether infinite values are allowed |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U, L > | |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNode< U extends Addable< U >, L extends LeafNode< U > > | The inner node of a tree |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U, LeafNode< U > > | |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeBinaryDomains.InnerNode< U extends Addable< U >, L extends LeafNode< U > > | The inner node of a tree |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val, U, L > | |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > > | This class is designed to store GOODs received by a node from its children, and is used in the O-DPOP algorithm |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > > | This class is designed to store GOODs received by a node from its children, and is used in the O-DPOP algorithm |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val, U, LeafNode< U > > | |
| Cfrodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > > | This class is designed to store GOODs received by a node from its children, and is used in the ASODPOP algorithm |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeBinaryDomains.InnerNodeTree< Val, U, LeafNode< U > > | |
| Cfrodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > > | This class is designed to store GOODs received by a node from its children, and is used in the ASODPOP algorithm |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper | The IntArrayWrapper is used as a key for (partial) assignments |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper | The IntArrayWrapper is used as a key for (partial) assignments |
| Corg.jacop.core.IntVar | |
| Corg.jacop.core.IntVarCloneable | A JaCoP IntVar that is cloneable into a store |
| CItemListener | |
| Cfrodo2.gui.SimpleGUI | A simple GUI to configure and start FRODO |
| CJFrame | |
| Cfrodo2.gui.DOTrenderer | Renders and displays DOT code |
| Cfrodo2.gui.SimpleGUI | A simple GUI to configure and start FRODO |
| Cfrodo2.gui.VisualizerControls | A GUI to control how long messages are displayed |
| Cfrodo2.benchmarks.kidneys.KidneyExchange | Creates a sample population of kidney donor-patient pairs and generates a graph which is then written into a DCOP problem statement |
| CKnapsack | |
| Corg.jacop.constraints.knapsack.KnapsackCloneable | A cloneable version of the Knapsack constraint |
| Cfrodo2.algorithms.varOrdering.election.LeaderElectionMaxID< Integer > | |
| Cfrodo2.algorithms.varOrdering.election.VarElectionMessenger | A version of LeaderElectionMaxID that uses random numbers as IDs and lies in order to protect topology privacy |
| Cfrodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< Integer > | |
| Cfrodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest | JUnit test for the class VarElectionMEssengerTest |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U > | |
| Cfrodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > > | The leaf node of a tree |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U > | |
| Cfrodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.LeafNode< U extends Addable< U > > | The leaf node of a tree |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U extends Addable< U > > | The leaf node of a tree |
| Cfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L > | |
| Cfrodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > > | |
| CLex | |
| Corg.jacop.constraints.LexCloneable | A cloneable version of the Lex constraint |
| CLexOrder | |
| Corg.jacop.constraints.LexOrderCloneable | A cloneable version of the LexOrder constraint |
| CLinearInt | |
| Corg.jacop.constraints.LinearIntCloneable | A cloneable LinearInt constraint |
| CLinearIntDom | |
| Corg.jacop.constraints.LinearIntDomCloneable | A cloneable version of the LinearIntDom constraint |
| Cfrodo2.algorithms.mpc_discsp.Matrix | A matrix over a finite field |
| Cfrodo2.algorithms.mpc_discsp.LUdecomposition | LU decomposition of a matrix |
| CMax | |
| Corg.jacop.constraints.MaxCloneable | A cloneable version of the Max constraint |
| Cfrodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator | Max-DisCSP problem generator |
| CMaxSimple | |
| Corg.jacop.constraints.MaxSimpleCloneable | A cloneable version of the MaxSimple constraint |
| CMDD | |
| Corg.jacop.util.MDDCloneable | A version of MDD that requires cloneable variables |
| Cfrodo2.benchmarks.meetings.MeetingScheduling | Distributed meeting scheduling problem generator |
| CMember | |
| Corg.jacop.constraints.MemberCloneable | A cloneable version of the Member constraint |
| Cfrodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.MessageLEoutput< String > | |
| Cfrodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.SecureRootingMsg | Message used to tell a variable that it is the new root of its component |
| Cfrodo2.communication.MessageListener< T > | A general interface for modules listening for messages |
| Cfrodo2.communication.IncomingMsgPolicyInterface< T > | This interface describes a listener that is notified by a queue of incoming messages |
| Cfrodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > > | A convenience class to create agents |
| Cfrodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.FakeFactory | A fake agent factory |
| Cfrodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > > | An agent that uses a single queue |
| Cfrodo2.algorithms.StatsReporter | An interface that any listener sending statistics message should implement |
| Cfrodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > > | A StatsReporter that collects the generic solution to a DCOP |
| Cfrodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > > | A StatsReporter that monitors the convergence of the algorithm |
| Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > > | This class implements the ADOPT algorithm as described in: |
| Cfrodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > > | The AFB algorithm by Gershman, Meisels, and Zivan (JAIR'09) |
| Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > > | This class implements both the UTIL propagation phase and the VALUE propagation of the ASODPOP algorithm |
| Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > > | This class implements both the UTIL propagation phase and the VALUE propagation of the ASODPOP algorithm |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > > | The MGM algorithm |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > > | The MGM algorithm |
| Cfrodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > > | The Max-Sum Algorithm |
| Cfrodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > > | The SynchBB algorithm for DCOPs |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > > | |
| Cfrodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | Classical UTIL propagation protocol |
| Cfrodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > > | MB-DPOP's memory-bounded UTIL propagation phase |
| Cfrodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > > | A UTIL propagation protocol that supports parameters (i.e |
| Cfrodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > > | Implements an adaptation of the QDisCSP approach by Yokoo (DCR'09) |
| Cfrodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > > | E[DPOP]'s UTIL propagation phase |
| Cfrodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > > | A UTIL propagation phase that maximizes worst-case utility with respect to the random variables |
| Cfrodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > > | Classical UTIL propagation protocol |
| Cfrodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > > | VALUE propagation protocol |
| Cfrodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > > | MB-DPOP's labeling phase that identifies cluster roots (CRs) and cycle-cut (CC) nodes |
| Cfrodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > > | VALUE propagation protocol |
| Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare > | P2-DPOP's collaborative decryption module |
| Cfrodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E > | P2-DPOP's UTIL propagation module, using partially homomorphic encryption on utilities and a linear order on variables |
| Cfrodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > > | A module that waits for the root variable to compute its optimal value, and then calls for a rerooting |
| Cfrodo2.algorithms.dpop.privacy.SecureCircularRouting | Enables sending a message to the previous/next variable in a circular ordering of variables based on a DFS |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > > | Algorithm that generates samples for the random variables in the problem |
| Cfrodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >.Listener | The listener that checks the messages sent by the UTILpropagation and VALUEpropagation listeners |
| Cfrodo2.algorithms.duct.Normalize< V extends Addable< V > > | This module is a preprocessing module that normalizes all utilities to between 0 and 1 |
| Cfrodo2.algorithms.duct.Sampling< V extends Addable< V > > | |
| Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > > | The UTIL propagation phase for O-DPOP |
| Cfrodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > > | O-DPOP's VALUE propagation module |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > > | Distributed DFS generation protocol |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable > | A DFS Generation module that integrates a root election mechanism |
| Cfrodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > > | A factor graph generator |
| Cfrodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > > | Creates a linear ordering among variables |
| Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > > | Distributed algorithm to compute one variable linear ordering per connected component in the constraint graph |
| Cfrodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for ADOPTagent |
| Cfrodo2.algorithms.adopt.test.testADOPT | This class is used to test the workings of the ADOPT listener |
| Cfrodo2.algorithms.adopt.test.testPreprocessing.forwardHeuristicsMessage | This listener simply forwards all Heuristics messages to the central stats reporter |
| Cfrodo2.algorithms.adopt.test.testPreprocessing.receiveLowerBounds | |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ASODPOP agent |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for the class ASODPOP |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for the class ASODPOP |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ASODPOP agent |
| Cfrodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > > | VALUE propagation protocol |
| Cfrodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > > | VALUE propagation protocol |
| Cfrodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E > | P2-DPOP's variable re-ordering algorithm |
| Cfrodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > > | Module that intercepts messages during UTIL and VALUE propagation and obfuscates the variable names, variable domains, and utility values |
| Cfrodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest | Test case for the module SecureCircularRouting |
| Cfrodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.Forwarder | A test listener that asks the SecureCircularRouting message, for each variable, to forward a message forward all the way until it comes back, and same backwards |
| Cfrodo2.algorithms.dpop.privacy.test.SecureRerootingTest | JUnit test for the SecureRerooting module |
| Cfrodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > > | Unit tests for VariableObfuscation |
| Cfrodo2.algorithms.dpop.restart.UTILreuse | UTIL message storage for warm restarts of S-DPOP |
| Cfrodo2.algorithms.dpop.stochastic.LowestCommonAncestors | An algorithm to compute multiple Lowest Common Ancestors |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > > | Algorithm that generates samples for the random variables in the problem |
| Cfrodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest | A JUnit test case for LowestCommonAncestors |
| Cfrodo2.algorithms.dpop.stochastic.test.SamplingPhaseTest | JUnit tests for SamplingPhase |
| Cfrodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for DPOPagent |
| Cfrodo2.algorithms.afb.test.AFBagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for AFB |
| Cfrodo2.algorithms.dpop.param.test.ParamDPOPtest< V extends Addable< V >, U extends Addable< U > > | JUnit test for Param-DPOP |
| Cfrodo2.algorithms.dpop.stochastic.test.E_DPOPagentTest< V extends Addable< V > > | A JUnit test case for E[DPOP] |
| Cfrodo2.algorithms.dpop.stochastic.robust.test.Robust_E_DPOPagentTest< V extends Addable< V > > | Unit tests for Robust-E[DPOP] |
| Cfrodo2.algorithms.synchbb.test.SynchBBagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for SynchBB |
| Cfrodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener | The listener that checks the messages sent by the UTILpropagation listeners |
| Cfrodo2.algorithms.duct.tests.DUCTagentTest | JUnit test for DUCT |
| Cfrodo2.algorithms.duct.tests.DUCTagentChildSearchTest | JUnit test for DUCT |
| Cfrodo2.algorithms.duct.tests.DUCTagentChildTest | JUnit test for DUCT |
| Cfrodo2.algorithms.duct.tests.DUCTagentPruningSearchTest | JUnit test for DUCT |
| Cfrodo2.algorithms.duct.tests.DUCTagentPruningTest | JUnit test for DUCT |
| Cfrodo2.algorithms.duct.tests.NormalizeInfTest | |
| Cfrodo2.algorithms.duct.tests.NormalizeTest | |
| Cfrodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for the DSA agent |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for the MGM agent |
| Cfrodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for the MGM agent |
| Cfrodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > > | The MPC-DisCSP4 algorithm for DisCSP with privacy guarantees |
| Cfrodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ODPOP agent |
| Cfrodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ODPOP agent |
| Cfrodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ODPOP agent |
| Cfrodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > > | Test for the ODPOP UTIL propagation module |
| Cfrodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > > | Test for the ODPOP VALUE propagation module |
| Cfrodo2.algorithms.reformulation.ProblemRescaler< U extends Addable< U > > | A module that rescales the problem |
| Cfrodo2.algorithms.test.MessageDebugger | Prints out all messages received and sent by the agent |
| Cfrodo2.algorithms.test.SampleMASagent | A sample MAS agent that just prints its problem |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable > | Selects the next child as the one that has the highest score |
| Cfrodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest | JUnit test for the class DFSgeneration |
| Cfrodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest | Tests the DFSgenerationParallel module |
| Cfrodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest | JUnit for DFSgeneration with Order |
| Cfrodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable > | This distributed leader election protocol chooses a leader agent as the one with highest unique ID |
| Cfrodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable > | Protocol to elect a variable |
| Cfrodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > > | JUnit test for the class LeaderElectionMaxID |
| Cfrodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest.IdIncreasingVerifyer | A IncomingMsgPolicyInterface used in JUNIT VarElectionMessengerTest to test whenever ID send are strictly increasing |
| Cfrodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable > | JUnit test for the class VariableElection |
| Cfrodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest | Unit tests for CentralLinearOrdering |
| Cfrodo2.communication.mailer.tests.testCentralMailer | Test suite for the CentralMailer |
| Cfrodo2.communication.sharedMemory.QueueIOPipeTest.Collector | A listener that collects received messages |
| Cfrodo2.controller.ConfigurationManager | The ConfigurationManager takes care of setting up the experiments |
| Cfrodo2.daemon.LocalConfigManager | A local configuration manager that parses configuration files passed to the daemon |
| Cfrodo2.controller.TestConfigurationManager.SimpleDaemonListener | A simple class that listens for messages sent to a daemon |
| Cfrodo2.controller.WhitePages | |
| Cfrodo2.controller.TestWhitePages.WhitePagesExtention | Extention of the white pages that enables one to get the list of daemons, the list of agents and the local address of the white pages |
| Cfrodo2.controller.userIO.UserIO | This class implements all the functions that a user interface should deliver |
| Cfrodo2.controller.userIO.Console | A simple console based user interface |
| Cfrodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U > | An interface to the Controller (and a wrapper thereof) that is based on a solver |
| Cfrodo2.daemon.Constructor | |
| Cfrodo2.daemon.LocalWhitePages | |
| Cfrodo2.daemon.TestLocalWhitePages.LocalWhitePagesExtension | An extension of the local white pages that is able to return the list of agents |
| Cfrodo2.daemon.TestLocalWhitePages.SimpleAgent | A simple agent for testing purposes |
| Cfrodo2.daemon.userIO.UserIO | |
| Cfrodo2.daemon.userIO.Console | A simple console based user interface |
| Cfrodo2.communication.OutgoingMsgPolicyInterface< T > | This interface describes a listener that is notified by a queue of outgoing messages |
| Cfrodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E > | P2-DPOP's UTIL propagation module, using partially homomorphic encryption on utilities and a linear order on variables |
| Cfrodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E > | P2-DPOP's variable re-ordering algorithm |
| Cfrodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > > | Module that intercepts messages during UTIL and VALUE propagation and obfuscates the variable names, variable domains, and utility values |
| Cfrodo2.algorithms.dpop.restart.UTILreuse | UTIL message storage for warm restarts of S-DPOP |
| Cfrodo2.algorithms.test.MessageDebugger | Prints out all messages received and sent by the agent |
| Cfrodo2.communication.MessageWrapper | Message wrapper, used to store information on |
| Cfrodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >.Method | The method to use to choose the optimal value for a variable |
| Cfrodo2.benchmarks.party.PartyGame.Method | The method used to formulate the game as a DisCSP |
| CMin | |
| Corg.jacop.constraints.MinCloneable | A cloneable version of the Min constraint |
| CMinSimple | |
| Corg.jacop.constraints.MinSimpleCloneable | A cloneable version of the MinSimple constraint |
| Cfrodo2.benchmarks.meetings.MeetingScheduling.Mode | The mode of encoding |
| Cfrodo2.algorithms.mpc_discsp.MPC_DisCSP4< V > | |
| Cfrodo2.algorithms.mpc_discsp.MPC_DisWCSP4< V extends Addable< V > > | The MPC-DisWCSP4 algorithm for DisWCSP with privacy guarantees |
| Cfrodo2.gui.Visualizer.MsgVisualization | Whether and how long to display a message type |
| Cfrodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.MultiPhase | The phases in a multiplication operation |
| CNetworkBuilder | |
| Corg.jacop.constraints.netflow.NetworkBuilderCloneable | A cloneable version of NetworkBuilder |
| Corg.jacop.constraints.SoftAlldifferentCloneable.SoftAlldiffBuilderCloneable | A NetworkBuilder for SoftAlldifferent |
| Corg.jacop.constraints.SoftGCCCloneable.SoftGCCBuilderCloneable | A NetworkBuilder for SoftGCCCloneable |
| Corg.jacop.constraints.netflow.ArithmeticCloneable.ArithmeticBuilderCloneable | A cloneable version of ArtithmeticBuilder |
| CNetworkFlow | |
| Corg.jacop.constraints.netflow.NetworkFlowCloneable | A cloneable version of the NetworkFlow constraint |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.NextChildChoiceHeuristic | Interface for heuristics used to choose a variable's next child from its list of open neighbors |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.BlindScoringHeuristic< S extends Comparable< S > &Serializable > | A DFS heuristic based on a ScoringHeuristic that does not require message exchange between agents |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > > | Class for every node in the GoodsTree |
| Cfrodo2.algorithms.odpop.goodsTree.leafNodeTree.Node | |
| Cfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNode< Val extends Addable< Val > > | |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > | |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > > | The inner node of a tree |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > > | The leaf node of a tree |
| Cfrodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo | Information about a node in the DFS |
| CNoGood | |
| Corg.jacop.constraints.NoGoodCloneable | A cloneable version of the NoGood constraint |
| CNonOverlapping | |
| Corg.jacop.constraints.geost.NonOverlappingCloneable | A cloneable version of NonOverlapping |
| CNooverlap | |
| Corg.jacop.constraints.diffn.NooverlapCloneable | A cloneable version of the Nooverlap constraint |
| Cfrodo2.algorithms.duct.Normalize< V > | |
| Cfrodo2.algorithms.duct.NormalizeInf< V extends Addable< V > > | This module is a preprocessing module that normalizes all utilities to between 0 and 1 |
| CNot | |
| Corg.jacop.constraints.NotCloneable | A cloneable version of the Not constraint |
| COr | |
| Corg.jacop.constraints.OrCloneable | A cloneable version of the Or constraint |
| COrBool | |
| Corg.jacop.constraints.OrBoolCloneable | A cloneable variant of the OrBool constraint |
| COrBoolSimple | |
| Corg.jacop.constraints.OrBoolSimpleCloneable | A cloneable version of the OrBoolSimple constraint |
| COrBoolVector | |
| Corg.jacop.constraints.OrBoolVectorCloneable | A cloneable variant of the OrBoolVector constraint |
| Cfrodo2.communication.OutgoingMsgPolicyInterface< MessageType > | |
| Cfrodo2.communication.QueueTest.ConstantMsgPolicy | A message policy that always returns the same decision |
| Cfrodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V, E > | |
| Cfrodo2.algorithms.dpop.privacy.test.P3halves_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E > | A JUnit test for the P3/2-DPOP agent |
| Cfrodo2.algorithms.dpop.privacy.P_DPOPsolver< V > | |
| Cfrodo2.algorithms.dpop.privacy.P3halves_DPOPsolver< V extends Addable< V > > | A solver for P-DPOP with rerooting |
| Cfrodo2.algorithms.mpc_discsp.PaillierCryptoScheme | The Paillier crypto scheme |
| Cfrodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > > | An optimal solution to the problem |
| Cfrodo2.algorithms.ParserInterface< V extends Addable< V >, U extends Addable< U > > | Interface for a parser that produces a ProblemInterface |
| Cfrodo2.algorithms.ParserInterface< V, U > | |
| Cfrodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > > | A MASproblem parser that is able to handle multiple types of agents |
| Cfrodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > > | An XCSP parser that provides convenient methods to extract information from XCSP files |
| Cfrodo2.benchmarks.vehiclerouting.XCSPparserVRP< U extends Addable< U > > | A parser for XCSP files involving constraints of type "global:vehicle_routing" |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > > | An XCSP parser that generates spaces based on JaCoP |
| Cfrodo2.benchmarks.party.PartyGame | A random problem generator for the party game |
| Cfrodo2.benchmarks.party.PartyGame.PartyInstance | An instance of a party game |
| Cfrodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair | A patient-donor pair |
| Cfrodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.Phase | A phase of the algorithm |
| Cfrodo2.communication.PipeFactory | |
| Cfrodo2.communication.tcp.TCPPipeFactory | |
| CPoint | |
| Cfrodo2.solutionSpaces.vehiclerouting.Customer | A customer in the Vehicle Routing Problem |
| Cfrodo2.benchmarks.kidneys.KidneyExchange.PRA | Panel Reactive Antibody levels |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > > | This interface is used to implement the different heuristics for obtaining lower bounds |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val, U > | |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP0< Val extends Addable< Val >, U extends Addable< U > > | Implementation of the DP0 heuristic |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP1< Val extends Addable< Val >, U extends Addable< U > > | Implementation of the DP1 heuristic |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP2< Val extends Addable< Val >, U extends Addable< U > > | Implementation of the DP2 heuristic |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.SimpleHeuristic< Val extends Addable< Val >, U extends Addable< U > > | This simple heuristic sets all lower bounds to zero, and should be used when running the original adopt |
| Cfrodo2.solutionSpaces.ProblemInterface< V, U > | |
| Cfrodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > > | The subproblem to be solved by a given agent |
| Cfrodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > > | An abstract problem instance |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > > | A DCOP problem that is defined using JaCoP variables and constraints |
| Cfrodo2.solutionSpaces.MASProblemInterface< V extends Addable< V >, U extends Addable< U > > | |
| Cfrodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > > | A MASproblem parser that is able to handle multiple types of agents |
| Cfrodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.ProjOutput< V extends Addable< V >, U extends Addable< U > > | The result of a projection |
| Cfrodo2.communication.QueueInputPipeInterface | Interface for classes used as an input to a Queue object |
| Cfrodo2.communication.QueueTest.QueueInputPipeTrivial | This pipe has a list of messages ready to be pulled using pullMessage() |
| Cfrodo2.communication.sharedMemory.QueueIOPipe | Input-output pipe between two queues |
| Cfrodo2.communication.tcp.QueueInputPipeTCP | This is a queue input pipe that receives messages through TCP |
| Cfrodo2.communication.QueueOutputPipeInterface | Interface for classes used as an output of a Queue object |
| Cfrodo2.communication.QueueTest.QueueOutputPipeTrivial | This pipe stores the messages passed to it using pushObject() |
| Cfrodo2.communication.sharedMemory.QueueIOPipe | Input-output pipe between two queues |
| Cfrodo2.communication.tcp.QueueOutputPipeTCP | This is a queue output pipe that sends messages through TCP |
| Cfrodo2.algorithms.RandGraphFactory | Generator of random graphs |
| Cfrodo2.communication.tcp.QueueOutputPipeTCP.RawDataInfo | A convenience class used to store information about raw data |
| CRegular | |
| Corg.jacop.constraints.regular.RegularCloneable | A cloneable version of the Regular constraint |
| CReified | |
| Corg.jacop.constraints.ReifiedCloneable | A cloneable version of the Reified constraint |
| Cfrodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.Relation< V extends Addable< V >, U extends Addable< U > > | The representation of an XCSP relation |
| CRunnable | |
| Cfrodo2.communication.MsgSizeMonitor | Measures message sizes using serialization |
| Cfrodo2.communication.Queue | A queue |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue | There is one such FakeQueue for each candidate root |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.SinkQueue | A Queue that discards all messages sent |
| Cfrodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable > | Protocol to elect a variable |
| Cfrodo2.communication.mailer.CentralMailer.FakeQueue | The queue associated with a specific agent |
| Cfrodo2.communication.tcp.QueueOutputPipeTCP | This is a queue output pipe that sends messages through TCP |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > > | A wrapper around a JaCoP DepthFirstSearch that is used to run this search in a new thread |
| Cfrodo2.algorithms.duct.Sampling< V > | |
| Cfrodo2.algorithms.duct.SamplingPruning< V extends Addable< V > > | |
| CSampling< V >VariableInfo | |
| Cfrodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo | Convenience class to hold variable information |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V, U > | |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > > | The version of the SamplingPhase that samples at the lcas |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > > | The version of the SamplingPhase that samples at the leaves |
| Cfrodo2.algorithms.duct.samplingMethods.SamplingProcedure< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.samplingMethods.SamplingProcedure< V > | |
| Cfrodo2.algorithms.duct.samplingMethods.SamplingB< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.samplingMethods.SamplingB_Child< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.samplingMethods.SamplingM< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.samplingMethods.SamplingM_Child< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.samplingMethods.SamplingR< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.SamplingPruning< V > | |
| Cfrodo2.algorithms.duct.SamplingChild< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > > | |
| CSamplingPruning< V >VariableInfo | |
| Cfrodo2.algorithms.duct.SamplingChild< V extends Addable< V > >.VariableInfo | Convenience class to hold variable information |
| Cfrodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo | Convenience class to hold variable information |
| Cfrodo2.algorithms.duct.SamplingPruningSearch< V > | |
| Cfrodo2.algorithms.duct.SamplingChildSearch< V extends Addable< V > > | |
| CSamplingPruningSearch< V >VariableInfo | |
| Cfrodo2.algorithms.duct.SamplingChildSearch< V extends Addable< V > >.VariableInfo | Convenience class to hold variable information |
| Cfrodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V, U > | |
| Cfrodo2.solutionSpaces.hypercube.ScalarSpaceIter< V extends Addable< V >, U extends Addable< U > > | A solution iterator for a scalar space |
| Cfrodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator | Iterator |
| Cfrodo2.solutionSpaces.hypercube.ScalarSpaceIter< V, U > | |
| Cfrodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.MyIter | This class' special iterator |
| Cfrodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter | This class' special iterator |
| Cfrodo2.algorithms.heuristics.ScoringHeuristic< S extends Comparable< S > &Serializable > | Interface for a heuristic that associates a score to every variable |
| Cfrodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >.VarElectionHeuristic | Heuristic used for variable election |
| Cfrodo2.algorithms.heuristics.ScoringHeuristic< Integer > | |
| Cfrodo2.algorithms.heuristics.RandScoringHeuristic | A ScoringHeuristic that assigns random scores to variables |
| Cfrodo2.algorithms.heuristics.ScoringHeuristic< ScorePair< S1, S2 > > | |
| Cfrodo2.algorithms.heuristics.ScoringHeuristicWithTiebreaker< S1 extends Comparable< S1 > &Serializable, S2 extends Comparable< S2 > &Serializable > | A scoring heuristic that supports tiebreaking |
| Cfrodo2.algorithms.heuristics.ScoringHeuristic< Short > | |
| Cfrodo2.algorithms.heuristics.LeastConnectedHeuristic | A ScoringHeuristic in which the score for a variable is MINUS its number of neighbors |
| Cfrodo2.algorithms.heuristics.MostConnectedHeuristic | A ScoringHeuristic in which the score for a variable is its number of neighbors |
| Cfrodo2.algorithms.heuristics.SmallestDomainHeuristic | A scoring heuristic in which the score is MINUS the domain size of the variable |
| Cfrodo2.algorithms.heuristics.ScoringHeuristic< String > | |
| Cfrodo2.algorithms.heuristics.VarNameHeuristic | A scoring heuristic that returns the variables' names |
| Cfrodo2.algorithms.duct.SearchNode< V extends Addable< V > > | Convenience class to store information associated to a specific state |
| Cfrodo2.algorithms.duct.SearchNode< V > | |
| Cfrodo2.algorithms.duct.SearchNodeChild< V extends Addable< V > > | Convenience class to store information associated to a specific state |
| Cfrodo2.algorithms.duct.SearchNodePruning< V extends Addable< V > > | Convenience class to store information associated to a specific state |
| CSeqPrecedeChain | |
| Corg.jacop.constraints.SeqPrecedeChainCloneable | A Cloneable version of the SeqPrecedeChain constraint |
| CSequence | |
| Corg.jacop.constraints.SequenceCloneable | A cloneable version of the Sequence constraint |
| CSerializable | |
| Cfrodo2.algorithms.heuristics.ScorePair< S1 extends Comparable< S1 > &Serializable, S2 extends Comparable< S2 > &Serializable > | A pair of scores, the second being used for tiebreaking |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.BinaryAssignment< Val extends Addable< Val > > | |
| Cfrodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > > | |
| Cfrodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > > | This class is designed to store GOODs received by a node from its children, and is used in the O-DPOP algorithm |
| Cfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > > | |
| Cfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > > | |
| Cfrodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > > | The view of the DFS from one variable |
| Cfrodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.IntIntStringTuple | An (int, int, String) tuple |
| Cfrodo2.communication.AgentAddress | The address for an agent |
| Cfrodo2.communication.tcp.TCPAddress | A TCP/IP-port address |
| Cfrodo2.communication.MessageType | The (hierarchical) type of a message |
| Cfrodo2.communication.MessageWithRawData.RawDataHandler | This class is responsible for handling the raw data |
| Cfrodo2.communication.tcp.RawDataHandlerTCP | A raw data handler that works with TCP |
| Cfrodo2.communication.sharedMemory.QueueIOPipe | Input-output pipe between two queues |
| Cfrodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > > | A general problem |
| Cfrodo2.solutionSpaces.SolutionSpace< V extends Addable< V > > | This interface defines common functionalities in all solution spaces |
| Cfrodo2.solutionSpaces.crypto.CryptoScheme< C extends Serializable, E extends Serializable, K extends CryptoScheme.PublicKeyShare > | Defines a way to encrypt and decrypt information |
| Cfrodo2.algorithms.dpop.privacy.test.FakeCryptoScheme | A fake CryptoScheme used to test and debug P2-DPOP |
| Cfrodo2.solutionSpaces.crypto.CryptoScheme< C extends Serializable, E extends Serializable, K extends CryptoScheme.PublicKeyShare >.PublicKeyShare | One share of the overall public key |
| Cfrodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakePublicKeyShare | A share of the (unused) public key |
| Cfrodo2.solutionSpaces.crypto.ElGamalScheme.ElGamalPublicKeyShare | A public key share |
| CShape | |
| Corg.jacop.constraints.geost.ShapeCloneable | A cloneable version of Shape |
| CSimpleSolutionListener | |
| Cfrodo2.solutionSpaces.JaCoP.IterSolutionListener< V extends Addable< V > > | This solution listener is a part of the JaCoPutilSpace iterator that allows us to simulate a JaCoP master/slave search combination where the slave is an optimization search while the master is not |
| CSimpleTable | |
| Corg.jacop.constraints.table.SimpleTableCloneable | A cloneable version of the SimpleTable constraint |
| CSoftAlldifferent | |
| Corg.jacop.constraints.SoftAlldifferentCloneable | A cloneable version of the SoftAllDifferent constraint |
| CSoftGCC | |
| Corg.jacop.constraints.SoftGCCCloneable | A cloneable version of the SoftGCC constraint |
| Cfrodo2.algorithms.Solution< V, U > | An optimal solution to the problem |
| Cfrodo2.algorithms.SolutionWithConvergence< V extends Addable< V >, U > | An optimal solution to the problem |
| Cfrodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.StochSolution< V, U > | A solution to a StochDCOP, including the expected and worst-case utilities |
| Cfrodo2.algorithms.duct.DUCTSolution< V extends Addable< V > > | Solution class for the family of DUCT algorithms |
| Cfrodo2.algorithms.odpop.ODPOPsolution< V, U > | An optimal solution to the problem |
| Cfrodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U > | An optimal solution to the problem |
| Cfrodo2.algorithms.dpop.count.SolutionCounter< V extends Addable< V >, U extends Addable< U > > | Counts the number of optimal solutions in a DCOP |
| Cfrodo2.solutionSpaces.SolutionSpace< V > | |
| Cfrodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable > | This interface defines common functionalities in all utility solution spaces |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPoptAssignments | Conditional optimal assignment(s) to several variables |
| Cfrodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable > | A basic hypercube that stores one utility per combination of assigments to variables |
| Cfrodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V > | A SolutionSpace iterator that skips infeasible solutions |
| Cfrodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.SparseIterator< V, U > | A BasicUtilitySolutionSpace iterator that skips infeasible solutions |
| Cfrodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.Iterator< V, U > | A BasicUtilitySolutionSpace iterator that doest NOT skip infeasible solutions |
| Cfrodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.Iterator< V, U > | A UtilitySolutionSpace iterator that does NOT skip infeasible solutions |
| Cfrodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.IteratorBestFirst< V, U > | A BasicUtilitySolutionSpace iterator that returns items in a best first order |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > > | A solution iterator in best first order for JaCoPutilSpace |
| Cfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > > | An iterator in best-first order |
| Cfrodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator | Best first iterator for the combination of a VehicleRoutingSpace with a collection of sum constraints |
| Cfrodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst | Best first iterator |
| Cfrodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > > | An iterator for a JoinOutputHypercube |
| Cfrodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable > | A solution iterator for BasicHypercubes |
| Cfrodo2.solutionSpaces.hypercube.HypercubeIter< V extends Addable< V >, U extends Addable< U > > | An iterator for a Hypercube |
| Cfrodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable > | A solution iterator for a scalar space |
| Cfrodo2.solutionSpaces.hypercube.ScalarSpaceIter< V extends Addable< V >, U extends Addable< U > > | A solution iterator for a scalar space |
| Cfrodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U > | A UtilitySolutionSpace iterator that skips infeasible solutions |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > > | A solution iterator for JaCoPutilSpace that runs a JaCoP search in an extra thread |
| Cfrodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.Iterator< V, U > | A UtilitySolutionSpace iterator that does NOT skip infeasible solutions |
| Cfrodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V > | An iterator that does NOT skip infeasible solutions |
| Cfrodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.Iterator< V, U > | A BasicUtilitySolutionSpace iterator that doest NOT skip infeasible solutions |
| Cfrodo2.algorithms.duct.Sampling< V extends Addable< V > >.State< V extends Addable< V > > | Convenience class to store a context |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.StateValue | The state of the current variable: |
| Cfrodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.StateValue | The state of the current variable: |
| Corg.jacop.core.Store | |
| Corg.jacop.core.StoreCloneable | A JaCoP store that support cloning |
| CStretch | |
| Corg.jacop.constraints.StretchCloneable | A cloneable version of the Stretch constraint |
| CSubcircuit | |
| Corg.jacop.constraints.SubcircuitCloneable | A cloneable version of the Subcircuit constraint |
| CSum | |
| Corg.jacop.constraints.SumCloneable | A cloneable version of the Sum constraint |
| CSumBool | |
| Corg.jacop.constraints.SumBoolCloneable | A cloneable SumBool constraint |
| Corg.jacop.constraints.SumInt | |
| Corg.jacop.constraints.SumIntCloneable | A clonable version of JaCoP's SumInt constraint |
| CSumWeight | |
| Corg.jacop.constraints.SumWeightCloneable | A cloneable version of the SumWeight constraint |
| CTable | |
| Corg.jacop.constraints.table.TableCloneable | A cloneable version Table constraint |
| Cfrodo2.algorithms.duct.termination.TerminationCondition< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.termination.TerminationCondition< V > | |
| Cfrodo2.algorithms.duct.termination.TerminateBest< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.termination.TerminateBest_Child< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.termination.TerminateMean< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.termination.TerminateRegret< V extends Addable< V > > | |
| Cfrodo2.algorithms.duct.termination.TerminateRegret_Child< V extends Addable< V > > | |
| CTestCase | |
| Cfrodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for ADOPTagent |
| Cfrodo2.algorithms.adopt.test.testADOPT | This class is used to test the workings of the ADOPT listener |
| Cfrodo2.algorithms.adopt.test.testPreprocessing | JUnit tests for the Preprocessing module |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ASODPOP agent |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for the class ASODPOP |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for the class ASODPOP |
| Cfrodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ASODPOP agent |
| Cfrodo2.algorithms.asodpop.tests.AllTestsASODPOP | Tests for the ASODPOP algorithm |
| Cfrodo2.algorithms.dpop.count.test.TestCountSolutions | |
| Cfrodo2.algorithms.dpop.memory.tests.MB_DPOPagentTest | An overall unit test for the MB-DPOP algorithm |
| Cfrodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest | Junit test to test the FakeCryptoScheme |
| Cfrodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E > | JUnit test for P_DPOP agent |
| Cfrodo2.algorithms.dpop.privacy.test.P_DPOPagentTest< V extends Addable< V > > | JUnit test for P_DPOP agent |
| Cfrodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest | Test case for the module SecureCircularRouting |
| Cfrodo2.algorithms.dpop.privacy.test.SecureRerootingTest | JUnit test for the SecureRerooting module |
| Cfrodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > > | Unit tests for VariableObfuscation |
| Cfrodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > > | JUnit tests for Util reuse in S-DPOP |
| Cfrodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest | A JUnit test case for LowestCommonAncestors |
| Cfrodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test for DPOPagent |
| Cfrodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > > | JUnit test for the class UTILpropagation |
| Cfrodo2.algorithms.dpop.param.test.ParamUTILtest< U extends Addable< U > > | JUnit test for the class ParamUTIL |
| Cfrodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest | JUnit tests for ExpectedUTIL |
| Cfrodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > > | JUnit test for the class VALUEpropagation |
| Cfrodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > > | JUnit test for the class ParamVALUE |
| Cfrodo2.algorithms.duct.tests.AllTestsDUCT | Tests for the DUCT algorithm |
| Cfrodo2.algorithms.duct.tests.DUCTagentTest | JUnit test for DUCT |
| Cfrodo2.algorithms.duct.tests.NormalizeInfTest | |
| Cfrodo2.algorithms.duct.tests.NormalizeTest | |
| Cfrodo2.algorithms.localSearch.dsa.tests.AllTestsDSA | Tests for the DSA algorithm |
| Cfrodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for the DSA agent |
| Cfrodo2.algorithms.localSearch.dsa.tests.TestDSA< U extends Addable< U > > | JUnit tests for the DSA algorithm |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for the MGM agent |
| Cfrodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit tests for the MGM agent |
| Cfrodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable< U > > | Unit tests for the Max-Sum algorithm |
| Cfrodo2.algorithms.mpc_discsp.tests.MPC_DisWCSP4tests | JUnit tests for the MPC-Dis(W)CSP4 algorithms |
| Cfrodo2.algorithms.odpop.tests.AllTestsODPOP | Tests for the O-DPOP algorithm |
| Cfrodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ODPOP agent |
| Cfrodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ODPOP agent |
| Cfrodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > > | JUnit test of the ODPOP agent |
| Cfrodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > > | Test for the ODPOP UTIL propagation module |
| Cfrodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > > | Test for the ODPOP VALUE propagation module |
| Cfrodo2.algorithms.test.MASparserTest | |
| Cfrodo2.algorithms.test.ProblemTest | JUnit test case for the class Problem |
| Cfrodo2.algorithms.test.XCSPparserTest | Test suite for XCSPparser |
| Cfrodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest | JUnit test for the class DFSgeneration |
| Cfrodo2.algorithms.varOrdering.dfs.tests.LocalRandVarsDFStest | Test case for LocalRandVarsDFS |
| Cfrodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > > | JUnit test for the class LeaderElectionMaxID |
| Cfrodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable > | JUnit test for the class VariableElection |
| Cfrodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest | Unit tests for CentralLinearOrdering |
| Cfrodo2.communication.MsgSizeMonitorTest | Unit tests for the MsgSizeMonitor |
| Cfrodo2.communication.QueueTest | A JUnit class to test Queue |
| Cfrodo2.communication.mailer.tests.testCentralMailer | Test suite for the CentralMailer |
| Cfrodo2.communication.sharedMemory.QueueIOPipeTest | JUnit class to test QueueIOPipe |
| Cfrodo2.communication.tcp.QueueInputPipeTCPTest | A JUnit test class for QueueInputPipeTCP |
| Cfrodo2.communication.tcp.QueueOutputPipeTCPTest | A JUnit test class for QueueOutputPipeTCP, that uses QueueInputPipeTCP |
| Cfrodo2.controller.TestConfigurationManager | A JUnit test class for the configuration manager |
| Cfrodo2.controller.TestController | |
| Cfrodo2.controller.TestWhitePages | |
| Cfrodo2.daemon.TestLocalWhitePages | |
| Cfrodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > > | A JUnit TestCase for the JaCoPproblem class |
| Cfrodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > > | JUnit test for JaCoPutilSpace |
| Cfrodo2.solutionSpaces.JaCoP.tests.JaCopxcspParserTest | Test suite for JaCopxcspParser |
| Cfrodo2.solutionSpaces.crypto.ElGamalSchemeTest | Junit Class to test the ElGamalScheme |
| Cfrodo2.solutionSpaces.hypercube.tests.HypercubeIterBestFirstTest | |
| Cfrodo2.solutionSpaces.hypercube.tests.HypercubeIterTest | JUnit tests for the BasicHypercube iterator |
| Cfrodo2.solutionSpaces.hypercube.tests.HypercubeTest | A class used to test the Hypercube class |
| Cfrodo2.solutionSpaces.vehiclerouting.test.VRPtests | JUnit tests for the Vehicle Routing Problem benchmarks |
| CThread | |
| Cfrodo2.communication.QueueTest.QueueInputPipeTrivial | This pipe has a list of messages ready to be pulled using pullMessage() |
| Cfrodo2.communication.mailer.CentralMailer | Centralized mail man that enforces that only one agent is awake at a time, which is useful to measure distributed runtime |
| Cfrodo2.communication.tcp.QueueInputPipeTCP | This is a queue input pipe that receives messages through TCP |
| Cfrodo2.communication.tcp.QueueInputPipeTCP.Receiver | Whenever a request for connection is received, one such a thread is spawn to establish the connection |
| Cfrodo2.communication.tcp.QueueInputPipeTCPTest.Sender | A client that connects to the queue and to send serialized messages through TCP |
| Cfrodo2.communication.tcp.QueueOutputPipeTCP.RawDataSender | A thread that listens for requests to serialize or discard raw data |
| Cfrodo2.communication.tcp.QueueOutputPipeTCP.RawDataServer | The thread responsible for waiting for requests for raw data |
| Cfrodo2.controller.userIO.UserIO | This class implements all the functions that a user interface should deliver |
| Cfrodo2.daemon.userIO.UserIO | |
| Cfrodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >.TimeStamp< U extends Addable< U > > | Convenience class containing a timestamp and utility value |
| CTreeCellEditor | |
| Cfrodo2.gui.VisualizerControls.MsgTypeRenderer | Renders each node in the tree as a message type name and a slider |
| CTreeCellRenderer | |
| Cfrodo2.gui.VisualizerControls.MsgTypeRenderer | Renders each node in the tree as a message type name and a slider |
| CTreeExpansionListener | |
| Cfrodo2.gui.VisualizerControls | A GUI to control how long messages are displayed |
| Cfrodo2.solutionSpaces.UtilitySolutionSpaceLimited< V, U, U > | |
| Cfrodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | This interface defines common functionalities in utility solution spaces in which the utilities are Addable |
| Cfrodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > > | A UtilitySolutionSpace based on JaCoP as a local solver |
| Cfrodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > > | The class representing a hypercube |
| Cfrodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > > | |
| Cfrodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > > | A solution space for Vehicle Routing Problems |
| Cfrodo2.algorithms.asodpop.UTILmsg< Val, U > | |
| Cfrodo2.algorithms.asodpop.UTILdomMsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILmsg< Val, U > | |
| Cfrodo2.algorithms.asodpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILdomMsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILvarsMsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val, U, LeafNode< U > > | |
| Cfrodo2.algorithms.odpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > > | The UTIL propagation phase for O-DPOP |
| Cfrodo2.algorithms.odpop.UTILpropagationBinaryDomains< Val extends Addable< Val >, U extends Addable< U > > | The UTIL propagation phase for O-DPOP |
| CUTILpropagationTest< AddableReal >Listener | |
| Cfrodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener | The listener that checks the messages sent by the ExpectedUTIL listeners |
| CUTILpropagationTest< U >Listener | |
| Cfrodo2.algorithms.dpop.param.test.ParamUTILtest< U extends Addable< U > >.Listener | The listener that checks the messages sent by the ParamUTIL listeners |
| Cfrodo2.algorithms.odpop.UTILvarsDomsMsg< Val, U > | |
| Cfrodo2.algorithms.asodpop.UTILvarsDomsMsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.asodpop.UTILvarsMsg< Val, U > | |
| Cfrodo2.algorithms.asodpop.UTILvarsMsgWithDom< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILvarsMsg< Val, U > | |
| Cfrodo2.algorithms.asodpop.UTILvarsMsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILvarsDomsMsg< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| Cfrodo2.algorithms.odpop.UTILvarsMsgWithDom< Val extends Addable< Val >, U extends Addable< U > > | This message contains the util information a child reports to its parent when responding to an ASK message |
| CValuePrecede | |
| Corg.jacop.constraints.ValuePrecedeCloneable | A cloneable version of the ValuePrecede constraint |
| CVALUEpropagationTest< U >Listener | |
| Cfrodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > >.Listener | The listener that checks the messages sent by the ParamUTIL and ParamVALUE listeners |
| CValues | |
| Corg.jacop.constraints.ValuesCloneable | A cloneable version of the Values constraint |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VarAssignment< Val extends Addable< Val >, U extends Addable< U > > | Container for a value assignment and its utility |
| Cfrodo2.algorithms.varOrdering.election.VariableElection< Integer > | |
| Cfrodo2.algorithms.varOrdering.election.SecureVarElection | A version of VariableElection that uses random numbers as scores and lies in order to protect topology privacy |
| Cfrodo2.algorithms.varOrdering.election.tests.VariableElectionTest< Integer > | |
| Cfrodo2.algorithms.varOrdering.election.tests.SecureVarElectionTest | JUnit test for the class SecureVarElection |
| Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > > | Helper class that contains all the info belonging to a specific variable |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > > | Container for information belonging to a specific variable |
| Cfrodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo | A convenience class that contains the following information for a variable |
| Cfrodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo | A convenience class that contains the following information for a variable |
| Cfrodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo | A convenience class used to store information about a variable |
| Cfrodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.VariableInfo | Convent class to store information about a variable |
| Cfrodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo | A convenience class used to store information about a variable |
| Cfrodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo | Convenient class to store information about a variable of this agent |
| Cfrodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo | Convenience class to hold variable information |
| Cfrodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > > | Container class for information needed for each variable |
| Cfrodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > > | Convenience class that contains all necessary information on a single variable |
| Cfrodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > > | Convenience class that contains all necessary information on a single variable |
| Cfrodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo | Convenience class that contains information for a specific variable |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val, U > | |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP0< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo | A container for variable dependent information |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP1< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo | Container for information belonging to a specific variable |
| Cfrodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP2< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo | Convenience class that contains information on a specific variable |
| Cfrodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > > | A variable node in a factor graph |
| Cfrodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.VarInfo | Information about an internal variable |
| Cfrodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.VarInfo | A class containing all the useful information about one of the agent's variables |
| Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Version< Val extends Addable< Val >, U extends Serializable &Addable< U > > | The different versions of adopt handle some things differently |
| Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Version< Val, U > | |
| Cfrodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > > | The original adopt version |
| Cfrodo2.gui.Visualizer | An interface for visualizing agents, variables, constraints, and message exchanges |
| Cfrodo2.gui.ConsoleVisualizer | A simplistic visualizer that just prints to the console |
| Cfrodo2.gui.jung.JungVisualizer | A Visualizer using JUNG2 |
| Cfrodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.WhereToProject | Where the random variables should be projected out |
| Cfrodo2.benchmarks.vehiclerouting.XCSPparserVRP< U > | |
| Cfrodo2.benchmarks.vehiclerouting.XCSPparserVRPODPOP< U extends Addable< U > > | Wrapper around the XCSPparserVRP that inserts CompoundSpaces for all the variables that occur in the problem |
| CXdivYeqZ | |
| Corg.jacop.constraints.XdivYeqZCloneable | A cloneable version of the XdivYeqZ constraint |
| CXeqC | |
| Corg.jacop.constraints.XeqCCloneable | A cloneable version of the XeqC constraint |
| CXeqY | |
| Corg.jacop.constraints.XeqYCloneable | A cloneable version of the XeqY constraint |
| CXexpYeqZ | |
| Corg.jacop.constraints.XexpYeqZCloneable | A cloneable version of the XexpYeqZ constraint |
| CXgtC | |
| Corg.jacop.constraints.XgtCCloneable | A cloneable version of the XqtC constraint |
| CXgteqC | |
| Corg.jacop.constraints.XgteqCCloneable | A cloneable version of the XgteqC constraint |
| CXgteqY | |
| Corg.jacop.constraints.XgteqYCloneable | A cloneable version of the XgteqY constraint |
| CXgtY | |
| Corg.jacop.constraints.XgtYCloneable | A cloneable version of the XgtY constraint |
| CXltC | |
| Corg.jacop.constraints.XltCCloneable | A cloneable version of the XltC constraint |
| CXlteqC | |
| Corg.jacop.constraints.XlteqCCloneable | A cloneable version of the XlteqC constraint |
| CXlteqY | |
| Corg.jacop.constraints.XlteqYCloneable | A cloneable version of the XlteqY constraint |
| CXltY | |
| Corg.jacop.constraints.XltYCloneable | A cloneable version of the XltY constraint |
| CXmodYeqZ | |
| Corg.jacop.constraints.XmodYeqZCloneable | A cloneable version of the XmodYeqZ constraint |
| CXmulCeqZ | |
| Corg.jacop.constraints.XmulCeqZCloneable | A cloneable version of the XmulCeqZ constraint |
| CXmulYeqC | |
| Corg.jacop.constraints.XmulYeqCCloneable | A cloneable version of the XmulYeqC constraint |
| CXmulYeqZ | |
| Corg.jacop.constraints.XmulYeqZCloneable | A cloneable version of the XmulYeqZ constraint |
| CXneqC | |
| Corg.jacop.constraints.XneqCCloneable | A cloneable version of the XneqC constraint |
| CXneqY | |
| Corg.jacop.constraints.XneqYCloneable | A cloneable version of the XneqY constraint |
| CXor | |
| Corg.jacop.constraints.XorCloneable | A cloneable version of the Xor constraint |
| CXorBool | |
| Corg.jacop.constraints.XorBoolCloneable | A cloneable variant of the XorBool constraint |
| CXplusCeqZ | |
| Corg.jacop.constraints.XplusCeqZCloneable | A cloneable version of the XplusCeqZ constraint |
| CXplusClteqZ | |
| Corg.jacop.constraints.XplusClteqZCloneable | A cloneable version of the XplusClteqZ constraint |
| CXplusYeqC | |
| Corg.jacop.constraints.XplusYeqCCloneable | A version of the XplusYeqC constraint |
| CXplusYeqZ | |
| Corg.jacop.constraints.XplusYeqZCloneable | A cloneable version of the XplusYeqZ interface |
| CXplusYgtC | |
| Corg.jacop.constraints.XplusYgtCCloneable | A cloneable version of the XplusYgtC constraint |
| CXplusYlteqZ | |
| Corg.jacop.constraints.XplusYlteqZCloneable | A cloneable version of the XplusYlteqZ constraint |