work on cp/routing

Author: lperron

ortools/constraint_solver/local_search.cc

@@ -1924,7 +1924,7 @@ class NearestNeighbors {
   NearestNeighbors& operator=(const NearestNeighbors&) = delete;
 
   virtual ~NearestNeighbors() {}
-  void Initialize(const std::vector<int>& path);
+  void Initialize(absl::Span<const int> path);
   const std::vector<int>& Neighbors(int index) const;
 
   virtual std::string DebugString() const { return "NearestNeighbors"; }
@@ -1945,7 +1945,7 @@ NearestNeighbors::NearestNeighbors(Solver::IndexEvaluator3 evaluator,
       path_operator_(path_operator),
       size_(size) {}
 
-void NearestNeighbors::Initialize(const std::vector<int>& path) {
+void NearestNeighbors::Initialize(absl::Span<const int> path) {
   for (int node : path) {
     if (node < path_operator_.number_of_nexts()) ComputeNearest(node, path);
   }

ortools/routing/search.cc

@@ -2543,7 +2543,7 @@ bool LocalCheapestInsertionFilteredHeuristic::OptimizeOnInsertion(
 namespace {
 // Computes the cost from vehicle starts to pickups.
 std::vector<std::vector<int64_t>> ComputeStartToPickupCosts(
-    const RoutingModel& model, const std::vector<int64_t>& pickups,
+    const RoutingModel& model, absl::Span<const int64_t> pickups,
     const Bitset64<int>& vehicle_set) {
   std::vector<std::vector<int64_t>> pickup_costs(model.Size());
   for (int64_t pickup : pickups) {
@@ -2560,7 +2560,7 @@ std::vector<std::vector<int64_t>> ComputeStartToPickupCosts(
 
 // Computes the cost from deliveries to vehicle ends.
 std::vector<std::vector<int64_t>> ComputeDeliveryToEndCosts(
-    const RoutingModel& model, const std::vector<int64_t>& deliveries,
+    const RoutingModel& model, absl::Span<const int64_t> deliveries,
     const Bitset64<int>& vehicle_set) {
   std::vector<std::vector<int64_t>> delivery_costs(model.Size());
   for (int64_t delivery : deliveries) {
@@ -4822,8 +4822,8 @@ class RouteConstructor {
   enum MergeStatus { FIRST_SECOND, SECOND_FIRST, NO_MERGE };
 
   struct RouteSort {
-    bool operator()(const std::vector<int>& route1,
-                    const std::vector<int>& route2) const {
+    bool operator()(absl::Span<const int> route1,
+                    absl::Span<const int> route2) const {
       return (route1.size() < route2.size());
     }
   } RouteComparator;