class java.util.regex.Pattern$Start extends java.util.regex.Pattern$Node
minor version: 0
major version: 59
flags: flags: (0x0020) ACC_SUPER
this_class: java.util.regex.Pattern$Start
super_class: java.util.regex.Pattern$Node
{
int minLength;
descriptor: I
flags: (0x0000)
void <init>(java.util.regex.Pattern$Node);
descriptor: (Ljava/util/regex/Pattern$Node;)V
flags: (0x0000)
Code:
stack=2, locals=3, args_size=2
start local 0 start local 1 0: aload 0
invokespecial java.util.regex.Pattern$Node.<init>:()V
1: aload 0
aload 1
putfield java.util.regex.Pattern$Start.next:Ljava/util/regex/Pattern$Node;
2: new java.util.regex.Pattern$TreeInfo
dup
invokespecial java.util.regex.Pattern$TreeInfo.<init>:()V
astore 2
start local 2 3: aload 0
getfield java.util.regex.Pattern$Start.next:Ljava/util/regex/Pattern$Node;
aload 2
invokevirtual java.util.regex.Pattern$Node.study:(Ljava/util/regex/Pattern$TreeInfo;)Z
pop
4: aload 0
aload 2
getfield java.util.regex.Pattern$TreeInfo.minLength:I
putfield java.util.regex.Pattern$Start.minLength:I
5: return
end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 6 0 this Ljava/util/regex/Pattern$Start;
0 6 1 node Ljava/util/regex/Pattern$Node;
3 6 2 info Ljava/util/regex/Pattern$TreeInfo;
MethodParameters:
Name Flags
node
boolean match(java.util.regex.Matcher, int, java.lang.CharSequence);
descriptor: (Ljava/util/regex/Matcher;ILjava/lang/CharSequence;)Z
flags: (0x0000)
Code:
stack=4, locals=5, args_size=4
start local 0 start local 1 start local 2 start local 3 0: iload 2
aload 1
getfield java.util.regex.Matcher.to:I
aload 0
getfield java.util.regex.Pattern$Start.minLength:I
isub
if_icmple 3
1: aload 1
iconst_1
putfield java.util.regex.Matcher.hitEnd:Z
2: iconst_0
ireturn
3: StackMap locals:
StackMap stack:
aload 1
getfield java.util.regex.Matcher.to:I
aload 0
getfield java.util.regex.Pattern$Start.minLength:I
isub
istore 4
start local 4 4: goto 11
5: StackMap locals: int
StackMap stack:
aload 0
getfield java.util.regex.Pattern$Start.next:Ljava/util/regex/Pattern$Node;
aload 1
iload 2
aload 3
invokevirtual java.util.regex.Pattern$Node.match:(Ljava/util/regex/Matcher;ILjava/lang/CharSequence;)Z
ifeq 10
6: aload 1
iload 2
putfield java.util.regex.Matcher.first:I
7: aload 1
getfield java.util.regex.Matcher.groups:[I
iconst_0
aload 1
getfield java.util.regex.Matcher.first:I
iastore
8: aload 1
getfield java.util.regex.Matcher.groups:[I
iconst_1
aload 1
getfield java.util.regex.Matcher.last:I
iastore
9: iconst_1
ireturn
10: StackMap locals:
StackMap stack:
iinc 2 1
StackMap locals:
StackMap stack:
11: iload 2
iload 4
if_icmple 5
12: aload 1
iconst_1
putfield java.util.regex.Matcher.hitEnd:Z
13: iconst_0
ireturn
end local 4 end local 3 end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 14 0 this Ljava/util/regex/Pattern$Start;
0 14 1 matcher Ljava/util/regex/Matcher;
0 14 2 i I
0 14 3 seq Ljava/lang/CharSequence;
4 14 4 guard I
MethodParameters:
Name Flags
matcher
i
seq
boolean study(java.util.regex.Pattern$TreeInfo);
descriptor: (Ljava/util/regex/Pattern$TreeInfo;)Z
flags: (0x0000)
Code:
stack=2, locals=2, args_size=2
start local 0 start local 1 0: aload 0
getfield java.util.regex.Pattern$Start.next:Ljava/util/regex/Pattern$Node;
aload 1
invokevirtual java.util.regex.Pattern$Node.study:(Ljava/util/regex/Pattern$TreeInfo;)Z
pop
1: aload 1
iconst_0
putfield java.util.regex.Pattern$TreeInfo.maxValid:Z
2: aload 1
iconst_0
putfield java.util.regex.Pattern$TreeInfo.deterministic:Z
3: iconst_0
ireturn
end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 4 0 this Ljava/util/regex/Pattern$Start;
0 4 1 info Ljava/util/regex/Pattern$TreeInfo;
MethodParameters:
Name Flags
info
}
SourceFile: "Pattern.java"
NestHost: java.util.regex.Pattern
InnerClasses:
Node = java.util.regex.Pattern$Node of java.util.regex.Pattern
Start = java.util.regex.Pattern$Start of java.util.regex.Pattern
final TreeInfo = java.util.regex.Pattern$TreeInfo of java.util.regex.Pattern