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
|
/* 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 3 of the License, 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, see <http://www.gnu.org/licenses/>.
*/
#include "PYPLuaTriggerCandidates.h"
#include <assert.h>
#include "PYString.h"
#include "PYConfig.h"
#include "PYPPhoneticEditor.h"
using namespace PY;
static const int MAXIMUM_NUM = 10;
LuaTriggerCandidates::LuaTriggerCandidates (Editor *editor)
{
m_editor = editor;
}
gboolean
LuaTriggerCandidates::setLuaPlugin (IBusEnginePlugin *plugin)
{
m_lua_plugin = plugin;
return TRUE;
}
gboolean
LuaTriggerCandidates::processCandidates (std::vector<EnhancedCandidate> & candidates)
{
if (!m_lua_plugin)
return FALSE;
m_candidates.clear ();
std::vector<EnhancedCandidate>::iterator pos;
for (pos = candidates.begin (); pos != candidates.end (); ++pos) {
if (CANDIDATE_NBEST_MATCH != pos->m_candidate_type &&
CANDIDATE_LONGER != pos->m_candidate_type &&
CANDIDATE_LONGER_USER != pos->m_candidate_type)
break;
}
const char * lua_function_name = NULL;
const char * text = m_editor->m_text;
gchar * string = NULL;
EnhancedCandidate enhanced;
enhanced.m_candidate_type = CANDIDATE_LUA_TRIGGER;
if (ibus_engine_plugin_match_input
(m_lua_plugin, text, &lua_function_name)) {
int num = ibus_engine_plugin_call (m_lua_plugin, lua_function_name, text);
num = std::min (num, MAXIMUM_NUM);
for (int i = 0; i < num; ++i) {
string = ibus_engine_plugin_get_nth_result (m_lua_plugin, i);
enhanced.m_display_string = string;
enhanced.m_candidate_id = i;
g_free (string);
candidates.insert (pos, enhanced);
m_candidates.push_back (enhanced);
}
ibus_engine_plugin_clear_results (m_lua_plugin);
return TRUE;
} else {
int num_in_page = std::min
(m_editor->m_config.pageSize (), (guint)candidates.size ());
for (int j = 0; j < num_in_page; ++j) {
text = candidates[j].m_display_string.c_str ();
if (ibus_engine_plugin_match_candidate
(m_lua_plugin, text, &lua_function_name)) {
int num = ibus_engine_plugin_call (m_lua_plugin, lua_function_name, text);
num = std::min (num, MAXIMUM_NUM);
for (int i = 0; i < num; ++i) {
string = ibus_engine_plugin_get_nth_result (m_lua_plugin, i);
enhanced.m_display_string = string;
enhanced.m_candidate_id = i;
g_free (string);
candidates.insert (pos, enhanced);
m_candidates.push_back (enhanced);
}
ibus_engine_plugin_clear_results (m_lua_plugin);
return TRUE;
}
}
}
return FALSE;
}
int
LuaTriggerCandidates::selectCandidate (EnhancedCandidate & enhanced)
{
assert (CANDIDATE_LUA_TRIGGER == enhanced.m_candidate_type);
assert (enhanced.m_candidate_id < m_candidates.size ());
return SELECT_CANDIDATE_COMMIT;
}
gboolean
LuaTriggerCandidates::removeCandidate (EnhancedCandidate & enhanced)
{
assert (CANDIDATE_LUA_TRIGGER == enhanced.m_candidate_type);
assert (enhanced.m_candidate_id < m_candidates.size ());
return FALSE;
}
|
