12 #include "llvm/ADT/ArrayRef.h"
13 #include "llvm/ADT/DenseSet.h"
14 #include "llvm/ADT/STLExtras.h"
15 #include "llvm/ADT/StringExtras.h"
25 template <
typename Func>
28 std::vector<CharRole> Roles(
Identifier.size());
30 llvm::makeMutableArrayRef(Roles.data(),
Identifier.size()));
32 std::string LowercaseIdentifier =
Identifier.lower();
42 std::vector<std::array<unsigned, 3>> Next(LowercaseIdentifier.size());
43 unsigned NextTail = 0, NextHead = 0;
44 for (
int I = LowercaseIdentifier.size() - 1; I >= 0; --I) {
45 Next[I] = {{NextTail, NextHead}};
46 NextTail = Roles[I] ==
Tail ? I : 0;
47 if (Roles[I] ==
Head) {
54 for (
size_t I = 0; I < LowercaseIdentifier.size(); ++I) {
56 if (Roles[I] !=
Head && Roles[I] !=
Tail)
58 for (
const unsigned J : Next[I]) {
61 for (
const unsigned K : Next[J]) {
64 Out(
Trigram(LowercaseIdentifier[I], LowercaseIdentifier[J],
65 LowercaseIdentifier[K]));
70 if (!LowercaseIdentifier.empty())
72 if (LowercaseIdentifier.size() >= 2)
73 Out(
Trigram(LowercaseIdentifier[0], LowercaseIdentifier[1]));
74 for (
size_t I = 1; I < LowercaseIdentifier.size(); ++I)
75 if (Roles[I] ==
Head) {
76 Out(
Trigram(LowercaseIdentifier[0], LowercaseIdentifier[I]));
82 std::vector<Trigram> &Result) {
87 constexpr
unsigned ManyTrigramsIdentifierThreshold = 14;
89 if (
Identifier.size() < ManyTrigramsIdentifierThreshold) {
91 if (!llvm::is_contained(Result, T))
97 Result.erase(std::unique(Result.begin(), Result.end()), Result.end());
104 std::string LowercaseQuery = Query.lower();
105 if (Query.size() < 3)
109 std::vector<CharRole> Roles(Query.size());
110 calculateRoles(Query, llvm::makeMutableArrayRef(Roles.data(), Query.size()));
112 llvm::DenseSet<Token> UniqueTrigrams;
114 for (
unsigned I = 0; I < Query.size(); ++I) {
115 if (Roles[I] !=
Head && Roles[I] !=
Tail)
117 Chars.push_back(LowercaseQuery[I]);
118 if (Chars.size() > 3)
119 Chars.erase(Chars.begin());
120 if (Chars.size() == 3)
124 return {UniqueTrigrams.begin(), UniqueTrigrams.end()};