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

- i -

• id() : frodo2.solutionSpaces.JaCoP.Predicate, org.jacop.constraints.AndBoolCloneable, org.jacop.constraints.DecomposedConstraintCloneableInterface, org.jacop.constraints.diffn.DiffnDecomposedCloneable, org.jacop.constraints.LexCloneable, org.jacop.constraints.netflow.ArithmeticCloneable, org.jacop.constraints.netflow.NetworkFlowCloneable, org.jacop.constraints.OrBoolCloneable, org.jacop.constraints.SequenceCloneable, org.jacop.constraints.SoftAlldifferentCloneable, org.jacop.constraints.SoftGCCCloneable, org.jacop.constraints.StretchCloneable
• identity() : frodo2.algorithms.mpc_discsp.Matrix
• IdIncreasingVerifyer() : frodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest.IdIncreasingVerifyer
• IfThenBoolCloneable() : org.jacop.constraints.IfThenBoolCloneable
• IfThenCloneable() : org.jacop.constraints.IfThenCloneable
• IfThenElseCloneable() : org.jacop.constraints.IfThenElseCloneable
• ignore() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• ignoreGood() : 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 > >
• ImpliesCloneable() : org.jacop.constraints.ImpliesCloneable
• implode() : frodo2.benchmarks.kidneys.KidneyExchange
• impose() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube, org.jacop.constraints.AmongVarCloneable
• imposeConstraints() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• imposeDecomposition() : frodo2.solutionSpaces.JaCoP.Predicate
• imposeGlobalConstraint() : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• imposePredicate() : frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >
• IMPROVE() : frodo2.algorithms.localSearch.mgm.IMPROVE< U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.IMPROVE< U extends Addable< U > >
• InAreaCloneable() : org.jacop.constraints.geost.InAreaCloneable
• InCloneable() : org.jacop.constraints.InCloneable
• increaseFileID() : frodo2.gui.DOTrenderer
• increaseWeight() : frodo2.solutionSpaces.JaCoP.ExtensionalSupportHypercube
• IncreasingCloneable() : org.jacop.constraints.IncreasingCloneable
• incrNCCCs() : frodo2.algorithms.MASparser< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >, frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >
• indexToAssignment() : frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >
• infinity() : frodo2.solutionSpaces.crypto.ElGamalSchemeTest
• init() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Version< Val extends Addable< Val >, U extends Serializable &Addable< U > >, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.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 > >, 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 > >, 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.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.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.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.SecureCircularRouting, 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.dpop.restart.UTILreuse, 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 > >.AtLCAs< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLeaves< V extends Addable< V >, U extends Addable< U > >, 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.dpop.VALUEpropagation< Val extends Addable< Val > >, frodo2.algorithms.duct.Normalize< V extends Addable< V > >, frodo2.algorithms.duct.Sampling< V extends Addable< V > >, frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >, frodo2.algorithms.mpc_discsp.MPC_DisWCSP4< V extends Addable< V > >, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >, frodo2.algorithms.odpop.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.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable< U > >.ScoreBroadcastingHeuristic< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.DFSgenerationParallel< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.dfs.LocalRandVarsDFS< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.election.VariableElection< S extends Comparable< S > &Serializable >, frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >, frodo2.communication.Queue, frodo2.communication.tcp.QueueOutputPipeTCP, frodo2.controller.Controller, frodo2.daemon.Daemon, frodo2.gui.jung.JungVisualizer, frodo2.solutionSpaces.crypto.ElGamalSchemeTest, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >
• initializeBounds() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• initializeUpperBoundSums() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >
• initialMin1() : frodo2.algorithms.dpop.privacy.DecryptRequest< C extends Addable< C >, E extends AddableLimited< C, E >
• initialMin2() : frodo2.algorithms.dpop.privacy.DecryptRequest< C extends Addable< C >, E extends AddableLimited< C, E >
• initiate() : frodo2.algorithms.afb.AFB< V extends Addable< V >, U extends Addable< U > >, frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >
• initiateAllMaps() : frodo2.algorithms.dpop.privacy.VariableObfuscation< V extends Addable< V >, U extends Addable< U > >
• initiateBounds() : 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 > >
• initiateParamAndListener() : frodo2.algorithms.varOrdering.election.tests.SecureVarElectionTest, frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >
• initiatingIDandListener() : frodo2.algorithms.varOrdering.election.tests.LeaderElectionMaxIDTest< S extends Comparable< S > >, frodo2.algorithms.varOrdering.election.tests.VarElectionMessengerTest
• initLocal() : frodo2.controller.Controller
• initSampling() : frodo2.algorithms.duct.SearchNode< V extends Addable< V > >
• initSearch() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter2< V extends Addable< V > >
• initStore() : frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >
• InnerNode() : frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeBinaryDomains.InnerNode< U extends Addable< U >, L extends LeafNode< U > >, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode< U extends Addable< U >, L extends LeafNode< U > >
• InnerNodeTree() : 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 > >, 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 > >
• inputPipe() : frodo2.communication.PipeFactory, frodo2.communication.tcp.TCPPipeFactory
• Instance() : frodo2.benchmarks.auctions.xcsp.Instance
• instantiateAgent() : frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable< U > >
• intArrayToByteArray() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.IntArrayWrapper
• IntArrayWrapper() : 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
• intersection() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.tests.HypercubeTest
• IntIntStringTuple() : frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.IntIntStringTuple
• intValue() : 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.AddableReal, frodo2.solutionSpaces.crypto.AddableBigInteger, frodo2.solutionSpaces.crypto.AddableBigInteger.MinInfinity, frodo2.solutionSpaces.crypto.AddableBigInteger.PlusInfinity
• IntVarCloneable() : org.jacop.core.IntVarCloneable
• inverse() : frodo2.algorithms.mpc_discsp.Matrix
• isAlive() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >
• isCellEditable() : frodo2.gui.VisualizerControls.MsgTypeRenderer
• isConfirmed() : frodo2.algorithms.asodpop.Good< Val extends Addable< Val >, U extends Addable< U > >, frodo2.algorithms.asodpop.VALUEmsgChild< Val extends Addable< Val > >
• isCountingNCCCs() : frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >
• isFake() : frodo2.benchmarks.auctions.cats.Bidder
• isFinished() : frodo2.controller.TestController.DaemonExtension
• isHeuristicReady() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP0< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP1< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP2< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, 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 > >
• isIncludedIn() : 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 > >, 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.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 > >
• isInfinite() : frodo2.solutionSpaces.AddableBigDecimal.AddableBigDecimalDelayed, frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >, frodo2.solutionSpaces.AddableInteger.AddableIntegerDelayed, frodo2.solutionSpaces.AddableReal.AddableRealDelayed, frodo2.solutionSpaces.crypto.AddableBigInteger.AddableBigIntegerDelayed
• isInfoReady() : frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP0< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP1< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, frodo2.algorithms.adopt.Preprocessing< Val extends Addable< Val >, U extends Addable< U > >.DP2< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo, 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 > >
• isNull() : frodo2.solutionSpaces.hypercube.BasicHypercube< V extends Addable< V >, U extends Serializable >
• isParent() : frodo2.communication.MessageType
• isPositive() : frodo2.solutionSpaces.crypto.AddableBigInteger
• isPowerOf2() : frodo2.solutionSpaces.crypto.ElGamalScheme
• isRandom() : 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 > >
• isReady() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• isRelevant() : frodo2.algorithms.asodpop.UTILmsg< Val extends Addable< Val >, U extends Addable< U > >
• isRoot() : frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable< U > >
• isSingleton() : frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >
• isUpToDate() : frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode< U extends Addable< U > >
• isValuationSufficient() : 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 > >
• itemStateChanged() : frodo2.gui.SimpleGUI
• iter() : frodo2.solutionSpaces.hypercube.BasicHypercubeIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarBasicSpaceIter< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIter< U extends Addable< U > >, frodo2.solutionSpaces.JaCoP.JaCoPutilSpaceIterBestFirst< V extends Addable< V > >, frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator, frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.VRPiteratorBestFirst
• iterateSumVars() : frodo2.solutionSpaces.vehiclerouting.CompoundSpace< U extends Addable< U > >.BestFirstIterator
• iterator() : 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 > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.NullHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarBasicHypercube< V extends Addable< V >, U extends Serializable >, frodo2.solutionSpaces.hypercube.ScalarHypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ScalarHypercubeLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, frodo2.solutionSpaces.JaCoP.JaCoPoptAssignments, frodo2.solutionSpaces.JaCoP.JaCoPutilSpace< V extends Addable< V > >, frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >, frodo2.solutionSpaces.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 > >
• iteratorBestFirst() : frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >, frodo2.solutionSpaces.hypercube.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 > >
• IterSolutionListener() : frodo2.solutionSpaces.JaCoP.IterSolutionListener< V extends Addable< V > >