http://fastutil.di.unimi.it/: fastutil extends the Java Collections Framework by providing type-specific maps, sets, lists and priority queues with a small memory footprint and fast access and insertion; provides also big (64-bit) arrays, sets and lists, and fast, practical I/O classes for binary and text files.
  • Sebastiano Vigna 
class it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator
  minor version: 0
  major version: 59
  flags: flags: (0x0020) ACC_SUPER
  this_class: it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator
  super_class: java.lang.Object
{
  it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry prev;
    descriptor: Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
    flags: (0x0000) 

  it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry next;
    descriptor: Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
    flags: (0x0000) 

  it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry curr;
    descriptor: Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
    flags: (0x0000) 

  int index;
    descriptor: I
    flags: (0x0000) 

  final it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap this$0;
    descriptor: Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap;
    flags: (0x1010) ACC_FINAL, ACC_SYNTHETIC

  void <init>(it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap);
    descriptor: (Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap;)V
    flags: (0x0000) 
    Code:
      stack=2, locals=2, args_size=2
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 977
            aload 0 /* this */
            aload 1
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.this$0:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap;
            aload 0 /* this */
            invokespecial java.lang.Object.<init>:()V
         1: .line 976
            aload 0 /* this */
            iconst_0
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
         2: .line 978
            aload 0 /* this */
            aload 1
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.firstEntry:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         3: .line 979
            return
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    4     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;
    MethodParameters:
        Name  Flags
      this$0  final

  void <init>(it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap, int);
    descriptor: (Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap;I)V
    flags: (0x0000) 
    Code:
      stack=3, locals=3, args_size=3
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
        start local 2 // int k
         0: .line 980
            aload 0 /* this */
            aload 1
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.this$0:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap;
            aload 0 /* this */
            invokespecial java.lang.Object.<init>:()V
         1: .line 976
            aload 0 /* this */
            iconst_0
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
         2: .line 981
            aload 0 /* this */
            aload 1
            iload 2 /* k */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.locateKey:(I)Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            dup_x1
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            ifnull 8
         3: .line 982
            aload 1
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry.key:I
            iload 2 /* k */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.compare:(II)I
            ifgt 7
         4: .line 983
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         5: .line 984
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry.next:()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         6: .line 985
            goto 8
         7: .line 986
      StackMap locals: it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap int
      StackMap stack:
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry.prev:()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         8: .line 988
      StackMap locals:
      StackMap stack:
            return
        end local 2 // int k
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    9     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;
            0    9     2     k  I
    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 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 990
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            ifnull 1
            iconst_1
            ireturn
      StackMap locals:
      StackMap stack:
         1: iconst_0
            ireturn
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    2     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  public boolean hasPrevious();
    descriptor: ()Z
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=1, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 993
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            ifnull 1
            iconst_1
            ireturn
      StackMap locals:
      StackMap stack:
         1: iconst_0
            ireturn
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    2     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  void updateNext();
    descriptor: ()V
    flags: (0x0000) 
    Code:
      stack=2, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 996
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry.next:()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         1: .line 997
            return
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    2     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry nextEntry();
    descriptor: ()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
    flags: (0x0000) 
    Code:
      stack=4, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 999
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.hasNext:()Z
            ifne 2
         1: .line 1000
            new java.util.NoSuchElementException
            dup
            invokespecial java.util.NoSuchElementException.<init>:()V
            athrow
         2: .line 1001
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            dup_x1
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         3: .line 1002
            aload 0 /* this */
            dup
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
            iconst_1
            iadd
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
         4: .line 1003
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.updateNext:()V
         5: .line 1004
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            areturn
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    6     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  void updatePrevious();
    descriptor: ()V
    flags: (0x0000) 
    Code:
      stack=2, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 1007
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry.prev:()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         1: .line 1008
            return
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    2     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry previousEntry();
    descriptor: ()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
    flags: (0x0000) 
    Code:
      stack=4, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 1010
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.hasPrevious:()Z
            ifne 2
         1: .line 1011
            new java.util.NoSuchElementException
            dup
            invokespecial java.util.NoSuchElementException.<init>:()V
            athrow
         2: .line 1012
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            dup_x1
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         3: .line 1013
            aload 0 /* this */
            dup
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
            iconst_1
            isub
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
         4: .line 1014
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.updatePrevious:()V
         5: .line 1015
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            areturn
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    6     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  public int nextIndex();
    descriptor: ()I
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=1, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 1018
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
            ireturn
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  public int previousIndex();
    descriptor: ()I
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=2, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 1021
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
            iconst_1
            isub
            ireturn
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  public void remove();
    descriptor: ()V
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=4, locals=1, args_size=1
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
         0: .line 1024
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            ifnonnull 2
         1: .line 1025
            new java.lang.IllegalStateException
            dup
            invokespecial java.lang.IllegalStateException.<init>:()V
            athrow
         2: .line 1030
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            if_acmpne 4
         3: .line 1031
            aload 0 /* this */
            dup
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
            iconst_1
            isub
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.index:I
         4: .line 1032
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            aload 0 /* this */
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            dup_x1
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.prev:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.next:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         5: .line 1033
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.updatePrevious:()V
         6: .line 1034
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.updateNext:()V
         7: .line 1035
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.this$0:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap;
            aload 0 /* this */
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            getfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry.key:I
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap.remove:(I)Z
            pop
         8: .line 1036
            aload 0 /* this */
            aconst_null
            putfield it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.curr:Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
         9: .line 1037
            return
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   10     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;

  public int skip(int);
    descriptor: (I)I
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=2, locals=3, args_size=2
        start local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
        start local 1 // int n
         0: .line 1039
            iload 1 /* n */
            istore 2 /* i */
        start local 2 // int i
         1: .line 1040
            goto 3
         2: .line 1041
      StackMap locals: int
      StackMap stack:
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.nextEntry:()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            pop
         3: .line 1040
      StackMap locals:
      StackMap stack:
            iload 2 /* i */
            iinc 2 /* i */ -1
            ifeq 4
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.hasNext:()Z
            ifne 2
         4: .line 1042
      StackMap locals:
      StackMap stack:
            iload 1 /* n */
            iload 2 /* i */
            isub
            iconst_1
            isub
            ireturn
        end local 2 // int i
        end local 1 // int n
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    5     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$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 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
        start local 1 // int n
         0: .line 1045
            iload 1 /* n */
            istore 2 /* i */
        start local 2 // int i
         1: .line 1046
            goto 3
         2: .line 1047
      StackMap locals: int
      StackMap stack:
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.previousEntry:()Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$Entry;
            pop
         3: .line 1046
      StackMap locals:
      StackMap stack:
            iload 2 /* i */
            iinc 2 /* i */ -1
            ifeq 4
            aload 0 /* this */
            invokevirtual it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator.hasPrevious:()Z
            ifne 2
         4: .line 1048
      StackMap locals:
      StackMap stack:
            iload 1 /* n */
            iload 2 /* i */
            isub
            iconst_1
            isub
            ireturn
        end local 2 // int i
        end local 1 // int n
        end local 0 // it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    5     0  this  Lit/unimi/dsi/fastutil/ints/Int2BooleanRBTreeMap$TreeIterator;
            0    5     1     n  I
            1    5     2     i  I
    MethodParameters:
      Name  Flags
      n     final
}
SourceFile: "Int2BooleanRBTreeMap.java"
NestHost: it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap
InnerClasses:
  private final Entry = it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$Entry of it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap
  private TreeIterator = it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap$TreeIterator of it.unimi.dsi.fastutil.ints.Int2BooleanRBTreeMap