Fixing dub search

Tue Dec 29 11:58:24 UTC 2020

On Tuesday, 29 December 2020 at 11:47:11 UTC, Ola Fosheim Grøstad 
wrote:
> But seriously, in-memory-search is easy to implement, so it 
> would look better if it is done in D.

You could just use a trie for the tokens and implement 
Levenshtein-Damerau fuzzy matching on that. That is a fun 
exercise to do. The next fun exercise is to abstract it in a way 
that fits into Phobos!

(Fun fact: I've just read a bunch of suggestions for how to do 
this as I am spending my holiday grading exams in text search... 
:-P Ok, not so fun...)