FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > > Class Template Reference

The output of a blindProject() that computes itself on the fly. More...

Inheritance diagram for frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >:

Classes

class  MyIter
 This class' special iterator. More...

Public Member Functions

 BlindProjectOutput ()
 Empty constructor used for externalization.
 BlindProjectOutput (UtilitySolutionSpace< V, U > space, String[] varsOut, boolean maximize, U infeasibleUtil)
 Constructor.
String toString ()
BlindProjectOutput< V, U > clone ()
String prettyPrint (U ignoredUtil)
getUtility (V[] variables_values)
getUtility (String[] variables_names, V[] variables_values)
getUtility (Map< String, V > assignments)
getUtility (long index)
Class< U > getClassOfU ()
boolean setUtility (V[] variables_values, U utility)
void setUtility (long index, U utility)
void setDefaultUtility (U utility)
getDefaultUtility ()
void setInfeasibleUtility (U utility)
void augment (V[] variables_values, U utility_value)
boolean isIncludedIn (BasicUtilitySolutionSpace< V, U > space)
String getRelationName ()
void setRelationName (String name)
String getOwner ()
void setOwner (String owner)
long getNumberOfSolutions ()
void renameVariable (String oldName, String newName)
BasicHypercube< V, U > renameAllVars (String[] newVarNames)
int getIndex (String variable)
V[] getDomain (String variable, int index)
void setDomain (String var, V[] dom)
void augment (V[] variables_values)
SolutionSpace< V > join (SolutionSpace< V > space, String[] total_variables)
SolutionSpace< V > join (SolutionSpace< V > space)
SolutionSpace< V > join (SolutionSpace< V >[] spaces, String[] total_variables_order)
SolutionSpace< V > join (SolutionSpace< V >[] spaces)
Hypercube< V, U > resolve ()
Hypercube< V, U > resolve (boolean sparse)
void writeExternal (ObjectOutput out) throws IOException
void readExternal (ObjectInput in) throws IOException, ClassNotFoundException
Hypercube< V, U > toHypercube ()
boolean isIncludedIn (UtilitySolutionSpace< V, U > space)
Hypercube< V, U > changeVariablesOrder (String[] variables_order)
UtilitySolutionSpace< V, U > join (UtilitySolutionSpace< V, U > space, String[] total_variables)
Hypercube< V, U > slice (String[] variables_names, V[][] sub_domains)
Hypercube< V, U > slice (String[] variables_names, V[] values)
Hypercube< V, U > slice (String var, V[] subDomain)
Hypercube< V, U > slice (String var, V val)
Hypercube< V, U > slice (V[] variables_values)
UtilitySolutionSpace< V, U > joinMinNCCCs (UtilitySolutionSpace< V, U > space)
UtilitySolutionSpace< V, U > joinMinNCCCs (UtilitySolutionSpace< V, U >[] spaces)
UtilitySolutionSpace< V, U > multiply (UtilitySolutionSpace< V, U > space, String[] total_variables)
UtilitySolutionSpace< V, U > multiply (UtilitySolutionSpace< V, U > space)
UtilitySolutionSpace< V, U > multiply (UtilitySolutionSpace< V, U >[] spaces)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > consensus (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > consensusAllSols (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > consensusExpect (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > consensusAllSolsExpect (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > project (int number_to_project, boolean maximum)
ProjOutput< V, U > projectAll (boolean maximum, String[] order)
Hypercube< V, U > min (String variable)
Hypercube< V, U > max (String variable)
Hypercube< V, U > split (U threshold, boolean maximum)
UtilitySolutionSpace< V, U > expectation (Map< String, UtilitySolutionSpace< V, U > > distributions)
frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > projExpectMonotone (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
Map< V, Double > sample (int nbrSamples)
void setProblem (ProblemInterface< V, ?> problem)
frodo2.solutionSpaces.UtilitySolutionSpace.IteratorBestFirst< V, U > iteratorBestFirst (boolean maximize)
frodo2.solutionSpaces.UtilitySolutionSpace.IteratorBestFirst< V, U > iteratorBestFirst (boolean maximize, String[] fixedVariables, V[] fixedValues)
MyIter iterator ()
MyIter sparseIter ()
MyIter iterator (String[] order)
MyIter sparseIter (String[] order)
MyIter iterator (String[] variables, V[][] domains)
MyIter sparseIter (String[] variables, V[][] domains)
MyIter iterator (String[] variables, V[][] domains, V[] assignment)
MyIter sparseIter (String[] variables, V[][] domains, V[] assignment)
Public Member Functions inherited from frodo2.solutionSpaces.hypercube.Hypercube< V, U >
 Hypercube ()
 Empty Hypercube constructor.
void saveAsXML (String file)
 Creates an XML file from the hypercube.
getUtility (String[] variables_names, V[] variables_values)
UtilitySolutionSpace< V, U > joinMinNCCCs (UtilitySolutionSpace< V, U > space)
UtilitySolutionSpace< V, U > multiply (UtilitySolutionSpace< V, U > space, String[] total_variables)
Hypercube< V, U > slice (String[] variables_names, V[][] sub_domains)
UtilitySolutionSpace< V, U > applyJoin (UtilitySolutionSpace< V, U > space, String[] total_variables)
 Joins this hypercube with the provided hypercube if the utility values array is big enough, this hypercube is modified into the new hypercube, otherwise a new hypercube is created.
ProjOutput< V, U > consensus (final String varOut, final Map< String, UtilitySolutionSpace< V, U > > distributions, final boolean maximum)
ProjOutput< V, U > consensusAllSols (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
ProjOutput< V, U > consensusExpect (final String varOut, final Map< String, UtilitySolutionSpace< V, U > > distributions, final boolean maximum)
ProjOutput< V, U > consensusAllSolsExpect (String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum)
UtilitySolutionSpace.ProjOutput< V, U > project (String[] varsOut, final boolean maximum)
 Returns a Hypercube obtained by projecting some of the variables of the hypercube.
UtilitySolutionSpace< V, U > blindProject (String varOut, boolean maximize)
blindProjectAll (final boolean maximize)
Hypercube< V, U > min (String var)
Hypercube< V, U > max (String var)
ProjOutput< V, U > projectAll (boolean maximum)
UtilitySolutionSpace.ProjOutput< V, U > applyProject (String[] variables_names, final boolean maximum)
 Returns a Hypercube obtained by projecting some of the variables of the hypercube this version of project does not create a new hypercube but directly modifies the current utility array.
Hypercube< V, U > split (U threshold, boolean maximum)
 Returns a Hypercube containing variables values corresponding to utility values bigger than the provided threshold.
UtilitySolutionSpace< V, U > expectation (Map< String, UtilitySolutionSpace< V, U > > distributions)
ProjOutput< V, U > projExpectMonotone (final String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, final boolean maximum)
Map< V, Double > sample (int nbrSamples)
Hypercube< V, U > changeVariablesOrder (String[] variables_order)
boolean equals (Object o)
 Checks if this hypercube equals the one provided as a parameter (including the order of variables).
Hypercube< V, U > clone ()
Hypercube< V, U > resolve ()
Hypercube< V, U > toHypercube ()
boolean isIncludedIn (UtilitySolutionSpace< V, U > space)
UtilitySolutionSpace< V, U > compose (String[] varsOut, BasicUtilitySolutionSpace< V, ArrayList< V > > substitution)
UtilitySolutionSpace.IteratorBestFirst< V, U > iteratorBestFirst (boolean maximize)
UtilitySolutionSpace.Iterator< V, U > iterator ()
UtilitySolutionSpace.SparseIterator< V, U > sparseIter ()
UtilitySolutionSpace< V, U > rescale (U add, U multiply)

Protected Member Functions

UtilitySolutionSpace.Iterator< V, U > newIter (String[] variables, V[][] domains, V[] assignment, U skippedUtil)
Protected Member Functions inherited from frodo2.solutionSpaces.hypercube.Hypercube< V, U >
UtilitySolutionSpace< V, U > join (UtilitySolutionSpace< V, U > utilitySpace, String[] outputVars, final boolean addition, final boolean minNCCCs)
 Returns a Hypercube object obtained by joining this hypercube with the one provided as a parameter.
ScalarHypercube< V, U > scalarHypercube (U utility)
Hypercube< V, U > newInstance (String name, String[] new_variables, V[][] new_domains, U[] new_values, U infeasibleUtil)
UtilitySolutionSpace.Iterator< V, U > newIter (String[] variables, V[][] domains, V[] assignment, U skippedUtil)

Private Member Functions

Object readResolve () throws ObjectStreamException
 Replaces a de-serialized JoinOutputHypercube with a pure Hypercube.
V[][] reorderDomains (String[] varOrder, int nbrVars)
 Reorders the domains according to the input variable order.
MyIter iterator (String[] variables, V[][] domains, V[] assignment, U skippedUtil)
 Returns an iterator over this space.

Private Attributes

UtilitySolutionSpace< V, U > space
 The space.
String[] varsOut
 The variables to project out.
boolean maximize
 Whether to maximize or minimize.
long nbrUtils
 Number of solutions.

Additional Inherited Members

Static Public Member Functions inherited from frodo2.solutionSpaces.hypercube.Hypercube< V, U >
static String[] union (String[] list1, String[] list2)
 Computes the union of two lists, perserving the order when possible.

Detailed Description

The output of a blindProject() that computes itself on the fly.

Author
Thomas Leaute
Parameters
<V>the type of variable values
<U>the type of utility values

Constructor & Destructor Documentation

◆ BlindProjectOutput() [1/2]

◆ BlindProjectOutput() [2/2]

frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.BlindProjectOutput ( UtilitySolutionSpace< V, U > space,
String[] varsOut,
boolean maximize,
U infeasibleUtil )

Constructor.

Parameters
spacethe space
varsOutthe variables to project out
maximizewhether to maximize or minimize
infeasibleUtilthe infeasible utility

References BlindProjectOutput(), maximize, space, and varsOut.

Here is the call graph for this function:

Member Function Documentation

◆ augment() [1/2]

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.augment ( V[] variables_values)
See also
frodo2.solutionSpaces.SolutionSpace#augment(Addable[])
Todo
Auto-generated method stub

◆ augment() [2/2]

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.augment ( V[] variables_values,
U utility_value )
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace.augment(Addable[], java.io.Serializable)
Todo
Auto-generated method stub

◆ changeVariablesOrder()

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.changeVariablesOrder ( String[] variables_order)
See also
frodo2.solutionSpaces.UtilitySolutionSpace.changeVariablesOrder(java.lang.String[])
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ clone()

BlindProjectOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.clone ( )
See also
java.lang.Object#clone()
Todo
Auto-generated method stub

References BlindProjectOutput().

Here is the call graph for this function:

◆ consensus()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.consensus ( String varOut,
Map< String, UtilitySolutionSpace< V, U > > distributions,
boolean maximum )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.consensus(java.lang.String, java.util.Map, boolean)
Todo
Auto-generated method stub

◆ consensusAllSols()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.consensusAllSols ( String varOut,
Map< String, UtilitySolutionSpace< V, U > > distributions,
boolean maximum )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.consensusAllSols(java.lang.String, java.util.Map, boolean)
Todo
Auto-generated method stub

◆ consensusAllSolsExpect()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.consensusAllSolsExpect ( String varOut,
Map< String, UtilitySolutionSpace< V, U > > distributions,
boolean maximum )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.consensusAllSolsExpect(java.lang.String, java.util.Map, boolean)
Todo
Auto-generated method stub

◆ consensusExpect()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.consensusExpect ( String varOut,
Map< String, UtilitySolutionSpace< V, U > > distributions,
boolean maximum )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.consensusExpect(java.lang.String, java.util.Map, boolean)
Todo
Auto-generated method stub

◆ expectation()

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.expectation ( Map< String, UtilitySolutionSpace< V, U > > distributions)
See also
frodo2.solutionSpaces.UtilitySolutionSpace.expectation(java.util.Map)
Todo
Auto-generated method stub

◆ getClassOfU()

Class< U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getClassOfU ( )

◆ getDefaultUtility()

U frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getDefaultUtility ( )

◆ getDomain()

V[] frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getDomain ( String variable,
int index )
See also
frodo2.solutionSpaces.SolutionSpace.getDomain(java.lang.String, int)
Todo
Auto-generated method stub

◆ getIndex()

int frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getIndex ( String variable)
See also
frodo2.solutionSpaces.SolutionSpace.getIndex(java.lang.String)
Todo
Auto-generated method stub

◆ getNumberOfSolutions()

long frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getNumberOfSolutions ( )

◆ getOwner()

String frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getOwner ( )
See also
frodo2.solutionSpaces.SolutionSpace.getOwner()
Todo
Auto-generated method stub

◆ getRelationName()

String frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getRelationName ( )

◆ getUtility() [1/4]

U frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getUtility ( long index)

◆ getUtility() [2/4]

U frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getUtility ( Map< String, V > assignments)
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace.getUtility(java.util.Map)
Todo
Auto-generated method stub

◆ getUtility() [3/4]

U frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getUtility ( String[] variables_names,
V[] variables_values )
See also
Hypercube.getUtility(java.lang.String[], Addable[])
Todo
Improve performance

References iterator().

Here is the call graph for this function:

◆ getUtility() [4/4]

U frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.getUtility ( V[] variables_values)
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace#getUtility(Addable[])
Todo
Auto-generated method stub

Referenced by readResolve().

◆ isIncludedIn() [1/2]

◆ isIncludedIn() [2/2]

boolean frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.isIncludedIn ( UtilitySolutionSpace< V, U > space)

◆ iterator() [1/5]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.iterator ( )
See also
Hypercube.iterator()

References iterator().

Referenced by getUtility(), iterator(), and newIter().

Here is the call graph for this function:

◆ iterator() [2/5]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.iterator ( String[] order)
See also
Hypercube.iterator(java.lang.String[])

◆ iterator() [3/5]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.iterator ( String[] variables,
V domains[][] )
See also
Hypercube.iterator(java.lang.String[], Addable[][])

◆ iterator() [4/5]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.iterator ( String[] variables,
V domains[][],
V[] assignment )
See also
Hypercube.iterator(java.lang.String[], Addable[][], Addable[])

◆ iterator() [5/5]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.iterator ( String[] variables,
V domains[][],
V[] assignment,
U skippedUtil )
private

Returns an iterator over this space.

Parameters
variablesthe variable order
domainsthe corresponding variable domains
assignmentan array that will be used as the output of nextSolution()
skippedUtilthe utility value to skip, if any
Returns
an iterator

◆ iteratorBestFirst() [1/2]

◆ iteratorBestFirst() [2/2]

frodo2.solutionSpaces.UtilitySolutionSpace.IteratorBestFirst< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.iteratorBestFirst ( boolean maximize,
String[] fixedVariables,
V[] fixedValues )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.iteratorBestFirst(boolean, java.lang.String[], Addable[])
Todo
Auto-generated method stub

References maximize.

◆ join() [1/5]

◆ join() [2/5]

SolutionSpace< V > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.join ( SolutionSpace< V > space,
String[] total_variables )
See also
frodo2.solutionSpaces.SolutionSpace.join(frodo2.solutionSpaces.SolutionSpace, java.lang.String[])
Todo
Auto-generated method stub

References space.

◆ join() [3/5]

◆ join() [4/5]

SolutionSpace< V > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.join ( SolutionSpace< V >[] spaces,
String[] total_variables_order )
See also
frodo2.solutionSpaces.SolutionSpace.join(frodo2.solutionSpaces.SolutionSpace[], java.lang.String[])
Todo
Auto-generated method stub

◆ join() [5/5]

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.join ( UtilitySolutionSpace< V, U > space,
String[] total_variables )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.join(frodo2.solutionSpaces.UtilitySolutionSpace, java.lang.String[])
Todo
Auto-generated method stub

References space.

◆ joinMinNCCCs() [1/2]

◆ joinMinNCCCs() [2/2]

◆ max()

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.max ( String variable)
See also
frodo2.solutionSpaces.UtilitySolutionSpace.max(java.lang.String)
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ min()

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.min ( String variable)
See also
frodo2.solutionSpaces.UtilitySolutionSpace.min(java.lang.String)
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ multiply() [1/3]

◆ multiply() [2/3]

UtilitySolutionSpace< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.multiply ( UtilitySolutionSpace< V, U > space,
String[] total_variables )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.multiply(frodo2.solutionSpaces.UtilitySolutionSpace, java.lang.String[])
Todo
Auto-generated method stub

References space.

◆ multiply() [3/3]

◆ newIter()

UtilitySolutionSpace.Iterator< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.newIter ( String[] variables,
V domains[][],
V[] assignment,
U skippedUtil )
protected
See also
Hypercube.newIter(java.lang.String[], Addable[][], Addable[], Addable)

References iterator().

Here is the call graph for this function:

◆ prettyPrint()

String frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.prettyPrint ( U ignoredUtil)
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace.prettyPrint(java.io.Serializable)
Todo
Auto-generated method stub

◆ project()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.project ( int number_to_project,
boolean maximum )

◆ projectAll()

ProjOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.projectAll ( boolean maximum,
String[] order )

◆ projExpectMonotone()

frodo2.solutionSpaces.UtilitySolutionSpace.ProjOutput< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.projExpectMonotone ( String varOut,
Map< String, UtilitySolutionSpace< V, U > > distributions,
boolean maximum )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.projExpectMonotone(java.lang.String, java.util.Map, boolean)
Todo
Auto-generated method stub

◆ readExternal()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.readExternal ( ObjectInput in) throws IOException, ClassNotFoundException
See also
frodo2.solutionSpaces.hypercube.BasicHypercube.readExternal(java.io.ObjectInput)

References nbrUtils, and readExternal().

Referenced by readExternal().

Here is the call graph for this function:

◆ readResolve()

Object frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.readResolve ( ) throws ObjectStreamException
private

Replaces a de-serialized JoinOutputHypercube with a pure Hypercube.

Returns
a Hypercube corresponding to the explicit representation of this JoinOutputHypercube
Exceptions
ObjectStreamExceptionif an error occurs

References getUtility(), and readResolve().

Referenced by readResolve().

Here is the call graph for this function:

◆ renameAllVars()

BasicHypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.renameAllVars ( String[] newVarNames)
See also
frodo2.solutionSpaces.SolutionSpace.renameAllVars(java.lang.String[])
Todo
Auto-generated method stub

◆ renameVariable()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.renameVariable ( String oldName,
String newName )
See also
frodo2.solutionSpaces.SolutionSpace.renameVariable(java.lang.String, java.lang.String)
Todo
Auto-generated method stub

◆ reorderDomains()

V[][] frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.reorderDomains ( String[] varOrder,
int nbrVars )
private

Reorders the domains according to the input variable order.

Parameters
varOrdernew variable order
nbrVarsnumber of variables
Returns
the reordered array of domains

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.equals().

Referenced by projectAll().

Here is the call graph for this function:

◆ resolve() [1/2]

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.resolve ( )
See also
Hypercube.resolve()

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube(), and resolve().

Referenced by resolve().

Here is the call graph for this function:

◆ resolve() [2/2]

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.resolve ( boolean sparse)
See also
Hypercube.resolve(boolean)
Bug
When sparse == true, might not work if the projection maximizes a minimization space or vice-versa, because the sparse iterator will skip the wrong infeasibility
Bug
When sparse == true, might not work if the projection maximizes a minimization space or vice-versa, because the sparse iterator will skip the wrong infeasibility

References frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V >.hasNext(), frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube(), frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.iterator(), nbrUtils, frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable< U > >.newInstance(), sparseIter(), and frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.sparseIter().

Here is the call graph for this function:

◆ sample()

Map< V, Double > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.sample ( int nbrSamples)

◆ setDefaultUtility()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setDefaultUtility ( U utility)
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace.setDefaultUtility(java.io.Serializable)
Todo
Auto-generated method stub

◆ setDomain()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setDomain ( String var,
V[] dom )
See also
frodo2.solutionSpaces.SolutionSpace.setDomain(java.lang.String, Addable[])
Todo
Auto-generated method stub

◆ setInfeasibleUtility()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setInfeasibleUtility ( U utility)
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace.setInfeasibleUtility(java.io.Serializable)
Todo
Auto-generated method stub

◆ setOwner()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setOwner ( String owner)
See also
frodo2.solutionSpaces.SolutionSpace.setOwner(java.lang.String)
Todo
Auto-generated method stub

◆ setProblem()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setProblem ( ProblemInterface< V, ?> problem)
See also
frodo2.solutionSpaces.UtilitySolutionSpace#setProblem(frodo2.solutionSpaces.ProblemInterface)
Todo
Auto-generated method stub

◆ setRelationName()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setRelationName ( String name)
See also
frodo2.solutionSpaces.SolutionSpace.setRelationName(java.lang.String)
Todo
Auto-generated method stub

◆ setUtility() [1/2]

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setUtility ( long index,
U utility )
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace.setUtility(long, java.io.Serializable)
Todo
Auto-generated method stub

◆ setUtility() [2/2]

boolean frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.setUtility ( V[] variables_values,
U utility )
See also
frodo2.solutionSpaces.BasicUtilitySolutionSpace.setUtility(Addable[], java.io.Serializable)
Todo
Auto-generated method stub

◆ slice() [1/5]

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.slice ( String var,
V val )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.slice(java.lang.String, frodo2.solutionSpaces.Addable)
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ slice() [2/5]

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.slice ( String var,
V[] subDomain )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.slice(java.lang.String, Addable[])
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ slice() [3/5]

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.slice ( String[] variables_names,
V[] values )

◆ slice() [4/5]

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.slice ( String[] variables_names,
V sub_domains[][] )

◆ slice() [5/5]

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.slice ( V[] variables_values)
See also
frodo2.solutionSpaces.UtilitySolutionSpace#slice(Addable[])
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ sparseIter() [1/4]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.sparseIter ( )
See also
Hypercube.sparseIter()

References sparseIter().

Referenced by resolve(), and sparseIter().

Here is the call graph for this function:

◆ sparseIter() [2/4]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.sparseIter ( String[] order)
See also
Hypercube.sparseIter(java.lang.String[])

◆ sparseIter() [3/4]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.sparseIter ( String[] variables,
V domains[][] )
See also
Hypercube.sparseIter(java.lang.String[], Addable[][])

◆ sparseIter() [4/4]

MyIter frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.sparseIter ( String[] variables,
V domains[][],
V[] assignment )
See also
Hypercube.sparseIter(java.lang.String[], Addable[][], Addable[])

◆ split()

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.split ( U threshold,
boolean maximum )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.split(frodo2.solutionSpaces.Addable, boolean)
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ toHypercube()

Hypercube< V, U > frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.toHypercube ( )
See also
frodo2.solutionSpaces.UtilitySolutionSpace.toHypercube()
Todo
Auto-generated method stub

References frodo2.solutionSpaces.hypercube.Hypercube< V, U >.Hypercube().

Here is the call graph for this function:

◆ toString()

String frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.toString ( )

◆ writeExternal()

void frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.writeExternal ( ObjectOutput out) throws IOException

Member Data Documentation

◆ maximize

boolean frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.maximize
private

Whether to maximize or minimize.

Referenced by BlindProjectOutput(), iteratorBestFirst(), and iteratorBestFirst().

◆ nbrUtils

long frodo2.solutionSpaces.hypercube.BlindProjectOutput< V extends Addable< V >, U extends Addable< U > >.nbrUtils
private

Number of solutions.

Referenced by readExternal(), and resolve().

◆ space

◆ varsOut


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