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

- a -

• A() : frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.A< Val extends Addable< Val >, U extends Addable< U > >
• ABOcompatible() : frodo2.benchmarks.kidneys.KidneyExchange
• abs() : 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
• AbstractDCOPsolver() : frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• AbstractProblem() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >
• AbstractSolver() : frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >
• AbsXeqYCloneable() : org.jacop.constraints.AbsXeqYCloneable
• ACCEPT() : frodo2.algorithms.localSearch.mgm.mgm2.ACCEPT< Val extends Addable< Val >, U extends Addable< U > >
• ACKmsg() : frodo2.algorithms.asodpop.ACKmsg
• actionPerformed() : frodo2.gui.DOTrenderer, frodo2.gui.jung.JungVisualizer, frodo2.gui.SimpleGUI, frodo2.gui.VisualizerControls
• add() : 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.dpop.privacy.test.FakeCryptoScheme.FakeEncryptedInteger, frodo2.algorithms.mpc_discsp.PaillierInteger, 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.InnerNodeTreeBinaryDomains.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.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.AddableLimited< A extends Addable< A >, M extends AddableLimited< A, M >, 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, frodo2.solutionSpaces.crypto.ElGamalBigInteger, frodo2.solutionSpaces.crypto.ElGamalSchemeTest
• AddableBigDecimal() : frodo2.solutionSpaces.AddableBigDecimal
• AddableBigDecimalDelayed() : frodo2.solutionSpaces.AddableBigDecimal.AddableBigDecimalDelayed
• AddableBigInteger() : frodo2.solutionSpaces.crypto.AddableBigInteger
• AddableBigIntegerDelayed() : frodo2.solutionSpaces.crypto.AddableBigInteger.AddableBigIntegerDelayed
• AddableConflicts() : frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >
• AddableInteger() : frodo2.solutionSpaces.AddableInteger
• AddableIntegerDelayed() : frodo2.solutionSpaces.AddableInteger.AddableIntegerDelayed
• AddableReal() : frodo2.solutionSpaces.AddableReal
• AddableRealDelayed() : frodo2.solutionSpaces.AddableReal.AddableRealDelayed
• addAgent() : frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >, frodo2.controller.Controller, frodo2.daemon.Daemon, frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
• addBid() : frodo2.benchmarks.auctions.cats.Auction, frodo2.benchmarks.auctions.cats.Bidder, frodo2.benchmarks.auctions.cats.Good, frodo2.benchmarks.auctions.main.CATSToXCSP
• addBidder() : frodo2.benchmarks.auctions.cats.Auction
• addCellEditorListener() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• addChild() : frodo2.algorithms.odpop.goodsTree.leafNodeTree.Node, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• addConstraint() : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >
• addControlPanel() : frodo2.gui.VisualizerControls
• addDecompConstraint() : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• addDecryptRequest() : frodo2.algorithms.dpop.privacy.CollaborativeDecryption< C extends Addable< C >, E extends AddableLimited< C, E, K extends PublicKeyShare >
• addDelay() : frodo2.communication.MessageWrapper
• addDelayed() : frodo2.solutionSpaces.Addable< T extends Addable< T > >, frodo2.solutionSpaces.AddableBigDecimal.AddableBigDecimalDelayed, frodo2.solutionSpaces.AddableBigDecimal, frodo2.solutionSpaces.AddableBigDecimal.MinInfinity, frodo2.solutionSpaces.AddableBigDecimal.PlusInfinity, frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >, frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >, frodo2.solutionSpaces.AddableInteger.AddableIntegerDelayed, frodo2.solutionSpaces.AddableInteger, frodo2.solutionSpaces.AddableInteger.MinInfinity, frodo2.solutionSpaces.AddableInteger.PlusInfinity, frodo2.solutionSpaces.AddableReal.AddableRealDelayed, frodo2.solutionSpaces.AddableReal, frodo2.solutionSpaces.AddableReal.MinInfinity, frodo2.solutionSpaces.AddableReal.PlusInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.AddableBigIntegerDelayed, frodo2.solutionSpaces.crypto.AddableBigInteger, frodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity
• addDisconnected() : frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >
• addEqualityConstraintsOnBids() : frodo2.benchmarks.auctions.xcsp.Constraints
• addEqualityConstraintsOnGoods() : frodo2.benchmarks.auctions.xcsp.Constraints
• addFlags() : frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo
• addFunction() : frodo2.algorithms.varOrdering.factorgraph.VariableNode< V extends Addable< V >, U extends Addable< U > >
• addIncomingMessagePolicy() : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue, frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• addIncomingMessagePolicyForReal() : frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >.FakeQueue
• addMessage() : frodo2.communication.QueueTest.QueueInputPipeTrivial
• addNewDomainElement() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• addNewDomainElementNoUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• addNewDomainElementWithUB() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• addNewVariable() : frodo2.algorithms.asodpop.goodsTree.innerNodeTree.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 > >
• addOutgoingMessagePolicy() : frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• addOutputPipe() : frodo2.algorithms.AgentInterface< V extends Addable< V > >, frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >, frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue, frodo2.controller.Controller, frodo2.daemon.Daemon, frodo2.daemon.TestLocalWhitePages.SimpleAgent
• addOutputQueue() : frodo2.communication.Queue
• addProbabilitySpace() : frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >
• addPseudoChild() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• addPseudoParent() : frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.DFSview< V extends Addable< V >, U extends Addable< U > >
• addPublicKeyShare() : frodo2.algorithms.dpop.privacy.test.FakeCryptoScheme, frodo2.solutionSpaces.crypto.CryptoScheme< C extends Serializable, E extends Serializable, K extends CryptoScheme.PublicKeyShare >, frodo2.solutionSpaces.crypto.ElGamalScheme
• addRandomOwners() : frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >
• addRandomVar() : frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >
• addReverseMap() : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• addRootNeighbor() : frodo2.algorithms.dpop.restart.test.TestSDPOP< V extends Addable< V >, U extends Addable< U > >
• addSoftConstraint() : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >
• addSoftDecompConstraint() : frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >
• addSolutionSpace() : 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 > >
• addSpaceToIgnore() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• addTests() : frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >
• addToInbox() : frodo2.communication.mailer.CentralMailer.FakeQueue, frodo2.communication.Queue
• addToTree() : frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
• addUnarySpace() : 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 > >
• addValues() : 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
• addVariable() : frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.FunctionInfo, 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 > >
• addVariableToTree() : 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 > >
• ADOPT() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >
• ADOPTagentTest() : frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >
• ADOPTsolver() : frodo2.algorithms.adopt.ADOPTsolver< V extends Addable< V >, U extends Addable< U > >
• AFB() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• AFBagentTest() : frodo2.algorithms.afb.test.AFBagentTest< V extends Addable< V >, U extends Addable< U > >
• AFBBaseMsg() : frodo2.algorithms.afb.AFBBaseMsg< V extends Addable< V >, U extends Addable< U > >
• AFBsolver() : frodo2.algorithms.afb.AFBsolver< V extends Addable< V >, U extends Addable< U > >
• AgentFactory() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• AgentNameHeuristic() : frodo2.algorithms.heuristics.AgentNameHeuristic
• agentReportGlobal() : frodo2.daemon.TestLocalWhitePages.SimpleAgent
• agentReportLocal() : frodo2.daemon.TestLocalWhitePages.SimpleAgent
• AlldiffCloneable() : org.jacop.constraints.AlldiffCloneable
• AlldifferentCloneable() : org.jacop.constraints.AlldifferentCloneable
• AlldistinctCloneable() : org.jacop.constraints.AlldistinctCloneable
• AllEqualCloneable() : org.jacop.constraints.AllEqualCloneable
• altAssignmentsToString() : frodo2.benchmarks.auctions.xcsp.Relation
• AmongCloneable() : org.jacop.constraints.AmongCloneable
• AmongVarCloneable() : org.jacop.constraints.AmongVarCloneable
• AndBoolCloneable() : org.jacop.constraints.AndBoolCloneable
• AndBoolSimpleCloneable() : org.jacop.constraints.AndBoolSimpleCloneable
• AndBoolVectorCloneable() : org.jacop.constraints.AndBoolVectorCloneable
• AndCloneable() : org.jacop.constraints.AndCloneable
• applyAugment() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• applyChangeVariablesOrder() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• applyJoin() : frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >
• applyProject() : frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >
• applySlice() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• arcConsistency() : frodo2.benchmarks.kidneys.KidneyExchange
• ArgMaxCloneable() : org.jacop.constraints.ArgMaxCloneable
• ArgMinCloneable() : org.jacop.constraints.ArgMinCloneable
• arguments() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube, frodo2.solutionSpaces.JaCoP.Predicate, org.jacop.constraints.AndBoolCloneable, org.jacop.constraints.AssignmentCloneable, org.jacop.constraints.DecomposedConstraintCloneableInterface, org.jacop.constraints.diffn.DiffnDecomposedCloneable, org.jacop.constraints.LexCloneable, org.jacop.constraints.netflow.ArithmeticCloneable, org.jacop.constraints.OrBoolCloneable, org.jacop.constraints.SequenceCloneable, org.jacop.constraints.SoftAlldifferentCloneable, org.jacop.constraints.SoftGCCCloneable, org.jacop.constraints.StretchCloneable
• ArithmeticBuilderCloneable() : org.jacop.constraints.netflow.ArithmeticCloneable.ArithmeticBuilderCloneable
• ArithmeticCloneable() : org.jacop.constraints.netflow.ArithmeticCloneable
• arrayToString() : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• askAddress() : frodo2.daemon.TestLocalWhitePages.SimpleAgent
• askDecrypt() : frodo2.algorithms.dpop.privacy.EncryptedUTIL< V extends Addable< V >, U extends Addable< U >, E extends AddableLimited< U, E >
• ASKmsg() : frodo2.algorithms.odpop.ASKmsg
• askUserYesNo() : frodo2.controller.userIO.Console, frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >, frodo2.controller.userIO.UserIO
• ASODPOP() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >
• ASODPOPagentTest() : frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >
• ASODPOPBinaryAgentTest() : frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >
• ASODPOPBinaryDomains() : frodo2.algorithms.asodpop.ASODPOPBinaryDomains< Val extends Addable< Val >, U extends Addable< U > >
• ASODPOPBinarysolver() : frodo2.algorithms.asodpop.ASODPOPBinarysolver< V extends Addable< V >, U extends Addable< U > >
• ASODPOPBinaryTest() : frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >
• ASODPOPsolution() : frodo2.algorithms.asodpop.ASODPOPsolution< V extends Addable< V >, U >
• ASODPOPsolver() : frodo2.algorithms.asodpop.ASODPOPsolver< V extends Addable< V >, U extends Addable< U > >
• ASODPOPTest() : frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >
• assertWarning() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• assign_CPA() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >
• Assignment() : frodo2.algorithms.odpop.Assignment< Val extends Addable< Val > >, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >.Assignment< Val extends Addable< Val >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >.Assignment< U extends Addable< U > >
• AssignmentCloneable() : org.jacop.constraints.AssignmentCloneable
• AssignmentMessage() : frodo2.algorithms.asodpop.ASODPOP< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.dpop.param.ParamVALUE< Val extends Addable< Val > >.AssignmentMessage< Val extends Addable< Val > >, frodo2.algorithms.odpop.VALUEpropagation< Val extends Addable< Val >, U extends Addable< U > >.AssignmentMessage< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentMessage< V extends Addable< V > >
• AssignmentsMessage() : frodo2.algorithms.SolutionCollector< V extends Addable< V >, U extends Addable< U > >.AssignmentsMessage< V >
• AtLCAs() : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >
• AtLeastCloneable() : org.jacop.constraints.AtLeastCloneable
• AtLeaves() : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >
• AtMostCloneable() : org.jacop.constraints.AtMostCloneable
• AtRoots() : frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >
• Auction() : frodo2.benchmarks.auctions.cats.Auction
• augment() : 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.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >
• auxiliaryVariables() : frodo2.solutionSpaces.JaCoP.Predicate