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
|
// Copyright (C) 2016 Dmitry Savchenko
// Copyright (C) 2016 Vasiliy Sorokin
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR GPL-3.0-only WITH Qt-GPL-exception-1.0
#include "lineparser.h"
#include <QMap>
namespace Todo {
namespace Internal {
LineParser::LineParser(const KeywordList &keywordList)
{
setKeywordList(keywordList);
}
void LineParser::setKeywordList(const KeywordList &keywordList)
{
m_keywords = keywordList;
}
QList<TodoItem> LineParser::parse(const QString &line)
{
QMap<int, int> entryCandidates = findKeywordEntryCandidates(line);
QList<KeywordEntry> entries = keywordEntriesFromCandidates(entryCandidates, line);
return todoItemsFromKeywordEntries(entries);
}
bool LineParser::isKeywordSeparator(const QChar &ch)
{
return ch.isSpace() || (ch == ':') || (ch == '/') || (ch == '*') || (ch == '(');
}
LineParser::KeywordEntryCandidates LineParser::findKeywordEntryCandidates(const QString &line)
{
KeywordEntryCandidates entryCandidates;
for (int i = 0; i < m_keywords.count(); ++i) {
int searchFrom = -1;
forever {
const int index = line.lastIndexOf(m_keywords.at(i).name, searchFrom);
if (index == -1)
break; // 'forever' loop exit condition
searchFrom = index - line.length() - 1;
if (isKeywordAt(index, line, m_keywords.at(i).name))
entryCandidates.insert(index, i);
}
}
return entryCandidates;
}
bool LineParser::isKeywordAt(int index, const QString &line, const QString &keyword)
{
if (!isFirstCharOfTheWord(index, line))
return false;
if (!isLastCharOfTheWord(index + keyword.length() - 1, line))
return false;
return true;
}
bool LineParser::isFirstCharOfTheWord(int index, const QString &line)
{
return (index == 0) || isKeywordSeparator(line.at(index - 1));
}
bool LineParser::isLastCharOfTheWord(int index, const QString &line)
{
return (index == line.length() - 1) || isKeywordSeparator(line.at(index + 1));
}
QList<LineParser::KeywordEntry> LineParser::keywordEntriesFromCandidates(
const QMap<int, int> &candidates, const QString &line)
{
// Ensure something is found
if (candidates.isEmpty())
return QList<KeywordEntry>();
// Convert candidates to entries
std::vector<KeywordEntry> tmp;
for (auto it = candidates.cbegin(), end = candidates.cend(); it != end; ++it)
tmp.emplace_back(KeywordEntry{it.value(), it.key(), QString()});
QList<KeywordEntry> entries;
for (auto it = tmp.crbegin(), end = tmp.crend(); it != end; ++it) {
KeywordEntry entry = *it;
int keywordLength = m_keywords.at(entry.keywordIndex).name.length();
int entryTextLength = -1;
if (!entries.empty())
entryTextLength = entries.last().keywordStart - (entry.keywordStart + keywordLength);
entry.text = line.mid(entry.keywordStart + keywordLength, entryTextLength);
if (trimSeparators(entry.text).isEmpty() && !entries.empty())
// Take the text form the previous entry, consider:
// '<keyword1>: <keyword2>: <some text>'
entry.text = entries.last().text;
entries << entry;
}
return entries;
}
QString LineParser::trimSeparators(const QString &string)
{
QString result = string.trimmed();
while (startsWithSeparator(result))
result = result.right(result.length() - 1);
while (endsWithSeparator(result))
result = result.left(result.length() - 1);
return result;
}
bool LineParser::startsWithSeparator(const QString &string)
{
return !string.isEmpty() && isKeywordSeparator(string.at(0));
}
bool LineParser::endsWithSeparator(const QString &string)
{
return !string.isEmpty() && isKeywordSeparator(string.at(string.length() - 1));
}
QList<TodoItem> LineParser::todoItemsFromKeywordEntries(const QList<KeywordEntry> &entries)
{
QList<TodoItem> todoItems;
for (const KeywordEntry &entry : entries) {
TodoItem item;
item.text = m_keywords.at(entry.keywordIndex).name + entry.text;
item.color = m_keywords.at(entry.keywordIndex).color;
item.iconType = m_keywords.at(entry.keywordIndex).iconType;
todoItems << item;
}
return todoItems;
}
} // namespace Internal
} // namespace Todo
|
