Landing Recent QUIC changes until 03:18 AM, May 28, UTC

net/quic/core/frames/quic_ack_frame.h

 // Copyright (c) 2016 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef NET_QUIC_CORE_FRAMES_QUIC_ACK_FRAME_H_
 #define NET_QUIC_CORE_FRAMES_QUIC_ACK_FRAME_H_
 
 #include <ostream>
 #include <string>
 
@@ skipping 34 matching lines @@
   // the queue. It is undefined behavior to call this with |higher| < |lower|.
   void Remove(QuicPacketNumber lower, QuicPacketNumber higher);
 
   // Removes packets with values less than |higher| from the set of packets in
   // the queue. Returns true if packets were removed.
   bool RemoveUpTo(QuicPacketNumber higher);
 
   // Removes the smallest interval in the queue.
   void RemoveSmallestInterval();
 
-  // Mutates packet number set so that it contains only those packet numbers
-  // from minimum to maximum packet number not currently in the set. Do nothing
-  // if packet number set is empty.
-  void Complement();
-
   // Returns true if the queue contains |packet_number|.
   bool Contains(QuicPacketNumber packet_number) const;
 
   // Returns true if the queue is empty.
   bool Empty() const;
 
   // Returns the minimum packet number stored in the queue. It is undefined
   // behavior to call this if the queue is empty.
   QuicPacketNumber Min() const;
 
@@ skipping 53 matching lines @@
 // as missing.
 // Always returns false for packet numbers less than least_unacked.
 QUIC_EXPORT_PRIVATE bool IsAwaitingPacket(
     const QuicAckFrame& ack_frame,
     QuicPacketNumber packet_number,
     QuicPacketNumber peer_least_packet_awaiting_ack);
 
 }  // namespace net
 
 #endif  // NET_QUIC_CORE_FRAMES_QUIC_ACK_FRAME_H_