Use C++11 features in core/html

Source/core/html/track/TextTrackList.cpp

 /*
  * Copyright (C) 2011, 2012 Apple Inc.  All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 139 matching lines @@
         if (track->id() == id)
             return track;
     }
 
     // When no tracks match the given argument, the method must return null.
     return 0;
 }
 
 void TextTrackList::invalidateTrackIndexesAfterTrack(TextTrack* track)
 {
-    WillBeHeapVector<RefPtrWillBeMember<TextTrack> >* tracks = 0;
+    WillBeHeapVector<RefPtrWillBeMember<TextTrack>>* tracks = 0;
 
     if (track->trackType() == TextTrack::TrackElement) {
         tracks = &m_elementTracks;
         for (size_t i = 0; i < m_addTrackTracks.size(); ++i)
             m_addTrackTracks[i]->invalidateTrackIndex();
         for (size_t i = 0; i < m_inbandTracks.size(); ++i)
             m_inbandTracks[i]->invalidateTrackIndex();
     } else if (track->trackType() == TextTrack::AddTrack) {
         tracks = &m_addTrackTracks;
         for (size_t i = 0; i < m_inbandTracks.size(); ++i)
@@ skipping 33 matching lines @@
     invalidateTrackIndexesAfterTrack(track.get());
 
     ASSERT(!track->trackList());
     track->setTrackList(this);
 
     scheduleAddTrackEvent(track.release());
 }
 
 void TextTrackList::remove(TextTrack* track)
 {
-    WillBeHeapVector<RefPtrWillBeMember<TextTrack> >* tracks = 0;
+    WillBeHeapVector<RefPtrWillBeMember<TextTrack>>* tracks = 0;
 
     if (track->trackType() == TextTrack::TrackElement) {
         tracks = &m_elementTracks;
     } else if (track->trackType() == TextTrack::AddTrack) {
         tracks = &m_addTrackTracks;
     } else if (track->trackType() == TextTrack::InBand) {
         tracks = &m_inbandTracks;
     } else {
         ASSERT_NOT_REACHED();
     }
@@ skipping 15 matching lines @@
 void TextTrackList::removeAllInbandTracks()
 {
     for (unsigned i = 0; i < m_inbandTracks.size(); ++i) {
         m_inbandTracks[i]->setTrackList(0);
     }
     m_inbandTracks.clear();
 }
 
 bool TextTrackList::contains(TextTrack* track) const
 {
-    const WillBeHeapVector<RefPtrWillBeMember<TextTrack> >* tracks = 0;
+    const WillBeHeapVector<RefPtrWillBeMember<TextTrack>>* tracks = 0;
 
     if (track->trackType() == TextTrack::TrackElement)
         tracks = &m_elementTracks;
     else if (track->trackType() == TextTrack::AddTrack)
         tracks = &m_addTrackTracks;
     else if (track->trackType() == TextTrack::InBand)
         tracks = &m_inbandTracks;
     else
         ASSERT_NOT_REACHED();
 
@@ skipping 72 matching lines @@
 
 void TextTrackList::trace(Visitor* visitor)
 {
     visitor->trace(m_owner);
     visitor->trace(m_asyncEventQueue);
     visitor->trace(m_addTrackTracks);
     visitor->trace(m_elementTracks);
     visitor->trace(m_inbandTracks);
     EventTargetWithInlineData::trace(visitor);
 }