blob: 82e8c0c0ea0952c7987846ffdcd70059c10b2e30 (
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
77
78
79
80
|
#ifndef DICT_H_
#define DICT_H_
#include <cassert>
#include <cstring>
#ifdef HAVE_SPARSEHASH
# include <google/dense_hash_map>
#else
# include <tr1/unordered_map>
#endif
#include <string>
#include <vector>
#include <boost/functional/hash.hpp>
#include "wordid.h"
class Dict {
typedef
#ifdef HAVE_SPARSEHASH
std::tr1::unordered_map
#else
google::dense_hash_map
#endif
<std::string, WordID, boost::hash<std::string> > Map;
public:
Dict() : b0_("<bad0>") {
#ifdef HAVE_SPARSEHASH
d_.set_empty_key("<bad1>");
d_.set_deleted_key("<bad2>");
#endif
words_.reserve(1000);
}
inline int max() const { return words_.size(); }
inline WordID Convert(const std::string& word, bool frozen = false) {
Map::iterator i = d_.find(word);
if (i == d_.end()) {
if (frozen)
return 0;
words_.push_back(word);
d_[word] = words_.size();
return words_.size();
} else {
return i->second;
}
}
inline WordID Convert(const std::vector<std::string>& words, bool frozen = false)
{ return Convert(toString(words), frozen); }
static inline std::string toString(const std::vector<std::string>& words) {
std::string word= "";
for (std::vector<std::string>::const_iterator it=words.begin();
it != words.end(); ++it) {
if (it != words.begin()) word += " ||| ";
word += *it;
}
return word;
}
inline const std::string& Convert(const WordID& id) const {
if (id == 0) return b0_;
assert(id <= (int)words_.size());
return words_[id-1];
}
void AsVector(const WordID& id, std::vector<std::string>* results) const;
void clear() { words_.clear(); d_.clear(); }
private:
const std::string b0_;
std::vector<std::string> words_;
Map d_;
};
#endif
|
