/** * Checks if the pattern matches the entire sequence * @return true if the entire sequence is matched (false otherwise) * @see #find() */ public boolean matches() { matched = false; matchingCompleted = false; boolean status = findMatchStart(0, true); if (status) { // Check if entire region is matched status = ((matchedGroups[0].matchBegin == regionStart) && (matchedGroups[0].matchEnd == regionEnd)); } matchingCompleted = true; matched = status; return status; }
protected boolean find0(int start, boolean matchStart) { boolean match = false; matched = false; matchingCompleted = false; if (matchStart) { match = findMatchStart(start, false); } else { for (int i = start; i < regionEnd; i++) { match = findMatchStart(i, false); if (match) { break; } } } matched = match; matchingCompleted = true; if (matched) { nextMatchStart = (findType == FindType.FIND_NONOVERLAPPING)? end(): start()+1; } else { nextMatchStart = -1; } return match; }
public boolean matches() { matched = false; matchingCompleted = false; boolean status = findMatchStart(0, true); if (status) { // Check if entire region is matched status = ((matchedGroups[0].matchBegin == regionStart) && (matchedGroups[0].matchEnd == regionEnd)); } matchingCompleted = true; matched = status; return status; }
/** * Checks if the pattern matches the entire sequence * @return true if the entire sequence is matched (false otherwise) * @see #find() */ public boolean matches() { matched = false; matchingCompleted = false; boolean status = findMatchStart(0, true); if (status) { // Check if entire region is matched status = ((matchedGroups[0].matchBegin == regionStart) && (matchedGroups[0].matchEnd == regionEnd)); } matchingCompleted = true; matched = status; return status; }
/** * Checks if the pattern matches the entire sequence * @return true if the entire sequence is matched (false otherwise) * @see #find() */ public boolean matches() { matched = false; matchingCompleted = false; boolean status = findMatchStart(0, true); if (status) { // Check if entire region is matched status = ((matchedGroups[0].matchBegin == regionStart) && (matchedGroups[0].matchEnd == regionEnd)); } matchingCompleted = true; matched = status; return status; }
/** * Checks if the pattern matches the entire sequence * @return true if the entire sequence is matched (false otherwise) * @see #find() */ public boolean matches() { matched = false; matchingCompleted = false; boolean status = findMatchStart(0, true); if (status) { // Check if entire region is matched status = ((matchedGroups[0].matchBegin == regionStart) && (matchedGroups[0].matchEnd == regionEnd)); } matchingCompleted = true; matched = status; return status; }
protected boolean find(int start, boolean matchStart) { boolean match = false; matched = false; matchingCompleted = false; if (matchStart) { match = findMatchStart(start, false); } else { for (int i = start; i < regionEnd; i++) { match = findMatchStart(i, false); if (match) { break; } } } matched = match; matchingCompleted = true; if (matched) { nextMatchStart = (findType == FindType.FIND_NONOVERLAPPING)? end(): start+1; } else { nextMatchStart = -1; } return match; }
protected boolean find(int start, boolean matchStart) { boolean match = false; matched = false; matchingCompleted = false; if (matchStart) { match = findMatchStart(start, false); } else { for (int i = start; i < regionEnd; i++) { match = findMatchStart(i, false); if (match) { break; } } } matched = match; matchingCompleted = true; if (matched) { nextMatchStart = (findType == FindType.FIND_NONOVERLAPPING)? end(): start()+1; } else { nextMatchStart = -1; } return match; }
protected boolean find0(int start, boolean matchStart) { boolean match = false; matched = false; matchingCompleted = false; if (matchStart) { match = findMatchStart(start, false); } else { for (int i = start; i < regionEnd; i++) { match = findMatchStart(i, false); if (match) { break; } } } matched = match; matchingCompleted = true; if (matched) { nextMatchStart = (findType == FindType.FIND_NONOVERLAPPING)? end(): start()+1; } else { nextMatchStart = -1; } return match; }
protected boolean find0(int start, boolean matchStart) { boolean match = false; matched = false; matchingCompleted = false; if (matchStart) { match = findMatchStart(start, false); } else { for (int i = start; i < regionEnd; i++) { match = findMatchStart(i, false); if (match) { break; } } } matched = match; matchingCompleted = true; if (matched) { nextMatchStart = (findType == FindType.FIND_NONOVERLAPPING)? end(): start()+1; } else { nextMatchStart = -1; } return match; }