Here is a list of all class members with links to the classes they belong to:

- c -

• C() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.C< Val extends Addable< Val >, U extends Addable< U > >
• c : frodo2.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 > >, frodo2.algorithms.afb.PA< V extends Addable< V >, U extends Addable< U > >
• calculateCurrentUtility() : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• calculateDP1() : frodo2.algorithms.adopt.test.testPreprocessing
• calculateDP2() : frodo2.algorithms.adopt.test.testPreprocessing
• calculateGain() : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• calculateOffer() : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• calculateUB() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.LeafNode< U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• calculateUBTest() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.LeafNode< U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• calculateUtility() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• can_move : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• cancelCellEditing() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• candAgent : frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• candidate : frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• canGiveTo() : frodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair
• ccs : frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.VarInfo, frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo
• ccsByChild : frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo
• centralization : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.StochSolution< V, U >
• CentralLinearOrdering() : frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >
• CentralLinearOrderingTest() : frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest
• CentralMailer() : frodo2.communication.mailer.CentralMailer
• certainty : frodo2.solutionSpaces.crypto.ElGamalScheme
• change : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper
• changeChild() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• changeDummyToReal() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• changeLeafName() : frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >
• changeRatio : frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >
• changeVariablesOrder() : frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• ChannelImplyCloneable() : org.jacop.constraints.ChannelImplyCloneable
• ChannelReifCloneable() : org.jacop.constraints.ChannelReifCloneable
• check1() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• check2() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• check3() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• check4() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• check5() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• checkAllCostsNonNeg() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• checkArgs() : frodo2.benchmarks.auctions.main.CATSToXCSP
• checkChildInfo() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > >
• checkDFS() : frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest
• checkDummy() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• checkForTermination() : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >
• checkGood() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >
• checkIndexesVsHypercube() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube
• checkLeaf() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• checkModulus() : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• checkMostConnected() : frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest
• checkOutput() : frodo2.algorithms.afb.test.AFBagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.param.test.ParamDPOPtest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.param.test.ParamUTILtest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.stochastic.robust.test.Robust_E_DPOPagentTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.E_DPOPagentTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener, frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest, frodo2.algorithms.dpop.stochastic.test.SamplingPhaseTest, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.synchbb.test.SynchBBagentTest< V extends Addable< V >, U extends Addable< U > >
• checkOutputs() : frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.algorithms.varOrdering.election.tests.SecureVarElectionTest, frodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest, frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >
• checkTimestamp() : frodo2.communication.mailer.CentralMailer
• checkTree() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• checkUniqueConstraintNames() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• checkUpperBounds() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• checkUpperBoundSums() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• CHILD_MSG_TYPE : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
• CHILD_ORDER_MSG_TYPE : frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >
• childB : frodo2.algorithms.duct.SearchNodeChild< V extends Addable< V > >
• childFlags : frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo
• CHILDmsg() : frodo2.algorithms.varOrdering.dfs.CHILDmsg
• CHILDorderMsg() : frodo2.algorithms.varOrdering.dfs.CHILDorderMsg
• CHILDrandMsg() : frodo2.algorithms.varOrdering.dfs.CHILDrandMsg
• children : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo, frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue
• childrenPointer : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo
• childrenVariables : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• childrenVariablesReportingOrder : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• chooseOrder() : frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom< V extends Addable< V >, U extends Addable< U > >
• chooseSamples() : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >
• CircuitCloneable() : org.jacop.constraints.CircuitCloneable
• classOfE : frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >
• classOfU : frodo2.algorithms.afb.PA< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable< U > >
• classOfV : frodo2.algorithms.afb.PA< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• classOfValuations : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >
• cleanProblem() : frodo2.controller.ConfigurationManager
• cleanQueue() : frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• clear() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.adopt.ADOPTsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.afb.AFBsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.P3halves_DPOPsolver< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.Complete_E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.DUCTsolver< V extends Addable< V > >, frodo2.algorithms.localSearch.dsa.DSAsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2solver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGMsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.ODPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBBsolver< V extends Addable< V >, U extends Addable< U > >
• clearAgents() : frodo2.controller.Controller, frodo2.daemon.Daemon
• cleartextPlusInf : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme
• clone() : frodo2.algorithms.afb.PA< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.afb.Timestamp, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.MessageWith2Payloads< T1 extends Serializable, T2 extends Serializable >, frodo2.communication.MessageWith3Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable >, frodo2.communication.MessageWith4Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable, T4 extends Serializable >, frodo2.communication.MessageWith5Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable, T4 extends Serializable, T5 extends Serializable >, frodo2.communication.MessageWithPayload< T extends Serializable >, frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.HypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.Customer, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >, org.jacop.constraints.geost.ShapeCloneable, org.jacop.util.fsm.FSMCloneable
• cloneAndReplace() : org.jacop.constraints.geost.ExternalConstraintCloneable, org.jacop.constraints.geost.InAreaCloneable, org.jacop.constraints.geost.NonOverlappingCloneable
• cloneInto() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube, frodo2.solutionSpaces.JaCoP.Predicate, org.jacop.constraints.AbsXeqYCloneable, org.jacop.constraints.AlldiffCloneable, org.jacop.constraints.AlldifferentCloneable, org.jacop.constraints.AlldistinctCloneable, org.jacop.constraints.AllEqualCloneable, org.jacop.constraints.AmongCloneable, org.jacop.constraints.AmongVarCloneable, org.jacop.constraints.AndBoolCloneable, org.jacop.constraints.AndBoolSimpleCloneable, org.jacop.constraints.AndBoolVectorCloneable, org.jacop.constraints.AndCloneable, org.jacop.constraints.ArgMaxCloneable, org.jacop.constraints.ArgMinCloneable, org.jacop.constraints.AssignmentCloneable, org.jacop.constraints.AtLeastCloneable, org.jacop.constraints.AtMostCloneable, org.jacop.constraints.binpacking.BinpackingCloneable, org.jacop.constraints.BoolClauseCloneable, org.jacop.constraints.ChannelImplyCloneable, org.jacop.constraints.ChannelReifCloneable, org.jacop.constraints.CircuitCloneable, org.jacop.constraints.ConditionalCloneable, org.jacop.constraints.ConstraintCloneableInterface< C extends DecomposedConstraint<? extends Constraint > >, org.jacop.constraints.CountBoundsCloneable, org.jacop.constraints.CountCloneable, org.jacop.constraints.CountValuesBoundsCloneable, org.jacop.constraints.CountValuesCloneable, org.jacop.constraints.CountVarCloneable, org.jacop.constraints.cumulative.CumulativeBasicCloneable, org.jacop.constraints.cumulative.CumulativeCloneable, org.jacop.constraints.cumulative.CumulativeOptionalCloneable, org.jacop.constraints.cumulative.CumulativePrimaryCloneable, org.jacop.constraints.cumulative.CumulativeUnaryCloneable, org.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable, org.jacop.constraints.CumulativeCloneable, org.jacop.constraints.DecreasingCloneable, org.jacop.constraints.Diff2Cloneable, org.jacop.constraints.DiffCloneable, org.jacop.constraints.diffn.DiffnCloneable, org.jacop.constraints.diffn.DiffnDecomposedCloneable, org.jacop.constraints.diffn.NooverlapCloneable, org.jacop.constraints.DisjointCloneable, org.jacop.constraints.DisjointConditionalCloneable, org.jacop.constraints.DistanceCloneable, org.jacop.constraints.ElementIntegerCloneable, org.jacop.constraints.ElementIntegerFastCloneable, org.jacop.constraints.ElementVariableCloneable, org.jacop.constraints.ElementVariableFastCloneable, org.jacop.constraints.EqBoolCloneable, org.jacop.constraints.EqCloneable, org.jacop.constraints.ExtensionalConflictVACloneable, org.jacop.constraints.ExtensionalSupportMDDCloneable, org.jacop.constraints.ExtensionalSupportSTRCloneable, org.jacop.constraints.ExtensionalSupportVACloneable, org.jacop.constraints.GCCCloneable, org.jacop.constraints.geost.GeostCloneable, org.jacop.constraints.geost.GeostObjectCloneable, org.jacop.constraints.IfThenBoolCloneable, org.jacop.constraints.IfThenCloneable, org.jacop.constraints.IfThenElseCloneable, org.jacop.constraints.ImpliesCloneable, org.jacop.constraints.InCloneable, org.jacop.constraints.IncreasingCloneable, org.jacop.constraints.knapsack.KnapsackCloneable, org.jacop.constraints.LexCloneable, org.jacop.constraints.LexOrderCloneable, org.jacop.constraints.LinearIntCloneable, org.jacop.constraints.LinearIntDomCloneable, org.jacop.constraints.MaxCloneable, org.jacop.constraints.MaxSimpleCloneable, org.jacop.constraints.MemberCloneable, org.jacop.constraints.MinCloneable, org.jacop.constraints.MinSimpleCloneable, org.jacop.constraints.netflow.ArithmeticCloneable, org.jacop.constraints.netflow.NetworkFlowCloneable, org.jacop.constraints.NoGoodCloneable, org.jacop.constraints.NotCloneable, org.jacop.constraints.OrBoolCloneable, org.jacop.constraints.OrBoolSimpleCloneable, org.jacop.constraints.OrBoolVectorCloneable, org.jacop.constraints.OrCloneable, org.jacop.constraints.regular.RegularCloneable, org.jacop.constraints.ReifiedCloneable, org.jacop.constraints.SeqPrecedeChainCloneable, org.jacop.constraints.SequenceCloneable, org.jacop.constraints.SoftAlldifferentCloneable, org.jacop.constraints.SoftGCCCloneable, org.jacop.constraints.StretchCloneable, org.jacop.constraints.SubcircuitCloneable, org.jacop.constraints.SumBoolCloneable, org.jacop.constraints.SumCloneable, org.jacop.constraints.SumIntCloneable, org.jacop.constraints.SumWeightCloneable, org.jacop.constraints.table.SimpleTableCloneable, org.jacop.constraints.table.TableCloneable, org.jacop.constraints.ValuePrecedeCloneable, org.jacop.constraints.ValuesCloneable, org.jacop.constraints.XdivYeqZCloneable, org.jacop.constraints.XeqCCloneable, org.jacop.constraints.XeqYCloneable, org.jacop.constraints.XexpYeqZCloneable, org.jacop.constraints.XgtCCloneable, org.jacop.constraints.XgteqCCloneable, org.jacop.constraints.XgteqYCloneable, org.jacop.constraints.XgtYCloneable, org.jacop.constraints.XltCCloneable, org.jacop.constraints.XlteqCCloneable, org.jacop.constraints.XlteqYCloneable, org.jacop.constraints.XltYCloneable, org.jacop.constraints.XmodYeqZCloneable, org.jacop.constraints.XmulCeqZCloneable, org.jacop.constraints.XmulYeqCCloneable, org.jacop.constraints.XmulYeqZCloneable, org.jacop.constraints.XneqCCloneable, org.jacop.constraints.XneqYCloneable, org.jacop.constraints.XorBoolCloneable, org.jacop.constraints.XorCloneable, org.jacop.constraints.XplusCeqZCloneable, org.jacop.constraints.XplusClteqZCloneable, org.jacop.constraints.XplusYeqCCloneable, org.jacop.constraints.XplusYeqZCloneable, org.jacop.constraints.XplusYgtCCloneable, org.jacop.constraints.XplusYlteqZCloneable, org.jacop.core.CloneableInto< V >, org.jacop.core.IntVarCloneable
• cloneRectangles() : org.jacop.constraints.DiffCloneable
• close() : frodo2.communication.MsgSizeMonitor, frodo2.communication.QueueInputPipeInterface, frodo2.communication.QueueOutputPipeInterface, frodo2.communication.QueueTest.QueueInputPipeTrivial, frodo2.communication.QueueTest.QueueOutputPipeTrivial, frodo2.communication.sharedMemory.QueueIOPipe, frodo2.communication.tcp.QueueInputPipeTCP, frodo2.communication.tcp.QueueOutputPipeTCP, frodo2.controller.WhitePages
• clusterAgents : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• clusteredOrder : frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest
• clusterIndexes : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• ClusterInfo() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
• clusterInfos : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• clusterOf : frodo2.algorithms.RandGraphFactory.Graph
• clusters : frodo2.algorithms.RandGraphFactory.Graph
• clusterSizes : frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >
• cn : frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >
• cns : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >
• CODE_NAME_TYPE : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• codeName : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo
• CODENAME_TYPE : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >
• CodeNameMsg() : frodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > >
• codeNames : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >
• codenames : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.VariableInfo
• codeNamesMerged : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• codeNamesUnique : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• collabDecrypt : frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >
• CollaborativeDecryption() : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• COLLECT_STATISTICS : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• collector : frodo2.communication.sharedMemory.QueueIOPipeTest
• collectStats : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• COM_STATS_MSG_TYPE : frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage
• combinationMethod : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• combineSamples() : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >
• combineSolutions() : frodo2.algorithms.dpop.count.SolutionCounter< V extends Addable< V >, U extends Addable< U > >
• combineVRPAndSum() : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• comID : frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >
• committed : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• COMP_OPT_UTIL_MSG_TYPE : frodo2.algorithms.dpop.privacy.OptUtilMsg< U extends Addable< U > >
• compare() : frodo2.algorithms.afb.Timestamp, frodo2.communication.mailer.CentralMailer.TimestampComparator, frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >.MaximizeComp< U extends Addable< U > >, frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >.MinimizeComp< U extends Addable< U > >
• compareTo() : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger, frodo2.algorithms.heuristics.ScorePair< S1 extends Comparable< S1 > &Serializable, S2 extends Comparable< S2 > &Serializable >, frodo2.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 > >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.IntIntStringTuple, frodo2.communication.MessageType, frodo2.solutionSpaces.AddableBigDecimal, frodo2.solutionSpaces.AddableBigDecimal.MinInfinity, frodo2.solutionSpaces.AddableBigDecimal.PlusInfinity, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.AddableInteger, frodo2.solutionSpaces.AddableInteger.MinInfinity, frodo2.solutionSpaces.AddableInteger.PlusInfinity, frodo2.solutionSpaces.AddableReal, frodo2.solutionSpaces.AddableReal.MinInfinity, frodo2.solutionSpaces.AddableReal.PlusInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger, frodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.CustomerAssignment< U extends Addable< U > >
• compareWithHypercube() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• comparison : frodo2.algorithms.localSearch.dsa.tests.TestDSA< U extends Addable< U > >
• compatible() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.Assignment< Val extends Addable< Val > >, frodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair
• compID : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > >
• compile : frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >
• compiled : frodo2.gui.jung.JungVisualizer
• compInfos : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• complete : frodo2.algorithms.duct.SearchNodeChild< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >
• Complete_E_DPOPsolver() : frodo2.algorithms.dpop.stochastic.Complete_E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >
• CompleteUTIL() : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >
• compOfCluster : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• componentID : frodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.ProposalMsg< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.linear.RequestMsg
• componentIDs : frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• ComponentInfo() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo
• componentOf : frodo2.algorithms.RandGraphFactory.Graph
• components : frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.RandGraphFactory.Graph
• compose() : frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• CompoundSpace() : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >
• computeDensity() : frodo2.algorithms.RandGraphFactory.Graph
• computeDFS() : frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >
• computeLB() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• computeLeaders() : frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >
• computeMaxDeg() : frodo2.algorithms.RandGraphFactory.Graph
• computeOptValAndSendVALUEmsgs() : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >, frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >
• computeUB() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• ComStatsMessage() : frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage
• condAssignments : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >
• condAssignmentsFiles : frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >
• ConditionalCloneable() : org.jacop.constraints.ConditionalCloneable
• condOptAssignments : frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener
• config : frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• configDoc : frodo2.controller.ConfigurationManager
• configMan : frodo2.daemon.Daemon
• configManager : frodo2.controller.TestConfigurationManager
• CONFIGURATION_MSG : frodo2.controller.userIO.UserIO
• ConfigurationManager() : frodo2.controller.ConfigurationManager
• confirmed : frodo2.algorithms.asodpop.Good< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.UTILvarsDomsMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.UTILvarsMsg< Val extends Addable< Val >, U extends Addable< U > >
• confirmedUtil : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.LeafNode< U extends Addable< U > >
• conflicts : frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >
• confManager : frodo2.controller.Controller
• CONNECT : frodo2.controller.ConfigurationManager
• connect() : frodo2.algorithms.AgentInterface< V extends Addable< V > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.daemon.TestLocalWhitePages.SimpleAgent
• CONNECT_AGENT : frodo2.controller.WhitePages
• CONSENSUS : frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >.Method
• consensus() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• CONSENSUS_ALL_SOLS : frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >.Method
• consensusAllSols() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• consensusAllSolsExpect() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• consensusExpect() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• consistency() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube, org.jacop.constraints.AmongVarCloneable
• consistencyForX() : org.jacop.constraints.AmongVarCloneable
• consistencyForY() : org.jacop.constraints.AmongVarCloneable
• consistencyWhen_LB0_EQ_UB0() : org.jacop.constraints.AmongVarCloneable
• consistentOrder() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• Console() : frodo2.controller.userIO.Console, frodo2.daemon.userIO.Console
• ConsoleVisualizer() : frodo2.gui.ConsoleVisualizer
• ConstantMsgPolicy() : frodo2.communication.QueueTest.ConstantMsgPolicy
• constClass : frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >
• constName : frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >
• Constraint() : frodo2.benchmarks.auctions.xcsp.Constraint
• constraintName : frodo2.solutionSpaces.JaCoP.tests.JaCopxcspParserTest
• constraintParameters : frodo2.solutionSpaces.JaCoP.Predicate
• Constraints() : frodo2.benchmarks.auctions.xcsp.Constraints
• constraints : frodo2.benchmarks.auctions.xcsp.Constraints, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• Constructor() : frodo2.daemon.Constructor
• constructor : frodo2.controller.Controller, frodo2.daemon.Daemon
• contains() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• containsAllVars() : frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• content : frodo2.gui.DOTrenderer
• context : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >, frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ENDmsg< Val extends Addable< Val > >, frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.tests.TestDSA< U extends Addable< U > >
• CONTEXT_MSG_TYPE : frodo2.algorithms.dpop.memory.ContextMsg< V extends Addable< V > >
• contextMap : frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• ContextMsg() : frodo2.algorithms.dpop.memory.ContextMsg< V extends Addable< V > >
• contextPointer : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• contextSize : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• contextValues : frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo
• contextVariables : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.localSearch.dsa.tests.TestDSA< U extends Addable< U > >
• control : frodo2.controller.ConfigurationManager, frodo2.controller.TestConfigurationManager, frodo2.controller.TestController, frodo2.controller.userIO.UserIO
• CONTROLLER : frodo2.controller.Controller
• Controller() : frodo2.controller.Controller
• controller : frodo2.daemon.Constructor, frodo2.daemon.LocalWhitePages
• CONTROLLER_ID : frodo2.daemon.LocalWhitePages
• ControllerExtension() : frodo2.controller.TestController.ControllerExtension
• controlQueue : frodo2.controller.Controller, frodo2.controller.userIO.UserIO
• controls : frodo2.gui.Visualizer
• CONV_STATS_MSG_TYPE : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• converged() : frodo2.algorithms.duct.termination.TerminateBest< V extends Addable< V > >, frodo2.algorithms.duct.termination.TerminateBest_Child< V extends Addable< V > >, frodo2.algorithms.duct.termination.TerminateMean< V extends Addable< V > >, frodo2.algorithms.duct.termination.TerminateRegret< V extends Addable< V > >, frodo2.algorithms.duct.termination.TerminateRegret_Child< V extends Addable< V > >, frodo2.algorithms.duct.termination.TerminationCondition< V extends Addable< V > >
• Convergence() : frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >
• convergence : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• convergenceBound() : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• ConvergenceMessage() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ConvergenceMessage< V extends Addable< V > >
• convertABO() : frodo2.benchmarks.kidneys.KidneyExchange
• convertPRA() : frodo2.benchmarks.kidneys.KidneyExchange
• ConvStatMessage() : frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.ConvStatMessage< Val >
• copyFile() : frodo2.gui.DOTrenderer
• CordeauToXCSP() : frodo2.benchmarks.vehiclerouting.CordeauToXCSP
• cost : frodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.PathMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
• COST_MSG_TYPE : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• costAmplitude : frodo2.algorithms.mpc_discsp.tests.MPC_DisWCSP4tests
• COSTBmsg() : frodo2.algorithms.duct.COSTBmsg
• costMessagesReceived : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• COSTmsg() : frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.duct.COSTmsg
• costVar : frodo2.solutionSpaces.JaCoP.IterSolutionListener< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• count() : frodo2.algorithms.dpop.count.SolutionCounter< V extends Addable< V >, U extends Addable< U > >
• CountBoundsCloneable() : org.jacop.constraints.CountBoundsCloneable
• CountCloneable() : org.jacop.constraints.CountCloneable
• countdown : frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest, frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.ComponentInfo, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• countdowns : frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >
• countdownsInit : frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >
• counter : frodo2.algorithms.adopt.test.testPreprocessing, frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >, frodo2.communication.tcp.QueueOutputPipeTCP.RawDataInfo
• counters : frodo2.algorithms.afb.Timestamp
• countGoodsProduced() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• countLeafNode() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• countNCCCs : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• countsCCs() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• CountSolutionsUTIL() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >
• CountSolutionsVALUE() : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >
• CountValuesBoundsCloneable() : org.jacop.constraints.CountValuesBoundsCloneable
• CountValuesCloneable() : org.jacop.constraints.CountValuesCloneable
• CountVarCloneable() : org.jacop.constraints.CountVarCloneable
• cpa : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
• CPA_MSG_TYPE : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• CPAmsg() : frodo2.algorithms.afb.CPAmsg< V extends Addable< V >, U extends Addable< U > >
• create() : frodo2.benchmarks.auctions.xcsp.Constraint, frodo2.benchmarks.auctions.xcsp.Constraints, frodo2.benchmarks.auctions.xcsp.Domain, frodo2.benchmarks.auctions.xcsp.Domains, frodo2.benchmarks.auctions.xcsp.Instance, frodo2.benchmarks.auctions.xcsp.Presentation, frodo2.benchmarks.auctions.xcsp.Relation, frodo2.benchmarks.auctions.xcsp.Relations, frodo2.benchmarks.auctions.xcsp.SumParameters, frodo2.benchmarks.auctions.xcsp.Variable, frodo2.benchmarks.auctions.xcsp.Variables
• createAgent() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• createAgentsList() : frodo2.gui.SimpleGUI
• createConstantUtilityMapping() : frodo2.benchmarks.auctions.xcsp.Relations
• createConstraint() : frodo2.solutionSpaces.JaCoP.tests.JaCopxcspParserTest
• createDFSparams() : frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest
• createDOTfigure() : frodo2.gui.DOTrenderer
• createDOTFile() : frodo2.gui.DOTrenderer
• createGoodsList() : frodo2.benchmarks.auctions.cats.Auction
• createHeuristic() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
• createHeuristicInfoMessage() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP0< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP1< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP2< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.SimpleHeuristic< Val extends Addable< Val >, U extends Addable< U > >
• createInnerNode() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• createIntArrayWrapper() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• createLeaf() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• createNewDest() : frodo2.communication.MsgSizeMonitor
• createNode() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingChild< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingChildSearch< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo
• createParameters() : frodo2.benchmarks.auctions.xcsp.SumParameters
• createPathNoUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• createPathWithUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• createQueueNetwork() : frodo2.algorithms.test.AllTests
• createRandProblem() : frodo2.algorithms.test.AllTests
• createSizedRandProblem() : frodo2.algorithms.test.AllTests, frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator
• createStats() : frodo2.benchmarks.graphcoloring.GraphColoring, frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator, frodo2.benchmarks.meetings.MeetingScheduling, frodo2.benchmarks.party.PartyGame
• createStore() : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• createSuite() : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >
• createSUMAssignments() : frodo2.benchmarks.auctions.xcsp.Relations
• createTempFiles() : frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• createUtilityMappingByBidder() : frodo2.benchmarks.auctions.xcsp.Relations
• createUtilitySpace() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >
• createVariableInfo() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• createVector() : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo
• createVisualizer() : frodo2.algorithms.test.MessageDebugger
• createXCSP() : frodo2.benchmarks.vehiclerouting.CordeauToXCSP
• CRYPTO_SCHEME_TYPE : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• cryptoConstr : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• cryptoParameter : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• cryptoScheme : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• CryptoSchemeMsg() : frodo2.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 >
• cs : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.VariableInfo, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo, frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo
• CumulativeBasicCloneable() : org.jacop.constraints.cumulative.CumulativeBasicCloneable
• CumulativeCloneable() : org.jacop.constraints.cumulative.CumulativeCloneable, org.jacop.constraints.CumulativeCloneable
• cumulativeDummyFillPercentage : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• cumulativeFillPercentage : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• cumulativeNumberOfDummies : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• cumulativeNumberOfSpeculativeUTILmessages : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• cumulativeNumberOfUTILMessages : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• CumulativeOptionalCloneable() : org.jacop.constraints.cumulative.CumulativeOptionalCloneable
• CumulativePrimaryCloneable() : org.jacop.constraints.cumulative.CumulativePrimaryCloneable
• cumulativeTime : frodo2.algorithms.Solution< V, U >
• CumulativeUnaryCloneable() : org.jacop.constraints.cumulative.CumulativeUnaryCloneable
• CumulativeUnaryOptionalCloneable() : org.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable
• currentAlgorithm : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >
• CurrentAssignment() : frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.CurrentAssignment< Val >
• currentAssignment : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• currentBound : frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >
• currentContext : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• currentContextMap : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo
• currentDest : frodo2.communication.MsgSizeMonitor
• currentDotImage : frodo2.gui.DOTrenderer
• currentMsg : frodo2.communication.mailer.CentralMailer
• currentQueue : frodo2.communication.mailer.CentralMailer
• currentSolution : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• currentUtility : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• currentValue : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• currentValueIndex : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• currentValues : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• currStep : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• Customer() : frodo2.solutionSpaces.vehiclerouting.Customer
• CustomerAssignment() : frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.CustomerAssignment< U extends Addable< U > >
• customers : frodo2.benchmarks.vehiclerouting.CordeauToXCSP, frodo2.benchmarks.vehiclerouting.CordeauToXCSP.Depot, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• cycleCount : frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.CurrentAssignment< Val >
• cycleCounter : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• cycles : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >