2001-10-25 01:08:40 +00:00
|
|
|
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
|
|
// vim:cindent:ts=8:et:sw=4:
|
2012-05-21 11:12:37 +00:00
|
|
|
/* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
|
2001-10-25 01:08:40 +00:00
|
|
|
|
2006-03-29 18:29:03 +00:00
|
|
|
/* a set of ranges on a number-line */
|
|
|
|
|
2001-10-25 01:08:40 +00:00
|
|
|
#include "nsIntervalSet.h"
|
2013-07-12 00:16:41 +00:00
|
|
|
#include <new>
|
2013-01-15 12:22:03 +00:00
|
|
|
#include <algorithm>
|
2001-10-25 01:08:40 +00:00
|
|
|
|
|
|
|
nsIntervalSet::nsIntervalSet(IntervalSetAlloc aAlloc, IntervalSetFree aFree,
|
|
|
|
void* aAllocatorClosure)
|
2012-07-30 14:20:58 +00:00
|
|
|
: mList(nullptr),
|
2001-10-25 01:08:40 +00:00
|
|
|
mAlloc(aAlloc),
|
|
|
|
mFree(aFree),
|
|
|
|
mAllocatorClosure(aAllocatorClosure)
|
|
|
|
{
|
|
|
|
NS_ASSERTION(mAlloc && mFree, "null callback params");
|
|
|
|
}
|
|
|
|
|
|
|
|
nsIntervalSet::~nsIntervalSet()
|
|
|
|
{
|
|
|
|
Interval *current = mList;
|
|
|
|
while (current) {
|
|
|
|
Interval *trash = current;
|
|
|
|
current = current->mNext;
|
|
|
|
FreeInterval(trash);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsIntervalSet::FreeInterval(nsIntervalSet::Interval *aInterval)
|
|
|
|
{
|
|
|
|
NS_ASSERTION(aInterval, "null interval");
|
|
|
|
|
|
|
|
aInterval->Interval::~Interval();
|
|
|
|
(*mFree)(sizeof(Interval), aInterval, mAllocatorClosure);
|
|
|
|
}
|
|
|
|
|
|
|
|
void nsIntervalSet::IncludeInterval(coord_type aBegin, coord_type aEnd)
|
|
|
|
{
|
2007-07-08 07:08:04 +00:00
|
|
|
Interval *newInterval = static_cast<Interval*>
|
|
|
|
((*mAlloc)(sizeof(Interval), mAllocatorClosure));
|
2001-10-25 01:08:40 +00:00
|
|
|
if (!newInterval) {
|
|
|
|
NS_NOTREACHED("allocation failure");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
new(newInterval) Interval(aBegin, aEnd);
|
|
|
|
|
|
|
|
Interval **current = &mList;
|
|
|
|
while (*current && (*current)->mEnd < aBegin)
|
|
|
|
current = &(*current)->mNext;
|
|
|
|
|
|
|
|
newInterval->mNext = *current;
|
|
|
|
*current = newInterval;
|
|
|
|
|
|
|
|
Interval *subsumed = newInterval->mNext;
|
|
|
|
while (subsumed && subsumed->mBegin <= aEnd) {
|
2013-01-15 12:22:03 +00:00
|
|
|
newInterval->mBegin = std::min(newInterval->mBegin, subsumed->mBegin);
|
|
|
|
newInterval->mEnd = std::max(newInterval->mEnd, subsumed->mEnd);
|
2001-10-25 01:08:40 +00:00
|
|
|
newInterval->mNext = subsumed->mNext;
|
|
|
|
FreeInterval(subsumed);
|
|
|
|
subsumed = newInterval->mNext;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-09-29 06:19:26 +00:00
|
|
|
bool nsIntervalSet::Intersects(coord_type aBegin, coord_type aEnd) const
|
2001-10-25 01:08:40 +00:00
|
|
|
{
|
|
|
|
Interval *current = mList;
|
|
|
|
while (current && current->mBegin <= aEnd) {
|
|
|
|
if (current->mEnd >= aBegin)
|
2011-10-17 14:59:28 +00:00
|
|
|
return true;
|
2001-10-25 01:08:40 +00:00
|
|
|
current = current->mNext;
|
|
|
|
}
|
2011-10-17 14:59:28 +00:00
|
|
|
return false;
|
2001-10-25 01:08:40 +00:00
|
|
|
}
|
|
|
|
|
2011-09-29 06:19:26 +00:00
|
|
|
bool nsIntervalSet::Contains(coord_type aBegin, coord_type aEnd) const
|
2001-10-25 01:08:40 +00:00
|
|
|
{
|
|
|
|
Interval *current = mList;
|
|
|
|
while (current && current->mBegin <= aBegin) {
|
|
|
|
if (current->mEnd >= aEnd)
|
2011-10-17 14:59:28 +00:00
|
|
|
return true;
|
2001-10-25 01:08:40 +00:00
|
|
|
current = current->mNext;
|
|
|
|
}
|
2011-10-17 14:59:28 +00:00
|
|
|
return false;
|
2001-10-25 01:08:40 +00:00
|
|
|
}
|