d3v1l/matrixion
1
0
Fork 0
mirror of https://github.com/Nheko-Reborn/nheko.git synced 2024-11-24 03:58:49 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

Replace search vector with span

Browse source
This commit is contained in:
Nicolas Werner 2023-05-19 20:56:24 +02:00
parent 0264682541
commit 1017b92321
No known key found for this signature in database
GPG key ID: C8D75E610773F2D9
1 changed files with 7 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
src/CompletionProxyModel.h
View file

@ -9,6 +9,7 @@
#include <QAbstractProxyModel>
#include <algorithm>
#include <span>
enum class ElementRank
{
@ -72,7 +73,7 @@ struct trie
return ret;
}
std::vector<Value> search(const QVector<Key> &keys, //< TODO(Nico): replace this with a span
std::vector<Value> search(const std::span<Key> &keys,
size_t result_count_limit,
size_t max_edit_distance_ = 2) const
{
@ -80,7 +81,7 @@ struct trie
if (!result_count_limit)
return ret;
if (keys.isEmpty())
if (keys.empty())
return valuesAndSubvalues(result_count_limit);
auto append = [&ret, result_count_limit](std::vector<Value> &&in) {
@ -118,7 +119,7 @@ struct trie
}
if (t) {
append(t->search(keys.mid(2), limit(), max_edit_distance));
append(t->search(keys.subspan(2), limit(), max_edit_distance));
}
}
@ -134,7 +135,7 @@ struct trie
}
// delete character case
append(this->search(keys.mid(1), limit(), max_edit_distance));
append(this->search(keys.subspan(1), limit(), max_edit_distance));
// substitute case
for (const auto &[k, t] : this->next) {
@ -144,14 +145,14 @@ struct trie
break;
// substitute
append(t.search(keys.mid(1), limit(), max_edit_distance));
append(t.search(keys.subspan(1), limit(), max_edit_distance));
}
max_edit_distance += 1;
}
if (auto e = this->next.find(keys[0]); e != this->next.end()) {
append(e->second.search(keys.mid(1), limit(), max_edit_distance));
append(e->second.search(keys.subspan(1), limit(), max_edit_distance));
}
}