OLD | NEW |
1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 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_utils.h" | 5 #include "net/quic/quic_utils.h" |
6 | 6 |
7 #include <ctype.h> | 7 #include <ctype.h> |
8 | 8 |
9 #include <algorithm> | 9 #include <algorithm> |
10 | 10 |
| 11 #include "base/basictypes.h" |
11 #include "base/logging.h" | 12 #include "base/logging.h" |
12 #include "base/port.h" | 13 #include "base/port.h" |
13 #include "base/strings/stringprintf.h" | 14 #include "base/strings/stringprintf.h" |
14 #include "base/strings/string_number_conversions.h" | 15 #include "base/strings/string_number_conversions.h" |
15 #include "net/spdy/write_blocked_list.h" | 16 #include "net/spdy/write_blocked_list.h" |
16 | 17 |
17 using base::StringPiece; | 18 using base::StringPiece; |
18 using std::string; | 19 using std::string; |
19 | 20 |
20 namespace net { | 21 namespace net { |
(...skipping 266 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
287 QuicPriority QuicUtils::LowestPriority() { | 288 QuicPriority QuicUtils::LowestPriority() { |
288 return static_cast<QuicPriority>(kLowestPriority); | 289 return static_cast<QuicPriority>(kLowestPriority); |
289 } | 290 } |
290 | 291 |
291 // static | 292 // static |
292 QuicPriority QuicUtils::HighestPriority() { | 293 QuicPriority QuicUtils::HighestPriority() { |
293 return static_cast<QuicPriority>(kHighestPriority); | 294 return static_cast<QuicPriority>(kHighestPriority); |
294 } | 295 } |
295 | 296 |
296 } // namespace net | 297 } // namespace net |
OLD | NEW |