Revert 171096

net/quic/congestion_control/quic_send_scheduler.cc

 // Copyright (c) 2012 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/congestion_control/quic_send_scheduler.h"
 
 #include <algorithm>
 #include <cmath>
 #include <map>
@@ skipping 79 matching lines @@
   QuicTime last_timestamp(QuicTime::FromMicroseconds(0));
   map<QuicPacketSequenceNumber, size_t> acked_packets;
 
   PendingPacketsMap::iterator it, it_upper;
   it = pending_packets_.begin();
   it_upper = pending_packets_.upper_bound(
       ack_frame.received_info.largest_received);
 
   while (it != it_upper) {
     QuicPacketSequenceNumber sequence_number = it->first;
-    if (ack_frame.received_info.ContainsAck(sequence_number)) {
+    if (ack_frame.received_info.missing_packets.find(sequence_number) ==
+        ack_frame.received_info.missing_packets.end()) {
       // Not missing, hence implicitly acked.
       scoped_ptr<PendingPacket> pending_packet_cleaner(it->second);
       acked_packets[sequence_number] = pending_packet_cleaner->BytesSent();
       last_timestamp = pending_packet_cleaner->SendTimestamp();
       pending_packets_.erase(it++);  // Must be incremented post to work.
     } else {
       ++it;
     }
   }
   // We calculate the RTT based on the highest ACKed sequence number, the lower
@@ skipping 66 matching lines @@
 
 int QuicSendScheduler::PeakSustainedBandwidth() {
   // To make sure that we get the latest estimate we call SentBandwidth.
   if (HasSentPacket()) {
     SentBandwidth();
   }
   return max_estimated_bandwidth_;
 }
 
 }  // namespace net