Move cc::DisplayItemList and related classes into cc/paint/

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 <stddef.h>
 #include <stdint.h>
 
 #include <vector>
 
-#include "cc/base/cc_export.h"
+#include "cc/base/base_export.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
 // rectangles. This performs a bottom-up bulk load using the STR
 // (sort-tile-recursive) algorithm.
 //
 // Things to do: Experiment with other bulk-load algorithms (in particular the
 // Hilbert pack variant, which groups rects by position on the Hilbert curve, is
 // probably worth a look). There also exist top-down bulk load variants
 // (VAMSplit, TopDownGreedy, etc).
 //
 // For more details see:
 //
 //  Beckmann, N.; Kriegel, H. P.; Schneider, R.; Seeger, B. (1990).
 //  "The R*-tree: an efficient and robust access method for points and
 //  rectangles"
-class CC_EXPORT RTree {
+class CC_BASE_EXPORT RTree {
  public:
   RTree();
   ~RTree();
 
   template <typename Container, typename Functor>
   void Build(const Container& items, const Functor& bounds_getter) {
     DCHECK_EQ(0u, num_data_elements_);
 
     std::vector<Branch> branches;
     branches.reserve(items.size());
@@ skipping 84 matching lines @@
 
   // This is the count of data elements (rather than total nodes in the tree)
   size_t num_data_elements_;
   Branch root_;
   std::vector<Node> nodes_;
 };
 
 }  // namespace cc
 
 #endif  // CC_BASE_RTREE_H_