FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > > Interface Template Reference
Inheritance diagram for frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >:

Public Member Functions

void addDelayed (T a)
 Add an object of type T to this class.
void multiplyDelayed (T a)
 Multiply an object of type T with this class.
T resolve ()
 Create the object of type T.
boolean isInfinite ()

Detailed Description

Author
Brammert Ottens, 30 mrt 2010

Class used to delay the creation of an object of type T when a large number of additions must be performed

Parameters
<T>the type of the Addable

Member Function Documentation

◆ addDelayed()

void frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.addDelayed ( T a)

Add an object of type T to this class.

Author
Brammert Ottens, 30 mrt 2010
Parameters
aan object of type T

Referenced by frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateCurrentUtility(), frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateCurrentUtility(), frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateCurrentUtility(), frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >.calculateUtility(), frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateUtility(), frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >.computeLB(), frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >.computeUB(), frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter.getCurrentUtility(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.getCurrentUtility(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.getCurrentUtility(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.getUtility(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.initializeUpperBoundSums(), frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > >.maintainAllocationInvariant(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.nextUtilBlind(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.nextUtility(), frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.notifyIn(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.projExpectMonotone(), frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.resolve(), and frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.scaledRandSpace().

◆ isInfinite()

◆ multiplyDelayed()

◆ resolve()

T frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.resolve ( )

Create the object of type T.

Author
Brammert Ottens, 30 mrt 2010
Returns
an object of type T

Implemented in frodo2.solutionSpaces.crypto.AddableBigInteger.AddableBigIntegerDelayed.

Referenced by frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateCurrentUtility(), frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateCurrentUtility(), frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateCurrentUtility(), frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >.calculateUtility(), frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateUtility(), frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >.computeLB(), frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Serializable &Addable< U > >.computeUB(), frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf(), frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.MyIter.getCurrentUtility(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.getCurrentUtility(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.getCurrentUtility(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.getUtility(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.initializeUpperBoundSums(), frodo2.algorithms.adopt.ADOPT< Val extends Addable< Val >, U extends Addable< U > >.Original< Val extends Addable< Val >, U extends Addable< U > >.maintainAllocationInvariant(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.nextUtilBlind(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.JoinOutputIterator< V extends Addable< V >, U extends Addable< U > >.nextUtility(), frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.notifyIn(), frodo2.solutionSpaces.hypercube.JoinOutputHypercube< V extends Addable< V >, U extends Addable< U > >.projExpectMonotone(), and frodo2.solutionSpaces.hypercube.ExpectationOutput< V extends Addable< V >, U extends Addable< U > >.resolve().


The documentation for this interface was generated from the following file: