Web Animations: Sort Animations in the AnimationStack

Source/core/animation/AnimationPlayerTest.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 676 matching lines @@
     RefPtr<AnimationPlayer> player = timeline->createAnimationPlayer(animation.get());
     timeline->serviceAnimations();
     EXPECT_EQ(1U, element->activeAnimations()->players().find(player.get())->value);
 
     player.release();
     EXPECT_TRUE(element->activeAnimations()->players().isEmpty());
 }
 
 TEST_F(AnimationAnimationPlayerTest, HasLowerPriority)
 {
-    // Note that start time defaults to null
+    // Sort time defaults to timeline current time
+    updateTimeline(15);
     RefPtr<AnimationPlayer> player1 = timeline->createAnimationPlayer(0);
     RefPtr<AnimationPlayer> player2 = timeline->createAnimationPlayer(0);
     player2->setStartTime(10);
     RefPtr<AnimationPlayer> player3 = timeline->createAnimationPlayer(0);
     RefPtr<AnimationPlayer> player4 = timeline->createAnimationPlayer(0);
     player4->setStartTime(20);
     RefPtr<AnimationPlayer> player5 = timeline->createAnimationPlayer(0);
     player5->setStartTime(10);
     RefPtr<AnimationPlayer> player6 = timeline->createAnimationPlayer(0);
     player6->setStartTime(-10);
     Vector<RefPtr<AnimationPlayer> > players;
-    players.append(player1);
-    players.append(player3);
     players.append(player6);
     players.append(player2);
     players.append(player5);
+    players.append(player1);
+    players.append(player3);
     players.append(player4);
     for (size_t i = 0; i < players.size(); i++) {
         for (size_t j = 0; j < players.size(); j++)
             EXPECT_EQ(i < j, AnimationPlayer::hasLowerPriority(players[i].get(), players[j].get()));
     }
 }
 
 }