Boyer

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.

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.

Download

System Requirements:

Java, Linux, Mac OS X, Unix, Win2000, Win7 x32, Win7 x64, WinServer, WinVista, WinVista x64, WinXP

Version:

1.5

Last updated:

2010-11-22 17:04:10

Publisher:

Canadian Mind Products

Homepage:

http://mindprod.com

File name:

boyer15.zip

File size:

0.57MB

License:

Freeware

Price:

0.00

You may also like...