164 lines
4.6 KiB
C++
164 lines
4.6 KiB
C++
/*************************************************************************
|
|
*
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
*
|
|
* Copyright 2008 by Sun Microsystems, Inc.
|
|
*
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
|
*
|
|
* $RCSfile: oneToOneMapping.cxx,v $
|
|
* $Revision: 1.6 $
|
|
*
|
|
* 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 <i18nutil/oneToOneMapping.hxx>
|
|
|
|
namespace com { namespace sun { namespace star { namespace i18n {
|
|
|
|
oneToOneMapping::oneToOneMapping( OneToOneMappingTable_t *rpTable, const size_t rnBytes, const size_t rnUnitSize )
|
|
: mpTable( rpTable ),
|
|
mnSize( rnBytes / rnUnitSize )
|
|
{
|
|
}
|
|
|
|
oneToOneMapping::~oneToOneMapping()
|
|
{
|
|
}
|
|
|
|
sal_Unicode oneToOneMapping::find(const sal_Unicode nKey) const
|
|
{
|
|
if( mpTable )
|
|
{
|
|
// binary search
|
|
int bottom = 0;
|
|
int top = mnSize - 1;
|
|
int current;
|
|
|
|
for (;;) {
|
|
current = (top + bottom) / 2;
|
|
if( nKey < mpTable[current].first )
|
|
top = current - 1;
|
|
else if( nKey > mpTable[current].first )
|
|
bottom = current + 1;
|
|
else
|
|
return mpTable[current].second;
|
|
|
|
if( bottom > top )
|
|
return sal_Unicode( nKey );
|
|
}
|
|
}
|
|
else
|
|
return sal_Unicode( nKey );
|
|
}
|
|
|
|
oneToOneMappingWithFlag::oneToOneMappingWithFlag( UnicodePairWithFlag *rpTableWF, const size_t rnSize, const UnicodePairFlag rnFlag )
|
|
: oneToOneMapping( NULL, rnSize, sizeof(UnicodePairWithFlag) ),
|
|
mpTableWF ( rpTableWF ),
|
|
mnFlag ( rnFlag ),
|
|
mbHasIndex( sal_False )
|
|
{
|
|
}
|
|
|
|
oneToOneMappingWithFlag::~oneToOneMappingWithFlag()
|
|
{
|
|
if( mbHasIndex )
|
|
for( int i = 0; i < 256; i++ )
|
|
if( mpIndex[i] )
|
|
delete [] mpIndex[i];
|
|
}
|
|
|
|
|
|
void oneToOneMappingWithFlag::makeIndex()
|
|
{
|
|
if( !mbHasIndex && mpTableWF )
|
|
{
|
|
int i, j, high, low, current = -1;
|
|
|
|
for( i = 0; i < 256; i++ )
|
|
mpIndex[i] = NULL;
|
|
|
|
for( size_t k = 0; k < mnSize; k++ )
|
|
{
|
|
high = (mpTableWF[k].first >> 8) & 0xFF;
|
|
low = (mpTableWF[k].first) & 0xFF;
|
|
if( high != current )
|
|
{
|
|
current = high;
|
|
mpIndex[high] = new UnicodePairWithFlag*[256];
|
|
|
|
for( j = 0; j < 256; j++ )
|
|
mpIndex[high][j] = NULL;
|
|
}
|
|
mpIndex[high][low] = &mpTableWF[k];
|
|
}
|
|
|
|
mbHasIndex = sal_True;
|
|
}
|
|
}
|
|
|
|
sal_Unicode oneToOneMappingWithFlag::find( const sal_Unicode nKey ) const
|
|
{
|
|
if( mpTableWF )
|
|
{
|
|
if( mbHasIndex )
|
|
{
|
|
// index search
|
|
int high, low;
|
|
high = (nKey >> 8) & 0xFF;
|
|
low = nKey & 0xFF;
|
|
if( mpIndex[high] != NULL &&
|
|
mpIndex[high][low] != NULL &&
|
|
mpIndex[high][low]->flag & mnFlag )
|
|
return mpIndex[high][low]->second;
|
|
else
|
|
return sal_Unicode( nKey );
|
|
}
|
|
else
|
|
{
|
|
// binary search
|
|
int bottom = 0;
|
|
int top = mnSize - 1;
|
|
int current;
|
|
|
|
for (;;) {
|
|
current = (top + bottom) / 2;
|
|
if( nKey < mpTableWF[current].first )
|
|
top = current - 1;
|
|
else if( nKey > mpTableWF[current].first )
|
|
bottom = current + 1;
|
|
else
|
|
{
|
|
if( mpTableWF[current].flag & mnFlag )
|
|
return mpTableWF[current].second;
|
|
else
|
|
return sal_Unicode( nKey );
|
|
}
|
|
|
|
if( bottom > top )
|
|
return sal_Unicode( nKey );
|
|
}
|
|
}
|
|
}
|
|
else
|
|
return sal_Unicode( nKey );
|
|
}
|
|
|
|
|
|
} } } }
|