I have integrated the branch feature-12-improved_search that includes Boyer-Moore string search algorithm contributed by @samozrejmost and some fixes and code cleaning from myself.
According to my tests searching a string at the end of a cached file of 2.6 GB takes 2 min 48 s with the old algorithm, and less than 8 s with the Boyer-Moore
algorithm, so the improvement is massive.
I have integrated the branch feature-12-improved_search that includes Boyer-Moore string search algorithm contributed by @samozrejmost and some fixes and code cleaning from myself.
According to my tests searching a string at the end of a cached file of 2.6 GB takes 2 min 48 s with the old algorithm, and less than 8 s with the Boyer-Moore algorithm, so the improvement is massive.