Talk:Boyer-Moore string search: Difference between revisions

m
Line 15:
 
:: That said, currently, the Emacs Lisp implementation (and the current J implementation which copies it) does not implement the [[wp:Boyer–Moore_string-search_algorithm#The_good_suffix_rule|good suffix rule]]. So the algorithm exhibits poor performance in certain contexts.
:: This isn't the sort of thing which impacts the correctness of the returned result -- it's strictly a performance issue (it's a performance improvement when "good suffixes" are rare or absent in the text being searched, it's a performance problem when relatively long "good suffixes" appear relatively often in the text being searched (lazy construction of the corresponding lookup tables would tend to reduce the cost of that part of the implementation, but would also tend to increase cache pressure)). I've got other things to do right now, but I'll circle back on this when I have time. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 13:53, 18 July 2022 (UTC)
6,962

edits