Boyer 1.5

Boyer is a powerful search for variables known as strings which can contain letters, numbers or characters. The search follows the use of the Boyer-Moore algorithm which his powerful in its own right. This call can be added to any Java program in order to provide enhanced search functionality without the need to separately code a search function within a new Java program, thus saving the coder time they can put to other purposes. The searches run at differing speeds depending on the type of search being scanned for. Searching for a single vowel will take much longer than searching for an unusual sequence or less used characters.

Boyer Key Features:

• Powerful Boyer-Moore search functionality Java class that can be added as a class to Java programs
• Search time varies depending on the frequency of occurrence for the search parameters
• Requires Java 1.7 or later
• Requires Windows

Boyer is a fast Boyer-Moore search algorithm for use in other Java programs.