![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
Namespaces | |
| namespace | v1 |
Typedefs | |
| using | SmallBitset = uint32_t |
| using | InlinedIntegerLiteralVector = absl::InlinedVector<IntegerLiteral, 2> |
| using | InlinedIntegerValueVector |
| using | IntegerSumLE = LinearConstraintPropagator<false> |
| using | IntegerSumLE128 = LinearConstraintPropagator<true> |
| typedef double | Fractional |
| typedef double | Fractional |
| typedef double | Fractional |
Functions | |
| void | ProcessFloatingPointOVariablesAndObjective (fz::Model *fz_model) |
| CpSolverResponse | SolveFzWithCpModelProto (const fz::Model &fz_model, const fz::FlatzincSatParameters &p, const SatParameters &sat_params, Model *sat_model, SolverLogger *solution_logger) |
| void | CreateAndRegisterMandatoryOverlapPropagator (NoOverlap2DConstraintHelper *helper, Model *model, GenericLiteralWatcher *watcher, int priority) |
| std::vector< Rectangle > | GenerateNonConflictingRectangles (int num_rectangles, absl::BitGenRef random) |
| std::vector< Rectangle > | GenerateNonConflictingRectanglesWithPacking (std::pair< IntegerValue, IntegerValue > bb, int average_num_boxes, absl::BitGenRef random) |
| std::vector< RectangleInRange > | MakeItemsFromRectangles (absl::Span< const Rectangle > rectangles, double slack_factor, absl::BitGenRef random) |
| std::vector< ItemWithVariableSize > | GenerateItemsRectanglesWithNoPairwiseConflict (absl::Span< const Rectangle > rectangles, double slack_factor, absl::BitGenRef random) |
| std::vector< ItemWithVariableSize > | GenerateItemsRectanglesWithNoPairwisePropagation (int num_rectangles, double slack_factor, absl::BitGenRef random) |
| bool | Preprocess (absl::Span< PermutableItem > &items, std::pair< IntegerValue, IntegerValue > &bounding_box_size, int max_complexity) |
| BruteForceResult | BruteForceOrthogonalPacking (absl::Span< const IntegerValue > sizes_x, absl::Span< const IntegerValue > sizes_y, std::pair< IntegerValue, IntegerValue > bounding_box_size, int max_complexity) |
| bool | PresolveFixed2dRectangles (absl::Span< const RectangleInRange > non_fixed_boxes, std::vector< Rectangle > *fixed_boxes) |
| bool | ReduceNumberofBoxesGreedy (std::vector< Rectangle > *mandatory_rectangles, std::vector< Rectangle > *optional_rectangles) |
| Neighbours | BuildNeighboursGraph (absl::Span< const Rectangle > rectangles) |
| std::vector< std::vector< int > > | SplitInConnectedComponents (const Neighbours &neighbours) |
| std::vector< SingleShape > | BoxesToShapes (absl::Span< const Rectangle > rectangles, const Neighbours &neighbours) |
| std::vector< Rectangle > | CutShapeIntoRectangles (SingleShape shape) |
| bool | ReduceNumberOfBoxesExactMandatory (std::vector< Rectangle > *mandatory_rectangles, std::vector< Rectangle > *optional_rectangles) |
| Disjoint2dPackingResult | DetectDisjointRegionIn2dPacking (absl::Span< const RectangleInRange > non_fixed_boxes, absl::Span< const Rectangle > fixed_boxes, int max_num_components) |
| template<typename Sink> | |
| void | AbslStringify (Sink &sink, EdgePosition e) |
| void | CreateAndRegisterTryEdgePropagator (NoOverlap2DConstraintHelper *helper, Model *model, GenericLiteralWatcher *watcher, int priority) |
| std::function< void(Model *)> | AllDifferentBinary (absl::Span< const IntegerVariable > vars) |
| std::function< void(Model *)> | AllDifferentOnBounds (absl::Span< const Literal > enforcement_literals, absl::Span< const AffineExpression > expressions) |
| std::function< void(Model *)> | AllDifferentOnBounds (absl::Span< const IntegerVariable > vars) |
| std::function< void(Model *)> | AllDifferentAC (absl::Span< const IntegerVariable > variables) |
| void | ExtractAssignment (const LinearBooleanProblem &problem, const SatSolver &solver, std::vector< bool > *assignment) |
| absl::Status | ValidateBooleanProblem (const LinearBooleanProblem &problem) |
| CpModelProto | BooleanProblemToCpModelproto (const LinearBooleanProblem &problem) |
| void | ChangeOptimizationDirection (LinearBooleanProblem *problem) |
| bool | LoadBooleanProblem (const LinearBooleanProblem &problem, SatSolver *solver) |
| bool | LoadAndConsumeBooleanProblem (LinearBooleanProblem *problem, SatSolver *solver) |
| void | UseObjectiveForSatAssignmentPreference (const LinearBooleanProblem &problem, SatSolver *solver) |
| bool | AddObjectiveUpperBound (const LinearBooleanProblem &problem, Coefficient upper_bound, SatSolver *solver) |
| bool | AddObjectiveConstraint (const LinearBooleanProblem &problem, bool use_lower_bound, Coefficient lower_bound, bool use_upper_bound, Coefficient upper_bound, SatSolver *solver) |
| Coefficient | ComputeObjectiveValue (const LinearBooleanProblem &problem, const std::vector< bool > &assignment) |
| bool | IsAssignmentValid (const LinearBooleanProblem &problem, const std::vector< bool > &assignment) |
| std::string | LinearBooleanProblemToCnfString (const LinearBooleanProblem &problem) |
| void | StoreAssignment (const VariablesAssignment &assignment, BooleanAssignment *output) |
| void | ExtractSubproblem (const LinearBooleanProblem &problem, absl::Span< const int > constraint_indices, LinearBooleanProblem *subproblem) |
| template<typename Graph> | |
| Graph * | GenerateGraphForSymmetryDetection (const LinearBooleanProblem &problem, std::vector< int > *initial_equivalence_classes) |
| void | MakeAllLiteralsPositive (LinearBooleanProblem *problem) |
| void | FindLinearBooleanProblemSymmetries (const LinearBooleanProblem &problem, std::vector< std::unique_ptr< SparsePermutation > > *generators) |
| void | ApplyLiteralMappingToBooleanProblem (const util_intops::StrongVector< LiteralIndex, LiteralIndex > &mapping, LinearBooleanProblem *problem) |
| void | ProbeAndSimplifyProblem (SatPostsolver *postsolver, LinearBooleanProblem *problem) |
| double | AddOffsetAndScaleObjectiveValue (const LinearBooleanProblem &problem, Coefficient v) |
| std::function< void(Model *)> | ExactlyOnePerRowAndPerColumn (absl::Span< const std::vector< Literal > > graph) |
| void | LoadSubcircuitConstraint (int num_nodes, absl::Span< const int > tails, absl::Span< const int > heads, absl::Span< const Literal > enforcement_literals, absl::Span< const Literal > literals, Model *model, bool multiple_subcircuit_through_zero) |
| std::function< void(Model *)> | CircuitCovering (absl::Span< const std::vector< Literal > > graph, absl::Span< const int > distinguished_nodes) |
| template<class IntContainer> | |
| int | ReindexArcs (IntContainer *tails, IntContainer *heads, absl::flat_hash_map< int, int > *mapping_output=nullptr) |
| bool | TrySolution (const CpModelProto &model, absl::Span< const int64_t > solution, absl::Span< const int64_t > new_solution, absl::Span< const int64_t > base_solution, std::vector< int64_t > *new_combined_solution) |
| std::optional< std::vector< int64_t > > | FindCombinedSolution (const CpModelProto &model, absl::Span< const int64_t > new_solution, absl::Span< const int64_t > base_solution, const SharedResponseManager *response_manager, std::string *solution_info) |
| PushedSolutionPointers | PushAndMaybeCombineSolution (SharedResponseManager *response_manager, const CpModelProto &model_proto, absl::Span< const int64_t > new_solution, absl::string_view solution_info, std::shared_ptr< const SharedSolutionRepository< int64_t >::Solution > base_solution) |
| int64_t | OverlapOfTwoIntervals (const ConstraintProto &interval1, const ConstraintProto &interval2, absl::Span< const int64_t > solution) |
| int64_t | NoOverlapMinRepairDistance (const ConstraintProto &interval1, const ConstraintProto &interval2, absl::Span< const int64_t > solution) |
| void | AddCircuitFlowConstraints (LinearIncrementalEvaluator &linear_evaluator, const ConstraintProto &ct_proto) |
| std::vector< IntegerValue > | ToIntegerValueVector (absl::Span< const int64_t > input) |
| std::function< void(Model *)> | LiteralXorIs (absl::Span< const Literal > enforcement_literals, const std::vector< Literal > &literals, bool value) |
| std::function< void(Model *)> | GreaterThanAtLeastOneOf (IntegerVariable target_var, const absl::Span< const IntegerVariable > vars, const absl::Span< const IntegerValue > offsets, const absl::Span< const Literal > selectors, const absl::Span< const Literal > enforcements) |
| std::function< void(Model *)> | PartialIsOneOfVar (IntegerVariable target_var, absl::Span< const IntegerVariable > vars, absl::Span< const Literal > selectors) |
| BoolVar | Not (BoolVar x) |
| std::ostream & | operator<< (std::ostream &os, const BoolVar &var) |
| std::string | VarDebugString (const CpModelProto &proto, int index) |
| std::ostream & | operator<< (std::ostream &os, const IntVar &var) |
| std::ostream & | operator<< (std::ostream &os, const LinearExpr &e) |
| std::ostream & | operator<< (std::ostream &os, const DoubleLinearExpr &e) |
| std::ostream & | operator<< (std::ostream &os, const IntervalVar &var) |
| int64_t | SolutionIntegerValue (const CpSolverResponse &r, const LinearExpr &expr) |
| bool | SolutionBooleanValue (const CpSolverResponse &r, BoolVar x) |
| template<typename H> | |
| H | AbslHashValue (H h, const IntVar &i) |
| template<typename H> | |
| H | AbslHashValue (H h, const IntervalVar &i) |
| LinearExpr | operator- (LinearExpr expr) |
| LinearExpr | operator+ (const LinearExpr &lhs, const LinearExpr &rhs) |
| LinearExpr | operator+ (LinearExpr &&lhs, const LinearExpr &rhs) |
| LinearExpr | operator+ (const LinearExpr &lhs, LinearExpr &&rhs) |
| LinearExpr | operator+ (LinearExpr &&lhs, LinearExpr &&rhs) |
| LinearExpr | operator- (const LinearExpr &lhs, const LinearExpr &rhs) |
| LinearExpr | operator- (LinearExpr &&lhs, const LinearExpr &rhs) |
| LinearExpr | operator- (const LinearExpr &lhs, LinearExpr &&rhs) |
| LinearExpr | operator- (LinearExpr &&lhs, LinearExpr &&rhs) |
| LinearExpr | operator* (LinearExpr expr, int64_t factor) |
| LinearExpr | operator* (int64_t factor, LinearExpr expr) |
| DoubleLinearExpr | operator- (DoubleLinearExpr expr) |
| DoubleLinearExpr | operator+ (const DoubleLinearExpr &lhs, const DoubleLinearExpr &rhs) |
| DoubleLinearExpr | operator+ (DoubleLinearExpr &&lhs, const DoubleLinearExpr &rhs) |
| DoubleLinearExpr | operator+ (const DoubleLinearExpr &lhs, DoubleLinearExpr &&rhs) |
| DoubleLinearExpr | operator+ (DoubleLinearExpr &&lhs, DoubleLinearExpr &&rhs) |
| DoubleLinearExpr | operator+ (DoubleLinearExpr expr, double rhs) |
| DoubleLinearExpr | operator+ (double lhs, DoubleLinearExpr expr) |
| DoubleLinearExpr | operator- (const DoubleLinearExpr &lhs, const DoubleLinearExpr &rhs) |
| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, const DoubleLinearExpr &rhs) |
| DoubleLinearExpr | operator- (const DoubleLinearExpr &lhs, DoubleLinearExpr &&rhs) |
| DoubleLinearExpr | operator- (DoubleLinearExpr &&lhs, DoubleLinearExpr &&rhs) |
| DoubleLinearExpr | operator- (DoubleLinearExpr epxr, double rhs) |
| DoubleLinearExpr | operator- (double lhs, DoubleLinearExpr expr) |
| DoubleLinearExpr | operator* (DoubleLinearExpr expr, double factor) |
| DoubleLinearExpr | operator* (double factor, DoubleLinearExpr expr) |
| bool | PossibleIntegerOverflow (const CpModelProto &model, absl::Span< const int > vars, absl::Span< const int64_t > coeffs, int64_t offset, std::pair< int64_t, int64_t > *implied_domain) |
| std::string | ValidateCpModel (const CpModelProto &model, bool after_presolve) |
| std::string | ValidateInputCpModel (const SatParameters ¶ms, const CpModelProto &model) |
| bool | ConstraintIsFeasible (const CpModelProto &model, const ConstraintProto &constraint, absl::Span< const int64_t > variable_values) |
| bool | SolutionIsFeasible (const CpModelProto &model, absl::Span< const int64_t > variable_values, const CpModelProto *mapping_proto, const std::vector< int > *postsolve_mapping) |
| bool | SolutionCanBeOptimal (const CpModelProto &model, absl::Span< const int64_t > variable_values) |
| bool | ImportModelWithBasicPresolveIntoContext (const CpModelProto &in_model, PresolveContext *context, LratProofHandler *lrat_proof_handler) |
| bool | ImportModelAndDomainsWithBasicPresolveIntoContext (const CpModelProto &in_model, absl::Span< const Domain > domains, std::function< bool(int)> active_constraints, PresolveContext *context, std::vector< int > *interval_mapping) |
| void | CopyEverythingExceptVariablesAndConstraintsFieldsIntoContext (const CpModelProto &in_model, PresolveContext *context) |
| void | ExpandCpModel (PresolveContext *context) |
| void | FinalExpansionForLinearConstraint (PresolveContext *context) |
| Neighborhood | GenerateSchedulingNeighborhoodFromIntervalPrecedences (const absl::Span< const std::pair< int, int > > precedences, const CpSolverResponse &initial_solution, const NeighborhoodGeneratorHelper &helper) |
| Neighborhood | GenerateSchedulingNeighborhoodFromRelaxedIntervals (absl::Span< const int > intervals_to_relax, absl::Span< const int > variables_to_fix, const CpSolverResponse &initial_solution, absl::BitGenRef random, const NeighborhoodGeneratorHelper &helper) |
| void | LoadVariables (const CpModelProto &model_proto, bool view_all_booleans_as_integers, Model *m) |
| void | LoadBooleanSymmetries (const CpModelProto &model_proto, Model *m) |
| void | ExtractEncoding (const CpModelProto &model_proto, Model *m) |
| void | ExtractElementEncoding (const CpModelProto &model_proto, Model *m) |
| void | PropagateEncodingFromEquivalenceRelations (const CpModelProto &model_proto, Model *m) |
| void | DetectOptionalVariables (const CpModelProto &model_proto, Model *m) |
| void | AddFullEncodingFromSearchBranching (const CpModelProto &model_proto, Model *m) |
| void | LoadBoolOrConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadBoolAndConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadAtMostOneConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadExactlyOneConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadBoolXorConstraint (const ConstraintProto &ct, Model *m) |
| void | SplitAndLoadIntermediateConstraints (bool lb_required, bool ub_required, std::vector< IntegerVariable > *vars, std::vector< IntegerValue > *coeffs, Model *m) |
| void | LoadLinearConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadAllDiffConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadAlwaysFalseConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadIntProdConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadIntDivConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadIntModConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadLinMaxConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadNoOverlapConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadNoOverlap2dConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadCumulativeConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadReservoirConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadCircuitConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadRoutesConstraint (const ConstraintProto &ct, Model *m) |
| bool | LoadConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadIntMinConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadIntMaxConstraint (const ConstraintProto &ct, Model *m) |
| void | LoadCircuitCoveringConstraint (const ConstraintProto &ct, Model *m) |
| void | PostsolveClause (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | PostsolveExactlyOne (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | SetEnforcementLiteralToFalse (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | PostsolveLinear (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | PostsolveLinMax (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | PostsolveElement (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | PostsolveIntMod (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | PostsolveIntProd (const ConstraintProto &ct, std::vector< Domain > *domains) |
| void | PostsolveResponse (const int64_t num_variables_in_original_model, const CpModelProto &mapping_proto, absl::Span< const int > postsolve_mapping, std::vector< int64_t > *solution) |
| void | FillTightenedDomainInResponse (const CpModelProto &original_model, const CpModelProto &mapping_proto, absl::Span< const int > postsolve_mapping, absl::Span< const Domain > search_domains, CpSolverResponse *response, SolverLogger *logger) |
| Domain | EvaluateImpliedIntProdDomain (const LinearArgumentProto &expr, const PresolveContext &context) |
| CpSolverStatus | PresolveCpModel (PresolveContext *context, std::vector< int > *postsolve_mapping) |
| void | ApplyVariableMapping (absl::Span< int > mapping, CpModelProto *cp_model, std::vector< int > *reverse_mapping) |
| std::vector< std::pair< int, int > > | FindDuplicateConstraints (const CpModelProto &model_proto, bool ignore_enforcement) |
| std::function< BooleanOrIntegerLiteral()> | ConstructUserSearchStrategy (const CpModelProto &cp_model_proto, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | ConstructHeuristicSearchStrategy (const CpModelProto &cp_model_proto, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | ConstructIntegerCompletionSearchStrategy (absl::Span< const IntegerVariable > variable_mapping, IntegerVariable objective_var, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | ConstructHintSearchStrategy (const CpModelProto &cp_model_proto, CpModelMapping *mapping, Model *model) |
| void | ConstructFixedSearchStrategy (SearchHeuristics *h, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | InstrumentSearchStrategy (const CpModelProto &cp_model_proto, absl::Span< const IntegerVariable > variable_mapping, std::function< BooleanOrIntegerLiteral()> instrumented_strategy, Model *model) |
| absl::flat_hash_map< std::string, SatParameters > | GetNamedParameters (SatParameters base_params) |
| std::vector< SatParameters > | GetFullWorkerParameters (const SatParameters &base_params, const CpModelProto &cp_model, int num_already_present, SubsolverNameFilter *filter) |
| std::vector< SatParameters > | GetFirstSolutionBaseParams (const SatParameters &base_params) |
| std::vector< SatParameters > | RepeatParameters (absl::Span< const SatParameters > base_params, int num_params_to_generate) |
| std::string | CpSatSolverVersion () |
| Returns a string that describes the version of the solver. | |
| std::string | CpModelStats (const CpModelProto &model) |
| Returns a string with some statistics on the given CpModelProto. | |
| std::string | CpSolverResponseStats (const CpSolverResponse &response, bool has_objective) |
| std::function< void(Model *)> | NewFeasibleSolutionObserver (const std::function< void(const CpSolverResponse &response)> &callback) |
| std::function< void(Model *)> | NewFeasibleSolutionLogCallback (const std::function< std::string(const CpSolverResponse &response)> &callback) |
| std::function< void(Model *)> | NewBestBoundCallback (const std::function< void(double)> &callback) |
| std::function< SatParameters(Model *)> | NewSatParameters (absl::string_view params) |
| std::function< SatParameters(Model *)> | NewSatParameters (const sat::SatParameters ¶meters) |
| void | StopSearch (Model *model) |
| Stops the current search. | |
| CpSolverResponse | SolveCpModel (const CpModelProto &model_proto, Model *model) |
| CpSolverResponse | Solve (const CpModelProto &model_proto) |
| Solves the given CpModelProto and returns an instance of CpSolverResponse. | |
| CpSolverResponse | SolveWithParameters (const CpModelProto &model_proto, const SatParameters ¶ms) |
| Solves the given CpModelProto with the given parameters. | |
| CpSolverResponse | SolveWithParameters (const CpModelProto &model_proto, absl::string_view params) |
| void | LoadDebugSolution (const CpModelProto &model_proto, Model *model) |
| void | InitializeDebugSolution (const CpModelProto &model_proto, Model *model) |
| std::vector< int64_t > | GetSolutionValues (const CpModelProto &model_proto, const Model &model) |
| void | RegisterVariableBoundsLevelZeroExport (const CpModelProto &, SharedBoundsManager *shared_bounds_manager, Model *model) |
| void | RegisterVariableBoundsLevelZeroImport (const CpModelProto &model_proto, SharedBoundsManager *shared_bounds_manager, Model *model) |
| void | RegisterLinear2BoundsImport (SharedLinear2Bounds *shared_linear2_bounds, Model *model) |
| void | RegisterObjectiveBestBoundExport (IntegerVariable objective_var, SharedResponseManager *shared_response_manager, Model *model) |
| void | RegisterObjectiveBoundsImport (SharedResponseManager *shared_response_manager, Model *model) |
| void | RegisterClausesExport (int id, SharedClausesManager *shared_clauses_manager, Model *model) |
| int | RegisterClausesLevelZeroImport (int id, SharedClausesManager *shared_clauses_manager, Model *model) |
| void | LoadBaseModel (const CpModelProto &model_proto, Model *model) |
| void | LoadFeasibilityPump (const CpModelProto &model_proto, Model *model) |
| void | LoadCpModel (const CpModelProto &model_proto, Model *model) |
| void | SolveLoadedCpModel (const CpModelProto &model_proto, Model *model) |
| void | QuickSolveWithHint (const CpModelProto &model_proto, Model *model) |
| void | MinimizeL1DistanceWithHint (const CpModelProto &model_proto, Model *model) |
| void | PostsolveResponseWithFullSolver (int num_variables_in_original_model, CpModelProto mapping_proto, absl::Span< const int > postsolve_mapping, std::vector< int64_t > *solution) |
| void | PostsolveResponseWrapper (const SatParameters ¶ms, int num_variable_in_original_model, const CpModelProto &mapping_proto, absl::Span< const int > postsolve_mapping, std::vector< int64_t > *solution) |
| void | AdaptGlobalParameters (const CpModelProto &model_proto, Model *model) |
| void | FindCpModelSymmetries (const SatParameters ¶ms, const CpModelProto &problem, std::vector< std::unique_ptr< SparsePermutation > > *generators, SolverLogger *logger, TimeLimit *solver_time_limit) |
| void | DetectAndAddSymmetryToProto (const SatParameters ¶ms, CpModelProto *proto, SolverLogger *logger, TimeLimit *time_limit) |
| bool | DetectAndExploitSymmetriesInPresolve (PresolveContext *context) |
| bool | FilterOrbitOnUnusedOrFixedVariables (SymmetryProto *symmetry, PresolveContext *context) |
| void | CanonicalizeTable (PresolveContext *context, ConstraintProto *ct) |
| void | CompressTuples (absl::Span< const int64_t > domain_sizes, std::vector< std::vector< int64_t > > *tuples) |
| std::vector< std::vector< absl::InlinedVector< int64_t, 2 > > > | FullyCompressTuples (absl::Span< const int64_t > domain_sizes, std::vector< std::vector< int64_t > > *tuples) |
| void | PropagateAutomaton (const AutomatonConstraintProto &proto, const PresolveContext &context, std::vector< absl::flat_hash_set< int64_t > > *states, std::vector< absl::flat_hash_set< int64_t > > *labels) |
| CpModelProto | Random3SatProblem (int num_variables, double proportion_of_constraints) |
| CpModelProto | RandomLinearProblem (int num_variables, int num_constraints) |
| int64_t | LinearExpressionGcd (const LinearExpressionProto &expr, int64_t gcd) |
| void | DivideLinearExpression (int64_t divisor, LinearExpressionProto *expr) |
| void | SetToNegatedLinearExpression (const LinearExpressionProto &input_expr, LinearExpressionProto *output_negated_expr) |
| IndexReferences | GetReferencesUsedByConstraint (const ConstraintProto &ct) |
| void | GetReferencesUsedByConstraint (const ConstraintProto &ct, std::vector< int > *variables, std::vector< int > *literals) |
| void | ApplyToAllLiteralIndices (absl::FunctionRef< void(int *)> f, ConstraintProto *ct) |
| void | ApplyToAllVariableIndices (absl::FunctionRef< void(int *)> f, ConstraintProto *ct) |
| void | ApplyToAllIntervalIndices (absl::FunctionRef< void(int *)> f, ConstraintProto *ct) |
| absl::string_view | ConstraintCaseName (ConstraintProto::ConstraintCase constraint_case) |
| std::vector< int > | UsedVariables (const ConstraintProto &ct) |
| std::vector< int > | UsedIntervals (const ConstraintProto &ct) |
| int64_t | ComputeInnerObjective (const CpObjectiveProto &objective, absl::Span< const int64_t > solution) |
| bool | ExpressionContainsSingleRef (const LinearExpressionProto &expr) |
| bool | ExpressionIsAffine (const LinearExpressionProto &expr) |
| int | GetSingleRefFromExpression (const LinearExpressionProto &expr) |
| void | AddLinearExpressionToLinearConstraint (const LinearExpressionProto &expr, int64_t coefficient, LinearConstraintProto *linear) |
| void | AddWeightedLiteralToLinearConstraint (int lit, int64_t coeff, LinearConstraintProto *linear, int64_t *offset) |
| void | LiteralsToLinear (absl::Span< const int > literals, int64_t lb, int64_t ub, LinearConstraintProto *linear) |
| bool | SafeAddLinearExpressionToLinearConstraint (const LinearExpressionProto &expr, int64_t coefficient, LinearConstraintProto *linear) |
| bool | LinearExpressionProtosAreEqual (const LinearExpressionProto &a, const LinearExpressionProto &b, int64_t b_scaling) |
| uint64_t | FingerprintExpression (const LinearExpressionProto &lin, uint64_t seed) |
| uint64_t | FingerprintModel (const CpModelProto &model, uint64_t seed) |
| void | SetupTextFormatPrinter (google::protobuf::TextFormat::Printer *printer) |
| bool | ConvertCpModelProtoToCnf (const CpModelProto &cp_model, std::string *out) |
| bool | ConvertCpModelProtoToWCnf (const CpModelProto &cp_model, std::string *out) |
| int | CombineSeed (int base_seed, int64_t delta) |
| bool | IsAffineIntAbs (const ConstraintProto &ct) |
| int | NegatedRef (int ref) |
| int | PositiveRef (int ref) |
| bool | RefIsPositive (int ref) |
| bool | HasEnforcementLiteral (const ConstraintProto &ct) |
| int | EnforcementLiteral (const ConstraintProto &ct) |
| void | InsertVariablesFromInterval (const CpModelProto &model_proto, int index, Bitset64< int > &output) |
| void | RemoveVariablesFromInterval (const CpModelProto &model_proto, int index, Bitset64< int > &output) |
| template<typename ProtoWithDomain> | |
| bool | DomainInProtoContains (const ProtoWithDomain &proto, int64_t value) |
| template<typename ProtoWithDomain> | |
| void | FillDomainInProto (const Domain &domain, ProtoWithDomain *proto) |
| template<typename ProtoWithDomain> | |
| void | FillDomainInProto (int64_t lb, int64_t ub, ProtoWithDomain *proto) |
| template<typename ProtoWithDomain> | |
| void | FillDomainInProto (int64_t value, ProtoWithDomain *proto) |
| template<typename ProtoWithDomain> | |
| Domain | ReadDomainFromProto (const ProtoWithDomain &proto) |
| template<typename ProtoWithDomain> | |
| std::vector< int64_t > | AllValuesInDomain (const ProtoWithDomain &proto) |
| double | ScaleObjectiveValue (const CpObjectiveProto &proto, int64_t value) |
| int64_t | ScaleInnerObjectiveValue (const CpObjectiveProto &proto, int64_t value) |
| double | UnscaleObjectiveValue (const CpObjectiveProto &proto, double value) |
| int64_t | AffineExpressionValueAt (const LinearExpressionProto &expr, int64_t value) |
| int64_t | GetInnerVarValue (const LinearExpressionProto &expr, int64_t value) |
| bool | AffineExpressionContainsVar (const LinearExpressionProto &expr, int var) |
| template<class ExpressionList> | |
| bool | ExpressionsContainsOnlyOneVar (const ExpressionList &exprs) |
| template<class T> | |
| uint64_t | FingerprintRepeatedField (const google::protobuf::RepeatedField< T > &sequence, uint64_t seed) |
| template<class T> | |
| uint64_t | FingerprintSingleField (const T &field, uint64_t seed) |
| template<class M> | |
| bool | WriteModelProtoToFile (const M &proto, absl::string_view filename) |
| bool | operator== (const BoolArgumentProto &lhs, const BoolArgumentProto &rhs) |
| template<typename H> | |
| H | AbslHashValue (H h, const BoolArgumentProto &m) |
| bool | operator== (const LinearConstraintProto &lhs, const LinearConstraintProto &rhs) |
| template<typename H> | |
| H | AbslHashValue (H h, const LinearConstraintProto &m) |
| std::function< void(Model *)> | Cumulative (const std::vector< Literal > &enforcement_literals, const std::vector< IntervalVariable > &vars, absl::Span< const AffineExpression > demands, AffineExpression capacity, SchedulingConstraintHelper *helper) |
| std::function< void(Model *)> | CumulativeTimeDecomposition (absl::Span< const Literal > enforcement_literals, absl::Span< const IntervalVariable > vars, absl::Span< const AffineExpression > demands, AffineExpression capacity, SchedulingConstraintHelper *) |
| std::function< void(Model *)> | CumulativeUsingReservoir (absl::Span< const Literal > enforcement_literals, absl::Span< const IntervalVariable > vars, absl::Span< const AffineExpression > demands, AffineExpression capacity, SchedulingConstraintHelper *) |
| void | AddCumulativeOverloadChecker (AffineExpression capacity, SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands, Model *model) |
| void | AddCumulativeOverloadCheckerDff (AffineExpression capacity, SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands, Model *model) |
| IntegerValue | GetFactorT (IntegerValue rhs_remainder, IntegerValue divisor, IntegerValue max_magnitude) |
| std::function< IntegerValue(IntegerValue)> | GetSuperAdditiveRoundingFunction (IntegerValue rhs_remainder, IntegerValue divisor, IntegerValue t, IntegerValue max_scaling) |
| std::function< IntegerValue(IntegerValue)> | GetSuperAdditiveStrengtheningFunction (IntegerValue positive_rhs, IntegerValue min_magnitude) |
| std::function< IntegerValue(IntegerValue)> | GetSuperAdditiveStrengtheningMirFunction (IntegerValue positive_rhs, IntegerValue scaling) |
| CutGenerator | CreatePositiveMultiplicationCutGenerator (AffineExpression z, AffineExpression x, AffineExpression y, int linearization_level, Model *model) |
| LinearConstraint | ComputeHyperplanAboveSquare (AffineExpression x, AffineExpression square, IntegerValue x_lb, IntegerValue x_ub, Model *model) |
| LinearConstraint | ComputeHyperplanBelowSquare (AffineExpression x, AffineExpression square, IntegerValue x_value, Model *model) |
| CutGenerator | CreateSquareCutGenerator (AffineExpression y, AffineExpression x, int linearization_level, Model *model) |
| CutGenerator | CreateAllDifferentCutGenerator (absl::Span< const AffineExpression > exprs, Model *model) |
| CutGenerator | CreateLinMaxCutGenerator (const IntegerVariable target, absl::Span< const LinearExpression > exprs, absl::Span< const IntegerVariable > z_vars, Model *model) |
| bool | BuildMaxAffineUpConstraint (const LinearExpression &target, IntegerVariable var, absl::Span< const std::pair< IntegerValue, IntegerValue > > affines, Model *model, LinearConstraintBuilder *builder) |
| CutGenerator | CreateMaxAffineCutGenerator (LinearExpression target, IntegerVariable var, std::vector< std::pair< IntegerValue, IntegerValue > > affines, const std::string cut_name, Model *model) |
| CutGenerator | CreateCliqueCutGenerator (absl::Span< const IntegerVariable > base_variables, Model *model) |
| std::function< IntegerValue(IntegerValue)> | ExtendNegativeFunction (std::function< IntegerValue(IntegerValue)> base_f, IntegerValue period) |
| void | AddNonOverlappingRectangles (const std::vector< Literal > &enforcement_literals, const std::vector< IntervalVariable > &x, const std::vector< IntervalVariable > &y, Model *model) |
| void | GenerateNoOverlap2dEnergyCut (absl::Span< const std::vector< LiteralValueValue > > energies, absl::Span< const int > rectangles, absl::string_view cut_name, Model *model, LinearConstraintManager *manager, SchedulingConstraintHelper *x_helper, SchedulingConstraintHelper *y_helper, SchedulingDemandHelper *y_demands_helper) |
| CutGenerator | CreateNoOverlap2dEnergyCutGenerator (NoOverlap2DConstraintHelper *helper, Model *model) |
| void | GenerateNoOvelap2dCompletionTimeCuts (absl::string_view cut_name, std::vector< DiffnCtEvent > events, bool use_lifting, Model *model, LinearConstraintManager *manager) |
| CutGenerator | CreateNoOverlap2dCompletionTimeCutGenerator (NoOverlap2DConstraintHelper *helper, Model *model) |
| CompactVectorVector< int > | GetOverlappingRectangleComponents (absl::Span< const Rectangle > rectangles) |
| bool | ReportEnergyConflict (Rectangle bounding_box, absl::Span< const int > boxes, SchedulingConstraintHelper *x, SchedulingConstraintHelper *y) |
| bool | BoxesAreInEnergyConflict (absl::Span< const Rectangle > rectangles, absl::Span< const IntegerValue > energies, absl::Span< const int > boxes, Rectangle *conflict) |
| bool | AnalyzeIntervals (bool transpose, absl::Span< const int > local_boxes, absl::Span< const Rectangle > rectangles, absl::Span< const IntegerValue > rectangle_energies, IntegerValue *x_threshold, IntegerValue *y_threshold, Rectangle *conflict) |
| absl::Span< int > | FilterBoxesAndRandomize (absl::Span< const Rectangle > cached_rectangles, absl::Span< int > boxes, IntegerValue threshold_x, IntegerValue threshold_y, absl::BitGenRef random) |
| absl::Span< int > | FilterBoxesThatAreTooLarge (absl::Span< const Rectangle > cached_rectangles, absl::Span< const IntegerValue > energies, absl::Span< int > boxes) |
| void | ConstructOverlappingSets (absl::Span< IndexedInterval > intervals, CompactVectorVector< int > *result, absl::Span< const int > order) |
| void | GetOverlappingIntervalComponents (std::vector< IndexedInterval > *intervals, std::vector< std::vector< int > > *components) |
| std::vector< int > | GetIntervalArticulationPoints (std::vector< IndexedInterval > *intervals) |
| void | AppendPairwiseRestrictions (absl::Span< const ItemWithVariableSize > items, std::vector< PairwiseRestriction > *result) |
| void | AppendPairwiseRestrictions (absl::Span< const ItemWithVariableSize > items, absl::Span< const ItemWithVariableSize > other_items, std::vector< PairwiseRestriction > *result) |
| IntegerValue | Smallest1DIntersection (IntegerValue range_min, IntegerValue range_max, IntegerValue size, IntegerValue interval_min, IntegerValue interval_max) |
| FindRectanglesResult | FindRectanglesWithEnergyConflictMC (const std::vector< RectangleInRange > &intervals, absl::BitGenRef random, double temperature, double candidate_energy_usage_factor) |
| std::string | RenderDot (std::optional< Rectangle > bb, absl::Span< const Rectangle > solution, std::string_view extra_dot_payload) |
| std::vector< Rectangle > | FindEmptySpaces (const Rectangle &bounding_box, std::vector< Rectangle > ocupied_rectangles) |
| std::vector< Rectangle > | PavedRegionDifference (std::vector< Rectangle > original_region, absl::Span< const Rectangle > area_to_remove) |
| std::vector< std::pair< int, int > > | FindPartialRectangleIntersectionsImpl (absl::Span< const Rectangle32 > rectangles, int32_t y_max) |
| std::vector< std::pair< int, int > > | FindPartialRectangleIntersections (absl::Span< const Rectangle > rectangles) |
| std::optional< std::pair< int, int > > | FindOneIntersectionIfPresent (absl::Span< const Rectangle > rectangles) |
| std::optional< std::pair< int, int > > | FindOneIntersectionIfPresentWithZeroArea (absl::Span< const Rectangle > rectangles) |
| double | CenterToCenterL2Distance (const Rectangle &a, const Rectangle &b) |
| double | CenterToCenterLInfinityDistance (const Rectangle &a, const Rectangle &b) |
| bool | RegionIncludesOther (absl::Span< const Rectangle > region, absl::Span< const Rectangle > other) |
| void | ReduceModuloBasis (absl::Span< const std::vector< absl::int128 > > basis, const int elements_to_consider, std::vector< absl::int128 > &v) |
| std::vector< int > | GreedyFastDecreasingGcd (const absl::Span< const int64_t > coeffs) |
| DiophantineSolution | SolveDiophantine (absl::Span< const int64_t > coeffs, int64_t rhs, absl::Span< const int64_t > var_lbs, absl::Span< const int64_t > var_ubs) |
| floor (|P|/2)< | |
| void | AddDisjunctive (const std::vector< Literal > &enforcement_literals, const std::vector< IntervalVariable > &intervals, Model *model) |
| void | AddDisjunctiveWithBooleanPrecedencesOnly (absl::Span< const IntervalVariable > intervals, Model *model) |
| bool | ContainsLiteral (absl::Span< const Literal > clause, Literal literal) |
| bool | Resolve (absl::Span< const Literal > clause, absl::Span< const Literal > other_clause, Literal complementary_literal, VariablesAssignment *assignment, std::vector< Literal > *resolvent) |
| bool | AddProblemClauses (const std::string &file_path, DratChecker *drat_checker) |
| bool | AddInferredAndDeletedClauses (const std::string &file_path, DratChecker *drat_checker) |
| bool | PrintClauses (const std::string &file_path, SatFormat format, absl::Span< const std::vector< Literal > > clauses, int num_variables) |
| DEFINE_STRONG_INDEX_TYPE (ClauseIndex) | |
| const ClauseIndex | kNoClauseIndex (-1) |
| EncodingNode | LazyMerge (EncodingNode *a, EncodingNode *b, SatSolver *solver) |
| void | IncreaseNodeSize (EncodingNode *node, SatSolver *solver) |
| EncodingNode | FullMerge (Coefficient upper_bound, EncodingNode *a, EncodingNode *b, SatSolver *solver) |
| EncodingNode * | MergeAllNodesWithDeque (Coefficient upper_bound, const std::vector< EncodingNode * > &nodes, SatSolver *solver, std::deque< EncodingNode > *repository) |
| EncodingNode * | LazyMergeAllNodeWithPQAndIncreaseLb (Coefficient weight, const std::vector< EncodingNode * > &nodes, SatSolver *solver, std::deque< EncodingNode > *repository) |
| void | ReduceNodes (Coefficient upper_bound, Coefficient *lower_bound, std::vector< EncodingNode * > *nodes, SatSolver *solver) |
| std::vector< Literal > | ExtractAssumptions (Coefficient stratified_lower_bound, const std::vector< EncodingNode * > &nodes, SatSolver *solver) |
| Coefficient | ComputeCoreMinWeight (const std::vector< EncodingNode * > &nodes, absl::Span< const Literal > core) |
| Coefficient | MaxNodeWeightSmallerThan (const std::vector< EncodingNode * > &nodes, Coefficient upper_bound) |
| std::ostream & | operator<< (std::ostream &os, const EnforcementStatus &e) |
| DEFINE_STRONG_INDEX_TYPE (EnforcementId) | |
| SmallBitset | GetNumBitsAtOne (int num_bits) |
| template<typename VarOrLiteral> | |
| void | CanonicalizeTruthTable (absl::Span< VarOrLiteral > key, SmallBitset &bitmask) |
| void | FillKeyAndBitmask (absl::Span< const Literal > clause, absl::Span< BooleanVariable > key, SmallBitset &bitmask) |
| bool | IsFunction (int i, int num_bits, SmallBitset truth_table) |
| int | AddHoleAtPosition (int i, int bitset) |
| int | RemoveFixedInput (int i, bool at_true, absl::Span< LiteralIndex > inputs, int &int_function_values) |
| int | CanonicalizeFunctionTruthTable (LiteralIndex &target, absl::Span< LiteralIndex > inputs, int &int_function_values) |
| std::vector< LiteralValueValue > | TryToReconcileEncodings (const AffineExpression &size2_affine, const AffineExpression &affine, absl::Span< const ValueLiteralPair > affine_var_encoding, bool put_affine_left_in_result, IntegerEncoder *integer_encoder) |
| std::vector< LiteralValueValue > | TryToReconcileSize2Encodings (const AffineExpression &left, const AffineExpression &right, IntegerEncoder *integer_encoder) |
| template<typename Storage> | |
| InclusionDetector (const Storage &storage) -> InclusionDetector< Storage > | |
| template<typename Storage> | |
| SubsetsDetector (const Storage &storage) -> SubsetsDetector< Storage > | |
| std::pair< uint64_t, int > | ComputeSignatureAndMaxElement (absl::Span< const int > elements) |
| std::vector< IntegerVariable > | NegationOf (absl::Span< const IntegerVariable > vars) |
| std::ostream & | operator<< (std::ostream &os, const ValueLiteralPair &p) |
| DEFINE_STRONG_INDEX_TYPE (ReasonIndex) | |
| std::function< BooleanVariable(Model *)> | NewBooleanVariable () |
| std::function< IntegerVariable(Model *)> | ConstantIntegerVariable (int64_t value) |
| std::function< IntegerVariable(Model *)> | NewIntegerVariable (int64_t lb, int64_t ub) |
| std::function< IntegerVariable(Model *)> | NewIntegerVariable (const Domain &domain) |
| IntegerVariable | CreateNewIntegerVariableFromLiteral (Literal lit, Model *model) |
| std::function< IntegerVariable(Model *)> | NewIntegerVariableFromLiteral (Literal lit) |
| std::function< int64_t(const Model &)> | LowerBound (IntegerVariable v) |
| std::function< int64_t(const Model &)> | UpperBound (IntegerVariable v) |
| std::function< bool(const Model &)> | IsFixed (IntegerVariable v) |
| std::function< int64_t(const Model &)> | Value (IntegerVariable v) |
| std::function< void(Model *)> | GreaterOrEqual (IntegerVariable v, int64_t lb) |
| std::function< void(Model *)> | LowerOrEqual (IntegerVariable v, int64_t ub) |
| std::function< void(Model *)> | Equality (IntegerVariable v, int64_t value) |
| std::function< void(Model *)> | Implication (absl::Span< const Literal > enforcement_literals, IntegerLiteral i) |
| std::function< void(Model *)> | ImpliesInInterval (Literal in_interval, IntegerVariable v, int64_t lb, int64_t ub) |
| std::function< std::vector< ValueLiteralPair >(Model *)> | FullyEncodeVariable (IntegerVariable var) |
| DEFINE_STRONG_INT64_TYPE (IntegerValue) | |
| constexpr IntegerValue | kMaxIntegerValue (std::numeric_limits< IntegerValue::ValueType >::max() - 1) |
| constexpr IntegerValue | kMinIntegerValue (-kMaxIntegerValue.value()) |
| double | ToDouble (IntegerValue value) |
| template<class IntType> | |
| IntType | IntTypeAbs (IntType t) |
| IntegerValue | CeilRatio (IntegerValue dividend, IntegerValue positive_divisor) |
| IntegerValue | FloorRatio (IntegerValue dividend, IntegerValue positive_divisor) |
| IntegerValue | FloorRatioWithTest (IntegerValue dividend, IntegerValue positive_divisor) |
| IntegerValue | CapProdI (IntegerValue a, IntegerValue b) |
| IntegerValue | CapSubI (IntegerValue a, IntegerValue b) |
| IntegerValue | CapAddI (IntegerValue a, IntegerValue b) |
| bool | ProdOverflow (IntegerValue t, IntegerValue value) |
| bool | AtMinOrMaxInt64I (IntegerValue t) |
| IntegerValue | PositiveRemainder (IntegerValue dividend, IntegerValue positive_divisor) |
| bool | AddTo (IntegerValue a, IntegerValue *result) |
| bool | AddProductTo (IntegerValue a, IntegerValue b, IntegerValue *result) |
| bool | AddSquareTo (IntegerValue a, IntegerValue *result) |
| DEFINE_STRONG_INDEX_TYPE (IntegerVariable) | |
| const IntegerVariable | kNoIntegerVariable (-1) |
| IntegerVariable | NegationOf (IntegerVariable i) |
| bool | VariableIsPositive (IntegerVariable i) |
| IntegerVariable | PositiveVariable (IntegerVariable i) |
| DEFINE_STRONG_INDEX_TYPE (PositiveOnlyIndex) | |
| PositiveOnlyIndex | GetPositiveOnlyIndex (IntegerVariable var) |
| std::string | IntegerTermDebugString (IntegerVariable var, IntegerValue coeff) |
| std::ostream & | operator<< (std::ostream &os, IntegerLiteral i_lit) |
| std::ostream & | operator<< (std::ostream &os, absl::Span< const IntegerLiteral > literals) |
| template<typename H> | |
| H | AbslHashValue (H h, const AffineExpression &e) |
| std::pair< LinearExpression2, IntegerValue > | EncodeDifferenceLowerThan (AffineExpression a, AffineExpression b, IntegerValue ub) |
| template<typename H> | |
| H | AbslHashValue (H h, const LinearExpression2 &e) |
| DEFINE_STRONG_INDEX_TYPE (IntervalVariable) | |
| const IntervalVariable | kNoIntervalVariable (-1) |
| void | AddWeightedSumLowerOrEqual (absl::Span< const Literal > enforcement_literals, absl::Span< const IntegerVariable > vars, absl::Span< const IntegerValue > coefficients, int64_t upper_bound, Model *model) |
| void | AddWeightedSumGreaterOrEqual (absl::Span< const Literal > enforcement_literals, absl::Span< const IntegerVariable > vars, absl::Span< const IntegerValue > coefficients, int64_t lower_bound, Model *model) |
| template<typename VectorInt> | |
| std::function< void(Model *)> | WeightedSumLowerOrEqual (absl::Span< const IntegerVariable > vars, const VectorInt &coefficients, int64_t upper_bound) |
| template<typename VectorInt> | |
| std::function< void(Model *)> | WeightedSumGreaterOrEqual (absl::Span< const IntegerVariable > vars, const VectorInt &coefficients, int64_t lower_bound) |
| template<typename VectorInt> | |
| std::function< void(Model *)> | FixedWeightedSum (absl::Span< const IntegerVariable > vars, const VectorInt &coefficients, int64_t value) |
| std::function< void(Model *)> | ConditionalWeightedSumLowerOrEqual (absl::Span< const Literal > enforcement_literals, absl::Span< const IntegerVariable > vars, absl::Span< const int64_t > coefficients, int64_t upper_bound) |
| std::function< void(Model *)> | ConditionalWeightedSumGreaterOrEqual (absl::Span< const Literal > enforcement_literals, absl::Span< const IntegerVariable > vars, absl::Span< const int64_t > coefficients, int64_t upper_bound) |
| void | LoadConditionalLinearConstraint (const absl::Span< const Literal > enforcement_literals, const LinearConstraint &cst, Model *model) |
| void | LoadLinearConstraint (const LinearConstraint &cst, Model *model) |
| void | AddConditionalAffinePrecedence (const absl::Span< const Literal > enforcement_literals, AffineExpression left, AffineExpression right, Model *model) |
| template<typename VectorInt> | |
| std::function< IntegerVariable(Model *)> | NewWeightedSum (const VectorInt &coefficients, const std::vector< IntegerVariable > &vars) |
| void | AddIsEqualToMinOf (const absl::Span< const Literal > enforcement_literals, const LinearExpression &min_expr, std::vector< LinearExpression > exprs, Model *model) |
| std::function< void(Model *)> | IsEqualToMinOf (const LinearExpression &min_expr, const std::vector< LinearExpression > &exprs) |
| std::function< void(Model *)> | ProductConstraint (absl::Span< const Literal > enforcement_literals, AffineExpression a, AffineExpression b, AffineExpression p) |
| std::function< void(Model *)> | DivisionConstraint (absl::Span< const Literal > enforcement_literals, AffineExpression num, AffineExpression denom, AffineExpression div) |
| std::function< void(Model *)> | FixedDivisionConstraint (absl::Span< const Literal > enforcement_literals, AffineExpression a, IntegerValue b, AffineExpression c) |
| std::function< void(Model *)> | FixedModuloConstraint (absl::Span< const Literal > enforcement_literals, AffineExpression a, IntegerValue b, AffineExpression c) |
| IntegerLiteral | AtMinValue (IntegerVariable var, IntegerTrail *integer_trail) |
| IntegerLiteral | ChooseBestObjectiveValue (IntegerVariable var, IntegerTrail *integer_trail, ObjectiveDefinition *objective_definition) |
| IntegerLiteral | GreaterOrEqualToMiddleValue (IntegerVariable var, IntegerTrail *integer_trail) |
| IntegerLiteral | SplitAroundGivenValue (IntegerVariable var, IntegerValue value, Model *model) |
| IntegerLiteral | SplitAroundLpValue (IntegerVariable var, Model *model) |
| IntegerLiteral | SplitUsingBestSolutionValueInRepository (IntegerVariable var, const SharedSolutionRepository< int64_t > &solution_repo, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | FirstUnassignedVarAtItsMinHeuristic (absl::Span< const IntegerVariable > vars, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | MostFractionalHeuristic (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | BoolPseudoCostHeuristic (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | LpPseudoCostHeuristic (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | UnassignedVarWithLowestMinAtItsMinHeuristic (absl::Span< const IntegerVariable > vars, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | SequentialSearch (std::vector< std::function< BooleanOrIntegerLiteral()> > heuristics) |
| std::function< BooleanOrIntegerLiteral()> | SequentialValueSelection (std::vector< std::function< IntegerLiteral(IntegerVariable)> > value_selection_heuristics, std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model) |
| bool | LinearizedPartIsLarge (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | IntegerValueSelectionHeuristic (std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | SatSolverHeuristic (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | ShaveObjectiveLb (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | PseudoCost (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | SchedulingSearchHeuristic (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | DisjunctivePrecedenceSearchHeuristic (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | CumulativePrecedenceSearchHeuristic (Model *model) |
| std::function< BooleanOrIntegerLiteral()> | RandomizeOnRestartHeuristic (bool lns_mode, Model *model) |
| std::function< BooleanOrIntegerLiteral()> | FollowHint (absl::Span< const BooleanOrIntegerVariable > vars, absl::Span< const IntegerValue > values, Model *model) |
| std::function< bool()> | RestartEveryKFailures (int k, SatSolver *solver) |
| std::function< bool()> | SatSolverRestartPolicy (Model *model) |
| void | ConfigureSearchHeuristics (Model *model) |
| std::vector< std::function< BooleanOrIntegerLiteral()> > | CompleteHeuristics (absl::Span< const std::function< BooleanOrIntegerLiteral()> > incomplete_heuristics, const std::function< BooleanOrIntegerLiteral()> &completion_heuristic) |
| SatSolver::Status | ResetAndSolveIntegerProblem (const std::vector< Literal > &assumptions, Model *model) |
| SatSolver::Status | SolveIntegerProblemWithLazyEncoding (Model *model) |
| IntegerLiteral | SplitDomainUsingBestSolutionValue (IntegerVariable var, Model *model) |
| std::function< int64_t(const Model &)> | MinSize (IntervalVariable v) |
| std::function< int64_t(const Model &)> | MaxSize (IntervalVariable v) |
| std::function< bool(const Model &)> | IsOptional (IntervalVariable v) |
| std::function< Literal(const Model &)> | IsPresentLiteral (IntervalVariable v) |
| std::function< IntervalVariable(Model *)> | NewInterval (int64_t min_start, int64_t max_end, int64_t size) |
| std::function< IntervalVariable(Model *)> | NewInterval (IntegerVariable start, IntegerVariable end, IntegerVariable size) |
| std::function< IntervalVariable(Model *)> | NewIntervalWithVariableSize (int64_t min_start, int64_t max_end, int64_t min_size, int64_t max_size) |
| std::function< IntervalVariable(Model *)> | NewOptionalInterval (int64_t min_start, int64_t max_end, int64_t size, Literal is_present) |
| std::function< IntervalVariable(Model *)> | NewOptionalInterval (IntegerVariable start, IntegerVariable end, IntegerVariable size, Literal is_present) |
| std::function< IntervalVariable(Model *)> | NewOptionalIntervalWithVariableSize (int64_t min_start, int64_t max_end, int64_t min_size, int64_t max_size, Literal is_present) |
| void | AppendVariablesFromCapacityAndDemands (const AffineExpression &capacity, SchedulingDemandHelper *demands_helper, Model *model, std::vector< IntegerVariable > *vars) |
| double | ComputeActivity (const LinearConstraint &constraint, const util_intops::StrongVector< IntegerVariable, double > &values) |
| double | ComputeL2Norm (const LinearConstraint &ct) |
| IntegerValue | ComputeInfinityNorm (const LinearConstraint &ct) |
| double | ScalarProduct (const LinearConstraint &ct1, const LinearConstraint &ct2) |
| void | DivideByGCD (LinearConstraint *constraint) |
| void | MakeAllVariablesPositive (LinearConstraint *constraint) |
| bool | NoDuplicateVariable (const LinearConstraint &ct) |
| LinearExpression | CanonicalizeExpr (const LinearExpression &expr) |
| bool | ValidateLinearConstraintForOverflow (const LinearConstraint &constraint, const IntegerTrail &integer_trail) |
| LinearExpression | NegationOf (const LinearExpression &expr) |
| LinearExpression | PositiveVarExpr (const LinearExpression &expr) |
| IntegerValue | GetCoefficient (const IntegerVariable var, const LinearExpression &expr) |
| IntegerValue | GetCoefficientOfPositiveVar (const IntegerVariable var, const LinearExpression &expr) |
| bool | PossibleOverflow (const IntegerTrail &integer_trail, const LinearConstraint &constraint) |
| std::ostream & | operator<< (std::ostream &os, const LinearConstraint &ct) |
| void | CleanTermsAndFillConstraint (std::vector< std::pair< IntegerVariable, IntegerValue > > *terms, LinearExpression *output) |
| void | CleanTermsAndFillConstraint (std::vector< std::pair< IntegerVariable, IntegerValue > > *terms, LinearConstraint *output) |
| bool | MergePositiveVariableTermsAndCheckForOverflow (std::vector< std::pair< IntegerVariable, IntegerValue > > *terms, LinearConstraint *output) |
| void | AppendRelaxationForEqualityEncoding (IntegerVariable var, const Model &model, LinearRelaxation *relaxation, int *num_tight, int *num_loose) |
| void | AppendPartialGreaterThanEncodingRelaxation (IntegerVariable var, const Model &model, LinearRelaxation *relaxation) |
| void | AppendBoolOrRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AppendBoolAndRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation, ActivityBoundHelper *activity_helper) |
| void | AppendAtMostOneRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AppendExactlyOneRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| std::vector< Literal > | CreateAlternativeLiteralsWithView (int num_literals, Model *model, LinearRelaxation *relaxation) |
| void | AppendCircuitRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AppendRoutesRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AddCircuitCutGenerator (const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation) |
| void | AddRoutesCutGenerator (const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation) |
| std::optional< int > | DetectMakespan (absl::Span< const IntervalVariable > intervals, absl::Span< const AffineExpression > demands, const AffineExpression &capacity, Model *model) |
| void | AppendNoOverlapRelaxationAndCutGenerator (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AppendCumulativeRelaxationAndCutGenerator (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AddCumulativeRelaxation (const AffineExpression &capacity, SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands_helper, const std::optional< AffineExpression > &makespan, Model *model, LinearRelaxation *relaxation) |
| void | AppendNoOverlap2dRelaxationForComponent (absl::Span< const int > component, Model *model, NoOverlap2DConstraintHelper *no_overlap_helper, LinearConstraintManager *manager, ProductDecomposer *product_decomposer) |
| void | AppendNoOverlap2dRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AppendLinMaxRelaxationPart1 (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation, ActivityBoundHelper *activity_helper) |
| void | AppendMaxAffineRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation, ActivityBoundHelper *activity_helper) |
| void | AddMaxAffineCutGenerator (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation) |
| void | AppendLinMaxRelaxationPart2 (IntegerVariable target, absl::Span< const Literal > alternative_literals, absl::Span< const LinearExpression > exprs, Model *model, LinearRelaxation *relaxation) |
| void | AppendLinearConstraintRelaxation (const ConstraintProto &ct, Model *model, LinearRelaxation *relaxation, ActivityBoundHelper *activity_helper) |
| void | AppendLinearConstraintRelaxation (absl::Span< const int > enforcement, LinearConstraint &&linear_constraint, Model *model, LinearRelaxation *relaxation, ActivityBoundHelper *activity_helper) |
| void | TryToLinearizeConstraint (const CpModelProto &, const ConstraintProto &ct, int linearization_level, Model *model, LinearRelaxation *relaxation, ActivityBoundHelper *activity_helper) |
| void | AddIntProdCutGenerator (const ConstraintProto &ct, int linearization_level, Model *m, LinearRelaxation *relaxation) |
| void | AppendSquareRelaxation (const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation) |
| void | AddSquareCutGenerator (const ConstraintProto &ct, int linearization_level, Model *m, LinearRelaxation *relaxation) |
| void | AddAllDiffRelaxationAndCutGenerator (const ConstraintProto &ct, int linearization_level, Model *m, LinearRelaxation *relaxation) |
| bool | IntervalIsVariable (const IntervalVariable interval, IntervalsRepository *intervals_repository) |
| void | AddCumulativeCutGenerator (const AffineExpression &capacity, SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands_helper, const std::optional< AffineExpression > &makespan, Model *m, LinearRelaxation *relaxation) |
| void | AddNoOverlapCutGenerator (SchedulingConstraintHelper *helper, const std::optional< AffineExpression > &makespan, Model *m, LinearRelaxation *relaxation) |
| void | AddNoOverlap2dCutGenerator (const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation) |
| void | AddLinMaxCutGenerator (const ConstraintProto &ct, Model *m, LinearRelaxation *relaxation) |
| void | AppendElementEncodingRelaxation (Model *m, LinearRelaxation *relaxation) |
| LinearRelaxation | ComputeLinearRelaxation (const CpModelProto &model_proto, Model *m) |
| std::vector< double > | ScaleContinuousVariables (double scaling, double max_bound, MPModelProto *mp_model) |
| int64_t | FindRationalFactor (double x, int64_t limit, double tolerance) |
| bool | MakeBoundsOfIntegerVariablesInteger (const SatParameters ¶ms, MPModelProto *mp_model, SolverLogger *logger) |
| void | ChangeLargeBoundsToInfinity (double max_magnitude, MPModelProto *mp_model, SolverLogger *logger) |
| void | RemoveNearZeroTerms (const SatParameters ¶ms, MPModelProto *mp_model, SolverLogger *logger) |
| bool | MPModelProtoValidationBeforeConversion (const SatParameters ¶ms, const MPModelProto &mp_model, SolverLogger *logger) |
| std::vector< double > | DetectImpliedIntegers (MPModelProto *mp_model, SolverLogger *logger) |
| double | FindBestScalingAndComputeErrors (absl::Span< const double > coefficients, absl::Span< const double > lower_bounds, absl::Span< const double > upper_bounds, int64_t max_absolute_activity, double wanted_absolute_activity_precision, double *relative_coeff_error, double *scaled_sum_error) |
| bool | ConvertMPModelProtoToCpModelProto (const SatParameters ¶ms, const MPModelProto &mp_model, CpModelProto *cp_model, SolverLogger *logger) |
| bool | ConvertCpModelProtoToMPModelProto (const CpModelProto &input, MPModelProto *output) |
| bool | ScaleAndSetObjective (const SatParameters ¶ms, absl::Span< const std::pair< int, double > > objective, double objective_offset, bool maximize, CpModelProto *cp_model, SolverLogger *logger) |
| bool | ConvertBinaryMPModelProtoToBooleanProblem (const MPModelProto &mp_model, LinearBooleanProblem *problem) |
| void | ConvertBooleanProblemToLinearProgram (const LinearBooleanProblem &problem, glop::LinearProgram *lp) |
| double | ComputeTrueObjectiveLowerBound (const CpModelProto &model_proto_with_floating_point_objective, const CpObjectiveProto &integer_objective, const int64_t inner_integer_objective_lower_bound) |
| template<typename Sink, typename... T> | |
| void | AbslStringify (Sink &sink, LratChecker::RatIds arg) |
| void | AddConditionalSum2LowerOrEqual (absl::Span< const Literal > enforcement_literals, IntegerVariable a, IntegerVariable b, int64_t ub, Model *model) |
| void | AddConditionalSum3LowerOrEqual (absl::Span< const Literal > enforcement_literals, IntegerVariable a, IntegerVariable b, IntegerVariable c, int64_t ub, Model *model) |
| std::function< void(Model *)> | Equality (IntegerVariable a, IntegerVariable b) |
| std::function< void(Model *)> | ConditionalLowerOrEqualWithOffset (IntegerVariable a, IntegerVariable b, int64_t offset, Literal is_le) |
| void | MinimizeCoreWithPropagation (TimeLimit *limit, SatSolver *solver, std::vector< Literal > *core) |
| void | MinimizeCoreWithSearch (TimeLimit *limit, SatSolver *solver, std::vector< Literal > *core) |
| bool | ProbeLiteral (Literal assumption, SatSolver *solver) |
| void | FilterAssignedLiteral (const VariablesAssignment &assignment, std::vector< Literal > *core) |
| SatSolver::Status | MinimizeIntegerVariableWithLinearScanAndLazyEncoding (IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model) |
| void | RestrictObjectiveDomainWithBinarySearch (IntegerVariable objective_var, const std::function< void()> &feasible_solution_observer, Model *model) |
| void | PresolveBooleanLinearExpression (std::vector< Literal > *literals, std::vector< Coefficient > *coefficients, Coefficient *offset) |
| std::string | ValidateParameters (const SatParameters ¶ms) |
| bool | ComputeBooleanLinearExpressionCanonicalForm (std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value) |
| bool | ApplyLiteralMapping (const util_intops::StrongVector< LiteralIndex, LiteralIndex > &mapping, std::vector< LiteralWithCoeff > *cst, Coefficient *bound_shift, Coefficient *max_value) |
| bool | BooleanLinearExpressionIsCanonical (absl::Span< const Literal > enforcement_literals, absl::Span< const LiteralWithCoeff > cst) |
| void | SimplifyCanonicalBooleanLinearConstraint (std::vector< LiteralWithCoeff > *cst, Coefficient *rhs) |
| Coefficient | ComputeCanonicalRhs (Coefficient upper_bound, Coefficient bound_shift, Coefficient max_value) |
| Coefficient | ComputeNegatedCanonicalRhs (Coefficient lower_bound, Coefficient bound_shift, Coefficient max_value) |
| DEFINE_STRONG_INT64_TYPE (Coefficient) | |
| const Coefficient | kCoefficientMax (std::numeric_limits< Coefficient::ValueType >::max()) |
| template<typename H> | |
| H | AbslHashValue (H h, const LiteralWithCoeff &term) |
| std::ostream & | operator<< (std::ostream &os, LiteralWithCoeff term) |
| bool | PropagateLocalBounds (const IntegerTrail &integer_trail, const RootLevelLinear2Bounds &root_level_bounds, const ConditionalLinear2Bounds &repository, const ImpliedBounds &implied_bounds, Literal lit, const absl::flat_hash_map< IntegerVariable, IntegerValue > &input, absl::flat_hash_map< IntegerVariable, IntegerValue > *output) |
| DEFINE_STRONG_INDEX_TYPE (LinearExpression2Index) | |
| const LinearExpression2Index | kNoLinearExpression2Index (-1) |
| LinearExpression2Index | NegationOf (LinearExpression2Index i) |
| bool | Linear2IsPositive (LinearExpression2Index i) |
| LinearExpression2Index | PositiveLinear2 (LinearExpression2Index i) |
| bool | ScaleFloatingPointObjective (const SatParameters ¶ms, SolverLogger *logger, CpModelProto *proto) |
| bool | LoadModelForProbing (PresolveContext *context, Model *local_model) |
| bool | LoadModelForPresolve (const CpModelProto &model_proto, SatParameters params, PresolveContext *context, Model *local_model, absl::string_view name_for_logging) |
| template<typename ProtoWithVarsAndCoeffs, typename PresolveContextT> | |
| bool | CanonicalizeLinearExpressionInternal (absl::Span< const int > enforcements, ProtoWithVarsAndCoeffs *proto, int64_t *offset, std::vector< std::pair< int, int64_t > > *tmp_terms, PresolveContextT *context) |
| void | CreateValidModelWithSingleConstraint (const ConstraintProto &ct, const PresolveContext *context, std::vector< int > *variable_mapping, CpModelProto *mini_model) |
| std::vector< VariableEncodingLocalModel > | CreateVariableEncodingLocalModels (PresolveContext *context) |
| bool | BasicPresolveAndGetFullyEncodedDomains (PresolveContext *context, VariableEncodingLocalModel &local_model, absl::flat_hash_map< int, Domain > *result, bool *changed) |
| bool | DetectEncodedComplexDomain (PresolveContext *context, int ct_index, VariableEncodingLocalModel &local_model, absl::flat_hash_map< int, Domain > *fully_encoded_domains, bool *changed) |
| bool | DetectAllEncodedComplexDomain (PresolveContext *context, VariableEncodingLocalModel &local_model) |
| bool | MaybeTransferLinear1ToAnotherVariable (VariableEncodingLocalModel &local_model, PresolveContext *context) |
| bool | AddLinearConstraintMultiple (int64_t factor, const ConstraintProto &to_add, ConstraintProto *to_modify) |
| bool | SubstituteVariable (int var, int64_t var_coeff_in_definition, const ConstraintProto &definition, ConstraintProto *ct) |
| bool | FindSingleLinearDifference (const LinearConstraintProto &lin1, const LinearConstraintProto &lin2, int *var1, int64_t *coeff1, int *var2, int64_t *coeff2) |
| bool | ClauseIsEnforcementImpliesLiteral (absl::Span< const int > clause, absl::Span< const int > enforcement, int literal) |
| bool | LinearsDifferAtOneTerm (const LinearConstraintProto &lin1, const LinearConstraintProto &lin2) |
| void | GetRelationshipForConstraint (const ConstraintProto &ct, absl::btree_set< int > *deducible_vars, absl::btree_set< int > *input_vars, int *preferred_to_deduce) |
| void | CreateLinMaxFromLinearsAndObjective (const CpModelProto &model, int var_for_target, absl::Span< const int > linear_constraint_indexes, bool var_in_objective_is_negative, ConstraintProto *new_constraint) |
| bool | IsObjectiveConstraining (const CpModelProto &model) |
| VariableRelationships | ComputeVariableRelationships (const CpModelProto &model) |
| bool | ComputeAllVariablesFromPrimaryVariables (const CpModelProto &model, const VariableRelationships &relationships, std::vector< int64_t > *solution) |
| bool | LookForTrivialSatSolution (double deterministic_time_limit, Model *model, SolverLogger *logger) |
| int | SUniv (int i) |
| void | RecordLPRelaxationValues (Model *model) |
| ReducedDomainNeighborhood | GetRinsRensNeighborhood (const SharedResponseManager *response_manager, const SharedLPSolutionRepository *lp_solutions, SharedIncompleteSolutionManager *incomplete_solutions, double difficulty, absl::BitGenRef random) |
| RoutingCumulExpressions | DetectDimensionsAndCumulExpressions (int num_nodes, absl::Span< const int > tails, absl::Span< const int > heads, absl::Span< const Literal > literals, const ConditionalLinear2Bounds &binary_relation_repository) |
| std::pair< IntegerValue, IntegerValue > | GetDifferenceBounds (const NodeExpression &x_expr, const NodeExpression &y_expr, const sat::Relation &r, const std::pair< IntegerValue, IntegerValue > &x_var_bounds, const std::pair< IntegerValue, IntegerValue > &y_var_bounds) |
| std::pair< int, int > | MaybeFillMissingRoutesConstraintNodeExpressions (const CpModelProto &input_model, CpModelProto &output_model) |
| void | GenerateInterestingSubsets (int num_nodes, absl::Span< const std::pair< int, int > > arcs, int stop_at_num_components, std::vector< int > *subset_data, std::vector< absl::Span< const int > > *subsets) |
| void | ExtractAllSubsetsFromForest (absl::Span< const int > parent, std::vector< int > *subset_data, std::vector< absl::Span< const int > > *subsets, int node_limit) |
| std::vector< int > | ComputeGomoryHuTree (int num_nodes, absl::Span< const ArcWithLpValue > relevant_arcs) |
| void | SymmetrizeArcs (std::vector< ArcWithLpValue > *arcs) |
| int | TryAllSubsets (std::string cut_name, absl::Span< const int > subset_data, std::vector< absl::Span< const int > > subsets, RoutingCutHelper &helper, LinearConstraintManager *manager) |
| void | SeparateSubtourInequalities (RoutingCutHelper &helper, LinearConstraintManager *manager) |
| CutGenerator | CreateStronglyConnectedGraphCutGenerator (int num_nodes, absl::Span< const int > tails, absl::Span< const int > heads, absl::Span< const Literal > literals, Model *model) |
| CutGenerator | CreateCVRPCutGenerator (int num_nodes, absl::Span< const int > tails, absl::Span< const int > heads, absl::Span< const Literal > literals, absl::Span< const AffineExpression > flat_node_dim_expressions, Model *model) |
| void | SeparateFlowInequalities (int num_nodes, absl::Span< const int > tails, absl::Span< const int > heads, absl::Span< const AffineExpression > arc_capacities, std::function< void(const std::vector< bool > &in_subset, IntegerValue *min_incoming_flow, IntegerValue *min_outgoing_flow)> get_flows, const util_intops::StrongVector< IntegerVariable, double > &lp_values, LinearConstraintManager *manager, Model *model) |
| CutGenerator | CreateFlowCutGenerator (int num_nodes, const std::vector< int > &tails, const std::vector< int > &heads, const std::vector< AffineExpression > &arc_capacities, std::function< void(const std::vector< bool > &in_subset, IntegerValue *min_incoming_flow, IntegerValue *min_outgoing_flow)> get_flows, Model *model) |
| std::ostream & | operator<< (std::ostream &os, SpecialBinPackingHelper::ItemOrBin o) |
| DEFINE_STRONG_INDEX_TYPE (BooleanVariable) | |
| const BooleanVariable | kNoBooleanVariable (-1) |
| DEFINE_STRONG_INDEX_TYPE (LiteralIndex) | |
| const LiteralIndex | kNoLiteralIndex (-1) |
| const LiteralIndex | kTrueLiteralIndex (-2) |
| const LiteralIndex | kFalseLiteralIndex (-3) |
| std::ostream & | operator<< (std::ostream &os, Literal literal) |
| template<typename Sink, typename... T> | |
| void | AbslStringify (Sink &sink, Literal arg) |
| std::ostream & | operator<< (std::ostream &os, absl::Span< const Literal > literals) |
| std::ostream & | operator<< (std::ostream &os, absl::Span< const LiteralIndex > literals) |
| std::vector< Literal > | Literals (absl::Span< const int > input) |
| DEFINE_STRONG_INT_TYPE (ClauseId, int64_t) | |
| constexpr ClauseId | kNoClauseId (0) |
| DEFINE_STRONG_INDEX_TYPE (GateId) | |
| std::string | SatStatusString (SatSolver::Status status) |
| void | MinimizeCore (SatSolver *solver, std::vector< Literal > *core) |
| std::function< void(Model *)> | BooleanLinearConstraint (int64_t lower_bound, int64_t upper_bound, std::vector< LiteralWithCoeff > *cst) |
| std::function< void(Model *)> | CardinalityConstraint (int64_t lower_bound, int64_t upper_bound, absl::Span< const Literal > literals) |
| std::function< void(Model *)> | ExactlyOneConstraint (absl::Span< const Literal > literals) |
| std::function< void(Model *)> | AtMostOneConstraint (absl::Span< const Literal > literals) |
| std::function< void(Model *)> | ClauseConstraint (absl::Span< const Literal > literals) |
| std::function< void(Model *)> | Implication (Literal a, Literal b) |
| std::function< void(Model *)> | Equality (Literal a, Literal b) |
| std::function< void(Model *)> | ReifiedBoolOr (absl::Span< const Literal > literals, Literal r) |
| std::function< void(Model *)> | EnforcedClause (absl::Span< const Literal > enforcement_literals, absl::Span< const Literal > clause) |
| std::function< void(Model *)> | ReifiedBoolAnd (absl::Span< const Literal > literals, Literal r) |
| std::function< void(Model *)> | ReifiedBoolLe (Literal a, Literal b, Literal r) |
| std::function< int64_t(const Model &)> | Value (Literal l) |
| std::function< int64_t(const Model &)> | Value (BooleanVariable b) |
| std::function< void(Model *)> | ExcludeCurrentSolutionAndBacktrack () |
| std::ostream & | operator<< (std::ostream &os, SatSolver::Status status) |
| SatSweepingResult | DoFullSatSweeping (const CompactVectorVector< int, Literal > &clauses, TimeLimit *time_limit, std::function< void(Model *)> configure_model_before_first_solve) |
| void | GenerateCumulativeEnergeticCutsWithMakespanAndFixedCapacity (absl::string_view cut_name, const util_intops::StrongVector< IntegerVariable, double > &lp_values, absl::Span< std::unique_ptr< EnergyEvent > > events, IntegerValue capacity, AffineExpression makespan, TimeLimit *time_limit, Model *model, TopNCuts &top_n_cuts) |
| void | GenerateCumulativeEnergeticCuts (absl::string_view cut_name, const util_intops::StrongVector< IntegerVariable, double > &lp_values, absl::Span< std::unique_ptr< EnergyEvent > > events, const AffineExpression &capacity, TimeLimit *time_limit, Model *model, TopNCuts &top_n_cuts) |
| CutGenerator | CreateCumulativeEnergyCutGenerator (SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands_helper, const AffineExpression &capacity, const std::optional< AffineExpression > &makespan, Model *model) |
| CutGenerator | CreateNoOverlapEnergyCutGenerator (SchedulingConstraintHelper *helper, const std::optional< AffineExpression > &makespan, Model *model) |
| CutGenerator | CreateCumulativeTimeTableCutGenerator (SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands_helper, const AffineExpression &capacity, Model *model) |
| void | GenerateCutsBetweenPairOfNonOverlappingTasks (absl::string_view cut_name, bool ignore_zero_size_intervals, const util_intops::StrongVector< IntegerVariable, double > &lp_values, absl::Span< std::unique_ptr< CachedIntervalData > > events, IntegerValue capacity_max, Model *model, TopNCuts &top_n_cuts) |
| CutGenerator | CreateCumulativePrecedenceCutGenerator (SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands_helper, const AffineExpression &capacity, Model *model) |
| CutGenerator | CreateNoOverlapPrecedenceCutGenerator (SchedulingConstraintHelper *helper, Model *model) |
| CompletionTimeExplorationStatus | ComputeMinSumOfWeightedEndMins (absl::Span< CompletionTimeEvent * > events, IntegerValue capacity_max, double unweighted_threshold, double weighted_threshold, CtExhaustiveHelper &helper, double &min_sum_of_ends, double &min_sum_of_weighted_ends, bool &cut_use_precedences, int &exploration_credit) |
| ABSL_MUST_USE_RESULT bool | GenerateShortCompletionTimeCutsWithExactBound (absl::string_view cut_name, const util_intops::StrongVector< IntegerVariable, double > &lp_values, absl::Span< std::unique_ptr< CompletionTimeEvent > > events, IntegerValue capacity_max, CtExhaustiveHelper &helper, Model *model, TopNCuts &top_n_cuts, std::vector< CompletionTimeEvent > &residual_event_storage) |
| void | GenerateCompletionTimeCutsWithEnergy (absl::string_view cut_name, const util_intops::StrongVector< IntegerVariable, double > &lp_values, absl::Span< std::unique_ptr< CompletionTimeEvent > > events, IntegerValue capacity_max, Model *model, TopNCuts &top_n_cuts, std::vector< CompletionTimeEvent > &residual_event_storage) |
| CutGenerator | CreateNoOverlapCompletionTimeCutGenerator (SchedulingConstraintHelper *helper, Model *model) |
| CutGenerator | CreateCumulativeCompletionTimeCutGenerator (SchedulingConstraintHelper *helper, SchedulingDemandHelper *demands_helper, const AffineExpression &capacity, Model *model) |
| template<typename Sink> | |
| void | AbslStringify (Sink &sink, const CompletionTimeExplorationStatus &status) |
| template<class E> | |
| std::vector< absl::Span< std::unique_ptr< E > > > | SplitEventsInIndendentSets (std::vector< std::unique_ptr< E > > &events) |
| IntegerValue | ComputeEnergyMinInWindow (IntegerValue start_min, IntegerValue start_max, IntegerValue end_min, IntegerValue end_max, IntegerValue size_min, IntegerValue demand_min, absl::Span< const LiteralValueValue > filtered_energy, IntegerValue window_start, IntegerValue window_end) |
| void | AddIntegerVariableFromIntervals (const SchedulingConstraintHelper *helper, Model *model, std::vector< IntegerVariable > *vars, int mask) |
| bool | SimplifyClause (const std::vector< Literal > &a, std::vector< Literal > *b, LiteralIndex *opposite_literal, int64_t *num_inspected_literals) |
| LiteralIndex | DifferAtGivenLiteral (const std::vector< Literal > &a, const std::vector< Literal > &b, Literal l) |
| bool | ComputeResolvant (Literal x, const std::vector< Literal > &a, const std::vector< Literal > &b, std::vector< Literal > *out) |
| int | ComputeResolvantSize (Literal x, const std::vector< Literal > &a, const std::vector< Literal > &b) |
| void | ProbeAndFindEquivalentLiteral (SatSolver *solver, SatPostsolver *postsolver, util_intops::StrongVector< LiteralIndex, LiteralIndex > *mapping, SolverLogger *logger) |
| void | SequentialLoop (std::vector< std::unique_ptr< SubSolver > > &subsolvers) |
| void | DeterministicLoop (std::vector< std::unique_ptr< SubSolver > > &subsolvers, int num_threads, int batch_size, int max_num_batches) |
| void | NonDeterministicLoop (std::vector< std::unique_ptr< SubSolver > > &subsolvers, const int num_threads, ModelSharedTimeLimit *time_limit) |
| std::vector< std::vector< int > > | BasicOrbitopeExtraction (absl::Span< const std::unique_ptr< SparsePermutation > > generators) |
| std::vector< int > | GetOrbits (int n, absl::Span< const std::unique_ptr< SparsePermutation > > generators) |
| std::vector< int > | GetOrbitopeOrbits (int n, absl::Span< const std::vector< int > > orbitope) |
| void | GetSchreierVectorAndOrbit (int point, absl::Span< const std::unique_ptr< SparsePermutation > > generators, std::vector< int > *schrier_vector, std::vector< int > *orbit) |
| std::vector< int > | TracePoint (int point, absl::Span< const int > schrier_vector, absl::Span< const std::unique_ptr< SparsePermutation > > generators) |
| std::unique_ptr< SparsePermutation > | CreateSparsePermutationFromProto (int n, const SparsePermutationProto &proto) |
| void | TransformToGeneratorOfStabilizer (int to_stabilize, std::vector< std::unique_ptr< SparsePermutation > > *generators) |
| std::function< void(Model *)> | LiteralTableConstraint (absl::Span< const std::vector< Literal > > literal_tuples, absl::Span< const Literal > line_literals) |
| void | AddReservoirConstraint (absl::Span< const Literal > enforcement_literals, absl::Span< const AffineExpression > times, absl::Span< const AffineExpression > deltas, absl::Span< const Literal > presences, int64_t min_level, int64_t max_level, Model *model) |
| std::string | FormatTable (std::vector< std::vector< std::string > > &table, int spacing) |
| void | RandomizeDecisionHeuristic (absl::BitGenRef random, SatParameters *parameters) |
| int64_t | ModularInverse (int64_t x, int64_t m) |
| int64_t | PositiveMod (int64_t x, int64_t m) |
| int64_t | ProductWithModularInverse (int64_t coeff, int64_t mod, int64_t rhs) |
| bool | SolveDiophantineEquationOfSizeTwo (int64_t &a, int64_t &b, int64_t &cte, int64_t &x0, int64_t &y0) |
| bool | DiophantineEquationOfSizeTwoHasSolutionInDomain (const Domain &x, int64_t a, const Domain &y, int64_t b, int64_t cte) |
| int64_t | FloorSquareRoot (int64_t a) |
| int64_t | CeilSquareRoot (int64_t a) |
| int64_t | ClosestMultiple (int64_t value, int64_t base) |
| bool | LinearInequalityCanBeReducedWithClosestMultiple (int64_t base, absl::Span< const int64_t > coeffs, absl::Span< const int64_t > lbs, absl::Span< const int64_t > ubs, int64_t rhs, int64_t *new_rhs) |
| int | MoveOneUnprocessedLiteralLast (const absl::btree_set< LiteralIndex > &processed, int relevant_prefix_size, std::vector< Literal > *literals) |
| int | WeightedPick (absl::Span< const double > input, absl::BitGenRef random) |
| std::vector< absl::Span< int > > | AtMostOneDecomposition (const std::vector< std::vector< int > > &graph, absl::BitGenRef random, std::vector< int > *buffer) |
| std::vector< int > | FindMostDiverseSubset (int k, int n, absl::Span< const int64_t > distances, std::vector< int64_t > &buffer, int always_pick_mask) |
| std::vector< std::pair< int, int > > | HeuristicallySplitLongLinear (absl::Span< const int64_t > coeffs) |
| template<class Container, class Pred> | |
| void | OpenSourceEraseIf (Container &c, Pred pred) |
| std::string | FormatName (absl::string_view name) |
| int64_t | SafeDoubleToInt64 (double value) |
| bool | IsStrictlyIncluded (Bitset64< LiteralIndex >::ConstView in_subset, int subset_size, absl::Span< const Literal > superset) |
| bool | IsNegatableInt64 (absl::int128 x) |
| void | ScanModelForDominanceDetection (PresolveContext &context, VarDomination *var_domination) |
| void | ScanModelForDualBoundStrengthening (const PresolveContext &context, DualBoundStrengthening *dual_bound_strengthening) |
| bool | ExploitDominanceRelations (const VarDomination &var_domination, PresolveContext *context) |
| bool | ProcessEncodingConstraints (int var, PresolveContext *context, ValueEncoding &values, OrderEncoding &order, std::vector< std::vector< EncodingLinear1 > > &linear_ones_by_type, std::vector< int > &constraint_indices, bool &var_in_objective, bool &var_has_positive_objective_coefficient) |
| void | TryToReplaceVariableByItsEncoding (int var, PresolveContext *context, SolutionCrush &solution_crush) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | DecisionStrategyProto_VariableSelectionStrategy_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | DecisionStrategyProto_DomainReductionStrategy_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | CpSolverStatus_descriptor () |
| bool | DecisionStrategyProto_VariableSelectionStrategy_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | DecisionStrategyProto_VariableSelectionStrategy_Name (T value) |
| template<> | |
| const ::std::string & | DecisionStrategyProto_VariableSelectionStrategy_Name (DecisionStrategyProto_VariableSelectionStrategy value) |
| bool | DecisionStrategyProto_VariableSelectionStrategy_Parse (::absl::string_view name, DecisionStrategyProto_VariableSelectionStrategy *PROTOBUF_NONNULL value) |
| bool | DecisionStrategyProto_DomainReductionStrategy_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | DecisionStrategyProto_DomainReductionStrategy_Name (T value) |
| template<> | |
| const ::std::string & | DecisionStrategyProto_DomainReductionStrategy_Name (DecisionStrategyProto_DomainReductionStrategy value) |
| bool | DecisionStrategyProto_DomainReductionStrategy_Parse (::absl::string_view name, DecisionStrategyProto_DomainReductionStrategy *PROTOBUF_NONNULL value) |
| bool | CpSolverStatus_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | CpSolverStatus_Name (T value) |
| template<> | |
| const ::std::string & | CpSolverStatus_Name (CpSolverStatus value) |
| bool | CpSolverStatus_Parse (::absl::string_view name, CpSolverStatus *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_VariableOrder_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_Polarity_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_ConflictMinimizationAlgorithm_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_BinaryMinizationAlgorithm_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_ClauseOrdering_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_RestartAlgorithm_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_MaxSatAssumptionOrder_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_MaxSatStratificationAlgorithm_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_SearchBranching_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_SharedTreeSplitStrategy_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SatParameters_FPRoundingMethod_descriptor () |
| bool | SatParameters_VariableOrder_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_VariableOrder_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_VariableOrder_Name (SatParameters_VariableOrder value) |
| bool | SatParameters_VariableOrder_Parse (::absl::string_view name, SatParameters_VariableOrder *PROTOBUF_NONNULL value) |
| bool | SatParameters_Polarity_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_Polarity_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_Polarity_Name (SatParameters_Polarity value) |
| bool | SatParameters_Polarity_Parse (::absl::string_view name, SatParameters_Polarity *PROTOBUF_NONNULL value) |
| bool | SatParameters_ConflictMinimizationAlgorithm_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_ConflictMinimizationAlgorithm_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_ConflictMinimizationAlgorithm_Name (SatParameters_ConflictMinimizationAlgorithm value) |
| bool | SatParameters_ConflictMinimizationAlgorithm_Parse (::absl::string_view name, SatParameters_ConflictMinimizationAlgorithm *PROTOBUF_NONNULL value) |
| bool | SatParameters_BinaryMinizationAlgorithm_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_BinaryMinizationAlgorithm_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_BinaryMinizationAlgorithm_Name (SatParameters_BinaryMinizationAlgorithm value) |
| bool | SatParameters_BinaryMinizationAlgorithm_Parse (::absl::string_view name, SatParameters_BinaryMinizationAlgorithm *PROTOBUF_NONNULL value) |
| bool | SatParameters_ClauseOrdering_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_ClauseOrdering_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_ClauseOrdering_Name (SatParameters_ClauseOrdering value) |
| bool | SatParameters_ClauseOrdering_Parse (::absl::string_view name, SatParameters_ClauseOrdering *PROTOBUF_NONNULL value) |
| bool | SatParameters_RestartAlgorithm_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_RestartAlgorithm_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_RestartAlgorithm_Name (SatParameters_RestartAlgorithm value) |
| bool | SatParameters_RestartAlgorithm_Parse (::absl::string_view name, SatParameters_RestartAlgorithm *PROTOBUF_NONNULL value) |
| bool | SatParameters_MaxSatAssumptionOrder_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_MaxSatAssumptionOrder_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_MaxSatAssumptionOrder_Name (SatParameters_MaxSatAssumptionOrder value) |
| bool | SatParameters_MaxSatAssumptionOrder_Parse (::absl::string_view name, SatParameters_MaxSatAssumptionOrder *PROTOBUF_NONNULL value) |
| bool | SatParameters_MaxSatStratificationAlgorithm_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_MaxSatStratificationAlgorithm_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_MaxSatStratificationAlgorithm_Name (SatParameters_MaxSatStratificationAlgorithm value) |
| bool | SatParameters_MaxSatStratificationAlgorithm_Parse (::absl::string_view name, SatParameters_MaxSatStratificationAlgorithm *PROTOBUF_NONNULL value) |
| bool | SatParameters_SearchBranching_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_SearchBranching_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_SearchBranching_Name (SatParameters_SearchBranching value) |
| bool | SatParameters_SearchBranching_Parse (::absl::string_view name, SatParameters_SearchBranching *PROTOBUF_NONNULL value) |
| bool | SatParameters_SharedTreeSplitStrategy_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_SharedTreeSplitStrategy_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_SharedTreeSplitStrategy_Name (SatParameters_SharedTreeSplitStrategy value) |
| bool | SatParameters_SharedTreeSplitStrategy_Parse (::absl::string_view name, SatParameters_SharedTreeSplitStrategy *PROTOBUF_NONNULL value) |
| bool | SatParameters_FPRoundingMethod_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SatParameters_FPRoundingMethod_Name (T value) |
| template<> | |
| const ::std::string & | SatParameters_FPRoundingMethod_Name (SatParameters_FPRoundingMethod value) |
| bool | SatParameters_FPRoundingMethod_Parse (::absl::string_view name, SatParameters_FPRoundingMethod *PROTOBUF_NONNULL value) |
| std::function< SatParameters(Model *)> | NewSatParameters (absl::string_view params) |
| template<class Graph> | |
| std::unique_ptr< Graph > | RemapGraph (const Graph &graph, absl::Span< const int > new_node_index) |
Variables | |
| static constexpr int | kMaxProblemSize = 16 |
| constexpr int64_t | kTableAnyValue = std::numeric_limits<int64_t>::min() |
| constexpr uint64_t | kDefaultFingerprintSeed = 0xa5b85c5e198ed849 |
| for | i = 0 ... k-2 |
| for | b [i][j] = 0 if j > i+1 |
| constexpr int | kObjectiveConstraint = -1 |
| constexpr int | kAffineRelationConstraint = -2 |
| constexpr int | kAssumptionsConstraint = -3 |
| const int | kUnsatTrailIndex = -1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LinearObjectiveDefaultTypeInternal | _LinearObjective_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LinearBooleanConstraintDefaultTypeInternal | _LinearBooleanConstraint_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 BooleanAssignmentDefaultTypeInternal | _BooleanAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LinearBooleanProblemDefaultTypeInternal | _LinearBooleanProblem_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LinearBooleanConstraint_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LinearObjective_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | BooleanAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LinearBooleanProblem_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SparsePermutationProtoDefaultTypeInternal | _SparsePermutationProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 PartialVariableAssignmentDefaultTypeInternal | _PartialVariableAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 NoOverlapConstraintProtoDefaultTypeInternal | _NoOverlapConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 NoOverlap2DConstraintProtoDefaultTypeInternal | _NoOverlap2DConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ListOfVariablesProtoDefaultTypeInternal | _ListOfVariablesProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LinearExpressionProtoDefaultTypeInternal | _LinearExpressionProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LinearConstraintProtoDefaultTypeInternal | _LinearConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 InverseConstraintProtoDefaultTypeInternal | _InverseConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 IntegerVariableProtoDefaultTypeInternal | _IntegerVariableProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 FloatObjectiveProtoDefaultTypeInternal | _FloatObjectiveProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 DenseMatrixProtoDefaultTypeInternal | _DenseMatrixProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CpSolverSolutionDefaultTypeInternal | _CpSolverSolution_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CpObjectiveProtoDefaultTypeInternal | _CpObjectiveProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CircuitConstraintProtoDefaultTypeInternal | _CircuitConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 BoolArgumentProtoDefaultTypeInternal | _BoolArgumentProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 TableConstraintProtoDefaultTypeInternal | _TableConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SymmetryProtoDefaultTypeInternal | _SymmetryProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutesConstraintProto_NodeExpressionsDefaultTypeInternal | _RoutesConstraintProto_NodeExpressions_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ReservoirConstraintProtoDefaultTypeInternal | _ReservoirConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LinearArgumentProtoDefaultTypeInternal | _LinearArgumentProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 IntervalConstraintProtoDefaultTypeInternal | _IntervalConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ElementConstraintProtoDefaultTypeInternal | _ElementConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 DecisionStrategyProtoDefaultTypeInternal | _DecisionStrategyProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CumulativeConstraintProtoDefaultTypeInternal | _CumulativeConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CpSolverResponseDefaultTypeInternal | _CpSolverResponse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 AutomatonConstraintProtoDefaultTypeInternal | _AutomatonConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 AllDifferentConstraintProtoDefaultTypeInternal | _AllDifferentConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutesConstraintProtoDefaultTypeInternal | _RoutesConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ConstraintProtoDefaultTypeInternal | _ConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CpModelProtoDefaultTypeInternal | _CpModelProto_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | DecisionStrategyProto_VariableSelectionStrategy_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | DecisionStrategyProto_DomainReductionStrategy_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | CpSolverStatus_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | IntegerVariableProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | BoolArgumentProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LinearExpressionProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LinearArgumentProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | AllDifferentConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LinearConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ElementConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | IntervalConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | NoOverlapConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | NoOverlap2DConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CumulativeConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ReservoirConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CircuitConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutesConstraintProto_NodeExpressions_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutesConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | TableConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | InverseConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | AutomatonConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ListOfVariablesProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CpObjectiveProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | FloatObjectiveProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | DecisionStrategyProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | PartialVariableAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SparsePermutationProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | DenseMatrixProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SymmetryProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CpModelProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CpSolverSolution_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CpSolverResponse_class_data_ |
| constexpr DecisionStrategyProto_VariableSelectionStrategy | DecisionStrategyProto_VariableSelectionStrategy_VariableSelectionStrategy_MIN |
| constexpr DecisionStrategyProto_VariableSelectionStrategy | DecisionStrategyProto_VariableSelectionStrategy_VariableSelectionStrategy_MAX |
| constexpr int | DecisionStrategyProto_VariableSelectionStrategy_VariableSelectionStrategy_ARRAYSIZE = 4 + 1 |
| constexpr DecisionStrategyProto_DomainReductionStrategy | DecisionStrategyProto_DomainReductionStrategy_DomainReductionStrategy_MIN |
| constexpr DecisionStrategyProto_DomainReductionStrategy | DecisionStrategyProto_DomainReductionStrategy_DomainReductionStrategy_MAX |
| constexpr int | DecisionStrategyProto_DomainReductionStrategy_DomainReductionStrategy_ARRAYSIZE = 5 + 1 |
| constexpr CpSolverStatus | CpSolverStatus_MIN |
| constexpr CpSolverStatus | CpSolverStatus_MAX |
| constexpr int | CpSolverStatus_ARRAYSIZE = 4 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LratInferredClause_RatInfoDefaultTypeInternal | _LratInferredClause_RatInfo_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LratImportedClauseDefaultTypeInternal | _LratImportedClause_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LratExportedClauseDefaultTypeInternal | _LratExportedClause_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LratDeletedClausesDefaultTypeInternal | _LratDeletedClauses_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LratInferredClauseDefaultTypeInternal | _LratInferredClause_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LratProofStepDefaultTypeInternal | _LratProofStep_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LratImportedClause_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LratInferredClause_RatInfo_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LratInferredClause_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LratExportedClause_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LratDeletedClauses_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LratProofStep_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ArcLpValueDefaultTypeInternal | _ArcLpValue_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutesSupportGraphProtoDefaultTypeInternal | _RoutesSupportGraphProto_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ArcLpValue_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutesSupportGraphProto_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SatParametersDefaultTypeInternal | _SatParameters_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_VariableOrder_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_Polarity_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_ConflictMinimizationAlgorithm_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_BinaryMinizationAlgorithm_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_ClauseOrdering_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_RestartAlgorithm_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_MaxSatAssumptionOrder_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_MaxSatStratificationAlgorithm_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_SearchBranching_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_SharedTreeSplitStrategy_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | SatParameters_FPRoundingMethod_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SatParameters_class_data_ |
| constexpr SatParameters_VariableOrder | SatParameters_VariableOrder_VariableOrder_MIN |
| constexpr SatParameters_VariableOrder | SatParameters_VariableOrder_VariableOrder_MAX |
| constexpr int | SatParameters_VariableOrder_VariableOrder_ARRAYSIZE = 2 + 1 |
| constexpr SatParameters_Polarity | SatParameters_Polarity_Polarity_MIN |
| constexpr SatParameters_Polarity | SatParameters_Polarity_Polarity_MAX |
| constexpr int | SatParameters_Polarity_Polarity_ARRAYSIZE = 2 + 1 |
| constexpr SatParameters_ConflictMinimizationAlgorithm | SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MIN |
| constexpr SatParameters_ConflictMinimizationAlgorithm | SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MAX |
| constexpr int | SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_ARRAYSIZE = 2 + 1 |
| constexpr SatParameters_BinaryMinizationAlgorithm | SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MIN |
| constexpr SatParameters_BinaryMinizationAlgorithm | SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MAX |
| constexpr int | SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_ARRAYSIZE = 5 + 1 |
| constexpr SatParameters_ClauseOrdering | SatParameters_ClauseOrdering_ClauseOrdering_MIN |
| constexpr SatParameters_ClauseOrdering | SatParameters_ClauseOrdering_ClauseOrdering_MAX |
| constexpr int | SatParameters_ClauseOrdering_ClauseOrdering_ARRAYSIZE = 1 + 1 |
| constexpr SatParameters_RestartAlgorithm | SatParameters_RestartAlgorithm_RestartAlgorithm_MIN |
| constexpr SatParameters_RestartAlgorithm | SatParameters_RestartAlgorithm_RestartAlgorithm_MAX |
| constexpr int | SatParameters_RestartAlgorithm_RestartAlgorithm_ARRAYSIZE = 4 + 1 |
| constexpr SatParameters_MaxSatAssumptionOrder | SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MIN |
| constexpr SatParameters_MaxSatAssumptionOrder | SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MAX |
| constexpr int | SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_ARRAYSIZE = 2 + 1 |
| constexpr SatParameters_MaxSatStratificationAlgorithm | SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MIN |
| constexpr SatParameters_MaxSatStratificationAlgorithm | SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MAX |
| constexpr int | SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_ARRAYSIZE = 2 + 1 |
| constexpr SatParameters_SearchBranching | SatParameters_SearchBranching_SearchBranching_MIN |
| constexpr SatParameters_SearchBranching | SatParameters_SearchBranching_SearchBranching_MAX |
| constexpr int | SatParameters_SearchBranching_SearchBranching_ARRAYSIZE = 8 + 1 |
| constexpr SatParameters_SharedTreeSplitStrategy | SatParameters_SharedTreeSplitStrategy_SharedTreeSplitStrategy_MIN |
| constexpr SatParameters_SharedTreeSplitStrategy | SatParameters_SharedTreeSplitStrategy_SharedTreeSplitStrategy_MAX |
| constexpr int | SatParameters_SharedTreeSplitStrategy_SharedTreeSplitStrategy_ARRAYSIZE = 4 + 1 |
| constexpr SatParameters_FPRoundingMethod | SatParameters_FPRoundingMethod_FPRoundingMethod_MIN |
| constexpr SatParameters_FPRoundingMethod | SatParameters_FPRoundingMethod_FPRoundingMethod_MAX |
| constexpr int | SatParameters_FPRoundingMethod_FPRoundingMethod_ARRAYSIZE = 3 + 1 |
| constexpr Fractional | kInfinity |
| typedef double operations_research::glop::Fractional |
Definition at line 81 of file lp_types.h.
| typedef double operations_research::glop::Fractional |
Definition at line 81 of file lp_types.h.
| typedef double operations_research::glop::Fractional |
Definition at line 81 of file lp_types.h.
| using operations_research::sat::InlinedIntegerLiteralVector = absl::InlinedVector<IntegerLiteral, 2> |
| using operations_research::sat::IntegerSumLE = LinearConstraintPropagator<false> |
Definition at line 168 of file integer_expr.h.
Definition at line 169 of file integer_expr.h.
| using operations_research::sat::SmallBitset = uint32_t |
Definition at line 27 of file gate_utils.h.
|
strong |
| Enumerator | |
|---|---|
| FINISHED | |
| ABORTED | |
| NO_VALID_PERMUTATION | |
Definition at line 187 of file scheduling_cuts.h.
|
strong |
Definition at line 234 of file lp_types.h.
| enum operations_research::sat::CpSolverStatus : int |
| Enumerator | |
|---|---|
| UNKNOWN | |
| MODEL_INVALID | |
| FEASIBLE | |
| INFEASIBLE | |
| OPTIMAL | |
| CpSolverStatus_INT_MIN_SENTINEL_DO_NOT_USE_ | |
| CpSolverStatus_INT_MAX_SENTINEL_DO_NOT_USE_ | |
Definition at line 281 of file cp_model.pb.h.
| enum operations_research::sat::CpSolverStatus : int |
Definition at line 281 of file cp_model.pb.h.
Definition at line 241 of file cp_model.pb.h.
Definition at line 202 of file cp_model.pb.h.
|
strong |
| Enumerator | |
|---|---|
| TOP | |
| RIGHT | |
| BOTTOM | |
| LEFT | |
Definition at line 130 of file 2d_rectangle_presolve.h.
|
strong |
| Enumerator | |
|---|---|
| IS_FALSE | |
| CANNOT_PROPAGATE | |
| CAN_PROPAGATE_ENFORCEMENT | |
| IS_ENFORCED | |
Definition at line 38 of file enforcement.h.
| Enumerator | |
|---|---|
| kStart | |
| kEnd | |
| kSize | |
| kPresence | |
Definition at line 870 of file scheduling_helpers.h.
|
strong |
| Enumerator | |
|---|---|
| IS_TRUE | |
| IS_FALSE | |
| IS_UNKNOWN | |
Definition at line 492 of file integer_base.h.
| Enumerator | |
|---|---|
| DIMACS | |
| DRAT | |
Definition at line 334 of file drat_checker.h.
Definition at line 225 of file sat_parameters.pb.h.
| Enumerator | |
|---|---|
| SatParameters_ClauseOrdering_CLAUSE_ACTIVITY | |
| SatParameters_ClauseOrdering_CLAUSE_LBD | |
Definition at line 258 of file sat_parameters.pb.h.
| Enumerator | |
|---|---|
| SatParameters_ConflictMinimizationAlgorithm_NONE | |
| SatParameters_ConflictMinimizationAlgorithm_SIMPLE | |
| SatParameters_ConflictMinimizationAlgorithm_RECURSIVE | |
Definition at line 192 of file sat_parameters.pb.h.
| Enumerator | |
|---|---|
| SatParameters_FPRoundingMethod_NEAREST_INTEGER | |
| SatParameters_FPRoundingMethod_LOCK_BASED | |
| SatParameters_FPRoundingMethod_ACTIVE_LOCK_BASED | |
| SatParameters_FPRoundingMethod_PROPAGATION_ASSISTED | |
Definition at line 465 of file sat_parameters.pb.h.
| Enumerator | |
|---|---|
| SatParameters_MaxSatAssumptionOrder_DEFAULT_ASSUMPTION_ORDER | |
| SatParameters_MaxSatAssumptionOrder_ORDER_ASSUMPTION_BY_DEPTH | |
| SatParameters_MaxSatAssumptionOrder_ORDER_ASSUMPTION_BY_WEIGHT | |
Definition at line 325 of file sat_parameters.pb.h.
Definition at line 358 of file sat_parameters.pb.h.
| Enumerator | |
|---|---|
| SatParameters_Polarity_POLARITY_TRUE | |
| SatParameters_Polarity_POLARITY_FALSE | |
| SatParameters_Polarity_POLARITY_RANDOM | |
Definition at line 159 of file sat_parameters.pb.h.
Definition at line 290 of file sat_parameters.pb.h.
Definition at line 391 of file sat_parameters.pb.h.
Definition at line 430 of file sat_parameters.pb.h.
| Enumerator | |
|---|---|
| SatParameters_VariableOrder_IN_ORDER | |
| SatParameters_VariableOrder_IN_REVERSE_ORDER | |
| SatParameters_VariableOrder_IN_RANDOM_ORDER | |
Definition at line 126 of file sat_parameters.pb.h.
| H operations_research::sat::AbslHashValue | ( | H | h, |
| const AffineExpression & | e ) |
Definition at line 349 of file integer_base.h.
| H operations_research::sat::AbslHashValue | ( | H | h, |
| const BoolArgumentProto & | m ) |
Definition at line 397 of file cp_model_utils.h.
| H operations_research::sat::AbslHashValue | ( | H | h, |
| const IntervalVar & | i ) |
Definition at line 520 of file cp_model.h.
| H operations_research::sat::AbslHashValue | ( | H | h, |
| const IntVar & | i ) |
Definition at line 515 of file cp_model.h.
| H operations_research::sat::AbslHashValue | ( | H | h, |
| const LinearConstraintProto & | m ) |
Definition at line 419 of file cp_model_utils.h.
| H operations_research::sat::AbslHashValue | ( | H | h, |
| const LinearExpression2 & | e ) |
Definition at line 483 of file integer_base.h.
| H operations_research::sat::AbslHashValue | ( | H | h, |
| const LiteralWithCoeff & | term ) |
Definition at line 65 of file pb_constraint.h.
| void operations_research::sat::AbslStringify | ( | Sink & | sink, |
| const CompletionTimeExplorationStatus & | status ) |
Definition at line 194 of file scheduling_cuts.h.
| void operations_research::sat::AbslStringify | ( | Sink & | sink, |
| EdgePosition | e ) |
Definition at line 133 of file 2d_rectangle_presolve.h.
| void operations_research::sat::AbslStringify | ( | Sink & | sink, |
| Literal | arg ) |
Definition at line 125 of file sat_base.h.
| void operations_research::sat::AbslStringify | ( | Sink & | sink, |
| LratChecker::RatIds | arg ) |
Definition at line 180 of file lrat_checker.h.
| void operations_research::sat::AdaptGlobalParameters | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 2149 of file cp_model_solver_helpers.cc.
| void operations_research::sat::AddAllDiffRelaxationAndCutGenerator | ( | const ConstraintProto & | ct, |
| int | linearization_level, | ||
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1655 of file linear_relaxation.cc.
| void operations_research::sat::AddCircuitCutGenerator | ( | const ConstraintProto & | ct, |
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 579 of file linear_relaxation.cc.
| void operations_research::sat::AddCircuitFlowConstraints | ( | LinearIncrementalEvaluator & | linear_evaluator, |
| const ConstraintProto & | ct_proto ) |
Definition at line 1482 of file constraint_violation.cc.
|
inline |
Definition at line 694 of file integer_expr.h.
|
inline |
Definition at line 311 of file old_precedences_propagator.h.
|
inline |
Definition at line 329 of file old_precedences_propagator.h.
| void operations_research::sat::AddCumulativeCutGenerator | ( | const AffineExpression & | capacity, |
| SchedulingConstraintHelper * | helper, | ||
| SchedulingDemandHelper * | demands_helper, | ||
| const std::optional< AffineExpression > & | makespan, | ||
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1721 of file linear_relaxation.cc.
| void operations_research::sat::AddCumulativeOverloadChecker | ( | AffineExpression | capacity, |
| SchedulingConstraintHelper * | helper, | ||
| SchedulingDemandHelper * | demands, | ||
| Model * | model ) |
Definition at line 44 of file cumulative_energy.cc.
| void operations_research::sat::AddCumulativeOverloadCheckerDff | ( | AffineExpression | capacity, |
| SchedulingConstraintHelper * | helper, | ||
| SchedulingDemandHelper * | demands, | ||
| Model * | model ) |
Definition at line 55 of file cumulative_energy.cc.
| void operations_research::sat::AddCumulativeRelaxation | ( | const AffineExpression & | capacity, |
| SchedulingConstraintHelper * | helper, | ||
| SchedulingDemandHelper * | demands_helper, | ||
| const std::optional< AffineExpression > & | makespan, | ||
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 815 of file linear_relaxation.cc.
| void operations_research::sat::AddDisjunctive | ( | const std::vector< Literal > & | enforcement_literals, |
| const std::vector< IntervalVariable > & | intervals, | ||
| Model * | model ) |
Definition at line 46 of file disjunctive.cc.
| void operations_research::sat::AddDisjunctiveWithBooleanPrecedencesOnly | ( | absl::Span< const IntervalVariable > | intervals, |
| Model * | model ) |
Definition at line 168 of file disjunctive.cc.
| void operations_research::sat::AddFullEncodingFromSearchBranching | ( | const CpModelProto & | model_proto, |
| Model * | m ) |
Definition at line 942 of file cp_model_loader.cc.
|
inline |
Definition at line 97 of file gate_utils.h.
| bool operations_research::sat::AddInferredAndDeletedClauses | ( | const std::string & | file_path, |
| DratChecker * | drat_checker ) |
Definition at line 571 of file drat_checker.cc.
| void operations_research::sat::AddIntegerVariableFromIntervals | ( | const SchedulingConstraintHelper * | helper, |
| Model * | model, | ||
| std::vector< IntegerVariable > * | vars, | ||
| int | mask ) |
Definition at line 1165 of file scheduling_helpers.cc.
| void operations_research::sat::AddIntProdCutGenerator | ( | const ConstraintProto & | ct, |
| int | linearization_level, | ||
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1553 of file linear_relaxation.cc.
|
inline |
Definition at line 743 of file integer_expr.h.
| bool operations_research::sat::AddLinearConstraintMultiple | ( | int64_t | factor, |
| const ConstraintProto & | to_add, | ||
| ConstraintProto * | to_modify ) |
Definition at line 160 of file presolve_util.cc.
| void operations_research::sat::AddLinearExpressionToLinearConstraint | ( | const LinearExpressionProto & | expr, |
| int64_t | coefficient, | ||
| LinearConstraintProto * | linear ) |
Definition at line 656 of file cp_model_utils.cc.
| void operations_research::sat::AddLinMaxCutGenerator | ( | const ConstraintProto & | ct, |
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1830 of file linear_relaxation.cc.
| void operations_research::sat::AddMaxAffineCutGenerator | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1164 of file linear_relaxation.cc.
| void operations_research::sat::AddNoOverlap2dCutGenerator | ( | const ConstraintProto & | ct, |
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1778 of file linear_relaxation.cc.
| void operations_research::sat::AddNoOverlapCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| const std::optional< AffineExpression > & | makespan, | ||
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1755 of file linear_relaxation.cc.
| bool operations_research::sat::AddObjectiveConstraint | ( | const LinearBooleanProblem & | problem, |
| bool | use_lower_bound, | ||
| Coefficient | lower_bound, | ||
| bool | use_upper_bound, | ||
| Coefficient | upper_bound, | ||
| SatSolver * | solver ) |
Definition at line 349 of file boolean_problem.cc.
| bool operations_research::sat::AddObjectiveUpperBound | ( | const LinearBooleanProblem & | problem, |
| Coefficient | upper_bound, | ||
| SatSolver * | solver ) |
Definition at line 341 of file boolean_problem.cc.
|
inline |
Definition at line 40 of file boolean_problem.h.
| bool operations_research::sat::AddProblemClauses | ( | const std::string & | file_path, |
| DratChecker * | drat_checker ) |
Definition at line 522 of file drat_checker.cc.
|
inline |
Definition at line 154 of file integer_base.h.
| void operations_research::sat::AddReservoirConstraint | ( | absl::Span< const Literal > | enforcement_literals, |
| absl::Span< const AffineExpression > | times, | ||
| absl::Span< const AffineExpression > | deltas, | ||
| absl::Span< const Literal > | presences, | ||
| int64_t | min_level, | ||
| int64_t | max_level, | ||
| Model * | model ) |
Definition at line 33 of file timetable.cc.
| void operations_research::sat::AddRoutesCutGenerator | ( | const ConstraintProto & | ct, |
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 593 of file linear_relaxation.cc.
| void operations_research::sat::AddSquareCutGenerator | ( | const ConstraintProto & | ct, |
| int | linearization_level, | ||
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1631 of file linear_relaxation.cc.
|
inline |
Definition at line 164 of file integer_base.h.
|
inline |
Definition at line 145 of file integer_base.h.
| void operations_research::sat::AddWeightedLiteralToLinearConstraint | ( | int | lit, |
| int64_t | coeff, | ||
| LinearConstraintProto * | linear, | ||
| int64_t * | offset ) |
Definition at line 671 of file cp_model_utils.cc.
|
inline |
Definition at line 585 of file integer_expr.h.
|
inline |
Definition at line 471 of file integer_expr.h.
|
inline |
Definition at line 262 of file cp_model_utils.h.
|
inline |
Definition at line 245 of file cp_model_utils.h.
| std::function< void(Model *)> operations_research::sat::AllDifferentAC | ( | absl::Span< const IntegerVariable > | variables | ) |
Definition at line 101 of file all_different.cc.
| std::function< void(Model *)> operations_research::sat::AllDifferentBinary | ( | absl::Span< const IntegerVariable > | vars | ) |
Definition at line 40 of file all_different.cc.
| std::function< void(Model *)> operations_research::sat::AllDifferentOnBounds | ( | absl::Span< const IntegerVariable > | vars | ) |
Definition at line 86 of file all_different.cc.
| std::function< void(Model *)> operations_research::sat::AllDifferentOnBounds | ( | absl::Span< const Literal > | enforcement_literals, |
| absl::Span< const AffineExpression > | expressions ) |
Definition at line 75 of file all_different.cc.
| std::vector< int64_t > operations_research::sat::AllValuesInDomain | ( | const ProtoWithDomain & | proto | ) |
Definition at line 183 of file cp_model_utils.h.
| bool operations_research::sat::AnalyzeIntervals | ( | bool | transpose, |
| absl::Span< const int > | local_boxes, | ||
| absl::Span< const Rectangle > | rectangles, | ||
| absl::Span< const IntegerValue > | rectangle_energies, | ||
| IntegerValue * | x_threshold, | ||
| IntegerValue * | y_threshold, | ||
| Rectangle * | conflict ) |
Definition at line 239 of file diffn_util.cc.
| void operations_research::sat::AppendAtMostOneRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 420 of file linear_relaxation.cc.
| void operations_research::sat::AppendBoolAndRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation, | ||
| ActivityBoundHelper * | activity_helper ) |
Definition at line 351 of file linear_relaxation.cc.
| void operations_research::sat::AppendBoolOrRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 337 of file linear_relaxation.cc.
| void operations_research::sat::AppendCircuitRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 491 of file linear_relaxation.cc.
| void operations_research::sat::AppendCumulativeRelaxationAndCutGenerator | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 770 of file linear_relaxation.cc.
| void operations_research::sat::AppendElementEncodingRelaxation | ( | Model * | m, |
| LinearRelaxation * | relaxation ) |
Definition at line 1880 of file linear_relaxation.cc.
| void operations_research::sat::AppendExactlyOneRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 429 of file linear_relaxation.cc.
| void operations_research::sat::AppendLinearConstraintRelaxation | ( | absl::Span< const int > | enforcement, |
| LinearConstraint && | linear_constraint, | ||
| Model * | model, | ||
| LinearRelaxation * | relaxation, | ||
| ActivityBoundHelper * | activity_helper ) |
Definition at line 1318 of file linear_relaxation.cc.
| void operations_research::sat::AppendLinearConstraintRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation, | ||
| ActivityBoundHelper * | activity_helper ) |
Definition at line 1268 of file linear_relaxation.cc.
| void operations_research::sat::AppendLinMaxRelaxationPart1 | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation, | ||
| ActivityBoundHelper * | activity_helper ) |
Definition at line 1118 of file linear_relaxation.cc.
| void operations_research::sat::AppendLinMaxRelaxationPart2 | ( | IntegerVariable | target, |
| absl::Span< const Literal > | alternative_literals, | ||
| absl::Span< const LinearExpression > | exprs, | ||
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1188 of file linear_relaxation.cc.
| void operations_research::sat::AppendMaxAffineRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation, | ||
| ActivityBoundHelper * | activity_helper ) |
Definition at line 1142 of file linear_relaxation.cc.
| void operations_research::sat::AppendNoOverlap2dRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1073 of file linear_relaxation.cc.
| void operations_research::sat::AppendNoOverlap2dRelaxationForComponent | ( | absl::Span< const int > | component, |
| Model * | model, | ||
| NoOverlap2DConstraintHelper * | no_overlap_helper, | ||
| LinearConstraintManager * | manager, | ||
| ProductDecomposer * | product_decomposer ) |
Definition at line 1005 of file linear_relaxation.cc.
| void operations_research::sat::AppendNoOverlapRelaxationAndCutGenerator | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 731 of file linear_relaxation.cc.
| void operations_research::sat::AppendPairwiseRestrictions | ( | absl::Span< const ItemWithVariableSize > | items, |
| absl::Span< const ItemWithVariableSize > | other_items, | ||
| std::vector< PairwiseRestriction > * | result ) |
Definition at line 660 of file diffn_util.cc.
| void operations_research::sat::AppendPairwiseRestrictions | ( | absl::Span< const ItemWithVariableSize > | items, |
| std::vector< PairwiseRestriction > * | result ) |
Definition at line 651 of file diffn_util.cc.
| void operations_research::sat::AppendPartialGreaterThanEncodingRelaxation | ( | IntegerVariable | var, |
| const Model & | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 266 of file linear_relaxation.cc.
| void operations_research::sat::AppendRelaxationForEqualityEncoding | ( | IntegerVariable | var, |
| const Model & | model, | ||
| LinearRelaxation * | relaxation, | ||
| int * | num_tight, | ||
| int * | num_loose ) |
Definition at line 140 of file linear_relaxation.cc.
| void operations_research::sat::AppendRoutesRelaxation | ( | const ConstraintProto & | ct, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 529 of file linear_relaxation.cc.
| void operations_research::sat::AppendSquareRelaxation | ( | const ConstraintProto & | ct, |
| Model * | m, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 1589 of file linear_relaxation.cc.
| void operations_research::sat::AppendVariablesFromCapacityAndDemands | ( | const AffineExpression & | capacity, |
| SchedulingDemandHelper * | demands_helper, | ||
| Model * | model, | ||
| std::vector< IntegerVariable > * | vars ) |
Definition at line 1196 of file scheduling_helpers.cc.
| bool operations_research::sat::ApplyLiteralMapping | ( | const util_intops::StrongVector< LiteralIndex, LiteralIndex > & | mapping, |
| std::vector< LiteralWithCoeff > * | cst, | ||
| Coefficient * | bound_shift, | ||
| Coefficient * | max_value ) |
Definition at line 120 of file pb_constraint.cc.
| void operations_research::sat::ApplyLiteralMappingToBooleanProblem | ( | const util_intops::StrongVector< LiteralIndex, LiteralIndex > & | mapping, |
| LinearBooleanProblem * | problem ) |
Definition at line 755 of file boolean_problem.cc.
| void operations_research::sat::ApplyToAllIntervalIndices | ( | absl::FunctionRef< void(int *)> | f, |
| ConstraintProto * | ct ) |
Definition at line 438 of file cp_model_utils.cc.
| void operations_research::sat::ApplyToAllLiteralIndices | ( | absl::FunctionRef< void(int *)> | f, |
| ConstraintProto * | ct ) |
Definition at line 254 of file cp_model_utils.cc.
| void operations_research::sat::ApplyToAllVariableIndices | ( | absl::FunctionRef< void(int *)> | f, |
| ConstraintProto * | ct ) |
Definition at line 317 of file cp_model_utils.cc.
| void operations_research::sat::ApplyVariableMapping | ( | absl::Span< int > | mapping, |
| CpModelProto * | cp_model, | ||
| std::vector< int > * | reverse_mapping ) |
Definition at line 14340 of file cp_model_presolve.cc.
|
inline |
Definition at line 128 of file integer_base.h.
| IntegerLiteral operations_research::sat::AtMinValue | ( | IntegerVariable | var, |
| IntegerTrail * | integer_trail ) |
Definition at line 61 of file integer_search.cc.
|
inline |
Definition at line 979 of file sat_solver.h.
| std::vector< absl::Span< int > > operations_research::sat::AtMostOneDecomposition | ( | const std::vector< std::vector< int > > & | graph, |
| absl::BitGenRef | random, | ||
| std::vector< int > * | buffer ) |
| std::vector< std::vector< int > > operations_research::sat::BasicOrbitopeExtraction | ( | absl::Span< const std::unique_ptr< SparsePermutation > > | generators | ) |
Definition at line 31 of file symmetry_util.cc.
| bool operations_research::sat::BasicPresolveAndGetFullyEncodedDomains | ( | PresolveContext * | context, |
| VariableEncodingLocalModel & | local_model, | ||
| absl::flat_hash_map< int, Domain > * | result, | ||
| bool * | changed ) |
Definition at line 223 of file presolve_encoding.cc.
|
inline |
Definition at line 938 of file sat_solver.h.
| bool operations_research::sat::BooleanLinearExpressionIsCanonical | ( | absl::Span< const Literal > | enforcement_literals, |
| absl::Span< const LiteralWithCoeff > | cst ) |
Definition at line 153 of file pb_constraint.cc.
| CpModelProto operations_research::sat::BooleanProblemToCpModelproto | ( | const LinearBooleanProblem & | problem | ) |
Definition at line 164 of file boolean_problem.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::BoolPseudoCostHeuristic | ( | Model * | model | ) |
Definition at line 209 of file integer_search.cc.
| bool operations_research::sat::BoxesAreInEnergyConflict | ( | absl::Span< const Rectangle > | rectangles, |
| absl::Span< const IntegerValue > | energies, | ||
| absl::Span< const int > | boxes, | ||
| Rectangle * | conflict ) |
Definition at line 172 of file diffn_util.cc.
| std::vector< SingleShape > operations_research::sat::BoxesToShapes | ( | absl::Span< const Rectangle > | rectangles, |
| const Neighbours & | neighbours ) |
Definition at line 808 of file 2d_rectangle_presolve.cc.
| BruteForceResult operations_research::sat::BruteForceOrthogonalPacking | ( | absl::Span< const IntegerValue > | sizes_x, |
| absl::Span< const IntegerValue > | sizes_y, | ||
| std::pair< IntegerValue, IntegerValue > | bounding_box_size, | ||
| int | max_complexity ) |
Definition at line 619 of file 2d_packing_brute_force.cc.
| bool operations_research::sat::BuildMaxAffineUpConstraint | ( | const LinearExpression & | target, |
| IntegerVariable | var, | ||
| absl::Span< const std::pair< IntegerValue, IntegerValue > > | affines, | ||
| Model * | model, | ||
| LinearConstraintBuilder * | builder ) |
| Neighbours operations_research::sat::BuildNeighboursGraph | ( | absl::Span< const Rectangle > | rectangles | ) |
Definition at line 469 of file 2d_rectangle_presolve.cc.
| LinearExpression operations_research::sat::CanonicalizeExpr | ( | const LinearExpression & | expr | ) |
Definition at line 378 of file linear_constraint.cc.
|
inline |
Definition at line 126 of file gate_utils.h.
| bool operations_research::sat::CanonicalizeLinearExpressionInternal | ( | absl::Span< const int > | enforcements, |
| ProtoWithVarsAndCoeffs * | proto, | ||
| int64_t * | offset, | ||
| std::vector< std::pair< int, int64_t > > * | tmp_terms, | ||
| PresolveContextT * | context ) |
Definition at line 2661 of file presolve_context.cc.
| void operations_research::sat::CanonicalizeTable | ( | PresolveContext * | context, |
| ConstraintProto * | ct ) |
Definition at line 34 of file cp_model_table.cc.
| void operations_research::sat::CanonicalizeTruthTable | ( | absl::Span< VarOrLiteral > | key, |
| SmallBitset & | bitmask ) |
Definition at line 40 of file gate_utils.h.
|
inline |
Definition at line 120 of file integer_base.h.
|
inline |
Definition at line 112 of file integer_base.h.
|
inline |
Definition at line 116 of file integer_base.h.
|
inline |
Definition at line 948 of file sat_solver.h.
|
inline |
Definition at line 85 of file integer_base.h.
| int64_t operations_research::sat::CeilSquareRoot | ( | int64_t | a | ) |
|
inline |
Definition at line 134 of file diffn_util.h.
|
inline |
Definition at line 144 of file diffn_util.h.
| void operations_research::sat::ChangeLargeBoundsToInfinity | ( | double | max_magnitude, |
| MPModelProto * | mp_model, | ||
| SolverLogger * | logger ) |
Definition at line 240 of file lp_utils.cc.
| void operations_research::sat::ChangeOptimizationDirection | ( | LinearBooleanProblem * | problem | ) |
Definition at line 221 of file boolean_problem.cc.
| IntegerLiteral operations_research::sat::ChooseBestObjectiveValue | ( | IntegerVariable | var, |
| IntegerTrail * | integer_trail, | ||
| ObjectiveDefinition * | objective_definition ) |
Definition at line 68 of file integer_search.cc.
| std::function< void(Model *)> operations_research::sat::CircuitCovering | ( | absl::Span< const std::vector< Literal > > | graph, |
| absl::Span< const int > | distinguished_nodes ) |
Definition at line 779 of file circuit.cc.
|
inline |
Definition at line 994 of file sat_solver.h.
|
inline |
Definition at line 338 of file presolve_util.h.
|
inline |
Definition at line 392 of file linear_constraint.h.
|
inline |
Definition at line 361 of file linear_constraint.h.
| int64_t operations_research::sat::ClosestMultiple | ( | int64_t | value, |
| int64_t | base ) |
| int operations_research::sat::CombineSeed | ( | int | base_seed, |
| int64_t | delta ) |
Definition at line 1149 of file cp_model_utils.cc.
| std::vector< std::function< BooleanOrIntegerLiteral()> > operations_research::sat::CompleteHeuristics | ( | absl::Span< const std::function< BooleanOrIntegerLiteral()> > | incomplete_heuristics, |
| const std::function< BooleanOrIntegerLiteral()> & | completion_heuristic ) |
Definition at line 1337 of file integer_search.cc.
| void operations_research::sat::CompressTuples | ( | absl::Span< const int64_t > | domain_sizes, |
| std::vector< std::vector< int64_t > > * | tuples ) |
Definition at line 182 of file cp_model_table.cc.
| double operations_research::sat::ComputeActivity | ( | const LinearConstraint & | constraint, |
| const util_intops::StrongVector< IntegerVariable, double > & | values ) |
Definition at line 185 of file linear_constraint.cc.
| bool operations_research::sat::ComputeAllVariablesFromPrimaryVariables | ( | const CpModelProto & | model, |
| const VariableRelationships & | relationships, | ||
| std::vector< int64_t > * | solution ) |
Definition at line 562 of file primary_variables.cc.
| bool operations_research::sat::ComputeBooleanLinearExpressionCanonicalForm | ( | std::vector< LiteralWithCoeff > * | cst, |
| Coefficient * | bound_shift, | ||
| Coefficient * | max_value ) |
Definition at line 58 of file pb_constraint.cc.
| Coefficient operations_research::sat::ComputeCanonicalRhs | ( | Coefficient | upper_bound, |
| Coefficient | bound_shift, | ||
| Coefficient | max_value ) |
Definition at line 182 of file pb_constraint.cc.
| Coefficient operations_research::sat::ComputeCoreMinWeight | ( | const std::vector< EncodingNode * > & | nodes, |
| absl::Span< const Literal > | core ) |
Definition at line 562 of file encoding.cc.
| IntegerValue operations_research::sat::ComputeEnergyMinInWindow | ( | IntegerValue | start_min, |
| IntegerValue | start_max, | ||
| IntegerValue | end_min, | ||
| IntegerValue | end_max, | ||
| IntegerValue | size_min, | ||
| IntegerValue | demand_min, | ||
| absl::Span< const LiteralValueValue > | filtered_energy, | ||
| IntegerValue | window_start, | ||
| IntegerValue | window_end ) |
Definition at line 830 of file scheduling_helpers.cc.
| std::vector< int > operations_research::sat::ComputeGomoryHuTree | ( | int | num_nodes, |
| absl::Span< const ArcWithLpValue > | relevant_arcs ) |
Definition at line 2977 of file routing_cuts.cc.
| LinearConstraint operations_research::sat::ComputeHyperplanAboveSquare | ( | AffineExpression | x, |
| AffineExpression | square, | ||
| IntegerValue | x_lb, | ||
| IntegerValue | x_ub, | ||
| Model * | model ) |
| LinearConstraint operations_research::sat::ComputeHyperplanBelowSquare | ( | AffineExpression | x, |
| AffineExpression | square, | ||
| IntegerValue | x_value, | ||
| Model * | model ) |
| IntegerValue operations_research::sat::ComputeInfinityNorm | ( | const LinearConstraint & | ct | ) |
Definition at line 230 of file linear_constraint.cc.
| int64_t operations_research::sat::ComputeInnerObjective | ( | const CpObjectiveProto & | objective, |
| absl::Span< const int64_t > | solution ) |
Definition at line 627 of file cp_model_utils.cc.
| double operations_research::sat::ComputeL2Norm | ( | const LinearConstraint & | ct | ) |
Definition at line 222 of file linear_constraint.cc.
| LinearRelaxation operations_research::sat::ComputeLinearRelaxation | ( | const CpModelProto & | model_proto, |
| Model * | m ) |
Definition at line 1922 of file linear_relaxation.cc.
| CompletionTimeExplorationStatus operations_research::sat::ComputeMinSumOfWeightedEndMins | ( | absl::Span< CompletionTimeEvent * > | events, |
| IntegerValue | capacity_max, | ||
| double | unweighted_threshold, | ||
| double | weighted_threshold, | ||
| CtExhaustiveHelper & | helper, | ||
| double & | min_sum_of_ends, | ||
| double & | min_sum_of_weighted_ends, | ||
| bool & | cut_use_precedences, | ||
| int & | exploration_credit ) |
Definition at line 1358 of file scheduling_cuts.cc.
| Coefficient operations_research::sat::ComputeNegatedCanonicalRhs | ( | Coefficient | lower_bound, |
| Coefficient | bound_shift, | ||
| Coefficient | max_value ) |
Definition at line 200 of file pb_constraint.cc.
| Coefficient operations_research::sat::ComputeObjectiveValue | ( | const LinearBooleanProblem & | problem, |
| const std::vector< bool > & | assignment ) |
Definition at line 359 of file boolean_problem.cc.
| bool operations_research::sat::ComputeResolvant | ( | Literal | x, |
| const std::vector< Literal > & | a, | ||
| const std::vector< Literal > & | b, | ||
| std::vector< Literal > * | out ) |
Definition at line 1048 of file simplification.cc.
| int operations_research::sat::ComputeResolvantSize | ( | Literal | x, |
| const std::vector< Literal > & | a, | ||
| const std::vector< Literal > & | b ) |
Definition at line 1083 of file simplification.cc.
|
inline |
Definition at line 269 of file inclusion.h.
| double operations_research::sat::ComputeTrueObjectiveLowerBound | ( | const CpModelProto & | model_proto_with_floating_point_objective, |
| const CpObjectiveProto & | integer_objective, | ||
| const int64_t | inner_integer_objective_lower_bound ) |
Definition at line 1714 of file lp_utils.cc.
| VariableRelationships operations_research::sat::ComputeVariableRelationships | ( | const CpModelProto & | model | ) |
Definition at line 211 of file primary_variables.cc.
|
inline |
Definition at line 352 of file old_precedences_propagator.h.
|
inline |
Definition at line 649 of file integer_expr.h.
|
inline |
Definition at line 635 of file integer_expr.h.
| void operations_research::sat::ConfigureSearchHeuristics | ( | Model * | model | ) |
Definition at line 1215 of file integer_search.cc.
|
inline |
| absl::string_view operations_research::sat::ConstraintCaseName | ( | ConstraintProto::ConstraintCase | constraint_case | ) |
Definition at line 499 of file cp_model_utils.cc.
| bool operations_research::sat::ConstraintIsFeasible | ( | const CpModelProto & | model, |
| const ConstraintProto & | constraint, | ||
| absl::Span< const int64_t > | variable_values ) |
Definition at line 1894 of file cp_model_checker.cc.
| void operations_research::sat::ConstructFixedSearchStrategy | ( | SearchHeuristics * | h, |
| Model * | model ) |
Definition at line 430 of file cp_model_search.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::ConstructHeuristicSearchStrategy | ( | const CpModelProto & | cp_model_proto, |
| Model * | model ) |
Definition at line 355 of file cp_model_search.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::ConstructHintSearchStrategy | ( | const CpModelProto & | cp_model_proto, |
| CpModelMapping * | mapping, | ||
| Model * | model ) |
Definition at line 411 of file cp_model_search.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::ConstructIntegerCompletionSearchStrategy | ( | absl::Span< const IntegerVariable > | variable_mapping, |
| IntegerVariable | objective_var, | ||
| Model * | model ) |
Definition at line 386 of file cp_model_search.cc.
| void operations_research::sat::ConstructOverlappingSets | ( | absl::Span< IndexedInterval > | intervals, |
| CompactVectorVector< int > * | result, | ||
| absl::Span< const int > | order ) |
Definition at line 429 of file diffn_util.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::ConstructUserSearchStrategy | ( | const CpModelProto & | cp_model_proto, |
| Model * | model ) |
Definition at line 210 of file cp_model_search.cc.
| bool operations_research::sat::ContainsLiteral | ( | absl::Span< const Literal > | clause, |
| Literal | literal ) |
Definition at line 481 of file drat_checker.cc.
| bool operations_research::sat::ConvertBinaryMPModelProtoToBooleanProblem | ( | const MPModelProto & | mp_model, |
| LinearBooleanProblem * | problem ) |
Definition at line 1471 of file lp_utils.cc.
| void operations_research::sat::ConvertBooleanProblemToLinearProgram | ( | const LinearBooleanProblem & | problem, |
| glop::LinearProgram * | lp ) |
Definition at line 1650 of file lp_utils.cc.
| bool operations_research::sat::ConvertCpModelProtoToCnf | ( | const CpModelProto & | cp_model, |
| std::string * | out ) |
Definition at line 1087 of file cp_model_utils.cc.
| bool operations_research::sat::ConvertCpModelProtoToMPModelProto | ( | const CpModelProto & | input, |
| MPModelProto * | output ) |
Definition at line 1161 of file lp_utils.cc.
| bool operations_research::sat::ConvertCpModelProtoToWCnf | ( | const CpModelProto & | cp_model, |
| std::string * | out ) |
Definition at line 1105 of file cp_model_utils.cc.
| bool operations_research::sat::ConvertMPModelProtoToCpModelProto | ( | const SatParameters & | params, |
| const MPModelProto & | mp_model, | ||
| CpModelProto * | cp_model, | ||
| SolverLogger * | logger ) |
Definition at line 929 of file lp_utils.cc.
| void operations_research::sat::CopyEverythingExceptVariablesAndConstraintsFieldsIntoContext | ( | const CpModelProto & | in_model, |
| PresolveContext * | context ) |
Definition at line 1232 of file cp_model_copy.cc.
| std::string operations_research::sat::CpModelStats | ( | const CpModelProto & | model_proto | ) |
Returns a string with some statistics on the given CpModelProto.
Definition at line 275 of file cp_model_solver.cc.
| std::string operations_research::sat::CpSatSolverVersion | ( | ) |
Returns a string that describes the version of the solver.
Definition at line 142 of file cp_model_solver.cc.
| std::string operations_research::sat::CpSolverResponseStats | ( | const CpSolverResponse & | response, |
| bool | has_objective = true ) |
Returns a string with some statistics on the solver response.
If the second argument is false, we will just display NA for the objective value instead of zero. It is not really needed but it makes things a bit clearer to see that there is no objective.
Definition at line 695 of file cp_model_solver.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::CpSolverStatus_descriptor | ( | ) |
Definition at line 1582 of file cp_model.pb.cc.
|
inline |
Definition at line 298 of file cp_model.pb.h.
|
inline |
Definition at line 311 of file cp_model.pb.h.
| const ::std::string & operations_research::sat::CpSolverStatus_Name | ( | T | value | ) |
Definition at line 304 of file cp_model.pb.h.
|
inline |
Definition at line 315 of file cp_model.pb.h.
| CutGenerator operations_research::sat::CreateAllDifferentCutGenerator | ( | absl::Span< const AffineExpression > | exprs, |
| Model * | model ) |
| std::vector< Literal > operations_research::sat::CreateAlternativeLiteralsWithView | ( | int | num_literals, |
| Model * | model, | ||
| LinearRelaxation * | relaxation ) |
Definition at line 450 of file linear_relaxation.cc.
| void operations_research::sat::CreateAndRegisterMandatoryOverlapPropagator | ( | NoOverlap2DConstraintHelper * | helper, |
| Model * | model, | ||
| GenericLiteralWatcher * | watcher, | ||
| int | priority ) |
Definition at line 103 of file 2d_mandatory_overlap_propagator.cc.
| void operations_research::sat::CreateAndRegisterTryEdgePropagator | ( | NoOverlap2DConstraintHelper * | helper, |
| Model * | model, | ||
| GenericLiteralWatcher * | watcher, | ||
| int | priority ) |
Definition at line 416 of file 2d_try_edge_propagator.cc.
| CutGenerator operations_research::sat::CreateCliqueCutGenerator | ( | absl::Span< const IntegerVariable > | base_variables, |
| Model * | model ) |
| CutGenerator operations_research::sat::CreateCumulativeCompletionTimeCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| SchedulingDemandHelper * | demands_helper, | ||
| const AffineExpression & | capacity, | ||
| Model * | model ) |
Definition at line 1904 of file scheduling_cuts.cc.
| CutGenerator operations_research::sat::CreateCumulativeEnergyCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| SchedulingDemandHelper * | demands_helper, | ||
| const AffineExpression & | capacity, | ||
| const std::optional< AffineExpression > & | makespan, | ||
| Model * | model ) |
Definition at line 606 of file scheduling_cuts.cc.
| CutGenerator operations_research::sat::CreateCumulativePrecedenceCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| SchedulingDemandHelper * | demands_helper, | ||
| const AffineExpression & | capacity, | ||
| Model * | model ) |
Definition at line 1002 of file scheduling_cuts.cc.
| CutGenerator operations_research::sat::CreateCumulativeTimeTableCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| SchedulingDemandHelper * | demands_helper, | ||
| const AffineExpression & | capacity, | ||
| Model * | model ) |
Definition at line 747 of file scheduling_cuts.cc.
| CutGenerator operations_research::sat::CreateCVRPCutGenerator | ( | int | num_nodes, |
| absl::Span< const int > | tails, | ||
| absl::Span< const int > | heads, | ||
| absl::Span< const Literal > | literals, | ||
| absl::Span< const AffineExpression > | flat_node_dim_expressions, | ||
| Model * | model ) |
Definition at line 3214 of file routing_cuts.cc.
| CutGenerator operations_research::sat::CreateFlowCutGenerator | ( | int | num_nodes, |
| const std::vector< int > & | tails, | ||
| const std::vector< int > & | heads, | ||
| const std::vector< AffineExpression > & | arc_capacities, | ||
| std::function< void(const std::vector< bool > &in_subset, IntegerValue *min_incoming_flow, IntegerValue *min_outgoing_flow)> | get_flows, | ||
| Model * | model ) |
Definition at line 3381 of file routing_cuts.cc.
| CutGenerator operations_research::sat::CreateLinMaxCutGenerator | ( | const IntegerVariable | target, |
| absl::Span< const LinearExpression > | exprs, | ||
| absl::Span< const IntegerVariable > | z_vars, | ||
| Model * | model ) |
| void operations_research::sat::CreateLinMaxFromLinearsAndObjective | ( | const CpModelProto & | model, |
| int | var_for_target, | ||
| absl::Span< const int > | linear_constraint_indexes, | ||
| bool | var_in_objective_is_negative, | ||
| ConstraintProto * | new_constraint ) |
Definition at line 136 of file primary_variables.cc.
| CutGenerator operations_research::sat::CreateMaxAffineCutGenerator | ( | LinearExpression | target, |
| IntegerVariable | var, | ||
| std::vector< std::pair< IntegerValue, IntegerValue > > | affines, | ||
| const std::string | cut_name, | ||
| Model * | model ) |
| CutGenerator operations_research::sat::CreateNoOverlap2dCompletionTimeCutGenerator | ( | NoOverlap2DConstraintHelper * | helper, |
| Model * | model ) |
Definition at line 599 of file diffn_cuts.cc.
| CutGenerator operations_research::sat::CreateNoOverlap2dEnergyCutGenerator | ( | NoOverlap2DConstraintHelper * | helper, |
| Model * | model ) |
Definition at line 310 of file diffn_cuts.cc.
| CutGenerator operations_research::sat::CreateNoOverlapCompletionTimeCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| Model * | model ) |
Definition at line 1844 of file scheduling_cuts.cc.
| CutGenerator operations_research::sat::CreateNoOverlapEnergyCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| const std::optional< AffineExpression > & | makespan, | ||
| Model * | model ) |
Definition at line 689 of file scheduling_cuts.cc.
| CutGenerator operations_research::sat::CreateNoOverlapPrecedenceCutGenerator | ( | SchedulingConstraintHelper * | helper, |
| Model * | model ) |
Definition at line 1044 of file scheduling_cuts.cc.
| CutGenerator operations_research::sat::CreatePositiveMultiplicationCutGenerator | ( | AffineExpression | z, |
| AffineExpression | x, | ||
| AffineExpression | y, | ||
| int | linearization_level, | ||
| Model * | model ) |
| std::unique_ptr< SparsePermutation > operations_research::sat::CreateSparsePermutationFromProto | ( | int | n, |
| const SparsePermutationProto & | proto ) |
Definition at line 238 of file symmetry_util.cc.
| CutGenerator operations_research::sat::CreateSquareCutGenerator | ( | AffineExpression | y, |
| AffineExpression | x, | ||
| int | linearization_level, | ||
| Model * | model ) |
| CutGenerator operations_research::sat::CreateStronglyConnectedGraphCutGenerator | ( | int | num_nodes, |
| absl::Span< const int > | tails, | ||
| absl::Span< const int > | heads, | ||
| absl::Span< const Literal > | literals, | ||
| Model * | model ) |
Definition at line 3196 of file routing_cuts.cc.
| void operations_research::sat::CreateValidModelWithSingleConstraint | ( | const ConstraintProto & | ct, |
| const PresolveContext * | context, | ||
| std::vector< int > * | variable_mapping, | ||
| CpModelProto * | mini_model ) |
Definition at line 2834 of file presolve_context.cc.
| std::vector< VariableEncodingLocalModel > operations_research::sat::CreateVariableEncodingLocalModels | ( | PresolveContext * | context | ) |
Definition at line 53 of file presolve_encoding.cc.
| std::function< void(Model *)> operations_research::sat::Cumulative | ( | const std::vector< Literal > & | enforcement_literals, |
| const std::vector< IntervalVariable > & | vars, | ||
| absl::Span< const AffineExpression > | demands, | ||
| AffineExpression | capacity, | ||
| SchedulingConstraintHelper * | helper ) |
Definition at line 45 of file cumulative.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::CumulativePrecedenceSearchHeuristic | ( | Model * | model | ) |
Definition at line 783 of file integer_search.cc.
| std::function< void(Model *)> operations_research::sat::CumulativeTimeDecomposition | ( | absl::Span< const Literal > | enforcement_literals, |
| absl::Span< const IntervalVariable > | vars, | ||
| absl::Span< const AffineExpression > | demands, | ||
| AffineExpression | capacity, | ||
| SchedulingConstraintHelper * | ) |
Definition at line 306 of file cumulative.cc.
| std::function< void(Model *)> operations_research::sat::CumulativeUsingReservoir | ( | absl::Span< const Literal > | enforcement_literals, |
| absl::Span< const IntervalVariable > | vars, | ||
| absl::Span< const AffineExpression > | demands, | ||
| AffineExpression | capacity, | ||
| SchedulingConstraintHelper * | ) |
Definition at line 392 of file cumulative.cc.
| std::vector< Rectangle > operations_research::sat::CutShapeIntoRectangles | ( | SingleShape | shape | ) |
Definition at line 1271 of file 2d_rectangle_presolve.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::DecisionStrategyProto_DomainReductionStrategy_descriptor | ( | ) |
Definition at line 1576 of file cp_model.pb.cc.
|
inline |
Definition at line 259 of file cp_model.pb.h.
|
inline |
Definition at line 272 of file cp_model.pb.h.
| const ::std::string & operations_research::sat::DecisionStrategyProto_DomainReductionStrategy_Name | ( | T | value | ) |
Definition at line 265 of file cp_model.pb.h.
|
inline |
Definition at line 276 of file cp_model.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::DecisionStrategyProto_VariableSelectionStrategy_descriptor | ( | ) |
Definition at line 1570 of file cp_model.pb.cc.
|
inline |
Definition at line 219 of file cp_model.pb.h.
|
inline |
Definition at line 232 of file cp_model.pb.h.
| const ::std::string & operations_research::sat::DecisionStrategyProto_VariableSelectionStrategy_Name | ( | T | value | ) |
Definition at line 225 of file cp_model.pb.h.
|
inline |
Definition at line 236 of file cp_model.pb.h.
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | BooleanVariable | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | ClauseIndex | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | EnforcementId | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | GateId | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | IntegerVariable | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | IntervalVariable | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | LinearExpression2Index | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | LiteralIndex | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | PositiveOnlyIndex | ) |
| operations_research::sat::DEFINE_STRONG_INDEX_TYPE | ( | ReasonIndex | ) |
| operations_research::sat::DEFINE_STRONG_INT64_TYPE | ( | Coefficient | ) |
| operations_research::sat::DEFINE_STRONG_INT64_TYPE | ( | IntegerValue | ) |
| operations_research::sat::DEFINE_STRONG_INT_TYPE | ( | ClauseId | , |
| int64_t | ) |
| bool operations_research::sat::DetectAllEncodedComplexDomain | ( | PresolveContext * | context, |
| VariableEncodingLocalModel & | local_model ) |
Definition at line 577 of file presolve_encoding.cc.
| void operations_research::sat::DetectAndAddSymmetryToProto | ( | const SatParameters & | params, |
| CpModelProto * | proto, | ||
| SolverLogger * | logger, | ||
| TimeLimit * | time_limit ) |
Definition at line 784 of file cp_model_symmetries.cc.
| bool operations_research::sat::DetectAndExploitSymmetriesInPresolve | ( | PresolveContext * | context | ) |
Definition at line 950 of file cp_model_symmetries.cc.
| RoutingCumulExpressions operations_research::sat::DetectDimensionsAndCumulExpressions | ( | int | num_nodes, |
| absl::Span< const int > | tails, | ||
| absl::Span< const int > | heads, | ||
| absl::Span< const Literal > | literals, | ||
| const ConditionalLinear2Bounds & | binary_relation_repository ) |
Definition at line 1705 of file routing_cuts.cc.
| Disjoint2dPackingResult operations_research::sat::DetectDisjointRegionIn2dPacking | ( | absl::Span< const RectangleInRange > | non_fixed_boxes, |
| absl::Span< const Rectangle > | fixed_boxes, | ||
| int | max_num_components ) |
Definition at line 1488 of file 2d_rectangle_presolve.cc.
| bool operations_research::sat::DetectEncodedComplexDomain | ( | PresolveContext * | context, |
| int | ct_index, | ||
| VariableEncodingLocalModel & | local_model, | ||
| absl::flat_hash_map< int, Domain > * | fully_encoded_domains, | ||
| bool * | changed ) |
Definition at line 401 of file presolve_encoding.cc.
| std::vector< double > operations_research::sat::DetectImpliedIntegers | ( | MPModelProto * | mp_model, |
| SolverLogger * | logger ) |
Definition at line 485 of file lp_utils.cc.
| std::optional< int > operations_research::sat::DetectMakespan | ( | absl::Span< const IntervalVariable > | intervals, |
| absl::Span< const AffineExpression > | demands, | ||
| const AffineExpression & | capacity, | ||
| Model * | model ) |
Definition at line 650 of file linear_relaxation.cc.
| void operations_research::sat::DetectOptionalVariables | ( | const CpModelProto & | model_proto, |
| Model * | m ) |
Definition at line 867 of file cp_model_loader.cc.
| void operations_research::sat::DeterministicLoop | ( | std::vector< std::unique_ptr< SubSolver > > & | subsolvers, |
| int | num_threads, | ||
| int | batch_size, | ||
| int | max_num_batches ) |
Definition at line 130 of file subsolver.cc.
| LiteralIndex operations_research::sat::DifferAtGivenLiteral | ( | const std::vector< Literal > & | a, |
| const std::vector< Literal > & | b, | ||
| Literal | l ) |
Definition at line 1014 of file simplification.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::DisjunctivePrecedenceSearchHeuristic | ( | Model * | model | ) |
Definition at line 706 of file integer_search.cc.
| void operations_research::sat::DivideByGCD | ( | LinearConstraint * | constraint | ) |
Definition at line 282 of file linear_constraint.cc.
| void operations_research::sat::DivideLinearExpression | ( | int64_t | divisor, |
| LinearExpressionProto * | expr ) |
Definition at line 82 of file cp_model_utils.cc.
|
inline |
Definition at line 819 of file integer_expr.h.
| SatSweepingResult operations_research::sat::DoFullSatSweeping | ( | const CompactVectorVector< int, Literal > & | clauses, |
| TimeLimit * | time_limit, | ||
| std::function< void(Model *)> | configure_model_before_first_solve ) |
Definition at line 311 of file sat_sweeping.cc.
| bool operations_research::sat::DomainInProtoContains | ( | const ProtoWithDomain & | proto, |
| int64_t | value ) |
Definition at line 133 of file cp_model_utils.h.
|
inline |
Definition at line 466 of file integer_base.h.
|
inline |
Definition at line 1034 of file sat_solver.h.
|
inline |
Definition at line 61 of file cp_model_utils.h.
|
inline |
Definition at line 340 of file old_precedences_propagator.h.
|
inline |
Definition at line 1009 of file sat_solver.h.
| Domain operations_research::sat::EvaluateImpliedIntProdDomain | ( | const LinearArgumentProto & | expr, |
| const PresolveContext & | context ) |
Definition at line 1548 of file cp_model_presolve.cc.
|
inline |
Definition at line 964 of file sat_solver.h.
| std::function< void(Model *)> operations_research::sat::ExactlyOnePerRowAndPerColumn | ( | absl::Span< const std::vector< Literal > > | graph | ) |
Definition at line 681 of file circuit.cc.
|
inline |
Definition at line 1100 of file sat_solver.h.
| void operations_research::sat::ExpandCpModel | ( | PresolveContext * | context | ) |
Definition at line 2808 of file cp_model_expand.cc.
| bool operations_research::sat::ExploitDominanceRelations | ( | const VarDomination & | var_domination, |
| PresolveContext * | context ) |
Definition at line 1531 of file var_domination.cc.
| bool operations_research::sat::ExpressionContainsSingleRef | ( | const LinearExpressionProto & | expr | ) |
Definition at line 640 of file cp_model_utils.cc.
| bool operations_research::sat::ExpressionIsAffine | ( | const LinearExpressionProto & | expr | ) |
Definition at line 645 of file cp_model_utils.cc.
| bool operations_research::sat::ExpressionsContainsOnlyOneVar | ( | const ExpressionList & | exprs | ) |
Definition at line 302 of file cp_model_utils.h.
|
inline |
| void operations_research::sat::ExtractAllSubsetsFromForest | ( | absl::Span< const int > | parent, |
| std::vector< int > * | subset_data, | ||
| std::vector< absl::Span< const int > > * | subsets, | ||
| int | node_limit ) |
Definition at line 2924 of file routing_cuts.cc.
| void operations_research::sat::ExtractAssignment | ( | const LinearBooleanProblem & | problem, |
| const SatSolver & | solver, | ||
| std::vector< bool > * | assignment ) |
Definition at line 63 of file boolean_problem.cc.
| std::vector< Literal > operations_research::sat::ExtractAssumptions | ( | Coefficient | stratified_lower_bound, |
| const std::vector< EncodingNode * > & | nodes, | ||
| SatSolver * | solver ) |
Definition at line 549 of file encoding.cc.
| void operations_research::sat::ExtractElementEncoding | ( | const CpModelProto & | model_proto, |
| Model * | m ) |
Definition at line 640 of file cp_model_loader.cc.
| void operations_research::sat::ExtractEncoding | ( | const CpModelProto & | model_proto, |
| Model * | m ) |
Definition at line 352 of file cp_model_loader.cc.
| void operations_research::sat::ExtractSubproblem | ( | const LinearBooleanProblem & | problem, |
| absl::Span< const int > | constraint_indices, | ||
| LinearBooleanProblem * | subproblem ) |
Definition at line 499 of file boolean_problem.cc.
| void operations_research::sat::FillDomainInProto | ( | const Domain & | domain, |
| ProtoWithDomain * | proto ) |
Definition at line 142 of file cp_model_utils.h.
| void operations_research::sat::FillDomainInProto | ( | int64_t | lb, |
| int64_t | ub, | ||
| ProtoWithDomain * | proto ) |
Definition at line 152 of file cp_model_utils.h.
| void operations_research::sat::FillDomainInProto | ( | int64_t | value, |
| ProtoWithDomain * | proto ) |
Definition at line 160 of file cp_model_utils.h.
|
inline |
Definition at line 67 of file gate_utils.h.
| void operations_research::sat::FillTightenedDomainInResponse | ( | const CpModelProto & | original_model, |
| const CpModelProto & | mapping_proto, | ||
| absl::Span< const int > | postsolve_mapping, | ||
| absl::Span< const Domain > | search_domains, | ||
| CpSolverResponse * | response, | ||
| SolverLogger * | logger ) |
Definition at line 474 of file cp_model_postsolve.cc.
| void operations_research::sat::FilterAssignedLiteral | ( | const VariablesAssignment & | assignment, |
| std::vector< Literal > * | core ) |
Definition at line 197 of file optimization.cc.
| absl::Span< int > operations_research::sat::FilterBoxesAndRandomize | ( | absl::Span< const Rectangle > | cached_rectangles, |
| absl::Span< int > | boxes, | ||
| IntegerValue | threshold_x, | ||
| IntegerValue | threshold_y, | ||
| absl::BitGenRef | random ) |
Definition at line 391 of file diffn_util.cc.
| absl::Span< int > operations_research::sat::FilterBoxesThatAreTooLarge | ( | absl::Span< const Rectangle > | cached_rectangles, |
| absl::Span< const IntegerValue > | energies, | ||
| absl::Span< int > | boxes ) |
Definition at line 407 of file diffn_util.cc.
| bool operations_research::sat::FilterOrbitOnUnusedOrFixedVariables | ( | SymmetryProto * | symmetry, |
| PresolveContext * | context ) |
Definition at line 1599 of file cp_model_symmetries.cc.
| void operations_research::sat::FinalExpansionForLinearConstraint | ( | PresolveContext * | context | ) |
Definition at line 2963 of file cp_model_expand.cc.
| double operations_research::sat::FindBestScalingAndComputeErrors | ( | absl::Span< const double > | coefficients, |
| absl::Span< const double > | lower_bounds, | ||
| absl::Span< const double > | upper_bounds, | ||
| int64_t | max_absolute_activity, | ||
| double | wanted_absolute_activity_precision, | ||
| double * | relative_coeff_error, | ||
| double * | scaled_sum_error ) |
Definition at line 868 of file lp_utils.cc.
| std::optional< std::vector< int64_t > > operations_research::sat::FindCombinedSolution | ( | const CpModelProto & | model, |
| absl::Span< const int64_t > | new_solution, | ||
| absl::Span< const int64_t > | base_solution, | ||
| const SharedResponseManager * | response_manager, | ||
| std::string * | solution_info ) |
Definition at line 50 of file combine_solutions.cc.
| void operations_research::sat::FindCpModelSymmetries | ( | const SatParameters & | params, |
| const CpModelProto & | problem, | ||
| std::vector< std::unique_ptr< SparsePermutation > > * | generators, | ||
| SolverLogger * | logger, | ||
| TimeLimit * | solver_time_limit ) |
Definition at line 658 of file cp_model_symmetries.cc.
| std::vector< std::pair< int, int > > operations_research::sat::FindDuplicateConstraints | ( | const CpModelProto & | model_proto, |
| bool | ignore_enforcement ) |
Definition at line 14705 of file cp_model_presolve.cc.
| std::vector< Rectangle > operations_research::sat::FindEmptySpaces | ( | const Rectangle & | bounding_box, |
| std::vector< Rectangle > | ocupied_rectangles ) |
Definition at line 1601 of file diffn_util.cc.
| void operations_research::sat::FindLinearBooleanProblemSymmetries | ( | const LinearBooleanProblem & | problem, |
| std::vector< std::unique_ptr< SparsePermutation > > * | generators ) |
Definition at line 683 of file boolean_problem.cc.
| std::vector< int > operations_research::sat::FindMostDiverseSubset | ( | int | k, |
| int | n, | ||
| absl::Span< const int64_t > | distances, | ||
| std::vector< int64_t > & | buffer, | ||
| int | always_pick_mask ) |
| std::optional< std::pair< int, int > > operations_research::sat::FindOneIntersectionIfPresent | ( | absl::Span< const Rectangle > | rectangles | ) |
Definition at line 2107 of file diffn_util.cc.
| std::optional< std::pair< int, int > > operations_research::sat::FindOneIntersectionIfPresentWithZeroArea | ( | absl::Span< const Rectangle > | rectangles | ) |
Definition at line 2112 of file diffn_util.cc.
| std::vector< std::pair< int, int > > operations_research::sat::FindPartialRectangleIntersections | ( | absl::Span< const Rectangle > | rectangles | ) |
Definition at line 2099 of file diffn_util.cc.
| std::vector< std::pair< int, int > > operations_research::sat::FindPartialRectangleIntersectionsImpl | ( | absl::Span< const Rectangle32 > | rectangles, |
| int32_t | y_max ) |
Definition at line 1815 of file diffn_util.cc.
| int64_t operations_research::sat::FindRationalFactor | ( | double | x, |
| int64_t | limit, | ||
| double | tolerance ) |
Definition at line 135 of file lp_utils.cc.
| FindRectanglesResult operations_research::sat::FindRectanglesWithEnergyConflictMC | ( | const std::vector< RectangleInRange > & | intervals, |
| absl::BitGenRef | random, | ||
| double | temperature, | ||
| double | candidate_energy_usage_factor ) |
Definition at line 1514 of file diffn_util.cc.
| bool operations_research::sat::FindSingleLinearDifference | ( | const LinearConstraintProto & | lin1, |
| const LinearConstraintProto & | lin2, | ||
| int * | var1, | ||
| int64_t * | coeff1, | ||
| int * | var2, | ||
| int64_t * | coeff2 ) |
Definition at line 710 of file presolve_util.cc.
| uint64_t operations_research::sat::FingerprintExpression | ( | const LinearExpressionProto & | lin, |
| uint64_t | seed ) |
Definition at line 739 of file cp_model_utils.cc.
| uint64_t operations_research::sat::FingerprintModel | ( | const CpModelProto & | model, |
| uint64_t | seed ) |
Definition at line 750 of file cp_model_utils.cc.
|
inline |
Definition at line 321 of file cp_model_utils.h.
|
inline |
Definition at line 329 of file cp_model_utils.h.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::FirstUnassignedVarAtItsMinHeuristic | ( | absl::Span< const IntegerVariable > | vars, |
| Model * | model ) |
Definition at line 173 of file integer_search.cc.
|
inline |
Definition at line 838 of file integer_expr.h.
|
inline |
Definition at line 853 of file integer_expr.h.
|
inline |
Definition at line 624 of file integer_expr.h.
| operations_research::sat::floor | ( | |P|/ | 2 | ) |
|
inline |
Definition at line 94 of file integer_base.h.
|
inline |
Definition at line 104 of file integer_base.h.
| int64_t operations_research::sat::FloorSquareRoot | ( | int64_t | a | ) |
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::FollowHint | ( | absl::Span< const BooleanOrIntegerVariable > | vars, |
| absl::Span< const IntegerValue > | values, | ||
| Model * | model ) |
Definition at line 1137 of file integer_search.cc.
|
inline |
| std::string operations_research::sat::FormatTable | ( | std::vector< std::vector< std::string > > & | table, |
| int | spacing ) |
| EncodingNode operations_research::sat::FullMerge | ( | Coefficient | upper_bound, |
| EncodingNode * | a, | ||
| EncodingNode * | b, | ||
| SatSolver * | solver ) |
Definition at line 390 of file encoding.cc.
| std::vector< std::vector< absl::InlinedVector< int64_t, 2 > > > operations_research::sat::FullyCompressTuples | ( | absl::Span< const int64_t > | domain_sizes, |
| std::vector< std::vector< int64_t > > * | tuples ) |
Definition at line 321 of file cp_model_table.cc.
|
inline |
| void operations_research::sat::GenerateCompletionTimeCutsWithEnergy | ( | absl::string_view | cut_name, |
| const util_intops::StrongVector< IntegerVariable, double > & | lp_values, | ||
| absl::Span< std::unique_ptr< CompletionTimeEvent > > | events, | ||
| IntegerValue | capacity_max, | ||
| Model * | model, | ||
| TopNCuts & | top_n_cuts, | ||
| std::vector< CompletionTimeEvent > & | residual_event_storage ) |
Definition at line 1678 of file scheduling_cuts.cc.
| void operations_research::sat::GenerateCumulativeEnergeticCuts | ( | absl::string_view | cut_name, |
| const util_intops::StrongVector< IntegerVariable, double > & | lp_values, | ||
| absl::Span< std::unique_ptr< EnergyEvent > > | events, | ||
| const AffineExpression & | capacity, | ||
| TimeLimit * | time_limit, | ||
| Model * | model, | ||
| TopNCuts & | top_n_cuts ) |
Definition at line 516 of file scheduling_cuts.cc.
| void operations_research::sat::GenerateCumulativeEnergeticCutsWithMakespanAndFixedCapacity | ( | absl::string_view | cut_name, |
| const util_intops::StrongVector< IntegerVariable, double > & | lp_values, | ||
| absl::Span< std::unique_ptr< EnergyEvent > > | events, | ||
| IntegerValue | capacity, | ||
| AffineExpression | makespan, | ||
| TimeLimit * | time_limit, | ||
| Model * | model, | ||
| TopNCuts & | top_n_cuts ) |
Definition at line 340 of file scheduling_cuts.cc.
| void operations_research::sat::GenerateCutsBetweenPairOfNonOverlappingTasks | ( | absl::string_view | cut_name, |
| bool | ignore_zero_size_intervals, | ||
| const util_intops::StrongVector< IntegerVariable, double > & | lp_values, | ||
| absl::Span< std::unique_ptr< CachedIntervalData > > | events, | ||
| IntegerValue | capacity_max, | ||
| Model * | model, | ||
| TopNCuts & | top_n_cuts ) |
Definition at line 902 of file scheduling_cuts.cc.
| Graph * operations_research::sat::GenerateGraphForSymmetryDetection | ( | const LinearBooleanProblem & | problem, |
| std::vector< int > * | initial_equivalence_classes ) |
Definition at line 545 of file boolean_problem.cc.
| void operations_research::sat::GenerateInterestingSubsets | ( | int | num_nodes, |
| absl::Span< const std::pair< int, int > > | arcs, | ||
| int | stop_at_num_components, | ||
| std::vector< int > * | subset_data, | ||
| std::vector< absl::Span< const int > > * | subsets ) |
Definition at line 2864 of file routing_cuts.cc.
| std::vector< ItemWithVariableSize > operations_research::sat::GenerateItemsRectanglesWithNoPairwiseConflict | ( | absl::Span< const Rectangle > | rectangles, |
| double | slack_factor, | ||
| absl::BitGenRef | random ) |
Definition at line 181 of file 2d_orthogonal_packing_testing.cc.
| std::vector< ItemWithVariableSize > operations_research::sat::GenerateItemsRectanglesWithNoPairwisePropagation | ( | int | num_rectangles, |
| double | slack_factor, | ||
| absl::BitGenRef | random ) |
Definition at line 204 of file 2d_orthogonal_packing_testing.cc.
| std::vector< Rectangle > operations_research::sat::GenerateNonConflictingRectangles | ( | int | num_rectangles, |
| absl::BitGenRef | random ) |
Definition at line 33 of file 2d_orthogonal_packing_testing.cc.
| std::vector< Rectangle > operations_research::sat::GenerateNonConflictingRectanglesWithPacking | ( | std::pair< IntegerValue, IntegerValue > | bb, |
| int | average_num_boxes, | ||
| absl::BitGenRef | random ) |
Definition at line 83 of file 2d_orthogonal_packing_testing.cc.
| void operations_research::sat::GenerateNoOvelap2dCompletionTimeCuts | ( | absl::string_view | cut_name, |
| std::vector< DiffnCtEvent > | events, | ||
| bool | use_lifting, | ||
| Model * | model, | ||
| LinearConstraintManager * | manager ) |
Definition at line 428 of file diffn_cuts.cc.
| void operations_research::sat::GenerateNoOverlap2dEnergyCut | ( | absl::Span< const std::vector< LiteralValueValue > > | energies, |
| absl::Span< const int > | rectangles, | ||
| absl::string_view | cut_name, | ||
| Model * | model, | ||
| LinearConstraintManager * | manager, | ||
| SchedulingConstraintHelper * | x_helper, | ||
| SchedulingConstraintHelper * | y_helper, | ||
| SchedulingDemandHelper * | y_demands_helper ) |
Definition at line 139 of file diffn_cuts.cc.
| Neighborhood operations_research::sat::GenerateSchedulingNeighborhoodFromIntervalPrecedences | ( | const absl::Span< const std::pair< int, int > > | precedences, |
| const CpSolverResponse & | initial_solution, | ||
| const NeighborhoodGeneratorHelper & | helper ) |
Definition at line 2105 of file cp_model_lns.cc.
| Neighborhood operations_research::sat::GenerateSchedulingNeighborhoodFromRelaxedIntervals | ( | absl::Span< const int > | intervals_to_relax, |
| absl::Span< const int > | variables_to_fix, | ||
| const CpSolverResponse & | initial_solution, | ||
| absl::BitGenRef | random, | ||
| const NeighborhoodGeneratorHelper & | helper ) |
Definition at line 2167 of file cp_model_lns.cc.
| ABSL_MUST_USE_RESULT bool operations_research::sat::GenerateShortCompletionTimeCutsWithExactBound | ( | absl::string_view | cut_name, |
| const util_intops::StrongVector< IntegerVariable, double > & | lp_values, | ||
| absl::Span< std::unique_ptr< CompletionTimeEvent > > | events, | ||
| IntegerValue | capacity_max, | ||
| CtExhaustiveHelper & | helper, | ||
| Model * | model, | ||
| TopNCuts & | top_n_cuts, | ||
| std::vector< CompletionTimeEvent > & | residual_event_storage ) |
Definition at line 1429 of file scheduling_cuts.cc.
| IntegerValue operations_research::sat::GetCoefficient | ( | const IntegerVariable | var, |
| const LinearExpression & | expr ) |
Definition at line 444 of file linear_constraint.cc.
| IntegerValue operations_research::sat::GetCoefficientOfPositiveVar | ( | const IntegerVariable | var, |
| const LinearExpression & | expr ) |
Definition at line 456 of file linear_constraint.cc.
| std::pair< IntegerValue, IntegerValue > operations_research::sat::GetDifferenceBounds | ( | const NodeExpression & | x_expr, |
| const NodeExpression & | y_expr, | ||
| const sat::Relation & | r, | ||
| const std::pair< IntegerValue, IntegerValue > & | x_var_bounds, | ||
| const std::pair< IntegerValue, IntegerValue > & | y_var_bounds ) |
Definition at line 1768 of file routing_cuts.cc.
| IntegerValue operations_research::sat::GetFactorT | ( | IntegerValue | rhs_remainder, |
| IntegerValue | divisor, | ||
| IntegerValue | max_magnitude ) |
| std::vector< SatParameters > operations_research::sat::GetFirstSolutionBaseParams | ( | const SatParameters & | base_params | ) |
Definition at line 1033 of file cp_model_search.cc.
| std::vector< SatParameters > operations_research::sat::GetFullWorkerParameters | ( | const SatParameters & | base_params, |
| const CpModelProto & | cp_model, | ||
| int | num_already_present, | ||
| SubsolverNameFilter * | filter ) |
Definition at line 844 of file cp_model_search.cc.
|
inline |
Definition at line 253 of file cp_model_utils.h.
| std::vector< int > operations_research::sat::GetIntervalArticulationPoints | ( | std::vector< IndexedInterval > * | intervals | ) |
Definition at line 535 of file diffn_util.cc.
| absl::flat_hash_map< std::string, SatParameters > operations_research::sat::GetNamedParameters | ( | SatParameters | base_params | ) |
Definition at line 505 of file cp_model_search.cc.
|
inline |
Definition at line 30 of file gate_utils.h.
| std::vector< int > operations_research::sat::GetOrbitopeOrbits | ( | int | n, |
| absl::Span< const std::vector< int > > | orbitope ) |
Definition at line 189 of file symmetry_util.cc.
| std::vector< int > operations_research::sat::GetOrbits | ( | int | n, |
| absl::Span< const std::unique_ptr< SparsePermutation > > | generators ) |
Definition at line 154 of file symmetry_util.cc.
| void operations_research::sat::GetOverlappingIntervalComponents | ( | std::vector< IndexedInterval > * | intervals, |
| std::vector< std::vector< int > > * | components ) |
Definition at line 502 of file diffn_util.cc.
| CompactVectorVector< int > operations_research::sat::GetOverlappingRectangleComponents | ( | absl::Span< const Rectangle > | rectangles | ) |
Definition at line 112 of file diffn_util.cc.
|
inline |
Definition at line 189 of file integer_base.h.
| IndexReferences operations_research::sat::GetReferencesUsedByConstraint | ( | const ConstraintProto & | ct | ) |
Definition at line 104 of file cp_model_utils.cc.
| void operations_research::sat::GetReferencesUsedByConstraint | ( | const ConstraintProto & | ct, |
| std::vector< int > * | variables, | ||
| std::vector< int > * | literals ) |
Definition at line 110 of file cp_model_utils.cc.
| void operations_research::sat::GetRelationshipForConstraint | ( | const ConstraintProto & | ct, |
| absl::btree_set< int > * | deducible_vars, | ||
| absl::btree_set< int > * | input_vars, | ||
| int * | preferred_to_deduce ) |
Definition at line 52 of file primary_variables.cc.
| ReducedDomainNeighborhood operations_research::sat::GetRinsRensNeighborhood | ( | const SharedResponseManager * | response_manager, |
| const SharedLPSolutionRepository * | lp_solutions, | ||
| SharedIncompleteSolutionManager * | incomplete_solutions, | ||
| double | difficulty, | ||
| absl::BitGenRef | random ) |
| void operations_research::sat::GetSchreierVectorAndOrbit | ( | int | point, |
| absl::Span< const std::unique_ptr< SparsePermutation > > | generators, | ||
| std::vector< int > * | schrier_vector, | ||
| std::vector< int > * | orbit ) |
Definition at line 201 of file symmetry_util.cc.
| int operations_research::sat::GetSingleRefFromExpression | ( | const LinearExpressionProto & | expr | ) |
Definition at line 651 of file cp_model_utils.cc.
| std::vector< int64_t > operations_research::sat::GetSolutionValues | ( | const CpModelProto & | model_proto, |
| const Model & | model ) |
Definition at line 314 of file cp_model_solver_helpers.cc.
| std::function< IntegerValue(IntegerValue)> operations_research::sat::GetSuperAdditiveRoundingFunction | ( | IntegerValue | rhs_remainder, |
| IntegerValue | divisor, | ||
| IntegerValue | t, | ||
| IntegerValue | max_scaling ) |
| std::function< IntegerValue(IntegerValue)> operations_research::sat::GetSuperAdditiveStrengtheningFunction | ( | IntegerValue | positive_rhs, |
| IntegerValue | min_magnitude ) |
| std::function< IntegerValue(IntegerValue)> operations_research::sat::GetSuperAdditiveStrengtheningMirFunction | ( | IntegerValue | positive_rhs, |
| IntegerValue | scaling ) |
|
inline |
| IntegerLiteral operations_research::sat::GreaterOrEqualToMiddleValue | ( | IntegerVariable | var, |
| IntegerTrail * | integer_trail ) |
Definition at line 80 of file integer_search.cc.
|
inline |
Definition at line 138 of file cp_constraints.h.
| std::vector< int > operations_research::sat::GreedyFastDecreasingGcd | ( | const absl::Span< const int64_t > | coeffs | ) |
Definition at line 69 of file diophantine.cc.
|
inline |
Definition at line 58 of file cp_model_utils.h.
| std::vector< std::pair< int, int > > operations_research::sat::HeuristicallySplitLongLinear | ( | absl::Span< const int64_t > | coeffs | ) |
|
inline |
Definition at line 1002 of file sat_solver.h.
| bool operations_research::sat::ImportModelAndDomainsWithBasicPresolveIntoContext | ( | const CpModelProto & | in_model, |
| absl::Span< const Domain > | domains, | ||
| std::function< bool(int)> | active_constraints, | ||
| PresolveContext * | context, | ||
| std::vector< int > * | interval_mapping ) |
Definition at line 1214 of file cp_model_copy.cc.
| bool operations_research::sat::ImportModelWithBasicPresolveIntoContext | ( | const CpModelProto & | in_model, |
| PresolveContext * | context, | ||
| LratProofHandler * | lrat_proof_handler ) |
Definition at line 1201 of file cp_model_copy.cc.
| operations_research::sat::InclusionDetector | ( | const Storage & | storage | ) | ->InclusionDetector< Storage > |
| void operations_research::sat::IncreaseNodeSize | ( | EncodingNode * | node, |
| SatSolver * | solver ) |
Definition at line 291 of file encoding.cc.
| void operations_research::sat::InitializeDebugSolution | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 129 of file cp_model_solver_helpers.cc.
|
inline |
Definition at line 113 of file cp_model_utils.h.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::InstrumentSearchStrategy | ( | const CpModelProto & | cp_model_proto, |
| absl::Span< const IntegerVariable > | variable_mapping, | ||
| std::function< BooleanOrIntegerLiteral()> | instrumented_strategy, | ||
| Model * | model ) |
Definition at line 448 of file cp_model_search.cc.
|
inline |
Definition at line 193 of file integer_base.h.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::IntegerValueSelectionHeuristic | ( | std::function< BooleanOrIntegerLiteral()> | var_selection_heuristic, |
| Model * | model ) |
Definition at line 376 of file integer_search.cc.
| bool operations_research::sat::IntervalIsVariable | ( | const IntervalVariable | interval, |
| IntervalsRepository * | intervals_repository ) |
Definition at line 1700 of file linear_relaxation.cc.
|
inline |
Definition at line 81 of file integer_base.h.
| bool operations_research::sat::IsAffineIntAbs | ( | const ConstraintProto & | ct | ) |
Definition at line 1155 of file cp_model_utils.cc.
| bool operations_research::sat::IsAssignmentValid | ( | const LinearBooleanProblem & | problem, |
| const std::vector< bool > & | assignment ) |
Definition at line 373 of file boolean_problem.cc.
|
inline |
Definition at line 786 of file integer_expr.h.
|
inline |
|
inline |
Definition at line 85 of file gate_utils.h.
|
inline |
| bool operations_research::sat::IsObjectiveConstraining | ( | const CpModelProto & | model | ) |
Definition at line 187 of file primary_variables.cc.
|
inline |
Definition at line 254 of file intervals.h.
|
inline |
Definition at line 260 of file intervals.h.
| const Coefficient operations_research::sat::kCoefficientMax | ( | std::numeric_limits< Coefficient::ValueType > | ::max() | ) |
| const LiteralIndex operations_research::sat::kFalseLiteralIndex | ( | - | 3 | ) |
|
constexpr |
|
constexpr |
| const BooleanVariable operations_research::sat::kNoBooleanVariable | ( | - | 1 | ) |
|
constexpr |
| const ClauseIndex operations_research::sat::kNoClauseIndex | ( | - | 1 | ) |
| const IntegerVariable operations_research::sat::kNoIntegerVariable | ( | - | 1 | ) |
| const IntervalVariable operations_research::sat::kNoIntervalVariable | ( | - | 1 | ) |
| const LinearExpression2Index operations_research::sat::kNoLinearExpression2Index | ( | - | 1 | ) |
| const LiteralIndex operations_research::sat::kNoLiteralIndex | ( | - | 1 | ) |
| const LiteralIndex operations_research::sat::kTrueLiteralIndex | ( | - | 2 | ) |
| EncodingNode operations_research::sat::LazyMerge | ( | EncodingNode * | a, |
| EncodingNode * | b, | ||
| SatSolver * | solver ) |
Definition at line 281 of file encoding.cc.
| EncodingNode * operations_research::sat::LazyMergeAllNodeWithPQAndIncreaseLb | ( | Coefficient | weight, |
| const std::vector< EncodingNode * > & | nodes, | ||
| SatSolver * | solver, | ||
| std::deque< EncodingNode > * | repository ) |
Definition at line 463 of file encoding.cc.
|
inline |
Definition at line 91 of file precedences.h.
| std::string operations_research::sat::LinearBooleanProblemToCnfString | ( | const LinearBooleanProblem & | problem | ) |
Definition at line 403 of file boolean_problem.cc.
| int64_t operations_research::sat::LinearExpressionGcd | ( | const LinearExpressionProto & | expr, |
| int64_t | gcd ) |
Definition at line 74 of file cp_model_utils.cc.
| bool operations_research::sat::LinearExpressionProtosAreEqual | ( | const LinearExpressionProto & | a, |
| const LinearExpressionProto & | b, | ||
| int64_t | b_scaling ) |
Definition at line 722 of file cp_model_utils.cc.
| bool operations_research::sat::LinearInequalityCanBeReducedWithClosestMultiple | ( | int64_t | base, |
| absl::Span< const int64_t > | coeffs, | ||
| absl::Span< const int64_t > | lbs, | ||
| absl::Span< const int64_t > | ubs, | ||
| int64_t | rhs, | ||
| int64_t * | new_rhs ) |
| bool operations_research::sat::LinearizedPartIsLarge | ( | Model * | model | ) |
Definition at line 360 of file integer_search.cc.
|
inline |
Definition at line 359 of file presolve_util.h.
|
inline |
Definition at line 164 of file sat_base.h.
| void operations_research::sat::LiteralsToLinear | ( | absl::Span< const int > | literals, |
| int64_t | lb, | ||
| int64_t | ub, | ||
| LinearConstraintProto * | linear ) |
Definition at line 685 of file cp_model_utils.cc.
|
inline |
Definition at line 127 of file cp_constraints.h.
| void operations_research::sat::LoadAllDiffConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1487 of file cp_model_loader.cc.
| void operations_research::sat::LoadAlwaysFalseConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1496 of file cp_model_loader.cc.
| bool operations_research::sat::LoadAndConsumeBooleanProblem | ( | LinearBooleanProblem * | problem, |
| SatSolver * | solver ) |
Definition at line 272 of file boolean_problem.cc.
| void operations_research::sat::LoadAtMostOneConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 996 of file cp_model_loader.cc.
| void operations_research::sat::LoadBaseModel | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 1299 of file cp_model_solver_helpers.cc.
| void operations_research::sat::LoadBoolAndConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 982 of file cp_model_loader.cc.
| bool operations_research::sat::LoadBooleanProblem | ( | const LinearBooleanProblem & | problem, |
| SatSolver * | solver ) |
Definition at line 232 of file boolean_problem.cc.
| void operations_research::sat::LoadBooleanSymmetries | ( | const CpModelProto & | model_proto, |
| Model * | m ) |
Definition at line 283 of file cp_model_loader.cc.
| void operations_research::sat::LoadBoolOrConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 969 of file cp_model_loader.cc.
| void operations_research::sat::LoadBoolXorConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1016 of file cp_model_loader.cc.
| void operations_research::sat::LoadCircuitConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1666 of file cp_model_loader.cc.
| void operations_research::sat::LoadCircuitCoveringConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
|
inline |
Definition at line 666 of file integer_expr.h.
| bool operations_research::sat::LoadConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1697 of file cp_model_loader.cc.
| void operations_research::sat::LoadCpModel | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 1465 of file cp_model_solver_helpers.cc.
| void operations_research::sat::LoadCumulativeConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1631 of file cp_model_loader.cc.
| void operations_research::sat::LoadDebugSolution | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 108 of file cp_model_solver_helpers.cc.
| void operations_research::sat::LoadExactlyOneConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1006 of file cp_model_loader.cc.
| void operations_research::sat::LoadFeasibilityPump | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 1431 of file cp_model_solver_helpers.cc.
| void operations_research::sat::LoadIntDivConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1555 of file cp_model_loader.cc.
| void operations_research::sat::LoadIntMaxConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
| void operations_research::sat::LoadIntMinConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
| void operations_research::sat::LoadIntModConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1578 of file cp_model_loader.cc.
| void operations_research::sat::LoadIntProdConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1508 of file cp_model_loader.cc.
| void operations_research::sat::LoadLinearConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1215 of file cp_model_loader.cc.
|
inline |
Definition at line 690 of file integer_expr.h.
| void operations_research::sat::LoadLinMaxConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1593 of file cp_model_loader.cc.
| bool operations_research::sat::LoadModelForPresolve | ( | const CpModelProto & | model_proto, |
| SatParameters | params, | ||
| PresolveContext * | context, | ||
| Model * | local_model, | ||
| absl::string_view | name_for_logging ) |
Definition at line 2619 of file presolve_context.cc.
| bool operations_research::sat::LoadModelForProbing | ( | PresolveContext * | context, |
| Model * | local_model ) |
Definition at line 2606 of file presolve_context.cc.
| void operations_research::sat::LoadNoOverlap2dConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1618 of file cp_model_loader.cc.
| void operations_research::sat::LoadNoOverlapConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1612 of file cp_model_loader.cc.
| void operations_research::sat::LoadReservoirConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1643 of file cp_model_loader.cc.
| void operations_research::sat::LoadRoutesConstraint | ( | const ConstraintProto & | ct, |
| Model * | m ) |
Definition at line 1681 of file cp_model_loader.cc.
| void operations_research::sat::LoadSubcircuitConstraint | ( | int | num_nodes, |
| absl::Span< const int > | tails, | ||
| absl::Span< const int > | heads, | ||
| absl::Span< const Literal > | enforcement_literals, | ||
| absl::Span< const Literal > | literals, | ||
| Model * | model, | ||
| bool | multiple_subcircuit_through_zero ) |
Definition at line 720 of file circuit.cc.
| void operations_research::sat::LoadVariables | ( | const CpModelProto & | model_proto, |
| bool | view_all_booleans_as_integers, | ||
| Model * | m ) |
Definition at line 101 of file cp_model_loader.cc.
| bool operations_research::sat::LookForTrivialSatSolution | ( | double | deterministic_time_limit, |
| Model * | model, | ||
| SolverLogger * | logger ) |
Definition at line 1084 of file probing.cc.
|
inline |
|
inline |
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::LpPseudoCostHeuristic | ( | Model * | model | ) |
Definition at line 240 of file integer_search.cc.
| void operations_research::sat::MakeAllLiteralsPositive | ( | LinearBooleanProblem * | problem | ) |
Definition at line 648 of file boolean_problem.cc.
| void operations_research::sat::MakeAllVariablesPositive | ( | LinearConstraint * | constraint | ) |
Definition at line 299 of file linear_constraint.cc.
| bool operations_research::sat::MakeBoundsOfIntegerVariablesInteger | ( | const SatParameters & | params, |
| MPModelProto * | mp_model, | ||
| SolverLogger * | logger ) |
Definition at line 207 of file lp_utils.cc.
| std::vector< RectangleInRange > operations_research::sat::MakeItemsFromRectangles | ( | absl::Span< const Rectangle > | rectangles, |
| double | slack_factor, | ||
| absl::BitGenRef | random ) |
Definition at line 148 of file 2d_orthogonal_packing_testing.cc.
| Coefficient operations_research::sat::MaxNodeWeightSmallerThan | ( | const std::vector< EncodingNode * > & | nodes, |
| Coefficient | upper_bound ) |
Definition at line 576 of file encoding.cc.
|
inline |
Definition at line 248 of file intervals.h.
| std::pair< int, int > operations_research::sat::MaybeFillMissingRoutesConstraintNodeExpressions | ( | const CpModelProto & | input_model, |
| CpModelProto & | output_model ) |
Definition at line 1949 of file routing_cuts.cc.
| bool operations_research::sat::MaybeTransferLinear1ToAnotherVariable | ( | VariableEncodingLocalModel & | local_model, |
| PresolveContext * | context ) |
Definition at line 600 of file presolve_encoding.cc.
| EncodingNode * operations_research::sat::MergeAllNodesWithDeque | ( | Coefficient | upper_bound, |
| const std::vector< EncodingNode * > & | nodes, | ||
| SatSolver * | solver, | ||
| std::deque< EncodingNode > * | repository ) |
Definition at line 441 of file encoding.cc.
|
inline |
Definition at line 425 of file linear_constraint.h.
Definition at line 3140 of file sat_solver.cc.
| void operations_research::sat::MinimizeCoreWithPropagation | ( | TimeLimit * | limit, |
| SatSolver * | solver, | ||
| std::vector< Literal > * | core ) |
Definition at line 58 of file optimization.cc.
| void operations_research::sat::MinimizeCoreWithSearch | ( | TimeLimit * | limit, |
| SatSolver * | solver, | ||
| std::vector< Literal > * | core ) |
Definition at line 112 of file optimization.cc.
| SatSolver::Status operations_research::sat::MinimizeIntegerVariableWithLinearScanAndLazyEncoding | ( | IntegerVariable | objective_var, |
| const std::function< void()> & | feasible_solution_observer, | ||
| Model * | model ) |
Definition at line 212 of file optimization.cc.
| void operations_research::sat::MinimizeL1DistanceWithHint | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 1972 of file cp_model_solver_helpers.cc.
|
inline |
Definition at line 242 of file intervals.h.
| int64_t operations_research::sat::ModularInverse | ( | int64_t | x, |
| int64_t | m ) |
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::MostFractionalHeuristic | ( | Model * | model | ) |
Definition at line 187 of file integer_search.cc.
| int operations_research::sat::MoveOneUnprocessedLiteralLast | ( | const absl::btree_set< LiteralIndex > & | processed, |
| int | relevant_prefix_size, | ||
| std::vector< Literal > * | literals ) |
| bool operations_research::sat::MPModelProtoValidationBeforeConversion | ( | const SatParameters & | params, |
| const MPModelProto & | mp_model, | ||
| SolverLogger * | logger ) |
Definition at line 421 of file lp_utils.cc.
|
inline |
Definition at line 53 of file cp_model_utils.h.
| std::vector< IntegerVariable > operations_research::sat::NegationOf | ( | absl::Span< const IntegerVariable > | vars | ) |
Definition at line 52 of file integer.cc.
| LinearExpression operations_research::sat::NegationOf | ( | const LinearExpression & | expr | ) |
Definition at line 421 of file linear_constraint.cc.
|
inline |
Definition at line 175 of file integer_base.h.
|
inline |
Definition at line 87 of file precedences.h.
| std::function< void(Model *)> operations_research::sat::NewBestBoundCallback | ( | const std::function< void(double)> & | callback | ) |
Creates a callbacks that will be called on each new best objective bound found. It is guaranteed that the best bound is strictly improving.
Note that this function is called before the update takes place.
Definition at line 2265 of file cp_model_solver.cc.
|
inline |
| std::function< void(Model *)> operations_research::sat::NewFeasibleSolutionLogCallback | ( | const std::function< std::string(const CpSolverResponse &response)> & | callback | ) |
Creates a callbacks that will append a string to the search log when reporting a new solution.
The given function will be called on each improving feasible solution found during the search. For a non-optimization problem, if the option to find all solution was set, then this will be called on each new solution.
Definition at line 2257 of file cp_model_solver.cc.
| std::function< void(Model *)> operations_research::sat::NewFeasibleSolutionObserver | ( | const std::function< void(const CpSolverResponse &response)> & | callback | ) |
Creates a solution observer with the model with model.Add(NewFeasibleSolutionObserver([](response){...}));
The given function will be called on each improving feasible solution found during the search. For a non-optimization problem, if the option to find all solution was set, then this will be called on each new solution.
WARNING: Except when enumerate_all_solution() is true, one shouldn't rely on this to get a set of "diverse" solutions since any future change to the solver might completely kill any diversity in the set of solutions observed.
Valid usage of this includes implementing features like:
Definition at line 2250 of file cp_model_solver.cc.
|
inline |
|
inline |
Definition at line 267 of file intervals.h.
|
inline |
Definition at line 282 of file intervals.h.
|
inline |
Definition at line 290 of file intervals.h.
|
inline |
Definition at line 302 of file intervals.h.
|
inline |
Definition at line 323 of file intervals.h.
|
inline |
Definition at line 333 of file intervals.h.
| std::function< SatParameters(Model *)> operations_research::sat::NewSatParameters | ( | absl::string_view | params | ) |
Creates parameters for the solver, which you can add to the model with
before calling SolveCpModel().
Definition at line 2285 of file cp_model_solver.cc.
| std::function< SatParameters(Model *)> operations_research::sat::NewSatParameters | ( | absl::string_view | params | ) |
Creates parameters for the solver, which you can add to the model with
before calling SolveCpModel().
Definition at line 2285 of file cp_model_solver.cc.
| std::function< SatParameters(Model *)> operations_research::sat::NewSatParameters | ( | const sat::SatParameters & | parameters | ) |
Definition at line 2294 of file cp_model_solver.cc.
|
inline |
Definition at line 711 of file integer_expr.h.
| bool operations_research::sat::NoDuplicateVariable | ( | const LinearConstraint & | ct | ) |
Definition at line 365 of file linear_constraint.cc.
| void operations_research::sat::NonDeterministicLoop | ( | std::vector< std::unique_ptr< SubSolver > > & | subsolvers, |
| const int | num_threads, | ||
| ModelSharedTimeLimit * | time_limit ) |
Definition at line 195 of file subsolver.cc.
| int64_t operations_research::sat::NoOverlapMinRepairDistance | ( | const ConstraintProto & | interval1, |
| const ConstraintProto & | interval2, | ||
| absl::Span< const int64_t > | solution ) |
Definition at line 1197 of file constraint_violation.cc.
A convenient wrapper so we can write Not(x) instead of x.Not() which is sometimes clearer.
Definition at line 87 of file cp_model.cc.
| void operations_research::sat::OpenSourceEraseIf | ( | Container & | c, |
| Pred | pred ) |
|
inline |
Definition at line 1366 of file cp_model.h.
|
inline |
Definition at line 1361 of file cp_model.h.
|
inline |
Definition at line 1280 of file cp_model.h.
|
inline |
Definition at line 1276 of file cp_model.h.
|
inline |
Definition at line 1292 of file cp_model.h.
|
inline |
Definition at line 1303 of file cp_model.h.
|
inline |
Definition at line 1234 of file cp_model.h.
|
inline |
Definition at line 1243 of file cp_model.h.
|
inline |
Definition at line 1323 of file cp_model.h.
|
inline |
Definition at line 1298 of file cp_model.h.
|
inline |
Definition at line 1308 of file cp_model.h.
|
inline |
Definition at line 1319 of file cp_model.h.
|
inline |
Definition at line 1239 of file cp_model.h.
|
inline |
Definition at line 1247 of file cp_model.h.
|
inline |
Definition at line 1328 of file cp_model.h.
|
inline |
Definition at line 1339 of file cp_model.h.
|
inline |
Definition at line 1257 of file cp_model.h.
|
inline |
Definition at line 1266 of file cp_model.h.
|
inline |
Definition at line 1355 of file cp_model.h.
|
inline |
Definition at line 1334 of file cp_model.h.
|
inline |
Definition at line 1345 of file cp_model.h.
|
inline |
Definition at line 1351 of file cp_model.h.
|
inline |
Definition at line 1287 of file cp_model.h.
|
inline |
Definition at line 1262 of file cp_model.h.
|
inline |
Definition at line 1271 of file cp_model.h.
|
inline |
Definition at line 1232 of file cp_model.h.
|
inline |
Definition at line 259 of file integer_base.h.
|
inline |
Definition at line 129 of file sat_base.h.
|
inline |
Definition at line 145 of file sat_base.h.
| std::ostream & operations_research::sat::operator<< | ( | std::ostream & | os, |
| const BoolVar & | var ) |
Definition at line 89 of file cp_model.cc.
| std::ostream & operations_research::sat::operator<< | ( | std::ostream & | os, |
| const DoubleLinearExpr & | e ) |
Definition at line 489 of file cp_model.cc.
| std::ostream & operations_research::sat::operator<< | ( | std::ostream & | os, |
| const EnforcementStatus & | e ) |
Definition at line 32 of file enforcement.cc.
| std::ostream & operations_research::sat::operator<< | ( | std::ostream & | os, |
| const IntervalVar & | var ) |
Definition at line 645 of file cp_model.cc.
| std::ostream & operations_research::sat::operator<< | ( | std::ostream & | os, |
| const IntVar & | var ) |
Definition at line 171 of file cp_model.cc.
|
inline |
Definition at line 147 of file linear_constraint.h.
| std::ostream & operations_research::sat::operator<< | ( | std::ostream & | os, |
| const LinearExpr & | e ) |
Definition at line 318 of file cp_model.cc.
| std::ostream & operations_research::sat::operator<< | ( | std::ostream & | os, |
| const ValueLiteralPair & | p ) |
Definition at line 66 of file integer.cc.
|
inline |
Definition at line 254 of file integer_base.h.
|
inline |
Definition at line 119 of file sat_base.h.
|
inline |
Definition at line 70 of file pb_constraint.h.
|
inline |
Definition at line 1120 of file sat_solver.h.
|
inline |
Definition at line 357 of file routing_cuts.h.
|
inline |
Definition at line 383 of file cp_model_utils.h.
|
inline |
Definition at line 404 of file cp_model_utils.h.
| int64_t operations_research::sat::OverlapOfTwoIntervals | ( | const ConstraintProto & | interval1, |
| const ConstraintProto & | interval2, | ||
| absl::Span< const int64_t > | solution ) |
Definition at line 1172 of file constraint_violation.cc.
|
inline |
Definition at line 165 of file cp_constraints.h.
| std::vector< Rectangle > operations_research::sat::PavedRegionDifference | ( | std::vector< Rectangle > | original_region, |
| absl::Span< const Rectangle > | area_to_remove ) |
Definition at line 1612 of file diffn_util.cc.
|
inline |
Definition at line 95 of file precedences.h.
| int64_t operations_research::sat::PositiveMod | ( | int64_t | x, |
| int64_t | m ) |
|
inline |
Definition at line 54 of file cp_model_utils.h.
|
inline |
Definition at line 138 of file integer_base.h.
| LinearExpression operations_research::sat::PositiveVarExpr | ( | const LinearExpression & | expr | ) |
Definition at line 429 of file linear_constraint.cc.
|
inline |
Definition at line 183 of file integer_base.h.
| bool operations_research::sat::PossibleIntegerOverflow | ( | const CpModelProto & | model, |
| absl::Span< const int > | vars, | ||
| absl::Span< const int64_t > | coeffs, | ||
| int64_t | offset, | ||
| std::pair< int64_t, int64_t > * | implied_domain ) |
Definition at line 1063 of file cp_model_checker.cc.
| bool operations_research::sat::PossibleOverflow | ( | const IntegerTrail & | integer_trail, |
| const LinearConstraint & | constraint ) |
Definition at line 467 of file linear_constraint.cc.
| void operations_research::sat::PostsolveClause | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 40 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveElement | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 291 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveExactlyOne | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 67 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveIntMod | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 334 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveIntProd | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 350 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveLinear | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 121 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveLinMax | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 271 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveResponse | ( | const int64_t | num_variables_in_original_model, |
| const CpModelProto & | mapping_proto, | ||
| absl::Span< const int > | postsolve_mapping, | ||
| std::vector< int64_t > * | solution ) |
Definition at line 390 of file cp_model_postsolve.cc.
| void operations_research::sat::PostsolveResponseWithFullSolver | ( | int | num_variables_in_original_model, |
| CpModelProto | mapping_proto, | ||
| absl::Span< const int > | postsolve_mapping, | ||
| std::vector< int64_t > * | solution ) |
Definition at line 2091 of file cp_model_solver_helpers.cc.
| void operations_research::sat::PostsolveResponseWrapper | ( | const SatParameters & | params, |
| int | num_variable_in_original_model, | ||
| const CpModelProto & | mapping_proto, | ||
| absl::Span< const int > | postsolve_mapping, | ||
| std::vector< int64_t > * | solution ) |
Definition at line 2135 of file cp_model_solver_helpers.cc.
| bool operations_research::sat::Preprocess | ( | absl::Span< PermutableItem > & | items, |
| std::pair< IntegerValue, IntegerValue > & | bounding_box_size, | ||
| int | max_complexity ) |
Definition at line 546 of file 2d_packing_brute_force.cc.
| void operations_research::sat::PresolveBooleanLinearExpression | ( | std::vector< Literal > * | literals, |
| std::vector< Coefficient > * | coefficients, | ||
| Coefficient * | offset ) |
Definition at line 867 of file optimization.cc.
| CpSolverStatus operations_research::sat::PresolveCpModel | ( | PresolveContext * | context, |
| std::vector< int > * | postsolve_mapping ) |
Definition at line 13673 of file cp_model_presolve.cc.
| bool operations_research::sat::PresolveFixed2dRectangles | ( | absl::Span< const RectangleInRange > | non_fixed_boxes, |
| std::vector< Rectangle > * | fixed_boxes ) |
Definition at line 166 of file 2d_rectangle_presolve.cc.
| bool operations_research::sat::PrintClauses | ( | const std::string & | file_path, |
| SatFormat | format, | ||
| absl::Span< const std::vector< Literal > > | clauses, | ||
| int | num_variables ) |
Definition at line 613 of file drat_checker.cc.
| void operations_research::sat::ProbeAndFindEquivalentLiteral | ( | SatSolver * | solver, |
| SatPostsolver * | postsolver, | ||
| util_intops::StrongVector< LiteralIndex, LiteralIndex > * | mapping, | ||
| SolverLogger * | logger ) |
Definition at line 1166 of file simplification.cc.
| void operations_research::sat::ProbeAndSimplifyProblem | ( | SatPostsolver * | postsolver, |
| LinearBooleanProblem * | problem ) |
Definition at line 837 of file boolean_problem.cc.
Definition at line 169 of file optimization.cc.
| bool operations_research::sat::ProcessEncodingConstraints | ( | int | var, |
| PresolveContext * | context, | ||
| ValueEncoding & | values, | ||
| OrderEncoding & | order, | ||
| std::vector< std::vector< EncodingLinear1 > > & | linear_ones_by_type, | ||
| std::vector< int > & | constraint_indices, | ||
| bool & | var_in_objective, | ||
| bool & | var_has_positive_objective_coefficient ) |
Definition at line 424 of file variable_expand.cc.
| void operations_research::sat::ProcessFloatingPointOVariablesAndObjective | ( | fz::Model * | fz_model | ) |
Definition at line 3657 of file cp_model_fz_solver.cc.
|
inline |
Definition at line 124 of file integer_base.h.
|
inline |
Definition at line 795 of file integer_expr.h.
| int64_t operations_research::sat::ProductWithModularInverse | ( | int64_t | coeff, |
| int64_t | mod, | ||
| int64_t | rhs ) |
| void operations_research::sat::PropagateAutomaton | ( | const AutomatonConstraintProto & | proto, |
| const PresolveContext & | context, | ||
| std::vector< absl::flat_hash_set< int64_t > > * | states, | ||
| std::vector< absl::flat_hash_set< int64_t > > * | labels ) |
Definition at line 334 of file cp_model_table.cc.
| void operations_research::sat::PropagateEncodingFromEquivalenceRelations | ( | const CpModelProto & | model_proto, |
| Model * | m ) |
Definition at line 781 of file cp_model_loader.cc.
| bool operations_research::sat::PropagateLocalBounds | ( | const IntegerTrail & | integer_trail, |
| const RootLevelLinear2Bounds & | root_level_bounds, | ||
| const ConditionalLinear2Bounds & | repository, | ||
| const ImpliedBounds & | implied_bounds, | ||
| Literal | lit, | ||
| const absl::flat_hash_map< IntegerVariable, IntegerValue > & | input, | ||
| absl::flat_hash_map< IntegerVariable, IntegerValue > * | output ) |
Definition at line 869 of file precedences.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::PseudoCost | ( | Model * | model | ) |
Definition at line 461 of file integer_search.cc.
| PushedSolutionPointers operations_research::sat::PushAndMaybeCombineSolution | ( | SharedResponseManager * | response_manager, |
| const CpModelProto & | model_proto, | ||
| absl::Span< const int64_t > | new_solution, | ||
| absl::string_view | solution_info, | ||
| std::shared_ptr< const SharedSolutionRepository< int64_t >::Solution > | base_solution ) |
Definition at line 82 of file combine_solutions.cc.
| void operations_research::sat::QuickSolveWithHint | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 1872 of file cp_model_solver_helpers.cc.
| CpModelProto operations_research::sat::Random3SatProblem | ( | int | num_variables, |
| double | proportion_of_constraints ) |
Definition at line 28 of file cp_model_test_utils.cc.
| void operations_research::sat::RandomizeDecisionHeuristic | ( | absl::BitGenRef | random, |
| SatParameters * | parameters ) |
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::RandomizeOnRestartHeuristic | ( | bool | lns_mode, |
| Model * | model ) |
Definition at line 974 of file integer_search.cc.
| CpModelProto operations_research::sat::RandomLinearProblem | ( | int | num_variables, |
| int | num_constraints ) |
Definition at line 57 of file cp_model_test_utils.cc.
| Domain operations_research::sat::ReadDomainFromProto | ( | const ProtoWithDomain & | proto | ) |
Definition at line 169 of file cp_model_utils.h.
| void operations_research::sat::RecordLPRelaxationValues | ( | Model * | model | ) |
| void operations_research::sat::ReduceModuloBasis | ( | absl::Span< const std::vector< absl::int128 > > | basis, |
| const int | elements_to_consider, | ||
| std::vector< absl::int128 > & | v ) |
Definition at line 46 of file diophantine.cc.
| void operations_research::sat::ReduceNodes | ( | Coefficient | upper_bound, |
| Coefficient * | lower_bound, | ||
| std::vector< EncodingNode * > * | nodes, | ||
| SatSolver * | solver ) |
Definition at line 503 of file encoding.cc.
| bool operations_research::sat::ReduceNumberOfBoxesExactMandatory | ( | std::vector< Rectangle > * | mandatory_rectangles, |
| std::vector< Rectangle > * | optional_rectangles ) |
Definition at line 1424 of file 2d_rectangle_presolve.cc.
| bool operations_research::sat::ReduceNumberofBoxesGreedy | ( | std::vector< Rectangle > * | mandatory_rectangles, |
| std::vector< Rectangle > * | optional_rectangles ) |
Definition at line 345 of file 2d_rectangle_presolve.cc.
|
inline |
Definition at line 55 of file cp_model_utils.h.
|
inline |
Definition at line 701 of file diffn_util.h.
| void operations_research::sat::RegisterClausesExport | ( | int | id, |
| SharedClausesManager * | shared_clauses_manager, | ||
| Model * | model ) |
Definition at line 1060 of file cp_model_solver_helpers.cc.
| int operations_research::sat::RegisterClausesLevelZeroImport | ( | int | id, |
| SharedClausesManager * | shared_clauses_manager, | ||
| Model * | model ) |
Definition at line 1120 of file cp_model_solver_helpers.cc.
| void operations_research::sat::RegisterLinear2BoundsImport | ( | SharedLinear2Bounds * | shared_linear2_bounds, |
| Model * | model ) |
Definition at line 910 of file cp_model_solver_helpers.cc.
| void operations_research::sat::RegisterObjectiveBestBoundExport | ( | IntegerVariable | objective_var, |
| SharedResponseManager * | shared_response_manager, | ||
| Model * | model ) |
Definition at line 966 of file cp_model_solver_helpers.cc.
| void operations_research::sat::RegisterObjectiveBoundsImport | ( | SharedResponseManager * | shared_response_manager, |
| Model * | model ) |
Definition at line 995 of file cp_model_solver_helpers.cc.
| void operations_research::sat::RegisterVariableBoundsLevelZeroExport | ( | const CpModelProto & | , |
| SharedBoundsManager * | shared_bounds_manager, | ||
| Model * | model ) |
Definition at line 715 of file cp_model_solver_helpers.cc.
| void operations_research::sat::RegisterVariableBoundsLevelZeroImport | ( | const CpModelProto & | model_proto, |
| SharedBoundsManager * | shared_bounds_manager, | ||
| Model * | model ) |
Definition at line 816 of file cp_model_solver_helpers.cc.
|
inline |
Definition at line 1052 of file sat_solver.h.
|
inline |
Definition at line 1069 of file sat_solver.h.
|
inline |
Definition at line 1017 of file sat_solver.h.
| int operations_research::sat::ReindexArcs | ( | IntContainer * | tails, |
| IntContainer * | heads, | ||
| absl::flat_hash_map< int, int > * | mapping_output = nullptr ) |
| std::unique_ptr< Graph > util::RemapGraph | ( | const Graph & | graph, |
| absl::Span< const int > | new_node_index ) |
|
inline |
Definition at line 101 of file gate_utils.h.
| void operations_research::sat::RemoveNearZeroTerms | ( | const SatParameters & | params, |
| MPModelProto * | mp_model, | ||
| SolverLogger * | logger ) |
Definition at line 311 of file lp_utils.cc.
|
inline |
Definition at line 121 of file cp_model_utils.h.
| std::string operations_research::sat::RenderDot | ( | std::optional< Rectangle > | bb, |
| absl::Span< const Rectangle > | solution, | ||
| std::string_view | extra_dot_payload ) |
Definition at line 1574 of file diffn_util.cc.
| std::vector< SatParameters > operations_research::sat::RepeatParameters | ( | absl::Span< const SatParameters > | base_params, |
| int | num_params_to_generate ) |
Definition at line 1105 of file cp_model_search.cc.
| bool operations_research::sat::ReportEnergyConflict | ( | Rectangle | bounding_box, |
| absl::Span< const int > | boxes, | ||
| SchedulingConstraintHelper * | x, | ||
| SchedulingConstraintHelper * | y ) |
Definition at line 140 of file diffn_util.cc.
| SatSolver::Status operations_research::sat::ResetAndSolveIntegerProblem | ( | const std::vector< Literal > & | assumptions, |
| Model * | model ) |
Definition at line 1649 of file integer_search.cc.
| bool operations_research::sat::Resolve | ( | absl::Span< const Literal > | clause, |
| absl::Span< const Literal > | other_clause, | ||
| Literal | complementary_literal, | ||
| VariablesAssignment * | assignment, | ||
| std::vector< Literal > * | resolvent ) |
Definition at line 485 of file drat_checker.cc.
| std::function< bool()> operations_research::sat::RestartEveryKFailures | ( | int | k, |
| SatSolver * | solver ) |
Definition at line 1187 of file integer_search.cc.
| void operations_research::sat::RestrictObjectiveDomainWithBinarySearch | ( | IntegerVariable | objective_var, |
| const std::function< void()> & | feasible_solution_observer, | ||
| Model * | model ) |
Definition at line 259 of file optimization.cc.
| bool operations_research::sat::SafeAddLinearExpressionToLinearConstraint | ( | const LinearExpressionProto & | expr, |
| int64_t | coefficient, | ||
| LinearConstraintProto * | linear ) |
Definition at line 703 of file cp_model_utils.cc.
|
inline |
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_BinaryMinizationAlgorithm_descriptor | ( | ) |
Definition at line 1409 of file sat_parameters.pb.cc.
|
inline |
Definition at line 236 of file sat_parameters.pb.h.
|
inline |
Definition at line 249 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_BinaryMinizationAlgorithm_Name | ( | T | value | ) |
Definition at line 242 of file sat_parameters.pb.h.
|
inline |
Definition at line 253 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_ClauseOrdering_descriptor | ( | ) |
Definition at line 1415 of file sat_parameters.pb.cc.
|
inline |
Definition at line 268 of file sat_parameters.pb.h.
|
inline |
Definition at line 281 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_ClauseOrdering_Name | ( | T | value | ) |
Definition at line 274 of file sat_parameters.pb.h.
|
inline |
Definition at line 285 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_ConflictMinimizationAlgorithm_descriptor | ( | ) |
Definition at line 1403 of file sat_parameters.pb.cc.
|
inline |
Definition at line 203 of file sat_parameters.pb.h.
|
inline |
Definition at line 216 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_ConflictMinimizationAlgorithm_Name | ( | T | value | ) |
Definition at line 209 of file sat_parameters.pb.h.
|
inline |
Definition at line 220 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_FPRoundingMethod_descriptor | ( | ) |
Definition at line 1451 of file sat_parameters.pb.cc.
|
inline |
Definition at line 477 of file sat_parameters.pb.h.
|
inline |
Definition at line 490 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_FPRoundingMethod_Name | ( | T | value | ) |
Definition at line 483 of file sat_parameters.pb.h.
|
inline |
Definition at line 494 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_MaxSatAssumptionOrder_descriptor | ( | ) |
Definition at line 1427 of file sat_parameters.pb.cc.
|
inline |
Definition at line 336 of file sat_parameters.pb.h.
|
inline |
Definition at line 349 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_MaxSatAssumptionOrder_Name | ( | T | value | ) |
Definition at line 342 of file sat_parameters.pb.h.
|
inline |
Definition at line 353 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_MaxSatStratificationAlgorithm_descriptor | ( | ) |
Definition at line 1433 of file sat_parameters.pb.cc.
|
inline |
Definition at line 369 of file sat_parameters.pb.h.
|
inline |
Definition at line 382 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_MaxSatStratificationAlgorithm_Name | ( | T | value | ) |
Definition at line 375 of file sat_parameters.pb.h.
|
inline |
Definition at line 386 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_Polarity_descriptor | ( | ) |
Definition at line 1397 of file sat_parameters.pb.cc.
|
inline |
Definition at line 170 of file sat_parameters.pb.h.
|
inline |
Definition at line 183 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_Polarity_Name | ( | T | value | ) |
Definition at line 176 of file sat_parameters.pb.h.
|
inline |
Definition at line 187 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_RestartAlgorithm_descriptor | ( | ) |
Definition at line 1421 of file sat_parameters.pb.cc.
|
inline |
Definition at line 303 of file sat_parameters.pb.h.
|
inline |
Definition at line 316 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_RestartAlgorithm_Name | ( | T | value | ) |
Definition at line 309 of file sat_parameters.pb.h.
|
inline |
Definition at line 320 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_SearchBranching_descriptor | ( | ) |
Definition at line 1439 of file sat_parameters.pb.cc.
|
inline |
Definition at line 408 of file sat_parameters.pb.h.
|
inline |
Definition at line 421 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_SearchBranching_Name | ( | T | value | ) |
Definition at line 414 of file sat_parameters.pb.h.
|
inline |
Definition at line 425 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_SharedTreeSplitStrategy_descriptor | ( | ) |
Definition at line 1445 of file sat_parameters.pb.cc.
|
inline |
Definition at line 443 of file sat_parameters.pb.h.
|
inline |
Definition at line 456 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_SharedTreeSplitStrategy_Name | ( | T | value | ) |
Definition at line 449 of file sat_parameters.pb.h.
|
inline |
Definition at line 460 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::sat::SatParameters_VariableOrder_descriptor | ( | ) |
Definition at line 1391 of file sat_parameters.pb.cc.
|
inline |
Definition at line 137 of file sat_parameters.pb.h.
|
inline |
Definition at line 150 of file sat_parameters.pb.h.
| const ::std::string & operations_research::sat::SatParameters_VariableOrder_Name | ( | T | value | ) |
Definition at line 143 of file sat_parameters.pb.h.
|
inline |
Definition at line 154 of file sat_parameters.pb.h.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::SatSolverHeuristic | ( | Model * | model | ) |
Definition at line 422 of file integer_search.cc.
| std::function< bool()> operations_research::sat::SatSolverRestartPolicy | ( | Model * | model | ) |
Definition at line 1201 of file integer_search.cc.
| std::string operations_research::sat::SatStatusString | ( | SatSolver::Status | status | ) |
Definition at line 3123 of file sat_solver.cc.
| double operations_research::sat::ScalarProduct | ( | const LinearConstraint & | ct1, |
| const LinearConstraint & | ct2 ) |
Definition at line 238 of file linear_constraint.cc.
| bool operations_research::sat::ScaleAndSetObjective | ( | const SatParameters & | params, |
| absl::Span< const std::pair< int, double > > | objective, | ||
| double | objective_offset, | ||
| bool | maximize, | ||
| CpModelProto * | cp_model, | ||
| SolverLogger * | logger ) |
Definition at line 1365 of file lp_utils.cc.
| std::vector< double > operations_research::sat::ScaleContinuousVariables | ( | double | scaling, |
| double | max_bound, | ||
| MPModelProto * | mp_model ) |
Definition at line 112 of file lp_utils.cc.
| ABSL_MUST_USE_RESULT bool operations_research::sat::ScaleFloatingPointObjective | ( | const SatParameters & | params, |
| SolverLogger * | logger, | ||
| CpModelProto * | proto ) |
Definition at line 1048 of file presolve_context.cc.
|
inline |
Definition at line 208 of file cp_model_utils.h.
|
inline |
Definition at line 195 of file cp_model_utils.h.
| void operations_research::sat::ScanModelForDominanceDetection | ( | PresolveContext & | context, |
| VarDomination * | var_domination ) |
Definition at line 1187 of file var_domination.cc.
| void operations_research::sat::ScanModelForDualBoundStrengthening | ( | const PresolveContext & | context, |
| DualBoundStrengthening * | dual_bound_strengthening ) |
Definition at line 1393 of file var_domination.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::SchedulingSearchHeuristic | ( | Model * | model | ) |
Definition at line 483 of file integer_search.cc.
| void operations_research::sat::SeparateFlowInequalities | ( | int | num_nodes, |
| absl::Span< const int > | tails, | ||
| absl::Span< const int > | heads, | ||
| absl::Span< const AffineExpression > | arc_capacities, | ||
| std::function< void(const std::vector< bool > &in_subset, IntegerValue *min_incoming_flow, IntegerValue *min_outgoing_flow)> | get_flows, | ||
| const util_intops::StrongVector< IntegerVariable, double > & | lp_values, | ||
| LinearConstraintManager * | manager, | ||
| Model * | model ) |
Definition at line 3237 of file routing_cuts.cc.
| void operations_research::sat::SeparateSubtourInequalities | ( | RoutingCutHelper & | helper, |
| LinearConstraintManager * | manager ) |
Definition at line 3097 of file routing_cuts.cc.
| void operations_research::sat::SequentialLoop | ( | std::vector< std::unique_ptr< SubSolver > > & | subsolvers | ) |
Definition at line 97 of file subsolver.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::SequentialSearch | ( | std::vector< std::function< BooleanOrIntegerLiteral()> > | heuristics | ) |
Definition at line 298 of file integer_search.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::SequentialValueSelection | ( | std::vector< std::function< IntegerLiteral(IntegerVariable)> > | value_selection_heuristics, |
| std::function< BooleanOrIntegerLiteral()> | var_selection_heuristic, | ||
| Model * | model ) |
Definition at line 314 of file integer_search.cc.
| void operations_research::sat::SetEnforcementLiteralToFalse | ( | const ConstraintProto & | ct, |
| std::vector< Domain > * | domains ) |
Definition at line 98 of file cp_model_postsolve.cc.
| void operations_research::sat::SetToNegatedLinearExpression | ( | const LinearExpressionProto & | input_expr, |
| LinearExpressionProto * | output_negated_expr ) |
Definition at line 94 of file cp_model_utils.cc.
| void operations_research::sat::SetupTextFormatPrinter | ( | google::protobuf::TextFormat::Printer * | printer | ) |
Definition at line 990 of file cp_model_utils.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::ShaveObjectiveLb | ( | Model * | model | ) |
Definition at line 437 of file integer_search.cc.
| void operations_research::sat::SimplifyCanonicalBooleanLinearConstraint | ( | std::vector< LiteralWithCoeff > * | cst, |
| Coefficient * | rhs ) |
Definition at line 170 of file pb_constraint.cc.
| bool operations_research::sat::SimplifyClause | ( | const std::vector< Literal > & | a, |
| std::vector< Literal > * | b, | ||
| LiteralIndex * | opposite_literal, | ||
| int64_t * | num_inspected_literals ) |
Definition at line 966 of file simplification.cc.
| IntegerValue operations_research::sat::Smallest1DIntersection | ( | IntegerValue | range_min, |
| IntegerValue | range_max, | ||
| IntegerValue | size, | ||
| IntegerValue | interval_min, | ||
| IntegerValue | interval_max ) |
Definition at line 786 of file diffn_util.cc.
| *Evaluates the value of a Boolean literal in a solver response bool operations_research::sat::SolutionBooleanValue | ( | const CpSolverResponse & | r, |
| BoolVar | x ) |
Definition at line 1507 of file cp_model.cc.
| bool operations_research::sat::SolutionCanBeOptimal | ( | const CpModelProto & | model, |
| absl::Span< const int64_t > | variable_values ) |
Definition at line 1983 of file cp_model_checker.cc.
| *Evaluates the value of an linear expression in a solver response int64_t operations_research::sat::SolutionIntegerValue | ( | const CpSolverResponse & | r, |
| const LinearExpr & | expr ) |
Definition at line 1496 of file cp_model.cc.
| bool operations_research::sat::SolutionIsFeasible | ( | const CpModelProto & | model, |
| absl::Span< const int64_t > | variable_values, | ||
| const CpModelProto * | mapping_proto, | ||
| const std::vector< int > * | postsolve_mapping ) |
Definition at line 1901 of file cp_model_checker.cc.
| CpSolverResponse operations_research::sat::Solve | ( | const CpModelProto & | model_proto | ) |
Solves the given CpModelProto and returns an instance of CpSolverResponse.
Definition at line 3063 of file cp_model_solver.cc.
| CpSolverResponse operations_research::sat::SolveCpModel | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Solves the given CpModelProto.
This advanced API accept a Model* which allows to access more advanced features by configuring some classes in the Model before solve.
For instance:
Definition at line 2409 of file cp_model_solver.cc.
| DiophantineSolution operations_research::sat::SolveDiophantine | ( | absl::Span< const int64_t > | coeffs, |
| int64_t | rhs, | ||
| absl::Span< const int64_t > | var_lbs, | ||
| absl::Span< const int64_t > | var_ubs ) |
Definition at line 122 of file diophantine.cc.
| bool operations_research::sat::SolveDiophantineEquationOfSizeTwo | ( | int64_t & | a, |
| int64_t & | b, | ||
| int64_t & | cte, | ||
| int64_t & | x0, | ||
| int64_t & | y0 ) |
| CpSolverResponse operations_research::sat::SolveFzWithCpModelProto | ( | const fz::Model & | fz_model, |
| const fz::FlatzincSatParameters & | p, | ||
| const SatParameters & | sat_params, | ||
| Model * | sat_model, | ||
| SolverLogger * | solution_logger ) |
Definition at line 3716 of file cp_model_fz_solver.cc.
| SatSolver::Status operations_research::sat::SolveIntegerProblemWithLazyEncoding | ( | Model * | model | ) |
Definition at line 1673 of file integer_search.cc.
| void operations_research::sat::SolveLoadedCpModel | ( | const CpModelProto & | model_proto, |
| Model * | model ) |
Definition at line 1730 of file cp_model_solver_helpers.cc.
| CpSolverResponse operations_research::sat::SolveWithParameters | ( | const CpModelProto & | model_proto, |
| absl::string_view | params ) |
Solves the given CpModelProto with the given sat parameters as string in JSon format, and returns an instance of CpSolverResponse.
Definition at line 3075 of file cp_model_solver.cc.
| CpSolverResponse operations_research::sat::SolveWithParameters | ( | const CpModelProto & | model_proto, |
| const SatParameters & | params ) |
Solves the given CpModelProto with the given parameters.
Definition at line 3068 of file cp_model_solver.cc.
| void operations_research::sat::SplitAndLoadIntermediateConstraints | ( | bool | lb_required, |
| bool | ub_required, | ||
| std::vector< IntegerVariable > * | vars, | ||
| std::vector< IntegerValue > * | coeffs, | ||
| Model * | m ) |
Definition at line 1110 of file cp_model_loader.cc.
| IntegerLiteral operations_research::sat::SplitAroundGivenValue | ( | IntegerVariable | var, |
| IntegerValue | value, | ||
| Model * | model ) |
Definition at line 91 of file integer_search.cc.
| IntegerLiteral operations_research::sat::SplitAroundLpValue | ( | IntegerVariable | var, |
| Model * | model ) |
Definition at line 119 of file integer_search.cc.
| IntegerLiteral operations_research::sat::SplitDomainUsingBestSolutionValue | ( | IntegerVariable | var, |
| Model * | model ) |
| std::vector< absl::Span< std::unique_ptr< E > > > operations_research::sat::SplitEventsInIndendentSets | ( | std::vector< std::unique_ptr< E > > & | events | ) |
Definition at line 228 of file scheduling_cuts.h.
| std::vector< std::vector< int > > operations_research::sat::SplitInConnectedComponents | ( | const Neighbours & | neighbours | ) |
Definition at line 561 of file 2d_rectangle_presolve.cc.
| IntegerLiteral operations_research::sat::SplitUsingBestSolutionValueInRepository | ( | IntegerVariable | var, |
| const SharedSolutionRepository< int64_t > & | solution_repo, | ||
| Model * | model ) |
Definition at line 148 of file integer_search.cc.
| void operations_research::sat::StopSearch | ( | Model * | model | ) |
Stops the current search.
Definition at line 2310 of file cp_model_solver.cc.
| void operations_research::sat::StoreAssignment | ( | const VariablesAssignment & | assignment, |
| BooleanAssignment * | output ) |
Definition at line 488 of file boolean_problem.cc.
| operations_research::sat::SubsetsDetector | ( | const Storage & | storage | ) | ->SubsetsDetector< Storage > |
| bool operations_research::sat::SubstituteVariable | ( | int | var, |
| int64_t | var_coeff_in_definition, | ||
| const ConstraintProto & | definition, | ||
| ConstraintProto * | ct ) |
Definition at line 210 of file presolve_util.cc.
| void operations_research::sat::SymmetrizeArcs | ( | std::vector< ArcWithLpValue > * | arcs | ) |
Definition at line 3009 of file routing_cuts.cc.
|
inline |
Definition at line 73 of file integer_base.h.
|
inline |
Definition at line 117 of file cp_constraints.h.
| std::vector< int > operations_research::sat::TracePoint | ( | int | point, |
| absl::Span< const int > | schrier_vector, | ||
| absl::Span< const std::unique_ptr< SparsePermutation > > | generators ) |
Definition at line 224 of file symmetry_util.cc.
|
inline |
Definition at line 97 of file symmetry_util.h.
| int operations_research::sat::TryAllSubsets | ( | std::string | cut_name, |
| absl::Span< const int > | subset_data, | ||
| std::vector< absl::Span< const int > > | subsets, | ||
| RoutingCutHelper & | helper, | ||
| LinearConstraintManager * | manager ) |
Definition at line 3036 of file routing_cuts.cc.
| bool operations_research::sat::TrySolution | ( | const CpModelProto & | model, |
| absl::Span< const int64_t > | solution, | ||
| absl::Span< const int64_t > | new_solution, | ||
| absl::Span< const int64_t > | base_solution, | ||
| std::vector< int64_t > * | new_combined_solution ) |
Definition at line 34 of file combine_solutions.cc.
| void operations_research::sat::TryToLinearizeConstraint | ( | const CpModelProto & | , |
| const ConstraintProto & | ct, | ||
| int | linearization_level, | ||
| Model * | model, | ||
| LinearRelaxation * | relaxation, | ||
| ActivityBoundHelper * | activity_helper ) |
Definition at line 1416 of file linear_relaxation.cc.
| std::vector< LiteralValueValue > operations_research::sat::TryToReconcileEncodings | ( | const AffineExpression & | size2_affine, |
| const AffineExpression & | affine, | ||
| absl::Span< const ValueLiteralPair > | affine_var_encoding, | ||
| bool | put_affine_left_in_result, | ||
| IntegerEncoder * | integer_encoder ) |
Definition at line 319 of file implied_bounds.cc.
| std::vector< LiteralValueValue > operations_research::sat::TryToReconcileSize2Encodings | ( | const AffineExpression & | left, |
| const AffineExpression & | right, | ||
| IntegerEncoder * | integer_encoder ) |
Definition at line 363 of file implied_bounds.cc.
| void operations_research::sat::TryToReplaceVariableByItsEncoding | ( | int | var, |
| PresolveContext * | context, | ||
| SolutionCrush & | solution_crush ) |
Definition at line 581 of file variable_expand.cc.
| std::function< BooleanOrIntegerLiteral()> operations_research::sat::UnassignedVarWithLowestMinAtItsMinHeuristic | ( | absl::Span< const IntegerVariable > | vars, |
| Model * | model ) |
Definition at line 277 of file integer_search.cc.
|
inline |
Definition at line 219 of file cp_model_utils.h.
|
inline |
| std::vector< int > operations_research::sat::UsedIntervals | ( | const ConstraintProto & | ct | ) |
Definition at line 567 of file cp_model_utils.cc.
| std::vector< int > operations_research::sat::UsedVariables | ( | const ConstraintProto & | ct | ) |
Definition at line 554 of file cp_model_utils.cc.
| void operations_research::sat::UseObjectiveForSatAssignmentPreference | ( | const LinearBooleanProblem & | problem, |
| SatSolver * | solver ) |
Definition at line 320 of file boolean_problem.cc.
| absl::Status operations_research::sat::ValidateBooleanProblem | ( | const LinearBooleanProblem & | problem | ) |
Definition at line 144 of file boolean_problem.cc.
| std::string operations_research::sat::ValidateCpModel | ( | const CpModelProto & | model, |
| bool | after_presolve ) |
Definition at line 1104 of file cp_model_checker.cc.
| std::string operations_research::sat::ValidateInputCpModel | ( | const SatParameters & | params, |
| const CpModelProto & | model ) |
Definition at line 1288 of file cp_model_checker.cc.
| bool operations_research::sat::ValidateLinearConstraintForOverflow | ( | const LinearConstraint & | constraint, |
| const IntegerTrail & | integer_trail ) |
Definition at line 395 of file linear_constraint.cc.
| std::string operations_research::sat::ValidateParameters | ( | const SatParameters & | params | ) |
Definition at line 55 of file parameters_validation.cc.
|
inline |
Definition at line 1088 of file sat_solver.h.
|
inline |
Definition at line 1079 of file sat_solver.h.
| std::string operations_research::sat::VarDebugString | ( | const CpModelProto & | proto, |
| int | index ) |
Definition at line 143 of file cp_model.cc.
|
inline |
Definition at line 179 of file integer_base.h.
| int operations_research::sat::WeightedPick | ( | absl::Span< const double > | input, |
| absl::BitGenRef | random ) |
|
inline |
Definition at line 612 of file integer_expr.h.
|
inline |
Definition at line 600 of file integer_expr.h.
| bool operations_research::sat::WriteModelProtoToFile | ( | const M & | proto, |
| absl::string_view | filename ) |
Definition at line 363 of file cp_model_utils.h.
| OR_PROTO_DLL AllDifferentConstraintProtoDefaultTypeInternal operations_research::sat::_AllDifferentConstraintProto_default_instance_ |
Definition at line 822 of file cp_model.pb.cc.
| OR_PROTO_DLL ArcLpValueDefaultTypeInternal operations_research::sat::_ArcLpValue_default_instance_ |
Definition at line 55 of file routes_support_graph.pb.cc.
| OR_PROTO_DLL AutomatonConstraintProtoDefaultTypeInternal operations_research::sat::_AutomatonConstraintProto_default_instance_ |
Definition at line 797 of file cp_model.pb.cc.
| OR_PROTO_DLL BoolArgumentProtoDefaultTypeInternal operations_research::sat::_BoolArgumentProto_default_instance_ |
Definition at line 455 of file cp_model.pb.cc.
| OR_PROTO_DLL BooleanAssignmentDefaultTypeInternal operations_research::sat::_BooleanAssignment_default_instance_ |
Definition at line 112 of file boolean_problem.pb.cc.
| OR_PROTO_DLL CircuitConstraintProtoDefaultTypeInternal operations_research::sat::_CircuitConstraintProto_default_instance_ |
Definition at line 429 of file cp_model.pb.cc.
| OR_PROTO_DLL ConstraintProtoDefaultTypeInternal operations_research::sat::_ConstraintProto_default_instance_ |
Definition at line 887 of file cp_model.pb.cc.
| OR_PROTO_DLL CpModelProtoDefaultTypeInternal operations_research::sat::_CpModelProto_default_instance_ |
Definition at line 923 of file cp_model.pb.cc.
| OR_PROTO_DLL CpObjectiveProtoDefaultTypeInternal operations_research::sat::_CpObjectiveProto_default_instance_ |
Definition at line 399 of file cp_model.pb.cc.
| OR_PROTO_DLL CpSolverResponseDefaultTypeInternal operations_research::sat::_CpSolverResponse_default_instance_ |
Definition at line 761 of file cp_model.pb.cc.
| OR_PROTO_DLL CpSolverSolutionDefaultTypeInternal operations_research::sat::_CpSolverSolution_default_instance_ |
Definition at line 363 of file cp_model.pb.cc.
| OR_PROTO_DLL CumulativeConstraintProtoDefaultTypeInternal operations_research::sat::_CumulativeConstraintProto_default_instance_ |
Definition at line 707 of file cp_model.pb.cc.
| OR_PROTO_DLL DecisionStrategyProtoDefaultTypeInternal operations_research::sat::_DecisionStrategyProto_default_instance_ |
Definition at line 679 of file cp_model.pb.cc.
| OR_PROTO_DLL DenseMatrixProtoDefaultTypeInternal operations_research::sat::_DenseMatrixProto_default_instance_ |
Definition at line 337 of file cp_model.pb.cc.
| OR_PROTO_DLL ElementConstraintProtoDefaultTypeInternal operations_research::sat::_ElementConstraintProto_default_instance_ |
Definition at line 650 of file cp_model.pb.cc.
| OR_PROTO_DLL FloatObjectiveProtoDefaultTypeInternal operations_research::sat::_FloatObjectiveProto_default_instance_ |
Definition at line 309 of file cp_model.pb.cc.
| OR_PROTO_DLL IntegerVariableProtoDefaultTypeInternal operations_research::sat::_IntegerVariableProto_default_instance_ |
Definition at line 280 of file cp_model.pb.cc.
| OR_PROTO_DLL IntervalConstraintProtoDefaultTypeInternal operations_research::sat::_IntervalConstraintProto_default_instance_ |
Definition at line 619 of file cp_model.pb.cc.
| OR_PROTO_DLL InverseConstraintProtoDefaultTypeInternal operations_research::sat::_InverseConstraintProto_default_instance_ |
Definition at line 251 of file cp_model.pb.cc.
| OR_PROTO_DLL LinearArgumentProtoDefaultTypeInternal operations_research::sat::_LinearArgumentProto_default_instance_ |
Definition at line 592 of file cp_model.pb.cc.
| OR_PROTO_DLL LinearBooleanConstraintDefaultTypeInternal operations_research::sat::_LinearBooleanConstraint_default_instance_ |
Definition at line 87 of file boolean_problem.pb.cc.
| OR_PROTO_DLL LinearBooleanProblemDefaultTypeInternal operations_research::sat::_LinearBooleanProblem_default_instance_ |
Definition at line 145 of file boolean_problem.pb.cc.
| OR_PROTO_DLL LinearConstraintProtoDefaultTypeInternal operations_research::sat::_LinearConstraintProto_default_instance_ |
Definition at line 223 of file cp_model.pb.cc.
| OR_PROTO_DLL LinearExpressionProtoDefaultTypeInternal operations_research::sat::_LinearExpressionProto_default_instance_ |
Definition at line 193 of file cp_model.pb.cc.
| OR_PROTO_DLL LinearObjectiveDefaultTypeInternal operations_research::sat::_LinearObjective_default_instance_ |
Definition at line 56 of file boolean_problem.pb.cc.
| OR_PROTO_DLL ListOfVariablesProtoDefaultTypeInternal operations_research::sat::_ListOfVariablesProto_default_instance_ |
Definition at line 164 of file cp_model.pb.cc.
| OR_PROTO_DLL LratDeletedClausesDefaultTypeInternal operations_research::sat::_LratDeletedClauses_default_instance_ |
Definition at line 135 of file lrat.pb.cc.
| OR_PROTO_DLL LratExportedClauseDefaultTypeInternal operations_research::sat::_LratExportedClause_default_instance_ |
Definition at line 109 of file lrat.pb.cc.
| OR_PROTO_DLL LratImportedClauseDefaultTypeInternal operations_research::sat::_LratImportedClause_default_instance_ |
Definition at line 82 of file lrat.pb.cc.
| OR_PROTO_DLL LratInferredClauseDefaultTypeInternal operations_research::sat::_LratInferredClause_default_instance_ |
Definition at line 166 of file lrat.pb.cc.
| OR_PROTO_DLL LratInferredClause_RatInfoDefaultTypeInternal operations_research::sat::_LratInferredClause_RatInfo_default_instance_ |
Definition at line 55 of file lrat.pb.cc.
| OR_PROTO_DLL LratProofStepDefaultTypeInternal operations_research::sat::_LratProofStep_default_instance_ |
Definition at line 192 of file lrat.pb.cc.
| OR_PROTO_DLL NoOverlap2DConstraintProtoDefaultTypeInternal operations_research::sat::_NoOverlap2DConstraintProto_default_instance_ |
Definition at line 138 of file cp_model.pb.cc.
| OR_PROTO_DLL NoOverlapConstraintProtoDefaultTypeInternal operations_research::sat::_NoOverlapConstraintProto_default_instance_ |
Definition at line 110 of file cp_model.pb.cc.
| OR_PROTO_DLL PartialVariableAssignmentDefaultTypeInternal operations_research::sat::_PartialVariableAssignment_default_instance_ |
Definition at line 84 of file cp_model.pb.cc.
| OR_PROTO_DLL ReservoirConstraintProtoDefaultTypeInternal operations_research::sat::_ReservoirConstraintProto_default_instance_ |
Definition at line 566 of file cp_model.pb.cc.
| OR_PROTO_DLL RoutesConstraintProtoDefaultTypeInternal operations_research::sat::_RoutesConstraintProto_default_instance_ |
Definition at line 856 of file cp_model.pb.cc.
| OR_PROTO_DLL RoutesConstraintProto_NodeExpressionsDefaultTypeInternal operations_research::sat::_RoutesConstraintProto_NodeExpressions_default_instance_ |
Definition at line 536 of file cp_model.pb.cc.
| OR_PROTO_DLL RoutesSupportGraphProtoDefaultTypeInternal operations_research::sat::_RoutesSupportGraphProto_default_instance_ |
Definition at line 80 of file routes_support_graph.pb.cc.
| OR_PROTO_DLL SatParametersDefaultTypeInternal operations_research::sat::_SatParameters_default_instance_ |
Definition at line 361 of file sat_parameters.pb.cc.
| OR_PROTO_DLL SparsePermutationProtoDefaultTypeInternal operations_research::sat::_SparsePermutationProto_default_instance_ |
Definition at line 56 of file cp_model.pb.cc.
| OR_PROTO_DLL SymmetryProtoDefaultTypeInternal operations_research::sat::_SymmetryProto_default_instance_ |
Definition at line 511 of file cp_model.pb.cc.
| OR_PROTO_DLL TableConstraintProtoDefaultTypeInternal operations_research::sat::_TableConstraintProto_default_instance_ |
Definition at line 485 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::AllDifferentConstraintProto_class_data_ |
Definition at line 2990 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::ArcLpValue_class_data_ |
Definition at line 238 of file routes_support_graph.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::AutomatonConstraintProto_class_data_ |
Definition at line 7784 of file cp_model.pb.cc.
Definition at line 100 of file diophantine.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::BoolArgumentProto_class_data_ |
Definition at line 2030 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::BooleanAssignment_class_data_ |
Definition at line 1152 of file boolean_problem.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::CircuitConstraintProto_class_data_ |
Definition at line 5914 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::ConstraintProto_class_data_ |
Definition at line 9120 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::CpModelProto_class_data_ |
Definition at line 12747 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::CpObjectiveProto_class_data_ |
Definition at line 10033 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::CpSolverResponse_class_data_ |
Definition at line 13645 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::CpSolverSolution_class_data_ |
Definition at line 13321 of file cp_model.pb.cc.
|
inlineconstexpr |
Definition at line 301 of file cp_model.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::CpSolverStatus_internal_data_ |
Definition at line 1586 of file cp_model.pb.cc.
|
inlineconstexpr |
Definition at line 296 of file cp_model.pb.h.
|
inlineconstexpr |
Definition at line 294 of file cp_model.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::CumulativeConstraintProto_class_data_ |
Definition at line 5092 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::DecisionStrategyProto_class_data_ |
Definition at line 10974 of file cp_model.pb.cc.
|
inlineconstexpr |
Definition at line 262 of file cp_model.pb.h.
|
inlineconstexpr |
Definition at line 257 of file cp_model.pb.h.
|
inlineconstexpr |
Definition at line 255 of file cp_model.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::DecisionStrategyProto_DomainReductionStrategy_internal_data_ |
Definition at line 1580 of file cp_model.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::sat::DecisionStrategyProto_VariableSelectionStrategy_internal_data_ |
Definition at line 1574 of file cp_model.pb.cc.
|
inlineconstexpr |
Definition at line 222 of file cp_model.pb.h.
|
inlineconstexpr |
Definition at line 217 of file cp_model.pb.h.
|
inlineconstexpr |
Definition at line 215 of file cp_model.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::DenseMatrixProto_class_data_ |
Definition at line 12024 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::ElementConstraintProto_class_data_ |
Definition at line 3668 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::FloatObjectiveProto_class_data_ |
Definition at line 10578 of file cp_model.pb.cc.
| for operations_research::sat::i = 0 ... k-2 |
Definition at line 100 of file diophantine.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::IntegerVariableProto_class_data_ |
Definition at line 1705 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::IntervalConstraintProto_class_data_ |
Definition at line 4122 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::InverseConstraintProto_class_data_ |
Definition at line 7429 of file cp_model.pb.cc.
|
constexpr |
Definition at line 57 of file presolve_context.h.
|
constexpr |
Definition at line 58 of file presolve_context.h.
|
constexpr |
Definition at line 318 of file cp_model_utils.h.
Definition at line 87 of file lp_types.h.
|
staticconstexpr |
Definition at line 34 of file 2d_packing_brute_force.cc.
|
constexpr |
Definition at line 56 of file presolve_context.h.
|
constexpr |
Definition at line 43 of file cp_model_table.h.
| const int operations_research::sat::kUnsatTrailIndex = -1 |
Definition at line 59 of file sat_solver.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LinearArgumentProto_class_data_ |
Definition at line 2669 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LinearBooleanConstraint_class_data_ |
Definition at line 390 of file boolean_problem.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LinearBooleanProblem_class_data_ |
Definition at line 1460 of file boolean_problem.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LinearConstraintProto_class_data_ |
Definition at line 3293 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LinearExpressionProto_class_data_ |
Definition at line 2320 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LinearObjective_class_data_ |
Definition at line 798 of file boolean_problem.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::ListOfVariablesProto_class_data_ |
Definition at line 8260 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LratDeletedClauses_class_data_ |
Definition at line 1776 of file lrat.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LratExportedClause_class_data_ |
Definition at line 1471 of file lrat.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LratImportedClause_class_data_ |
Definition at line 425 of file lrat.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LratInferredClause_class_data_ |
Definition at line 1064 of file lrat.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LratInferredClause_RatInfo_class_data_ |
Definition at line 732 of file lrat.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::LratProofStep_class_data_ |
Definition at line 2156 of file lrat.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::NoOverlap2DConstraintProto_class_data_ |
Definition at line 4765 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::NoOverlapConstraintProto_class_data_ |
Definition at line 4477 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::PartialVariableAssignment_class_data_ |
Definition at line 11373 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::ReservoirConstraintProto_class_data_ |
Definition at line 5472 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::RoutesConstraintProto_class_data_ |
Definition at line 6578 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::RoutesConstraintProto_NodeExpressions_class_data_ |
Definition at line 6259 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::RoutesSupportGraphProto_class_data_ |
Definition at line 558 of file routes_support_graph.pb.cc.
|
inlineconstexpr |
Definition at line 239 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 234 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 232 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_BinaryMinizationAlgorithm_internal_data_ |
Definition at line 1413 of file sat_parameters.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::SatParameters_class_data_ |
Definition at line 1820 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 271 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 266 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 264 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_ClauseOrdering_internal_data_ |
Definition at line 1419 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 206 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 201 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 199 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_ConflictMinimizationAlgorithm_internal_data_ |
Definition at line 1407 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 480 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 475 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 473 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_FPRoundingMethod_internal_data_ |
Definition at line 1455 of file sat_parameters.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_MaxSatAssumptionOrder_internal_data_ |
Definition at line 1431 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 339 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 334 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 332 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_MaxSatStratificationAlgorithm_internal_data_ |
Definition at line 1437 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 372 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 367 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 365 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_Polarity_internal_data_ |
Definition at line 1401 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 173 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 168 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 166 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_RestartAlgorithm_internal_data_ |
Definition at line 1425 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 306 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 301 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 299 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_SearchBranching_internal_data_ |
Definition at line 1443 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 411 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 406 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 404 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_SharedTreeSplitStrategy_internal_data_ |
Definition at line 1449 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 446 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 441 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 439 of file sat_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::sat::SatParameters_VariableOrder_internal_data_ |
Definition at line 1395 of file sat_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 140 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 135 of file sat_parameters.pb.h.
|
inlineconstexpr |
Definition at line 133 of file sat_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::SparsePermutationProto_class_data_ |
Definition at line 11696 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::SymmetryProto_class_data_ |
Definition at line 12376 of file cp_model.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::sat::TableConstraintProto_class_data_ |
Definition at line 7040 of file cp_model.pb.cc.