OLD | NEW |
1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "net/quic/quic_http_utils.h" | 5 #include "net/quic/core/quic_http_utils.h" |
6 | 6 |
7 #include <stdint.h> | 7 #include <stdint.h> |
8 | 8 |
9 #include <limits> | 9 #include <limits> |
10 | 10 |
11 #include "testing/gtest/include/gtest/gtest.h" | 11 #include "testing/gtest/include/gtest/gtest.h" |
12 | 12 |
13 namespace net { | 13 namespace net { |
14 namespace test { | 14 namespace test { |
15 | 15 |
(...skipping 14 matching lines...) Expand all Loading... |
30 // These are invalid values, but we should still handle them | 30 // These are invalid values, but we should still handle them |
31 // gracefully. TODO(rtenneti): should we test for all possible values of | 31 // gracefully. TODO(rtenneti): should we test for all possible values of |
32 // uint32_t? | 32 // uint32_t? |
33 for (int i = 5; i < std::numeric_limits<uint8_t>::max(); ++i) { | 33 for (int i = 5; i < std::numeric_limits<uint8_t>::max(); ++i) { |
34 EXPECT_EQ(IDLE, ConvertQuicPriorityToRequestPriority(i)); | 34 EXPECT_EQ(IDLE, ConvertQuicPriorityToRequestPriority(i)); |
35 } | 35 } |
36 } | 36 } |
37 | 37 |
38 } // namespace test | 38 } // namespace test |
39 } // namespace net | 39 } // namespace net |
OLD | NEW |