StringUtils.contains of Apache and Boyer–Moore string search algorithm

Question

To search for s in S (size(S) >= size(s) and return a true/false value), it's better for performance to use StringUtils.contains() of Apache or use Boyer-Moore algorithm implemented and tested well by someone I found?

Thanks

Holger · Accepted Answer · 2013-11-15 19:26:25Z

8

The last time I looked into the Java regex matching code while debugging, the Java 7 regex engine used the Boyer-Moore algorithm for sequences of literal text matches. So the easiest way to find a String using Boyer-Moore is to prepare using p=Pattern.compile(searchString, Pattern.LITERAL) and search using p.matcher(toSearchOn).find(). No third party libraries and no handcrafted work needed. And I believe the JRE classes are tested well…

answered Nov 15, 2013 at 19:26

Holger

301k43 gold badges483 silver badges827 bronze badges

Sign up to request clarification or add additional context in comments.

Comments

WPrecht · Accepted Answer · 2013-11-15 16:32:21Z

0

Apache Lang uses the Java API's Region Matching for their contains implementation. Hard to say which is faster on the surface. Sounds like an opportunity to build a simple test case and run it both ways and see.

answered Nov 15, 2013 at 16:32

WPrecht

1,3701 gold badge17 silver badges30 bronze badges

2 Comments

xuongrong Over a year ago

I will try your suggestion. Sorry I'm not reputation enough to vote for your answer.

ngreen Over a year ago

If you're going to do performance testing in this style, it's a good idea to use a framework, such as [OpenJDK JMH] openjdk.java.net/projects/code-tools/jmh

Collectives™ on Stack Overflow

StringUtils.contains of Apache and Boyer–Moore string search algorithm

2 Answers 2

Comments

2 Comments

Your Answer

Linked

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

Comments

2 Comments

Your Answer

Sign up or log in

Post as a guest

Linked

Related