Do not use range adaptor to gather ranked matches

This ends up constructing RankedMatch twice, once when computing
the number of elements then once when actually filling the vector.

1 files changed, 6 insertions, 3 deletions

diff --git a/src/commands.cc b/src/commands.cc
index 55becf4a..1c6ea09a 100644
--- a/src/commands.cc
+++ b/src/commands.cc
@@ -336,9 +336,12 @@ private:
     Completions rank_candidates(StringView query)
     {
         UsedLetters query_letters = used_letters(query);
-        auto matches = m_candidates | transform([&](const auto& c) { return RankedMatch{c.first, c.second, query, query_letters}; })
-                                    | filter([](const auto& m) { return (bool)m; })
-                                    | gather<Vector<RankedMatch>>();
+        Vector<RankedMatch> matches;
+        for (auto&& candidate : m_candidates)
+        {
+            if (RankedMatch m{candidate.first, candidate.second, query, query_letters})
+                matches.push_back(m);
+        }
 
         constexpr size_t max_count = 100;
         CandidateList res;