Revert of Explicitly track the scheduler task enqueueing order in a new field

components/scheduler/child/task_queue_sets.h

Index: components/scheduler/child/task_queue_sets.h
diff --git a/components/scheduler/child/task_queue_sets.h b/components/scheduler/child/task_queue_sets.h
index fd1869b84eb7dc4a2f20779a0cd90535d7581c2b..e5a32752a37a22b7d477b486aeb1df6b72d4326d 100644
--- a/components/scheduler/child/task_queue_sets.h
+++ b/components/scheduler/child/task_queue_sets.h
@@ -39,10 +39,10 @@
                            internal::TaskQueueImpl** out_queue) const;
 
  private:
-  struct EnqueueOrderComparitor {
-    // The enqueueorder numbers are generated in sequence.  These will
-    // eventually overflow and roll-over to negative numbers.  We must take care
-    // to preserve the ordering of the map when this happens.
+  struct AgeComparitor {
+    // The age numbers are generated in sequence.  These will eventually
+    // overflow and roll-over to negative numbers.  We must take care to
+    // preserve the ordering of the map when this happens.
     // NOTE we assume that tasks don't get starved for extended periods so that
     // the task queue ages in a set have at most one roll-over.
     // NOTE signed integer overflow behavior is undefined in C++ so we can't
@@ -59,9 +59,8 @@
     }
   };
 
-  typedef std::map<int, internal::TaskQueueImpl*, EnqueueOrderComparitor>
-      EnqueueOrderToQueueMap;
-  std::vector<EnqueueOrderToQueueMap> enqueue_order_to_queue_maps_;
+  typedef std::map<int, internal::TaskQueueImpl*, AgeComparitor> AgeToQueueMap;
+  std::vector<AgeToQueueMap> age_to_queue_maps_;
 
   DISALLOW_COPY_AND_ASSIGN(TaskQueueSets);
 };