commit f24fe33d2af77e899bf9be721a5500476b6413c8
author Samuel Marks <807580+SamuelMarks@users.noreply.github.com> Thu Oct 14 23:21:56 2021 -0400
committer Samuel Marks <807580+SamuelMarks@users.noreply.github.com> Thu Oct 14 23:21:56 2021 -0400
tree c04a87ef8b17ddf5fa1ab0bcaf6f28f1d930ed4f
parent 71e3a6d3a7cd6a0bfd924dad53a6bf24e17c884b

[tensorflow/compiler/xla/shape_tree_test.cc] Add calls to `reserve()` before populating vectors

tensorflow/compiler/xla/shape_tree_test.cc

diff --git a/tensorflow/compiler/xla/shape_tree_test.cc b/tensorflow/compiler/xla/shape_tree_test.cc
index 9078f67..a2f37e2 100644
--- a/tensorflow/compiler/xla/shape_tree_test.cc
+++ b/tensorflow/compiler/xla/shape_tree_test.cc
@@ -450,6 +450,7 @@
 TEST_F(ShapeTreeTest, IterateOrder) {
   ShapeTree<int> t(nested_tuple_shape_, 42);
   std::vector<ShapeIndex> v;
+  v.reserve(t.leaf_count());
   for (auto index_to_data : t) {
     v.push_back(index_to_data.first);
   }
@@ -468,6 +469,7 @@
 TEST_F(ShapeTreeTest, ReverseIterateOrder) {
   ShapeTree<int> t(nested_tuple_shape_, 42);
   std::vector<ShapeIndex> v;
+  v.reserve(t.leaf_count());
   for (auto it = t.rbegin(); it != t.rend(); ++it) {
     v.push_back(it->first);
   }
@@ -512,7 +514,9 @@
 TEST_F(ShapeTreeTest, IterateOrderLeaves) {
   ShapeTree<int> t(nested_tuple_shape_, 42);
   std::vector<ShapeIndex> v;
-  for (auto index_to_data : t.leaves()) {
+  auto leaves = t.leaves();
+  v.reserve(t.leaf_count());
+  for (auto index_to_data : leaves) {
     v.push_back(index_to_data.first);
   }
   EXPECT_EQ(v, (std::vector<ShapeIndex>{
@@ -522,6 +526,7 @@
 TEST_F(ShapeTreeTest, ReverseIterateOrderLeaves) {
   ShapeTree<int> t(nested_tuple_shape_, 42);
   std::vector<ShapeIndex> v;
+  v.reserve(t.leaf_count());
   for (auto it = t.leaf_rbegin(); it != t.leaf_rend(); ++it) {
     v.push_back(it->first);
   }