blob: 0901f73b020027cc733ab325c2085f494db65d45 (
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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
/*
Copyright (C) 2012 Carl Hetherington <cth@carlh.net>
This program 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.
This program 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 this program; if not, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
/** @file src/decoder.cc
* @brief Parent class for decoders of content.
*/
#include "decoder.h"
#include "decoded.h"
#include "i18n.h"
using std::cout;
using boost::shared_ptr;
/** @param o Decode options.
*/
Decoder::Decoder ()
: _done (false)
{
}
struct DecodedSorter
{
bool operator() (shared_ptr<Decoded> a, shared_ptr<Decoded> b)
{
return a->dcp_time < b->dcp_time;
}
};
shared_ptr<Decoded>
Decoder::peek ()
{
while (!_done && _pending.empty ()) {
_done = pass ();
}
if (_done && _pending.empty ()) {
return shared_ptr<Decoded> ();
}
_pending.sort (DecodedSorter ());
return _pending.front ();
}
void
Decoder::consume ()
{
if (!_pending.empty ()) {
_pending.pop_front ();
}
}
void
Decoder::seek (ContentTime, bool)
{
_pending.clear ();
_done = false;
}
|
