algorithms: export from google3

Author: Mizux

ortools/algorithms/BUILD.bazel

@@ -334,6 +334,7 @@ cc_library(
         "//ortools/linear_solver",
         "//ortools/lp_data:base",
         "@com_google_absl//absl/log",
+        "@com_google_absl//absl/log:check",
         "@com_google_absl//absl/types:span",
     ],
 )

ortools/algorithms/set_cover_invariant.cc

@@ -124,7 +124,7 @@ std::tuple<Cost, ElementToIntVector> SetCoverInvariant::ComputeCostAndCoverage(
 
 ElementToIntVector SetCoverInvariant::ComputeCoverageInFocus(
     const absl::Span<const SubsetIndex> focus) const {
-  ElementToIntVector coverage;
+  ElementToIntVector coverage(coverage_.size());
   for (const SubsetIndex subset : focus) {
     if (is_selected_[subset]) {
       for (const ElementIndex element : model_->columns()[subset]) {

ortools/algorithms/set_cover_mip.cc

@@ -16,6 +16,7 @@
 #include <cstdint>
 #include <limits>
 
+#include "absl/log/check.h"
 #include "absl/types/span.h"
 #include "ortools/algorithms/set_cover_invariant.h"
 #include "ortools/algorithms/set_cover_model.h"
@@ -29,7 +30,8 @@ namespace {
 // Returns the vector a - b.
 ElementToIntVector Subtract(const ElementToIntVector& a,
                             const ElementToIntVector& b) {
-  ElementToIntVector delta;
+  ElementToIntVector delta(a.size());
+  DCHECK_EQ(a.size(), b.size());
   for (const ElementIndex i : a.index_range()) {
     delta[i] = a[i] - b[i];
   }