#include "config.h"
#include "TimeRanges.h"
#include "ExceptionCode.h"
#include "ExceptionCodePlaceholder.h"
#include <math.h>
using namespace WebCore;
using namespace std;
TimeRanges::TimeRanges(double start, double end)
{
add(start, end);
}
PassRefPtr<TimeRanges> TimeRanges::copy() const
{
RefPtr<TimeRanges> newSession = TimeRanges::create();
unsigned size = m_ranges.size();
for (unsigned i = 0; i < size; i++)
newSession->add(m_ranges[i].m_start, m_ranges[i].m_end);
return newSession.release();
}
void TimeRanges::invert()
{
RefPtr<TimeRanges> inverted = TimeRanges::create();
double posInf = std::numeric_limits<double>::infinity();
double negInf = -std::numeric_limits<double>::infinity();
if (!m_ranges.size())
inverted->add(negInf, posInf);
else {
if (double start = m_ranges.first().m_start != negInf)
inverted->add(negInf, start);
for (size_t index = 0; index + 1 < m_ranges.size(); ++index)
inverted->add(m_ranges[index].m_end, m_ranges[index + 1].m_start);
if (double end = m_ranges.last().m_end != posInf)
inverted->add(end, posInf);
}
m_ranges.swap(inverted->m_ranges);
}
void TimeRanges::intersectWith(const TimeRanges* other)
{
ASSERT(other);
RefPtr<TimeRanges> inverted = copy();
RefPtr<TimeRanges> invertedOther = other->copy();
inverted->unionWith(invertedOther.get());
inverted->invert();
m_ranges.swap(inverted->m_ranges);
}
void TimeRanges::unionWith(const TimeRanges* other)
{
ASSERT(other);
RefPtr<TimeRanges> unioned = copy();
for (size_t index = 0; index < other->m_ranges.size(); ++index) {
const Range& range = other->m_ranges[index];
unioned->add(range.m_start, range.m_end);
}
m_ranges.swap(unioned->m_ranges);
}
double TimeRanges::start(unsigned index, ExceptionCode& ec) const
{
if (index >= length()) {
ec = INDEX_SIZE_ERR;
return 0;
}
return m_ranges[index].m_start;
}
double TimeRanges::end(unsigned index, ExceptionCode& ec) const
{
if (index >= length()) {
ec = INDEX_SIZE_ERR;
return 0;
}
return m_ranges[index].m_end;
}
void TimeRanges::add(double start, double end)
{
ASSERT(start <= end);
unsigned int overlappingArcIndex;
Range addedRange(start, end);
for (overlappingArcIndex = 0; overlappingArcIndex < m_ranges.size(); overlappingArcIndex++) {
if (addedRange.isOverlappingRange(m_ranges[overlappingArcIndex])
|| addedRange.isContiguousWithRange(m_ranges[overlappingArcIndex])) {
addedRange = addedRange.unionWithOverlappingOrContiguousRange(m_ranges[overlappingArcIndex]);
m_ranges.remove(overlappingArcIndex);
overlappingArcIndex--;
} else {
if (!overlappingArcIndex) {
if (addedRange.isBeforeRange(m_ranges[0])) {
break;
}
} else {
if (m_ranges[overlappingArcIndex - 1].isBeforeRange(addedRange)
&& addedRange.isBeforeRange(m_ranges[overlappingArcIndex])) {
break;
}
}
}
}
m_ranges.insert(overlappingArcIndex, addedRange);
}
bool TimeRanges::contain(double time) const
{
for (unsigned n = 0; n < length(); n++) {
if (time >= start(n, IGNORE_EXCEPTION) && time <= end(n, IGNORE_EXCEPTION))
return true;
}
return false;
}
double TimeRanges::nearest(double time) const
{
double closestDelta = std::numeric_limits<double>::infinity();
double closestTime = 0;
unsigned count = length();
for (unsigned ndx = 0; ndx < count; ndx++) {
double startTime = start(ndx, IGNORE_EXCEPTION);
double endTime = end(ndx, IGNORE_EXCEPTION);
if (time >= startTime && time <= endTime)
return time;
if (fabs(startTime - time) < closestDelta) {
closestTime = startTime;
closestDelta = fabsf(startTime - time);
}
if (fabs(endTime - time) < closestDelta) {
closestTime = endTime;
closestDelta = fabsf(endTime - time);
}
}
return closestTime;
}
double TimeRanges::totalDuration() const
{
double total = 0;
for (unsigned n = 0; n < length(); n++)
total += fabs(end(n, IGNORE_EXCEPTION) - start(n, IGNORE_EXCEPTION));
return total;
}