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

- r -

• radius : frodo2.benchmarks.vehiclerouting.CordeauToXCSP.Customer, frodo2.solutionSpaces.vehiclerouting.Customer, frodo2.solutionSpaces.vehiclerouting.test.VRPtests
• rand : 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.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >, frodo2.algorithms.dpop.privacy.test.FakeCryptoSchemeTest, frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >, frodo2.algorithms.mpc_discsp.PaillierCryptoScheme, frodo2.algorithms.mpc_discsp.PaillierPublicKey, frodo2.algorithms.varOrdering.election.VarElectionMessenger, frodo2.solutionSpaces.crypto.ElGamalScheme, frodo2.solutionSpaces.crypto.ElGamalSchemeTest
• RAND_VARS_MSG_TYPE : frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >
• RAND_VARS_PROJ_MSG_TYPE : 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 > >
• randAssignment : frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter
• randDoms : frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter
• randNeighborhoods : frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >
• random : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• RANDOM_MSG_TYPE : frodo2.communication.mailer.tests.testCentralMailer
• randomInit : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable< U > >
• randomize : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.MultiPhase
• randVars : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.CHILDrandMsg, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >
• randVarsProj : 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 > >
• randVarsToIgnore : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >
• randVarsToProject : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >
• rawDataHandler_lock : frodo2.communication.MessageWithRawData
• rawDataID : frodo2.communication.tcp.QueueOutputPipeTCP, frodo2.communication.tcp.RawDataHandlerTCP
• rawDataID_lock : frodo2.communication.tcp.QueueOutputPipeTCP
• rawDataInfos : frodo2.communication.tcp.QueueOutputPipeTCP
• rawDataInfos_lock : frodo2.communication.tcp.QueueOutputPipeTCP
• rawDataIP : frodo2.communication.tcp.QueueOutputPipeTCP, frodo2.communication.tcp.RawDataHandlerTCP
• rawDataPort : frodo2.communication.tcp.QueueOutputPipeTCP, frodo2.communication.tcp.RawDataHandlerTCP
• rawDataServer : frodo2.communication.tcp.QueueOutputPipeTCP
• ready : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• real : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTree.LeafNode< U extends Addable< U > >
• received : frodo2.controller.TestConfigurationManager.SimpleDaemonListener, frodo2.daemon.TestLocalWhitePages.SimpleAgent
• receivedASK : frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• receivedCN : frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >
• receivedDom : frodo2.algorithms.dpop.privacy.test.VariableObfuscationTest< V extends Addable< V > >
• receivedID : frodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest.IdIncreasingVerifyer
• receivedNormalize : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• receivedUtilKey : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• receiver : frodo2.algorithms.adopt.COSTmsg< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ENDmsg< Val extends Addable< Val > >, frodo2.algorithms.adopt.VALUEmsg< Val extends Addable< Val >, U extends Addable< U > >
• reductor : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >
• reference : frodo2.benchmarks.auctions.xcsp.Constraint
• REJECT_MSG_TYPE : frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >
• relationName : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• relations : frodo2.benchmarks.auctions.xcsp.Relations, frodo2.benchmarks.kidneys.KidneyExchange.PatientDonorPair
• relationships : frodo2.algorithms.dpop.stochastic.CompleteUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >
• relationSpouse : frodo2.benchmarks.kidneys.KidneyExchange
• RELEASE_OUTPUT_MSG_TYPE : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
• remainingOutput : frodo2.algorithms.dpop.privacy.test.SecureRerootingTest
• remainingOutputs : frodo2.algorithms.dpop.stochastic.test.LowestCommonAncestorsTest, 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
• remainingVars : frodo2.algorithms.dpop.count.CountSolutionsVALUE< 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 > >
• REPORT_MSG_TYPE : frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >
• reportedBound : frodo2.algorithms.duct.SamplingChild< V extends Addable< V > >.VariableInfo, frodo2.algorithms.duct.SamplingChildSearch< V extends Addable< V > >.VariableInfo
• reportedHeuristics : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >
• reportedNeighbours : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >
• reportedSample : frodo2.algorithms.duct.Sampling< V extends Addable< V > >.VariableInfo
• reportedUtil : frodo2.algorithms.Solution< V, U >
• reportedValues : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >
• reportedVariables : frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >
• reportSpaces : frodo2.algorithms.duct.Normalize< V extends Addable< V > >
• reportStats : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.count.CountSolutionsUTIL< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.count.CountSolutionsVALUE< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.memory.LabelingPhase< V extends Addable< V > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >, frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >, frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.SecureCircularRouting, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.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.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 > >
• REQUEST_DAEMONS_CONFIG_MSG : frodo2.controller.ConfigurationManager
• REQUEST_MSG_TYPE : frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >
• REQUEST_TYPE : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• requestCount : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• REROOTING_REQUEST_TYPE : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
• rerootRequester : frodo2.algorithms.dpop.privacy.P2_DPOPsolver< V extends Addable< V >, U extends Addable< U > >
• reservePrice : frodo2.benchmarks.auctions.cats.Good
• resources : org.jacop.constraints.cumulative.CumulativeBasicCloneable, org.jacop.constraints.cumulative.CumulativeCloneable, org.jacop.constraints.cumulative.CumulativeOptionalCloneable, org.jacop.constraints.cumulative.CumulativePrimaryCloneable, org.jacop.constraints.cumulative.CumulativeUnaryCloneable, org.jacop.constraints.cumulative.CumulativeUnaryOptionalCloneable
• responded : frodo2.algorithms.odpop.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo
• RESPONSE : frodo2.controller.testFiles.TestAgent< V extends Addable< V > >
• resultFile : frodo2.controller.ConfigurationManager
• REUSE_MSG_TYPE : frodo2.algorithms.dpop.restart.UTILreuse
• reveal : frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.MultiPhase
• reversetable : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo
• rnd : frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >
• ROBUST : frodo2.algorithms.dpop.stochastic.ExpectedUTIL< Val extends Addable< Val >, U extends Addable< U > >.Method
• ROOT : frodo2.communication.MessageType
• root : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >.VariableInfo, frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.VariableInfo, frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< 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.UTILpropagationFullDomain< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.VariableInfo, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.gui.VisualizerControls
• ROOT_TYPE : frodo2.communication.MessageType
• ROOT_VAR_MSG_TYPE : 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 > >
• rootElectionHeuristic : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationParallelTest
• rootElectionScores : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >
• rootElement : frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >
• ROOTS : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.WhereToProject
• roots : frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >, frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.privacy.test.SecureRerootingTest
• rounds : frodo2.algorithms.dpop.privacy.test.SecureRerootingTest