1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
21 // prevent internal compiler error with MSVC6SP3
24 #include <i18nutil/oneToOneMapping.hxx>
25 #include <i18nutil/casefolding.hxx>
26 #include "transliteration_caseignore.hxx"
28 using namespace ::com::sun::star::uno
;
29 using namespace ::com::sun::star::lang
;
30 using namespace ::rtl
;
32 namespace com
{ namespace sun
{ namespace star
{ namespace i18n
{
34 Transliteration_caseignore::Transliteration_caseignore()
36 nMappingType
= MappingTypeFullFolding
;
37 moduleLoaded
= (TransliterationModules
)0;
38 transliterationName
= "case ignore (generic)";
39 implementationName
= "com.sun.star.i18n.Transliteration.Transliteration_caseignore";
43 Transliteration_caseignore::loadModule( TransliterationModules modName
, const Locale
& rLocale
)
44 throw(RuntimeException
)
46 moduleLoaded
= (TransliterationModules
) (moduleLoaded
|modName
);
50 sal_Int16 SAL_CALL
Transliteration_caseignore::getType() throw(RuntimeException
)
52 // It's NOT TransliterationType::ONE_TO_ONE because it's using casefolding
53 return TransliterationType::IGNORE
;
57 Sequence
< OUString
> SAL_CALL
58 Transliteration_caseignore::transliterateRange( const OUString
& str1
, const OUString
& str2
)
59 throw( RuntimeException
)
61 if (str1
.getLength() != 1 || str2
.getLength() != 1)
62 throw RuntimeException();
64 static Transliteration_u2l u2l
;
65 static Transliteration_l2u l2u
;
67 u2l
.loadModule((TransliterationModules
)0, aLocale
);
68 l2u
.loadModule((TransliterationModules
)0, aLocale
);
70 OUString l1
= u2l
.transliterateString2String(str1
, 0, str1
.getLength());
71 OUString u1
= l2u
.transliterateString2String(str1
, 0, str1
.getLength());
72 OUString l2
= u2l
.transliterateString2String(str2
, 0, str2
.getLength());
73 OUString u2
= l2u
.transliterateString2String(str2
, 0, str2
.getLength());
75 if ((l1
== u1
) && (l2
== u2
)) {
76 Sequence
< OUString
> r(2);
81 Sequence
< OUString
> r(4);
91 Transliteration_caseignore::equals(
92 const OUString
& str1
, sal_Int32 pos1
, sal_Int32 nCount1
, sal_Int32
& nMatch1
,
93 const OUString
& str2
, sal_Int32 pos2
, sal_Int32 nCount2
, sal_Int32
& nMatch2
)
94 throw(::com::sun::star::uno::RuntimeException
)
96 return (compare(str1
, pos1
, nCount1
, nMatch1
, str2
, pos2
, nCount2
, nMatch2
) == 0);
100 Transliteration_caseignore::compareSubstring(
101 const OUString
& str1
, sal_Int32 off1
, sal_Int32 len1
,
102 const OUString
& str2
, sal_Int32 off2
, sal_Int32 len2
)
103 throw(RuntimeException
)
105 sal_Int32 nMatch1
, nMatch2
;
106 return compare(str1
, off1
, len1
, nMatch1
, str2
, off2
, len2
, nMatch2
);
111 Transliteration_caseignore::compareString(
112 const OUString
& str1
,
113 const OUString
& str2
)
114 throw(RuntimeException
)
116 sal_Int32 nMatch1
, nMatch2
;
117 return compare(str1
, 0, str1
.getLength(), nMatch1
, str2
, 0, str2
.getLength(), nMatch2
);
121 Transliteration_caseignore::compare(
122 const OUString
& str1
, sal_Int32 pos1
, sal_Int32 nCount1
, sal_Int32
& nMatch1
,
123 const OUString
& str2
, sal_Int32 pos2
, sal_Int32 nCount2
, sal_Int32
& nMatch2
)
124 throw(RuntimeException
)
126 const sal_Unicode
*unistr1
= (sal_Unicode
*) str1
.getStr() + pos1
;
127 const sal_Unicode
*unistr2
= (sal_Unicode
*) str2
.getStr() + pos2
;
129 MappingElement e1
, e2
;
130 nMatch1
= nMatch2
= 0;
132 #define NOT_END_OF_STR1 (nMatch1 < nCount1 || e1.current < e1.element.nmap)
133 #define NOT_END_OF_STR2 (nMatch2 < nCount2 || e2.current < e2.element.nmap)
135 while (NOT_END_OF_STR1
&& NOT_END_OF_STR2
) {
136 c1
= casefolding::getNextChar(unistr1
, nMatch1
, nCount1
, e1
, aLocale
, nMappingType
, moduleLoaded
);
137 c2
= casefolding::getNextChar(unistr2
, nMatch2
, nCount2
, e2
, aLocale
, nMappingType
, moduleLoaded
);
139 nMatch1
--; nMatch2
--;
140 return c1
> c2
? 1 : -1;
144 return (!NOT_END_OF_STR1
&& !NOT_END_OF_STR2
) ? 0
145 : (NOT_END_OF_STR1
? 1 : -1);
150 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */