Tag: boyer moore

适用于所有匹配的Boyer-Moore-Horspool算法（在字节数组中查找字节数组）

这是我对BMH算法的实现（它就像一个魅力）： public static Int64 IndexOf(this Byte[] value, Byte[] pattern) { if (value == null) throw new ArgumentNullException(“value”); if (pattern == null) throw new ArgumentNullException(“pattern”); Int64 valueLength = value.LongLength; Int64 patternLength = pattern.LongLength; if ((valueLength == 0) || (patternLength == 0) || (patternLength > valueLength)) return -1; Int64[] badCharacters = new Int64[256]; for (Int64 i = […]