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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#include <indexentrysupplier_default.hxx>
#include <collatorImpl.hxx>
#include <localedata.hxx>
#include <i18nutil/unicode.hxx>
#include <com/sun/star/i18n/CollatorOptions.hpp>
#include <o3tl/temporary.hxx>
using namespace ::com::sun::star;
using namespace ::com::sun::star::uno;
using namespace ::com::sun::star::i18n;
using namespace ::com::sun::star::lang;
namespace i18npool {
IndexEntrySupplier_Unicode::IndexEntrySupplier_Unicode(
const css::uno::Reference < css::uno::XComponentContext >& rxContext ) :
IndexEntrySupplier_Common(rxContext)
{
implementationName = "com.sun.star.i18n.IndexEntrySupplier_Unicode";
index.reset( new Index(rxContext) );
}
IndexEntrySupplier_Unicode::~IndexEntrySupplier_Unicode()
{
}
sal_Bool SAL_CALL IndexEntrySupplier_Unicode::loadAlgorithm( const lang::Locale& rLocale,
const OUString& rAlgorithm, sal_Int32 collatorOptions )
{
index->init(rLocale, rAlgorithm);
return IndexEntrySupplier_Common::loadAlgorithm(rLocale, rAlgorithm, collatorOptions);
}
OUString SAL_CALL IndexEntrySupplier_Unicode::getIndexKey( const OUString& rIndexEntry,
const OUString& rPhoneticEntry, const lang::Locale& rLocale )
{
return index->getIndexDescription(getEntry(rIndexEntry, rPhoneticEntry, rLocale));
}
sal_Int16 SAL_CALL IndexEntrySupplier_Unicode::compareIndexEntry(
const OUString& rIndexEntry1, const OUString& rPhoneticEntry1, const lang::Locale& rLocale1,
const OUString& rIndexEntry2, const OUString& rPhoneticEntry2, const lang::Locale& rLocale2 )
{
sal_Int16 result =
index->getIndexWeight(getEntry(rIndexEntry1, rPhoneticEntry1, rLocale1)) -
index->getIndexWeight(getEntry(rIndexEntry2, rPhoneticEntry2, rLocale2));
if (result == 0)
return IndexEntrySupplier_Common::compareIndexEntry(
rIndexEntry1, rPhoneticEntry1, rLocale1,
rIndexEntry2, rPhoneticEntry2, rLocale2);
return result > 0 ? 1 : -1;
}
OUString SAL_CALL IndexEntrySupplier_Unicode::getIndexCharacter( const OUString& rIndexEntry,
const lang::Locale& rLocale, const OUString& rAlgorithm ) {
if (loadAlgorithm( rLocale, rAlgorithm, CollatorOptions::CollatorOptions_IGNORE_CASE_ACCENT))
return index->getIndexDescription(rIndexEntry);
else
return IndexEntrySupplier_Common::getIndexCharacter(rIndexEntry, rLocale, rAlgorithm);
}
IndexTable::IndexTable()
: start(0)
, end(0)
, table(nullptr)
{
}
IndexTable::~IndexTable()
{
if (table) free(table);
}
void IndexTable::init(sal_Unicode start_, sal_Unicode end_, IndexKey const *keys, sal_Int16 key_count, Index *index)
{
start=start_;
end=end_;
table = static_cast<sal_uInt8*>(malloc((end-start+1)*sizeof(sal_uInt8)));
for (sal_Unicode i = start; i <= end; i++) {
sal_Int16 j;
for (j = 0; j < key_count; j++) {
if (keys[j].key > 0 && (i == keys[j].key || index->compare(i, keys[j].key) == 0)) {
table[i-start] = sal::static_int_cast<sal_uInt8>(j);
break;
}
}
if (j == key_count)
table[i-start] = 0xFF;
}
}
Index::Index(const css::uno::Reference < css::uno::XComponentContext >& rxContext)
: table_count(0)
, key_count(0)
, mkey_count(0)
, collator( new CollatorImpl(rxContext) )
{
}
Index::~Index()
{
}
sal_Int16 Index::compare(sal_Unicode c1, sal_Unicode c2)
{
return sal::static_int_cast<sal_Int16>( collator->compareString(OUString(&c1, 1), OUString(&c2, 1)) );
}
sal_Int16 Index::getIndexWeight(const OUString& rIndexEntry)
{
sal_Int32 startPos=0;
if (!skipping_chars.isEmpty())
while (skipping_chars.indexOf(rIndexEntry[startPos]) >= 0)
startPos++;
if (mkey_count > 0) {
for (sal_Int16 i = 0; i < mkey_count; i++) {
sal_Int32 len = keys[mkeys[i]].mkey.getLength();
if (collator->compareSubstring(rIndexEntry, startPos, len,
keys[mkeys[i]].mkey, 0, len) == 0)
return mkeys[i];
}
}
sal_Unicode code = startPos < rIndexEntry.getLength() ? rIndexEntry[startPos] : 0;
for (sal_Int16 i = 0; i < table_count; i++) {
if (tables[i].start <= code && code <= tables[i].end)
return tables[i].table[code-tables[i].start];
}
return 0xFF;
}
OUString Index::getIndexDescription(const OUString& rIndexEntry)
{
sal_Int16 wgt = getIndexWeight(rIndexEntry);
if (wgt < MAX_KEYS) {
if (!keys[wgt].desc.isEmpty())
return keys[wgt].desc;
else if (keys[wgt].key > 0)
return OUString(&keys[wgt].key, 1);
else
return keys[wgt].mkey;
}
sal_uInt32 indexChar=rIndexEntry.iterateCodePoints(&o3tl::temporary(sal_Int32(0)), 0);
return OUString(&indexChar, 1);
}
#define LOCALE_EN lang::Locale("en", OUString(), OUString())
void Index::makeIndexKeys(const lang::Locale &rLocale, std::u16string_view algorithm)
{
OUString keyStr = LocaleDataImpl::get()->getIndexKeysByAlgorithm(rLocale, algorithm);
if (keyStr.isEmpty()) {
keyStr = LocaleDataImpl::get()->getIndexKeysByAlgorithm(LOCALE_EN,
LocaleDataImpl::get()->getDefaultIndexAlgorithm(LOCALE_EN));
if (keyStr.isEmpty())
throw RuntimeException(
"Index::makeIndexKeys: No index keys returned by algorithm");
}
sal_Int16 len = sal::static_int_cast<sal_Int16>( keyStr.getLength() );
mkey_count=key_count=0;
skipping_chars=OUString();
sal_Int16 i, j;
for (i = 0; i < len && key_count < MAX_KEYS; i++)
{
sal_Unicode curr = keyStr[i];
sal_Unicode close = ')';
if (unicode::isWhiteSpace(curr))
continue;
switch(curr) {
case u'-': {
if (key_count <= 0 || i + 1 >= len)
throw RuntimeException("Index::makeIndexKeys: key_count<=0||"
"'-' is the last char of KeyString");
for (curr = keyStr[++i]; key_count < MAX_KEYS && keys[key_count-1].key < curr; key_count++) {
keys[key_count].key = keys[key_count-1].key+1;
keys[key_count].desc.clear();
}
break;
}
case u'[':
for (i++; i < len && keyStr[i] != ']'; i++) {
if (unicode::isWhiteSpace(keyStr[i])) {
continue;
} else if (keyStr[i] == '_') {
for (curr=keyStr[i-1]+1; curr <= keyStr[i+1]; curr++)
skipping_chars+=OUStringChar(curr);
i+=2;
} else {
skipping_chars+=OUStringChar(keyStr[i]);
}
}
break;
case u'{':
close = '}';
[[fallthrough]];
case u'(': {
if (key_count <= 0)
throw RuntimeException("Index::makeIndexKeys: key_count<=0");
sal_Int16 end = i+1;
for (; end < len && keyStr[end] != close; end++) ;
if (end >= len) // no found
throw RuntimeException("Index::makeIndexKeys: Closing bracket not found");
if (close == ')')
keys[key_count-1].desc = keyStr.copy(i+1, end-i-1);
else {
mkeys[mkey_count++]=key_count;
keys[key_count].key = 0;
keys[key_count].mkey = keyStr.copy(i+1, end-i-1);
keys[key_count++].desc.clear();
}
i=end+1;
break;
}
default:
keys[key_count].key = curr;
keys[key_count++].desc.clear();
break;
}
}
for (i = 0; i < mkey_count; i++) {
for (j=i+1; j < mkey_count; j++) {
if (keys[mkeys[i]].mkey.getLength() < keys[mkeys[j]].mkey.getLength()) {
sal_Int16 k = mkeys[i];
mkeys[i] = mkeys[j];
mkeys[j] = k;
}
}
}
}
void Index::init(const lang::Locale &rLocale, const OUString& algorithm)
{
makeIndexKeys(rLocale, algorithm);
Sequence< UnicodeScript > scriptList = LocaleDataImpl::get()->getUnicodeScripts( rLocale );
if (!scriptList.hasElements()) {
scriptList = LocaleDataImpl::get()->getUnicodeScripts(LOCALE_EN);
if (!scriptList.hasElements())
throw RuntimeException("Index::init: scriptList is empty");
}
table_count = sal::static_int_cast<sal_Int16>( scriptList.getLength() );
if (table_count > MAX_TABLES)
throw RuntimeException("Index::init: Length of scriptList is too big");
collator->loadCollatorAlgorithm(algorithm, rLocale, CollatorOptions::CollatorOptions_IGNORE_CASE_ACCENT);
sal_Int16 j=0;
sal_Unicode start = unicode::getUnicodeScriptStart(UnicodeScript(0));
sal_Unicode end = unicode::getUnicodeScriptEnd(UnicodeScript(0));
for (sal_Int32 i= (scriptList[0] == UnicodeScript(0)) ? 1 : 0; i< scriptList.getLength(); i++) {
if (unicode::getUnicodeScriptStart(scriptList[i]) != end+1) {
tables[j++].init(start, end, keys, key_count, this);
start = unicode::getUnicodeScriptStart(scriptList[i]);
}
end = unicode::getUnicodeScriptEnd(scriptList[i]);
}
tables[j++].init(start, end, keys, key_count, this);
table_count = j;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
