large sync with main

Author: lperron

examples/java/IntegerProgramming.java

@@ -19,10 +19,7 @@
 import com.google.ortools.linearsolver.MPSolver;
 import com.google.ortools.linearsolver.MPVariable;
 
-/**
- * Integer programming example that shows how to use the API.
- *
- */
+/** Integer programming example that shows how to use the API. */
 public class IntegerProgramming {
   private static void runIntegerProgrammingExample(String solverType) {
     MPSolver solver = MPSolver.createSolver(solverType);
@@ -55,7 +52,7 @@ private static void runIntegerProgrammingExample(String solverType) {
 
     // Verify that the solution satisfies all constraints (when using solvers
     // others than GLOP_LINEAR_PROGRAMMING, this is highly recommended!).
-    if (!solver.verifySolution(/*tolerance=*/1e-7, /* log_errors= */ true)) {
+    if (!solver.verifySolution(/* tolerance= */ 1e-7, /* log_errors= */ true)) {
       System.err.println("The solution returned by the solver violated the"
           + " problem constraints by at least 1e-7");
       return;

examples/java/LinearProgramming.java

@@ -30,7 +30,7 @@ private static void runLinearProgrammingExample(String solverType, boolean print
       System.out.println("Could not create solver " + solverType);
       return;
     }
-    double infinity = java.lang.Double.POSITIVE_INFINITY;
+    double infinity = Double.POSITIVE_INFINITY;
     // x1, x2 and x3 are continuous non-negative variables.
     MPVariable x1 = solver.makeNumVar(0.0, infinity, "x1");
     MPVariable x2 = solver.makeNumVar(0.0, infinity, "x2");
@@ -65,7 +65,7 @@ private static void runLinearProgrammingExample(String solverType, boolean print
     System.out.println("Number of constraints = " + solver.numConstraints());
 
     if (printModel) {
-      String model = solver.exportModelAsLpFormat(/* obfuscate = */false);
+      String model = solver.exportModelAsLpFormat(/* obfuscate= */ false);
       System.out.println(model);
     }
 
@@ -79,7 +79,7 @@ private static void runLinearProgrammingExample(String solverType, boolean print
 
     // Verify that the solution satisfies all constraints (when using solvers
     // others than GLOP_LINEAR_PROGRAMMING, this is highly recommended!).
-    if (!solver.verifySolution(/*tolerance=*/1e-7, /* log_errors= */ true)) {
+    if (!solver.verifySolution(/* tolerance= */ 1e-7, /* log_errors= */ true)) {
       System.err.println("The solution returned by the solver violated the"
           + " problem constraints by at least 1e-7");
       return;

examples/notebook/constraint_solver/cp_is_fun_cp.ipynb

@@ -91,7 +91,6 @@
     "from ortools.constraint_solver import pywrapcp\n",
     "\n",
     "\n",
-    "\n",
     "def main():\n",
     "    # Constraint programming engine\n",
     "    solver = pywrapcp.Solver(\"CP is fun!\")\n",

examples/notebook/constraint_solver/nqueens_cp.ipynb

@@ -87,7 +87,6 @@
     "from ortools.constraint_solver import pywrapcp\n",
     "\n",
     "\n",
-    "\n",
     "def main(board_size):\n",
     "    # Creates the solver.\n",
     "    solver = pywrapcp.Solver(\"n-queens\")\n",

examples/notebook/constraint_solver/simple_cp_program.ipynb

@@ -86,7 +86,6 @@
     "from ortools.constraint_solver import pywrapcp\n",
     "\n",
     "\n",
-    "\n",
     "def main():\n",
     "    \"\"\"Entry point of the program.\"\"\"\n",
     "    # Instantiate the solver.\n",

examples/notebook/examples/shift_scheduling_sat.ipynb

@@ -98,7 +98,7 @@
     "def negated_bounded_span(\n",
     "    works: list[cp_model.BoolVarT], start: int, length: int\n",
     ") -> list[cp_model.BoolVarT]:\n",
-    "    \"\"\"Filters an isolated sub-sequence of variables assined to True.\n",
+    "    \"\"\"Filters an isolated sub-sequence of variables assigned to True.\n",
     "\n",
     "    Extract the span of Boolean variables [start, start + length), negate them,\n",
     "    and if there is variables to the left/right of this span, surround the span by\n",
@@ -342,7 +342,7 @@
     "        (3, 1, 0),\n",
     "    ]\n",
     "\n",
-    "    # daily demands for work shifts (morning, afternon, night) for each day\n",
+    "    # daily demands for work shifts (morning, afternoon, night) for each day\n",
     "    # of the week starting on Monday.\n",
     "    weekly_cover_demands = [\n",
     "        (2, 3, 1),  # Monday\n",