1 write to _pattern
System (1)
regex\system\text\regularexpressions\RegexBoyerMoore.cs (1)
66
_pattern
= pattern;
26 references to _pattern
System (26)
regex\system\text\regularexpressions\RegexBoyerMoore.cs (16)
232
if( text.Length - index <
_pattern
.Length) {
237
for( int i = 0; i <
_pattern
.Length; i++) {
238
Debug.Assert(textinfo.ToLower(
_pattern
[i]) ==
_pattern
[i], "pattern should be converted to lower case in constructor!");
239
if( textinfo.ToLower(text[index + i]) !=
_pattern
[i]) {
246
return(0 == String.CompareOrdinal(
_pattern
, 0, text, index,
_pattern
.Length));
256
if (index < beglimit || endlimit - index <
_pattern
.Length)
262
if (index > endlimit || index - beglimit <
_pattern
.Length)
265
return MatchPattern(text, index -
_pattern
.Length);
292
defadv =
_pattern
.Length;
293
startmatch =
_pattern
.Length - 1;
299
defadv = -
_pattern
.Length;
306
chMatch =
_pattern
[startmatch];
343
if (chTest !=
_pattern
[match]) {
369
return
_pattern
;
regex\system\text\regularexpressions\RegexCompiler.cs (10)
1245
last = _bmPrefix.
_pattern
.Length - 1;
1248
beforefirst = _bmPrefix.
_pattern
.Length;
1252
chLast = _bmPrefix.
_pattern
[last];
1263
Ldc(_bmPrefix.
_pattern
.Length - 1);
1267
Ldc(_bmPrefix.
_pattern
.Length);
1276
Ldc(_bmPrefix.
_pattern
.Length);
1278
Ldc(-_bmPrefix.
_pattern
.Length);
1339
for (i = _bmPrefix.
_pattern
.Length - 2; i >= 0; i--) {
1346
charindex = _bmPrefix.
_pattern
.Length - 1 - i;
1358
Ldc(_bmPrefix.
_pattern
[charindex]);