A UtilitySolutionSpace iterator that does NOT skip infeasible solutions. More...

Inheritance diagram for frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.Iterator< V, U >:

[legend]

Additional Inherited Members
Public Member Functions inherited from frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U >
U	nextUtility (U bound, boolean minimize)
	Returns the next solution strictly better than the input bound.
U	getCurrentUtility (U bound, boolean minimize)
Public Member Functions inherited from frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.SparseIterator< V, U >
U	nextUtility ()
U	getCurrentUtility ()
void	setCurrentUtility (U util)
	Sets the utility of the current solution.
Public Member Functions inherited from frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >
V[]	nextSolution ()
V[]	getCurrentSolution ()
String[]	getVariablesOrder ()
V[][]	getDomains ()
void	update ()
	It is supposed to be called if the solution space upon which the iterator is based has changed.
Public Member Functions inherited from frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V >
long	getNbrSolutions ()
boolean	hasNext ()

Detailed Description

A UtilitySolutionSpace iterator that does NOT skip infeasible solutions.

Parameters

<V>	the type used for variable values
<U>	the type used for utility values

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

Additional Inherited Members