FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL > Member List

This is the complete list of members for frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >, including all inherited members.

augment(V[] variables_values, U utility_value)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
blindProject(String varOut, boolean maximize)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
blindProject(String[] varsOut, boolean maximize)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
blindProjectAll(boolean maximize)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
changeVariablesOrder(String[] variables_order)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
clone()frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
compose(String[] vars, BasicUtilitySolutionSpace< V, ArrayList< V > > substitution)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
equivalent(BasicUtilitySolutionSpace< V, U > space)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
getClassOfU()frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
getDefaultUtility()frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
getUtility(V[] variables_values)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
isIncludedIn(BasicUtilitySolutionSpace< V, U > space)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
iterator()frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
join(UtilitySolutionSpace< V, U > space)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
joinMinNCCCs(UtilitySolutionSpace< V, U > space)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
max(String variable)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
min(String variable)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
prettyPrint(U ignoredUtil)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
resolve()frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
resolve(boolean sparse)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
setDefaultUtility(U utility)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
setInfeasibleUtility(U utility)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
setUtility(V[] variables_values, U utility)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
slice(String var, V val)frodo2.solutionSpaces.UtilitySolutionSpaceLimited< V extends Addable< V >, U extends Addable< U >, UL extends AddableLimited< U, UL >
frodo2::solutionSpaces::BasicUtilitySolutionSpace< V, UL >.slice(String[] variables_names, V[][] sub_domains)frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >
sparseIter()frodo2.solutionSpaces.BasicUtilitySolutionSpace< V, UL >