Migrate WTF::Vector::append() to ::push_back() [part 7 of N]

third_party/WebKit/Source/core/html/track/CueTimeline.cpp

 // Copyright 2015 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "core/html/track/CueTimeline.h"
 
 #include "core/events/Event.h"
 #include "core/html/HTMLMediaElement.h"
 #include "core/html/HTMLTrackElement.h"
 #include "core/html/track/LoadableTextTrack.h"
@@ skipping 153 matching lines @@
   // end times are less than or equal to the current playback position.
   // Otherwise, let missed cues be an empty list.
   if (lastTime >= 0 && lastSeekTime < movieTime) {
     CueList potentiallySkippedCues =
         m_cueTree.allOverlaps(m_cueTree.createInterval(lastTime, movieTime));
 
     for (CueInterval cue : potentiallySkippedCues) {
       // Consider cues that may have been missed since the last seek time.
       if (cue.low() > std::max(lastSeekTime, lastTime) &&
           cue.high() < movieTime)
-        missedCues.append(cue);
+        missedCues.push_back(cue);
     }
   }
 
   m_lastUpdateTime = movieTime;
 
   // 5 - If the time was reached through the usual monotonic increase of the
   // current playback position during normal playback, and if the user agent
   // has not fired a timeupdate event at the element in the past 15 to 250ms
   // and is not still running event handlers for such an event, then the user
   // agent must queue a task to fire a simple event named timeupdate at the
@@ skipping 53 matching lines @@
   // list will be associated with a text track, a text track cue, and a time,
   // which are used to sort the list before the tasks are queued.
   HeapVector<std::pair<double, Member<TextTrackCue>>> eventTasks;
 
   // 8 - Let affected tracks be a list of text tracks, initially empty.
   HeapVector<Member<TextTrack>> affectedTracks;
 
   for (const auto& missedCue : missedCues) {
     // 9 - For each text track cue in missed cues, prepare an event named enter
     // for the TextTrackCue object with the text track cue start time.
-    eventTasks.append(
+    eventTasks.push_back(
         std::make_pair(missedCue.data()->startTime(), missedCue.data()));
 
     // 10 - For each text track [...] in missed cues, prepare an event
     // named exit for the TextTrackCue object with the  with the later of
     // the text track cue end time and the text track cue start time.
 
     // Note: An explicit task is added only if the cue is NOT a zero or
     // negative length cue. Otherwise, the need for an exit event is
     // checked when these tasks are actually queued below. This doesn't
     // affect sorting events before dispatch either, because the exit
     // event has the same time as the enter event.
     if (missedCue.data()->startTime() < missedCue.data()->endTime()) {
-      eventTasks.append(
+      eventTasks.push_back(
           std::make_pair(missedCue.data()->endTime(), missedCue.data()));
     }
   }
 
   for (const auto& previousCue : previousCues) {
     // 10 - For each text track cue in other cues that has its text
     // track cue active flag set prepare an event named exit for the
     // TextTrackCue object with the text track cue end time.
     if (!currentCues.contains(previousCue)) {
-      eventTasks.append(
+      eventTasks.push_back(
           std::make_pair(previousCue.data()->endTime(), previousCue.data()));
     }
   }
 
   for (const auto& currentCue : currentCues) {
     // 11 - For each text track cue in current cues that does not have its
     // text track cue active flag set, prepare an event named enter for the
     // TextTrackCue object with the text track cue start time.
     if (!previousCues.contains(currentCue)) {
-      eventTasks.append(
+      eventTasks.push_back(
           std::make_pair(currentCue.data()->startTime(), currentCue.data()));
     }
   }
 
   // 12 - Sort the tasks in events in ascending time order (tasks with earlier
   // times first).
   nonCopyingSort(eventTasks.begin(), eventTasks.end(), eventTimeCueCompare);
 
   for (const auto& task : eventTasks) {
     if (!affectedTracks.contains(task.second->track()))
-      affectedTracks.append(task.second->track());
+      affectedTracks.push_back(task.second->track());
 
     // 13 - Queue each task in events, in list order.
 
     // Each event in eventTasks may be either an enterEvent or an exitEvent,
     // depending on the time that is associated with the event. This
     // correctly identifies the type of the event, if the startTime is
     // less than the endTime in the cue.
     if (task.second->startTime() >= task.second->endTime()) {
       mediaElement.scheduleEvent(
           createEventWithTarget(EventTypeNames::enter, task.second.get()));
@@ skipping 59 matching lines @@
   --m_ignoreUpdate;
   if (!m_ignoreUpdate)
     updateActiveCues(mediaElement().currentTime());
 }
 
 DEFINE_TRACE(CueTimeline) {
   visitor->trace(m_mediaElement);
 }
 
 }  // namespace blink