cc: Use pointers for heaps in tile manager raster tile priority queue.

cc/base/scoped_ptr_vector.h

 // Copyright 2012 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_SCOPED_PTR_VECTOR_H_
 #define CC_BASE_SCOPED_PTR_VECTOR_H_
 
 #include <algorithm>
 #include <vector>
 
@@ skipping 148 matching lines @@
     typename std::vector<T*>::iterator writable_a = a;
     typename std::vector<T*>::iterator writable_b = b;
     std::swap(*writable_a, *writable_b);
   }
 
   template<class Compare>
   inline void sort(Compare comp) {
     std::sort(data_.begin(), data_.end(), comp);
   }
 
+  template <class Compare>
+  inline void make_heap(Compare comp) {
+    std::make_heap(data_.begin(), data_.end(), comp);
+  }
+
+  template <class Compare>
+  inline void push_heap(Compare comp) {
+    std::push_heap(data_.begin(), data_.end(), comp);
+  }
+
+  template <class Compare>
+  inline void pop_heap(Compare comp) {
+    std::pop_heap(data_.begin(), data_.end(), comp);
+  }
+
   iterator begin() { return static_cast<iterator>(data_.begin()); }
   const_iterator begin() const { return data_.begin(); }
   iterator end() { return static_cast<iterator>(data_.end()); }
   const_iterator end() const { return data_.end(); }
 
   reverse_iterator rbegin() { return data_.rbegin(); }
   const_reverse_iterator rbegin() const { return data_.rbegin(); }
   reverse_iterator rend() { return data_.rend(); }
   const_reverse_iterator rend() const { return data_.rend(); }
 
  private:
   std::vector<T*> data_;
 
   DISALLOW_COPY_AND_ASSIGN(ScopedPtrVector);
 };
 
 }  // namespace cc
 
 #endif  // CC_BASE_SCOPED_PTR_VECTOR_H_