Tweak ranked match behaviour to consider the number of full words

Tracking the number of query words that appear as full words in the
candidate seems to fix a few cases where the existing fuzzy matching
algorithm was not great.

I have been running with this for a while and did not notice any
annoyances, the whole RankedMatch code probably deserves more attention
but this seems to go in the right direction.

1 files changed, 0 insertions, 2 deletions

diff --git a/src/word_db.hh b/src/word_db.hh
index dcb46653..dab65d4c 100644
--- a/src/word_db.hh
+++ b/src/word_db.hh
@@ -18,8 +18,6 @@ class Buffer;
 class WordDB : public OptionManagerWatcher
 {
 public:
-    static constexpr ByteCount max_word_len = 50;
-
     WordDB(const Buffer& buffer);
     ~WordDB();
     WordDB(const WordDB&) = delete;