algorithms: export from google3

Author: Mizux

ortools/algorithms/BUILD.bazel

@@ -221,6 +221,7 @@ cc_library(
         "//ortools/sat:cp_model",
         "//ortools/sat:cp_model_cc_proto",
         "//ortools/sat:cp_model_solver",
+        "//ortools/sat:sat_parameters_cc_proto",
         "//ortools/util:bitset",
         "//ortools/util:time_limit",
         "@abseil-cpp//absl/log",

ortools/algorithms/adjustable_k_ary_heap_test.cc

@@ -23,7 +23,6 @@
 #include "absl/random/random.h"
 #include "gtest/gtest.h"
 #include "ortools/base/strong_int.h"
-#include "ortools/base/strong_vector.h"
 
 namespace operations_research {
 

ortools/algorithms/binary_indexed_tree_test.cc

@@ -13,6 +13,8 @@
 
 #include "ortools/algorithms/binary_indexed_tree.h"
 
+#include <vector>
+
 #include "gtest/gtest.h"
 
 namespace operations_research {

ortools/algorithms/dynamic_permutation.cc

@@ -13,11 +13,11 @@
 
 #include "ortools/algorithms/dynamic_permutation.h"
 
-#include <algorithm>
 #include <memory>
 #include <string>
 #include <vector>
 
+#include "absl/log/check.h"
 #include "absl/types/span.h"
 #include "ortools/algorithms/sparse_permutation.h"
 

ortools/algorithms/knapsack_solver.cc

@@ -14,6 +14,7 @@
 #include "ortools/algorithms/knapsack_solver.h"
 
 #include <algorithm>
+#include <cmath>
 #include <cstdint>
 #include <limits>
 #include <memory>
@@ -32,6 +33,7 @@
 #include "ortools/sat/cp_model.h"
 #include "ortools/sat/cp_model.pb.h"
 #include "ortools/sat/cp_model_solver.h"
+#include "ortools/sat/sat_parameters.pb.h"
 #include "ortools/util/bitset.h"
 #include "ortools/util/time_limit.h"
 
@@ -1293,7 +1295,7 @@ class KnapsackCpSat : public BaseKnapsackSolver {
             const std::vector<int64_t>& capacities) override;
 
   // Solves the problem and returns the profit of the optimal solution.
-  int64_t Solve(TimeLimit* time_limit, double time_limit_in_seconds,
+  int64_t Solve(TimeLimit* time_limit, double time_limit_in_second,
                 bool* is_solution_optimal) override;
 
   // Returns true if the item 'item_id' is packed in the optimal knapsack.

ortools/algorithms/multikey_radix_sort_benchmark.cc

@@ -15,7 +15,6 @@
 #include <cstddef>
 #include <cstdint>
 #include <limits>
-#include <string>
 #include <type_traits>
 #include <utility>
 #include <vector>

ortools/algorithms/space_saving_most_frequent_benchmark.cc

@@ -12,22 +12,10 @@
 // limitations under the License.
 
 #include <array>
-#include <cstddef>
-#include <cstdint>
-#include <functional>
-#include <memory>
-#include <optional>
 #include <random>
-#include <string>
-#include <tuple>
 #include <utility>
 #include <vector>
 
-#include "absl/algorithm/container.h"
-#include "absl/base/nullability.h"
-#include "absl/hash/hash.h"
-#include "absl/log/check.h"
-#include "absl/random/distributions.h"
 #include "absl/random/random.h"
 #include "benchmark/benchmark.h"
 #include "ortools/algorithms/space_saving_most_frequent.h"

ortools/algorithms/space_saving_most_frequent_test.cc

@@ -13,13 +13,11 @@
 
 #include "ortools/algorithms/space_saving_most_frequent.h"
 
-#include <array>
 #include <cstddef>
 #include <cstdint>
 #include <functional>
 #include <memory>
 #include <optional>
-#include <random>
 #include <string>
 #include <tuple>
 #include <utility>