1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
|
/*
* Copyright (C) 2019 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
* copyright notice, this list of conditions and the following disclaimer
* in the documentation and/or other materials provided with the
* distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "third_party/blink/public/platform/web_time_range.h"
#include <cmath>
#include <limits>
#include "base/check_op.h"
namespace blink {
void WebTimeRanges::Add(double start, double end) {
DCHECK_LE(start, end);
unsigned overlapping_arc_index;
WebTimeRange added_range(start, end);
// For each present range check if we need to:
// - merge with the added range, in case we are overlapping or contiguous
// - Need to insert in place, we we are completely, not overlapping and not
// contiguous in between two ranges.
//
// TODO: Given that we assume that ranges are correctly ordered, this could be
// optimized.
for (overlapping_arc_index = 0; overlapping_arc_index < size();
overlapping_arc_index++) {
if (added_range.IsOverlappingRange(data_[overlapping_arc_index]) ||
added_range.IsContiguousWithRange(data_[overlapping_arc_index])) {
// We need to merge the addedRange and that range.
added_range = added_range.UnionWithOverlappingOrContiguousRange(
data_[overlapping_arc_index]);
data_.erase(begin() + overlapping_arc_index);
overlapping_arc_index--;
} else {
// Check the case for which there is no more to do
if (!overlapping_arc_index) {
if (added_range.IsBeforeRange(data_[0])) {
// First index, and we are completely before that range (and not
// contiguous, nor overlapping). We just need to be inserted here.
break;
}
} else {
if (data_[overlapping_arc_index - 1].IsBeforeRange(added_range) &&
added_range.IsBeforeRange(data_[overlapping_arc_index])) {
// We are exactly after the current previous range, and before the
// current range, while not overlapping with none of them. Insert
// here.
break;
}
}
}
}
// Now that we are sure we don't overlap with any range, just add it.
data_.insert(begin() + overlapping_arc_index, added_range);
}
bool WebTimeRanges::Contain(double time) const {
for (const WebTimeRange& range : data_) {
if (time >= range.start && time <= range.end)
return true;
}
return false;
}
void WebTimeRanges::Invert() {
WebTimeRanges inverted;
double pos_inf = std::numeric_limits<double>::infinity();
double neg_inf = -std::numeric_limits<double>::infinity();
if (!size()) {
inverted.Add(neg_inf, pos_inf);
} else {
double start = front().start;
if (start != neg_inf)
inverted.Add(neg_inf, start);
for (size_t index = 0; index + 1 < size(); ++index)
inverted.Add(data_[index].end, data_[index + 1].start);
double end = back().end;
if (end != pos_inf)
inverted.Add(end, pos_inf);
}
data_.swap(inverted.data_);
}
void WebTimeRanges::IntersectWith(const WebTimeRanges& other) {
WebTimeRanges inverted_other = other;
inverted_other.Invert();
Invert();
UnionWith(inverted_other);
Invert();
}
void WebTimeRanges::UnionWith(const WebTimeRanges& other) {
for (const WebTimeRange& range : other.data_) {
Add(range.start, range.end);
}
}
double WebTimeRanges::Nearest(double new_playback_position,
double current_playback_position) const {
double best_match = 0;
double best_delta = std::numeric_limits<double>::infinity();
for (const WebTimeRange& range : data_) {
double start_time = range.start;
double end_time = range.end;
if (new_playback_position >= start_time &&
new_playback_position <= end_time)
return new_playback_position;
double delta, match;
if (new_playback_position < start_time) {
delta = start_time - new_playback_position;
match = start_time;
} else {
delta = new_playback_position - end_time;
match = end_time;
}
if (delta < best_delta ||
(delta == best_delta &&
std::abs(current_playback_position - match) <
std::abs(current_playback_position - best_match))) {
best_delta = delta;
best_match = match;
}
}
return best_match;
}
} // namespace blink
|
