1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
//! The `cp_sat` crate provides an interface to [Google CP
//! SAT](https://developers.google.com/optimization/cp/cp_solver).
//!
//! # OR-Tools installation
//!
//! For `cp_sat` to work, you need to have a working OR-Tools
//! installation. By default, this crate will use the default C++
//! compiler, and add `/opt/ortools` in the search path. If you want
//! to provide your OR-Tools installation directory, you can define
//! the `ORTOOL_PREFIX` environment variable.
//!
//! # Brief overview
//!
//! The [builder::CpModelBuilder] provides an easy interface to
//! construct your problem. You can then solve and access to the
//! solver response easily. Here you can find the translation of the
//! first tutorial in the official documentation of CP SAT:
//!
//! ```
//! # #![allow(clippy::needless_doctest_main)]
//! use cp_sat::builder::CpModelBuilder;
//! use cp_sat::proto::CpSolverStatus;
//!
//! fn main() {
//! let mut model = CpModelBuilder::default();
//!
//! let x = model.new_int_var_with_name([(0, 2)], "x");
//! let y = model.new_int_var_with_name([(0, 2)], "y");
//! let z = model.new_int_var_with_name([(0, 2)], "z");
//!
//! model.add_ne(x, y);
//!
//! let response = model.solve();
//! println!(
//! "{}",
//! cp_sat::ffi::cp_solver_response_stats(&response, false)
//! );
//!
//! if response.status() == CpSolverStatus::Optimal {
//! println!("x = {}", x.solution_value(&response));
//! println!("y = {}", y.solution_value(&response));
//! println!("z = {}", z.solution_value(&response));
//! }
//! }
//! ```
/// Model builder for ergonomic and efficient model creation.
/// Export of the CP SAT protobufs
/// Interface with the CP SAT functions.
pub use prost;