class it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator
minor version: 0
major version: 59
flags: flags: (0x0020) ACC_SUPER
this_class: it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator
super_class: java.lang.Object
{
it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry prev;
descriptor: Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
flags: (0x0000)
it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry next;
descriptor: Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
flags: (0x0000)
it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry curr;
descriptor: Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
flags: (0x0000)
int index;
descriptor: I
flags: (0x0000)
final it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap this$0;
descriptor: Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap;
flags: (0x1010) ACC_FINAL, ACC_SYNTHETIC
void <init>(it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap);
descriptor: (Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap;)V
flags: (0x0000)
Code:
stack=2, locals=2, args_size=2
start local 0 0: aload 0
aload 1
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.this$0:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap;
aload 0
invokespecial java.lang.Object.<init>:()V
1: aload 0
iconst_0
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
2: aload 0
aload 1
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap.firstEntry:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
3: return
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 4 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
MethodParameters:
Name Flags
this$0 final
void <init>(it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap, double);
descriptor: (Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap;D)V
flags: (0x0000)
Code:
stack=5, locals=4, args_size=3
start local 0 start local 2 0: aload 0
aload 1
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.this$0:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap;
aload 0
invokespecial java.lang.Object.<init>:()V
1: aload 0
iconst_0
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
2: aload 0
aload 1
dload 2
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap.locateKey:(D)Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
dup_x1
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
ifnull 8
3: aload 1
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry.key:D
dload 2
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap.compare:(DD)I
ifgt 7
4: aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
5: aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry.next:()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
6: goto 8
7: StackMap locals: it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap double
StackMap stack:
aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry.prev:()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
8: StackMap locals:
StackMap stack:
return
end local 2 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 9 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
0 9 2 k D
MethodParameters:
Name Flags
this$0 final
k final
public boolean hasNext();
descriptor: ()Z
flags: (0x0001) ACC_PUBLIC
Code:
stack=1, locals=1, args_size=1
start local 0 0: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
ifnull 1
iconst_1
ireturn
StackMap locals:
StackMap stack:
1: iconst_0
ireturn
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 2 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
public boolean hasPrevious();
descriptor: ()Z
flags: (0x0001) ACC_PUBLIC
Code:
stack=1, locals=1, args_size=1
start local 0 0: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
ifnull 1
iconst_1
ireturn
StackMap locals:
StackMap stack:
1: iconst_0
ireturn
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 2 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
void updateNext();
descriptor: ()V
flags: (0x0000)
Code:
stack=2, locals=1, args_size=1
start local 0 0: aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry.next:()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
1: return
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 2 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry nextEntry();
descriptor: ()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
flags: (0x0000)
Code:
stack=4, locals=1, args_size=1
start local 0 0: aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.hasNext:()Z
ifne 2
1: new java.util.NoSuchElementException
dup
invokespecial java.util.NoSuchElementException.<init>:()V
athrow
2: StackMap locals:
StackMap stack:
aload 0
aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
dup_x1
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
3: aload 0
dup
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
iconst_1
iadd
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
4: aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.updateNext:()V
5: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
areturn
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 6 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
void updatePrevious();
descriptor: ()V
flags: (0x0000)
Code:
stack=2, locals=1, args_size=1
start local 0 0: aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry.prev:()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
1: return
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 2 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry previousEntry();
descriptor: ()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
flags: (0x0000)
Code:
stack=4, locals=1, args_size=1
start local 0 0: aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.hasPrevious:()Z
ifne 2
1: new java.util.NoSuchElementException
dup
invokespecial java.util.NoSuchElementException.<init>:()V
athrow
2: StackMap locals:
StackMap stack:
aload 0
aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
dup_x1
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
3: aload 0
dup
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
iconst_1
isub
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
4: aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.updatePrevious:()V
5: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
areturn
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 6 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
public int nextIndex();
descriptor: ()I
flags: (0x0001) ACC_PUBLIC
Code:
stack=1, locals=1, args_size=1
start local 0 0: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
ireturn
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 1 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
public int previousIndex();
descriptor: ()I
flags: (0x0001) ACC_PUBLIC
Code:
stack=2, locals=1, args_size=1
start local 0 0: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
iconst_1
isub
ireturn
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 1 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
public void remove();
descriptor: ()V
flags: (0x0001) ACC_PUBLIC
Code:
stack=4, locals=1, args_size=1
start local 0 0: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
ifnonnull 2
1: new java.lang.IllegalStateException
dup
invokespecial java.lang.IllegalStateException.<init>:()V
athrow
2: StackMap locals:
StackMap stack:
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
if_acmpne 4
3: aload 0
dup
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
iconst_1
isub
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.index:I
4: StackMap locals:
StackMap stack:
aload 0
aload 0
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
dup_x1
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
5: aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.updatePrevious:()V
6: aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.updateNext:()V
7: aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.this$0:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap;
aload 0
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
getfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry.key:D
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap.remove:(D)Z
pop
8: aload 0
aconst_null
putfield it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
9: return
end local 0 LocalVariableTable:
Start End Slot Name Signature
0 10 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
public int skip(int);
descriptor: (I)I
flags: (0x0001) ACC_PUBLIC
Code:
stack=2, locals=3, args_size=2
start local 0 start local 1 0: iload 1
istore 2
start local 2 1: goto 3
2: StackMap locals: int
StackMap stack:
aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.nextEntry:()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
pop
3: StackMap locals:
StackMap stack:
iload 2
iinc 2 -1
ifeq 4
aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.hasNext:()Z
ifne 2
4: StackMap locals:
StackMap stack:
iload 1
iload 2
isub
iconst_1
isub
ireturn
end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 5 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
0 5 1 n I
1 5 2 i I
MethodParameters:
Name Flags
n final
public int back(int);
descriptor: (I)I
flags: (0x0001) ACC_PUBLIC
Code:
stack=2, locals=3, args_size=2
start local 0 start local 1 0: iload 1
istore 2
start local 2 1: goto 3
2: StackMap locals: int
StackMap stack:
aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.previousEntry:()Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$Entry;
pop
3: StackMap locals:
StackMap stack:
iload 2
iinc 2 -1
ifeq 4
aload 0
invokevirtual it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator.hasPrevious:()Z
ifne 2
4: StackMap locals:
StackMap stack:
iload 1
iload 2
isub
iconst_1
isub
ireturn
end local 2 end local 1 end local 0 LocalVariableTable:
Start End Slot Name Signature
0 5 0 this Lit/unimi/dsi/fastutil/doubles/Double2BooleanAVLTreeMap$TreeIterator;
0 5 1 n I
1 5 2 i I
MethodParameters:
Name Flags
n final
}
SourceFile: "Double2BooleanAVLTreeMap.java"
NestHost: it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap
InnerClasses:
private final Entry = it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$Entry of it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap
private TreeIterator = it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap$TreeIterator of it.unimi.dsi.fastutil.doubles.Double2BooleanAVLTreeMap