Reputation: 5430
I'm working with a performance issue on JavaScript. So I just want to ask: what is the fastest way to check whether a string contains another substring (I just need the boolean value)? Could you please suggest your idea and sample snippet code?
Upvotes: 260
Views: 397147
Reputation: 11
According to this site, include is much faster https://www.measurethat.net/Benchmarks/Show/13675/0/regextest-vs-stringincludes-vs-stringmatch
Upvotes: 0
Reputation: 198
From Felix Kling's answer, and with tests I've done with given links.
Chrome and NE are both based on Chromium => same performances.
ci = case insensitive
/ = same as left
string length | Firefox | Safari | Chromium | |
---|---|---|---|---|
short | cached RegExp ci | cached RegExp ci | indexOf & / ci | worth |
RegExp & / ci | RegExp ci | RegExp & / ci | worse | |
long | cached RegExp | cached RE & / ci & reg ci | indexOf | worth |
indexOf ci | indexOf ci | RegExp | worse |
browser | Firefox | Safari | Chromium |
---|---|---|---|
cached RegExp | 1.3M | 425k | 1.2M |
diff | 1.08x > | ||
cached RegExp case sensitive | 28M | 31M | 42M |
diff | 1.44/1.35x > | ||
indexOf | 27M | 25M | 1.9B |
diff | 70/76x > | ||
indexOf case sensitive | 13.8M | 18.5M | 1.9B |
diff | 137/103x > |
Firefox best method : cached regexp case insensitive
Chrome best method : indexOf / indexOf case insensitive
Safari best method : cached RegExp case insensitive
Chrome has widely better performances than the two others.
Best compromise : indexOf : String.indexOf(substring) > -1
.
Note : Remind that if you want to use the indexOf case sensitive
way, if you operate a String.toLowerCase()
, it adds some operations, so it's pretty similar to the insensitive way. In that case, you should be lowering your substring before the search process, not in it.
Regexes are really good for complex and/or pattern research/replacement, but not for a global research, and that in all languages, because of what it is.
Upvotes: 2
Reputation: 816334
You have three possibilites:
(new RegExp('word')).test(str)
// or
/word/.test(str)
str.indexOf('word') !== -1
str.includes('word')
Regular expressions seem to be faster (at least in Chrome 10).
Performance test - short haystack
Performance test - long haystack
It cannot be said with certainty which method is faster. The differences between the browsers is enormous. While in Chrome 10 indexOf
seems to be faster, in Safari 5, indexOf
is clearly slower than any other method.
You have to see and try for your self. It depends on your needs. For example a case-insensitive search is way faster with regular expressions.
Update 2018:
Just to save people from running the tests themselves, here are the current results for most common browsers, the percentages indicate performance increase over the next fastest result (which varies between browsers):
Chrome: indexOf (~98% faster) <-- wow
Firefox: cached RegExp (~18% faster)
IE11: cached RegExp(~10% faster)
Edge: indexOf (~18% faster)
Safari: cached RegExp(~0.4% faster)
Note that cached RegExp is: var r = new RegExp('simple'); var c = r.test(str);
as opposed to: /simple/.test(str)
Upvotes: 419
Reputation: 4652
The Fastest
var string = "hello", substring = "lo"; string.includes(substring);
var string = "hello", substring = "lo"; string.indexOf(substring) !== -1;
Upvotes: 61
Reputation: 48366
In ES6, the includes()
method is used to determine whether one string may be found within another string, returning true
or false
as appropriate.
var str = 'To be, or not to be, that is the question.';
console.log(str.includes('To be')); // true
console.log(str.includes('question')); // true
console.log(str.includes('nonexistent')); // false
Here is jsperf between
var ret = str.includes('one');
And
var ret = (str.indexOf('one') !== -1);
As the result shown in jsperf, it seems both of them perform well.
Upvotes: 10
Reputation: 2939
I made a jsben.ch for you http://jsben.ch/#/aWxtF ...seems that indexOf is a bit faster.
Upvotes: 3
Reputation: 131
I've found that using a simple for loop, iterating over all elements in the string and comparing using charAt
performs faster than indexOf
or Regex
. The code and proof is available at JSPerf.
ETA: indexOf
and charAt
both perform similarly terrible on Chrome Mobile according to Browser Scope data listed on jsperf.com
Upvotes: 7
Reputation: 2358
It's easy way to use .match()
method to string.
var re = /(AND|OR|MAYBE)/;
var str = "IT'S MAYBE BETTER WAY TO USE .MATCH() METHOD TO STRING";
console.log('Do we found something?', Boolean(str.match(re)));
Wish you a nice day, sir!
Upvotes: 5
Reputation: 14605
Does this work for you?
string1.indexOf(string2) >= 0
Edit: This may not be faster than a RegExp if the string2 contains repeated patterns. On some browsers, indexOf may be much slower than RegExp. See comments.
Edit 2: RegExp may be faster than indexOf when the strings are very long and/or contain repeated patterns. See comments and @Felix's answer.
Upvotes: 20
Reputation: 14738
For finding a simple string, using the indexOf() method and using regex is pretty much the same: http://jsperf.com/substring - so choose which ever one that seems easier to write.
Upvotes: 3