-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathdom.cpp
464 lines (426 loc) · 14.9 KB
/
dom.cpp
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
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
//
// Created by Ramsay on 2019/9/9.
//
#include "dom.hpp"
#include <algorithm>
#include <memory>
#include <sstream>
#include <stdexcept>
#include <utility>
crawler::Nodes crawler::Node::getElementsByTag(const std::string &tagName) {
return getElementsByPredicate([&tagName](const Node &node) -> bool {
return node.getElementData().getTagName() == tagName;
});
}
crawler::Node crawler::Node::getElementById(const std::string &id) {
Nodes elements = getElementsByPredicate([&id](const Node &node) -> bool {
return node.getElementData().id() == id;
});
assert(elements.size() == 1);
return elements[0];
}
crawler::Nodes crawler::Node::select(Evaluator *evaluator) {
return getElementsByPredicate([&evaluator](const Node &node) -> bool {
return evaluator->matches(node);
});
}
crawler::Nodes crawler::Node::select(const std::string &cssQuery) {
crawler::QueryParser cssParser(cssQuery);
return select(*cssParser.parse());
}
bool crawler::Node::isElement() const { return nodeType == NodeType::Element; }
bool crawler::Node::isText() const { return nodeType == NodeType::Text; }
const crawler::ElementData &crawler::Node::getElementData() const {
return std::get<ElementData>(nodeData);
}
const std::string &crawler::Node::getText() const {
return std::get<std::string>(nodeData);
}
const std::shared_ptr<crawler::Node> &crawler::Node::getParent() const {
return parent;
}
bool crawler::ElementData::containsAttribute(const std::string &key) const {
if (startsWith("abs:", key)) {
size_t length = std::string("abs:").length();
size_t beginIndex = indexOf("abs:", key);
std::string attributeKey = key.substr(beginIndex, length);
return (this->attributes.find(attributeKey)) != attributes.end();
} else {
return (this->attributes.find(key)) != attributes.end();
}
}
std::string crawler::ElementData::clazz() const {
return getValueByKey("class");
}
std::string crawler::ElementData::id() const {
auto result = attributes.find("id");
if (result != attributes.end()) {
return result->second;
} else {
return std::string("");
}
}
const std::string
crawler::ElementData::getValueByKey(const std::string &key) const {
auto clazz = attributes.find(key);
std::string classValue;
if (clazz != attributes.end()) {
return clazz->second;
}
return classValue;
}
crawler::TokenQueue::TokenQueue(std::string data, size_t pos)
: data(std::move(data)), pos(pos) {}
bool crawler::TokenQueue::consumeWhiteSpace() {
bool seen = false;
while (matchesWhitespace()) {
pos++;
seen = true;
}
return seen;
}
bool crawler::TokenQueue::matchesWhitespace() {
return !eof() && isspace(data.c_str()[pos]);
}
bool crawler::TokenQueue::eof() { return pos >= data.size(); }
bool crawler::TokenQueue::matches(const std::string &seq) {
const std::string source = data.substr(pos, seq.size());
return source == seq;
}
bool crawler::TokenQueue::matchesChomp(const std::string &seq) {
if (matches(seq)) {
pos += seq.size();
return true;
} else {
return false;
}
}
crawler::TokenQueue::TokenQueue(std::string data)
: data(std::move(data)), pos(0) {}
const std::string &crawler::TokenQueue::getData() const { return data; }
size_t crawler::TokenQueue::getPos() const { return pos; }
std::string crawler::TokenQueue::consumeCssIdentifier() {
return consumeByPredicate([this]() -> bool {
return matchesAny(std::array<char, 2>({'-', '_'}));
});
}
template <typename Predicate>
std::string crawler::TokenQueue::consumeByPredicate(Predicate predicate) {
size_t start = pos;
while (!eof() && (matchesWords() || predicate())) {
pos++;
}
const size_t length = pos - start;
return data.substr(start, length);
}
std::string crawler::TokenQueue::consumeElementSelector() {
return consumeByPredicate([this]() -> bool {
return matchesAny(std::array<std::string, 4>({"*|", "|", "_", "-"}));
});
}
bool crawler::TokenQueue::matchesWords() {
return !eof() && isalnum(data.c_str()[pos]);
}
std::string crawler::TokenQueue::chompBalanced(char open, char close) {
int start = -1;
int end = -1;
int depth = 0;
char last = 0;
bool isSingleQuote = false;
bool isDoubleQuote = false;
do {
if (eof()) {
break;
}
char c = consume();
if (last != ESC) {
if (c == '\'' && c != open && !isDoubleQuote) {
isSingleQuote = !isSingleQuote;
} else if (c == '\"' && c != open && !isSingleQuote) {
isDoubleQuote = !isDoubleQuote;
}
if (isSingleQuote || isDoubleQuote) {
continue;
}
if (c == open) {
depth++;
if (start == -1) {
start = pos;
}
} else if (c == close) {
depth--;
}
}
if (depth > 0 && last != 0) {
// don't include the outer match pair in the return
end = pos;
}
last = c;
} while (depth > 0);
const int length = end - start;
const std::string result = (end >= 0) ? data.substr(start, length) : "";
if (depth > 0) {
// throw exception?
}
return result;
}
char crawler::TokenQueue::consume() { return data.c_str()[pos++]; }
std::shared_ptr<crawler::Evaluator *> crawler::QueryParser::parse() {
// not support combinator for now.
tokenQueue.consumeWhiteSpace();
if (tokenQueue.matchesAny(COMBINATORS)) {
combinator(tokenQueue.consume());
} else {
findElements();
}
while (!tokenQueue.eof()) {
bool seenWhiteSpace = tokenQueue.consumeWhiteSpace();
if (tokenQueue.matchesAny(COMBINATORS)) {
combinator(tokenQueue.consume());
} else if (seenWhiteSpace) {
combinator(' ');
} else {
// E.class, E#id, E[attr] etc. AND
findElements();
}
}
if (evals.size() == 1) {
return std::make_shared<crawler::Evaluator *>(evals.front());
} else {
auto *andEvaluator = new crawler::And(evals);
return std::make_shared<crawler::Evaluator *>(andEvaluator);
}
}
std::shared_ptr<crawler::Evaluator *>
crawler::QueryParser::parse(const std::string &cssQuery) {
QueryParser queryParser(cssQuery);
return queryParser.parse();
}
void crawler::QueryParser::findElements() {
if (tokenQueue.matchesChomp("#")) {
findById();
} else if (tokenQueue.matchesChomp(".")) {
findByClass();
} else if (tokenQueue.matchesWords()) {
findByTag();
} else if (tokenQueue.matches("[")) {
findByAttribute();
} else {
std::string errorMsg("Could parse unexpected token: ");
errorMsg += tokenQueue.remainder();
throw std::runtime_error(errorMsg);
}
}
void crawler::QueryParser::findById() {
const std::string id = tokenQueue.consumeCssIdentifier();
evals.emplace_back(new Id(id));
}
void crawler::QueryParser::findByClass() {
const std::string clazz = tokenQueue.consumeCssIdentifier();
evals.emplace_back(new Class(clazz));
}
void crawler::QueryParser::findByTag() {
std::string tagName = tokenQueue.consumeElementSelector();
evals.emplace_back(new Tag(tagName));
}
void crawler::QueryParser::combinator(char combinator) {
tokenQueue.consumeWhiteSpace();
std::string subQuery = tokenQueue.consumeSubQuery();
Evaluator *currentEval;
std::shared_ptr<Evaluator *> newEval = crawler::QueryParser::parse(subQuery);
if (evals.size() == 1) {
currentEval = evals.at(0);
} else {
currentEval = new And(evals);
}
evals.clear();
if (combinator == '>') {
Evaluator *immediateParent = new ImmediateParent(
std::make_shared<crawler::Evaluator *>(currentEval));
currentEval = new And({*newEval, immediateParent});
} else if (combinator == ' ') {
Evaluator *parent =
new Parent(std::make_shared<crawler::Evaluator *>(currentEval));
currentEval = new And({*newEval, parent});
} else {
throw std::runtime_error("Unknown combinator");
}
evals.emplace_back(currentEval);
}
std::string crawler::TokenQueue::consumeSubQuery() {
std::stringstream buffer;
while (!eof()) {
if (matches("(")) {
buffer << "(" << chompBalanced('(', ')') << ")";
} else if (matches("[")) {
buffer << "[" << chompBalanced('[', ']') << "]";
} else if (matchesAny(crawler::QueryParser::COMBINATORS)) {
break;
} else {
buffer << consume();
}
}
return buffer.str();
}
std::string crawler::TokenQueue::remainder() {
const std::string remainder = data.substr(pos, data.size());
pos = data.size();
return remainder;
}
crawler::QueryParser::QueryParser(const std::string &queryString)
: queryString(queryString), tokenQueue(queryString) {}
void crawler::QueryParser::findByAttribute() {
TokenQueue attributeQueue(tokenQueue.chompBalanced('[', ']'));
std::string key = attributeQueue.consumeToAny(ATTRIBUTES);
attributeQueue.consumeWhiteSpace();
if (attributeQueue.eof()) {
if (startsWith("^", key)) {
evals.emplace_back(
new AttributeKeyStartWithPrefix(key.substr(1, key.length() - 1)));
} else {
evals.emplace_back(new Attribute(key));
}
} else {
if (attributeQueue.matchesChomp("=")) {
evals.emplace_back(
new AttributeWithValue(key, attributeQueue.remainder()));
} else if (attributeQueue.matchesChomp("!=")) {
evals.emplace_back(
new AttributeWithValueNot(key, attributeQueue.remainder()));
} else if (attributeQueue.matchesChomp("^=")) {
evals.emplace_back(
new AttributeValueStartWithPrefix(key, attributeQueue.remainder()));
} else if (attributeQueue.matchesChomp("$=")) {
evals.emplace_back(
new AttributeValueEndWithSuffix(key, attributeQueue.remainder()));
} else if (attributeQueue.matchesChomp("*=")) {
evals.emplace_back(new AttributeValueContainWithSubstring(
key, attributeQueue.remainder()));
}
// TODO
}
}
crawler::Id::Id(std::string id) : id(std::move(id)) {}
bool crawler::Id::matches(const Node &element) {
return id == element.getElementData().id();
}
crawler::Class::Class(std::string clazz) : clazz(std::move(clazz)) {}
bool crawler::Class::matches(const Node &element) {
return clazz == element.getElementData().clazz();
}
crawler::Tag::Tag(std::string tagName) : tagName(std::move(tagName)) {}
bool crawler::Tag::matches(const Node &element) {
return tagName == element.getElementData().getTagName();
}
crawler::CombiningEvaluator::CombiningEvaluator(
std::vector<Evaluator *> evalutors)
: evalutors(std::move(evalutors)) {}
bool crawler::And::matches(const Node &element) {
return std::all_of(this->evalutors.cbegin(), this->evalutors.cend(),
[&](auto const &eval) { return eval->matches(element); });
}
crawler::And::And(const std::vector<Evaluator *> &_evalutors)
: CombiningEvaluator(_evalutors) {}
bool crawler::Or::matches(const Node &element) {
return std::any_of(this->evalutors.cbegin(), this->evalutors.cend(),
[&](auto const &eval) { return eval->matches(element); });
}
crawler::Or::Or(const std::vector<Evaluator *> &_evalutors)
: CombiningEvaluator(_evalutors) {}
crawler::Parent::Parent(std::shared_ptr<Evaluator *> _eval)
: StructuralEvaluator(std::move(_eval)){};
bool crawler::Parent::matches(const Node &element) {
Evaluator *eval = *this->evaluator;
const std::shared_ptr<crawler::Node> &parentPtr = element.getParent();
if (parentPtr == nullptr) {
return false;
}
auto parent = *parentPtr;
while (true) {
if (eval->matches(parent)) {
return true;
}
if (parent.getParent() == nullptr) {
return false;
}
parent = *parent.getParent();
}
return false;
}
crawler::ImmediateParent::ImmediateParent(std::shared_ptr<Evaluator *> _eval)
: StructuralEvaluator(std::move(_eval)){};
bool crawler::ImmediateParent::matches(const Node &element) {
const std::shared_ptr<crawler::Node> &parentPtr = element.getParent();
if (parentPtr == nullptr) {
return false;
}
Evaluator *eval = *this->evaluator;
return eval->matches(*parentPtr);
}
crawler::Attribute::Attribute(std::string key) : key(std::move(key)) {}
bool crawler::Attribute::matches(const Node &element) {
return element.getElementData().containsAttribute(key);
}
crawler::AttributeKeyStartWithPrefix::AttributeKeyStartWithPrefix(
std::string keyPrefix)
: keyPrefix(std::move(keyPrefix)) {}
bool crawler::AttributeKeyStartWithPrefix::matches(const Node &node) {
const crawler::AttrMap attributes = node.getElementData().getAttributes();
return std::any_of(attributes.cbegin(), attributes.cend(),
[&](auto const &element) {
std::string key = element.first;
return startsWith(keyPrefix, key);
});
}
crawler::AttributeKeyValuePair::AttributeKeyValuePair(
const std::string &_key, const std::string &_value) {
key = normalize(_key);
std::string tmpValue = _value;
// if key-value pair is foo= 'bar' or foo = "bar", extract `bar` from value,
// and replace it as value.
if ((crawler::startsWith("\"", _value) && crawler::endsWith("\"", _value)) ||
(crawler::startsWith("'", _value) && crawler::endsWith("'", _value))) {
tmpValue = _value.substr(1, _value.size() - 2);
}
value = tmpValue;
}
crawler::AttributeWithValue::AttributeWithValue(const std::string &_key,
const std::string &_value)
: AttributeKeyValuePair(_key, _value) {}
bool crawler::AttributeWithValue::matches(const Node &element) {
return element.getElementData().containsAttribute(this->key) &&
(value == element.getElementData().getValueByKey(key));
}
crawler::AttributeWithValueNot::AttributeWithValueNot(const std::string &_key,
const std::string &_value)
: AttributeKeyValuePair(_key, _value) {}
bool crawler::AttributeWithValueNot::matches(const crawler::Node &node) {
return value != node.getElementData().getValueByKey(key);
}
crawler::AttributeValueStartWithPrefix::AttributeValueStartWithPrefix(
const std::string &_key, const std::string &_value)
: AttributeKeyValuePair(_key, _value) {}
bool crawler::AttributeValueStartWithPrefix::matches(
const crawler::Node &node) {
const std::string source = node.getElementData().getValueByKey(key);
return node.getElementData().containsAttribute(key) &&
startsWith(value, source);
}
crawler::AttributeValueEndWithSuffix::AttributeValueEndWithSuffix(
const std::string &_key, const std::string &_value)
: AttributeKeyValuePair(_key, _value) {}
bool crawler::AttributeValueEndWithSuffix::matches(const crawler::Node &node) {
std::string source = node.getElementData().getValueByKey(key);
return node.getElementData().containsAttribute(key) &&
endsWith(value, source);
}
crawler::AttributeValueContainWithSubstring::AttributeValueContainWithSubstring(
const std::string &_key, const std::string &_value)
: AttributeKeyValuePair(_key, _value) {}
bool crawler::AttributeValueContainWithSubstring::matches(
const crawler::Node &node) {
std::string source = node.getElementData().getValueByKey(key);
return node.getElementData().containsAttribute(key) &&
indexOf(value, source) != std::string::npos;
}
crawler::Evaluator::~Evaluator() {}