Fix TimeRanges::nearest() to actually calculate nearest time.

Source/core/html/TimeRangesTest.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 280 matching lines @@
     rangesB->add(6, 9);
 
     ASSERT_RANGE("{ [0,2) [4,7) [8,10) }", rangesA);
     ASSERT_RANGE("{ [1,5) [6,9) }", rangesB);
 
     rangesA->intersectWith(rangesB.get());
 
     ASSERT_RANGE("{ [1,2) [4,5) [6,7) [8,9) }", rangesA);
     ASSERT_RANGE("{ [1,5) [6,9) }", rangesB);
 }
+
+TEST(TimeRanges, Nearest)
+{
+    RefPtrWillBeRawPtr<TimeRanges> ranges = TimeRanges::create();
+    ranges->add(0, 2);
+    ranges->add(5, 7);
+
+    ASSERT_EQ(0, ranges->nearest(0, 0));
+    ASSERT_EQ(1, ranges->nearest(1, 0));
+    ASSERT_EQ(2, ranges->nearest(2, 0));
+    ASSERT_EQ(2, ranges->nearest(3, 0));
+    ASSERT_EQ(5, ranges->nearest(4, 0));
+    ASSERT_EQ(5, ranges->nearest(5, 0));
+    ASSERT_EQ(7, ranges->nearest(8, 0));
+
+    ranges->add(9, 11);
+    ASSERT_EQ(7, ranges->nearest(8, 6));
+    ASSERT_EQ(7, ranges->nearest(8, 8));
+    ASSERT_EQ(9, ranges->nearest(8, 10));
+}