public static boolean containsAny(CharSequence cs,char[] searchChars){
  if (isEmpty(cs) || isEmpty(searchChars)) {
    return false;
  }
  int csLength=cs.length();
  int searchLength=searchChars.length;
  int csLast=csLength - 1;
  int searchLast=searchLength - 1;
  for (int i=0; i < csLength; i++) {
    char ch=cs.charAt(i);
    for (int j=0; j < searchLength; j++) {
      if (searchChars[j] == ch) {
        if (Character.isHighSurrogate(ch)) {
          if (j == searchLast) {
            return true;
          }
          if (i < csLast && searchChars[j + 1] == cs.charAt(i + 1)) {
            return true;
          }
        }
 else {
          return true;
        }
      }
    }
  }
  return false;
}

public static boolean containsAny ( CharSequence cs , char [ ] searchChars ) { if ( isEmpty ( cs ) || isEmpty ( searchChars ) ) { return false ; } int csLength = cs . length ( ) ; int searchLength = searchChars . length ; int csLast = csLength - 1 ; int searchLast = searchLength - 1 ; for ( int i = 0 ; i < csLength ; i ++ ) { char ch = cs . charAt ( i ) ; for ( int j = 0 ; j < searchLength ; j ++ ) { if ( searchChars [ j ] == ch ) { if ( Character . isHighSurrogate ( ch ) ) { if ( j == searchLast ) { return true ; } if ( i < csLast && searchChars [ j + 1 ] == cs . charAt ( i + 1 ) ) { return true ; } } else { return true ; } } } } return false ; }
checks if the charsequence contains any character in the given set of characters .
