|
sl@0
|
1 |
/*
|
|
sl@0
|
2 |
* Copyright (c) 2002-2004 Nokia Corporation and/or its subsidiary(-ies).
|
|
sl@0
|
3 |
* All rights reserved.
|
|
sl@0
|
4 |
* This component and the accompanying materials are made available
|
|
sl@0
|
5 |
* under the terms of the License "Eclipse Public License v1.0"
|
|
sl@0
|
6 |
* which accompanies this distribution, and is available
|
|
sl@0
|
7 |
* at the URL "http://www.eclipse.org/legal/epl-v10.html".
|
|
sl@0
|
8 |
*
|
|
sl@0
|
9 |
* Initial Contributors:
|
|
sl@0
|
10 |
* Nokia Corporation - initial contribution.
|
|
sl@0
|
11 |
*
|
|
sl@0
|
12 |
* Contributors:
|
|
sl@0
|
13 |
*
|
|
sl@0
|
14 |
* Description:
|
|
sl@0
|
15 |
*
|
|
sl@0
|
16 |
*/
|
|
sl@0
|
17 |
|
|
sl@0
|
18 |
|
|
sl@0
|
19 |
|
|
sl@0
|
20 |
|
|
sl@0
|
21 |
|
|
sl@0
|
22 |
|
|
sl@0
|
23 |
// INCLUDE FILES
|
|
sl@0
|
24 |
#include "SortUtilJapan.h"
|
|
sl@0
|
25 |
#include "SortUtilImpl.h"
|
|
sl@0
|
26 |
#include "SortUtilImplExport.h"
|
|
sl@0
|
27 |
#include <jplangutil.h>
|
|
sl@0
|
28 |
|
|
sl@0
|
29 |
// Unnamed namespace for local definitions
|
|
sl@0
|
30 |
namespace
|
|
sl@0
|
31 |
{
|
|
sl@0
|
32 |
|
|
sl@0
|
33 |
/**
|
|
sl@0
|
34 |
* Character classes for Japanese sorting, in sorting order.
|
|
sl@0
|
35 |
*/
|
|
sl@0
|
36 |
enum TJapaneseCharClass
|
|
sl@0
|
37 |
{
|
|
sl@0
|
38 |
ECharClassKana,
|
|
sl@0
|
39 |
ECharClassLatin,
|
|
sl@0
|
40 |
ECharClassDigit,
|
|
sl@0
|
41 |
ECharClassKanji,
|
|
sl@0
|
42 |
ECharClassSpecial
|
|
sl@0
|
43 |
};
|
|
sl@0
|
44 |
|
|
sl@0
|
45 |
/**
|
|
sl@0
|
46 |
* Returns the Japanese character class of aChar.
|
|
sl@0
|
47 |
*/
|
|
sl@0
|
48 |
TJapaneseCharClass CharClass(TUint aChar)
|
|
sl@0
|
49 |
{
|
|
sl@0
|
50 |
const TChar ch(aChar);
|
|
sl@0
|
51 |
// Special characters
|
|
sl@0
|
52 |
if (ch.IsSpace() || ch.IsPunctuation() || ch.IsControl()
|
|
sl@0
|
53 |
|| aChar >= 0xF0000 && aChar <= 0xFFFD)
|
|
sl@0
|
54 |
{
|
|
sl@0
|
55 |
return ECharClassSpecial;
|
|
sl@0
|
56 |
}
|
|
sl@0
|
57 |
// Digit
|
|
sl@0
|
58 |
else if (aChar >= '0' && aChar <= '9' ||
|
|
sl@0
|
59 |
aChar >= 0xFF10 && aChar <= 0xFF19)
|
|
sl@0
|
60 |
{
|
|
sl@0
|
61 |
return ECharClassDigit;
|
|
sl@0
|
62 |
}
|
|
sl@0
|
63 |
// Latin
|
|
sl@0
|
64 |
else if (aChar >= 'A' && aChar <= 'Z' ||
|
|
sl@0
|
65 |
aChar >= 'a' && aChar <= 'z' ||
|
|
sl@0
|
66 |
aChar >= 0x00C0 && aChar <= 0x1EF3 && aChar != 0x00D7 && aChar != 0x00F7 ||
|
|
sl@0
|
67 |
aChar >= 0xFF21 && aChar <= 0xFF3A ||
|
|
sl@0
|
68 |
aChar >= 0xFF41 && aChar <= 0xFF5A)
|
|
sl@0
|
69 |
{
|
|
sl@0
|
70 |
return ECharClassLatin;
|
|
sl@0
|
71 |
}
|
|
sl@0
|
72 |
// Kana
|
|
sl@0
|
73 |
else if (JPLangUtil::IsKatakana(static_cast<TText>(aChar)) ||
|
|
sl@0
|
74 |
JPLangUtil::IsHiragana(static_cast<TText>(aChar)))
|
|
sl@0
|
75 |
{
|
|
sl@0
|
76 |
return ECharClassKana;
|
|
sl@0
|
77 |
}
|
|
sl@0
|
78 |
// Kanji
|
|
sl@0
|
79 |
else if (JPLangUtil::IsKanji(static_cast<TText>(aChar)))
|
|
sl@0
|
80 |
{
|
|
sl@0
|
81 |
return ECharClassKanji;
|
|
sl@0
|
82 |
}
|
|
sl@0
|
83 |
// All other charcters are "special"
|
|
sl@0
|
84 |
else
|
|
sl@0
|
85 |
{
|
|
sl@0
|
86 |
return ECharClassSpecial;
|
|
sl@0
|
87 |
}
|
|
sl@0
|
88 |
}
|
|
sl@0
|
89 |
|
|
sl@0
|
90 |
/**
|
|
sl@0
|
91 |
* Compares two characters with Japanese comparison rules.
|
|
sl@0
|
92 |
*/
|
|
sl@0
|
93 |
TInt JapaneseCompareC(TUint aLhs, TUint aRhs)
|
|
sl@0
|
94 |
{
|
|
sl@0
|
95 |
// First compare character classes
|
|
sl@0
|
96 |
const TInt lhsCls = CharClass(aLhs);
|
|
sl@0
|
97 |
const TInt rhsCls = CharClass(aRhs);
|
|
sl@0
|
98 |
return lhsCls - rhsCls;
|
|
sl@0
|
99 |
}
|
|
sl@0
|
100 |
|
|
sl@0
|
101 |
/**
|
|
sl@0
|
102 |
* Compares two strings with Japanese comparison rules.
|
|
sl@0
|
103 |
*/
|
|
sl@0
|
104 |
TInt JapaneseCompareS(const TDesC& aLhs, const TDesC& aRhs)
|
|
sl@0
|
105 |
{
|
|
sl@0
|
106 |
TInt result = 0;
|
|
sl@0
|
107 |
|
|
sl@0
|
108 |
const TInt minLen = Min(aLhs.Length(), aRhs.Length());
|
|
sl@0
|
109 |
TInt i;
|
|
sl@0
|
110 |
TInt prevCompPos(0);
|
|
sl@0
|
111 |
for (i = 0; i < minLen && result == 0; ++i)
|
|
sl@0
|
112 |
{
|
|
sl@0
|
113 |
result = JapaneseCompareC(aLhs[i], aRhs[i]);
|
|
sl@0
|
114 |
if (result == 0)
|
|
sl@0
|
115 |
{
|
|
sl@0
|
116 |
TInt orgClass = CharClass(aLhs[i]);
|
|
sl@0
|
117 |
TPtrC lPart;
|
|
sl@0
|
118 |
TPtrC rPart;
|
|
sl@0
|
119 |
if (orgClass == ECharClassKana)
|
|
sl@0
|
120 |
{
|
|
sl@0
|
121 |
int j = i;
|
|
sl@0
|
122 |
for (; j < aLhs.Length(); ++j)
|
|
sl@0
|
123 |
{
|
|
sl@0
|
124 |
if (orgClass != CharClass(aLhs[j]))
|
|
sl@0
|
125 |
{
|
|
sl@0
|
126 |
break;
|
|
sl@0
|
127 |
}
|
|
sl@0
|
128 |
}
|
|
sl@0
|
129 |
lPart.Set(aLhs.Mid(prevCompPos, j - prevCompPos));
|
|
sl@0
|
130 |
for (j = i; j < aRhs.Length(); ++j)
|
|
sl@0
|
131 |
{
|
|
sl@0
|
132 |
if (orgClass != CharClass(aRhs[j]))
|
|
sl@0
|
133 |
{
|
|
sl@0
|
134 |
break;
|
|
sl@0
|
135 |
}
|
|
sl@0
|
136 |
}
|
|
sl@0
|
137 |
rPart.Set(aRhs.Mid(prevCompPos, j - prevCompPos));
|
|
sl@0
|
138 |
result = lPart.CompareC(rPart);
|
|
sl@0
|
139 |
if (result != 0)
|
|
sl@0
|
140 |
{
|
|
sl@0
|
141 |
const TInt minKanaLen = Min(lPart.Length(), rPart.Length());
|
|
sl@0
|
142 |
TPtrC lKanaPart(lPart.Left(minKanaLen));
|
|
sl@0
|
143 |
TPtrC rKanaPart(rPart.Left(minKanaLen));
|
|
sl@0
|
144 |
TInt resultKana = lKanaPart.MatchC(rKanaPart);
|
|
sl@0
|
145 |
if (resultKana == 0)
|
|
sl@0
|
146 |
{
|
|
sl@0
|
147 |
TInt maxKanaLen = i+minKanaLen;
|
|
sl@0
|
148 |
if (i+minKanaLen+1 >= minLen)
|
|
sl@0
|
149 |
{
|
|
sl@0
|
150 |
if (maxKanaLen < aLhs.Length()
|
|
sl@0
|
151 |
|| maxKanaLen < aRhs.Length())
|
|
sl@0
|
152 |
{
|
|
sl@0
|
153 |
result = 0;
|
|
sl@0
|
154 |
i += (minKanaLen-1);
|
|
sl@0
|
155 |
}
|
|
sl@0
|
156 |
else
|
|
sl@0
|
157 |
{
|
|
sl@0
|
158 |
result = lKanaPart.CompareC(rKanaPart);;
|
|
sl@0
|
159 |
}
|
|
sl@0
|
160 |
}
|
|
sl@0
|
161 |
else
|
|
sl@0
|
162 |
{
|
|
sl@0
|
163 |
result = 0;
|
|
sl@0
|
164 |
i += (minKanaLen-1);
|
|
sl@0
|
165 |
}
|
|
sl@0
|
166 |
}
|
|
sl@0
|
167 |
}
|
|
sl@0
|
168 |
|
|
sl@0
|
169 |
}
|
|
sl@0
|
170 |
else
|
|
sl@0
|
171 |
{
|
|
sl@0
|
172 |
lPart.Set(aLhs.Mid(i, 1));
|
|
sl@0
|
173 |
rPart.Set(aRhs.Mid(i, 1));
|
|
sl@0
|
174 |
result = lPart.CompareC(rPart);
|
|
sl@0
|
175 |
}
|
|
sl@0
|
176 |
}
|
|
sl@0
|
177 |
else
|
|
sl@0
|
178 |
{
|
|
sl@0
|
179 |
prevCompPos = i;
|
|
sl@0
|
180 |
}
|
|
sl@0
|
181 |
}
|
|
sl@0
|
182 |
if (result == 0)
|
|
sl@0
|
183 |
{
|
|
sl@0
|
184 |
if (i < aLhs.Length())
|
|
sl@0
|
185 |
{
|
|
sl@0
|
186 |
// aLhs is longer than aRhs
|
|
sl@0
|
187 |
result += User::Collate(aLhs[i]);
|
|
sl@0
|
188 |
}
|
|
sl@0
|
189 |
if (i < aRhs.Length())
|
|
sl@0
|
190 |
{
|
|
sl@0
|
191 |
// aRhs is longer that aLhs
|
|
sl@0
|
192 |
result -= User::Collate(aRhs[i]);
|
|
sl@0
|
193 |
}
|
|
sl@0
|
194 |
}
|
|
sl@0
|
195 |
return result;
|
|
sl@0
|
196 |
}
|
|
sl@0
|
197 |
} // namespace
|
|
sl@0
|
198 |
|
|
sl@0
|
199 |
// Only export in DLL
|
|
sl@0
|
200 |
EXPORT_C MSortUtil* SortUtilFactoryFunctionL()
|
|
sl@0
|
201 |
{
|
|
sl@0
|
202 |
MSortUtil* util = new (ELeave) TSortUtilJapan;
|
|
sl@0
|
203 |
return util;
|
|
sl@0
|
204 |
}
|
|
sl@0
|
205 |
|
|
sl@0
|
206 |
inline TSortUtilJapan::TSortUtilJapan()
|
|
sl@0
|
207 |
{
|
|
sl@0
|
208 |
}
|
|
sl@0
|
209 |
|
|
sl@0
|
210 |
TSortUtilJapan::~TSortUtilJapan()
|
|
sl@0
|
211 |
{
|
|
sl@0
|
212 |
}
|
|
sl@0
|
213 |
|
|
sl@0
|
214 |
TInt TSortUtilJapan::CompareItems
|
|
sl@0
|
215 |
(const MSortKeyArray& aLhs,
|
|
sl@0
|
216 |
const MSortKeyArray& aRhs) const
|
|
sl@0
|
217 |
{
|
|
sl@0
|
218 |
TInt result(0);
|
|
sl@0
|
219 |
TInt lhsIndex(0);
|
|
sl@0
|
220 |
TInt rhsIndex(0);
|
|
sl@0
|
221 |
|
|
sl@0
|
222 |
// Compare only pronounciation keys in the first pass
|
|
sl@0
|
223 |
do
|
|
sl@0
|
224 |
{
|
|
sl@0
|
225 |
const TDesC& lhsText =
|
|
sl@0
|
226 |
SortUtilImpl::FindNextNonEmptyKey(aLhs, ESortKeyPronounciation, lhsIndex);
|
|
sl@0
|
227 |
const TDesC& rhsText =
|
|
sl@0
|
228 |
SortUtilImpl::FindNextNonEmptyKey(aRhs, ESortKeyPronounciation, rhsIndex);
|
|
sl@0
|
229 |
if (lhsText.Length() > 0)
|
|
sl@0
|
230 |
{
|
|
sl@0
|
231 |
// lhs has pronounciation key
|
|
sl@0
|
232 |
if (rhsText.Length() > 0)
|
|
sl@0
|
233 |
{
|
|
sl@0
|
234 |
// Both lhs and rhs have pronounciation key: compare the key texts
|
|
sl@0
|
235 |
result = JapaneseCompareS(lhsText, rhsText);
|
|
sl@0
|
236 |
}
|
|
sl@0
|
237 |
else
|
|
sl@0
|
238 |
{
|
|
sl@0
|
239 |
// Only lhs has pronounciation key
|
|
sl@0
|
240 |
result = -1;
|
|
sl@0
|
241 |
}
|
|
sl@0
|
242 |
}
|
|
sl@0
|
243 |
else
|
|
sl@0
|
244 |
{
|
|
sl@0
|
245 |
// lhs does not have pronounciation key
|
|
sl@0
|
246 |
if (rhsText.Length() > 0)
|
|
sl@0
|
247 |
{
|
|
sl@0
|
248 |
// Only rhs has pronounciation key
|
|
sl@0
|
249 |
result = 1;
|
|
sl@0
|
250 |
}
|
|
sl@0
|
251 |
}
|
|
sl@0
|
252 |
|
|
sl@0
|
253 |
if (result != 0)
|
|
sl@0
|
254 |
{
|
|
sl@0
|
255 |
return result;
|
|
sl@0
|
256 |
}
|
|
sl@0
|
257 |
}
|
|
sl@0
|
258 |
while (lhsIndex <= aLhs.SortKeyCount() && rhsIndex < aRhs.SortKeyCount());
|
|
sl@0
|
259 |
|
|
sl@0
|
260 |
// No difference found with pronounciation keys: compare basic keys
|
|
sl@0
|
261 |
lhsIndex = 0;
|
|
sl@0
|
262 |
rhsIndex = 0;
|
|
sl@0
|
263 |
do
|
|
sl@0
|
264 |
{
|
|
sl@0
|
265 |
const TDesC& lhsText =
|
|
sl@0
|
266 |
SortUtilImpl::FindNextNonEmptyKey(aLhs, ESortKeyBasic, lhsIndex);
|
|
sl@0
|
267 |
const TDesC& rhsText =
|
|
sl@0
|
268 |
SortUtilImpl::FindNextNonEmptyKey(aRhs, ESortKeyBasic, rhsIndex);
|
|
sl@0
|
269 |
result = JapaneseCompareS(lhsText, rhsText);
|
|
sl@0
|
270 |
if (result != 0)
|
|
sl@0
|
271 |
{
|
|
sl@0
|
272 |
return result;
|
|
sl@0
|
273 |
}
|
|
sl@0
|
274 |
}
|
|
sl@0
|
275 |
while (lhsIndex <= aLhs.SortKeyCount() && rhsIndex < aRhs.SortKeyCount());
|
|
sl@0
|
276 |
|
|
sl@0
|
277 |
return result;
|
|
sl@0
|
278 |
}
|
|
sl@0
|
279 |
|
|
sl@0
|
280 |
// End of file
|