mirror of
https://github.com/roytam1/palemoon27.git
synced 2026-05-26 14:30:27 +00:00
ee307d333c
- Bug 1235261 - Part 1: Rename nsAutoTArray to AutoTArray. r=froydnj (0662c2ac56)
- Bug 1235261 - Part 2: Switch some uses of AutoFallibleTArray to AutoTArray. r=froydnj (ab52085f2a)
- Bug 1235261 - Part 3: Switch remaining uses of AutoFallibleTArray to AutoTArray. r=froydnj (3763b16ddd)
- Bug 1235261 - Part 4: Remove AutoFallibleTArray. r=froydnj (5480b0d786)
- Bug 1235261 - Part 5: Merge nsAutoArrayBase into AutoTArray. r=froydnj (6c64e73e3b)
- Bug 1235261 - Part 7: Remove AutoInfallibleTArray. r=froydnj (acf266464e)
- Bug 1222624: Make xpath document() function use nsIPrincipals and nsIURIs rather than strings. r=peterv (5ee694d132)
- Bug 1235261 - Part 6: Rename AutoInfallibleTArray to AutoTArray. r=froydnj (d282f7df6c)
- Bug 1241394 - Hit testing with 3d transforms should use fuzzy when comparing depths. r=thinker (6c3f50670f)
- Bug 1241394 - Follow up to fix windows build bustage. (02ab2600af)
- Bug 1241394 - Check clip for the children of the establisher. r=mattwoodrow (46f151ea55)
- bug 1241453 - allow caching proxies in xpcAccessibleDocuments r=davidb (f5d41ad2ee)
- Bug 1247364 - use AllChildrenIterator::Seek by a11y tree walker, r=davidb (0ec230908e)
- Bug 1248840 - rename TreeWalker::NextChild, r=yzen (c89ecc5a29)
- Bug 1249927 - devirtualize CanHavaAnonymousChildren, r=davdib (89e8088e63)
- Bug 1206598 - Use universal reference to reduce the redundant copy. r=nfroyd (bae4ad6dd1)
- Bug 1247364 - add AllChildrenIterator::Seek, r=bz (215abebf12)
- bug 1241453 - allow storing proxies in xpcAccessibleGeneric::mIntl r=davidb (dd5e6c896b)
- bug 1241453 - allow constructing xpcAccessibles with proxies r=davidb (d0258122be)
- bug 1241453 - fixup xpcAccessible Intl() methods to not assume mIntl is always an Accessible r=davidb (168f71fdf5)
- bug 1241453 - allow xpcAccessibleDocument::mCache to use proxies as keys r=davidb (85b7eec81c)
- bug 1241453 - assert accessibles are only added to non remote xpcAccessibleDocuments r=davidb (7731b21d17)
- bug 1243077 - add ToXPC{,Document} overloads for proxied accessibles r=davidb (7bc085f1b5)
- bug 1243077 - add AccessibleOrProxy xpcAccessible::IntlGeneric() r=davidb (006a635992)
- Bug 1245464 - initialize with 0 mSupportedIfaces in xpcAccessibleGeneric in order to avoid corrupted result after bit-wise operation. r=surkov (ae41bafcef)
- bug 1241453 - allow caching xpc documents for remote documents r=davidb (a357630690)
- bug 1241453 - factor dispatching nsIAccessibleEvents out of HandleAccEvent() r=davidb (091073d981)
- Bug 1249183 - Suppress GC harder, r=terrence (2185ccb4dd)
- Bug 1248420 - Handle JSObject::getGroup OOM in js::ArraySetLength. r=jandem (04b67c8d31)
- Bug 1242270 - Add SPS pseudo frames for the Array.prototype methods; r=shu (f5e5871439)
- Bug 1247701 - Bail from ArrayShiftDenseKernel if the array is used by for-in iteration. r=jandem (41eff38954)
- Bug 1247701 followup - Change ArrayShiftDenseKernel to receive handle. r=bz (b29ce0c555)
203 lines
4.3 KiB
C++
203 lines
4.3 KiB
C++
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
|
|
/* 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/. */
|
|
|
|
#include "mozilla/dom/TimeRanges.h"
|
|
#include "mozilla/dom/TimeRangesBinding.h"
|
|
#include "mozilla/dom/HTMLMediaElement.h"
|
|
#include "nsError.h"
|
|
|
|
namespace mozilla {
|
|
namespace dom {
|
|
|
|
NS_IMPL_CYCLE_COLLECTION_WRAPPERCACHE(TimeRanges, mParent)
|
|
NS_IMPL_CYCLE_COLLECTING_ADDREF(TimeRanges)
|
|
NS_IMPL_CYCLE_COLLECTING_RELEASE(TimeRanges)
|
|
NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION(TimeRanges)
|
|
NS_WRAPPERCACHE_INTERFACE_MAP_ENTRY
|
|
NS_INTERFACE_MAP_ENTRY(nsIDOMTimeRanges)
|
|
NS_INTERFACE_MAP_ENTRY(nsISupports)
|
|
NS_INTERFACE_MAP_END
|
|
|
|
TimeRanges::TimeRanges()
|
|
: mParent(nullptr)
|
|
{
|
|
}
|
|
|
|
TimeRanges::TimeRanges(nsISupports* aParent)
|
|
: mParent(aParent)
|
|
{
|
|
}
|
|
|
|
TimeRanges::~TimeRanges()
|
|
{
|
|
}
|
|
|
|
NS_IMETHODIMP
|
|
TimeRanges::GetLength(uint32_t* aLength)
|
|
{
|
|
*aLength = Length();
|
|
return NS_OK;
|
|
}
|
|
|
|
double
|
|
TimeRanges::Start(uint32_t aIndex, ErrorResult& aRv)
|
|
{
|
|
if (aIndex >= mRanges.Length()) {
|
|
aRv = NS_ERROR_DOM_INDEX_SIZE_ERR;
|
|
return 0;
|
|
}
|
|
|
|
return mRanges[aIndex].mStart;
|
|
}
|
|
|
|
NS_IMETHODIMP
|
|
TimeRanges::Start(uint32_t aIndex, double* aTime)
|
|
{
|
|
ErrorResult rv;
|
|
*aTime = Start(aIndex, rv);
|
|
return rv.StealNSResult();
|
|
}
|
|
|
|
double
|
|
TimeRanges::End(uint32_t aIndex, ErrorResult& aRv)
|
|
{
|
|
if (aIndex >= mRanges.Length()) {
|
|
aRv = NS_ERROR_DOM_INDEX_SIZE_ERR;
|
|
return 0;
|
|
}
|
|
|
|
return mRanges[aIndex].mEnd;
|
|
}
|
|
|
|
NS_IMETHODIMP
|
|
TimeRanges::End(uint32_t aIndex, double* aTime)
|
|
{
|
|
ErrorResult rv;
|
|
*aTime = End(aIndex, rv);
|
|
return rv.StealNSResult();
|
|
}
|
|
|
|
void
|
|
TimeRanges::Add(double aStart, double aEnd)
|
|
{
|
|
if (aStart > aEnd) {
|
|
NS_WARNING("Can't add a range if the end is older that the start.");
|
|
return;
|
|
}
|
|
mRanges.AppendElement(TimeRange(aStart,aEnd));
|
|
}
|
|
|
|
double
|
|
TimeRanges::GetStartTime()
|
|
{
|
|
if (mRanges.IsEmpty()) {
|
|
return -1.0;
|
|
}
|
|
return mRanges[0].mStart;
|
|
}
|
|
|
|
double
|
|
TimeRanges::GetEndTime()
|
|
{
|
|
if (mRanges.IsEmpty()) {
|
|
return -1.0;
|
|
}
|
|
return mRanges[mRanges.Length() - 1].mEnd;
|
|
}
|
|
|
|
void
|
|
TimeRanges::Normalize(double aTolerance)
|
|
{
|
|
if (mRanges.Length() >= 2) {
|
|
AutoTArray<TimeRange,4> normalized;
|
|
|
|
mRanges.Sort(CompareTimeRanges());
|
|
|
|
// This merges the intervals.
|
|
TimeRange current(mRanges[0]);
|
|
for (uint32_t i = 1; i < mRanges.Length(); i++) {
|
|
if (current.mStart <= mRanges[i].mStart &&
|
|
current.mEnd >= mRanges[i].mEnd) {
|
|
continue;
|
|
}
|
|
if (current.mEnd + aTolerance >= mRanges[i].mStart) {
|
|
current.mEnd = mRanges[i].mEnd;
|
|
} else {
|
|
normalized.AppendElement(current);
|
|
current = mRanges[i];
|
|
}
|
|
}
|
|
|
|
normalized.AppendElement(current);
|
|
|
|
mRanges = normalized;
|
|
}
|
|
}
|
|
|
|
void
|
|
TimeRanges::Union(const TimeRanges* aOtherRanges, double aTolerance)
|
|
{
|
|
mRanges.AppendElements(aOtherRanges->mRanges);
|
|
Normalize(aTolerance);
|
|
}
|
|
|
|
void
|
|
TimeRanges::Intersection(const TimeRanges* aOtherRanges)
|
|
{
|
|
AutoTArray<TimeRange,4> intersection;
|
|
|
|
const nsTArray<TimeRange>& otherRanges = aOtherRanges->mRanges;
|
|
for (index_type i = 0, j = 0; i < mRanges.Length() && j < otherRanges.Length();) {
|
|
double start = std::max(mRanges[i].mStart, otherRanges[j].mStart);
|
|
double end = std::min(mRanges[i].mEnd, otherRanges[j].mEnd);
|
|
if (start < end) {
|
|
intersection.AppendElement(TimeRange(start, end));
|
|
}
|
|
if (mRanges[i].mEnd < otherRanges[j].mEnd) {
|
|
i += 1;
|
|
} else {
|
|
j += 1;
|
|
}
|
|
}
|
|
|
|
mRanges = intersection;
|
|
}
|
|
|
|
TimeRanges::index_type
|
|
TimeRanges::Find(double aTime, double aTolerance /* = 0 */)
|
|
{
|
|
for (index_type i = 0; i < mRanges.Length(); ++i) {
|
|
if (aTime < mRanges[i].mEnd && (aTime + aTolerance) >= mRanges[i].mStart) {
|
|
return i;
|
|
}
|
|
}
|
|
return NoIndex;
|
|
}
|
|
|
|
JSObject*
|
|
TimeRanges::WrapObject(JSContext* aCx, JS::Handle<JSObject*> aGivenProto)
|
|
{
|
|
return TimeRangesBinding::Wrap(aCx, this, aGivenProto);
|
|
}
|
|
|
|
nsISupports*
|
|
TimeRanges::GetParentObject() const
|
|
{
|
|
return mParent;
|
|
}
|
|
|
|
void
|
|
TimeRanges::Shift(double aOffset)
|
|
{
|
|
for (index_type i = 0; i < mRanges.Length(); ++i) {
|
|
mRanges[i].mStart += aOffset;
|
|
mRanges[i].mEnd += aOffset;
|
|
}
|
|
}
|
|
|
|
} // namespace dom
|
|
} // namespace mozilla
|