forked from rime/librime
-
Notifications
You must be signed in to change notification settings - Fork 0
/
candidate.h
149 lines (125 loc) · 4.3 KB
/
candidate.h
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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
//
// Copyright RIME Developers
// Distributed under the BSD License
//
// 2011-05-22 GONG Chen <chen.sst@gmail.com>
//
#ifndef RIME_CANDIDATE_H_
#define RIME_CANDIDATE_H_
#include <rime/common.h>
namespace rime {
class Candidate {
public:
Candidate() = default;
Candidate(const string& type, size_t start, size_t end, double quality = 0.)
: type_(type), start_(start), end_(end), quality_(quality) {}
virtual ~Candidate() = default;
static an<Candidate> GetGenuineCandidate(const an<Candidate>& cand);
static vector<of<Candidate>> GetGenuineCandidates(const an<Candidate>& cand);
// recognized by translators in learning phase
const string& type() const { return type_; }
// [start, end) mark a range in the input that the candidate corresponds to
size_t start() const { return start_; }
size_t end() const { return end_; }
double quality() const { return quality_; }
// candidate text to commit
virtual const string& text() const = 0;
// (optional)
virtual string comment() const { return string(); }
// text shown in the preedit area, replacing input string (optional)
virtual string preedit() const { return string(); }
void set_type(const string& type) { type_ = type; }
void set_start(size_t start) { start_ = start; }
void set_end(size_t end) { end_ = end; }
void set_quality(double quality) { quality_ = quality; }
private:
string type_;
size_t start_ = 0;
size_t end_ = 0;
double quality_ = 0.;
};
using CandidateQueue = list<of<Candidate>>;
using CandidateList = vector<of<Candidate>>;
// useful implementations
class SimpleCandidate : public Candidate {
public:
SimpleCandidate() = default;
SimpleCandidate(const string& type,
size_t start,
size_t end,
const string& text,
const string& comment = string(),
const string& preedit = string())
: Candidate(type, start, end),
text_(text),
comment_(comment),
preedit_(preedit) {}
const string& text() const { return text_; }
string comment() const { return comment_; }
string preedit() const { return preedit_; }
void set_text(const string& text) { text_ = text; }
void set_comment(const string& comment) { comment_ = comment; }
void set_preedit(const string& preedit) { preedit_ = preedit; }
protected:
string text_;
string comment_;
string preedit_;
};
class ShadowCandidate : public Candidate {
public:
ShadowCandidate(const an<Candidate>& item,
const string& type,
const string& text = string(),
const string& comment = string(),
const bool inherit_comment = true)
: Candidate(type, item->start(), item->end(), item->quality()),
text_(text),
comment_(comment),
item_(item),
inherit_comment_(inherit_comment) {}
const string& text() const { return text_.empty() ? item_->text() : text_; }
string comment() const {
return inherit_comment_ && comment_.empty() ? item_->comment() : comment_;
}
string preedit() const { return item_->preedit(); }
const an<Candidate>& item() const { return item_; }
protected:
string text_;
string comment_;
an<Candidate> item_;
bool inherit_comment_;
};
class UniquifiedCandidate : public Candidate {
public:
UniquifiedCandidate(const an<Candidate>& item,
const string& type,
const string& text = string(),
const string& comment = string())
: Candidate(type, item->start(), item->end(), item->quality()),
text_(text),
comment_(comment) {
Append(item);
}
const string& text() const {
return text_.empty() && !items_.empty() ? items_.front()->text() : text_;
}
string comment() const {
return comment_.empty() && !items_.empty() ? items_.front()->comment()
: comment_;
}
string preedit() const {
return !items_.empty() ? items_.front()->preedit() : string();
}
void Append(an<Candidate> item) {
items_.push_back(item);
if (quality() < item->quality())
set_quality(item->quality());
}
const CandidateList& items() const { return items_; }
protected:
string text_;
string comment_;
CandidateList items_;
};
} // namespace rime
#endif // RIME_CANDIDATE_H_