class java.util.concurrent.ConcurrentHashMap$Traverser<K, V>
  minor version: 0
  major version: 59
  flags: flags: (0x0020) ACC_SUPER
  this_class: java.util.concurrent.ConcurrentHashMap$Traverser
  super_class: java.lang.Object
{
  java.util.concurrent.ConcurrentHashMap$Node<K, V>[] tab;
    descriptor: [Ljava/util/concurrent/ConcurrentHashMap$Node;
    flags: (0x0000) 
    Signature: [Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;

  java.util.concurrent.ConcurrentHashMap$Node<K, V> next;
    descriptor: Ljava/util/concurrent/ConcurrentHashMap$Node;
    flags: (0x0000) 
    Signature: Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;

  java.util.concurrent.ConcurrentHashMap$TableStack<K, V> stack;
    descriptor: Ljava/util/concurrent/ConcurrentHashMap$TableStack;
    flags: (0x0000) 
    Signature: Ljava/util/concurrent/ConcurrentHashMap$TableStack<TK;TV;>;

  java.util.concurrent.ConcurrentHashMap$TableStack<K, V> spare;
    descriptor: Ljava/util/concurrent/ConcurrentHashMap$TableStack;
    flags: (0x0000) 
    Signature: Ljava/util/concurrent/ConcurrentHashMap$TableStack<TK;TV;>;

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

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

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

  final int baseSize;
    descriptor: I
    flags: (0x0010) ACC_FINAL

  void <init>(java.util.concurrent.ConcurrentHashMap$Node<K, V>[], int, int, );
    descriptor: ([Ljava/util/concurrent/ConcurrentHashMap$Node;III)V
    flags: (0x0000) 
    Code:
      stack=4, locals=5, args_size=5
        start local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
        start local 1 // java.util.concurrent.ConcurrentHashMap$Node[] tab
        start local 2 // int size
        start local 3 // int index
        start local 4 // int limit
         0: .line 3338
            aload 0 /* this */
            invokespecial java.lang.Object.<init>:()V
         1: .line 3339
            aload 0 /* this */
            aload 1 /* tab */
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.tab:[Ljava/util/concurrent/ConcurrentHashMap$Node;
         2: .line 3340
            aload 0 /* this */
            iload 2 /* size */
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.baseSize:I
         3: .line 3341
            aload 0 /* this */
            aload 0 /* this */
            iload 3 /* index */
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.baseIndex:I
         4: .line 3342
            aload 0 /* this */
            iload 4 /* limit */
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.baseLimit:I
         5: .line 3343
            aload 0 /* this */
            aconst_null
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
         6: .line 3344
            return
        end local 4 // int limit
        end local 3 // int index
        end local 2 // int size
        end local 1 // java.util.concurrent.ConcurrentHashMap$Node[] tab
        end local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    7     0   this  Ljava/util/concurrent/ConcurrentHashMap$Traverser<TK;TV;>;
            0    7     1    tab  [Ljava/util/concurrent/ConcurrentHashMap$Node;
            0    7     2   size  I
            0    7     3  index  I
            0    7     4  limit  I
    Signature: ([Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;III)V
    MethodParameters:
       Name  Flags
      tab    
      size   
      index  
      limit  

  final java.util.concurrent.ConcurrentHashMap$Node<K, V> advance();
    descriptor: ()Ljava/util/concurrent/ConcurrentHashMap$Node;
    flags: (0x0010) ACC_FINAL
    Code:
      stack=4, locals=5, args_size=1
        start local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
         0: .line 3351
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
            dup
            astore 1 /* e */
        start local 1 // java.util.concurrent.ConcurrentHashMap$Node e
         1: ifnull 3
         2: .line 3352
            aload 1 /* e */
            getfield java.util.concurrent.ConcurrentHashMap$Node.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
            astore 1 /* e */
         3: .line 3355
      StackMap locals: java.util.concurrent.ConcurrentHashMap$Node
      StackMap stack:
            aload 1 /* e */
            ifnull 5
         4: .line 3356
            aload 0 /* this */
            aload 1 /* e */
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
            areturn
         5: .line 3357
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.baseIndex:I
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.baseLimit:I
            if_icmpge 10
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.tab:[Ljava/util/concurrent/ConcurrentHashMap$Node;
            dup
            astore 2 /* t */
        start local 2 // java.util.concurrent.ConcurrentHashMap$Node[] t
         6: ifnull 10
         7: .line 3358
            aload 2 /* t */
            arraylength
            dup
            istore 4 /* n */
        start local 4 // int n
         8: aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
            dup
            istore 3 /* i */
        start local 3 // int i
         9: if_icmple 10
            iload 3 /* i */
            ifge 11
        end local 4 // int n
        end local 3 // int i
        end local 2 // java.util.concurrent.ConcurrentHashMap$Node[] t
        10: .line 3359
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            aconst_null
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.next:Ljava/util/concurrent/ConcurrentHashMap$Node;
            areturn
        start local 2 // java.util.concurrent.ConcurrentHashMap$Node[] t
        start local 3 // int i
        start local 4 // int n
        11: .line 3360
      StackMap locals: java.util.concurrent.ConcurrentHashMap$Node[] int int
      StackMap stack:
            aload 2 /* t */
            iload 3 /* i */
            invokestatic java.util.concurrent.ConcurrentHashMap.tabAt:([Ljava/util/concurrent/ConcurrentHashMap$Node;I)Ljava/util/concurrent/ConcurrentHashMap$Node;
            dup
            astore 1 /* e */
            ifnull 20
            aload 1 /* e */
            getfield java.util.concurrent.ConcurrentHashMap$Node.hash:I
            ifge 20
        12: .line 3361
            aload 1 /* e */
            instanceof java.util.concurrent.ConcurrentHashMap$ForwardingNode
            ifeq 17
        13: .line 3362
            aload 0 /* this */
            aload 1 /* e */
            checkcast java.util.concurrent.ConcurrentHashMap$ForwardingNode
            getfield java.util.concurrent.ConcurrentHashMap$ForwardingNode.nextTable:[Ljava/util/concurrent/ConcurrentHashMap$Node;
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.tab:[Ljava/util/concurrent/ConcurrentHashMap$Node;
        14: .line 3363
            aconst_null
            astore 1 /* e */
        15: .line 3364
            aload 0 /* this */
            aload 2 /* t */
            iload 3 /* i */
            iload 4 /* n */
            invokevirtual java.util.concurrent.ConcurrentHashMap$Traverser.pushState:([Ljava/util/concurrent/ConcurrentHashMap$Node;II)V
        16: .line 3365
            goto 3
        17: .line 3367
      StackMap locals:
      StackMap stack:
            aload 1 /* e */
            instanceof java.util.concurrent.ConcurrentHashMap$TreeBin
            ifeq 19
        18: .line 3368
            aload 1 /* e */
            checkcast java.util.concurrent.ConcurrentHashMap$TreeBin
            getfield java.util.concurrent.ConcurrentHashMap$TreeBin.first:Ljava/util/concurrent/ConcurrentHashMap$TreeNode;
            astore 1 /* e */
            goto 20
        19: .line 3370
      StackMap locals:
      StackMap stack:
            aconst_null
            astore 1 /* e */
        20: .line 3372
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.stack:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            ifnull 22
        21: .line 3373
            aload 0 /* this */
            iload 4 /* n */
            invokevirtual java.util.concurrent.ConcurrentHashMap$Traverser.recoverState:(I)V
            goto 3
        22: .line 3374
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            iload 3 /* i */
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.baseSize:I
            iadd
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
            iload 4 /* n */
            if_icmplt 3
        23: .line 3375
            aload 0 /* this */
            aload 0 /* this */
            dup
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.baseIndex:I
            iconst_1
            iadd
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.baseIndex:I
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
        end local 4 // int n
        end local 3 // int i
        end local 2 // java.util.concurrent.ConcurrentHashMap$Node[] t
        24: .line 3353
            goto 3
        end local 1 // java.util.concurrent.ConcurrentHashMap$Node e
        end local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   25     0  this  Ljava/util/concurrent/ConcurrentHashMap$Traverser<TK;TV;>;
            1   25     1     e  Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;
            6   10     2     t  [Ljava/util/concurrent/ConcurrentHashMap$Node;
           11   24     2     t  [Ljava/util/concurrent/ConcurrentHashMap$Node;
            9   10     3     i  I
           11   24     3     i  I
            8   10     4     n  I
           11   24     4     n  I
    Signature: ()Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;

  private void pushState(java.util.concurrent.ConcurrentHashMap$Node<K, V>[], int, );
    descriptor: ([Ljava/util/concurrent/ConcurrentHashMap$Node;II)V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=2, locals=5, args_size=4
        start local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
        start local 1 // java.util.concurrent.ConcurrentHashMap$Node[] t
        start local 2 // int i
        start local 3 // int n
         0: .line 3383
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.spare:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            astore 4 /* s */
        start local 4 // java.util.concurrent.ConcurrentHashMap$TableStack s
         1: .line 3384
            aload 4 /* s */
            ifnull 3
         2: .line 3385
            aload 0 /* this */
            aload 4 /* s */
            getfield java.util.concurrent.ConcurrentHashMap$TableStack.next:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.spare:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            goto 4
         3: .line 3387
      StackMap locals: java.util.concurrent.ConcurrentHashMap$TableStack
      StackMap stack:
            new java.util.concurrent.ConcurrentHashMap$TableStack
            dup
            invokespecial java.util.concurrent.ConcurrentHashMap$TableStack.<init>:()V
            astore 4 /* s */
         4: .line 3388
      StackMap locals:
      StackMap stack:
            aload 4 /* s */
            aload 1 /* t */
            putfield java.util.concurrent.ConcurrentHashMap$TableStack.tab:[Ljava/util/concurrent/ConcurrentHashMap$Node;
         5: .line 3389
            aload 4 /* s */
            iload 3 /* n */
            putfield java.util.concurrent.ConcurrentHashMap$TableStack.length:I
         6: .line 3390
            aload 4 /* s */
            iload 2 /* i */
            putfield java.util.concurrent.ConcurrentHashMap$TableStack.index:I
         7: .line 3391
            aload 4 /* s */
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.stack:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            putfield java.util.concurrent.ConcurrentHashMap$TableStack.next:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
         8: .line 3392
            aload 0 /* this */
            aload 4 /* s */
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.stack:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
         9: .line 3393
            return
        end local 4 // java.util.concurrent.ConcurrentHashMap$TableStack s
        end local 3 // int n
        end local 2 // int i
        end local 1 // java.util.concurrent.ConcurrentHashMap$Node[] t
        end local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   10     0  this  Ljava/util/concurrent/ConcurrentHashMap$Traverser<TK;TV;>;
            0   10     1     t  [Ljava/util/concurrent/ConcurrentHashMap$Node;
            0   10     2     i  I
            0   10     3     n  I
            1   10     4     s  Ljava/util/concurrent/ConcurrentHashMap$TableStack<TK;TV;>;
    Signature: ([Ljava/util/concurrent/ConcurrentHashMap$Node<TK;TV;>;II)V
    MethodParameters:
      Name  Flags
      t     
      i     
      n     

  private void recoverState(int);
    descriptor: (I)V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=4, locals=5, args_size=2
        start local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
        start local 1 // int n
         0: .line 3402
            goto 9
        start local 2 // java.util.concurrent.ConcurrentHashMap$TableStack s
        start local 3 // int len
         1: .line 3403
      StackMap locals: java.util.concurrent.ConcurrentHashMap$TableStack int
      StackMap stack:
            iload 3 /* len */
            istore 1 /* n */
         2: .line 3404
            aload 0 /* this */
            aload 2 /* s */
            getfield java.util.concurrent.ConcurrentHashMap$TableStack.index:I
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
         3: .line 3405
            aload 0 /* this */
            aload 2 /* s */
            getfield java.util.concurrent.ConcurrentHashMap$TableStack.tab:[Ljava/util/concurrent/ConcurrentHashMap$Node;
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.tab:[Ljava/util/concurrent/ConcurrentHashMap$Node;
         4: .line 3406
            aload 2 /* s */
            aconst_null
            putfield java.util.concurrent.ConcurrentHashMap$TableStack.tab:[Ljava/util/concurrent/ConcurrentHashMap$Node;
         5: .line 3407
            aload 2 /* s */
            getfield java.util.concurrent.ConcurrentHashMap$TableStack.next:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            astore 4 /* next */
        start local 4 // java.util.concurrent.ConcurrentHashMap$TableStack next
         6: .line 3408
            aload 2 /* s */
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.spare:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            putfield java.util.concurrent.ConcurrentHashMap$TableStack.next:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
         7: .line 3409
            aload 0 /* this */
            aload 4 /* next */
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.stack:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
         8: .line 3410
            aload 0 /* this */
            aload 2 /* s */
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.spare:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
        end local 4 // java.util.concurrent.ConcurrentHashMap$TableStack next
        end local 3 // int len
        end local 2 // java.util.concurrent.ConcurrentHashMap$TableStack s
         9: .line 3402
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.stack:Ljava/util/concurrent/ConcurrentHashMap$TableStack;
            dup
            astore 2 /* s */
        start local 2 // java.util.concurrent.ConcurrentHashMap$TableStack s
        10: ifnull 12
            aload 0 /* this */
            dup
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
            aload 2 /* s */
            getfield java.util.concurrent.ConcurrentHashMap$TableStack.length:I
            dup
            istore 3 /* len */
        start local 3 // int len
        11: iadd
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
            iload 1 /* n */
            if_icmpge 1
        end local 3 // int len
        12: .line 3412
      StackMap locals: java.util.concurrent.ConcurrentHashMap$TableStack
      StackMap stack:
            aload 2 /* s */
            ifnonnull 14
            aload 0 /* this */
            dup
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
            aload 0 /* this */
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.baseSize:I
            iadd
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
            iload 1 /* n */
            if_icmplt 14
        13: .line 3413
            aload 0 /* this */
            aload 0 /* this */
            dup
            getfield java.util.concurrent.ConcurrentHashMap$Traverser.baseIndex:I
            iconst_1
            iadd
            dup_x1
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.baseIndex:I
            putfield java.util.concurrent.ConcurrentHashMap$Traverser.index:I
        14: .line 3414
      StackMap locals:
      StackMap stack:
            return
        end local 2 // java.util.concurrent.ConcurrentHashMap$TableStack s
        end local 1 // int n
        end local 0 // java.util.concurrent.ConcurrentHashMap$Traverser this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   15     0  this  Ljava/util/concurrent/ConcurrentHashMap$Traverser<TK;TV;>;
            0   15     1     n  I
            1    9     2     s  Ljava/util/concurrent/ConcurrentHashMap$TableStack<TK;TV;>;
           10   15     2     s  Ljava/util/concurrent/ConcurrentHashMap$TableStack<TK;TV;>;
            1    9     3   len  I
           11   12     3   len  I
            6    9     4  next  Ljava/util/concurrent/ConcurrentHashMap$TableStack<TK;TV;>;
    MethodParameters:
      Name  Flags
      n     
}
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>Ljava/lang/Object;
SourceFile: "ConcurrentHashMap.java"
NestHost: java.util.concurrent.ConcurrentHashMap
InnerClasses:
  final ForwardingNode = java.util.concurrent.ConcurrentHashMap$ForwardingNode of java.util.concurrent.ConcurrentHashMap
  Node = java.util.concurrent.ConcurrentHashMap$Node of java.util.concurrent.ConcurrentHashMap
  final TableStack = java.util.concurrent.ConcurrentHashMap$TableStack of java.util.concurrent.ConcurrentHashMap
  Traverser = java.util.concurrent.ConcurrentHashMap$Traverser of java.util.concurrent.ConcurrentHashMap
  final TreeBin = java.util.concurrent.ConcurrentHashMap$TreeBin of java.util.concurrent.ConcurrentHashMap