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_CORE_QUIC_HEADER_LIST_H_ | 5 #ifndef NET_QUIC_CORE_QUIC_HEADER_LIST_H_ |
6 #define NET_QUIC_CORE_QUIC_HEADER_LIST_H_ | 6 #define NET_QUIC_CORE_QUIC_HEADER_LIST_H_ |
7 | 7 |
8 #include <algorithm> | 8 #include <algorithm> |
9 #include <deque> | 9 #include <deque> |
10 #include <functional> | 10 #include <functional> |
11 | 11 |
12 #include "net/quic/platform/api/quic_bug_tracker.h" | 12 #include "net/quic/platform/api/quic_bug_tracker.h" |
13 #include "net/quic/platform/api/quic_export.h" | 13 #include "net/quic/platform/api/quic_export.h" |
14 #include "net/quic/platform/api/quic_string_piece.h" | 14 #include "net/quic/platform/api/quic_string_piece.h" |
15 #include "net/spdy/spdy_header_block.h" | 15 #include "net/spdy/core/spdy_header_block.h" |
16 #include "net/spdy/spdy_headers_handler_interface.h" | 16 #include "net/spdy/core/spdy_headers_handler_interface.h" |
17 | 17 |
18 namespace net { | 18 namespace net { |
19 | 19 |
20 // A simple class that accumulates header pairs | 20 // A simple class that accumulates header pairs |
21 class QUIC_EXPORT_PRIVATE QuicHeaderList : public SpdyHeadersHandlerInterface { | 21 class QUIC_EXPORT_PRIVATE QuicHeaderList : public SpdyHeadersHandlerInterface { |
22 public: | 22 public: |
23 typedef std::deque<std::pair<std::string, std::string>> ListType; | 23 typedef std::deque<std::pair<std::string, std::string>> ListType; |
24 typedef ListType::const_iterator const_iterator; | 24 typedef ListType::const_iterator const_iterator; |
25 | 25 |
26 QuicHeaderList(); | 26 QuicHeaderList(); |
(...skipping 38 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
65 auto pred = [](const std::pair<std::string, std::string>& p1, | 65 auto pred = [](const std::pair<std::string, std::string>& p1, |
66 const std::pair<std::string, std::string>& p2) { | 66 const std::pair<std::string, std::string>& p2) { |
67 return p1.first == p2.first && p1.second == p2.second; | 67 return p1.first == p2.first && p1.second == p2.second; |
68 }; | 68 }; |
69 return std::equal(l1.begin(), l1.end(), l2.begin(), pred); | 69 return std::equal(l1.begin(), l1.end(), l2.begin(), pred); |
70 } | 70 } |
71 | 71 |
72 } // namespace net | 72 } // namespace net |
73 | 73 |
74 #endif // NET_QUIC_CORE_QUIC_HEADER_LIST_H_ | 74 #endif // NET_QUIC_CORE_QUIC_HEADER_LIST_H_ |
OLD | NEW |