Method search

src/eepp/core/string.cpp:440–472

A Boyer-Moore-Horspool search algorithm. */ If it finds the needle, it returns an offset to haystack from which * the needle was found. Otherwise, it returns haystack_length. */

 * the needle was found. Otherwise, it returns haystack_length.
 */
size_t String::BMH::search( const unsigned char* haystack, size_t haystackLength,
							const unsigned char* needle, const size_t needleLength,
							const OccTable& occ ) {
	if ( needleLength > haystackLength )
		return haystackLength;
	if ( needleLength == 1 ) {
		const unsigned char* result =
			(const unsigned char*)std::memchr( haystack, *needle, haystackLength );
		return result ? size_t( result - haystack ) : haystackLength;
	}

	const size_t needleLengthMinus1 = needleLength - 1;

	const unsigned char lastNeedleChar = needle[needleLengthMinus1];

	size_t haystackPosition = 0;
	while ( haystackPosition <= haystackLength - needleLength ) {
		const unsigned char occChar = haystack[haystackPosition + needleLengthMinus1];

		// The author modified this part. Original algorithm matches needle right-to-left.
		// This code calls memcmp() (usually matches left-to-right) after matching the last
		// character, thereby incorporating some ideas from
		// "Tuning the Boyer-Moore-Horspool String Searching Algorithm"
		// by Timo Raita, 1992.
		if ( lastNeedleChar == occChar &&
			 std::memcmp( needle, haystack + haystackPosition, needleLengthMinus1 ) == 0 ) {
			return haystackPosition;
		}

		haystackPosition += occ[occChar];
	}
	return haystackLength;
}

Int64 String::BMH::find( const std::string& haystack, const std::string& needle,
						 const size_t& haystackOffset, const OccTable& occ ) {