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 |
(...skipping 193 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
204 | 204 |
205 if (delta < bestDelta || (delta == bestDelta | 205 if (delta < bestDelta || (delta == bestDelta |
206 && std::abs(currentPlaybackPosition - match) < std::abs(currentPlayb
ackPosition - bestMatch))) { | 206 && std::abs(currentPlaybackPosition - match) < std::abs(currentPlayb
ackPosition - bestMatch))) { |
207 bestDelta = delta; | 207 bestDelta = delta; |
208 bestMatch = match; | 208 bestMatch = match; |
209 } | 209 } |
210 } | 210 } |
211 return bestMatch; | 211 return bestMatch; |
212 } | 212 } |
213 | 213 |
| 214 unsigned TimeRanges::nearestRange(double position) const |
| 215 { |
| 216 unsigned count = length(); |
| 217 unsigned bestMatch = 0; |
| 218 double bestDelta = std::numeric_limits<double>::infinity(); |
| 219 for (unsigned ndx = 0; ndx < count; ++ndx) { |
| 220 double startTime = start(ndx, IGNORE_EXCEPTION); |
| 221 double endTime = end(ndx, IGNORE_EXCEPTION); |
| 222 if (position >= startTime && position <= endTime) { |
| 223 return ndx; |
| 224 } |
| 225 |
| 226 double delta; |
| 227 if (position < startTime) { |
| 228 delta = startTime - position; |
| 229 } else { |
| 230 delta = position - endTime; |
| 231 } |
| 232 |
| 233 // Prioritize later ranges |
| 234 if (delta <= bestDelta) { |
| 235 bestDelta = delta; |
| 236 bestMatch = ndx; |
| 237 } |
| 238 } |
| 239 |
| 240 return bestMatch; |
| 241 } |
| 242 |
214 DEFINE_TRACE(TimeRanges) | 243 DEFINE_TRACE(TimeRanges) |
215 { | 244 { |
216 visitor->trace(m_ranges); | 245 visitor->trace(m_ranges); |
217 } | 246 } |
OLD | NEW |