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
|
#ifndef SEARCH_VERTEX_GENERATOR__
#define SEARCH_VERTEX_GENERATOR__
#include "search/edge.hh"
#include "search/edge_generator.hh"
#include <boost/pool/pool.hpp>
#include <boost/unordered_map.hpp>
#include <queue>
namespace lm {
namespace ngram {
class ChartState;
} // namespace ngram
} // namespace lm
namespace search {
template <class Model> class Context;
class ContextBase;
class Final;
class VertexGenerator {
public:
template <class Model> VertexGenerator(Context<Model> &context, Vertex &gen);
PartialEdge *MallocPartialEdge() { return static_cast<PartialEdge*>(partial_edge_pool_.malloc()); }
void FreePartialEdge(PartialEdge *value) { partial_edge_pool_.free(value); }
void NewHypothesis(const lm::ngram::ChartState &state, const Edge &from, const PartialEdge &partial);
private:
// Parallel structure to VertexNode.
struct Trie {
Trie() : under(NULL) {}
VertexNode *under;
boost::unordered_map<uint64_t, Trie> extend;
};
Trie &FindOrInsert(Trie &node, uint64_t added, const lm::ngram::ChartState &state, unsigned char left, bool left_full, unsigned char right, bool right_full);
Final *CompleteTransition(Trie &node, const lm::ngram::ChartState &state, const Edge &from, const PartialEdge &partial);
ContextBase &context_;
std::vector<EdgeGenerator> edges_;
struct LessByTop : public std::binary_function<const EdgeGenerator *, const EdgeGenerator *, bool> {
bool operator()(const EdgeGenerator *first, const EdgeGenerator *second) const {
return first->Top() < second->Top();
}
};
typedef std::priority_queue<EdgeGenerator*, std::vector<EdgeGenerator*>, LessByTop> Generate;
Generate generate_;
Trie root_;
typedef boost::unordered_map<uint64_t, Final*> Existing;
Existing existing_;
int to_pop_;
boost::pool<> partial_edge_pool_;
};
} // namespace search
#endif // SEARCH_VERTEX_GENERATOR__
|
