 |
Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
|
|
Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
|
This is the complete list of members for operations_research::sat::SolutionCrush, including all inherited members.
| AssignVariableToPackingArea(const CompactVectorVector< int, Rectangle > &areas, const CpModelProto &model, absl::Span< const int > x_intervals, absl::Span< const int > y_intervals, absl::Span< const BoxInAreaLiteral > box_in_area_lits) | operations_research::sat::SolutionCrush | |
| GetVarValues() const | operations_research::sat::SolutionCrush | inline |
| LoadSolution(int num_vars, const absl::flat_hash_map< int, int64_t > &solution) | operations_research::sat::SolutionCrush | |
| MakeLiteralsEqual(int lit1, int lit2) | operations_research::sat::SolutionCrush | |
| MaybeSetLiteralToValueEncoding(int literal, int var, int64_t value) | operations_research::sat::SolutionCrush | |
| MaybeUpdateVarWithSymmetriesToValue(int var, bool value, absl::Span< const std::unique_ptr< SparsePermutation > > generators) | operations_research::sat::SolutionCrush | |
| operator=(const SolutionCrush &)=delete | operations_research::sat::SolutionCrush | |
| operator=(SolutionCrush &&)=delete | operations_research::sat::SolutionCrush | |
| Resize(int new_size) | operations_research::sat::SolutionCrush | |
| SetAutomatonExpandedVars(const AutomatonConstraintProto &automaton, absl::Span< const StateVar > state_vars, absl::Span< const TransitionVar > transition_vars) | operations_research::sat::SolutionCrush | |
| SetIntModExpandedVars(const ConstraintProto &ct, int div_var, int prod_var, int64_t default_div_value, int64_t default_prod_value) | operations_research::sat::SolutionCrush | |
| SetIntProdExpandedVars(const LinearArgumentProto &int_prod, absl::Span< const int > prod_vars) | operations_research::sat::SolutionCrush | |
| SetLinearWithComplexDomainExpandedVars(const LinearConstraintProto &linear, absl::Span< const int > bucket_lits) | operations_research::sat::SolutionCrush | |
| SetLinMaxExpandedVars(const LinearArgumentProto &lin_max, absl::Span< const int > enforcement_lits) | operations_research::sat::SolutionCrush | |
| SetLiteralToValueIf(int literal, bool value, int condition_lit) | operations_research::sat::SolutionCrush | |
| SetLiteralToValueIfLinearConstraintViolated(int literal, bool value, absl::Span< const std::pair< int, int64_t > > linear, const Domain &domain) | operations_research::sat::SolutionCrush | |
| SetOrUpdateVarToDomain(int var, const Domain &domain) | operations_research::sat::SolutionCrush | |
| SetReservoirCircuitVars(const ReservoirConstraintProto &reservoir, int64_t min_level, int64_t max_level, absl::Span< const int > level_vars, const CircuitConstraintProto &circuit) | operations_research::sat::SolutionCrush | |
| SetTableExpandedVars(absl::Span< const int > column_vars, absl::Span< const int > existing_row_lits, absl::Span< const TableRowLiteral > new_row_lits) | operations_research::sat::SolutionCrush | |
| SetVarToClause(int var, absl::Span< const int > clause) | operations_research::sat::SolutionCrush | |
| SetVarToConditionalValue(int var, absl::Span< const int > condition_lits, int64_t value_if_true, int64_t value_if_false) | operations_research::sat::SolutionCrush | |
| SetVarToConjunction(int var, absl::Span< const int > conjunction) | operations_research::sat::SolutionCrush | |
| SetVarToLinearConstraintSolution(std::optional< int > var_index, absl::Span< const int > vars, absl::Span< const int64_t > coeffs, int64_t rhs) | operations_research::sat::SolutionCrush | |
| SetVarToLinearExpression(int var, absl::Span< const std::pair< int, int64_t > > linear, int64_t offset=0) | operations_research::sat::SolutionCrush | |
| SetVarToLinearExpression(int var, absl::Span< const int > vars, absl::Span< const int64_t > coeffs, int64_t offset=0) | operations_research::sat::SolutionCrush | |
| SetVarToLinearExpressionIf(int var, const LinearExpressionProto &expr, int condition_lit) | operations_research::sat::SolutionCrush | |
| SetVarToReifiedPrecedenceLiteral(int var, const LinearExpressionProto &time_i, const LinearExpressionProto &time_j, int active_i, int active_j) | operations_research::sat::SolutionCrush | |
| SetVarToValueIf(int var, int64_t value, int condition_lit) | operations_research::sat::SolutionCrush | |
| SetVarToValueIfLinearConstraintViolated(int var, int64_t value, absl::Span< const std::pair< int, int64_t > > linear, const Domain &domain) | operations_research::sat::SolutionCrush | |
| SolutionCrush()=default | operations_research::sat::SolutionCrush | |
| SolutionCrush(const SolutionCrush &)=delete | operations_research::sat::SolutionCrush | |
| SolutionCrush(SolutionCrush &&)=delete | operations_research::sat::SolutionCrush | |
| SolutionIsLoaded() const | operations_research::sat::SolutionCrush | inline |
| StoreSolutionAsHint(CpModelProto &model) const | operations_research::sat::SolutionCrush | |
| UpdateLiteralsToFalseIfDifferent(int lit1, int lit2) | operations_research::sat::SolutionCrush | |
| UpdateLiteralsWithDominance(int lit, int dominating_lit) | operations_research::sat::SolutionCrush | |
| UpdateRefsWithDominance(int ref, int64_t min_value, int64_t max_value, absl::Span< const std::pair< int, Domain > > dominating_refs) | operations_research::sat::SolutionCrush |
1.13.2