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

- s -

• sample() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >.VariableInfo, 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 > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< 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 > >
• sampleBound() : frodo2.algorithms.duct.bound.Bound< V extends Addable< V > >, frodo2.algorithms.duct.bound.BoundInvLog< V extends Addable< V > >, frodo2.algorithms.duct.bound.BoundLog< V extends Addable< V > >, frodo2.algorithms.duct.bound.BoundLogSize< V extends Addable< V > >, frodo2.algorithms.duct.bound.BoundSqrt< V extends Addable< V > >, frodo2.algorithms.duct.bound.BoundSqrtSize< V extends Addable< V > >
• SampleMASagent() : frodo2.algorithms.test.SampleMASagent
• SamplesMsg1() : frodo2.algorithms.dpop.stochastic.SamplesMsg1< V extends Addable< V > >
• SamplesMsg2() : frodo2.algorithms.dpop.stochastic.SamplesMsg2< V extends Addable< V > >
• Sampling() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• sampling() : frodo2.algorithms.duct.samplingMethods.SamplingProcedure< V extends Addable< V > >
• SamplingChild() : frodo2.algorithms.duct.SamplingChild< V extends Addable< V > >
• SamplingChildSearch() : frodo2.algorithms.duct.SamplingChildSearch< V extends Addable< V > >
• SamplingPhase() : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >
• SamplingPhaseTest() : frodo2.algorithms.dpop.stochastic.test.SamplingPhaseTest
• SamplingPruning() : frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >
• SamplingPruningSearch() : frodo2.algorithms.duct.SamplingPruningSearch< V extends Addable< V > >
• satisfied() : org.jacop.constraints.AmongVarCloneable
• saveAsXML() : frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >
• saveFile() : frodo2.gui.SimpleGUI
• ScalarBasicHypercube() : frodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable >
• ScalarBasicSpaceIter() : frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >
• ScalarHypercube() : frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >
• scalarHypercube() : 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.HypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >
• ScalarHypercubeLimited() : frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
• ScalarSpaceIter() : frodo2.solutionSpaces.hypercube.ScalarSpaceIter< V extends Addable< V >, U extends Addable< U > >
• scaledRandSpace() : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >
• ScoreBroadcastingHeuristic() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >
• ScoreMsg() : frodo2.algorithms.varOrdering.dfs.ScoreMsg< S extends Serializable >
• ScorePair() : frodo2.algorithms.heuristics.ScorePair< S1 extends Comparable< S1 > &Serializable, S2 extends Comparable< S2 > &Serializable >
• ScoresMsg() : frodo2.algorithms.varOrdering.dfs.ScoresMsg< S extends Serializable >
• ScoringHeuristicWithTiebreaker() : frodo2.algorithms.heuristics.ScoringHeuristicWithTiebreaker< S1 extends Comparable< S1 > &Serializable, S2 extends Comparable< S2 > &Serializable >
• searchAllSolutions() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >
• searchBestUtility() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >
• SearchNode() : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• SearchNodeChild() : frodo2.algorithms.duct.SearchNodeChild< V extends Addable< V > >
• SearchNodePruning() : frodo2.algorithms.duct.SearchNodePruning< V extends Addable< V > >
• SecureCircularRouting() : frodo2.algorithms.dpop.privacy.SecureCircularRouting
• SecureCircularRoutingTest() : frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest
• SecureRerooting() : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
• SecureRerootingTest() : frodo2.algorithms.dpop.privacy.test.SecureRerootingTest
• SecureRootingMsg() : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.SecureRootingMsg
• SecureVarElection() : frodo2.algorithms.varOrdering.election.SecureVarElection
• SecureVarElectionTest() : frodo2.algorithms.varOrdering.election.tests.SecureVarElectionTest
• send_token() : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• sendAdditionalDFSoutput() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >
• sendASK() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• sendDelayedMsg() : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• sendDONE() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• sendDownCHILDtoken() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >
• sendEmptyConfigs() : frodo2.controller.ConfigurationManager
• Sender() : frodo2.communication.tcp.QueueInputPipeTCPTest.Sender
• sendGood() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• sendIMPROVE() : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >
• sendLEoutputs() : frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest
• sendMessage() : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue, frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.SinkQueue, frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• sendMessageToMulti() : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue, frodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable >, frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• sendMessageToSelf() : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue, frodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable >, frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• sendMessageToVariable() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, 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.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• sendOK() : 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 > >
• sendOutput() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors, frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >
• sendReroot() : frodo2.algorithms.dpop.privacy.test.SecureRerootingTest
• sendSeparator() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >
• sendTestMessage() : frodo2.daemon.TestLocalWhitePages.SimpleAgent
• sendToParent() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >
• sendVALUEChild() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• sendVALUEmessage() : 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 > >
• sendVALUEPseudo() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• SeparatorMessage() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.SeparatorMessage, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SeparatorMessage
• SeqPrecedeChainCloneable() : org.jacop.constraints.SeqPrecedeChainCloneable
• SequenceCloneable() : org.jacop.constraints.SequenceCloneable
• serializeRawData() : frodo2.communication.MessageSerializedSimple< T extends Serializable >, frodo2.communication.MessageWithRawData
• set() : frodo2.algorithms.mpc_discsp.Matrix
• setAgent() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >
• setAlive() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >
• setChild() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeBinaryDomains.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• setChildDone() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
• setChildrenListeners() : frodo2.solutionSpaces.JaCoP.IterSolutionListener< V extends Addable< V > >
• setChildrenSeparator() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
• setCombinationMethod() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• setCompiled() : frodo2.gui.ConsoleVisualizer, frodo2.gui.jung.JungVisualizer, frodo2.gui.Visualizer
• setContext() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingPruning< 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 > >
• setConvergence() : frodo2.algorithms.asodpop.ASODPOPBinarysolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPsolver< V extends Addable< V >, U extends Addable< U > >, 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 > >
• setCounter() : frodo2.algorithms.afb.Timestamp
• setCurrentAssignmentSingleton() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• setCurrentContext() : 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
• setCurrentMsgWrapper() : frodo2.communication.mailer.CentralMailer.FakeQueue
• setCurrentUtility() : frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.SparseIterator< V, U >, frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.MyIter, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter, frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter< U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• setCurrentValue() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• setData() : frodo2.communication.MessageSerializedSimple< T extends Serializable >
• setDebug() : frodo2.controller.userIO.UserIO
• setDecisionStrategy() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >
• setDefaultUtility() : 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 > >.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.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• setDelta() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• setDestination() : frodo2.communication.MessageWrapper
• setDestinations() : frodo2.communication.MessageWrapper
• setDomain() : frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >, 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 > >.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.JaCoPproblem< V extends Addable< V > >, 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 > >
• setDomClass() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• setFactory() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• setFake() : frodo2.benchmarks.auctions.cats.Bidder
• setFinalDomainSize() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< 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 > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
• setFinalSpace() : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo
• setFinished() : frodo2.controller.Controller
• setFlags() : frodo2.algorithms.dpop.stochastic.LowestCommonAncestors
• setForward() : frodo2.communication.QueueTest.ConstantMsgPolicy
• setForwardToSelfFlag() : frodo2.communication.QueueTest.ConstantMsgPolicy
• setHandler() : frodo2.communication.MessageWithRawData
• setHeuristics() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >
• setInfeasable() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.LeafNode< U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.LeafNode< U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• setInfeasibleUtility() : 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.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• setInfinity() : frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >
• setLogging() : frodo2.controller.userIO.UserIO
• setLowerBoundChild() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• setLowerNeighbours() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• setMaxCost() : frodo2.algorithms.mpc_discsp.MPC_DisWCSP4solver< V extends Addable< V >, U extends Addable< U > >
• setMaximize() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
• setMessageCounter() : frodo2.communication.MessageWrapper
• setModules() : frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest, frodo2.algorithms.dpop.stochastic.test.SamplingPhaseTest
• setMsgNbrsSent() : frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage
• setMsgSizesSent() : frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage
• setMsgType() : frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >
• setMsgViz() : frodo2.gui.Visualizer
• setName() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ExpectationOutput< 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.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• setNbrElectionRounds() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.P_DPOPsolver< V extends Addable< V > >
• setNbrMsgs() : frodo2.algorithms.Solution< V, U >
• setNCCCs() : frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.MessageWrapper, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• setNeighborValue() : 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 > >
• setNewBound() : frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >
• setNewValue() : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• setNewVariable() : 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
• setNumberOfChildren() : 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 > >
• setNumberOfSolutions() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• setOldUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• setOptimalValue() : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo
• setOutDecision() : frodo2.communication.QueueTest.ConstantMsgPolicy
• setOwner() : frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >, 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.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.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• setOwnLowerBound() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• setParent() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP0< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP1< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP2< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, 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.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• setParserClass() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• setPayload() : frodo2.communication.MessageWithPayload< T extends Serializable >
• setPayload1() : 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 >
• setPayload2() : 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 >
• setPayload3() : 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 >
• setPayload4() : 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 >
• setPayload5() : frodo2.communication.MessageWith5Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable, T4 extends Serializable, T5 extends Serializable >
• setPosition() : frodo2.solutionSpaces.vehiclerouting.Customer
• setProblem() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.communication.Queue, 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.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 > >
• setProblemRescalerShift() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• setProbSpace() : frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >
• setQueue() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.adopt.test.testPreprocessing.forwardHeuristicsMessage, frodo2.algorithms.adopt.test.testPreprocessing.receiveLowerBounds, frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentFactory< 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.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.SecureCircularRouting, frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >, frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.Forwarder, frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.restart.UTILreuse, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors, frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest, 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.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >, frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, 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.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.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.reformulation.ProblemRescaler< U extends Addable< U > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.test.MessageDebugger, frodo2.algorithms.test.SampleMASagent, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >, frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest.IdIncreasingVerifyer, frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >, 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 > >, frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest, frodo2.communication.mailer.tests.testCentralMailer, frodo2.communication.MessageListener< T >, frodo2.communication.QueueTest.ConstantMsgPolicy, frodo2.communication.sharedMemory.QueueIOPipeTest.Collector, frodo2.controller.ConfigurationManager, frodo2.controller.TestConfigurationManager.SimpleDaemonListener, frodo2.controller.userIO.UserIO, frodo2.controller.WhitePages, frodo2.daemon.Constructor, frodo2.daemon.LocalWhitePages, frodo2.daemon.TestLocalWhitePages.SimpleAgent, frodo2.daemon.userIO.UserIO
• setRelationName() : 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.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.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• setReservePrice() : frodo2.benchmarks.auctions.cats.Good
• setSender() : frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage
• setSeparator() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• setSilent() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.Preprocessing< 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.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >, frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.SecureCircularRouting, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >, 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.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.StatsReporter, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >, 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 > >
• setSize() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• setSolution() : frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >
• setSpaces() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• setStartMsgType() : 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.duct.tests.DUCTagentPruningSearchTest, frodo2.algorithms.duct.tests.DUCTagentPruningTest, frodo2.algorithms.duct.tests.DUCTagentTest, 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.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >
• setStepsHashmaps() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< 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 > >
• setTime() : frodo2.communication.MessageWrapper
• setTimeNeeded() : frodo2.algorithms.Solution< V, U >
• setTotalMsgSize() : frodo2.algorithms.Solution< V, U >
• setUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• setUbSum() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• setUp() : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.adopt.test.testPreprocessing, frodo2.algorithms.afb.test.AFBagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.count.test.TestCountSolutions, frodo2.algorithms.dpop.memory.tests.MB_DPOPagentTest, frodo2.algorithms.dpop.param.test.ParamDPOPtest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.param.test.ParamUTILtest< U extends Addable< U > >, frodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > >, frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest, frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >, frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >, 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, 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 > >, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentChildSearchTest, frodo2.algorithms.duct.tests.DUCTagentChildTest, frodo2.algorithms.duct.tests.DUCTagentPruningSearchTest, frodo2.algorithms.duct.tests.DUCTagentPruningTest, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.tests.TestDSA< 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.mpc_discsp.tests.MPC_DisWCSP4tests, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.test.SynchBBagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.test.MASparserTest, frodo2.algorithms.test.ProblemTest, frodo2.algorithms.test.XCSPparserTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest, frodo2.communication.mailer.tests.testCentralMailer, frodo2.communication.QueueTest, frodo2.communication.sharedMemory.QueueIOPipeTest, frodo2.communication.tcp.QueueInputPipeTCPTest, frodo2.communication.tcp.QueueOutputPipeTCPTest, frodo2.controller.TestConfigurationManager, frodo2.controller.TestController.ControllerExtension, frodo2.controller.TestController.DaemonExtension, frodo2.controller.TestController, frodo2.controller.TestWhitePages, frodo2.daemon.TestLocalWhitePages, frodo2.solutionSpaces.crypto.ElGamalSchemeTest, frodo2.solutionSpaces.hypercube.tests.HypercubeTest, frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCopxcspParserTest, frodo2.solutionSpaces.vehiclerouting.test.VRPtests
• setup() : frodo2.algorithms.AgentInterface< V extends Addable< V > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.daemon.TestLocalWhitePages.SimpleAgent
• setUpPrelimModules() : frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.Listener, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener
• setUpToDate() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• setUtil() : 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 > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• setUtilClass() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.dpop.privacy.P_DPOPsolver< V extends Addable< V > >, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.vehiclerouting.XCSPparserVRP< U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• setUtility() : frodo2.algorithms.Solution< V, U >, 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 > >.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.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.CustomerAssignment< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• setValue() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper
• setVarScope() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >
• setVersion() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >
• setZero() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.determineAssignment< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.DetermineAssignmentMax< Val extends Addable< Val >, U extends Addable< U > >
• ShapeCloneable() : org.jacop.constraints.geost.ShapeCloneable
• share() : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• share0() : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• SharesMsg() : frodo2.algorithms.mpc_discsp.SharesMsg
• shareVector() : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• shareVectorOfZeros() : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• shouldSelectCell() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• showIncomingAgentMessage() : frodo2.gui.ConsoleVisualizer, frodo2.gui.jung.JungVisualizer, frodo2.gui.Visualizer
• showOutgoingAgentMessage() : frodo2.gui.ConsoleVisualizer, frodo2.gui.jung.JungVisualizer, frodo2.gui.Visualizer
• showUserAgentList() : frodo2.controller.userIO.Console, frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.controller.userIO.UserIO
• showUserDaemonList() : frodo2.controller.userIO.Console, frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.controller.userIO.UserIO
• shuffle() : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo
• SimpleAgent() : frodo2.daemon.TestLocalWhitePages.SimpleAgent
• SimpleDaemonListener() : frodo2.controller.TestConfigurationManager.SimpleDaemonListener
• SimpleGUI() : frodo2.gui.SimpleGUI
• SimpleHeuristic() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.SimpleHeuristic< Val extends Addable< Val >, U extends Addable< U > >
• SimpleTableCloneable() : org.jacop.constraints.table.SimpleTableCloneable
• simulateUTIL() : frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener
• simulateUTILslice() : frodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >.Listener
• SingleQueueAgent() : frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >
• slice() : 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 > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< 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.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.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• sliceSpaces() : frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >
• SmallestDomainHeuristic() : frodo2.algorithms.heuristics.SmallestDomainHeuristic
• SoftAlldiffBuilderCloneable() : org.jacop.constraints.SoftAlldifferentCloneable.SoftAlldiffBuilderCloneable
• SoftAlldifferentCloneable() : org.jacop.constraints.SoftAlldifferentCloneable
• SoftGCCBuilderCloneable() : org.jacop.constraints.SoftGCCCloneable.SoftGCCBuilderCloneable
• SoftGCCCloneable() : org.jacop.constraints.SoftGCCCloneable
• SolShareMsg() : frodo2.algorithms.mpc_discsp.SolShareMsg
• Solution() : frodo2.algorithms.Solution< V, U >
• SolutionCollector() : frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >
• SolutionCounter() : frodo2.algorithms.dpop.count.SolutionCounter< V extends Addable< V >, U extends Addable< U > >
• SolutionMessage() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val > >
• SolutionMsg() : frodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >
• SolutionSizeMessage() : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >.SolutionSizeMessage< Val extends Addable< Val > >
• SolutionWithConvergence() : frodo2.algorithms.SolutionWithConvergence< V extends Addable< V >, U >
• solve() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.LUdecomposition, frodo2.algorithms.mpc_discsp.Matrix, frodo2.algorithms.mpc_discsp.MPC_DisWCSP4solver< V extends Addable< V >, U extends Addable< U > >, frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >
• solveLeaf() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingPruning< V extends Addable< V > >.VariableInfo
• solveLocalProblem() : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• solveParam() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >
• solveProblem() : frodo2.gui.SimpleGUI
• solveSingleton() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• sparseIter() : 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 > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< 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.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.VehicleRoutingSpace< U extends Addable< U > >
• split() : 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 > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< 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 > >
• start() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentInterface< V extends Addable< V > >, frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >, frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.mailer.CentralMailer, frodo2.communication.QueueTest.QueueInputPipeTrivial, frodo2.communication.tcp.QueueInputPipeTCP.Receiver, frodo2.communication.tcp.QueueInputPipeTCP, frodo2.communication.tcp.QueueInputPipeTCPTest.Sender, frodo2.communication.tcp.QueueOutputPipeTCP.RawDataSender, frodo2.communication.tcp.QueueOutputPipeTCP.RawDataServer, frodo2.controller.TestController.ControllerExtension, frodo2.controller.testFiles.TestAgent< V extends Addable< V > >, frodo2.controller.userIO.UserIO, frodo2.daemon.TestLocalWhitePages.SimpleAgent, frodo2.daemon.userIO.UserIO
• startADOPT() : frodo2.algorithms.adopt.test.testADOPT
• startExperiment() : frodo2.controller.userIO.UserIO
• startNormalization() : frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest
• startProcess() : 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.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• startUTIL() : frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >
• startUTILpropagation() : frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >
• State() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.State< V extends Addable< V > >
• stateChanged() : frodo2.gui.VisualizerControls.MsgTypeSetting
• StatRequestOutput() : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.StatRequestOutput
• StatsMessage() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.StatsMessage, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.StatsMessage, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.StatsMessage
• StatsMsg() : frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >.StatsMsg< V extends Addable< V > >
• step() : frodo2.algorithms.mpc_discsp.EncrSharesMsg, frodo2.algorithms.mpc_discsp.OneShareMsg, frodo2.algorithms.mpc_discsp.SharesMsg, frodo2.algorithms.mpc_discsp.SolShareMsg
• stillToSend() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
• StochSolution() : frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.StochSolution< V, U >
• stopCellEditing() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• StopMsg() : frodo2.algorithms.dpop.privacy.StopMsg
• stopRunning() : frodo2.controller.userIO.Console, frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.controller.userIO.UserIO, frodo2.daemon.userIO.Console, frodo2.daemon.userIO.UserIO
• StoreCloneable() : org.jacop.core.StoreCloneable
• storeConstraint() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• storeCost() : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >, frodo2.algorithms.duct.SearchNodeChild< V extends Addable< V > >, frodo2.algorithms.duct.SearchNodePruning< V extends Addable< V > >
• storeCOSTmsg() : 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
• storeIMPROVE() : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• storeOffer() : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• StretchCloneable() : org.jacop.constraints.StretchCloneable
• sub() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• sub_variables() : frodo2.solutionSpaces.hypercube.tests.HypercubeTest
• SubcircuitCloneable() : org.jacop.constraints.SubcircuitCloneable
• subtract() : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger, frodo2.solutionSpaces.Addable< T extends Addable< T > >, frodo2.solutionSpaces.AddableBigDecimal.MinInfinity, frodo2.solutionSpaces.AddableBigDecimal.PlusInfinity, frodo2.solutionSpaces.AddableBigDecimal, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.AddableInteger.MinInfinity, frodo2.solutionSpaces.AddableInteger.PlusInfinity, frodo2.solutionSpaces.AddableInteger, frodo2.solutionSpaces.AddableReal.MinInfinity, frodo2.solutionSpaces.AddableReal.PlusInfinity, frodo2.solutionSpaces.AddableReal, frodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger
• subtreeHasFlag() : frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest
• suite() : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.adopt.test.AllTestsADOPT, frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.adopt.test.testPreprocessing, frodo2.algorithms.afb.test.AFBagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.afb.test.AllTestsAFB, frodo2.algorithms.asodpop.tests.AllTestsASODPOP, frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.count.test.TestCountSolutions, frodo2.algorithms.dpop.memory.tests.MB_DPOPagentTest, frodo2.algorithms.dpop.param.test.AllTestsParamDPOP, frodo2.algorithms.dpop.param.test.ParamDPOPtest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.param.test.ParamUTILtest< U extends Addable< U > >, frodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > >, frodo2.algorithms.dpop.privacy.test.AllTestsP_DPOP, frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest, frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >, frodo2.algorithms.dpop.privacy.test.P3halves_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >, frodo2.algorithms.dpop.privacy.test.P_DPOPagentTest< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >, frodo2.algorithms.dpop.restart.test.AllTestsS_DPOP, frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.robust.test.Robust_E_DPOPagentTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.AllTestsStochDPOP, frodo2.algorithms.dpop.stochastic.test.E_DPOPagentTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest, frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest, frodo2.algorithms.dpop.stochastic.test.SamplingPhaseTest, frodo2.algorithms.dpop.test.AllTestsDPOP, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >, frodo2.algorithms.duct.tests.AllTestsDUCT, frodo2.algorithms.duct.tests.DUCTagentChildSearchTest, frodo2.algorithms.duct.tests.DUCTagentChildTest, frodo2.algorithms.duct.tests.DUCTagentPruningSearchTest, frodo2.algorithms.duct.tests.DUCTagentPruningTest, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest, frodo2.algorithms.localSearch.dsa.tests.AllTestsDSA, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.tests.TestDSA< 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.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.tests.MPC_DisWCSP4tests, frodo2.algorithms.odpop.tests.AllTestsODPOP, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.test.AllTestsSynchBB, frodo2.algorithms.synchbb.test.SynchBBagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.test.AllTests, frodo2.algorithms.test.MASparserTest, frodo2.algorithms.test.ProblemTest, frodo2.algorithms.test.XCSPparserTest, frodo2.algorithms.varOrdering.dfs.tests.AllTestsDFS, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest, frodo2.algorithms.varOrdering.dfs.tests.LocalRandVarsDFStest, frodo2.algorithms.varOrdering.election.tests.AllTestsElection, 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 >, frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest, frodo2.communication.AllTests, frodo2.communication.mailer.tests.testCentralMailer, frodo2.communication.MsgSizeMonitorTest, frodo2.communication.QueueTest, frodo2.communication.sharedMemory.QueueIOPipeTest, frodo2.communication.tcp.QueueInputPipeTCPTest, frodo2.communication.tcp.QueueOutputPipeTCPTest, frodo2.controller.AllTests, frodo2.controller.TestController, frodo2.daemon.AllTests, frodo2.solutionSpaces.crypto.ElGamalSchemeTest, frodo2.solutionSpaces.hypercube.tests.AllTestsHypercube, frodo2.solutionSpaces.hypercube.tests.HypercubeIterBestFirstTest, frodo2.solutionSpaces.hypercube.tests.HypercubeIterTest, frodo2.solutionSpaces.hypercube.tests.HypercubeTest, frodo2.solutionSpaces.JaCoP.tests.AllTestsJaCoP, frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCopxcspParserTest, frodo2.solutionSpaces.tests.AllTestsSpaces, frodo2.solutionSpaces.vehiclerouting.test.VRPtests
• SumBoolCloneable() : org.jacop.constraints.SumBoolCloneable
• SumCloneable() : org.jacop.constraints.SumCloneable
• SumIntCloneable() : org.jacop.constraints.SumIntCloneable
• SumParameters() : frodo2.benchmarks.auctions.xcsp.SumParameters
• SumWeightCloneable() : org.jacop.constraints.SumWeightCloneable
• superFastHash() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper
• switchMaxMin() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• SynchBB() : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• SynchBBagentTest() : frodo2.algorithms.synchbb.test.SynchBBagentTest< V extends Addable< V >, U extends Addable< U > >
• SynchBBsolver() : frodo2.algorithms.synchbb.SynchBBsolver< V extends Addable< V >, U extends Addable< U > >