Fix include guards for QUIC files.

net/quic/core/interval_set.h

 // Copyright 2015 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.
 //
 // IntervalSet<T> is a data structure used to represent a sorted set of
 // non-empty, non-adjacent, and mutually disjoint intervals. Mutations to an
 // interval set preserve these properties, altering the set as needed. For
 // example, adding [2, 3) to a set containing only [1, 2) would result in the
 // set containing the single interval [1, 3).
 //
@@ skipping 31 matching lines @@
 //   intervals.Add(Interval<int>(15, 35));
 //   // intervals has been coalesced. It now contains the single range [10,40).
 //   EXPECT_EQ(1, intervals.Size());
 //   EXPECT_TRUE(intervals.Contains(Interval<int>(10, 40)));
 //
 //   intervals.Difference(Interval<int>(10, 20));
 //   // intervals should now contain the single range [20, 40).
 //   EXPECT_EQ(1, intervals.Size());
 //   EXPECT_TRUE(intervals.Contains(Interval<int>(20, 40)));
 
-#ifndef NET_QUIC_INTERVAL_SET_H_
-#define NET_QUIC_INTERVAL_SET_H_
+#ifndef NET_QUIC_CORE_INTERVAL_SET_H_
+#define NET_QUIC_CORE_INTERVAL_SET_H_
 
 #include <stddef.h>
 
 #include <algorithm>
 #include <ostream>
 #include <set>
 #include <string>
 #include <utility>
 #include <vector>
 
@@ skipping 784 matching lines @@
 // Find() and Compact() methods.
 template <typename T>
 inline bool IntervalSet<T>::IntervalComparator::operator()(
     const Interval<T>& a,
     const Interval<T>& b) const {
   return (a.min() < b.min() || (a.min() == b.min() && a.max() > b.max()));
 }
 
 }  // namespace net
 
-#endif  // NET_QUIC_INTERVAL_SET_H_
+#endif  // NET_QUIC_CORE_INTERVAL_SET_H_