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
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip 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 General Public License for more details.
*
*/
#include <algorithm>
#include "ParenMatcherHighlighter.h"
ParenInfoTextBlockData::ParenInfoTextBlockData() {}
QVector<ParenInfo> ParenInfoTextBlockData::parens() {
return parenInfos;
}
void ParenInfoTextBlockData::insert(const ParenInfo &parenInfo) {
parenInfos.append(parenInfo);
}
void ParenInfoTextBlockData::sortParenInfos() {
std::sort(parenInfos.begin(), parenInfos.end());
}
ParenMatcherHighlighter::ParenMatcherHighlighter(QTextDocument *parent) : QSyntaxHighlighter(parent) {
leftParensToMatch.append('(');
leftParensToMatch.append('[');
leftParensToMatch.append('{');
rightParensToMatch.append(')');
rightParensToMatch.append(']');
rightParensToMatch.append('}');
}
void ParenMatcherHighlighter::highlightBlock(const QString &text) {
ParenInfoTextBlockData *data = new ParenInfoTextBlockData;
for (int i = 0 ; i < leftParensToMatch.size() ; ++i) {
int leftPos = text.indexOf(leftParensToMatch.at(i));
while (leftPos != -1) {
ParenInfo info;
info.character = leftParensToMatch.at(i);
info.position = currentBlock().position() + leftPos;
data->insert(info);
leftPos = text.indexOf(leftParensToMatch.at(i), leftPos+1);
}
}
for (int i = 0 ; i < rightParensToMatch.size() ; ++i) {
int rightPos = text.indexOf(rightParensToMatch.at(i));
while (rightPos != -1) {
ParenInfo info;
info.character = rightParensToMatch.at(i);
info.position = currentBlock().position() + rightPos;
data->insert(info);
rightPos = text.indexOf(rightParensToMatch.at(i), rightPos+1);
}
}
data->sortParenInfos();
setCurrentBlockUserData(data);
}
|
