Make the SentPacketManager remove pending retransmissions for reset

net/base/linked_hash_map.h

 // Copyright (c) 2013 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.
 //
 // This is a simplistic insertion-ordered map.  It behaves similarly to an STL
 // map, but only implements a small subset of the map's methods.  Internally, we
 // just keep a map and a list going in parallel.
 //
 // This class provides no thread safety guarantees, beyond what you would
 // normally see with std::list.
@@ skipping 106 matching lines @@
   size_type erase(const Key& key) {
     typename MapType::iterator found = map_.find(key);
     if (found == map_.end()) return 0;
 
     list_.erase(found->second);
     map_.erase(found);
 
     return 1;
   }
 
-  // Erases values with the provided iterator. If the provided iterator is
-  // invalid or there is inconsistency between the map and list, a CHECK() error
-  // will occur.
-  void erase(iterator position) {
+  // Erases the item that 'position' points to. Returns an iterator that points
+  // to the item that comes immediately after the deleted item in the list, or
+  // end().
+  // If the provided iterator is invalid or there is inconsistency between the
+  // map and list, a CHECK() error will occur.
+  iterator erase(iterator position) {
     typename MapType::iterator found = map_.find(position->first);
     CHECK(found->second == position)
         << "Inconsisent iterator for map and list, or the iterator is invalid.";
 
-    list_.erase(position);
     map_.erase(found);
+    return list_.erase(position);
   }
 
-  // Erases values between first and last, not including last.
-  void erase(iterator first, iterator last) {
+  // Erases all the items in the range [first, last).  Returns an iterator that
+  // points to the item that comes immediately after the last deleted item in
+  // the list, or end().
+  iterator erase(iterator first, iterator last) {
     while (first != last && first != end()) {
-      erase(first++);
+      first = erase(first);
     }
+    return first;
   }
 
   // Finds the element with the given key.  Returns an iterator to the
   // value found, or to end() if the value was not found.  Like a map, this
   // iterator points to a pair<Key, Value>.
   iterator find(const Key& key) {
     typename MapType::iterator found = map_.find(key);
     if (found == map_.end()) {
       return end();
     }
@@ skipping 69 matching lines @@
 
  private:
   // The map component, used for speedy lookups
   MapType map_;
 
   // The list component, used for maintaining insertion order
   ListType list_;
 };
 
 #endif  // UTIL_GTL_LINKED_HASH_MAP_H_