Timo Raita

Timo Raita is the author of the Raita algorithm, a string searching algorithm that he published in 1991 as an improvement on the Boyer-Moore-Horspool algorithm. Like its parent it preprocesses the pattern into a bad-character shift table, but it changes the order of comparison inside each window of the text: it checks the last character of the pattern against the rightmost character of the window, then the first against the leftmost, then the middle against the middle, and only then compares the remaining characters. The source notes that a similar pre-check appears in modern implementations of std::string::find in the libc++ and libstdc++ libraries. This entry records him as the originator of that algorithm; no biographical page was found that would support more about his career or affiliation, so none is claimed.