Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
cp_model_checker.h File Reference
#include <cstdint>
#include <string>
#include <utility>
#include <vector>
#include "absl/types/span.h"
#include "ortools/sat/cp_model.pb.h"
#include "ortools/sat/sat_parameters.pb.h"

Go to the source code of this file.

Namespaces

namespace  operations_research
 In SWIG mode, we don't want anything besides these top-level includes.
namespace  operations_research::sat

Functions

std::string operations_research::sat::ValidateCpModel (const CpModelProto &model, bool after_presolve)
std::string operations_research::sat::ValidateInputCpModel (const SatParameters &params, const CpModelProto &model)
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)
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)
bool operations_research::sat::SolutionCanBeOptimal (const CpModelProto &model, absl::Span< const int64_t > variable_values)
 Verifies some invariants that any optimal solution must satisfy.
bool operations_research::sat::ConstraintIsFeasible (const CpModelProto &model, const ConstraintProto &constraint, absl::Span< const int64_t > variable_values)