Well one easy heuristic is to only use the lookup table if the search 
substring's length is >= 4 and otherwise use the bruteforce algorithm. It's of 
course tricky to figure out a good criterion for a standard library 
implementation. PRs are welcome.

Reply via email to