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
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
// Copyright (c) 1994, 1997 James Clark
// See the file COPYING for copying permission.
#ifdef __GNUG__
#pragma implementation
#endif
#include "splib.h"
#include "UnivCharsetDesc.h"
#include "macros.h"
#include "constant.h"
#ifdef SP_NAMESPACE
namespace SP_NAMESPACE {
#endif
UnivCharsetDesc::UnivCharsetDesc()
: charMap_(unsigned(1) << 31)
{
}
UnivCharsetDesc::UnivCharsetDesc(const Range *p, size_t n)
: charMap_(unsigned(1) << 31)
{
set(p, n);
}
void UnivCharsetDesc::set(const Range *p, size_t n)
{
for (size_t i = 0; i < n; i++) {
const Range &r = p[i];
Char max;
if (r.count > charMax || r.descMin > charMax - r.count)
max = charMax;
else
max = r.descMin + (r.count - 1);
if (max - r.descMin > univCharMax
|| r.univMin > univCharMax - (max - r.descMin))
max = r.descMin + (univCharMax - r.univMin);
addRange(r.descMin, max, r.univMin);
}
}
void UnivCharsetDesc::addRange(WideChar descMin,
WideChar descMax,
UnivChar univMin)
{
if (descMin <= charMax) {
Char max = descMax > charMax ? charMax : descMax;
charMap_.setRange(descMin, max, wrapChar(univMin, descMin));
}
if (descMax > charMax) {
if (descMin > charMax)
rangeMap_.addRange(descMin, descMax, univMin);
else
rangeMap_.addRange(charMax, descMax, univMin + (charMax - descMin));
}
}
void UnivCharsetDesc::addBaseRange(const UnivCharsetDesc &baseSet,
WideChar descMin,
WideChar descMax,
WideChar baseMin,
ISet<WideChar> &baseMissing)
{
UnivCharsetDescIter iter(baseSet);
iter.skipTo(baseMin);
WideChar baseMax = baseMin + (descMax - descMin);
WideChar iDescMin, iDescMax;
UnivChar iBaseMin;
WideChar missingBaseMin = baseMin;
Boolean usedAll = 0;
while (iter.next(iDescMin, iDescMax, iBaseMin) && iDescMin <= baseMax) {
// baseMin baseMax
// iDescMin iDescMax
if (iDescMax >= baseMin) {
WideChar min = baseMin > iDescMin ? baseMin : iDescMin;
if (min > missingBaseMin)
baseMissing.addRange(missingBaseMin, min - 1);
WideChar max = baseMax < iDescMax ? baseMax : iDescMax;
missingBaseMin = max + 1;
if (missingBaseMin == 0)
usedAll = 1;
ASSERT(min <= max);
addRange(descMin + (min - baseMin),
descMin + (max - baseMin),
iBaseMin + (min - iDescMin));
}
}
if (!usedAll && baseMax >= missingBaseMin)
baseMissing.addRange(missingBaseMin, baseMax);
}
unsigned UnivCharsetDesc::univToDesc(UnivChar to, WideChar &from,
ISet<WideChar> &fromSet,
WideChar &count) const
{
unsigned ret = rangeMap_.inverseMap(to, from, fromSet, count);
Char min = 0;
do {
Char max;
Unsigned32 tem = charMap_.getRange(min, max);
if (!noDesc(tem)) {
UnivChar toMin = extractChar(tem, min);
if (toMin <= to && to <= toMin + (max - min)) {
Char n = min + (to - toMin);
WideChar thisCount = max - n + 1;
if (ret > 1) {
fromSet.add(n);
if (thisCount < count)
count = thisCount;
if (n < from)
from = n;
}
else if (ret == 1) {
fromSet.add(from);
fromSet.add(n);
ret = 2;
if (thisCount < count)
count = thisCount;
if (n < from)
from = n;
}
else {
count = thisCount;
from = n;
ret = 1;
}
}
else if (ret == 0 && toMin > to && toMin - to < count)
count = toMin - to;
}
min = max;
} while (min++ != charMax);
return ret;
}
UnivCharsetDescIter::UnivCharsetDescIter(const UnivCharsetDesc &desc)
: charMap_(&desc.charMap_), doneCharMap_(0), nextChar_(0),
rangeMapIter_(desc.rangeMap_)
{
}
Boolean UnivCharsetDescIter::next(WideChar &descMin,
WideChar &descMax,
UnivChar &univMin)
{
while (!doneCharMap_) {
Char ch = nextChar_;
Unsigned32 tem = charMap_->getRange(nextChar_, nextChar_);
descMax = nextChar_;
if (!UnivCharsetDesc::noDesc(tem)) {
descMin = ch;
descMax = nextChar_;
univMin = UnivCharsetDesc::extractChar(tem, ch);
if (nextChar_ == charMax)
doneCharMap_ = 1;
else
nextChar_++;
return 1;
}
if (nextChar_ == charMax)
doneCharMap_ = 1;
else
nextChar_++;
}
return rangeMapIter_.next(descMin, descMax, univMin);
}
#ifdef SP_NAMESPACE
}
#endif
|
