Web Animations: Sort Players in DocumentTimeline::serviceAnimations

Source/core/animation/PlayerTest.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 661 matching lines @@
     Timing timing;
     RefPtr<Animation> animation = Animation::create(element, nullptr, timing);
     RefPtr<Player> player = timeline->createPlayer(animation.get());
     timeline->serviceAnimations();
     EXPECT_EQ(1U, element->activeAnimations()->players().find(player.get())->value);
 
     player.release();
     EXPECT_TRUE(element->activeAnimations()->players().isEmpty());
 }
 
+TEST_F(AnimationPlayerTest, HasLowerPriority)
+{
+    // Note that start time defaults to null
+    RefPtr<Player> player1 = timeline->createPlayer(0);
+    RefPtr<Player> player2 = timeline->createPlayer(0);
+    player2->setStartTime(10);
+    RefPtr<Player> player3 = timeline->createPlayer(0);
+    RefPtr<Player> player4 = timeline->createPlayer(0);
+    player4->setStartTime(20);
+    RefPtr<Player> player5 = timeline->createPlayer(0);
+    player5->setStartTime(10);
+    RefPtr<Player> player6 = timeline->createPlayer(0);
+    player6->setStartTime(-10);
+    Vector<RefPtr<Player> > players;
+    players.append(player1);
+    players.append(player3);
+    players.append(player6);
+    players.append(player2);
+    players.append(player5);
+    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, Player::hasLowerPriority(players[i].get(), players[j].get()));
+    }
 }
+
+}