blob: 015326bdd7b73d4f9a5550a8606a1f8439b5167f (
plain)
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
|
/*
Copyright (C) 2017-2021 Carl Hetherington <cth@carlh.net>
This file is part of DCP-o-matic.
DCP-o-matic is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
DCP-o-matic is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with DCP-o-matic. If not, see <http://www.gnu.org/licenses/>.
*/
#include "dcpomatic_time.h"
#include <iostream>
namespace dcpomatic {
/** @param periods Set of periods in ascending order of from time */
template <class T>
std::list<TimePeriod<T>> coalesce (std::list<TimePeriod<T>> periods)
{
bool did_something;
std::list<TimePeriod<T>> coalesced;
do {
coalesced.clear ();
did_something = false;
for (auto i = periods.begin(); i != periods.end(); ++i) {
auto j = i;
++j;
if (j != periods.end() && (i->overlap(*j) || i->to == j->from)) {
coalesced.push_back(TimePeriod<T>(std::min(i->from, j->from), std::max(i->to, j->to)));
did_something = true;
++i;
} else {
coalesced.push_back (*i);
}
}
periods = coalesced;
} while (did_something);
return periods;
}
}
|
