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
|
/*
* Copyright (c) 2013 Tobias Markmann
* Licensed under the simplified BSD license.
* See Documentation/Licenses/BSD-simplified.txt for more information.
*/
/*
* Copyright (c) 2014 Kevin Smith and Remko Tronçon
* Licensed under the GNU General Public License v3.
* See Documentation/Licenses/GPLv3.txt for more information.
*/
#include <Swift/Controllers/ContactSuggester.h>
#include <boost/algorithm/string/find.hpp>
#include <boost/lambda/lambda.hpp>
#include <boost/lambda/bind.hpp>
#include <Swiften/Base/Algorithm.h>
#include <Swiften/Base/foreach.h>
#include <Swiften/JID/JID.h>
#include <Swift/Controllers/ContactProvider.h>
#include <algorithm>
#include <vector>
#include <set>
namespace lambda = boost::lambda;
namespace Swift {
ContactSuggester::ContactSuggester() {
}
ContactSuggester::~ContactSuggester() {
}
void ContactSuggester::addContactProvider(ContactProvider* provider) {
contactProviders_.push_back(provider);
}
bool ContactSuggester::matchContact(const std::string& search, const Contact::ref& c) {
return fuzzyMatch(c->name, search) || fuzzyMatch(c->jid.toString(), search);
}
std::vector<Contact::ref> ContactSuggester::getSuggestions(const std::string& search) const {
std::vector<Contact::ref> results;
foreach(ContactProvider* provider, contactProviders_) {
append(results, provider->getContacts());
}
std::sort(results.begin(), results.end(), ContactSuggester::contactLexicographicalSortPredicate);
results.erase(std::unique(results.begin(), results.end(), ContactSuggester::contactEqualityPredicate), results.end());
results.erase(std::remove_if(results.begin(), results.end(), !lambda::bind(&ContactSuggester::matchContact, search, lambda::_1)),
results.end());
std::sort(results.begin(), results.end(), ContactSuggester::contactSmartSortPredicate);
return results;
}
bool ContactSuggester::fuzzyMatch(std::string text, std::string match) {
for (std::string::iterator currentQueryChar = match.begin(); currentQueryChar != match.end(); currentQueryChar++) {
//size_t result = text.find(*currentQueryChar);
std::string::iterator result = boost::algorithm::ifind_first(text, std::string(currentQueryChar, currentQueryChar+1)).begin();
if (result == text.end()) {
return false;
}
text.erase(result);
}
return true;
}
bool ContactSuggester::contactLexicographicalSortPredicate(const Contact::ref& a, const Contact::ref& b) {
return a->jid < b->jid;
}
bool ContactSuggester::contactEqualityPredicate(const Contact::ref& a, const Contact::ref& b) {
return a->jid == b->jid;
}
bool ContactSuggester::contactSmartSortPredicate(const Contact::ref& a, const Contact::ref& b) {
if (a->statusType == b->statusType) {
return a->name.compare(b->name) < 0;
} else {
return a->statusType < b->statusType;
}
}
}
|
Swift