Introduce subclass wrappers for STL containers that make them a lot easier

src/compiler/verifier.cc

Index: src/compiler/verifier.cc
diff --git a/src/compiler/verifier.cc b/src/compiler/verifier.cc
index 9b06e3140eab4c6af39b54dddbffc00ce8bb6ac7..8b780e9320558e441afc6e79d94945444c3e3521 100644
--- a/src/compiler/verifier.cc
+++ b/src/compiler/verifier.cc
@@ -320,9 +320,9 @@ void ScheduleVerifier::Run(Schedule* schedule) {
   }
 
   // Verify that all blocks reachable from start are in the RPO.
-  BoolVector marked(count, false, BoolVector::allocator_type(zone));
+  BoolVector marked(count, false, zone);
   {
-    std::queue<BasicBlock*> queue;
+    ZoneQueue<BasicBlock*> queue(zone);
     queue.push(start);
     marked[start->id()] = true;
     while (!queue.empty()) {
@@ -358,7 +358,7 @@ void ScheduleVerifier::Run(Schedule* schedule) {
 
     // Compute a set of all the nodes that dominate a given node by using
     // a forward fixpoint. O(n^2).
-    std::queue<BasicBlock*> queue;
+    ZoneQueue<BasicBlock*> queue(zone);
     queue.push(start);
     dominators[start->id()] = new (zone) BitVector(count, zone);
     while (!queue.empty()) {