office-gobmx/i18npool/source/transliteration/transliteration_Ignore.cxx
Luboš Luňák 81e16cea9a mvoe rtl_(u)string_alloc to sal
No point in hidding something useful like this in some helper lib.

Change-Id: I7332d7f6bd428378cd19e7e95ad130771a541140
2012-12-06 13:35:18 +01:00

211 lines
6.7 KiB
C++

/* -*- 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 <utility>
#include <comphelper/string.hxx>
#include <transliteration_Ignore.hxx>
using namespace com::sun::star::uno;
using ::rtl::OUString;
namespace com { namespace sun { namespace star { namespace i18n {
inline sal_Int32 Min( sal_Int32 a, sal_Int32 b ) { return a > b ? b : a; }
sal_Bool SAL_CALL
transliteration_Ignore::equals(const OUString& str1, sal_Int32 pos1, sal_Int32 nCount1, sal_Int32& nMatch1,
const OUString& str2, sal_Int32 pos2, sal_Int32 nCount2, sal_Int32& nMatch2 ) throw(RuntimeException)
{
Sequence< sal_Int32 > offset1;
Sequence< sal_Int32 > offset2;
// The method folding is defined in a sub class.
OUString s1 = this->folding( str1, pos1, nCount1, offset1);
OUString s2 = this->folding( str2, pos2, nCount2, offset2);
const sal_Unicode * p1 = s1.getStr();
const sal_Unicode * p2 = s2.getStr();
sal_Int32 length = Min(s1.getLength(), s2.getLength());
sal_Int32 nmatch;
for ( nmatch = 0; nmatch < length; nmatch++)
if (*p1++ != *p2++)
break;
if (nmatch > 0) {
nMatch1 = offset1[ nmatch - 1 ] + 1; // Subtract 1 from nmatch because the index starts from zero.
nMatch2 = offset2[ nmatch - 1 ] + 1; // And then, add 1 to position because it means the number of character matched.
}
else {
nMatch1 = 0; // No character was matched.
nMatch2 = 0;
}
return (nmatch == s1.getLength()) && (nmatch == s2.getLength());
}
Sequence< OUString > SAL_CALL
transliteration_Ignore::transliterateRange( const OUString& str1, const OUString& str2 ) throw(RuntimeException)
{
if (str1.isEmpty() || str2.isEmpty())
throw RuntimeException();
Sequence< OUString > r(2);
r[0] = str1.copy(0, 1);
r[1] = str2.copy(0, 1);
return r;
}
sal_Int16 SAL_CALL
transliteration_Ignore::getType() throw(RuntimeException)
{
// The type is also defined in com/sun/star/util/TransliterationType.hdl
return TransliterationType::IGNORE;
}
OUString SAL_CALL
transliteration_Ignore::transliterate( const OUString& inStr, sal_Int32 startPos, sal_Int32 nCount,
Sequence< sal_Int32 >& offset ) throw(RuntimeException)
{
// The method folding is defined in a sub class.
return this->folding( inStr, startPos, nCount, offset);
}
Sequence< OUString > SAL_CALL
transliteration_Ignore::transliterateRange( const OUString& str1, const OUString& str2,
XTransliteration& t1, XTransliteration& t2 ) throw(RuntimeException)
{
if (str1.isEmpty() || str2.isEmpty())
throw RuntimeException();
Sequence< sal_Int32 > offset;
OUString s11 = t1.transliterate( str1, 0, 1, offset );
OUString s12 = t1.transliterate( str2, 0, 1, offset );
OUString s21 = t2.transliterate( str1, 0, 1, offset );
OUString s22 = t2.transliterate( str2, 0, 1, offset );
if ( (s11 == s21) && (s12 == s22) ) {
Sequence< OUString > r(2);
r[0] = s11;
r[1] = s12;
return r;
}
Sequence< OUString > r(4);
r[0] = s11;
r[1] = s12;
r[2] = s21;
r[3] = s22;
return r;
}
OUString SAL_CALL
transliteration_Ignore::folding( const OUString& inStr, sal_Int32 startPos,
sal_Int32 nCount, Sequence< sal_Int32 >& offset)
throw(RuntimeException)
{
// Create a string buffer which can hold nCount + 1 characters.
// The reference count is 1 now.
rtl_uString * newStr = rtl_uString_alloc(nCount);
sal_Unicode * dst = newStr->buffer;
const sal_Unicode * src = inStr.getStr() + startPos;
// Allocate nCount length to offset argument.
sal_Int32 *p = 0;
sal_Int32 position = 0;
if (useOffset) {
offset.realloc( nCount );
p = offset.getArray();
position = startPos;
}
if (map) {
sal_Unicode previousChar = *src ++;
sal_Unicode currentChar;
// Translation
while (-- nCount > 0) {
currentChar = *src ++;
Mapping *m;
for (m = map; m->replaceChar; m++) {
if (previousChar == m->previousChar && currentChar == m->currentChar ) {
if (useOffset) {
if (! m->two2one)
*p++ = position;
position++;
*p++ = position++;
}
*dst++ = m->replaceChar;
if (!m->two2one)
*dst++ = currentChar;
previousChar = *src++;
nCount--;
break;
}
}
if (! m->replaceChar) {
if (useOffset)
*p ++ = position ++;
*dst ++ = previousChar;
previousChar = currentChar;
}
}
if (nCount == 0) {
if (useOffset)
*p = position;
*dst ++ = previousChar;
}
} else {
// Translation
while (nCount -- > 0) {
sal_Unicode c = *src++;
c = func ? func( c) : (*table)[ c ];
if (c != 0xffff)
*dst ++ = c;
if (useOffset) {
if (c != 0xffff)
*p ++ = position;
position++;
}
}
}
newStr->length = sal_Int32(dst - newStr->buffer);
if (useOffset)
offset.realloc(newStr->length);
*dst = (sal_Unicode) 0;
return OUString(newStr, SAL_NO_ACQUIRE); // take ownership
}
sal_Unicode SAL_CALL
transliteration_Ignore::transliterateChar2Char( sal_Unicode inChar) throw(RuntimeException, MultipleCharsOutputException)
{
return func ? func( inChar) : table ? (*table)[ inChar ] : inChar;
}
} } } }
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */