Lines Matching defs:has

546  * the input has the property <i>prop</i>, while <tt>\P{</tt><i>prop</i><tt>}</tt>
547 * does not match if the input has that property.
660 * the specified property has the name <tt>java<i>methodname</i></tt>.
914 /* Pattern has only two serialized components: The pattern string
994 * Index into the pattern string that keeps track of how much has been
1141 * the resulting array has just one element, namely the input sequence in
1453 // source has one character.
1627 if (has(CANON_EQ) && !has(LITERAL)) {
1651 if (! has(LITERAL))
1659 if (has(LITERAL)) {
1770 private boolean has(int f) {
1779 if (has(COMMENTS))
1798 if (has(COMMENTS))
1808 if (has(COMMENTS))
1827 if (has(COMMENTS))
1892 if (has(UNIX_LINES)) {
2051 if (has(MULTILINE)) {
2052 if (has(UNIX_LINES))
2062 if (has(UNIX_LINES))
2063 node = new UnixDollar(has(MULTILINE));
2065 node = new Dollar(has(MULTILINE));
2069 if (has(DOTALL)) {
2072 if (has(UNIX_LINES))
2248 if (has(CASE_INSENSITIVE))
2249 return new CIBackRef(refNum, has(UNICODE_CASE));
2287 if (create) root = new Bound(Bound.NONE, has(UNICODE_CHARACTER_CLASS));
2292 if (create) root = has(UNICODE_CHARACTER_CLASS)
2316 if (create) root = has(UNICODE_CHARACTER_CLASS)
2325 if (create) root = has(UNICODE_CHARACTER_CLASS)
2335 if (has(UNIX_LINES))
2345 if (create) root = new Bound(Bound.BOTH, has(UNICODE_CHARACTER_CLASS));
2350 if (create) root = has(UNICODE_CHARACTER_CLASS)
2372 if (has(CASE_INSENSITIVE))
2373 root = new CIBackRef(namedGroups().get(name), has(UNICODE_CASE));
2390 if (create) root = has(UNICODE_CHARACTER_CLASS)
2401 if (create) root = has(UNICODE_CHARACTER_CLASS)
2547 !(has(CASE_INSENSITIVE) && has(UNICODE_CASE) &&
2595 if (has(CASE_INSENSITIVE))
2679 if (has(UNICODE_CHARACTER_CLASS)) {
2746 throw error("named capturing group has 0 length name");
3289 if (has(CASE_INSENSITIVE)) {
3291 if (has(UNICODE_CASE)) {
3313 if (has(CASE_INSENSITIVE)) {
3314 if (has(UNICODE_CASE)) {
4018 if (has(UNICODE_CASE))
4179 // Reluctant match. At this point, the minimum has been satisfied.
5261 * all match the pattern has been found. If a character does not match,
5274 * side of the pattern has matched. When a bad character is found, the
5326 // No match. The array has already been