| 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 #include "net/quic/core/frames/quic_ack_frame.h" | 5 #include "net/quic/core/frames/quic_ack_frame.h" |
| 6 | 6 |
| 7 #include "net/quic/core/quic_constants.h" | 7 #include "net/quic/core/quic_constants.h" |
| 8 #include "net/quic/platform/api/quic_bug_tracker.h" | 8 #include "net/quic/platform/api/quic_bug_tracker.h" |
| 9 | 9 |
| 10 namespace net { | 10 namespace net { |
| (...skipping 62 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 73 } | 73 } |
| 74 | 74 |
| 75 void PacketNumberQueue::RemoveSmallestInterval() { | 75 void PacketNumberQueue::RemoveSmallestInterval() { |
| 76 QUIC_BUG_IF(packet_number_intervals_.Size() < 2) | 76 QUIC_BUG_IF(packet_number_intervals_.Size() < 2) |
| 77 << (Empty() ? "No intervals to remove." | 77 << (Empty() ? "No intervals to remove." |
| 78 : "Can't remove the last interval."); | 78 : "Can't remove the last interval."); |
| 79 | 79 |
| 80 packet_number_intervals_.Difference(*packet_number_intervals_.begin()); | 80 packet_number_intervals_.Difference(*packet_number_intervals_.begin()); |
| 81 } | 81 } |
| 82 | 82 |
| 83 void PacketNumberQueue::Complement() { | |
| 84 if (Empty()) { | |
| 85 return; | |
| 86 } | |
| 87 packet_number_intervals_.Complement(Min(), Max() + 1); | |
| 88 } | |
| 89 | |
| 90 bool PacketNumberQueue::Contains(QuicPacketNumber packet_number) const { | 83 bool PacketNumberQueue::Contains(QuicPacketNumber packet_number) const { |
| 91 return packet_number_intervals_.Contains(packet_number); | 84 return packet_number_intervals_.Contains(packet_number); |
| 92 } | 85 } |
| 93 | 86 |
| 94 bool PacketNumberQueue::Empty() const { | 87 bool PacketNumberQueue::Empty() const { |
| 95 return packet_number_intervals_.Empty(); | 88 return packet_number_intervals_.Empty(); |
| 96 } | 89 } |
| 97 | 90 |
| 98 QuicPacketNumber PacketNumberQueue::Min() const { | 91 QuicPacketNumber PacketNumberQueue::Min() const { |
| 99 DCHECK(!Empty()); | 92 DCHECK(!Empty()); |
| (...skipping 59 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 159 for (const Interval<QuicPacketNumber>& interval : q) { | 152 for (const Interval<QuicPacketNumber>& interval : q) { |
| 160 for (QuicPacketNumber packet_number = interval.min(); | 153 for (QuicPacketNumber packet_number = interval.min(); |
| 161 packet_number < interval.max(); ++packet_number) { | 154 packet_number < interval.max(); ++packet_number) { |
| 162 os << packet_number << " "; | 155 os << packet_number << " "; |
| 163 } | 156 } |
| 164 } | 157 } |
| 165 return os; | 158 return os; |
| 166 } | 159 } |
| 167 | 160 |
| 168 } // namespace net | 161 } // namespace net |
| OLD | NEW |