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

- p -

• p : 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 > >.SimpleHeuristic< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.solutionSpaces.crypto.ElGamalScheme, frodo2.solutionSpaces.crypto.ElGamalSchemeTest
• p2 : frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable< U > >
• P2_DPOP : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.Algorithm
• P2_DPOPagentTest() : frodo2.algorithms.dpop.privacy.test.P2_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >
• P2_DPOPsolver() : frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >
• P3halves_DPOP : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.Algorithm
• P3halves_DPOPagentTest() : frodo2.algorithms.dpop.privacy.test.P3halves_DPOPagentTest< V extends Addable< V >, E extends AddableLimited< AddableInteger, E >
• P3halves_DPOPsolver() : frodo2.algorithms.dpop.privacy.P3halves_DPOPsolver< V extends Addable< V > >
• P_DPOP : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.Algorithm
• P_DPOPagentTest() : frodo2.algorithms.dpop.privacy.test.P_DPOPagentTest< V extends Addable< V > >
• P_DPOPsolver() : frodo2.algorithms.dpop.privacy.P_DPOPsolver< V extends Addable< V > >
• PA() : frodo2.algorithms.afb.PA< V extends Addable< V >, U extends Addable< U > >
• pa : frodo2.algorithms.afb.AFBBaseMsg< V extends Addable< V >, U extends Addable< U > >
• PaillierCryptoScheme() : frodo2.algorithms.mpc_discsp.PaillierCryptoScheme
• PaillierInteger() : frodo2.algorithms.mpc_discsp.PaillierInteger
• PaillierPublicKey() : frodo2.algorithms.mpc_discsp.PaillierPublicKey
• pairs : frodo2.benchmarks.kidneys.KidneyExchange
• PARALLEL_DFS_MSG_TYPE : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
• ParallelDFSmsg() : frodo2.algorithms.varOrdering.dfs.ParallelDFSmsg< S extends Comparable< S > &Serializable >
• PARAM_OUTPUT_MSG_TYPE : frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >
• PARAM_VALUE_MSG_TYPE : frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >
• ParamDPOPsolver() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >
• ParamDPOPtest() : frodo2.algorithms.dpop.param.test.ParamDPOPtest< V extends Addable< V >, U extends Addable< U > >
• parameters : frodo2.algorithms.adopt.test.testADOPT, 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.test.UTILpropagationTest< U extends Addable< U > >, frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest, frodo2.algorithms.localSearch.dsa.tests.TestDSA< 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 > >
• ParamSolution() : frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >
• ParamUTIL() : frodo2.algorithms.dpop.param.ParamUTIL< Val extends Addable< Val >, U extends Addable< U > >
• paramUtilModule : frodo2.algorithms.dpop.param.test.ParamDPOPtest< V extends Addable< V >, U extends Addable< U > >
• ParamUTILtest() : frodo2.algorithms.dpop.param.test.ParamUTILtest< U extends Addable< U > >
• ParamVALUE() : frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >
• paramValueModule : frodo2.algorithms.dpop.param.test.ParamDPOPtest< V extends Addable< V >, U extends Addable< U > >
• ParamVALUEtest() : frodo2.algorithms.dpop.param.test.ParamVALUEtest< U extends Addable< U > >
• parent : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.PreprocessingHeuristic< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• parentAgent : frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• parentFinished : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• parents : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.Normalize< V extends Addable< V > >
• parse() : frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.ParserInterface< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.benchmarks.vehiclerouting.CordeauToXCSP, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.Predicate
• parseAuction() : frodo2.benchmarks.auctions.main.CATSToXCSP
• parseConfigurationFile() : frodo2.controller.ConfigurationManager
• parseConstraint() : 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 > >
• parseGlobalConstraint() : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• parseInput() : frodo2.controller.userIO.Console, frodo2.daemon.userIO.Console
• parseInt() : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• parseMethod() : frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > >
• parseParams() : 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 > >
• parsePredicate() : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• parseProblem() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• parser : frodo2.algorithms.adopt.test.testADOPT, frodo2.algorithms.adopt.test.testPreprocessing, frodo2.algorithms.adopt.test.testPreprocessing.receiveLowerBounds, 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.privacy.test.SecureCircularRoutingTest, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >, frodo2.algorithms.dpop.stochastic.test.SamplingPhaseTest, frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.dpop.test.VALUEpropagationTest< U extends Addable< U > >.Listener, frodo2.algorithms.duct.tests.NormalizeInfTest, frodo2.algorithms.duct.tests.NormalizeTest, 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.test.ProblemTest, frodo2.algorithms.test.XCSPparserTest, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest, frodo2.algorithms.varOrdering.linear.tests.CentralLinearOrderingTest
• parserClass : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentTest
• parseRelation() : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• parseSpaces() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
• partialDecrypt() : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme, frodo2.solutionSpaces.crypto.CryptoScheme< C extends Serializable, E extends Serializable, K extends CryptoScheme.PublicKeyShare >, frodo2.solutionSpaces.crypto.ElGamalScheme
• partialEncrypt() : frodo2.solutionSpaces.crypto.ElGamalSchemeTest
• partialPaths : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
• partialyDecrypt() : frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest
• PartyInstance() : frodo2.benchmarks.party.PartyGame.PartyInstance
• passOn() : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
• path : frodo2.communication.MessageType
• PATH_MSG_TYPE : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• pathAlive() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• pathExists() : 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 > >
• PathMsg() : frodo2.algorithms.synchbb.PathMsg< V extends Addable< V >, U extends Addable< U > >
• pathsToPseudoChildren : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• patientABO : frodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair
• PatientDonorPair() : frodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair
• payload : frodo2.communication.MessageWithPayload< T extends Serializable >
• payload1 : 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 >
• payload2 : 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 >
• payload3 : 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 >
• payload4 : 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 >
• payload5 : frodo2.communication.MessageWith5Payloads< T1 extends Serializable, T2 extends Serializable, T3 extends Serializable, T4 extends Serializable, T5 extends Serializable >
• PEAV : frodo2.benchmarks.meetings.MeetingScheduling.Mode
• penalty : frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• pendingConvMsgs : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• pendingCPAmsgs : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• pendingDone : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo
• pendingFbCpaMsgs : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• pendingMessages : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• pendingMsgs : frodo2.algorithms.dpop.privacy.SecureCircularRouting, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest, frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• pendingPathMsgs : frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• pendingSolMsgs : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• perAgent : frodo2.algorithms.test.MessageDebugger
• percentageOfGoodsSent : frodo2.algorithms.odpop.ODPOPsolution< V, U >
• permutation : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo, frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• phase : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• PHASE1_MSG_TYPE : frodo2.algorithms.dpop.stochastic.LowestCommonAncestors
• phase1msgs : frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo
• PHASE2_MSG_TYPE : frodo2.algorithms.dpop.stochastic.LowestCommonAncestors
• pipe : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentFactory< 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.test.DPOPagentTest< V extends Addable< V >, 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.communication.sharedMemory.QueueIOPipeTest
• PipeFactoryInstance : frodo2.controller.Controller
• pipes : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.AgentFactory< 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 > >.Listener, 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
• piv : frodo2.algorithms.mpc_discsp.LUdecomposition
• pivsign : frodo2.algorithms.mpc_discsp.LUdecomposition
• plotDummyStats() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.duct.DUCTsolver< V extends Addable< V > >
• plotStats() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.duct.DUCTsolver< V extends Addable< V > >
• PLUS_INF : frodo2.solutionSpaces.AddableBigDecimal.PlusInfinity, frodo2.solutionSpaces.AddableInteger.PlusInfinity, frodo2.solutionSpaces.AddableReal.PlusInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity
• PLUS_INFINITY : frodo2.solutionSpaces.hypercube.tests.HypercubeTest.Infinity
• plusinf : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• PlusInfinity() : frodo2.solutionSpaces.AddableBigDecimal.PlusInfinity, frodo2.solutionSpaces.AddableInteger.PlusInfinity, frodo2.solutionSpaces.AddableReal.PlusInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity
• pMinus3 : frodo2.solutionSpaces.crypto.ElGamalScheme
• popNextChild() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.BlindScoringHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.NextChildChoiceHeuristic, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >
• PORT : frodo2.controller.Controller
• port : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.communication.tcp.QueueInputPipeTCPTest, frodo2.daemon.Daemon, frodo2.daemon.TestLocalWhitePages.SimpleAgent
• positiveXmatch() : frodo2.benchmarks.kidneys.KidneyExchange
• posLock : frodo2.gui.DOTrenderer
• postponed : frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >
• posXmatchHighPRA : frodo2.benchmarks.kidneys.KidneyExchange
• posXmatchLowPRA : frodo2.benchmarks.kidneys.KidneyExchange
• posXmatchMediumPRA : frodo2.benchmarks.kidneys.KidneyExchange
• powersOf2 : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• pra : frodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair
• precalculated_h : frodo2.algorithms.adopt.test.testPreprocessing
• Predicate() : frodo2.solutionSpaces.JaCoP.Predicate
• predicateParameters : frodo2.solutionSpaces.JaCoP.Predicate
• preferences : frodo2.benchmarks.meetings.MeetingScheduling
• prefix : frodo2.controller.userIO.Console, frodo2.daemon.userIO.Console
• Preprocessing() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >
• preProcessingTester : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >
• Presentation() : frodo2.benchmarks.auctions.xcsp.Presentation
• prettyPrint() : 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.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 > >
• prevAgent : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
• prevCost : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ClusterInfo
• PREVIOUS_MSG_TYPE : frodo2.algorithms.dpop.privacy.SecureCircularRouting
• price : frodo2.benchmarks.auctions.cats.Bid
• printDFS() : frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >
• printMsgStats() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• printOrder() : 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 > >
• printUsage() : frodo2.benchmarks.vehiclerouting.CordeauToXCSP
• privateConstraints : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >
• privateCosts : frodo2.benchmarks.party.PartyGame.PartyInstance
• prob : frodo2.algorithms.test.XCSPparserTest
• PROBABILITY : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.ConstraintType
• probDoc : frodo2.algorithms.test.XCSPparserTest
• probFile : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >
• probLaws : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >
• Problem() : frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >
• problem : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.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.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.count.test.TestCountSolutions, frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >, frodo2.algorithms.dpop.memory.tests.MB_DPOPagentTest, 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.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.restart.UTILreuse, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.test.SamplingPhaseTest, frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, 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.heuristics.AgentNameHeuristic, frodo2.algorithms.heuristics.LeastConnectedHeuristic, frodo2.algorithms.heuristics.MostConnectedHeuristic, frodo2.algorithms.heuristics.RandScoringHeuristic, frodo2.algorithms.heuristics.SmallestDomainHeuristic, frodo2.algorithms.heuristics.VarNameHeuristic, 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.dsa.tests.TestDSA< 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.tests.MPC_DisWCSP4tests, 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.ProblemTest, 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.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >.VarElectionHeuristic, 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 > >.MaxWidthMinDom, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.Queue, frodo2.controller.ConfigurationManager, frodo2.controller.TestController, frodo2.gui.jung.JungVisualizer, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.test.VRPtests, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• problemBrowseBtn : frodo2.gui.SimpleGUI
• problemDoc : frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.duct.tests.DUCTagentTest
• problemEditBtn : frodo2.gui.SimpleGUI
• problemError : frodo2.gui.SimpleGUI
• problemField : frodo2.gui.SimpleGUI
• problemList : frodo2.controller.ConfigurationManager
• ProblemRescaler() : frodo2.algorithms.reformulation.ProblemRescaler< U extends Addable< U > >
• ProblemTest() : frodo2.algorithms.test.ProblemTest
• probOfOptimality : 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 > >
• probSpace : frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >
• probSpaces : frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.test.XCSPparserTest
• processAdditionalMsgInformation() : 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 > >
• processASK() : frodo2.algorithms.odpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• processASKMessage() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• processAssignmentHistories() : frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >
• processCpaMsg() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• processDFSOutput() : 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 > >
• processDONE() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• processFbCpa() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• processFbEstimate() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• processGO() : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• processGOOD() : frodo2.algorithms.odpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• processHeuristicsInfoMessage() : 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 > >
• processIMPROVE() : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• processLinearOrdering() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• processOFFER() : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• processOK() : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• processPending() : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• processPendingMessages() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• processRuns() : frodo2.algorithms.Convergence< V extends Addable< V >, U extends Addable< U > >
• processSample() : frodo2.algorithms.duct.samplingMethods.SamplingB< V extends Addable< V > >, frodo2.algorithms.duct.samplingMethods.SamplingB_Child< V extends Addable< V > >, frodo2.algorithms.duct.samplingMethods.SamplingM< V extends Addable< V > >, frodo2.algorithms.duct.samplingMethods.SamplingM_Child< V extends Addable< V > >, frodo2.algorithms.duct.samplingMethods.SamplingProcedure< V extends Addable< V > >, frodo2.algorithms.duct.samplingMethods.SamplingR< V extends Addable< V > >
• processStoredIMPROVEMessages() : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• processStoredOKMessages() : frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >
• processUTILMessage() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• processVALUEmessageParent() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• processVALUEmessagePseudoParent() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• processVectorMsg() : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
• proj : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >
• project() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, 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.dpop.stochastic.robust.WorstCaseUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• projectAll() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• projectAndSend() : frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >
• projectedVars : frodo2.solutionSpaces.JaCoP.JaCoPiterSearch< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• projExpectMonotone() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• ProjOutput() : frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.ProjOutput< V extends Addable< V >, U extends Addable< U > >
• projOutput : frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo
• PROPOSAL_MSG_TYPE : frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• ProposalMsg() : frodo2.algorithms.varOrdering.linear.ProposalMsg< S extends Comparable< S > &Serializable >
• proposeSamples() : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >
• pseudo_children : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo
• PSEUDO_MSG_TYPE : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >
• PSEUDO_ORDER_MSG_TYPE : frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >
• pseudo_parents : 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
• pseudoChildren : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• PSEUDOmsg() : frodo2.algorithms.varOrdering.dfs.PSEUDOmsg
• pseudoParents : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• publicAgents : 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 > >
• publicKey : frodo2.algorithms.mpc_discsp.EncrSharesMsg, frodo2.algorithms.mpc_discsp.PaillierCryptoScheme
• publicVars : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >
• pushMessage() : frodo2.communication.QueueOutputPipeInterface, frodo2.communication.QueueTest.QueueOutputPipeTrivial, frodo2.communication.sharedMemory.QueueIOPipe, frodo2.communication.tcp.QueueOutputPipeTCP