Raster display item lists via a visual rect RTree.

cc/base/rtree.h

 // Copyright (c) 2015 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.
 
 #ifndef CC_BASE_RTREE_H_
 #define CC_BASE_RTREE_H_
 
 #include <deque>
 #include <vector>
 
 #include "cc/base/cc_export.h"
-#include "ui/gfx/geometry/rect_f.h"
+#include "ui/gfx/geometry/rect.h"
 
 namespace cc {
 
 // The following description and most of the implementation is borrowed from
 // Skia's SkRTree implementation.
 //
 // An R-Tree implementation. In short, it is a balanced n-ary tree containing a
 // hierarchy of bounding rectangles.
 //
 // It only supports bulk-loading, i.e. creation from a batch of bounding
@@ skipping 45 matching lines @@
     }
   }
 
   template <typename Container>
   void Build(const Container& items) {
     Build(items, [](const gfx::Rect& bounds) { return bounds; });
   }
 
   void Search(const gfx::Rect& query, std::vector<size_t>* results) const;
 
+  gfx::Rect GetBounds() const;
+
  private:
   // These values were empirically determined to produce reasonable performance
   // in most cases.
   enum { MIN_CHILDREN = 6, MAX_CHILDREN = 11 };
 
   struct Node;
   struct Branch {
     // When the node level is 0, then the node is a leaf and the branch has a
     // valid index pointing to an element in the vector that was used to build
     // this rtree. When the level is not 0, it's an internal node and it has a
@@ skipping 21 matching lines @@
 
   // This is the count of data elements (rather than total nodes in the tree)
   size_t num_data_elements_;
   Branch root_;
   std::deque<Node> nodes_;
 };
 
 }  // namespace cc
 
 #endif  // CC_BASE_RTREE_H_