SuggestSoft.com
Boyer 1.5
Fast string search (indexOf) using the Boyer-Moore
algorithm. Incorporate this class into your own Java
programs to rapidly search strings.
use:
import com.mindprod.Boyer.Boyer;
...
Boyer b = new Boyer("dogcatwombat");
int where = b.indexOf("cat");
or
int where = Boyer.indexOf("dogcatwombat","cat");
Boyer-Moore is about twice as fast as String.indexOf when
the string you are searching in is 2K or over and the
pattern you are searching for is 4 characters or longer.
String.indexOf is particularly slow when the pattern begins
with a common letter such as "e". Boyer-Moore is fastest
when the pattern is long and composed only of uncommon
letters, e.g. "z" or "^". If you use a char[] instead of
String for your text to be searched, it will run an
additional 33% faster.
Boyer automatically reverts to String.indexOf when that
would be faster.
| Updated: | 1969-12-31 |
| License: | Free |
| Publisher: | Canadian Mind Products |
| Size: | n/a |
| Require: | Java 1.1+ |
| System: | Win98, WinME, WinNT3x, WinNT4x, WinXP, Win2000, Win2003, Unix, Linux, LinuxConsole, LinuxGnome, LinuxGPL, AS400, OS2, OS2Warp, OS2Warp4, MacOSX, Java |
| Language: | English |
fast string search 2 3 4 5
search 2 3 4 5 6
string handling 2 3
java 2 3 4 5 6
string search 2 3 4 5 6
indexof
boyer moore
- Fast string search (indexOf) using the Boyer-Moore algorithm. Incorporate this class into your own Java programs to rapidly search strings. Boyerr-Moore is about twice as fast as String.indexOf when the string you are searching in is 2K or over and the pattern you are searching for is 4 characters or longer.
Anti Virus Report 1 Anti Virus Report 2 Download Program Download's Map Post Review/Rate
|
|||
Close  |