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

cc/resources/resource_pool.h

Index: cc/resources/resource_pool.h
diff --git a/cc/resources/resource_pool.h b/cc/resources/resource_pool.h
index c1db254e052e78627fdcb791aa01f528a69b1177..3358c152230b056c6bc84b46ea973a825588e1de 100644
--- a/cc/resources/resource_pool.h
+++ b/cc/resources/resource_pool.h
@@ -119,6 +119,7 @@ class CC_EXPORT ResourcePool : public base::trace_event::MemoryDumpProvider {
   size_t total_resource_count_;
 
   using ResourceDeque = ScopedPtrDeque<PoolResource>;
+  // Holds least recently used resources at the front of the queue.

[reveman, 2015/11/02 06:07:51]

why don't we just revert this order and keep the least recently used at the back
instead to avoid the reverse iterator stuff?

[prashant.n, 2015/11/02 17:56:45]

Should we do this or leave as it is? Do let me know your opinion, so that I can
modify.

[reveman, 2015/11/02 18:16:29]

Unless I missing something, reverting the order is just a matter of changing a
push_back to push_front and a few calls to take_front()/front() to
take_back()/back(). That seems a lot simpler and than the reverse iterator
changes and unless there's something more to it I'd prefer that approach.

   ResourceDeque unused_resources_;
   ResourceDeque busy_resources_;