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

- f -

• f() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• FactorGraphGen() : frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >
• factorGraphToDOT() : frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >
• factory : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• FakeCryptoScheme() : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme
• FakeCryptoSchemeTest() : frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest
• fakeElement : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
• fakeEncrypt() : frodo2.algorithms.mpc_discsp.PaillierPublicKey
• FakeEncryptedInteger() : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger
• FakeQueue() : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue, frodo2.communication.mailer.CentralMailer.FakeQueue
• fakeSerialize() : frodo2.algorithms.adopt.BoundsMsg< Val extends Addable< Val >, U extends Addable< U > >, 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.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >.OptUtilMessage< Val extends Addable< Val >, U extends Addable< U > >, 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.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.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.SolutionMessage< Val extends Addable< Val > >, frodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.VariableMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.Message
• FB_CPA_TYPE : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• FB_ESTIMATE_TYPE : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• FbCpaMsg() : frodo2.algorithms.afb.FbCpaMsg< V extends Addable< V >, U extends Addable< U > >
• FbEstimateMsg() : frodo2.algorithms.afb.FbEstimateMsg< V extends Addable< V >, U extends Addable< U > >
• fcs : frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest
• feasible : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• filePath : frodo2.solutionSpaces.vehiclerouting.test.VRPtests
• fillOwnOptions() : frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
• fillPercentageCounter : 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 > >
• fillTree() : 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 > >
• fillVariablesValues() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• filter() : org.jacop.constraints.AndBoolCloneable
• finalBound : frodo2.algorithms.duct.DUCTSolution< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >
• finalDomainSize : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• finalDomainSizeReceiver() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• finalDomainSizeUnknownVariables : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• finalize() : frodo2.communication.MessageWithRawData, frodo2.communication.tcp.RawDataHandlerTCP, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
• finalNCCCcount : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.controller.ConfigurationManager
• finalSamples : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >
• finalSpace : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo
• finalTime : 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.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 > >
• findAllSolutions() : frodo2.algorithms.mpc_discsp.MPC_DisWCSP4< V extends Addable< V > >
• findFirstSolution() : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >, frodo2.algorithms.mpc_discsp.MPC_DisWCSP4< V extends Addable< V > >
• findMaxConstraintArity() : frodo2.benchmarks.auctions.xcsp.Instance
• findMaxUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• findMaxUtility() : frodo2.benchmarks.auctions.main.CATSToXCSP
• findOptimalAssignmentAndSend() : frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• findOptimalValueForIsolatedVar() : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >
• findOrCloneInto() : org.jacop.core.StoreCloneable
• findUnused() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• FINISH_MSG_TYPE : frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.VALUEpropagation< Val extends Addable< Val > >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable >
• finished : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.adopt.test.testPreprocessing, frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest
• finished_lock : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.adopt.test.testPreprocessing, frodo2.algorithms.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.dpop.privacy.test.SecureCircularRoutingTest, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentTest, frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest
• finishedSampling() : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• fixed : frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• flagProb : frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest
• flip() : org.jacop.constraints.netflow.ArithmeticCloneable
• flipSign() : frodo2.solutionSpaces.Addable< T extends Addable< T > >, frodo2.solutionSpaces.AddableBigDecimal, frodo2.solutionSpaces.AddableBigDecimal.MinInfinity, frodo2.solutionSpaces.AddableBigDecimal.PlusInfinity, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.AddableInteger, frodo2.solutionSpaces.AddableInteger.MinInfinity, frodo2.solutionSpaces.AddableInteger.PlusInfinity, frodo2.solutionSpaces.AddableReal, frodo2.solutionSpaces.AddableReal.MinInfinity, frodo2.solutionSpaces.AddableReal.PlusInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger, frodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity
• forward : frodo2.communication.QueueTest.ConstantMsgPolicy
• Forwarder() : frodo2.algorithms.dpop.privacy.test.SecureCircularRoutingTest.Forwarder
• forwardToSelf : frodo2.communication.QueueTest.ConstantMsgPolicy
• foundUndefinedRelations() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.vehiclerouting.XCSPparserVRP< U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• frame : frodo2.gui.jung.JungVisualizer
• freezeTime() : frodo2.communication.mailer.CentralMailer.FakeQueue
• frequencie : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• fromBooleanArrayToInt() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• fromInt() : 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
• fromString() : 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
• fromXML() : frodo2.communication.MessageType
• FSMCloneable() : org.jacop.util.fsm.FSMCloneable
• full_info : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• full_info_counter : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• fullInfo : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• fullInfoCounter : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• FUNC_PREFIX : frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >
• FUNCTION_MSG_TYPE : frodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >
• FunctionInfo() : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.FunctionInfo
• functionInfos : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >
• FunctionMsg() : frodo2.algorithms.maxsum.FunctionMsg< V extends Addable< V >, U extends Addable< U > >
• FunctionNode() : frodo2.algorithms.varOrdering.factorgraph.FunctionNode< V extends Addable< V >, U extends Addable< U > >
• functions : frodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >
• futureLbS : org.jacop.constraints.AmongVarCloneable