Add a time based loss detection algorithm to QUIC that loses packets

net/quic/congestion_control/tcp_loss_algorithm_test.cc

 // Copyright 2014 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/tcp_loss_algorithm.h"
 
 #include <algorithm>
 
 #include "base/logging.h"
 #include "base/stl_util.h"
@@ skipping 15 matching lines @@
                             NULL, 0, new RetransmittableFrames());
     unacked_packets_.AddPacket(packet);
     unacked_packets_.SetPending(sequence_number, QuicTime::Zero(), 1000);
   }
 
   void VerifyLosses(QuicPacketSequenceNumber largest_observed,
                     QuicPacketSequenceNumber* losses_expected,
                     size_t num_losses) {
     SequenceNumberSet lost_packets =
         loss_algorithm_.DetectLostPackets(
-            unacked_packets_, QuicTime::Zero(), largest_observed, srtt_);
+            unacked_packets_, QuicTime::Zero(), largest_observed, srtt_, srtt_);
     EXPECT_EQ(num_losses, lost_packets.size());
     for (size_t i = 0; i < num_losses; ++i) {
       EXPECT_TRUE(ContainsKey(lost_packets, losses_expected[i]));
     }
   }
 
   QuicUnackedPacketMap unacked_packets_;
   TCPLossAlgorithm loss_algorithm_;
   QuicTime::Delta srtt_;
 };
@@ skipping 91 matching lines @@
   // Early retransmit when the final packet gets acked and the first is nacked.
   unacked_packets_.SetNotPending(2);
   unacked_packets_.NackPacket(1, 1);
   unacked_packets_.NeuterPacket(1);
   VerifyLosses(2, NULL, 0);
 }
 
 }  // namespace
 }  // namespace test
 }  // namespace net