| blindProject(String varOut, boolean maximize) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| blindProject(String[] varsOut, boolean maximize) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| blindProjectAll(boolean maximize) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| changeVariablesOrder(String[] variables_order) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| clone() | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| compose(String[] vars, BasicUtilitySolutionSpace< V, ArrayList< V > > substitution) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| consensus(String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| consensusAllSols(String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| consensusAllSolsExpect(String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| consensusExpect(String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| expectation(Map< String, UtilitySolutionSpace< V, U > > distributions) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| isIncludedIn(UtilitySolutionSpace< V, U > space) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| iterator() | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| iterator(String[] order) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| iterator(String[] variables, V[][] domains) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| iterator(String[] variables, V[][] domains, V[] assignment) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| iteratorBestFirst(boolean maximize) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| iteratorBestFirst(boolean maximize, String[] fixedVariables, V[] fixedValues) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| join(UtilitySolutionSpace< V, U > space, String[] total_variables) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| join(UtilitySolutionSpace< V, U > space) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| join(UtilitySolutionSpace< V, U >[] spaces) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| joinMinNCCCs(UtilitySolutionSpace< V, U > space) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| joinMinNCCCs(UtilitySolutionSpace< V, U >[] spaces) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| max(String variable) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| min(String variable) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| multiply(UtilitySolutionSpace< V, U > space, String[] total_variables) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| multiply(UtilitySolutionSpace< V, U > space) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| multiply(UtilitySolutionSpace< V, U >[] spaces) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| project(String[] variables_names, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| project(int number_to_project, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| project(String variable_name, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| projectAll(boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| projectAll(boolean maximum, String[] order) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| projExpectMonotone(String varOut, Map< String, UtilitySolutionSpace< V, U > > distributions, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| rescale(U add, U multiply) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| resolve() | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| resolve(boolean sparse) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| sample(int nbrSamples) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| slice(String[] variables_names, V[][] sub_domains) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| slice(String[] variables_names, V[] values) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| slice(String var, V[] subDomain) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| slice(String var, V val) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| slice(V[] variables_values) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| sparseIter() | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| sparseIter(String[] order) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| sparseIter(String[] variables, V[][] domains) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| sparseIter(String[] variables, V[][] domains, V[] assignment) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| split(U threshold, boolean maximum) | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
| toHypercube() | frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > > | |
1.15.0