# Source: ranges.js

    /**
     * ranges
     *
     * Utilities for working with TimeRanges.
     *
     */

    import videojs from 'video.js';

    // Fudge factor to account for TimeRanges rounding
    const TIME_FUDGE_FACTOR = 1 / 30;

    /**
     * Clamps a value to within a range
     * @param {Number} num - the value to clamp
     * @param {Number} start - the start of the range to clamp within, inclusive
     * @param {Number} end - the end of the range to clamp within, inclusive
     * @return {Number}
     */
    const clamp = function(num, [start, end]) {
      return Math.min(Math.max(start, num), end);
    };
    const filterRanges = function(timeRanges, predicate) {
      let results = [];
      let i;

      if (timeRanges && timeRanges.length) {
        // Search for ranges that match the predicate
        for (i = 0; i < timeRanges.length; i++) {
          if (predicate(timeRanges.start(i), timeRanges.end(i))) {
            results.push([timeRanges.start(i), timeRanges.end(i)]);
          }
        }
      }

      return videojs.createTimeRanges(results);
    };

    /**
     * Attempts to find the buffered TimeRange that contains the specified
     * time.
     * @param {TimeRanges} buffered - the TimeRanges object to query
     * @param {number} time  - the time to filter on.
     * @returns {TimeRanges} a new TimeRanges object
     */
    const findRange = function(buffered, time) {
      return filterRanges(buffered, function(start, end) {
        return start - TIME_FUDGE_FACTOR <= time &&
          end + TIME_FUDGE_FACTOR >= time;
      });
    };

    /**
     * Returns the TimeRanges that begin later than the specified time.
     * @param {TimeRanges} timeRanges - the TimeRanges object to query
     * @param {number} time - the time to filter on.
     * @returns {TimeRanges} a new TimeRanges object.
     */
    const findNextRange = function(timeRanges, time) {
      return filterRanges(timeRanges, function(start) {
        return start - TIME_FUDGE_FACTOR >= time;
      });
    };

    /**
     * Returns gaps within a list of TimeRanges
     * @param {TimeRanges} buffered - the TimeRanges object
     * @return {TimeRanges} a TimeRanges object of gaps
     */
    const findGaps = function(buffered) {
      if (buffered.length < 2) {
        return videojs.createTimeRanges();
      }

      let ranges = [];

      for (let i = 1; i < buffered.length; i++) {
        let start = buffered.end(i - 1);
        let end = buffered.start(i);

        ranges.push([start, end]);
      }

      return videojs.createTimeRanges(ranges);
    };

    /**
     * Search for a likely end time for the segment that was just appened
     * based on the state of the `buffered` property before and after the
     * append. If we fin only one such uncommon end-point return it.
     * @param {TimeRanges} original - the buffered time ranges before the update
     * @param {TimeRanges} update - the buffered time ranges after the update
     * @returns {Number|null} the end time added between `original` and `update`,
     * or null if one cannot be unambiguously determined.
     */
    const findSoleUncommonTimeRangesEnd = function(original, update) {
      let i;
      let start;
      let end;
      let result = [];
      let edges = [];

      // In order to qualify as a possible candidate, the end point must:
      //  1) Not have already existed in the `original` ranges
      //  2) Not result from the shrinking of a range that already existed
      //     in the `original` ranges
      //  3) Not be contained inside of a range that existed in `original`
      const overlapsCurrentEnd = function(span) {
        return (span[0] <= end && span[1] >= end);
      };

      if (original) {
        // Save all the edges in the `original` TimeRanges object
        for (i = 0; i < original.length; i++) {
          start = original.start(i);
          end = original.end(i);

          edges.push([start, end]);
        }
      }

      if (update) {
        // Save any end-points in `update` that are not in the `original`
        // TimeRanges object
        for (i = 0; i < update.length; i++) {
          start = update.start(i);
          end = update.end(i);

          if (edges.some(overlapsCurrentEnd)) {
            continue;
          }

          // at this point it must be a unique non-shrinking end edge
          result.push(end);
        }
      }

      // we err on the side of caution and return null if didn't find
      // exactly *one* differing end edge in the search above
      if (result.length !== 1) {
        return null;
      }

      return result[0];
    };

    /**
     * Calculate the intersection of two TimeRanges
     * @param {TimeRanges} bufferA
     * @param {TimeRanges} bufferB
     * @returns {TimeRanges} The interesection of `bufferA` with `bufferB`
     */
    const bufferIntersection = function(bufferA, bufferB) {
      let start = null;
      let end = null;
      let arity = 0;
      let extents = [];
      let ranges = [];

      if (!bufferA || !bufferA.length || !bufferB || !bufferB.length) {
        return videojs.createTimeRange();
      }

      // Handle the case where we have both buffers and create an
      // intersection of the two
      let count = bufferA.length;

      // A) Gather up all start and end times
      while (count--) {
        extents.push({time: bufferA.start(count), type: 'start'});
        extents.push({time: bufferA.end(count), type: 'end'});
      }
      count = bufferB.length;
      while (count--) {
        extents.push({time: bufferB.start(count), type: 'start'});
        extents.push({time: bufferB.end(count), type: 'end'});
      }
      // B) Sort them by time
      extents.sort(function(a, b) {
        return a.time - b.time;
      });

      // C) Go along one by one incrementing arity for start and decrementing
      //    arity for ends
      for (count = 0; count < extents.length; count++) {
        if (extents[count].type === 'start') {
          arity++;

          // D) If arity is ever incremented to 2 we are entering an
          //    overlapping range
          if (arity === 2) {
            start = extents[count].time;
          }
        } else if (extents[count].type === 'end') {
          arity--;

          // E) If arity is ever decremented to 1 we leaving an
          //    overlapping range
          if (arity === 1) {
            end = extents[count].time;
          }
        }

        // F) Record overlapping ranges
        if (start !== null && end !== null) {
          ranges.push([start, end]);
          start = null;
          end = null;
        }
      }

      return videojs.createTimeRanges(ranges);
    };

    /**
     * Calculates the percentage of `segmentRange` that overlaps the
     * `buffered` time ranges.
     * @param {TimeRanges} segmentRange - the time range that the segment
     * covers adjusted according to currentTime
     * @param {TimeRanges} referenceRange - the original time range that the
     * segment covers
     * @param {Number} currentTime - time in seconds where the current playback
     * is at
     * @param {TimeRanges} buffered - the currently buffered time ranges
     * @returns {Number} percent of the segment currently buffered
     */
    const calculateBufferedPercent = function(adjustedRange,
                                              referenceRange,
                                              currentTime,
                                              buffered) {
      let referenceDuration = referenceRange.end(0) - referenceRange.start(0);
      let adjustedDuration = adjustedRange.end(0) - adjustedRange.start(0);
      let bufferMissingFromAdjusted = referenceDuration - adjustedDuration;
      let adjustedIntersection = bufferIntersection(adjustedRange, buffered);
      let referenceIntersection = bufferIntersection(referenceRange, buffered);
      let adjustedOverlap = 0;
      let referenceOverlap = 0;

      let count = adjustedIntersection.length;

      while (count--) {
        adjustedOverlap += adjustedIntersection.end(count) -
                           adjustedIntersection.start(count);

        // If the current overlap segment starts at currentTime, then increase the
        // overlap duration so that it actually starts at the beginning of referenceRange
        // by including the difference between the two Range's durations
        // This is a work around for the way Flash has no buffer before currentTime
        if (adjustedIntersection.start(count) === currentTime) {
          adjustedOverlap += bufferMissingFromAdjusted;
        }
      }

      count = referenceIntersection.length;

      while (count--) {
        referenceOverlap += referenceIntersection.end(count) -
                            referenceIntersection.start(count);
      }

      // Use whichever value is larger for the percentage-buffered since that value
      // is likely more accurate because the only way
      return Math.max(adjustedOverlap, referenceOverlap) / referenceDuration * 100;
    };

    /**
     * Return the amount of a range specified by the startOfSegment and segmentDuration
     * overlaps the current buffered content.
     *
     * @param {Number} startOfSegment - the time where the segment begins
     * @param {Number} segmentDuration - the duration of the segment in seconds
     * @param {Number} currentTime - time in seconds where the current playback
     * is at
     * @param {TimeRanges} buffered - the state of the buffer
     * @returns {Number} percentage of the segment's time range that is
     * already in `buffered`
     */
    const getSegmentBufferedPercent = function(startOfSegment,
                                               segmentDuration,
                                               currentTime,
                                               buffered) {
      let endOfSegment = startOfSegment + segmentDuration;

      // The entire time range of the segment
      let originalSegmentRange = videojs.createTimeRanges([[
        startOfSegment,
        endOfSegment
      ]]);

      // The adjusted segment time range that is setup such that it starts
      // no earlier than currentTime
      // Flash has no notion of a back-buffer so adjustedSegmentRange adjusts
      // for that and the function will still return 100% if a only half of a
      // segment is actually in the buffer as long as the currentTime is also
      // half-way through the segment
      let adjustedSegmentRange = videojs.createTimeRanges([[
        clamp(startOfSegment, [currentTime, endOfSegment]),
        endOfSegment
      ]]);

      // This condition happens when the currentTime is beyond the segment's
      // end time
      if (adjustedSegmentRange.start(0) === adjustedSegmentRange.end(0)) {
        return 0;
      }

      let percent = calculateBufferedPercent(adjustedSegmentRange,
                                             originalSegmentRange,
                                             currentTime,
                                             buffered);

      // If the segment is reported as having a zero duration, return 0%
      // since it is likely that we will need to fetch the segment
      if (isNaN(percent) || percent === Infinity || percent === -Infinity) {
        return 0;
      }

      return percent;
    };

    export default {
      findRange,
      findNextRange,
      findGaps,
      findSoleUncommonTimeRangesEnd,
      getSegmentBufferedPercent,
      TIME_FUDGE_FACTOR
    };