Consider a search GUI rework

[supersaiyansubtlety]

The current search algorithm implemented in SearchUtil is a bit strange:

• it supports:
  • prefix matches
  • word matches
  • 'limited fuzzy matches': matches with missing words, so long as they're in order
    ("KeepJustMe" can be found with "KeepMe" and "KeMe" but not "JustKeep")
• it does not support arbitrary substring matches ("eep" does not find "Keep")
• its entry scoring system seems excessively complicated and might cause noticeable lag, but I haven't benchmarked anything (see SearchUtil.Entry::getScoreFor)

If I missed anything the current algorithm supports or why the scoring has to be the way it is, please comment.

---

I started poking around in SearchUtil to see if I could use #338's StringLookup to improve or de-duplicate things.

I found that switching StringLookup would require changing the kinds of matches supported:

• remove 'limited fuzzy matches'
• add arbitrary substring matches

I could look into adding some form of fuzzy matching to StringLookup.

It would have the following advantages:

• make the complex part of the scoring system unnecessary (unless I overlooked something)
• potentially be faster
• maybe allow for more caching, esp. if we remove the 'hit count' part of the scoring

A rewrite could also lay some ground work for adding feature parity with the search-mappings command.

ofc StringLookup could only be used if it ends up being performant at MC source scale and can be effectively parallelized.

---

Alternatives to a substantial rewrite centered around StringLookup:

• try to improve the current algorithm using the StringMultiTries that back lookups
• try to implement more caching in the current algorithm
• expand the current fuzzy matching
• overhaul the scoring

[supersaiyansubtlety]

I'm coming around to the idea of missing word fuzzy matches.

My current preference would be to rewrite the algorithm to support matching:

• prefixes ("KeepJ" finds "KeepJustMe")
• unordered word prefixes ("MeKe" finds "KeepJustMe")
• [maybe, only if performant] substrings ("eepJ" finds "KeepJustMe")

It might update StringLookup or create a new kind of lookup.