bmh8

The use of Boyer-Moore-Horspool algorithm in computer science has its widespread applicability in running searches for identifying substrings in strings. Thanks to a tradeoff between space and time in order to leverage the complexity, the algorithm manages to yield a table, which is then followed by a search that reports the index of first occurrences.
Designed specifically as a dedicated, 64-bit ANSI-C search library, bmh8 comes with a closed source, therefore providing users with a header and the actual libraries. The parallel with the Boyer-Moore-Horspool algorithm lies in the functionality of the header and its two declarations.
The two function declarations, namely “bmv_find” and “bmv_chr”. The first function allows for the substring inside another string's searches and the latter will search for the first character in the given string.
Users must be aware that in order to implement the library in their workflow, the folder must be added in the inclusion directories for the given build process, the corresponding static and dynamic lib files, as well as their dependencies, to their respective folders, for linking the import libraries.
Last but not least, users must note that the library comes as reentrant, thread-safe, and free of any dependencies.