2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
4 * Copyright (c) 2007 Sun Microsystems, Inc. All Rights Reserved.
6 * The contents of this file are subject to the terms of either the GNU Lesser
7 * General Public License Version 2.1 only ("LGPL") or the Common Development and
8 * Distribution License ("CDDL")(collectively, the "License"). You may not use this
9 * file except in compliance with the License. You can obtain a copy of the CDDL at
10 * http://www.opensource.org/licenses/cddl1.php and a copy of the LGPLv2.1 at
11 * http://www.opensource.org/licenses/lgpl-license.php. See the License for the
12 * specific language governing permissions and limitations under the License. When
13 * distributing the software, include this License Header Notice in each file and
14 * include the full text of the License in the License file as well as the
17 * NOTICE PURSUANT TO SECTION 9 OF THE COMMON DEVELOPMENT AND DISTRIBUTION LICENSE
19 * For Covered Software in this distribution, this License shall be governed by the
20 * laws of the State of California (excluding conflict-of-law provisions).
21 * Any litigation relating to this License shall be subject to the jurisdiction of
22 * the Federal Courts of the Northern District of California and the state courts
23 * of the State of California, with venue lying in Santa Clara County, California.
27 * If you wish your version of this file to be governed by only the CDDL or only
28 * the LGPL Version 2.1, indicate your decision by adding "[Contributor]" elects to
29 * include this software in this distribution under the [CDDL or LGPL Version 2.1]
30 * license." If you don't indicate a single choice of license, a recipient has the
31 * option to distribute your version of this file under either the CDDL or the LGPL
32 * Version 2.1, or to extend the choice of license to its licensees as provided
33 * above. However, if you add LGPL Version 2.1 code and therefore, elected the LGPL
34 * Version 2 license, then the option applies only if the new code is made subject
35 * to such option by the copyright holder.
42 #include "imi_uiobjects.h"
46 #define MAX_CANDI_COUNT_PER_WINDOW 16
47 #define MAX_STRING_LEN_CANDI_PREEDIT 256
49 IPreeditString::~IPreeditString()
53 CPreEditString::CPreEditString()
54 : m_caret(0), m_candi_start(0), m_charTypes()
56 m_charTypes.reserve(MAX_STRING_LEN_CANDI_PREEDIT);
59 CPreEditString::~CPreEditString()
64 CPreEditString::size() const
70 CPreEditString::string() const
72 return m_wstr.c_str();
76 CPreEditString::charTypeSize() const
78 return std::min(m_charTypes.size(), m_wstr.size());
82 CPreEditString::charTypeAt(int idx) const
84 if (idx < 0 || idx >= (int) m_charTypes.size()) {
87 return m_charTypes[idx];
91 CPreEditString::caret() const
97 CPreEditString::candi_start() const
103 CPreEditString::clear()
111 CPreEditString::getString()
116 IPreeditString::CCharTypeVec &
117 CPreEditString::getCharTypeVec()
123 CPreEditString::setCaret(int caret)
129 CPreEditString::setCandiStart(int candi_start)
131 m_candi_start = candi_start;
134 ICandidateList::~ICandidateList()
138 CCandidateList::CCandidateList()
139 : m_total(0), m_first(0), m_size(0)
143 CCandidateList::~CCandidateList()
148 CCandidateList::size() const
150 return m_candiStrings.size();
154 CCandidateList::total() const
160 CCandidateList::first() const
166 CCandidateList::setTotal(int total)
172 CCandidateList::setFirst(int first)
178 CCandidateList::candiType(unsigned item) const
180 return (item >= m_candiTypes.size()) ? (NORMAL_WORD) : (m_candiTypes[item]);
184 CCandidateList::candiSize(unsigned item) const
186 return (item >= m_candiStrings.size()) ? (0) : (m_candiStrings[item].size());
190 CCandidateList::candiString(unsigned item) const
193 m_candiStrings.size()) ? (NULL) : (m_candiStrings[item].c_str());
197 CCandidateList::candiCharTypeSizeAt(unsigned item) const
199 if (item >= m_candiCharTypeVecs.size())
201 const CCharTypeVec & ctv = m_candiCharTypeVecs[item];
202 return std::min((int)ctv.size(), candiSize(item));
206 CCandidateList::candiCharTypeAt(unsigned item, unsigned idx) const
208 int sz = candiCharTypeSizeAt(item);
209 if ((int) idx >= sz) {
210 return DONTCARE_CHAR;
212 return m_candiCharTypeVecs[item][idx];
216 CCandidateList::clear()
218 m_size = m_first = m_total = 0;
219 m_candiStrings.clear();
220 m_candiTypes.clear();
221 m_candiCharTypeVecs.clear();
222 m_candiUserIndex.clear();
223 m_candiStringsIndex.clear();
227 CCandidateList::setSize(int count)
232 ICandidateList::CCandiStrings &
233 CCandidateList::getCandiStrings()
235 return m_candiStrings;
238 ICandidateList::CCandiTypeVec &
239 CCandidateList::getCandiTypeVec()
244 ICandidateList::CCharTypeVecs &
245 CCandidateList::getCharTypeVecs()
247 return m_candiCharTypeVecs;
251 CCandidateList::pushBackCandidate(wstring wstr, int type, int userIdx)
253 if (m_candiStringsIndex.find(wstr) == m_candiStringsIndex.end()) {
254 m_candiStringsIndex.insert(std::make_pair(wstr, m_candiStrings.size()));
255 m_candiStrings.push_back(wstr);
256 m_candiTypes.push_back(type);
257 m_candiUserIndex.push_back(userIdx);
262 CCandidateList::insertCandidate(wstring wstr, int type, int rank, int userIdx)
264 if (rank > (int) m_candiStrings.size()) {
265 rank = m_candiStrings.size();
267 if (m_candiStringsIndex.find(wstr) == m_candiStringsIndex.end()) {
268 m_candiStringsIndex.insert(std::make_pair(wstr, m_candiStrings.size()));
269 insertCandidateNoDedup(wstr, type, rank, userIdx);
271 int idx = m_candiStringsIndex[wstr];
275 m_candiStringsIndex[wstr] = rank;
276 m_candiStrings.erase(m_candiStrings.begin() + idx);
277 m_candiTypes.erase(m_candiTypes.begin() + idx);
278 m_candiUserIndex.erase(m_candiUserIndex.begin() + idx);
279 m_candiStrings.insert(m_candiStrings.begin() + rank, wstr);
280 m_candiTypes.insert(m_candiTypes.begin() + rank, type);
281 m_candiUserIndex.insert(m_candiUserIndex.begin() + rank, userIdx);
286 CCandidateList::insertCandidateNoDedup(wstring wstr, int type, int rank,
289 m_candiStrings.insert(m_candiStrings.begin() + rank, wstr);
290 m_candiTypes.insert(m_candiTypes.begin() + rank, type);
291 m_candiUserIndex.insert(m_candiUserIndex.begin() + rank, userIdx);
295 CCandidateList::shrinkList()
297 if ((int) m_candiStrings.size() > m_first) {
298 m_candiStrings.erase(m_candiStrings.begin(),
299 m_candiStrings.begin() + m_first);
300 m_candiTypes.erase(m_candiTypes.begin(),
301 m_candiTypes.begin() + m_first);
302 m_candiUserIndex.erase(m_candiUserIndex.begin(),
303 m_candiUserIndex.begin() + m_first);
306 if ((int) m_candiStrings.size() > m_size) {
307 m_candiStrings.erase(m_candiStrings.begin() + m_size,
308 m_candiStrings.end());
309 m_candiTypes.erase(m_candiTypes.begin() + m_size,
311 m_candiUserIndex.erase(m_candiUserIndex.begin() + m_size,
312 m_candiUserIndex.end());