blob: e306dc61adf25b12cfc4851c28fce61a44b0d6df (
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
|
#ifndef SEARCH_EDGE_GENERATOR__
#define SEARCH_EDGE_GENERATOR__
#include "search/edge.hh"
#include <boost/unordered_map.hpp>
#include <functional>
#include <queue>
namespace lm {
namespace ngram {
class ChartState;
} // namespace ngram
} // namespace lm
namespace search {
template <class Model> class Context;
class VertexGenerator;
struct PartialEdgePointerLess : std::binary_function<const PartialEdge *, const PartialEdge *, bool> {
bool operator()(const PartialEdge *first, const PartialEdge *second) const {
return *first < *second;
}
};
class EdgeGenerator {
public:
// True if it has a hypothesis.
bool Init(Edge &edge, VertexGenerator &parent);
Score Top() const {
return top_;
}
template <class Model> bool Pop(Context<Model> &context, VertexGenerator &parent);
private:
const Rule &GetRule() const {
return from_->GetRule();
}
Score top_;
typedef std::priority_queue<PartialEdge*, std::vector<PartialEdge*>, PartialEdgePointerLess> Generate;
Generate generate_;
Edge *from_;
};
} // namespace search
#endif // SEARCH_EDGE_GENERATOR__
|
