Move shared files in net/quic/ into net/quic/core/

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 43 matching lines @@
 
 #include <stddef.h>
 
 #include <algorithm>
 #include <set>
 #include <string>
 #include <utility>
 #include <vector>
 
 #include "base/logging.h"
-#include "net/quic/interval.h"
+#include "net/quic/core/interval.h"
 
 namespace net {
 
 template <typename T>
 class IntervalSet {
  private:
   struct IntervalComparator {
     bool operator()(const Interval<T>& a, const Interval<T>& b) const;
   };
   typedef std::set<Interval<T>, IntervalComparator> Set;
@@ skipping 773 matching lines @@
 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_