Lines Matching refs:pattern
52 /** Forces normalization of pattern and strings.
67 /** If set, treat the entire pattern as a literal string.
119 * @param pattern The Regular Expression pattern to be compiled.
120 * @param patternLength The length of the pattern, or -1 if the pattern is
135 uregex_open( const UChar *pattern,
147 * The contents of the pattern UText will be extracted and saved. Ownership of the
151 * @param pattern The Regular Expression pattern to be compiled.
165 uregex_openUText(UText *pattern,
174 * This function is the same as uregex_open, except that the pattern
177 * @param pattern The Regular Expression pattern to be compiled,
189 * pattern.
195 uregex_openC( const char *pattern,
238 * within it are not cloned; only the pattern itself and the
254 * Returns a pointer to the source form of the pattern for this regular expression.
255 * This function will work even if the pattern was originally specified as a UText.
259 * pattern string. A NULL pointer may be used here if the
260 * pattern length is not needed, as would be the case if
261 * the pattern is known in advance to be a NUL terminated
264 * @return a pointer to the pattern string. The storage for the string is
276 * Returns the source text of the pattern for this regular expression.
277 * This function will work even if the pattern was originally specified as a UChar string.
281 * @return the pattern text. The storage for the text is owned by the regular expression
306 * expression pattern to be applied to different strings.
333 * expression pattern to be applied to different strings.
428 * Attempts to match the input string against the pattern.
454 * Attempts to match the input string against the pattern.
479 * Attempts to match the input string, starting from the specified index, against the pattern.
508 * Attempts to match the input string, starting from the specified index, against the pattern.
536 * Find the first matching substring of the input string that matches the pattern.
561 * Find the first matching substring of the input string that matches the pattern.
585 * Find the next pattern match in the input string. Begin searching
602 * Get the number of capturing groups in this regular expression's pattern.
618 * appear in the pattern.
641 * appear in the pattern.
666 * the pattern.
691 * the pattern.
1009 * With anchoring bounds, pattern anchors such as ^ and $ will match at the start
1059 * Replaces every substring of the input that matches the pattern
1063 * This method scans the input string looking for matches of the pattern.
1091 * Replaces every substring of the input that matches the pattern
1095 * This method scans the input string looking for matches of the pattern.
1118 * Replaces the first substring of the input that matches the pattern
1122 * This method scans the input string looking for a match of the pattern.
1150 * Replaces the first substring of the input that matches the pattern
1154 * This method scans the input string looking for a match of the pattern.
1313 * The pattern matches identify delimiters that separate the input
1321 * If the delimiter pattern includes capture groups, the captured text will
1324 * which ignores the presence of capture groups in the pattern.
1331 * This count includes the strings from capture groups in the delimiter pattern.
1373 * The pattern matches identify delimiters that separate the input
1414 * of the processor and the details of the specific pattern, but will
1451 * A limit is desirable because a malicious or poorly designed pattern can use
1551 * for more optimized loops where the pattern is known to only start, and the match
