content/media/TextTrackCueList.cpp@44a2da4a2ab2 (annotated)
content/media/TextTrackCueList.cpp
Fri, 16 Jan 2015 04:50:19 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Fri, 16 Jan 2015 04:50:19 +0100
- branch
- TOR_BUG_9701
- changeset 13
- 44a2da4a2ab2
- permissions
- -rw-r--r--
Replace accessor implementation with direct member state manipulation, by
request https://trac.torproject.org/projects/tor/ticket/9701#comment:32
| michael@0 | 1 | /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ |
| michael@0 | 2 | /* This Source Code Form is subject to the terms of the Mozilla Public |
| michael@0 | 3 | * License, v. 2.0. If a copy of the MPL was not distributed with this |
| michael@0 | 4 | * file, You can obtain one at http://mozilla.org/MPL/2.0/. */ |
| michael@0 | 5 | |
| michael@0 | 6 | #include "mozilla/dom/TextTrackCueList.h" |
| michael@0 | 7 | #include "mozilla/dom/TextTrackCueListBinding.h" |
| michael@0 | 8 | #include "mozilla/dom/TextTrackCue.h" |
| michael@0 | 9 | |
| michael@0 | 10 | namespace mozilla { |
| michael@0 | 11 | namespace dom { |
| michael@0 | 12 | |
| michael@0 | 13 | class CompareCuesByTime |
| michael@0 | 14 | { |
| michael@0 | 15 | public: |
| michael@0 | 16 | bool Equals(TextTrackCue* aOne, TextTrackCue* aTwo) const { |
| michael@0 | 17 | return aOne->StartTime() == aTwo->StartTime() && |
| michael@0 | 18 | aOne->EndTime() == aTwo->EndTime(); |
| michael@0 | 19 | } |
| michael@0 | 20 | bool LessThan(TextTrackCue* aOne, TextTrackCue* aTwo) const { |
| michael@0 | 21 | return aOne->StartTime() < aTwo->StartTime() || |
| michael@0 | 22 | (aOne->StartTime() == aTwo->StartTime() && |
| michael@0 | 23 | aOne->EndTime() < aTwo->EndTime()); |
| michael@0 | 24 | } |
| michael@0 | 25 | }; |
| michael@0 | 26 | |
| michael@0 | 27 | NS_IMPL_CYCLE_COLLECTION_WRAPPERCACHE_2(TextTrackCueList, mParent, mList) |
| michael@0 | 28 | |
| michael@0 | 29 | NS_IMPL_CYCLE_COLLECTING_ADDREF(TextTrackCueList) |
| michael@0 | 30 | NS_IMPL_CYCLE_COLLECTING_RELEASE(TextTrackCueList) |
| michael@0 | 31 | NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION(TextTrackCueList) |
| michael@0 | 32 | NS_WRAPPERCACHE_INTERFACE_MAP_ENTRY |
| michael@0 | 33 | NS_INTERFACE_MAP_ENTRY(nsISupports) |
| michael@0 | 34 | NS_INTERFACE_MAP_END |
| michael@0 | 35 | |
| michael@0 | 36 | TextTrackCueList::TextTrackCueList(nsISupports* aParent) : mParent(aParent) |
| michael@0 | 37 | { |
| michael@0 | 38 | SetIsDOMBinding(); |
| michael@0 | 39 | } |
| michael@0 | 40 | |
| michael@0 | 41 | JSObject* |
| michael@0 | 42 | TextTrackCueList::WrapObject(JSContext* aCx) |
| michael@0 | 43 | { |
| michael@0 | 44 | return TextTrackCueListBinding::Wrap(aCx, this); |
| michael@0 | 45 | } |
| michael@0 | 46 | |
| michael@0 | 47 | TextTrackCue* |
| michael@0 | 48 | TextTrackCueList::IndexedGetter(uint32_t aIndex, bool& aFound) |
| michael@0 | 49 | { |
| michael@0 | 50 | aFound = aIndex < mList.Length(); |
| michael@0 | 51 | return aFound ? mList[aIndex] : nullptr; |
| michael@0 | 52 | } |
| michael@0 | 53 | |
| michael@0 | 54 | TextTrackCue* |
| michael@0 | 55 | TextTrackCueList::operator[](uint32_t aIndex) |
| michael@0 | 56 | { |
| michael@0 | 57 | return mList.SafeElementAt(aIndex, nullptr); |
| michael@0 | 58 | } |
| michael@0 | 59 | |
| michael@0 | 60 | TextTrackCue* |
| michael@0 | 61 | TextTrackCueList::GetCueById(const nsAString& aId) |
| michael@0 | 62 | { |
| michael@0 | 63 | if (aId.IsEmpty()) { |
| michael@0 | 64 | return nullptr; |
| michael@0 | 65 | } |
| michael@0 | 66 | |
| michael@0 | 67 | for (uint32_t i = 0; i < mList.Length(); i++) { |
| michael@0 | 68 | if (aId.Equals(mList[i]->Id())) { |
| michael@0 | 69 | return mList[i]; |
| michael@0 | 70 | } |
| michael@0 | 71 | } |
| michael@0 | 72 | return nullptr; |
| michael@0 | 73 | } |
| michael@0 | 74 | |
| michael@0 | 75 | void |
| michael@0 | 76 | TextTrackCueList::AddCue(TextTrackCue& aCue) |
| michael@0 | 77 | { |
| michael@0 | 78 | if (mList.Contains(&aCue)) { |
| michael@0 | 79 | return; |
| michael@0 | 80 | } |
| michael@0 | 81 | mList.InsertElementSorted(&aCue, CompareCuesByTime()); |
| michael@0 | 82 | } |
| michael@0 | 83 | |
| michael@0 | 84 | void |
| michael@0 | 85 | TextTrackCueList::RemoveCue(TextTrackCue& aCue, ErrorResult& aRv) |
| michael@0 | 86 | { |
| michael@0 | 87 | if (!mList.Contains(&aCue)) { |
| michael@0 | 88 | aRv.Throw(NS_ERROR_DOM_NOT_FOUND_ERR); |
| michael@0 | 89 | return; |
| michael@0 | 90 | } |
| michael@0 | 91 | mList.RemoveElement(&aCue); |
| michael@0 | 92 | } |
| michael@0 | 93 | |
| michael@0 | 94 | void |
| michael@0 | 95 | TextTrackCueList::RemoveCueAt(uint32_t aIndex) |
| michael@0 | 96 | { |
| michael@0 | 97 | if (aIndex < mList.Length()) { |
| michael@0 | 98 | mList.RemoveElementAt(aIndex); |
| michael@0 | 99 | } |
| michael@0 | 100 | } |
| michael@0 | 101 | |
| michael@0 | 102 | void |
| michael@0 | 103 | TextTrackCueList::RemoveAll() |
| michael@0 | 104 | { |
| michael@0 | 105 | mList.Clear(); |
| michael@0 | 106 | } |
| michael@0 | 107 | |
| michael@0 | 108 | void |
| michael@0 | 109 | TextTrackCueList::GetArray(nsTArray<nsRefPtr<TextTrackCue> >& aCues) |
| michael@0 | 110 | { |
| michael@0 | 111 | aCues = nsTArray<nsRefPtr<TextTrackCue> >(mList); |
| michael@0 | 112 | } |
| michael@0 | 113 | |
| michael@0 | 114 | |
| michael@0 | 115 | } // namespace dom |
| michael@0 | 116 | } // namespace mozilla |
