Better Windows Fix

quic/core/quic_interval_set.h

diff --git a/quic/core/quic_interval_set.h b/quic/core/quic_interval_set.h
index 98ee894..8d6884a 100644
--- a/quic/core/quic_interval_set.h
+++ b/quic/core/quic_interval_set.h
@@ -71,7 +71,9 @@
 
  private:
   struct QUIC_EXPORT_PRIVATE IntervalLess {
-    bool operator()(const value_type& a, const value_type& b) const;
+    bool operator()(const value_type& a, const value_type& b) const {
+      return a.min() < b.min() || (a.min() == b.min() && a.max() > b.max());
+    }
   };
   typedef std::set<value_type, IntervalLess> Set;
 
@@ -903,11 +905,11 @@
 // first by ascending min() and then by descending max(). The best way to
 // understand why this is so is to check out the comments associated with the
 // Find() and Compact() methods.
-template <typename T>
-bool QuicIntervalSet<T>::IntervalLess::operator()(const value_type& a,
-                                                  const value_type& b) const {
-  return a.min() < b.min() || (a.min() == b.min() && a.max() > b.max());
-}
+//template <typename T>
+//bool QuicIntervalSet<T>::IntervalLess::operator()(const value_type& a,
+//                                                  const value_type& b) const {
+//  return a.min() < b.min() || (a.min() == b.min() && a.max() > b.max());
+//}
 
 }  // namespace quic
 

quic/core/quic_stream_send_buffer.h

diff --git a/quic/core/quic_stream_send_buffer.h b/quic/core/quic_stream_send_buffer.h
index f3b799c..1bccd0f 100644
--- a/quic/core/quic_stream_send_buffer.h
+++ b/quic/core/quic_stream_send_buffer.h
@@ -50,8 +50,7 @@
   // Length of this pending retransmission.
   QuicByteCount length;
 
-  QUIC_EXPORT_PRIVATE bool operator==(
-      const StreamPendingRetransmission& other) const;
+  bool operator==(const StreamPendingRetransmission& other) const;
 };
 
 // QuicStreamSendBuffer contains a list of QuicStreamDataSlices. New data slices