Cap sourceBuffered() on duration and truncate duration on EoS

media/base/ranges.h

 // Copyright (c) 2012 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.
 
 #ifndef MEDIA_BASE_RANGES_H_
 #define MEDIA_BASE_RANGES_H_
 
 #include <algorithm>
 #include <ostream>
 #include <vector>
@@ skipping 21 matching lines @@
   size_t size() const;
 
   // Return the "i"'th range's start & end (0-based).
   T start(int i) const;
   T end(int i) const;
 
   // Clear all ranges.
   void clear();
 
   // Computes the intersection between this range and |other|.
-  Ranges<T> IntersectionWith(const Ranges<T>& other);
+  Ranges<T> IntersectionWith(const Ranges<T>& other) const;
 
  private:
   // Wrapper around DCHECK_LT allowing comparisons of operator<<'able T's.
   void DCheckLT(const T& lhs, const T& rhs) const;
 
   // Disjoint, in increasing order of start.
   std::vector<std::pair<T, T> > ranges_;
 };
 
 //////////////////////////////////////////////////////////////////////
@@ skipping 73 matching lines @@
 T Ranges<T>::end(int i) const {
   return ranges_[i].second;
 }
 
 template<class T>
 void Ranges<T>::clear() {
   ranges_.clear();
 }
 
 template<class T>
-Ranges<T> Ranges<T>::IntersectionWith(const Ranges<T>& other) {
+Ranges<T> Ranges<T>::IntersectionWith(const Ranges<T>& other) const {
   Ranges<T> result;
 
   size_t i = 0;
   size_t j = 0;
 
   while (i < size() && j < other.size()) {
     T max_start = std::max(start(i), other.start(j));
     T min_end = std::min(end(i), other.end(j));
 
     // Add an intersection range to the result if the ranges overlap.
     if (max_start < min_end)
       result.Add(max_start, min_end);
 
     if (end(i) < other.end(j))
       ++i;
     else
       ++j;
   }
 
   return result;
 }
 
 }  // namespace media
 
 #endif  // MEDIA_BASE_RANGES_H_