int[] result = { i, i + searchLen }; return result;
if(Character.toUpperCase(textChars[i]) == search[0]) { for(int j = 1; j < searchLen; j++) { if(Character.toUpperCase(textChars[i+j]) != search[j]) { i += j - 1; continue loop; } }  result = i; break loop; } } } else { loop:			for(int i = 0; i < len; i++) { if(textChars[i] == search[0]) { for(int j = 1; j < searchLen; j++) { if(textChars[i+j] != search[j]) { i += j - 1; continue loop; } }  result = i; break loop; }
	public int[] nextMatch(String text)	{		int searchLen = search.length();		int len = text.length() - searchLen + 1;		for(int i = 0; i < len; i++)		{			if(text.regionMatches(ignoreCase,i,search,0,searchLen))			{				int[] result = { i, i + searchLen };				return result;			}		}		return null;	}