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
|
/*************************************************************************
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: oneToOneMapping.cxx,v $
*
* $Revision: 1.4 $
*
* last change: $Author: rt $ $Date: 2005-09-07 17:41:13 $
*
* The Contents of this file are made available subject to
* the terms of GNU Lesser General Public License Version 2.1.
*
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2005 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library 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 for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
************************************************************************/
#include <i18nutil/oneToOneMapping.hxx>
namespace com { namespace sun { namespace star { namespace i18n {
oneToOneMapping::oneToOneMapping(OneToOneMappingTable_t *_table, const size_t _bytes)
{
table = _table;
max_size = _bytes / sizeof(std::pair< sal_Unicode, sal_Unicode >);
hasIndex = sal_False;
}
oneToOneMapping::~oneToOneMapping()
{
if( hasIndex )
for (int i = 0; i < 256; i++)
if (index[i])
delete [] index[i];
}
sal_Unicode oneToOneMapping::find(const sal_Unicode key) const
{
if (hasIndex) {
// index search
int high, low;
high = (key >> 8) & 0xFF;
low = key & 0xFF;
if (index[high] != (int*)0 && index[high][low] != 0) {
return table[index[high][low] - 1].second;
}
else {
return sal_Unicode(key);
}
} else {
int bottom = 0;
int top = max_size - 1;
int current;
for (;;) {
current = (top + bottom) / 2;
if (key < table[current].first) {
top = current - 1;
}
else if (key > table[current].first) {
bottom = current + 1;
} else {
return table[current].second;
}
if (bottom > top) {
return sal_Unicode(key);
}
}
}
}
void oneToOneMapping::makeIndex()
{
if (!hasIndex) {
int i, j, high, low, current = -1;
hasIndex = sal_True;
for (i = 0; i < 256; i++)
index[i] = (int*)0;
for (size_t k = 0; k < max_size; k++) {
high = (table[k].first >> 8) & 0xFF;
low = (table[k].first) & 0xFF;
if (high != current) {
current = high;
index[high] = new int[256];
for (j = 0; j < 256; j++)
index[high][j] = 0;
}
index[high][low] = k + 1;
}
}
}
} } } }
|
