OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2007, 2009, 2010 Apple Inc. All rights reserved. | 2 * Copyright (C) 2007, 2009, 2010 Apple Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
11 * documentation and/or other materials provided with the distribution. | 11 * documentation and/or other materials provided with the distribution. |
12 * | 12 * |
13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY | 13 * THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR | 16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | 17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | 18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | 19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY | 20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
24 */ | 24 */ |
25 | 25 |
26 #include "config.h" | 26 #include "config.h" |
27 | 27 |
28 #include "TimeRanges.h" | 28 #include "TimeRanges.h" |
29 | 29 |
30 #include "ExceptionCode.h" | |
31 #include "ExceptionCodePlaceholder.h" | |
32 #include <math.h> | 30 #include <math.h> |
| 31 #include "core/dom/ExceptionCode.h" |
| 32 #include "core/dom/ExceptionCodePlaceholder.h" |
33 | 33 |
34 using namespace WebCore; | 34 using namespace WebCore; |
35 using namespace std; | 35 using namespace std; |
36 | 36 |
37 TimeRanges::TimeRanges(double start, double end) | 37 TimeRanges::TimeRanges(double start, double end) |
38 { | 38 { |
39 add(start, end); | 39 add(start, end); |
40 } | 40 } |
41 | 41 |
42 PassRefPtr<TimeRanges> TimeRanges::copy() const | 42 PassRefPtr<TimeRanges> TimeRanges::copy() const |
(...skipping 131 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
174 double endTime = end(ndx, IGNORE_EXCEPTION); | 174 double endTime = end(ndx, IGNORE_EXCEPTION); |
175 if (time >= startTime && time <= endTime) | 175 if (time >= startTime && time <= endTime) |
176 return time; | 176 return time; |
177 if (fabs(startTime - time) < closest) | 177 if (fabs(startTime - time) < closest) |
178 closest = fabsf(startTime - time); | 178 closest = fabsf(startTime - time); |
179 else if (fabs(endTime - time) < closest) | 179 else if (fabs(endTime - time) < closest) |
180 closest = fabsf(endTime - time); | 180 closest = fabsf(endTime - time); |
181 } | 181 } |
182 return closest; | 182 return closest; |
183 } | 183 } |
OLD | NEW |