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
|
/* ============================================================
*
* This file is a part of the rekonq project
*
* Copyright (C) 2009 by Andrea Diamantini <adjam7 at gmail dot com>
*
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation; either version 2 of
* the License or (at your option) version 3 or any later version
* accepted by the membership of KDE e.V. (or its successor approved
* by the membership of KDE e.V.), which shall act as a proxy
* defined in Section 14 of version 3 of the license.
*
* This program 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.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* ============================================================ */
// Self Includes
#include "urlresolver.h"
// Local Includes
#include "application.h"
#include "historymanager.h"
#include "bookmarksmanager.h"
// KDE Includes
#include <KUriFilter>
#include <KCompletion>
#include <KDebug>
#include <KService>
#include <KConfig>
#include <KConfigGroup>
// Qt Includes
#include <QString>
#include <QByteArray>
#include <QUrl>
// defines
#define MAX_ELEMENTS 9
// NOTE default kurifilter plugin list (at least in my box)
// 1. "kshorturifilter"
// 2. "kurisearchfilter"
// 3. "localdomainurifilter"
// 4 ."kuriikwsfilter"
// 5. "fixhosturifilter"
bool UrlSearchItem::operator==(UrlSearchItem i)
{
return url==i.url;
}
UrlResolver::UrlResolver(const QString &typedUrl)
: _typedString(typedUrl.trimmed())
{
}
UrlSearchList UrlResolver::orderedSearchItems()
{
// NOTE: the logic here is : "we wanna suggest (at least) 9 elements"
// so we have (more or less) 3 from first results (1 from QUrl Resolutions, 2 from
// default search engines).
// There are 6 remaining: if bookmarkResults + historyResults <= 6, catch all, else
// catch first 3 results from the two resulting lists :)
UrlSearchList list;
// if(isHttp())
// {
// list << qurlFromUserInputResolution();
// }
list << webSearchesResolution();
if (_typedString.length() >= 2)
{
list << qurlFromUserInputResolution();
int firstResults = list.count();
int checkPoint = 9 - firstResults;
UrlSearchList historyList = historyResolution();
int historyResults = historyList.count();
UrlSearchList bookmarksList = bookmarksResolution();
int bookmarkResults = bookmarksList.count();
if(historyResults + bookmarkResults > checkPoint)
{
historyList = historyList.mid(0,3);
bookmarksList = bookmarksList.mid(0,3);
}
QList<UrlSearchItem> common;
foreach (UrlSearchItem i, historyList)
{
if (!bookmarksList.contains(i))
{
list << i;
}
else
{
i.type |= UrlSearchItem::Bookmark;
common << i;
}
}
foreach (UrlSearchItem i, common)
{
list << i;
}
foreach (UrlSearchItem i, bookmarksList)
{
if (!common.contains(i))
list << i;
}
}
return list;
}
bool UrlResolver::isHttp()
{
QString ipv4 = "^0*([1-9]?\\d|1\\d\\d|2[0-4]\\d|25[0-5])\\.0*([1-9]?\\d|1\\d\\d|2[0-4]\\d|25[0-5])"\
"\\.0*([1-9]?\\d|1\\d\\d|2[0-4]\\d|25[0-5])\\.0*([1-9]?\\d|1\\d\\d|2[0-4]\\d|25[0-5])";
QString ipv6 = "^([0-9a-fA-F]{4}|0)(\\:([0-9a-fA-F]{4}|0)){7}";
QString address = "[\\d\\w-.]+\\.(a[cdefgilmnoqrstuwz]|b[abdefghijmnorstvwyz]|"\
"c[acdfghiklmnoruvxyz]|d[ejkmnoz]|e[ceghrst]|f[ijkmnor]|g[abdefghilmnpqrstuwy]|"\
"h[kmnrtu]|i[delmnoqrst]|j[emop]|k[eghimnprwyz]|l[abcikrstuvy]|"\
"m[acdghklmnopqrstuvwxyz]|n[acefgilopruz]|om|p[aefghklmnrstwy]|qa|r[eouw]|"\
"s[abcdeghijklmnortuvyz]|t[cdfghjkmnoprtvwz]|u[augkmsyz]|v[aceginu]|w[fs]|"\
"y[etu]|z[amw]|aero|arpa|biz|com|coop|edu|info|int|gov|mil|museum|name|net|org|"\
"pro)";
return _typedString.startsWith("http://")
|| _typedString.startsWith("https://")
|| (QRegExp(address, Qt::CaseInsensitive).indexIn(_typedString) != -1)
|| (QRegExp(ipv4, Qt::CaseInsensitive).indexIn(_typedString) != -1)
|| (QRegExp(ipv6, Qt::CaseInsensitive).indexIn(_typedString) != -1);
}
//////////////////////////////////////////////////////////////////////////
// PRIVATE ENGINES
// STEP 1 = QUrl from User Input (easily the best solution... )
UrlSearchList UrlResolver::qurlFromUserInputResolution()
{
UrlSearchList list;
QString url2 = _typedString;
QUrl urlFromUserInput = QUrl::fromUserInput(url2);
if(urlFromUserInput.isValid())
{
KUrl gUrl(urlFromUserInput);
QString gTitle = i18nc("Browse a website", "Browse");
UrlSearchItem gItem(UrlSearchItem::Browse, gUrl, gTitle);
list << gItem;
}
return list;
}
// STEP 2 = Web Searches
UrlSearchList UrlResolver::webSearchesResolution()
{
UrlSearchList list;
if(KUrl(_typedString).isRelative())
{
UrlSearchItem gItem(UrlSearchItem::Search, KUrl(), QString() ); // others will find this url..
list << gItem;
}
return list;
}
// STEP 3 = history completion
UrlSearchList UrlResolver::historyResolution()
{
UrlSearchList list;
KCompletion *historyCompletion = Application::historyManager()->completionObject();
QStringList historyResults = historyCompletion->substringCompletion(_typedString);
Q_FOREACH(const QString &s, historyResults)
{
UrlSearchItem it(UrlSearchItem::History, KUrl(s), Application::historyManager()->titleForHistoryUrl(s));
list << it;
}
return list;
}
// STEP 4 = bookmarks completion
UrlSearchList UrlResolver::bookmarksResolution()
{
UrlSearchList list;
KCompletion *bookmarkCompletion = Application::bookmarkProvider()->completionObject();
QStringList bookmarkResults = bookmarkCompletion->substringCompletion(_typedString);
Q_FOREACH(const QString &s, bookmarkResults)
{
UrlSearchItem it(UrlSearchItem::Bookmark, KUrl(s), Application::bookmarkProvider()->titleForBookmarkUrl(s));
list << it;
}
return list;
}
|
