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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
|
/* vim:set et ts=4 sts=4:
*
* ibus-libpinyin - Intelligent Pinyin engine based on libpinyin for IBus
*
* Copyright (c) 2018 Peng Wu <alexepico@gmail.com>
*
* 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, 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include "PYPSuggestionEditor.h"
#include <assert.h>
#include "PYConfig.h"
#include "PYLibPinyin.h"
#include "PYPinyinProperties.h"
using namespace PY;
SuggestionEditor::SuggestionEditor (PinyinProperties &props,
Config & config)
: Editor (props, config),
m_suggestion_candidates (this),
#ifdef IBUS_BUILD_LUA_EXTENSION
m_lua_trigger_candidates (this),
m_lua_converter_candidates (this),
#endif
m_traditional_candidates (this)
{
/* use m_text to store the prefix string. */
m_text = "";
m_cursor = 0;
m_instance = LibPinyinBackEnd::instance ().allocPinyinInstance ();
}
SuggestionEditor::~SuggestionEditor (void)
{
LibPinyinBackEnd::instance ().freePinyinInstance (m_instance);
m_instance = NULL;
}
gboolean
SuggestionEditor::setLuaPlugin (IBusEnginePlugin *plugin)
{
#ifdef IBUS_BUILD_LUA_EXTENSION
m_lua_trigger_candidates.setLuaPlugin (plugin);
m_lua_converter_candidates.setLuaPlugin (plugin);
#endif
return TRUE;
}
gboolean
SuggestionEditor::processKeyEvent (guint keyval, guint keycode, guint modifiers)
{
//IBUS_SHIFT_MASK is removed.
modifiers &= (IBUS_CONTROL_MASK |
IBUS_MOD1_MASK |
IBUS_SUPER_MASK |
IBUS_HYPER_MASK |
IBUS_META_MASK |
IBUS_LOCK_MASK);
if (modifiers)
return FALSE;
// handle enter here.
if (keyval == IBUS_Return)
return FALSE;
//handle page/cursor up/down here.
if (processPageKey (keyval))
return TRUE;
//handle label key select here.
if (processLabelKey (keyval))
return TRUE;
if (processSpace (keyval))
return TRUE;
update ();
return TRUE;
}
gboolean
SuggestionEditor::processPageKey (guint keyval)
{
switch (keyval) {
case IBUS_comma:
if (m_config.commaPeriodPage ()) {
pageUp ();
return TRUE;
}
break;
case IBUS_minus:
if (m_config.minusEqualPage ()) {
pageUp ();
return TRUE;
}
break;
case IBUS_period:
if (m_config.commaPeriodPage ()) {
pageDown ();
return TRUE;
}
break;
case IBUS_equal:
if (m_config.minusEqualPage ()) {
pageDown ();
return TRUE;
}
break;
case IBUS_Up:
case IBUS_KP_Up:
cursorUp ();
return TRUE;
case IBUS_Down:
case IBUS_KP_Down:
cursorDown ();
return TRUE;
case IBUS_Page_Up:
case IBUS_KP_Page_Up:
pageUp ();
return TRUE;
case IBUS_Page_Down:
case IBUS_KP_Page_Down:
pageDown ();
return TRUE;
case IBUS_Escape:
reset ();
return TRUE;
}
return FALSE;
}
gboolean
SuggestionEditor::processLabelKey (guint keyval)
{
switch (keyval) {
case '1' ... '9':
return selectCandidateInPage (keyval - '1');
break;
case '0':
return selectCandidateInPage (9);
break;
}
return FALSE;
}
gboolean
SuggestionEditor::processSpace (guint keyval)
{
if (!(keyval == IBUS_space || keyval == IBUS_KP_Space))
return FALSE;
guint cursor_pos = m_lookup_table.cursorPos ();
return selectCandidate (cursor_pos);
}
void
SuggestionEditor::candidateClicked (guint index, guint button, guint state)
{
selectCandidateInPage (index);
}
gboolean
SuggestionEditor::selectCandidateInPage (guint index)
{
guint page_size = m_lookup_table.pageSize ();
guint cursor_pos = m_lookup_table.cursorPos ();
if (G_UNLIKELY (index >= page_size))
return FALSE;
index += (cursor_pos / page_size) * page_size;
return selectCandidate (index);
}
gboolean
SuggestionEditor::selectCandidate (guint index)
{
if (G_UNLIKELY (index >= m_candidates.size ()))
return FALSE;
EnhancedCandidate & candidate = m_candidates[index];
int action = selectCandidateInternal (candidate);
if (action & SELECT_CANDIDATE_COMMIT) {
Text text (candidate.m_display_string);
commitText (text);
}
if (action & SELECT_CANDIDATE_UPDATE)
update ();
return TRUE;
}
/* Auxiliary Functions */
void
SuggestionEditor::pageUp (void)
{
if (G_LIKELY (m_lookup_table.pageUp ())) {
updateLookupTableFast ();
updatePreeditText ();
updateAuxiliaryText ();
}
}
void
SuggestionEditor::pageDown (void)
{
if (G_LIKELY (m_lookup_table.pageDown ())) {
updateLookupTableFast ();
updatePreeditText ();
updateAuxiliaryText ();
}
}
void
SuggestionEditor::cursorUp (void)
{
if (G_LIKELY (m_lookup_table.cursorUp ())) {
updateLookupTableFast ();
updatePreeditText ();
updateAuxiliaryText ();
}
}
void
SuggestionEditor::cursorDown (void)
{
if (G_LIKELY (m_lookup_table.cursorDown ())) {
updateLookupTableFast ();
updatePreeditText ();
updateAuxiliaryText ();
}
}
void
SuggestionEditor::update (void)
{
pinyin_guess_predicted_candidates (m_instance, m_text);
updateLookupTable ();
updatePreeditText ();
updateAuxiliaryText ();
}
void
SuggestionEditor::reset (void)
{
m_text = "";
update ();
}
void
SuggestionEditor::updateLookupTableFast (void)
{
Editor::updateLookupTableFast (m_lookup_table, TRUE);
}
void
SuggestionEditor::updateLookupTable (void)
{
m_lookup_table.clear ();
m_lookup_table.setPageSize (m_config.pageSize ());
m_lookup_table.setOrientation (m_config.orientation ());
updateCandidates ();
fillLookupTable ();
if (m_lookup_table.size ()){
Editor::updateLookupTableFast (m_lookup_table, TRUE);
} else {
hideLookupTable ();
/* clean up prefix */
m_text = "";
}
}
gboolean
SuggestionEditor::updateCandidates (void)
{
m_candidates.clear ();
m_suggestion_candidates.processCandidates (m_candidates);
if (!m_props.modeSimp ())
m_traditional_candidates.processCandidates (m_candidates);
#ifdef IBUS_BUILD_LUA_EXTENSION
m_lua_trigger_candidates.processCandidates (m_candidates);
std::string converter = m_config.luaConverter ();
if (!converter.empty ()) {
m_lua_converter_candidates.setConverter (converter.c_str ());
m_lua_converter_candidates.processCandidates (m_candidates);
}
#endif
return TRUE;
}
gboolean
SuggestionEditor::fillLookupTable ()
{
for (guint i = 0; i < m_candidates.size (); i++) {
EnhancedCandidate & candidate = m_candidates[i];
Text text (candidate.m_display_string);
/* no user candidate in suggestion editor. */
assert (CANDIDATE_USER != candidate.m_candidate_type);
m_lookup_table.appendCandidate (text);
}
return TRUE;
}
int
SuggestionEditor::selectCandidateInternal (EnhancedCandidate & candidate)
{
switch (candidate.m_candidate_type) {
case CANDIDATE_SUGGESTION:
return m_suggestion_candidates.selectCandidate (candidate);
case CANDIDATE_TRADITIONAL_CHINESE:
return m_traditional_candidates.selectCandidate (candidate);
#ifdef IBUS_BUILD_LUA_EXTENSION
case CANDIDATE_LUA_TRIGGER:
return m_lua_trigger_candidates.selectCandidate (candidate);
case CANDIDATE_LUA_CONVERTER:
return m_lua_converter_candidates.selectCandidate (candidate);
#endif
default:
assert (FALSE);
}
}
void
SuggestionEditor::updatePreeditText (void)
{
if (G_UNLIKELY (m_preedit_text.empty ())) {
hidePreeditText ();
return;
}
StaticText preedit_text (m_preedit_text);
Editor::updatePreeditText (preedit_text, m_cursor, TRUE);
}
void
SuggestionEditor::updateAuxiliaryText (void)
{
if (G_UNLIKELY (m_auxiliary_text.empty ())) {
hideAuxiliaryText ();
return;
}
StaticText aux_text (m_auxiliary_text);
Editor::updateAuxiliaryText (aux_text, TRUE);
}
|