OLD | NEW |
1 // Copyright (c) 2016 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2016 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 #ifndef NET_QUIC_QUIC_HEADER_LIST_H_ | 5 #ifndef NET_QUIC_QUIC_HEADER_LIST_H_ |
6 #define NET_QUIC_QUIC_HEADER_LIST_H_ | 6 #define NET_QUIC_QUIC_HEADER_LIST_H_ |
7 | 7 |
| 8 #include <algorithm> |
8 #include <deque> | 9 #include <deque> |
9 #include <functional> | 10 #include <functional> |
10 | 11 |
11 #include "base/strings/string_piece.h" | 12 #include "base/strings/string_piece.h" |
12 #include "net/base/net_export.h" | 13 #include "net/base/net_export.h" |
13 #include "net/quic/core/quic_bug_tracker.h" | 14 #include "net/quic/core/quic_bug_tracker.h" |
14 #include "net/spdy/spdy_header_block.h" | 15 #include "net/spdy/spdy_header_block.h" |
15 #include "net/spdy/spdy_headers_handler_interface.h" | 16 #include "net/spdy/spdy_headers_handler_interface.h" |
16 | 17 |
17 namespace net { | 18 namespace net { |
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
53 | 54 |
54 std::string DebugString() const; | 55 std::string DebugString() const; |
55 | 56 |
56 private: | 57 private: |
57 std::deque<std::pair<std::string, std::string>> header_list_; | 58 std::deque<std::pair<std::string, std::string>> header_list_; |
58 size_t max_uncompressed_header_bytes_; | 59 size_t max_uncompressed_header_bytes_; |
59 size_t uncompressed_header_bytes_; | 60 size_t uncompressed_header_bytes_; |
60 size_t compressed_header_bytes_; | 61 size_t compressed_header_bytes_; |
61 }; | 62 }; |
62 | 63 |
| 64 inline bool operator==(const QuicHeaderList& l1, const QuicHeaderList& l2) { |
| 65 auto pred = [](const std::pair<std::string, std::string>& p1, |
| 66 const std::pair<std::string, std::string>& p2) { |
| 67 return p1.first == p2.first && p1.second == p2.second; |
| 68 }; |
| 69 return std::equal(l1.begin(), l1.end(), l2.begin(), pred); |
| 70 } |
| 71 |
63 } // namespace net | 72 } // namespace net |
64 | 73 |
65 #endif // NET_QUIC_QUIC_HEADER_LIST_H_ | 74 #endif // NET_QUIC_QUIC_HEADER_LIST_H_ |
OLD | NEW |