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

- g -

• GCCCloneable() : org.jacop.constraints.GCCCloneable
• generateAcyclicProblem() : frodo2.benchmarks.party.PartyGame
• generateAssignmentList() : frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.CustomerAssignment< U extends Addable< U > >
• generateAssignments() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• generateChordalProblem() : frodo2.benchmarks.party.PartyGame
• generateCodeName() : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• generateDelay() : frodo2.communication.mailer.CentralMailer.DelayGenerator, frodo2.communication.mailer.CentralMailer.NegativeExponentialDistribution
• generateGridProblem() : frodo2.benchmarks.party.PartyGame
• generateNewCodeName() : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• generateObfuscatedDomains() : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• generatePair() : frodo2.benchmarks.kidneys.KidneyExchange
• generateProblem() : frodo2.algorithms.test.AllTests, frodo2.benchmarks.graphcoloring.GraphColoring, frodo2.benchmarks.kidneys.KidneyExchange, frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator, frodo2.benchmarks.party.PartyGame
• generateRingProblem() : frodo2.benchmarks.party.PartyGame
• generateSizedProblem() : frodo2.algorithms.test.AllTests
• generateUtilObfuscKeys() : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• GeostCloneable() : org.jacop.constraints.geost.GeostCloneable
• GeostObjectCloneable() : org.jacop.constraints.geost.GeostObjectCloneable
• get16bits() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper
• get_next() : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• getAckMessage() : 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
• getAcyclicGraph() : frodo2.algorithms.RandGraphFactory
• getAddress() : frodo2.communication.tcp.TCPAddress, frodo2.controller.messages.MessageAgentReporting
• getAgent() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.OneShareMsg, frodo2.algorithms.mpc_discsp.SharesMsg, frodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getAgentDesc() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• getAgentDescription() : frodo2.controller.ConfigurationManager
• getAgentID() : frodo2.algorithms.mpc_discsp.EncrSharesMsg, frodo2.daemon.LocalAgentReport
• getAgentList() : frodo2.controller.userIO.UserIO
• getAgentNeighborhoods() : 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 > >
• getAgentNeighbors() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• getAgents() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.controller.Controller, frodo2.controller.TestWhitePages.WhitePagesExtention, frodo2.daemon.Daemon, frodo2.daemon.TestLocalWhitePages.LocalWhitePagesExtension, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getAllPseudoChildren() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• getAllVars() : 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 > >
• getAmax() : 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.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.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >, 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 > >
• getAnonymNeighborhoods() : 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 > >, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >
• getAnonymVars() : 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 > >
• getArray() : frodo2.algorithms.mpc_discsp.Matrix
• getArrayCopy() : frodo2.algorithms.mpc_discsp.Matrix
• getAskMessage() : 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
• getAssignment() : frodo2.algorithms.localSearch.mgm.mgm2.ACCEPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.CurrentAssignment< Val >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.CustomerAssignment< U extends Addable< U > >
• getAssignmentHistories() : 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.asodpop.ASODPOPsolution< V extends Addable< V >, U >, frodo2.algorithms.ConvergenceInterface< 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.SolutionWithConvergence< V extends Addable< V >, U >, frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• getAssignmentHistory() : frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.ConvStatMessage< Val >
• getAssignmentMessage() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• getAssignments() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.OFFER< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.OFFERold< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.ProjOutput< V extends Addable< V >, U extends Addable< U > >
• getAverageDummyFillPercentage() : frodo2.algorithms.odpop.ODPOPsolution< V, U >
• getAverageDummyFillTreePercentage() : 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 > >
• getAverageFillTree() : frodo2.algorithms.odpop.ODPOPsolution< V, U >
• getAverageFillTreePercentage() : 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 > >
• getAverageNumberOfDummies() : 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.ODPOPsolution< V, U >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• getBackyardNeighborhood() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• getBestAssignmentForOwnVariable() : 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.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 > >
• getBidder() : frodo2.benchmarks.auctions.cats.Bid
• getBidderID() : frodo2.benchmarks.auctions.cats.Bidder
• getBidders() : frodo2.benchmarks.auctions.cats.Auction
• getBiddersScopeByGood() : frodo2.benchmarks.auctions.xcsp.Instance
• getBidID() : frodo2.benchmarks.auctions.cats.Bid
• getBids() : frodo2.benchmarks.auctions.cats.Auction
• getBidsList() : frodo2.benchmarks.auctions.cats.Bidder, frodo2.benchmarks.auctions.cats.Good
• getBound() : frodo2.algorithms.duct.COSTBmsg
• getBounds() : frodo2.algorithms.adopt.BoundsMsg< Val extends Addable< Val >, U extends Addable< U > >
• getCCs() : frodo2.algorithms.dpop.memory.ContextMsg< V extends Addable< V > >, frodo2.algorithms.dpop.memory.LabelMsg< V extends Addable< V > >
• getCellEditorValue() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• getCentralization() : 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 >
• getChild() : 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, 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 > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node
• getChildMsgType() : 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 > >
• getChildren() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• getChildSeparatorReportingOrder() : 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 > >
• getChildSeparatorSize() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• getChildValues() : 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.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 > >
• getChordalGraph() : frodo2.algorithms.RandGraphFactory
• getClassOfU() : 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.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable >, 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 > >
• getCleartextDomain() : frodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.VarCodenameMsg< V >
• getClusterID() : frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val > >
• getCodeName() : frodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.VarCodenameMsg< V >
• getColumnDimension() : frodo2.algorithms.mpc_discsp.Matrix
• getCompID() : frodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >
• getComponentID() : frodo2.algorithms.varOrdering.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > >
• getCondOptAssignments() : frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val > >
• getConsistencyPruningEvent() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube
• getConstraint() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.Predicate
• getConstraints() : frodo2.benchmarks.auctions.xcsp.Constraints
• getContext() : frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ENDmsg< Val extends Addable< Val > >, frodo2.algorithms.asodpop.VALUEmsgPseudo< Val extends Addable< Val > >
• getCost() : frodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.COSTBmsg, frodo2.algorithms.duct.COSTmsg, frodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >
• getCostMessage() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• getCount() : frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.TestMessage
• getCounter() : frodo2.algorithms.duct.BOUNDmsg
• getCryptoScheme() : 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 >
• getCumulativeNumberOfSpeculativeUTILmsgs() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• getCurrentBound() : frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >
• getCurrentDelta() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• getCurrentMessageWrapper() : frodo2.communication.Queue
• getCurrentSolution() : 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.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentInterface< V extends Addable< V > >, 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.SingleQueueAgent< Val extends Addable< Val > >, frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >, frodo2.daemon.TestLocalWhitePages.SimpleAgent, frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >, 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.JaCoPutilSpaceIter2< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• getCurrentTime() : frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• getCurrentUtility() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, 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.HypercubeIter< 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.hypercube.ScalarSpaceIter< V extends Addable< V >, U extends Addable< U > >, 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.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• getCurrentValue() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• getDaemonList() : frodo2.controller.ConfigurationManager, frodo2.controller.userIO.UserIO
• getDaemons() : frodo2.controller.TestWhitePages.WhitePagesExtention
• getData() : frodo2.communication.MessageSerializedSimple< T extends Serializable >
• getDebug() : frodo2.controller.ConfigurationManager
• getDeclaredOrder() : frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >.DFSorderOutputMessage
• getDecryptFor() : frodo2.algorithms.dpop.privacy.DecryptVectorRequest< C extends Addable< C >, E extends AddableLimited< C, E >
• getDefaultConsistencyPruningEvent() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube
• getDefaultUtility() : 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 > >
• getDest() : frodo2.algorithms.dpop.count.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.dpop.memory.ContextMsg< V extends Addable< V > >, frodo2.algorithms.dpop.memory.LabelMsg< V extends Addable< V > >, frodo2.algorithms.dpop.param.VALUEmsg< Val extends Addable< Val > >, 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 >, frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.VectorOutput< C extends Addable< C > >, frodo2.algorithms.dpop.privacy.DeliveryMsg< M extends Message >, frodo2.algorithms.dpop.privacy.OptUtilMsg< U extends Addable< U > >, frodo2.algorithms.dpop.privacy.RerootingMsg, frodo2.algorithms.dpop.privacy.RoutingMsg< M extends Message >, frodo2.algorithms.dpop.privacy.StopMsg, frodo2.algorithms.dpop.stochastic.LCAmsg1, frodo2.algorithms.dpop.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.odpop.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.odpop.VALUEmsgWithVars< Val extends Addable< Val > >, frodo2.algorithms.varOrdering.dfs.CHILDmsg, frodo2.algorithms.varOrdering.dfs.PSEUDOmsg, frodo2.algorithms.varOrdering.dfs.VarNbrMsg
• getDestination() : frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.communication.MessageWrapper
• getDestinations() : frodo2.communication.MessageWrapper
• getDFS() : frodo2.algorithms.dpop.DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
• getDFSclass() : frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest
• getDFSMsgType() : frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >
• getDisplayTime() : frodo2.gui.Visualizer
• getDivide() : frodo2.algorithms.duct.NORMmsg
• getDom() : frodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >
• getDomain() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo, 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.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 > >
• getDomains() : frodo2.algorithms.dpop.privacy.VarCodenameMsg< V >, 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 > >, frodo2.algorithms.odpop.UTILvarsDomsMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, 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.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 > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< 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.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• getDomainSize() : 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 > >
• getDomClass() : 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 > >
• getDomInfo() : frodo2.algorithms.asodpop.UTILdomMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.UTILvarsMsgWithDom< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILdomMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILvarsMsgWithDom< Val extends Addable< Val >, U extends Addable< U > >
• getDummiesFillPercentage() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• getDummyFillPercentage() : frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• getEavesdropper() : frodo2.algorithms.Eavesdroppable< T >, frodo2.algorithms.test.MessageDebugger
• getElem() : frodo2.algorithms.dpop.privacy.DecryptVectorRequest< C extends Addable< C >, E extends AddableLimited< C, E >
• getElement() : frodo2.algorithms.localSearch.dsa.DSAsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGMsolver< V extends Addable< V >, U extends Addable< U > >
• getEncryptDomain() : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo
• getExample() : 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 > >
• getExpectedOptUtil() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >
• getExpectedUtil() : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >
• getExpectedUtility() : 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 > >
• getExpUtil() : frodo2.algorithms.dpop.stochastic.E_DPOPsolver< V extends Addable< V >, U extends Addable< U > >.StochSolution< V, U >
• getExtendedRandNeighbors() : frodo2.algorithms.test.XCSPparserTest
• getExtVars() : 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 > >
• getFactors() : frodo2.solutionSpaces.crypto.ElGamalScheme
• getFileHeader() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• getFinalBound() : frodo2.algorithms.duct.BoundStatsMsg, frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >, 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
• getFinalDomainSize() : 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 > >
• getFinalTime() : 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.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.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 > >, 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.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
• getFlag() : frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.MessageLEoutput< T extends Comparable< T > &Serializable >
• getFlags() : frodo2.algorithms.dpop.stochastic.LCAmsg1, frodo2.algorithms.dpop.stochastic.LCAmsg2
• getFlatOrder() : frodo2.algorithms.varOrdering.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > >
• getFunctionNode() : frodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.VariableMsg< V extends Addable< V >, U extends Addable< U > >
• getFunctions() : frodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >
• getGain() : frodo2.algorithms.localSearch.mgm.mgm2.ACCEPT< Val extends Addable< Val >, U extends Addable< U > >
• getGenerator() : frodo2.solutionSpaces.crypto.ElGamalScheme
• getGood() : 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 > >, frodo2.algorithms.odpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILvarsMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.benchmarks.auctions.cats.Auction
• getGoodID() : frodo2.benchmarks.auctions.cats.Good
• getGoodIDsForBid() : frodo2.benchmarks.auctions.xcsp.Relations
• getGoods() : frodo2.benchmarks.auctions.cats.Auction
• getGoodsList() : frodo2.benchmarks.auctions.cats.Bid
• getGoodsScopeByBidder() : frodo2.benchmarks.auctions.xcsp.Instance
• getHandler() : frodo2.communication.MessageWithRawData
• getID() : frodo2.algorithms.AgentInterface< V extends Addable< V > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >, frodo2.controller.messages.MessageAgentReporting, frodo2.daemon.TestLocalWhitePages.SimpleAgent
• getIDs() : frodo2.algorithms.varOrdering.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > >
• getImprove() : frodo2.algorithms.localSearch.mgm.IMPROVE< U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.IMPROVE< U extends Addable< U > >
• getInboxSize() : frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• getIndex() : 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.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.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• getIndexOfUtilityValue() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• getInfeasibleUtil() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• getInitial() : frodo2.algorithms.dpop.privacy.DecryptVectorRequest< C extends Addable< C >, E extends AddableLimited< C, E >
• getInput() : frodo2.daemon.Daemon
• getIntVarCloneable() : frodo2.solutionSpaces.JaCoP.Predicate
• getJaCoPvars() : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >
• getKey() : frodo2.algorithms.dpop.privacy.KeyShareMsg< K extends CryptoScheme.PublicKeyShare >
• getLB() : frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > >
• getLeader() : frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.MessageLEoutput< T extends Comparable< T > &Serializable >
• getLeafType() : frodo2.communication.MessageType
• getLocalPipe() : frodo2.daemon.LocalAgentReport
• getLocalProblem() : frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.MASProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getLocalSpace() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• getLogClass() : frodo2.controller.ConfigurationManager
• getLowerAgent() : frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SeparatorMessage
• getLowerBound() : frodo2.algorithms.duct.BOUNDmsg
• getMap() : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.StatRequestOutput
• getMarginalUtil() : frodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.VariableMsg< V extends Addable< V >, U extends Addable< U > >
• getMatrix() : frodo2.algorithms.mpc_discsp.Matrix
• getMaxChild() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• getMaxID() : frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >, frodo2.algorithms.varOrdering.election.MaxIDmsg< T extends Comparable< T > &Serializable >, frodo2.algorithms.varOrdering.election.VarElectionMessenger
• getMaximalCut() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• getMaximalCutSum() : frodo2.algorithms.odpop.ODPOPsolution< V, U >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• getMaxMsgDim() : 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.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.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 > >
• getMaxMsgSize() : frodo2.algorithms.Solution< V, U >
• getMaxMsgSizes() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage, frodo2.algorithms.Solution< V, U >, frodo2.communication.Queue
• getMaxUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• getMaxUBChild() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• getMaxUtil() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• getMessage() : frodo2.algorithms.dpop.privacy.DeliveryMsg< M extends Message >, frodo2.algorithms.varOrdering.dfs.ParallelDFSmsg< S extends Comparable< S > &Serializable >, frodo2.communication.MessageWrapper
• getMessageCounter() : frodo2.communication.MessageWrapper
• getMinInfinity() : frodo2.solutionSpaces.Addable< T extends Addable< T > >, frodo2.solutionSpaces.AddableBigDecimal, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.AddableInteger, frodo2.solutionSpaces.AddableReal, frodo2.solutionSpaces.crypto.AddableBigInteger
• getMinInfUtility() : frodo2.algorithms.AbstractProblem< 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 > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getMinus() : frodo2.algorithms.duct.NORMmsg
• getMsgDim() : 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
• getMsgNbrs() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage, frodo2.algorithms.Solution< V, U >, frodo2.communication.Queue
• getMsgNbrsReceivedPerAgent() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• getMsgNbrsSent() : frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage, frodo2.communication.Queue
• getMsgNbrsSentPerAgent() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• getMsgSize() : frodo2.communication.MsgSizeMonitor
• getMsgSizes() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage, frodo2.algorithms.Solution< V, U >, frodo2.communication.Queue
• getMsgSizesReceivedPerAgent() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• getMsgSizesSent() : frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage, frodo2.communication.Queue
• getMsgSizesSentPerAgent() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• getMsgType() : 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 > >
• getMsgTypes() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Version< Val extends Addable< Val >, U extends Serializable &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.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >, 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.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.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >, 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.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.mpc_discsp.MPC_DisWCSP4< 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 > >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest, 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
• getMsgViz() : frodo2.gui.Visualizer
• getMyVars() : 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 > >
• getName() : frodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > >, 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 > >
• getNbrIntVars() : 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 > >
• getNbrMsgs() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >
• getNbrMsgsNeeded() : frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest
• getNbrNeighbors() : 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 > >
• getNbrReceived() : frodo2.controller.TestConfigurationManager.SimpleDaemonListener
• getNbrSolutions() : 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.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.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• getNbrVariables() : 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.Solution< V, U >
• getNbrVars() : 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 > >
• getNbTuples() : frodo2.benchmarks.auctions.xcsp.Relation
• getNcccCount() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >
• getNCCCs() : 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.controller.ConfigurationManager, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getNcccs() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• getNeighborhoods() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.test.XCSPparserTest, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getNeighborhoodSizes() : 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 > >
• getNeighbors() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput< V extends Addable< V >, U extends Addable< U > >
• getNeighborVars() : 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 > >
• getNewInstance() : frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >
• getNewValueMessage() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• getNewVariable() : 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
• getNextFromSearch() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
• getNextMsg() : frodo2.communication.QueueTest.QueueOutputPipeTrivial, frodo2.communication.sharedMemory.QueueIOPipeTest.Collector
• getNextMsgTimed() : frodo2.communication.QueueTest.QueueOutputPipeTrivial, frodo2.communication.sharedMemory.QueueIOPipeTest.Collector
• getNiceRandGraph() : frodo2.algorithms.RandGraphFactory
• getNode() : frodo2.algorithms.dpop.stochastic.LCAmsg2
• getNumberOfCoordinationConstraints() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getNumberOfDummies() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• getNumberOfFeasibleSolutions() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >
• getNumberOfGoodsSent() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• getNumberOfSolutions() : 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.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• getNumberOfSpeculativeUTIlmessages() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• getNumberOfUTILmessages() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< 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 > >
• getNumberOfVariables() : 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 > >, 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 > >
• getOfuscatedDomain() : frodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.VarCodenameMsg< V >
• getOfuscatedUtility() : frodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > >
• getOptParamUtil() : frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >
• getOptUtil() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.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 > >
• getOrder() : frodo2.algorithms.varOrdering.dfs.CHILDorderMsg, frodo2.algorithms.varOrdering.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > >
• getOutput() : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >.VectorOutput< C extends Addable< C > >
• getOutputMsgType() : 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 > >, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationWithOrderTest
• getOutputPipe() : frodo2.communication.Queue
• getOverallMaxMsgSize() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• getOwnAssignment() : frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
• getOwner() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.VectorMsg< C extends Addable< C >, E extends AddableLimited< C, E >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.auctions.xcsp.Constraint, frodo2.benchmarks.auctions.xcsp.Variable, 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.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 > >
• getOwners() : 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 > >
• getOwnValue() : frodo2.algorithms.localSearch.mgm.mgm2.BinaryAssignment< Val extends Addable< Val > >
• getOwnVariableOptions() : 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 > >
• getParamsHeader() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.localSearch.dsa.DSAsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGMsolver< V extends Addable< V >, U extends Addable< U > >
• getParamSolution() : frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >
• getParamsToLine() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.localSearch.dsa.DSAsolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGMsolver< V extends Addable< V >, U extends Addable< U > >
• getParamUtility() : 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 > >
• getParent() : 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, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.MessageType
• getParentAgent() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• getPartialAssignment() : 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
• getPathToPseudoChild() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• getPayload() : frodo2.algorithms.dpop.privacy.RoutingMsg< M extends Message >, frodo2.algorithms.dpop.privacy.ToLastLeafMsg, frodo2.communication.MessageWithPayload< T extends Serializable >
• getPayload1() : 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 >
• getPayload2() : 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 >
• getPayload3() : 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 >
• getPayload4() : 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 >
• getPayload5() : frodo2.communication.MessageWith5Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable, T4 extends Serializable, T5 extends Serializable >
• getPercentageOfGoodsSent() : frodo2.algorithms.odpop.ODPOPsolution< V, U >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• getPlusInfinity() : frodo2.solutionSpaces.Addable< T extends Addable< T > >, frodo2.solutionSpaces.AddableBigDecimal, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.AddableInteger, frodo2.solutionSpaces.AddableReal, frodo2.solutionSpaces.crypto.AddableBigInteger
• getPlusInfUtility() : frodo2.algorithms.AbstractProblem< 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 > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getPort() : frodo2.communication.tcp.TCPAddress, frodo2.daemon.Daemon, frodo2.daemon.LocalAgentReport
• getPrice() : frodo2.benchmarks.auctions.cats.Bid
• getProbabilitySpacePerRandVar() : frodo2.algorithms.Problem< 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 > >
• getProbabilitySpaces() : 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 > >
• getProbOfOptimality() : 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 >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >
• getProbStats() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• getProjectedVars() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• getProjVarDomain() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• getPseudoChildren() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• getPseudoMsgType() : 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 > >
• getPseudoParents() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• getPublicKey() : frodo2.algorithms.mpc_discsp.EncrSharesMsg
• getRandGraph() : frodo2.algorithms.RandGraphFactory
• getRandomUnknowLocal() : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• getRandomValue() : 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.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 > >
• getRandVars() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >.RandVarsProjMsg, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.RandVarsProjMsg, frodo2.algorithms.varOrdering.dfs.CHILDrandMsg, frodo2.algorithms.varOrdering.dfs.RandVarsMsg, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getRawData() : frodo2.communication.MessageWithRawData
• getReceived() : frodo2.daemon.TestLocalWhitePages.SimpleAgent
• getReceiver() : frodo2.algorithms.adopt.BoundsMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ENDmsg< Val extends Addable< Val > >, frodo2.algorithms.adopt.HeuristicMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.VALUEmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ACKmsg, frodo2.algorithms.asodpop.VALUEmsgPseudo< Val extends Addable< Val > >, frodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.VarCodenameMsg< V >, frodo2.algorithms.duct.BOUNDmsg, frodo2.algorithms.duct.COSTBmsg, frodo2.algorithms.duct.COSTmsg, frodo2.algorithms.duct.NORMmsg, frodo2.algorithms.duct.VALUEmsg< V extends Addable< V > >, frodo2.algorithms.localSearch.dsa.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.localSearch.mgm.IMPROVE< U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.ACCEPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.GO, frodo2.algorithms.localSearch.mgm.mgm2.IMPROVE< U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.NOGO, frodo2.algorithms.localSearch.mgm.mgm2.OFFER< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.OFFERold< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.REJECT, frodo2.algorithms.localSearch.mgm.OK< V extends Addable< V > >, frodo2.algorithms.odpop.ASKmsg, frodo2.algorithms.odpop.DONEmsg, frodo2.algorithms.odpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >
• getRelation() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• getRelationName() : 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 > >
• getRelations() : frodo2.benchmarks.auctions.xcsp.Relations
• getReportedHeuristics() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >
• getReportedUtil() : frodo2.algorithms.Solution< V, U >
• getReportedValues() : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >
• getReportedVariables() : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >
• getRequestCountMapping() : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• getReservePrice() : frodo2.benchmarks.auctions.cats.Good
• getResultFile() : frodo2.controller.ConfigurationManager
• getRingGraph() : frodo2.algorithms.RandGraphFactory
• getRoot() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.ParallelDFSmsg< S extends Comparable< S > &Serializable >
• getRootID() : frodo2.algorithms.varOrdering.dfs.CHILDmsg, frodo2.algorithms.varOrdering.dfs.PSEUDOmsg
• getRootVarMsgType() : 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 > >
• getRound() : frodo2.algorithms.dpop.privacy.VectorMsg< C extends Addable< C >, E extends AddableLimited< C, E >
• getRowDimension() : frodo2.algorithms.mpc_discsp.Matrix
• getSafePrime() : frodo2.solutionSpaces.crypto.ElGamalScheme
• getSafePrimeAndGenerator() : frodo2.solutionSpaces.crypto.ElGamalScheme
• getSamples() : frodo2.algorithms.dpop.stochastic.SamplesMsg1< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.SamplesMsg2< V extends Addable< V > >
• getScalingFactor() : frodo2.algorithms.duct.OUTmsg< V extends Addable< V > >
• getScope() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.auctions.xcsp.Constraints
• getScore() : frodo2.algorithms.heuristics.AgentNameHeuristic, frodo2.algorithms.heuristics.AgentScoringHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.Heuristic< T extends Comparable< T > &Serializable >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom
• getScores() : frodo2.algorithms.heuristics.LeastConnectedHeuristic, frodo2.algorithms.heuristics.MostConnectedHeuristic, frodo2.algorithms.heuristics.RandScoringHeuristic, frodo2.algorithms.heuristics.ScoringHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.heuristics.ScoringHeuristicWithTiebreaker< S1 extends Comparable< S1 > &Serializable, S2 extends Comparable< S2 > &Serializable >, frodo2.algorithms.heuristics.SmallestDomainHeuristic, frodo2.algorithms.heuristics.VarNameHeuristic, frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >.VarElectionHeuristic
• getSelfAddress() : frodo2.communication.PipeFactory, frodo2.communication.tcp.TCPPipeFactory
• getSender() : frodo2.algorithms.adopt.BoundsMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ENDmsg< Val extends Addable< Val > >, frodo2.algorithms.adopt.HeuristicMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.VALUEmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.AgentInterface< V extends Addable< V > >.ComStatsMessage, frodo2.algorithms.asodpop.VALUEmsgPseudo< Val extends Addable< Val > >, frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >.SolutionSizeMessage< Val extends Addable< Val > >, frodo2.algorithms.dpop.memory.LabelMsg< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.CodeNameMsg< V extends Addable< V > >, frodo2.algorithms.dpop.privacy.KeyShareMsg< K extends CryptoScheme.PublicKeyShare >, frodo2.algorithms.dpop.privacy.RoutingMsg< M extends Message >, frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.TestMessage, frodo2.algorithms.dpop.privacy.VarCodenameMsg< V >, frodo2.algorithms.dpop.restart.Token, frodo2.algorithms.dpop.stochastic.LCAmsg1, frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.duct.VALUEmsg< V extends Addable< V > >, frodo2.algorithms.localSearch.dsa.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.localSearch.mgm.IMPROVE< U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.ACCEPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.IMPROVE< U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.OFFER< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.OFFERold< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.OK< V extends Addable< V > >, frodo2.algorithms.mpc_discsp.SolShareMsg, frodo2.algorithms.odpop.DONEmsg, frodo2.algorithms.odpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.CHILDmsg, frodo2.algorithms.varOrdering.dfs.PSEUDOmsg, frodo2.algorithms.varOrdering.election.LeaderElectionMaxID< T extends Comparable< T > &Serializable >.MessageLEoutput< T extends Comparable< T > &Serializable >, frodo2.algorithms.varOrdering.election.MaxIDmsg< T extends Comparable< T > &Serializable >
• getSenderAgent() : frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >
• getSep() : frodo2.algorithms.dpop.memory.LabelMsg< V extends Addable< V > >
• getSeparator() : 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
• getSeparators() : frodo2.algorithms.duct.OUTmsg< V extends Addable< V > >
• getSeperator() : frodo2.algorithms.duct.BOUNDmsg
• getShare() : frodo2.algorithms.mpc_discsp.OneShareMsg
• getShares() : frodo2.algorithms.mpc_discsp.EncrSharesMsg, frodo2.algorithms.mpc_discsp.SharesMsg, frodo2.algorithms.mpc_discsp.SolShareMsg
• getSize() : frodo2.algorithms.duct.BOUNDmsg, frodo2.algorithms.duct.OUTmsg< V extends Addable< V > >
• getSizedRandGraph() : frodo2.algorithms.RandGraphFactory
• getSizeOfSpace() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• getSlicedVars() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• getSolGatherers() : 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.maxsum.MaxSumSolver< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.MPC_DisWCSP4solver< 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 > >
• getSolution() : frodo2.algorithms.afb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SolutionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCopxcspParserTest
• getSolutionSpaces() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.vehiclerouting.XCSPparserVRPODPOP< U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getSpace() : frodo2.algorithms.adopt.HeuristicMsg< Val extends Addable< Val >, U extends Addable< U > >, 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.privacy.EncrUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.ProjOutput< V extends Addable< V >, U extends Addable< U > >
• getSpaces() : frodo2.algorithms.duct.OUTmsg< V extends Addable< V > >, 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.linear.OrderMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• getSpaceSize() : frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• getSpeculativeUTILcounter() : 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 > >
• getSpecUTILmsgs() : frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >
• getSquareGrid() : frodo2.algorithms.RandGraphFactory
• getStartMsgType() : frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >
• getStatsFromQueue() : 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.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >, frodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > >.Listener, 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.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >, 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 > >
• getStore() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• getSubProblem() : 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.benchmarks.vehiclerouting.XCSPparserVRP< U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, 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 > >
• getThreshold() : frodo2.algorithms.adopt.VALUEmsg< Val extends Addable< Val >, U extends Addable< U > >
• getTime() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.MessageWrapper
• getTimeNeeded() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >
• getTimeOut() : frodo2.controller.ConfigurationManager
• getTimeoutLine() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• getTimesNeeded() : frodo2.algorithms.Solution< V, U >
• getTimeStamp() : frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.CurrentAssignment< Val >
• getTotal() : frodo2.algorithms.varOrdering.dfs.VarNbrMsg
• getTotalMsgSize() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >
• getTotalTime() : frodo2.algorithms.Solution< V, U >
• getTranslatedValue() : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• getTree() : frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.GoodsTreeMessage< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• getTreeCellEditorComponent() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• getTreeCellRendererComponent() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• getTreeFillPercentage() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >
• getTreeNode() : frodo2.gui.VisualizerControls
• getTreeWidth() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >
• getTrueOrder() : frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >.DFSorderOutputMessage
• getType() : frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.Message, frodo2.solutionSpaces.MASProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getUB() : frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< 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 > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >
• getUpperBound() : frodo2.algorithms.duct.BOUNDmsg
• getUtil() : frodo2.algorithms.dpop.privacy.OptUtilMsg< U extends Addable< 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 > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >
• getUtilClass() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getUTILcounter() : 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 > >
• getUtilities() : frodo2.algorithms.localSearch.mgm.mgm2.OFFER< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.OFFERold< Val extends Addable< Val >, U extends Addable< U > >
• getUtility() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< U extends Addable< U > >, frodo2.algorithms.odpop.Good< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.OptUtilMessage< U extends Addable< U > >, frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Solution< V, U >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >, 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 > >, 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.JaCoPiterSearch< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< 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 > >
• getUtilityLocalProblem() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• getUtilityNoNCCCs() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• getUtilityValueSameOrder() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• getUTILmsgs() : frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >
• getVal() : frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >.RootValueMsg
• getValuation() : frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >
• getValue() : frodo2.algorithms.adopt.VALUEmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.localSearch.mgm.OK< V extends Addable< V > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper, frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNode< Val extends Addable< Val > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentMessage< V extends Addable< V > >
• getValues() : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >.SolutionSizeMessage< Val extends Addable< Val > >, frodo2.algorithms.dpop.count.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.dpop.memory.ContextMsg< V extends Addable< V > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.AssignmentMessage< Val extends Addable< Val > >, frodo2.algorithms.dpop.param.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.dpop.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.duct.VALUEmsg< V extends Addable< V > >, frodo2.algorithms.odpop.Assignment< Val extends Addable< Val > >, frodo2.algorithms.odpop.Good< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.odpop.VALUEmsgWithVars< Val extends Addable< Val > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentsMessage< V >
• getVar() : frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >.RootValueMsg, frodo2.algorithms.dpop.privacy.ToLastLeafMsg, frodo2.algorithms.StatsReporterWithConvergence< Val extends Addable< Val > >.ConvStatMessage< Val >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >.DFSorderOutputMessage, frodo2.algorithms.varOrdering.dfs.RandVarsMsg
• getVariable() : 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.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >.RandVarsProjMsg, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.RandVarsProjMsg, frodo2.algorithms.duct.OUTmsg< V extends Addable< V > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.GoodsTreeMessage< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.OptUtilMessage< U extends Addable< U > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentMessage< V extends Addable< V > >, 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 > >, 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 > >
• getVariableIndex() : 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 > >
• getVariableInfo() : 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 > >
• getVariables() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >.SolutionSizeMessage< Val extends Addable< Val > >, frodo2.algorithms.dpop.count.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.AssignmentMessage< Val extends Addable< Val > >, frodo2.algorithms.dpop.param.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val > >, frodo2.algorithms.dpop.VALUEmsg< Val extends Addable< Val > >, frodo2.algorithms.duct.VALUEmsg< V extends Addable< V > >, frodo2.algorithms.odpop.Assignment< Val extends Addable< Val > >, frodo2.algorithms.odpop.Good< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILvarsMsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentsMessage< V >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.auctions.xcsp.Variables, 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.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 > >, frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >, 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 > >.ProjOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• getVariablesOrder() : 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.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.JaCoPutilSpaceIter2< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• getVarName() : frodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.auctions.xcsp.Variable
• getVarNamesFromBidder() : frodo2.benchmarks.auctions.xcsp.Constraints
• getVarNamesFromBids() : frodo2.benchmarks.auctions.xcsp.Constraints
• getVarNamesFromGood() : frodo2.benchmarks.auctions.xcsp.Constraints
• getVars() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.MessageDFSoutput< V extends Addable< V >, U extends Addable< U > >
• getVarScopes() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
• getVector() : frodo2.algorithms.dpop.privacy.VectorMsg< C extends Addable< C >, E extends AddableLimited< C, E >
• getWorstUtil() : 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 >, frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >
• getZero() : frodo2.solutionSpaces.Addable< T extends Addable< T > >, frodo2.solutionSpaces.AddableBigDecimal, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.AddableInteger, frodo2.solutionSpaces.AddableReal, frodo2.solutionSpaces.crypto.AddableBigInteger
• getZeroUtility() : frodo2.algorithms.AbstractProblem< 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 > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• GO() : frodo2.algorithms.localSearch.mgm.mgm2.GO
• Good() : frodo2.algorithms.asodpop.Good< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.Good< Val extends Addable< Val >, U extends Addable< U > >, frodo2.benchmarks.auctions.cats.Good
• GoodsTree() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• GoodsTreeMessage() : frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.GoodsTreeMessage< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• Graph() : frodo2.algorithms.RandGraphFactory.Graph
• GraphColoring() : frodo2.benchmarks.graphcoloring.GraphColoring
• greaterThan() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• greaterThanOrEqual() : frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
• ground() : frodo2.algorithms.Problem< 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 > >
• groundVars() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >