The Remove functions in quic_ack_frame.cc are renamed RemoveTestOnly.

net/quic/core/frames/quic_ack_frame.cc

 // 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.
 
 #include "net/quic/core/frames/quic_ack_frame.h"
 
 #include "net/quic/core/quic_constants.h"
 #include "net/quic/platform/api/quic_bug_tracker.h"
 
 namespace net {
@@ skipping 36 matching lines @@
     default;
 
 void PacketNumberQueue::Add(QuicPacketNumber packet_number) {
   packet_number_intervals_.Add(packet_number, packet_number + 1);
 }
 
 void PacketNumberQueue::Add(QuicPacketNumber lower, QuicPacketNumber higher) {
   packet_number_intervals_.Add(lower, higher);
 }
 
-void PacketNumberQueue::Remove(QuicPacketNumber packet_number) {
+void PacketNumberQueue::RemoveTestOnly(QuicPacketNumber packet_number) {
   packet_number_intervals_.Difference(packet_number, packet_number + 1);
 }
 
-void PacketNumberQueue::Remove(QuicPacketNumber lower,
-                               QuicPacketNumber higher) {
+void PacketNumberQueue::RemoveTestOnly(QuicPacketNumber lower,
+                                       QuicPacketNumber higher) {
   packet_number_intervals_.Difference(lower, higher);
 }
 
 bool PacketNumberQueue::RemoveUpTo(QuicPacketNumber higher) {
   if (Empty()) {
     return false;
   }
   const QuicPacketNumber old_min = Min();
   packet_number_intervals_.Difference(0, higher);
   return Empty() || old_min != Min();
@@ skipping 62 matching lines @@
   for (const Interval<QuicPacketNumber>& interval : q) {
     for (QuicPacketNumber packet_number = interval.min();
          packet_number < interval.max(); ++packet_number) {
       os << packet_number << " ";
     }
   }
   return os;
 }
 
 }  // namespace net