Home | History | Annotate | Download | only in i18n

Lines Matching refs:pattern

236 //            This handles the common setup to be done after the Pattern is available.
414 // number of capture groups in the pattern.
666 // (without this test, a pattern with a zero-length match
714 // Note that it's perfectly OK for a pattern to have a zero-length
724 // (pattern begins with ^ or \A)
841 // Note that it's perfectly OK for a pattern to have a zero-length
870 // Note that it's perfectly OK for a pattern to have a zero-length
949 // (without this test, a pattern with a zero-length match
989 // Note that it's perfectly OK for a pattern to have a zero-length
999 // (pattern begins with ^ or \A)
1100 // Note that it's perfectly OK for a pattern to have a zero-length
1127 // Note that it's perfectly OK for a pattern to have a zero-length
1594 // pattern
1597 const RegexPattern &RegexMatcher::pattern() const {
2091 // Loop through the input text, searching for the delimiter pattern
2179 // If the delimiter pattern has capturing parentheses, the captured
2395 // to be big enough to hold at least one stack frame for the pattern,
2676 // Set the pattern index in the original stack frame from the operand value
2686 // savePatIdx An index into the compiled pattern. Goes into the original
2688 // new frame, this will be where we continue from in the pattern.
2756 int32_t op; // Operation from the compiled pattern, split into
2763 printf("Original Pattern: \"%s\"\n", CStr(StringFromUText(fPattern->fPattern))());
2772 // Cache frequently referenced items from the compiled pattern
2789 // Zero out the pattern's static data
2796 // Main loop for interpreting the compiled pattern.
2797 // One iteration of the loop per pattern operation performed.
2821 // Force a backtrack. In some circumstances, the pattern compiler
2822 // will notice that the pattern can't possibly match anything, and will
2846 // Strings require two slots in the compiled pattern, one for the
2893 // when we reach the end of the pattern.
2895 // The pattern matched, but not to the end of input. Try some more.
3523 // skip the pattern location counter past
3588 // skip the pattern location counter past
3624 // continue with the following pattern.
3651 // Loop Continuation: we will fall into the pattern following the loop
3654 // in the following pattern will try another iteration of the loop.
3850 // Case insensitive one char. The char from the pattern is already case folded.
3871 // Strings require two slots in the compiled pattern, one for the
3883 int32_t patternStringLen = opValue; // Length of the string from the pattern.
3942 // of this op in the pattern.
3946 // utf-8 fix to maximum match length. The pattern compiler assumes utf-16.
4029 // utf-8 fix to maximum match length. The pattern compiler assumes utf-16.
4107 // by the successful pattern match.
4124 // The following LOOP_C op emulates stack unwinding if the following pattern fails.
4159 // Peek ahead in the compiled pattern, to the URX_LOOP_C that
4171 // Then bump the pattern idx so the LOOP_C is skipped on the way out of here.
4181 // The following LOOP_C op emulates stack unwinding if the following pattern fails.
4220 // Peek ahead in the compiled pattern, to the URX_LOOP_C that
4232 // Then bump the pattern idx so the LOOP_C is skipped on the way out of here.
4279 // Trouble. The compiled pattern contains an entry with an
4332 int32_t op; // Operation from the compiled pattern, split into
4339 printf("Original Pattern: \"%s\"\n", CStr(StringFromUText(fPattern->fPattern))());
4348 // Cache frequently referenced items from the compiled pattern
4367 // Zero out the pattern's static data
4374 // Main loop for interpreting the compiled pattern.
4375 // One iteration of the loop per pattern operation performed.
4399 // Force a backtrack. In some circumstances, the pattern compiler
4400 // will notice that the pattern can't possibly match anything, and will
4423 // Strings require two slots in the compiled pattern, one for the
4468 // when we reach the end of the pattern.
4470 // The pattern matched, but not to the end of input. Try some more.
5068 // skip the pattern location counter past
5132 // skip the pattern location counter past
5168 // continue with the following pattern.
5194 // Loop Continuation: we will fall into the pattern following the loop
5197 // in the following pattern will try another iteration of the loop.
5395 // Strings require two slots in the compiled pattern, one for the
5406 int32_t patternStringLen = opValue; // Length of the string from the pattern.
5460 // of this op in the pattern.
5607 // by the successful pattern match.
5624 // The following LOOP_C op emulates stack unwinding if the following pattern fails.
5660 // Peek ahead in the compiled pattern, to the URX_LOOP_C that
5672 // Then bump the pattern idx so the LOOP_C is skipped on the way out of here.
5682 // The following LOOP_C op emulates stack unwinding if the following pattern fails.
5722 // Peek ahead in the compiled pattern, to the URX_LOOP_C that
5734 // Then bump the pattern idx so the LOOP_C is skipped on the way out of here.
5779 // Trouble. The compiled pattern contains an entry with an