Web Animations: Sort Players in DocumentTimeline::serviceAnimations

Source/core/animation/DocumentTimeline.cpp

 /*
  * Copyright (C) 2013 Google 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 77 matching lines @@
     m_timing->serviceOnNextFrame();
 }
 
 void DocumentTimeline::serviceAnimations()
 {
     TRACE_EVENT0("webkit", "DocumentTimeline::serviceAnimations");
 
     m_timing->cancelWake();
 
     double timeToNextEffect = std::numeric_limits<double>::infinity();
-    Vector<Player*> playersToRemove;
-    for (HashSet<RefPtr<Player> >::iterator it = m_playersNeedingUpdate.begin(); it != m_playersNeedingUpdate.end(); ++it) {
-        Player* player = it->get();
-        if (!player->update())
-            playersToRemove.append(player);
-        timeToNextEffect = std::min(timeToNextEffect, player->timeToEffectChange());
+    Vector<Player*> players;
+    for (HashSet<RefPtr<Player> >::iterator it = m_playersNeedingUpdate.begin(); it != m_playersNeedingUpdate.end(); ++it)
+        players.append(it->get());
+
+    std::sort(players.begin(), players.end(), Player::hasLowerPriority);
+
+    for (size_t i = 0; i < players.size(); ++i) {
+        Player* player = players[i];
+        if (player->update())
+            timeToNextEffect = std::min(timeToNextEffect, player->timeToEffectChange());
+        else
+            m_playersNeedingUpdate.remove(player);
     }
-    for (size_t i = 0; i < playersToRemove.size(); ++i)
-        m_playersNeedingUpdate.remove(playersToRemove[i]);
 
     ASSERT(!m_playersNeedingUpdate.isEmpty() || timeToNextEffect == std::numeric_limits<double>::infinity());
     if (timeToNextEffect < s_minimumDelay)
         m_timing->serviceOnNextFrame();
     else if (timeToNextEffect != std::numeric_limits<double>::infinity())
         m_timing->wakeAfter(timeToNextEffect - s_minimumDelay);
 
     m_hasOutdatedPlayer = false;
 }
 
@@ skipping 58 matching lines @@
             count += (timedItem && (timedItem->isCurrent() || timedItem->isInEffect()));
     }
     return count;
 }
 
 void DocumentTimeline::detachFromDocument() {
     m_document = 0;
 }
 
 } // namespace