Automated Code Change

PiperOrigin-RevId: 626955269
tensorflow · Apr 22, 2024 · 509a0e8 · 509a0e8
1 parent 109956f
commit 509a0e8
Show file tree

Hide file tree

Showing 2 changed files with 14 additions and 14 deletions.
diff --git a/tensorflow/core/graph/costmodel.h b/tensorflow/core/graph/costmodel.h
@@ -207,7 +207,7 @@ class CostModel {
   // Cumulative execution time.
   std::vector<Microseconds> time_;
   // Cumulative Bytes output on each channel.
-  std::vector<gtl::InlinedVector<Bytes, 2>> slot_bytes_;
+  std::vector<absl::InlinedVector<Bytes, 2UL>> slot_bytes_;
 
   // Maximum execution time
   std::vector<Microseconds> max_exec_time_;
@@ -220,13 +220,13 @@ class CostModel {
     Bytes temp_memory_size;
     Bytes persistent_memory_size;
 
-    gtl::InlinedVector<Bytes, 2> output_port_mem;
-    gtl::InlinedVector<TensorShapeProto, 2> output_port_shape;
-    gtl::InlinedVector<DataType, 2> output_port_type;
+    absl::InlinedVector<Bytes, 2UL> output_port_mem;
+    absl::InlinedVector<TensorShapeProto, 2UL> output_port_shape;
+    absl::InlinedVector<DataType, 2UL> output_port_type;
   };
   std::vector<MemUsage> max_mem_usage_;
 
-  std::vector<gtl::InlinedVector<int64_t, 2>> output_port_alloc_ids_;
+  std::vector<absl::InlinedVector<int64_t, 2UL>> output_port_alloc_ids_;
 
   std::set<int64_t> persistent_alloc_ids_;
 

diff --git a/tensorflow/core/graph/optimizer_cse.cc b/tensorflow/core/graph/optimizer_cse.cc
@@ -68,9 +68,9 @@ class OptimizerCSE {
   Graph* g_;
 };
 
-static void FillInputs(const Node* n,
-                       gtl::InlinedVector<const Node*, 4>* control_edges,
-                       gtl::InlinedVector<std::pair<const Node*, int>, 4>* in) {
+static void FillInputs(
+    const Node* n, absl::InlinedVector<const Node*, 4UL>* control_edges,
+    absl::InlinedVector<std::pair<const Node*, int>, 4UL>* in) {
   DCHECK_EQ(in->size(), n->num_inputs());
   control_edges->clear();
   for (const Edge* e : n->in_edges()) {
@@ -205,8 +205,8 @@ size_t OptimizerCSE::NodeHash(const Node* n) {
   }
 
   hasher.MixInteger(n->num_inputs());
-  gtl::InlinedVector<const Node*, 4> control_edges;
-  gtl::InlinedVector<std::pair<const Node*, int>, 4> in(n->num_inputs());
+  absl::InlinedVector<const Node*, 4UL> control_edges;
+  absl::InlinedVector<std::pair<const Node*, int>, 4UL> in(n->num_inputs());
   FillInputs(n, &control_edges, &in);
   for (const auto& edge : in) {
     hasher.MixInteger(edge.first->id());
@@ -255,10 +255,10 @@ bool OptimizerCSE::Equivalent(const Node* a, const Node* b,
   // Compare input sources
   if (a->num_inputs() != b->num_inputs()) return false;
   const int N_in = a->num_inputs();
-  gtl::InlinedVector<const Node*, 4> a_control_edges;
-  gtl::InlinedVector<const Node*, 4> b_control_edges;
-  gtl::InlinedVector<std::pair<const Node*, int>, 4> a_in(N_in);
-  gtl::InlinedVector<std::pair<const Node*, int>, 4> b_in(N_in);
+  absl::InlinedVector<const Node*, 4UL> a_control_edges;
+  absl::InlinedVector<const Node*, 4UL> b_control_edges;
+  absl::InlinedVector<std::pair<const Node*, int>, 4UL> a_in(N_in);
+  absl::InlinedVector<std::pair<const Node*, int>, 4UL> b_in(N_in);
   FillInputs(a, &a_control_edges, &a_in);
   FillInputs(b, &b_control_edges, &b_in);
   if (a_in != b_in) return false;