Home | History | Annotate | Download | only in unicode

Lines Matching refs:pattern

50     /** Forces normalization of pattern and strings. 
65 /** If set, treat the entire pattern as a literal string.
118 * @param pattern The Regular Expression pattern to be compiled.
119 * @param patternLength The length of the pattern, or -1 if the pattern is
134 uregex_open( const UChar *pattern,
146 * The contents of the pattern UText will be extracted and saved. Ownership of the
150 * @param pattern The Regular Expression pattern to be compiled.
164 uregex_openUText(UText *pattern,
173 * This function is the same as uregex_open, except that the pattern
176 * @param pattern The Regular Expression pattern to be compiled,
188 * pattern.
194 uregex_openC( const char *pattern,
237 * within it are not cloned; only the pattern itself and the
253 * Returns a pointer to the source form of the pattern for this regular expression.
254 * This function will work even if the pattern was originally specified as a UText.
258 * pattern string. A NULL pointer may be used here if the
259 * pattern length is not needed, as would be the case if
260 * the pattern is known in advance to be a NUL terminated
263 * @return a pointer to the pattern string. The storage for the string is
275 * Returns the source text of the pattern for this regular expression.
276 * This function will work even if the pattern was originally specified as a UChar string.
280 * @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.
429 * Attempts to match the input string against the pattern.
455 * Attempts to match the input string against the pattern.
480 * Attempts to match the input string, starting from the specified index, against the pattern.
509 * Attempts to match the input string, starting from the specified index, against the pattern.
537 * Find the first matching substring of the input string that matches the pattern.
562 * Find the first matching substring of the input string that matches the pattern.
586 * Find the next pattern match in the input string. Begin searching
603 * Get the number of capturing groups in this regular expression's pattern.
621 * the pattern.
647 * the pattern.
675 * the pattern.
989 * With anchoring bounds, pattern anchors such as ^ and $ will match at the start
1039 * Replaces every substring of the input that matches the pattern
1043 * This method scans the input string looking for matches of the pattern.
1071 * Replaces every substring of the input that matches the pattern
1075 * This method scans the input string looking for matches of the pattern.
1098 * Replaces the first substring of the input that matches the pattern
1102 * This method scans the input string looking for a match of the pattern.
1130 * Replaces the first substring of the input that matches the pattern
1134 * This method scans the input string looking for a match of the pattern.
1299 * The pattern matches identify delimiters that separate the input
1307 * If the delimiter pattern includes capture groups, the captured text will
1310 * which ignores the presence of capture groups in the pattern.
1317 * This count includes the strings from capture groups in the delimiter pattern.
1360 * The pattern matches identify delimiters that separate the input
1404 * of the processor and the details of the specific pattern, but will
1441 * A limit is desirable because a malicious or poorly designed pattern can use
1542 * for more optimized loops where the pattern is known to only start, and the match