FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > > Class Template Reference
Inheritance diagram for frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >:
Inheritance graph
[legend]

Public Member Functions

 AddableConflicts ()
 Empty Constructor.
 AddableConflicts (U utility, int conflicts)
 Constructor.
void writeExternal (ObjectOutput out) throws IOException
void readExternal (ObjectInput in) throws IOException, ClassNotFoundException
boolean externalize ()
Object readResolve ()
int compareTo (AddableConflicts< U > o)
U getUtility ()
AddableConflicts< U > min (AddableConflicts< U > other)
AddableConflicts< U > max (AddableConflicts< U > other)
AddableConflicts< U > fromString (String str)
AddableConflicts< U > add (AddableConflicts< U > o)
AddableDelayed< AddableConflicts< U > > addDelayed ()
AddableConflicts< U > subtract (AddableConflicts< U > o)
AddableConflicts< U > multiply (AddableConflicts< U > o)
AddableConflicts< U > getZero ()
AddableConflicts< U > getPlusInfinity ()
AddableConflicts< U > getMinInfinity ()
AddableConflicts< U > abs ()
AddableConflicts< U > divide (AddableConflicts< U > o)
AddableConflicts< U > flipSign ()
Addable< AddableConflicts< U > >[] range (AddableConflicts< U > begin, AddableConflicts< U > end)
String toString ()
int intValue ()
double doubleValue ()
AddableConflicts< U > fromInt (int nbr)
Public Member Functions inherited from frodo2.solutionSpaces.Addable< AddableConflicts< U > >
int intValue ()
double doubleValue ()
T fromString (String str)
 Parses a string to construct a new instance.
T fromInt (int nbr)
 Creates an instance from an int.
T add (T o)
 Adds an object to this object.
AddableDelayed< T > addDelayed ()
 Creates an object with the same value as this object, used to delay the resolution of a large number of additions.
T subtract (T o)
 Subtracts an object from this object.
T multiply (T o)
 Multiplies an object with this object.
boolean equals (Object o)
 The equals function must be implemented so that the hashmap storing the steps for each value can find the proper step for the provided value.
int hashCode ()
 The hashCode function must be implemented so that the hashmap storing the steps for each value can find the proper step for the provided value.
T getZero ()
 Returns a neutral object for the addition operation ("zero").
T getPlusInfinity ()
 Returns the "+infinity" object.
T getMinInfinity ()
 Returns the "-infinity" object.
T abs ()
T divide (T o)
T flipSign ()
 Flip the sign of this number.
Addable< T >[] range (T begin, T end)
 Returns an array containing all the values between begin and end.

Private Attributes

U utility
 Utility value.
int conflicts
 if utility is infeasible, the number of conflicts, i.e.

Static Private Attributes

static final long serialVersionUID = 9214213454805720095L
 Used for serialization.

Detailed Description

Author
Brammert Ottens, 13 apr. 2011
Parameters
<U>type used for utility values

Constructor & Destructor Documentation

◆ AddableConflicts() [1/2]

frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.AddableConflicts ( )

Empty Constructor.

Referenced by abs(), add(), compareTo(), divide(), flipSign(), fromInt(), fromString(), getMinInfinity(), getPlusInfinity(), getZero(), max(), min(), multiply(), range(), and subtract().

◆ AddableConflicts() [2/2]

frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.AddableConflicts ( U utility,
int conflicts )

Constructor.

Parameters
utilitythe utility value
conflictsthe number of conflicts

References conflicts, and utility.

Member Function Documentation

◆ abs()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.abs ( )
See also
frodo2.solutionSpaces.Addable.abs()

References AddableConflicts().

Here is the call graph for this function:

◆ add()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.add ( AddableConflicts< U > o)
See also
frodo2.solutionSpaces.Addable.add(frodo2.solutionSpaces.Addable)

References AddableConflicts(), conflicts, and utility.

Referenced by frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.storeOffer().

Here is the call graph for this function:

◆ addDelayed()

AddableDelayed< AddableConflicts< U > > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.addDelayed ( )
See also
frodo2.solutionSpaces.Addable.addDelayed()

◆ compareTo()

int frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.compareTo ( AddableConflicts< U > o)
See also
java.lang.Comparable#compareTo(java.lang.Object)

References AddableConflicts(), conflicts, and utility.

Referenced by frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >.bestAssignment(), frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateOffer(), max(), min(), and frodo2.algorithms.localSearch.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.processIMPROVE().

Here is the call graph for this function:

◆ divide()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.divide ( AddableConflicts< U > o)
See also
frodo2.solutionSpaces.Addable.divide(frodo2.solutionSpaces.Addable)

References AddableConflicts(), and utility.

Here is the call graph for this function:

◆ doubleValue()

double frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.doubleValue ( )
See also
frodo2.solutionSpaces.Addable.doubleValue()
Todo
Auto-generated method stub

◆ externalize()

boolean frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.externalize ( )
See also
frodo2.solutionSpaces.AddableLimited.externalize()

◆ flipSign()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.flipSign ( )
See also
frodo2.solutionSpaces.Addable.flipSign()

References AddableConflicts().

Here is the call graph for this function:

◆ fromInt()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.fromInt ( int nbr)
See also
Addable.fromInt(int)
Todo
Auto-generated method stub

References AddableConflicts().

Here is the call graph for this function:

◆ fromString()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.fromString ( String str)
See also
frodo2.solutionSpaces.Addable.fromString(java.lang.String)

References AddableConflicts().

Here is the call graph for this function:

◆ getMinInfinity()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.getMinInfinity ( )
See also
frodo2.solutionSpaces.Addable.getMinInfinity()

References AddableConflicts().

Here is the call graph for this function:

◆ getPlusInfinity()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.getPlusInfinity ( )
See also
frodo2.solutionSpaces.Addable.getPlusInfinity()

References AddableConflicts().

Here is the call graph for this function:

◆ getUtility()

U frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.getUtility ( )
Author
Brammert Ottens, 26 mei 2010
Returns
the utility value

References utility.

Referenced by frodo2.algorithms.localSearch.dsa.DSA< Val extends Addable< Val >, U extends Addable< U > >.VariableInfo< Val extends Addable< Val >, U extends Addable< U > >.bestAssignment(), 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.mgm.MGM< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateUtility(), and frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.storeOffer().

◆ getZero()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.getZero ( )
See also
frodo2.solutionSpaces.Addable.getZero()

References AddableConflicts().

Here is the call graph for this function:

◆ intValue()

int frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.intValue ( )
See also
frodo2.solutionSpaces.Addable.intValue()
Todo
Auto-generated method stub

◆ max()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.max ( AddableConflicts< U > other)
See also
frodo2.solutionSpaces.AddableLimited.max(frodo2.solutionSpaces.AddableLimited)

References AddableConflicts(), and compareTo().

Here is the call graph for this function:

◆ min()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.min ( AddableConflicts< U > other)
See also
frodo2.solutionSpaces.AddableLimited.min(frodo2.solutionSpaces.AddableLimited)

References AddableConflicts(), and compareTo().

Here is the call graph for this function:

◆ multiply()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.multiply ( AddableConflicts< U > o)
See also
frodo2.solutionSpaces.Addable.multiply(frodo2.solutionSpaces.Addable)

References AddableConflicts(), conflicts, and utility.

Here is the call graph for this function:

◆ range()

Addable< AddableConflicts< U > >[] frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.range ( AddableConflicts< U > begin,
AddableConflicts< U > end )
See also
frodo2.solutionSpaces.Addable.range(frodo2.solutionSpaces.Addable, frodo2.solutionSpaces.Addable)

References AddableConflicts().

Here is the call graph for this function:

◆ readExternal()

void frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.readExternal ( ObjectInput in) throws IOException, ClassNotFoundException
See also
java.io.Externalizable#readExternal(java.io.ObjectInput)

References readExternal().

Referenced by readExternal().

Here is the call graph for this function:

◆ readResolve()

Object frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.readResolve ( )
See also
frodo2.solutionSpaces.AddableLimited.readResolve()

◆ subtract()

AddableConflicts< U > frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.subtract ( AddableConflicts< U > o)
See also
frodo2.solutionSpaces.Addable.subtract(frodo2.solutionSpaces.Addable)

References AddableConflicts(), conflicts, and utility.

Referenced by frodo2.algorithms.localSearch.mgm.mgm2.MGM2< V extends Addable< V >, U extends Addable< U > >.VariableInfo< V extends Addable< V >, U extends Addable< U > >.calculateGain().

Here is the call graph for this function:

◆ toString()

String frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.toString ( )
See also
java.lang.Object#toString()

◆ writeExternal()

void frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.writeExternal ( ObjectOutput out) throws IOException
See also
java.io.Externalizable#writeExternal(java.io.ObjectOutput)

References conflicts, and utility.

Member Data Documentation

◆ conflicts

int frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.conflicts
private

if utility is infeasible, the number of conflicts, i.e.

constraints violated

Referenced by add(), AddableConflicts(), compareTo(), multiply(), subtract(), and writeExternal().

◆ serialVersionUID

final long frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.serialVersionUID = 9214213454805720095L
staticprivate

Used for serialization.

◆ utility

U frodo2.solutionSpaces.AddableConflicts< U extends Addable< U > >.utility
private

Utility value.

Referenced by add(), AddableConflicts(), compareTo(), divide(), getUtility(), multiply(), subtract(), and writeExternal().

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