https://github.com/google/guava/guava: Guava is a suite of core and expanded libraries that include utility classes, google's collections, io classes, and much much more. 
final class com.google.common.graph.DirectedGraphConnections<N, V> implements com.google.common.graph.GraphConnections<N, V>
  minor version: 0
  major version: 59
  flags: flags: (0x0030) ACC_FINAL, ACC_SUPER
  this_class: com.google.common.graph.DirectedGraphConnections
  super_class: java.lang.Object
{
  private static final java.lang.Object PRED;
    descriptor: Ljava/lang/Object;
    flags: (0x001a) ACC_PRIVATE, ACC_STATIC, ACC_FINAL

  private final java.util.Map<N, java.lang.Object> adjacentNodeValues;
    descriptor: Ljava/util/Map;
    flags: (0x0012) ACC_PRIVATE, ACC_FINAL
    Signature: Ljava/util/Map<TN;Ljava/lang/Object;>;

  private int predecessorCount;
    descriptor: I
    flags: (0x0002) ACC_PRIVATE

  private int successorCount;
    descriptor: I
    flags: (0x0002) ACC_PRIVATE

  static void <clinit>();
    descriptor: ()V
    flags: (0x0008) ACC_STATIC
    Code:
      stack=2, locals=0, args_size=0
         0: .line 58
            new java.lang.Object
            dup
            invokespecial java.lang.Object.<init>:()V
            putstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            return
      LocalVariableTable:
        Start  End  Slot  Name  Signature

  private void <init>(java.util.Map<N, java.lang.Object>, int, );
    descriptor: (Ljava/util/Map;II)V
    flags: (0x0002) ACC_PRIVATE
    Code:
      stack=2, locals=4, args_size=4
        start local 0 // com.google.common.graph.DirectedGraphConnections this
        start local 1 // java.util.Map adjacentNodeValues
        start local 2 // int predecessorCount
        start local 3 // int successorCount
         0: .line 67
            aload 0 /* this */
            invokespecial java.lang.Object.<init>:()V
         1: .line 69
            aload 0 /* this */
            aload 1 /* adjacentNodeValues */
            invokestatic com.google.common.base.Preconditions.checkNotNull:(Ljava/lang/Object;)Ljava/lang/Object;
            checkcast java.util.Map
            putfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
         2: .line 70
            aload 0 /* this */
            iload 2 /* predecessorCount */
            invokestatic com.google.common.graph.Graphs.checkNonNegative:(I)I
            putfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
         3: .line 71
            aload 0 /* this */
            iload 3 /* successorCount */
            invokestatic com.google.common.graph.Graphs.checkNonNegative:(I)I
            putfield com.google.common.graph.DirectedGraphConnections.successorCount:I
         4: .line 73
            iload 2 /* predecessorCount */
            aload 1 /* adjacentNodeValues */
            invokeinterface java.util.Map.size:()I
            if_icmpgt 6
         5: .line 74
            iload 3 /* successorCount */
            aload 1 /* adjacentNodeValues */
            invokeinterface java.util.Map.size:()I
            if_icmpgt 6
            iconst_1
            goto 7
      StackMap locals: com.google.common.graph.DirectedGraphConnections java.util.Map int int
      StackMap stack:
         6: iconst_0
         7: .line 72
      StackMap locals:
      StackMap stack: int
            invokestatic com.google.common.base.Preconditions.checkState:(Z)V
         8: .line 75
            return
        end local 3 // int successorCount
        end local 2 // int predecessorCount
        end local 1 // java.util.Map adjacentNodeValues
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot                Name  Signature
            0    9     0                this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
            0    9     1  adjacentNodeValues  Ljava/util/Map<TN;Ljava/lang/Object;>;
            0    9     2    predecessorCount  I
            0    9     3      successorCount  I
    Signature: (Ljava/util/Map<TN;Ljava/lang/Object;>;II)V
    MethodParameters:
                    Name  Flags
      adjacentNodeValues  
      predecessorCount    
      successorCount      

  static <N, V> com.google.common.graph.DirectedGraphConnections<N, V> of();
    descriptor: ()Lcom/google/common/graph/DirectedGraphConnections;
    flags: (0x0008) ACC_STATIC
    Code:
      stack=6, locals=1, args_size=0
         0: .line 79
            iconst_4
            istore 0 /* initialCapacity */
        start local 0 // int initialCapacity
         1: .line 80
            new com.google.common.graph.DirectedGraphConnections
            dup
         2: .line 81
            new java.util.HashMap
            dup
            iload 0 /* initialCapacity */
            fconst_1
            invokespecial java.util.HashMap.<init>:(IF)V
            iconst_0
            iconst_0
         3: .line 80
            invokespecial com.google.common.graph.DirectedGraphConnections.<init>:(Ljava/util/Map;II)V
            areturn
        end local 0 // int initialCapacity
      LocalVariableTable:
        Start  End  Slot             Name  Signature
            1    4     0  initialCapacity  I
    Signature: <N:Ljava/lang/Object;V:Ljava/lang/Object;>()Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;

  static <N, V> com.google.common.graph.DirectedGraphConnections<N, V> ofImmutable(java.util.Set<N>, java.util.Map<N, V>);
    descriptor: (Ljava/util/Set;Ljava/util/Map;)Lcom/google/common/graph/DirectedGraphConnections;
    flags: (0x0008) ACC_STATIC
    Code:
      stack=5, locals=6, args_size=2
        start local 0 // java.util.Set predecessors
        start local 1 // java.util.Map successorValues
         0: .line 86
            new java.util.HashMap
            dup
            invokespecial java.util.HashMap.<init>:()V
            astore 2 /* adjacentNodeValues */
        start local 2 // java.util.Map adjacentNodeValues
         1: .line 87
            aload 2 /* adjacentNodeValues */
            aload 1 /* successorValues */
            invokeinterface java.util.Map.putAll:(Ljava/util/Map;)V
         2: .line 88
            aload 0 /* predecessors */
            invokeinterface java.util.Set.iterator:()Ljava/util/Iterator;
            astore 4
            goto 7
      StackMap locals: java.util.Set java.util.Map java.util.Map top java.util.Iterator
      StackMap stack:
         3: aload 4
            invokeinterface java.util.Iterator.next:()Ljava/lang/Object;
            checkcast java.lang.Object
            astore 3 /* predecessor */
        start local 3 // java.lang.Object predecessor
         4: .line 89
            aload 2 /* adjacentNodeValues */
            aload 3 /* predecessor */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            astore 5 /* value */
        start local 5 // java.lang.Object value
         5: .line 90
            aload 5 /* value */
            ifnull 7
         6: .line 91
            aload 2 /* adjacentNodeValues */
            aload 3 /* predecessor */
            new com.google.common.graph.DirectedGraphConnections$PredAndSucc
            dup
            aload 5 /* value */
            invokespecial com.google.common.graph.DirectedGraphConnections$PredAndSucc.<init>:(Ljava/lang/Object;)V
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
        end local 5 // java.lang.Object value
        end local 3 // java.lang.Object predecessor
         7: .line 88
      StackMap locals:
      StackMap stack:
            aload 4
            invokeinterface java.util.Iterator.hasNext:()Z
            ifne 3
         8: .line 94
            new com.google.common.graph.DirectedGraphConnections
            dup
         9: .line 95
            aload 2 /* adjacentNodeValues */
            invokestatic com.google.common.collect.ImmutableMap.copyOf:(Ljava/util/Map;)Lcom/google/common/collect/ImmutableMap;
            aload 0 /* predecessors */
            invokeinterface java.util.Set.size:()I
            aload 1 /* successorValues */
            invokeinterface java.util.Map.size:()I
        10: .line 94
            invokespecial com.google.common.graph.DirectedGraphConnections.<init>:(Ljava/util/Map;II)V
            areturn
        end local 2 // java.util.Map adjacentNodeValues
        end local 1 // java.util.Map successorValues
        end local 0 // java.util.Set predecessors
      LocalVariableTable:
        Start  End  Slot                Name  Signature
            0   11     0        predecessors  Ljava/util/Set<TN;>;
            0   11     1     successorValues  Ljava/util/Map<TN;TV;>;
            1   11     2  adjacentNodeValues  Ljava/util/Map<TN;Ljava/lang/Object;>;
            4    7     3         predecessor  TN;
            5    7     5               value  Ljava/lang/Object;
    Signature: <N:Ljava/lang/Object;V:Ljava/lang/Object;>(Ljava/util/Set<TN;>;Ljava/util/Map<TN;TV;>;)Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
    MethodParameters:
                 Name  Flags
      predecessors     
      successorValues  

  public java.util.Set<N> adjacentNodes();
    descriptor: ()Ljava/util/Set;
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=1, locals=1, args_size=1
        start local 0 // com.google.common.graph.DirectedGraphConnections this
         0: .line 100
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            invokeinterface java.util.Map.keySet:()Ljava/util/Set;
            invokestatic java.util.Collections.unmodifiableSet:(Ljava/util/Set;)Ljava/util/Set;
            areturn
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
    Signature: ()Ljava/util/Set<TN;>;

  public java.util.Set<N> predecessors();
    descriptor: ()Ljava/util/Set;
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=3, locals=1, args_size=1
        start local 0 // com.google.common.graph.DirectedGraphConnections this
         0: .line 105
            new com.google.common.graph.DirectedGraphConnections$1
            dup
            aload 0 /* this */
            invokespecial com.google.common.graph.DirectedGraphConnections$1.<init>:(Lcom/google/common/graph/DirectedGraphConnections;)V
            areturn
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
    Signature: ()Ljava/util/Set<TN;>;

  public java.util.Set<N> successors();
    descriptor: ()Ljava/util/Set;
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=3, locals=1, args_size=1
        start local 0 // com.google.common.graph.DirectedGraphConnections this
         0: .line 137
            new com.google.common.graph.DirectedGraphConnections$2
            dup
            aload 0 /* this */
            invokespecial com.google.common.graph.DirectedGraphConnections$2.<init>:(Lcom/google/common/graph/DirectedGraphConnections;)V
            areturn
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot  Name  Signature
            0    1     0  this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
    Signature: ()Ljava/util/Set<TN;>;

  public V value();
    descriptor: (Ljava/lang/Object;)Ljava/lang/Object;
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=2, locals=3, args_size=2
        start local 0 // com.google.common.graph.DirectedGraphConnections this
        start local 1 // java.lang.Object node
         0: .line 170
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            invokeinterface java.util.Map.get:(Ljava/lang/Object;)Ljava/lang/Object;
            astore 2 /* value */
        start local 2 // java.lang.Object value
         1: .line 171
            aload 2 /* value */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            if_acmpne 3
         2: .line 172
            aconst_null
            areturn
         3: .line 174
      StackMap locals: java.lang.Object
      StackMap stack:
            aload 2 /* value */
            instanceof com.google.common.graph.DirectedGraphConnections$PredAndSucc
            ifeq 5
         4: .line 175
            aload 2 /* value */
            checkcast com.google.common.graph.DirectedGraphConnections$PredAndSucc
            getfield com.google.common.graph.DirectedGraphConnections$PredAndSucc.successorValue:Ljava/lang/Object;
            areturn
         5: .line 177
      StackMap locals:
      StackMap stack:
            aload 2 /* value */
            areturn
        end local 2 // java.lang.Object value
        end local 1 // java.lang.Object node
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    6     0   this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
            0    6     1   node  TN;
            1    6     2  value  Ljava/lang/Object;
    Signature: (TN;)TV;
    MethodParameters:
      Name  Flags
      node  

  public void removePredecessor();
    descriptor: (Ljava/lang/Object;)V
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=3, locals=3, args_size=2
        start local 0 // com.google.common.graph.DirectedGraphConnections this
        start local 1 // java.lang.Object node
         0: .line 183
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            invokeinterface java.util.Map.get:(Ljava/lang/Object;)Ljava/lang/Object;
            astore 2 /* previousValue */
        start local 2 // java.lang.Object previousValue
         1: .line 184
            aload 2 /* previousValue */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            if_acmpne 5
         2: .line 185
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            invokeinterface java.util.Map.remove:(Ljava/lang/Object;)Ljava/lang/Object;
            pop
         3: .line 186
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            iconst_1
            isub
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            invokestatic com.google.common.graph.Graphs.checkNonNegative:(I)I
            pop
         4: .line 187
            goto 8
      StackMap locals: java.lang.Object
      StackMap stack:
         5: aload 2 /* previousValue */
            instanceof com.google.common.graph.DirectedGraphConnections$PredAndSucc
            ifeq 8
         6: .line 188
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            aload 2 /* previousValue */
            checkcast com.google.common.graph.DirectedGraphConnections$PredAndSucc
            getfield com.google.common.graph.DirectedGraphConnections$PredAndSucc.successorValue:Ljava/lang/Object;
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
         7: .line 189
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            iconst_1
            isub
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            invokestatic com.google.common.graph.Graphs.checkNonNegative:(I)I
            pop
         8: .line 191
      StackMap locals:
      StackMap stack:
            return
        end local 2 // java.lang.Object previousValue
        end local 1 // java.lang.Object node
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot           Name  Signature
            0    9     0           this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
            0    9     1           node  TN;
            1    9     2  previousValue  Ljava/lang/Object;
    Signature: (TN;)V
    MethodParameters:
      Name  Flags
      node  

  public V removeSuccessor();
    descriptor: (Ljava/lang/Object;)Ljava/lang/Object;
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=3, locals=3, args_size=2
        start local 0 // com.google.common.graph.DirectedGraphConnections this
        start local 1 // java.lang.Object node
         0: .line 196
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            invokeinterface java.util.Map.get:(Ljava/lang/Object;)Ljava/lang/Object;
            astore 2 /* previousValue */
        start local 2 // java.lang.Object previousValue
         1: .line 197
            aload 2 /* previousValue */
            ifnull 2
            aload 2 /* previousValue */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            if_acmpne 3
         2: .line 198
      StackMap locals: java.lang.Object
      StackMap stack:
            aconst_null
            areturn
         3: .line 199
      StackMap locals:
      StackMap stack:
            aload 2 /* previousValue */
            instanceof com.google.common.graph.DirectedGraphConnections$PredAndSucc
            ifeq 7
         4: .line 200
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
         5: .line 201
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            iconst_1
            isub
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            invokestatic com.google.common.graph.Graphs.checkNonNegative:(I)I
            pop
         6: .line 202
            aload 2 /* previousValue */
            checkcast com.google.common.graph.DirectedGraphConnections$PredAndSucc
            getfield com.google.common.graph.DirectedGraphConnections$PredAndSucc.successorValue:Ljava/lang/Object;
            areturn
         7: .line 204
      StackMap locals:
      StackMap stack:
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            invokeinterface java.util.Map.remove:(Ljava/lang/Object;)Ljava/lang/Object;
            pop
         8: .line 205
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            iconst_1
            isub
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            invokestatic com.google.common.graph.Graphs.checkNonNegative:(I)I
            pop
         9: .line 206
            aload 2 /* previousValue */
            areturn
        end local 2 // java.lang.Object previousValue
        end local 1 // java.lang.Object node
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot           Name  Signature
            0   10     0           this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
            0   10     1           node  Ljava/lang/Object;
            1   10     2  previousValue  Ljava/lang/Object;
    Signature: (Ljava/lang/Object;)TV;
    MethodParameters:
      Name  Flags
      node  

  public void addPredecessor(N, );
    descriptor: (Ljava/lang/Object;Ljava/lang/Object;)V
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=5, locals=4, args_size=3
        start local 0 // com.google.common.graph.DirectedGraphConnections this
        start local 1 // java.lang.Object node
        start local 2 // java.lang.Object unused
         0: .line 212
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            astore 3 /* previousValue */
        start local 3 // java.lang.Object previousValue
         1: .line 213
            aload 3 /* previousValue */
            ifnonnull 4
         2: .line 214
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            iconst_1
            iadd
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            invokestatic com.google.common.graph.Graphs.checkPositive:(I)I
            pop
         3: .line 215
            goto 10
      StackMap locals: java.lang.Object
      StackMap stack:
         4: aload 3 /* previousValue */
            instanceof com.google.common.graph.DirectedGraphConnections$PredAndSucc
            ifeq 7
         5: .line 217
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            aload 3 /* previousValue */
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
         6: .line 218
            goto 10
      StackMap locals:
      StackMap stack:
         7: aload 3 /* previousValue */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            if_acmpeq 10
         8: .line 220
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            new com.google.common.graph.DirectedGraphConnections$PredAndSucc
            dup
            aload 3 /* previousValue */
            invokespecial com.google.common.graph.DirectedGraphConnections$PredAndSucc.<init>:(Ljava/lang/Object;)V
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
         9: .line 221
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            iconst_1
            iadd
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.predecessorCount:I
            invokestatic com.google.common.graph.Graphs.checkPositive:(I)I
            pop
        10: .line 223
      StackMap locals:
      StackMap stack:
            return
        end local 3 // java.lang.Object previousValue
        end local 2 // java.lang.Object unused
        end local 1 // java.lang.Object node
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot           Name  Signature
            0   11     0           this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
            0   11     1           node  TN;
            0   11     2         unused  TV;
            1   11     3  previousValue  Ljava/lang/Object;
    Signature: (TN;TV;)V
    MethodParameters:
        Name  Flags
      node    
      unused  

  public V addSuccessor(N, );
    descriptor: (Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
    flags: (0x0001) ACC_PUBLIC
    Code:
      stack=5, locals=4, args_size=3
        start local 0 // com.google.common.graph.DirectedGraphConnections this
        start local 1 // java.lang.Object node
        start local 2 // java.lang.Object value
         0: .line 228
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            aload 2 /* value */
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            astore 3 /* previousValue */
        start local 3 // java.lang.Object previousValue
         1: .line 229
            aload 3 /* previousValue */
            ifnonnull 4
         2: .line 230
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            iconst_1
            iadd
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            invokestatic com.google.common.graph.Graphs.checkPositive:(I)I
            pop
         3: .line 231
            aconst_null
            areturn
         4: .line 232
      StackMap locals: java.lang.Object
      StackMap stack:
            aload 3 /* previousValue */
            instanceof com.google.common.graph.DirectedGraphConnections$PredAndSucc
            ifeq 7
         5: .line 233
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            new com.google.common.graph.DirectedGraphConnections$PredAndSucc
            dup
            aload 2 /* value */
            invokespecial com.google.common.graph.DirectedGraphConnections$PredAndSucc.<init>:(Ljava/lang/Object;)V
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
         6: .line 234
            aload 3 /* previousValue */
            checkcast com.google.common.graph.DirectedGraphConnections$PredAndSucc
            getfield com.google.common.graph.DirectedGraphConnections$PredAndSucc.successorValue:Ljava/lang/Object;
            areturn
         7: .line 235
      StackMap locals:
      StackMap stack:
            aload 3 /* previousValue */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            if_acmpne 11
         8: .line 236
            aload 0 /* this */
            getfield com.google.common.graph.DirectedGraphConnections.adjacentNodeValues:Ljava/util/Map;
            aload 1 /* node */
            new com.google.common.graph.DirectedGraphConnections$PredAndSucc
            dup
            aload 2 /* value */
            invokespecial com.google.common.graph.DirectedGraphConnections$PredAndSucc.<init>:(Ljava/lang/Object;)V
            invokeinterface java.util.Map.put:(Ljava/lang/Object;Ljava/lang/Object;)Ljava/lang/Object;
            pop
         9: .line 237
            aload 0 /* this */
            dup
            getfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            iconst_1
            iadd
            dup_x1
            putfield com.google.common.graph.DirectedGraphConnections.successorCount:I
            invokestatic com.google.common.graph.Graphs.checkPositive:(I)I
            pop
        10: .line 238
            aconst_null
            areturn
        11: .line 240
      StackMap locals:
      StackMap stack:
            aload 3 /* previousValue */
            areturn
        end local 3 // java.lang.Object previousValue
        end local 2 // java.lang.Object value
        end local 1 // java.lang.Object node
        end local 0 // com.google.common.graph.DirectedGraphConnections this
      LocalVariableTable:
        Start  End  Slot           Name  Signature
            0   12     0           this  Lcom/google/common/graph/DirectedGraphConnections<TN;TV;>;
            0   12     1           node  TN;
            0   12     2          value  TV;
            1   12     3  previousValue  Ljava/lang/Object;
    Signature: (TN;TV;)TV;
    MethodParameters:
       Name  Flags
      node   
      value  

  private static boolean isPredecessor(java.lang.Object);
    descriptor: (Ljava/lang/Object;)Z
    flags: (0x000a) ACC_PRIVATE, ACC_STATIC
    Code:
      stack=2, locals=1, args_size=1
        start local 0 // java.lang.Object value
         0: .line 245
            aload 0 /* value */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            if_acmpeq 1
            aload 0 /* value */
            instanceof com.google.common.graph.DirectedGraphConnections$PredAndSucc
            ifne 1
            iconst_0
            ireturn
      StackMap locals:
      StackMap stack:
         1: iconst_1
            ireturn
        end local 0 // java.lang.Object value
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    2     0  value  Ljava/lang/Object;
    RuntimeVisibleTypeAnnotations: 
      METHOD_FORMAL_PARAMETER
        org.checkerframework.checker.nullness.qual.Nullable()
    MethodParameters:
       Name  Flags
      value  

  private static boolean isSuccessor(java.lang.Object);
    descriptor: (Ljava/lang/Object;)Z
    flags: (0x000a) ACC_PRIVATE, ACC_STATIC
    Code:
      stack=2, locals=1, args_size=1
        start local 0 // java.lang.Object value
         0: .line 249
            aload 0 /* value */
            getstatic com.google.common.graph.DirectedGraphConnections.PRED:Ljava/lang/Object;
            if_acmpeq 1
            aload 0 /* value */
            ifnull 1
            iconst_1
            ireturn
      StackMap locals:
      StackMap stack:
         1: iconst_0
            ireturn
        end local 0 // java.lang.Object value
      LocalVariableTable:
        Start  End  Slot   Name  Signature
            0    2     0  value  Ljava/lang/Object;
    RuntimeVisibleTypeAnnotations: 
      METHOD_FORMAL_PARAMETER
        org.checkerframework.checker.nullness.qual.Nullable()
    MethodParameters:
       Name  Flags
      value  
}
Signature: <N:Ljava/lang/Object;V:Ljava/lang/Object;>Ljava/lang/Object;Lcom/google/common/graph/GraphConnections<TN;TV;>;
SourceFile: "DirectedGraphConnections.java"
NestMembers:
  com.google.common.graph.DirectedGraphConnections$1  com.google.common.graph.DirectedGraphConnections$1$1  com.google.common.graph.DirectedGraphConnections$2  com.google.common.graph.DirectedGraphConnections$2$1  com.google.common.graph.DirectedGraphConnections$PredAndSucc
InnerClasses:
  com.google.common.graph.DirectedGraphConnections$1
  com.google.common.graph.DirectedGraphConnections$2
  private final PredAndSucc = com.google.common.graph.DirectedGraphConnections$PredAndSucc of com.google.common.graph.DirectedGraphConnections