| Index: net/base/priority_queue_unittest.cc
|
| ===================================================================
|
| --- net/base/priority_queue_unittest.cc (revision 212872)
|
| +++ net/base/priority_queue_unittest.cc (working copy)
|
| @@ -91,7 +91,7 @@
|
| 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());
|
| @@ -100,6 +100,21 @@
|
| 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
|
|
|