Add a cap of six in-flight requests per host to the ResourceScheduler

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 <cstddef>
 
 #include "testing/gtest/include/gtest/gtest.h"
 
@@ skipping 87 matching lines @@
 }
 
 TEST_F(PriorityQueueTest, LastMaxOrderErase) {
   for (size_t i = 0; i < kNumElements; ++i) {
     EXPECT_EQ(kLastMaxOrderErase[i], queue_.LastMax().value());
     queue_.Erase(queue_.LastMax());
   }
   CheckEmpty();
 }
 
+TEST_F(PriorityQueueTest, NextHighestIteration) {
+  PriorityQueue<int>::Pointer current = queue_.FirstMax();
+  for (size_t i = 0; i < kNumElements; ++i) {
+    EXPECT_FALSE(current.is_null());
+    EXPECT_EQ(kFirstMaxOrder[i], current.value());
+    current = queue_.NextHighest(current);
+  }
+  EXPECT_TRUE(current.is_null());
+}
+
+TEST_F(PriorityQueueTest, NextHighestIterationWithDeletion) {
+  PriorityQueue<int>::Pointer current = queue_.FirstMax();
+  for (size_t i = 0; i < kNumElements; ++i) {
+    EXPECT_FALSE(current.is_null());
+    EXPECT_EQ(kFirstMaxOrder[i], current.value());
+    PriorityQueue<int>::Pointer next = queue_.NextHighest(current);
+    queue_.Erase(current);
+    current = next;
+  }
+  EXPECT_TRUE(current.is_null());
+  CheckEmpty();
+}
+
 TEST_F(PriorityQueueTest, EraseFromMiddle) {
   queue_.Erase(pointers_[2]);
   queue_.Erase(pointers_[3]);
 
   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());
   }
@@ skipping 11 matching lines @@
   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