FBTF: Even more ctor/virtual deinlining.

media/base/pts_heap.h

 // Copyright (c) 2009 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 MEDIA_BASE_PTS_HEAP_H_
 #define MEDIA_BASE_PTS_HEAP_H_
 
 // The compressed frame are often in decode timestamp (dts) order, which
 // may not always be in presentation timestamp (pts) order. However, the
 // decoded frames will always be returned in pts order. Ideally, the pts could
@@ skipping 18 matching lines @@
 
 #include <queue>
 #include <vector>
 
 #include "base/time.h"
 
 namespace media {
 
 class PtsHeap {
  public:
-  PtsHeap() {}
+  PtsHeap();
+  ~PtsHeap();
 
-  void Push(const base::TimeDelta& pts) { queue_.push(pts); }
-  void Pop() { queue_.pop(); }
+  void Push(const base::TimeDelta& pts);
+  void Pop();
 
   const base::TimeDelta& Top() const { return queue_.top(); }
   bool IsEmpty() const { return queue_.empty(); }
 
  private:
   struct PtsHeapOrdering {
     bool operator()(const base::TimeDelta& lhs,
                     const base::TimeDelta& rhs) const {
       // std::priority_queue is a max-heap. We want lower timestamps to show up
       // first so reverse the natural less-than comparison.
       return rhs < lhs;
     }
   };
   typedef std::priority_queue<base::TimeDelta,
                               std::vector<base::TimeDelta>,
                               PtsHeapOrdering> TimeQueue;
 
   TimeQueue queue_;
 
   DISALLOW_COPY_AND_ASSIGN(PtsHeap);
 };
 
 }  // namespace media
 
 #endif  // MEDIA_BASE_PTS_HEAP_H_