Lines Matching defs:match
630 _sre.SRE_Pattern.match
650 PyObject *match;
667 match = pattern_new_match(module_state, self, &state, status);
669 return match;
693 PyObject *match;
711 match = pattern_new_match(module_state, self, &state, status);
713 return match;
725 Scan through string looking for a match, and return a corresponding match object instance.
739 PyObject *match;
755 match = pattern_new_match(module_state, self, &state, status);
757 return match;
835 /* don't bother to build a match object */
895 For each match, the iterator returns a match object.
999 /* get segment before this match */
1028 /* get segment following last match (even if empty) */
1062 PyObject* match;
1143 /* get segment before this match */
1156 /* pass match object through filter */
1157 match = pattern_new_match(module_state, self, &state, 1);
1158 if (!match)
1160 item = PyObject_CallOneArg(filter, match);
1161 Py_DECREF(match);
1184 /* get segment following last match */
1668 you can get is nonsensical match results. */
1989 /* match methods */
2163 Is used for groups that did not participate in the match.
2165 Return a tuple containing all the subgroups of the match, from 1.
2196 Is used for groups that did not participate in the match.
2198 Return a dictionary containing all the named subgroups of the match, keyed by the subgroup name.
2316 For match object m, return the 2-tuple (m.start(group), m.end(group)).
2389 "The result of re.match() and re.search().\n\
2394 Return subgroup(s) of the match by indices or names.\n\
2395 For 0 returns the entire match.");
2438 "<%s object; span=(%zd, %zd), match=%.50R>",
2452 /* create match object (from state object) */
2454 MatchObject* match;
2461 /* create match object (with room for extra group marks) */
2463 match = PyObject_GC_NewVar(MatchObject,
2466 if (!match)
2470 match->pattern = pattern;
2473 match->string = state->string;
2475 match->regs = NULL;
2476 match->groups = pattern->groups+1;
2483 match->mark[0] = ((char*) state->start - base) / n;
2484 match->mark[1] = ((char*) state->ptr - base) / n;
2488 match->mark[j+2] = ((char*) state->mark[j] - base) / n;
2489 match->mark[j+3] = ((char*) state->mark[j+1] - base) / n;
2492 if (match->mark[j+2] > match->mark[j+3]) {
2496 Py_DECREF(match);
2500 match->mark[j+2] = match->mark[j+3] = -1; /* undefined */
2502 match->pos = state->pos;
2503 match->endpos = state->endpos;
2505 match->lastindex = state->lastindex;
2507 PyObject_GC_Track(match);
2508 return (PyObject*) match;
2512 /* no match */
2573 _sre.SRE_Scanner.match
2586 PyObject* match;
2607 match = pattern_new_match(module_state, (PatternObject*) self->pattern,
2618 return match;
2636 PyObject* match;
2657 match = pattern_new_match(module_state, (PatternObject*) self->pattern,
2668 return match;
2859 "The string passed to match() or search()."},
2863 "The index into the string at which the RE engine started looking for a match."},