Merge master.
[dcpomatic.git] / src / lib / subrip_decoder.cc
1 /*
2     Copyright (C) 2014 Carl Hetherington <cth@carlh.net>
3
4     This program is free software; you can redistribute it and/or modify
5     it under the terms of the GNU General Public License as published by
6     the Free Software Foundation; either version 2 of the License, or
7     (at your option) any later version.
8
9     This program is distributed in the hope that it will be useful,
10     but WITHOUT ANY WARRANTY; without even the implied warranty of
11     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
12     GNU General Public License for more details.
13
14     You should have received a copy of the GNU General Public License
15     along with this program; if not, write to the Free Software
16     Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
17
18 */
19
20 #include <dcp/subtitle_string.h>
21 #include "subrip_decoder.h"
22 #include "subrip_content.h"
23
24 using std::list;
25 using std::vector;
26 using boost::shared_ptr;
27
28 SubRipDecoder::SubRipDecoder (shared_ptr<const SubRipContent> content)
29         : SubtitleDecoder (content)
30         , SubRip (content)
31         , _next (0)
32 {
33
34 }
35
36 void
37 SubRipDecoder::seek (ContentTime time, bool accurate)
38 {
39         SubtitleDecoder::seek (time, accurate);
40         
41         _next = 0;
42         while (_next < _subtitles.size() && ContentTime::from_seconds (_subtitles[_next].from.metric().get().all_as_seconds ()) < time) {
43                 ++_next;
44         }
45 }
46
47 bool
48 SubRipDecoder::pass ()
49 {
50         if (_next >= _subtitles.size ()) {
51                 return true;
52         }
53
54         /* XXX: we are ignoring positioning specified in the file */
55         
56         list<dcp::SubtitleString> out;
57         for (list<sub::Line>::const_iterator i = _subtitles[_next].lines.begin(); i != _subtitles[_next].lines.end(); ++i) {
58                 for (list<sub::Block>::const_iterator j = i->blocks.begin(); j != i->blocks.end(); ++j) {
59                         out.push_back (
60                                 dcp::SubtitleString (
61                                         "Arial",
62                                         j->italic,
63                                         dcp::Color (255, 255, 255),
64                                         /* .srt files don't specify size, so this is an arbitrary value */
65                                         48,
66                                         dcp::Time (rint (_subtitles[_next].from.metric().get().all_as_milliseconds() / 4)),
67                                         dcp::Time (rint (_subtitles[_next].to.metric().get().all_as_milliseconds() / 4)),
68                                         i->vertical_position.line.get() * (1.5 / 22) + 0.8,
69                                         dcp::TOP,
70                                         j->text,
71                                         dcp::NONE,
72                                         dcp::Color (255, 255, 255),
73                                         0,
74                                         0
75                                         )
76                                 );
77                 }
78         }
79
80         text_subtitle (out);
81         ++_next;
82         return false;
83 }
84
85 list<ContentTimePeriod>
86 SubRipDecoder::subtitles_during (ContentTimePeriod p, bool starting) const
87 {
88         /* XXX: inefficient */
89
90         list<ContentTimePeriod> d;
91
92         for (vector<sub::Subtitle>::const_iterator i = _subtitles.begin(); i != _subtitles.end(); ++i) {
93
94                 ContentTimePeriod t (
95                         ContentTime::from_seconds (i->from.metric().get().all_as_seconds()),
96                         ContentTime::from_seconds (i->to.metric().get().all_as_seconds())
97                         );
98                 
99                 if ((starting && p.contains (t.from)) || (!starting && p.overlaps (t))) {
100                         d.push_back (t);
101                 }
102         }
103
104         return d;
105 }