1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/* -*- 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>
#include <string.h>
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 )
{
memset(mpIndex, 0, sizeof(mpIndex));
}
oneToOneMappingWithFlag::~oneToOneMappingWithFlag()
{
}
void oneToOneMappingWithFlag::makeIndex()
{
if( !mbHasIndex && mpTableWF )
{
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: */
|
