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
|
package org.jsoup.parser;
import org.jsoup.helper.Validate;
/**
CharacterReader consumes tokens off a string. To replace the old TokenQueue.
*/
class CharacterReader {
static final char EOF = (char) -1;
private final String input;
private final int length;
private int pos = 0;
private int mark = 0;
CharacterReader(String input) {
Validate.notNull(input);
input = input.replaceAll("\r\n?", "\n"); // normalise carriage returns to newlines
this.input = input;
this.length = input.length();
}
int pos() {
return pos;
}
boolean isEmpty() {
return pos >= length;
}
char current() {
return isEmpty() ? EOF : input.charAt(pos);
}
char consume() {
char val = isEmpty() ? EOF : input.charAt(pos);
pos++;
return val;
}
void unconsume() {
pos--;
}
void advance() {
pos++;
}
void mark() {
mark = pos;
}
void rewindToMark() {
pos = mark;
}
String consumeAsString() {
return input.substring(pos, pos++);
}
String consumeTo(char c) {
int offset = input.indexOf(c, pos);
if (offset != -1) {
String consumed = input.substring(pos, offset);
pos += consumed.length();
return consumed;
} else {
return consumeToEnd();
}
}
String consumeTo(String seq) {
int offset = input.indexOf(seq, pos);
if (offset != -1) {
String consumed = input.substring(pos, offset);
pos += consumed.length();
return consumed;
} else {
return consumeToEnd();
}
}
String consumeToAny(char... seq) {
int start = pos;
OUTER: while (!isEmpty()) {
char c = input.charAt(pos);
for (char seek : seq) {
if (seek == c)
break OUTER;
}
pos++;
}
return pos > start ? input.substring(start, pos) : "";
}
String consumeToEnd() {
String data = input.substring(pos, input.length());
pos = input.length();
return data;
}
String consumeLetterSequence() {
int start = pos;
while (!isEmpty()) {
char c = input.charAt(pos);
if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'))
pos++;
else
break;
}
return input.substring(start, pos);
}
String consumeLetterThenDigitSequence() {
int start = pos;
while (!isEmpty()) {
char c = input.charAt(pos);
if ((c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z'))
pos++;
else
break;
}
while (!isEmpty()) {
char c = input.charAt(pos);
if (c >= '0' && c <= '9')
pos++;
else
break;
}
return input.substring(start, pos);
}
String consumeHexSequence() {
int start = pos;
while (!isEmpty()) {
char c = input.charAt(pos);
if ((c >= '0' && c <= '9') || (c >= 'A' && c <= 'F') || (c >= 'a' && c <= 'f'))
pos++;
else
break;
}
return input.substring(start, pos);
}
String consumeDigitSequence() {
int start = pos;
while (!isEmpty()) {
char c = input.charAt(pos);
if (c >= '0' && c <= '9')
pos++;
else
break;
}
return input.substring(start, pos);
}
boolean matches(char c) {
return !isEmpty() && input.charAt(pos) == c;
}
boolean matches(String seq) {
return input.startsWith(seq, pos);
}
boolean matchesIgnoreCase(String seq) {
return input.regionMatches(true, pos, seq, 0, seq.length());
}
boolean matchesAny(char... seq) {
if (isEmpty())
return false;
char c = input.charAt(pos);
for (char seek : seq) {
if (seek == c)
return true;
}
return false;
}
boolean matchesLetter() {
if (isEmpty())
return false;
char c = input.charAt(pos);
return (c >= 'A' && c <= 'Z') || (c >= 'a' && c <= 'z');
}
boolean matchesDigit() {
if (isEmpty())
return false;
char c = input.charAt(pos);
return (c >= '0' && c <= '9');
}
boolean matchConsume(String seq) {
if (matches(seq)) {
pos += seq.length();
return true;
} else {
return false;
}
}
boolean matchConsumeIgnoreCase(String seq) {
if (matchesIgnoreCase(seq)) {
pos += seq.length();
return true;
} else {
return false;
}
}
boolean containsIgnoreCase(String seq) {
// used to check presence of </title>, </style>. only finds consistent case.
String loScan = seq.toLowerCase();
String hiScan = seq.toUpperCase();
return (input.indexOf(loScan, pos) > -1) || (input.indexOf(hiScan, pos) > -1);
}
@Override
public String toString() {
return input.substring(pos);
}
}
|
