e54777276d
Change-Id: Idaeed33df4f1dd1b2acbdaf8a895c5d56c3ca14c Reviewed-on: https://gerrit.libreoffice.org/c/core/+/99980 Tested-by: Jenkins Reviewed-by: Noel Grandin <noel.grandin@collabora.co.uk>
145 lines
4 KiB
C++
145 lines
4 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 <i18nutil/oneToOneMapping.hxx>
|
|
|
|
namespace i18nutil {
|
|
|
|
oneToOneMapping::oneToOneMapping( OneToOneMappingTable_t const *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;
|
|
|
|
for (;;) {
|
|
const int 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 nKey;
|
|
}
|
|
}
|
|
else
|
|
return nKey;
|
|
}
|
|
|
|
oneToOneMappingWithFlag::oneToOneMappingWithFlag( UnicodePairWithFlag const *rpTableWF, const size_t rnSize, const UnicodePairFlag rnFlag )
|
|
: oneToOneMapping( nullptr, rnSize, sizeof(UnicodePairWithFlag) ),
|
|
mpTableWF ( rpTableWF ),
|
|
mnFlag ( rnFlag ),
|
|
mbHasIndex( false )
|
|
{
|
|
}
|
|
|
|
oneToOneMappingWithFlag::~oneToOneMappingWithFlag()
|
|
{
|
|
}
|
|
|
|
void oneToOneMappingWithFlag::makeIndex()
|
|
{
|
|
if( mbHasIndex || !mpTableWF )
|
|
return;
|
|
|
|
int current = -1;
|
|
|
|
for( size_t k = 0; k < mnSize; k++ )
|
|
{
|
|
const int high = (mpTableWF[k].first >> 8) & 0xFF;
|
|
const int low = (mpTableWF[k].first) & 0xFF;
|
|
if( high != current )
|
|
{
|
|
current = high;
|
|
mpIndex[high].reset(new UnicodePairWithFlag const *[256]);
|
|
|
|
for (int j = 0; j < 256; ++j)
|
|
mpIndex[high][j] = nullptr;
|
|
}
|
|
mpIndex[high][low] = &mpTableWF[k];
|
|
}
|
|
|
|
mbHasIndex = 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] != nullptr &&
|
|
mpIndex[high][low] != nullptr &&
|
|
mpIndex[high][low]->flag & mnFlag )
|
|
return mpIndex[high][low]->second;
|
|
else
|
|
return nKey;
|
|
}
|
|
else
|
|
{
|
|
// binary search
|
|
int bottom = 0;
|
|
int top = mnSize - 1;
|
|
|
|
for (;;) {
|
|
const int 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 nKey;
|
|
}
|
|
|
|
if( bottom > top )
|
|
return nKey;
|
|
}
|
|
}
|
|
}
|
|
else
|
|
return nKey;
|
|
}
|
|
|
|
|
|
}
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|