final class java.util.HashMap$TreeNode<K, V> extends java.util.LinkedHashMap$Entry<K, V>
  minor version: 0
  major version: 59
  flags: flags: (0x0030) ACC_FINAL, ACC_SUPER
  this_class: java.util.HashMap$TreeNode
  super_class: java.util.LinkedHashMap$Entry
{
  java.util.HashMap$TreeNode<K, V> parent;
    descriptor: Ljava/util/HashMap$TreeNode;
    flags: (0x0000) 
    Signature: Ljava/util/HashMap$TreeNode<TK;TV;>;

  java.util.HashMap$TreeNode<K, V> left;
    descriptor: Ljava/util/HashMap$TreeNode;
    flags: (0x0000) 
    Signature: Ljava/util/HashMap$TreeNode<TK;TV;>;

  java.util.HashMap$TreeNode<K, V> right;
    descriptor: Ljava/util/HashMap$TreeNode;
    flags: (0x0000) 
    Signature: Ljava/util/HashMap$TreeNode<TK;TV;>;

  java.util.HashMap$TreeNode<K, V> prev;
    descriptor: Ljava/util/HashMap$TreeNode;
    flags: (0x0000) 
    Signature: Ljava/util/HashMap$TreeNode<TK;TV;>;

  boolean red;
    descriptor: Z
    flags: (0x0000) 

  static final boolean $assertionsDisabled;
    descriptor: Z
    flags: (0x1018) ACC_STATIC, ACC_FINAL, ACC_SYNTHETIC

  static void <clinit>();
    descriptor: ()V
    flags: (0x0008) ACC_STATIC
    Code:
      stack=1, locals=0, args_size=0
         0: .line 1854
            ldc Ljava/util/HashMap;
            invokevirtual java.lang.Class.desiredAssertionStatus:()Z
            ifne 1
            iconst_1
            goto 2
      StackMap locals:
      StackMap stack:
         1: iconst_0
      StackMap locals:
      StackMap stack: int
         2: putstatic java.util.HashMap$TreeNode.$assertionsDisabled:Z
            return
      LocalVariableTable:
        Start  End  Slot  Name  Signature

  void <init>(int, K, V, java.util.HashMap$Node<K, V>);
    descriptor: (ILjava/lang/Object;Ljava/lang/Object;Ljava/util/HashMap$Node;)V
    flags: (0x0000) 
    Code:
      stack=5, locals=5, args_size=5
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // int hash
        start local 2 // java.lang.Object key
        start local 3 // java.lang.Object val
        start local 4 // java.util.HashMap$Node next
         0: .line 1861
            aload 0 /* this */
            iload 1 /* hash */
            aload 2 /* key */
            aload 3 /* val */
            aload 4 /* next */
            invokespecial java.util.LinkedHashMap$Entry.<init>:(ILjava/lang/Object;Ljava/lang/Object;Ljava/util/HashMap$Node;)V
         1: .line 1862
            return
        end local 4 // java.util.HashMap$Node next
        end local 3 // java.lang.Object val
        end local 2 // java.lang.Object key
        end local 1 // int hash
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    2     0  this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0    2     1  hash  I
            0    2     2   key  TK;
            0    2     3   val  TV;
            0    2     4  next  Ljava/util/HashMap$Node<TK;TV;>;
    Signature: (ITK;TV;Ljava/util/HashMap$Node<TK;TV;>;)V
    MethodParameters:
      Name  Flags
      hash  
      key   
      val   
      next  

  final java.util.HashMap$TreeNode<K, V> root();
    descriptor: ()Ljava/util/HashMap$TreeNode;
    flags: (0x0010) ACC_FINAL
    Code:
      stack=2, locals=3, args_size=1
        start local 0 // java.util.HashMap$TreeNode this
         0: .line 1868
            aload 0 /* this */
            astore 1 /* r */
        start local 1 // java.util.HashMap$TreeNode r
         1: .line 1869
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 1 /* r */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* p */
        start local 2 // java.util.HashMap$TreeNode p
         2: ifnonnull 4
         3: .line 1870
            aload 1 /* r */
            areturn
         4: .line 1871
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 2 /* p */
            astore 1 /* r */
        end local 2 // java.util.HashMap$TreeNode p
         5: .line 1868
            goto 1
        end local 1 // java.util.HashMap$TreeNode r
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    6     0  this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            1    6     1     r  Ljava/util/HashMap$TreeNode<TK;TV;>;
            2    5     2     p  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: ()Ljava/util/HashMap$TreeNode<TK;TV;>;

  static <K, V> void moveRootToFront(java.util.HashMap$Node<K, V>[], java.util.HashMap$TreeNode<K, V>);
    descriptor: ([Ljava/util/HashMap$Node;Ljava/util/HashMap$TreeNode;)V
    flags: (0x0008) ACC_STATIC
    Code:
      stack=3, locals=7, args_size=2
        start local 0 // java.util.HashMap$Node[] tab
        start local 1 // java.util.HashMap$TreeNode root
         0: .line 1880
            aload 1 /* root */
            ifnull 17
            aload 0 /* tab */
            ifnull 17
            aload 0 /* tab */
            arraylength
            dup
            istore 2 /* n */
        start local 2 // int n
         1: ifle 17
         2: .line 1881
            iload 2 /* n */
            iconst_1
            isub
            aload 1 /* root */
            getfield java.util.HashMap$TreeNode.hash:I
            iand
            istore 3 /* index */
        start local 3 // int index
         3: .line 1882
            aload 0 /* tab */
            iload 3 /* index */
            aaload
            checkcast java.util.HashMap$TreeNode
            astore 4 /* first */
        start local 4 // java.util.HashMap$TreeNode first
         4: .line 1883
            aload 1 /* root */
            aload 4 /* first */
            if_acmpeq 16
         5: .line 1885
            aload 0 /* tab */
            iload 3 /* index */
            aload 1 /* root */
            aastore
         6: .line 1886
            aload 1 /* root */
            getfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
            astore 6 /* rp */
        start local 6 // java.util.HashMap$TreeNode rp
         7: .line 1887
            aload 1 /* root */
            getfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
            dup
            astore 5 /* rn */
        start local 5 // java.util.HashMap$Node rn
         8: ifnull 10
         9: .line 1888
            aload 5 /* rn */
            checkcast java.util.HashMap$TreeNode
            aload 6 /* rp */
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
        10: .line 1889
      StackMap locals: java.util.HashMap$Node[] java.util.HashMap$TreeNode int int java.util.HashMap$TreeNode java.util.HashMap$Node java.util.HashMap$TreeNode
      StackMap stack:
            aload 6 /* rp */
            ifnull 12
        11: .line 1890
            aload 6 /* rp */
            aload 5 /* rn */
            putfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
        12: .line 1891
      StackMap locals:
      StackMap stack:
            aload 4 /* first */
            ifnull 14
        13: .line 1892
            aload 4 /* first */
            aload 1 /* root */
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
        14: .line 1893
      StackMap locals:
      StackMap stack:
            aload 1 /* root */
            aload 4 /* first */
            putfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
        15: .line 1894
            aload 1 /* root */
            aconst_null
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
        end local 6 // java.util.HashMap$TreeNode rp
        end local 5 // java.util.HashMap$Node rn
        16: .line 1896
      StackMap locals:
      StackMap stack:
            getstatic java.util.HashMap$TreeNode.$assertionsDisabled:Z
            ifne 17
            aload 1 /* root */
            invokestatic java.util.HashMap$TreeNode.checkInvariants:(Ljava/util/HashMap$TreeNode;)Z
            ifne 17
            new java.lang.AssertionError
            dup
            invokespecial java.lang.AssertionError.<init>:()V
            athrow
        end local 4 // java.util.HashMap$TreeNode first
        end local 3 // int index
        end local 2 // int n
        17: .line 1898
      StackMap locals:
      StackMap stack:
            return
        end local 1 // java.util.HashMap$TreeNode root
        end local 0 // java.util.HashMap$Node[] tab
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0   18     0    tab  [Ljava/util/HashMap$Node;
            0   18     1   root  Ljava/util/HashMap$TreeNode<TK;TV;>;
            1   17     2      n  I
            3   17     3  index  I
            4   17     4  first  Ljava/util/HashMap$TreeNode<TK;TV;>;
            8   16     5     rn  Ljava/util/HashMap$Node<TK;TV;>;
            7   16     6     rp  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>([Ljava/util/HashMap$Node<TK;TV;>;Ljava/util/HashMap$TreeNode<TK;TV;>;)V
    MethodParameters:
      Name  Flags
      tab   
      root  

  final java.util.HashMap$TreeNode<K, V> find(int, , java.lang.Class<?>);
    descriptor: (ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/HashMap$TreeNode;
    flags: (0x0010) ACC_FINAL
    Code:
      stack=4, locals=11, args_size=4
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // int h
        start local 2 // java.lang.Object k
        start local 3 // java.lang.Class kc
         0: .line 1906
            aload 0 /* this */
            astore 4 /* p */
        start local 4 // java.util.HashMap$TreeNode p
         1: .line 1909
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 4 /* p */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            astore 8 /* pl */
        start local 8 // java.util.HashMap$TreeNode pl
         2: aload 4 /* p */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            astore 9 /* pr */
        start local 9 // java.util.HashMap$TreeNode pr
         3: .line 1910
            aload 4 /* p */
            getfield java.util.HashMap$TreeNode.hash:I
            dup
            istore 5 /* ph */
        start local 5 // int ph
         4: iload 1 /* h */
            if_icmple 6
         5: .line 1911
            aload 8 /* pl */
            astore 4 /* p */
            goto 26
         6: .line 1912
      StackMap locals: java.util.HashMap$TreeNode int java.lang.Object java.lang.Class java.util.HashMap$TreeNode int top top java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            iload 5 /* ph */
            iload 1 /* h */
            if_icmpge 8
         7: .line 1913
            aload 9 /* pr */
            astore 4 /* p */
            goto 26
         8: .line 1914
      StackMap locals:
      StackMap stack:
            aload 4 /* p */
            getfield java.util.HashMap$TreeNode.key:Ljava/lang/Object;
            dup
            astore 7 /* pk */
        start local 7 // java.lang.Object pk
         9: aload 2 /* k */
            if_acmpeq 10
            aload 2 /* k */
            ifnull 11
            aload 2 /* k */
            aload 7 /* pk */
            invokevirtual java.lang.Object.equals:(Ljava/lang/Object;)Z
            ifeq 11
        10: .line 1915
      StackMap locals: java.util.HashMap$TreeNode int java.lang.Object java.lang.Class java.util.HashMap$TreeNode int top java.lang.Object java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 4 /* p */
            areturn
        11: .line 1916
      StackMap locals:
      StackMap stack:
            aload 8 /* pl */
            ifnonnull 13
        12: .line 1917
            aload 9 /* pr */
            astore 4 /* p */
            goto 26
        13: .line 1918
      StackMap locals:
      StackMap stack:
            aload 9 /* pr */
            ifnonnull 15
        14: .line 1919
            aload 8 /* pl */
            astore 4 /* p */
            goto 26
        15: .line 1920
      StackMap locals:
      StackMap stack:
            aload 3 /* kc */
            ifnonnull 17
        16: .line 1921
            aload 2 /* k */
            invokestatic java.util.HashMap.comparableClassFor:(Ljava/lang/Object;)Ljava/lang/Class;
            dup
            astore 3 /* kc */
            ifnull 22
        17: .line 1922
      StackMap locals:
      StackMap stack:
            aload 3 /* kc */
            aload 2 /* k */
            aload 7 /* pk */
            invokestatic java.util.HashMap.compareComparables:(Ljava/lang/Class;Ljava/lang/Object;Ljava/lang/Object;)I
            dup
            istore 6 /* dir */
        start local 6 // int dir
        18: ifeq 22
        19: .line 1923
            iload 6 /* dir */
            ifge 20
            aload 8 /* pl */
            goto 21
      StackMap locals: java.util.HashMap$TreeNode int java.lang.Object java.lang.Class java.util.HashMap$TreeNode int int java.lang.Object java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
        20: aload 9 /* pr */
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        21: astore 4 /* p */
            goto 26
        end local 6 // int dir
        22: .line 1924
      StackMap locals: java.util.HashMap$TreeNode int java.lang.Object java.lang.Class java.util.HashMap$TreeNode int top java.lang.Object java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 9 /* pr */
            iload 1 /* h */
            aload 2 /* k */
            aload 3 /* kc */
            invokevirtual java.util.HashMap$TreeNode.find:(ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/HashMap$TreeNode;
            dup
            astore 10 /* q */
        start local 10 // java.util.HashMap$TreeNode q
        23: ifnull 25
        24: .line 1925
            aload 10 /* q */
            areturn
        25: .line 1927
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 8 /* pl */
            astore 4 /* p */
        end local 10 // java.util.HashMap$TreeNode q
        end local 9 // java.util.HashMap$TreeNode pr
        end local 8 // java.util.HashMap$TreeNode pl
        end local 7 // java.lang.Object pk
        end local 5 // int ph
        26: .line 1928
      StackMap locals: java.util.HashMap$TreeNode int java.lang.Object java.lang.Class java.util.HashMap$TreeNode
      StackMap stack:
            aload 4 /* p */
            ifnonnull 1
        27: .line 1929
            aconst_null
            areturn
        end local 4 // java.util.HashMap$TreeNode p
        end local 3 // java.lang.Class kc
        end local 2 // java.lang.Object k
        end local 1 // int h
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   28     0  this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   28     1     h  I
            0   28     2     k  Ljava/lang/Object;
            0   28     3    kc  Ljava/lang/Class<*>;
            1   28     4     p  Ljava/util/HashMap$TreeNode<TK;TV;>;
            4   26     5    ph  I
           18   22     6   dir  I
            9   26     7    pk  TK;
            2   26     8    pl  Ljava/util/HashMap$TreeNode<TK;TV;>;
            3   26     9    pr  Ljava/util/HashMap$TreeNode<TK;TV;>;
           23   26    10     q  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: (ILjava/lang/Object;Ljava/lang/Class<*>;)Ljava/util/HashMap$TreeNode<TK;TV;>;
    MethodParameters:
      Name  Flags
      h     
      k     
      kc    

  final java.util.HashMap$TreeNode<K, V> getTreeNode(int, );
    descriptor: (ILjava/lang/Object;)Ljava/util/HashMap$TreeNode;
    flags: (0x0010) ACC_FINAL
    Code:
      stack=4, locals=3, args_size=3
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // int h
        start local 2 // java.lang.Object k
         0: .line 1936
            aload 0 /* this */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            ifnull 1
            aload 0 /* this */
            invokevirtual java.util.HashMap$TreeNode.root:()Ljava/util/HashMap$TreeNode;
            goto 2
      StackMap locals:
      StackMap stack:
         1: aload 0 /* this */
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
         2: iload 1 /* h */
            aload 2 /* k */
            aconst_null
            invokevirtual java.util.HashMap$TreeNode.find:(ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/HashMap$TreeNode;
            areturn
        end local 2 // java.lang.Object k
        end local 1 // int h
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    3     0  this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0    3     1     h  I
            0    3     2     k  Ljava/lang/Object;
    Signature: (ILjava/lang/Object;)Ljava/util/HashMap$TreeNode<TK;TV;>;
    MethodParameters:
      Name  Flags
      h     
      k     

  static int tieBreakOrder(java.lang.Object, java.lang.Object);
    descriptor: (Ljava/lang/Object;Ljava/lang/Object;)I
    flags: (0x0008) ACC_STATIC
    Code:
      stack=2, locals=3, args_size=2
        start local 0 // java.lang.Object a
        start local 1 // java.lang.Object b
         0: .line 1948
            aload 0 /* a */
            ifnull 5
            aload 1 /* b */
            ifnull 5
         1: .line 1949
            aload 0 /* a */
            invokevirtual java.lang.Object.getClass:()Ljava/lang/Class;
            invokevirtual java.lang.Class.getName:()Ljava/lang/String;
         2: .line 1950
            aload 1 /* b */
            invokevirtual java.lang.Object.getClass:()Ljava/lang/Class;
            invokevirtual java.lang.Class.getName:()Ljava/lang/String;
            invokevirtual java.lang.String.compareTo:(Ljava/lang/String;)I
         3: .line 1949
            dup
            istore 2 /* d */
        start local 2 // int d
         4: ifne 9
        end local 2 // int d
         5: .line 1951
      StackMap locals:
      StackMap stack:
            aload 0 /* a */
            invokestatic java.lang.System.identityHashCode:(Ljava/lang/Object;)I
            aload 1 /* b */
            invokestatic java.lang.System.identityHashCode:(Ljava/lang/Object;)I
            if_icmpgt 7
         6: .line 1952
            iconst_m1
            goto 8
      StackMap locals:
      StackMap stack:
         7: iconst_1
         8: .line 1951
      StackMap locals:
      StackMap stack: int
            istore 2 /* d */
        start local 2 // int d
         9: .line 1953
      StackMap locals: int
      StackMap stack:
            iload 2 /* d */
            ireturn
        end local 2 // int d
        end local 1 // java.lang.Object b
        end local 0 // java.lang.Object a
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   10     0     a  Ljava/lang/Object;
            0   10     1     b  Ljava/lang/Object;
            4    5     2     d  I
            9   10     2     d  I
    MethodParameters:
      Name  Flags
      a     
      b     

  final void treeify(java.util.HashMap$Node<K, V>[]);
    descriptor: ([Ljava/util/HashMap$Node;)V
    flags: (0x0010) ACC_FINAL
    Code:
      stack=4, locals=13, args_size=2
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // java.util.HashMap$Node[] tab
         0: .line 1960
            aconst_null
            astore 2 /* root */
        start local 2 // java.util.HashMap$TreeNode root
         1: .line 1961
            aload 0 /* this */
            astore 3 /* x */
        start local 3 // java.util.HashMap$TreeNode x
         2: goto 37
         3: .line 1962
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 3 /* x */
            getfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
            checkcast java.util.HashMap$TreeNode
            astore 4 /* next */
        start local 4 // java.util.HashMap$TreeNode next
         4: .line 1963
            aload 3 /* x */
            aload 3 /* x */
            aconst_null
            dup_x1
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
         5: .line 1964
            aload 2 /* root */
            ifnonnull 10
         6: .line 1965
            aload 3 /* x */
            aconst_null
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
         7: .line 1966
            aload 3 /* x */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
         8: .line 1967
            aload 3 /* x */
            astore 2 /* root */
         9: .line 1968
            goto 36
        10: .line 1970
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 3 /* x */
            getfield java.util.HashMap$TreeNode.key:Ljava/lang/Object;
            astore 5 /* k */
        start local 5 // java.lang.Object k
        11: .line 1971
            aload 3 /* x */
            getfield java.util.HashMap$TreeNode.hash:I
            istore 6 /* h */
        start local 6 // int h
        12: .line 1972
            aconst_null
            astore 7 /* kc */
        start local 7 // java.lang.Class kc
        13: .line 1973
            aload 2 /* root */
            astore 8 /* p */
        start local 8 // java.util.HashMap$TreeNode p
        14: .line 1975
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$Node[] java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.lang.Object int java.lang.Class java.util.HashMap$TreeNode
      StackMap stack:
            aload 8 /* p */
            getfield java.util.HashMap$TreeNode.key:Ljava/lang/Object;
            astore 11 /* pk */
        start local 11 // java.lang.Object pk
        15: .line 1976
            aload 8 /* p */
            getfield java.util.HashMap$TreeNode.hash:I
            dup
            istore 10 /* ph */
        start local 10 // int ph
        16: iload 6 /* h */
            if_icmple 19
        17: .line 1977
            iconst_m1
            istore 9 /* dir */
        start local 9 // int dir
        18: goto 27
        end local 9 // int dir
        19: .line 1978
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$Node[] java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.lang.Object int java.lang.Class java.util.HashMap$TreeNode top int java.lang.Object
      StackMap stack:
            iload 10 /* ph */
            iload 6 /* h */
            if_icmpge 22
        20: .line 1979
            iconst_1
            istore 9 /* dir */
        start local 9 // int dir
        21: goto 27
        end local 9 // int dir
        22: .line 1980
      StackMap locals:
      StackMap stack:
            aload 7 /* kc */
            ifnonnull 24
        23: .line 1981
            aload 5 /* k */
            invokestatic java.util.HashMap.comparableClassFor:(Ljava/lang/Object;)Ljava/lang/Class;
            dup
            astore 7 /* kc */
            ifnull 26
        24: .line 1982
      StackMap locals:
      StackMap stack:
            aload 7 /* kc */
            aload 5 /* k */
            aload 11 /* pk */
            invokestatic java.util.HashMap.compareComparables:(Ljava/lang/Class;Ljava/lang/Object;Ljava/lang/Object;)I
            dup
            istore 9 /* dir */
        start local 9 // int dir
        25: ifne 27
        end local 9 // int dir
        26: .line 1983
      StackMap locals:
      StackMap stack:
            aload 5 /* k */
            aload 11 /* pk */
            invokestatic java.util.HashMap$TreeNode.tieBreakOrder:(Ljava/lang/Object;Ljava/lang/Object;)I
            istore 9 /* dir */
        start local 9 // int dir
        27: .line 1985
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$Node[] java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.lang.Object int java.lang.Class java.util.HashMap$TreeNode int int java.lang.Object
      StackMap stack:
            aload 8 /* p */
            astore 12 /* xp */
        start local 12 // java.util.HashMap$TreeNode xp
        28: .line 1986
            iload 9 /* dir */
            ifgt 29
            aload 8 /* p */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 30
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
        29: aload 8 /* p */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        30: dup
            astore 8 /* p */
            ifnonnull 14
        31: .line 1987
            aload 3 /* x */
            aload 12 /* xp */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        32: .line 1988
            iload 9 /* dir */
            ifgt 34
        33: .line 1989
            aload 12 /* xp */
            aload 3 /* x */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 35
        34: .line 1991
      StackMap locals:
      StackMap stack:
            aload 12 /* xp */
            aload 3 /* x */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        35: .line 1992
      StackMap locals:
      StackMap stack:
            aload 2 /* root */
            aload 3 /* x */
            invokestatic java.util.HashMap$TreeNode.balanceInsertion:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 2 /* root */
        end local 12 // java.util.HashMap$TreeNode xp
        end local 11 // java.lang.Object pk
        end local 10 // int ph
        end local 9 // int dir
        end local 8 // java.util.HashMap$TreeNode p
        end local 7 // java.lang.Class kc
        end local 6 // int h
        end local 5 // java.lang.Object k
        36: .line 1961
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$Node[] java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 4 /* next */
            astore 3 /* x */
        end local 4 // java.util.HashMap$TreeNode next
      StackMap locals:
      StackMap stack:
        37: aload 3 /* x */
            ifnonnull 3
        end local 3 // java.util.HashMap$TreeNode x
        38: .line 1998
            aload 1 /* tab */
            aload 2 /* root */
            invokestatic java.util.HashMap$TreeNode.moveRootToFront:([Ljava/util/HashMap$Node;Ljava/util/HashMap$TreeNode;)V
        39: .line 1999
            return
        end local 2 // java.util.HashMap$TreeNode root
        end local 1 // java.util.HashMap$Node[] tab
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   40     0  this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   40     1   tab  [Ljava/util/HashMap$Node;
            1   40     2  root  Ljava/util/HashMap$TreeNode<TK;TV;>;
            2   38     3     x  Ljava/util/HashMap$TreeNode<TK;TV;>;
            4   37     4  next  Ljava/util/HashMap$TreeNode<TK;TV;>;
           11   36     5     k  TK;
           12   36     6     h  I
           13   36     7    kc  Ljava/lang/Class<*>;
           14   36     8     p  Ljava/util/HashMap$TreeNode<TK;TV;>;
           18   19     9   dir  I
           21   22     9   dir  I
           25   26     9   dir  I
           27   36     9   dir  I
           16   36    10    ph  I
           15   36    11    pk  TK;
           28   36    12    xp  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: ([Ljava/util/HashMap$Node<TK;TV;>;)V
    MethodParameters:
      Name  Flags
      tab   

  final java.util.HashMap$Node<K, V> untreeify(java.util.HashMap<K, V>);
    descriptor: (Ljava/util/HashMap;)Ljava/util/HashMap$Node;
    flags: (0x0010) ACC_FINAL
    Code:
      stack=3, locals=6, args_size=2
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // java.util.HashMap map
         0: .line 2006
            aconst_null
            astore 2 /* hd */
        start local 2 // java.util.HashMap$Node hd
         1: aconst_null
            astore 3 /* tl */
        start local 3 // java.util.HashMap$Node tl
         2: .line 2007
            aload 0 /* this */
            astore 4 /* q */
        start local 4 // java.util.HashMap$Node q
         3: goto 10
         4: .line 2008
      StackMap locals: java.util.HashMap$Node java.util.HashMap$Node java.util.HashMap$Node
      StackMap stack:
            aload 1 /* map */
            aload 4 /* q */
            aconst_null
            invokevirtual java.util.HashMap.replacementNode:(Ljava/util/HashMap$Node;Ljava/util/HashMap$Node;)Ljava/util/HashMap$Node;
            astore 5 /* p */
        start local 5 // java.util.HashMap$Node p
         5: .line 2009
            aload 3 /* tl */
            ifnonnull 7
         6: .line 2010
            aload 5 /* p */
            astore 2 /* hd */
            goto 8
         7: .line 2012
      StackMap locals: java.util.HashMap$Node
      StackMap stack:
            aload 3 /* tl */
            aload 5 /* p */
            putfield java.util.HashMap$Node.next:Ljava/util/HashMap$Node;
         8: .line 2013
      StackMap locals:
      StackMap stack:
            aload 5 /* p */
            astore 3 /* tl */
        end local 5 // java.util.HashMap$Node p
         9: .line 2007
            aload 4 /* q */
            getfield java.util.HashMap$Node.next:Ljava/util/HashMap$Node;
            astore 4 /* q */
      StackMap locals:
      StackMap stack:
        10: aload 4 /* q */
            ifnonnull 4
        end local 4 // java.util.HashMap$Node q
        11: .line 2015
            aload 2 /* hd */
            areturn
        end local 3 // java.util.HashMap$Node tl
        end local 2 // java.util.HashMap$Node hd
        end local 1 // java.util.HashMap map
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   12     0  this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   12     1   map  Ljava/util/HashMap<TK;TV;>;
            1   12     2    hd  Ljava/util/HashMap$Node<TK;TV;>;
            2   12     3    tl  Ljava/util/HashMap$Node<TK;TV;>;
            3   11     4     q  Ljava/util/HashMap$Node<TK;TV;>;
            5    9     5     p  Ljava/util/HashMap$Node<TK;TV;>;
    Signature: (Ljava/util/HashMap<TK;TV;>;)Ljava/util/HashMap$Node<TK;TV;>;
    MethodParameters:
      Name  Flags
      map   

  final java.util.HashMap$TreeNode<K, V> putTreeVal(java.util.HashMap<K, V>, java.util.HashMap$Node<K, V>[], int, K, V);
    descriptor: (Ljava/util/HashMap;[Ljava/util/HashMap$Node;ILjava/lang/Object;Ljava/lang/Object;)Ljava/util/HashMap$TreeNode;
    flags: (0x0010) ACC_FINAL
    Code:
      stack=5, locals=16, args_size=6
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // java.util.HashMap map
        start local 2 // java.util.HashMap$Node[] tab
        start local 3 // int h
        start local 4 // java.lang.Object k
        start local 5 // java.lang.Object v
         0: .line 2023
            aconst_null
            astore 6 /* kc */
        start local 6 // java.lang.Class kc
         1: .line 2024
            iconst_0
            istore 7 /* searched */
        start local 7 // boolean searched
         2: .line 2025
            aload 0 /* this */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            ifnull 3
            aload 0 /* this */
            invokevirtual java.util.HashMap$TreeNode.root:()Ljava/util/HashMap$TreeNode;
            goto 4
      StackMap locals: java.lang.Class int
      StackMap stack:
         3: aload 0 /* this */
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
         4: astore 8 /* root */
        start local 8 // java.util.HashMap$TreeNode root
         5: .line 2026
            aload 8 /* root */
            astore 9 /* p */
        start local 9 // java.util.HashMap$TreeNode p
         6: .line 2028
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 9 /* p */
            getfield java.util.HashMap$TreeNode.hash:I
            dup
            istore 11 /* ph */
        start local 11 // int ph
         7: iload 3 /* h */
            if_icmple 10
         8: .line 2029
            iconst_m1
            istore 10 /* dir */
        start local 10 // int dir
         9: goto 31
        end local 10 // int dir
        10: .line 2030
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int java.lang.Object java.lang.Object java.lang.Class int java.util.HashMap$TreeNode java.util.HashMap$TreeNode top int
      StackMap stack:
            iload 11 /* ph */
            iload 3 /* h */
            if_icmpge 13
        11: .line 2031
            iconst_1
            istore 10 /* dir */
        start local 10 // int dir
        12: goto 31
        end local 10 // int dir
        13: .line 2032
      StackMap locals:
      StackMap stack:
            aload 9 /* p */
            getfield java.util.HashMap$TreeNode.key:Ljava/lang/Object;
            dup
            astore 12 /* pk */
        start local 12 // java.lang.Object pk
        14: aload 4 /* k */
            if_acmpeq 15
            aload 4 /* k */
            ifnull 16
            aload 4 /* k */
            aload 12 /* pk */
            invokevirtual java.lang.Object.equals:(Ljava/lang/Object;)Z
            ifeq 16
        15: .line 2033
      StackMap locals: java.lang.Object
      StackMap stack:
            aload 9 /* p */
            areturn
        16: .line 2034
      StackMap locals:
      StackMap stack:
            aload 6 /* kc */
            ifnonnull 18
        17: .line 2035
            aload 4 /* k */
            invokestatic java.util.HashMap.comparableClassFor:(Ljava/lang/Object;)Ljava/lang/Class;
            dup
            astore 6 /* kc */
            ifnull 20
        18: .line 2036
      StackMap locals:
      StackMap stack:
            aload 6 /* kc */
            aload 4 /* k */
            aload 12 /* pk */
            invokestatic java.util.HashMap.compareComparables:(Ljava/lang/Class;Ljava/lang/Object;Ljava/lang/Object;)I
            dup
            istore 10 /* dir */
        start local 10 // int dir
        19: ifne 31
        end local 10 // int dir
        20: .line 2037
      StackMap locals:
      StackMap stack:
            iload 7 /* searched */
            ifne 30
        21: .line 2039
            iconst_1
            istore 7 /* searched */
        22: .line 2040
            aload 9 /* p */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 14 /* ch */
        start local 14 // java.util.HashMap$TreeNode ch
        23: ifnull 26
        24: .line 2041
            aload 14 /* ch */
            iload 3 /* h */
            aload 4 /* k */
            aload 6 /* kc */
            invokevirtual java.util.HashMap$TreeNode.find:(ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/HashMap$TreeNode;
            dup
            astore 13 /* q */
        start local 13 // java.util.HashMap$TreeNode q
        25: ifnonnull 29
        end local 13 // java.util.HashMap$TreeNode q
        26: .line 2042
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int java.lang.Object java.lang.Object java.lang.Class int java.util.HashMap$TreeNode java.util.HashMap$TreeNode top int java.lang.Object top java.util.HashMap$TreeNode
      StackMap stack:
            aload 9 /* p */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            dup
            astore 14 /* ch */
            ifnull 30
        27: .line 2043
            aload 14 /* ch */
            iload 3 /* h */
            aload 4 /* k */
            aload 6 /* kc */
            invokevirtual java.util.HashMap$TreeNode.find:(ILjava/lang/Object;Ljava/lang/Class;)Ljava/util/HashMap$TreeNode;
            dup
            astore 13 /* q */
        start local 13 // java.util.HashMap$TreeNode q
        28: ifnull 30
        29: .line 2044
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int java.lang.Object java.lang.Object java.lang.Class int java.util.HashMap$TreeNode java.util.HashMap$TreeNode top int java.lang.Object java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 13 /* q */
            areturn
        end local 14 // java.util.HashMap$TreeNode ch
        end local 13 // java.util.HashMap$TreeNode q
        30: .line 2046
      StackMap locals:
      StackMap stack:
            aload 4 /* k */
            aload 12 /* pk */
            invokestatic java.util.HashMap$TreeNode.tieBreakOrder:(Ljava/lang/Object;Ljava/lang/Object;)I
            istore 10 /* dir */
        end local 12 // java.lang.Object pk
        start local 10 // int dir
        31: .line 2049
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int java.lang.Object java.lang.Object java.lang.Class int java.util.HashMap$TreeNode java.util.HashMap$TreeNode int int
      StackMap stack:
            aload 9 /* p */
            astore 13 /* xp */
        start local 13 // java.util.HashMap$TreeNode xp
        32: .line 2050
            iload 10 /* dir */
            ifgt 33
            aload 9 /* p */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 34
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int java.lang.Object java.lang.Object java.lang.Class int java.util.HashMap$TreeNode java.util.HashMap$TreeNode int int top java.util.HashMap$TreeNode
      StackMap stack:
        33: aload 9 /* p */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        34: dup
            astore 9 /* p */
            ifnonnull 6
        35: .line 2051
            aload 13 /* xp */
            getfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
            astore 14 /* xpn */
        start local 14 // java.util.HashMap$Node xpn
        36: .line 2052
            aload 1 /* map */
            iload 3 /* h */
            aload 4 /* k */
            aload 5 /* v */
            aload 14 /* xpn */
            invokevirtual java.util.HashMap.newTreeNode:(ILjava/lang/Object;Ljava/lang/Object;Ljava/util/HashMap$Node;)Ljava/util/HashMap$TreeNode;
            astore 15 /* x */
        start local 15 // java.util.HashMap$TreeNode x
        37: .line 2053
            iload 10 /* dir */
            ifgt 39
        38: .line 2054
            aload 13 /* xp */
            aload 15 /* x */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 40
        39: .line 2056
      StackMap locals: java.util.HashMap$Node java.util.HashMap$TreeNode
      StackMap stack:
            aload 13 /* xp */
            aload 15 /* x */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        40: .line 2057
      StackMap locals:
      StackMap stack:
            aload 13 /* xp */
            aload 15 /* x */
            putfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
        41: .line 2058
            aload 15 /* x */
            aload 15 /* x */
            aload 13 /* xp */
            dup_x1
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        42: .line 2059
            aload 14 /* xpn */
            ifnull 44
        43: .line 2060
            aload 14 /* xpn */
            checkcast java.util.HashMap$TreeNode
            aload 15 /* x */
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
        44: .line 2061
      StackMap locals:
      StackMap stack:
            aload 2 /* tab */
            aload 8 /* root */
            aload 15 /* x */
            invokestatic java.util.HashMap$TreeNode.balanceInsertion:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            invokestatic java.util.HashMap$TreeNode.moveRootToFront:([Ljava/util/HashMap$Node;Ljava/util/HashMap$TreeNode;)V
        45: .line 2062
            aconst_null
            areturn
        end local 15 // java.util.HashMap$TreeNode x
        end local 14 // java.util.HashMap$Node xpn
        end local 13 // java.util.HashMap$TreeNode xp
        end local 11 // int ph
        end local 10 // int dir
        end local 9 // java.util.HashMap$TreeNode p
        end local 8 // java.util.HashMap$TreeNode root
        end local 7 // boolean searched
        end local 6 // java.lang.Class kc
        end local 5 // java.lang.Object v
        end local 4 // java.lang.Object k
        end local 3 // int h
        end local 2 // java.util.HashMap$Node[] tab
        end local 1 // java.util.HashMap map
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot      Name  Signature
            0   46     0      this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   46     1       map  Ljava/util/HashMap<TK;TV;>;
            0   46     2       tab  [Ljava/util/HashMap$Node;
            0   46     3         h  I
            0   46     4         k  TK;
            0   46     5         v  TV;
            1   46     6        kc  Ljava/lang/Class<*>;
            2   46     7  searched  Z
            5   46     8      root  Ljava/util/HashMap$TreeNode<TK;TV;>;
            6   46     9         p  Ljava/util/HashMap$TreeNode<TK;TV;>;
            9   10    10       dir  I
           12   13    10       dir  I
           19   20    10       dir  I
           31   46    10       dir  I
            7   46    11        ph  I
           14   31    12        pk  TK;
           25   26    13         q  Ljava/util/HashMap$TreeNode<TK;TV;>;
           28   30    13         q  Ljava/util/HashMap$TreeNode<TK;TV;>;
           23   30    14        ch  Ljava/util/HashMap$TreeNode<TK;TV;>;
           32   46    13        xp  Ljava/util/HashMap$TreeNode<TK;TV;>;
           36   46    14       xpn  Ljava/util/HashMap$Node<TK;TV;>;
           37   46    15         x  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: (Ljava/util/HashMap<TK;TV;>;[Ljava/util/HashMap$Node<TK;TV;>;ITK;TV;)Ljava/util/HashMap$TreeNode<TK;TV;>;
    MethodParameters:
      Name  Flags
      map   
      tab   
      h     
      k     
      v     

  final void removeTreeNode(java.util.HashMap<K, V>, java.util.HashMap$Node<K, V>[], );
    descriptor: (Ljava/util/HashMap;[Ljava/util/HashMap$Node;Z)V
    flags: (0x0010) ACC_FINAL
    Code:
      stack=5, locals=21, args_size=4
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // java.util.HashMap map
        start local 2 // java.util.HashMap$Node[] tab
        start local 3 // boolean movable
         0: .line 2080
            aload 2 /* tab */
            ifnull 2
            aload 2 /* tab */
            arraylength
            dup
            istore 4 /* n */
        start local 4 // int n
         1: ifne 3
        end local 4 // int n
         2: .line 2081
      StackMap locals:
      StackMap stack:
            return
        start local 4 // int n
         3: .line 2082
      StackMap locals: int
      StackMap stack:
            iload 4 /* n */
            iconst_1
            isub
            aload 0 /* this */
            getfield java.util.HashMap$TreeNode.hash:I
            iand
            istore 5 /* index */
        start local 5 // int index
         4: .line 2083
            aload 2 /* tab */
            iload 5 /* index */
            aaload
            checkcast java.util.HashMap$TreeNode
            astore 6 /* first */
        start local 6 // java.util.HashMap$TreeNode first
         5: aload 6 /* first */
            astore 7 /* root */
        start local 7 // java.util.HashMap$TreeNode root
         6: .line 2084
            aload 0 /* this */
            getfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
            checkcast java.util.HashMap$TreeNode
            astore 9 /* succ */
        start local 9 // java.util.HashMap$TreeNode succ
         7: aload 0 /* this */
            getfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
            astore 10 /* pred */
        start local 10 // java.util.HashMap$TreeNode pred
         8: .line 2085
            aload 10 /* pred */
            ifnonnull 10
         9: .line 2086
            aload 2 /* tab */
            iload 5 /* index */
            aload 9 /* succ */
            dup
            astore 6 /* first */
            aastore
            goto 11
        10: .line 2088
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int int int java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 10 /* pred */
            aload 9 /* succ */
            putfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
        11: .line 2089
      StackMap locals:
      StackMap stack:
            aload 9 /* succ */
            ifnull 13
        12: .line 2090
            aload 9 /* succ */
            aload 10 /* pred */
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
        13: .line 2091
      StackMap locals:
      StackMap stack:
            aload 6 /* first */
            ifnonnull 15
        14: .line 2092
            return
        15: .line 2093
      StackMap locals:
      StackMap stack:
            aload 7 /* root */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            ifnull 17
        16: .line 2094
            aload 7 /* root */
            invokevirtual java.util.HashMap$TreeNode.root:()Ljava/util/HashMap$TreeNode;
            astore 7 /* root */
        17: .line 2095
      StackMap locals:
      StackMap stack:
            aload 7 /* root */
            ifnull 23
        18: .line 2096
            iload 3 /* movable */
            ifeq 25
        19: .line 2097
            aload 7 /* root */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            ifnull 23
        20: .line 2098
            aload 7 /* root */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 8 /* rl */
        start local 8 // java.util.HashMap$TreeNode rl
        21: ifnull 23
        22: .line 2099
            aload 8 /* rl */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            ifnonnull 25
        end local 8 // java.util.HashMap$TreeNode rl
        23: .line 2100
      StackMap locals:
      StackMap stack:
            aload 2 /* tab */
            iload 5 /* index */
            aload 6 /* first */
            aload 1 /* map */
            invokevirtual java.util.HashMap$TreeNode.untreeify:(Ljava/util/HashMap;)Ljava/util/HashMap$Node;
            aastore
        24: .line 2101
            return
        25: .line 2103
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            astore 11 /* p */
        start local 11 // java.util.HashMap$TreeNode p
        26: aload 0 /* this */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            astore 12 /* pl */
        start local 12 // java.util.HashMap$TreeNode pl
        27: aload 0 /* this */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            astore 13 /* pr */
        start local 13 // java.util.HashMap$TreeNode pr
        28: .line 2104
            aload 12 /* pl */
            ifnull 64
            aload 13 /* pr */
            ifnull 64
        29: .line 2105
            aload 13 /* pr */
            astore 15 /* s */
        start local 15 // java.util.HashMap$TreeNode s
        30: .line 2106
            goto 32
        start local 16 // java.util.HashMap$TreeNode sl
        31: .line 2107
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int int int java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 16 /* sl */
            astore 15 /* s */
        end local 16 // java.util.HashMap$TreeNode sl
        32: .line 2106
      StackMap locals:
      StackMap stack:
            aload 15 /* s */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 16 /* sl */
        start local 16 // java.util.HashMap$TreeNode sl
        33: ifnonnull 31
        34: .line 2108
            aload 15 /* s */
            getfield java.util.HashMap$TreeNode.red:Z
            istore 17 /* c */
        start local 17 // boolean c
        35: aload 15 /* s */
            aload 11 /* p */
            getfield java.util.HashMap$TreeNode.red:Z
            putfield java.util.HashMap$TreeNode.red:Z
            aload 11 /* p */
            iload 17 /* c */
            putfield java.util.HashMap$TreeNode.red:Z
        36: .line 2109
            aload 15 /* s */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            astore 18 /* sr */
        start local 18 // java.util.HashMap$TreeNode sr
        37: .line 2110
            aload 11 /* p */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            astore 19 /* pp */
        start local 19 // java.util.HashMap$TreeNode pp
        38: .line 2111
            aload 15 /* s */
            aload 13 /* pr */
            if_acmpne 42
        39: .line 2112
            aload 11 /* p */
            aload 15 /* s */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        40: .line 2113
            aload 15 /* s */
            aload 11 /* p */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        41: .line 2114
            goto 49
        42: .line 2116
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int int int java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode int java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 15 /* s */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            astore 20 /* sp */
        start local 20 // java.util.HashMap$TreeNode sp
        43: .line 2117
            aload 11 /* p */
            aload 20 /* sp */
            dup_x1
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            ifnull 47
        44: .line 2118
            aload 15 /* s */
            aload 20 /* sp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            if_acmpne 46
        45: .line 2119
            aload 20 /* sp */
            aload 11 /* p */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 47
        46: .line 2121
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 20 /* sp */
            aload 11 /* p */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        47: .line 2123
      StackMap locals:
      StackMap stack:
            aload 15 /* s */
            aload 13 /* pr */
            dup_x1
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            ifnull 49
        48: .line 2124
            aload 13 /* pr */
            aload 15 /* s */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        end local 20 // java.util.HashMap$TreeNode sp
        49: .line 2126
      StackMap locals:
      StackMap stack:
            aload 11 /* p */
            aconst_null
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
        50: .line 2127
            aload 11 /* p */
            aload 18 /* sr */
            dup_x1
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            ifnull 52
        51: .line 2128
            aload 18 /* sr */
            aload 11 /* p */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        52: .line 2129
      StackMap locals:
      StackMap stack:
            aload 15 /* s */
            aload 12 /* pl */
            dup_x1
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            ifnull 54
        53: .line 2130
            aload 12 /* pl */
            aload 15 /* s */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        54: .line 2131
      StackMap locals:
      StackMap stack:
            aload 15 /* s */
            aload 19 /* pp */
            dup_x1
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            ifnonnull 56
        55: .line 2132
            aload 15 /* s */
            astore 7 /* root */
            goto 59
        56: .line 2133
      StackMap locals:
      StackMap stack:
            aload 11 /* p */
            aload 19 /* pp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            if_acmpne 58
        57: .line 2134
            aload 19 /* pp */
            aload 15 /* s */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 59
        58: .line 2136
      StackMap locals:
      StackMap stack:
            aload 19 /* pp */
            aload 15 /* s */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        59: .line 2137
      StackMap locals:
      StackMap stack:
            aload 18 /* sr */
            ifnull 62
        60: .line 2138
            aload 18 /* sr */
            astore 14 /* replacement */
        start local 14 // java.util.HashMap$TreeNode replacement
        61: goto 71
        end local 14 // java.util.HashMap$TreeNode replacement
        62: .line 2140
      StackMap locals:
      StackMap stack:
            aload 11 /* p */
            astore 14 /* replacement */
        end local 19 // java.util.HashMap$TreeNode pp
        end local 18 // java.util.HashMap$TreeNode sr
        end local 17 // boolean c
        end local 16 // java.util.HashMap$TreeNode sl
        end local 15 // java.util.HashMap$TreeNode s
        start local 14 // java.util.HashMap$TreeNode replacement
        63: .line 2141
            goto 71
        end local 14 // java.util.HashMap$TreeNode replacement
        64: .line 2142
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int int int java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 12 /* pl */
            ifnull 67
        65: .line 2143
            aload 12 /* pl */
            astore 14 /* replacement */
        start local 14 // java.util.HashMap$TreeNode replacement
        66: goto 71
        end local 14 // java.util.HashMap$TreeNode replacement
        67: .line 2144
      StackMap locals:
      StackMap stack:
            aload 13 /* pr */
            ifnull 70
        68: .line 2145
            aload 13 /* pr */
            astore 14 /* replacement */
        start local 14 // java.util.HashMap$TreeNode replacement
        69: goto 71
        end local 14 // java.util.HashMap$TreeNode replacement
        70: .line 2147
      StackMap locals:
      StackMap stack:
            aload 11 /* p */
            astore 14 /* replacement */
        start local 14 // java.util.HashMap$TreeNode replacement
        71: .line 2148
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 14 /* replacement */
            aload 11 /* p */
            if_acmpeq 79
        72: .line 2149
            aload 14 /* replacement */
            aload 11 /* p */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup_x1
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            astore 15 /* pp */
        start local 15 // java.util.HashMap$TreeNode pp
        73: .line 2150
            aload 15 /* pp */
            ifnonnull 75
        74: .line 2151
            aload 14 /* replacement */
            dup
            astore 7 /* root */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
            goto 78
        75: .line 2152
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 11 /* p */
            aload 15 /* pp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            if_acmpne 77
        76: .line 2153
            aload 15 /* pp */
            aload 14 /* replacement */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 78
        77: .line 2155
      StackMap locals:
      StackMap stack:
            aload 15 /* pp */
            aload 14 /* replacement */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        78: .line 2156
      StackMap locals:
      StackMap stack:
            aload 11 /* p */
            aload 11 /* p */
            aload 11 /* p */
            aconst_null
            dup_x1
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup_x1
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
        end local 15 // java.util.HashMap$TreeNode pp
        79: .line 2159
      StackMap locals:
      StackMap stack:
            aload 11 /* p */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 80
            aload 7 /* root */
            goto 81
      StackMap locals:
      StackMap stack:
        80: aload 7 /* root */
            aload 14 /* replacement */
            invokestatic java.util.HashMap$TreeNode.balanceDeletion:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        81: astore 15 /* r */
        start local 15 // java.util.HashMap$TreeNode r
        82: .line 2161
            aload 14 /* replacement */
            aload 11 /* p */
            if_acmpne 90
        83: .line 2162
            aload 11 /* p */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            astore 16 /* pp */
        start local 16 // java.util.HashMap$TreeNode pp
        84: .line 2163
            aload 11 /* p */
            aconst_null
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        85: .line 2164
            aload 16 /* pp */
            ifnull 90
        86: .line 2165
            aload 11 /* p */
            aload 16 /* pp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            if_acmpne 88
        87: .line 2166
            aload 16 /* pp */
            aconst_null
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 90
        88: .line 2167
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 11 /* p */
            aload 16 /* pp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            if_acmpne 90
        89: .line 2168
            aload 16 /* pp */
            aconst_null
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        end local 16 // java.util.HashMap$TreeNode pp
        90: .line 2171
      StackMap locals:
      StackMap stack:
            iload 3 /* movable */
            ifeq 92
        91: .line 2172
            aload 2 /* tab */
            aload 15 /* r */
            invokestatic java.util.HashMap$TreeNode.moveRootToFront:([Ljava/util/HashMap$Node;Ljava/util/HashMap$TreeNode;)V
        92: .line 2173
      StackMap locals:
      StackMap stack:
            return
        end local 15 // java.util.HashMap$TreeNode r
        end local 14 // java.util.HashMap$TreeNode replacement
        end local 13 // java.util.HashMap$TreeNode pr
        end local 12 // java.util.HashMap$TreeNode pl
        end local 11 // java.util.HashMap$TreeNode p
        end local 10 // java.util.HashMap$TreeNode pred
        end local 9 // java.util.HashMap$TreeNode succ
        end local 7 // java.util.HashMap$TreeNode root
        end local 6 // java.util.HashMap$TreeNode first
        end local 5 // int index
        end local 4 // int n
        end local 3 // boolean movable
        end local 2 // java.util.HashMap$Node[] tab
        end local 1 // java.util.HashMap map
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot         Name  Signature
            0   93     0         this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   93     1          map  Ljava/util/HashMap<TK;TV;>;
            0   93     2          tab  [Ljava/util/HashMap$Node;
            0   93     3      movable  Z
            1    2     4            n  I
            3   93     4            n  I
            4   93     5        index  I
            5   93     6        first  Ljava/util/HashMap$TreeNode<TK;TV;>;
            6   93     7         root  Ljava/util/HashMap$TreeNode<TK;TV;>;
           21   23     8           rl  Ljava/util/HashMap$TreeNode<TK;TV;>;
            7   93     9         succ  Ljava/util/HashMap$TreeNode<TK;TV;>;
            8   93    10         pred  Ljava/util/HashMap$TreeNode<TK;TV;>;
           26   93    11            p  Ljava/util/HashMap$TreeNode<TK;TV;>;
           27   93    12           pl  Ljava/util/HashMap$TreeNode<TK;TV;>;
           28   93    13           pr  Ljava/util/HashMap$TreeNode<TK;TV;>;
           61   62    14  replacement  Ljava/util/HashMap$TreeNode<TK;TV;>;
           63   64    14  replacement  Ljava/util/HashMap$TreeNode<TK;TV;>;
           66   67    14  replacement  Ljava/util/HashMap$TreeNode<TK;TV;>;
           69   70    14  replacement  Ljava/util/HashMap$TreeNode<TK;TV;>;
           71   93    14  replacement  Ljava/util/HashMap$TreeNode<TK;TV;>;
           30   63    15            s  Ljava/util/HashMap$TreeNode<TK;TV;>;
           31   32    16           sl  Ljava/util/HashMap$TreeNode<TK;TV;>;
           33   63    16           sl  Ljava/util/HashMap$TreeNode<TK;TV;>;
           35   63    17            c  Z
           37   63    18           sr  Ljava/util/HashMap$TreeNode<TK;TV;>;
           38   63    19           pp  Ljava/util/HashMap$TreeNode<TK;TV;>;
           43   49    20           sp  Ljava/util/HashMap$TreeNode<TK;TV;>;
           73   79    15           pp  Ljava/util/HashMap$TreeNode<TK;TV;>;
           82   93    15            r  Ljava/util/HashMap$TreeNode<TK;TV;>;
           84   90    16           pp  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: (Ljava/util/HashMap<TK;TV;>;[Ljava/util/HashMap$Node<TK;TV;>;Z)V
    MethodParameters:
         Name  Flags
      map      
      tab      
      movable  

  final void split(java.util.HashMap<K, V>, java.util.HashMap$Node<K, V>[], int, );
    descriptor: (Ljava/util/HashMap;[Ljava/util/HashMap$Node;II)V
    flags: (0x0010) ACC_FINAL
    Code:
      stack=4, locals=14, args_size=5
        start local 0 // java.util.HashMap$TreeNode this
        start local 1 // java.util.HashMap map
        start local 2 // java.util.HashMap$Node[] tab
        start local 3 // int index
        start local 4 // int bit
         0: .line 2186
            aload 0 /* this */
            astore 5 /* b */
        start local 5 // java.util.HashMap$TreeNode b
         1: .line 2188
            aconst_null
            astore 6 /* loHead */
        start local 6 // java.util.HashMap$TreeNode loHead
         2: aconst_null
            astore 7 /* loTail */
        start local 7 // java.util.HashMap$TreeNode loTail
         3: .line 2189
            aconst_null
            astore 8 /* hiHead */
        start local 8 // java.util.HashMap$TreeNode hiHead
         4: aconst_null
            astore 9 /* hiTail */
        start local 9 // java.util.HashMap$TreeNode hiTail
         5: .line 2190
            iconst_0
            istore 10 /* lc */
        start local 10 // int lc
         6: iconst_0
            istore 11 /* hc */
        start local 11 // int hc
         7: .line 2191
            aload 5 /* b */
            astore 12 /* e */
        start local 12 // java.util.HashMap$TreeNode e
         8: goto 24
         9: .line 2192
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap java.util.HashMap$Node[] int int java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode int int java.util.HashMap$TreeNode
      StackMap stack:
            aload 12 /* e */
            getfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
            checkcast java.util.HashMap$TreeNode
            astore 13 /* next */
        start local 13 // java.util.HashMap$TreeNode next
        10: .line 2193
            aload 12 /* e */
            aconst_null
            putfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
        11: .line 2194
            aload 12 /* e */
            getfield java.util.HashMap$TreeNode.hash:I
            iload 4 /* bit */
            iand
            ifne 18
        12: .line 2195
            aload 12 /* e */
            aload 7 /* loTail */
            dup_x1
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
            ifnonnull 14
        13: .line 2196
            aload 12 /* e */
            astore 6 /* loHead */
            goto 15
        14: .line 2198
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 7 /* loTail */
            aload 12 /* e */
            putfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
        15: .line 2199
      StackMap locals:
      StackMap stack:
            aload 12 /* e */
            astore 7 /* loTail */
        16: .line 2200
            iinc 10 /* lc */ 1
        17: .line 2201
            goto 23
        18: .line 2203
      StackMap locals:
      StackMap stack:
            aload 12 /* e */
            aload 9 /* hiTail */
            dup_x1
            putfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
            ifnonnull 20
        19: .line 2204
            aload 12 /* e */
            astore 8 /* hiHead */
            goto 21
        20: .line 2206
      StackMap locals:
      StackMap stack:
            aload 9 /* hiTail */
            aload 12 /* e */
            putfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
        21: .line 2207
      StackMap locals:
      StackMap stack:
            aload 12 /* e */
            astore 9 /* hiTail */
        22: .line 2208
            iinc 11 /* hc */ 1
        23: .line 2191
      StackMap locals:
      StackMap stack:
            aload 13 /* next */
            astore 12 /* e */
        end local 13 // java.util.HashMap$TreeNode next
      StackMap locals:
      StackMap stack:
        24: aload 12 /* e */
            ifnonnull 9
        end local 12 // java.util.HashMap$TreeNode e
        25: .line 2212
            aload 6 /* loHead */
            ifnull 31
        26: .line 2213
            iload 10 /* lc */
            bipush 6
            if_icmpgt 28
        27: .line 2214
            aload 2 /* tab */
            iload 3 /* index */
            aload 6 /* loHead */
            aload 1 /* map */
            invokevirtual java.util.HashMap$TreeNode.untreeify:(Ljava/util/HashMap;)Ljava/util/HashMap$Node;
            aastore
            goto 31
        28: .line 2216
      StackMap locals:
      StackMap stack:
            aload 2 /* tab */
            iload 3 /* index */
            aload 6 /* loHead */
            aastore
        29: .line 2217
            aload 8 /* hiHead */
            ifnull 31
        30: .line 2218
            aload 6 /* loHead */
            aload 2 /* tab */
            invokevirtual java.util.HashMap$TreeNode.treeify:([Ljava/util/HashMap$Node;)V
        31: .line 2221
      StackMap locals:
      StackMap stack:
            aload 8 /* hiHead */
            ifnull 37
        32: .line 2222
            iload 11 /* hc */
            bipush 6
            if_icmpgt 34
        33: .line 2223
            aload 2 /* tab */
            iload 3 /* index */
            iload 4 /* bit */
            iadd
            aload 8 /* hiHead */
            aload 1 /* map */
            invokevirtual java.util.HashMap$TreeNode.untreeify:(Ljava/util/HashMap;)Ljava/util/HashMap$Node;
            aastore
            goto 37
        34: .line 2225
      StackMap locals:
      StackMap stack:
            aload 2 /* tab */
            iload 3 /* index */
            iload 4 /* bit */
            iadd
            aload 8 /* hiHead */
            aastore
        35: .line 2226
            aload 6 /* loHead */
            ifnull 37
        36: .line 2227
            aload 8 /* hiHead */
            aload 2 /* tab */
            invokevirtual java.util.HashMap$TreeNode.treeify:([Ljava/util/HashMap$Node;)V
        37: .line 2230
      StackMap locals:
      StackMap stack:
            return
        end local 11 // int hc
        end local 10 // int lc
        end local 9 // java.util.HashMap$TreeNode hiTail
        end local 8 // java.util.HashMap$TreeNode hiHead
        end local 7 // java.util.HashMap$TreeNode loTail
        end local 6 // java.util.HashMap$TreeNode loHead
        end local 5 // java.util.HashMap$TreeNode b
        end local 4 // int bit
        end local 3 // int index
        end local 2 // java.util.HashMap$Node[] tab
        end local 1 // java.util.HashMap map
        end local 0 // java.util.HashMap$TreeNode this
      LocalVariableTable:
        Start  End  Slot    Name  Signature
            0   38     0    this  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   38     1     map  Ljava/util/HashMap<TK;TV;>;
            0   38     2     tab  [Ljava/util/HashMap$Node;
            0   38     3   index  I
            0   38     4     bit  I
            1   38     5       b  Ljava/util/HashMap$TreeNode<TK;TV;>;
            2   38     6  loHead  Ljava/util/HashMap$TreeNode<TK;TV;>;
            3   38     7  loTail  Ljava/util/HashMap$TreeNode<TK;TV;>;
            4   38     8  hiHead  Ljava/util/HashMap$TreeNode<TK;TV;>;
            5   38     9  hiTail  Ljava/util/HashMap$TreeNode<TK;TV;>;
            6   38    10      lc  I
            7   38    11      hc  I
            8   25    12       e  Ljava/util/HashMap$TreeNode<TK;TV;>;
           10   24    13    next  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: (Ljava/util/HashMap<TK;TV;>;[Ljava/util/HashMap$Node<TK;TV;>;II)V
    MethodParameters:
       Name  Flags
      map    
      tab    
      index  
      bit    

  static <K, V> java.util.HashMap$TreeNode<K, V> rotateLeft(java.util.HashMap$TreeNode<K, V>, java.util.HashMap$TreeNode<K, V>);
    descriptor: (Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
    flags: (0x0008) ACC_STATIC
    Code:
      stack=3, locals=5, args_size=2
        start local 0 // java.util.HashMap$TreeNode root
        start local 1 // java.util.HashMap$TreeNode p
         0: .line 2238
            aload 1 /* p */
            ifnull 13
            aload 1 /* p */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* r */
        start local 2 // java.util.HashMap$TreeNode r
         1: ifnull 13
         2: .line 2239
            aload 1 /* p */
            aload 2 /* r */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup_x1
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            dup
            astore 4 /* rl */
        start local 4 // java.util.HashMap$TreeNode rl
         3: ifnull 5
         4: .line 2240
            aload 4 /* rl */
            aload 1 /* p */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
         5: .line 2241
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode
      StackMap stack:
            aload 2 /* r */
            aload 1 /* p */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup_x1
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 3 /* pp */
        start local 3 // java.util.HashMap$TreeNode pp
         6: ifnonnull 8
         7: .line 2242
            aload 2 /* r */
            dup
            astore 0 /* root */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
            goto 11
         8: .line 2243
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 3 /* pp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            aload 1 /* p */
            if_acmpne 10
         9: .line 2244
            aload 3 /* pp */
            aload 2 /* r */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            goto 11
        10: .line 2246
      StackMap locals:
      StackMap stack:
            aload 3 /* pp */
            aload 2 /* r */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        11: .line 2247
      StackMap locals:
      StackMap stack:
            aload 2 /* r */
            aload 1 /* p */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
        12: .line 2248
            aload 1 /* p */
            aload 2 /* r */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        end local 4 // java.util.HashMap$TreeNode rl
        end local 3 // java.util.HashMap$TreeNode pp
        end local 2 // java.util.HashMap$TreeNode r
        13: .line 2250
      StackMap locals:
      StackMap stack:
            aload 0 /* root */
            areturn
        end local 1 // java.util.HashMap$TreeNode p
        end local 0 // java.util.HashMap$TreeNode root
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   14     0  root  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   14     1     p  Ljava/util/HashMap$TreeNode<TK;TV;>;
            1   13     2     r  Ljava/util/HashMap$TreeNode<TK;TV;>;
            6   13     3    pp  Ljava/util/HashMap$TreeNode<TK;TV;>;
            3   13     4    rl  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/HashMap$TreeNode<TK;TV;>;Ljava/util/HashMap$TreeNode<TK;TV;>;)Ljava/util/HashMap$TreeNode<TK;TV;>;
    MethodParameters:
      Name  Flags
      root  
      p     

  static <K, V> java.util.HashMap$TreeNode<K, V> rotateRight(java.util.HashMap$TreeNode<K, V>, java.util.HashMap$TreeNode<K, V>);
    descriptor: (Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
    flags: (0x0008) ACC_STATIC
    Code:
      stack=3, locals=5, args_size=2
        start local 0 // java.util.HashMap$TreeNode root
        start local 1 // java.util.HashMap$TreeNode p
         0: .line 2256
            aload 1 /* p */
            ifnull 13
            aload 1 /* p */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* l */
        start local 2 // java.util.HashMap$TreeNode l
         1: ifnull 13
         2: .line 2257
            aload 1 /* p */
            aload 2 /* l */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            dup_x1
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 4 /* lr */
        start local 4 // java.util.HashMap$TreeNode lr
         3: ifnull 5
         4: .line 2258
            aload 4 /* lr */
            aload 1 /* p */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
         5: .line 2259
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode
      StackMap stack:
            aload 2 /* l */
            aload 1 /* p */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup_x1
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 3 /* pp */
        start local 3 // java.util.HashMap$TreeNode pp
         6: ifnonnull 8
         7: .line 2260
            aload 2 /* l */
            dup
            astore 0 /* root */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
            goto 11
         8: .line 2261
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 3 /* pp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            aload 1 /* p */
            if_acmpne 10
         9: .line 2262
            aload 3 /* pp */
            aload 2 /* l */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            goto 11
        10: .line 2264
      StackMap locals:
      StackMap stack:
            aload 3 /* pp */
            aload 2 /* l */
            putfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
        11: .line 2265
      StackMap locals:
      StackMap stack:
            aload 2 /* l */
            aload 1 /* p */
            putfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        12: .line 2266
            aload 1 /* p */
            aload 2 /* l */
            putfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
        end local 4 // java.util.HashMap$TreeNode lr
        end local 3 // java.util.HashMap$TreeNode pp
        end local 2 // java.util.HashMap$TreeNode l
        13: .line 2268
      StackMap locals:
      StackMap stack:
            aload 0 /* root */
            areturn
        end local 1 // java.util.HashMap$TreeNode p
        end local 0 // java.util.HashMap$TreeNode root
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   14     0  root  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   14     1     p  Ljava/util/HashMap$TreeNode<TK;TV;>;
            1   13     2     l  Ljava/util/HashMap$TreeNode<TK;TV;>;
            6   13     3    pp  Ljava/util/HashMap$TreeNode<TK;TV;>;
            3   13     4    lr  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/HashMap$TreeNode<TK;TV;>;Ljava/util/HashMap$TreeNode<TK;TV;>;)Ljava/util/HashMap$TreeNode<TK;TV;>;
    MethodParameters:
      Name  Flags
      root  
      p     

  static <K, V> java.util.HashMap$TreeNode<K, V> balanceInsertion(java.util.HashMap$TreeNode<K, V>, java.util.HashMap$TreeNode<K, V>);
    descriptor: (Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
    flags: (0x0008) ACC_STATIC
    Code:
      stack=3, locals=6, args_size=2
        start local 0 // java.util.HashMap$TreeNode root
        start local 1 // java.util.HashMap$TreeNode x
         0: .line 2273
            aload 1 /* x */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
         1: .line 2275
      StackMap locals:
      StackMap stack:
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
        start local 2 // java.util.HashMap$TreeNode xp
         2: ifnonnull 5
         3: .line 2276
            aload 1 /* x */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
         4: .line 2277
            aload 1 /* x */
            areturn
         5: .line 2279
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 7
            aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 3 /* xpp */
        start local 3 // java.util.HashMap$TreeNode xpp
         6: ifnonnull 8
        end local 3 // java.util.HashMap$TreeNode xpp
         7: .line 2280
      StackMap locals:
      StackMap stack:
            aload 0 /* root */
            areturn
        start local 3 // java.util.HashMap$TreeNode xpp
         8: .line 2281
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 2 /* xp */
            aload 3 /* xpp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 4 /* xppl */
        start local 4 // java.util.HashMap$TreeNode xppl
         9: if_acmpne 28
        10: .line 2282
            aload 3 /* xpp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            dup
            astore 5 /* xppr */
        start local 5 // java.util.HashMap$TreeNode xppr
        11: ifnull 17
            aload 5 /* xppr */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 17
        12: .line 2283
            aload 5 /* xppr */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        13: .line 2284
            aload 2 /* xp */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        14: .line 2285
            aload 3 /* xpp */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        15: .line 2286
            aload 3 /* xpp */
            astore 1 /* x */
        16: .line 2287
            goto 1
        17: .line 2289
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 1 /* x */
            aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            if_acmpne 22
        18: .line 2290
            aload 0 /* root */
            aload 2 /* xp */
            dup
            astore 1 /* x */
            invokestatic java.util.HashMap$TreeNode.rotateLeft:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        19: .line 2291
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
            ifnonnull 20
            aconst_null
            goto 21
      StackMap locals:
      StackMap stack:
        20: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        21: astore 3 /* xpp */
        22: .line 2293
      StackMap locals:
      StackMap stack:
            aload 2 /* xp */
            ifnull 1
        23: .line 2294
            aload 2 /* xp */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        24: .line 2295
            aload 3 /* xpp */
            ifnull 1
        25: .line 2296
            aload 3 /* xpp */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        26: .line 2297
            aload 0 /* root */
            aload 3 /* xpp */
            invokestatic java.util.HashMap$TreeNode.rotateRight:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        27: .line 2301
            goto 1
        end local 5 // java.util.HashMap$TreeNode xppr
        28: .line 2303
      StackMap locals:
      StackMap stack:
            aload 4 /* xppl */
            ifnull 34
            aload 4 /* xppl */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 34
        29: .line 2304
            aload 4 /* xppl */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        30: .line 2305
            aload 2 /* xp */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        31: .line 2306
            aload 3 /* xpp */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        32: .line 2307
            aload 3 /* xpp */
            astore 1 /* x */
        33: .line 2308
            goto 1
        34: .line 2310
      StackMap locals:
      StackMap stack:
            aload 1 /* x */
            aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            if_acmpne 39
        35: .line 2311
            aload 0 /* root */
            aload 2 /* xp */
            dup
            astore 1 /* x */
            invokestatic java.util.HashMap$TreeNode.rotateRight:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        36: .line 2312
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
            ifnonnull 37
            aconst_null
            goto 38
      StackMap locals:
      StackMap stack:
        37: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        38: astore 3 /* xpp */
        39: .line 2314
      StackMap locals:
      StackMap stack:
            aload 2 /* xp */
            ifnull 1
        40: .line 2315
            aload 2 /* xp */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        41: .line 2316
            aload 3 /* xpp */
            ifnull 1
        42: .line 2317
            aload 3 /* xpp */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        43: .line 2318
            aload 0 /* root */
            aload 3 /* xpp */
            invokestatic java.util.HashMap$TreeNode.rotateLeft:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        end local 4 // java.util.HashMap$TreeNode xppl
        end local 3 // java.util.HashMap$TreeNode xpp
        end local 2 // java.util.HashMap$TreeNode xp
        44: .line 2274
            goto 1
        end local 1 // java.util.HashMap$TreeNode x
        end local 0 // java.util.HashMap$TreeNode root
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   45     0  root  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   45     1     x  Ljava/util/HashMap$TreeNode<TK;TV;>;
            2   44     2    xp  Ljava/util/HashMap$TreeNode<TK;TV;>;
            6    7     3   xpp  Ljava/util/HashMap$TreeNode<TK;TV;>;
            8   44     3   xpp  Ljava/util/HashMap$TreeNode<TK;TV;>;
            9   44     4  xppl  Ljava/util/HashMap$TreeNode<TK;TV;>;
           11   28     5  xppr  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/HashMap$TreeNode<TK;TV;>;Ljava/util/HashMap$TreeNode<TK;TV;>;)Ljava/util/HashMap$TreeNode<TK;TV;>;
    MethodParameters:
      Name  Flags
      root  
      x     

  static <K, V> java.util.HashMap$TreeNode<K, V> balanceDeletion(java.util.HashMap$TreeNode<K, V>, java.util.HashMap$TreeNode<K, V>);
    descriptor: (Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
    flags: (0x0008) ACC_STATIC
    Code:
      stack=2, locals=7, args_size=2
        start local 0 // java.util.HashMap$TreeNode root
        start local 1 // java.util.HashMap$TreeNode x
         0: .line 2329
      StackMap locals:
      StackMap stack:
            aload 1 /* x */
            ifnull 1
            aload 1 /* x */
            aload 0 /* root */
            if_acmpne 2
         1: .line 2330
      StackMap locals:
      StackMap stack:
            aload 0 /* root */
            areturn
         2: .line 2331
      StackMap locals:
      StackMap stack:
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
        start local 2 // java.util.HashMap$TreeNode xp
         3: ifnonnull 6
         4: .line 2332
            aload 1 /* x */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
         5: .line 2333
            aload 1 /* x */
            areturn
         6: .line 2335
      StackMap locals: java.util.HashMap$TreeNode
      StackMap stack:
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 9
         7: .line 2336
            aload 1 /* x */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
         8: .line 2337
            aload 0 /* root */
            areturn
         9: .line 2339
      StackMap locals:
      StackMap stack:
            aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 3 /* xpl */
        start local 3 // java.util.HashMap$TreeNode xpl
        10: aload 1 /* x */
            if_acmpne 48
        11: .line 2340
            aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            dup
            astore 4 /* xpr */
        start local 4 // java.util.HashMap$TreeNode xpr
        12: ifnull 19
            aload 4 /* xpr */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 19
        13: .line 2341
            aload 4 /* xpr */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        14: .line 2342
            aload 2 /* xp */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        15: .line 2343
            aload 0 /* root */
            aload 2 /* xp */
            invokestatic java.util.HashMap$TreeNode.rotateLeft:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        16: .line 2344
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
            ifnonnull 17
            aconst_null
            goto 18
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
        17: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        18: astore 4 /* xpr */
        19: .line 2346
      StackMap locals:
      StackMap stack:
            aload 4 /* xpr */
            ifnonnull 21
        20: .line 2347
            aload 2 /* xp */
            astore 1 /* x */
            goto 0
        21: .line 2349
      StackMap locals:
      StackMap stack:
            aload 4 /* xpr */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            astore 5 /* sl */
        start local 5 // java.util.HashMap$TreeNode sl
        22: aload 4 /* xpr */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            astore 6 /* sr */
        start local 6 // java.util.HashMap$TreeNode sr
        23: .line 2350
            aload 6 /* sr */
            ifnull 24
            aload 6 /* sr */
            getfield java.util.HashMap$TreeNode.red:Z
            ifne 28
        24: .line 2351
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 5 /* sl */
            ifnull 25
            aload 5 /* sl */
            getfield java.util.HashMap$TreeNode.red:Z
            ifne 28
        25: .line 2352
      StackMap locals:
      StackMap stack:
            aload 4 /* xpr */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        26: .line 2353
            aload 2 /* xp */
            astore 1 /* x */
        27: .line 2354
            goto 0
        28: .line 2356
      StackMap locals:
      StackMap stack:
            aload 6 /* sr */
            ifnull 29
            aload 6 /* sr */
            getfield java.util.HashMap$TreeNode.red:Z
            ifne 37
        29: .line 2357
      StackMap locals:
      StackMap stack:
            aload 5 /* sl */
            ifnull 31
        30: .line 2358
            aload 5 /* sl */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        31: .line 2359
      StackMap locals:
      StackMap stack:
            aload 4 /* xpr */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        32: .line 2360
            aload 0 /* root */
            aload 4 /* xpr */
            invokestatic java.util.HashMap$TreeNode.rotateRight:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        33: .line 2361
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
            ifnonnull 35
        34: .line 2362
            aconst_null
            goto 36
      StackMap locals:
      StackMap stack:
        35: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
        36: .line 2361
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
            astore 4 /* xpr */
        37: .line 2364
      StackMap locals:
      StackMap stack:
            aload 4 /* xpr */
            ifnull 43
        38: .line 2365
            aload 4 /* xpr */
            aload 2 /* xp */
            ifnonnull 39
            iconst_0
            goto 40
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        39: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.red:Z
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack: java.util.HashMap$TreeNode int
        40: putfield java.util.HashMap$TreeNode.red:Z
        41: .line 2366
            aload 4 /* xpr */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            dup
            astore 6 /* sr */
            ifnull 43
        42: .line 2367
            aload 6 /* sr */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        43: .line 2369
      StackMap locals:
      StackMap stack:
            aload 2 /* xp */
            ifnull 46
        44: .line 2370
            aload 2 /* xp */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        45: .line 2371
            aload 0 /* root */
            aload 2 /* xp */
            invokestatic java.util.HashMap$TreeNode.rotateLeft:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        46: .line 2373
      StackMap locals:
      StackMap stack:
            aload 0 /* root */
            astore 1 /* x */
        end local 6 // java.util.HashMap$TreeNode sr
        end local 5 // java.util.HashMap$TreeNode sl
        47: .line 2376
            goto 0
        end local 4 // java.util.HashMap$TreeNode xpr
        48: .line 2378
      StackMap locals:
      StackMap stack:
            aload 3 /* xpl */
            ifnull 55
            aload 3 /* xpl */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 55
        49: .line 2379
            aload 3 /* xpl */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        50: .line 2380
            aload 2 /* xp */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        51: .line 2381
            aload 0 /* root */
            aload 2 /* xp */
            invokestatic java.util.HashMap$TreeNode.rotateRight:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        52: .line 2382
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
            ifnonnull 53
            aconst_null
            goto 54
      StackMap locals:
      StackMap stack:
        53: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        54: astore 3 /* xpl */
        55: .line 2384
      StackMap locals:
      StackMap stack:
            aload 3 /* xpl */
            ifnonnull 57
        56: .line 2385
            aload 2 /* xp */
            astore 1 /* x */
            goto 0
        57: .line 2387
      StackMap locals:
      StackMap stack:
            aload 3 /* xpl */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            astore 5 /* sl */
        start local 5 // java.util.HashMap$TreeNode sl
        58: aload 3 /* xpl */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            astore 6 /* sr */
        start local 6 // java.util.HashMap$TreeNode sr
        59: .line 2388
            aload 5 /* sl */
            ifnull 60
            aload 5 /* sl */
            getfield java.util.HashMap$TreeNode.red:Z
            ifne 64
        60: .line 2389
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 6 /* sr */
            ifnull 61
            aload 6 /* sr */
            getfield java.util.HashMap$TreeNode.red:Z
            ifne 64
        61: .line 2390
      StackMap locals:
      StackMap stack:
            aload 3 /* xpl */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        62: .line 2391
            aload 2 /* xp */
            astore 1 /* x */
        63: .line 2392
            goto 0
        64: .line 2394
      StackMap locals:
      StackMap stack:
            aload 5 /* sl */
            ifnull 65
            aload 5 /* sl */
            getfield java.util.HashMap$TreeNode.red:Z
            ifne 73
        65: .line 2395
      StackMap locals:
      StackMap stack:
            aload 6 /* sr */
            ifnull 67
        66: .line 2396
            aload 6 /* sr */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        67: .line 2397
      StackMap locals:
      StackMap stack:
            aload 3 /* xpl */
            iconst_1
            putfield java.util.HashMap$TreeNode.red:Z
        68: .line 2398
            aload 0 /* root */
            aload 3 /* xpl */
            invokestatic java.util.HashMap$TreeNode.rotateLeft:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        69: .line 2399
            aload 1 /* x */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            dup
            astore 2 /* xp */
            ifnonnull 71
        70: .line 2400
            aconst_null
            goto 72
      StackMap locals:
      StackMap stack:
        71: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
        72: .line 2399
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
            astore 3 /* xpl */
        73: .line 2402
      StackMap locals:
      StackMap stack:
            aload 3 /* xpl */
            ifnull 79
        74: .line 2403
            aload 3 /* xpl */
            aload 2 /* xp */
            ifnonnull 75
            iconst_0
            goto 76
      StackMap locals:
      StackMap stack: java.util.HashMap$TreeNode
        75: aload 2 /* xp */
            getfield java.util.HashMap$TreeNode.red:Z
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode top java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack: java.util.HashMap$TreeNode int
        76: putfield java.util.HashMap$TreeNode.red:Z
        77: .line 2404
            aload 3 /* xpl */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            dup
            astore 5 /* sl */
            ifnull 79
        78: .line 2405
            aload 5 /* sl */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        79: .line 2407
      StackMap locals:
      StackMap stack:
            aload 2 /* xp */
            ifnull 82
        80: .line 2408
            aload 2 /* xp */
            iconst_0
            putfield java.util.HashMap$TreeNode.red:Z
        81: .line 2409
            aload 0 /* root */
            aload 2 /* xp */
            invokestatic java.util.HashMap$TreeNode.rotateRight:(Ljava/util/HashMap$TreeNode;Ljava/util/HashMap$TreeNode;)Ljava/util/HashMap$TreeNode;
            astore 0 /* root */
        82: .line 2411
      StackMap locals:
      StackMap stack:
            aload 0 /* root */
            astore 1 /* x */
        end local 6 // java.util.HashMap$TreeNode sr
        end local 5 // java.util.HashMap$TreeNode sl
        end local 3 // java.util.HashMap$TreeNode xpl
        end local 2 // java.util.HashMap$TreeNode xp
        83: .line 2328
            goto 0
        end local 1 // java.util.HashMap$TreeNode x
        end local 0 // java.util.HashMap$TreeNode root
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   84     0  root  Ljava/util/HashMap$TreeNode<TK;TV;>;
            0   84     1     x  Ljava/util/HashMap$TreeNode<TK;TV;>;
            3   83     2    xp  Ljava/util/HashMap$TreeNode<TK;TV;>;
           10   83     3   xpl  Ljava/util/HashMap$TreeNode<TK;TV;>;
           12   48     4   xpr  Ljava/util/HashMap$TreeNode<TK;TV;>;
           22   47     5    sl  Ljava/util/HashMap$TreeNode<TK;TV;>;
           23   47     6    sr  Ljava/util/HashMap$TreeNode<TK;TV;>;
           58   83     5    sl  Ljava/util/HashMap$TreeNode<TK;TV;>;
           59   83     6    sr  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/HashMap$TreeNode<TK;TV;>;Ljava/util/HashMap$TreeNode<TK;TV;>;)Ljava/util/HashMap$TreeNode<TK;TV;>;
    MethodParameters:
      Name  Flags
      root  
      x     

  static <K, V> boolean checkInvariants(java.util.HashMap$TreeNode<K, V>);
    descriptor: (Ljava/util/HashMap$TreeNode;)Z
    flags: (0x0008) ACC_STATIC
    Code:
      stack=2, locals=6, args_size=1
        start local 0 // java.util.HashMap$TreeNode t
         0: .line 2422
            aload 0 /* t */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            astore 1 /* tp */
        start local 1 // java.util.HashMap$TreeNode tp
         1: aload 0 /* t */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            astore 2 /* tl */
        start local 2 // java.util.HashMap$TreeNode tl
         2: aload 0 /* t */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            astore 3 /* tr */
        start local 3 // java.util.HashMap$TreeNode tr
         3: .line 2423
            aload 0 /* t */
            getfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
            astore 4 /* tb */
        start local 4 // java.util.HashMap$TreeNode tb
         4: aload 0 /* t */
            getfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
            checkcast java.util.HashMap$TreeNode
            astore 5 /* tn */
        start local 5 // java.util.HashMap$TreeNode tn
         5: .line 2424
            aload 4 /* tb */
            ifnull 7
            aload 4 /* tb */
            getfield java.util.HashMap$TreeNode.next:Ljava/util/HashMap$Node;
            aload 0 /* t */
            if_acmpeq 7
         6: .line 2425
            iconst_0
            ireturn
         7: .line 2426
      StackMap locals: java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode java.util.HashMap$TreeNode
      StackMap stack:
            aload 5 /* tn */
            ifnull 9
            aload 5 /* tn */
            getfield java.util.HashMap$TreeNode.prev:Ljava/util/HashMap$TreeNode;
            aload 0 /* t */
            if_acmpeq 9
         8: .line 2427
            iconst_0
            ireturn
         9: .line 2428
      StackMap locals:
      StackMap stack:
            aload 1 /* tp */
            ifnull 11
            aload 0 /* t */
            aload 1 /* tp */
            getfield java.util.HashMap$TreeNode.left:Ljava/util/HashMap$TreeNode;
            if_acmpeq 11
            aload 0 /* t */
            aload 1 /* tp */
            getfield java.util.HashMap$TreeNode.right:Ljava/util/HashMap$TreeNode;
            if_acmpeq 11
        10: .line 2429
            iconst_0
            ireturn
        11: .line 2430
      StackMap locals:
      StackMap stack:
            aload 2 /* tl */
            ifnull 13
            aload 2 /* tl */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            aload 0 /* t */
            if_acmpne 12
            aload 2 /* tl */
            getfield java.util.HashMap$TreeNode.hash:I
            aload 0 /* t */
            getfield java.util.HashMap$TreeNode.hash:I
            if_icmple 13
        12: .line 2431
      StackMap locals:
      StackMap stack:
            iconst_0
            ireturn
        13: .line 2432
      StackMap locals:
      StackMap stack:
            aload 3 /* tr */
            ifnull 15
            aload 3 /* tr */
            getfield java.util.HashMap$TreeNode.parent:Ljava/util/HashMap$TreeNode;
            aload 0 /* t */
            if_acmpne 14
            aload 3 /* tr */
            getfield java.util.HashMap$TreeNode.hash:I
            aload 0 /* t */
            getfield java.util.HashMap$TreeNode.hash:I
            if_icmpge 15
        14: .line 2433
      StackMap locals:
      StackMap stack:
            iconst_0
            ireturn
        15: .line 2434
      StackMap locals:
      StackMap stack:
            aload 0 /* t */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 17
            aload 2 /* tl */
            ifnull 17
            aload 2 /* tl */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 17
            aload 3 /* tr */
            ifnull 17
            aload 3 /* tr */
            getfield java.util.HashMap$TreeNode.red:Z
            ifeq 17
        16: .line 2435
            iconst_0
            ireturn
        17: .line 2436
      StackMap locals:
      StackMap stack:
            aload 2 /* tl */
            ifnull 19
            aload 2 /* tl */
            invokestatic java.util.HashMap$TreeNode.checkInvariants:(Ljava/util/HashMap$TreeNode;)Z
            ifne 19
        18: .line 2437
            iconst_0
            ireturn
        19: .line 2438
      StackMap locals:
      StackMap stack:
            aload 3 /* tr */
            ifnull 21
            aload 3 /* tr */
            invokestatic java.util.HashMap$TreeNode.checkInvariants:(Ljava/util/HashMap$TreeNode;)Z
            ifne 21
        20: .line 2439
            iconst_0
            ireturn
        21: .line 2440
      StackMap locals:
      StackMap stack:
            iconst_1
            ireturn
        end local 5 // java.util.HashMap$TreeNode tn
        end local 4 // java.util.HashMap$TreeNode tb
        end local 3 // java.util.HashMap$TreeNode tr
        end local 2 // java.util.HashMap$TreeNode tl
        end local 1 // java.util.HashMap$TreeNode tp
        end local 0 // java.util.HashMap$TreeNode t
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0   22     0     t  Ljava/util/HashMap$TreeNode<TK;TV;>;
            1   22     1    tp  Ljava/util/HashMap$TreeNode<TK;TV;>;
            2   22     2    tl  Ljava/util/HashMap$TreeNode<TK;TV;>;
            3   22     3    tr  Ljava/util/HashMap$TreeNode<TK;TV;>;
            4   22     4    tb  Ljava/util/HashMap$TreeNode<TK;TV;>;
            5   22     5    tn  Ljava/util/HashMap$TreeNode<TK;TV;>;
    Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/HashMap$TreeNode<TK;TV;>;)Z
    MethodParameters:
      Name  Flags
      t     
}
Signature: <K:Ljava/lang/Object;V:Ljava/lang/Object;>Ljava/util/LinkedHashMap$Entry<TK;TV;>;
SourceFile: "HashMap.java"
NestHost: java.util.HashMap
InnerClasses:
  Node = java.util.HashMap$Node of java.util.HashMap
  final TreeNode = java.util.HashMap$TreeNode of java.util.HashMap
  Entry = java.util.LinkedHashMap$Entry of java.util.LinkedHashMap