On Thursday, October 28, 2010 22:00:20 Dave Stevens wrote: > surely the kernel folks know about boyer-moore and other much better > algorithms > > http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm Umm, I was talking more on the lines of "find a character within a string" algorithm, which is more elementary than "find a substring within a string". Btw, the BM algorithm reduces to what I was describing if the substring length is 1. ;-) Best, :-) Marko -- users mailing list users@xxxxxxxxxxxxxxxxxxxxxxx To unsubscribe or change subscription options: https://admin.fedoraproject.org/mailman/listinfo/users Guidelines: http://fedoraproject.org/wiki/Mailing_list_guidelines
