[net/dns] Perform A/AAAA queries for AF_UNSPEC resolutions in parallel.

net/base/priority_queue_unittest.cc

 // Copyright (c) 2012 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.
 
 #include "net/base/priority_queue.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace net {
 
 namespace {
@@ skipping 73 matching lines @@
     EXPECT_EQ(kLastMaxOrder[i], queue_.LastMax().value());
     queue_.Erase(queue_.LastMax());
   }
   CheckEmpty();
 }
 
 TEST_F(PriorityQueueTest, EraseFromMiddle) {
   queue_.Erase(pointers_[2]);
   queue_.Erase(pointers_[3]);
 
-  int expected_order[] = { 8, 1, 6, 0, 5, 4, 7 };
+  const int expected_order[] = { 8, 1, 6, 0, 5, 4, 7 };
 
   for (size_t i = 0; i < arraysize(expected_order); ++i) {
     EXPECT_EQ(expected_order[i], queue_.FirstMin().value());
     queue_.Erase(queue_.FirstMin());
   }
   CheckEmpty();
 }
 
+TEST_F(PriorityQueueTest, InsertAtFront) {
+  queue_.InsertAtFront(9, 2);
+  queue_.InsertAtFront(10, 0);
+  queue_.InsertAtFront(11, 1);
+  queue_.InsertAtFront(12, 1);
+
+  const int expected_order[] = { 10, 3, 8, 12, 11, 1, 6, 9, 0, 2, 5, 4, 7 };
+
+  for (size_t i = 0; i < arraysize(expected_order); ++i) {
+    EXPECT_EQ(expected_order[i], queue_.FirstMin().value());
+    queue_.Erase(queue_.FirstMin());
+  }
+  CheckEmpty();
+}
+
 }  // namespace
 
 }  // namespace net