cc: Change Nodes collection to use base::ContiguousContainer instead of deque.

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 <deque>
 #include <vector>
 
 #include "cc/base/cc_export.h"
+#include "cc/base/contiguous_container.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.
 //
@@ skipping 83 matching lines @@
                        const gfx::Rect& query,
                        std::vector<size_t>* results) const;
 
   // Consumes the input array.
   Branch BuildRecursive(std::vector<Branch>* branches, int level);
   Node* AllocateNodeAtLevel(int level);
 
   // 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_;
+  ContiguousContainer<Node> nodes_;
 };
 
 }  // namespace cc
 
 #endif  // CC_BASE_RTREE_H_