/** * Reset the matcher and then searches for pattern at the specified start index * @param start - Index at which to start the search * @return true if a match is found (false otherwise) * @throws IndexOutOfBoundsException if start is {@literal <} 0 or larger then the size of the sequence * @see #find() */ public boolean find(int start) { if (start < 0 || start > elements.size()) { throw new IndexOutOfBoundsException("Invalid region start=" + start + ", need to be between 0 and " + elements.size()); } reset(); return find(start, false); }
/** * Reset the matcher and then searches for pattern at the specified start index * @param start - Index at which to start the search * @return true if a match is found (false otherwise) * @throws IndexOutOfBoundsException if start is < 0 or larger then the size of the sequence */ public boolean find(int start) { if (start < 0 || start > elements.size()) { throw new IndexOutOfBoundsException("Invalid region start=" + start + ", need to be between 0 and " + elements.size()); } reset(); return find(start, false); }
/** * Reset the matcher and then searches for pattern at the specified start index * @param start - Index at which to start the search * @return true if a match is found (false otherwise) * @throws IndexOutOfBoundsException if start is {@literal <} 0 or larger then the size of the sequence * @see #find() */ public boolean find(int start) { if (start < 0 || start > elements.size()) { throw new IndexOutOfBoundsException("Invalid region start=" + start + ", need to be between 0 and " + elements.size()); } reset(); return find(start, false); }
/** * Reset the matcher and then searches for pattern at the specified start index * @param start - Index at which to start the search * @return true if a match is found (false otherwise) * @throws IndexOutOfBoundsException if start is {@literal <} 0 or larger then the size of the sequence * @see #find() */ public boolean find(int start) { if (start < 0 || start > elements.size()) { throw new IndexOutOfBoundsException("Invalid region start=" + start + ", need to be between 0 and " + elements.size()); } reset(); return find(start, false); }
/** * Reset the matcher and then searches for pattern at the specified start index * @param start - Index at which to start the search * @return true if a match is found (false otherwise) * @throws IndexOutOfBoundsException if start is < 0 or larger then the size of the sequence * @see #find() */ public boolean find(int start) { if (start < 0 || start > elements.size()) { throw new IndexOutOfBoundsException("Invalid region start=" + start + ", need to be between 0 and " + elements.size()); } reset(); return find(start, false); }