cc: Keep most recently used resources at the front of resource queue.

cc/base/scoped_ptr_deque.h

Index: cc/base/scoped_ptr_deque.h
diff --git a/cc/base/scoped_ptr_deque.h b/cc/base/scoped_ptr_deque.h
index cb4adfc15be5273d49a1966708effee66b6873a2..dde4a5c4d491cded8bab0ceb3920a4295a31e5a5 100644
--- a/cc/base/scoped_ptr_deque.h
+++ b/cc/base/scoped_ptr_deque.h
@@ -106,6 +106,13 @@ class ScopedPtrDeque {
     return ret.Pass();
   }
 
+  scoped_ptr<T> rtake(reverse_iterator position) {

[reveman, 2015/11/02 01:47:07]

Instead of adding this, can the user of this class be required to do the
reverse_iterator -> iterator conversion? That seems more consistent with the
underlying std::deque api.

[prashant.n, 2015/11/02 04:07:20]

I think same thing we'll have to do.

iterator it = --position.base();

and call take(it).

IMO, providing rtake will make sense as it can used with reverse iterator. WDYT?

[reveman, 2015/11/02 04:32:59]

as there's no rerase in std::deque I think it's best to also not have an rtake
in this wrapper class. Letting the user of the container take care of this sgtm.

+    DCHECK(position < rend());
+    scoped_ptr<T> ret(*position);
+    data_.erase(--position.base());
+    return ret.Pass();
+  }
+
   void swap(iterator a, iterator b) {
     DCHECK(a < end());
     DCHECK(b < end());