readability review for luken

ui/gfx/geometry/r_tree_unittest.cc

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "testing/gtest/include/gtest/gtest.h"
 #include "ui/gfx/geometry/r_tree.h"
 #include "ui/gfx/geometry/rect.h"
 
 namespace gfx {
 
 class RTreeTest : public ::testing::Test {
  protected:
-  // Given a pointer to an RTree, traverse it and verify its internal structure
-  // is consistent with the RTree semantics.
+  // Given a pointer to an RTree, traverse it and verify that its internal
+  // structure is consistent with RTree semantics.
   void ValidateRTree(RTree* rt) {
     // If RTree is empty it should have an empty rectangle.
     if (!rt->root_->count()) {
       EXPECT_TRUE(rt->root_->rect().IsEmpty());
       EXPECT_EQ(rt->root_->level(), 0);
       return;
     }
     // Root is allowed to have fewer than min_children_ but never more than
     // max_children_.
     EXPECT_LE(rt->root_->count(), rt->max_children_);
@@ skipping 835 matching lines @@
   //  d
   //
   Rect test_rect_tie_breaker(3, 1, 1, 1);
   BuildExpandedRects(test_parent.get(), test_rect_tie_breaker, &expanded_rects);
   result =
       test_parent->LeastAreaEnlargement(test_rect_tie_breaker, expanded_rects);
   EXPECT_EQ(result->key(), 3);
 }
 
 }  // namespace gfx