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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org 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 Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include <assert.h>
#include <textconversion.hxx>
#include <com/sun/star/i18n/TextConversionType.hpp>
#include <com/sun/star/i18n/TextConversionOption.hpp>
#include <com/sun/star/linguistic2/ConversionDirection.hpp>
#include <com/sun/star/linguistic2/ConversionDictionaryType.hpp>
#include <rtl/ustrbuf.hxx>
#include <unicode/uchar.h>
using namespace com::sun::star::lang;
using namespace com::sun::star::i18n;
using namespace com::sun::star::linguistic2;
using namespace com::sun::star::uno;
using ::rtl::OUString;
using ::rtl::OUStringBuffer;
namespace com { namespace sun { namespace star { namespace i18n {
#define SCRIPT_OTHERS 0
#define SCRIPT_HANJA 1
#define SCRIPT_HANGUL 2
TextConversion_ko::TextConversion_ko( const Reference < XMultiServiceFactory >& xMSF )
{
Reference < XInterface > xI;
xI = xMSF->createInstance(
OUString(RTL_CONSTASCII_USTRINGPARAM("com.sun.star.i18n.ConversionDictionary_ko")));
if ( xI.is() )
xI->queryInterface( getCppuType((const Reference< XConversionDictionary>*)0) ) >>= xCD;
xI = xMSF->createInstance(
OUString(RTL_CONSTASCII_USTRINGPARAM("com.sun.star.linguistic2.ConversionDictionaryList")));
if ( xI.is() )
xI->queryInterface( getCppuType((const Reference< XConversionDictionaryList>*)0) ) >>= xCDL;
maxLeftLength = maxRightLength = 1;
// get maximum length of word in dictionary
if (xCDL.is()) {
Locale loc(OUString(RTL_CONSTASCII_USTRINGPARAM("ko")),
OUString(RTL_CONSTASCII_USTRINGPARAM("KR")),
OUString());
maxLeftLength = xCDL->queryMaxCharCount(loc,
ConversionDictionaryType::HANGUL_HANJA,
ConversionDirection_FROM_LEFT);
maxRightLength = xCDL->queryMaxCharCount(loc,
ConversionDictionaryType::HANGUL_HANJA,
ConversionDirection_FROM_RIGHT);
if (xCD.is()) {
sal_Int32 tmp = xCD->getMaxCharCount(ConversionDirection_FROM_LEFT);
if (tmp > maxLeftLength)
maxLeftLength = tmp;
tmp = xCD->getMaxCharCount(ConversionDirection_FROM_RIGHT);
if (tmp > maxRightLength)
maxRightLength = tmp;
}
} else if (xCD.is()) {
maxLeftLength = xCD->getMaxCharCount(ConversionDirection_FROM_LEFT);
maxRightLength = xCD->getMaxCharCount(ConversionDirection_FROM_RIGHT);
}
implementationName = "com.sun.star.i18n.TextConversion_ko";
}
sal_Int16 SAL_CALL checkScriptType(sal_Unicode c)
{
typedef struct {
UBlockCode from;
UBlockCode to;
sal_Int16 script;
} UBlock2Script;
static UBlock2Script scriptList[] = {
{UBLOCK_HANGUL_JAMO, UBLOCK_HANGUL_JAMO, SCRIPT_HANGUL},
{UBLOCK_CJK_RADICALS_SUPPLEMENT, UBLOCK_BOPOMOFO, SCRIPT_HANJA},
{UBLOCK_HANGUL_COMPATIBILITY_JAMO, UBLOCK_HANGUL_COMPATIBILITY_JAMO, SCRIPT_HANGUL},
{UBLOCK_KANBUN, UBLOCK_YI_RADICALS, SCRIPT_HANJA},
{UBLOCK_HANGUL_SYLLABLES, UBLOCK_HANGUL_SYLLABLES, SCRIPT_HANGUL},
{UBLOCK_CJK_COMPATIBILITY_IDEOGRAPHS, UBLOCK_CJK_COMPATIBILITY_IDEOGRAPHS, SCRIPT_HANJA},
{UBLOCK_COMBINING_HALF_MARKS, UBLOCK_SMALL_FORM_VARIANTS, SCRIPT_HANJA},
{UBLOCK_HALFWIDTH_AND_FULLWIDTH_FORMS, UBLOCK_HALFWIDTH_AND_FULLWIDTH_FORMS, SCRIPT_HANJA},
};
#define scriptListCount sizeof (scriptList) / sizeof (UBlock2Script)
UBlockCode block=ublock_getCode((sal_uInt32) c);
sal_uInt16 i;
for ( i = 0; i < scriptListCount; i++) {
if (block <= scriptList[i].to) break;
}
return (i < scriptListCount && block >= scriptList[i].from) ? scriptList[i].script : SCRIPT_OTHERS;
}
Sequence< OUString > SAL_CALL
TextConversion_ko::getCharConversions(const OUString& aText, sal_Int32 nStartPos, sal_Int32 nLength, sal_Bool toHanja)
{
sal_Unicode ch;
Sequence< OUString > output;
const sal_Unicode* (*getHangul2HanjaData)() = (const sal_Unicode* (*)())getFunctionBySymbol("getHangul2HanjaData");
const Hangul_Index* (*getHangul2HanjaIndex)() = (const Hangul_Index* (*)()) getFunctionBySymbol("getHangul2HanjaIndex");
sal_Int16 (*getHangul2HanjaIndexCount)() = (sal_Int16 (*)()) getFunctionBySymbol("getHangul2HanjaIndexCount");
const sal_uInt16* (*getHanja2HangulIndex)() = (const sal_uInt16* (*)()) getFunctionBySymbol("getHanja2HangulIndex");
const sal_Unicode* (*getHanja2HangulData)() = (const sal_Unicode* (*)()) getFunctionBySymbol("getHanja2HangulData");
if (toHanja && getHangul2HanjaIndex && getHangul2HanjaIndexCount && getHangul2HanjaData) {
ch = aText[nStartPos];
const Hangul_Index *Hangul_ko = getHangul2HanjaIndex();
sal_Int16 top = getHangul2HanjaIndexCount();
--top;
sal_Int16 bottom = 0;
while (bottom <= top) {
sal_Int16 current = (top + bottom) / 2;
sal_Unicode current_ch = Hangul_ko[current].code;
if (ch < current_ch)
top = current - 1;
else if (ch > current_ch)
bottom = current + 1;
else {
const sal_Unicode *ptr = getHangul2HanjaData() + Hangul_ko[current].address;
sal_Int16 count = Hangul_ko[current].count;
output.realloc(count);
for (sal_Int16 i = 0; i < count; i++)
output[i] = OUString(ptr + i, 1);
break;
}
}
} else if (! toHanja && getHanja2HangulIndex && getHanja2HangulData)
{
sal_Unicode *newStr = new sal_Unicode[nLength+1];
sal_Int32 count = 0;
while (count < nLength)
{
ch = aText[nStartPos + count];
sal_Unicode address = getHanja2HangulIndex()[ch>>8];
if (address != 0xFFFF)
address = getHanja2HangulData()[address + (ch & 0xFF)];
if (address != 0xFFFF)
newStr[count++] = address;
else
break;
}
if (count > 0)
{
output.realloc(1);
output[0] = OUString(newStr, count);
}
delete[] newStr;
}
return output;
}
static Sequence< OUString >& operator += (Sequence< OUString > &rSeq1, Sequence< OUString > &rSeq2 )
{
if (! rSeq1.hasElements() && rSeq2.hasElements())
rSeq1 = rSeq2;
else if (rSeq2.hasElements()) {
sal_Int32 i, j, k, l;
k = l = rSeq1.getLength();
rSeq1.realloc(l + rSeq2.getLength());
for (i = 0; i < rSeq2.getLength(); i++) {
for (j = 0; j < l; j++)
if (rSeq1[j] == rSeq2[i])
break;
if (j == l)
rSeq1[k++] = rSeq2[i];
}
if (rSeq1.getLength() > k)
rSeq1.realloc(k);
}
return rSeq1;
}
TextConversionResult SAL_CALL
TextConversion_ko::getConversions( const OUString& aText, sal_Int32 nStartPos, sal_Int32 nLength,
const Locale& aLocale, sal_Int16 nConversionType, sal_Int32 nConversionOptions)
throw( RuntimeException, IllegalArgumentException, NoSupportException )
{
TextConversionResult result;
Sequence <OUString> candidates;
result.Boundary.startPos = result.Boundary.endPos = 0;
// do conversion only when there are right conversion type and dictionary services.
if (nConversionType == TextConversionType::TO_HANGUL ||
nConversionType == TextConversionType::TO_HANJA) {
sal_Int32 start, end, length = aText.getLength() - nStartPos;
if (length < 0 || nStartPos < 0)
length = 0;
else if (length > nLength)
length = nLength;
sal_Int16 scriptType = SCRIPT_OTHERS;
sal_Int32 len = 1;
sal_Bool toHanja = (nConversionType == TextConversionType::TO_HANJA);
// FROM_LEFT: Hangul -> Hanja
// FROM_RIGHT: Hanja -> Hangul
ConversionDirection eDirection = toHanja ? ConversionDirection_FROM_LEFT : ConversionDirection_FROM_RIGHT;
sal_Int32 maxLength = toHanja ? maxLeftLength : maxRightLength;
if (maxLength == 0) maxLength = 1;
// search for a max length of convertible text
for (start = 0, end = 0; start < length; start++) {
if (end <= start) {
scriptType = checkScriptType(aText[nStartPos + start]);
if (nConversionType == TextConversionType::TO_HANJA) {
if (scriptType != SCRIPT_HANGUL) // skip non-Hangul characters
continue;
} else {
if (scriptType != SCRIPT_HANJA) // skip non-Hanja characters
continue;
}
end = start + 1;
}
if (nConversionOptions & TextConversionOption::CHARACTER_BY_CHARACTER) {
result.Candidates = getCharConversions(aText, nStartPos + start, len, toHanja); // char2char conversion
} else {
for (; end < length && end - start < maxLength; end++)
if (checkScriptType(aText[nStartPos + end]) != scriptType)
break;
for (len = end - start; len > 0; len--) {
if (len > 1) {
try {
if (xCDL.is())
result.Candidates = xCDL->queryConversions(aText, start + nStartPos, len,
aLocale, ConversionDictionaryType::HANGUL_HANJA, eDirection, nConversionOptions); // user dictionary
}
catch ( NoSupportException & ) {
// clear reference (when there is no user dictionary) in order
// to not always have to catch this exception again
// in further calls. (save time)
xCDL = 0;
}
catch (...) {
// catch all other exceptions to allow
// querying the system dictionary in the next line
}
if (xCD.is() && toHanja) { // System dictionary would not do Hanja_to_Hangul conversion.
candidates = xCD->getConversions(aText, start + nStartPos, len, eDirection, nConversionOptions);
result.Candidates += candidates;
}
} else if (! toHanja) { // do whole word character 2 character conversion for Hanja to Hangul conversion
result.Candidates = getCharConversions(aText, nStartPos + start, length - start, toHanja);
if (result.Candidates.hasElements())
len = result.Candidates[0].getLength();
}
if (result.Candidates.hasElements())
break;
}
}
// found match
if (result.Candidates.hasElements()) {
result.Boundary.startPos = start + nStartPos;;
result.Boundary.endPos = start + len + nStartPos;
return result;
}
}
} else
throw NoSupportException(); // Conversion type is not supported in this service.
return result;
}
OUString SAL_CALL
TextConversion_ko::getConversion( const OUString& aText, sal_Int32 nStartPos, sal_Int32 nLength,
const Locale& aLocale, sal_Int16 nConversionType, sal_Int32 nConversionOptions)
throw( RuntimeException, IllegalArgumentException, NoSupportException )
{
sal_Int32 length = aText.getLength() - nStartPos;
if (length <= 0 || nStartPos < 0)
return OUString();
else if (length > nLength)
length = nLength;
OUStringBuffer aBuf(length + 1);
TextConversionResult result;
const sal_Unicode *str = aText.getStr();
for (sal_Int32 start = nStartPos; length + nStartPos > start; start = result.Boundary.endPos) {
result = getConversions(aText, start, length + nStartPos - start, aLocale, nConversionType, nConversionOptions);
if (result.Boundary.endPos > 0) {
if (result.Boundary.startPos > start)
aBuf.append(str + start, result.Boundary.startPos - start); // append skip portion
aBuf.append(result.Candidates[0]); // append converted portion
} else {
if (length + nStartPos > start)
aBuf.append(str + start, length + nStartPos - start); // append last portion
break;
}
}
return aBuf.makeStringAndClear();
}
OUString SAL_CALL
TextConversion_ko::getConversionWithOffset( const OUString& aText, sal_Int32 nStartPos, sal_Int32 nLength,
const Locale& rLocale, sal_Int16 nConversionType, sal_Int32 nConversionOptions, Sequence<sal_Int32>& offset)
throw( RuntimeException, IllegalArgumentException, NoSupportException )
{
offset.realloc(0);
return getConversion(aText, nStartPos, nLength, rLocale, nConversionType, nConversionOptions);
}
sal_Bool SAL_CALL
TextConversion_ko::interactiveConversion( const Locale& /*rLocale*/, sal_Int16 /*nTextConversionType*/, sal_Int32 /*nTextConversionOptions*/ )
throw( RuntimeException, IllegalArgumentException, NoSupportException )
{
return sal_True;
}
} } } }
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|