DateTimeUtil.java
11.2 KB
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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
/*
* Decompiled with CFR 0_118.
*/
package com.adobe.xfa.ut;
import com.adobe.xfa.ut.StringUtils;
public final class DateTimeUtil {
static final char[] Kanji_Num = new char[]{'\u3007', '\u4e00', '\u4e8c', '\u4e09', '\u56db', '\u4e94', '\u516d', '\u4e03', '\u516b', '\u4e5d', '\u5341', '\u767e', '\u5343'};
static final char[] Hanja_Num = new char[]{'\u96f6', '\u4e00', '\u4e8c', '\u4e09', '\u56db', '\u4e94', '\u516d', '\u4e03', '\u516b', '\u4e5d', '\u5341', '\u767e', '\u5343'};
static final char[] Hangul_Num = new char[]{'\uc601', '\uc77c', '\uc774', '\uc0bc', '\uc0ac', '\uc624', '\uc721', '\uce60', '\ud314', '\uad6c', '\uc2ed', '\ubc31', '\ucc9c'};
private DateTimeUtil() {
}
static int getNum(String src, int begPos, int endPos, boolean fw, char zero) {
assert (begPos < endPos);
int n = 0;
while (begPos < endPos && begPos < src.length()) {
char chr = src.charAt(begPos++);
n *= 10;
if (fw) {
n += chr - 65296;
continue;
}
n += chr - zero;
}
return n;
}
static int getNum(String src, int begPos, int endPos, char[] num, boolean tr) {
assert (begPos < endPos);
int n = 0;
if (tr) {
int mils = 0;
int cens = 0;
int tens = 0;
int ones = 0;
block0 : while (begPos < endPos && begPos < src.length()) {
char chr = src.charAt(begPos++);
for (int p = 0; p < num.length; ++p) {
if (chr != num[p]) continue;
if (p == 12) {
mils = ones > 0 ? ones : 1;
ones = 0;
continue block0;
}
if (p == 11) {
cens = ones > 0 ? ones : 1;
ones = 0;
continue block0;
}
if (p == 10) {
tens = ones > 0 ? ones : 1;
ones = 0;
continue block0;
}
if (p > 9) continue block0;
ones = p;
continue block0;
}
}
n = mils * 1000 + cens * 100 + tens * 10 + ones;
} else {
while (begPos < endPos && begPos < src.length()) {
int p;
char chr = src.charAt(begPos++);
for (p = 0; p < num.length; ++p) {
if (chr != num[p] || p > 9) continue;
n *= 10;
n += p;
break;
}
if (p != num.length) continue;
break;
}
}
return n;
}
static String fmtNum(int w, int n, boolean fw, char zero) {
assert (n >= 0 && w > 0);
StringBuilder s = new StringBuilder();
for (int i = w - 1; i >= 0; --i) {
char d = (char)(zero + n % 10);
if (fw) {
d = (char)(d + 65248);
}
s.insert(0, d);
n /= 10;
}
return s.toString();
}
static String fmtNum(int d, int n, char[] num, int tr) {
StringBuilder s = new StringBuilder();
if (num == null) {
return "";
}
assert (n >= 0 && 1 <= d && d <= 4);
int mils = n / 1000;
int cens = (n - mils * 1000) / 100;
int tens = (n - mils * 1000 - cens * 100) / 10;
int ones = n - mils * 1000 - cens * 100 - tens * 10;
if (tr != 0) {
boolean prevIsZero = false;
if (mils > 0) {
if (tr > 0 || mils > 1) {
s.append(num[mils]);
}
s.append(num[12]);
}
if (cens > 0) {
if (tr > 0 || cens > 1) {
s.append(num[cens]);
}
s.append(num[11]);
} else if (tr > 0 && !prevIsZero && tens > 0 && ones > 0 && !StringUtils.isEmpty(s)) {
s.append(num[0]);
prevIsZero = true;
}
if (tens > 0) {
if (tens > 1) {
s.append(num[tens]);
}
s.append(num[10]);
} else if (tr > 0 && !prevIsZero && ones > 0 && !StringUtils.isEmpty(s)) {
s.append(num[0]);
prevIsZero = true;
}
if (StringUtils.isEmpty(s) || ones > 0) {
s.append(num[ones]);
}
} else {
if (mils > 0) {
s.append(num[mils]);
}
if (s.length() > 0 || cens > 0) {
s.append(num[cens]);
}
if (s.length() > 0 || tens > 0) {
s.append(num[tens]);
}
s.append(num[ones]);
}
return s.toString();
}
static String fmtPlainNum(int w, int n, boolean fw, char zero) {
assert (n >= 0 && w > 0);
StringBuilder s = new StringBuilder();
for (int i = w - 1; i >= 0; --i) {
char d = (char)(zero + n % 10);
if (fw) {
d = (char)(d + 65248);
}
s.insert(0, d);
if ((n /= 10) == 0) break;
}
return s.toString();
}
static String fmtStr(String src, boolean fw) {
StringBuilder s = new StringBuilder();
int n = src.length();
for (int i = 0; i < n; ++i) {
s.append(DateTimeUtil.matchChr(src.charAt(i), fw));
}
return s.toString();
}
static int matchName(String src, int srcPos, String[] names, boolean is) {
int matchIdx = -1;
int matchLen = -1;
String pSrc = src.substring(srcPos);
for (int i = 0; i < names.length; ++i) {
int len;
if (names[i] == null || (len = names[i].length()) <= matchLen) continue;
if (len == 0 || pSrc.startsWith(names[i])) {
matchIdx = i;
matchLen = len;
continue;
}
if (!is || !pSrc.toLowerCase().startsWith(names[i].toLowerCase())) continue;
matchIdx = i;
matchLen = len;
}
return matchIdx;
}
static int matchNum(String src, int begPos, int endPos, char[] num, boolean tr) {
int nDigitsSeen;
if (num == null) {
return -1;
}
assert (begPos < endPos);
int srcLen = src.length();
nDigitsSeen = 0;
if (tr) {
int mils = 0;
int cens = 0;
int tens = 0;
int ones = 1;
while (begPos < srcLen) {
char chr;
int p;
if ((chr = src.charAt(begPos++)) == '\u5143') {
return nDigitsSeen > 0 ? nDigitsSeen : 1;
}
for (p = 0; p < num.length; ++p) {
if (chr != num[p]) continue;
if (p == 12) {
if (mils > 0 || cens > 0 || tens > 0) {
return nDigitsSeen > 0 ? nDigitsSeen : -1;
}
mils = ones;
ones = 1;
} else if (p == 11) {
if (cens > 0 || tens > 0) {
return nDigitsSeen > 0 ? nDigitsSeen : -1;
}
cens = ones;
ones = 1;
} else if (p == 10) {
if (tens > 0) {
return nDigitsSeen > 0 ? nDigitsSeen : -1;
}
tens = ones;
ones = 1;
} else if (p <= 9) {
if (ones != 1) {
return nDigitsSeen > 0 ? nDigitsSeen : -1;
}
ones = p;
}
++nDigitsSeen;
break;
}
if (p != num.length) continue;
break;
}
} else {
int end = begPos;
for (int beg = begPos; beg < endPos; ++beg) {
if (end >= src.length()) continue;
++end;
}
endPos = end;
while (begPos < endPos) {
int p;
char chr;
if ((chr = src.charAt(begPos++)) == '\u5143') {
return nDigitsSeen > 0 ? nDigitsSeen : 1;
}
for (p = 0; p <= 9; ++p) {
if (chr != num[p]) continue;
++nDigitsSeen;
break;
}
if (p != 10) continue;
break;
}
}
return nDigitsSeen > 0 ? nDigitsSeen : -1;
}
static int matchNum(String src, int begPos, int endPos, boolean fw, char zero) {
assert (begPos < endPos);
int nDigitsSeen = 0;
int end = begPos;
for (int beg = begPos; beg < endPos; ++beg) {
if (end >= src.length()) continue;
++end;
}
endPos = end;
while (begPos < endPos && begPos < src.length()) {
char chr = src.charAt(begPos++);
if (!fw && (zero > chr || chr > zero + 9) || fw && ('\uff10' > chr || chr > '\uff19')) break;
++nDigitsSeen;
}
return nDigitsSeen > 0 ? nDigitsSeen : -1;
}
static int matchStr(String src, int srcPos, String str, boolean fw) {
int i = 0;
int n = str.length();
while (i < n) {
int chr;
int n2 = chr = srcPos < src.length() ? src.charAt(srcPos++) : 0;
if (fw) {
if (65281 <= chr && chr <= 65374) {
chr = (char)(chr - 65504);
chr = (char)(chr & 255);
} else if (chr == 12288) {
chr = 32;
}
}
if (str.charAt(i++) == chr) continue;
return -1;
}
return srcPos;
}
static int incPos(String src, int srcPos, int inc) {
assert (inc > 0);
for (int i = 0; i < inc; ++i) {
src.charAt(srcPos++);
}
return srcPos;
}
static boolean matchChr(String src, char chr) {
if ('\uff01' <= chr && chr <= '\uff5e') {
chr = (char)(chr - 65504);
chr = (char)(chr & 255);
} else if (chr == '\u3000') {
chr = (char)32;
}
int n = src.length();
for (int i = 0; i < n; ++i) {
if (src.charAt(i) != chr) continue;
return true;
}
return false;
}
static char matchChr(char chr, boolean fw) {
if (fw) {
if ('!' <= chr && chr <= '~') {
chr = (char)(chr + 65248);
} else if (chr == ' ') {
chr = (char)12288;
}
}
return chr;
}
static boolean matchChr(String src, int srcPos, char chr, boolean fw) {
if (srcPos >= src.length()) {
return false;
}
return DateTimeUtil.matchChr(src.charAt(srcPos), fw) == chr;
}
}