>>>>> "kt" == Kimmo Takkunen <[EMAIL PROTECTED]> writes:
kt> Below is my implementation of Boyer-Moore-Horspool algorithm. It kt> should be better than Boyer-Moore in practise. this implementation also looks like it may be easier for the compiler to optimize than mine, given that it's not generating a closure. Certainly it's easier to understand than the one in Hemlock! -- Eric Marsden <URL:http://www.laas.fr/~emarsden/>
