fix incorrect bounds on remove child from root

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 {
 
@@ skipping 233 matching lines @@
   for (int i = 101; i <= 200; ++i) {
     rt.Insert(Rect(0, 0, i, i), i);
     ValidateRTree(&rt);
   }
   results.clear();
   rt.Query(test_rect, &results);
   EXPECT_EQ(results.size(), 200U);
   VerifyAllKeys(results);
 }
 
+TEST_F(RTreeTest, InsertDupToRoot) {
+  RTree rt(2, 5);
+  rt.Insert(Rect(0, 0, 1, 2), 1);
+  ValidateRTree(&rt);
+  rt.Insert(Rect(0, 0, 2, 1), 1);
+  ValidateRTree(&rt);
+}
+
 TEST_F(RTreeTest, InsertNegativeCoordsRect) {
   RTree rt(5, 11);
   for (int i = 1; i <= 100; ++i) {
     rt.Insert(Rect(-i, -i, i, i), (i * 2) - 1);
     ValidateRTree(&rt);
     rt.Insert(Rect(0, 0, i, i), i * 2);
     ValidateRTree(&rt);
   }
   base::hash_set<intptr_t> results;
   Rect test_rect(-1, -1, 2, 2);
@@ skipping 596 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