Xtykutl

You could use a loop. Maybe even create a helper function like so:

function ContainsAny(str, items){

    for(var i in items){

        var item = items[i];

        if (str.indexOf(item) > -1){

            return true;

        }



    }

    return false;

}

Which you can then call like so:

if(ContainsAny(str, ["term1", "term2", "term3"])){

   //do something

}

if (/term1|term2|term3/.test("your string")) {

   //youre code

}

Maybe this:

if (str.indexOf("term1") >= 0 || str.indexOf("term2") >= 0 || str.indexOf("term3") >= 0) 

{

 //your code

}

You can do something like

function isSubStringPresent(str){

    for(var i = 1; i < arguments.length; i++){

        if(str.indexOf(arguments[i]) > -1){

            return true;

        }

    }



    return false;

}



isSubStringPresent('mystring', 'term1', 'term2', ...)

The .map() function can be used to convert an array of terms into an array of booleans indicating if each term is found. Then check if any of the booleans are true.

Given an array of terms:

const terms = ['term1', 'term2', 'term3'];

This line of code will return true if string contains any of the terms:

terms.map((term) => string.includes(term)).includes(true);       

Three examples:

terms.map((term) => 'Got term2 here'.includes(term)).includes(true);       //true

terms.map((term) => 'Not here'.includes(term)).includes(true);             //false

terms.map((term) => 'Got term1 and term3'.includes(term)).includes(true);  //true

Or, if you want to wrap the code up into a reusable hasTerm() function:

function hasTerm(string, terms) {

   function search(term) { return string.includes(term); }

   return terms.map(search).includes(true);

   }

hasTerm('Got term2 here', terms);       //true

hasTerm('Not here', terms);             //false

hasTerm('Got term1 and term3', terms);  //true

Try it out:
https://codepen.io/anon/pen/MzKZZQ?editors=0012

.map() documentation:
https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map

Notes:

1. This answer optimizes for simplicity and readability. If extremely large arrays of terms are expected, use a loop that short-circuits once a term is found.


2. To support IE, transpile to replace occurrences of .includes(x) with .indexOf(x) !== -1 and => with a function declaration.