export from google3

ortools/constraint_solver/csharp/IntVarArrayHelper.cs

@@ -174,7 +174,7 @@ public static class IntVarArrayHelper
     }
 }
 
-// TODO(user): Try to move this code back to the .swig with @define macros.
+// TODO(user): Try to move this code back to the .i with @define macros.
 public partial class IntVarVector : IDisposable,
                                     System.Collections.IEnumerable
 #if !SWIG_DOTNET_1

ortools/constraint_solver/csharp/constraint_solver.i

@@ -929,7 +929,7 @@ PROTO2_RETURN(operations_research::CpModel,
 
 namespace operations_research {
 // Globals
-// IMPORTANT(corentinl): Global will be placed in operations_research_constraint_solver.cs
+// IMPORTANT(user): Global will be placed in operations_research_constraint_solver.cs
 // Ignored:
 %ignore FillValues;
 }  // namespace operations_research

ortools/constraint_solver/local_search.cc

@@ -2731,7 +2731,7 @@ class PathStateFilter : public LocalSearchFilter {
   // Selection-based algorithm in O(n^2), to use for small change sets.
   void MakeChainsFromChangedPathsAndArcsWithSelectionAlgorithm();
   // From changed_paths_ and changed_arcs_, fill chains_ and paths_.
-  // Generic algorithm in O(std::sort(n)+n), to use for larger change sets.
+  // Generic algorithm in O(sort(n)+n), to use for larger change sets.
   void MakeChainsFromChangedPathsAndArcsWithGenericAlgorithm();
 
   const std::unique_ptr<PathState> path_state_;

ortools/constraint_solver/routing.cc

@@ -6564,6 +6564,7 @@ void RoutingDimension::InitializeTransits(
   InitializeTransitVariables(slack_max);
 }
 
+// TODO(user): Apply -pointer-following.
 void FillPathEvaluation(const std::vector<int64_t>& path,
                         const RoutingModel::TransitCallback2& evaluator,
                         std::vector<int64_t>* values) {